949 resultados para topological equivalence of attractors


Relevância:

100.00% 100.00%

Publicador:

Resumo:

The problem of finite automata minimization is important for software and hardware designing. Different types of automata are used for modeling systems or machines with finite number of states. The limitation of number of states gives savings in resources and time. In this article we show specific type of probabilistic automata: the reactive probabilistic finite automata with accepting states (in brief the reactive probabilistic automata), and definitions of languages accepted by it. We present definition of bisimulation relation for automata's states and define relation of indistinguishableness of automata states, on base of which we could effectuate automata minimization. Next we present detailed algorithm reactive probabilistic automata’s minimization with determination of its complexity and analyse example solved with help of this algorithm.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 81R50, 16W50, 16S36, 16S37.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We determine the endogenous order of moves in a mixed pricesetting duopoly. In contrast to the existing literature on mixed oligopolies we establish the payo equivalence of the games with an exogenously given order of moves if the most plausible equilibrium is realized in the market. Hence, in this case it does not matter whether one becomes a leader or a follower. We also establish that replacing a private firm by a public firm in the standard Bertrand-Edgeworth game with capacity constraints increases social welfare and that a pure-strategy equilibrium always exists.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This thesis develops a new technique for composite microstructures projects by the Topology Optimization process, in order to maximize rigidity, making use of Deformation Energy Method and using a refining scheme h-adaptative to obtain a better defining the topological contours of the microstructure. This is done by distributing materials optimally in a region of pre-established project named as Cell Base. In this paper, the Finite Element Method is used to describe the field and for government equation solution. The mesh is refined iteratively refining so that the Finite Element Mesh is made on all the elements which represent solid materials, and all empty elements containing at least one node in a solid material region. The Finite Element Method chosen for the model is the linear triangular three nodes. As for the resolution of the nonlinear programming problem with constraints we were used Augmented Lagrangian method, and a minimization algorithm based on the direction of the Quasi-Newton type and Armijo-Wolfe conditions assisting in the lowering process. The Cell Base that represents the composite is found from the equivalence between a fictional material and a preescribe material, distributed optimally in the project area. The use of the strain energy method is justified for providing a lower computational cost due to a simpler formulation than traditional homogenization method. The results are presented prescription with change, in displacement with change, in volume restriction and from various initial values of relative densities.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Understanding the magnetic properties of graphenic nanostructures is instrumental in future spintronics applications. These magnetic properties are known to depend crucially on the presence of defects. Here we review our recent theoretical studies using density functional calculations on two types of defects in carbon nanostructures: Substitutional doping with transition metals, and sp$^3$-type defects created by covalent functionalization with organic and inorganic molecules. We focus on such defects because they can be used to create and control magnetism in graphene-based materials. Our main results are summarized as follows: i)Substitutional metal impurities are fully understood using a model based on the hybridization between the $d$ states of the metal atom and the defect levels associated with an unreconstructed D$_{3h}$ carbon vacancy. We identify three different regimes, associated with the occupation of distinct hybridization levels, which determine the magnetic properties obtained with this type of doping; ii) A spin moment of 1.0 $\mu_B$ is always induced by chemical functionalization when a molecule chemisorbs on a graphene layer via a single C-C (or other weakly polar) covalent bond. The magnetic coupling between adsorbates shows a key dependence on the sublattice adsorption site. This effect is similar to that of H adsorption, however, with universal character; iii) The spin moment of substitutional metal impurities can be controlled using strain. In particular, we show that although Ni substitutionals are non-magnetic in flat and unstrained graphene, the magnetism of these defects can be activated by applying either uniaxial strain or curvature to the graphene layer. All these results provide key information about formation and control of defect-induced magnetism in graphene and related materials.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The power of computer game technology is currently being harnessed to produce “serious games”. These “games” are targeted at the education and training marketplace, and employ various key game-engine components such as the graphics and physics engines to produce realistic “digital-world” simulations of the real “physical world”. Many approaches are driven by the technology and often lack a consideration of a firm pedagogical underpinning. The authors believe that an analysis and deployment of both the technological and pedagogical dimensions should occur together, with the pedagogical dimension providing the lead. This chapter explores the relationship between these two dimensions, and explores how “pedagogy may inform the use of technology”, how various learning theories may be mapped onto the use of the affordances of computer game engines. Autonomous and collaborative learning approaches are discussed. The design of a serious game is broken down into spatial and temporal elements. The spatial dimension is related to the theories of knowledge structures, especially “concept maps”. The temporal dimension is related to “experiential learning”, especially the approach of Kolb. The multi-player aspect of serious games is related to theories of “collaborative learning” which is broken down into a discussion of “discourse” versus “dialogue”. Several general guiding principles are explored, such as the use of “metaphor” (including metaphors of space, embodiment, systems thinking, the internet and emergence). The topological design of a serious game is also highlighted. The discussion of pedagogy is related to various serious games we have recently produced and researched, and is presented in the hope of informing the “serious game community”.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--founded structures such as lazy lists or streams and is of particular use for reasoning about equivalences. A central difficulty in the automation of coinductive proof is the choice of a relation (called a bisimulation). We present an automation of coinductive theorem proving. This automation is based on the idea of proof planning. Proof planning constructs the higher level steps in a proof, using knowledge of the general structure of a family of proofs and exploiting this knowledge to control the proof search. Part of proof planning involves the use of failure information to modify the plan by the use of a proof critic which exploits the information gained from the failed proof attempt. Our approach to the problem was to develop a strategy that makes an initial simple guess at a bisimulation and then uses generalisation techniques, motivated by a critic, to refine this guess, so that a larger class of coinductive problems can be automatically verified. The implementation of this strategy has focused on the use of coinduction to prove the equivalence of programs in a small lazy functional language which is similar to Haskell. We have developed a proof plan for coinduction and a critic associated with this proof plan. These have been implemented in CoClam, an extended version of Clam with encouraging results. The planner has been successfully tested on a number of theorems.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Aims: The aim of the thesis was to identify verbal descriptors of cancer induced bone pain (CIBP) and neuropathic cancer pain (NCP). An examination of the verbal descriptors associated with these two pain syndromes further considered the relationship between common verbal descriptors, cancer type, performance status and analgesia. Methods: The project was conducted in two phases; Phase one was a systematic review of the literature to examine current evidence of verbal descriptors in CIBP and NCP. Phase two utilised secondary data analysis methodology. Data from 120 patients with confirmed CIBP and 61 patients with confirmed NCP were deemed eligible for entry into a de novo database for secondary analysis. Key descriptive data were considered such as gender, ECOG and pain scores to characterise the patient population. Verbal descriptors of CIBP and NCP were considered in detail across the secondary de novo database. Results: Gender was not identified as a diagnostic characteristic of CIBP and NCP with similar distribution across prevalence of pain reporting and also pain severity. Patients with breast (n=52,43.3%), prostate (n=35,29.2%) and lung (n=14,11.7%) cancer were found to be at an increased risk of CIBP. Those with NCP more was found more commonly among patients with breast cancer (n=21,34.4%). Patients with CIBP were found to have an ECOG performance of 1 (n=49, 40.8%) or 2 (n=43, 35.8%) which was lower than those with NCP with an ECOG of 0 (n=32, 52.5%) or 2 (n=18, 29.5%). Comparisons were made across analgesia and treatment options for CIBP and NCP. Patients with CIBP received a greater variety of treatment options including bisphosphonates and radiotherapy while patients with NCP were more commonly treated with analgesia alone. Patients with CIBP and NCP were taking strong opioids, however those with NCP (n=45, 73.8%) were more likely to utilise strong opioids than those with CIBP (n=61, 50.8%). It was noted that those with NCP required a daily morphine equivalence of almost 50% higher than those with CIBP. Average consumption of opioids was 155.6mg, for patients with NCP, compared to 76mg in patients with CIBP. Common verbal descriptors of CIBP and NCP were identified. The most common verbal descriptors for CIBP were aching, gnawing and throbbing and the most common verbal descriptors of NCP were aching, tender and sharp. Of the most common 6 descriptors for CIBP and NCP only one descriptor was unique to each pain type, gnawing for CIBP and stabbing for NCP. Conclusions: Patients with CIBP and NCP use similar verbal descriptors to characterise their pain with gnawing being unique to CIBP and stabbing being unique to NCP in the data considered within project. Further research is required to explore verbal descriptors which are both common and unique to CIBP and NCP. Further exploration of verbal descriptors would assist development of a comprehensive pain assessment tool which would enhance pain assessment for nurses, clinicians and patients.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper tries to show that the developments in linguistic sciences are better viewed as stages in a single research program, rather than different ideological -isms. The first part contains an overview of the structuralistas' beliefs about the universality and equivalence of human languages, and their search for syntactic universals. In the second part, we will see that the generative program, in its turn, tries to answer why language is a universal faculty in the human species and addresses questions about its form, its development and its use. In the second part, we will see that the paper gives a brief glimpse of the tentative answers the program has been giving to each of these issues.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Universidade Estadual de Campinas. Faculdade de Educação Física

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Há lacuna de questionários de atividade física para crianças brasileiras. O Physical Activity Checklist Interview (PACI), desenvolvido em crianças americanas, permite aferir atividade física do dia anterior. Constituem objetivos do estudo: (i) descrever os procedimentos envolvidos na escolha do PACI a ser submetido à adaptação transcultural; (ii) avaliar equivalências conceitual, de itens e semântica da versão adaptada para uso em crianças de 7 a 10 anos. Identificou-se o PACI pela revisão sistemática na qual foram incluídos dezoito questionários. Foram realizadas, no processo de escolha do instrumento, discussões com pesquisadores da área de atividade física. Verificou-se que o PACI permite aferir o construto e dimensões nas populações de origem e alvo, sendo necessário suprimir algumas atividades por não serem comuns na população alvo. Na equivalência semântica, realizou-se tradução, retradução e avaliação dos significados conotativo e referencial, com pré-teste em 24 crianças de 7 a 10 anos. Apresenta-se a versão do PACI adaptada, denominada Lista de Atividades Físicas (LAF).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Investiga-se a equivalência conceitual, de itens e semântica entre o instrumento Dysfunctional Voiding Scoring System (DVSS), utilizado para avaliar a disfunção funcional do trato urinário inferior em crianças, concebido em inglês e uma versão em português. Na primeira etapa realizou-se a avaliação da equivalência conceitual e de itens, seguida de duas traduções do instrumento original para o português. Na segunda etapa foram realizadas 63 entrevistas, com crianças de 3 a 10 anos e responsáveis, e modificação de itens segundo dificuldades de interpretação. Na terceira etapa foi realizada a retradução do instrumento em português para o inglês e avaliação da equivalência semântica. Na quarta etapa, a versão pré-teste foi aplicada em vinte duplas de crianças de 3 a 10 anos e responsáveis. Apresenta-se o instrumento em português com equivalência conceitual, de itens e semântica. Sugere-se que a aplicação do DVSS seja realizada por meio de entrevista por profissional treinado e não baseada em autopreenchimento como proposto no instrumento original.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This article focuses on the identification of the number of paths with different lengths between pairs of nodes in complex networks and how these paths can be used for characterization of topological properties of theoretical and real-world complex networks. This analysis revealed that the number of paths can provide a better discrimination of network models than traditional network measurements. In addition, the analysis of real-world networks suggests that the long-range connectivity tends to be limited in these networks and may be strongly related to network growth and organization.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Parity-odd domains, corresponding to nontrivial topological solutions of the QCD vacuum, might be created during relativistic heavy-ion collisions. These domains are predicted to lead to charge separation of quarks along the system's orbital momentum axis. We investigate a three-particle azimuthal correlator which is a P even observable, but directly sensitive to the charge separation effect. We report measurements of charged hadrons near center-of-mass rapidity with this observable in Au+Au and Cu+Cu collisions at s(NN)=200 GeV using the STAR detector. A signal consistent with several expectations from the theory is detected. We discuss possible contributions from other effects that are not related to parity violation.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

No dia a dia, as pessoas sabem que existem várias aplicações financeiras, mas a grande maioria não possui o conhecimento necessário para escolher qual o melhor investimento para o seu dinheiro. E assim, muitas vezes acabam investindo somente na poupança, talvez pela sua simplicidade ou por sua popularidade. Neste trabalho, buscamos mostrar a importância da Matemática Financeira para o entendimento de investimentos. Através de uma abordagem de Progressões Geométrica e Aritmética e, consequentemente, da Matemática Financeira, são apresentadas algumas aplicações financeiras, com seus conceitos, cálculos e atividades que mostram como compará-las. Assim, no trabalho são descritos conceitos e propriedades das Progressões Geométrica e Aritmética, e da Matemática Financeira e, como aplicação desse conteúdo, são apresentados o conceito e o cálculo de diversas taxas (equivalência de taxas, taxas efetiva e nominal, taxa pré e pós-fixada, taxas variáveis, taxa referencial), além de alguns investimentos financeiros (poupança, CDB, LCI). Buscando consolidar esse estudo desenvolvido, apresentamos no final do trabalho uma proposta de atividades a serem realizadas em sala de aula, que contemplam cálculos da rentabilidade dos investimentos, mostrando ao aluno como calcular e comparar esses rendimentos.