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 11 of 11 for “"Interval orders"”.
-
Interval order enumeration
This thesis continues the study of interval orders and related structures, containing results on both the labeled and unlabeled variants. Following a result of Eriksen and Sjo?strand (2014) we identify a link between structures following the Fishburn distribution and Mahonian structures. This is …
-
Dimension and Ramsey results in partially ordered sets.
… new tools and theorems to solve the bounds on interval orders using different number of lengths. We also discussed the dimension of interval orders that have a representation with interval lengths in a certain range. We further discussed the interval dimension and semi dimension for posets. In …
-
Modelling Concurrent Systems with Interval Processes
… semantics is usually defined in terms of partial orders, stratified order structures (or structures equivalent to them as net processes). It is commonly assumed (first argued by N. Wiener in 1914) that any system run (execution) that can be observed by a single observer must be an interval order …
-
Order Theory and Nonparametric Analysis for Interval Censored Data
Interval censored data arises when individuals can be subjected to periodic inspection at random moments, and their status (e.g. failed or functioning) is ascertained at each inspection. We exploit the order theoretic properties of interval orders to develop a new language describing interval …
-
Modeling Concurrency with Interval Traces
When system runs are modeled with interval orders, interval order structures are useful tools to model abstract concurrent histories, i.e. sets of equivalent system runs. For the general cases, Mazurkiewicz traces allow a representation of the entire partial order by a single sequence with …
-
Minimizing setups in precedence constrained scheduling
… as the jump number problem. For general partial orders, the jump number problem was shown to be NP-hard by Pulleyblank in 1981. We show that the problem is polynomial for two restricted classes of partial orders; interval orders and 2-dimensional lattices. Algorithms for finding the optimal …
-
The book embedding of ordered sets
… efficient algorithm for drawing the bipartite interval orders in the minimum number of pages needed. We also give an upper bound for the pagenumber of bipartite ordered sets and the pagenumber of the complete multipartite ordered sets with length 4 and 5.
-
Some results on linear discrepancy for partially ordered sets
… prove three bounds: the linear discrepancy of an interval order is at most D, with equality if and only if it contains an antichain of size D; the linear discrepancy of a disconnected poset is at most the greatest integer less than or equal to (3D-1)/2; and the weak discrepancy of a poset is at …
-
Problems and results in partially ordered sets, graphs and geometry
… the second part, we study two classes of segment orders introduced by Shahrokhi. Both classes are natural generalizations of interval containment orders and interval orders. We prove several properties of the classes, and inspired by the observation, that the classes seem to be very similar, we …
-
Topics in the Generation of Ideals of Posets
… 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, has a …
-
On Closure Operator for Interval Order Structures
… stratified order structures (SO-structures) and interval order structures (IO-structures). The SO-structures can fully model concurrent behaviours when system executions (operational semantics) are described in terms of stratified orders, while the IO-structures can fully model concurrent …