Income maintenance programs and multidimensional screening

This paper examines properties of optimal poverty assistance programs under different informational environments using an income maintenanceframework. To that end, we make both the income generating ability andthe disutility of labor of individuals unobservable, and compare theresulting benefit schedules with those of programs found in the UnitedStates since Welfare Reform (1996). We find that optimal programs closelyresemble a Negative Income Tax with a Benefit Reduction rate that dependson the distribution of population characteristics. A policy of workfare(unpaid public sector work) is inefficient when disutility of labor isunobservable, but minimum work requirements (for paid work) may be usedin that same environment. The distortions to work incentives and thepresence of minimum work requirements depend on the observability andrelative importance of the population's characteristics.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Restless bandits, linear programming relaxations and a primal-dual index heuristic

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Exploiting fitness distance correlation of set covering problems

The set covering problem is an NP-hard combinatorial optimization problemthat arises in applications ranging from crew scheduling in airlines todriver scheduling in public mass transport. In this paper we analyze searchspace characteristics of a widely used set of benchmark instances throughan analysis of the fitness-distance correlation. This analysis shows thatthere exist several classes of set covering instances that have a largelydifferent behavior. For instances with high fitness distance correlation,we propose new ways of generating core problems and analyze the performanceof algorithms exploiting these core problems.

Adaptive dynamics and the implementation problem with complete information

This paper studies the equilibrating process of several implementationmechanisms using naive adaptive dynamics. We show that the dynamics convergeand are stable, for the canonical mechanism of implementation in Nash equilibrium.In this way we cast some doubt on the criticism of ``complexity'' commonlyused against this mechanism. For mechanisms that use more refined equilibrium concepts,the dynamics converge but are not stable. Some papers in the literatureon implementation with refined equilibrium concepts have claimed that themechanisms they propose are ``simple'' and implement ``everything'' (incontrast with the canonical mechanism). The fact that some of these ``simple''mechanisms have unstable equilibria suggests that these statements shouldbe interpreted with some caution.

Tenda Virtual orientada a compres per escaneig amb el telèfon mòbil

CMS (Sistema Gestor de Continguts) és una tecnologia en ple auge que permet implantar solucions web d'una manera senzilla, econòmica i amb un fàcil manteniment per part dels usuaris que en fan ús. Aquest projecte és un estudi que pretén analitzar i escollir el millor CMS dirigit a comerç electrònic d'entre el ventall existent actualment al mercat, creant un document que serveixi de referent o guia a qualsevol persona interessada en implantar un sistema d'aquestes característiques. A més, es centrarà a la programació d'un component instal·lable pel CMS escollit que permeti introduir-nos a la creació d'extensions i ens formi en l'àmbit de la programació web. Aquest component el podrem afegir al CMS i permetrà realitzar compres escanejant codis amb el telèfon mòbil.

Taking "Galton's problem" Seriously : Towards a Theory of Policy Diffusion

This article builds on the recent policy diffusion literature and attempts to overcome one of its major problems, namely the lack of a coherent theoretical framework. The literature defines policy diffusion as a process where policy choices are interdependent, and identifies several diffusion mechanisms that specify the link between the policy choices of the various actors. As these mechanisms are grounded in different theories, theoretical accounts of diffusion currently have little internal coherence. In this article we put forward an expected-utility model of policy change that is able to subsume all the diffusion mechanisms. We argue that the expected utility of a policy depends on both its effectiveness and the payoffs it yields, and we show that the various diffusion mechanisms operate by altering these two parameters. Each mechanism affects one of the two parameters, and does so in distinct ways. To account for aggregate patterns of diffusion, we embed our model in a simple threshold model of diffusion. Given the high complexity of the process that results, strong analytical conclusions on aggregate patterns cannot be drawn without more extensive analysis which is beyond the scope of this article. However, preliminary considerations indicate that a wide range of diffusion processes may exist and that convergence is only one possible outcome.

LRF-mediated Dll4 repression in erythroblasts is necessary for hematopoietic stem cell maintenance.

Hematopoietic stem cells (HSCs) are the most primitive cells in the hematopoietic system and are under tight regulation for self-renewal and differentiation. Notch signals are essential for the emergence of definitive hematopoiesis in mouse embryos and are critical regulators of lymphoid lineage fate determination. However, it remains unclear how Notch regulates the balance between HSC self-renewal and differentiation in the adult bone marrow (BM). Here we report a novel mechanism that prevents HSCs from undergoing premature lymphoid differentiation in BM. Using a series of in vivo mouse models and functional HSC assays, we show that leukemia/lymphoma related factor (LRF) is necessary for HSC maintenance by functioning as an erythroid-specific repressor of Delta-like 4 (Dll4) expression. Lrf deletion in erythroblasts promoted up-regulation of Dll4 in erythroblasts, sensitizing HSCs to T-cell instructive signals in the BM. Our study reveals novel cross-talk between HSCs and erythroblasts, and sheds a new light on the regulatory mechanisms regulating the balance between HSC self-renewal and differentiation.

Maintenance Service Level Map, October 13, 2006

Maintenance Service Level Map

Exposure of highway maintenance workers to fine particulate matter and noise

In this study, we assessed the mixed exposure of highway maintenance workers to airborne particles, noise, and gaseous co-pollutants. The aim was to provide a better understanding of the workers' exposure to facilitate the evaluation of short-term effects on cardiovascular health endpoints. To quantify the workers' exposure, we monitored 18 subjects during 50 non-consecutive work shifts. Exposure assessment was based on personal and work site measurements and included fine particulate matter (PM2.5), particle number concentration (PNC), noise (Leq), and the gaseous co-pollutants: carbon monoxide, nitrogen dioxide, and ozone. Mean work shift PM2.5 concentrations (gravimetric measurements) ranged from 20.3 to 321 μg m(-3) (mean 62 μg m(-3)) and PNC were between 1.6×10(4) and 4.1×10(5) particles cm(-3) (8.9×10(4) particles cm(-3)). Noise levels were generally high with Leq over work shifts from 73.3 to 96.0 dB(A); the averaged Leq over all work shifts was 87.2 dB(A). The highest exposure to fine and ultrafine particles was measured during grass mowing and lumbering when motorized brush cutters and chain saws were used. Highest noise levels, caused by pneumatic hammers, were measured during paving and guardrail repair. We found moderate Spearman correlations between PNC and PM2.5 (r = 0.56); PNC, PM2.5, and CO (r = 0.60 and r = 0.50) as well as PNC and noise (r = 0.50). Variability and correlation of parameters were influenced by work activities that included equipment causing combined air pollutant and noise emissions (e.g. brush cutters and chain saws). We conclude that highway maintenance workers are frequently exposed to elevated airborne particle and noise levels compared with the average population. This elevated exposure is a consequence of the permanent proximity to highway traffic with additional peak exposures caused by emissions of the work-related equipment.

Maintenance of neuronal expression of calbindin by a muscular extract in cultures of chick dorsal root ganglion cells.

Calbindin D-28K is a calcium-binding protein which is expressed by subpopulations of dorsal root ganglion cells cultured from 10-day-old (E10) chick embryos. After 7 or 10 days of culture, more than 20% of the ganglion cells are immunostained by an anticalbindin-antiserum; however, after 14 days of culture, the proportion drops to 10%. This fall can be prevented by addition of muscle extract to cultures at 10 days. Thus the transitory expression of calbindin-immunoreactivity by responsive sensory neurons would be not only induced but also maintained by a differentiation factor of muscular origin.