La voz flamenca del violín

Este proyecto representa una aproximación al flamenco desde la música clásica, y más concretamente desde el punto de vista violinístico. Se trata de una visión personal sobre los elementos técnicos e interpretativos a seguir para adentrarnos en la estilística flamenca. Ampliar los conocimientos musicales para así enriquecernos y crecer, tanto como personas como músicos. De la fusión musical emergen nuevos horizontes con los que poder expresarnos. Esto nos abre las puertas a la creatividad.

The achievable region approach to the optimal control of stochastic systems

The achievable region approach seeks solutions to stochastic optimisation problems by: (i) characterising the space of all possible performances(the achievable region) of the system of interest, and (ii) optimisingthe overall system-wide performance objective over this space. This isradically different from conventional formulations based on dynamicprogramming. The approach is explained with reference to a simpletwo-class queueing system. Powerful new methodologies due to the authorsand co-workers are deployed to analyse a general multiclass queueingsystem with parallel servers and then to develop an approach to optimalload distribution across a network of interconnected stations. Finally,the approach is used for the first time to analyse a class of intensitycontrol problems.

Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs

Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.

Shared knowledge

Agents use their knowledge on the history of the economy in orderto choose what is the optimal action to take at any given moment of time,but each individual observes history with some noise. This paper showsthat the amount of information available on the past evolution of theeconomy is an endogenous variable, and that this leads to overconcentrationof the investment, which can be interpreted as underinvestment in research.It presents a model in which agents have to invest at each period in one of$K$ sectors, each of them paying an exogenous return that follows a welldefined stochastic path. At any moment of time each agent receives an unbiasednoisy signal on the payoff of each sector. The signals differ across agents,but all of them have the same variance, which depends on the aggregate investmentin that particular sector (so that if almost everybody invests in it theperceptions of everybody will be very accurate, but if almost nobody doesthe perceptions of everybody will be very noisy). The degree of hetereogeneityacross agents is then an endogenous variable, evolving across time determining,and being determined by, the amount of information disclosed.As long as both the level of social interaction and the underlying precisionof the observations are relatively large agents behave in a very preciseway. This behavior is unmodified for a huge range of informational parameters,and it is characterized by an excessive concentration of the investment ina few sectors. Additionally the model shows that generalized improvements in thequality of the information that each agent gets may lead to a worse outcomefor all the agents due to the overconcentration of the investment that thisproduces.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

Globalization and wage inequality in South and East Asia, and Latin America: A gender approach

In this paper we analyse the reasons behind the evolution of the gender gap and wage inequality in South and East Asian and Latin American countries. Health human capital improvements, the exposure to free market openness and equal treatment enforcement laws seem to be the main exogenous variables affecting women s economic condition. During the second globalization era (in the years 1975-2000) different combinations of these variables in South East Asian and Latin American countries have had as a result the diminution of the gender gap. The main exception to this rule according to our data is China where economic reforms have been simultaneous to the increase of gender differences and inequality between men and women.This result has further normative consequences for the measure of economic inequality. Theimprovement of women s condition has as a result the diminution of the dispersion of wages.Therefore in most of the countries analysed the consequence of the diminution of the gender gapduring the second global era is the decrease of wage inequality both measured with Gini and Theil indexes.

On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Restless bandits, partial conservation laws and indexability

We show that if performance measures in a stochastic scheduling problem satisfy a set of so-called partial conservation laws (PCL), which extend previously studied generalized conservation laws (GCL), then the problem is solved optimally by a priority-index policy for an appropriate range of linear performance objectives, where the optimal indices are computed by a one-pass adaptive-greedy algorithm, based on Klimov's. We further apply this framework to investigate the indexability property of restless bandits introduced by Whittle, obtaining the following results: (1) we identify a class of restless bandits (PCL-indexable) which are indexable; membership in this class is tested through a single run of the adaptive-greedy algorithm, which also computes the Whittle indices when the test is positive; this provides a tractable sufficient condition for indexability; (2) we further indentify the class of GCL-indexable bandits, which includes classical bandits, having the property that they are indexable under any linear reward objective. The analysis is based on the so-called achievable region method, as the results follow fromnew linear programming formulations for the problems investigated.

The survival of the welfare state

This paper provides an analytical characterization of Markov perfectequilibria in a politico-economic model with repeated voting, whereagents vote over distortionary income redistribution. The key featureof the theory is that the future constituency of redistributive policiesdepends positively on the current level of redistribution, since thisaffects both private investments and the future distribution of voters.Agents vote rationally and fullly anticipate the effects of their politicalchoice on both private incentives and future voting outcomes. The modelfeatures multiple equilibria. In "pro-welfare" equilibria, both welfarestate policies and their effects on distribution persist forever. In"anti-welfare equilibria", even a majority of beneficiaries ofredistributive policies vote strategically so as to induce the formationof a future majority that will vote for zero redistribution.

Contenido estomacal de la anchoveta en cuatro áreas de la costa peruana

Presenta aspectos del alimento y hábitos alimenticios de la anchoveta, basado en la determinación cuantitativa y cualitativa de los diferentes grupos de organismos que forman su dieta alimenticia. Para tal efecto realizan el análisis del contenido estomacal de anchovetas pescados a 20 millas aproximadamente, de la costa en las áreas de Chimbote, Supe, Callao y Tambo de Mora, durante la misma época del año.

Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu-Kumar network

We argue the importance both of developing simple sufficientconditions for the stability of general multiclass queueing networks and also of assessing such conditions under a range of assumptions on the weight of the traffic flowing between service stations. To achieve the former, we review a peak-rate stability condition and extend its range of application and for the latter, we introduce a generalisation of the Lu-Kumar network on which the stability condition may be tested for a range of traffic configurations. The peak-rate condition is close to exact when the between-station traffic is light, but degrades as this traffic increases.

Crucero de evaluación de la biomasa desovante de la anchoveta peruana, 1995. Actividades, resultados y perspectivas

Con el propósito de estimar la biomasa desovante de las especies anchoveta peruana (Engraulis ringens J.) y sardina (Sardinops sagax sagax J.), se ejecutó el Crucero 9508-09 a bordo del BIC Humboldt y del SNP-1, del 12 de agosto al 22 de setiembre de 1995, cubriendo el área entre Tambo de Mora (13°30 'S) y Paita (5°S). Se obtuvo los cinco parámetros que el Método de Producción de Huevos (MPH) requiere para estimar la biomasa de la población desovante de la anchoveta. Además se consideró cuatro perfiles para investigar las variables oceanográficas: Callao (12° S) y Chimbote (9°10 'S) hasta las 100 millas y Punta Falsa (6°S) y Paita hasta 150 millas de la costa. La biomasa desovante de la anchoveta estimada por el MPH entre Tambo de Mora y Punta Falsa en agosto y setiembre de 1995, fue calculada en 5,9 millones de toneladas, con una producción diaria de huevos de 19,1 E+13 y una frecuencia de desove de 0,12. La anchoveta estuvo localizada cerca de la costa entre Callao y Chimbote, mientras que de Salaverry (8°13 'S) a Punta Falsa, su distribución se amplió, alcanzando hasta las 60 millas fuera de la costa. No se pudo estimar la biomasa desovante de la sardina debido a la dispersión de este recurso. Durante el desarrollo del crucero, las condiciones oceanográficas se encontraron dentro de la normalizada para la época, con afloramientos intensos en la franja costera y con advección de aguas tropicales superficiales de Chancay (11°35 'S) a Casma (9°27 'S).