Nash equilibrium strategies in discrete-time finite-horizon dynamic games with risk-and effort-averse players

The objective of this paper is to re-examine the risk-and effort attitude in the context of strategic dynamic interactions stated as a discrete-time finite-horizon Nash game. The analysis is based on the assumption that players are endogenously risk-and effort-averse. Each player is characterized by distinct risk-and effort-aversion types that are unknown to his opponent. The goal of the game is the optimal risk-and effort-sharing between the players. It generally depends on the individual strategies adopted and, implicitly, on the the players' types or characteristics.

In vitro growth of human urinary tract smooth muscle cells on laminin and collagen type I-coated membranes under static and dynamic conditions.

This study investigates in vitro growth of human urinary tract smooth muscle cells under static conditions and mechanical stimulation. The cells were cultured on collagen type I- and laminin-coated silicon membranes. Using a Flexcell device for mechanical stimulation, a cyclic strain of 0-20% was applied in a strain-stress-time model (stretch, 104 min relaxation, 15 s), imitating physiological bladder filling and voiding. Cell proliferation and alpha-actin, calponin, and caldesmon phenotype marker expression were analyzed. Nonstretched cells showed significant better growth on laminin during the first 8 days, thereafter becoming comparable to cells grown on collagen type I. Cyclic strain significantly reduced cell growth on both surfaces; however, better growth was observed on laminin. Neither the type of surface nor mechanical stimulation influenced the expression pattern of phenotype markers; alpha-actin was predominantly expressed. Coating with the extracellular matrix protein laminin improved in vitro growth of human urinary tract smooth muscle cells.

Dynamic of population-dynamics in a medically important snail species Lymnaea (Radix) Luteola (Lamarck)

The life-cycle parameters of the snail Lymnaea (Radix) luteola and the factors influencing the same have been studied under laboratory conditions. Ins each month, from July 1990 to June 1991, a batch of 100 zero-day old individual were considered for studies. The snails of April batch survived for 19.42 days while those in December batch survived for 87.45 days. The May batch individual though survived for 65.67 days gained maximum shell size (15.84 mm in length) and body weight (419.87 mg). All individuals of April batch died prior to attainment of sexual maturity. In the remaining 11 batches the snails became sexually mature between 32 and 53 days. At this stage, they were with varying shell lengths, 9.3 mm to 13,11 mm in respect to batches. The reproduction period varied from 1-67 days. An individual laid, on an average, 0,25 (March batch) to 443.67 (May batch) eggs in its life-span. A batch of such snails would leave 24312, 22520, 720268, 80408, 76067, 418165, 214, 9202, 0, 0, 2459386 and 127894 individuals at the end of 352nd day. Since the environmental conditions were almost similar the 'dynamic' of population dynamics seems to be involved with the 'strain' of the snail individuals of the batches concerned.

Optimization of a mouse immunization protocol with Paracoccidioides brasiliensis antigens

The objectives of the present study were to optimize the protocol of mouse immunization with Paracoccidioides brasiliensis antigens (Rifkind's protocol) and to test the modulation effect of cyclophosphamide (Cy) on the delayed hypersensitivity response (DHR) of immunized animals. Experiments were carried out using one to four immunizing doses of either crude particulate P. brasiliensis antigen or yeast-cell antigen, followed by DHR test four or seven days after the last immunizing dose. The data demonstrated that an immunizing dose already elicited response; higher DHR indices were obtained with two or three immunizing doses; there were no differences between DHR indices of animals challenged four or seven days after the last dose. Overall the inoculation of two or three doses of the yeast-cell antigen, which is easier to prepare, and DHR test at day 4 simplify the original Rifkind's immunization protocol and shorten the duration of the experiments. The modulation effect of Cy on DHR was assayed with administration of 2.5, 20 and 100 mg/kg weight at seven day intervals starting from day 4 prior to the first immunizing dose. Only the treatment with 2.5 mg Cy increased the DHR indices. Treatment with 100 mg Cy inhibited the DHR, whereas 20 mg Cy did not affect the DHR indices. Results suggest an immunostimulating effect of low dose of Cy on the DHR of mice immunized with P. brasiliensis antigens.

Dynamic calibration of our sense of time.

An accurate sense of time contributes to functions ranging from the perception and anticipation of sensory events to the production of coordinated movements. However, accumulating evidence demonstrates that time perception is subject to strong illusory distortion. In two experiments, we investigated whether the subjective speed of temporal perception is dependent on our visual environment. By presenting human observers with speed-altered movies of a crowded street scene, we modulated performance on subsequent production of "20s" elapsed intervals. Our results indicate that one's visual environment significantly contributes to calibrating our sense of time, independently of any modulation of arousal. This plasticity generates an assay for the integrity of our sense of time and its rehabilitation in clinical pathologies.

Encoding dysfunctions in a dynamic-static paradigm for visuospatial working memory in first-episode psychosis patients: a 2-year follow-up study.

Aim: To investigate static and dynamic visuospatial working memory (VSWM) processes in first-episode psychosis (FEP) patients and explore the validity of such measures as specific trait markers of schizophrenia. Methods: Twenty FEP patients and 20 age-, sex-, laterality- and education-matched controls carried out a dynamic and static VSWM paradigm. At 2-year follow up 13 patients met Diagnostic and Statistical Manual (of Mental Health Disorders) - Fourth Edition (DSM-IV) criteria for schizophrenia, 1 for bipolar disorder, 1 for brief psychotic episode and 5 for schizotypal personality disorder. Results: Compared with controls, the 20 FEP patients showed severe impairment in the dynamic VSWM condition but much less impairment in the static condition. No specific bias in stimulus selection was detected in the two tasks. Two-year follow-up evaluations suggested poorer baseline scores on the dynamic task clearly differentiated the 13 FEP patients who developed schizophrenia from the seven who did not. Conclusions: Results suggest deficits in VSWM in FEP patients. Specific exploratory analyses further suggest that deficit in monitoring-manipulation VSWM processes, especially involved in our dynamic VSWM task, can be a reliable marker of schizophrenia.

Signaling in Dynamic Contests: Some Impossibility Results

General signaling results in dynamic Tullock contests have been missing for long. The reason is the tractability of the problems. In this paper, an uninformed contestant with valuation vx competes against an informed opponent with valuation, either high vh or low vl. We show that; (i) When the hierarchy of valuations is vh ≥ vx ≥ vl, there is no pooling. Sandbagging is too costly for the high type. (ii) When the order of valuations is vx ≥ vh ≥ vl, there is no separation if vh and vl are close. Sandbagging is cheap due to the proximity of valuations. However, if vh and vx are close, there is no pooling. First period cost of pooling is high. (iii) For valuations satisfying vh ≥ vl ≥ vx, there is no separation if vh and vl are close. Bluffing in the first period is cheap for the low valuation type. Conversely, if vx and vl are close there is no pooling. Bluffing in the first stage is too costly. JEL: C72, C73, D44, D82. KEYWORDS: Signaling, Dynamic Contests, Non-existence, Sandbag Pooling, Bluff Pooling, Separating

Analysis and optimization of the satellite-to-plane link of an aeronautical global system

En aquest projecte s’ha analitzat i optimitzat l’enllaç satèl·lit amb avió per a un sistema aeronàutic global. Aquest nou sistema anomenat ANTARES està dissenyat per a comunicar avions amb estacions base mitjançant un satèl·lit. Aquesta és una iniciativa on hi participen institucions oficials en l’aviació com ara l’ECAC i que és desenvolupat en una col·laboració europea d’universitats i empreses. El treball dut a terme en el projecte compren bàsicament tres aspectes. El disseny i anàlisi de la gestió de recursos. La idoneïtat d’utilitzar correcció d’errors en la capa d’enllaç i en cas que sigui necessària dissenyar una opció de codificació preliminar. Finalment, estudiar i analitzar l’efecte de la interferència co-canal en sistemes multifeix. Tots aquests temes són considerats només per al “forward link”. L’estructura que segueix el projecte és primer presentar les característiques globals del sistema, després centrar-se i analitzar els temes mencionats per a poder donar resultats i extreure conclusions.

Line search multilevel optimization as computational methods for dense optical flow

We evaluate the performance of different optimization techniques developed in the context of optical flowcomputation with different variational models. In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we develop the use of efficient multilevel schemes for computing the optical flow. More precisely, we evaluate the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/OPT), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/OPT). The FMG/OPT algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. Experimental results on different image sequences using four models of optical flow computation show that the FMG/OPT algorithm outperforms both the TN and MR/OPT algorithms in terms of the computational work and the quality of the optical flow estimation.

Restriction site-associated DNA sequencing, genotyping error estimation and de novo assembly optimization for population genetic inference.

Restriction site-associated DNA sequencing (RADseq) provides researchers with the ability to record genetic polymorphism across thousands of loci for nonmodel organisms, potentially revolutionizing the field of molecular ecology. However, as with other genotyping methods, RADseq is prone to a number of sources of error that may have consequential effects for population genetic inferences, and these have received only limited attention in terms of the estimation and reporting of genotyping error rates. Here we use individual sample replicates, under the expectation of identical genotypes, to quantify genotyping error in the absence of a reference genome. We then use sample replicates to (i) optimize de novo assembly parameters within the program Stacks, by minimizing error and maximizing the retrieval of informative loci; and (ii) quantify error rates for loci, alleles and single-nucleotide polymorphisms. As an empirical example, we use a double-digest RAD data set of a nonmodel plant species, Berberis alpina, collected from high-altitude mountains in Mexico.

An algorithm for semi-infinite polynomial optimization

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

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.

On the stability of the optimal value and the optimal set in optimization problems

The paper develops a stability theory for the optimal value and the optimal set mapping of optimization problems posed in a Banach space. The problems considered in this paper have an arbitrary number of inequality constraints involving lower semicontinuous (not necessarily convex) functions and one closed abstract constraint set. The considered perturbations lead to problems of the same type as the nominal one (with the same space of variables and the same number of constraints), where the abstract constraint set can also be perturbed. The spaces of functions involved in the problems (objective and constraints) are equipped with the metric of the uniform convergence on the bounded sets, meanwhile in the space of closed sets we consider, coherently, the Attouch-Wets topology. The paper examines, in a unified way, the lower and upper semicontinuity of the optimal value function, and the closedness, lower and upper semicontinuity (in the sense of Berge) of the optimal set mapping. This paper can be seen as a second part of the stability theory presented in [17], where we studied the stability of the feasible set mapping (completed here with the analysis of the Lipschitz-like property).