Search results for "Data"
showing 10 items of 12992 documents
Computing the ℤ2-Cocharacter of 3 × 3 Matrices of Odd Degree
2013
Let F be a field of characteristic 0 and A = M 2, 1(F) the algebra of 3 × 3 matrices over F endowed with the only non trivial ℤ2-grading. Aver'yanov in [1] determined a set of generators for the T 2-ideal of graded identities of A. Here we study the identities in variables of homogeneous degree 1 via the representation theory of the symmetric group, and we determine the decomposition of the corresponding character into irreducibles.
A Survey on Nature-Inspired Medical Image Analysis: A Step Further in Biomedical Data Integration
2019
Natural phenomena and mechanisms have always intrigued humans, inspiring the design of effective solutions for real-world problems. Indeed, fascinating processes occur in nature, giving rise to an ever-increasing scientific interest. In everyday life, the amount of heterogeneous biomedical data is increasing more and more thanks to the advances in image acquisition modalities and high-throughput technologies. The automated analysis of these large-scale datasets creates new compelling challenges for data-driven and model-based computational methods. The application of intelligent algorithms, which mimic natural phenomena, is emerging as an effective paradigm for tackling complex problems, by…
The Catalonian Conflict : an Interpretive Structural Model
2019
The methodology ISM (Interpretive Structural Modeling) is used to study the conflict in Catalonia, listing a list of factors and the influences between them, building from them the Matrix of Influences and the Matrix of Scope, from which they classify the factors into levels and a flow diagram is drawn up, concluding what the possible paths of evolution of said conflict would be
Proving convexity preserving properties of interpolatory subdivision schemes through reconstruction operators
2013
We introduce a new approach towards proving convexity preserving properties for interpolatory subdivision schemes. Our approach is based on the relation between subdivision schemes and prediction operators within Harten's framework for multiresolution, and hinges on certain convexity properties of the reconstruction operator associated to prediction. Our results allow us to recover certain known results [10,8,1,7]. In addition, we are able to determine the necessary conditions for convexity preservation of the family of subdivision schemes based on the Hermite interpolation considered in [4].
Closedness properties in team learning of recursive functions
1997
This paper investigates closedness properties in relation with team learning of total recursive functions. One of the first problems solved for any new identification types is the following: “Does the identifiability of classes U1 and U2 imply the identifiability of U1∪U2?” In this paper we are interested in a more general question: “Does the identifiability of every union of n−1 classes out of U1,...,Un imply the identifiability of U1∪...∪Un?” If the answer is positive, we call such identification type n-closed. We show that n-closedness can be equivalently formulated in terms of team learning. After that we find for which n team identification in the limit and team finite identification t…
On P-compatible hybrid identities and hyperidentities
1994
P-compatible identities are built up from terms with a special structure. We investigate a variety defined by a set ofP-compatible hybrid identities and answer the question whether a variety defined by a set ofP-compatible hyperidentities can be solid.
Applied Linear Algebra: Electrical Networks
2016
This chapter shows how mathematical theory is not an abstract subject which has no connection with the real world. On the contrary, this entire book is written by stating that mathematics in general, and algebra in this case, is an integrating part of every day real life and that the professional life of computational scientists and engineers requires a solid mathematical background. In order to show how the contents of the previous chapters have an immediate technical application, the last chapter of this book describes a core engineering subject, i.e. electrical networks, as an algebraic exercise. Furthermore, this chapter shows how the combination of the algebraic topics give a natural r…
Conditional measures and their applications to fuzzy sets
1991
Abstract Given a ⊥-decomposable measure with respect to a continuous t-conorm, as introduced by the author in an earlier paper (see Section 1), we can construct ⊥-conditional measures as implications. These fulfil a ‘generalized product law’ replacing the product in the classical law by any other strict t-norm ⊥ and turn out to be decomposable with respect to an operation ⊥ V depending on ⊥, ⊥ and the condition set V (Section 2). More general, conditional measures are introduced axiomatically and are shown to be ⊥-conditional measures with respect to some ⊥-decomposable measure (Section 3). ‘Bayesian-like’ models are given which are alternatives to that presented by the author in a recent p…
Nondivisibility among character degrees II: Nonsolvable groups
2007
We say that a finite group G is an NDAD-group (no divisibility among degrees) if for any 1 < a < b in the set of degrees of the complex irreducible characters of G, a does not divide b. In this article, we determine the nonsolvable NDAD-groups. Together with the work of Lewis, Moreto and Wolf (J. Group Theory 8 (2005)), this settles a problem raised by Berkovich and Zhmud’, which asks for a classification of the NDAD-groups.
Elementary Action Systems
2015
This chapter expounds basic notions. An elementary action system is a triple consisting of the set of states, the transition relation between states, and a family of binary relations defined on the set of states. The elements of this family are called atomic actions. Each pair of states belonging to an atomic action is a possible performance of this action. This purely extensional understanding of atomic actions is close to dynamic logic. Compound actions are defined as sets of finite sequences of atomic actions. Thus compound actions are regarded as languages over the alphabet whose elements are atomic actions. This chapter is concerned with the problem of performability of actions and the…