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.

Risk sharing with the monarch: Excusable defaults and contingent debt in the age of Philip II, 1556-1598

Contingent sovereign debt can create important welfare gains. Nonetheless,there is almost no issuance today. Using hand-collected archival data, we examine thefirst known case of large-scale use of state-contingent sovereign debt in history. Philip IIof Spain entered into hundreds of contracts whose value and due date depended onverifiable, exogenous events such as the arrival of silver fleets. We show that this allowedfor effective risk-sharing between the king and his bankers. The data also stronglysuggest that the defaults that occurred were excusable they were simply contingenciesover which Crown and bankers had not contracted previously.

Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.

Human Resource Information System; individual Users with Work Reporting Guide, April 2003

Guide manual for using the Human Resource Information System for the state of Iowa.

Association of genetic variation with systolic and diastolic blood pressure among African Americans: the Candidate Gene Association Resource study.

The prevalence of hypertension in African Americans (AAs) is higher than in other US groups; yet, few have performed genome-wide association studies (GWASs) in AA. Among people of European descent, GWASs have identified genetic variants at 13 loci that are associated with blood pressure. It is unknown if these variants confer susceptibility in people of African ancestry. Here, we examined genome-wide and candidate gene associations with systolic blood pressure (SBP) and diastolic blood pressure (DBP) using the Candidate Gene Association Resource (CARe) consortium consisting of 8591 AAs. Genotypes included genome-wide single-nucleotide polymorphism (SNP) data utilizing the Affymetrix 6.0 array with imputation to 2.5 million HapMap SNPs and candidate gene SNP data utilizing a 50K cardiovascular gene-centric array (ITMAT-Broad-CARe [IBC] array). For Affymetrix data, the strongest signal for DBP was rs10474346 (P= 3.6 × 10(-8)) located near GPR98 and ARRDC3. For SBP, the strongest signal was rs2258119 in C21orf91 (P= 4.7 × 10(-8)). The top IBC association for SBP was rs2012318 (P= 6.4 × 10(-6)) near SLC25A42 and for DBP was rs2523586 (P= 1.3 × 10(-6)) near HLA-B. None of the top variants replicated in additional AA (n = 11 882) or European-American (n = 69 899) cohorts. We replicated previously reported European-American blood pressure SNPs in our AA samples (SH2B3, P= 0.009; TBX3-TBX5, P= 0.03; and CSK-ULK3, P= 0.0004). These genetic loci represent the best evidence of genetic influences on SBP and DBP in AAs to date. More broadly, this work supports that notion that blood pressure among AAs is a trait with genetic underpinnings but also with significant complexity.

Treatment patterns and health care resource utilization in a 1-year observational cohort study of outpatients with schizophrenia at risk of nonadherence treated with long-acting injectable antipsychotics

Purpose: To describe (1) the clinical profiles and the patterns of use of long-acting injectable (LAI) antipsychotics in patients with schizophrenia at risk of nonadherence with oral antipsychotics, and in those who started treatment with LAI antipsychotics, (2) health care resource utilization and associated costs. Patients and methods: A total of 597 outpatients with schizophrenia at risk of nonadherence, according to the psychiatrist's clinical judgment, were recruited at 59 centers in a noninterventional prospective observational study of 1-year follow-up when their treatment was modified. In a post hoc analysis, the profiles of patients starting LAI or continuing with oral antipsychotics were described, and descriptive analyses of treatments, health resource utilization, and direct costs were performed in those who started an LAI antipsychotic. Results: Therapy modifications involved the antipsychotic medications in 84.8% of patients, mostly because of insufficient efficacy of prior regimen. Ninety-two (15.4%) patients started an LAI antipsychotic at recruitment. Of these, only 13 (14.1%) were prescribed with first-generation antipsychotics. During 1 year, 16.3% of patients who started and 14.9% of patients who did not start an LAI antipsychotic at recruitment relapsed, contrasting with the 20.9% who had been hospitalized only within the prior 6 months. After 1 year, 74.3% of patients who started an LAI antipsychotic continued concomitant treatment with oral antipsychotics. The mean (median) total direct health care cost per patient per month during the study year among the patients starting any LAI antipsychotic at baseline was 1,407 ( 897.7). Medication costs (including oral and LAI antipsychotics and concomitant medication) represented almost 44%, whereas nonmedication costs accounted for more than 55% of the mean total direct health care costs. Conclusion: LAI antipsychotics were infrequently prescribed in spite of a psychiatrist-perceived risk of nonadherence to oral antipsychotics. Mean medication costs were lower than nonmedication costs.

Sharing data between LSDBs and central repositories.

Several Locus-Specific DataBases (LSDBs) have recently been approached by larger, more general data repositories (including NCBI and UCSC) with the request to share the DNA variant data they have collected. Within the Human Genome Variation Society (HGVS) a document was generated summarizing the issues related to these requests. The document has been circulated in the HGVS/LSDB community and was discussed extensively. Here we summarize these discussions and present the concluded recommendations for LSDB data sharing with central repositories.

Sharing Open Source License and Copyright Data with SPDX

Organizations across the globe are creating and distributing products that include open source software. To ensure compliance with the open source licenses, each company needs to evaluate exactly what open source licenses and copyrights are included - resulting in duplicated effort and redundancy. This talk will provide an overview of a new Software Package Data Exchange (SPDX) specification. This specification will provide a common format to share information about the open source licenses and copyrights that are included in any software package, with the goal of saving time and improving data accuracy. This talk will review the progress of the initiative; discuss the benefits to organizations using open source and share information on how you can contribute.

Treatment patterns and health care resource utilization in a 1-year observational cohort study of outpatients with schizophrenia at risk of nonadherence treated with long-acting injectable antipsychotics

Purpose: To describe (1) the clinical profiles and the patterns of use of long-acting injectable (LAI) antipsychotics in patients with schizophrenia at risk of nonadherence with oral antipsychotics, and in those who started treatment with LAI antipsychotics, (2) health care resource utilization and associated costs. Patients and methods: A total of 597 outpatients with schizophrenia at risk of nonadherence, according to the psychiatrist's clinical judgment, were recruited at 59 centers in a noninterventional prospective observational study of 1-year follow-up when their treatment was modified. In a post hoc analysis, the profiles of patients starting LAI or continuing with oral antipsychotics were described, and descriptive analyses of treatments, health resource utilization, and direct costs were performed in those who started an LAI antipsychotic. Results: Therapy modifications involved the antipsychotic medications in 84.8% of patients, mostly because of insufficient efficacy of prior regimen. Ninety-two (15.4%) patients started an LAI antipsychotic at recruitment. Of these, only 13 (14.1%) were prescribed with first-generation antipsychotics. During 1 year, 16.3% of patients who started and 14.9% of patients who did not start an LAI antipsychotic at recruitment relapsed, contrasting with the 20.9% who had been hospitalized only within the prior 6 months. After 1 year, 74.3% of patients who started an LAI antipsychotic continued concomitant treatment with oral antipsychotics. The mean (median) total direct health care cost per patient per month during the study year among the patients starting any LAI antipsychotic at baseline was 1,407 ( 897.7). Medication costs (including oral and LAI antipsychotics and concomitant medication) represented almost 44%, whereas nonmedication costs accounted for more than 55% of the mean total direct health care costs. Conclusion: LAI antipsychotics were infrequently prescribed in spite of a psychiatrist-perceived risk of nonadherence to oral antipsychotics. Mean medication costs were lower than nonmedication costs.

What to consider for applying backfilling on non-dedicated environments

The resource utilization level in open laboratories of several universities has been shown to be very low. Our aim is to take advantage of those idle resources for parallel computation without disturbing the local load. In order to provide a system that lets us execute parallel applications in such a non-dedicated cluster, we use an integral scheduling system that considers both Space and Time sharing concerns. For dealing with the Time Sharing (TS) aspect, we use a technique based on the communication-driven coscheduling principle. This kind of TS system has some implications on the Space Sharing (SS) system, that force us to modify the way job scheduling is traditionally done. In this paper, we analyze the relation between the TS and the SS systems in a non-dedicated cluster. As a consequence of this analysis, we propose a new technique, termed 3DBackfilling. This proposal implements the well known SS technique of backfilling, but applied to an environment with a MultiProgramming Level (MPL) of the parallel applications that is greater than one. Besides, 3DBackfilling considers the requirements of the local workload running on each node. Our proposal was evaluated in a PVM/MPI Linux cluster, and it was compared with several more traditional SS policies applied to non-dedicated environments.

Rhizodeposition of organic carbon by plants with contrasting traits for resource acquisition: responses to different fertility regimes

Background and aims Rhizodeposition plays an important role in mediating soil nutrient availability in ecosystems. However, owing to methodological difficulties (i.e., narrow zone of soil around roots, rapid assimilation by soil microbes) fertility-induced changes in rhizodeposition remain mostly unknown. Methods We developed a novel long-term continuous 13C labelling method to address the effects of two levels of nitrogen (N) fertilization on rhizodeposited carbon (C) by species with different nutrient acquisition strategies. Results Fertility-induced changes in rhizodeposition were modulated by root responses to N availability rather than by changes in soil microbial biomass. Differences among species were mostly related to plant biomass: species with higher total leaf and root biomass also had higher total rhizodeposited C, whereas species with lower root biomass had higher specific rhizodeposited C (per gram root mass). Experimental controls demonstrated that most of the biases commonly associated with this type of experiment (i.e., long-term steady-state labelling) were avoided using our methodological approach. Conclusions These results suggest that the amount of rhizodeposited C from plants grown under different levels of N were driven mainly by plant biomass and root morphology rather than microbial biomass. They also underline the importance of plant characteristics (i.e., biomass allocation) as opposed to traits associated with plant resource acquisition strategies in predicting total C rhizodeposition.

Harvesting and wood transport planning with SNAP III program (Scheduling and Network Analysis Program) in a pine plantation in Southeast Brazil

The objective of this study was to verify the potential of SNAP III (Scheduling and Network Analysis Program) as a support tool for harvesting and wood transport planning in Brazil harvesting subsystem definition and establishment of a compatible route were assessed. Initially, machine operational and production costs were determined in seven subsystems for the study area, and quality indexes, construction and maintenance costs of forest roads were obtained and used as SNAP III program input data. The results showed, that three categories of forest road occurrence were observed in the study area: main, secondary and tertiary which, based on quality index, allowed a medium vehicle speed of about 41, 30 and 24 km/hours and a construction cost of about US$ 5,084.30, US$ 2,275.28 and US$ 1,650.00/km, respectively. The SNAP III program used as a support tool for the planning, was found to have a high potential tool in the harvesting and wood transport planning. The program was capable of defining efficiently, the harvesting subsystem on technical and economical basis, the best wood transport route and the forest road to be used in each period of the horizon planning.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.

Evidencing and Sharing Value with Decision Making Models in an Industrial Maintenance Network

The objective of this thesis is to concretize the potential benefits that the industrial maintenance case network could achieve through using the value-based life-cycle model and the flexible asset management model. It is also inspected what factors prevent value creation and sharing in the maintenance contract practices of the case network. This thesis is a case study which utilizes modelling. Four scenarios were developed to demonstrate value creation in the future. The data was partly provided by the collaborating company, partly gathered from public financial statement information. The results indicate that value has been created through the past maintenance of the collaborating company’s rod mill and that profitability of the collaborating company has been mostly on satisfactory level during the past few years. Potential value might be created by increasing the share of proactive maintenance of the rod mill in the future. Profitability of the network could be improved in the future through flexible asset management operations. The main obstacle for value creation and sharing seems to be the lack of sufficient trust between the network members.