Search results for "Data type"
showing 10 items of 1183 documents
The DrosDel Deletion Collection: A Drosophila Genomewide Chromosomal Deficiency Resource
2007
AbstractWe describe a second-generation deficiency kit for Drosophila melanogaster composed of molecularly mapped deletions on an isogenic background, covering ∼77% of the Release 5.1 genome. Using a previously reported collection of FRT-bearing P-element insertions, we have generated 655 new deletions and verified a set of 209 deletion-bearing fly stocks. In addition to deletions, we demonstrate how the P elements may also be used to generate a set of custom inversions and duplications, particularly useful for balancing difficult regions of the genome carrying haplo-insufficient loci. We describe a simple computational resource that facilitates selection of appropriate elements for generat…
Methods of Digital Hilbert Optics in the Analysis and Objects’ Recognition
2016
This paper describes methods on how to increase the effectiveness of objects’ pictures identification based on correlation methods. The main concept of increasing the discriminant effectiveness is based on highlighting of characteristic points of recognized objects by applying Hilbert transformations. Study of the effectiveness of Digital Hilber Optics (DHO) have been performed on a set of aircrafts, whose models rendered first as binary images, and then as grayscale. It has been performed a very detailed analysis of requirements on resources of information system’s which would in a real world support the discriminatory decision of objects’ class for which the sample database has been creat…
One-Sided Prototype Selection on Class Imbalanced Dissimilarity Matrices
2012
In the dissimilarity representation paradigm, several prototype selection methods have been used to cope with the topic of how to select a small representation set for generating a low-dimensional dissimilarity space. In addition, these methods have also been used to reduce the size of the dissimilarity matrix. However, these approaches assume a relatively balanced class distribution, which is grossly violated in many real-life problems. Often, the ratios of prior probabilities between classes are extremely skewed. In this paper, we study the use of renowned prototype selection methods adapted to the case of learning from an imbalanced dissimilarity matrix. More specifically, we propose the…
Permutability of injectors with a central socle in a finite solvable group
2017
In response to an Open Question of Doerk and Hawkes [5, IX Section 3, page 615], we shall show that if Zπ is the Fitting class formed by the finite solvable groups whose π-socle is central (where π is a set of prime numbers), then the Zπ-injectors of a finite solvable group G permute with the members of a Sylow basis in G. The proof depends on the properties of certain extraspecial groups [4].
Injectors with a central socle in a finite solvable group
2013
Abstract In response to an Open Question of Doerk and Hawkes (1992) [2, IX §4, p. 628] , we shall describe three constructions for the Z π -injectors of a finite solvable group, where Z π is the Fitting class formed by the finite solvable groups whose π -socle is central (and π is a set of prime numbers).
Overlapping self-affine sets of Kakeya type
2009
We compute the Minkowski dimension for a family of self-affine sets on the plane. Our result holds for every (rather than generic) set in the class. Moreover, we exhibit explicit open subsets of this class where we allow overlapping, and do not impose any conditions on the norms of the linear maps. The family under consideration was inspired by the theory of Kakeya sets.
Filtering design for two-dimensional Markovian jump systems with state-delays and deficient mode information
2014
This paper is concerned with the problem of H"~ filtering for a class of two-dimensional Markovian jump linear systems described by the Fornasini-Marchesini local state-space model. The systems under consideration are subject to state-delays and deficient mode information in the Markov chain. The description of deficient mode information is comprehensive that simultaneously includes the exactly known, partially unknown and uncertain transition probabilities. By invoking the properties of the transition probability matrix, together with the convexification of uncertain domains, a new H"~ performance analysis criterion for the filtering error system is firstly derived. Then, via some matrix i…
Approximating hidden chaotic attractors via parameter switching.
2018
In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The parameter switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration. In Refs. 1–3, it is proved that the attractors of a chaotic system, considered as the unique numerical …
The arithmetic decomposition of central Cantor sets
2018
Abstract Every central Cantor set of positive Lebesgue measure is the arithmetic sum of two central Cantor sets of Lebesgue measure zero. Under some mild condition this result can be strengthened by stating that the summands can be chosen to be C s regular if the initial set is of this class.
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…