Periodic orbits near a heteroclinic loop formed by one dimensional orbit and a 2-dimensional manifold: application to the charged collinear 3-body problem

The paper is devoted to the study of a type of differential systems which appear usually in the study of some Hamiltonian systems with 2 degrees of freedom. We prove the existence of infinitely many periodic orbits on each negative energy level. All these periodic orbits pass near the total collision. Finally we apply these results to study the existence of periodic orbits in the charged collinear 3–body problem.

Bribe-proof rules in the division problem

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a strictly preferred share. We characterize all bribe-proof rules as the class of efficient, strategy-proof, and weak replacement monotonic rules. In addition, we identify the functional form of all bribe-proof and tops-only rules.

A maximal domain of preferences for tops-only rules in the division problem

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, continuity, and "tops-onlyness". These domains (called weakly single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.

On Boas-Type Problem

R.P. Boas has found necessary and sufficient conditions of belonging of function to Lipschitz class. From his findings it turned out, that the conditions on sine and cosine coefficients for belonging of function to Lip α(0 & α & 1) are the same, but for Lip 1 are different. Later his results were generalized by many authors in the viewpoint of generalization of condition on the majorant of modulus of continuity. The aim of this paper is to obtain Boas-type theorems for generalized Lipschitz classes. To define generalized Lipschitz classes we use the concept of modulus of smoothness of fractional order.

Normal forms for rational difference equations with applications to the global periodicity problem

We propose a classification and derive the associated normal forms for rational difference equations with complex coefficients. As an application, we study the global periodicity problem for second order rational difference equations with complex coefficients. We find new necessary conditions as well as some new examples of globally periodic equations.

Data size sufficiency analyses of haplotype inference algortihms

We present experimental and theoretical analyses of data requirements for haplotype inference algorithms. Our experiments include a broad range of problem sizes under two standard models of tree distribution and were designed to yield statistically robust results despite the size of the sample space. Our results validate Gusfield's conjecture that a population size of n log n is required to give (with high probability) sufficient information to deduce the n haplotypes and their complete evolutionary history. The experimental results inspired our experimental finding with theoretical bounds on the population size. We also analyze the population size required to deduce some fixed fraction of the evolutionary history of a set of n haplotypes and establish linear bounds on the required sample size. These linear bounds are also shown theoretically.

The word problem distinguishes counter languages

Counter automata are more powerful versions of finite state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of Zn is accepted by a nondeterministic m-counter automaton if and only if m &= n.

On the complexity of the Whitehead minimization problem

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to solve this problem, that is, an algorithm that is polynomial both in the length of the input word and in the rank of the free group. Earlier algorithms had an exponential dependency in the rank of the free group. It follows that the primitivity problem – to decide whether a word is an element of some basis of the free group – and the free factor problem can also be solved in polynomial time.

Addressing the net balances problem as a prerequisite for EU budget reform: a proposal

Conflict among member states regarding the distribution of net financial burdens has been allowed to contaminate the entire design of the EU budget with very negative consequences in terms of equity, efficiency and transparency. To get around this problem and pave the way for a substantive budget reform, we propose to decouple distributional negotiations from the rest of the budget process by linking member state net balances in a rigid manner to relative prosperity. This would be achieved through the introduction of a system of compensating horizontal transfers that would take to its logical conclusion the Commission's proposal for a generalized compensation mechanism. We discuss the impact of the proposed scheme on member states? incentives and illustrate its financial implications using revenue and expenditure projections for 2013 that are based on the current Financial Perspectives and Own Resources Decision.

Renal transplantation following aorto-iliac reconstruction is a safe a strategy

Introduction: Renal transplantation is considered the treatment of choice for end-stage renal disease. However, the association of occlusive aorto-iliac disease and chronic renal failure is frequent and aorto-iliac reconstruction may be necessary prior to renal transplantation. This retrospective study reviews the results of this operative strategy.Material and Methods: Between January 2001 and June 2010, 309 patients underwent renal transplantation at our institution and 8 patients had prior aorto-iliac reconstruction using prosthetic material. There were 6 men and 2 women with a median age of 62 years (range 51-70). Five aorto-bifemoral and 2 aorto-bi-iliac bypasses were performed for stage II (n=5), stage IV (n=1) and aortic aneurysm (n=1). In one patient, iliac kissing stents and an ilio-femoral bypass were implanted. 4 cadaveric and 4 living donor renal transplantations were performed with an interval of 2 months to 10 years after revascularization.The results were analysed with respect of graft and patients survival. Differences between groups were tested by the log rank method.Results: No complications and no death occurred in the post-operative period. All bypasses remained patent during follow-up. The median time of post transplantation follow-up was 46 months for all patients and 27 months for patients with prior revascularization. In the revascularized group and control group, the graft and patient survival at 1 year were respectively 100%/96%, 100%/99% and at 5 years 86%/86%, 86%/94%, without significant differences between both groups.Discussion: Our results suggest that renal transplantation following prior aorto-iliac revascularisation with prosthetic material is safe and effective. Patients with end-stage renal disease and concomitant aorto-iliac disease should therefore be considered for renal transplantation. However, caution in the interpretation of the results is indicated due to the small sample size of our study.

Orbit decidability and the conjugacy problem for some extensions of groups

"Vegeu el resum a l'inici del document del fitxer adjunt."

The generic Hanna Neumann conjecture and post correspondence problem

"Vegeu el resum a l'inici del document del fitxer adjunt."

Estudio de las capas de acoplamiento y alternativas al reflector de Bragg en estructuras BAW-CRF

Las capas de acoplamiento son un elemento clave en los dispositivos BAW CRF. El factor de acoplamiento K de estas capas permite el diseño de una determinada respuesta. Debido al limitado número de materiales con las que implementarlas, las soluciones que utilizan capas de λ/4 ofrecen un rango discreto de K. Por otra parte, el reflector de Bragg es un mecanismo de aislamiento mecánico entre el sustrato y la estructura BAW que está formado por capas alternas de alta y baja impedancia acústica de λ/4. El problema que presenta es la reducción del factor de calidad asociado a las pérdidas producida por las ondas shear. Este proyecto presenta un método para la obtención de un rango continuo de factores de acoplamiento y estudia la mejora del factor de calidad de las estructuras BAW con reflector de Bragg partiendo de dos materiales con alta y baja impedancia acústica.

Model based fault diagnosis with application to an automotive engine

Report for the scientific sojourn at the University of Linköping between April to July 2007. Monitoring of the air intake system of an automotive engine is important to meet emission related legislative diagnosis requirements. During the research the problem of fault detection in the air intake system was stated as a constraint satisfaction problem over continuous domains with a big number of variables and constraints. This problem was solved using Interval-based Consistency Techniques. Interval-based consistency techniques are shown to be particularly efficient for checking the consistency of the Analytical Redundancy Relations (ARRs), dealing with uncertain measurements and parameters, and using experimental data. All experiments were performed on a four-cylinder turbo-charged spark-ignited SAAB engine located in the research laboratory at Vehicular System Group - University of Linköping.