907 resultados para Hierarchical lattices
Resumo:
It is shown that the tight-binding approximation of the nonlinear Schrodinger equation with a periodic linear potential and periodic in space nonlinearity coefficient gives rise to a number of nonlinear lattices with complex, both linear and nonlinear, neighbor interactions. The obtained lattices present nonstandard possibilities, among which we mention a quasilinear regime, where the pulse dynamics obeys essentially the linear Schrodinger equation. We analyze the properties of such models both in connection to their modulational stability, as well as in regard to the existence and stability of their localized solitary wave solutions.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The cubic perovskite related material CaCu3Ti4O12 has attracted a great deal of attention due to the high values of the static dielectric constant, of order 104, approximately constant in the temperature range 100-600 K. The substitution of Ca by Cd results in a similar temperature dependence but a static dielectric constant more than one order of magnitude lower. A theoretical electronic structure study is performed on CaCu3Ti4O12 (CCTO) and CdCu3Ti4O12 (CdCTO) using a tight binding with overlap method. Although the calculations are performed in a paramagnetic configuration, excellent agreement with experiment was found for the calculated band gap of CCTO. In spite of the fact that the band structures of both systems look practically the same, a significant difference is found in the calculated bond strength of Ca-O and Cd-O pairs, driven by the presence of Ti, with Ca-O interaction in CCTO loosened with respect to Cd-O interaction in the cadmium compound. It is suggested that O vacancies are more easily formed in CCTO, this being related to the lower electronegativity of Ca as compared to Cd. The formation of oxygen vacancies could be the origin of the difference in the static dielectric constant of the two compounds.
Resumo:
The rural-urban migration phenomenon is analyzed by using an agent-based computational model. Agents are placed on lattices which dimensions varying from d = 2 up to d = 7. The localization of the agents in the lattice defines that their social neighborhood (rural or urban) is not related to their spatial distribution. The effect of the dimension of lattice is studied by analyzing the variation of the main parameters that characterizes the migratory process. The dynamics displays strong effects even for around one million of sites, in higher dimensions (d = 6, 7).
Resumo:
A simulation study was made of the effects of mixing two evolutionary forces (natural selection and random genetic drift), combined in a single data matrix of gene frequencies, on the resulting genetic distances among populations. Twenty-one, kinds of simulated gene frequencies surfaces, for 15 populations linearly distributed over geographic space, were used to construct 21 data matrices, combining different proportions of two types of surfaces (gradients and random surfaces). These matrices were analysed by Unweighted Pair-Group Method - Arithmetic Averages (UPGMA), clustering and Principal Coordinate Analysis. The results obtained show that ordination is more accurate than UPGMA in revealing the spatial patterns in the genetic distances, in comparison with results obtained using the Mantel test comparing directly genetic and geographic distances.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
This paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code search for optimum codes. Although non exhaustive, the search always results in optimum codes for given (k1, V, Λ/Λ′). Tables with binary and ternary optimum codes to partitions of lattices with 8, 9 e 16 cosets, were obtained.
Resumo:
One common problem in all basic techniques of knowledge representation is the handling of the trade-off between precision of inferences and resource constraints, such as time and memory. Michalski and Winston (1986) suggested the Censored Production Rule (CPR) as an underlying representation and computational mechanism to enable logic based systems to exhibit variable precision in which certainty varies while specificity stays constant. As an extension of CPR, the Hierarchical Censored Production Rules (HCPRs) system of knowledge representation, proposed by Bharadwaj & Jain (1992), exhibits both variable certainty as well as variable specificity and offers mechanisms for handling the trade-off between the two. An HCPR has the form: Decision If(preconditions) Unless(censor) Generality(general_information) Specificity(specific_information). As an attempt towards evolving a generalized knowledge representation, an Extended Hierarchical Censored Production Rules (EHCPRs) system is suggested in this paper. With the inclusion of new operators, an Extended Hierarchical Censored Production Rule (EHCPR) takes the general form: Concept If (Preconditions) Unless (Exceptions) Generality (General-Concept) Specificity (Specific Concepts) Has_part (default: structural-parts) Has_property (default:characteristic-properties) Has_instance (instances). How semantic networks and frames are represented in terms of an EHCPRs is shown. Multiple inheritance, inheritance with and without cancellation, recognition with partial match, and a few default logic problems are shown to be tackled efficiently in the proposed system.
Resumo:
A construction technique of finite point constellations in n-dimensional spaces from ideals in rings of algebraic integers is described. An algorithm is presented to find constellations with minimum average energy from a given lattice. For comparison, a numerical table of lattice constellations and group codes is computed for spaces of dimension two, three, and four. © 2001.
Resumo:
This study considers the function and complexity of tasks during foraging of three Acromyrmex species. Foraging was classified as a team task composed of 2 or 3 processes: recruitment, selection, and collection. Each process was subdivided into different subtasks. Points were attributed to subtasks considering their hierarchical level to compare the complexity of foraging among species. Total scores obtained were 19 for A. balzani and 14 for A. crassispinus and A. rugosus, indicating different degrees of social complexity for grass-cutting and leaf-cutting ant species. Acromyrmex balzani, a grass-cutting ant species, shows a behavioral repertoire composed of more variable subtasks during foraging.