Search results for " Computer"
showing 10 items of 6910 documents
Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars
2021
We consider the following problem: A researcher identified a small number of molecules with a certain property of interest and now wants to find further molecules sharing this property in a database. This can be described as learning molecular classes from small numbers of positive examples. In this work, we propose a method that is based on learning a graph grammar for the molecular class. We consider the type of graph grammars proposed by Althaus et al. [2], as it can be easily interpreted and allows relatively efficient queries. We identify rules that are frequently encountered in the positive examples and use these to construct a graph grammar. We then classify a molecule as being conta…
Are locally finite MV-algebras a variety?
2021
We answer Mundici's problem number 3 (D. Mundici. Advanced {\L}ukasiewicz calculus. Trends in Logic Vol. 35. Springer 2011, p. 235): Is the category of locally finite MV-algebras equivalent to an equational class? We prove: (i) The category of locally finite MV-algebras is not equivalent to any finitary variety. (ii) More is true: the category of locally finite MV-algebras is not equivalent to any finitely-sorted finitary quasi-variety. (iii) The category of locally finite MV-algebras is equivalent to an infinitary variety; with operations of at most countable arity. (iv) The category of locally finite MV-algebras is equivalent to a countably-sorted finitary variety. Our proofs rest upon th…
The ideal duplication
2021
AbstractIn this paper we present and study the ideal duplication, a new construction within the class of the relative ideals of a numerical semigroup S, that, under specific assumptions, produces a relative ideal of the numerical duplication $$S\bowtie ^b E$$ S ⋈ b E . We prove that every relative ideal of the numerical duplication can be uniquely written as the ideal duplication of two relative ideals of S; this allows us to better understand how the basic operations of the class of the relative ideals of $$S\bowtie ^b E$$ S ⋈ b E work. In particular, we characterize the ideals E such that $$S\bowtie ^b E$$ S ⋈ b E is nearly Gorenstein.
Wellfounded Trees and Dependent Polynomial Functors
2004
We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by in- vestigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class of endofunctors on locally cartesian closed cat- egories.
Local minimizers and gamma-convergence for nonlocal perimeters in Carnot groups
2020
We prove the local minimality of halfspaces in Carnot groups for a class of nonlocal functionals usually addressed as nonlocal perimeters. Moreover, in a class of Carnot groups in which the De Giorgi's rectifiability Theorem holds, we provide a lower bound for the $\Gamma$-liminf of the rescaled energy in terms of the horizontal perimeter.
The identity type weak factorisation system
2008
We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the right class of the weak factorisation system. This characterisation is applied to relate identity types and the homotopy theory of groupoids.
Pattern classification using a new border identification paradigm: The nearest border technique
2015
Abstract There are many paradigms for pattern classification such as the optimal Bayesian, kernel-based methods, inter-class border identification schemes, nearest neighbor methods, nearest centroid methods, among others. As opposed to these, this paper pioneers a new paradigm, which we shall refer to as the nearest border (NB) paradigm. The philosophy for developing such a NB strategy is as follows: given the training data set for each class, we shall attempt to create borders for each individual class. However, unlike the traditional border identification (BI) methods, we do not undertake this by using inter-class criteria; rather, we attempt to obtain the border for a specific class in t…
Efficient learning of regular expressions from good examples
1994
We consider the problem of restoring regular expressions from expressive examples. We define the class of unambiguous regular expressions, the notion of the union number of an expression showing how many union operations can occur directly under any single iteration, and the notion of an expressive example. We present a polynomial time algorithm which tries to restore an unambiguous regular expression from one expressive example. We prove that if the union number of the expression is 0 or 1 and the example is long enough, then the algorithm correctly restores the original expression from one good example. The proof relies on original investigations in theory of covering symbol sequences (wo…
Transience versus recurrence for scale-free spatial networks
2020
Weight-dependent random connection graphs are a class of local network models that combine scale-free degree distribution, small-world properties and clustering. In this paper we discuss recurrence or transience of these graphs, features that are relevant for the performance of search and information diffusion algorithms on the network.
Factors affecting Nigerian teacher educators’ technology integration : Considering characteristics, knowledge constructs, ICT practices and beliefs
2020
To provide a diverse comprehension of teachers' TPACK (Technological, Pedagogical, and Content Knowledge) and how TPACK is reflected in practice, this study examined teacher educators' (TEs') conceptions of technology integration. Specifically, the main objective of the study was to investigate the factors influencing Nigerian teacher educators' technology integration using a self-completion survey administered to Nigerian teacher educators from three schools in the southern region of Nigeria. We utilized the partial least squares structural equation modeling (PLS-SEM) approach for the data analysis. Two frameworks—TPACK and Second Information Technology in Education Study (SITES)— guided t…