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 the problem 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.

Measuring strategic uncertainty in coordination games

This paper explores three aspects of strategic uncertainty: its relation to risk, predictability of behavior and subjective beliefs of players. In a laboratory experiment we measure subjects certainty equivalents for three coordination games and one lottery. Behavior in coordination games is related to risk aversion, experience seeking, and age.From the distribution of certainty equivalents we estimate probabilities for successful coordination in a wide range of games. For many games, success of coordination is predictable with a reasonable error rate. The best response to observed behavior is close to the global-game solution. Comparing choices in coordination games with revealed risk aversion, we estimate subjective probabilities for successful coordination. In games with a low coordination requirement, most subjects underestimate the probability of success. In games with a high coordination requirement, most subjects overestimate this probability. Estimating probabilistic decision models, we show that the quality of predictions can be improved when individual characteristics are taken into account. Subjects behavior is consistent with probabilistic beliefs about the aggregate outcome, but inconsistent with probabilistic beliefs about individual behavior.

Contribution biplots

In order to interpret the biplot it is necessary to know which points usually variables are the ones that are important contributors to the solution, and this information is available separately as part of the biplot s numerical results. We propose a new scaling of the display, called the contribution biplot, which incorporates this diagnostic directly into the graphical display, showing visually the important contributors and thus facilitating the biplot interpretation and often simplifying the graphical representation considerably. The contribution biplot can be applied to a wide variety of analyses such as correspondence analysis, principal component analysis, log-ratio analysis and the graphical results of a discriminant analysis/MANOVA, in fact to any method based on the singular-value decomposition. In the contribution biplot one set of points, usually the rows of the data matrix, optimally represent the spatial positions of the cases or sample units, according to some distance measure that usually incorporates some form of standardization unless all data are comparable in scale. The other set of points, usually the columns, is represented by vectors that are related to their contributions to the low-dimensional solution. A fringe benefit is that usually only one common scale for row and column points is needed on the principal axes, thus avoiding the problem of enlarging or contracting the scale of one set of points to make the biplot legible. Furthermore, this version of the biplot also solves the problem in correspondence analysis of low-frequency categories that are located on the periphery of the map, giving the false impression that they are important, when they are in fact contributing minimally to the solution.

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.

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.

A pseudo-spectral method for simulating of poro-elastic seismic wave propagation in complex borehole environments

We present a novel numerical approach for the comprehensive, flexible, and accurate simulation of poro-elastic wave propagation in cylindrical coordinates. An important application of this method is the modeling of complex seismic wave phenomena in fluid-filled boreholes, which represents a major, and as of yet largely unresolved, computational problem in exploration geophysics. In view of this, we consider a numerical mesh consisting of three concentric domains representing the borehole fluid in the center, the borehole casing and the surrounding porous formation. The spatial discretization is based on a Chebyshev expansion in the radial direction, Fourier expansions in the other directions, and a Runge-Kutta integration scheme for the time evolution. A domain decomposition method based on the method of characteristics is used to match the boundary conditions at the fluid/porous-solid and porous-solid/porous-solid interfaces. The viability and accuracy of the proposed method has been tested and verified in 2D polar coordinates through comparisons with analytical solutions as well as with the results obtained with a corresponding, previously published, and independently benchmarked solution for 2D Cartesian coordinates. The proposed numerical solution also satisfies the reciprocity theorem, which indicates that the inherent singularity associated with the origin of the polar coordinate system is handled adequately.

Esporgar: per què, com i quan

Catalan libraries find themselves stretched to their limits due to the conflict between the traditional model of preserving and conserving knowledge and the pressures created by the constant expansion of the collection. A solution can be found in weeding the collection. This article first explains the legal and reglamentary framework in which weeding should take place, followed by a proposed planning method that suggests different criteria to be applied. A description is provided of practical aspects of organising a project and of evaluating results. The article concludes with various alternatives for final disposal of the documents to be withdrawn definitively. A selective, annotated bibliography is included.

Growth, optical characterization, and laser operation of a stoichiometric crystal KYb(WO4)(2)

We present our recent achievements in the growing and optical characterization of KYb(WO4)2 (hereafter KYbW) crystals and demonstrate laser operation in this stoichiometric material. Single crystals of KYbW with optimal crystalline quality have been grown by the top-seeded-solution growth slow-cooling method. The optical anisotropy of this monoclinic crystal has been characterized, locating the tensor of the optical indicatrix and measuring the dispersion of the principal values of the refractive indices as well as the thermo-optic coefficients. Sellmeier equations have been constructed valid in the visible and near-IR spectral range. Raman scattering has been used to determine the phonon energies of KYbW and a simple physical model is applied for classification of the lattice vibration modes. Spectroscopic studies (absorption and emission measurements at room and low temperature) have been carried out in the spectral region near 1 µm characteristic for the ytterbium transition. Energy positions of the Stark sublevels of the ground and the excited state manifolds have been determined and the vibronic substructure has been identified. The intrinsic lifetime of the upper laser level has been measured taking care to suppress the effect of reabsorption and the intrinsic quantum efficiency has been estimated. Lasing has been demonstrated near 1074 nm with 41% slope efficiency at room temperature using a 0.5 mm thin plate of KYbW. This laser material holds great promise for diode pumped high-power lasers, thin disk and waveguide designs as well as for ultrashort (ps/fs) pulse laser systems.

Soil CO2 flux: a method comparison of closed static chambers in a sugarcane field

A large variety of techniques have been used to measure soil CO2 released from the soil surface, and much of the variability observed between locations must be attributed to the different methods used by the investigators. Therefore, a minimum protocol of measurement procedures should be established. The objectives of this study were (a) to compare different absorption areas, concentrations and volumes of the alkali trapping solution used in closed static chambers (CSC), and (b) to compare both, the optimized alkali trapping solution and the soda-lime trapping using CSC to measure soil respiration in sugarcane areas. Three CO2 absorption areas were evaluated (7; 15 and 20 % of the soil emission area or chamber); two volumes of NaOH (40 and 80 mL) at three concentrations (0.1, 0.25 and 0.5 mol L-1). Three different types of alkaline traps were tested: (a), 80 mL of 0.5 mol L-1 NaOH in glass containers, absorption area 15 % (V0.5); (b) 40 mL of 2 mol L-1 NaOH retained in a sponge, absorption area 80 % (S2) and (c) 40 g soda lime, absorption area 15 % (SL). NaOH concentrations of 0.5 mol L-1 or lower underestimated the soil CO2-C flux or CO2 flux. The lower limit of the alkali trap absorption area should be a minimum of 20 % of the area covered by the chamber. The 2 mol L-1 NaOH solution trap (S2) was the most efficient (highest accuracy and highest CO2 fluxes) in measuring soil respiration.

Exact gravitational shockwaves and Planckian scattering on branes

We obtain a solution describing a gravitational shock wave propagating along a Randall-Sundrum brane. The interest of such a solution is twofold: on the one hand, it is the first exact solution for a localized source on a Randall-Sundrum three-brane. On the other hand, one can use it to study forward scattering at Planckian energies, including the effects of the continuum of Kaluza-Klein modes. We map out the different regimes for the scattering obtained by varying the center-of-mass energy and the impact parameter. We also discuss exact shock waves in ADD scenarios with compact extra dimensions.

La forma lògica de les oracions d'acció i la tesi d'Anscombe

This paper has three sections. In the first one, I expose and discuss Davidson's semantic account of adverbial sentences: the basic idea is that these sentences involve quantification over events, and I defend that view from opposing perspectives like the theory of adverbs as predicate modifiers. In the second section I defend the claim that in english constructions following the scheme: ¿X did V by T-ings¿, we are referring to the same action of X; what is sometimes called ¿The Anscombe Thesis¿. Again I discuss competing theories only to conclude that the Anscombe Thesis is true. In the third section, however, it is shown that to assume as premisses these two theses -Davidson's account and the Anscombe Thesis- leads to a serious conflict. Alternative solutions are worked out and rejected. It is also argued that the only tenable solution depends on certain metaphysical assumptions. Finally, however, I will cast doubt on this solution.

Bridge Deck Waterproofing Membrane Study, R-262, 1974

One of the main problems of bridge maintenance in Iowa is the spalling and scaling of the decks. This problem stems from the continued use of deicing salts during the winter months. Since bridges will frost or freeze more often than roadways, the use of deicing salts on bridges is more frequent. The salt which is spread onto the bridge dissolves in water and permeates into the concrete deck. When the salt reaches the depth of the reinforcing steel and the concentration at that depth reaches the threshold concentration for corrosion (1.5 lbs./yd. 3 ), the steel will begin to oxidize. The oxidizing steel must then expand within the concrete. This expansion eventually forces undersurface fractures and spalls in the concrete. The spalling increases maintenance problems on bridges and in some cases has forced resurfacing after only a few years of service. There are two possible solutions to this problem. One solution is discontinuing the use of salts as the deicing agent on bridges and the other is preventing the salt from reaching or attacking the reinforcing steel. This report deals with one method which stops the salt from reaching the reinforcing steel. The method utilizes a waterproof membrane on the surface of a bridge deck. The waterproof membrane stops the water-salt solution from entering the concrete so the salt cannot reach the reinforcing steel.

Towards a consensus view on understanding nanomaterials hazards and managing exposure

The aim of this article is to present an overview of salient issues of exposure, characterisation and hazard assessment of nanomaterials as they emerged from the consensus-building of experts undertaken within the four year European Commission coordination project NanoImpactNet. The approach adopted is to consolidate and condense the findings and problem-identification in such a way as to identify knowledge-gaps and generate a set of interim recommendations of use to industry, regulators, research bodies and funders. The categories of recommendation arising from the consensual view address: significant gaps in vital factual knowledge of exposure, characterisation and hazards; the development, dissemination and standardisation of appropriate laboratory protocols; address a wide range of technical issues in establishing an adequate risk assessment platform; the more efficient and coordinated gathering of basic data; greater inter-organisational cooperation; regulatory harmonization; the wider use of the life-cycle approaches; and the wider involvement of all stakeholders in the discussion and solution-finding efforts for nanosafety.

Comparing ICA-based and single-trial topographic ERP analyses.

Single-trial analysis of human electroencephalography (EEG) has been recently proposed for better understanding the contribution of individual subjects to a group-analysis effect as well as for investigating single-subject mechanisms. Independent Component Analysis (ICA) has been repeatedly applied to concatenated single-trial responses and at a single-subject level in order to extract those components that resemble activities of interest. More recently we have proposed a single-trial method based on topographic maps that determines which voltage configurations are reliably observed at the event-related potential (ERP) level taking advantage of repetitions across trials. Here, we investigated the correspondence between the maps obtained by ICA versus the topographies that we obtained by the single-trial clustering algorithm that best explained the variance of the ERP. To do this, we used exemplar data provided from the EEGLAB website that are based on a dataset from a visual target detection task. We show there to be robust correspondence both at the level of the activation time courses and at the level of voltage configurations of a subset of relevant maps. We additionally show the estimated inverse solution (based on low-resolution electromagnetic tomography) of two corresponding maps occurring at approximately 300 ms post-stimulus onset, as estimated by the two aforementioned approaches. The spatial distribution of the estimated sources significantly correlated and had in common a right parietal activation within Brodmann's Area (BA) 40. Despite their differences in terms of theoretical bases, the consistency between the results of these two approaches shows that their underlying assumptions are indeed compatible.