Search results for " Set theory"
showing 10 items of 113 documents
Descriptive Statistics
2009
A set of medical data is based on a collection of the data of individual cases or objects, also called observation units or statistical units. Every case, for example every study participant, patient, every experimental animal, every tooth or every cell shows comparable parameters (such as body weight, gender, erosion, pH). Each of these parameters, also called variables, has a specific parameter value (gender = male, age = 30 years, weight = 70 kg) for each observation unit (for example the patient). The aim of descriptive statistics is to summarize the data, so that they can be clearly illustrated (1–3). The property of a parameter is specified by its so-called scale of measure. Generally…
Rough Set Theory for Supporting Decision Making on Relevance in Browsing Multilingual Digital Resources
2017
Browsing digital library (DL) collections seems to pose a challenge for a user owning to the number of factors like for instance, operability of the system, interface readability or clarity, and retrieval efficiency directly related to it, or the number of digital items within the user’s domain. However, when it comes to searching for an item in a foreign language to the user, the number of the factors arises even more which translates proportionally to the growing number of clicks aimed to retrieve the target item. Such a procedure usually leads to disheartening the user from browsing the digital collections. Our study into the user’s behavior interacting with multilingual DL system is set…
Complex ecological models with simple dynamics: From individuals to populations
1994
The aim of this work is to study complex ecological models exhibiting simple dynamics. We consider large scale systems which can be decomposed into weakly coupled subsystems. Perturbation Theory is used in order to get a reduced set of differential equations governing slow time varying global variables. As examples, we study the influence of the individual behaviour of animals in competition and predator-prey models. The animals are assumed to do many activities all day long such as searching for food of different types. The degree of competition as well as the predation pressure are dependent upon these activities. Preys are more vulnerable when doing some activities during which they are …
Dimensions of random affine code tree fractals
2014
We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.
Collection Principles in Dependent Type Theory
2002
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logic-enriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the double-negation interpretation.
The small-world of 'Le Petit Prince': Revisiting the word frequency distribution
2016
[EN] Many complex systems are naturally described through graph theory, and different kinds of systems described as networks present certain important characteristics in common. One of these features is the so-called scale-free distribution for its node s connectivity, which means that the degree distribution for the network s nodes follows a power law. Scale-free networks are usually referred to as small-world because the average distance between their nodes do not scale linearly with the size of the network, but logarithmically. Here we present a mathematical analysis on linguistics: the word frequency effect for different translations of the Le Petit Prince in different languages. Compar…
Heyting-valued interpretations for Constructive Set Theory
2006
AbstractWe define and investigate Heyting-valued interpretations for Constructive Zermelo–Frankel set theory (CZF). These interpretations provide models for CZF that are analogous to Boolean-valued models for ZF and to Heyting-valued models for IZF. Heyting-valued interpretations are defined here using set-generated frames and formal topologies. As applications of Heyting-valued interpretations, we present a relative consistency result and an independence proof.
The generalised type-theoretic interpretation of constructive set theory
2006
We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive instead of being formulated via the propositions-as-types representation. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation.
Loop-free Gray code algorithm for the e-restricted growth functions
2011
The subject of Gray codes algorithms for the set partitions of {1,2,...,n} had been covered in several works. The first Gray code for that set was introduced by Knuth (1975) [5], later, Ruskey presented a modified version of [email protected]?s algorithm with distance two, Ehrlich (1973) [3] introduced a loop-free algorithm for the set of partitions of {1,2,...,n}, Ruskey and Savage (1994) [9] generalized [email protected]?s results and give two Gray codes for the set of partitions of {1,2,...,n}, and recently, Mansour et al. (2008) [7] gave another Gray code and loop-free generating algorithm for that set by adopting plane tree techniques. In this paper, we introduce the set of e-restricte…
Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
2007
Consider the problem of evaluating an AND-OR formula on an $N$-bit black-box input. We present a bounded-error quantum algorithm that solves this problem in time $N^{1/2+o(1)}$. In particular, approximately balanced formulas can be evaluated in $O(\sqrt{N})$ queries, which is optimal. The idea of the algorithm is to apply phase estimation to a discrete-time quantum walk on a weighted tree whose spectrum encodes the value of the formula.