Some remarks on the class of continuous (Semi-) strictcly quasiconvex functions

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

On rigid analytic uniformizations of Jacobians of Shimura curves

The main goal of this article is to give an explicit rigid analytic uniformization of the maximal toric quotient of the Jacobian of a Shimura curve over Q at a prime dividing exactly the level. This result can be viewed as complementary to the classical theorem of Cerednik and Drinfeld which provides rigid analytic uniformizations at primes dividing the discriminant. As a corollary, we offer a proof of a conjecture formulated by M. Greenberg in hispaper on Stark-Heegner points and quaternionic Shimura curves, thus making Greenberg's construction of local points on elliptic curves over Q unconditional.

Generic optimality conditions for semi-algebraic convex programs

We consider linear optimization over a nonempty convex semi-algebraic feasible region F. Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique \active" manifold, around which F is \partly smooth", and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of the optimal solution. The active manifold consists, locally, of these perturbed optimal solutions; it is independent of the representation of F, and is eventually identified by a variety of iterative algorithms such as proximal and projected gradient schemes. These results extend to unbounded sets F.

Rigid flat webs on the projective plane

This paper studies global webs on the projective plane with vanishing curvature. The study is based on an interplay of local and global arguments. The main local ingredient is a criterium for the regularity of the curvature at the neighborhood of a generic point of the discriminant. The main global ingredient, the Legendre transform, is an avatar of classical projective duality in the realm of differential equations. We show that the Legendre transform of what we call reduced convex foliations are webs with zero curvature, and we exhibit a countable infinity family of convex foliations which give rise to a family of webs with zero curvature not admitting non-trivial deformations with zero curvature.

An algorithm for semi-infinite polynomial optimization

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

Discrete time Non-homogeneous Semi-Markov Processes applied to Models for Disability Insurance

In this paper, we present a stochastic model for disability insurance contracts. The model is based on a discrete time non-homogeneous semi-Markov process (DTNHSMP) to which the backward recurrence time process is introduced. This permits a more exhaustive study of disability evolution and a more efficient approach to the duration problem. The use of semi-Markov reward processes facilitates the possibility of deriving equations of the prospective and retrospective mathematical reserves. The model is applied to a sample of contracts drawn at random from a mutual insurance company.

Semi-online neural-Q_leaming for real-time robot learning

Reinforcement learning (RL) is a very suitable technique for robot learning, as it can learn in unknown environments and in real-time computation. The main difficulties in adapting classic RL algorithms to robotic systems are the generalization problem and the correct observation of the Markovian state. This paper attempts to solve the generalization problem by proposing the semi-online neural-Q_learning algorithm (SONQL). The algorithm uses the classic Q_learning technique with two modifications. First, a neural network (NN) approximates the Q_function allowing the use of continuous states and actions. Second, a database of the most representative learning samples accelerates and stabilizes the convergence. The term semi-online is referred to the fact that the algorithm uses the current but also past learning samples. However, the algorithm is able to learn in real-time while the robot is interacting with the environment. The paper shows simulated results with the "mountain-car" benchmark and, also, real results with an underwater robot in a target following behavior

Generació semi-automàtica de façanes procedurals

L’objectiu d’aquest PFC és desenvolupar una eina d’edició de façanes procedural apartir d’una imatge d’una façana real. L’aplicació generarà les regles procedurals de lafaçana a partir de dades adquirides del model que es vol representar, com unafotografia. L’usuari de l’aplicació generarà de forma semi-automàtica i interactiva lesregles de subdivisió i repetició, especificant també la inserció de elementsarquitectònics (portes, finestres), que podran ser instanciats a partir d’una llibreria. Uncop generades, les regles s’escriuran en el format del sistema BuildingEngine perintegrar-se completament dins el procés de modelatge urbà.Aquest projecte es desenvoluparà en Matlab

Building an honest microfinance organization: Embezzlement and the optimality of rigid repayment schedules and joint liability

We consider the agency problem of a staff member managing microfinancing programs, who can abuse his discretion to embezzle borrowers' repayments. The fact that most borrowers of microfinancing programs are illiterate and live in rural areas where transportation costs are very high make staff's embezzlement particularly relevant as is documented by Mknelly and Kevane (2002). We study the trade-off between the optimal rigid lending contract and the optimal discretionary one and find that a rigid contract is optimal when the audit cost is larger than gains from insurance. Our analysis explains rigid repayment schedules used by the Grameen bank as an optimal response to the bank staff's agency problem. Joint liability reduces borrowers' burden of respecting the rigid repayment schedules by providing them with partial insurance. However, the same insurance can be provided byborrowers themselves under individual liability through a side-contract.

Geometría flexible para las estructuras de barras

This article brings a geometric proposal which can be applied to the bar structures. The starting point is the substitution of the usual knots in a structural web by a system of combining the bars tivo by two, which is achieved by twisting the bars in each knot. The tensile forces that appear and the introduction of joints in each of these knots allow the transition from a rigid or undeformablegeometiy to a neiv flexible" one leading to the possibility of one and the same structural web adopting different sizes while preserving its original geometric form

Semi-purity of tempered Deligne cohomology

In this paper we define the formal and tempered Deligne cohomology groups, that are obtained by applying the Deligne complex functor to the complexes of formal differential forms and tempered currents respectively. We then prove the existence of a duality between them, a vanishing theorem for the former and a semipurity property for the latter. The motivation of these results comes from the study of covariant arithmetic Chow groups. The semipurity property of tempered Deligne cohomology implies, in particular, that several definitions of covariant arithmetic Chow groups agree for projective arithmetic varieties.

Impedance field and transition from thermal to shot noise in Cd1-xZnxTe semi-insulating Ohmic detectors

Within a drift-diffusion model we investigate the role of the self-consistent electric field in determining the impedance field of a macroscopic Ohmic (linear) resistor made by a compensated semi-insulating semiconductor at arbitrary values of the applied voltage. The presence of long-range Coulomb correlations is found to be responsible for a reshaping of the spatial profile of the impedance field. This reshaping gives a null contribution to the macroscopic impedance but modifies essentially the transition from thermal to shot noise of a macroscopic linear resistor. Theoretical calculations explain a set of noise experiments carried out in semi-insulating CdZnTe detectors.