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 19 of 19 for “"binary matrices"”.
-
Grammar-Based Representations of Large Sparse Binary Matrices
Large sparse matrices representation is a fundamental problem in big data processing and analysis. In some applications dealing with large sparse matrices, the I/O of these sparse matrices is the bottleneck of the whole system. To reduce the requirement of memory bandwidth in this scenario, it is …
-
Association measures : comparison of performance across binary matrices
[ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI-COLUMBIA AT AUTHOR'S REQUEST.] Investigation of the performance of Dice (1945) measure of association when applied to three dimensional data. Variance for the measure is developed and examined. Comparison of the measure to Cohen's K (1960) and Yule's …
-
The irregular case of the quadratic equation X² + PX + Q = 0 in binary matrices
Electronic Thesis or Dissertation
-
The Abraham Solvation Model Used for Prediction of Solvent-Solute Interactions and New Methods for Updating Parameters
… anion-specific values using linear algebra and binary matrices.
-
Logical factorisation machines: probabilistic boolean factor models for binary data
… of latent feature models, that aim to decompose binary matrices, tensors or higher-arity relations into an approximate logical product of low rank, binary matrices. These products are defined through the use of logical operators instead of arithmetic operations. The resulting factor matrices …
-
Binary matrix factorisations under Boolean arithmetic
<p>For a binary matrix <strong>X</strong>, the Boolean rank <em><strong>br</em></strong>(<strong>X</strong>) is the smallest integer for which <strong>X</strong> can be factorised into the Boolean matrix product of two binary matrices <strong>A</strong> and <strong>B</strong> with inner dimension …
-
OPTIMISATION AND INTERDICTION PROBLEMS FOR NETWORK SAFETY
… systems that can be modelled using graphs or binary matrices. The first problem we examine is the Weighted Safe Set Problem, a graph optimisation problem that seeks to identify vertex partitions satisfying specific dominance constraints between the parts. For this problem, we propose an exact …
-
Gestión del conocimiento en la generación de modelos ambientales
… (grafos orientados o digrafos, basados en matrices binarias de relaciones contextuales de causalidad) y redes semánticas o conceptuales (enlaces estructurales funcionales de herencia de atributos entre células generadoras o entidades de acumulación de información). El conocimiento o parecer …
-
Within-Pangenome Phylogeny Based on Structural Variants
… from published resources and encoded as binary matrices. Using these matrices, we reconstructed phylogenies with the neighbour-joining method and compared them with published reference trees. The reference phylogeny for radish is based on sequence data, whereas the cotton reference tree …
-
New methods for fixed-margin binary matrix sampling, Fréchet covariance, and MANOVA tests for random objects in multiple metric spaces
… requires sampling from the space of all binary matrices with the prescribed row and column margins, since enumeration of all such matrices is often infeasible for even moderately sized networks with 20-50 nodes. We propose two new sampling methods for this problem. First, we extend two …
-
MODELING AN ISLAMIC ECONOMIC SYSTEM: AN INTERACTION DELIVERY MATRIX AND BOOLEAN DIGRAPH APPROACH
… concepts of contextual relations, transitivity, binary matrices, digraphs, adjacent matrix are used and the obtained adjacent matrix is transformed into Boolean reachability matrix. The reachability matrix with regard to each contextual relation and their related hierarchial digraph are shown. …
-
Nonparametric Bayesian Methods for Extracting Structure from Data
… of efficiently processing very large, sparse matrices, enabling cluster analysis on incomplete data matrices. We introduce binary matrix factorization, a novel matrix factorization model that, in contrast to classic factorization methods, such as singular value decomposition, decomposes a …
-
Variants of the Consecutive-Ones Property motivated by the reconstruction of ancestral species
… decidable Consecutive-Ones Property (C1P) of binary matrices, formally introduced in 1965 by Fulkerson and Gross, has since found applications in many areas. In this thesis, we propose and study several variants of this property that are motivated by the reconstruction of ancestral species. We …
-
Distributed Data Aggregation for Sparse Recovery in Wireless Sensor Networks
… (DCSS) algorithm is proposed based on sparse binary CS measurement matrix. In the two-tiered sampling model, each sensor first samples the environment independently. Then the fusion center (FC), acting as a pseudo-sensor, samples the sensor network to select a subset of sensors ($m$ out of …
-
Towards High-Efficient Broadband Omnidirectional Light-Trapping: Discrepancy-Assisted 2D/3D Deterministic Quasi-Random Nanostructure Design, Optimization, and Fabrication
… QRNs into meshes and then map the meshes to binary matrices, which can be deterministically programmable; and 2) introduce the “star discrepancy” to evaluate the QRNs’ degree of the randomness, which can guide the design and further optimization of QRNs to improve the light-trapping …
-
ORDERED MATRICES OF PRESCRIBED ROW AND COLUMN SUM
Let M(n,s) be the number of nxn matrices with binary entries, row and column sum s, and whose rows are in lexicographical order. Let S(n) be the number of nxn matrices with entries from {0,1,2}, symmetric, with trace 0, and row sum 2. (The sequence S(n) appears as A002137 in N.J.A. Sloane's Online …
-
Finding Reusable Modules Using Sparse Matrix Decompositions
… matrix is then decomposed into a product of two matrices, using a stochastic gradient descent algorithm, one of which represents the compositions of modules, and the other one representing the usage of this modules across different conditions. This decomposition is such that the resulting modules …
-
Fast exact algorithms for optimization problems in resource allocation and switched linear systems
… that consists of several linear subsystems: $K$ matrices, each chosen from the given set of matrices, to maximize a convex function over the product of the $K$ matrices and the given vector.This simple problem has many applications in operations research and control, yet a moderate-sized instance …
-
Optimal Planning and Operation of AC-DC Hybrid Distribution Systems
… of DS buses is introduced for LF analysis. Three binary matrices, which are used as a means of describing the configuration of the AC and DC buses and lines, have been employed in the construction of the unified power equations. The LF model is generic and can be used for both grid-connected and …