Modelos de ciclos reais de negócios aplicados à economia brasileira: um estudo de matching

None

Graphical models and point set matching

Point pattern matching in Euclidean Spaces is one of the fundamental problems in Pattern Recognition, having applications ranging from Computer Vision to Computational Chemistry. Whenever two complex patterns are encoded by two sets of points identifying their key features, their comparison can be seen as a point pattern matching problem. This work proposes a single approach to both exact and inexact point set matching in Euclidean Spaces of arbitrary dimension. In the case of exact matching, it is assured to find an optimal solution. For inexact matching (when noise is involved), experimental results confirm the validity of the approach. We start by regarding point pattern matching as a weighted graph matching problem. We then formulate the weighted graph matching problem as one of Bayesian inference in a probabilistic graphical model. By exploiting the existence of fundamental constraints in patterns embedded in Euclidean Spaces, we prove that for exact point set matching a simple graphical model is equivalent to the full model. It is possible to show that exact probabilistic inference in this simple model has polynomial time complexity with respect to the number of elements in the patterns to be matched. This gives rise to a technique that for exact matching provably finds a global optimum in polynomial time for any dimensionality of the underlying Euclidean Space. Computational experiments comparing this technique with well-known probabilistic relaxation labeling show significant performance improvement for inexact matching. The proposed approach is significantly more robust under augmentation of the sizes of the involved patterns. In the absence of noise, the results are always perfect.

Investidor e investido : o processo decisório no matching entre venture capitals e start-ups no Brasil

O acesso ao capital por empreendedores em start-ups está tradicionalmente fundamentado na indústria de Venture Capital (VC). Nos países emergentes, incluindo o Brasil, foi somente na última década que essa indústria passou a ter uma importância relativa maior às outras fontes de capital disponíveis. Ocorreu que a indústria passou a contar com a migração de fundos estrangeiros tradicionais atraídos pelo potencial de crescimento, pelas oportunidades de novos negócios e incentivos governamentais nesses países. Dessa forma, pode-se considerar que o desenvolvimento da indústria de VC é algo relativamente embrionário no Brasil. Este estudo tem como objetivo principal identificar quais foram os fatores determinantes para que os investidores (Venture Capital) e os investidos (start-up) decidissem por desenvolver uma sociedade em determinado negócio, sob o contexto institucional brasileiro. A pesquisa qualitativa foi realizada pela abordagem exploratória, a partir de entrevistas em profundidade (quatorze, no total) com investidores e investidos brasileiros que já haviam realizado uma sociedade há até dois anos. As entrevistas totalizaram nove matchings, ou pares de investidores e investidos num negócio. Os resultados oriundos dessas entrevistas demonstraram padrões e processos muito similares aos estudados nos países em que essa indústria é considerada desenvolvida. Os dados demonstram, porém, que no Brasil, como em outros países emergentes, a questão do relacionamento entre investidor e investido representa o principal fator para a realização de um negócio entre as partes. Além disso, indica que o relacionamento interpessoal representa um peso maior quando comparado aos outros fatores identificados na pesquisa.

GRAFOS coloração, planaridade e "Matching"

A matemÆtica discreta Ø um dos ramos mais antigos da matemÆtica. Nos tempos mais recentes sofreu grandes avanos em especial na teoria dos grafos, a qual tornou-se numa poderosa ferramenta de anÆlise para entender e dar soluªo a vÆrios tipos de problemas complexos. O objectivo deste trabalho Ø contribuir para a obtenªo de possveis relaıes entre assuntos que partida poderamos pensar que sªo dspares (quando na realidade nªo o sªo), como coloraªo, planaridade e a existŒncia de matching em grafos. Esta dissertaªo Ø um trabalho de natureza reexiva, sobre a teoria dos grafos onde a ideia principal passa por questionarmos e discutirmos alguns temas pertinentes, deniıes e teoremas relacionando sempre com a planaridade dos grafos. DesenvolveremosumraciocnioecriaremosargumentosquefundamentemaexistŒncia de uma relaªo entre este tema e a coloraªo de grafos e a existŒncia de matching em grafos, utilizando exemplos e estabelecendo relaıes de causa e consequŒncia, deduzindo assim as respetivas conclusıes. Por vezes, os grafos nªo planares podem conter um aspeto visual um pouco complexo, devido aos vÆrios cruzamentos entre as suas arestas, originando assim um certo desencorajamento em utilizÆ-los como ferramenta para a soluªo de vÆrios problemas, quer sejam bÆsicos do quotidiano, ou mais complexos das mais vastas Æreas ligadas investigaªo. Um dos propsitos deste trabalho passa por desmisticar esta ideia e provar que existem muitas deniıes, propriedades, teoremas e algoritmos que podem ser aplicados em qualquer tipo de grafos, independentement da sua planaridade.

CENSUS HISTOGRAMS: A SIMPLE FEATURE EXTRACTION and MATCHING APPROACH FOR FACE RECOGNITION

Most face recognition approaches require a prior training where a given distribution of faces is assumed to further predict the identity of test faces. Such an approach may experience difficulty in identifying faces belonging to distributions different from the one provided during the training. A face recognition technique that performs well regardless of training is, therefore, interesting to consider as a basis of more sophisticated methods. In this work, the Census Transform is applied to describe the faces. Based on a scanning window which extracts local histograms of Census Features, we present a method that directly matches face samples. With this simple technique, 97.2% of the faces in the FERET fa/fb test were correctly recognized. Despite being an easy test set, we have found no other approaches in literature regarding straight comparisons of faces with such a performance. Also, a window for further improvement is presented. Among other techniques, we demonstrate how the use of SVMs over the Census Histogram representation can increase the recognition performance.

Improved Fault Location on Distribution Feeders Based on Matching During-Fault Voltage Sags

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

Vortex lattice and matching fields for a long superconducting wire

We investigate the flux penetration patterns and matching fields of a long cylindrical wire of circular cross section in the presence of an external magnetic field. For this study we write the London theory for a long cylinder both for the mixed and Meissner states, with boundary conditions appropriate for this geometry. Using the Monte Carlo simulated annealing method, the free energy of the mixed state is minimized with respect to the vortex position and we obtain the ground state of the vortex lattice for N=3 up to 18 vortices. The free energy of the Meissner and mixed states provides expressions for the matching fields. We find that, as in the case of samples of different geometry, the finite-size effect provokes a delay on the vortex penetration and a vortex accumulation in the center of the sample. The vortex patterns obtained are in good agreement with experimental results.

Three-dimensional reconstruction of fracture surfaces: Area matching algorithms for automatic parallax measurements

This paper describes two solutions for systematic measurement of surface elevation that can be used for both profile and surface reconstructions for quantitative fractography case studies. The first one is developed under Khoros graphical interface environment. It consists of an adaption of the almost classical area matching algorithm, that is based on cross-correlation operations, to the well-known method of parallax measurements from stereo pairs. A normalization function was created to avoid false cross-correlation peaks, driving to the true window best matching solution at each region analyzed on both stereo projections. Some limitations to the use of scanning electron microscopy and the types of surface patterns are also discussed. The second algorithm is based on a spatial correlation function. This solution is implemented under the NIH Image macro programming, combining a good representation for low contrast regions and many improvements on overall user interface and performance. Its advantages and limitations are also presented.

Matching fields of a long superconducting film

We obtain the vortex configurations, the matching fields, and the magnetization of a superconducting film with a finite cross section. The applied magnetic field is normal to this cross section, and we use the London theory to calculate many of its properties, such as the local magnetic field, the free energy, and the induction for the mixed state. Thus previous similar theoretical works, done for an infinitely long superconducting film, are recovered here, in the special limit of a very long cross section. ©1999 The American Physical Society.

Concept of Matching Parallelepiped and its use in the correspondence problem

In this paper, the concept of Matching Parallelepiped (MP) is presented. It is shown that the volume of the MP can be used as an additional measure of `distance' between a pair of candidate points in a matching algorithm by Relaxation Labeling (RL). The volume of the MP is related with the Epipolar Geometry and the use of this measure works as an epipolar constraint in a RL process, decreasing the efforts in the matching algorithm since it is not necessary to explicitly determine the equations of the epipolar lines and to compute the distance of a candidate point to each epipolar line. As at the beginning of the process the Relative Orientation (RO) parameters are unknown, a initial matching based on gradient, intensities and correlation is obtained. Based on this set of labeled points the RO is determined and the epipolar constraint included in the algorithm. The obtained results shown that the proposed approach is suitable to determine feature-point matching with simultaneous estimation of camera orientation parameters even for the cases where the pair of optical axes are not parallel.