Social exclusion mobility in Spain, 1994-2000

Social exclusion can be defined as a process leading to a state of multiple functioning deprivations. Cross-sectional headcount ratios of social exclusion may overstate the extent of the problem if most individuals do not remain in the same state in successive years. To address this issue, we need to focus on mobility. Therefore, the aim of this paper is to analyse changes in the individual levels of social exclusion focusing on the extent to which individuals change place in social exclusion distribution.

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.

The third order Melnikov function of a quadratic center under quadratic perturbation

We study quadratic perturbations of the integrable system (1+x)dH; where H =(x²+y²)=2: We prove that the first three Melnikov functions associated to the perturbed system give rise at most to three limit cycles.

Quadratic perturbations of a quadratic reversible Lotka-Volterra System

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

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.

Orbit decidability and the conjugacy problem for some extensions of groups

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

Aplicaciones Single Program Multiple Data (SPMD) en ambientes distribuidos

Un reto al ejecutar las aplicaciones en un cluster es lograr mejorar las prestaciones utilizando los recursos de manera eficiente, y este reto es mayor al utilizar un ambiente distribuido. Teniendo en cuenta este reto, se proponen un conjunto de reglas para realizar el cómputo en cada uno de los nodos, basado en el análisis de cómputo y comunicaciones de las aplicaciones, se analiza un esquema de mapping de celdas y un método para planificar el orden de ejecución, tomando en consideración la ejecución por prioridad, donde las celdas de fronteras tienen una mayor prioridad con respecto a las celdas internas. En la experimentación se muestra el solapamiento del computo interno con las comunicaciones de las celdas fronteras, obteniendo resultados donde el Speedup aumenta y los niveles de eficiencia se mantienen por encima de un 85%, finalmente se obtiene ganancias de los tiempos de ejecución, concluyendo que si se puede diseñar un esquemas de solapamiento que permita que la ejecución de las aplicaciones SPMD en un cluster se hagan de forma eficiente.

The generic Hanna Neumann conjecture and post correspondence problem

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

Price level convergence, purchasing power parity and multiple structural breaks: an application to US cities

This article provides a fresh methodological and empirical approach for assessing price level convergence and its relation to purchasing power parity (PPP) using annual price data for seventeen US cities. We suggest a new procedure that can handle a wide range of PPP concepts in the presence of multiple structural breaks using all possible pairs of real exchange rates. To deal with cross-sectional dependence, we use both cross-sectional demeaned data and a parametric bootstrap approach. In general, we find more evidence for stationarity when the parity restriction is not imposed, while imposing parity restriction provides leads toward the rejection of the panel stationar- ity. Our results can be embedded on the view of the Balassa-Samuelson approach, but where the slope of the time trend is allowed to change in the long-run. The median half-life point estimate are found to be lower than the consensus view regardless of the parity restriction.

Algebraic properties of isochronous centers of polynomial quadratic-like Hamiltonian systems

Projecte de recerca elaborat a partir d’una estada a la School of Mathematics and Statistics de la University of Plymouth, United Kingdom, entre abril juliol del 2007.Aquesta investigació és encara oberta i la memòria que presento constitueix un informe de la recerca que estem duent a terme actualment. En aquesta nota estudiem els centres isòcrons dels sistemes Hamiltonians analítics, parant especial atenció en el cas polinomial. Ens centrem en els anomenats quadratic-like Hamiltonian systems. Diverses propietats dels centres isòcrons d'aquest tipus de sistemes van ser donades a [A. Cima, F. Mañosas and J. Villadelprat, Isochronicity for several classes of Hamiltonian systems, J. Di®erential Equations 157 (1999) 373{413]. Aquell article estava centrat principalment en el cas en que A; B i C fossin funcions analítiques. El nostre objectiu amb l'estudi que estem duent a terme és investigar el cas en el que aquestes funcions són polinomis. En aquesta nota formulem una conjectura concreta sobre les propietats algebraiques que venen forçades per la isocronia del centre i provem alguns resultats parcials.

Simulations of parasitic and intrinsic capacitances related to Multiple-Gate-Field-Effect Transistor architectures

Report for the scientific sojourn carried out at the Université Catholique de Louvain, Belgium, from March until June 2007. In the first part, the impact of important geometrical parameters such as source and drain thickness, fin spacing, spacer width, etc. on the parasitic fringing capacitance component of multiple-gate field-effect transistors (MuGFET) is deeply analyzed using finite element simulations. Several architectures such as single gate, FinFETs (double gate), triple-gate represented by Pi-gate MOSFETs are simulated and compared in terms of channel and fringing capacitances for the same occupied die area. Simulations highlight the great impact of diminishing the spacing between fins for MuGFETs and the trade-off between the reduction of parasitic source and drain resistances and the increase of fringing capacitances when Selective Epitaxial Growth (SEG) technology is introduced. The impact of these technological solutions on the transistor cut-off frequencies is also discussed. The second part deals with the study of the effect of the volume inversion (VI) on the capacitances of undoped Double-Gate (DG) MOSFETs. For that purpose, we present simulation results for the capacitances of undoped DG MOSFETs using an explicit and analytical compact model. It monstrates that the transition from volume inversion regime to dual gate behaviour is well simulated. The model shows an accurate dependence on the silicon layer thickness,consistent withtwo dimensional numerical simulations, for both thin and thick silicon films. Whereas the current drive and transconductance are enhanced in volume inversion regime, our results show thatintrinsic capacitances present higher values as well, which may limit the high speed (delay time) behaviour of DG MOSFETs under volume inversion regime.

The simultaneous conjugacy problem in groups of piecewise linear functions

Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give an elementary proof for the solution of the latter question. This relies purely on the description of F as the group of piecewise linear orientation-preserving homeomorphisms of the unit. The techniques we develop allow us also to solve the ordinary conjugacy problem as well, and we can compute roots and centralizers. Moreover, these techniques can be generalized to solve the same questions in larger groups of piecewise-linear homeomorphisms.