Geração algébrica de malhas bidimensionais

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Análise dinâmica de placas delgadas utilizando elementos finitos triangulares e retangulares

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Análise numérica da convecção natural em dispositivos solar integrados coletor-tanque

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Análise de métodos numéricos de diferenças finitas para solução da equação de Poisson em domínios irregulares

Pós-graduação em Matematica Aplicada e Computacional - FCT

Aplicação do modelo de acurácia em casos suspeitos de amebíase em uma comunidade rural do nordeste do Estado do Pará, Brasil

Introdução: São poucos e dispersos os estudos sobre prevalência de enteroparasitoses em nosso meio, sendo a maioria deles realizada em amostras de base populacional mal definidas, como usuários de serviços de saúde ou alunos de escolas públicas. Objetivo: Quantificar a prevalência da Entamoeba histolytica em uma população rural do Estado do Pará. Casuística e Método: Estudo coprológico pelo método da hematoxilina férrica em 124 moradores do meio rural de Tailândia, utilizando processo de amostragem aleatória para estabelecer a prevalência, a acurácia, os valores preditivos positivo e negativo, bem como a sensibilidade e especificidade. Resultados: Da amostra populacional, 56,58% pertenciam ao sexo masculino, sendo 60,6% entre as idades de 18 a 43 anos. No estudo da escolaridade, 64,5% tinham até 3 anos de estudo e 63,7% recebiam menos de 1 salário mínimo de remuneração. A prevalência de Entamoeba histolytica atingiu 24,2%. Conclusão: A acurácia, medida de valor global do teste efetuado, mostra que 73,4% dos pacientes foram classificados corretamente. O teste de sensibilidade de 70,0% definiu teste positivo para a infecção e a especificidade de 74,5%.

Análise das tensões em próteses implantossuportadas esplintadas, variando a localização dos implantes, pôntico e cantilever: estudo pelo método dos elementos finitos tridimensionais

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A saúde do homem: doenças crônicas não transmissíveis e vulnerabilidade social

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Simulação computacional por elementos finitos de múltiplas fissuras em sólidos usando técnica de fragmentação da malha

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Avaliação das ações de alimentação e nutrição na atenção primária a saúde no estado de São Paulo

Pós-graduação em Alimentos e Nutrição - FCFAR

On reducing test length for FSMs with extra states

A long-standing problem when testing from a deterministic finite state machine is to guarantee full fault coverage even if the faults introduce extra states in the implementations. It is well known that such tests should include the sequences in a traversal set which contains all input sequences of length defined by the number of extra states. This paper suggests the SPY method, which helps reduce the length of tests by distributing sequences of the traversal set and reducing test branching. It is also demonstrated that an additional assumption about the implementation under test relaxes the requirement of the complete traversal set. The results of the experimental comparison of the proposed method with an existing method indicate that the resulting reduction can reach 40%. Experimental results suggest that the additional assumption about the implementation can help in further reducing the test suite length. Copyright (C) 2011 John Wiley & Sons, Ltd.

Formalizing languages for service oriented computing

Service Oriented Computing is a new programming paradigm for addressing distributed system design issues. Services are autonomous computational entities which can be dynamically discovered and composed in order to form more complex systems able to achieve different kinds of task. E-government, e-business and e-science are some examples of the IT areas where Service Oriented Computing will be exploited in the next years. At present, the most credited Service Oriented Computing technology is that of Web Services, whose specifications are enriched day by day by industrial consortia without following a precise and rigorous approach. This PhD thesis aims, on the one hand, at modelling Service Oriented Computing in a formal way in order to precisely define the main concepts it is based upon and, on the other hand, at defining a new approach, called bipolar approach, for addressing system design issues by synergically exploiting choreography and orchestration languages related by means of a mathematical relation called conformance. Choreography allows us to describe systems of services from a global view point whereas orchestration supplies a means for addressing such an issue from a local perspective. In this work we present SOCK, a process algebra based language inspired by the Web Service orchestration language WS-BPEL which catches the essentials of Service Oriented Computing. From the definition of SOCK we will able to define a general model for dealing with Service Oriented Computing where services and systems of services are related to the design of finite state automata and process algebra concurrent systems, respectively. Furthermore, we introduce a formal language for dealing with choreography. Such a language is equipped with a formal semantics and it forms, together with a subset of the SOCK calculus, the bipolar framework. Finally, we present JOLIE which is a Java implentation of a subset of the SOCK calculus and it is part of the bipolar framework we intend to promote.

ParTec and KarnUMa-Digital tools as a help for freshman learning

[EN]Freshman students always present lower success rates than other levels of students. Digital systems is a course usually taught at first year studentsand its success rate is not very high. In this work we introduce three digital tools to improve freshman learning designed for easy use and one of them is a tool for mobile terminals that can be used as a game. The first tool is ParTec and is used to implement and test the partition technique. This technique is used to eliminate redundant states in finite state machines. This is a repetitive task that students do not like to perform. The second tool is called KarnUMa and is used for simplifying logic functions through Karnaugh Maps. Simplifying logical functions is a core task for this course and although students usually perform this task better than other tasks, it can still be improved. The third tool is a version of KarnUMa, designed for mobile devices. All the tools are available online for download and have been a helpful tool for students.

Multithread parallelization of lepp-bisection algorithms

[EN]Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge...

Some advances in open problems of isogeometric analysis

[EN]Isogeometric analysis (IGA) has arisen as an attempt to unify the fields of CAD and classical finite element methods. The main idea of IGA consists in using for analysis the same functions (splines) that are used in CAD representation of the geometry. The main advantage with respect to the traditional finite element method is a higher smoothness of the numerical solution and more accurate representation of the geometry. IGA seems to be a promising tool with wide range of applications in engineering. However, this relatively new technique have some open problems that require a solution. In this work we present our results and contributions to this issue…

Extracting FSA descriptions of robot behaviours from the dynamics of automatically designed controller networks

Automatic design has become a common approach to evolve complex networks, such as artificial neural networks (ANNs) and random boolean networks (RBNs), and many evolutionary setups have been discussed to increase the efficiency of this process. However networks evolved in this way have few limitations that should not be overlooked. One of these limitations is the black-box problem that refers to the impossibility to analyze internal behaviour of complex networks in an efficient and meaningful way. The aim of this study is to develop a methodology that make it possible to extract finite-state automata (FSAs) descriptions of robot behaviours from the dynamics of automatically designed complex controller networks. These FSAs unlike complex networks from which they're extracted are both readable and editable thus making the resulting designs much more valuable.