Coincidence theorems and its applications to equilibrium problems

Given two maps h : X x K -> R and g : X -> K such that, for all x is an element of X, h(x, g(x)) = 0, we consider the equilibrium problem of finding (x) over tilde is an element of X such that h((x) over tilde, g(x)) >= 0 for every x is an element of X. This question is related to a coincidence problem.

On a product formula for the Conley-Zelmder index of symplectic paths and its applications

Using invariance by fixed-endpoints homotopies and a generalized notion of symplectic Cayley transform, we prove a product formula for the Conley-Zehnder index of continuous paths with arbitrary endpoints in the symplectic group. We discuss two applications of the formula, to the metaplectic group and to periodic solutions of Hamiltonian systems.

On a formula for the spectral flow and its applications

We consider a continuous path of bounded symmetric Fredholm bilinear forms with arbitrary endpoints on a real Hilbert space, and we prove a formula that gives the spectral flow of the path in terms of the spectral flow of the restriction to a finite codimensional closed subspace. We also discuss the case of restrictions to a continuous path of finite codimensional closed subspaces. As an application of the formula, we introduce the notion of spectral flow for a periodic semi-Riemannian geodesic, and we compute its value in terms of the Maslov index. (C) 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Consumed by Faith: The development of Christian Fundamentalism and its applications in contemporary society

My research aims to understand how and why fundamentalists justify violence against people who do not fit their profile of "righteous" or "saved" persons, such as abortion doctors and clinic workers, gays and lesbians, and Jews. The first section of this paper travels through the history of fundamentalism since its origins in the British and American apocalipticism, or belief in the Second Coming of Jesus Christ. However, my history of Protestant Fundamentalism in the United States will focus on the ways in which Fundamentalism developed in response to many changes in American social structure. I interpret Fundamentalism as an anti-modern movement seeking to reassert "traditional" Christian values.

A study on time-varying quantile and its applications

This Thesis is the result of my Master Degree studies at the Graduate School of Economics, Getúlio Vargas Foundation, from January 2004 to August 2006. am indebted to my Thesis Advisor, Professor Luiz Renato Lima, who introduced me to the Econometrics' world. In this Thesis, we study time-varying quantile process and we develop two applications, which are presented here as Part and Part II. Each of these parts was transformed in paper. Both papers were submitted. Part shows that asymmetric persistence induces ARCH effects, but the LMARCH test has power against it. On the other hand, the test for asymmetric dynamics proposed by Koenker and Xiao (2004) has correct size under the presence of ARCH errors. These results suggest that the LM-ARCH and the Koenker-Xiao tests may be used in applied research as complementary tools. In the Part II, we compare four different Value-at-Risk (VaR) methodologies through Monte Cario experiments. Our results indicate that the method based on quantile regression with ARCH effect dominates other methods that require distributional assumption. In particular, we show that the non-robust method ologies have higher probability to predict VaRs with too many violations. We illustrate our findings with an empirical exercise in which we estimate VaR for returns of São Paulo stock exchange index, IBOVESPA, during periods of market turmoil. Our results indicate that the robust method based on quantile regression presents the least number of violations.

The Unruh effect and its applications

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Sintering of tin oxide and its applications in electronics and processing of high purity optical glasses

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

Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks

In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown that the proposed algorithm can achieve similar parameters' values compared to the exhaustive search. Although, the proposed technique is faster than the traditional one, being interesting for intrusion detection in large scale traffic networks. © 2012 IEEE.

Social-spider optimization-based artificial neural networks training and its applications for Parkinson's disease identification

Evolutionary algorithms have been widely used for Artificial Neural Networks (ANN) training, being the idea to update the neurons' weights using social dynamics of living organisms in order to decrease the classification error. In this paper, we have introduced Social-Spider Optimization to improve the training phase of ANN with Multilayer perceptrons, and we validated the proposed approach in the context of Parkinson's Disease recognition. The experimental section has been carried out against with five other well-known meta-heuristics techniques, and it has shown SSO can be a suitable approach for ANN-MLP training step.

An study on ear detection and its applications to face detection

[EN]OpenCV includes di erent object detectors based on the Viola-Jones framework. Most of them are specialized to deal with the frontal face pattern and its inner elements: eyes, nose, and mouth. In this paper, we focus on the ear pattern detection, particularly when a head pro le or almost pro le view is present in the image. We aim at creating real-time ear detectors based on the general object detection framework provided with OpenCV. After training classi ers to detect left ears, right ears, and ears in general, the performance achieved is valid to be used to feed not only a head pose estimation system but also other applications such as those based on ear biometrics.

Knot theory and its applications

Nella tesi verranno presi in considerazione tre aspetti: si descriverà come la teoria dei nodi si sia sviluppata nel corso degli anni in relazione alle diverse scoperte scientifiche avvenute. Si potrà quindi subito avere una idea di come questa teoria sia estremamente connessa a diverse altre. Nel secondo capitolo ci si occuperà degli aspetti più formali di questa teoria. Si introdurrà il concetto di nodi equivalenti e di invariante dei nodi. Si definiranno diversi invarianti, dai più elementari, le mosse di Reidemeister, il numero di incroci e la tricolorabilità, fino ai polinomi invarianti, tra cui il polinomio di Alexander, il polinomio di Jones e quello di Kaufman. Infine si spiegheranno alcune applicazioni della teoria dei nodi in chimica, fisica e biologia. Sulla chimica, si definirà la chiralità molecolare e si mostrerà come la chiralità dei nodi possa essere utile nel determinare quella molecolare. In campo fisico, si mostrerà la relazione che esiste tra l'equazione di Yang-Baxter e i nodi. E in conclusione si mostrerà come modellare un importante processo biologico, la recombinazione del DNA, grazie alla teoria dei nodi.

Efficient certification of feasibility and objective value of linear programs and its applications

The use of linear programming in various areas has increased with the significant improvement of specialized solvers. Linear programs are used as such to model practical problems, or as subroutines in algorithms such as formal proofs or branch-and-cut frameworks. In many situations a certified answer is needed, for example the guarantee that the linear program is feasible or infeasible, or a provably safe bound on its objective value. Most of the available solvers work with floating-point arithmetic and are thus subject to its shortcomings such as rounding errors or underflow, therefore they can deliver incorrect answers. While adequate for some applications, this is unacceptable for critical applications like flight controlling or nuclear plant management due to the potential catastrophic consequences. We propose a method that gives a certified answer whether a linear program is feasible or infeasible, or returns unknown'. The advantage of our method is that it is reasonably fast and rarely answers unknown'. It works by computing a safe solution that is in some way the best possible in the relative interior of the feasible set. To certify the relative interior, we employ exact arithmetic, whose use is nevertheless limited in general to critical places, allowing us to rnremain computationally efficient. Moreover, when certain conditions are fulfilled, our method is able to deliver a provable bound on the objective value of the linear program. We test our algorithm on typical benchmark sets and obtain higher rates of success compared to previous approaches for this problem, while keeping the running times acceptably small. The computed objective value bounds are in most of the cases very close to the known exact objective values. We prove the usability of the method we developed by additionally employing a variant of it in a different scenario, namely to improve the results of a Satisfiability Modulo Theories solver. Our method is used as a black box in the nodes of a branch-and-bound tree to implement conflict learning based on the certificate of infeasibility for linear programs consisting of subsets of linear constraints. The generated conflict clauses are in general small and give good rnprospects for reducing the search space. Compared to other methods we obtain significant improvements in the running time, especially on the large instances.

The discrete Pascal transform and its applications

We introduce a new discrete polynomial transform constructed from the rows of Pascal’s triangle. The forward and inverse transforms are computed the same way in both the oneand two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in