Distributed all-atom simulations of intrinsically unstructured proteins

The Computational Biophysics Group at the Universitat Pompeu Fabra (GRIB-UPF) hosts two unique computational resources dedicated to the execution of large scale molecular dynamics (MD) simulations: (a) the ACMD molecular-dynamics software, used on standard personal computers with graphical processing units (GPUs); and (b) the GPUGRID. net computing network, supported by users distributed worldwide that volunteer GPUs for biomedical research. We leveraged these resources and developed studies, protocols and open-source software to elucidate energetics and pathways of a number of biomolecular systems, with a special focus on flexible proteins with many degrees of freedom. First, we characterized ion permeation through the bactericidal model protein Gramicidin A conducting one of the largest studies to date with the steered MD biasing methodology. Next, we addressed an open problem in structural biology, the determination of drug-protein association kinetics; we reconstructed the binding free energy, association, and dissaciociation rates of a drug like model system through a spatial decomposition and a Makov-chain analysis. The work was published in the Proceedings of the National Academy of Sciences and become one of the few landmark papers elucidating a ligand-binding pathway. Furthermore, we investigated the unstructured Kinase Inducible Domain (KID), a 28-peptide central to signalling and transcriptional response; the kinetics of this challenging system was modelled with a Markovian approach in collaboration with Frank Noe’s group at the Freie University of Berlin. The impact of the funding includes three peer-reviewed publication on high-impact journals; three more papers under review; four MD analysis components, released as open-source software; MD protocols; didactic material, and code for the hosting group.

Sickness presenteeism in Spanish-born and immigrant workers in Spain

Background: Previous studies have shown that immigrant workers face relatively worse working and employment conditions, as well as lower rates of sickness absence than native-born workers. This study aims to assess rates of sickness presenteeism in a sample of Spanish-born and foreign-born workers according to different characteristics. Methods: A cross-sectional survey was conducted amongst a convenience sample of workers (Spanish-born and foreign-born), living in four Spanish cities: Barcelona, Huelva, Madrid and Valencia (2008-2009). Sickness presenteeism information was collected through two items in the questionnaire ("Have you had health problems in the last year?" and "Have you ever had to miss work for any health problem?") and was defined as worker who had a health problem (answered yes, first item) and had not missed work (answered no, second item). For the analysis, the sample of 2,059 workers (1,617 foreign-born) who answered yes to health problems was included. After descriptives, logistic regressions were used to establish the association between origin country and sickness presenteeism (adjusted odds ratios aOR; 95% confidence interval 95%CI). Analyses were stratified per time spent in Spain among foreign-born workers. Results: All of the results refer to the comparison between foreign-born and Spanish-born workers as a whole, and in some categories relating to personal and occupational conditions. Foreign-born workers were more likely to report sickness presenteeism compared with their Spanish-born counterparts, especially those living in Spain for under 2 years [Prevalence: 42% in Spanish-born and 56.3% in Foreign-born; aOR 1.77 95%CI 1.24-2.53]. In case of foreign-born workers (with time in Spain < 2 years), men [aOR 2.31 95%CI 1.40-3.80], those with university studies [aOR 3.01 95%CI 1.04-8.69], temporary contracts [aOR 2.26 95%CI 1.29-3.98] and salaries between 751-1,200€ per month [aOR 1.74 95% CI 1.04-2.92] were more likely to report sickness presenteeism. Also, recent immigrants with good self-perceived health and good mental health were more likely to report presenteeism than Spanish-born workers with the same good health indicators. Conclusions: Immigrant workers report more sickness presenteeism than their Spanish-born counterparts. These results could be related to precarious work and employment conditions of immigrants. Immigrant workers should benefit from the same standards of social security, and of health and safety in the workplace that are enjoyed by Spanish workers.

An analysis of visual adaptation and contrast perception for tone mapping

Tone Mapping is the problem of compressing the range of a High-Dynamic Range image so that it can be displayed in a Low-Dynamic Range screen, without losing or introducing novel details: The final image should produce in the observer a sensation as close as possible to the perception produced by the real-world scene. We propose a tone mapping operator with two stages. The first stage is a global method that implements visual adaptation, based on experiments on human perception, in particular we point out the importance of cone saturation. The second stage performs local contrast enhancement, based on a variational model inspired by color vision phenomenology. We evaluate this method with a metric validated by psychophysical experiments and, in terms of this metric, our method compares very well with the state of the art.

Parental care time in four European countries: comparing types and contexts

The intensity of parental investments in child care time is expected to vary across families with different norms and time-constraints. Additionally, it should also differ across countries, since the abilities of parents to harmonize family and work vary by national context. In our opinion, however, this question remains inconclusive for two main reasons: 1) only some countries have been studied from a comparative approach; 2) previous studies have not paid enough attention to the analysis of how the conditional effects of education and employment affect parental investments.In this paper we used nationally representative time-use data from Denmark, Flanders, Spain and the United Kingdom (N=4,031) to explore how employment and education predict variations in child care time. IN Britain and Spain employment has a strong negative effect on fathers’ child care, but a weaker one in Flanders and particularly in Denmark. In contrast, maternal employment has a strong negative impact in all four countries. Education increases child care time significantly only among Spanish mothers and fathers, as well as British mothers. Nonetheless, we find that college-educated mothers under similar time-constraints increase substantially their expected child care time in Britain, Flanders and Spain; for fathers we find a more mixed picture. Routine child care activities are more sensitive to both maternal and paternal employment than interactive child care activities. Finally, we observe that working a public sector job generally increases a total time allocated to parental care, controlling for several demographic and socioeconomic variables.

ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

Social Security in Theory and Practice (II): Efficiency Theories, Narrative Theories, and Implications for Reform

166 countries have some kind of public old age pension. What economic forces create and sustain old age Social Security as a public program? Mulligan and Sala-i-Martin (1999b) document several of the internationally and historically common features of social security programs, and explore "political" theories of Social Security. This paper discusses the "efficiency theories", which view creation of the SS program as a full of partial solution to some market failure. Efficiency explanations of social security include the "SS as welfare for the elderly" the "retirement increases productivity to optimally manage human capital externalities", "optimal retirement insurance", the "prodigal father problem", the "misguided Keynesian", the "optimal longevity insurance", the "government economizing transaction costs", and the "return on human capital investment". We also analyze four "narrative" theories of social security: the "chain letter theory", the "lump of labor theory", the "monopoly capitalism theory", and the "Sub-but-Nearly-Optimal policy response to private pensions theory". The political and efficiency explanations are compared with the international and historical facts and used to derive implications for replacing the typical pay-as-you-go system with a forced savings plan. Most of the explanations suggest that forced savings does not increase welfare, and may decrease it.

New Trends in Public Facility Location Modeling

The past four decades have witnessed an explosive growth in the field of networkbased facility location modeling. This is not at all surprising since location policy is one of the most profitable areas of applied systems analysis in regional science and ample theoretical and applied challenges are offered. Location-allocation models seek the location of facilities and/or services (e.g., schools, hospitals, and warehouses) so as to optimize one or several objectives generally related to the efficiency of the system or to the allocation of resources. This paper concerns the location of facilities or services in discrete space or networks, that are related to the public sector, such as emergency services (ambulances, fire stations, and police units), school systems and postal facilities. The paper is structured as follows: first, we will focus on public facility location models that use some type of coverage criterion, with special emphasis in emergency services. The second section will examine models based on the P-Median problem and some of the issues faced by planners when implementing this formulation in real world locational decisions. Finally, the last section will examine new trends in public sector facility location modeling.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

A mathematical excursion: From the three-door problem to a Cantor-type perfect set

We start with a generalization of the well-known three-door problem:the n-door problem. The solution of this new problem leads us toa beautiful representation system for real numbers in (0,1] as alternated series, known in the literature as Pierce expansions. A closer look to Pierce expansions will take us to some metrical properties of sets defined through the Pierce expansions of its elements. Finally, these metrical properties will enable us to present 'strange' sets, similar to the classical Cantor set.

Locating emergency services with priority rules: The priority queuing covering location problem

One of the assumptions of the Capacitated Facility Location Problem (CFLP) is thatdemand is known and fixed. Most often, this is not the case when managers take somestrategic decisions such as locating facilities and assigning demand points to thosefacilities. In this paper we consider demand as stochastic and we model each of thefacilities as an independent queue. Stochastic models of manufacturing systems anddeterministic location models are put together in order to obtain a formula for thebacklogging probability at a potential facility location.Several solution techniques have been proposed to solve the CFLP. One of the mostrecently proposed heuristics, a Reactive Greedy Adaptive Search Procedure, isimplemented in order to solve the model formulated. We present some computationalexperiments in order to evaluate the heuristics performance and to illustrate the use ofthis new formulation for the CFLP. The paper finishes with a simple simulationexercise.

A multi-objective model for a multi-period distribution management problem

The problems arising in commercial distribution are complex and involve several players and decision levels. One important decision is relatedwith the design of the routes to distribute the products, in an efficient and inexpensive way.This article deals with a complex vehicle routing problem that can beseen as a new extension of the basic vehicle routing problem. The proposed model is a multi-objective combinatorial optimization problemthat considers three objectives and multiple periods, which models in a closer way the real distribution problems. The first objective is costminimization, the second is balancing work levels and the third is amarketing objective. An application of the model on a small example, with5 clients and 3 days, is presented. The results of the model show the complexity of solving multi-objective combinatorial optimization problems and the contradiction between the several distribution management objective.

Regions of rationality: Maps for bounded agents

An important problem in descriptive and prescriptive research in decision making is to identify regions of rationality, i.e., the areas for which heuristics are and are not effective. To map the contours of such regions, we derive probabilities that heuristics identify the best of m alternatives (m > 2) characterized by k attributes or cues (k > 1). The heuristics include a single variable (lexicographic), variations of elimination-by-aspects, equal weighting, hybrids of the preceding, and models exploiting dominance. We use twenty simulated and four empirical datasets for illustration. We further provide an overview by regressing heuristic performance on factors characterizing environments. Overall, sensible heuristics generally yield similar choices in many environments. However, selection of the appropriate heuristic can be important in some regions (e.g., if there is low inter-correlation among attributes/cues). Since our work assumes a hit or miss decision criterion, we conclude by outlining extensions for exploring the effects of different loss functions.

Minimax lower bounds for the two-armed bandit problem

We obtain minimax lower bounds on the regret for the classicaltwo--armed bandit problem. We provide a finite--sample minimax version of the well--known log $n$ asymptotic lower bound of Lai and Robbins. Also, in contrast to the log $n$ asymptotic results on the regret, we show that the minimax regret is achieved by mere random guessing under fairly mild conditions on the set of allowable configurations of the two arms. That is, we show that for {\sl every} allocation rule and for {\sl every} $n$, there is a configuration such that the regret at time $n$ is at least 1 -- $\epsilon$ times the regret of random guessing, where $\epsilon$ is any small positive constant.