Semiautomatic dental recognition using a graph-based segmentation algorithm and teeth shapes features

Dental recognition is very important for forensic human identification, mainly regarding the mass disasters, which have frequently happened due to tsunamis, airplanes crashes, etc. Algorithms for automatic, precise, and robust teeth segmentation from radiograph images are crucial for dental recognition. In this work we propose the use of a graph-based algorithm to extract the teeth contours from panoramic dental radiographs that are used as dental features. In order to assess our proposal, we have carried out experiments using a database of 1126 tooth images, obtained from 40 panoramic dental radiograph images from 20 individuals. The results of the graph-based algorithm was qualitatively assessed by a human expert who reported excellent scores. For dental recognition we propose the use of the teeth shapes as biometric features, by the means of BAS (Bean Angle Statistics) and Shape Context descriptors. The BAS descriptors showed, on the same database, a better performance (EER 14%) than the Shape Context (EER 20%). © 2012 IEEE.

Probing the infraed behavior of the ghost-gluon vertex in quantum chromodynamics

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

Modelagem matemática e aplicações do problema de coloração em grafos

Pós-graduação em Matemática - IBILCE

Estudo visando a otimização do solvente extrator e estudo preliminar sobre a quantificação da citocalasina D produzida pelo endófito Xylaria sp., usando a técnica de RMN de '1 SOB H'

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

A construction of integrated vertex operator in the pure spinor sigma-model in AdS(5) x S-5

Vertex operators in string theory me in two varieties: integrated and unintegrated. Understanding both types is important for the calculation of the string theory amplitudes. The relation between them is a descent procedure typically involving the b-ghost. In the pure spinor formalism vertex operators can be identified as cohomology classes of an infinite-dimensional Lie superalgebra formed by covariant derivatives. We show that in this language the construction of the integrated vertex from an unintegrated vertex is very straightforward, and amounts to the evaluation of the cocycle on the generalized Lax currents.

Correspondence between the one-loop three-point vertex and the Y and Delta electric resistor networks

Different mathematical methods have been applied to obtain the analytic result for the massless triangle Feynman diagram yielding a sum of four linearly independent (LI) hypergeometric functions of two variables F-4. This result is not physically acceptable when it is embedded in higher loops, because all four hypergeometric functions in the triangle result have the same region of convergence and further integration means going outside those regions of convergence. We could go outside those regions by using the well-known analytic continuation formulas obeyed by the F-4, but there are at least two ways we can do this. Which is the correct one? Whichever continuation one uses, it reduces a number of F-4 from four to three. This reduction in the number of hypergeometric functions can be understood by taking into account the fundamental physical constraint imposed by the conservation of momenta flowing along the three legs of the diagram. With this, the number of overall LI functions that enter the most general solution must reduce accordingly. It remains to determine which set of three LI solutions needs to be taken. To determine the exact structure and content of the analytic solution for the three-point function that can be embedded in higher loops, we use the analogy that exists between Feynman diagrams and electric circuit networks, in which the electric current flowing in the network plays the role of the momentum flowing in the lines of a Feynman diagram. This analogy is employed to define exactly which three out of the four hypergeometric functions are relevant to the analytic solution for the Feynman diagram. The analogy is built based on the equivalence between electric resistance circuit networks of types Y and Delta in which flows a conserved current. The equivalence is established via the theorem of minimum energy dissipation within circuits having these structures.

Description and performance of track and primary-vertex reconstruction with the CMS tracker

A description is provided of the software algorithms developed for the CMS tracker both for reconstructing charged-particle trajectories in proton-proton interactions and for using the resulting tracks to estimate the positions of the LHC luminous region and individual primary-interaction vertices. Despite the very hostile environment at the LHC, the performance obtained with these algorithms is found to be excellent. For t (t) over bar events under typical 2011 pileup conditions, the average track-reconstruction efficiency for promptly-produced charged particles with transverse momenta of p(T) > 0.9GeV is 94% for pseudorapidities of vertical bar eta vertical bar < 0.9 and 85% for 0.9 < vertical bar eta vertical bar < 2.5. The inefficiency is caused mainly by hadrons that undergo nuclear interactions in the tracker material. For isolated muons, the corresponding efficiencies are essentially 100%. For isolated muons of p(T) = 100GeV emitted at vertical bar eta vertical bar < 1.4, the resolutions are approximately 2.8% in p(T), and respectively, 10 m m and 30 mu m in the transverse and longitudinal impact parameters. The position resolution achieved for reconstructed primary vertices that correspond to interesting pp collisions is 10-12 mu m in each of the three spatial dimensions. The tracking and vertexing software is fast and flexible, and easily adaptable to other functions, such as fast tracking for the trigger, or dedicated tracking for electrons that takes into account bremsstrahlung.

Caracterização topológica dos motivos das redes biológicas integradas da Escherichia coli e da Saccharomyces cerevisiae

The reducionism method has helped in the clari cation of functioning of many biological process. However, such process are extremely complex and have emergent properties that can not be explained or even predicted by reducionism methods. To overcome these limits, researchers have been used a set of methods known as systems biology, a new area of biology aiming to understand the interactions between the multiple components of biological processes. These interactions can be represented by a mathematical object called graph or network, where the interacting elements are represented by a vertex and the interactions by edges that connect a pair of vertexes. Into graphs it is possible to nd subgraphs, occurring in complex networks at numbers that are signi cantly higher than those in randomized networks, they are de ned as motifs. As motifs in biological networks may represent the structural units of biological processess, their detection is important. Therefore, the aim of this present work was detect, count and classify motifs present in biological integrated networks of bacteria Escherichia coli and yeast Saccharomyces cere- visiae. For this purpose, we implemented codes in MathematicaR and Python environments for detecting, counting and classifying motifs in these networks. The composition and types of motifs detected in these integrated networks indicate that such networks are organized in three main bridged modules composed by motifs in which edges are all the same type. The connecting bridges are composed by motifs in which the types of edges are diferent

Open-closed superstring amplitudes using vertex operators in AdS5xS5

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

A survey on the set of periods of the graph homeomorphisms

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

Open-closed superstring amplitudes using vertex operators in AdS(5) x S-5

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

A Graph Model for DynamicWaveband Switching in WDM Mesh Networks

We investigate the problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multi-granular optical cross-connect (MG-OXC), we construct an auxiliary graph. Based on the auxiliary graph, we develop two heuristic on-line WBS algorithms with different grouping policies, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Our results show that the WFAUG algorithm outperforms the BFAUG algorithm.

SimSight: A Virtual Machine Based Dynamic Call Graph Generator

One problem with using component-based software development approach is that once software modules are reused over generations of products, they form legacy structures that can be challenging to understand, making validating these systems difficult. Therefore, tools and methodologies that enable engineers to see interactions of these software modules will enhance their ability to make these software systems more dependable. To address this need, we propose SimSight, a framework to capture dynamic call graphs in Simics, a widely adopted commercial full-system simulator. Simics is a software system that simulates complete computer systems. Thus, it performs nearly identical tasks to a real system but at a much lower speed while providing greater execution observability. We have implemented SimSight to generate dynamic call graphs of statically and dynamically linked functions in x86/Linux environment. A case study illustrates how we can use SimSight to identify sources of software errors. We then evaluate its performance using 12 integer programs from SPEC CPU2006 benchmark suite.

Analyzing the Complexity and Reliability of Switch-Frequency-Reconfigurable Antennas Using Graph Models

This paper addresses the functional reliability and the complexity of reconfigurable antennas using graph models. The correlation between complexity and reliability for any given reconfigurable antenna is defined. Two methods are proposed to reduce failures and improve the reliability of reconfigurable antennas. The failures are caused by the reconfiguration technique or by the surrounding environment. These failure reduction methods proposed are tested and examples are given which verify these methods.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).