Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 22 for “"Combinatorial analysis"”.
-
A computer-aided combinatorial analysis of the game of cribbage
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.
-
Combinatorial analysis of sequential firing patterns across multiple neurons decoding memory of sequential spatial experience in rat hippocampus
… type of memory in humans. Here, we develop a new combinatorial method for analyzing sequential firing patterns involving an arbitrary number of neurons based on relative time order. We then apply this method to decode memories of sequential spatial experience in the rat hippocampus during slow …
-
O ensino de combinatória: uma análise de livros didáticos de matemática.
This study aimed to analyze Combinatorial Analysis of teaching proposals present in textbooks of Mathematics of the 1960s and 2000, led to the current high school, considering the perspective of the context of that content. The focus of analysis was done both for the presentation of the contents …
-
Model-based quantitative combinatorial optical microscopy for extracting clinical imaging biomarkers
… applications of a quantitative model-based combinatorial analysis method. The analysis technique developed provides a direct link between multimodal image contrast and physiological biomarkers. Applications include identification of tissue constituents in fixed tissue slices and …
-
An Application of Combinatorial Methods
… likely. Probability theory is simply enumerative combinatorial analysis when applied to finite sets. For a given finite sample space, probability questions are usually "just" a lot of counting. The purpose of this thesis is to provide some in depth analysis of several combinatorial methods, …
-
Analytic Combinatorics Applied to RNA Structures
… topological genus that lend themselves nicely to combinatorial analysis. Namely, the coefficients of their generating function can be approximated for large n. This paper is an investigation into the length-spectrum of the longest block in random γ-structures. We prove that the expected …
-
WAVELENGTH AND VISUAL FEATURE SELECTION FOR NON-DESTRUCTIVE EVALUATION OF FUSARIUM HEAD BLIGHT IN WHEAT USING HYPERSPECTRAL IMAGING
… to overall performance, and an exhaustive combinatorial analysis was conducted to identify high-performing feature pairs. The best-performing model achieved an accuracy of 99.7% using a large feature set. Lightweight models identified through feature analysis achieved accuracies of up to …
-
Mutational Analysis of HIV-1 Nucleocapsid Protein and Methods Development for Aptamer Discovery
… part of the thesis is on the mutational and combinatorial analysis of HIV-1 nucleocapsid protein (NCp7). Sixteen mutants of NCp7 were constructed and over-expressed in <em> E. coli </em> . The dissociation constants (K <sub>d </sub> ) between the mutant proteins and the major packaging signal …
-
Nondeterminism and Language Design in Deep Inference
… applicability of inference rules provides a rich combinatorial analysis of proofs. Deep inference also makes it possible to design deductive systems that are tailored for computer science applications and otherwise provably not expressible. By applying the inference rules deeply, logical …
-
Separated spacecraft interferometry : system architecture design and optimization
Through a process of system design, analysis, and optimization, the trade space for future optical separated spacecraft interferometers (SSI's) is explored. Using Distributed Satellite System principles, eleven separate architectures ranging in size from three to five spacecraft are compared on the …
-
Stability of Nucleic Acid Secondary Structures and Their Contribution to Gene Expression
… the bacterio-opsin gene {bop) (1). DNA sequence analysis and predictive folding algorithms suggest that the first twenty-five bases of the bop gene mRNA can form a secondary structural element (a "stem-loop"). Using biophysical methods, the goal was to determine if the stem-loop structure exists …
-
On the minimum rank of certain graphs with path cover number 2
The minimum rank problem is an interesting and ongoing problem in spectral graph theory which seeks to answer the question "Given a simple graph G what is the minimum rank of a matrix whose off-diagonal zero/nonzero pattern is described by G?" In recent years, the minimum rank of trees, unicyclic …
-
Analysis of a combinatorial approach to the travelling salesman problem
Ch. 1. Introduction -- Ch. 2. Some results concerning p-optimality -- Ch. 3. Algorithms for the travelling salesman problem -- Ch. 4. Discussion.
-
Asymptotic distribution of eigenvalues of random matrices and characterization of the Gaussian distribution by rotational invariance
… , |x| > 1. The proof is achieved by an intricate combinatorial analysis in conjunction with the method of moments. This result extends a conjecture made by E. P. Wigner ("On the Distribution of the Roots of Certain Symmmetric Matrices," Ann. Math. 67, 1958, 325).
-
The induced path number of complementary prisms
The complementary prism GG of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect matching between the corresponding vertices of G and G. The induced path number, denoted ρ(G), of a graph G is defined as the minimum number of subsets that the …
-
Formally verifying the security properties of a proof-of-stake blockchain protocol
… we attempt to formalise, in Isabelle/HOL, the combinatorial analysis used to prove that Ouroboros satisfies common prefix with near certainty. We cover the case of a static stake protocol under a few assumptions: the network is synchronous, the majority of the stake is honest, and the stake …
-
Zero-sum problems in finite cyclic groups
… to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if it is equivalent under group automorphism to one which has sum precisely IGI when this sum is viewed as an …
-
Automatic discovery of descriptions of permutation statistics
The field of permutation statistics is an established subfield of combinatorics with connections to many other fields, such as genome rearrangements, computer science and physics. The definitions of these statistics can be something simple, like counting the occurrences of a classical pattern in …
-
Single molecule methods for clinical biomarker quantification
… these targets using multiplexed panels and combinatorial analysis shows immense promise for deriving even greater improvements in test efficacy. While these tests show immense potential when utilized in clinical laboratories, an optimal testing platform would also enable point of care …
Page 1 of 2