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 24 for “"partial orders"”.
-
Some Extremal Problems on Graphs and Partial Orders
… and West conjectured that for every product of partial orders, the maximum size of a semiantichain equals the minimum number of unichains needed to cover the product. We prove the case where both factors have width 2. We also use the characterization of product graphs that are perfect to prove …
-
Extremal Problems in Coloring and Labeling of Graphs and Partial Orders
Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs
-
Property testing for distributions on partially ordered sets
… We extend some of their results to new partial orders, and provide evidence for some new conjectural lower bounds. Our results apply to various partial orders: bipartite graphs, lines,, trees, grids, and hypercubes.
-
Better-Quasi-Orders: Extensions and Abstractions
We generalise the notion of �-scattered to partial orders and prove that some large classes of �-scattered partial orders are better-quasi-ordered under embeddability. This generalises theorems of Laver, Corominas and Thomass�e regarding �-scattered linear orders, �-scattered trees, countable …
-
Minimaximal and maximinimal optimisation problems : a partial order-based approach
… optimisation problems, based on a particular partial order concept. To accompany this framework, we define a variety of partial orders, an important example being the partial order of set inclusion. By considering various source optimisation problems from the literature, and partial orders …
-
Generative modeling of dynamic visual scenes
… dynamic behaviors persisting over time. (3) A partial Z-order specifies the relative depth order between layers. Here, through the unique correspondence between equivalent classes of partial orders and consistent choice functions, a distribution over the spaces of partial orders is established, …
-
Multiple Uses of Frequent Episodes in Temporal Process Modeling
… such as motifs, dynamic Bayesian networks and partial orders, but the direct inference of such models from data has been computationally intensive or even intractable. In this work, we propose the mining of frequent episodes as a bridge to inferring more formal models of temporal processes. …
-
Interval and fuzzy optimization. Applications to data envelopment analysis
… approach uses polygonal fuzzy sets and LU-fuzzy partial orders and provides crisp efficiency measures (and associated efficiency ranking) as well as fuzzy efficient targets. The second approach is a new integer interval DEA, with the extension of the corresponding arithmetic and LU-partial orders …
-
Optimization Problems in Data Mining
… of this form are defined under two natural partial orders. For the first, we give an efficient and optimal algorithm for finding all such claims. For the second, we give an algorithm whose running time is significantly more efficient than that of a naive one. Finally, we connect this …
-
A novel weighted rank aggregation algorithm with applications in gene prioritization
… programs that involve variables reflecting partial orders of three or more candidates. Our simulation results indicate that the linear programs give near-optimal performance for a number of important voting parameters, and outperform methods based on PageRank and Weighted Bipartite Matching. …
-
Property testing : theory and applications
… bounds for the general problem and for specific partial orders. A few of our intermediate results are of independent interest. 1. If strings with a property form a vector space, adaptive 2-sided error tests for the property have no more power than non-adaptive 1-sided error tests. 2. Random LDPC …
-
Solutions to the conjugacy search and decision problems in the braid group using finite conjugacy class invariants
… we also study normal forms of braids, partial orders on the braid group, and the Garside group which generalises the braid group.
-
An essay in natural modal logic
… in W. generalized inclusion frames whose Rw are partial orders are called comparison frames. Conditional logics of various comparative notions, for example, Lewis's V-logic of comparative possibility and utilitarian accounts of conditional obligation, model the dyadic modal operator > on …
-
A Random-Linear-Extension Test Based on Classic Nonparametric Procedures
… methods for the situation when there is only partial information about the ranks available. A random-linear-extension exact test and an empirical version of the random-linear-extension test are proposed as a new way to compare groups of data with partial orders. The basic computation procedure …
-
New Algorithms for Mining Network Datasets: Applications to Phenotype and Pathway Modeling
… class—biclusters over domains with supplied partial orders—and present algorithms for systematically detecting such biclusters. Together, our data mining algorithms provide a comprehensive arsenal of techniques for modeling gene perturbation screens and metabolic pathways.
-
Generalized metrics and topology in logic programming semantics
… for Scott-continuous mappings on complete partial orders. The latter theorem is fundamental in denotational semantics since semantic operators in most programming language paradigms satisfy its requirements. The use of negation in logic programming and non-monotonic reasoning, however, …
-
Exponential Random Graphs and a Generalization of Parking Functions
… of interval parking functions have to various partial orders on the symmetric group on n letters including the (left) weak order, (strong) Bruhat order, and the bubble-sorting order.</p>
-
The Structure of Models of Second-order Set Theories
… a rich structure. In particular, every countable partial order embeds into this structure. Moreover, we can arrange so that these embedding preserve the existence/nonexistence of upper bounds, at least for finite partial orders. Second I generalize some constructions of Marek and Mostowski from KM …
-
Topics in the Generation of Ideals of Posets
… the generation of the fixed ideals of finite partial orders with particular attention in finding Gray codes for their generation. Pruesse and Ruskey conjecture that the graph J(P,k), which contains as vertices the k-ideals of the poset P, with an edge between vertices that differ by a swap, …
Page 1 of 2