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 38 for “"Multisets"”.
-
Generation of permutations of multisets
… i, i = 0, ,t Such sequences are permutations of multisets. The results for multiset generation by adjacent interchange are extended to rooted trees represented by these sequences. Necessary conditions on nᵢ, i = 0, ,t, are given for cases where it is impossible to generate by adjacent interchange …
-
Cache-Oblivious Searching and Sorting in Multisets
… problems related to searching and sorting in multisets in the cache-oblivious model: Finding the most frequent element (the mode), duplicate elimination and finally multi-sorting. We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems …
-
Modeling and Reasoning with Multisets and Multirelations in Alloy
Multisets and multirelations arise naturally in modeling; however, most modeling languages either have limited or completely lack support for multisets and multirelations. Alloy, for instance, is a lightweight relational modeling language which provides automatic analysis of models. In Alloy, …
-
Statistical algorithms using multisets and statistical inference of heterogeneous networks
Computational statistics, including methods such as Markov chain Monte Carlo (MCMC), bootstrap, approximate Bayesian computation, is an important part in modern statistics and has been widely used in many areas, such as Bayesian statistics, computational biology, and computational physics. In this …
-
Generalised inversion frequency distribution
… of inversion counts for the permutations of multisets by a four-tier architecture of integers, partitions, multisets, and the permutations of the multisets. It introduces two insertion methods to link the hierarchical and peer to peer relationships between these entities. It centers around …
-
Εφαρμογές των χώρων Chu
… Chu spaces. Fuzzy set theory, in the theory of multisets while it gives research directions in topology. In particular, we represent fuzzy sets and fuzzy relation structures as Chu spaces while we do the same for multisets. In addition, we present the consequences of our representations.
-
Effective variance estimates of additive functions defined on random combinatorial objects /
… defined on random permutations and weighted multisets. It extends classical ideas of probabilistic number theory associated with the Turán–Kubilius inequality to random combinatorial structures. For permutations, sharp upper and lower variance bounds for strongly additive functions are …
-
Predicting the evolution of life history using inclusive fitness : the evolution of death, aging, and variable birth rates explained through multisets and graph theory
This thesis explores the capacity for a new measurement of inclusive fitness to explain previously unsolved problems in evolutionary biology. It presents an empirically validated solution to several problems. We explain the evolution of organism aging, post-reproductive survival and infant …
-
Variations on a Theorem of Erdös, Ko and Rado
… In this thesis, we deal with two such objects: multisets and permutations. We de ne a k-multiset as a collection of k integers (not necessarily distinct) from a nite base set of cardinality m and say that two k-multisets are intersecting if they have an element in common. Our results include a …
-
Erdős–Turán problemos versija liekanų grupėse ir Sperner tipo teoremos multiaibėms /
… in groups Zn and Sperner-type theorems for multisets. The first part of this thesis is concerned with explaining the motivation behind this version of the Erdős–Turán problem and the proof that for sufficiently large n there always exists an additive base of the group Zn with representation …
-
Asymptotic enumeration, cluster statistics, and limit laws for combinatorial structures
… in the multiset (e.g. unlabelled forests are multisets of unlabelled trees). And, secondly, the class S = Set(C) containing sets of labelled C-objects, such that no label appears twice in the set and any two C-objects are treated as distinct if their set of labels is (e.g. labelled forests are …
-
Vėrinių multiaibių statistikos dispersijos efektyvūs įverčiai /
The variance of a linear statistics on multisets of necklaces is explored. The upper and lower bounds with optimal constants are obtained. It is shown that both constants are asymptotically correct. Results are illustrated by computer calculations.
-
BEHAVIOURAL FOUNDATIONS OF FEATURE MODELING
… by applying, in turn, modal logic, the theory of multisets, and formal language theory. In order to adequately represent the semantics of basic models, we propose a Kripke semantics and show that basic feature modeling needs a modal rather than Boolean logic. We propose two multiset based theories …
-
Topics in Topological Machine Learning: Persistent Local Homology, Multiset Transformer, and Beyond
… through persistence diagrams represented as multisets, to their vectorization for ML model compatibility. The thesis mainly contains three parts, each focusing on an element or a part of the pipeline. The first part introduces Persistent Local Homology (PLH) for graph analysis, applying …
-
A Kleene Theorem and Decision Problems for Probability and Angelic Nondeterminism
… implements semantics via distributions over multisets in order to overcome the theoretical barriers arising from the absence of a distributive law. Chapter 3 introduces the model and establishes a correspondence between the expression and automaton models by proving a Kleene theorem. Such a …
-
Integrating information on the semantic web using partially ordered multi hypersets
… Based on non-well-founded partially ordered multisets (hyper pomsets), augment with a powerful reflection mechanism, the metamodel supports the automated, lossless, semantically transparent integration of relationship-based metamodels. Complete mappings to Braque from the Extensible Markup …
-
An Efficient Quantum Message Authentication Scheme
… a novel method for unranking permutations of multisets is also presented.
-
Formal verification of biologically inspired computing models
… cP systems due to the use of labelled and nested multisets. In order to solve the issue, we formally defined the unification problem for labelled multisets and proposed a corresponding algorithm, namely LNMU. This can solve well-formed labelled multiset unification problems in linear time. To …
-
DISSIMILARITY MEASURES FOR COMPARISON OF LABELED TREES AND DAGS
… measures can also handle nodes labeled with multisets. The second part investigates directed acyclic graphs (DAGs), which model evolutionary and causal relationships. Here, the k-RF framework is adapted to define efficient metrics for 1-labeled DAGs. This leads to the introduction of simple …
Page 1 of 2