subject:(Complexity testing)

University of Illinois – Urbana-Champaign

1. Bloom, David J. Sensory discrimination testing methodology selection based on beverage complexity.

Degree: PhD, Food Science & Human Nutrition, 2015, University of Illinois – Urbana-Champaign

► Sensory discrimination testing is a vital tool used by sensory professionals within the food industry. While many testing methods are available for selection, various methods… (more)

▼ Sensory discrimination testing is a vital tool used by sensory professionals within the food industry. While many testing methods are available for selection, various methods have proven to differ in power. By utilizing a more powerful method, sensory professionals can limit the resources needed for testing and increase their ability to find significant differences between products. The inherent variability of food and beverage systems in addition to multidimensional changes often made during reformulation of food products can make the task of method selection challenging. The goal of this study was to determine the optimal sensory discrimination methodologies for use with multidimensional beverage systems with confusable difference comparison. Complex beverage systems with product variations relevant to actual testing within the food industry were utilized to compare experimental results to those expected from theoretical modeling predictions. The findings from this study led to the exploration of Researcher-Designated and Panelist-Articulated specific discrimination methods to determine which procedure resulted in greater power for use in comparison of complex beverage systems. Once a more powerful specific testing procedure was established, it was then used in product comparisons with non-specific methods to determine how the degree of difference between samples influenced complex beverage systems in one-dimensional or multidimensional formulation changes. A model beverage system was created which could be altered in formulation to create multidimensional changes between samples and alter d’. The model beverage was utilized to study the impact of sample dimensionality and d’ for both specified and non-specified methods. Differences in the proportion of correct response, method power, and overdispersion were observed between methods when tested with the model beverage system. The findings from these studies emphasize the need for sensory professional to look beyond the categorization of methods by specified versus non-specified. Findings suggest methods should instead be fit to the range of d’ and multidimensional makeup relevant to the samples used in testing. Advisors/Committee Members: Lee, Soo-Yeun (advisor), Schmidt, Shelly J (Committee Chair), Lee, Youngsoo (committee member), Miller, Michael J (committee member), Baik, Hwa-Young (committee member).

Subjects/Keywords: Discrimination Testing; Statistical Power; Beverages; Complexity; Dimensionality

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bloom, D. J. (2015). Sensory discrimination testing methodology selection based on beverage complexity. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/89180

Chicago Manual of Style (16^th Edition):

Bloom, David J. “Sensory discrimination testing methodology selection based on beverage complexity.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 22, 2021. http://hdl.handle.net/2142/89180.

MLA Handbook (7^th Edition):

Bloom, David J. “Sensory discrimination testing methodology selection based on beverage complexity.” 2015. Web. 22 Jan 2021.

Vancouver:

Bloom DJ. Sensory discrimination testing methodology selection based on beverage complexity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2142/89180.

Council of Science Editors:

Bloom DJ. Sensory discrimination testing methodology selection based on beverage complexity. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/89180

University College Cork

2. Geary, Niall. Exploration of the relationship between tacit knowledge and software system test complexity.

Degree: 2016, University College Cork

URL: http://hdl.handle.net/10468/3113

► This research has explored the relationship between system test complexity and tacit knowledge. It is proposed as part of this thesis, that the process of… (more)

Subjects/Keywords: Tacit knowledge; System complexity; System test complexity; Software testing; Software development process

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Geary, N. (2016). Exploration of the relationship between tacit knowledge and software system test complexity. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/3113

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Geary, Niall. “Exploration of the relationship between tacit knowledge and software system test complexity.” 2016. Thesis, University College Cork. Accessed January 22, 2021. http://hdl.handle.net/10468/3113.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Geary, Niall. “Exploration of the relationship between tacit knowledge and software system test complexity.” 2016. Web. 22 Jan 2021.

Vancouver:

Geary N. Exploration of the relationship between tacit knowledge and software system test complexity. [Internet] [Thesis]. University College Cork; 2016. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10468/3113.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Geary N. Exploration of the relationship between tacit knowledge and software system test complexity. [Thesis]. University College Cork; 2016. Available from: http://hdl.handle.net/10468/3113

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

3. Yip, Wang. Towards a proportional sampling strategy according to path complexity: a simulation study.

Degree: 2000, University of Hong Kong

URL: http://hdl.handle.net/10722/34184

Subjects/Keywords: Computer software - Testing.; Computational complexity.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yip, W. (2000). Towards a proportional sampling strategy according to path complexity: a simulation study. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/34184

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yip, Wang. “Towards a proportional sampling strategy according to path complexity: a simulation study.” 2000. Thesis, University of Hong Kong. Accessed January 22, 2021. http://hdl.handle.net/10722/34184.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yip, Wang. “Towards a proportional sampling strategy according to path complexity: a simulation study.” 2000. Web. 22 Jan 2021.

Vancouver:

Yip W. Towards a proportional sampling strategy according to path complexity: a simulation study. [Internet] [Thesis]. University of Hong Kong; 2000. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10722/34184.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yip W. Towards a proportional sampling strategy according to path complexity: a simulation study. [Thesis]. University of Hong Kong; 2000. Available from: http://hdl.handle.net/10722/34184

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

4. Huang, Boshuang. SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS.

Degree: PhD, Electrical and Computer Engineering, 2020, Cornell University

URL: http://hdl.handle.net/1813/70347

► This dissertation focuses on sequential decision making for active learning and inference in online settings. In particular, we consider the settings where the hypothesis space… (more)

▼ This dissertation focuses on sequential decision making for active learning and inference in online settings. In particular, we consider the settings where the hypothesis space is large and labeled data are expensive. Examples include unusual activities in surveillance feedings, target search among large areas, frauds in financial transactions, attacks and intrusions in communication and computer networks, anomalies in infrastructures such as bridges, buildings, and the power grid that may indicate catastrophes. All those applications above are involved with two challenges: (1) massive search space leads to high detection delay (2) labeled data are expensive and time consuming. For active inference, the objective is to detect such event as soon as possible, with a constraint on either the detection accuracy. For active learning, the goal is to minimize the label complexity with certain requirement on the cumulative classification error. The key solution to both problems is to utilize active learning approaches that actively choose which samples to be labeled based on the past observations. In active approaches, the decision maker exert control on which data points to learn from with the objective of label efficiency In this dissertation, we first focus on designing active learning algorithms for active inference. We consider an anomaly detection problem among heterogeneous processes. At each time, a subset of processes can be probed. The objective is to design a sequential probing strategy that dynamically determines which processes to observe at each time and when to terminate the search so that the expected detection time is minimized under a constraint on the probability of misclassifying any process. A low-complexity deterministic test is shown to enjoy the same asymptotic optimality while offering significantly better performance in the finite regime and faster convergence to the optimal rate function, especially when the number of processes is large. Furthermore, the proposed test offers considerable reduction in implementation complexity. Then, we consider active learning algorithms for classifying streaming instances within the framework of statistical learning theory in online settings. At each time, the learner decides whether to query the label of the current instance. If the decision is to not query, the learner predicts the label and receives no feedback on the correctness of the prediction. The objective is to minimize the number of queries while constraining the number of prediction errors over a horizon of length T. The proposed algorithm is shown to outperform existing online active learning algorithms as well as extensions of representative offline algorithms developed under the PAC setting. Advisors/Committee Members: Zhao, Qing (chair), Wagner, Aaron B. (committee member), Krishnamurthy, Vikram (committee member).

Subjects/Keywords: Active hypothesis testing; Active learning; Label complexity; Online learning; Regret; Sequential design of experiments

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Huang, B. (2020). SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/70347

Chicago Manual of Style (16^th Edition):

Huang, Boshuang. “SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS.” 2020. Doctoral Dissertation, Cornell University. Accessed January 22, 2021. http://hdl.handle.net/1813/70347.

MLA Handbook (7^th Edition):

Huang, Boshuang. “SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS.” 2020. Web. 22 Jan 2021.

Vancouver:

Huang B. SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS. [Internet] [Doctoral dissertation]. Cornell University; 2020. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1813/70347.

Council of Science Editors:

Huang B. SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS. [Doctoral Dissertation]. Cornell University; 2020. Available from: http://hdl.handle.net/1813/70347

University of Waterloo

5. Harms, Nathaniel. Halfway to Halfspace Testing.

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/12557

► In this thesis I study the problem of testing halfspaces under arbitrary probability distributions, using only random samples. A halfspace, or linear threshold function, is… (more)

Subjects/Keywords: property testing; sublinear algorithms; computer science; theoretical computer science; algorithms and complexity; halfspaces; linear threshold functions; machine learning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Harms, N. (2017). Halfway to Halfspace Testing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12557

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Harms, Nathaniel. “Halfway to Halfspace Testing.” 2017. Thesis, University of Waterloo. Accessed January 22, 2021. http://hdl.handle.net/10012/12557.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Harms, Nathaniel. “Halfway to Halfspace Testing.” 2017. Web. 22 Jan 2021.

Vancouver:

Harms N. Halfway to Halfspace Testing. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10012/12557.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harms N. Halfway to Halfspace Testing. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12557

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Macquarie University

6. Leaper, David A. Consistency in performance in the group oral discussion test: an interactional competence perspective.

Degree: 2015, Macquarie University

URL: http://hdl.handle.net/1959.14/1067634

►

Theoretical thesis.

Bibliography: pages 374-392

Language teaching institutions may require a dependable test of conversational ability to assess student development and encourage communication in the… (more)

▼

Theoretical thesis.

Bibliography: pages 374-392

Language teaching institutions may require a dependable test of conversational ability to assess student development and encourage communication in the curriculum. The group oral test (GOT) is a format in which three or four test-takers discuss a prompt for up to ten minutes that has the potential to do this. Using Interactional Competence (IC) as its foundation and a mixed-methods research (MMR) framework, this dissertation traces 53 Japanese university students’ performance over three administrations in two years to investigate the test’s appropriacy as a tool of assessment for their conversational ability. The quantitative phase of the study measured the participants’ performance using indices of complexity, accuracy, fluency, vocabulary and interactive functions and found varying developmental patterns: most indices showed significant improvement only in the second administration, while others showed gains in just the third administration, and some improved in each successive administration. Overall, gains made in the second administration had larger effect sizes than in the third administration. However, the scores awarded showed that students only improved significantly in the second administration. The qualitative phase of the study adapted Young’s Interactional Competence (IC) framework (2009, 2011) to investigate a subsample of eight test-takers to investigate the extent that students’ performances were represented by the quantitative indices and their scores. The qualitative analysis illuminated the consistent and variable elements in the students’ performances, and revealed the difficulties the raters had of scoring individuals independently of their IC displayed relative to the group’s performance: higher level test-takers could be scored overgenerously for being the best in their group, and lower level students rewarded for being tested with supportive group members. Among the implications for the GOT are that students of similar abilities should be grouped together, rating scales need to reflect the higher order conversational skills identified by this study, and the raters need to be aware of situations in which their interpretation of the rating scales may be compromised.

1 online resource (xvi, 434 pages) graphs, tables

Advisors/Committee Members: Macquarie University. Department of Linguistics.

Subjects/Keywords: Conversation – Ability testing; Oral examinations; TESOL; speaking assessment; interactional competence; group oral discussion; complexity; accuracy; fluency; interactive function; mixed methods research

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Leaper, D. A. (2015). Consistency in performance in the group oral discussion test: an interactional competence perspective. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1067634

Chicago Manual of Style (16^th Edition):

Leaper, David A. “Consistency in performance in the group oral discussion test: an interactional competence perspective.” 2015. Doctoral Dissertation, Macquarie University. Accessed January 22, 2021. http://hdl.handle.net/1959.14/1067634.

MLA Handbook (7^th Edition):

Leaper, David A. “Consistency in performance in the group oral discussion test: an interactional competence perspective.” 2015. Web. 22 Jan 2021.

Vancouver:

Leaper DA. Consistency in performance in the group oral discussion test: an interactional competence perspective. [Internet] [Doctoral dissertation]. Macquarie University; 2015. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1959.14/1067634.

Council of Science Editors:

Leaper DA. Consistency in performance in the group oral discussion test: an interactional competence perspective. [Doctoral Dissertation]. Macquarie University; 2015. Available from: http://hdl.handle.net/1959.14/1067634

Universidade do Minho

7. Andrade, Amadeu José Freitas Barroso. Análise de complexidade de programas em ferramentas de apoio à decisão .

Degree: 2015, Universidade do Minho

URL: http://hdl.handle.net/1822/39260

► Na área do desenvolvimento de software, o processo de análise de código é um processo extremamente delicado, pois é suscetível a erros e que varia… (more)

Subjects/Keywords: Complexidade ciclomática; Testes de software; Grafos de controlo de fluxo; Análise de software; Cyclomatic complexity; Software testing; Control flow graphs; Software analysis

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Andrade, A. J. F. B. (2015). Análise de complexidade de programas em ferramentas de apoio à decisão . (Masters Thesis). Universidade do Minho. Retrieved from http://hdl.handle.net/1822/39260

Chicago Manual of Style (16^th Edition):

Andrade, Amadeu José Freitas Barroso. “Análise de complexidade de programas em ferramentas de apoio à decisão .” 2015. Masters Thesis, Universidade do Minho. Accessed January 22, 2021. http://hdl.handle.net/1822/39260.

MLA Handbook (7^th Edition):

Andrade, Amadeu José Freitas Barroso. “Análise de complexidade de programas em ferramentas de apoio à decisão .” 2015. Web. 22 Jan 2021.

Vancouver:

Andrade AJFB. Análise de complexidade de programas em ferramentas de apoio à decisão . [Internet] [Masters thesis]. Universidade do Minho; 2015. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1822/39260.

Council of Science Editors:

Andrade AJFB. Análise de complexidade de programas em ferramentas de apoio à decisão . [Masters Thesis]. Universidade do Minho; 2015. Available from: http://hdl.handle.net/1822/39260

8. Lagarde, Guillaume. Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression.

Degree: Docteur es, Informatique, 2018, Sorbonne Paris Cité

URL: http://www.theses.fr/2018USPCC192

►

Cette thèse explore deux territoires distincts de l’informatique fondamentale : la complexité et la compression. Plus précisément, dans une première partie, nous étudions la puissance… (more)

▼

Cette thèse explore deux territoires distincts de l’informatique fondamentale : la complexité et la compression. Plus précisément, dans une première partie, nous étudions la puissance des circuits arithmétiques non commutatifs, qui calculent des polynômes non commutatifs en plusieurs indéterminées. Pour cela, nous introduisons plusieurs modèles de calcul, restreints dans leur manière de calculer les monômes. Ces modèles en généralisent d’autres, plus anciens et largement étudiés, comme les programmes à branchements. Les résultats sont de trois sortes. Premièrement, nous donnons des bornes inférieures sur le nombre d’opérations arithmétiques nécessaires au calcul de certains polynômes tels que le déterminant ou encore le permanent. Deuxièmement, nous concevons des algorithmes déterministes fonctionnant en temps polynomial pour résoudre le problème du test d’identité polynomiale. Enfin, nous construisons un pont entre la théorie des automates et les circuits arithmétiques non commutatifs, ce qui nous permet de dériver de nouvelles bornes inférieures en utilisant une mesure reposant sur le rang de la matrice dite de Hankel, provenant de la théorie des automates. Une deuxième partie concerne l’analyse de l’algorithme de compression sans perte Lempel-Ziv. Pourtant très utilisé, sa stabilité est encore mal établie. Vers la fin des années 90s, Jack Lutz popularise la question suivante, connue sous le nom de « one-bit catastrophe » : « étant donné un mot compressible, est-il possible de le rendre incompressible en ne changeant qu’un seul bit ? ». Nous montrons qu’une telle catastrophe est en effet possible. Plus précisément, en donnant des bornes optimales sur la variation de la taille de la compression, nous montrons qu’un mot « très compressible » restera toujours compressible après modification d’un bit, mais que certains mots « peu compressibles » deviennent en effet incompressibles.

This thesis explores two territories of computer science: complexity and compression. More precisely, in a first part, we investigate the power of non-commutative arithmetic circuits, which compute multivariate non-commutative polynomials. For that, we introduce various models of computation that are restricted in the way they are allowed to compute monomials. These models generalize previous ones that have been widely studied, such as algebraic branching programs. The results are of three different types. First, we give strong lower bounds on the number of arithmetic operations needed to compute some polynomials such as the determinant or the permanent. Second, we design some deterministic polynomial-time algorithm to solve the white-box polynomial identity problem. Third, we exhibit a link between automata theory and non-commutative arithmetic circuits that allows us to derive some old and new tight lower bounds for some classes of non-commutative circuits, using a measure based on the rank of a so-called Hankel matrix. A second part is concerned with the analysis of the data compression algorithm called Lempel-Ziv. Although this…

Advisors/Committee Members: Laplante, Sophie (thesis director), Perifel, Sylvain (thesis director).

Subjects/Keywords: Complexité algébrique; Bornes inférieures; Test d’identité polynomiale; Circuits arithmétiques; Lempel-Ziv; Compression; Algebraic complexity; Lower bounds; Polynomial identity testing; Arithmetic circuits; Lempel-Ziv; Compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lagarde, G. (2018). Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2018USPCC192

Chicago Manual of Style (16^th Edition):

Lagarde, Guillaume. “Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression.” 2018. Doctoral Dissertation, Sorbonne Paris Cité. Accessed January 22, 2021. http://www.theses.fr/2018USPCC192.

MLA Handbook (7^th Edition):

Lagarde, Guillaume. “Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression.” 2018. Web. 22 Jan 2021.

Vancouver:

Lagarde G. Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2018. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2018USPCC192.

Council of Science Editors:

Lagarde G. Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression. [Doctoral Dissertation]. Sorbonne Paris Cité; 2018. Available from: http://www.theses.fr/2018USPCC192

Linnaeus University

9. Kljajic, Haris. Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3.

Degree: Computer Science, 2015, Linnaeus University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740

► This paper addresses the question formulation “Is it possible to implement automated testing in an existing client-server game in order to pinpoint faults and… (more)

Subjects/Keywords: automated testing; client-server; network; fault localization; game; software complexity; Quake 3 Arena; automatiserad testning; klient-server; nätverk; fellokalisering; spel; mjukvarukomplexitet; Quake 3 Arena; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kljajic, H. (2015). Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kljajic, Haris. “Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3.” 2015. Thesis, Linnaeus University. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kljajic, Haris. “Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3.” 2015. Web. 22 Jan 2021.

Vancouver:

Kljajic H. Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3. [Internet] [Thesis]. Linnaeus University; 2015. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kljajic H. Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3. [Thesis]. Linnaeus University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. -2178-1988. Program analysis techniques for algorithmic complexity and relational properties.

Degree: PhD, Computer Science, 2019, University of Texas – Austin

URL: http://dx.doi.org/10.26153/tsw/2181

► Analyzing standard safety properties of a given program has traditionally been the primary focus of the program analysis community. Unfortunately, there are still many interesting… (more)

Subjects/Keywords: Complexity testing; Optimal program synthesis; Fuzzing; Genetic programming; Performance bug; Vulnerability detection; Side channel; Static analysis; Relational verification; Reinforcement learning; Policy gradient

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-2178-1988. (2019). Program analysis techniques for algorithmic complexity and relational properties. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2181

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed January 22, 2021. http://dx.doi.org/10.26153/tsw/2181.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Web. 22 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Jan 22]. Available from: http://dx.doi.org/10.26153/tsw/2181.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2181

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Cincinnati

11. PUREKAR, DHANESH MADHUKAR. A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION.

Degree: MS, Engineering : Mechanical Engineering, 2005, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246

► This thesis describes studies of finite element (FE) model validation methods for structural dynamics. There are usually discrepancies between predictions of the structural dynamic properties… (more)

Subjects/Keywords: Engineering, Mechanical; Modal testing; finite element correlation; modal complexity; mass loading of accelerometers

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

PUREKAR, D. M. (2005). A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246

Chicago Manual of Style (16^th Edition):

PUREKAR, DHANESH MADHUKAR. “A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION.” 2005. Masters Thesis, University of Cincinnati. Accessed January 22, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246.

MLA Handbook (7^th Edition):

PUREKAR, DHANESH MADHUKAR. “A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION.” 2005. Web. 22 Jan 2021.

Vancouver:

PUREKAR DM. A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION. [Internet] [Masters thesis]. University of Cincinnati; 2005. [cited 2021 Jan 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246.

Council of Science Editors:

PUREKAR DM. A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION. [Masters Thesis]. University of Cincinnati; 2005. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246

Louisiana State University

12. Kandara, Osman. Level of essentialness of a node in flowcharts and its application to program testing.

Degree: PhD, Computer Sciences, 2003, Louisiana State University

URL: etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872

► Program testing is important to develop bug free software. A common form of program testing involves selecting test cases which execute (cover) a given set… (more)

Subjects/Keywords: flowchart analysis; debugging; program slicing; regression testing; node coverage; path coverage; selecting test cases; cyclomatic complexity; software engineering; domination; domination tree; post-domination; post domination; post-domination tree; post domination tree; essential set; white box testing; software testing; black box testing; path testing; data flow testing; loop testing; code inspection; condition testing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kandara, O. (2003). Level of essentialness of a node in flowcharts and its application to program testing. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872

Chicago Manual of Style (16^th Edition):

Kandara, Osman. “Level of essentialness of a node in flowcharts and its application to program testing.” 2003. Doctoral Dissertation, Louisiana State University. Accessed January 22, 2021. etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872.

MLA Handbook (7^th Edition):

Kandara, Osman. “Level of essentialness of a node in flowcharts and its application to program testing.” 2003. Web. 22 Jan 2021.

Vancouver:

Kandara O. Level of essentialness of a node in flowcharts and its application to program testing. [Internet] [Doctoral dissertation]. Louisiana State University; 2003. [cited 2021 Jan 22]. Available from: etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872.

Council of Science Editors:

Kandara O. Level of essentialness of a node in flowcharts and its application to program testing. [Doctoral Dissertation]. Louisiana State University; 2003. Available from: etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872

13. Mishra, Shashank. Analysis of test coverage metrics in a business critical setup.

Degree: Computer Science and Communication (CSC), 2017, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698

►

Test coverage is an important parameter of analyzing how well the product is being tested in any domain within the IT industry. Unit testing… (more)

Subjects/Keywords: Code coverage; line coverage; branch coverage; path coverage; mutation testing; unit testing; test process; complexity; Computer Sciences; Datavetenskap (datalogi)

…that directly influence the scope of testing are size and complexity of the software, amount… …4 Software testing… …4 When to stop testing… …13 Unit testing… …25 Unit testing best practices…

14 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mishra, S. (2017). Analysis of test coverage metrics in a business critical setup. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mishra, Shashank. “Analysis of test coverage metrics in a business critical setup.” 2017. Thesis, KTH. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mishra, Shashank. “Analysis of test coverage metrics in a business critical setup.” 2017. Web. 22 Jan 2021.

Vancouver:

Mishra S. Analysis of test coverage metrics in a business critical setup. [Internet] [Thesis]. KTH; 2017. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mishra S. Analysis of test coverage metrics in a business critical setup. [Thesis]. KTH; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Grenet, Bruno. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.

Degree: Docteur es, Informatique, 2012, Lyon, École normale supérieure

URL: http://www.theses.fr/2012ENSL0769

►

La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour résoudre un problème de manière algorithmique. Dans ce cadre,… (more)

▼

La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour résoudre un problème de manière algorithmique. Dans ce cadre, la théorie de la complexité algébrique est l'étude de la complexité algorithmique de problèmes de nature algébrique, concernant des polynômes.Dans cette thèse, nous étudions différents aspects de la complexité algébrique. D'une part, nous nous intéressons à l'expressivité des déterminants de matrices comme représentations des polynômes dans le modèle de complexité de Valiant. Nous montrons que les matrices symétriques ont la même expressivité que les matrices quelconques dès que la caractéristique du corps est différente de deux, mais que ce n'est plus le cas en caractéristique deux. Nous construisons également la représentation la plus compacte connue du permanent par un déterminant. D'autre part, nous étudions la complexité algorithmique de problèmes algébriques. Nous montrons que la détection de racines dans un système de n polynômes homogènes à n variables est NP-difficile. En lien avec la question « VP = VNP ? », version algébrique de « P = NP ? », nous obtenons une borne inférieure pour le calcul du permanent d'une matrice par un circuit arithmétique, et nous exhibons des liens unissant ce problème et celui du test d'identité polynomiale. Enfin nous fournissons des algorithmes efficaces pour la factorisation des polynômes lacunaires à deux variables.

Computational complexity is the study of the resources — time, memory, …— needed to algorithmically solve a problem. Within these settings, algebraic complexity theory is the study of the computational complexity of problems of algebraic nature, concerning polynomials. In this thesis, we study several aspects of algebraic complexity. On the one hand, we are interested in the expressiveness of the determinants of matrices as representations of polynomials in Valiant's model of complexity. We show that symmetric matrices have the same expressiveness as the ordinary matrices as soon as the characteristic of the underlying field in different from two, but that this is not the case anymore in characteristic two. We also build the smallest known representation of the permanent by a determinant.On the other hand, we study the computational complexity of algebraic problems. We show that the detection of roots in a system of n homogeneous polynomials in n variables in NP-hard. In line with the “VP = VNP ?”question, which is the algebraic version of “P = NP?” we obtain a lower bound for the computation of the permanent of a matrix by an arithmetic circuit, and we point out the links between this problem and the polynomial identity testing problem. Finally, we give efficient algorithms for the factorization of lacunary bivariate polynomials.

Advisors/Committee Members: Koiran, Pascal (thesis director).

Subjects/Keywords: Complexité algébrique; Déterminant; Permanent; Théorie de Valiant; Bornes inférieures; Corps finis; Test d'identité polynomiale; Factorisation; Circuits arithmétiques; Systèmes polynomiaux; Algebraic complexity; Determinant; Permanent; Valiant's theory; Lower bounds; Finite fields; Polynomial identity testing; Factorization; Arithmetic circuits; Polynomial systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Grenet, B. (2012). Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2012ENSL0769

Chicago Manual of Style (16^th Edition):

Grenet, Bruno. “Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.” 2012. Doctoral Dissertation, Lyon, École normale supérieure. Accessed January 22, 2021. http://www.theses.fr/2012ENSL0769.

MLA Handbook (7^th Edition):

Grenet, Bruno. “Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.” 2012. Web. 22 Jan 2021.

Vancouver:

Grenet B. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2012. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2012ENSL0769.

Council of Science Editors:

Grenet B. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. [Doctoral Dissertation]. Lyon, École normale supérieure; 2012. Available from: http://www.theses.fr/2012ENSL0769

15. Bauwens, Bruno. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.

Degree: 2010, Ghent University

URL: http://hdl.handle.net/1854/LU-1107852

Subjects/Keywords: Mathematics and Statistics; Computability theory; minimal sufficient statistics; influence in time series; statistical hypothesis testing; ideal sequence analysis; Kolmogorov complexity; causality

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bauwens, B. (2010). Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-1107852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Thesis, Ghent University. Accessed January 22, 2021. http://hdl.handle.net/1854/LU-1107852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Web. 22 Jan 2021.

Vancouver:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Internet] [Thesis]. Ghent University; 2010. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1854/LU-1107852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Thesis]. Ghent University; 2010. Available from: http://hdl.handle.net/1854/LU-1107852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Kamal, Ahmad Waqas. A Hierarchical Approach to Software Testing.

Degree: 2006, , Department of Systems and Software Engineering

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889

► To produce high quality software both software developers and testers need continuous improvement in their work methodologies and processes. So, far much work has… (more)

Subjects/Keywords: Test Artifacts; specifications; acceptance; use case; test case; hierarchy; testing; black box; tree; maintenance; regression; priority; prioritization; PORT; complexity; volatility; dependency; Software Engineering; Programvaruteknik

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kamal, A. W. (2006). A Hierarchical Approach to Software Testing. (Thesis). , Department of Systems and Software Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kamal, Ahmad Waqas. “A Hierarchical Approach to Software Testing.” 2006. Thesis, , Department of Systems and Software Engineering. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kamal, Ahmad Waqas. “A Hierarchical Approach to Software Testing.” 2006. Web. 22 Jan 2021.

Vancouver:

Kamal AW. A Hierarchical Approach to Software Testing. [Internet] [Thesis]. , Department of Systems and Software Engineering; 2006. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kamal AW. A Hierarchical Approach to Software Testing. [Thesis]. , Department of Systems and Software Engineering; 2006. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Queensland University of Technology

17. Truong, Nghi Khue Dinh. A web-based programming environment for novice programmers.

Degree: 2007, Queensland University of Technology

URL: https://eprints.qut.edu.au/16471/

► Learning to program is acknowledged to be difficult; programming is a complex intellectual activity and cannot be learnt without practice. Research has shown that first… (more)

Subjects/Keywords: computer programming; flexible delivery; web; tutoring system; on-line learning; feedback; fill in the gap; static analysis; cyclomatic complexity; automated testing; dynamic analysis; black box; white box; feedback; XML; assessment

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Truong, N. K. D. (2007). A web-based programming environment for novice programmers. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/16471/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Truong, Nghi Khue Dinh. “A web-based programming environment for novice programmers.” 2007. Thesis, Queensland University of Technology. Accessed January 22, 2021. https://eprints.qut.edu.au/16471/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Truong, Nghi Khue Dinh. “A web-based programming environment for novice programmers.” 2007. Web. 22 Jan 2021.

Vancouver:

Truong NKD. A web-based programming environment for novice programmers. [Internet] [Thesis]. Queensland University of Technology; 2007. [cited 2021 Jan 22]. Available from: https://eprints.qut.edu.au/16471/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Truong NKD. A web-based programming environment for novice programmers. [Thesis]. Queensland University of Technology; 2007. Available from: https://eprints.qut.edu.au/16471/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Toker, Yonca. Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests.

Degree: PhD, Psychology, 2010, Georgia Tech

URL: http://hdl.handle.net/1853/37175

► The trait complex approach (Ackerman&Heggestad, 1997) makes it possible to study the individual holistically by taking account of various individual differences at the same time,… (more)

▼ The trait complex approach (Ackerman&Heggestad, 1997) makes it possible to study the individual holistically by taking account of various individual differences at the same time, such as abilities, personality, motivation, and vocational preferences. Recently, Kanfer, Wolf, Kantrowitz, and Ackerman (2010) provided support for taking a whole-person approach in predicting academic performance. They also showed the incremental role of non-ability predictors over the role of ability predictors. Objectives of the present study were to further explore the non-ability variables of the science/math trait complex. Identifying the personality correlates of the science/math trait complex was the first objective. Investigation results yielded four personality factors as correlates of the complex, which play important roles for engineers and scientists at different stages of the vocational track: toughmindedness was the personality marker of the science/math trait complex and was associated with intending to pursue a STEM career; achievement and control were associated with academic success in STEM majors; and cognitively-oriented behavior was associated with more cognitively challenging pursuits, such as attending STEM competitions and planning to go on to graduate school. The second purpose was to revisit the vocational interests associated with the science/math trait complex and the Science, Technology, Engineering, and Mathematics (STEM) groups. A new measure was introduced, referred to as STEM Interest Complexity, which measures interests towards engaging in increasingly complex tasks in the Numerical, Symbolic, Spatial, and STEM-related Ideas domains. It was developed to assess the level of vocational interests, in addition to the traditionally assessed direction of vocational interests (Holland, 1985). Validation of the new STEM Interest Complexity measure showed adequate construct and concurrent criterion-related validities. Construct validity was established by demonstrating associations between the new measure and measures of the direction of interests, cognitive abilities, intelligence as personality, and learning goal orientations. Support for the new measure's criterion-related validity was found by demonstrating that the measure discriminates between majors, and predicts vocational criteria (i.e., college achievement in STEM, attachment to STEM fields, major satisfaction, and one's intentions to chose a complex STEM career). With dominance analyses, it was shown that STEM Interest Complexity was the most important vocational assessment in the prediction of criteria. Results support the assertion that vocational interest inventories can be improved by incorporating the level of complexity dimension. Finally, a science/math trait complex composite score, including the personality factors and STEM Interest Complexity, in addition to the previously determined ability, interest, and self-concept associates, showed moderate associations with STEM-related vocational criteria. The non-ability individual… Advisors/Committee Members: Ackerman, Phillip L. (Committee Chair), Embretson, Susan (Committee Member), James, Lawrence R. (Committee Member), Kanfer, Ruth (Committee Member), McKlin, Tom (Committee Member).

Subjects/Keywords: Dominance analysis; Vocational counseling; Level of interests; Interest assessment; Vocational fit; STEM; Occupational complexity; Vocational interests; Mathematical ability; Personality; Trait intercorrelations; Ability Testing; Occupational aptitude tests

…73 5.3.2.7 STEM Interest Complexity Scales............................................ 73… …Preliminary Findings for the STEM Interest Complexity Scales ...................... 94 6.2.1… …96 6.2.3 STEM Interest Complexity Associations with Constructs and Criteria… …Predicting Major Choice from STEM Interest Complexity.... 104 viii 6.3 Exploration of the Trait… …133 8.2.2.2 STEM Interest Complexity Scales.......................................... 133…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Toker, Y. (2010). Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/37175

Chicago Manual of Style (16^th Edition):

Toker, Yonca. “Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests.” 2010. Doctoral Dissertation, Georgia Tech. Accessed January 22, 2021. http://hdl.handle.net/1853/37175.

MLA Handbook (7^th Edition):

Toker, Yonca. “Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests.” 2010. Web. 22 Jan 2021.

Vancouver:

Toker Y. Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1853/37175.

Council of Science Editors:

Toker Y. Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/37175

19. Lamontagne, Philippe. Amplification de l'amplitude : analyse et applications.

Degree: 2013, Université de Montréal

URL: http://hdl.handle.net/1866/9827

Subjects/Keywords: Amplification de l'amplitude; Test de propriété; Test de linéarité; Test d'homomorphisme; Test de symétrie; Test de quasi-symétrie; Variance; Complexité en requêtes; Quantum amplitude amplification; Property testing; Linearity testing; Homomorphism testing; Symmetry testing; Quasi-symmetry testing; Query complexity; Applied Sciences - Computer Science / Sciences appliqués et technologie - Informatique (UMI : 0984)

…en requêtes ou query complexity. Cette mesure de complexité compte le nombre de requêtes…

1 more image…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lamontagne, P. (2013). Amplification de l'amplitude : analyse et applications. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/9827

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lamontagne, Philippe. “Amplification de l'amplitude : analyse et applications.” 2013. Thesis, Université de Montréal. Accessed January 22, 2021. http://hdl.handle.net/1866/9827.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lamontagne, Philippe. “Amplification de l'amplitude : analyse et applications.” 2013. Web. 22 Jan 2021.

Vancouver:

Lamontagne P. Amplification de l'amplitude : analyse et applications. [Internet] [Thesis]. Université de Montréal; 2013. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1866/9827.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lamontagne P. Amplification de l'amplitude : analyse et applications. [Thesis]. Université de Montréal; 2013. Available from: http://hdl.handle.net/1866/9827

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations