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 33 for “"tree structures"”.
-
Detection and Characterization of Multilevel Genomic Patterns
… DNA copy number changes and learning the trees of phenotypes using DNA microarray data. DNA copy number change is an important form of structural variations in human genomes. The copy number signals measured by high-density DNA microarrays usually have low signal-to-noise ratios and …
-
Fault detection and location in modular trees
… of fault detection and location in modular tree structures are considered in this thesis. The fault set is restricted to stuck-at-faults in the discussion of the fault location problem. Short circuit faults and broken and short circuit faults are considered in the discussion of the fault …
-
Modeling image databases using Xml schema
… querying and browsing by hierarchical tree structures and object relational graphs. We use the extensible markup language (XML) schema to illustrate and exemplify the proposed model because of its interoperability and flexibility advantages. Of primary interest is the notion of complex …
-
Dynamics of Self -Organization of Ramified Patterns in an Electromechanical System
… described above, we explore the dynamics of how tree structures self-organize in the system. We are also interested, more generally, in how the detailed structure of ramified patterns affects the properties of systems that use them for transportation. Therefore, in collaboration with researchers …
-
Imbalanced learning using actuarial modified loss function in tree-based models
… first pinpoints the pitfall in the traditional tree-based algorithm’s splitting function. This thesis then modifies the function to remedy the imbalance issue presented in the insurance loss modeling. We propose two novel actuarial modified loss functions, namely, weighted sum of squared error …
-
Computation of parasitics in multilayer hybrid microelectronics
… time savings by avoiding the use of data tree structures and stringent cell size rules. (3) XT Field Solver A two and three dimensional finite element quasi-TEM solver which calculates the capacitance and inductance between circuit metalizations.
-
GTQL : a query language for game tree
… In this thesis we introduce the Game Tree Query Language (GTQL), a query language specifically designed for game trees. The language can express queries about complex game-tree structures, including hierarchical relationships and aggregated attributes over subtree data. We also discuss …
-
Hierarchical Visual Content Modelling and Query based on Trees
… of salient information into hierarchical tree structures in the spatial and temporal domains forms an important step to bridge the semantic salient gap. Salient regions are identified using region analysis, rank ordered and documented in a tree for further analysis. A structure of this …
-
Theater level operations other than war modeling : applications of decision making theory
… will be some time in the future. Decision tree structures and the forecasting module are used to solve the decision making problem using expected utility. The model uses pairwise comparisons of utility attributes to obtain a decision maker's preference structure, This structure is applied …
-
Behavioural synthesis of analogue integrated circuits
… Programming (GP) style encoding scheme based on tree structures, and a novel fitness function based on pole-zero analysis. The system is capable of synthesising circuit topologies entirely from scratch, but can also utilise user-provided circuit knowledge of arbitrary detail and complexity. The …
-
Power-efficient design of 16-bit mixed-operand multipliers
… of these multipliers reveals that both array and tree structures are feasible solutions for designing 16-bit multipliers, and complementary CMOS and single-ended CPL-TG logics are promising candidates for power-efficient design. The appropriate choices of structures and logic styles depend on …
-
Image analysis methods for diagnosis of diffuse lung disease in multi-detector computed tomography
… as in identification (delineation) of anatomical structures and pathological regions, providing objective quantitative assessment and monitoring of the onset and progression of the disease. Multidetector CT (MDCT) allows acquisition of volumetric datasets with almost isotropic voxels, enabling …
-
Spectral Estimation of Hidden Markov Models
… basic hidden Markov models to latent variable tree structures that have linguistic applications, especially dependency pars- ing, and finally to hidden Markov models in which the output is a high-dimensional, continuously distributed variable. We show that spectral estimation of hidden Markov …
-
Supply chain risk analysis
… activities. Bayesian networks along with fault tree structures are embedded in the system and logical rules are used to perform a qualitative fault tree analysis, as the data required to calculate the frequency of occurrence is rarely available. The developed system guides the risk assessment …
-
Latent tree structure learning for cross-document coreference resolution
… it into a structure learning problem. A latent tree structure, in which leaves correspond to observed mentions and internal nodes correspond to latent sub-entities, is learned. A greedy clustering heuristic can then be used to select subtrees from the learned tree structure as entities. As with …
-
New methodologies for interconnect reliability assessments of integrated circuits
… more complex shapes, generally referred to as "trees". An interconnect tree consists of continuously connected high-conductivity metal within one layer of metallization. Trees terminate at diffusion barriers at vias and contacts, and, in the general case, can have more than one terminating …
-
Self-stabilizing binary search tree maintenance algorithm
Binary search tree is one of the most studied data structures. The main application of the binary search tree is in implementing efficient search operations. A binary search tree is a special binary tree which satisfies the property that for every processor p in the binary tree, the values of all …
-
Evolutionary dynamics of speciation and extinction
… explore common descent in evolved phylogenetic tree structures at both the individual and cluster level. Finally, an extinction scenario is implemented where, after reaching a steady-state, a large population percentage is killed. Historical contingency is shown to play a major role in recovery …
-
An Implementation-Based Exploration of HAPOD: Hierarchical Approximate Proper Orthogonal Decomposition
… of S in blocks based on a predefined rooted tree of processors, concatenating the outputs from each stage to form the inputs for the next. However, depending on the selected parameter values and the properties of S, the performance of HAPOD may be no better than that of direct SVD. In this …
-
KNN Query Processing in Wireless Sensor and Robot Networks
… implement and lacks robustness. Algorithms with tree structures lead to the excessive energy consumption and large latency caused by structural construction. Itinerary based approaches generate large latency or unsatisfactory accuracy. In this thesis, we propose a new method to estimate a search …
Page 1 of 2