892 resultados para Mannheim metric
Resumo:
We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.
Resumo:
We establish the conditions under which it is possible to construct signal sets satisfying the properties of being geometrically uniform and matched to additive quotient groups. Such signal sets consist of subsets of signal spaces identified to integers rings ℤ[i] and ℤ[ω] in ℤ2. © 2008 KSCAM and Springer-Verlag.
Resumo:
It is proven that the field equations of a previously studied metric nonsymmetric theory of gravitation do not admit any non-singular stationary solution which represents a field of non-vanishing total mass and non-vanishing total fermionic charge.
Resumo:
In this paper, a new v-metric based approach is proposed to design decentralized controllers for multi-unit nonlinear plants that admit a set of plant decompositions in an operating space. Similar to the gap metric approach in literature, it is shown that the operating space can also be divided into several subregions based on a v-metric indicator, and each of the subregions admits the same controller structure. A comparative case study is presented to display the advantages of proposed approach over the gap metric approach. (C) 2000 Elsevier Science Ltd. All rights reserved.
Resumo:
For a parameter lambda > 0, we study a type of vortex equations, which generalize the well-known Hermitian-Einstein equation, for a connection A and a section phi of a holomorphic vector bundle E over a Kahler manifold X. We establish a global existence of smooth solutions to heat flow for a self-dual Yang-Mills-Higgs field on E. Assuming the lambda -stability of (E, phi), we prove the existence of the Hermitian Yang-Mills-Higgs metric on the holomorphic bundle E by studying the limiting behaviour of the gauge flow.
Resumo:
In the present paper, we establish two fixed point theorems for upper semicontinuous multivalued mappings in hyperconvex metric spaces and apply these to study coincidence point problems and minimax problems. (C) 2002 Elsevier Science (USA). All rights reserved.
Resumo:
Two experiments tested predictions from a theory in which processing load depends on relational complexity (RC), the number of variables related in a single decision. Tasks from six domains (transitivity, hierarchical classification, class inclusion, cardinality, relative-clause sentence comprehension, and hypothesis testing) were administered to children aged 3-8 years. Complexity analyses indicated that the domains entailed ternary relations (three variables). Simpler binary-relation (two variables) items were included for each domain. Thus RC was manipulated with other factors tightly controlled. Results indicated that (i) ternary-relation items were more difficult than comparable binary-relation items, (ii) the RC manipulation was sensitive to age-related changes, (iii) ternary relations were processed at a median age of 5 years, (iv) cross-task correlations were positive, with all tasks loading on a single factor (RC), (v) RC factor scores accounted for 80% (88%) of age-related variance in fluid intelligence (compositionality of sets), (vi) binary- and ternary-relation items formed separate complexity classes, and (vii) the RC approach to defining cognitive complexity is applicable to different content domains. (C) 2002 Elsevier Science (USA). All rights reserved.
Resumo:
In the paper we present two continuous selection theorems in hyperconvex metric spaces and apply these to study xed point and coincidence point problems as well as variational inequality problems in hyperconvex metric spaces.
Resumo:
Antibody in human sera that induces lysis of sheep erythrocytes in hemolytic assay was investigated. The present study showed that the presence in serum of the thermostable cytolytic anti-sheep red blood cells antibodies is dependent on the Schistosoma mansoni infection, and this is more frequent in adults than in children. The thermostable characteristic of hemolysins in normal sera was not dependent on the presence of Ascaris lumbricoides, Trichuris trichiura or hookworm geo-helminths. Further, thermostable complement-activating heterophile antibodies were noticed in children in association with massive number of S. mansoni eggs. The results were obtained by using the z- and the chi-square tests. The z-test allows us to formulate a one-sided alternative, i.e., a tendency of one of the attributes. On the other hand, the chi-square test analyzes the independence between attributes by using a contingency table. Besides the obtained results being interesting in the field of schistosomiasis mansoni, they can provide a new insight into the use of statistics in medical science.
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Informática
Resumo:
In this paper, we propose an extension of the firefly algorithm (FA) to multi-objective optimization. FA is a swarm intelligence optimization algorithm inspired by the flashing behavior of fireflies at night that is capable of computing global solutions to continuous optimization problems. Our proposal relies on a fitness assignment scheme that gives lower fitness values to the positions of fireflies that correspond to non-dominated points with smaller aggregation of objective function distances to the minimum values. Furthermore, FA randomness is based on the spread metric to reduce the gaps between consecutive non-dominated solutions. The obtained results from the preliminary computational experiments show that our proposal gives a dense and well distributed approximated Pareto front with a large number of points.
Resumo:
We discuss metric and combinatorial properties of Thompson's group T, such as the normal forms for elements and uniqueness of tree pair diagrams. We relate these properties to those of Thompson's group F when possible, and highlight combinatorial differences between the two groups. We define a set of unique normal forms for elements of T arising from minimal factorizations of elements into convenient pieces. We show that the number of carets in a reduced representative of T estimates the word length, that F is undistorted in T, and that cyclic subgroups of T are undistorted. We show that every element of T has a power which is conjugate to an element of F and describe how to recognize torsion elements in T.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."