WorldWideScience

Sample records for concurrent chains schedules

  1. Choice between Single and Multiple Reinforcers in Concurrent-Chains Schedules

    Science.gov (United States)

    Mazur, James E.

    2006-01-01

    Pigeons responded on concurrent-chains schedules with equal variable-interval schedules as initial links. One terminal link delivered a single reinforcer after a fixed delay, and the other terminal link delivered either three or five reinforcers, each preceded by a fixed delay. Some conditions included a postreinforcer delay after the single…

  2. Concurrent Product & Supply Chain Creation

    DEFF Research Database (Denmark)

    Gubi, Ebbe

    it is a structural premise. We also know that logistics costs generally are estimated 15-20% of total product costs. Accordingly, it stands to reason that a company can reduce costs, and thereby gain an edge on its competitors, by tailoring the supply chain in question to an individual product or product family; i.......e. by creating Focused Supply Chains. At the same time, customer satisfaction can be increased. As a second means to achieving a better fit between product and supply chain, the firm can deploy Design for Logistics, the discipline of considering the supply chain during product creation. The thesis sets out...... and supply chains should be created concurrently and integrated. The concept of Concurrent Product & Supply Chain Creation is introduced, and the two main components Focused Supply Chains and Design For Logistics are explained and exemplified by use of Bang & Olufsen....

  3. Some Effects of Procedural Variations on Choice Responding in Concurrent Chains

    Science.gov (United States)

    Moore, J.

    2009-01-01

    The present research used pigeons in a three-key operant chamber and varied procedural features pertaining to both initial and terminal links of concurrent chains. The initial links randomly alternated on the side keys during a session, while the terminal links always appeared on the center key. Both equal and unequal initial-link schedules were…

  4. WE-D-BRE-04: Modeling Optimal Concurrent Chemotherapy Schedules

    International Nuclear Information System (INIS)

    Jeong, J; Deasy, J O

    2014-01-01

    Purpose: Concurrent chemo-radiation therapy (CCRT) has become a more common cancer treatment option with a better tumor control rate for several tumor sites, including head and neck and lung cancer. In this work, possible optimal chemotherapy schedules were investigated by implementing chemotherapy cell-kill into a tumor response model of RT. Methods: The chemotherapy effect has been added into a published model (Jeong et al., PMB (2013) 58:4897), in which the tumor response to RT can be simulated with the effects of hypoxia and proliferation. Based on the two-compartment pharmacokinetic model, the temporal concentration of chemotherapy agent was estimated. Log cell-kill was assumed and the cell-kill constant was estimated from the observed increase in local control due to concurrent chemotherapy. For a simplified two cycle CCRT regime, several different starting times and intervals were simulated with conventional RT regime (2Gy/fx, 5fx/wk). The effectiveness of CCRT was evaluated in terms of reduction in radiation dose required for 50% of control to find the optimal chemotherapy schedule. Results: Assuming the typical slope of dose response curve (γ50=2), the observed 10% increase in local control rate was evaluated to be equivalent to an extra RT dose of about 4 Gy, from which the cell-kill rate of chemotherapy was derived to be about 0.35. Best response was obtained when chemotherapy was started at about 3 weeks after RT began. As the interval between two cycles decreases, the efficacy of chemotherapy increases with broader range of optimal starting times. Conclusion: The effect of chemotherapy has been implemented into the resource-conservation tumor response model to investigate CCRT. The results suggest that the concurrent chemotherapy might be more effective when delayed for about 3 weeks, due to lower tumor burden and a larger fraction of proliferating cells after reoxygenation

  5. Independence of Terminal-Link Entry Rate and Immediacy in Concurrent Chains

    Science.gov (United States)

    Berg, Mark E.; Grace, Randolph C.

    2004-01-01

    In Phase 1, 4 pigeons were trained on a three-component multiple concurrent-chains procedure in which components differed only in terms of relative terminal-link entry rate. The terminal links were variable-interval schedules and were varied across four conditions to produce immediacy ratios of 4:1, 1:4, 2:1, and 1:2. Relative terminal-link entry…

  6. Concurrent variable-interval variable-ratio schedules in a dynamic choice environment.

    Science.gov (United States)

    Bell, Matthew C; Baum, William M

    2017-11-01

    Most studies of operant choice have focused on presenting subjects with a fixed pair of schedules across many experimental sessions. Using these methods, studies of concurrent variable- interval variable-ratio schedules helped to evaluate theories of choice. More recently, a growing literature has focused on dynamic choice behavior. Those dynamic choice studies have analyzed behavior on a number of different time scales using concurrent variable-interval schedules. Following the dynamic choice approach, the present experiment examined performance on concurrent variable-interval variable-ratio schedules in a rapidly changing environment. Our objectives were to compare performance on concurrent variable-interval variable-ratio schedules with extant data on concurrent variable-interval variable-interval schedules using a dynamic choice procedure and to extend earlier work on concurrent variable-interval variable-ratio schedules. We analyzed performances at different time scales, finding strong similarities between concurrent variable-interval variable-interval and concurrent variable-interval variable- ratio performance within dynamic choice procedures. Time-based measures revealed almost identical performance in the two procedures compared with response-based measures, supporting the view that choice is best understood as time allocation. Performance at the smaller time scale of visits accorded with the tendency seen in earlier research toward developing a pattern of strong preference for and long visits to the richer alternative paired with brief "samples" at the leaner alternative ("fix and sample"). © 2017 Society for the Experimental Analysis of Behavior.

  7. Are behaviors at one alternative in concurrent schedules independent of contingencies at the other alternative?

    Science.gov (United States)

    MacDonall, James S

    2017-09-01

    Some have reported changing the schedule at one alternative of a concurrent schedule changed responding at the other alternative (Catania, 1969), which seems odd because no contingencies were changed there. When concurrent schedules are programmed using two schedules, one associated with each alternative that operate continuously, changing the schedule at one alternative also changes the switch schedule at the other alternative. Thus, changes in responding at the constant alternative could be due to the change in the switch schedule. To assess this possibility, six rats were exposed to a series of conditions that alternated between pairs of interval schedules at both alternatives and a pair of interval schedules at one, constant, alternative and a pair of extinction schedules at the other alternative. Comparing run lengths, visit durations and response rates at the constant alternative in the alternating conditions did not show consistent increases and decreases when a strict criterion for changes was used. Using a less stringent definition (any change in mean values) showed changes. The stay/switch analysis suggests it may be inaccurate to apply behavioral contrast to procedures that change from concurrent variable-interval variable-interval schedules to concurrent variable-interval extinction schedules because the contingencies in neither alternative are constant. © 2017 Society for the Experimental Analysis of Behavior.

  8. Impaired Behavior Regulation under Conditions of Concurrent Variable Schedules of Reinforcement in Children with ADHD

    Science.gov (United States)

    Taylor, David; Lincoln, Alan J.; Foster, Sharon L.

    2010-01-01

    Objective: To bridge theory of response inhibition and learning in children with ADHD. Method: Thirty ADHD and 30 non-ADHD children (ages 9-12) were compared under concurrent variable interval (VI-15 sec., VI-30 sec. and VI- 45 sec.) reinforcement schedules that required the child to switch between the three schedules under conditions of…

  9. Exclusive Preference Develops Less Readily on Concurrent Ratio Schedules with Wheel-Running than with Sucrose Reinforcement

    Science.gov (United States)

    Belke, Terry W.

    2010-01-01

    Previous research suggested that allocation of responses on concurrent schedules of wheel-running reinforcement was less sensitive to schedule differences than typically observed with more conventional reinforcers. To assess this possibility, 16 female Long Evans rats were exposed to concurrent FR FR schedules of reinforcement and the schedule…

  10. Acquisition of choice in concurrent chains: Assessing the cumulative decision model.

    Science.gov (United States)

    Grace, Randolph C

    2016-05-01

    Concurrent chains is widely used to study pigeons' choice between terminal links that can vary in delay, magnitude, or probability of reinforcement. We review research on the acquisition of choice in this procedure. Acquisition has been studied with a variety of research designs, and some studies have incorporated no-food trials to allow for timing and choice to be observed concurrently. Results show that: Choice can be acquired rapidly within sessions when terminal links change unpredictably; under steady-state conditions, acquisition depends on both initial- and terminal-link schedules; and initial-link responding is mediated by learning about the terminal-link stimulus-reinforcer relations. The cumulative decision model (CDM) proposed by Christensen and Grace (2010) and Grace and McLean (2006, 2015) provides a good description of within-session acquisition, and correctly predicts the effects of initial and terminal-link schedules in steady-state designs (Grace, 2002a). Questions for future research include how abrupt shifts in preference within individual sessions and temporal control of terminal-link responding can be modeled. Copyright © 2016 Elsevier B.V. All rights reserved.

  11. Travel time and concurrent-schedule choice: retrospective versus prospective control.

    OpenAIRE

    Davison, M; Elliffe, D

    2000-01-01

    Six pigeons were trained on concurrent variable-interval schedules in which two different travel times between alternatives, 4.5 and 0.5 s, were randomly arranged. In Part 1, the next travel time was signaled while the subjects were responding on each alternative. Generalized matching analyses of performance in the presence of the two travel-time signals showed significantly higher response and time sensitivity when the longer travel time was signaled compared to when the shorter time was sig...

  12. Concurrent immunomodulator therapy is associated with higher adalimumab trough levels during scheduled maintenance therapy.

    Science.gov (United States)

    Bond, Ashley; Dodd, Susanna; Fisher, Gareth; Skouras, Thomas; Subramanian, Sreedhar

    2017-02-01

    Combination therapy with infliximab and immunomodulators is superior to monotherapy, resulting in better outcomes and higher trough levels of infliximab. The role of concurrent immunomodulatory therapy on adalimumab trough levels has not been adequately investigated. We evaluated the impact of concomitant immunomodulation on adalimumab trough levels in patients on scheduled maintenance therapy. We conducted a prospective observational, cross-sectional study of all inflammatory bowel disease patients on maintenance therapy who had adalimumab trough levels measured between January 2013 and January 2016. Drug level and anti-drug antibody measurements were performed on sera using a solid phase assay. Pairwise comparison of means was used to compare trough levels in patients with and without concomitant immune modulator therapy. In total, 79 patients were included. Twenty-three patients (29.1%) were on weekly dosing whereas 56 (70.9%) were on alternate weeks. Median adalimumab trough levels were comparable in patients with and without clinical remission (6.8 μg/ml (IQR 5.6-8.1) versus 6.7 μg/ml (IQR 3.9-8.1), respectively. Patients with an elevated faecal calprotectin >250 μg/g had lower adalimumab trough levels (median 6.7, IQR 3.9-8) compared to patients with faecal calprotectin <250 μg/g (median 7.7, IQR 6.1-8.1) though this did not achieve statistical significance (p = .062). Median adalimumab trough levels among patients on concurrent immunomodulators was 7.2 μg/ml (IQR 5.7-8.1) compared to those not on concurrent immunomodulator, 6.1 μg/ml (IQR 2.7-7.7, p = .0297). Adalimumab trough levels were significantly higher in patients on concurrent immunomodulators during maintenance therapy. There was a trend towards a lower adalimumab trough level in patients with elevated calprotectin.

  13. Concurrent processes scheduling with scarce resources in small and medium enterprises

    Institute of Scientific and Technical Information of China (English)

    马嵩华

    2016-01-01

    Scarce resources , precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises (SMEs), which are deemed to block the ap-plication of workflow management system ( WfMS ) .To tackle this problem , a workflow scheduling approach is proposed based on timing workflow net (TWF-net) and genetic algorithm (GA).The workflow is modelled in a form of TWF-net in favour of process simulation and resource conflict checking .After simplifying and reconstructing the set of workflow instance , the conflict resolution problem is transformed into a resource-constrained project scheduling problem ( RCPSP ) , which could be efficiently solved by a heuristic method , such as GA.Finally, problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with first-come-first-served ( FCFS) strategy.The evaluation demonstrates that the proposed method is an overwhelming and effective approach for scheduling the concurrent processes with precedence and resource con -straints .

  14. A Comparison of Forward and Concurrent Chaining Strategies in Teaching Laundromat Skills to Students with Severe Handicaps.

    Science.gov (United States)

    McDonnell, John; McFarland, Susan

    1988-01-01

    In a study which taught four high school students with severe handicaps to use a commercial washing machine and laundry soap dispenser, a concurrent chaining strategy was found more efficient than forward chaining in facilitating skill acquisition. Concurrent chaining also resulted in better maintenance at four- and eight-week follow-up…

  15. The Reinforcing Effects of Houselight Illumination during Chained Schedules of Food Presentation

    Science.gov (United States)

    Allen, Ron; Kupfer, Jeff; Malagodi, E. F.

    2008-01-01

    Pigeons' keypecking was maintained under two- and three-component chained schedules of food presentation. The component schedules were all fixed-interval schedules of either 1- or 2-min duration. Across conditions the presence of houselight illumination within each component schedule was manipulated. For each pigeon, first-component response rates…

  16. Adaptive track scheduling to optimize concurrency and vectorization in GeantV

    International Nuclear Information System (INIS)

    Apostolakis, J; Brun, R; Carminati, F; Gheata, A; Novak, M; Wenzel, S; Bandieramonte, M; Bitzes, G; Canal, P; Elvira, V D; Jun, S Y; Lima, G; Licht, J C De Fine; Duhem, L; Sehgal, R; Shadura, O

    2015-01-01

    The GeantV project is focused on the R and D of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of tracks belonging to multiple events and matching different locality criteria must be gathered and dispatched to algorithms having vector signatures. While the transport propagates tracks and changes their individual states, data locality becomes harder to maintain. The scheduling policy has to be changed to maintain efficient vectors while keeping an optimal level of concurrency. The model has complex dynamics requiring tuning the thresholds to switch between the normal regime and special modes, i.e. prioritizing events to allow flushing memory, adding new events in the transport pipeline to boost locality, dynamically adjusting the particle vector size or switching between vector to single track mode when vectorization causes only overhead. This work requires a comprehensive study for optimizing these parameters to make the behaviour of the scheduler self-adapting, presenting here its initial results. (paper)

  17. Generation of concurrence between two qubits locally coupled to a one-dimensional spin chain

    Science.gov (United States)

    Nag, Tanay; Dutta, Amit

    2016-08-01

    We consider a generalized central spin model, consisting of two central qubits and an environmental spin chain (with periodic boundary condition) to which these central qubits are locally and weakly connected either at the same site or at two different sites separated by a distance d . Our purpose is to study the subsequent temporal generation of entanglement, quantified by concurrence, when initially the qubits are in an unentangled state. In the equilibrium situation, we show that the concurrence survives for a larger value of d when the environmental spin chain is critical. Importantly, a common feature observed both in the equilibrium and the nonequilibrium situations while the latter is created by a sudden but global change of the environmental transverse field is that the two qubits become maximally entangled for the critical quenching. Following a nonequilibrium evolution of the spin chain, our study for d ≠0 indicates that there exists a threshold time above which concurrence attains a finite value. Additionally, we show that the number of independent decohering channels (DCs) is determined by d as well as the local difference of the transverse field of the two underlying Hamiltonians governing the time evolution; the concurrence can be enhanced by a higher number of independent channels. The qualitatively similar behavior displayed by the concurrence for critical and off-critical quenches, as reported here, is characterized by analyzing the nonequilibrium evolution of these channels. The concurrence is maximum when the decoherence factor or the echo associated with the most rapidly DC decays to zero; on the contrary, the condition when the concurrence vanishes is determined nontrivially by the associated decay of one of the intermediate DCs. Analyzing the reduced density of a single qubit, we also explain the observation that the dephasing rate is always slower than the unentanglement rate. We further establish that the maximally and minimally decohering

  18. Concurrent progressive-ratio schedules: built-in controls in the study of delayed reward efficacy.

    Science.gov (United States)

    Jarmolowicz, David P; Hudnall, Jennifer L

    2014-08-15

    Delayed rewards maintain lower rates of operant responding than immediate rewards, and when given a choice between immediate and delayed rewards, individuals typically choose the immediate reward, even when it is smaller (a phenomenon called delay discounting). The behavioral and neural mechanisms underlying these behavioral patterns, however, are not conclusively understood. The present study developed a method to examine the efficacy of delayed rewards in a way that is suitable for pharmacological manipulation of delayed reward efficacy (while controlling for general changes in reward efficacy). The progressive ratio (PR) paradigm often used to examine reward efficacy was modified such that two PR schedules for lever pressing concurrently yet independently were presented. Across a series of conditions, a range of delays (3-81s) were arranged on one of the levers while the reward on the other lever remained immediate. PR breakpoints (the highest ratio completed on each lever, our measure of reward efficacy) systematically decreased on the delayed, but not on the immediate reward lever, suggesting that delays decreased reward efficacy. This decrease in breakpoint resulted in bias in within-session responding that was accounted for by models that adjusted reward value by the delay to that reward. Unlike the standard PR paradigm, the present arrangement provided the controls needed to differentiate delay specific from general changes in reward efficacy. The present method should be helpful in the study of the behavioral and neural mechanisms of delayed reward efficacy. Modifications of the present paradigm should be useful for pharmacological studies. Copyright © 2014 Elsevier B.V. All rights reserved.

  19. Concurrent schedules of wheel-running reinforcement: choice between different durations of opportunity to run in rats.

    Science.gov (United States)

    Belke, Terry W

    2006-02-01

    How do animals choose between opportunities to run of different durations? Are longer durations preferred over shorter durations because they permit a greater number of revolutions? Are shorter durations preferred because they engender higher rates of running? Will longer durations be chosen because running is less constrained? The present study reports on three experiments that attempted to address these questions. In the first experiment, five male Wistar rats chose between 10-sec and 50-sec opportunities to run on modified concurrent variable-interval (VI) schedules. Across conditions, the durations associated with the alternatives were reversed. Response, time, and reinforcer proportions did not vary from indifference. In a second experiment, eight female Long-Evans rats chose between opportunities to run of equal (30 sec) and unequal durations (10 sec and 50 sec) on concurrent variable-ratio (VR) schedules. As in Experiment 1, between presentations of equal duration conditions, 10-sec and 50-sec durations were reversed. Results showed that response, time, and reinforcer proportions on an alternative did not vary with reinforcer duration. In a third experiment, using concurrent VR schedules, durations were systematically varied to decrease the shorter duration toward 0 sec. As the shorter duration decreased, response, time, and reinforcer proportions shifted toward the longer duration. In summary, differences in durations of opportunities to run did not affect choice behavior in a manner consistent with the assumption that a longer reinforcer is a larger reinforcer.

  20. Using Scheduled Ordering to Improve the Performance of Distribution Supply Chains

    OpenAIRE

    Lucy Gongtao Chen; Srinagesh Gavirneni

    2010-01-01

    We study a supply chain with one supplier and many retailers that face exogenous end-customer demands. The supplier and the retailers all try to minimize their own inventory-related costs. In contrast to the retailers' newsvendor-type ordering behavior (under which retailers may place orders freely in every period), we propose two scheduled ordering policies: the scheduled balanced ordering policy (SBOP) and the scheduled synchronized ordering policy (SSOP). Under both the SBOP and SSOP, reta...

  1. Contingency discriminability and the generalized matching law describe choice on concurrent ratio schedules of wheel-running reinforcement.

    Science.gov (United States)

    Belke, Terry W

    2012-07-01

    Belke (2010) showed that on concurrent ratio schedules, the difference in ratio requirements required to produce near exclusive preference for the lower ratio alternative was substantively greater when the reinforcer was wheel running than when it was sucrose. The current study replicated this finding and showed that this choice behavior can be described by the matching law and the contingency discriminability model. Eight female Long Evans rats were exposed to concurrent VR schedules of wheel-running reinforcement (30s) and the schedule value of the initially preferred alternative was systematically increased. Two rats rapidly developed exclusive preference for the lower ratio alternative, but the majority did not - even when ratios differed by 20:1. Analysis showed that estimates of slopes from the matching law and the proportion of reinforcers misattributed from the contingency discriminability model were related to the ratios at which near exclusive preference developed. The fit of these models would be consistent with misattribution of reinforcers or poor discrimination between alternatives due to the long duration of wheel running. Copyright © 2012 Elsevier B.V. All rights reserved.

  2. Four-concurrence in the transverse X Y spin-1/2 chain

    Science.gov (United States)

    Osterloh, Andreas; Schützhold, Ralf

    2017-07-01

    We analyze the entanglement measure C4 for specific mixed states in general and for the ground state of the transverse X Y spin-1/2 chain. We find that its factorizing property for pure states does not easily extend to mixed states. For cases where the density matrix is a tensor product, C4 is definitely upper bounded by the product of the corresponding concurrences. In transverse X Y chains, we find that for large distances this condition goes conform with the working hypotheses of a factorizing property of density matrices in this limit. Additionally, we find that C4 together with the genuine multipartite negativity makes it impossible to decide—at the present state of knowledge—which type of entanglement prevails in the system. In particular, this is true for all entanglement measures that detect SL-invariant genuine n -partite entanglement for different n . Further measures of SL-invariant genuine multipartite entanglement have to be considered here. C4 is, however, of the same order of magnitude as the genuine multipartite negativity in Phys. Rev. B 89, 134101 (2014), 10.1103/PhysRevB.89.134101 and shows the same functional behavior, which we read as a hint towards the Greenberger-Horne-Zeilinger (GHZ) type of entanglement. Furthermore, we observe an interesting feature in the C4 values that resembles a destructive interference with the underlying concurrence.

  3. Rolling schedule approaches for supply chain operations planning

    NARCIS (Netherlands)

    Spitter, J.M.

    2005-01-01

    Supply Chain Operations Planning (SCOP) involves the determination of an extensive production plan for a network of manufacturing and distribution entities within and across organizations. The production plan consist of order release decisions that allocate materials and resources in order to

  4. Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling

    Directory of Open Access Journals (Sweden)

    Diwakar Shukla

    2010-01-01

    Full Text Available There are many CPU scheduling algorithms inliterature like FIFO, Round Robin, Shortest-Job-First and so on.The Multilevel-Queue-Scheduling is superior to these due to itsbetter management of a variety of processes. In this paper, aMarkov chain model is used for a general setup of Multilevelqueue-scheduling and the scheduler is assumed to performrandom movement on queue over the quantum of time.Performance of scheduling is examined through a rowdependent data model. It is found that with increasing value of αand d, the chance of system going over the waiting state reduces.At some of the interesting combinations of α and d, it diminishesto zero, thereby, provides us some clue regarding better choice ofqueues over others for high priority jobs. It is found that ifqueue priorities are added in the scheduling intelligently thenbetter performance could be obtained. Data model helpschoosing appropriate preferences.

  5. Graph-Based Decision Making for Task Scheduling in Concurrent Gaudi

    CERN Document Server

    Shapoval, Illya; Hegner, Benedikt; Funke, Daniel; Piparo, Danilo; Mato Vila, Pere

    2015-01-01

    The modern trend of extensive levels of hardware parallelism and heterogeneity pushes software to evolve through a paradigm shift towards concurrent data processing architectures. One such striking example in the domain of high-energy physics is represented by Gaudi – an experiment independent software framework, used in two of four major experiments of the Large Hadron Collider project, and in several others. The framework is responsible for event processing by means of hundreds of algorithms which have logical and data dependencies between each other. Historically, the framework was designed being inherently sequential, meaning that at any time of data processing there is only one event being processed and only one algorithm being executed on it. This allowed to respect the dependencies of algorithms by just organizing them in a well-defined execution path to be run on CPU. The evolution of the Gaudi framework into its concurrent incarnation, though, implies the necessity to split the execution path dynam...

  6. Information Flow Scheduling in Concurrent Multi-Product Development Based on DSM

    Science.gov (United States)

    Sun, Qing-Chao; Huang, Wei-Qiang; Jiang, Ying-Jie; Sun, Wei

    2017-09-01

    Multi-product collaborative development is adopted widely in manufacturing enterprise, while the present multi-project planning models don't take technical/data interactions of multiple products into account. To decrease the influence of technical/data interactions on project progresses, the information flow scheduling models based on the extended DSM is presented. Firstly, information dependencies are divided into four types: series, parallel, coupling and similar. Secondly, different types of dependencies are expressed as DSM units, and the extended DSM model is brought forward, described as a block matrix. Furthermore, the information flow scheduling methods is proposed, which involves four types of operations, where partitioning and clustering algorithm are modified from DSM for ensuring progress of high-priority project, merging and converting is the specific computation of the extended DSM. Finally, the information flow scheduling of two machine tools development is analyzed with example, and different project priorities correspond to different task sequences and total coordination cost. The proposed methodology provides a detailed instruction for information flow scheduling in multi-product development, with specially concerning technical/data interactions.

  7. Concurrent enterprise: a conceptual framework for enterprise supply-chain network activities

    Science.gov (United States)

    Addo-Tenkorang, Richard; Helo, Petri T.; Kantola, Jussi

    2017-04-01

    Supply-chain management (SCM) in manufacturing industries has evolved significantly over the years. Recently, a lot more relevant research has picked up on the development of integrated solutions. Thus, seeking a collaborative optimisation of geographical, just-in-time (JIT), quality (customer demand/satisfaction) and return-on-investment (profits), aspects of organisational management and planning through 'best practice' business-process management - concepts and application; employing system tools such as certain applications/aspects of enterprise resource planning (ERP) - SCM systems information technology (IT) enablers to enhance enterprise integrated product development/concurrent engineering principles. This article assumed three main organisation theory applications in positioning its assumptions. Thus, proposing a feasible industry-specific framework not currently included within the SCOR model's level four (4) implementation level, as well as other existing SCM integration reference models such as in the MIT process handbook's - Process Interchange Format (PIF), the TOVE project, etc. which could also be replicated in other SCs. However, the wider focus of this paper's contribution will be concentrated on a complimentary proposed framework to the SCC's SCOR reference model. Quantitative empirical closed-ended questionnaires in addition to the main data collected from a qualitative empirical real-life industrial-based pilot case study were used: To propose a conceptual concurrent enterprise framework for SCM network activities. This research adopts a design structure matrix simulation approach analysis to propose an optimal enterprise SCM-networked value-adding, customised master data-management platform/portal for efficient SCM network information exchange and an effective supply-chain (SC) network systems-design teams' structure. Furthermore, social network theory analysis will be employed in a triangulation approach with statistical correlation analysis

  8. A Hybrid Node Scheduling Approach Based on Energy Efficient Chain Routing for WSN

    Directory of Open Access Journals (Sweden)

    Yimei Kang

    2014-04-01

    Full Text Available Energy efficiency is usually a significant goal in wireless sensor networks (WSNs. In this work, an energy efficient chain (EEC data routing approach is first presented. The coverage and connectivity of WSNs are discussed based on EEC. A hybrid node scheduling approach is then proposed. It includes sleep scheduling for cyclically monitoring regions of interest in time-driven modes and wakeup scheduling for tracking emergency events in event-driven modes. A failure rate is introduced to the sleep scheduling to improve the reliability of the system. A wakeup sensor threshold and a sleep time threshold are introduced in the wakeup scheduling to reduce the consumption of energy to the possible extent. The results of the simulation show that the proposed algorithm can extend the effective lifetime of the network to twice that of PEAS. In addition, the proposed methods are computing efficient because they are very simple to implement.

  9. Adaptive Scheduling Applied to Non-Deterministic Networks of Heterogeneous Tasks for Peak Throughput in Concurrent Gaudi

    CERN Document Server

    AUTHOR|(CDS)2070032; Clemencic, Marco

    As much the e-Science revolutionizes the scientific method in its empirical research and scientific theory, as it does pose the ever growing challenge of accelerating data deluge. The high energy physics (HEP) is a prominent representative of the data intensive science and requires scalable high-throughput software to be able to cope with associated computational endeavors. One such striking example is $\\text G\\rm \\small{AUDI}$ -- an experiment independent software framework, used in several frontier HEP experiments. Among them stand ATLAS and LHCb -- two of four mainstream experiments at the Large Hadron Collider (LHC) at CERN, the European Laboratory for Particle Physics. The framework is currently undergoing an architectural revolution aiming at massively concurrent and adaptive data processing. In this work I explore new dimensions of performance improvement for the next generation $\\text G\\rm \\small{AUDI}$. I then propose a complex of generic task scheduling solutions for adaptive and non-intrusive throu...

  10. Most domestic dogs (Canis lupus familiaris) prefer food to petting: population, context, and schedule effects in concurrent choice.

    Science.gov (United States)

    Feuerbacher, Erica N; Wynne, Clive D L

    2014-05-01

    Previous research has indicated both petting (McIntire & Colley, 1967) and food (Feuerbacher & Wynne, 2012) have reinforcing effects on dog behavior and support social behavior towards humans (food: Elliot & King, 1960; social interaction: Brodbeck, 1954). Which type of interaction dogs prefer and which might produce the most social behavior from a dog has not been investigated. In the current study, we assessed how dogs allocated their responding in a concurrent choice between food and petting. Dogs received five 5-min sessions each. In Session 1, both food and petting were continuously delivered contingent on the dog being near the person providing the respective consequence. Across the next three sessions, we thinned the food schedule to a Fixed Interval (FI) 15-s, FI 1-min, and finally extinction. The fifth session reversed back to the original food contingency. We tested owned dogs in familiar (daycare) and unfamiliar (laboratory room) environments, and with their owner or a stranger as the person providing petting. In general, dogs preferred food to petting when food was readily available and all groups showed sensitivity to the thinning food schedule by decreasing their time allocation to food, although there were group and individual differences in the level of sensitivity. How dogs allocated their time with the petting alternative also varied. We found effects of context, familiarity of the person providing petting, and relative deprivation from social interaction on the amount of time dogs allocated to the petting alternative. © Society for the Experimental Analysis of Behavior.

  11. Assessing and Increasing Staff Preference for Job Tasks Using Concurrent-Chains Schedules and Probabilistic Outcomes

    Science.gov (United States)

    Reed, Derek D.; DiGennaro Reed, Florence D.; Campisano, Natalie; Lacourse, Kristen; Azulay, Richard L.

    2012-01-01

    The assessment and improvement of staff members' subjective valuation of nonpreferred work tasks may be one way to increase the quality of staff members' work life. The Task Enjoyment Motivation Protocol (Green, Reid, Passante, & Canipe, 2008) provides a process for supervisors to identify the aversive qualities of nonpreferred job tasks.…

  12. The general matching law describes choice on concurrent variable-interval schedules of wheel-running reinforcement.

    Science.gov (United States)

    Belke, T W; Belliveau, J

    2001-05-01

    Six male Wistar rats were exposed to concurrent variable-interval schedules of wheel-running reinforcement. The reinforcer associated with each alternative was the opportunity to run for 15 s, and the duration of the changeover delay was 1 s. Results suggested that time allocation was more sensitive to relative reinforcement rate than was response allocation. For time allocation, the mean slopes and intercepts were 0.82 and 0.008, respectively. In contrast, for response allocation, mean slopes and intercepts were 0.60 and 0.03, respectively. Correction for low response rates and high rates of changing over, however, increased slopes for response allocation to about equal those for time allocation. The results of the present study suggest that the two-operant form of the matching law can be extended to wheel-running reinforcement. 'I'he effects of a low overall response rate, a short Changeover delay, and long postreinforcement pausing on the assessment of matching in the present study are discussed.

  13. An order insertion scheduling model of logistics service supply chain considering capacity and time factors.

    Science.gov (United States)

    Liu, Weihua; Yang, Yi; Wang, Shuqing; Liu, Yang

    2014-01-01

    Order insertion often occurs in the scheduling process of logistics service supply chain (LSSC), which disturbs normal time scheduling especially in the environment of mass customization logistics service. This study analyses order similarity coefficient and order insertion operation process and then establishes an order insertion scheduling model of LSSC with service capacity and time factors considered. This model aims to minimize the average unit volume operation cost of logistics service integrator and maximize the average satisfaction degree of functional logistics service providers. In order to verify the viability and effectiveness of our model, a specific example is numerically analyzed. Some interesting conclusions are obtained. First, along with the increase of completion time delay coefficient permitted by customers, the possible inserting order volume first increases and then trends to be stable. Second, supply chain performance reaches the best when the volume of inserting order is equal to the surplus volume of the normal operation capacity in mass service process. Third, the larger the normal operation capacity in mass service process is, the bigger the possible inserting order's volume will be. Moreover, compared to increasing the completion time delay coefficient, improving the normal operation capacity of mass service process is more useful.

  14. An unit cost adjusting heuristic algorithm for the integrated planning and scheduling of a two-stage supply chain

    Directory of Open Access Journals (Sweden)

    Jianhua Wang

    2014-10-01

    Full Text Available Purpose: The stable relationship of one-supplier-one-customer is replaced by a dynamic relationship of multi-supplier-multi-customer in current market gradually, and efficient scheduling techniques are important tools of the dynamic supply chain relationship establishing process. This paper studies the optimization of the integrated planning and scheduling problem of a two-stage supply chain with multiple manufacturers and multiple retailers to obtain a minimum supply chain operating cost, whose manufacturers have different production capacities, holding and producing cost rates, transportation costs to retailers.Design/methodology/approach: As a complex task allocation and scheduling problem, this paper sets up an INLP model for it and designs a Unit Cost Adjusting (UCA heuristic algorithm that adjust the suppliers’ supplying quantity according to their unit costs step by step to solve the model.Findings: Relying on the contrasting analysis between the UCA and the Lingo solvers for optimizing many numerical experiments, results show that the INLP model and the UCA algorithm can obtain its near optimal solution of the two-stage supply chain’s planning and scheduling problem within very short CPU time.Research limitations/implications: The proposed UCA heuristic can easily help managers to optimizing the two-stage supply chain scheduling problems which doesn’t include the delivery time and batch of orders. For two-stage supply chains are the most common form of actual commercial relationships, so to make some modification and study on the UCA heuristic should be able to optimize the integrated planning and scheduling problems of a supply chain with more reality constraints.Originality/value: This research proposes an innovative UCA heuristic for optimizing the integrated planning and scheduling problem of two-stage supply chains with the constraints of suppliers’ production capacity and the orders’ delivering time, and has a great

  15. Mixed-integer nonlinear approach for the optimal scheduling of a head-dependent hydro chain

    Energy Technology Data Exchange (ETDEWEB)

    Catalao, J.P.S.; Pousinho, H.M.I. [Department of Electromechanical Engineering, University of Beira Interior, R. Fonte do Lameiro, 6201-001 Covilha (Portugal); Mendes, V.M.F. [Department of Electrical Engineering and Automation, Instituto Superior de Engenharia de Lisboa, R. Conselheiro Emidio Navarro, 1950-062 Lisbon (Portugal)

    2010-08-15

    This paper is on the problem of short-term hydro scheduling (STHS), particularly concerning a head-dependent hydro chain. We propose a novel mixed-integer nonlinear programming (MINLP) approach, considering hydroelectric power generation as a nonlinear function of water discharge and of the head. As a new contribution to earlier studies, we model the on-off behavior of the hydro plants using integer variables, in order to avoid water discharges at forbidden areas. Thus, an enhanced STHS is provided due to the more realistic modeling presented in this paper. Our approach has been applied successfully to solve a test case based on one of the Portuguese cascaded hydro systems with a negligible computational time requirement. (author)

  16. Multi-layer service function chaining scheduling based on auxiliary graph in IP over optical network

    Science.gov (United States)

    Li, Yixuan; Li, Hui; Liu, Yuze; Ji, Yuefeng

    2017-10-01

    Software Defined Optical Network (SDON) can be considered as extension of Software Defined Network (SDN) in optical networks. SDON offers a unified control plane and makes optical network an intelligent transport network with dynamic flexibility and service adaptability. For this reason, a comprehensive optical transmission service, able to achieve service differentiation all the way down to the optical transport layer, can be provided to service function chaining (SFC). IP over optical network, as a promising networking architecture to interconnect data centers, is the most widely used scenarios of SFC. In this paper, we offer a flexible and dynamic resource allocation method for diverse SFC service requests in the IP over optical network. To do so, we firstly propose the concept of optical service function (OSF) and a multi-layer SFC model. OSF represents the comprehensive optical transmission service (e.g., multicast, low latency, quality of service, etc.), which can be achieved in multi-layer SFC model. OSF can also be considered as a special SF. Secondly, we design a resource allocation algorithm, which we call OSF-oriented optical service scheduling algorithm. It is able to address multi-layer SFC optical service scheduling and provide comprehensive optical transmission service, while meeting multiple optical transmission requirements (e.g., bandwidth, latency, availability). Moreover, the algorithm exploits the concept of Auxiliary Graph. Finally, we compare our algorithm with the Baseline algorithm in simulation. And simulation results show that our algorithm achieves superior performance than Baseline algorithm in low traffic load condition.

  17. A Decision Support System Based on Genetic Algorithm (Case Study: Scheduling in Supply Chain

    Directory of Open Access Journals (Sweden)

    Mohammad Ali Beheheshtinia

    2016-10-01

    Full Text Available Nowadays, the application of effective and efficient decisions on complex issues require the use of decision support systems. This Paper provided a decision support system based on the genetic algorithm for production and transportation scheduling problem in a supply chain. It is assumed that there are number of orders that should be produced by suppliers and should be transported to the plant by a transportation fleet. The aim is to assign orders to the suppliers, specify the order of their production, allocate processed orders to the vehicles for transport and to arrange them in a way that minimizes the total delivery time. It has been shown that the complexity of the problem was related to Np-hard and there was no possibility of using accurate methods to solve the problem in a reasonable time. So, the genetic algorithm was used in this paper to solve the problem. By using this decision support system, a new approach to supply chain management was proposed. The analysis of the approach proposed in this study compared to the conventional approaches by the decision support system indicated the preference of our proposed approach

  18. Acute cardiotoxicity with concurrent trastuzumab and radiotherapy including internal mammary chain nodes: A retrospective single-institution study

    International Nuclear Information System (INIS)

    Shaffer, Richard; Tyldesley, Scott; Rolles, Martin; Chia, Stephen; Mohamed, Islam

    2009-01-01

    Purpose: To examine the acute cardiotoxicity of internal mammary chain (IMC) irradiation with concurrent trastuzumab. Materials and Methods: Clinical and cardiac function data were collected on 59 patients with early breast cancer who were treated with adjuvant trastuzumab and chemotherapy with or without radiotherapy (often including IMC) at BC Cancer Agency in 2005. Results: Forty-four of fifty-nine patients received adjuvant radiotherapy (RT). Thirteen had left-sided IMC RT. For left-sided RT, IMC inclusion increased the mean percentage dose to 5% of the heart, but the mean doses to 50% and 90% of the heart were similar. Median baseline left ventricular ejection fraction (LVEF) was 62% and similar in all groups. Median absolute decrease in LVEF after RT was 4%, which was not significantly different according to side or inclusion of IMCs. Trastuzumab was stopped in 11 of 59 patients (18.6%) due to decrease in LVEF. After median follow up of 15 months, three patients developed clinical congestive heart failure, none of whom received left-sided IMC RT. Conclusions: There was no excess acute cardiotoxicity observed with the combination of left-sided IMC irradiation and concurrent trastuzumab

  19. Phase I trial of strictly time-scheduled gemcitabine and cisplatin with concurrent radiotherapy in patients with locally advanced pancreatic cancer

    International Nuclear Information System (INIS)

    Brunner, Thomas B.; Grabenbauer, Gerhard G.; Klein, Peter; Baum, Ulrich; Papadopoulos, Thomas; Bautz, Werner; Hohenberger, Werner; Sauer, Rolf

    2003-01-01

    Purpose: Maximal therapeutic gain in xenograft sarcoma and toxicity for jejunal mucosa is time dependent for concurrent gemcitabine and radiotherapy (RT). We used a time-dependent schedule to determine the maximal-tolerated dose and dose-limiting toxicities (DLTs; Grade 4 hematologic or Grade 3 other toxicity). Methods and Materials: Patients with pancreatic cancer (n=33), periampullary carcinoma (n=1), or bile duct cancer (n=2) were treated with 3-day conformal RT with 50.4 Gy (tumor, lymphatics) plus a 5.4-Gy boost. Concurrent cisplatin (20 mg/m 2 /d on Days 1-5 and 29-33) and gemcitabine (initially 600 mg/m 2 , weekly on Fridays 68 h before RT) were administered. Because of DLT, the doses were reduced to 500 mg/m 2 weekly and then 500, 400, or 300 mg/m 2 on Days 2, 5, 26, 33. Results: DLT occurred at all dose levels of gemcitabine >300 mg/m 2 . Fourteen patients were treated at the recommended Phase II dose of gemcitabine (300 mg/m 2 ) without DLT. The response to chemoradiation allowed 10 of 30 initially unresectable patients with primary pancreatic carcinoma to undergo radical surgery, including a complete response in 2 cases. Conclusions: At the recommended Phase II dose, chemoradiation with gemcitabine and cisplatin can be administered safely in pancreatic carcinoma. However, at higher dose levels, toxicity is severe and frequent. Patients with a chance for conversion to resection could benefit from this schedule

  20. Schedule unreliability in liner shipping : Origins and consequences for the hinterland supply chain

    NARCIS (Netherlands)

    Vernimmen, Bert; Dullaert, Wout; Engelen, Steve

    Despite claims by shipping lines that most of their containerships operate on fixed-day weekly schedules, a large survey recently revealed that over 40 of the vessels deployed on worldwide liner services arrive one or more days behind schedule. Broadly speaking, the survey found relatively low

  1. Building Safe Concurrency Abstractions

    DEFF Research Database (Denmark)

    Madsen, Ole Lehrmann

    2014-01-01

    Concurrent object-oriented programming in Beta is based on semaphores and coroutines and the ability to define high-level concurrency abstractions like monitors, and rendezvous-based communication, and their associated schedulers. The coroutine mechanism of SIMULA has been generalized into the no......Concurrent object-oriented programming in Beta is based on semaphores and coroutines and the ability to define high-level concurrency abstractions like monitors, and rendezvous-based communication, and their associated schedulers. The coroutine mechanism of SIMULA has been generalized...

  2. Scheduling with Group Dynamics: a Multi-Robot Task Allocation Algorithm based on Vacancy Chains

    National Research Council Canada - National Science Library

    Dahl, Torbjorn S; Mataric, Maja J; Sukhatme, Gaurav S

    2002-01-01

    .... We present a multi-robot task allocation algorithm that is sensitive to group dynamics. Our algorithm is based on vacancy chains, a resource distribution process common in human and animal societies...

  3. A Time Scheduling Model of Logistics Service Supply Chain Based on the Customer Order Decoupling Point: A Perspective from the Constant Service Operation Time

    Science.gov (United States)

    Yang, Yi; Xu, Haitao; Liu, Xiaoyan; Wang, Yijia; Liang, Zhicheng

    2014-01-01

    In mass customization logistics service, reasonable scheduling of the logistics service supply chain (LSSC), especially time scheduling, is benefit to increase its competitiveness. Therefore, the effect of a customer order decoupling point (CODP) on the time scheduling performance should be considered. To minimize the total order operation cost of the LSSC, minimize the difference between the expected and actual time of completing the service orders, and maximize the satisfaction of functional logistics service providers, this study establishes an LSSC time scheduling model based on the CODP. Matlab 7.8 software is used in the numerical analysis for a specific example. Results show that the order completion time of the LSSC can be delayed or be ahead of schedule but cannot be infinitely advanced or infinitely delayed. Obtaining the optimal comprehensive performance can be effective if the expected order completion time is appropriately delayed. The increase in supply chain comprehensive performance caused by the increase in the relationship coefficient of logistics service integrator (LSI) is limited. The relative concern degree of LSI on cost and service delivery punctuality leads to not only changes in CODP but also to those in the scheduling performance of the LSSC. PMID:24715818

  4. A time scheduling model of logistics service supply chain based on the customer order decoupling point: a perspective from the constant service operation time.

    Science.gov (United States)

    Liu, Weihua; Yang, Yi; Xu, Haitao; Liu, Xiaoyan; Wang, Yijia; Liang, Zhicheng

    2014-01-01

    In mass customization logistics service, reasonable scheduling of the logistics service supply chain (LSSC), especially time scheduling, is benefit to increase its competitiveness. Therefore, the effect of a customer order decoupling point (CODP) on the time scheduling performance should be considered. To minimize the total order operation cost of the LSSC, minimize the difference between the expected and actual time of completing the service orders, and maximize the satisfaction of functional logistics service providers, this study establishes an LSSC time scheduling model based on the CODP. Matlab 7.8 software is used in the numerical analysis for a specific example. Results show that the order completion time of the LSSC can be delayed or be ahead of schedule but cannot be infinitely advanced or infinitely delayed. Obtaining the optimal comprehensive performance can be effective if the expected order completion time is appropriately delayed. The increase in supply chain comprehensive performance caused by the increase in the relationship coefficient of logistics service integrator (LSI) is limited. The relative concern degree of LSI on cost and service delivery punctuality leads to not only changes in CODP but also to those in the scheduling performance of the LSSC.

  5. [Impact of glutamine, eicosapntemacnioc acid, branched-chain amino acid supplements on nutritional status and treatment compliance of esophageal cancer patients on concurrent chemoradiotherapy and gastric cancer patients on chemotherapy].

    Science.gov (United States)

    Cong, Minghua; Song, Chenxin; Zou, Baohua; Deng, Yingbing; Li, Shuluan; Liu, Xuehui; Liu, Weiwei; Liu, Jinying; Yu, Lei; Xu, Binghe

    2015-03-17

    To explore the effects of glutamine, eicosapntemacnioc acid (EPA) and branched-chain amino acids supplements in esophageal cancer patients on concurrent chemoradiotherapy and gastric cancer patients on chemotherapy. From April 2013 to April 2014, a total of 104 esophageal and gastric carcinoma patients on chemotherapy or concurrent chemoradiotherapy were recruited and randomly divided into experimental and control groups. Both groups received dietary counseling and routine nutritional supports while only experimental group received supplements of glutamine (20 g/d), EPA (3.3 g/d) and branched-chain amino acids (8 g/d). And body compositions, blood indicators, incidence of complications and completion rates of therapy were compared between two groups. After treatment, free fat mass and muscle weight increased significantly in experiment group while decreased in control group (P nutrition status, decrease the complications and improve compliance for esophageal cancer patients on concurrent chemo-radiotherapy and gastric cancer patients on postoperative adjuvant chemotherapy.

  6. Development of a hybrid genetic algorithm based decision support system for vehicle routing and scheduling in supply chain logistics managment

    OpenAIRE

    Khanian, Seyed Mohammad Shafi

    2007-01-01

    Vehicle Routing and Scheduling (VRS) constitute an important part of logistics management. Given the fact that the worldwide cost on physical distribution is evermore increasing, the global competition and the complex nature of logistics problems, one area, which determines the efficiency of all others, is the VRS activities. The application of Decision Support Systems (DSS) to assist logistics management with an efficient VRS could be of great benefit. Although the benefits of DSS in VRS are...

  7. The Official Control beyond the Official Control. How To Plan And Schedule Controls Starting From Risk Assessment Along The Agro-Food Supply Chain.

    Science.gov (United States)

    Panunzio, M F; Caporizzi, R; Lagravinese, D; Conversano, M

    2015-01-01

    Every year the Italian Ministry of Health, on the basis of regional data, draws up the "Report on Official Controls" to be submitted to the Parliament. The report contains abundant data, diagrams and charts and illustrates the number and type of official controls (OC) performed by the pertinent Bodies (Ministry of Health, Regional and Local Health Authorities) over the previous year on Food Business Operators (FBO), in accordance with the EC Regulation 882/2004. The trend - which has consolidated over the years - relates to the multiplicity of OC and shows a decrease of such controls compared to an increase in "non-conformities". OC frequency is established by the Regional Authorities on the basis of the categorisation of both a "generic risk" for companies calculated taking into account the probability of occurrence of a "non-conformity", and a "specific" risk, assessed on the basis of the results of the OC actually performed on a given "Operatore del Settore Alimentare" (Food Sector Operator, in Italian: OSA). Thus, categorisation (i.e. the probability of occurrence of non-conformities) is the main driver of the OC scheduling and planning process. We have been asking ourselves whether the current OC planning/scheduling method is still suitable for ensuring food safety in the face of internalisation of the food supply chain. As a matter of fact, food safety is now becoming increasingly variable due to the globalization of consumption where "farm to fork", rather than "border to fork", food safety must be ensured. On the basis of these considerations, a different OC planning /scheduling method is being proposed based on the assessment of risks and the estimation of the occurrence of the same along the agro-food chain.

  8. Comparing Book- and Tablet-Based Picture Activity Schedules: Acquisition and Preference.

    Science.gov (United States)

    Giles, Aimee; Markham, Victoria

    2017-09-01

    Picture activity schedules consist of a sequence of images representing the order of tasks for a person to complete. Although, picture activity schedules have traditionally been presented in a book format, recently picture activity schedules have been evaluated on technological devices such as an iPod™ touch. The present study compared the efficiency of picture activity schedule acquisition on book- and tablet-based modalities. In addition, participant preference for each modality was assessed. Three boys aged below 5 years with a diagnosis of autism participated. Participants were taught to follow the schedules using both modalities. Following mastery of each modality of picture activity schedule, a concurrent-chains preference assessment was conducted to evaluate participant preference for each modality. Differences in acquisition rates across the two modalities were marginal. Preference for book- or tablet-based schedules was idiosyncratic across participants.

  9. Nation-Scale Adoption of Shorter Breast Radiation Therapy Schedules Can Increase Survival in Resource Constrained Economies: Results From a Markov Chain Analysis

    Energy Technology Data Exchange (ETDEWEB)

    Khan, Atif J., E-mail: atif.j.khan@rutgers.edu [Department of Radiation Oncology, Robert Wood Johnson Medical School/Cancer Institute of New Jersey, New Brunswick, New Jersey (United States); Rafique, Raza [Suleman Dawood School of Business, Lahore University of Management Sciences, Lahore (Pakistan); Zafar, Waleed [Shaukat Khanum Memorial Cancer Hospital and Research Centre, Lahore (Pakistan); Shah, Chirag [Department of Radiation Oncology, Cleveland Clinic, Cleveland, Ohio (United States); Haffty, Bruce G. [Department of Radiation Oncology, Robert Wood Johnson Medical School/Cancer Institute of New Jersey, New Brunswick, New Jersey (United States); Vicini, Frank [Michigan HealthCare Professionals, Farmington Hills, Michigan (United States); Jamshed, Arif [Shaukat Khanum Memorial Cancer Hospital and Research Centre, Lahore (Pakistan); Zhao, Yao [Rutgers University School of Business, Newark, New Jersey (United States)

    2017-02-01

    Purpose: Hypofractionated whole breast irradiation and accelerated partial breast irradiation (APBI) offer women options for shorter courses of breast radiation therapy. The impact of these shorter schedules on the breast cancer populations of emerging economies with limited radiation therapy resources is unknown. We hypothesized that adoption of these schedules would improve throughput in the system and, by allowing more women access to life-saving treatments, improve patient survival within the system. Methods and Materials: We designed a Markov chain model to simulate the different health states that a postlumpectomy or postmastectomy patient could enter over the course of a 20-year follow-up period. Transition rates between health states were adapted from published data on recurrence rates. We used primary data from a tertiary care hospital in Lahore, Pakistan, to populate the model with proportional use of mastectomy versus breast conservation and to estimate the proportion of patients suitable for APBI. Sensitivity analyses on the use of APBI and relative efficacy of APBI were conducted to study the impact on the population. Results: The shorter schedule resulted in more women alive and more women remaining without evidence of disease (NED) compared with the conventional schedule, with an absolute difference of about 4% and 7% at 15 years, respectively. Among women who had lumpectomies, the chance of remaining alive and with an intact breast was 62% in the hypofractionation model and 54% in the conventional fractionation model. Conclusions: Increasing throughput in the system can result in improved survival, improved chances of remaining without evidence of disease, and improved chances of remaining alive with a breast. These findings are significant and suggest that adoption of hypofractionation in emerging economies is not simply a question of efficiency and cost but one of access to care and patient survivorship.

  10. Nation-Scale Adoption of Shorter Breast Radiation Therapy Schedules Can Increase Survival in Resource Constrained Economies: Results From a Markov Chain Analysis

    International Nuclear Information System (INIS)

    Khan, Atif J.; Rafique, Raza; Zafar, Waleed; Shah, Chirag; Haffty, Bruce G.; Vicini, Frank; Jamshed, Arif; Zhao, Yao

    2017-01-01

    Purpose: Hypofractionated whole breast irradiation and accelerated partial breast irradiation (APBI) offer women options for shorter courses of breast radiation therapy. The impact of these shorter schedules on the breast cancer populations of emerging economies with limited radiation therapy resources is unknown. We hypothesized that adoption of these schedules would improve throughput in the system and, by allowing more women access to life-saving treatments, improve patient survival within the system. Methods and Materials: We designed a Markov chain model to simulate the different health states that a postlumpectomy or postmastectomy patient could enter over the course of a 20-year follow-up period. Transition rates between health states were adapted from published data on recurrence rates. We used primary data from a tertiary care hospital in Lahore, Pakistan, to populate the model with proportional use of mastectomy versus breast conservation and to estimate the proportion of patients suitable for APBI. Sensitivity analyses on the use of APBI and relative efficacy of APBI were conducted to study the impact on the population. Results: The shorter schedule resulted in more women alive and more women remaining without evidence of disease (NED) compared with the conventional schedule, with an absolute difference of about 4% and 7% at 15 years, respectively. Among women who had lumpectomies, the chance of remaining alive and with an intact breast was 62% in the hypofractionation model and 54% in the conventional fractionation model. Conclusions: Increasing throughput in the system can result in improved survival, improved chances of remaining without evidence of disease, and improved chances of remaining alive with a breast. These findings are significant and suggest that adoption of hypofractionation in emerging economies is not simply a question of efficiency and cost but one of access to care and patient survivorship.

  11. Concurrent Collections

    OpenAIRE

    Budimlić, Zoran; Burke, Michael; Cavé, Vincent; Knobe, Kathleen; Lowney, Geoff; Newton, Ryan; Palsberg, Jens; Peixotto, David; Sarkar, Vivek; Schlimbach, Frank; Taşırlar, Sağnak

    2010-01-01

    We introduce the Concurrent Collections (CnC) programming model. CnC supports flexible combinations of task and data parallelism while retaining determinism. CnC is implicitly parallel, with the user providing high-level operations along with semantic ordering constraints that together form a CnC graph. We formally describe the execution semantics of CnC and prove that the model guarantees deterministic computation. We evaluate the performance of CnC implementations on several applications an...

  12. Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

    Science.gov (United States)

    Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin

    2016-03-01

    Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.

  13. Concurrent weighted logic

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2015-01-01

    We introduce Concurrent Weighted Logic (CWL), a multimodal logic for concurrent labeled weighted transition systems (LWSs). The synchronization of LWSs is described using dedicated functions that, in various concurrency paradigms, allow us to encode the compositionality of LWSs. To reflect these......-completeness results for this logic. To complete these proofs we involve advanced topological techniques from Model Theory....

  14. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  15. Measuring and modelling concurrency

    Science.gov (United States)

    Sawers, Larry

    2013-01-01

    This article explores three critical topics discussed in the recent debate over concurrency (overlapping sexual partnerships): measurement of the prevalence of concurrency, mathematical modelling of concurrency and HIV epidemic dynamics, and measuring the correlation between HIV and concurrency. The focus of the article is the concurrency hypothesis – the proposition that presumed high prevalence of concurrency explains sub-Saharan Africa's exceptionally high HIV prevalence. Recent surveys using improved questionnaire design show reported concurrency ranging from 0.8% to 7.6% in the region. Even after adjusting for plausible levels of reporting errors, appropriately parameterized sexual network models of HIV epidemics do not generate sustainable epidemic trajectories (avoid epidemic extinction) at levels of concurrency found in recent surveys in sub-Saharan Africa. Efforts to support the concurrency hypothesis with a statistical correlation between HIV incidence and concurrency prevalence are not yet successful. Two decades of efforts to find evidence in support of the concurrency hypothesis have failed to build a convincing case. PMID:23406964

  16. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    Warfare, Naval Sea Systems Command Acquisition Cycle Time : Defining the Problem David Tate, Institute for Defense Analyses Schedule Analytics Jennifer...research was comprised of the following high- level steps :  Identify and review primary data sources 1...research. However, detailed reviews of the OMB IT Dashboard data revealed that schedule data is highly aggregated. Program start date and program end date

  17. Generalization of concurrence vectors

    International Nuclear Information System (INIS)

    Yu Changshui; Song Heshan

    2004-01-01

    In this Letter, based on the generalization of concurrence vectors for bipartite pure state with respect to employing tensor product of generators of the corresponding rotation groups, we generalize concurrence vectors to the case of mixed states; a new criterion of separability of multipartite pure states is given out, for which we define a concurrence vector; we generalize the vector to the case of multipartite mixed state and give out a good measure of free entanglement

  18. Temporal Concurrent Constraint Programming

    DEFF Research Database (Denmark)

    Nielsen, Mogens; Valencia Posso, Frank Dan

    2002-01-01

    The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied...... reflect the reactive interactions between concurrent constraint processes and their environment, as well as internal interactions between individual processes. Relationships between the suggested notions are studied, and they are all proved to be decidable for a substantial fragment of the calculus...

  19. Influence of temporal context on value in the multiple-chains and successive-encounters procedures.

    Science.gov (United States)

    O'Daly, Matthew; Angulo, Samuel; Gipson, Cassandra; Fantino, Edmund

    2006-05-01

    This set of studies explored the influence of temporal context across multiple-chain and multiple-successive-encounters procedures. Following training with different temporal contexts, the value of stimuli sharing similar reinforcement schedules was assessed by presenting these stimuli in concurrent probes. The results for the multiple-chain schedule indicate that temporal context does impact the value of a conditioned reinforcer consistent with delay-reduction theory, such that a stimulus signaling a greater reduction in delay until reinforcement has greater value. Further, nonreinforced stimuli that are concurrently presented with the preferred terminal link also have greater value, consistent with value transfer. The effects of context on value for conditions with the multiple-successive-encounters procedure, however, appear to depend on whether the search schedule or alternate handling schedule was manipulated, as well as on whether the tested stimuli were the rich or lean schedules in their components. Overall, the results help delineate the conditions under which temporal context affects conditioned-reinforcement value (acting as a learning variable) and the conditions under which it does not (acting as a performance variable), an issue of relevance to theories of choice.

  20. Temporal Concurrent Constraint Programming

    DEFF Research Database (Denmark)

    Nielsen, Mogens; Palamidessi, Catuscia; Valencia, Frank Dan

    2002-01-01

    The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied...

  1. Impredicative concurrent abstract predicates

    DEFF Research Database (Denmark)

    Svendsen, Kasper; Birkedal, Lars

    2014-01-01

    We present impredicative concurrent abstract predicates { iCAP { a program logic for modular reasoning about concurrent, higher- order, reentrant, imperative code. Building on earlier work, iCAP uses protocols to reason about shared mutable state. A key novel feature of iCAP is the ability to dene...

  2. Automata and concurrency

    Energy Technology Data Exchange (ETDEWEB)

    Priese, L

    1983-07-01

    The author presents a precise notion of a realization (or simulation) of one concurrent system by another, and studies the relations of modular concurrent systems and non-persistent (i.e. With conflicts) concurrent systems in an automata theoretical style. He introduces a conception of realization that obeys three requirements: it allows for proper hierarchies in certain classes of concurrent systems; it allows for normal-form theorems, and the standard constructions of the literature remain realizations in formal concept; and it clarifies some counterintuitive examples. Further, although this realization conception is developed to translate the computational aspects of concurrent systems, it also gives a formal tool for the handling of synchronization problems. 38 references.

  3. Nonblocking Scheduling for Web Service Transactions

    DEFF Research Database (Denmark)

    Alrifai, Mohammad; Balke, Wolf-Tilo; Dolog, Peter

    2007-01-01

    . In this paper, we propose a novel nonblocking scheduling mechanism that is used prior to the actual service invocations. Its aim is to reach an agreement between the client and all participating providers on what transaction processing times have to be expected, accepted, and guaranteed. This enables service......For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local...... schedulers of service providers typically do take into account neither time constraints for committing the whole transaction, nor the individual services' constraints when scheduling decisions are made. This often leads to an unnecessary blocking of transactions by (possibly long-running) others...

  4. Critical Chain Exercises

    Science.gov (United States)

    Doyle, John Kevin

    2010-01-01

    Critical Chains project management focuses on holding buffers at the project level vs. task level, and managing buffers as a project resource. A number of studies have shown that Critical Chain project management can significantly improve organizational schedule fidelity (i.e., improve the proportion of projects delivered on time) and reduce…

  5. Channel's Concurrence and Quantum Teleportation

    Institute of Scientific and Technical Information of China (English)

    LING Yin-Sheng

    2005-01-01

    Concurrence can measure the entanglement property of a system. If the channel is a pure state, positive concurrence state can afford the good performance in the teleportation process. If the channel ia a mixed state, positive concurrence state cannot assure the good performance in the teleportation. The conditions of the positive concurrence and the quantum teleportation in the Heisenberg spin ring is derived.

  6. Algebraic topology and concurrency

    DEFF Research Database (Denmark)

    Fajstrup, Lisbeth; Raussen, Martin; Goubault, Eric

    2006-01-01

    We show in this article that some concepts from homotopy theory, in algebraic topology,are relevant for studying concurrent programs. We exhibit a natural semantics of semaphore programs, based on partially ordered topological spaces, which are studied up to “elastic deformation” or homotopy...... differences between ordinary and directed homotopy through examples. We also relate the topological view to a combinatorial view of concurrent programs closer to transition systems, through the notion of a cubical set. Finally we apply some of these concepts to the proof of the safeness of a two...

  7. A Concurrent Logical Relation

    DEFF Research Database (Denmark)

    Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker

    2012-01-01

    We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number....... To the best of our knowledge, this is the first such result for a concurrent higher-order language with higher-order store and dynamic memory allocation....

  8. Synchronization of Concurrent Processes

    Science.gov (United States)

    1975-07-01

    Pettersen Stanford Ur.iversity Artificial Intelligence Laboratory ABSTRACT Th oaoer gives an overview of commonly used synchronization primitives and...wr.ters . ut.l.z.ng the DroDo4d synchronization primitive . The solution is simpler and shorter than other known S’ms The first sections of the paper...un reicr»» side il nrcttaary and Identity by block number) Scheduling, process scheduling, synchronization , mutual exclusion, semaphores , critical

  9. Coalgebra, concurrency and control

    NARCIS (Netherlands)

    J.J.M.M. Rutten (Jan)

    1999-01-01

    textabstractCoalgebra is used to generalize notions and techniques from concurrency theory, in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredients of this approach are the characterization of controllability in terms of (a variant of)

  10. Correctness of concurrent processes

    NARCIS (Netherlands)

    E.R. Olderog (Ernst-Rüdiger)

    1989-01-01

    textabstractA new notion of correctness for concurrent processes is introduced and investigated. It is a relationship P sat S between process terms P built up from operators of CCS [Mi 80], CSP [Ho 85] and COSY [LTS 79] and logical formulas S specifying sets of finite communication sequences as in

  11. Scheduling the scheduling task : a time management perspective on scheduling

    NARCIS (Netherlands)

    Larco Martinelli, J.A.; Wiers, V.C.S.; Fransoo, J.C.

    2013-01-01

    Time is the most critical resource at the disposal of schedulers. Hence, an adequate management of time from the schedulers may impact positively on the scheduler’s productivity and responsiveness to uncertain scheduling environments. This paper presents a field study of how schedulers make use of

  12. Concurrent credit portfolio losses.

    Science.gov (United States)

    Sicking, Joachim; Guhr, Thomas; Schäfer, Rudi

    2018-01-01

    We consider the problem of concurrent portfolio losses in two non-overlapping credit portfolios. In order to explore the full statistical dependence structure of such portfolio losses, we estimate their empirical pairwise copulas. Instead of a Gaussian dependence, we typically find a strong asymmetry in the copulas. Concurrent large portfolio losses are much more likely than small ones. Studying the dependences of these losses as a function of portfolio size, we moreover reveal that not only large portfolios of thousands of contracts, but also medium-sized and small ones with only a few dozens of contracts exhibit notable portfolio loss correlations. Anticipated idiosyncratic effects turn out to be negligible. These are troublesome insights not only for investors in structured fixed-income products, but particularly for the stability of the financial sector. JEL codes: C32, F34, G21, G32, H81.

  13. Temporal Concurrent Constraint Programming

    DEFF Research Database (Denmark)

    Valencia, Frank Dan

    Concurrent constraint programming (ccp) is a formalism for concurrency in which agents interact with one another by telling (adding) and asking (reading) information in a shared medium. Temporal ccp extends ccp by allowing agents to be constrained by time conditions. This dissertation studies...... temporal ccp by developing a process calculus called ntcc. The ntcc calculus generalizes the tcc model, the latter being a temporal ccp model for deterministic and synchronouss timed reactive systems. The calculus is built upon few basic ideas but it captures several aspects of timed systems. As tcc, ntcc...... structures, robotic devises, multi-agent systems and music applications. The calculus is provided with a denotational semantics that captures the reactive computations of processes in the presence of arbitrary environments. The denotation is proven to be fully-abstract for a substantial fragment...

  14. Step-by-step cyclic processes scheduling

    DEFF Research Database (Denmark)

    Bocewicz, G.; Nielsen, Izabela Ewa; Banaszak, Z.

    2013-01-01

    Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research is to pro......Automated Guided Vehicles (AGVs) fleet scheduling is one of the big problems in Flexible Manufacturing System (FMS) control. The problem is more complicated when concurrent multi-product manufacturing and resource deadlock avoidance policies are considered. The objective of the research...... is to provide a declarative model enabling to state a constraint satisfaction problem aimed at AGVs fleet scheduling subject to assumed itineraries of concurrently manufactured product types. In other words, assuming a given layout of FMS’s material handling and production routes of simultaneously manufactured...... orders, the main objective is to provide the declarative framework aimed at conditions allowing one to calculate the AGVs fleet schedule in online mode. An illustrative example of the relevant algebra-like driven step-by-stem cyclic scheduling is provided....

  15. Concurrent radiotherapy and chemotherapy

    International Nuclear Information System (INIS)

    Fu, K.K.

    1985-01-01

    The principal objective of combining chemotherapy with radiotherapy (XRT) for the treatment of advanced head and neck cancer is to improve the therapeutic ratio through the enhancement of local control and reduction of distant metastases without excessively enhancing normal tissue effects. Improved tumour control can result from sole additivity of either therapy or direct interactions between drug and radiation leading to increased tumour cell kill. Chemotherapy may sensitize the cells to radiation, interfere with repair of sublethal or potentially lethal radiation damage, induce cell synchrony, and reduce tumour mass leading to reoxygenation and decreased fraction of resistant hypoxic cells. Radiation may improve drug accessibility to tumour cells and reduce tumour volume leading to increased cell proliferation and chemosensitivity. If the enhanced effects of combined therapy are purely additive, then the two modalities can be administered either sequentially or concurrently with the same results. However, if the enhanced effects result from the direct interaction between drug and radiation, it is necessary that the two modalities be administered concurrently and in close temporal proximity. This review summarizes the results of clinical studies in which chemotherapy was administered concurrently during the course of radiotherapy for patients with previously untreated advanced squamous cell carcinoma in the head and neck

  16. Entanglement of periodic anisotropic XY chains

    International Nuclear Information System (INIS)

    Zhang Lifa; Tong Peiqing

    2005-01-01

    By using the concept of concurrence, the entanglement of periodic anisotropic XY chains in a transverse field is studied numerically. It is found that the derivatives ∂ λ C(1) of nearest-neighbour concurrence diverge at quantum critical points. By proper scaling, we found that all the derivatives ∂ λ C(1) for periodic XY chains in the vicinity of quantum critical points have the same behaviours as that of a uniform chain

  17. Context Aware Concurrent Execution Framework for Web Browser

    DEFF Research Database (Denmark)

    Saeed, Aamir; Erbad, Aiman Mahmood; Olsen, Rasmus Løvenstein

    Computing hungry multimedia web applications need to efficiently utilize the device resources. HTML5 web workers is a non-sharing concurrency platform that enables multimedia web application to utilize the available multi-core hardware. HTML5 web workers are implemented by major browser vendors...... to facilitate concurrent execution in web clients and enhance the quality of ambitious web applications. The concurrent execution in web workers allows parallel processing using available cores at the expense of communication overhead and extra computation. The benefits of concurrent execution can be maximized...... by balancing load across workers/CPU cores. This work presents load-balancing algorithms between web workers using parameters such as scheduler throughput, computation priority and game entity locality. An award-winning web-based multimedia game (raptjs.com) is used to test the performance of the load balance...

  18. VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans

    Science.gov (United States)

    Wang, Song; Gupta, Chetan; Mehta, Abhay

    There are data streams all around us that can be harnessed for tremendous business and personal advantage. For an enterprise-level stream processing system such as CHAOS [1] (Continuous, Heterogeneous Analytic Over Streams), handling of complex query plans with resource constraints is challenging. While several scheduling strategies exist for stream processing, efficient scheduling of complex DAG query plans is still largely unsolved. In this paper, we propose a novel execution scheme for scheduling complex directed acyclic graph (DAG) query plans with meta-data enriched stream tuples. Our solution, called Virtual Pipelined Chain (or VPipe Chain for short), effectively extends the "Chain" pipelining scheduling approach to complex DAG query plans.

  19. Concurrency in product realization

    Science.gov (United States)

    Kelly, Michael J.

    1994-03-01

    Technology per se does not provide a competitive advantage. Timely exploitation of technology is what gives the competitive edge, and this demands a major shift in the product development process and management of the industrial enterprise. `Teaming to win' is more than a management theme; it is the disciplined engineering practice that is essential to success in today's global marketplace. Teaming supports the concurrent engineering practices required to integrate the activities of people responsible for product realization through achievement of shorter development cycles, lower costs, and defect-free products.

  20. Domain Theory for Concurrency

    DEFF Research Database (Denmark)

    Nygaard, Mikkel

    and associated comonads, it highlights the role of linearity in concurrent computation. Two choices of comonad yield two expressive metalanguages for higher-order processes, both arising from canonical constructions in the model. Their denotational semantics are fully abstract with respect to contextual...... equivalence. One language, called HOPLA for Higher-Order Process LAnguage, derives from an exponential of linear logic. It can be viewed as an extension of the simply-typed lambda calculus with CCS-like nondeterministic sum and prefix operations, in which types express the form of computation path of which...

  1. Mastering concurrency in Go

    CERN Document Server

    Kozyra, Nathan

    2014-01-01

    A practical approach covering everything you need to know to get up and running with Go, starting with the basics and imparting increasingly more detail as the examples and topics become more complicated. The book utilizes a casual, conversational style, rife with actual code and historical anecdotes for perspective, as well as usable and extensible example applications. This book is intended for systems developers and programmers with some experience in either Go and/or concurrent programming who wish to become fluent in building high-performance applications that scale by leveraging single-c

  2. Morse Theory and Concurrency

    DEFF Research Database (Denmark)

    Wisniewski, Rafal

    2003-01-01

    The work is intended to provide some insight about concurrency theory using ideas from geometry and algebraic topology. We define a topological space containing all traces of execution of the computer program and the information about how time flows. This is the main difference with standard...... topological reasoning in which there is no information about relation "in time" among points. The main task is to define equivalence of paths reflecting execution of a program. We use the notion of homotopy history equivalence relation. The model space considered in this work is a differentiable manifold...

  3. Concurrent Engineering Working Group White Paper Distributed Collaborative Design: The Next Step in Aerospace Concurrent Engineering

    Science.gov (United States)

    Hihn, Jairus; Chattopadhyay, Debarati; Karpati, Gabriel; McGuire, Melissa; Panek, John; Warfield, Keith; Borden, Chester

    2011-01-01

    As aerospace missions grow larger and more technically complex in the face of ever tighter budgets, it will become increasingly important to use concurrent engineering methods in the development of early conceptual designs because of their ability to facilitate rapid assessments and trades of performance, cost and schedule. To successfully accomplish these complex missions with limited funding, it is essential to effectively leverage the strengths of individuals and teams across government, industry, academia, and international agencies by increased cooperation between organizations. As a result, the existing concurrent engineering teams will need to increasingly engage in distributed collaborative concurrent design. The purpose of this white paper is to identify a near-term vision for the future of distributed collaborative concurrent engineering design for aerospace missions as well as discuss the challenges to achieving that vision. The white paper also documents the advantages of creating a working group to investigate how to engage the expertise of different teams in joint design sessions while enabling organizations to maintain their organizations competitive advantage.

  4. Rethinking serializable multiversion concurrency control

    OpenAIRE

    Faleiro, Jose M.; Abadi, Daniel J.

    2014-01-01

    Multi-versioned database systems have the potential to significantly increase the amount of concurrency in transaction processing because they can avoid read-write conflicts. Unfortunately, the increase in concurrency usually comes at the cost of transaction serializability. If a database user requests full serializability, modern multi-versioned systems significantly constrain read-write concurrency among conflicting transactions and employ expensive synchronization patterns in their design....

  5. Quantify entanglement by concurrence hierarchy

    OpenAIRE

    Fan, Heng; Matsumoto, Keiji; Imai, Hiroshi

    2002-01-01

    We define the concurrence hierarchy as d-1 independent invariants under local unitary transformations in d-level quantum system. The first one is the original concurrence defined by Wootters et al in 2-level quantum system and generalized to d-level pure quantum states case. We propose to use this concurrence hierarchy as measurement of entanglement. This measurement does not increase under local quantum operations and classical communication.

  6. Concurrent Models for Object Execution

    OpenAIRE

    Diertens, Bob

    2012-01-01

    In previous work we developed a framework of computational models for the concurrent execution of functions on different levels of abstraction. It shows that the traditional sequential execution of function is just a possible implementation of an abstract computational model that allows for the concurrent execution of functions. We use this framework as base for the development of abstract computational models that allow for the concurrent execution of objects.

  7. Economic explanations for concurrent sourcing

    DEFF Research Database (Denmark)

    Mols, Niels Peter

    2010-01-01

    Concurrent sourcing is a phenomenon where firms simultaneously make and buy the same good, i.e. they simultaneously use the governance modes of market and hierarchy. Though concurrent sourcing seems to be widespread, few studies of sourcing have focused on this phenomenon. This paper reviews...... different economic explanations for why firms use concurrent sourcing. The distinctive features of the explanations are compared, and it is discussed how they may serve as a springboard for research on concurrent sourcing. Managerial implications are also offered....

  8. Concurrency Control for Transactional Drago

    OpenAIRE

    Patiño-Martinez, Marta; Jiménez-Peris, Ricardo; Kienzle, Jörg; Arévalo, Sergio

    2002-01-01

    The granularity of concurrency control has a big impact on the performance of transactional systems. Concurrency control granu- larity and data granularity (data size) are usually the same. The e ect of this coupling is that if a coarse granularity is used, the overhead of data access (number of disk accesses) is reduced, but also the degree of concurrency. On the other hand, if a ne granularity is chosen to achieve a higher degree of concurrency (there are less con icts), the cost of data ac...

  9. Measuring coherence with entanglement concurrence

    Science.gov (United States)

    Qi, Xianfei; Gao, Ting; Yan, Fengli

    2017-07-01

    Quantum coherence is a fundamental manifestation of the quantum superposition principle. Recently, Baumgratz et al (2014 Phys. Rev. Lett. 113 140401) presented a rigorous framework to quantify coherence from the view of theory of physical resource. Here we propose a new valid quantum coherence measure which is a convex roof measure, for a quantum system of arbitrary dimension, essentially using the generalized Gell-Mann matrices. Rigorous proof shows that the proposed coherence measure, coherence concurrence, fulfills all the requirements dictated by the resource theory of quantum coherence measures. Moreover, strong links between the resource frameworks of coherence concurrence and entanglement concurrence is derived, which shows that any degree of coherence with respect to some reference basis can be converted to entanglement via incoherent operations. Our work provides a clear quantitative and operational connection between coherence and entanglement based on two kinds of concurrence. This new coherence measure, coherence concurrence, may also be beneficial to the study of quantum coherence.

  10. High bandwidth concurrent processing on commodity platforms

    CERN Document Server

    Boosten, M; Van der Stok, P D V

    1999-01-01

    The I/O bandwidth and real-time processing power required for high- energy physics experiments is increasing rapidly over time. The current requirements can only be met by using large-scale concurrent processing. We are investigating the use of a large PC cluster interconnected by Fast and Gigabit Ethernet to meet the performance requirements of the ATLAS second level trigger. This architecture is attractive because of its performance and competitive pricing. A major problem is obtaining frequent high-bandwidth I/O without sacrificing the CPU's processing power. We present a tight integration of a user-level scheduler and a zero-copy communication layer. This system closely approaches the performance of the underlying hardware in terms of both CPU power and I/O capacity. (0 refs).

  11. Supply chain management and optimization in manufacturing

    CERN Document Server

    Pirim, Harun; Yilbas, Bekir Sami

    2014-01-01

    This book introduces general supply chain terminology particularly for novice readers, state of the art supply chain management and optimization issues and problems in manufacturing. The book provides insights for making supply chain decisions, planning and scheduling through supply chain network. It introduces optimization problems, i.e. transportation of raw materials, products and location, inventory of plants, warehouses and retailers, faced throughout the supply chain network.

  12. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1995-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the U.S. Department of Energy (DOE). This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring onsite drinking water falls outside the scope of the SESP. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control, and reporting. The ground-water sampling schedule identifies ground-water sampling .events used by PNL for environmental surveillance of the Hanford Site. Sampling is indicated as annual, semi-annual, quarterly, or monthly in the sampling schedule. Some samples are collected and analyzed as part of ground-water monitoring and characterization programs at Hanford (e.g. Resources Conservation and Recovery Act (RCRA), Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), or Operational). The number of samples planned by other programs are identified in the sampling schedule by a number in the analysis column and a project designation in the Cosample column. Well sampling events may be merged to avoid redundancy in cases where sampling is planned by both-environmental surveillance and another program

  13. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the U.S. Department of Energy (DOE). This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring onsite drinking water falls outside the scope of the SESP. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control, and reporting. The ground-water sampling schedule identifies ground-water sampling .events used by PNL for environmental surveillance of the Hanford Site. Sampling is indicated as annual, semi-annual, quarterly, or monthly in the sampling schedule. Some samples are collected and analyzed as part of ground-water monitoring and characterization programs at Hanford (e.g. Resources Conservation and Recovery Act (RCRA), Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), or Operational). The number of samples planned by other programs are identified in the sampling schedule by a number in the analysis column and a project designation in the Cosample column. Well sampling events may be merged to avoid redundancy in cases where sampling is planned by both-environmental surveillance and another program.

  14. Concurrent LISP and its interpreter

    Energy Technology Data Exchange (ETDEWEB)

    Tabata, K; Sugimoto, S; Ohno, Y

    1981-01-01

    In the research field of artificial intelligence many languages have been developed based on LISP, such as Planner, Conniver and so on. They have been developed to give users many useful facilities, especially for describing flexible control structures. Backtracking and coroutine facilities are typical ones introduced into these languages. Compared with backtracking and coroutine facilities, multi-process description facilities are considered to be a better alternative for writing well-structured programs. This paper describes concurrent LISP, a new concurrent programming language based on LISP. Concurrent LISP is designed to provide simple and flexible facilities for multi-process description without changing the original language features of LISP. This paper also describes the concurrent LISP interpreter which has been implemented on a FACOM M-200 at the Data Processing Center of Kyoto University. 19 references.

  15. Reference Capabilities for Concurrency Control

    OpenAIRE

    Castegren, Elias; Wrigstad, Tobias

    2016-01-01

    The proliferation of shared mutable state in object-oriented programming complicates software development as two seemingly unrelated operations may interact via an alias and produce unexpected results. In concurrent programming this manifests itself as data-races. Concurrent object-oriented programming further suffers from the fact that code that warrants synchronisation cannot easily be distinguished from code that does not. The burden is placed solely on the programmer to reason ab...

  16. Concurrent engineering: effective deployment strategies

    Directory of Open Access Journals (Sweden)

    Unny Menon

    1996-12-01

    Full Text Available This paper provides a comprehensive insight into current trends and developments in Concurrent Engineering for integrated development of products and processes with the goal of completing the entire cycle in a shorter time, at lower overall cost and with fewer engineering design changes after product release. The evolution and definition of Concurrent Engineering are addressed first, followed by a concise review of the following elements of the concurrent engineering approach to product development: Concept Development: The Front-End Process, identifying Customer Needs and Quality Function Deployment, Establishing Product Specifications, Concept Selection, Product Architecture, Design for Manufacturing, Effective Rapid Prototyping, and The Economics of Product Development. An outline of a computer-based tutorial developed by the authors and other graduate students funded by NASA ( accessible via the world-wide-web . is provided in this paper. A brief discussion of teamwork for successful concurrent engineering is included, t'ase histories of concurrent engineering implementation at North American and European companies are outlined with references to textbooks authored by Professor Menon and other writers. A comprehensive bibliography on concurrent engineering is included in the paper.

  17. Immunization Schedules for Adults

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Adults (19 Years of Age and ... diseases that can be prevented by vaccines . 2018 Immunization Schedule Recommended Vaccinations for Adults by Age and ...

  18. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Recommendations Why Immunize? Vaccines: The Basics Instant Childhood Immunization Schedule Recommend on Facebook Tweet Share Compartir Get ... date. See Disclaimer for additional details. Based on Immunization Schedule for Children 0 through 6 Years of ...

  19. Web Publishing Schedule

    Science.gov (United States)

    Section 207(f)(2) of the E-Gov Act requires federal agencies to develop an inventory and establish a schedule of information to be published on their Web sites, make those schedules available for public comment. To post the schedules on the web site.

  20. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, H.; Skutella, M.; Woeginger, Gerhard

    2003-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  1. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Skutella, M.; Woeginger, G.J.; Paterson, M.

    2000-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  2. Outage scheduling and implementation

    International Nuclear Information System (INIS)

    Allison, J.E.; Segall, P.; Smith, R.R.

    1986-01-01

    Successful preparation and implementation of an outage schedule and completion of scheduled and emergent work within an identified critical path time frame is a result of careful coordination by Operations, Work Control, Maintenance, Engineering, Planning and Administration and others. At the Fast Flux Test Facility (FFTF) careful planning has been responsible for meeting all scheduled outage critical paths

  3. Scheduling with Time Lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong)

    2010-01-01

    textabstractScheduling is essential when activities need to be allocated to scarce resources over time. Motivated by the problem of scheduling barges along container terminals in the Port of Rotterdam, this thesis designs and analyzes algorithms for various on-line and off-line scheduling problems

  4. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1994-02-01

    This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site

  5. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1994-02-01

    This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring the onsite drinking water falls outside the scope of the SESP. The Hanford Environmental Health Foundation is responsible for monitoring the nonradiological parameters as defined in the National Drinking Water Standards while PNL conducts the radiological monitoring of the onsite drinking water. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize the expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control and reporting. The ground-water sampling schedule identifies ground-water sampling events used by PNL for environmental surveillance of the Hanford Site.

  6. Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns

    Science.gov (United States)

    Majerowicz, Walt; Shinn, Stephen A.

    2016-01-01

    This paper examines the relationship between schedule delays and cost overruns on complex projects. It is generally accepted by many project practitioners that cost overruns are directly related to schedule delays. But what does "directly related to" actually mean? Some reasons or root causes for schedule delays and associated cost overruns are obvious, if only in hindsight. For example, unrealistic estimates, supply chain difficulties, insufficient schedule margin, technical problems, scope changes, or the occurrence of risk events can negatively impact schedule performance. Other factors driving schedule delays and cost overruns may be less obvious and more difficult to quantify. Examples of these less obvious factors include project complexity, flawed estimating assumptions, over-optimism, political factors, "black swan" events, or even poor leadership and communication. Indeed, is it even possible the schedule itself could be a source of delay and subsequent cost overrun? Through literature review, surveys of project practitioners, and the authors' own experience on NASA programs and projects, the authors will categorize and examine the various factors affecting the relationship between project schedule delays and cost growth. The authors will also propose some ideas for organizations to consider to help create an awareness of the factors which could cause or influence schedule delays and associated cost growth on complex projects.

  7. NASA scheduling technologies

    Science.gov (United States)

    Adair, Jerry R.

    1994-01-01

    This paper is a consolidated report on ten major planning and scheduling systems that have been developed by the National Aeronautics and Space Administration (NASA). A description of each system, its components, and how it could be potentially used in private industry is provided in this paper. The planning and scheduling technology represented by the systems ranges from activity based scheduling employing artificial intelligence (AI) techniques to constraint based, iterative repair scheduling. The space related application domains in which the systems have been deployed vary from Space Shuttle monitoring during launch countdown to long term Hubble Space Telescope (HST) scheduling. This paper also describes any correlation that may exist between the work done on different planning and scheduling systems. Finally, this paper documents the lessons learned from the work and research performed in planning and scheduling technology and describes the areas where future work will be conducted.

  8. Modal abstractions of concurrent behavior

    DEFF Research Database (Denmark)

    Nielson, Flemming; Nanz, Sebastian; Nielson, Hanne Riis

    2011-01-01

    We present an effective algorithm for the automatic construction of finite modal transition systems as abstractions of potentially infinite concurrent processes. Modal transition systems are recognized as valuable abstractions for model checking because they allow for the validation as well...... as refutation of safety and liveness properties. However, the algorithmic construction of finite abstractions from potentially infinite concurrent processes is a missing link that prevents their more widespread usage for model checking of concurrent systems. Our algorithm is a worklist algorithm using concepts...... from abstract interpretation and operating upon mappings from sets to intervals in order to express simultaneous over- and underapprox-imations of the multisets of process actions available in a particular state. We obtain a finite abstraction that is 3-valued in both states and transitions...

  9. Managing Complexity of Control Software through Concurrency

    NARCIS (Netherlands)

    Hilderink, G.H.

    2005-01-01

    In this thesis, we are concerned with the development of concurrent software for embedded systems. The emphasis is on the development of control software. Embedded systems are concurrent systems whereby hardware and software communicate with the concurrent world. Concurrency is essential, which

  10. Concurrency & Asynchrony in Declarative Workflows

    DEFF Research Database (Denmark)

    Debois, Søren; Hildebrandt, Thomas; Slaats, Tijs

    2015-01-01

    of concurrency in DCR Graphs admits asynchronous execution of declarative workflows both conceptually and by reporting on a prototype implementation of a distributed declarative workflow engine. Both the theoretical development and the implementation is supported by an extended example; moreover, the theoretical....... In this paper, we pro- pose a notion of concurrency for declarative process models, formulated in the context of Dynamic Condition Response (DCR) graphs, and exploiting the so-called “true concurrency” semantics of Labelled Asynchronous Transition Systems. We demonstrate how this semantic underpinning...

  11. Cbs (Contrastrain Based Schedulling Adalah Faktor Penentu Keberhasilan Perusahanan Printing

    Directory of Open Access Journals (Sweden)

    Hendra Achmadi

    2010-06-01

    Full Text Available In a highly competitive industry faces today ranging from small or home-based printing to using machine that can print offset a hundred thousand copies per hour. But, the increasing competition resulted in requiring a faster production time from order entry, print proff until the production process to delivery to customers. Often times in case of orders which will result in the concurrent PPIC will experience vertigo in the setting of production schedules which have concurrent delivery time. Often will end up with no receipt of orders due to difficulties in the production schedule, especially if the orders require the same offset machine and cylinder wear the same length, while the number of cylinders is limited. Therefore, the printing company should be able to do so in the conduct of a penetration timing of production can easily be simulated and implemented on the ground. CBS (Base Constraint scheduling is a technique to do the scheduling of production so that production can be carried out smoothly and quickly that fulfill the promise made to customers. In scheduling, there are several techniques that can be used are: FCFS (First Came First Serve, EDD (Earliest Date, and LCLS (Last Came Last Serve. So, it is required to be able to do way better scheduling to get results quickly in this fast changing schedules.

  12. Real-Time Concurrent Processes

    National Research Council Canada - National Science Library

    Vestal, Steve

    2000-01-01

    ... to model some implementation details. Classical preemptive scheduling models do not deal with complex task sequencing and interaction, which limits their usefulness for describing distributed systems and implementation details...

  13. Evaluation of Absolute and Relative Reinforcer Value Using Progressive-Ratio Schedules

    Science.gov (United States)

    Francisco, Monica T.; Borrero, John C.; Sy, Jolene R.

    2008-01-01

    We evaluated behavior exhibited by individuals with developmental disabilities using progressive-ratio (PR) schedules. High- and low-preference stimuli were determined based on the results of a paired-stimulus preference assessment and were evaluated in subsequent reinforcer and PR assessments using concurrent and single schedules of presentation.…

  14. Scheduling for decommissioning projects

    International Nuclear Information System (INIS)

    Podmajersky, O.E.

    1987-01-01

    This paper describes the Project Scheduling system being employed by the Decommissioning Operations Contractor at the Shippingport Station Decommissioning Project (SSDP). Results from the planning system show that the project continues to achieve its cost and schedule goals. An integrated cost and schedule control system (C/SCS) which uses the concept of earned value for measurement of performance was instituted in accordance with DOE orders. The schedule and cost variances generated by the C/SCS system are used to confirm management's assessment of project status. This paper describes the types of schedules and tools used on the SSDP project to plan and monitor the work, and identifies factors that are unique to a decommissioning project that make scheduling critical to the achievement of the project's goals. 1 fig

  15. Program reference schedule baseline

    International Nuclear Information System (INIS)

    1986-07-01

    This Program Reference Schedule Baseline (PRSB) provides the baseline Program-level milestones and associated schedules for the Civilian Radioactive Waste Management Program. It integrates all Program-level schedule-related activities. This schedule baseline will be used by the Director, Office of Civilian Radioactive Waste Management (OCRWM), and his staff to monitor compliance with Program objectives. Chapter 1 includes brief discussions concerning the relationship of the PRSB to the Program Reference Cost Baseline (PRCB), the Mission Plan, the Project Decision Schedule, the Total System Life Cycle Cost report, the Program Management Information System report, the Program Milestone Review, annual budget preparation, and system element plans. Chapter 2 includes the identification of all Level 0, or Program-level, milestones, while Chapter 3 presents and discusses the critical path schedules that correspond to those Level 0 milestones

  16. A Model for Concurrent Objects

    DEFF Research Database (Denmark)

    Sørensen, Morten U.

    1996-01-01

    We present a model for concurrent objects where obejcts interact by taking part in common events that are closely matched to form call-response pairs, resulting in resulting in rendez-vous like communications. Objects are built from primitive objects by parallel composition, encapsulation...

  17. Forward progress on GPU concurrency

    NARCIS (Netherlands)

    Donaldson, A.F.; Ketema, J.; Sorensen, T.; Wickerson, J.

    2017-01-01

    The tutorial at CONCUR will provide a practical overview of work undertaken over the last six years in the Multicore Programming Group at Imperial College London, and with collaborators internationally, related to understanding and reasoning about concurrency in software designed for acceleration on

  18. True Concurrency can be Traced

    DEFF Research Database (Denmark)

    Engberg, Uffe Henrik

    1990-01-01

    In this paper sets of labelled partial orders are employed as fundamental mathematical entities for modelling nondeterministic and concurrent processes thereby obtaining so-called noninterleaving semantics. Based on closures of sets of labelled partial orders, a simple algebraic language with ref...

  19. Relationships between models of concurrency

    DEFF Research Database (Denmark)

    Nielsen, Mogens; Sassone, Vladimiro; Winskel, Glynn

    1994-01-01

    Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics....

  20. Approximating Preemptive Stochastic Scheduling

    OpenAIRE

    Megow Nicole; Vredeveld Tjark

    2009-01-01

    We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online scheduling. The performance guarantee we give matches the best result known for the corresponding determinist...

  1. Revisiting Symbiotic Job Scheduling

    OpenAIRE

    Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

    2015-01-01

    International audience; —Symbiotic job scheduling exploits the fact that in a system with shared resources, the performance of jobs is impacted by the behavior of other co-running jobs. By coscheduling combinations of jobs that have low interference, the performance of a system can be increased. In this paper, we investigate the impact of using symbiotic job scheduling for increasing throughput. We find that even for a theoretically optimal scheduler, this impact is very low, despite the subs...

  2. A general model of concurrency and its implementation as many-core dynamic RISC processors

    NARCIS (Netherlands)

    Bernard, T.; Bousias, K.; Guang, L.; Jesshope, C.R.; Lankamp, M.; van Tol, M.W.; Zhang, L.

    2008-01-01

    This paper presents a concurrent execution model and its micro-architecture based on in-order RISC processors, which schedules instructions from large pools of contextualised threads. The model admits a strategy for programming chip multiprocessors using parallelising compilers based on existing

  3. Medium Access Control for Opportunistic Concurrent Transmissions under Shadowing Channels

    Directory of Open Access Journals (Sweden)

    Seung Min Hur

    2009-06-01

    Full Text Available We study the problem of how to alleviate the exposed terminal effect in multihop wireless networks in the presence of log-normal shadowing channels. Assuming node location information, we propose an extension of the IEEE 802.11 MAC protocol that schedules concurrent transmissions in the presence of log-normal shadowing, thus mitigating the exposed terminal problem and improving network throughput and delay performance. We observe considerable improvements in throughput and delay achieved over the IEEE 802.11 MAC under various network topologies and channel conditions in ns-2 simulations, which justify the importance of considering channel randomness in MAC protocol design for multihop wireless networks.

  4. Scheduling of resource-constrained projects

    CERN Document Server

    Klein, Robert

    2000-01-01

    Project management has become a widespread instrument enabling organizations to efficiently master the challenges of steadily shortening product life cycles, global markets and decreasing profit margins. With projects increasing in size and complexity, their planning and control represents one of the most crucial management tasks. This is especially true for scheduling, which is concerned with establishing execution dates for the sub-activities to be performed in order to complete the project. The ability to manage projects where resources must be allocated between concurrent projects or even sub-activities of a single project requires the use of commercial project management software packages. However, the results yielded by the solution procedures included are often rather unsatisfactory. Scheduling of Resource-Constrained Projects develops more efficient procedures, which can easily be integrated into software packages by incorporated programming languages, and thus should be of great interest for practiti...

  5. Alternative Work Schedules: Definitions

    Science.gov (United States)

    Journal of the College and University Personnel Association, 1977

    1977-01-01

    The term "alternative work schedules" encompasses any variation of the requirement that all permanent employees in an organization or one shift of employees adhere to the same five-day, seven-to-eight-hour schedule. This article defines staggered hours, flexible working hours (flexitour and gliding time), compressed work week, the task system, and…

  6. Range Scheduling Aid (RSA)

    Science.gov (United States)

    Logan, J. R.; Pulvermacher, M. K.

    1991-01-01

    Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

  7. The triangle scheduling problem

    NARCIS (Netherlands)

    Dürr, Christoph; Hanzálek, Zdeněk; Konrad, Christian; Seddik, Yasmina; Sitters, R.A.; Vásquez, Óscar C.; Woeginger, Gerhard

    2017-01-01

    This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to

  8. Data refinement for true concurrency

    Directory of Open Access Journals (Sweden)

    Brijesh Dongol

    2013-05-01

    Full Text Available The majority of modern systems exhibit sophisticated concurrent behaviour, where several system components modify and observe the system state with fine-grained atomicity. Many systems (e.g., multi-core processors, real-time controllers also exhibit truly concurrent behaviour, where multiple events can occur simultaneously. This paper presents data refinement defined in terms of an interval-based framework, which includes high-level operators that capture non-deterministic expression evaluation. By modifying the type of an interval, our theory may be specialised to cover data refinement of both discrete and continuous systems. We present an interval-based encoding of forward simulation, then prove that our forward simulation rule is sound with respect to our data refinement definition. A number of rules for decomposing forward simulation proofs over both sequential and parallel composition are developed.

  9. Adding Concurrency to Smart Contracts

    OpenAIRE

    Dickerson, Thomas; Gazzillo, Paul; Herlihy, Maurice; Koskinen, Eric

    2017-01-01

    Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times, always without real concurrency. First, all smart contracts are serially executed by miners before appending them to the blockchain. Later, those contracts are serially re-executed by validators to verify that the smart contracts were executed correctly by miners. Serial execution limits system throughput and fails ...

  10. Evaluation of concurrent peak responses

    International Nuclear Information System (INIS)

    Wang, P.C.; Curreri, J.; Reich, M.

    1983-01-01

    This report deals with the problem of combining two or more concurrent responses which are induced by dynamic loads acting on nuclear power plant structures. Specifically, the acceptability of using the square root of the sum of the squares (SRSS) value of peak values as the combined response is investigated. Emphasis is placed on the establishment of a simplified criterion that is convenient and relatively easy to use by design engineers

  11. PyCSP - controlled concurrency

    DEFF Research Database (Denmark)

    Vinter, Brian; Friborg, Rune Møllegaard; Bjørndalen, John Markus

    2010-01-01

    Producing readable and correct programs while at the same time taking advantage of multi-core architectures is a challenge. PyCSP is an implementation of Communicating Sequential Processes algebra (CSP) for the Python programming language, that take advantage of CSP's formal and verifiable approach...... to controlling concurrency and the readability of Python source code. We describe PyCSP, demonstrate it through examples and demonstrate how PyCSP compares to Pthreads in a master-worker benchmark....

  12. PyCSP - controlled concurrency

    DEFF Research Database (Denmark)

    Friborg, Rune Møllegaard; Vinter, Brian; Bjørndalen, John Markus

    Producing readable and correct programs while at the same time taking advantage of multi-core architectures is a challenge. PyCSP is an implementation of Communicating Sequential Processes algebra (CSP) for the Python programming language, taking advantage of CSP’s formal and verifiable approach...... to controlling concurrency and the readability of Python source code. We describe PyCSP, demonstrate it through examples and demonstrate how PyCSP compares to Pthreads using a benchmark....

  13. Falling chains

    OpenAIRE

    Wong, Chun Wa; Yasui, Kosuke

    2005-01-01

    The one-dimensional fall of a folded chain with one end suspended from a rigid support and a chain falling from a resting heap on a table is studied. Because their Lagrangians contain no explicit time dependence, the falling chains are conservative systems. Their equations of motion are shown to contain a term that enforces energy conservation when masses are transferred between subchains. We show that Cayley's 1857 energy nonconserving solution for a chain falling from a resting heap is inco...

  14. Concurrent chemoradiation for vaginal cancer.

    Directory of Open Access Journals (Sweden)

    David T Miyamoto

    Full Text Available BACKGROUND: It is not known whether the addition of chemotherapy to radiation therapy improves outcomes in primary vaginal cancer. Here, we review clinical outcomes in patients with primary vaginal cancer treated with radiation therapy (RT or concurrent chemoradiation therapy (CRT. METHODS: Seventy-one patients with primary vaginal cancer treated with definitive RT with or without concurrent chemotherapy at a single institution were identified and their records reviewed. A total of 51 patients were treated with RT alone; 20 patients were treated with CRT. Recurrences were analyzed. Overall survival (OS and disease-free survival (DFS rates were estimated using the Kaplan-Meier method. Cox regression analysis was performed. RESULTS: The median age at diagnosis was 61 years (range, 18-92 years and the median follow-up time among survivors was 3.0 years. Kaplan-Meier estimates for OS and DFS differed significantly between the RT and CRT groups (3-yr OS = 56% vs. 79%, log-rank p = 0.037; 3-yr DFS = 43% vs. 73%, log-rank p = 0.011. Twenty-three patients (45% in the RT group had a relapse at any site compared to 3 (15% in the CRT group (p = 0.027. With regard to the sites of first relapse, 10 patients (14% had local only, 4 (6% had local and regional, 9 (13% had regional only, 1 (1% had regional and distant, and 2 (3% had distant only relapse. On univariate analysis, the use of concurrent chemotherapy, FIGO stage, tumor size, and date of diagnosis were significant predictors of DFS. On multivariate analysis, the use of concurrent chemotherapy remained a significant predictor of DFS (hazard ratio 0.31 (95% CI, 0.10-0.97; p = 0.04. CONCLUSIONS: Vaginal cancer results in poor outcomes. Adequate radiation dose is essential to ensure curative management. Concurrent chemotherapy should be considered for vaginal cancer patients.

  15. Concurrence classes for general pure multipartite states

    International Nuclear Information System (INIS)

    Heydari, Hoshang

    2005-01-01

    We propose concurrence classes for general pure multipartite states based on an orthogonal complement of a positive operator-valued measure on quantum phase. In particular, we construct W m class, GHZ m , and GHZ m-1 class concurrences for general pure m-partite states. We give explicit expressions for W 3 and GHZ 3 class concurrences for general pure three-partite states and for W 4 , GHZ 4 and GHZ 3 class concurrences for general pure four-partite states

  16. NASA Schedule Management Handbook

    Science.gov (United States)

    2011-01-01

    The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

  17. Simple concurrent garbage collection almost without synchronization

    NARCIS (Netherlands)

    Hesselink, Wim H.; Lali, M.I.

    We present two simple mark and sweep algorithms, A and B, for concurrent garbage collection by a single collector running concurrently with a number of mutators that concurrently modify shared data. Both algorithms are based on the ideas of Ben-Ari's classical algorithm for on-the-fly garbage

  18. Barista: A Framework for Concurrent Speech Processing by USC-SAIL.

    Science.gov (United States)

    Can, Doğan; Gibson, James; Vaz, Colin; Georgiou, Panayiotis G; Narayanan, Shrikanth S

    2014-05-01

    We present Barista, an open-source framework for concurrent speech processing based on the Kaldi speech recognition toolkit and the libcppa actor library. With Barista, we aim to provide an easy-to-use, extensible framework for constructing highly customizable concurrent (and/or distributed) networks for a variety of speech processing tasks. Each Barista network specifies a flow of data between simple actors, concurrent entities communicating by message passing, modeled after Kaldi tools. Leveraging the fast and reliable concurrency and distribution mechanisms provided by libcppa, Barista lets demanding speech processing tasks, such as real-time speech recognizers and complex training workflows, to be scheduled and executed on parallel (and/or distributed) hardware. Barista is released under the Apache License v2.0.

  19. Physician Fee Schedule Search

    Data.gov (United States)

    U.S. Department of Health & Human Services — This website is designed to provide information on services covered by the Medicare Physician Fee Schedule (MPFS). It provides more than 10,000 physician services,...

  20. Clinical Laboratory Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Outpatient clinical laboratory services are paid based on a fee schedule in accordance with Section 1833(h) of the Social Security Act. The clinical laboratory fee...

  1. CERN confirms LHC schedule

    CERN Document Server

    2003-01-01

    The CERN Council held its 125th session on 20 June. Highlights of the meeting included confirmation that the LHC is on schedule for a 2007 start-up, and the announcement of a new organizational structure in 2004.

  2. DMEPOS Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The list contains the fee schedule amounts, floors, and ceilings for all procedure codes and payment category, jurisdication, and short description assigned to each...

  3. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    overrun both their budget and time. To improve the quality of initial project plans, we show in this paper the importance of (1) reflecting features’ priorities/risk in task schedules and (2) considering uncertainties related to human factors in plan schedules. To make simulation tasks reflect features......’ priority as well as multimodal team allocation, enhanced project schedules (EPS), where remedial actions scenarios (RAS) are added, were introduced. They reflect potential schedule modifications in case of uncertainties and promote a dynamic sequencing of involved tasks rather than the static conventional...... this document as an instruction set. The electronic file of your paper will be formatted further at Journal of Software. Define all symbols used in the abstract. Do not cite references in the abstract. Do not delete the blank line immediately above the abstract; it sets the footnote at the bottom of this column....

  4. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

    Sørensen, M. D.; Clausen, Jens

    2002-01-01

    scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the staff scheduling is planned decentralized for each zone. The advantage of this approach is that the staff...... work in a smaller area of the terminal and thus spends less time walking between stands. When planning decentralized the allocation of stands to flights influences the staff scheduling since the workload in a zone depends on which flights are allocated to stands in the zone. Hence solving the problem...... depends on the actual stand allocation but also on the number of zones and the layout of these. A mathematical model of the problem is proposed, which integrates the stand allocation and the staff scheduling. A heuristic solution method is developed and applied on a real case from British Airways, London...

  5. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-11-01

    This single page document is the November 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the production reactor.

  6. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-01

    This single page document is the October 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  7. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-15

    This single page document is the October 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  8. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-09-15

    This single page document is the September 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  9. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-15

    This single page document is the December 16, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  10. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-01

    This single page document is the December 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  11. Fee Schedules - General Information

    Data.gov (United States)

    U.S. Department of Health & Human Services — A fee schedule is a complete listing of fees used by Medicare to pay doctors or other providers-suppliers. This comprehensive listing of fee maximums is used to...

  12. CMS Records Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...

  13. Steps in Modular Specifications for Concurrent Modules

    DEFF Research Database (Denmark)

    Da Rocha Pinto, Pedro; Dinsdale-Young, Thomas; Gardner, Philippa

    2015-01-01

    The specification of a concurrent program module is a difficult problem. The specifications must be strong enough to enable reasoning about the intended clients without reference to the underlying module implementation. We survey a range of verification techniques for specifying concurrent module......, in particular highlighting four key concepts: auxiliary state, interference abstraction, resource ownership and atomicity. We show how these concepts combine to provide powerful approaches to specifying concurrent modules.......The specification of a concurrent program module is a difficult problem. The specifications must be strong enough to enable reasoning about the intended clients without reference to the underlying module implementation. We survey a range of verification techniques for specifying concurrent modules...

  14. ATLAS construction schedule

    CERN Multimedia

    Kotamaki, M

    The goal during the last few months has been to freeze and baseline as much as possible the schedules of various ATLAS systems and activities. The main motivations for the re-baselining of the schedules have been the new LHC schedule aiming at first collisions in early 2006 and the encountered delays in civil engineering as well as in the production of some of the detectors. The process was started by first preparing a new installation schedule that takes into account all the new external constraints and the new ATLAS staging scenario. The installation schedule version 3 was approved in the March EB and it provides the Ready For Installation (RFI) milestones for each system, i.e. the date when the system should be available for the start of the installation. TCn is now interacting with the systems aiming at a more realistic and resource loaded version 4 before the end of the year. Using the new RFI milestones as driving dates a new summary schedule has been prepared, or is under preparation, for each system....

  15. Specifying and Verifying Concurrent Programs.

    Science.gov (United States)

    1985-02-01

    for Verification and Specification of Concurrent Systems, held in La - Colle - Sur - Loup , France in October, 1984. Work Supported in part by the National...Proc. ACM Symposium on Princi- 0 ples of Programming Languages, Las Vegas, (January 1980), 251-261. [7] J. V. Guttag and J. J. Horning. An Introduction...names in ’V(S). However, the two formulas behave differently under a renaming mapping p. In particu- lar. p(Vv :A( LA )) equals Vv :p(A(v)), so the

  16. Multiprocessor systems and their concurrency

    Energy Technology Data Exchange (ETDEWEB)

    Starke, P H

    1984-01-01

    A multiprocessor system can be considered as a collection of finite automata which communicate over channels or shared memory units. The behaviour of such a system can be described by a semilanguage. This approach allows to define a numerical measure for the concurrency of multiprocessor systems and of distributed systems. This measure is characterized algebraically and the reconfiguration problem asking for an algorithm to construct an l-processor system which is equivalent to a given n-processor system is solved in the paper. 6 references.

  17. Adjuvant chemotherapy with sequential or concurrent anthracycline and docetaxel: Breast International Group 02-98 randomized trial

    DEFF Research Database (Denmark)

    Francis, P.; Crown, J.; Di, Leo A.

    2008-01-01

    BACKGROUND: Docetaxel is more effective than doxorubicin for patients with advanced breast cancer. The Breast International Group 02-98 randomized trial tested the effect of incorporating docetaxel into anthracycline-based adjuvant chemotherapy and compared sequential vs concurrent administration....... However, important differences may be related to doxorubicin and docetaxel scheduling, with sequential but not concurrent administration, appearing to produce better DFS than anthracycline-based chemotherapy Udgivelsesdato: 2008/1/16...

  18. Integrated network design and scheduling problems :

    Energy Technology Data Exchange (ETDEWEB)

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01

    We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

  19. CellSs: Scheduling Techniques to Better Exploit Memory Hierarchy

    Directory of Open Access Journals (Sweden)

    Pieter Bellens

    2009-01-01

    Full Text Available Cell Superscalar's (CellSs main goal is to provide a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E. that automatically exploits the inherent concurrency of the applications at a task level. The CellSs environment is based on a source-to-source compiler that translates annotated C or Fortran code and a runtime library tailored for the Cell/B.E. that takes care of the concurrent execution of the application. The first efforts for task scheduling in CellSs derived from very simple heuristics. This paper presents new scheduling techniques that have been developed for CellSs for the purpose of improving an application's performance. Additionally, the design of a new scheduling algorithm is detailed and the algorithm evaluated. The CellSs scheduler takes an extension of the memory hierarchy for Cell/B.E. into account, with a cache memory shared between the SPEs. All new scheduling practices have been evaluated showing better behavior of our system.

  20. Concurrency at work with Go

    CERN Document Server

    CERN. Geneva

    2017-01-01

    High Energy and Nuclear Physics (HENP) libraries are now required to be increasingly multi-thread-safe, if not multi-thread-friendly and multi-threaded. This is usually done using the new constructs and library components offered by the C++11 and C++14 standards. These components are however quite low-level (threads, mutexes, locks, ...) and hard to use and compose, or easy to misuse. However, Go -- a somewhat new language -- provides a set of better building blocks for tackling concurrency: goroutines and channels. This language is now used by the cloud industry at large; docker/moby, rkt, Kubernetes, OpenShift, etc... are obvious flagships for Go. It is also used in other interesting places like SpaceX's telemetry monitoring system and in the New York Times', YouTube's or Disney's content delivery infrastructures. In this talk, we will describe the building blocks of Go and see how they are combined to easily create concurrent programs that grow with grace, are fast to compile and deploy, but also easy to...

  1. Patients survey after concurrent chemoradiotherapy

    International Nuclear Information System (INIS)

    Shimane, Toshikazku; Egawa, Syunya; Mori, Tomoaki; Ono, Tomohiro; Monden, Tetsuya; Kobayashi, Sei; Sanbe, Takeyuki; Suzaki, Harumi

    2010-01-01

    Concurrent chemoradiotherapy for cancer of head and neck is becoming more popular as the treatment of choice. It is considered to maintain the quality of life (QOL) of patients better than operative treatments in terms of preserving the functions, organs, and figure, but recently we cannot necessarily say that it maintains the QOL of patients better than operative treatments because its complications after therapy disturb daily life. We report the results of a questionnaire survey about complications after therapy, problems during therapy, improvements, and satisfaction level directed at patients with cancer of the head and neck who received Concurrent chemoradiotherapy for the purpose of ascertaining if patients can actually maintain their QOL after therapy. As a result, the most controversial problem was mouth dryness, but the symptom improved as the follow-up duration got longer. As for the satisfaction level, 'very-satisfied' and 'almost-satisfied' were more than 90%, so we concluded that the QOL of patients is maintained after therapy, while there are still improvements to be made. We also concluded that we should continue to make improvement and try to improve the QOL of patients during and after therapy. (author)

  2. Constraint-based job shop scheduling with ILOG SCHEDULER

    NARCIS (Netherlands)

    Nuijten, W.P.M.; Le Pape, C.

    1998-01-01

    We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and

  3. Planning and scheduling - A schedule's performance

    International Nuclear Information System (INIS)

    Whitman, N.M.

    1993-01-01

    Planning and scheduling is a process whose time has come to PSI Energy. With an awareness of the challenges ahead, individuals must look for ways to enhance the corporate competitiveness. Working toward this goal means that each individual has to dedicate themselves to this more competitive corporate environment. Being competitive may be defined as the ability of each employee to add value to the corporation's economic well being. The timely and successful implementation of projects greatly enhances competitiveness. Those projects that do not do well often suffer from lack of proper execution - not for lack of talent or strategic vision. Projects are consumers of resources such as cash and people. They produce a return when completed and will generate a better return when properly completed utilizing proven project management techniques. Completing projects on time, within budget and meeting customer expectations is the way a corporation builds it's future. This paper offers suggestions on implementing planning and scheduling and provides a review of results in the form of management reports

  4. Constraint-based scheduling

    Science.gov (United States)

    Zweben, Monte

    1993-01-01

    The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

  5. SPANR planning and scheduling

    Science.gov (United States)

    Freund, Richard F.; Braun, Tracy D.; Kussow, Matthew; Godfrey, Michael; Koyama, Terry

    2001-07-01

    SPANR (Schedule, Plan, Assess Networked Resources) is (i) a pre-run, off-line planning and (ii) a runtime, just-in-time scheduling mechanism. It is designed to support primarily commercial applications in that it optimizes throughput rather than individual jobs (unless they have highest priority). Thus it is a tool for a commercial production manager to maximize total work. First the SPANR Planner is presented showing the ability to do predictive 'what-if' planning. It can answer such questions as, (i) what is the overall effect of acquiring new hardware or (ii) what would be the effect of a different scheduler. The ability of the SPANR Planner to formulate in advance tree-trimming strategies is useful in several commercial applications, such as electronic design or pharmaceutical simulations. The SPANR Planner is demonstrated using a variety of benchmarks. The SPANR Runtime Scheduler (RS) is briefly presented. The SPANR RS can provide benefit for several commercial applications, such as airframe design and financial applications. Finally a design is shown whereby SPANR can provide scheduling advice to most resource management systems.

  6. Supply chain strategies, issues and models

    CERN Document Server

    Ramanathan, Ramakrishnan

    2014-01-01

    In the 21st century, supply chain operations and relationships among supply chain partners have become highly challenging, necessitating new approaches, e.g., the development of new models. Supply Chain Strategies, Issues and Models discusses supply chain issues and models with examples from actual industrial cases. Expert authors with a wide spectrum of knowledge working in various areas of supply chain management from various geographical locations offer refreshing, novel and insightful ideas and address possible solutions using established theories and models. Supply Chain Strategies, Issues and Models features studies that have used mathematical modeling, statistical analyses and also descriptive qualitative studies. The chapters cover many relevant themes related to supply chains and logistics including supply chain complexity, information sharing, quality (six sigma), electronic Kanbans, inventory models, scheduling, purchasing and contracts. To facilitate easy reading, the chapters that deal with suppl...

  7. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    2015-01-01

    of car drivers' route and mode choice under uncertain travel times. Our analysis exposes some important methodological issues related to complex non-linear scheduling models: One issue is identifying the point in time where the marginal utility of being at the destination becomes larger than the marginal......Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily...... utility of being at the origin. Another issue is that models with the exponential marginal utility formulation suffer from empirical identification problems. Though our results are not decisive, they partly support the constant-affine specification, in which the value of travel time variability...

  8. Concurrent systems and time synchronization

    Science.gov (United States)

    Burgin, Mark; Grathoff, Annette

    2018-05-01

    In the majority of scientific fields, system dynamics is described assuming existence of unique time for the whole system. However, it is established theoretically, for example, in relativity theory or in the system theory of time, and validated experimentally that there are different times and time scales in a variety of real systems - physical, chemical, biological, social, etc. In spite of this, there are no wide-ranging scientific approaches to exploration of such systems. Therefore, the goal of this paper is to study systems with this property. We call them concurrent systems because processes in them can go, events can happen and actions can be performed in different time scales. The problem of time synchronization is specifically explored.

  9. Post LS1 schedule

    CERN Document Server

    Lamont, M

    2014-01-01

    The scheduling limits for a typical long year taking into account technical stops, machine development, spe- cial physics runs are presented. An attempt is then made to outline a ten year post LS1 schedule taking into account the disparate requirements outlined in the previous talks in this session. The demands on the planned long shutdowns and the impact of these demands on their proposed length will be discussed. The option of using ion running as a pre-shutdown cool-down period will be addressed.

  10. Nutritional strategies to support concurrent training.

    Science.gov (United States)

    Perez-Schindler, Joaquin; Hamilton, D Lee; Moore, Daniel R; Baar, Keith; Philp, Andrew

    2015-01-01

    Concurrent training (the combination of endurance exercise to resistance training) is a common practice for athletes looking to maximise strength and endurance. Over 20 years ago, it was first observed that performing endurance exercise after resistance exercise could have detrimental effects on strength gains. At the cellular level, specific protein candidates have been suggested to mediate this training interference; however, at present, the physiological reason(s) behind the concurrent training effect remain largely unknown. Even less is known regarding the optimal nutritional strategies to support concurrent training and whether unique nutritional approaches are needed to support endurance and resistance exercise during concurrent training approaches. In this review, we will discuss the importance of protein supplementation for both endurance and resistance training adaptation and highlight additional nutritional strategies that may support concurrent training. Finally, we will attempt to synergise current understanding of the interaction between physiological responses and nutritional approaches into practical recommendations for concurrent training.

  11. Automated Scheduling Via Artificial Intelligence

    Science.gov (United States)

    Biefeld, Eric W.; Cooper, Lynne P.

    1991-01-01

    Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.

  12. Rain VM: Portable Concurrency through Managing Code

    OpenAIRE

    Brown, Neil C.C.

    2006-01-01

    A long-running recent trend in computer programming is the growth in popularity of virtual machines. However, few have included good support for concurrency - a natural mechanism in the Rain programming language. This paper details the design and implementation of a secure virtual machine with support for concurrency, which enables portability of concurrent programs. Possible implementation ideas of many-to-many threading models for the virtual machine kernel are discussed, and initial benchm...

  13. Concurrence of three Jaynes-Cummings systems

    Science.gov (United States)

    Qiang, Wen-Chao; Sun, Guo-Hua; Dong, Qian; Camacho-Nieto, Oscar; Dong, Shi-Hai

    2018-04-01

    We apply genuine multipartite concurrence to investigate entanglement properties of three Jaynes-Cummings systems. Three atoms are initially put in GHZ-like state and locally interact with three independent cavities, respectively. We present analytical concurrence expressions for various subsystems including three-atom, three-cavity and some atom-cavity mixed systems. We also examine the global system and illustrate the evolution of its concurrence. Except for the sudden death of entanglement, we find for some initial entanglement parameter θ , the concurrence of the global system may maintain unchanged in some time intervals.

  14. How does concurrent sourcing affect performance?

    DEFF Research Database (Denmark)

    Mols, Niels Peter

    2010-01-01

    be modelled. The propositions and discussion offer researchers a starting-point for further research. Practical implications – The propositions that are developed suggest that managers should consider using concurrent sourcing when they face problems caused by volume uncertainty, technological uncertainty....../methodology/approach – Based on transaction cost, agency, neoclassical economic, knowledge-based, and resource-based theory, it is proposed to show how concurrent sourcing affects performance. Findings – The paper argues that concurrent sourcing improves performance when firms face a combination of volume uncertainty...... how concurrent sourcing affects performance of the market and the hierarchy....

  15. A Reference Framework for Concurrent Engineering

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Considering the diversity of methods and tools offered to concurrent engineering, the aspects playing important roles in the concurrent engineering c ontext have been pinpointed as being four core elements which are Activity, Meth od, Object and Information. Based on these four elements, a reference framework called AMOI is proposed to be the guideline for the systematic concurrent produc t design. Using the AMOI reference framework, concurrent product development sys tem can be structured into four function models (including the activity model, m ethod model, object model and information model) which are interconnected with e ach other.

  16. Supply Chain Sourcing Game: A Negotiation Exercise

    Science.gov (United States)

    Gumus, Mehmet; Love, Ernie C.

    2013-01-01

    This article introduces an exercise that simulates the negotiation process in a dynamic supply chain. The retailer and wholesaler roles are assigned to student groups who negotiate supply contracts in a number of rounds during a class period. Each group makes pricing, inventory, and ordering decision concurrently, and competes with others to…

  17. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

    Yzquierdo, Antonio Pérez-Calero; Hernández, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

  18. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard F.; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms,

  19. Hybrid job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1995-01-01

    We consider the problem of scheduling jobs in a hybrid job shop. We use the term 'hybrid' to indicate that we consider a lot of extensions of the classic job shop, such as transportation times, multiple resources, and setup times. The Shifting Bottleneck procedure can be generalized to deal with

  20. Practical job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1998-01-01

    The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop

  1. "Creative" Work Schedules.

    Science.gov (United States)

    Blai, Boris

    Many creative or flexible work scheduling options are becoming available to the many working parents, students, handicapped persons, elderly individuals, and others who are either unable or unwilling to work a customary 40-hour work week. These options may be broadly categorized as either restructured or reduced work time options. The three main…

  2. Plant management in concurrent engineering

    International Nuclear Information System (INIS)

    Haubensack, D.; Malvache, P.; Valleix, P.

    1997-01-01

    The ImagIn project consist in a method and a set of computer tools apt to bring perceptible and assessable improvements in the operational safety of a nuclear plant. Its aim is to design an information system that would maintain a highly detailed computerised representation of a nuclear plant, in its initial state and throughout its in-service life. It is not a tool to drive or help driving the nuclear plant, but a tool that manages concurrent operations that modify the plant configuration in a very general way (maintenance for example). The configuration of the plant, as well as rules and constraints about it, are described in a object-oriented, knowledge database, which is built using a generic ImagIn meta-model based on the semantical network theory. An inference engine works on this database and is connected to reality through interfaces to operators and captors on the installation; it verifies constantly in real-time the consistency of the database according to its inner rules, and reports eventual problems to concerned operators. A special effort is made on interfaces to provide natural and intuitive tools (using virtual reality, natural language, voice recognition and synthesis). A laboratory application on a fictive but realistic installation already exist and is used to simulate various test and scenari. A real application is being constructed on SILOE, an experimental reactor of the CEA. (authors)

  3. Multiparty Compatibility for Concurrent Objects

    Directory of Open Access Journals (Sweden)

    Roly Perera

    2016-06-01

    Full Text Available Objects and actors are communicating state machines, offering and consuming different services at different points in their lifecycle. Two complementary challenges arise when programming such systems. When objects interact, their state machines must be "compatible", so that services are requested only when they are available. Dually, when objects refine other objects, their state machines must be "compliant", so that services are honoured whenever they are promised. In this paper we show how the idea of multiparty compatibility from the session types literature can be applied to both of these problems. We present an untyped language in which concurrent objects are checked automatically for compatibility and compliance. For simple objects, checking can be exhaustive and has the feel of a type system. More complex objects can be partially validated via test cases, leading to a methodology closer to continuous testing. Our proof-of-concept implementation is limited in some important respects, but demonstrates the potential value of the approach and the relationship to existing software development practices.

  4. Verified compilation of Concurrent Managed Languages

    Science.gov (United States)

    2017-11-01

    Communications Division Information Directorate This report is published in the interest of scientific and technical information exchange, and its...271, 2007. [85] Viktor Vafeiadis. Modular fine-grained concurrency verification. Technical Report UCAM-CL-TR- 726, University of Cambridge, Computer...VERIFIED COMPILATION OF CONCURRENT MANAGED LANGUAGES PURDUE UNIVERSITY NOVEMBER 2017 FINAL TECHNICAL REPORT APPROVED FOR PUBLIC RELEASE

  5. Ecological association between HIV and concurrency point ...

    African Journals Online (AJOL)

    Ecological association between HIV and concurrency point-prevalence in South Africa's ethnic groups. Chris Kenyon. Abstract. HIV prevalence between different ethnic groups within South Africa exhibits considerable variation. Numerous authors believe that elevated sexual partner concurrency rates are important in the ...

  6. A Temporal Concurrent Constraint Programming Calculus

    DEFF Research Database (Denmark)

    Palamidessi, Catuscia; Valencia Posso, Frank Darwin

    2001-01-01

    The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus...

  7. New concurrent iterative methods with monotonic convergence

    Energy Technology Data Exchange (ETDEWEB)

    Yao, Qingchuan [Michigan State Univ., East Lansing, MI (United States)

    1996-12-31

    This paper proposes the new concurrent iterative methods without using any derivatives for finding all zeros of polynomials simultaneously. The new methods are of monotonic convergence for both simple and multiple real-zeros of polynomials and are quadratically convergent. The corresponding accelerated concurrent iterative methods are obtained too. The new methods are good candidates for the application in solving symmetric eigenproblems.

  8. Cooperated Bayesian algorithm for distributed scheduling problem

    Institute of Scientific and Technical Information of China (English)

    QIANG Lei; XIAO Tian-yuan

    2006-01-01

    This paper presents a new distributed Bayesian optimization algorithm (BOA) to overcome the efficiency problem when solving NP scheduling problems.The proposed approach integrates BOA into the co-evolutionary schema,which builds up a concurrent computing environment.A new search strategy is also introduced for local optimization process.It integrates the reinforcement learning(RL) mechanism into the BOA search processes,and then uses the mixed probability information from BOA (post-probability) and RL (pre-probability) to enhance the cooperation between different local controllers,which improves the optimization ability of the algorithm.The experiment shows that the new algorithm does better in both optimization (2.2%) and convergence (11.7%),compared with classic BOA.

  9. Medium Access Control for Opportunistic Concurrent Transmissions under Shadowing Channels.

    Science.gov (United States)

    Son, In Keun; Mao, Shiwen; Hur, Seung Min

    2009-01-01

    We study the problem of how to alleviate the exposed terminal effect in multi-hop wireless networks in the presence of log-normal shadowing channels. Assuming node location information, we propose an extension of the IEEE 802.11 MAC protocol that sched-ules concurrent transmissions in the presence of log-normal shadowing, thus mitigating the exposed terminal problem and improving network throughput and delay performance. We observe considerable improvements in throughput and delay achieved over the IEEE 802.11 MAC under various network topologies and channel conditions in ns-2 simulations, which justify the importance of considering channel randomness in MAC protocol design for multi-hop wireless networks.

  10. Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

    Science.gov (United States)

    Zoch, David R.

    1991-01-01

    Scheduling techniques in the ROSE are presented in the form of the viewgraphs. The following subject areas are covered: agenda; ROSE summary and history; NCC-ROSE task goals; accomplishments; ROSE timeline manager; scheduling concerns; current and ROSE approaches; initial scheduling; BFSSE overview and example; and summary.

  11. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...... the graphical presentation technique of Line-of-balance, which is adapted for planning and management of work-flows that facilitates resources to perform their work without interruptions caused by other resources working with other activities in the same location. As such, LBS and Lean Construction share...

  12. Modelling altered fractionation schedules

    International Nuclear Information System (INIS)

    Fowler, J.F.

    1993-01-01

    The author discusses the conflicting requirements of hyperfractionation and accelerated fractionation used in radiotherapy, and the development of computer modelling to predict how to obtain an optimum of tumour cell kill without exceeding normal-tissue tolerance. The present trend is to shorten hyperfractionated schedules from 6 or 7 weeks to give overall times of 4 or 5 weeks as in new schedules by Herskovic et al (1992) and Harari (1992). Very high doses are given, much higher than can be given when ultrashort schedules such as CHART (12 days) are used. Computer modelling has suggested that optimum overall times, to yield maximum cell kill in tumours ((α/β = 10 Gy) for a constant level of late complications (α/β = 3 Gy) would be X or X-1 weeks, where X is the doubling time of the tumour cells in days (Fowler 1990). For median doubling times of about 5 days, overall times of 4 or 5 weeks should be ideal. (U.K.)

  13. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time-differentiated cong......Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time...... from the underlying scheduling preferences (Noland and Small, 1995, Bates et al., 2001, Fosgerau and Karlström, 2010). The scheduling preferences can be formally represented as time-dependent rates of utility derived at different locations. Assuming that the travellers are rational and choose departure......’ departure time choice. The assumption underlying the scheduling approach is that the traveller rationally maximises her total utility obtained during a period of time. The total utility depends on time of departure from the origin and time of arrival to the destination. The total utility is usually assumed...

  14. CHAIN 2

    International Nuclear Information System (INIS)

    Bailey, D.

    1998-04-01

    The Second Processing Chain (CHAIN2) consists of a suite of ten programs which together provide a full local analysis of the bulk plasma physics within the JET Tokamak. In discussing these ten computational models this report is intended to fulfil two broad purposes. Firstly it is meant to be used as a reference source for any user of CHAIN2 data, and secondly it provides a basic User Manual sufficient to instruct anyone in running the CHAIN2 suite of codes. In the main report text each module is described in terms of its underlying physics and any associated assumptions or limitations, whilst deliberate emphasis is put on highlighting the physics and mathematics of the calculations required in deriving each individual datatype in the standard module PPF output. In fact each datatype of the CHAIN2 PPF output listed in Appendix D is cross referenced to the point in the main text where its evaluation is discussed. An effort is made not only to give the equation used to derive a particular data profile but also to explicitly define which external data sources are involved in the computational calculation

  15. Controlled Owicki-Gries Concurrency: Reasoning about the Preemptible eChronos Embedded Operating System

    Directory of Open Access Journals (Sweden)

    June Andronick

    2015-11-01

    Full Text Available We introduce a controlled concurrency framework, derived from the Owicki-Gries method, for describing a hardware interface in detail sufficient to support the modelling and verification of small, embedded operating systems (OS's whose run-time responsiveness is paramount. Such real-time systems run with interrupts mostly enabled, including during scheduling. That differs from many other successfully modelled and verified OS's that typically reduce the complexity of concurrency by running on uniprocessor platforms and by switching interrupts off as much as possible. Our framework builds on the traditional Owicki-Gries method, for its fine-grained concurrency is needed for high-performance system code. We adapt it to support explicit concurrency control, by providing a simple, faithful representation of the hardware interface that allows software to control the degree of interleaving between user code, OS code, interrupt handlers and a scheduler that controls context switching. We then apply this framework to model the interleaving behavior of the eChronos OS, a preemptible real-time OS for embedded micro-controllers. We discuss the accuracy and usability of our approach when instantiated to model the eChronos OS. Both our framework and the eChronos model are formalised in the Isabelle/HOL theorem prover, taking advantage of the high level of automation in modern reasoning tools.

  16. Senior travelers' trip chaining behavior : survey results and data analysis.

    Science.gov (United States)

    2011-08-01

    The research team conducted a survey of travel and activity scheduling behavior to better understand senior : citizens trip chaining behavior in the Chicago metropolitan areas most populous counties. The team used an : internet-based, prompted ...

  17. From non-preemptive to preemptive scheduling using synchronization synthesis.

    Science.gov (United States)

    Černý, Pavol; Clarke, Edmund M; Henzinger, Thomas A; Radhakrishna, Arjun; Ryzhyk, Leonid; Samanta, Roopsha; Tarrach, Thorsten

    2017-01-01

    We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively.

  18. Opportunities and realities of supply chain integration

    DEFF Research Database (Denmark)

    van Donk, Dirk Pieter; Akkerman, Renzo; van der Vaart, Taco

    2008-01-01

    Purpose: The purpose of the paper is to investigate the limitations and barriers for supply chain integration that food manufacturers experience and to highlight their planning and scheduling problems. Possible ways to cope with these are offered. Methodology: The paper is theoretical/conceptual ......Purpose: The purpose of the paper is to investigate the limitations and barriers for supply chain integration that food manufacturers experience and to highlight their planning and scheduling problems. Possible ways to cope with these are offered. Methodology: The paper is theoretical...... of solutions that might assist production managers in better understanding their situation and thinking about improvements. Originality/Value of the paper: The paper introduces buyer focus, shared resources and the limitations of supply chain integration into the field of food supply chains....

  19. 谷氨酰胺、EPA、支链氨基酸对食管癌同步放化疗及胃癌术后辅助化疗患者的影响%Impact of glutamine, eicosapntemacnioc acid, branched-chain amino acid supplements on nutritional status and treatment compliance of esophageal cancer patients on concurrent chemoradiotherapy and gastric cancer patients on chemotherapy

    Institute of Scientific and Technical Information of China (English)

    丛明华; 宋晨鑫; 邹宝华; 邓颖冰; 李淑娈; 刘雪辉; 刘微微; 刘金英; 于雷

    2015-01-01

    Objective To explore the effects of glutamine,eicosapntemacnioc acid (EPA) and branched-chain amino acids supplements in esophageal cancer patients on concurrent chemoradiotherapy and gastric cancer patients on chemotherapy.Methods From April 2013 to April 2014,a total of 104 esophageal and gastric carcinoma patients on chemotherapy or concurrent chemoradiotherapy were recruited and randomly divided into experimental and control groups.Both groups received dietary counseling and routine nutritional supports while only experimental group received supplements of glutamine (20 g/d),EPA (3.3 g/d) and branched-chain amino acids (8 g/d).And body compositions,blood indicators,incidence of complications and completion rates of therapy were compared between two groups.Results After treatment,free fat mass and muscle weight increased significantly in experiment group while decreased in control group (P < 0.05).And albumin,red blood cell count,white blood cell count and blood platelet count remained stable in experiment group while declined significantly in control group.During treatment,compared to control group,the incidences of infection-associated complication were lower (6% vs 19%,P < 0.05) and the completion rates of therapy were significantly higher in experiment group (96% vs 83%,P < 0.05).Conclusion Supplements of glutamine,EPA and branched-chain amino acids can help maintain nutrition status,decrease the complications and improve compliance for esophageal cancer patients on concurrent chemo-radiotherapy and gastric cancer patients on postoperative adjuvant chemotherapy.%目的 观察补充谷氨酰胺、二十碳五烯酸(EPA)、支链氨基酸对食管癌同步放化疗及胃癌术后辅助化疗患者的作用.方法 2013年4月至2014年4月因食管癌、胃癌在中国医学科学院肿瘤医院和北京桓兴病区拟行化疗或同步化放疗患者104例入组,数字随机分为试验组和对照组进行营养干预,两组均进行

  20. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1982-07-01

    Effective January 1, 1982, NRC will institute records retention and disposal practices in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 22 which apply to housekeeping or facilitative records. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability

  1. Practical quantum appointment scheduling

    Science.gov (United States)

    Touchette, Dave; Lovitz, Benjamin; Lütkenhaus, Norbert

    2018-04-01

    We propose a protocol based on coherent states and linear optics operations for solving the appointment-scheduling problem. Our main protocol leaks strictly less information about each party's input than the optimal classical protocol, even when considering experimental errors. Along with the ability to generate constant-amplitude coherent states over two modes, this protocol requires the ability to transfer these modes back-and-forth between the two parties multiple times with very low losses. The implementation requirements are thus still challenging. Along the way, we develop tools to study quantum information cost of interactive protocols in the finite regime.

  2. Scheduling theory, algorithms, and systems

    CERN Document Server

    Pinedo, Michael L

    2016-01-01

    This new edition of the well-established text Scheduling: Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as important scheduling problems that appear in the real world. The accompanying website includes supplementary material in the form of slide-shows from industry as well as movies that show actual implementations of scheduling systems. The main structure of the book, as per previous editions, consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped, streamlined, and extended. The reference...

  3. Heavy Chain Diseases

    Science.gov (United States)

    ... of heavy chain produced: Alpha Gamma Mu Alpha Heavy Chain Disease Alpha heavy chain disease (IgA heavy ... the disease or lead to a remission. Gamma Heavy Chain Disease Gamma heavy chain disease (IgG heavy ...

  4. The Caltech Concurrent Computation Program - Project description

    Science.gov (United States)

    Fox, G.; Otto, S.; Lyzenga, G.; Rogstad, D.

    1985-01-01

    The Caltech Concurrent Computation Program wwhich studies basic issues in computational science is described. The research builds on initial work where novel concurrent hardware, the necessary systems software to use it and twenty significant scientific implementations running on the initial 32, 64, and 128 node hypercube machines have been constructed. A major goal of the program will be to extend this work into new disciplines and more complex algorithms including general packages that decompose arbitrary problems in major application areas. New high-performance concurrent processors with up to 1024-nodes, over a gigabyte of memory and multigigaflop performance are being constructed. The implementations cover a wide range of problems in areas such as high energy and astrophysics, condensed matter, chemical reactions, plasma physics, applied mathematics, geophysics, simulation, CAD for VLSI, graphics and image processing. The products of the research program include the concurrent algorithms, hardware, systems software, and complete program implementations.

  5. MLIP: A Concurrent Approach for Clipping Indexing

    OpenAIRE

    Majoju Ravinder; R.Vijay Prakash

    2011-01-01

    Multidimensional databases are beginning to be used in a wide range of applications. To meet this fast-growing demand, the R-tree family is being applied to support fast access to multidimensional data, for which the R+-tree exhibits outstanding search performance. In order to support efficient concurrent access in multi-user environments, concurrency control mechanisms for multidimensional indexing have been proposed. However, these mechanisms cannot be directly applied to the R+-tree becaus...

  6. Perceptions of randomized security schedules.

    Science.gov (United States)

    Scurich, Nicholas; John, Richard S

    2014-04-01

    Security of infrastructure is a major concern. Traditional security schedules are unable to provide omnipresent coverage; consequently, adversaries can exploit predictable vulnerabilities to their advantage. Randomized security schedules, which randomly deploy security measures, overcome these limitations, but public perceptions of such schedules have not been examined. In this experiment, participants were asked to make a choice between attending a venue that employed a traditional (i.e., search everyone) or a random (i.e., a probability of being searched) security schedule. The absolute probability of detecting contraband was manipulated (i.e., 1/10, 1/4, 1/2) but equivalent between the two schedule types. In general, participants were indifferent to either security schedule, regardless of the probability of detection. The randomized schedule was deemed more convenient, but the traditional schedule was considered fairer and safer. There were no differences between traditional and random schedule in terms of perceived effectiveness or deterrence. Policy implications for the implementation and utilization of randomized schedules are discussed. © 2013 Society for Risk Analysis.

  7. 2007 Wholesale Power Rate Schedules : 2007 General Rate Schedule Provisions.

    Energy Technology Data Exchange (ETDEWEB)

    United States. Bonneville Power Administration.

    2006-11-01

    This schedule is available for the contract purchase of Firm Power to be used within the Pacific Northwest (PNW). Priority Firm (PF) Power may be purchased by public bodies, cooperatives, and Federal agencies for resale to ultimate consumers, for direct consumption, and for Construction, Test and Start-Up, and Station Service. Rates in this schedule are in effect beginning October 1, 2006, and apply to purchases under requirements Firm Power sales contracts for a three-year period. The Slice Product is only available for public bodies and cooperatives who have signed Slice contracts for the FY 2002-2011 period. Utilities participating in the Residential Exchange Program (REP) under Section 5(c) of the Northwest Power Act may purchase Priority Firm Power pursuant to the Residential Exchange Program. Rates under contracts that contain charges that escalate based on BPA's Priority Firm Power rates shall be based on the three-year rates listed in this rate schedule in addition to applicable transmission charges. This rate schedule supersedes the PF-02 rate schedule, which went into effect October 1, 2001. Sales under the PF-07 rate schedule are subject to BPA's 2007 General Rate Schedule Provisions (2007 GRSPs). Products available under this rate schedule are defined in the 2007 GRSPs. For sales under this rate schedule, bills shall be rendered and payments due pursuant to BPA's 2007 GRSPs and billing process.

  8. Characterizing Distributed Concurrent Engineering Teams: A Descriptive Framework for Aerospace Concurrent Engineering Design Teams

    Science.gov (United States)

    Chattopadhyay, Debarati; Hihn, Jairus; Warfield, Keith

    2011-01-01

    As aerospace missions grow larger and more technically complex in the face of ever tighter budgets, it will become increasingly important to use concurrent engineering methods in the development of early conceptual designs because of their ability to facilitate rapid assessments and trades in a cost-efficient manner. To successfully accomplish these complex missions with limited funding, it is also essential to effectively leverage the strengths of individuals and teams across government, industry, academia, and international agencies by increased cooperation between organizations. As a result, the existing concurrent engineering teams will need to increasingly engage in distributed collaborative concurrent design. This paper is an extension of a recent white paper written by the Concurrent Engineering Working Group, which details the unique challenges of distributed collaborative concurrent engineering. This paper includes a short history of aerospace concurrent engineering, and defines the terms 'concurrent', 'collaborative' and 'distributed' in the context of aerospace concurrent engineering. In addition, a model for the levels of complexity of concurrent engineering teams is presented to provide a way to conceptualize information and data flow within these types of teams.

  9. INFORMATION SYSTEM OF ENTERPRISE SUPPLY CHAIN MANAGEMENT

    Directory of Open Access Journals (Sweden)

    I. V. Shatokhin

    2016-01-01

    Full Text Available The supply chain management method for manufacture scheduling and planning basedon APS-algorithm is offered. It . Logistics solutions and inventory management problems are discussed. The structure of automated control system of enterprise is designed and its tasks are described.

  10. Rostering and Task Scheduling

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg

    . The rostering process is non-trivial and especially when service is required around the clock, rostering may involve considerable effort from a designated planner. Therefore, in order to minimize costs and overstaffing, to maximize the utilization of available staff, and to ensure a high level of satisfaction...... as possible to the available staff, while respecting various requirements and rules and while including possible transportation time between tasks. This thesis presents a number of industrial applications in rostering and task scheduling. The applications exist within various contexts in health care....... Mathematical and logic-based models are presented for the problems considered. Novel components are added to existing models and the modeling decisions are justified. In one case, the model is solved by a simple, but efficient greedy construction heuristic. In the remaining cases, column generation is applied...

  11. Scheduling the powering tests

    CERN Document Server

    Barbero-Soto, E; Casas-Lino, M P; Fernandez-Robles, C; Foraz, K; Pojer, M; Saban, R; Schmidt, R; Solfaroli-Camillocci, M; Vergara-Fernandez, A

    2008-01-01

    The Large Hadron Collider is now entering in its final phase before receiving beam, and the activities at CERN between 2007 and 2008 have shifted from installation work to the commissioning of the technical systems ("hardware commissioning"). Due to the unprecedented complexity of this machine, all the systems are or will be tested as far as possible before the cool-down starts. Systems are firstly tested individually before being globally tested together. The architecture of LHC, which is partitioned into eight cryogenically and electrically independent sectors, allows the commissioning on a sector by sector basis. When a sector reaches nominal cryogenic conditions, commissioning of the magnet powering system to nominal current for all magnets can be performed. This paper briefly describes the different activities to be performed during the powering tests of the superconducting magnet system and presents the scheduling issues raised by co-activities as well as the management of resources.

  12. Sport Tournament Automated Scheduling System

    OpenAIRE

    Raof R. A. A; Sudin S.; Mahrom N.; Rosli A. N. C

    2018-01-01

    The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calc...

  13. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1992-03-01

    Title 44 United States Code, ''Public Printing and Documents,'' regulations cited in the General Services Administration's (GSA) ''Federal Information Resources Management Regulations'' (FIRMR), Part 201-9, ''Creation, Maintenance, and Use of Records,'' and regulation issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter XII, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 2, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 2 totally reorganizes the records schedules from a functional arrangement to an arrangement by the host office. A subject index and a conversion table have also been developed for the NRC schedules to allow staff to identify the new schedule numbers easily and to improve their ability to locate applicable schedules

  14. Schedules of Controlled Substances: Temporary Placement of 4-Fluoroisobutyryl Fentanyl into Schedule I. Temporary scheduling order.

    Science.gov (United States)

    2017-05-03

    The Administrator of the Drug Enforcement Administration is issuing this temporary scheduling order to schedule the synthetic opioid, N-(4-fluorophenyl)-N-(1-phenethylpiperidin-4-yl)isobutyramide (4-fluoroisobutyryl fentanyl or para-fluoroisobutyryl fentanyl), and its isomers, esters, ethers, salts and salts of isomers, esters, and ethers, into schedule I pursuant to the temporary scheduling provisions of the Controlled Substances Act. This action is based on a finding by the Administrator that the placement of 4-fluoroisobutyryl fentanyl into schedule I of the Controlled Substances Act is necessary to avoid an imminent hazard to the public safety. As a result of this order, the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances will be imposed on persons who handle (manufacture, distribute, reverse distribute, import, export, engage in research, conduct instructional activities or chemical analysis, or possess), or propose to handle, 4-fluoroisobutyryl fentanyl.

  15. Effect of anisotropy on the entanglement of quantum states in a spin chain

    NARCIS (Netherlands)

    Kartsev, PF; Kashurnikov, VA

    2004-01-01

    The effect of the anisotropy of the interaction of a spin chain in the XXZ Heisenberg model on the concurrence of the states of neighboring sites is studied. When anisotropy increases, the maximum concurrence in a magnetic field increases above the value reached in the absence of the field. The

  16. An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

    Energy Technology Data Exchange (ETDEWEB)

    Vydyanathan, Naga; Krishnamoorthy, Sriram; Sabin, Gerald M.; Catalyurek, Umit V.; Kurc, Tahsin; Sadayappan, Ponnuswamy; Saltz, Joel H.

    2009-08-01

    Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.

  17. Research on a scheduling mechanism in a complex system based on TOC

    International Nuclear Information System (INIS)

    Wen, Zhang; Ya-Ming, Zhang; Jinbo, Chen; Kaijun, Leng

    2016-01-01

    Under the condition where there is no seasonal demand fluctuation, short life cycle product supply chain should confront the market environment such as the decreasing of product value, the launch of substitutes and the appearance of competitors’ similar products, and the supply chain will become a very complex system. In this paper, the authors consider a TOC-based scheduling mechanism in this complex supply chain system. under the constant total production cost, it is more important to improve the availability of the wanted product in order to enhance the overall supply chain competitiveness so to obtain more effective output(profit rate) for the supply chain in a long period. Especially we try to apply the SDBR concept into a schedule mechanism in a particular supply chain system, and use numerical analysis to test the efficiency of the proposed method.

  18. Practical principles in appointment scheduling

    NARCIS (Netherlands)

    Kuiper, A.; Mandjes, M.

    2015-01-01

    Appointment schedules aim at achieving a proper balance between the conflicting interests of the service provider and her clients: a primary objective of the service provider is to fully utilize her available time, whereas clients want to avoid excessive waiting times. Setting up schedules that

  19. Nontraditional work schedules for pharmacists.

    Science.gov (United States)

    Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

    2008-11-15

    Nontraditional work schedules for pharmacists at three institutions are described. The demand for pharmacists and health care in general continues to increase, yet significant material changes are occurring in the pharmacy work force. These changing demographics, coupled with historical vacancy rates and turnover trends for pharmacy staff, require an increased emphasis on workplace changes that can improve staff recruitment and retention. At William S. Middleton Memorial Veterans Affairs Hospital in Madison, Wisconsin, creative pharmacist work schedules and roles are now mainstays to the recruitment and retention of staff. The major challenge that such scheduling presents is the 8 hours needed to prepare a six-week schedule. Baylor Medical Center at Grapevine in Dallas, Texas, has a total of 45 pharmacy employees, and slightly less than half of the 24.5 full-time-equivalent staff work full-time, with most preferring to work one, two, or three days per week. As long as the coverage needs of the facility are met, Envision Telepharmacy in Alpine, Texas, allows almost any scheduling arrangement preferred by individual pharmacists or the pharmacist group covering the facility. Staffing involves a great variety of shift lengths and intervals, with shifts ranging from 2 to 10 hours. Pharmacy leaders must be increasingly aware of opportunities to provide staff with unique scheduling and operational enhancements that can provide for a better work-life balance. Compressed workweeks, job-sharing, and team scheduling were the most common types of alternative work schedules implemented at three different institutions.

  20. Modeling the Cray memory scheduler

    Energy Technology Data Exchange (ETDEWEB)

    Wickham, K.L.; Litteer, G.L.

    1992-04-01

    This report documents the results of a project to evaluate low cost modeling and simulation tools when applied to modeling the Cray memory scheduler. The specific tool used is described and the basics of the memory scheduler are covered. Results of simulations using the model are discussed and a favorable recommendation is made to make more use of this inexpensive technology.

  1. Flexible Work Schedules. ERIC Digest.

    Science.gov (United States)

    Kerka, Sandra

    Flexible work schedules are one response to changes in the composition of the work force, new life-styles, and changes in work attitudes. Types of alternative work schedules are part-time and temporary employment, job sharing, and flextime. Part-time workers are a diverse group--women, the very young, and older near-retirees. Although part-time…

  2. Concurrent sourcing and external supplier opportunism

    DEFF Research Database (Denmark)

    Mols, Niels Peter

    costs of opportunism are determined as a product of four factors. The four factors are: likelihood of discovering supplier opportunism, buyer’s internalized quantity as reaction to supplier opportunism, asset specificity of external supplier’s investments, and multiplicator effects. Each......When a firm simultaneously makes and buys the same components then the firm uses concurrent sourcing. This paper presents an agency model for explaining how and when concurrent sourcing reduces the likelihood of external supplier opportunism. In the proposed model, the external supplier’s expected...... of these factors are explained and discussed in the paper. The paper ends by offering a number of theoretical and managerial implications....

  3. Notes on Timed Concurrent Constraint Programming

    DEFF Research Database (Denmark)

    Nielsen, Mogens; Valencia, Frank D.

    2004-01-01

    and program reactive systems. This note provides a comprehensive introduction to the background for and central notions from the theory of tccp. Furthermore, it surveys recent results on a particular tccp calculus, ntcc, and it provides a classification of the expressive power of various tccp languages.......A constraint is a piece of (partial) information on the values of the variables of a system. Concurrent constraint programming (ccp) is a model of concurrency in which agents (also called processes) interact by telling and asking information (constraints) to and from a shared store (a constraint...

  4. AP1000 construction schedule

    International Nuclear Information System (INIS)

    Winters, J.W.

    2001-01-01

    Westinghouse performed this study as part of EPRI interest in advancing the use of computer aided processes to reduce the cost of nuclear power plants. EPRI believed that if one could relate appropriate portions of an advanced light water reactor plant model to activities in its construction sequence, and this relationship could be portrayed visually, then optimization of the construction sequence could be developed as never before. By seeing a 3-D representation of the plant at any point in its construction sequence, more informed decisions can be made on the feasibility or attractiveness of follow on or parallel steps in the sequence. The 3-D representation of construction as a function of time (4-D) could also increase the confidence of potential investors concerning the viability of the schedule and the plant ultimate cost. This study performed by Westinghouse confirmed that it is useful to be able to visualize a plant construction in 3-D as a function of time in order to optimize the sequence of construction activities. (author)

  5. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

    Introduction The endgame of CMS installation in the underground cavern is in full swing, with several major milestones having been passed since the last CMS week. The Tracker was installed inside the Vactank just before the CERN end-of-year shutdown. Shortly after the reopening in 2008, the two remaining endcap disks, YE-2 and YE-1, were lowered, marking the completion of eight years of assembly in the surface building SX5. The remaining tasks, before the detector can be closed for the Cosmic Run At Four Tesla (CRAFT), are the installation of the thermal shields, the cabling of the negative endcap, the cabling of the tracker and the beam pipe installation. In addition to these installation tasks, a test closure of the positive endcap is planned just before the installation of the central beam pipe. The schedule is tight and complicated but the goal to close CMS by the end of May for a cosmic test with magnetic field remains feasible. Safety With all large components now being underground, the shortage...

  6. Geo-information processing service composition for concurrent tasks: A QoS-aware game theory approach

    Science.gov (United States)

    Li, Haifeng; Zhu, Qing; Yang, Xiaoxia; Xu, Linrong

    2012-10-01

    Typical characteristics of remote sensing applications are concurrent tasks, such as those found in disaster rapid response. The existing composition approach to geographical information processing service chain, searches for an optimisation solution and is what can be deemed a "selfish" way. This way leads to problems of conflict amongst concurrent tasks and decreases the performance of all service chains. In this study, a non-cooperative game-based mathematical model to analyse the competitive relationships between tasks, is proposed. A best response function is used, to assure each task maintains utility optimisation by considering composition strategies of other tasks and quantifying conflicts between tasks. Based on this, an iterative algorithm that converges to Nash equilibrium is presented, the aim being to provide good convergence and maximise the utilisation of all tasks under concurrent task conditions. Theoretical analyses and experiments showed that the newly proposed method, when compared to existing service composition methods, has better practical utility in all tasks.

  7. Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

    Directory of Open Access Journals (Sweden)

    Ahmed Mohamed H

    2006-01-01

    Full Text Available In order to mitigate high cochannel interference resulting from dense channel reuse, the interference management issues are often considered as essential part of scheduling schemes in fixed broadband wireless access (FBWA networks. To that end, a series of literature has been published recently, in which a group of base stations forms an interferer group (downlink transmissions from each base station become dominant interference for the users in other in-group base stations, and the scheduling scheme deployed in the group allows only one base station to transmit at a time. As a result of time orthogonality in transmissions, the dominant cochannel interferers are prevented, and hence the packet error rate can be improved. However, prohibiting concurrent transmissions in these orthogonal schemes introduces throughput penalty as well as higher end-to-end packet delay which might not be desirable for real-time services. In this paper, we utilize opportunistic nonorthogonality among the in-group transmissions whenever possible and propose a novel transmission scheduling scheme for FBWA networks. The proposed scheme, in contrast to the proactive interference avoidance techniques, strives for the improvements in delay and throughput efficiency. To facilitate opportunistic nonorthogonal transmissions in the interferer group, estimation of signal-to-interference-plus-noise ratio (SINR is required at the scheduler. We have observed from simulations that the proposed scheme outperforms the reference orthogonal scheme in terms of spectral efficiency, mean packet delay, and packet dropping rate.

  8. Performance Evaluation of Concurrent Multipath Video Streaming in Multihomed Mobile Networks

    Directory of Open Access Journals (Sweden)

    James Nightingale

    2013-01-01

    Full Text Available High-quality real-time video streaming to users in mobile networks is challenging due to the dynamically changing nature of the network paths, particularly the limited bandwidth and varying end-to-end delay. In this paper, we empirically investigate the performance of multipath streaming in the context of multihomed mobile networks. Existing schemes that make use of the aggregated bandwidth of multiple paths can overcome bandwidth limitations on a single path but suffer an efficiency penalty caused by retransmission of lost packets in reliable transport schemes or path switching overheads in unreliable transport schemes. This work focuses on the evaluation of schemes to permit concurrent use of multiple paths to deliver video streams. A comprehensive streaming framework for concurrent multipath video streaming is proposed and experimentally evaluated, using current state-of-the-art H.264 Scalable Video Coding (H.264/SVC and the next generation High Efficiency Video Coding (HEVC standards. It provides a valuable insight into the benefit of using such schemes in conjunction with encoder specific packet prioritisation mechanisms for quality-aware packet scheduling and scalable streaming. The remaining obstacles to deployment of concurrent multipath schemes are identified, and the challenges in realising HEVC based concurrent multipath streaming are highlighted.

  9. Emotion as Opportunity: Reflections on Multiple Concurrent ...

    African Journals Online (AJOL)

    Partner reduction has been shown to be one of the most important aspects of any programme that seeks to contain the spread of HIV. In South Africa, however, multiple concurrent sexual partnerships are a common feature of township life for young people, especially young men. Following on from XXXXX's (2009) study on ...

  10. Declarative interpretations of session-based concurrency

    DEFF Research Database (Denmark)

    Cano, Mauricio; Rueda, Camilo; López-Acosta, Hugo-Andrés

    2015-01-01

    Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured; the latter defines governing conditions...

  11. Integrated concurrent utilization quality review, Part one.

    Science.gov (United States)

    Caterinicchio, R P

    1987-01-01

    This article is the first of a two-part series which argues for the concurrent management of the appropriateness, necessity, and quality of patient care. Intensifying scrutiny by the credentialing groups, the PROs and all third-party payors underscores the vital need to implement cost-effective information systems which integrate the departmentalized functions of patient-physician profiling, DRG case-mix analyses, length of stay monitoring, pre-admission/admission and continued stay review, discharge planning, risk management, incident reporting and quality review. In the domain of physician performance regarding admitting and practice patterns, the ability to exercise concurrent utilization-quality review means early detection and prevention of events which would otherwise result in denials of payment and/or compromised patient care. Concurrent utilization-quality review must, by definition, be managerially invasive and focused; hence, it is integral to maintaining the integrity of the services and product lines offered by the provider. In fact, if PPO status is a marketing agenda, then the institutional objectives of cost-effectiveness, productivity, value, and competitiveness can only be achieved through concurrent utilization-quality review.

  12. An Evaluation of Concurrent Priority Queue Algorithms

    Science.gov (United States)

    1991-02-01

    path pronlem are testedi A! -S7 ?o An Evaluation of Concurrent Priority Queue Algorithms bv Qin Huang BS. Uiversity - of Science andi Technology of China...who have always supported me through my entire career and made my life more enjoyable. This research was supported in part by the Advanced Research

  13. Concurrent Engineering in seafood product development

    DEFF Research Database (Denmark)

    Jonsdottir, Stella; Vesterager, Johan; Børresen, Torger

    1998-01-01

    benefit from the CE approach which can support product developers to provide concurrent specifications for raw materials, ingredients, packaging, and production methods. The approach involves the use of product models from which line extensions are more easily generated than by use of customary stepwise...... techniques. it is anticipated that other food industries also can benefit from the more simultaneous approach...

  14. Concurrency meets probability: theory and practice (abstract)

    NARCIS (Netherlands)

    Katoen, Joost P.

    Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and process algebras [14] have been extended with probabilities. The same applies to behavioural semantics such as strong and weak (bi)simulation [1], and testing pre-orders [5]. Beautiful connections between

  15. On run-time exploitation of concurrency

    NARCIS (Netherlands)

    Holzenspies, P.K.F.

    2010-01-01

    The `free' speed-up stemming from ever increasing processor speed is over. Performance increase in computer systems can now only be achieved through parallelism. One of the biggest challenges in computer science is how to map applications onto parallel computers. Concurrency, seen as the set of

  16. Concurrent Design of Embedded Control Software

    NARCIS (Netherlands)

    Groothuis, M.A.; Frijns, Raymond; Voeten, Jeroen; Broenink, Johannes F.; Margaria, T.; Padberg, J.; Taentzer, G.; Levendovszky, T.; Lengyel, L.; Karsai, G.; Hardebolle, C.

    2009-01-01

    Embedded software design for mechatronic systems is becoming an increasingly time-consuming and error-prone task. In order to cope with the heterogeneity and complexity, a systematic model-driven design approach is needed, where several parts of the system can be designed concurrently. There is

  17. Angelic semantics of fine-grained concurrency

    OpenAIRE

    Dan R. Ghica; Andrzej S. Murawski

    2008-01-01

    We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplified version of Hyland–Ong-style games and it emphasizes the intuitive connection between the concurrent nature of games and that of computation. The model is fully abstract for may-equivalence.

  18. A body sensor platform for concurrent applications

    NARCIS (Netherlands)

    Bui, T.V.; Verhoeven, R.; Lukkien, J.J.

    2012-01-01

    This paper presents a Body Sensor Platform supporting concurrent applications that share resources and data. Concerns are application isolation, data privacy and platform trustworthiness in view of dynamic loading of applications. A prototype has been built on commercial-off-the-shelf hardware. The

  19. 29 CFR 502.17 - Concurrent actions.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 3 2010-07-01 2010-07-01 false Concurrent actions. 502.17 Section 502.17 Labor Regulations Relating to Labor (Continued) WAGE AND HOUR DIVISION, DEPARTMENT OF LABOR REGULATIONS ENFORCEMENT OF CONTRACTUAL OBLIGATIONS FOR TEMPORARY ALIEN AGRICULTURAL WORKERS ADMITTED UNDER SECTION 218 OF THE IMMIGRATION...

  20. 29 CFR 501.17 - Concurrent actions.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 3 2010-07-01 2010-07-01 false Concurrent actions. 501.17 Section 501.17 Labor Regulations Relating to Labor (Continued) WAGE AND HOUR DIVISION, DEPARTMENT OF LABOR REGULATIONS ENFORCEMENT OF CONTRACTUAL OBLIGATIONS FOR TEMPORARY ALIEN AGRICULTURAL WORKERS ADMITTED UNDER SECTION 218 OF THE IMMIGRATION...

  1. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

    Gain scheduling controllers are considered in this paper. The gain scheduling problem where the scheduling parameter vector cannot be measured directly, but needs to be estimated is considered. An estimation of the scheduling vector has been derived by using the Youla parameterization. The use...... in connection with H_inf gain scheduling controllers....

  2. Concurrent analysis: towards generalisable qualitative research.

    Science.gov (United States)

    Snowden, Austyn; Martin, Colin R

    2011-10-01

    This study develops an original method of qualitative analysis coherent with its interpretivist principles. The objective is to increase the likelihood of achieving generalisability and so improve the chance of the findings being translated into practice. Good qualitative research depends on coherent analysis of different types of data. The limitations of existing methodologies are first discussed to justify the need for a novel approach. To illustrate this approach, primary evidence is presented using the new methodology. The primary evidence consists of a constructivist grounded theory of how mental health nurses with prescribing authority integrate prescribing into practice. This theory is built concurrently from interviews, reflective accounts and case study data from the literature. Concurrent analysis. Ten research articles and 13 semi-structured interviews were sampled purposively and then theoretically and analysed concurrently using constructivist grounded theory. A theory of the process of becoming competent in mental health nurse prescribing was generated through this process. This theory was validated by 32 practising mental health nurse prescribers as an accurate representation of their experience. The methodology generated a coherent and generalisable theory. It is therefore claimed that concurrent analysis engenders consistent and iterative treatment of different sources of qualitative data in a manageable manner. This process supports facilitation of the highest standard of qualitative research. Concurrent analysis removes the artificial delineation of relevant literature from other forms of constructed data. This gives researchers clear direction to treat qualitative data consistently raising the chances of generalisability of the findings. Raising the generalisability of qualitative research will increase its chances of informing clinical practice. © 2010 Blackwell Publishing Ltd.

  3. Constraint-based scheduling applying constraint programming to scheduling problems

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

    Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

  4. Chain reaction

    International Nuclear Information System (INIS)

    Balogh, Brian.

    1991-01-01

    Chain Reaction is a work of recent American political history. It seeks to explain how and why America came to depend so heavily on its experts after World War II, how those experts translated that authority into political clout, and why that authority and political discretion declined in the 1970s. The author's research into the internal memoranda of the Atomic Energy Commission substantiates his argument in historical detail. It was not the ravages of American anti-intellectualism, as so many scholars have argued, that brought the experts back down to earth. Rather, their decline can be traced to the very roots of their success after World War II. The need to over-state anticipated results in order to garner public support, incessant professional and bureaucratic specialization, and the sheer proliferation of expertise pushed arcane and insulated debates between experts into public forums at the same time that a broad cross section of political participants found it easier to gain access to their own expertise. These tendencies ultimately undermined the political influence of all experts. (author)

  5. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Infants and Children (Birth through 6 ... any questions please talk to your doctor. 2018 Immunization Schedule Recommended Vaccinations for Infants and Children Schedule ...

  6. Operating Theatre Planning and Scheduling.

    NARCIS (Netherlands)

    Hans, Elias W.; Vanberkel, P.T.; Hall, R.

    2012-01-01

    In this chapter we present a number of approaches to operating theatre planning and scheduling. We organize these approaches hierarchically which serves to illustrate the breadth of problems confronted by researchers. At each hierarchicalplanning level we describe common problems, solution

  7. Schedule Sales Query Raw Data

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  8. Multiagent scheduling models and algorithms

    CERN Document Server

    Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur

    2014-01-01

    This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.

  9. Executive Schedule C System (ESCS)

    Data.gov (United States)

    Office of Personnel Management — Used to store information on Federal employees in the Senior Executive Service (SES) and appointed employees in the Schedule C System. Every four years, just after...

  10. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

    Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents

  11. Construction schedules slack time minimizing

    Science.gov (United States)

    Krzemiński, Michał

    2017-07-01

    The article presents two copyright models for minimizing downtime working brigades. Models have been developed for construction schedules performed using the method of work uniform. Application of flow shop models is possible and useful for the implementation of large objects, which can be divided into plots. The article also presents a condition describing gives which model should be used, as well as a brief example of optimization schedule. The optimization results confirm the legitimacy of the work on the newly-developed models.

  12. Transactions Concurrency Control in Web Service Environment

    DEFF Research Database (Denmark)

    Alrifai, Mohammad; Dolog, Peter; Nejdl, Wolfgang

    2006-01-01

    an engineering point of view as it does not change the way consumers or clients of web services have to be programmed. Furthermore, it avoids direct communication between transaction coordinators which preserves security by keeping the information about business transactions restricted to the coordinators which......Business transactions in web service environments run with relaxed isolation and atomicity property. In such environments, transactions can commit and roll back independently on each other. Transaction management has to reflect this issue and address the problems which result for example from...... concurrent access to web service resources and data. In this paper we propose an extension to the WS-Transaction Protocol which ensures the consistency of the data when independent business transactions access the data concurrently under the relaxed transaction properties. Our extension is based...

  13. Authentic And Concurrent Evaluation-refining

    DEFF Research Database (Denmark)

    Eriksson, Carina Ihlström; Åkesson, Maria; Kautz, Karlheinz

    2011-01-01

    This paper addresses the need for more detailed accounts for evaluation in design science research literature. By revisiting a design project regarding the future e-newspaper we give detailed descriptions of its authentic and concurrent evaluation approach by illustrating the what, why and how...... of all evaluation activities throughout the whole project. The project produced seven different design artifacts that were evaluated. The utility and theoretical outcomes of the evaluation activities clearly influenced design decisions regarding newspaper design, user value and business model design...... as well as decisions on strategic levels. We emphasize a holistic and concurrent approach to evaluation compared to the general design science research thinking and argue that reflecting on how to seek authenticity is important. By authenticity we refer to the notion of how closely an evaluation captures...

  14. Stability of global entanglement in thermal states of spin chains

    International Nuclear Information System (INIS)

    Brennen, Gavin K.; Bullock, Stephen S.

    2004-01-01

    We investigate the entanglement properties of a one-dimensional chain of qubits coupled via nearest-neighbor spin-spin interactions. The entanglement measure used is the n-concurrence, which is distinct from other measures on spin chains such as bipartite entanglement in that it can quantify 'global' entanglement across the spin chain. Specifically, it computes the overlap of a quantum state with its time-reversed state. As such, this measure is well suited to study ground states of spin-chain Hamiltonians that are intrinsically time-reversal-symmetric. We study the robustness of n-concurrence of ground states when the interaction is subject to a time-reversal antisymmetric magnetic field perturbation. The n-concurrence in the ground state of the isotropic XX model is computed and it is shown that there is a critical magnetic field strength at which the entanglement experiences a jump discontinuity from the maximum value to zero. The n-concurrence for thermal mixed states is derived and a threshold temperature is computed below which the system has nonzero entanglement

  15. Micro-transactions for concurrent data structures

    DEFF Research Database (Denmark)

    Meawad, Fadi; Iyer, Karthik; Schoeberl, Martin

    2013-01-01

    implementation of transactional memory that we call micro-transactions. In particular, we argue that hardware support for micro-transactions allows us to efficiently implement certain data structures. Those data structures are difficult to realize with the atomic operations provided by stock hardware and provide......, atomic instructions, and micro-transactions. Our results suggest that transactional memory is an interesting alternative to traditional concurrency control mechanisms....

  16. Continuous Activity Monitoring During Concurrent Chemoradiotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Ohri, Nitin, E-mail: ohri.nitin@gmail.com [Department of Radiation Oncology, Montefiore Medical Center, Albert Einstein College of Medicine, Bronx, New York (United States); Kabarriti, Rafi; Bodner, William R.; Mehta, Keyur J. [Department of Radiation Oncology, Montefiore Medical Center, Albert Einstein College of Medicine, Bronx, New York (United States); Shankar, Viswanathan [Department of Epidemiology and Population Health, Albert Einstein College of Medicine, Bronx, New York (United States); Halmos, Balazs; Haigentz, Missak [Department of Oncology, Montefiore Medical Center, Albert Einstein College of Medicine, Bronx, New York (United States); Rapkin, Bruce [Department of Epidemiology and Population Health, Albert Einstein College of Medicine, Bronx, New York (United States); Guha, Chandan; Kalnicki, Shalom; Garg, Madhur [Department of Radiation Oncology, Montefiore Medical Center, Albert Einstein College of Medicine, Bronx, New York (United States)

    2017-04-01

    Purpose: To perform a prospective trial testing the feasibility and utility of acquiring activity data as a measure of health status during concurrent chemoradiotherapy. Methods and Materials: Ambulatory patients who were planned for treatment with concurrent chemoradiotherapy with curative intent for cancers of the head and neck, lung, or gastrointestinal tract were provided with activity monitors before treatment initiation. Patients were asked to wear the devices continuously throughout the radiation therapy course. Step count data were downloaded weekly during radiation therapy and 2 and 4 weeks after radiation therapy completion. The primary objective was to demonstrate feasibility, defined as collection of step counts for 80% of the days during study subjects' radiation therapy courses. Secondary objectives included establishing step count as a dynamic predictor of unplanned hospitalization risk. Results: Thirty-eight enrolled patients were treated with concurrent chemoradiotherapy. Primary diagnoses included head and neck cancer (n=11), lung cancer (n=13), and a variety of gastrointestinal cancers (n=14). Step data were collected for 1524 of 1613 days (94%) during patients' radiation therapy courses. Fourteen patients were hospitalized during radiation therapy or within 4 weeks of radiation therapy completion. Cox regression modeling demonstrated a significant association between recent step counts (3-day average) and hospitalization risk, with a 38% reduction in the risk of hospitalization for every 1000 steps taken each day (hazard ratio 0.62, 95% confidence interval 0.46-0.83, P=.002). Inferior quality of life scores and impaired performance status were not associated with increased hospitalization risk. Conclusion: Continuous activity monitoring during concurrent chemoradiotherapy is feasible and well-tolerated. Step counts may serve as powerful, objective, and dynamic indicators of hospitalization risk.

  17. Using Molecular Biology to Maximize Concurrent Training

    OpenAIRE

    Baar, Keith

    2014-01-01

    Very few sports use only endurance or strength. Outside of running long distances on a flat surface and power-lifting, practically all sports require some combination of endurance and strength. Endurance and strength can be developed simultaneously to some degree. However, the development of a high level of endurance seems to prohibit the development or maintenance of muscle mass and strength. This interaction between endurance and strength is called the concurrent training effect. This revie...

  18. Continuous Activity Monitoring During Concurrent Chemoradiotherapy

    International Nuclear Information System (INIS)

    Ohri, Nitin; Kabarriti, Rafi; Bodner, William R.; Mehta, Keyur J.; Shankar, Viswanathan; Halmos, Balazs; Haigentz, Missak; Rapkin, Bruce; Guha, Chandan; Kalnicki, Shalom; Garg, Madhur

    2017-01-01

    Purpose: To perform a prospective trial testing the feasibility and utility of acquiring activity data as a measure of health status during concurrent chemoradiotherapy. Methods and Materials: Ambulatory patients who were planned for treatment with concurrent chemoradiotherapy with curative intent for cancers of the head and neck, lung, or gastrointestinal tract were provided with activity monitors before treatment initiation. Patients were asked to wear the devices continuously throughout the radiation therapy course. Step count data were downloaded weekly during radiation therapy and 2 and 4 weeks after radiation therapy completion. The primary objective was to demonstrate feasibility, defined as collection of step counts for 80% of the days during study subjects' radiation therapy courses. Secondary objectives included establishing step count as a dynamic predictor of unplanned hospitalization risk. Results: Thirty-eight enrolled patients were treated with concurrent chemoradiotherapy. Primary diagnoses included head and neck cancer (n=11), lung cancer (n=13), and a variety of gastrointestinal cancers (n=14). Step data were collected for 1524 of 1613 days (94%) during patients' radiation therapy courses. Fourteen patients were hospitalized during radiation therapy or within 4 weeks of radiation therapy completion. Cox regression modeling demonstrated a significant association between recent step counts (3-day average) and hospitalization risk, with a 38% reduction in the risk of hospitalization for every 1000 steps taken each day (hazard ratio 0.62, 95% confidence interval 0.46-0.83, P=.002). Inferior quality of life scores and impaired performance status were not associated with increased hospitalization risk. Conclusion: Continuous activity monitoring during concurrent chemoradiotherapy is feasible and well-tolerated. Step counts may serve as powerful, objective, and dynamic indicators of hospitalization risk.

  19. Concurrent semantics for structured design methods

    OpenAIRE

    Nixon, Patrick

    1996-01-01

    Also in Jelly, I., Gordon, I., & Groll, P. Software Engineering for Parallel and Distributed Systems. London: Chapman Hall. Design methods can be ambiguous due to di#11;erent interpretations of symbols or concepts. This paper presents a formal semantics for the Ward/Mellor Structured Analysis Method for Real Time systems. These semantics ensures that an unambiguous meaning can be attributed to a particular design. Speci#12;cally, it ensures that concurrent and real-time propert...

  20. Salivary gland function after concurrent chemoradiotherapy

    International Nuclear Information System (INIS)

    Ikeda, Kenichiro; Shimane, Toshikazu; Uzuki, Aya; Sugimoto, Akane; Mori, Tomoaki; Akiyama, Rio; Gomibuchi, Hiroshi; Kobayashi, Sei; Sanbe, Takeyuki

    2011-01-01

    Concurrent chemoradiotherapy for cancer of head and neck is becoming more and more prevalent. In fact, it is considered to better maintain quality of life (QOL) of patients than operative treatment in terms of preserving the functions, organs, and structures, but recently I seems that it does not maintain the QOL of patients better than operative treatment because its complications after therapy disturb daily life. We previously conducted a questionnaire survey that investigated the complications experienced by patients who received concurrent chemoradiotherapy, and reported that xerostomia was markedly reduced QOL in these patients. In this study, we divided patients who were exposed to radiation in both major salivary glands into two groups: 20 patients who received a 36 Gy dose of radiation (36 Gy group) and 15 patients who underwent radiation therapy alone at a dose of 40 Gy (radiotherapy (RT) group). The gum test was conducted with the following results (mean volume of saliva): 11.2 ml in the 36 Gy group, 6.0 ml in the RT group. There was no significant difference between the 36 Gy group and RT group. Our findings suggest that there is no significant difference in the extent of salivary gland dysfunction even after chemotherapy is carried out concurrently with radiotherapy. (author)

  1. Paclitaxel and concurrent radiation for gastric cancer

    International Nuclear Information System (INIS)

    Safran, Howard; Wanebo, Harry J.; Hesketh, Paul J.; Akerman, Paul; Ianitti, David; Cioffi, William; Di Petrillo, Thomas; Wolf, Brian; Koness, James; McAnaw, Robert; Moore, Todd; Chen, M.-H.; Radie-Keane, Kathy

    2000-01-01

    Purpose: To determine the activity and toxicity of paclitaxel and concurrent radiation for gastric cancer. Methods and Materials: Twenty-seven patients were studied. Twenty-five had proximal gastric cancers, two had distal cancers. Eight had esophageal extension, 6 had celiac adenopathy, and 7 had retroperitoneal adenopathy. Patients received paclitaxel, 50 mg/m 2 by 3-hour intravenous (IV) infusion, weekly, on days 1, 8, 15, 22, and 29. Radiation was administered concurrently to a total dose of 45.0 Gy, in 1.80 Gy fractions, for 25 treatments. Patients who were medically or surgically inoperable received a sixth week of paclitaxel with a radiation boost to 50.4 Gy. Results: Esophagitis and gastritis were the most important toxicities, Grade 3 in four patients (15%), and Grade 4 in three patients (11%). Five patients (19%) had Grade 3 nausea. The overall response rate was 56%, including three patients (11%) with a complete response. The 2-year progression-free and overall survival rates were 29% and 31%, respectively. Conclusion: Concurrent paclitaxel and radiation demonstrates substantial local-regional activity in gastric cancer. Future investigations combining paclitaxel and radiation with other local-regional and systemic treatments are warranted

  2. Managing Asynchronous Data in ATLAS's Concurrent Framework

    CERN Document Server

    Baines, John; The ATLAS collaboration

    2016-01-01

    In order to be able to make effective use of emerging hardware, where the amount of memory available to any CPU is rapidly decreasing as the core count continues to rise, ATLAS has begun a migration to a concurrent, multi-threaded software framework, known as AthenaMT. Significant progress has been made in implementing AthenaMT - we can currently run realistic Geant4 simulations on massively concurrent machines. the migration of realistic prototypes of reconstruction workflows is more difficult, given the large amounts of legacy code and the complexity and challenges of reconstruction software. These types of workflows, however, are the types that will most benefit from the memory reduction features of a multi-threaded framework. One of the challenges that we will report on in this paper is the re-design and implementation of several key asynchronous technologies whose behaviour is radically different in a concurrent environment than in a serial one, namely the management of Conditions data and the Detector D...

  3. Concurrent chemoradiotherapy for advanced esophageal cancer

    International Nuclear Information System (INIS)

    Shimizu, Wakako; Ogino, Takashi; Ishikura, Satoshi; Kawashima, Mitsuhiko; Ikeda, Hiroshi

    1997-01-01

    To investigate factors influencing response and survival for patients with squamous cell cancer of the esophagus. Forty-nine patients with squamous cell cancer of the esophagus, classified by guidelines for the clinical and pathologic studies on carcinoma of the esophagus published by the Japanese Society for Esophageal Disease, were treated by concurrent chemoradiotherapy using chemotherapy consisting of cisplatin and 5-fluorouracil with definitive irradiation of 60 Gy concurrently. Endoscopic findings and biopsy were used for evaluating the response. Nurse charts recording patient's feeding status were adopted to estimate severity of dysphagia. Complete response (CR) rate was 69.4%, median survival time (MST) was 12.3 months, and median local failure-free survival time 7.3 months. Patients in early stage (= 32.4 months, 20.4 months, 20.4 months, 15.7 months, respectively). Patients in A3 stage were often suffered from severe dysphagia both before and after treatment (81.5%, 70.4%), respectively. Concurrent chemoradiotherapy was effective treatment for esophageal cancer. Degree of dysphagia was considered to be a good prognosticator of patients' survival. (author)

  4. Reliability and Concurrent Validity of the International Personality ...

    African Journals Online (AJOL)

    Reliability and Concurrent Validity of the International Personality item Pool (IPIP) Big-five Factor Markers in Nigeria. ... Nigerian Journal of Psychiatry ... Aims: The aim of this study was to assess the internal consistency and concurrent validity ...

  5. Preliminary Proceedings 15th International Workshop on Expressiveness in Concurrency

    DEFF Research Database (Denmark)

    The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus on the comparison between programming concepts (such as concurrent, functional, imperative, logic and obje...

  6. Systematic and Scalable Testing of Concurrent Programs

    Science.gov (United States)

    2013-12-16

    barriers, condition variables, mutexes, read-write locks, semaphores , spinlocks, epoll descriptors, pipe descriptors, file descriptors, and socket...pthread_rwlock_unlock pthread_rwlock_wrlock • Scheduling and Time: clock gettimeofday nanosleep sleep usleep sched_yield time 106 • Semaphores : sem_close

  7. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1983-05-01

    Effective January 1, 1982, NRC will institute records retention and disposal practives in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 24 which apply to housekeeping or facilitative records. NRCS-I applies to records common to all or most NRC offices; NRCS-II applies to program records as found in the various offices of the Commission, Atomic Safety and Licensing Board Panel, and the Atomic Safety and Licensing Appeal Panel; NRCS-III applies to records accumulated by the Advisory Committee on Reactor Safeguards; and NRCS-IV applies to records accumulated in the various NRC offices under the Executive Director for Operations. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability

  8. Multiuser switched diversity scheduling schemes

    KAUST Repository

    Shaqfeh, Mohammad; Alnuweiri, Hussein M.; Alouini, Mohamed-Slim

    2012-01-01

    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.

  9. Sport Tournament Automated Scheduling System

    Directory of Open Access Journals (Sweden)

    Raof R. A. A

    2018-01-01

    Full Text Available The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calculating the scores of each tournament. The problem of scheduling the matches of a round robin and knock-out phase in a sport league are given focus. The problem is defined formally and the computational complexity is being noted. A solution algorithm is presented using a two-step approach. The first step is the creation of a tournament pattern and is based on known graph-theoretic method. The second one is an assignment problem and it is solved using a constraint based depth-first branch and bound procedure that assigns actual teams to numbers in the pattern. As a result, the scheduling process and knock down phase become easy for the tournament organizer and at the same time increasing the level of reliability.

  10. Multiuser switched diversity scheduling schemes

    KAUST Repository

    Shaqfeh, Mohammad

    2012-09-01

    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.

  11. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1991-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Ground-Water Monitoring Project. The routine sampling plan for the SESP has been revised this year to reflect changing site operations and priorities. Some sampling previously performed at least annually has been reduced in frequency, and some new sampling to be performed at a less than annual frequency has been added. Therefore, the SESP schedule reflects sampling to be conducted in calendar year 1991 as well as future years. The ground-water sampling schedule is for 1991. This schedule is subject to modification during the year in response to changes in Site operation, program requirements, and the nature of the observed results. Operational limitations such as weather, mechanical failures, sample availability, etc., may also require schedule modifications. Changes will be documented in the respective project files, but this plan will not be reissued. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford evirons

  12. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1991-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Ground-Water Monitoring Project. The routine sampling plan for the SESP has been revised this year to reflect changing site operations and priorities. Some sampling previously performed at least annually has been reduced in frequency, and some new sampling to be performed at a less than annual frequency has been added. Therefore, the SESP schedule reflects sampling to be conducted in calendar year 1991 as well as future years. The ground-water sampling schedule is for 1991. This schedule is subject to modification during the year in response to changes in Site operation, program requirements, and the nature of the observed results. Operational limitations such as weather, mechanical failures, sample availability, etc., may also require schedule modifications. Changes will be documented in the respective project files, but this plan will not be reissued. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford evirons.

  13. CHAINS-PC, Decay Chain Atomic Densities

    International Nuclear Information System (INIS)

    1994-01-01

    1 - Description of program or function: CHAINS computes the atom density of members of a single radioactive decay chain. The linearity of the Bateman equations allows tracing of interconnecting chains by manually accumulating results from separate calculations of single chains. Re-entrant loops can be treated as extensions of a single chain. Losses from the chain are also tallied. 2 - Method of solution: The Bateman equations are solved analytically using double-precision arithmetic. Poles are avoided by small alterations of the loss terms. Multigroup fluxes, cross sections, and self-shielding factors entered as input are used to compute the effective specific reaction rates. The atom densities are computed at any specified times. 3 - Restrictions on the complexity of the problem: Maxima of 100 energy groups, 100 time values, 50 members in a chain

  14. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Søndergaard, Hans

    2010-01-01

    Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact...... on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent of C++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way....

  15. Environmental surveillance master sampling schedule

    International Nuclear Information System (INIS)

    Bisping, L.E.

    1997-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL)(a) for the US Department of Energy (DOE). This document contains the planned 1997 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. In addition, Section 3.0, Biota, also reflects a rotating collection schedule identifying the year a specific sample is scheduled for collection. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1, General Environmental Protection Program, and DOE Order 5400.5, Radiation Protection of the Public and the Environment. The sampling methods will be the same as those described in the Environmental Monitoring Plan, US Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 1, US Department of Energy, Richland, Washington

  16. Concurrent chemoradiotherapy with gemcitabine and cisplatin for pancreatic cancer: from the laboratory to the clinic

    International Nuclear Information System (INIS)

    Symon, Zvi; Davis, Mary; McGinn, Cornelius J.; Zalupski, Mark M.; Lawrence, Theodore S.

    2002-01-01

    Purpose: We have reported that gemcitabine and concurrent radiation is a promising therapy for patients with pancreatic cancer. We investigated whether the addition of cisplatin, which may increase the systemic efficacy of gemcitabine, would be synergistic with gemcitabine and/or radiation in human pancreatic cancer cell lines. Methods and Materials: BxPc3 and Panc-1 human pancreatic cancer cells were treated with three different schedules before radiation: (A) a sequential incubation of gemcitabine for 2 h followed by cisplatin for 2 h, (B) gemcitabine for 2 h, followed by washout of drug, replenishment of media for a 24-h incubation, followed by cisplatin for 2 h, and (C) gemcitabine for 24 h with a concurrent incubation of cisplatin for the last 2 h. Cells were assessed for clonogenic survival using a standard assay. Synergism was evaluated by the median effect analysis. Results: The schedule shown to be maximally synergistic for both cell lines was the consecutive 2-h gemcitabine, 2-h cisplatin exposure, particularly at surviving fractions of <0.5. Cisplatin did not produce radiosensitization nor did it affect gemcitabine-mediated radiosensitization. Conclusion: Cisplatin produces synergistic cytotoxicity with gemcitabine without compromising gemcitabine-mediated radiosensitization. On the basis of these laboratory and previous clinical observations, we have initiated a Phase I trial of cisplatin plus gemcitabine and radiotherapy in patients with unresectable pancreatic cancer

  17. Concurrent paclitaxel and radiotherapy. Treatment feasibility studies

    International Nuclear Information System (INIS)

    Vogt, H.G.; Martin, T.; Kolotas, C.; Hey, S.; Schneider, L.; Templin, T.; Zamboglou, N.; Dornoff, W.; Kettner, H.

    1997-01-01

    Background: The anti-neoplastic effect of paclitaxel has been demonstrated in various clinical studies in different malignant diseases. Clinical studies have also demonstrated a greater efficacy for simultaneous radio-chemotherapy compared with radiotherapy alone when using radiosensitizing drugs. Based on these clinical and in-vitro data we initiated several pilot studies using paclitaxel as a radiosensitizing agent and we now present our initial experience in its use in a combined modality protocol, radiation and simultaneous chemotherapy with paclitaxel. Methods: I. Concurrent paclitaxel and radiation for locally advanced non-small-cell lung cancer (NSCLC): In a phase-I-study we applicated paclitaxel (45 to 65 mg/m 2 ) as a 3-hour infusion weekly for 3 to 7 weeks simultaneously with primary radiotherapy in shrinking field technique with 5x1.8 Gy/week up to 59.4 Gy. - II. Concurrent paclitaxel and radiation for breast cancer as neoadjuvant or palliative: 50 mg/m 2 paclitaxel as a 3-hour infusion weekly for 6 weeks simultaneous with neoadjuvant or palliative radiotherapy of the breast/chest wall with 5x1.8 Gy/week up to 54.0 Gy. - III./IV. Concurrent paclitaxel/carboplatin and combined radiation (EBRT+brachytherapy) for locally advanced inoperable cancer of the cervix: 50 mg/m 2 paclitaxel as a 3-hour infusion weekly for 5 weeks, 50 mg/m 2 carboplatin at day 1 to 5 in week 1 and 5 simultaneously with external beam radiotherapy of the pelvis with 5x1.8 Gy/week up to 54.0 Gy and endocavitary LDR-brachytherapy (4x5 Gy). - V. Concurrent paclitaxel and radiation for locally advanced inoperable cancer of the bladder: 50 mg/m 2 paclitaxel as a 3-hour infusion weekly for 5 weeks simultaneous with radiotherapy of the pelvis with 5x1.8 Gy/week up to 50.4 Gy. VI. Concurrent paclitaxel and radiation in locally advanced inoperable head and neck cancer: 50 mg/m 2 paclitaxel as a 3-hour infusion weekly for 7 to 8 weeks simultaneous with radiotherapy in shrinking field technique

  18. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

  19. Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy

    DEFF Research Database (Denmark)

    Frederiksen, Søren Kristoffer Stiil; Miltersen, Peter Bro

    2013-01-01

    We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state red...... reduction algorithm for Markov chains using arbitrary precision floating point arithmetic and giving a rigorous error analysis of the algorithm.......We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state...

  20. Concurrent conditional clustering of multiple networks: COCONETS.

    Directory of Open Access Journals (Sweden)

    Sabrina Kleessen

    Full Text Available The accumulation of high-throughput data from different experiments has facilitated the extraction of condition-specific networks over the same set of biological entities. Comparing and contrasting of such multiple biological networks is in the center of differential network biology, aiming at determining general and condition-specific responses captured in the network structure (i.e., included associations between the network components. We provide a novel way for comparison of multiple networks based on determining network clustering (i.e., partition into communities which is optimal across the set of networks with respect to a given cluster quality measure. To this end, we formulate the optimization-based problem of concurrent conditional clustering of multiple networks, termed COCONETS, based on the modularity. The solution to this problem is a clustering which depends on all considered networks and pinpoints their preserved substructures. We present theoretical results for special classes of networks to demonstrate the implications of conditionality captured by the COCONETS formulation. As the problem can be shown to be intractable, we extend an existing efficient greedy heuristic and applied it to determine concurrent conditional clusters on coexpression networks extracted from publically available time-resolved transcriptomics data of Escherichia coli under five stresses as well as on metabolite correlation networks from metabolomics data set from Arabidopsis thaliana exposed to eight environmental conditions. We demonstrate that the investigation of the differences between the clustering based on all networks with that obtained from a subset of networks can be used to quantify the specificity of biological responses. While a comparison of the Escherichia coli coexpression networks based on seminal properties does not pinpoint biologically relevant differences, the common network substructures extracted by COCONETS are supported by

  1. Artificial intelligence approaches to astronomical observation scheduling

    Science.gov (United States)

    Johnston, Mark D.; Miller, Glenn

    1988-01-01

    Automated scheduling will play an increasing role in future ground- and space-based observatory operations. Due to the complexity of the problem, artificial intelligence technology currently offers the greatest potential for the development of scheduling tools with sufficient power and flexibility to handle realistic scheduling situations. Summarized here are the main features of the observatory scheduling problem, how artificial intelligence (AI) techniques can be applied, and recent progress in AI scheduling for Hubble Space Telescope.

  2. Relaxed Operational Semantics of Concurrent Programming Languages

    Directory of Open Access Journals (Sweden)

    Gustavo Petri

    2012-08-01

    Full Text Available We propose a novel, operational framework to formally describe the semantics of concurrent programs running within the context of a relaxed memory model. Our framework features a "temporary store" where the memory operations issued by the threads are recorded, in program order. A memory model then specifies the conditions under which a pending operation from this sequence is allowed to be globally performed, possibly out of order. The memory model also involves a "write grain," accounting for architectures where a thread may read a write that is not yet globally visible. Our formal model is supported by a software simulator, allowing us to run litmus tests in our semantics.

  3. Moments analysis of concurrent Poisson processes

    International Nuclear Information System (INIS)

    McBeth, G.W.; Cross, P.

    1975-01-01

    A moments analysis of concurrent Poisson processes has been carried out. Equations are given which relate combinations of distribution moments to sums of products involving the number of counts associated with the processes and the mean rate of the processes. Elimination of background is discussed and equations suitable for processing random radiation, parent-daughter pairs in the presence of background, and triple and double correlations in the presence of background are given. The theory of identification of the four principle radioactive series by moments analysis is discussed. (Auth.)

  4. Amplitude modulation detection with concurrent frequency modulation.

    Science.gov (United States)

    Nagaraj, Naveen K

    2016-09-01

    Human speech consists of concomitant temporal modulations in amplitude and frequency that are crucial for speech perception. In this study, amplitude modulation (AM) detection thresholds were measured for 550 and 5000 Hz carriers with and without concurrent frequency modulation (FM), at AM rates crucial for speech perception. Results indicate that adding 40 Hz FM interferes with AM detection, more so for 5000 Hz carrier and for frequency deviations exceeding the critical bandwidth of the carrier frequency. These findings suggest that future cochlear implant processors, encoding speech fine-structures may consider limiting the FM to narrow bandwidth and to low frequencies.

  5. Concurrency control in distributed database systems

    CERN Document Server

    Cellary, W; Gelenbe, E

    1989-01-01

    Distributed Database Systems (DDBS) may be defined as integrated database systems composed of autonomous local databases, geographically distributed and interconnected by a computer network.The purpose of this monograph is to present DDBS concurrency control algorithms and their related performance issues. The most recent results have been taken into consideration. A detailed analysis and selection of these results has been made so as to include those which will promote applications and progress in the field. The application of the methods and algorithms presented is not limited to DDBSs but a

  6. Parallel Machine Scheduling with Batch Delivery to Two Customers

    Directory of Open Access Journals (Sweden)

    Xueling Zhong

    2015-01-01

    Full Text Available In some make-to-order supply chains, the manufacturer needs to process and deliver products for customers at different locations. To coordinate production and distribution operations at the detailed scheduling level, we study a parallel machine scheduling model with batch delivery to two customers by vehicle routing method. In this model, the supply chain consists of a processing facility with m parallel machines and two customers. A set of jobs containing n1 jobs from customer 1 and n2 jobs from customer 2 are first processed in the processing facility and then delivered to the customers directly without intermediate inventory. The problem is to find a joint schedule of production and distribution such that the tradeoff between maximum arrival time of the jobs and total distribution cost is minimized. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. We provide polynomial time heuristics with worst-case performance analysis for the problem. If m=2 and (n1-b(n2-b<0, we propose a heuristic with worst-case ratio bound of 3/2, where b is the capacity of the delivery shipment. Otherwise, the worst-case ratio bound of the heuristic we propose is 2-2/(m+1.

  7. Logistic chain modelling

    NARCIS (Netherlands)

    Slats, P.A.; Bhola, B.; Evers, J.J.M.; Dijkhuizen, G.

    1995-01-01

    Logistic chain modelling is very important in improving the overall performance of the total logistic chain. Logistic models provide support for a large range of applications, such as analysing bottlenecks, improving customer service, configuring new logistic chains and adapting existing chains to

  8. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Schmitt, Jens B.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of their batteries. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to

  9. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of its battery. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to the

  10. How useful are preemptive schedules?

    NARCIS (Netherlands)

    Brucker, P.; Heitmann, S.; Hurink, J.L.

    2001-01-01

    Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also

  11. Interaction in activity location scheduling

    NARCIS (Netherlands)

    Tabak, V.; Vries, de B.; Dijkstra, J.; Jessurun, A.J.

    2006-01-01

    In this paper we discuss the interaction in activity location scheduling which is the main subject of an ongoing research project called "User Simulation of Space Utilization". The aim of this research project is to develop an overall model for the simulation of human movement and utilization of

  12. Scheduling with target start times

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.; Klein Haneveld, W.K.; Vrieze, O.J.; Kallenberg, L.C.M.

    1997-01-01

    We address the single-machine problem of scheduling n independent jobs subject to target start times. Target start times are essentially release times that may be violated at a certain cost. The goal is to minimize an objective function that is composed of total completion time and maximum

  13. Stochastic scheduling on unrelated machines

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Jochen

    2013-01-01

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous machines/processors and a certain degree of uncertainty about the actual sizes of jobs. The first characteristic entails machine dependent processing times of jobs and is captured by the classical

  14. Flexible Schedules and Shift Work.

    Science.gov (United States)

    Beers, Thomas M.

    2000-01-01

    Flexible work hours have gained prominence, as more than 25 million workers (27.6% of all full-time workers) can now vary their schedules. However, there has been little change since the mid-1980s in the proportion who work a shift other than a regular daytime shift. (JOW)

  15. Scheduling periodic tasks with slack

    NARCIS (Netherlands)

    Korst, J.H.M.; Aarts, E.H.L.; Lenstra, J.K.

    1997-01-01

    We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of identical processors, assuming that some slack is allowed in the time between successive executions of a periodic task. We prove that the problem is NP-hard in the strong sense. Necessary and sufficient

  16. Toward Realistic Acquisition Schedule Estimates

    Science.gov (United States)

    2016-04-30

    replace earlier versions of the F/A-18. Joint and International Nature At the time of JSF conception, there was a clear preference at the highest levels...ALPHABET SOUP ” (Aboulafia, 2015) OF STUDIES AND CONCEPTS • … MERGED INTO JAST • … WHICH EVOLVED TO JSF • WELL-KNOWN COST AND SCHEDULE

  17. Analyzing NPS Scheduling Using OSIRIS

    Science.gov (United States)

    1993-03-01

    School TEACHER SCHEDULE BLOCKS REPORT Date: 2/19/93 Period Name ID Term Days 1234 Adragna , Joe 170401 1 F xx Agrawal, Brij 120101 1 F xx Almquist...LOAD REPORT Date: 3/18/93 Total Max Consec Total Teacher ID Term Classes Classes Stud Adragna , Joe 170401 1 1 1 3 Agrawal, Brij 120101 1 2 2 98 Aiello

  18. A concurrent multiscale micromorphic molecular dynamics

    International Nuclear Information System (INIS)

    Li, Shaofan; Tong, Qi

    2015-01-01

    In this work, we have derived a multiscale micromorphic molecular dynamics (MMMD) from first principle to extend the (Andersen)-Parrinello-Rahman molecular dynamics to mesoscale and continuum scale. The multiscale micromorphic molecular dynamics is a con-current three-scale dynamics that couples a fine scale molecular dynamics, a mesoscale micromorphic dynamics, and a macroscale nonlocal particle dynamics together. By choosing proper statistical closure conditions, we have shown that the original Andersen-Parrinello-Rahman molecular dynamics is the homogeneous and equilibrium case of the proposed multiscale micromorphic molecular dynamics. In specific, we have shown that the Andersen-Parrinello-Rahman molecular dynamics can be rigorously formulated and justified from first principle, and its general inhomogeneous case, i.e., the three scale con-current multiscale micromorphic molecular dynamics can take into account of macroscale continuum mechanics boundary condition without the limitation of atomistic boundary condition or periodic boundary conditions. The discovered multiscale scale structure and the corresponding multiscale dynamics reveal a seamless transition from atomistic scale to continuum scale and the intrinsic coupling mechanism among them based on first principle formulation

  19. Note on specifying and verifying concurrent processes

    Energy Technology Data Exchange (ETDEWEB)

    Holenderski, L.

    1984-02-28

    To represent sequential processes, sets of finite sequences of symbols from a finite alphabet are used in this approach, alphabet symbols denote events occurring when a process is being executed, a sequence of symbols is a record of one execution of the process, and a set of such sequences represents the process itself by combining all its possible executions together. Although this model turned out adequate for specifying concurrent processes and allows proving their properties, there are two reasons, at least, why this note takes the same subject up again. First, by analogy to shuffle and its closure, which express parallel combination and parallel iteration of non-interacting processes, there is a need for a similar operation describing the behaviour of interaction processes. A new extension of shuffle is proposed as a generalization. The closure of this operation provides a tool for specification of parallelly iterated processes. Moreover, the closure makes mutually recursive specification unnecessary. Second, when this model was used to prove properties of concurrent computations, only flow-of-control schemes were considered (thus, only some general properties were proved). When applied to concrete programs using variables that have values, such schemes had to be interpreted. In contrast to such a schematic approach, the usefulness of the same method for concrete programs is argued. This is shown using an example of a correctness proof of an implementation of unbounded semaphore by binary semaphores. 8 references.

  20. Time-varying Concurrent Risk of Extreme Droughts and Heatwaves in California

    Science.gov (United States)

    Sarhadi, A.; Diffenbaugh, N. S.; Ausin, M. C.

    2016-12-01

    Anthropogenic global warming has changed the nature and the risk of extreme climate phenomena such as droughts and heatwaves. The concurrent of these nature-changing climatic extremes may result in intensifying undesirable consequences in terms of human health and destructive effects in water resources. The present study assesses the risk of concurrent extreme droughts and heatwaves under dynamic nonstationary conditions arising from climate change in California. For doing so, a generalized fully Bayesian time-varying multivariate risk framework is proposed evolving through time under dynamic human-induced environment. In this methodology, an extreme, Bayesian, dynamic copula (Gumbel) is developed to model the time-varying dependence structure between the two different climate extremes. The time-varying extreme marginals are previously modeled using a Generalized Extreme Value (GEV) distribution. Bayesian Markov Chain Monte Carlo (MCMC) inference is integrated to estimate parameters of the nonstationary marginals and copula using a Gibbs sampling method. Modelled marginals and copula are then used to develop a fully Bayesian, time-varying joint return period concept for the estimation of concurrent risk. Here we argue that climate change has increased the chance of concurrent droughts and heatwaves over decades in California. It is also demonstrated that a time-varying multivariate perspective should be incorporated to assess realistic concurrent risk of the extremes for water resources planning and management in a changing climate in this area. The proposed generalized methodology can be applied for other stochastic nature-changing compound climate extremes that are under the influence of climate change.

  1. Flow shop scheduling algorithm to optimize warehouse activities

    Directory of Open Access Journals (Sweden)

    P. Centobelli

    2016-01-01

    Full Text Available Successful flow-shop scheduling outlines a more rapid and efficient process of order fulfilment in warehouse activities. Indeed the way and the speed of order processing and, in particular, the operations concerning materials handling between the upper stocking area and a lower forward picking one must be optimized. The two activities, drops and pickings, have considerable impact on important performance parameters for Supply Chain wholesaler companies. In this paper, a new flow shop scheduling algorithm is formulated in order to process a greater number of orders by replacing the FIFO logic for the drops activities of a wholesaler company on a daily basis. The System Dynamics modelling and simulation have been used to simulate the actual scenario and the output solutions. Finally, a t-Student test validates the modelled algorithm, granting that it can be used for all wholesalers based on drop and picking activities.

  2. Development of Watch Schedule Using Rules Approach

    Science.gov (United States)

    Jurkevicius, Darius; Vasilecas, Olegas

    The software for schedule creation and optimization solves a difficult, important and practical problem. The proposed solution is an online employee portal where administrator users can create and manage watch schedules and employee requests. Each employee can login with his/her own account and see his/her assignments, manage requests, etc. Employees set as administrators can perform the employee scheduling online, manage requests, etc. This scheduling software allows users not only to see the initial and optimized watch schedule in a simple and understandable form, but also to create special rules and criteria and input their business. The system using rules automatically will generate watch schedule.

  3. Concurrent radiochemotherapy in advanced hypopharyngeal cancer

    Directory of Open Access Journals (Sweden)

    Lukarski Dusko

    2010-05-01

    Full Text Available Abstract Background Concurrent platinum-based radiochemotherapy has been recommended as a standard of care in patients with locally advanced squamous cell head and neck carcinomas. Unfortunately, there is a lack of level one evidence on best treatment approach for advanced hypopharyngeal cancer. This report aims to summarize the results of our study on concurrent radiochemotherapy in patients with advanced hypopharyngeal cancer. Methods A retrospective analysis of 41 patients with stage III-IV hypopharyngeal cancer was performed. All patients were treated with three dimensional conformal radiotherapy and received 70 Gy in 35 fractions (2 Gy per fraction, 5 fractions per week. In dependence of the period when radiotherapy was realized, two different treatment techniques were used. Concurrent chemotherapy consisted of cisplatin 30 mg/m2 given on a weekly basis. Results The median age was 52 years (range 29-70. Stage IV disease was recognized in 73.2% of the patients. Complete response rates at the primary site and at the metastatic neck lymph nodes were 68.3% and 36.6%, respectively. A complete composite response was present in 27 patients (65.9%. Median follow-up was 13 months (range 7-36. Distant metastases as initial failure occurred in 7 patients (46.7%. The 2-year local relapse-free survival and regional relapse-free survival rates were 55.2% and 75.8%, respectively. The 2-year locoregional relapse-free survival rate was 51.3%. The 2-year disease-free survival and overall survival rates were 29.3% and 32.8%, respectively. Confluent mucositis was developed in 46.3% of patients. Leucopenia grade 1 was the most frequent hematological toxicity. The median weight loss at the end of treatment was 12% (range 5-21. The worst grade of late toxicity was most commonly pronounced in the skin and in the subcutaneous tissue. Conclusions Based on unsatisfactory results in our study we suggest that the use of sequential radiochemotherapy or chemotherapy

  4. Concurrent chemoradiation for unresectable pancreatic cancer

    International Nuclear Information System (INIS)

    Kim, Yong Bae; Seong, Jin Sil; Song, Si Young; Park, Seung Woo; Suh, Chang Ok

    2002-01-01

    To analyze the treatment results of concurrent chemoradiation with oral 5-FU plus Gemcitabine or Paclitaxel for unresectable pancreatic cancer. The patients, who were diagnosed by imaging modalities or by explo-laparotomy were treated with concurrent chemoradiation. Radiotherapy was delivered to primary tumor and regional lymph nodes, and the total dose was 45 Gy. Patients received Gemcitabine 1,000 mg/m 2 or Paclitaxel 50 mg/m 2 weekly and oral 5-FU daily. The total number of cycles of chemotherapy ranged from 1 to 39 (median, 11 cycles). The follow-up period ranged from 6 to 36 months. Survival was analyzed using the Kaplan-Meier method. Fifty-four patients between Jan. 1999 to Nov. 2001 were included in this study. Forty-two patients who completed the planned treatment were included in this analysis. The patients' age ranged from 37 to 73 years (median, 60 years) and the male to female ratio was 30:12. Treatment was interrupted for 12 patients due to; disease progression for 6 (50%), poor performance status for 4 (33.3%), intercurrent disease for 1 (8.3%), and refusal for 1 (8.3%). Response evaluation was possible for 40 patients. One patient gained complete remission and 24 patients gained partial remission, hence the response rate was 59%. The survival rates were 46.7% and 17.0% at 1 year and 2 years, respectively with a median survival time of 12 months. Patients treated with Paclitaxel showed superior outcomes compared to those patients treated with Gemcitabine, in terms of both response rate and survival rate although this difference was not statistically significant. Grade III or IV hematologic toxicity was shown in 8 patients (19%), while grade III or IV non-hematologic toxicity was shown in 5 patients (12%). Concurrent chemoradiation with oral 5-FU and Gemcitabine or Paclitaxel improves both the response rate and survival rate in patients with unresectable pancreatic cancer. A prospective study should be investigated in order to improve both the patient

  5. Project management with dynamic scheduling baseline scheduling, risk analysis and project control

    CERN Document Server

    Vanhoucke, Mario

    2013-01-01

    The topic of this book is known as dynamic scheduling, and is used to refer to three dimensions of project management and scheduling: the construction of a baseline schedule and the analysis of a project schedule's risk as preparation of the project control phase during project progress. This dynamic scheduling point of view implicitly assumes that the usability of a project's baseline schedule is rather limited and only acts as a point of reference in the project life cycle.

  6. Sustainable Supply Chain Design

    DEFF Research Database (Denmark)

    Bals, Lydia; Tate, Wendy

    A significant conceptual and practical challenge is how to integrate triple bottom line (TBL; including economic, social and environmental) sustainability into global supply chains. Although this integration is necessary to slow down global resource depletion, understanding is limited of how...... to implement TBL goals across the supply chain. In supply chain design, the classic economic perspective still dominates, although the idea of the TBL is more widely disseminated. The purpose of this research is to add to the sustainable supply chain management literature (SSCM) research agenda...... by incorporating the physical chain, and the (information and financial) support chains into supply chain design. This manuscript tackles issues of what the chains are designed for and how they are designed structurally. Four sustainable businesses are used as illustrative case examples of innovative supply chain...

  7. A planning and scheduling system for the LHC project

    CERN Document Server

    Bachy, Gérard; Tarrant, M

    1995-01-01

    The purpose of this paper is to present modern ways to manage time, resources and progress in a large-scale project. Over the last ten years, new project management techniques and tools have appeared such as concurrent engineering, Continuous Acquisition Lifecycle Support (CALS) and Engineering Data Management System (EDMS). The world downturn of the early 90s influenced project management: increasing constraints on time and budget and more external direction on spending that, for example, requires sophisticated sub-contracting practises. However, the evolution of the software and hardware market makes project control tools cheaper and easier to use. All project groups want to have their scope of work considered as complete projects and to control them themselves. This has several consequences on project staff behaviour concerning project control, and has to be taken into account in every planning process designed today. The system described will be at the heart of the planning and scheduling procedures issue...

  8. Risk and predictors for early radiation pneumonitis in patients with stage III non-small cell lung cancer treated with concurrent or sequential chemoradiotherapy

    International Nuclear Information System (INIS)

    Dang, Jun; Li, Guang; Zang, Shuang; Zhang, Shuo; Yao, Lei

    2014-01-01

    The rate of radiation pneumonitis (RP) for patients receiving chemoradiotherapy has been various across studies. Whether it is related to different chemotherapy schedules used in combination with radiation therapy were evaluated in this study. New factors associated with RP were also investigated. A total of 369 consecutive patients with Stage III non small cell lung cancer treated with chemoradiotherapy were followed after radiotherapy (RT). Among them 262 patients received concurrent chemoradiotherapy followed by consolidation chemotherapy and 107 patients received only sequential chemotherapy after RT. RP was graded according to Common Terminology Criteria for Adverse Events version 4.0. The rate of grade ≥ 2 were 39.7%, 31% and 33.6% in the concurrent DP (docetaxel/cisplatin), concurrent NP (vinorelbine/cisplatin) and sequential group, and grade ≥ 3 RP were 18.4%, 9.5%, and 11.2% respectively. The rate of grade ≥ 3 RP was significantly higher in concurrent DP group than that in concurrent NP group (p = 0.04). RP occurred earlier in concurrent DP group than that in the other two groups. There were no significant differences in response rate among the three groups. In the multivariate analysis, age (OR = 1.99, p = 0.038 and OR = 8.90, p < 0.001), chemotherapy schedule (OR = 1.45, p = 0.041 and OR = 1.98, p = 0.013), mean lung dose(OR = 1.42, p < 0.001 and OR = 1.64, p < 0.001), and planning target volume(OR = 1.004, p = 0.001 and OR = 1.005, p = 0.021) were predictors for both grade ≥ 2 and grade ≥ 3 RP. Response to treatment was a new predictor for grade ≥ 3 RP only (OR = 4.39, p = 0.034). Response to treatment was found to be a new predictor for grade ≥ 3 RP. Compared to concurrent NP schedule, concurrent DP schedule achieved similar response to treatment but resulted in a higher risk of grade ≥ 3 RP

  9. Distributed Management of Concurrent Web Service Transactions

    DEFF Research Database (Denmark)

    Alrifai, Mohammad; Dolog, Peter; Balke, Wolf-Tilo

    2009-01-01

    Business processes involve dynamic compositions of interleaved tasks. Therefore, ensuring reliable transactional processing of Web services is crucial for the success of Web service-based B2B and B2C applications. But the inherent autonomy and heterogeneity of Web services render the applicability...... of conventional ACID transaction models for Web services far from being straightforward. Current Web service transaction models relax the isolation property and rely on compensation mechanisms to ensure atomicity of business transactions in the presence of service failures. However, ensuring consistency...... in the open and dynamic environment of Web services, where interleaving business transactions enter and exit the system independently, remains an open issue. In this paper, we address this problem and propose an architecture that supports concurrency control on the Web services level. An extension...

  10. Concurrent hypokalemic periodic paralysis and bipolar disorder

    Directory of Open Access Journals (Sweden)

    Chia-Lin Lin

    2015-01-01

    Full Text Available Primary periodic paralysis is a rare autosomal dominant disorder of ion-channel dysfunction, manifested by episodic flaccid paresis secondary to abnormal sarcolemma excitability. Membrane destabilization involving Na, K-ATPase has been hypothesized to be a biological etiology of the bipolar disorder (BD and the mechanisms underlying lithium therapy have been linked to it. To date, there has been only one reported case of BD comorbid with periodic paralysis. Herein, we reported another case of concurrent bipolar mania and hypokalemic periodic paralysis (HPP, one special form of periodic paralysis. Consistent with the previous case, our patient responded well to lithium treatment for both bipolar mania and HPP. This might provide some support to the hypothesis that the therapeutic effects of lithium in both BD and HPP could be due to the correction of the underlying common pathophysiology.

  11. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Plum, Christian Edinger Munk; Vaaben, Bo

    Maritime transportation is the backbone of world trade and is accountable for around 3% of the worlds CO2 emissions. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker cons...... consumption and the impact on the remaining network and the customer service level. The model is applied to 4 real cases from Maersk Line. Solutions are comparable or superior to those chosen by operations managers. Cost savings of up to 58% may be achieved.......Maritime transportation is the backbone of world trade and is accountable for around 3% of the worlds CO2 emissions. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker...

  12. CMS Planning and Scheduling System

    CERN Document Server

    Kotamaki, M

    1998-01-01

    The paper describes the procedures and the system to build and maintain the schedules needed to manage time, resources, and progress of the CMS project. The system is based on the decomposition of the project into work packages, which can be each considered as a complete project with its own structure. The system promotes the distribution of the decision making and responsibilities to lower levels in the organisation by providing a state-of-the-art system to formalise the external commitments of the work packages without limiting their ability to modify their internal schedules to best meet their commitments. The system lets the project management focus on the interfaces between the work packages and alerts the management immediately if a conflict arises. The proposed system simplifies the planning and management process and eliminates the need for a large, centralised project management system.

  13. 75 FR 42831 - Proposed Collection; Comment Request for Form 1065, Schedule C, Schedule D, Schedule K-1...

    Science.gov (United States)

    2010-07-22

    .../or continuing information collections, as required by the Paperwork Reduction Act of 1995, Public Law... Income, Credits, Deductions and Other Items), Schedule L (Balance Sheets per Books), Schedule M-1 (Reconciliation of Income (Loss) per Books With Income (Loss) per Return)), Schedule M-2 (Analysis of Partners...

  14. Fair packet scheduling in Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal

    2014-02-01

    In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.

  15. Preemptive scheduling in overloaded systems

    Czech Academy of Sciences Publication Activity Database

    Chrobak, M.; Epstein, L.; Noga, J.; Sgall, Jiří; van Stee, R.; Tichý, Tomáš; Vakhania, N.

    2003-01-01

    Roč. 67, č. 1 (2003), s. 183-197 ISSN 0022-0000 R&D Projects: GA ČR GA201/01/1195; GA MŠk ME 476; GA AV ČR IAA1019901; GA MŠk LN00A056 Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905 Keywords : scheduling * online algorithms * benefit Subject RIV: BA - General Mathematics Impact factor: 0.795, year: 2003

  16. WCET Analysis for Preemptive Scheduling

    OpenAIRE

    Altmeyer, Sebastian; Gebhard, Gernot

    2008-01-01

    Hard real-time systems induce strict constraints on the timing of the task set. Validation of these timing constraints is thus a major challenge during the design of such a system. Whereas the derivation of timing guarantees must already be considered complex if tasks are running to completion, it gets even more complex if tasks are scheduled preemptively -- especially due to caches, deployed to improve the average performance. In this paper we propose a new method to compu...

  17. Scheduling Maintenance Jobs in Networks

    OpenAIRE

    Abed, Fidaa; Chen, Lin; Disser, Yann; Groß, Martin; Megow, Nicole; Meißner, Julie; Richter, Alexander T.; Rischke, Roman

    2017-01-01

    We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral t...

  18. Broadcast scheduling for mobile advertising

    OpenAIRE

    De Reyck, B.; Degraeve, Z.

    2003-01-01

    We describe a broadcast scheduling system developed for a precision marketing firm specialized in location-sensitive permission-based mobile advertising using SMS (Short Message Service) text messaging. Text messages containing advertisements were sent to registered customers when they were shopping in one of two shopping centers in the vicinity of London. The ads typically contained a limited-time promotional offer. The company's problem was deciding which ads to send out to which customers ...

  19. Schedule of the nuclear program

    International Nuclear Information System (INIS)

    Heigl, F.

    1977-01-01

    The lecure tries to explain the main phases which must be passed to establish nuclear power plants, the feasibility phase, preconstruction and construction phase. Each phase consists of a lot of activities which are commented. Further the lecture tries to give some ideas of durances and dependence between the phases or activities to get a complete time schedule of the realization of a nuclear power project. (HP) [de

  20. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1993-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). Samples are routinely collected and analyzed to determine the quality of air, surface water, ground water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Drinking Water Project, and Ground-Water Surveillance Project.

  1. Pre-exposure Schedule Effects on Generalization of Taste Aversion and Palatability for Thirsty and Not Thirsty Rats

    Directory of Open Access Journals (Sweden)

    Rocío Angulo

    2018-06-01

    Full Text Available The study reported four experiments aiming to test the effects of the pre-exposure schedule and water deprivation on the generalization of a conditioned taste aversion in rats, with a particular focus on testing whether or not the concurrent schedule might enhance generalization. In two experiments, non-water-deprived rats received concurrent, intermixed, or blocked exposure to a sweet-acid solution and a salty-acid solution before conditioning of one of these compounds and testing of both flavors. During pre-exposure, the rats consumed a greater amount of the sweet-acid solution than the salty-acid solution (Experiments 1 and 2, consumption of the former increasing during pre-exposure while consumption of the latter decreased (Experiment 1. Furthermore, consumption of the salty-acid solution was lower during concurrent than intermixed or blocked pre-exposure (Experiment 1 and 2 while consumption of the sweet-acid solution was greater during intermixed than concurrent or blocked pre-exposure (Experiment 1. It is discussed whether the pre-exposure schedule might modify stimulus perception beyond the mere enhancement of stimulus differentiation, by, for instance, affecting the palatability of gustatory stimuli. Evidence for enhanced generalization after concurrent pre-exposure was not found for either deprived (Experiments 1, 2, and 3 or non-deprived rats (Experiments 3 and 4, with deprivation leading to a general increase in consumption of both the conditioned and test flavors. This then raised the question of whether or not concurrent pre-exposure to flavors always increases generalization between them. The present study highlights the importance of this issue for various accounts of perceptual learning.

  2. Guidelines of Decommissioning Schedule Establishment

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Jae Yong; Yun, Taesik; Kim, Younggook; Kim, Hee-Geun [KHNP CRI, Daejeon (Korea, Republic of)

    2016-10-15

    Decommissioning has recently become an issue highlighted in Korea due to the Permanent Shutdown (PS) of Kori-1 plant. Since Korea Hydro and Nuclear Power (KHNP) Company decided the PS of Kori-1 instead of further continued operation, Kori-1 will be the first decommissioning plant of the commercial reactors in Korea. Korean regulatory authority demands Initial Decommissioning Plan (IDP) for all the plants in operation and under construction. In addition, decommissioning should be considered for the completion of the life cycle of NPPs. To date, Korea has no experience regarding decommissioning of the commercial reactor and a lot of uncertainties will be expected due to its site-specific factors. However, optimized decommissioning process schedule must be indispensable in the safety and economic efficiency of the project. Differed from USA, Korea has no experience and know-hows of the operation and site management for decommissioning. Hence, in Korea, establishment of decommissioning schedule has to give more weight to safety than precedent cases. More economical and rational schedule will be composed by collecting and analyzing the experience data and site-specific data and information as the decommissioning progresses. In a long-range outlook, KHNP having capability of NPP decommissioning will try to decommissioning business in Korea and foreign countries.

  3. Erlang Programming A Concurrent Approach to Software Development

    CERN Document Server

    Cesarini, Francesco

    2009-01-01

    This book offers you an in-depth explanation of Erlang, a programming language ideal for any situation where concurrency, fault-tolerance, and fast response is essential. You'll learn how to write complex concurrent programs in this language, regardless of your programming background or experience. Erlang Programming focuses on the language's syntax and semantics, and explains pattern matching, proper lists, recursion, debugging, networking, and concurrency, with exercises at the end of each chapter.

  4. Shiftwork Scheduling for the 1990s.

    Science.gov (United States)

    Coleman, Richard M.

    1989-01-01

    The author discusses the problems of scheduling shift work, touching on such topics as employee desires, health requirements, and business needs. He presents a method for developing shift schedules that addresses these three areas. Implementation hints are also provided. (CH)

  5. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    Over the last ten years, there have been numerous applications of evolutionary algorithms to a variety of scheduling problems. Like most other research on heuristic scheduling, the primary aim of the research has been on deterministic formulations of the problems. This is in contrast to real world...... scheduling problems which are usually not deterministic. Usually at the time the schedule is made some information about the problem and processing environment is available, but this information is uncertain and likely to change during schedule execution. Changes frequently encountered in scheduling...... environments include machine breakdowns, uncertain processing times, workers getting sick, materials being delayed and the appearance of new jobs. These possible environmental changes mean that a schedule which was optimal for the information available at the time of scheduling can end up being highly...

  6. Pittsburgh International Airport - Scheduled Passenger Traffic

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Here you can find Pittsburgh International Airport’s Monthly Scheduled Traffic Reports. Each of these reports contain a year-over-year (YOY) analysis of scheduled...

  7. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Durable Medical Equipment, Prosthetics-Orthotics, and Supplies Fee Schedule. The list contains the fee schedule amounts, floors, and ceilings for all procedure codes...

  8. GSA eLibrary Schedules and Contracts

    Data.gov (United States)

    General Services Administration — GSA eLibrary (formerly Schedules e-Library) is the online source for the latest contract award information for: GSA Schedules; Department of Veterans Affairs (VA)...

  9. Interactive Anticipatory Scheduling for Two Military Applications

    National Research Council Canada - National Science Library

    Howe, Adele

    2003-01-01

    ...; these models partially explain what makes some job shop scheduling problems difficult. For the second, several algorithms for Air Force Satellite Control Network scheduling have been compared on historical and recent data...

  10. Sustainability clauses in international supply chain contracts

    DEFF Research Database (Denmark)

    Peterkova, Katerina

    2014-01-01

    Our current society is not successful in mitigation of global social and environmental challenges. States lack legal tools, and sometimes also the will, to secure social and environmental interests transnationally and the existing soft and private regulation is criticized for its weak legitimacy...... but also to do business exclusively with socially responsible partners. Unawareness, either intentional or negligent, of unethical behaviour within a company’s supply chain may lead to an assumption that the company is complicit in such a conduct. The paper discusses a hypothesis that sustainability...... contractual clauses (SCCs) in international supply chain agreements may help to overcome the regulatory gap in relation to global sustainability while concurrently protect companies against potential social, economic and legal risks threatening in connection to unethical behaviour of their suppliers. As parts...

  11. The Fast Simulation Chain for ATLAS

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00399337; The ATLAS collaboration; Marshall, Zach

    2017-01-01

    In order to generate the huge number of Monte Carlo events that will be required by the ATLAS experiment over the next several runs, a very fast simulation is critical. Fast detector simulation alone, however, is insufficient: with very high numbers of simultaneous proton-proton collisions expected in Run 3 and beyond, the digitization (detector response emulation) and event reconstruction time quickly become comparable to the time required for detector simulation. The ATLAS Fast Chain simulation has been developed to solve this problem. Modules are implemented for fast simulation, fast digitization, and fast track reconstruction. The application is sufficiently fast—several orders of magnitude faster than the standard simulation—that the simultaneous proton-proton collisions can be generated during the simulation job, so Pythia8 also runs concurrently with the rest of the algorithms. The Fast Chain has been built to be extremely modular and flexible, so that each sample can be custom-tailored to match th...

  12. The Fast Simulation Chain for ATLAS

    CERN Document Server

    Basalaev, Artem; The ATLAS collaboration

    2016-01-01

    In order to generate the huge number of Monte Carlo events that will be required by the ATLAS experiment over the next several runs, a very fast simulation is critical. Fast detector simulation alone, however, is insufficient: with very high numbers of simultaneous proton-proton collisions expected in Run 3 and beyond, the digitization (detector response emulation) and event reconstruction time quickly become comparable to the time required for detector simulation. The ATLAS Fast Chain simulation has been developed to solve this problem. Modules are implemented for fast simulation, fast digitization, and fast track reconstruction. The application is sufficiently fast -- several orders of magnitude faster than the standard simulation -- that the simultaneous proton-proton collisions can be generated during the simulation job, so Pythia8 also runs concurrently with the rest of the algorithms. The Fast Chain has been built to be extremely modular and flexible, so that each sample can be custom-tailored to match ...

  13. How should periods without social interaction be scheduled? Children's preference for practical schedules of positive reinforcement.

    Science.gov (United States)

    Luczynski, Kevin C; Hanley, Gregory P

    2014-01-01

    Several studies have shown that children prefer contingent reinforcement (CR) rather than yoked noncontingent reinforcement (NCR) when continuous reinforcement is programmed in the CR schedule. Preference has not, however, been evaluated for practical schedules that involve CR. In Study 1, we assessed 5 children's preference for obtaining social interaction via a multiple schedule (periods of fixed-ratio 1 reinforcement alternating with periods of extinction), a briefly signaled delayed reinforcement schedule, and an NCR schedule. The multiple schedule promoted the most efficient level of responding. In general, children chose to experience the multiple schedule and avoided the delay and NCR schedules, indicating that they preferred multiple schedules as the means to arrange practical schedules of social interaction. In Study 2, we evaluated potential controlling variables that influenced 1 child's preference for the multiple schedule and found that the strong positive contingency was the primary variable. © Society for the Experimental Analysis of Behavior.

  14. A Highly Concurrent Replicated Data Structure EAI Endorsed Transactions

    Directory of Open Access Journals (Sweden)

    Mumtaz Ahmad

    2015-12-01

    Full Text Available Well defined concurrent replicated data structure is very important to design collaborative editing system, particularly, certain properties like out-of-order execution of concurrent operations and data convergence. In this paper, we introduce novel linear data structure based on unique identifier scheme required for indexed communication. These identifiers are real numbers holding specific pattern of precision. Based on the uniqueness and the total order of these identifiers, here, we present two concurrency control techniques to achieve high degree of concurrency according to strong and lazy happened-before relations. Our data structure preserves data convergence, yields better performance and avoids overheads as compared to existing approaches.

  15. Core Stability in Chain-Component Additive Games

    NARCIS (Netherlands)

    van Velzen, S.; Hamers, H.J.M.; Solymosi, T.

    2004-01-01

    Chain-component additive games are graph-restricted superadditive games, where an exogenously given line-graph determines the cooperative possibilities of the players.These games can model various multi-agent decision situations, such as strictly hierarchical organisations or sequencing / scheduling

  16. Effects of three-body interactions on the dynamics of entanglement in spin chains

    International Nuclear Information System (INIS)

    Shi Cuihua; Wu Yinzhong; Li Zhenya

    2009-01-01

    With the consideration of three-body interaction, dynamics of pairwise entanglement in spin chains is studied. The dependence of pairwise entanglement dynamics on the type of coupling, and distance between the spins is analyzed in a finite chain for different initial states. It is found that, for an Ising chain, three-body interactions are not in favor of preparing entanglement between the nearest neighbor spins, while three-body interactions are favorable for creating entanglement between remote spins from a separable initial state. For an isotropic Heisenberg chain, the pairwise concurrence will decrease when three-body interactions are considered both for a separable initial state and for a maximally entangled initial state, however, three-body interactions will retard the decay of the concurrence in an Ising chain when the initial state takes the maximally entangled state.

  17. Nova chain design and performance

    International Nuclear Information System (INIS)

    Simmons, W.W.; Glaze, J.A.; Trenholme, J.B.; Hagen, W.F.

    1980-01-01

    During the past year design of the Nova laser has undergone significant change as a result of developments in our laser glass and optical coating evaluation programs. Two notable aspects of the glass development program deserve emphasis. First, vendor qualification for production of fluorophosphate laser glass is progressing satisfactorily. There is a reasonable expectation that vendors can meet fluorophosphate glass specifications within Nova schedule constraints. Secondly, recent gain saturation measurements have shown that the saturation fluence of the fluorophosphate glass is larger than previously supposed (approx. 5.5 J/cm 2 ) and in fact is somewhat larger than Shiva silicate glasses. Hence, performance of Nova for pulses in the 3 ns and longer range should be satisfactory. For pulses in the 1 ns regime, of course, the fluorophosphate chain will have superior performance to that of silicate because of its low nonlinear index of refraction (approx. 30% that of silicate). These and other considerations have led us to choose a chain design based upon the use of fluorophosphate glass in our amplifiers

  18. Network scheduling at Belene NPP construction site

    International Nuclear Information System (INIS)

    Matveev, A.

    2010-01-01

    Four types of schedules differing in the level of their detail are singled out to enhance the efficiency of Belene NPP Project implementation planning and monitoring: Level 1 Schedule–Summary Integrated Overall Time Schedule (SIOTS) is an appendix to EPC Contract. The main purpose of SIOTS is the large scale presentation of the current information on the Project implementation. Level 2 Schedule–Integrated Overall Time Schedule (IOTS)is the contract schedule for the Contractor (ASE JSC) and their subcontractors.The principal purpose of IOTS is the work progress planning and monitoring, the analysis of the effect of activities implementation upon the progress of the Project as a whole. IOTS is the reporting schedule at the Employer –Contractor level. Level 3 Schedules, Detail Time Schedules(DTS) are developed by those who actually perform the work and are agreed upon with Atomstroyexport JSC.The main purpose of DTS is the detail planning of Atomstroyexport subcontractor's activities. DTSare the reporting schedules at the level of Contractor-Subcontractor. Level 4 Schedules are the High Detail Time Schedules (HDTS), which are the day-to-day plans of work implementation and are developed, as a rule, for a week's time period.Each lower level time schedule details the activities of the higher level time schedule

  19. Vehicle and driver scheduling for public transit.

    Science.gov (United States)

    2009-08-01

    The problem of driver scheduling involves the construction of a legal set of shifts, including allowance : of overtime, which cover the blocks in a particular vehicle schedule. A shift is the work scheduled to be performed by : a driver in one day, w...

  20. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed; Alouini, Mohamed-Slim; Ayadi, Yassin

    2017-01-01

    In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.

  1. 40 CFR 141.702 - Sampling schedules.

    Science.gov (United States)

    2010-07-01

    ... serving at least 10,000 people must submit their sampling schedule for the initial round of source water... submitting the sampling schedule that EPA approves. (3) Systems serving fewer than 10,000 people must submit... analytical result for a scheduled sampling date due to equipment failure, loss of or damage to the sample...

  2. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

    In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.

  3. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

    ... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to...

  4. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... DEFENSE NUCLEAR FACILITIES SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of FOIA Fee Schedule. SUMMARY: The Defense Nuclear Facilities Safety Board is publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to...

  5. 75 FR 7411 - Schedule of Water Charges

    Science.gov (United States)

    2010-02-19

    ... DELAWARE RIVER BASIN COMMISSION 18 CFR Part 410 Schedule of Water Charges AGENCY: Delaware River... Administrative Manual--Part III--Basin Regulations--Water Supply Charges to revise the schedule of water charges... commenter and the subject line ``Schedule of Water Charges.'' FOR FURTHER INFORMATION, CONTACT: Please...

  6. Mechanisms for scheduling games with selfish players

    NARCIS (Netherlands)

    Hoeksma, R.P.

    2015-01-01

    Many challenges in operations research involve optimization. In particular, scheduling treats the optimal planning of tasks. This thesis focuses on machine scheduling models, where a number of tasks, called jobs, need to be scheduled on one or more machines. The outcome is determined by which job is

  7. The Global Value Chain

    DEFF Research Database (Denmark)

    Sørensen, Olav Jull

    The conference paper aims to develop the global value chain concept by including corporate internal value adding activities and competition to the basic framework in order to turn the global value chain into a strategic management tool......The conference paper aims to develop the global value chain concept by including corporate internal value adding activities and competition to the basic framework in order to turn the global value chain into a strategic management tool...

  8. Space Station Freedom - Configuration management approach to supporting concurrent engineering and total quality management. [for NASA Space Station Freedom Program

    Science.gov (United States)

    Gavert, Raymond B.

    1990-01-01

    Some experiences of NASA configuration management in providing concurrent engineering support to the Space Station Freedom program for the achievement of life cycle benefits and total quality are discussed. Three change decision experiences involving tracing requirements and automated information systems of the electrical power system are described. The potential benefits of concurrent engineering and total quality management include improved operational effectiveness, reduced logistics and support requirements, prevention of schedule slippages, and life cycle cost savings. It is shown how configuration management can influence the benefits attained through disciplined approaches and innovations that compel consideration of all the technical elements of engineering and quality factors that apply to the program development, transition to operations and in operations. Configuration management experiences involving the Space Station program's tiered management structure, the work package contractors, international partners, and the participating NASA centers are discussed.

  9. It Is Not Just about the Schedule: Key Factors in Effective Reference Desk Scheduling and Management

    Science.gov (United States)

    Sciammarella, Susan; Fernandes, Maria Isabel; McKay, Devin

    2008-01-01

    Reference desk scheduling is one of the most challenging tasks in the organizational structure of an academic library. The ability to turn this challenge into a workable and effective function lies with the scheduler and indirectly the cooperation of all librarians scheduled for reference desk service. It is the scheduler's sensitivity to such…

  10. Cure Schedule for Stycast 2651/Catalyst 9.

    Energy Technology Data Exchange (ETDEWEB)

    Kropka, Jamie Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); McCoy, John D. [New Mexico Inst. of Mining and Technology, Socorro, NM (United States)

    2017-11-01

    The Emerson & Cuming technical data sheet (TDS) for Stycast 2651/Catalyst 9 lists three alternate cure schedules for the material, each of which would result in a different state of reaction and different material properties. Here, a cure schedule that attains full reaction of the material is defined. The use of this cure schedule will eliminate variance in material properties due to changes in the cure state of the material, and the cure schedule will serve as the method to make material prior to characterizing properties. The following recommendation uses one of the schedules within the TDS and adds a “post cure” to obtain full reaction.

  11. Chain transitivity in hyperspaces

    International Nuclear Information System (INIS)

    Fernández, Leobardo; Good, Chris; Puljiz, Mate; Ramírez, Ártico

    2015-01-01

    Given a non-empty compact metric space X and a continuous function f: X → X, we study the dynamics of the induced maps on the hyperspace of non-empty compact subsets of X and on various other invariant subspaces thereof, in particular symmetric products. We show how some important dynamical properties transfer across induced systems. These amongst others include, chain transitivity, chain (weakly) mixing, chain recurrence, exactness by chains. From our main theorem we derive an ε-chain version of Furstenberg’s celebrated 2 implies n Theorem. We also show the implications our results have for dynamics on continua.

  12. Decisive Markov Chains

    OpenAIRE

    Abdulla, Parosh Aziz; Henda, Noomene Ben; Mayr, Richard

    2007-01-01

    We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventually reaches either F or a state from which F can no longer be reached. While all finite Markov chains are trivially decisive (for every set F), this also holds for many classes of infinite Markov chains. Infinite Markov chains which contain a finite attractor are decisive w.r.t. every set F. In part...

  13. A collaborative scheduling model for the supply-hub with multiple suppliers and multiple manufacturers.

    Science.gov (United States)

    Li, Guo; Lv, Fei; Guan, Xu

    2014-01-01

    This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment.

  14. A Collaborative Scheduling Model for the Supply-Hub with Multiple Suppliers and Multiple Manufacturers

    Directory of Open Access Journals (Sweden)

    Guo Li

    2014-01-01

    Full Text Available This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment.

  15. A Collaborative Scheduling Model for the Supply-Hub with Multiple Suppliers and Multiple Manufacturers

    Science.gov (United States)

    Lv, Fei; Guan, Xu

    2014-01-01

    This paper investigates a collaborative scheduling model in the assembly system, wherein multiple suppliers have to deliver their components to the multiple manufacturers under the operation of Supply-Hub. We first develop two different scenarios to examine the impact of Supply-Hub. One is that suppliers and manufacturers make their decisions separately, and the other is that the Supply-Hub makes joint decisions with collaborative scheduling. The results show that our scheduling model with the Supply-Hub is a NP-complete problem, therefore, we propose an auto-adapted differential evolution algorithm to solve this problem. Moreover, we illustrate that the performance of collaborative scheduling by the Supply-Hub is superior to separate decision made by each manufacturer and supplier. Furthermore, we also show that the algorithm proposed has good convergence and reliability, which can be applicable to more complicated supply chain environment. PMID:24892104

  16. Optimizing Unmanned Aircraft System Scheduling

    Science.gov (United States)

    2008-06-01

    ASC-U uses a deterministic algorithm to optimize over a given finite time horizon to obtain near-optimal UAS mission area assignments. ASC-U...the details of the algorithm . We set an upper bound on the total number of schedules that can be generated, so as not to create unsolvable ILPs. We...COL_MISSION_NAME)) If Trim( CStr (rMissions(iRow, COL_MISSION_REQUIRED))) <> "" Then If CLng(rMissions(iRow, COL_MISSION_REQUIRED)) > CLng

  17. Concurrent applicative implementations of nondeterministic algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Salter, R

    1983-01-01

    The author introduces a methodology for utilizing concurrency in place of backtracking in the implementation of nondeterministic algorithms. This is achieved in an applicative setting through the use of the Friedman-Wise multiprogramming primitive frons, and a paradigm which views the action of nondeterministic algorithms as one of data structure construction. The element by element nondeterminism arising from a linearized search is replaced by a control structure which is oriented towards constructing sets of partial computations. This point of view is facilitated by the use of suspensions, which allow control disciplines to be embodied in the form of conceptual data structures that in reality manifest themselves only for purposes of control. He applies this methodology to the class of problems usually solved through the use of simple backtracking (e.g. 'eight queens'), and to a problem presented by Lindstrom (1979) to illustrate the use of coroutine controlled backtracking, to produce backtrack-free solutions. The solution to the latter illustrates the coroutine capability of suspended structures, but also demonstrates a need for further investigations into resolving problems of process communication in applicative languages. 14 references.

  18. Creatine and Caffeine: Considerations for Concurrent Supplementation.

    Science.gov (United States)

    Trexler, Eric T; Smith-Ryan, Abbie E

    2015-12-01

    Nutritional supplementation is a common practice among athletes, with creatine and caffeine among the most commonly used ergogenic aids. Hundreds of studies have investigated the ergogenic potential of creatine supplementation, with consistent improvements in strength and power reported for exercise bouts of short duration (≤ 30 s) and high intensity. Caffeine has been shown to improve endurance exercise performance, but results are mixed in the context of strength and sprint performance. Further, there is conflicting evidence from studies comparing the ergogenic effects of coffee and caffeine anhydrous supplementation. Previous research has identified independent mechanisms by which creatine and caffeine may improve strength and sprint performance, leading to the formulation of multi-ingredient supplements containing both ingredients. Although scarce, research has suggested that caffeine ingestion may blunt the ergogenic effect of creatine. While a pharmacokinetic interaction is unlikely, authors have suggested that this effect may be explained by opposing effects on muscle relaxation time or gastrointestinal side effects from simultaneous consumption. The current review aims to evaluate the ergogenic potential of creatine and caffeine in the context of high-intensity exercise. Research directly comparing coffee and caffeine anhydrous is discussed, along with previous studies evaluating the concurrent supplementation of creatine and caffeine.

  19. Concurrent Oxytocin in Women Needing Second Dinoprostone

    International Nuclear Information System (INIS)

    Sher, Z.; Ashraf, M.; Irum, N.; Bashir, S.; Khaliq, N.; Yaqub, S.

    2015-01-01

    Objective: To reduce average induction delivery internal in patients with poor Bishop score without compromising fetomaternal outcome (in terms of birth weight, NICU admission, maternal complications and mode of delivery). Study Design: A descriptive study. Place and Duration of Study: Department of Obstetrics and Gynaecology, Pakistan Atomic Energy Commission (PAEC) General Hospital, Islamabad, from February to December 2009. Methodology: All patients needing 2nd dinoprostone pessary for induction of labour were included in the study. Patients with gestation below 37 weeks, those with intra-uterine growth restriction, bad obstetric history, previous uterine scar and patients in whom Bishop score improved for amniotomy after 1st dinoprostone pessary, were excluded. Data was collected on a special proforma where all variables were defined. Results:Out of 90 patients, 44 (48.8 percentage) had spontaneous vertex deliveries and 12 (13.3 percentage) had instrumental deliveries so a total vaginal deliveries occurred in 56 (62.2 percentage) patients. Thirty four patients (37.8 percentage) had emergency caesarean sections. Main indication for cesarean was failure to progress in 1st stage of labour followed by fetal distress. There were 3 failed inductions. Only 2 patients had hyperstimulation. NICU admission were 8 and all babies were discharged healthy from nursery with no case of early neonatal death. Conclusion:Concurrent oxytocin with 2nd dinoprostone in patients with poor Bishop scores (initial scores 2 and 3) resulted in more vaginal birth and comparatively shorter induction delivery time with almost negligible fetomaternal complications. (author)

  20. 39 CFR 273.7 - Concurrence of Attorney General.

    Science.gov (United States)

    2010-07-01

    ... 39 Postal Service 1 2010-07-01 2010-07-01 false Concurrence of Attorney General. 273.7 Section 273... PROGRAM FRAUD CIVIL REMEDIES ACT § 273.7 Concurrence of Attorney General. (a) The Attorney General is... the Attorney General or his designee approves such action in a written statement which specifies: (1...

  1. Transactions on Petri Nets and Other Models of Concurrency V

    DEFF Research Database (Denmark)

    submission track of ToPNoC. The 12 papers cover a diverse range of topics including model checking and system verification, synthesis, foundational work on specific classes of Petri nets, and innovative applications of Petri nets and other models of concurrency. Thus, this volume gives a good view of ongoing...... concurrent systems and Petri nets research...

  2. Gender asymmetry in concurrent partnerships and HIV prevalence

    NARCIS (Netherlands)

    Leung, Ka Yin; Powers, Kimberly A.; Kretzschmar, Mirjam

    The structure of the sexual network of a population plays an essential role in the transmission of HIV. Concurrent partnerships, i.e. partnerships that overlap in time, are important in determining this network structure. Men and women may differ in their concurrent behavior, e.g. in the case of

  3. Gender asymmetry in concurrent partnerships and HIV prevalence

    NARCIS (Netherlands)

    Leung, Ka Yin; Powers, Kimberly A.; Kretzschmar, Mirjam

    2017-01-01

    The structure of the sexual network of a population plays an essential role in the transmission of HIV. Concurrent partnerships, i.e. partnerships that overlap in time, are important in determining this network structure. Men and women may differ in their concurrent behavior, e.g. in the case of

  4. Dynamic Frames Based Verification Method for Concurrent Java Programs

    NARCIS (Netherlands)

    Mostowski, Wojciech

    2016-01-01

    In this paper we discuss a verification method for concurrent Java programs based on the concept of dynamic frames. We build on our earlier work that proposes a new, symbolic permission system for concurrent reasoning and we provide the following new contributions. First, we describe our approach

  5. Association of HIV prevalence and concurrency of sexual ...

    African Journals Online (AJOL)

    Association of HIV prevalence and concurrency of sexual partnerships in South Africa's language groups: An ecological analysis. C Kenyon. Abstract. Background. There is considerable variation in HIV prevalence between different language groups in South Africa (SA). Sexual partner concurrency has been linked to the ...

  6. A System for Automatically Generating Scheduling Heuristics

    Science.gov (United States)

    Morris, Robert

    1996-01-01

    The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.

  7. Routine environmental monitoring schedule, calendar year 1995

    International Nuclear Information System (INIS)

    Schmidt, J.W.; Markes, B.M.; McKinney, S.M.

    1994-12-01

    This document provides Bechtel Hanford, Inc. (BHI) and Westinghouse Hanford Company (WHC) a schedule of monitoring and sampling routines for the Operational Environmental Monitoring (OEM) program during calendar year (CY) 1995. Every attempt will be made to consistently follow this schedule; any deviation from this schedule will be documented by an internal memorandum (DSI) explaining the reason for the deviation. The DSI will be issued by the scheduled performing organization and directed to Near-Field Monitoring. The survey frequencies for particular sites are determined by the technical judgment of Near-Field Monitoring and may depend on the site history, radiological status, use and general conditions. Additional surveys may be requested at irregular frequencies if conditions warrant. All radioactive wastes sites are scheduled to be surveyed at least annually. Any newly discovered wastes sites not documented by this schedule will be included in the revised schedule for CY 1995

  8. Software defined radio (SDR) architecture for concurrent multi-satellite communications

    Science.gov (United States)

    Maheshwarappa, Mamatha R.

    SDRs have emerged as a viable approach for space communications over the last decade by delivering low-cost hardware and flexible software solutions. The flexibility introduced by the SDR concept not only allows the realisation of concurrent multiple standards on one platform, but also promises to ease the implementation of one communication standard on differing SDR platforms by signal porting. This technology would facilitate implementing reconfigurable nodes for parallel satellite reception in Mobile/Deployable Ground Segments and Distributed Satellite Systems (DSS) for amateur radio/university satellite operations. This work outlines the recent advances in embedded technologies that can enable new communication architectures for concurrent multi-satellite or satellite-to-ground missions where multi-link challenges are associated. This research proposes a novel concept to run advanced parallelised SDR back-end technologies in a Commercial-Off-The-Shelf (COTS) embedded system that can support multi-signal processing for multi-satellite scenarios simultaneously. The initial SDR implementation could support only one receiver chain due to system saturation. However, the design was optimised to facilitate multiple signals within the limited resources available on an embedded system at any given time. This was achieved by providing a VHDL solution to the existing Python and C/C++ programming languages along with parallelisation so as to accelerate performance whilst maintaining the flexibility. The improvement in the performance was validated at every stage through profiling. Various cases of concurrent multiple signals with different standards such as frequency (with Doppler effect) and symbol rates were simulated in order to validate the novel architecture proposed in this research. Also, the architecture allows the system to be reconfigurable by providing the opportunity to change the communication standards in soft real-time. The chosen COTS solution provides a

  9. Gushing metal chain

    Science.gov (United States)

    Belyaev, Alexander; Sukhanov, Alexander; Tsvetkov, Alexander

    2016-03-01

    This article addresses the problem in which a chain falls from a glass from some height. This phenomenon demonstrates a paradoxical rise of the chain over the glass. To explain this effect, an initial hypothesis and an appropriate theory are proposed for calculating the steady fall parameters of the chain. For this purpose, the modified Cayley's problem of falling chain given its rise due to the centrifugal force of upward inertia is solved. Results show that the lift caused by an increase in linear density at the part of chain where it is being bent (the upper part) is due to the convergence of the chain balls to one another. The experiments confirm the obtained estimates of the lifting chain.

  10. FFTF and Advanced Reactors Transition Program Resource Loaded Schedule

    Energy Technology Data Exchange (ETDEWEB)

    GANTT, D.A.

    2000-10-31

    This Resource Load Schedule (RLS) addresses two missions. The Advanced Reactors Transition (ART) mission, funded by DOE-EM, is to transition assigned, surplus facilities to a safe and compliant, low-cost, stable, deactivated condition (requiring minimal surveillance and maintenance) pending eventual reuse or D&D. Facilities to be transitioned include the 309 Building Plutonium Recycle Test Reactor (PRTR) and Nuclear Energy Legacy facilities. This mission is funded through the Environmental Management (EM) Project Baseline Summary (PBS) RL-TP11, ''Advanced Reactors Transition.'' The second mission, the Fast Flux Test Facility (FFTF) Project, is funded through budget requests submitted to the Office of Nuclear Energy, Science and Technology (DOE-NE). The FFTF Project mission is maintaining the FFTF, the Fuels and Materials Examination Facility (FMEF), and affiliated 400 Area buildings in a safe and compliant standby condition. This mission is to preserve the condition of the plant hardware, software, and personnel in a manner not to preclude a plant restart. This revision of the Resource Loaded Schedule (RLS) is based upon the technical scope in the latest revision of the following project and management plans: Fast Flux Test Facility Standby Plan (Reference 1); Hanford Site Sodium Management Plan (Reference 2); and 309 Building Transition Plan (Reference 4). The technical scope, cost, and schedule baseline is also in agreement with the concurrent revision to the ART Fiscal Year (FY) 2001 Multi-Year Work Plan (MYWP), which is available in an electronic version (only) on the Hanford Local Area Network, within the ''Hanford Data Integrator (HANDI)'' application.

  11. Psychometric Validation of the World Health Organization Disability Assessment Schedule 2.0-Twelve-Item Version in Persons with Spinal Cord Injuries

    Science.gov (United States)

    Smedema, Susan Miller; Ruiz, Derek; Mohr, Michael J.

    2017-01-01

    Purpose: To evaluate the factorial and concurrent validity and internal consistency reliability of the World Health Organization Disability Assessment Schedule 2.0 (WHODAS 2.0) 12-item version in persons with spinal cord injuries. Method: Two hundred forty-seven adults with spinal cord injuries completed an online survey consisting of the WHODAS…

  12. Perivalvular pannus and valve thrombosis: two concurrent mechanisms of mechanical valve prosthesis dysfunction.

    Science.gov (United States)

    Arnáiz-García, María Elena; González-Santos, Jose María; Bueno-Codoñer, María E; López-Rodríguez, Javier; Dalmau-Sorlí, María José; Arévalo-Abascal, Adolfo; Arribas-Jiménez, Antonio; Diego-Nieto, Alejandro; Rodríguez-Collado, Javier; Rodríguez-López, Jose María

    2015-02-01

    A 78-year-old woman was admitted to our institution with progressive dyspnea. She had previously been diagnosed with rheumatic heart disease and had undergone cardiac surgery for mechanical mitral valve replacement ten years previously. Transesophageal echocardiography revealed blockage of the mechanical prosthesis and the patient was scheduled for surgery, in which a thrombus was removed from the left atrial appendage. A partial thrombosis of the mechanical prosthesis and circumferential pannus overgrowth were concomitantly detected. Prosthetic heart valve blockage is a rare but life-threatening complication, the main causes of which are thrombosis and pannus formation. The two conditions are different but both are usually misdiagnosed. Two concurrent mechanisms of prosthesis blockage were found in this patient. Copyright © 2014 Sociedade Portuguesa de Cardiologia. Published by Elsevier España. All rights reserved.

  13. Quantum discord and quantum phase transition in spin chains

    OpenAIRE

    Dillenschneider, Raoul

    2008-01-01

    Quantum phase transitions of the transverse Ising and antiferromagnetic XXZ spin S=1/2 chains are studied using quantum discord. Quantum discord allows the measure of quantum correlations present in many-body quantum systems. It is shown that the amount of quantum correlations increases close to the critical points. The observations are in agreement with the information provided by the concurrence which measures the entanglement of the many-body system.

  14. Schedule optimization study implementation plan

    International Nuclear Information System (INIS)

    1993-11-01

    This Implementation Plan is intended to provide a basis for improvements in the conduct of the Environmental Restoration (ER) Program at Hanford. The Plan is based on the findings of the Schedule Optimization Study (SOS) team which was convened for two weeks in September 1992 at the request of the U.S. Department of Energy (DOE) Richland Operations Office (RL). The need for the study arose out of a schedule dispute regarding the submission of the 1100-EM-1 Operable Unit (OU) Remedial Investigation/Feasibility Study (RI/FS) Work Plan. The SOS team was comprised of independent professionals from other federal agencies and the private sector experienced in environmental restoration within the federal system. The objective of the team was to examine reasons for the lengthy RI/FS process and recommend ways to expedite it. The SOS team issued their Final Report in December 1992. The report found the most serious impediments to cleanup relate to a series of management and policy issues which are within the control of the three parties managing and monitoring Hanford -- the DOE, U.S. Environmental Protection Agency (EPA), and the State of Washington Department of Ecology (Ecology). The SOS Report identified the following eight cross-cutting issues as the root of major impediments to the Hanford Site cleanup. Each of these eight issues is quoted from the SOS Report followed by a brief, general description of the proposed approach being developed

  15. Integrated Production-Distribution Scheduling Problem with Multiple Independent Manufacturers

    Directory of Open Access Journals (Sweden)

    Jianhong Hao

    2015-01-01

    Full Text Available We consider the nonstandard parts supply chain with a public service platform for machinery integration in China. The platform assigns orders placed by a machinery enterprise to multiple independent manufacturers who produce nonstandard parts and makes production schedule and batch delivery schedule for each manufacturer in a coordinate manner. Each manufacturer has only one plant with parallel machines and is located at a location far away from other manufacturers. Orders are first processed at the plants and then directly shipped from the plants to the enterprise in order to be finished before a given deadline. We study the above integrated production-distribution scheduling problem with multiple manufacturers to maximize a weight sum of the profit of each manufacturer under the constraints that all orders are finished before the deadline and the profit of each manufacturer is not negative. According to the optimal condition analysis, we formulate the problem as a mixed integer programming model and use CPLEX to solve it.

  16. Phase I trial of concurrent chemoradiotherapy for laryngeal and hypopharyngeal cancers with bi-weekly docetaxel

    International Nuclear Information System (INIS)

    Yoshida, Tomoyuki; Nakamura, Kazuhiro; Simizu, Shigetaka

    2005-01-01

    Docetaxel (DOC) has radiation-sensitizing effects because it synchronizes with the most radiation-sensitive G2/M phase of the cell cycle. From the results of concurrent radiotherapy with weekly DOC administrations in a phase I trial, dose-limiting toxicity (DLT) was mucositis and the recommended dose was 10 mg/m 2 , but the administration schedule was a problem. We planned concurrent radiation therapy in a bi-weekly DOC phase I trial to improve the larynx preservation rate and to determine which schedule and dosage of DOC would yield its inherent cytotoxic effects. We decided the maximum tolerated dose (MTD) and DLT to serve as an index of the appearance of adverse events. Patients with stage II or stage III T2N1 hypopharyngeal cancer or stage II or III laryngeal cancer were included in this study. DOC was administered on the days of initiation of bi-weekly radiation (day 1, day 15, day 29). Radiation was given (2 Gy/day: 5 days per week) for a total of 30 Fr, with a total of 60 Gy. The starting dose of DOC was 30 mg/m 2 (level 1) and the dosage was raised by 5 mg/m 2 at each level. DLT was observed due to mucositis and neutropenia at 40 mg/m 2 (level 3), the MTD was 40 mg/m 2 and the recommended dose (RD) was 35 mg/m 2 . Especially in hypopharyngeal cancer of Grade 3 or more, mucositis appeared, with swallowing difficulty in cases with a wide range of irradiation. At dosages of 35 mg/m 2 , the effectiveness was favorable and this was the suitable dosage recommended for the subsequent phase II trial. This clinical study was performed with permission of our IRB (Institutional Review Board). (author)

  17. Concurrent Electroconvulsive Therapy and Bupropion Treatment.

    Science.gov (United States)

    Takala, Christopher R; Leung, Jonathan G; Murphy, Lauren L; Geske, Jennifer R; Palmer, Brian A

    2017-09-01

    Bupropion is associated with a dose-dependent increased risk of seizures. Use of concomitant bupropion and electroconvulsive therapy (ECT) remains controversial because of an increased risk of prolonged seizures. This is the first systematic evaluation of the effect of bupropion on ECT. A case group (n = 119), patients treated with concomitant ECT and bupropion, was compared with an age and gender frequency-matched control group (n = 261), treated with only ECT. Electroconvulsive therapy treatment data including seizure length, number of treatments, and concurrent medications were extracted. Longitudinal mixed models examined ECT versus ECT + bupropion group differences over the course of treatments measured by seizure duration (electroencephalogram [EEG] and motor). Multivariable models examined the total number of treatments and first and last seizure duration. All models considered group differences with ECT treatment measures adjusted for age, gender, benzodiazepine treatment, lead placement, and setting. Electroconvulsive therapy treatment with bupropion led to shorter motor seizure duration (0.047) and EEG seizure duration (P = 0.001). The number of ECT treatments (7.3 vs 7.0 treatments; P = 0.23), respectively, or the probability of a prolonged seizure (P = 0.15) was not significantly different. Benzodiazepine use was significantly more common in control subjects (P = 0.01). This is a retrospective analysis limited in part by unavailable variables (seizure threshold, nature of EEG and motor seizure monitoring, type of ECT device, dosing and formulation of bupropion, and duration of the current depressive illness). This study revealed a significantly shorter duration in seizure length with ECT + concomitant bupropion, but not in the number of required treatments in those treated compared with ECT without bupropion. There remains a critical need to reevaluate the efficacy of concomitant use of psychotropic medications + ECT.

  18. Administration of Concurrent Vaginal Brachytherapy During Chemotherapy for Treatment of Endometrial Cancer

    International Nuclear Information System (INIS)

    Nagar, Himanshu; Boothe, Dustin; Parikh, Amar; Yondorf, Menachem; Parashar, Bhupesh; Gupta, Divya; Holcomb, Kevin; Caputo, Thomas; Chao, K. S. Clifford; Nori, Dattatreyudu; Wernicke, A. Gabriella

    2013-01-01

    Purpose: To evaluate the tolerability and toxicity of administering vaginal brachytherapy (VB) concurrently during chemotherapy compared with the sequential approach for patients with endometrial cancer. Methods and Materials: A retrospective analysis of 372 surgically staged patients with endometrial cancer American Joint Committee on Cancer 2009 stages I to IV treated with adjuvant postoperative radiation therapy (RT) at our institution from 2001 to 2012 was conducted. All patients received VB + external beam RT (EBRT) + 6 cycles of adjuvant carboplatin- and paclitaxel-based chemotherapy. The VB mean dose was 15.08 Gy (range, 15-20 Gy), with 3 to 4 weekly applications, and the EBRT mean dose was 45 Gy delivered with 3-dimensional or intensity modulated RT techniques. Hematologic, gastrointestinal (GI), and genitourinary (GU) toxicities were assessed by Common Toxicity Criteria (CTC) and compared between sequential and concurrent chemotherapy and VB schedules. Results: Among patients who received RT and adjuvant chemotherapy, 180 of 372 patients (48%) received RT sandwiched between cycles 3 and 4 of chemotherapy. A separate group of 192 patients (52%) were treated with VB during the first 3 cycles of chemotherapy, with a weekly application on nonchemotherapy days, and received the EBRT portion in a sandwiched fashion. Patients treated with VB during chemotherapy had a decreased overall treatment time by 4 weeks (P .05). CTC grade 3 or 4 hematologic, GI, and GU toxicities were zero. Conclusions: VB during chemotherapy is well tolerated, decreases overall treatment time, and does not render more toxicity than the sequential regimen

  19. A randomized study to compare sequential chemoradiotherapy with concurrent chemoradiotherapy for unresectable locally advanced esophageal cancer.

    Science.gov (United States)

    Gupta, Arunima; Roy, Somnath; Majumdar, Anup; Hazra, Avijit; Mallik, Chandrani

    2014-01-01

    Chemotherapy combined with radiotherapy can improve outcome in locally advanced esophageal cancer. This study aimed to compare efficacy and toxicity between concurrent chemoradiotherapy (CCRT) and sequential chemoradiotherapy (SCRT) in unresectable, locally advanced, esophageal squamous cell carcinoma (ESSC). Forty-one patients with unresectable, locally advanced ESCC were randomized into two arms. In the CCRT arm (Arm A), 17 patients received 50.4 Gy at 1.8 Gy per fraction over 5.6 weeks along with concurrent cisplatin (75 mg m(-2) intravenously on day 1 and 5-fluorouracil (1000 mg m(-2) continuous intravenous infusion on days 1-4 starting on the first day of irradiation and given after 28 days. In the SCRT arm (Arm B), 20 patients received two cycles of chemotherapy, using the same schedule, followed by radiotherapy fractionated in a similar manner. The endpoints were tumor response, acute and late toxicities, and disease-free survival. With a median follow up of 12.5 months, the complete response rate was 82.4% in Arm A and 35% in Arm B (P = 0.003). Statistically significant differences in frequencies of acute skin toxicity (P = 0.016), gastrointestinal toxicity (P = 0.005) and late radiation pneumonitis (P = 0.002) were found, with greater in the CCRT arm. A modest but non-significant difference was observed in median time to recurrence among complete responders in the two arms (Arm A 13 months and Arm B 15.5 months, P = 0.167) and there was also no significant difference between the Kaplan Meier survival plots (P = 0.641) of disease-free survival. Compared to sequential chemoradiotherapy, concurrent chemoradiotherapy can significantly improve local control rate but with greater risk of adverse reactions.

  20. Reliability and concurrent validity of the Dutch hip and knee replacement expectations surveys.

    Science.gov (United States)

    van den Akker-Scheek, Inge; van Raay, Jos J A M; Reininga, Inge H F; Bulstra, Sjoerd K; Zijlstra, Wiebren; Stevens, Martin

    2010-10-19

    Preoperative expectations of outcome of total hip and knee arthroplasty are important determinants of patients' satisfaction and functional outcome. Aims of the study were (1) to translate the Hospital for Special Surgery Hip Replacement Expectations Survey and Knee Replacement Expectations Survey into Dutch and (2) to study test-retest reliability and concurrent validity. Patients scheduled for total hip (N = 112) or knee replacement (N = 101) were sent the Dutch Expectations Surveys twice with a 2 week interval to determine test-retest reliability. To determine concurrent validity, the Expectation WOMAC was sent. The results for the Dutch Hip Replacement Expectations Survey revealed good test-retest reliability (ICC 0.87), no bias and good internal consistency (alpha 0.86) (N = 72). The correlation between the Hip Expectations Score and the Expectation WOMAC score was 0.59 (N = 86). The results for the Dutch Knee Replacement Expectations Survey revealed good test-retest reliability (ICC 0.79), no bias and good internal consistency (alpha 0.91) (N = 46). The correlation with the Expectation WOMAC score was 0.52 (N = 57). Both Dutch Expectations Surveys are reliable instruments to determine patients' expectations before total hip or knee arthroplasty. As for concurrent validity, the correlation between both surveys and the Expectation WOMAC was moderate confirming that the same construct was determined. However, patients scored systematically lower on the Expectation WOMAC compared to the Dutch Expectation Surveys. Research on patients' expectations before total hip and knee replacement has only been performed in a limited amount of countries. With the Dutch Expectations Surveys it is now possible to determine patients' expectations in another culture and healthcare setting.

  1. An initial experience using concurrent paclitaxel and radiation in the treatment of head and neck malignancies

    International Nuclear Information System (INIS)

    Tishler, Roy B.; Busse, Paul M.; Norris, Charles M.; Rossi, Rene; Poulin, Mark; Thornhill, Lee; Costello, Rosemary; Peters, Edward S.; Colevas, A. Dimitrios; Posner, Marshall R.

    1999-01-01

    Background: Combined modality therapy plays a central role in the management of head and neck malignancies. This study examined the feasibility and preliminary results of treating a group of patients using concurrent bolus paclitaxel (Taxol TM ) and radiation therapy. Methods: Fourteen patients with a median age of 56 years (range 42-81) were treated. Paclitaxel was given every 3 weeks at a dose of 100 mg/m 2 concurrently with external beam radiation. The patients treated included those who had failed to achieve a complete response (CR) to induction chemotherapy with cisplatin, 5-fluorouracil, and leucovorin (PFL), or who had locally advanced disease not previously treated. Results: Median follow-up from the initiation of treatment is 40 months (range 23-48). The majority of patients (13/14) achieved clinical CRs at the primary site. The development of responses was characterized by a long time course. Three patients who were nonresponders (NRs) to induction PFL chemotherapy were treated. One was a clinical CR at the primary site, one did not achieve a CR, and the other had residual disease in the neck. Four patients have failed, one with local-regional disease, one with a marginal failure, one with distant metastases, and one was not rendered disease-free by the treatment. As expected, significant local toxicity was observed. Most patients were managed with the aid of a percutaneous endoscopic gastrostomy (PEG). Two patients experienced significant moist desquamation and required treatment breaks of greater than 1 week. Conclusion: Paclitaxel can be given on a 3-week schedule at 100 mg/m 2 concurrently with radiation. The preliminary results indicate good local responses and acceptable toxicity. This treatment approach merits further study in the treatment of head and neck malignancies, and should be considered as an option in other sites

  2. Editorial: Supply Chain Management

    Directory of Open Access Journals (Sweden)

    Dimitrios Aidonis

    2017-05-01

    Full Text Available This special issue has followed up the 3rd Olympus International Conference on Supply Chains held on Athens Metropolitan Expo, November 7 & 8 2015, Greece. The Conference was organized by the Department of Logistics Technological Educational Institute of Central Macedonia, in collaboration with the: a Laboratory of Quantitative Analysis, Logistics and Supply Chain Management of the Department of Mechanical Engineering, Aristotle University of Thessaloniki (AUTH, b Greek Association of Supply Chain Management (EEL of Northern Greece and the c Supply Chain & Logistics Journal. During the 2-Days Conference more than 60 research papers were presented covering the following thematic areas: (i Transportation, (ii Best Practices in Logistics, (iii Information and Communication Technologies in Supply Chain Management, (iv Food Logistics, (v New Trends in Business Logistics, and (vi Green Supply Chain Management. Three keynote invited speakers addressed interesting issues for the Operational Research, the Opportunities and Prospects of Greek Ports chaired Round Tables with other Greek and Foreign Scientists and Specialists.

  3. Supply Chain Management og Supply Chain costing

    DEFF Research Database (Denmark)

    Nielsen, Steen; Mortensen, Ole

    2002-01-01

    Formålet med denne artikel er at belyse de muligheder som ligger i at integrere virksomhedens økonomiske styring med begrebet Supply Chain Management (SCM). Dette søges belyst ved først at beskrive den teoretiske ramme, hvori SCM indgår. Herefter analyseres begrebet Supply Chain Costing (SCC) som...... Århus. Et resultat er, at via begrebet Supply Chain Costing skabes der mulighed for at måle logistikkædens aktiviteter i kr./øre. Anvendelsen af denne information har også strategisk betydning for at kunne vælge kunde og leverandør. Ved hjælp af integrationen skabes der også helt nye mulighed...

  4. Supply chain components

    OpenAIRE

    Vieraşu, T.; Bălăşescu, M.

    2011-01-01

    In this article I will go through three main logistics components, which are represented by: transportation, inventory and facilities, and the three secondary logistical components: information, production location, price and how they determine performance of any supply chain. I will discuss then how these components are used in the design, planning and operation of a supply chain. I will also talk about some obstacles a supply chain manager may encounter.

  5. Supply chain components

    Directory of Open Access Journals (Sweden)

    Vieraşu, T.

    2011-01-01

    Full Text Available In this article I will go through three main logistics components, which are represented by: transportation, inventory and facilities, and the three secondary logistical components: information, production location, price and how they determine performance of any supply chain. I will discuss then how these components are used in the design, planning and operation of a supply chain. I will also talk about some obstacles a supply chain manager may encounter.

  6. Markov Tail Chains

    OpenAIRE

    janssen, Anja; Segers, Johan

    2013-01-01

    The extremes of a univariate Markov chain with regularly varying stationary marginal distribution and asymptotically linear behavior are known to exhibit a multiplicative random walk structure called the tail chain. In this paper we extend this fact to Markov chains with multivariate regularly varying marginal distributions in Rd. We analyze both the forward and the backward tail process and show that they mutually determine each other through a kind of adjoint relation. In ...

  7. Economy, market and chain

    OpenAIRE

    Sukkel, W.; Hommes, M.

    2009-01-01

    In their pursuit of growth and professionalisation, the Dutch organic sector focuses primarily on market development. But how do you stimulate the market for organic foods? This is the subject of many research projects concerning market, consumer preferences and the supply chain. These projects focus specifically at consumer purchasing behaviour, product development, supply chain formation and minimising cost price. As a rule, this research takes place in close cooperation with chain actors

  8. Planning construction of integrative schedule management for nuclear power project

    International Nuclear Information System (INIS)

    Zeng Zhenglin; Wang Wenying; Peng Fei

    2012-01-01

    This paper introduces the planning construction of integrative schedule management for Nuclear Power Project. It details schedule management system and the requirement of schedulers and the mode of three schedule management flats. And analysis it combing with the implementation of construction water and all special schedules before FCD to further propose the improving and researching direction for the integrative schedule management. (authors)

  9. A Formal Product-Line Engineering Approach for Schedulers

    NARCIS (Netherlands)

    Orhan, Güner; Aksit, Mehmet; Rensink, Arend; Jololian, Leon; Robbins, David E.; Fernandes, Steven L.

    2017-01-01

    Scheduling techniques have been applied to a large category of software systems, such as, processor scheduling in operating systems, car scheduling in elevator systems, facility scheduling at airports, antenna scheduling in radar systems, scheduling of events, control signals and data in

  10. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

    Satyanarayan, Arvind; Strazzulla, Daniel; Klokmose, Clemens Nylandsted

    2013-01-01

    CHI 2013 offers over 500 separate events including paper presentations, panels, courses, case studies and special interest groups. Given the size of the conference, it is no longer practical to host live summaries of these events. Instead, a 30-second Video Preview summary of each event is availa......CHI 2013 offers over 500 separate events including paper presentations, panels, courses, case studies and special interest groups. Given the size of the conference, it is no longer practical to host live summaries of these events. Instead, a 30-second Video Preview summary of each event...... is available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact...

  11. The ASDEX Upgrade discharge schedule

    International Nuclear Information System (INIS)

    Neu, G.; Engelhardt, K.; Raupp, G.; Treutterer, W.; Zasche, D.; Zehetbauer, T.

    2007-01-01

    ASDEX Upgrade's recently commissioned discharge control system (DCS) marks the transition from a traditional programmed system to a highly flexible 'data driven' one. The allocation of application processes (APs) to controllers, the interconnection of APs through uniquely named signals, and AP control parameter values are all defined as data, and can easily be adapted to the requirements of a particular discharge. The data is laid down in a set of XML documents which APs request via HTTP from a configuration server before a discharge. The use of XML allows for easy parsing, and structural validation through (XSD) schemas. The central input to the configuration process is the discharge schedule (DS), which embodies the dynamic behaviour of a planned discharge as reference trajectories grouped in segments, concatenated through transition conditions. Editing, generation and validation tools, and version control through CVS allow for efficient management of DSs

  12. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L E

    1992-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the US Department of Energy (DOE). This document contains the planned schedule for routine sample collection for the Surface Environmental Surveillance Project (SESP) and Ground-Water Monitoring Project. Samples for radiological analyses include Air-Particulate Filter, gases and vapor; Water/Columbia River, Onsite Pond, Spring, Irrigation, and Drinking; Foodstuffs/Animal Products including Whole Milk, Poultry and Eggs, and Beef; Foodstuffs/Produce including Leafy Vegetables, Vegetables, and Fruit; Foodstuffs/Farm Products including Wine, Wheat and Alfalfa; Wildlife; Soil; Vegetation; and Sediment. Direct Radiation Measurements include Terrestrial Locations, Columbia River Shoreline Locations, and Onsite Roadway, Railway and Aerial, Radiation Surveys.

  13. Planning and Scheduling of Airline Operations

    Directory of Open Access Journals (Sweden)

    İlkay ORHAN

    2010-02-01

    Full Text Available The Turkish Civil Aviation sector has grown at a rate of 53 % between the years 2002-2008 owing to countrywide economical developments and some removed restrictions in the aviation field. Successful international companies in the sector use advanced computer-supported solution methods for their planning and scheduling problems. These methods have been providing significant competitive advantages to those companies. There are four major scheduling and planning problems in the airline sector: flight scheduling, aircraft scheduling, crew scheduling and disruptions management. These aforementioned scheduling and planning problems faced by all airline companies in the airline sector were examined in detail. Studies reveal that companies using the advanced methods might gain significant cost reductions. However, even then, the time required for solving large scale problems may not satisfy the decision quality desired by decision makers. In such cases, using modern decision methods integrated with advanced technologies offer companies an opportunity for significant cost-advantages.

  14. Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Traian; Pop, Paul; Eles, Petru

    2005-01-01

    We present an approach to the analysis and optimization of heterogeneous distributed embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource......, they are organized in a hierarchy. In this paper, we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We present algorithms for solving these problems....... Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example....

  15. Escalonamento cooperativo interorganizacional Cooperative inter-organizational scheduling

    Directory of Open Access Journals (Sweden)

    Ricardo J. Rabelo

    2000-12-01

    Full Text Available Este trabalho tem como objetivo essencial apresentar uma abordagem para uma ágil coordenação e supervisão das ordens de produção da empresa, dando uma nova dimensão à atividade de "escalonamento" (scheduling, não apenas numa perspectiva intra-organizacional, mas também interorganizacional, contemplando toda a cadeia produtiva. Apresenta os fundamentos de um protótipo sendo desenvolvido, baseado nos paradigmas de negociação multiagente e de sistemas de suporte à decisão. Aspectos relacionados com a modelagem e integração da informação requerida nos vários níveis do CIM são abordados. Ao final, uma série de considerações são feitas, quer em relação aos resultados atingidos com o protótipo atual, quer para com as várias dificuldades - e desafios - existentes para a realização de um escalonamento cooperativo interorganizacional.This work aims at presenting an approach for agile scheduling coordination and supervision of distributed production orders, giving rise to a new dimension of the scheduling activity, not only under the intra-organizational perspective, but also the inter-organizational, comprising the whole productive chain. It generally presents a prototype being developed, based on the paradigms of multi-agent negotiation and decision support systems. Aspects related with the information modeling and integration in the several levels of CIM are tackled. At the end, a series of considerations is made, pointing out the results reached with the current prototype, and the several difficulties - and challenges - existent for the accomplishment of cooperative inter-organizational scheduling.

  16. Supply chain planning classification

    Science.gov (United States)

    Hvolby, Hans-Henrik; Trienekens, Jacques; Bonde, Hans

    2001-10-01

    Industry experience a need to shift in focus from internal production planning towards planning in the supply network. In this respect customer oriented thinking becomes almost a common good amongst companies in the supply network. An increase in the use of information technology is needed to enable companies to better tune their production planning with customers and suppliers. Information technology opportunities and supply chain planning systems facilitate companies to monitor and control their supplier network. In spite if these developments, most links in today's supply chains make individual plans, because the real demand information is not available throughout the chain. The current systems and processes of the supply chains are not designed to meet the requirements now placed upon them. For long term relationships with suppliers and customers, an integrated decision-making process is needed in order to obtain a satisfactory result for all parties. Especially when customized production and short lead-time is in focus. An effective value chain makes inventory available and visible among the value chain members, minimizes response time and optimizes total inventory value held throughout the chain. In this paper a supply chain planning classification grid is presented based current manufacturing classifications and supply chain planning initiatives.

  17. Data-centric concurrency control on the java programming language

    OpenAIRE

    Parreira, Daniel Luis Landeiroto

    2013-01-01

    Dissertação para obtenção do Grau de Mestre em Engenharia Informática The multi-core paradigm has propelled shared-memory concurrent programming to an important role in software development. Its use is however limited by the constructs that provide a layer of abstraction for synchronizing access to shared resources. Reasoning with these constructs is not trivial due to their concurrent nature. Data-races and deadlocks occur in concurrent programs, encumbering the programmer and furth...

  18. A Concurrent Distributed System for Aircraft Tactical Decision Generation

    Science.gov (United States)

    McManus, John W.

    1990-01-01

    A research program investigating the use of artificial intelligence (AI) techniques to aid in the development of a Tactical Decision Generator (TDG) for Within Visual Range (WVR) air combat engagements is discussed. The application of AI programming and problem solving methods in the development and implementation of a concurrent version of the Computerized Logic For Air-to-Air Warfare Simulations (CLAWS) program, a second generation TDG, is presented. Concurrent computing environments and programming approaches are discussed and the design and performance of a prototype concurrent TDG system are presented.

  19. CONCURRENT VALIDITY OF THE STUDENT TEACHER PROFESSIONAL IDENTITY SCALE

    Directory of Open Access Journals (Sweden)

    Predrag Živković

    2018-04-01

    Full Text Available The main purpose of study was to examine concurrent validity of the Student Teachers Professional Identity Scale–STPIS (Fisherman and Abbot, 1998 that was for the first time used in Serbia. Indicators of concurrent validity was established by correlation with student teacher self-reported well-being, self-esteem, burnout stress and resilience. Based on the results we can conclude that the STPIS meets the criterion of concurrent validity. The implications of these results are important for researchers and decisions makers in teacher education

  20. Computational simulation of concurrent engineering for aerospace propulsion systems

    Science.gov (United States)

    Chamis, C. C.; Singhal, S. N.

    1992-01-01

    Results are summarized of an investigation to assess the infrastructure available and the technology readiness in order to develop computational simulation methods/software for concurrent engineering. These results demonstrate that development of computational simulations methods for concurrent engineering is timely. Extensive infrastructure, in terms of multi-discipline simulation, component-specific simulation, system simulators, fabrication process simulation, and simulation of uncertainties - fundamental in developing such methods, is available. An approach is recommended which can be used to develop computational simulation methods for concurrent engineering for propulsion systems and systems in general. Benefits and facets needing early attention in the development are outlined.

  1. Computational simulation for concurrent engineering of aerospace propulsion systems

    Science.gov (United States)

    Chamis, C. C.; Singhal, S. N.

    1993-01-01

    Results are summarized for an investigation to assess the infrastructure available and the technology readiness in order to develop computational simulation methods/software for concurrent engineering. These results demonstrate that development of computational simulation methods for concurrent engineering is timely. Extensive infrastructure, in terms of multi-discipline simulation, component-specific simulation, system simulators, fabrication process simulation, and simulation of uncertainties--fundamental to develop such methods, is available. An approach is recommended which can be used to develop computational simulation methods for concurrent engineering of propulsion systems and systems in general. Benefits and issues needing early attention in the development are outlined.

  2. On Coding of Scheduling Information in OFDM

    OpenAIRE

    Gunnarsson, Fredrik; Moosavi, Reza; Eriksson, Jonas; Larsson, Erik G.; Wiberg, Niklas; Frenger, Pål

    2009-01-01

    Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The...

  3. Management of Temporal Constraints for Factory Scheduling.

    Science.gov (United States)

    1987-06-01

    consistency of scheduling decisions were implemented in both the ISIS [Fox 84] and SOJA [LePape 85a] scheduling systems. More recent work with the...kinds of time propagation systems: the symbolic and the numeric ones. Symbolic systems combine relationships with a temporal logic a la Allen [Allen 81...maintains consistency by narrowing time windows associated with activities as decisions are made, and SOJA [LePape 85b] guarantees a schedule’s

  4. Cost effective shift schedules enhance utility operations

    International Nuclear Information System (INIS)

    Coleman, R.M.

    1995-01-01

    This article describes how new shift scheduling concepts can save utility operations millions of dollars every year and yet maintain safety and improve employee morale. The key to scheduling is to define and match the work load. This includes discretionary as well as daily, weekly, and yearly core work loads. In most power plants the overall work load (including maintenance, operations, materials handling, etc.) on day shift is greater than on other shifts, hence an unbalanced schedule would be appropriate

  5. Trustable Virtual Machine Scheduling in a Cloud

    OpenAIRE

    Hermenier , Fabien; Henrio , Ludovic

    2017-01-01

    International audience; In an Infrastructure As A Service (IaaS) cloud, the scheduler deploys VMs to servers according to service level objectives (SLOs). Clients and service providers must both trust the infrastructure. In particular they must be sure that the VM scheduler takes decisions that are consistent with its advertised behaviour. The difficulties to master every theoretical and practical aspects of a VM scheduler implementation leads however to faulty behaviours that break SLOs and ...

  6. Flow shop scheduling with heterogeneous workers

    OpenAIRE

    Benavides, Alexander J.; Ritt, Marcus; Miralles Insa, Cristóbal Javier

    2014-01-01

    We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main objective is the labor integration of persons with disabilities, an important aim not only for these centers but for any company d...

  7. A hybrid job-shop scheduling system

    Science.gov (United States)

    Hellingrath, Bernd; Robbach, Peter; Bayat-Sarmadi, Fahid; Marx, Andreas

    1992-01-01

    The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop. Due to the existing requirements for a job-shop scheduling system the usage of flexible knowledge representation and processing techniques is necessary. Within this system the attempt was made to combine the advantages of symbolic AI-techniques with those of neural networks.

  8. LEARNING SCHEDULER PARAMETERS FOR ADAPTIVE PREEMPTION

    OpenAIRE

    Prakhar Ojha; Siddhartha R Thota; Vani M; Mohit P Tahilianni

    2015-01-01

    An operating system scheduler is expected to not allow processor stay idle if there is any process ready or waiting for its execution. This problem gains more importance as the numbers of processes always outnumber the processors by large margins. It is in this regard that schedulers are provided with the ability to preempt a running process, by following any scheduling algorithm, and give us an illusion of simultaneous running of several processes. A process which is allowed t...

  9. Spent nuclear fuel project integrated schedule plan

    International Nuclear Information System (INIS)

    Squires, K.G.

    1995-01-01

    The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel

  10. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

    The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel.

  11. Cloud Service Scheduling Algorithm Research and Optimization

    Directory of Open Access Journals (Sweden)

    Hongyan Cui

    2017-01-01

    Full Text Available We propose a cloud service scheduling model that is referred to as the Task Scheduling System (TSS. In the user module, the process time of each task is in accordance with a general distribution. In the task scheduling module, we take a weighted sum of makespan and flowtime as the objective function and use an Ant Colony Optimization (ACO and a Genetic Algorithm (GA to solve the problem of cloud task scheduling. Simulation results show that the convergence speed and output performance of our Genetic Algorithm-Chaos Ant Colony Optimization (GA-CACO are optimal.

  12. A customizable, scalable scheduling and reporting system.

    Science.gov (United States)

    Wood, Jody L; Whitman, Beverly J; Mackley, Lisa A; Armstrong, Robert; Shotto, Robert T

    2014-06-01

    Scheduling is essential for running a facility smoothly and for summarizing activities in use reports. The Penn State Hershey Clinical Simulation Center has developed a scheduling interface that uses off-the-shelf components, with customizations that adapt to each institution's data collection and reporting needs. The system is designed using programs within the Microsoft Office 2010 suite. Outlook provides the scheduling component, while the reporting is performed using Access or Excel. An account with a calendar is created for the main schedule, with separate resource accounts created for each room within the center. The Outlook appointment form's 2 default tabs are used, in addition to a customized third tab. The data are then copied from the calendar into either a database table or a spreadsheet, where the reports are generated.Incorporating this system into an institution-wide structure allows integration of personnel lists and potentially enables all users to check the schedule from their desktop. Outlook also has a Web-based application for viewing the basic schedule from outside the institution, although customized data cannot be accessed. The scheduling and reporting functions have been used for a year at the Penn State Hershey Clinical Simulation Center. The schedule has increased workflow efficiency, improved the quality of recorded information, and provided more accurate reporting. The Penn State Hershey Clinical Simulation Center's scheduling and reporting system can be adapted easily to most simulation centers and can expand and change to meet future growth with little or no expense to the center.

  13. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

    ...) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE NATIONAL SECURITY INDUSTRIAL BASE REGULATIONS DEFENSE PRIORITIES AND ALLOCATIONS SYSTEM Industrial Priorities § 700.14 Preferential scheduling. (a) A...

  14. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM...... and communicate. Scheduling on the detailed level, on the other hand, follows a stipulated approach to scheduling, i.e. the Last Planner System (LPS), which is characterized by involvement of all actors in the construction phase. Thus, the major challenge when implementing BIM-based scheduling is to improve...

  15. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique...... that will be used in this study. LBS is a scheduling method that rests upon the theories of line-of-balance and which uses the graphic representation of a flowline chart. As such, LBS is adapted for planning and management of workflows and, thus, may provide a solution to the identified shortcomings of CPM. Even...

  16. Overview of MPC applications in supply chains: Potential use and benefits in the management of forest-based supply chains

    Directory of Open Access Journals (Sweden)

    Tatiana M. Pinho

    2015-12-01

    Full Text Available Aim of study: This work aims to provide an overview of Model Predictive Controllers (MPC applications in supply chains, to describe the forest-based supply chain and to analyse the potential use and benefits of MPC in a case study concerning a biomass supply chain.Area of study: The proposed methods are being applied to a company located in Finland.Material and methods: Supply chains are complex systems where actions and partners’ coordination influence the whole system performance. The increase of competitiveness and need of quick responses to the costumers implies the use of efficient management techniques. The control theory, particularly MPC, has been successfully used as a supply chain management tool. MPC is able to deal with dynamic interactions between the partners and to globally optimize the supply chain performance in the presence of disturbances. However, as far as is authors’ knowledge, there are no applications of this methodology in the forest-based supply chains. This work proposes a control architecture to improve the performance of the forest supply chain. The controller is based on prediction models which are able to simulate the system and deal with disturbances.Main results: The preliminary results enable to evaluate the impacts of disturbances in the supply chain. Thus, it is possible to react beforehand, controlling the schedules and tasks’ allocation, or alert the planning level in order to generate a new plan.Research highlights:   Overview of MPC applications in supply chains; forest-based supply chain description; case study presentation: wood biomass supply chain for energy production; MPC architecture proposal to decrease the operation times.Keywords: biomass; forest; Model Predictive Control; planning; supply chain.

  17. Instructions, multiple schedules, and extinction: Distinguishing rule-governed from schedule-controlled behavior.

    Science.gov (United States)

    Hayes, S C; Brownstein, A J; Haas, J R; Greenway, D E

    1986-09-01

    Schedule sensitivity has usually been examined either through a multiple schedule or through changes in schedules after steady-state responding has been established. This study compared the effects of these two procedures when various instructions were given. Fifty-five college students responded in two 32-min sessions under a multiple fixed-ratio 18/differential-reinforcement-of-low-rate 6-s schedule, followed by one session of extinction. Some subjects received no instructions regarding the appropriate rates of responding, whereas others received instructions to respond slowly, rapidly, or both. Relative to the schedule in operation, the instructions were minimal, partially inaccurate, or accurate. When there was little schedule sensitivity in the multiple schedule, there was little in extinction. When apparently schedule-sensitive responding occurred in the multiple schedule, however, sensitivity in extinction occurred only if differential responding in the multiple schedule could not be due to rules supplied by the experimenter. This evidence shows that rule-governed behavior that occurs in the form of schedule-sensitive behavior may not in fact become schedule-sensitive even though it makes contact with the scheduled reinforcers.

  18. Supply Chain Management

    DEFF Research Database (Denmark)

    Wieland, Andreas; Handfield, Robert B.

    Supply chain management has made great strides in becoming a discipline with a standalone body of theories. As part of this evolution, researchers have sought to embed and integrate observed supply chain management phenomena into theoretical statements. In our review, we explore where we have been...

  19. Value Chain Engineering

    DEFF Research Database (Denmark)

    Wæhrens, Brian Vejrum; Slepniov, Dmitrij

    2015-01-01

    This workbook is recommended for the attention of students of and managers in Danish small and medium sized enterprises (SMEs). Danish SMEs are currently facing a number of key challenges related to their position in global value chains. This book provides an insight into value chain management t...

  20. Fields From Markov Chains

    DEFF Research Database (Denmark)

    Justesen, Jørn

    2005-01-01

    A simple construction of two-dimensional (2-D) fields is presented. Rows and columns are outcomes of the same Markov chain. The entropy can be calculated explicitly.......A simple construction of two-dimensional (2-D) fields is presented. Rows and columns are outcomes of the same Markov chain. The entropy can be calculated explicitly....

  1. A case for evaluating sensor network protocols concurrently

    KAUST Repository

    Gnawali, Omprakash; Guibas, Leonidas; Levis, Philip

    2010-01-01

    Researchers typically evaluate and compare protocols on the testbeds by running them one at a time. This methodology ignores the variation in link qualities and wireless environment across these experiments. These variations can introduce significant noise in the results. Evaluating two protocols concurrently, however, suffers from inter-protocol interactions. These interactions can perturb performance even under very light load, especially timing and timing sensitive protocols. We argue that the benefits of running protocols concurrently greatly outweigh the disadvantages. Protocols rarely run in isolation in real networks, and so considering such interactions is valuable. Although the wireless environment is still uncontrolled, concurrent evaluations make comparisons fair and more statistically sound. Through experiments on two testbeds, we make the case for evaluating and comparing low data-rate sensor network protocols by running them concurrently. Copyright 2010 ACM.

  2. Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks.

    Science.gov (United States)

    Onaga, Tomokatsu; Gleeson, James P; Masuda, Naoki

    2017-09-08

    Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

  3. Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks

    Science.gov (United States)

    Onaga, Tomokatsu; Gleeson, James P.; Masuda, Naoki

    2017-09-01

    Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

  4. A Concurrent Multiple Negotiation Protocol Based on Colored Petri Nets.

    Science.gov (United States)

    Niu, Lei; Ren, Fenghui; Zhang, Minjie; Bai, Quan

    2017-11-01

    Concurrent multiple negotiation (CMN) provides a mechanism for an agent to simultaneously conduct more than one negotiation. There may exist different interdependency relationships among these negotiations and these interdependency relationships can impact the outcomes of these negotiations. The outcomes of these concurrent negotiations contribute together for the agent to achieve an overall negotiation goal. Handling a CMN while considering interdependency relationships among multiple negotiations is a challenging research problem. This paper: 1) comprehensively highlights research problems of negotiations at concurrent negotiation level; 2) provides a graph-based CMN model with consideration of the interdependency relationships; and 3) proposes a colored Petri net-based negotiation protocol for conducting CMNs. With the proposed protocol, a CMN can be efficiently and concurrently processed and negotiation agreements can be efficiently achieved. Experimental results indicate the effectiveness and efficiency of the proposed protocol in terms of the negotiation success rate, the negotiation time and the negotiation outcome.

  5. Concurrent control system for the JAERI tandem accelerator

    International Nuclear Information System (INIS)

    Hanashima, Susumu; Shozi, Tokio; Shiozaki, Yasuo; Saito, Motoi; Oogane, Yasuo; Sekiguchi, Satoshi.

    1994-01-01

    A new control system for the JAERI tandem accelerator is constructed. The system utilizes concurrent processing technology with multiprocessor. Transputers are used both for central processor and I/O front end processors. (author)

  6. Love, lust and the emotional context of multiple and concurrent ...

    African Journals Online (AJOL)

    Love, lust and the emotional context of multiple and concurrent sexual partnerships among young Swazi adults. Allison Ruark, Lunga Dlamini, Nonhlanhla Mazibuko, Edward C Green, Caitlin Kennedy, Amy Nunn, Timothy Flanigan, Pamela J Surkan ...

  7. Partial Orders and Fully Abstract Models for Concurrency

    DEFF Research Database (Denmark)

    Engberg, Uffe Henrik

    1990-01-01

    In this thesis sets of labelled partial orders are employed as fundamental mathematical entities for modelling nondeterministic and concurrent processes thereby obtaining so-called noninterleaving semantics. Based on different closures of sets of labelled partial orders, simple algebraic language...

  8. Poverty and sexual concurrency: a case study of STI risk.

    Science.gov (United States)

    Tsui, Emma K; Leonard, Lori; Lenoir, Chavonne; Ellen, Jonathan M

    2008-08-01

    This paper is about sexual concurrency, or maintaining multiple sexual partnerships that overlap in time. Sexual concurrency is a concept that is used in the field of public health to explain the spread of sexually transmitted diseases. Sexual concurrency has also been proposed as a site of intervention to reduce sexually transmitted infection (STI) rates, particularly among those populations who carry the heaviest STI burden: adolescents and African Americans. In this paper, we use ethnographic data collected from a group of African American adolescents living in Baltimore to examine the socially produced configurations of risks and relationships that are obscured by the term sexual concurrency. The data we present show the limits of this concept, and suggest that structural reforms, including improvements to education, drug treatment, and work opportunities, are necessary to reduce racial disparities in STI rates.

  9. Prototyping of concurrent control systems implemented in FPGA devices

    CERN Document Server

    Wiśniewski, Remigiusz

    2017-01-01

    This book focuses on prototyping aspects of concurrent control systems and their further implementation and partial reconfiguration in programmable devices. Further, it lays out a full prototyping flow for concurrent control systems. Based on a given primary specification, a system is described with an interpreted Petri net, which naturally reflects the concurrent and sequential relationships of the design. The book shows that, apart from the traditional option of static configuration of the entire system, the latest programmable devices (especially FPGAs) offer far more sophistication. Partial reconfiguration allows selected parts of the system to be replaced without having to reprogram the entire structure of the device. Approaches to dynamic and static partial reconfiguration of concurrent control systems are presented and described in detail.< The theoretical work is illustrated by examples drawn from various applications, with a milling machine and a traffic-light controller highlighted as representat...

  10. Service-Oriented Synthesis of Distributed and Concurrent Protocol Specifications

    Directory of Open Access Journals (Sweden)

    Jehad Al Dallal

    2008-01-01

    Full Text Available Several methods have been proposed for synthesizing computer communication protocol specifications from service specifications. Some protocol synthesis methods based on the finite state machine (FSM model assume that primitives in the service specifications cannot be executed simultaneously. Others either handle only controlled primitive concurrency or have tight restrictions on the applicable FSM topologies. As a result, these synthesis methods are not applicable to an interesting variety of inherently concurrent applications, such as the Internet and mobile communication systems. This paper proposes a concurrent-based protocol synthesis method that eliminates the restrictions imposed by the earlier methods. The proposed method uses a synthesis method to obtain a sequential protocol specification (P-SPEC from a given service specification (S-SPEC. The resulting P-SPEC is then remodeled to consider the concurrency behavior specified in the S-SPEC, while guaranteeing that P-SPEC provides the specified service.

  11. Reliability and concurrent validity of an alternative method of lateral ...

    African Journals Online (AJOL)

    1 University of Northern Iowa, Division of Athletic Training, 003C Human. Performance Center, Cedar ... concurrent validity of the fingertip-to-floor distance test (FFD) ... in these protocols are spinal and extremity range of motion, pelvic control ...

  12. Reference Capabilities for Trait Based Reuse and Concurrency Control

    OpenAIRE

    Castegren, Elias; Wrigstad, Tobias

    2016-01-01

    The proliferation of shared mutable state in object-orientedprogramming complicates software development as two seeminglyunrelated operations may interact via an alias and produceunexpected results. In concurrent programming this manifestsitself as data-races. Concurrent object-oriented programming further suffers from thefact that code that warrants synchronisation cannot easily bedistinguished from code that does not. The burden is placed solelyon the programmer to reason about alias freedo...

  13. Concurrent object-oriented programming: The MP-Eiffel approach

    OpenAIRE

    Silva, Miguel Augusto Mendes Oliveira e

    2004-01-01

    This article evaluates several possible approaches for integrating concurrency into object-oriented programming languages, presenting afterwards, a new language named MP-Eiffel. MP-Eiffel was designed attempting to include all the essential properties of both concurrent and object-oriented programming with simplicity and safety. A special care was taken to achieve the orthogonality of all the language mechanisms, allowing their joint use without unsafe side-effects (such as inh...

  14. Time concurrency/phase-time synchronization in digital communications networks

    Science.gov (United States)

    Kihara, Masami; Imaoka, Atsushi

    1990-01-01

    Digital communications networks have the intrinsic capability of time synchronization which makes it possible for networks to supply time signals to some applications and services. A practical estimation method for the time concurrency on terrestrial networks is presented. By using this method, time concurrency capability of the Nippon Telegraph and Telephone Corporation (NTT) digital communications network is estimated to be better than 300 ns rms at an advanced level, and 20 ns rms at final level.

  15. Integrated supply chain risk management

    OpenAIRE

    Riaan Bredell; Jackie Walters

    2007-01-01

    Integrated supply chain risk management (ISCRM) has become indispensable to the theory and practice of supply chain management. The economic and political realities of the modern world require not only a different approach to supply chain management, but also bold steps to secure supply chain performance and sustainable wealth creation. Integrated supply chain risk management provides supply chain organisations with a level of insight into their supply chains yet to be achieved. If correctly ...

  16. Supply Chain Connectivity: Enhancing Participation in the Global Supply Chain

    OpenAIRE

    Patalinghug, Epictetus E.

    2015-01-01

    Supply chain connectivity is vital for the efficient flow of trade among APEC economies. This paper reviews the literature and supply chain management, describes the barriers to enhancing participation in global supply chain, analyzes the various measures of supply chain performance, and suggests steps for the Philippines to fully reap the benefits of the global value chain.

  17. An Automation-Assisted Empirical Study on Lock Usage for Concurrent Programs

    OpenAIRE

    Xin Rui; Qi Zhengwei; Huang Shiqiu; Xiang Chengcheng; Zheng Yudi; Wang Yin; Guan Haibing

    2013-01-01

    Nowadays concurrent programs are becoming more and more important with the development of hardware and network technologies. However it is not easy for programmers to write reliable concurrent programs. Concurrency characteristics such as thread interleaving make it difficult to debug or maintain concurrent programs. Although there are lots of research work on concurrency such as multi thread testing tools concurrent program verification and data race detection all of them leave open problems...

  18. Concurrent eruptions at Etna, Stromboli, and Vulcano: casualty or causality?

    Directory of Open Access Journals (Sweden)

    R. Funiciello

    2008-06-01

    Full Text Available Anecdotes of concurrent eruptions at Etna, Stromboli, and Vulcano (Southern Italy have persisted for more than 2000 years and volcanologists in recent and past times have hypothesized a causal link among these volcanoes. Here this hypothesis is tested. To introduce the problem and provide examples of the type of expected volcanic phenomena, narratives of the most notable examples of concurrent eruptions are provided. Then the frequency of eruptions at each individual volcano is analysed for about the last 300 years and the expected probability of concurrent eruptions is calculated to compare it to the observed probability. Results show that the occurrence of concurrent eruptions is often more frequent than a random probability, particularly for the Stromboli-Vulcano pair. These results are integrated with a statistical analysis of the earthquake catalogue to find evidence of linked seismicity in the Etnean and Aeolian areas. Results suggest a moderate incidence of non-random concurrent eruptions, but available data are temporally limited and do not allow an unequivocal identification of plausible triggers; our results, however, are the first attempt to quantify a more-than-2000-years-old curious observation and constitute a starting point for more sophisticated analyses of new data in the future. We look forward to our prediction of a moderate incidence of concurrent eruptions being confirmed or refuted with the passage of time and occurrence of new events.

  19. Risk factors for concurrent bacteremia in adult patients with dengue.

    Science.gov (United States)

    Thein, Tun-Linn; Ng, Ee-Ling; Yeang, Ming S; Leo, Yee-Sin; Lye, David C

    2017-06-01

    Bacteremia in dengue may occur with common exposure to pathogens in association with severe organ impairment or severe dengue, which may result in death. Cohort studies identifying risk factors for concurrent bacteremia among patients with dengue are rare. We conducted a retrospective case-control study of adult patients with dengue who were admitted to the Department of Infectious Diseases at Tan Tock Seng Hospital, Singapore from 2004 to 2008. For each case of dengue with concurrent bacteremia (within the first 72 hours of admission), we selected four controls without bacteremia, who were matched on year of infection and dengue confirmation method. Conditional logistic regression was performed to identify risk factors for concurrent bacteremia. Among 9,553 patients with dengue, 29 (0.3%) had bacteremia. Eighteen of these patients (62.1%) had concurrent bacteremia. The predominant bacteria were Staphylococcus aureus, one of which was a methicillin-resistant strain. Dengue shock syndrome occurred more frequently and hospital stay was longer among cases than among controls. Three cases did not survive, whereas none of the controls died. In multivariate analysis, being critically ill at hospital presentation was independently associated with 15 times the likelihood of a patient with dengue having concurrent bacteremia. Concurrent bacteremia in adult patients with dengue is uncommon but presents atypically and results in more deaths and longer hospital stay. Given the associated mortality, collection of blood cultures and empiric antibiotic therapy may be considered in patients who are critically ill. Copyright © 2015. Published by Elsevier B.V.

  20. Parallelization and scheduling of data intensive particle physics analysis jobs on clusters of PCs

    CERN Document Server

    Ponce, S

    2004-01-01

    Summary form only given. Scheduling policies are proposed for parallelizing data intensive particle physics analysis applications on computer clusters. Particle physics analysis jobs require the analysis of tens of thousands of particle collision events, each event requiring typically 200ms processing time and 600KB of data. Many jobs are launched concurrently by a large number of physicists. At a first view, particle physics jobs seem to be easy to parallelize, since particle collision events can be processed independently one from another. However, since large amounts of data need to be accessed, the real challenge resides in making an efficient use of the underlying computing resources. We propose several job parallelization and scheduling policies aiming at reducing job processing times and at increasing the sustainable load of a cluster server. Since particle collision events are usually reused by several jobs, cache based job splitting strategies considerably increase cluster utilization and reduce job ...

  1. 29 CFR 825.203 - Scheduling of intermittent or reduced schedule leave.

    Science.gov (United States)

    2010-07-01

    ... leave intermittently or on a reduced leave schedule for planned medical treatment, then the employee... 29 Labor 3 2010-07-01 2010-07-01 false Scheduling of intermittent or reduced schedule leave. 825... OF LABOR OTHER LAWS THE FAMILY AND MEDICAL LEAVE ACT OF 1993 Employee Leave Entitlements Under the...

  2. Designing cyclic appointment schedules for outpatient clinics with scheduled and unscheduled patient arrivals

    NARCIS (Netherlands)

    Kortbeek, Nikky; Zonderland, Maartje E.; Braaksma, Aleida; Vliegen, Ingrid M. H.; Boucherie, Richard J.; Litvak, Nelly; Hans, Erwin W.

    2014-01-01

    We present a methodology to design appointment systems for outpatient clinics and diagnostic facilities that offer both walk-in and scheduled service. The developed blueprint for the appointment schedule prescribes the number of appointments to plan per day and the moment on the day to schedule the

  3. Designing cyclic appointment schedules for outpatient clinics with scheduled and unscheduled patient arrivals

    NARCIS (Netherlands)

    Kortbeek, Nikky; Zonderland, Maartje Elisabeth; Boucherie, Richardus J.; Litvak, Nelli; Hans, Elias W.

    2011-01-01

    We present a methodology to design appointment systems for outpatient clinics and diagnostic facilities that offer both walk-in and scheduled service. The developed blueprint for the appointment schedule prescribes the number of appointments to plan per day and the moment on the day to schedule the

  4. Accelerating exact schedulability analysis for fixed-priority pre-emptive scheduling

    NARCIS (Netherlands)

    Hang, Y.; Jiale, Z.; Keskin, U.; Bril, R.J.

    2010-01-01

    The schedulability analysis for fixed-priority preemptive scheduling (FPPS) plays a significant role in the real-time systems domain. The so-called Hyperplanes Exact Test (HET) [1] is an example of an exact schedulability test for FPPS. In this paper, we aim at improving the efficiency of HET by

  5. Intensity modulated radiotherapy (IMRT) with concurrent chemotherapy as definitive treatment of locally advanced esophageal cancer

    International Nuclear Information System (INIS)

    Roeder, Falk; Nicolay, Nils H; Nguyen, Tam; Saleh-Ebrahimi, Ladan; Askoxylakis, Vasilis; Bostel, Tilman; Zwicker, Felix; Debus, Juergen; Timke, Carmen; Huber, Peter E

    2014-01-01

    To report our experience with increased dose intensity-modulated radiation and concurrent systemic chemotherapy as definitive treatment of locally advanced esophageal cancer. We analyzed 27 consecutive patients with histologically proven esophageal cancer, who were treated with increased-dose IMRT as part of their definitive therapy. The majority of patients had T3/4 and/or N1 disease (93%). Squamous cell carcinoma was the dominating histology (81%). IMRT was delivered in step-and-shoot technique in all patients using an integrated boost concept. The boost volume was covered with total doses of 56-60 Gy (single dose 2-2.14 Gy), while regional nodal regions received 50.4 Gy (single dose 1.8 Gy) in 28 fractions. Concurrent systemic therapy was scheduled in all patients and administered in 26 (96%). 17 patients received additional adjuvant systemic therapy. Loco-regional control, progression-free and overall survival as well as acute and late toxicities were retrospectively analyzed. In addition, quality of life was prospectively assessed according to the EORTC QLQs (QLQ-OG25, QLQ-H&N35 and QLQ-C30). Radiotherapy was completed as planned in all but one patient (96%), and 21 patients received more than 80% of the planned concurrent systemic therapy. We observed ten locoregional failures, transferring into actuarial 1-, 2- and 3-year-locoregional control rates of 77%, 65% and 48%. Seven patients developed distant metastases, mainly to the lung (71%). The actuarial 1-, 2- and 3-year-disease free survival rates were 58%, 48% and 36%, and overall survival rates were 82%, 61% and 56%. The concept was well tolerated, both in the clinical objective examination and also according to the subjective answers to the QLQ questionnaire. 14 patients (52%) suffered from at least one acute CTC grade 3/4 toxicity, mostly hematological side effects or dysphagia. Severe late toxicities were reported in 6 patients (22%), mostly esophageal strictures and ulcerations. Severe side effects to

  6. A dynamic approach to vehicle scheduling

    NARCIS (Netherlands)

    D. Huisman (Dennis); R. Freling (Richard); A.P.M. Wagelmans (Albert)

    2001-01-01

    textabstractThis paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our

  7. State Teacher Salary Schedules. Policy Analysis

    Science.gov (United States)

    Griffith, Michael

    2016-01-01

    In the United States most teacher compensation issues are decided at the school district level. However, a group of states have chosen to play a role in teacher pay decisions by instituting statewide teacher salary schedules. Education Commission of the States has found that 17 states currently make use of teacher salary schedules. This education…

  8. Evolutionary Scheduler for the Deep Space Network

    Science.gov (United States)

    Guillaume, Alexandre; Lee, Seungwon; Wang, Yeou-Fang; Zheng, Hua; Chau, Savio; Tung, Yu-Wen; Terrile, Richard J.; Hovden, Robert

    2010-01-01

    A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.

  9. Decay-usage scheduling in multiprocessors

    NARCIS (Netherlands)

    Epema, D.H.J.

    1998-01-01

    Decay-usage scheduling is a priority-aging time-sharing scheduling policy capable of dealing with a workload of both interactive and batch jobs by decreasing the priority of a job when it acquires CPU time, and by increasing its priority when it does not use the (a) CPU. In this article we deal with

  10. 5 CFR 950.801 - Campaign schedule.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Campaign schedule. 950.801 Section 950... VOLUNTARY ORGANIZATIONS CFC Timetable § 950.801 Campaign schedule. (a) The Combined Federal Campaign will be.../International and International parts of the Charity List to all local campaigns by a date to be determined by...

  11. 46 CFR 525.2 - Terminal schedules.

    Science.gov (United States)

    2010-10-01

    ... domestic law and international conventions and agreements adopted by the United States; such terminal... their own negligence, or that impose upon others the obligation to indemnify or hold-harmless the terminals from liability for their own negligence. (2) Enforcement of terminal schedules. Any schedule that...

  12. 21 CFR 1308.13 - Schedule III.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 9 2010-04-01 2010-04-01 false Schedule III. 1308.13 Section 1308.13 Food and... opposite it. (b) Stimulants. Unless specifically excepted or unless listed in another schedule, any... a stimulant effect on the central nervous sxstem, including its salts, isomers (whether optical...

  13. Management Matters. Changing to Flexible Scheduling

    Science.gov (United States)

    Pappas, Marjorie L.

    2005-01-01

    Elementary school library media specialists state that one of the most frustrating issues they face is the fixed schedules in their library media centers. Beyond the cost effectiveness issue, the fixed schedule severely limits using the resources of the library media center for inquiry learning and collaborative teaching experiences between the…

  14. Agent-based scheduling for aircraft deicing

    NARCIS (Netherlands)

    Mao, X.; Ter Mors, A.W.; Roos, N.; Witteveen, C.

    2006-01-01

    The planning and scheduling of the deicing and anti-icing activities is an important and challenging part of airport departure planning. Deicing planning has to be done in a highly dynamic environment involving several autonomous and self-interested parties. Traditional centralized scheduling

  15. Robust scheduling in an uncertain environment

    NARCIS (Netherlands)

    Wilson, M.

    2016-01-01

    This thesis presents research on scheduling in an uncertain environment, which forms a part of the rolling stock life cycle logistics applied research and development program funded by Dutch railway industry companies. The focus therefore lies on scheduling of maintenance operations on rolling stock

  16. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction and Schedule After nearly seven months of concentrated effort, the installation of services on YB0 moved off the CMS critical path in late November. In line with v36 planning provisions, the additional time needed to finish this challeng¬ing task was accommodated by reducing sequential dependencies between assembly tasks, putting more tasks (especially heavy logistic movements) in parallel with activities on, or within, the central wheel. Thus the lowering of wheels YB-1 and YB -2 and of disk YE-3 is already complete, the latter made possible, in the shadow of YB0 work, by inverting the order of the 3 endcap disks in the surface building. Weather conditions permitting, the Tracker will be transported to point 5 during CMS week for insertion in EB before CERN closes. The lowering of the last two disks will take place mid- and end-of January, respectively. Thus central beampipe installation can be confidently planned to start in February as foreseen, allowing closure of CMS in time for CRA...

  17. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Despite the holiday season affecting available manpower, many key internal milestones have been passed over the summer, thanks to the dedication and commitment of the team at point 5. In particular, the installation on, and within, YB0 has progressed steadily through several potentially difficult phases. The v36 planning contingency of lowering YB-1 and YB-1 wheels on schedule in October, before Tracker installation, will be executed in order to give more time to complete YB0 services work, whilst still being consistent with completion of heavy lowering by the end of 2007. Safety In the underground areas the peak level of activity and parallel work has been reached and this will continue for the coming months. Utmost vigilance is required of everybody working underground and this must be maintained. However, it is encouraging to note that the compliance with safety rules is, in general, good. More and more work will be carried out from scaffolding and mobile access platforms. (cherry-picke...

  18. Scheduling mammograms for asymptomatic women

    International Nuclear Information System (INIS)

    Gohagan, J.K.; Darby, W.P.; Spitznagel, E.L.; Tome, A.E.

    1988-01-01

    A decision theoretic model was used to investigate the relative importance of risk level, radiation hazard, mammographic accuracy, and cost in mammographic screening decision. The model uses woman-specific medical and family history facts and clinic-specific information regarding mammographic accuracy and practice to profile both woman and clinic, and to formulate periodic screening recommendations. Model parameters were varied extensively to investigate the sensitivity of screening schedules to input values. Multivariate risk was estimated within the program using published data from the Breast Cancer Detection Demonstration Project 5-year follow-up study. Radiation hazard estimates were developed from published radiation physics and radioepidemiologic risk data. Benchmark values for mammographic sensitivity and specificity under screening conditions were calculated from Breast Cancer Detection Demonstration Project data. Procedural costs used in the analysis were varied around values reflecting conditions at the Washington University Medical Center. Mortality advantages of early versus late breast cancer detection were accounted for using Health Insurance Plan of New York case survival rates. Results are compared with published screening policies to provide insight into implicit assumptions behind those policies. This analysis emphasizes the importance of accounting for variations in clinical accuracy under screening circumstances, in costs, in radiation exposure, and in woman-specific risk when recommending mammographic screening

  19. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Since the lowering of YB0 in February, less spectacular but nonetheless crucial progress has been made along the critical path to CMS completion. The YB0 has been aligned with the beamline to a fraction of a mm, and the HCAL has been fully installed. Cabling scaffolding for YB0 services has been built and one half (-z end) of the ECAL barrel has been installed. The YB0 services installation has begun, with two of the major technical challenges delaying bulk installation, namely PP1 detailed design, manufacture and installation plus Tracker cooling pipe insulation, now apparently solved. Significant difficulties in detailed design, integration and procurement of cable ducts remain. Despite this, the design of the +end is close to complete, and Tracker power cable installation on two sectors of the +end is well advanced. A new master schedule, v36.0, is being prepared to account for the updated actual situation at point 5 and for the revised LHC machine planning. Safety The enormous amount of...

  20. Scheduling nursing personnel on a microcomputer.

    Science.gov (United States)

    Liao, C J; Kao, C Y

    1997-01-01

    Suggests that with the shortage of nursing personnel, hospital administrators have to pay more attention to the needs of nurses to retain and recruit them. Also asserts that improving nurses' schedules is one of the most economic ways for the hospital administration to create a better working environment for nurses. Develops an algorithm for scheduling nursing personnel. Contrary to the current hospital approach, which schedules nurses on a person-by-person basis, the proposed algorithm constructs schedules on a day-by-day basis. The algorithm has inherent flexibility in handling a variety of possible constraints and goals, similar to other non-cyclical approaches. But, unlike most other non-cyclical approaches, it can also generate a quality schedule in a short time on a microcomputer. The algorithm was coded in C language and run on a microcomputer. The developed software is currently implemented at a leading hospital in Taiwan. The response to the initial implementation is quite promising.

  1. NASA Instrument Cost/Schedule Model

    Science.gov (United States)

    Habib-Agahi, Hamid; Mrozinski, Joe; Fox, George

    2011-01-01

    NASA's Office of Independent Program and Cost Evaluation (IPCE) has established a number of initiatives to improve its cost and schedule estimating capabilities. 12One of these initiatives has resulted in the JPL developed NASA Instrument Cost Model. NICM is a cost and schedule estimator that contains: A system level cost estimation tool; a subsystem level cost estimation tool; a database of cost and technical parameters of over 140 previously flown remote sensing and in-situ instruments; a schedule estimator; a set of rules to estimate cost and schedule by life cycle phases (B/C/D); and a novel tool for developing joint probability distributions for cost and schedule risk (Joint Confidence Level (JCL)). This paper describes the development and use of NICM, including the data normalization processes, data mining methods (cluster analysis, principal components analysis, regression analysis and bootstrap cross validation), the estimating equations themselves and a demonstration of the NICM tool suite.

  2. Understanding the supply chain

    Directory of Open Access Journals (Sweden)

    Aćimović Slobodan

    2006-01-01

    Full Text Available Supply chain management represents new business philosophy and includes strategically positioned and much wider scope of activity in comparison with its "older brother" - management of logistics. Philosophy of the concept of supply chain is directed to more coordination of key business functions of every link in distribution chain in the process of organization of the flow of both goods and information, while logistic managing instruments are focused on internal optimum of flows of goods and information within one company. Applying the concept of integrated supply chain among several companies makes the importance of operative logistics activity even greater on the level of one company, thus advancing processes of optimum and coordination within and between different companies and confirms the importance of logistics performances for the company’s profitability. Besides the fact that the borders between companies are being deleted, this concept of supply chain in one distribution channel influences increasing of importance of functional, i.e. traditional business managing approaches but instead it points out the importance of process managing approaches. Although the author is aware that "there is nothing harder, more dangerous and with uncertain success, but to find a way for introducing some novelties (Machiavelli, it would be even his additional stimulation for trying to bring closer the concept and goals of supply chain implementation that are identified in key, relevant, modern, theoretical and consulting approaches in order to achieve better understanding of the subject and faster implementation of the concept of supply chain management by domestic companies.

  3. Routine environmental monitoring schedule, calendar year 1997

    Energy Technology Data Exchange (ETDEWEB)

    Markes, B.M., Westinghouse Hanford

    1996-12-10

    This document provides the Environmental Restorations Contractor (ERC) and the Project Hanford Management Contractor.(PHMC) a schedule in accordance with the WHC-CM-7-5, Environmental Compliance` and BHI- EE-02, Environmental Requirements, of monitoring and sampling routines for the Near-Field Monitoring (NFM) program during calendar year (CY) 1997. Every attempt will be made to consistently follow this schedule; any deviation from this schedule will be documented by an internal memorandum (DSI) explaining the reason for the deviation. The DSI will be issued by the scheduled performing organization and directed to Near-Field Monitoring. The survey frequencies for particular sites are determined by the technical judgment of Near- Field Monitoring and may depend on the site history, radiological status, use, and general conditions. Additional surveys may be requested at irregular frequencies if conditions warrant. All radioactive wastes sites are scheduled to be surveyed at least annually. Any newly discovered wastes sites not documented by this schedule will be included in the revised schedule for CY 1998. The outside perimeter road surveys of 200 East and West Area and the rail survey from the 300 Area to Columbia Center will be performed in the year 2000 per agreement with Department of Energy. Richland Field Office. This schedule does not discuss staffing needs, nor does it list the monitoring equipment to be used in completing specific routines. Personnel performing routines to meet this schedule shall communicate any need for assistance in completing these routines to Radiological Control management and Near-Field Monitoring. After each routine survey is completed, a copy of the survey record, maps, and data sheets will be forwarded to Near-Field Monitoring. These routine surveys will not be considered complete until this documentation is received. At the end of each month, the ERC and PHMC radiological control organizations shall forward a copy of the Routine

  4. Solving a mathematical model integrating unequal-area facilities layout and part scheduling in a cellular manufacturing system by a genetic algorithm.

    Science.gov (United States)

    Ebrahimi, Ahmad; Kia, Reza; Komijan, Alireza Rashidi

    2016-01-01

    In this article, a novel integrated mixed-integer nonlinear programming model is presented for designing a cellular manufacturing system (CMS) considering machine layout and part scheduling problems simultaneously as interrelated decisions. The integrated CMS model is formulated to incorporate several design features including part due date, material handling time, operation sequence, processing time, an intra-cell layout of unequal-area facilities, and part scheduling. The objective function is to minimize makespan, tardiness penalties, and material handling costs of inter-cell and intra-cell movements. Two numerical examples are solved by the Lingo software to illustrate the results obtained by the incorporated features. In order to assess the effects and importance of integration of machine layout and part scheduling in designing a CMS, two approaches, sequentially and concurrent are investigated and the improvement resulted from a concurrent approach is revealed. Also, due to the NP-hardness of the integrated model, an efficient genetic algorithm is designed. As a consequence, computational results of this study indicate that the best solutions found by GA are better than the solutions found by B&B in much less time for both sequential and concurrent approaches. Moreover, the comparisons between the objective function values (OFVs) obtained by sequential and concurrent approaches demonstrate that the OFV improvement is averagely around 17 % by GA and 14 % by B&B.

  5. Plastic value chains

    DEFF Research Database (Denmark)

    Baxter, John; Wahlstrom, Margareta; Zu Castell-Rüdenhausen, Malin

    2014-01-01

    Optimizing plastic value chains is regarded as an important measure in order to increase recycling of plastics in an efficient way. This can also lead to improved awareness of the hazardous substances contained in plastic waste, and how to avoid that these substances are recycled. As an example......, plastics from WEEE is chosen as a Nordic case study. The project aims to propose a number of improvements for this value chain together with representatives from Nordic stakeholders. Based on the experiences made, a guide for other plastic value chains shall be developed....

  6. Project Decision Chain

    DEFF Research Database (Denmark)

    Rolstadås, Asbjørn; Pinto, Jeffrey K.; Falster, Peter

    2015-01-01

    To add value to project performance and help obtain project success, a new framework for decision making in projects is defined. It introduces the project decision chain inspired by the supply chain thinking in the manufacturing sector and uses three types of decisions: authorization, selection......, and plan decision. A primitive decision element is defined where all the three decision types can be accommodated. Each task in the primitive element can in itself contain subtasks that in turn will comprise new primitive elements. The primitive elements are nested together in a project decision chain....

  7. Optimal treatment scheduling of ionizing radiation and sunitinib improves the antitumor activity and allows dose reduction

    International Nuclear Information System (INIS)

    Kleibeuker, Esther A; Hooven, Matthijs A ten; Castricum, Kitty C; Honeywell, Richard; Griffioen, Arjan W; Verheul, Henk M; Slotman, Ben J; Thijssen, Victor L

    2015-01-01

    The combination of radiotherapy with sunitinib is clinically hampered by rare but severe side effects and varying results with respect to clinical benefit. We studied different scheduling regimes and dose reduction in sunitinib and radiotherapy in preclinical tumor models to improve potential outcome of this combination treatment strategy. The chicken chorioallantoic membrane (CAM) was used as an angiogenesis in vivo model and as a xenograft model with human tumor cells (HT29 colorectal adenocarcinoma, OE19 esophageal adenocarcinoma). Treatment consisted of ionizing radiation (IR) and sunitinib as single therapy or in combination, using different dose-scheduling regimes. Sunitinib potentiated the inhibitory effect of IR (4 Gy) on angiogenesis. In addition, IR (4 Gy) and sunitinib (4 days of 32.5 mg/kg per day) inhibited tumor growth. Ionizing radiation induced tumor cell apoptosis and reduced proliferation, whereas sunitinib decreased tumor angiogenesis and reduced tumor cell proliferation. When IR was applied before sunitinib, this almost completely inhibited tumor growth, whereas concurrent IR was less effective and IR after sunitinib had no additional effect on tumor growth. Moreover, optimal scheduling allowed a 50% dose reduction in sunitinib while maintaining comparable antitumor effects. This study shows that the therapeutic efficacy of combination therapy improves when proper dose-scheduling is applied. More importantly, optimal treatment regimes permit dose reductions in the angiogenesis inhibitor, which will likely reduce the side effects of combination therapy in the clinical setting. Our study provides important leads to optimize combination treatment in the clinical setting

  8. Brain and lung cryptococcoma and concurrent corynebacterium pseudotuberculosis infection in a goat: a case report

    Directory of Open Access Journals (Sweden)

    MCR Luvizotto

    2009-01-01

    Full Text Available A four-year-old male goat with a history of neurological disorder was euthanized. It presented uncommon nodules in the brain and lungs associated with multiple abscesses, predominantly in the spleen and liver. Histological examination of brain and lung sections revealed yeast forms confirmed to be Cryptococcus gattii after a combination of isolation and polymerase chain reaction (PCR procedures. Moreover, Corynebacterium pseudotuberculosis infection was diagnosed by PCR of samples from the lung, spleen and liver. The present report highlights the rare concurrent infection of C. gatti and C. pseudotuberculosis in an adult goat from São Paulo state, Brazil, and indicates the necessity of surveillance in the treatment of goats with atypical pulmonary infections associated with neurological disorders.

  9. Concurrent peste des petits ruminants virus and pestivirus infection in stillborn twin lambs.

    Science.gov (United States)

    Kul, O; Kabakci, N; Ozkul, A; Kalender, H; Atmaca, H T

    2008-03-01

    Concurrent infection with peste des petits ruminants virus (PPRV) and pestivirus was diagnosed in stillborn twin lambs. With the flock history, the findings of epidermal syncytial cells and necrotizing bronchitis/bronchiolitis prompted testing for PPRV infection, and PPRV antigen was detected by immunohistochemistry (IHC) in the skin, lungs, kidneys, rumen, and thymus. Macroscopic anomalies that were typical of border disease included scoliosis, brachygnathism, prognathism, arthrogryposis, hydranencephaly, cerebellar hypoplasia, and hairy fleece; pestiviral antigen was detected by IHC in the brain, liver, lungs, and kidneys. Tissues from both lambs were positive by reverse transcriptase-polymerase chain reaction (RT-PCR) for PPRV and pestivirus. To the authors' knowledge, PPR has not been reported previously as a congenital infection or in combination with pestiviral infection.

  10. The construction of an idealised urban masculinity among men with concurrent sexual partners in a South African township

    Directory of Open Access Journals (Sweden)

    Anna Mia Ekström

    2010-07-01

    Full Text Available Background : The perspectives of heterosexual males who have large sexual networks comprising concurrent sexual partners and who engage in high-risk sexual behaviours are scarcely documented. Yet these perspectives are crucial to understanding the high HIV prevalence in South Africa where domestic violence, sexual assault and rape are alarmingly high, suggesting problematic gender dynamics. Objective : To explore the construction of masculinities and men's perceptions of women and their sexual relationships, among men with large sexual networks and concurrent partners. Design : This qualitative study was conducted in conjunction with a larger quantitative survey among men at high risk of HIV, using respondent-driven sampling to recruit participants, where long referral chains allowed us to reach far into social networks. Twenty in-depth, open-ended interviews with South African men who had multiple and concurrent sexual partners were conducted. A latent content analysis was used to explore the characteristics and dynamics of social and sexual relationships. Results : We found dominant masculine ideals characterised by overt economic power and multiple sexual partners. Reasons for large concurrent sexual networks were the perception that women were too empowered, could not be trusted, and lack of control over women. Existing masculine norms encourage concurrent sexual networks, ignoring the high risk of HIV transmission. Biological explanations and determinism further reinforced strong and negative perceptions of women and female sexuality, which helped polarise men's interpretation of gender constructions. Conclusions : Our results highlight the need to address sexuality and gender dynamics among men in growing, informal urban areas where HIV prevalence is strikingly high. Traditional structures that could work as focal entry points should be explored for effective HIV prevention aimed at normative change among hard-to-reach men in high

  11. Planning and scheduling for maritime container yards supporting and facilitating the global supply network

    CERN Document Server

    Li, Wenkai; Goh, Mark

    2015-01-01

    Maximizing reader insights into the challenges facing maritime supply chains and container port logistics service providers in Asia, this book highlights their innovative responses to these challenges through real-world case studies. With a focus on mathematical modeling, simulation and heuristics approaches, this book provides academics, engineers, container terminal operators, students in logistics and supply chain management with the latest approaches that can be used to address the planning and scheduling problem in large container terminal yards. This book can be used on a self-contained basis as teaching cases in an undergraduate or specialist class setting, or on techniques applied to maritime container operations for port operations.

  12. The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems

    Science.gov (United States)

    Paprocka, I.; Kempa, W. M.; Grabowik, C.; Kalinowski, K.; Krenczyk, D.

    2016-08-01

    In the paper a survey of predictive and reactive scheduling methods is done in order to evaluate how the ability of prediction of reliability characteristics influences over robustness criteria. The most important reliability characteristics are: Mean Time to Failure, Mean Time of Repair. Survey analysis is done for a job shop scheduling problem. The paper answers the question: what method generates robust schedules in the case of a bottleneck failure occurrence before, at the beginning of planned maintenance actions or after planned maintenance actions? Efficiency of predictive schedules is evaluated using criteria: makespan, total tardiness, flow time, idle time. Efficiency of reactive schedules is evaluated using: solution robustness criterion and quality robustness criterion. This paper is the continuation of the research conducted in the paper [1], where the survey of predictive and reactive scheduling methods is done only for small size scheduling problems.

  13. 8th Workshop on Logistics and Supply Chain Management

    CERN Document Server

    Kaminsky, Phil; Müller, Thomas

    2015-01-01

    This contributed volume presents selected research papers from the 8th workshop on Logistics and Supply Chain Management, which was held in October 2013 in Berkeley, California. It focuses on the topical issue of quantitative approaches in logistics and supply chain management, mainly covering facility location and location routing; vehicle routing and scheduling; courier, express and parcel service network design; healthcare logistics as well as logistics risk management. The target audience primarily comprises research experts and practitioners in the field, but the book will also be beneficial to graduate students.

  14. Editorial: Supply Chain Management

    Directory of Open Access Journals (Sweden)

    Aidonis, D.

    2012-01-01

    Full Text Available This special issue has followed up the 2nd Olympus International Conference on Supply Chains held on October 5-6, 2012, in Katerini, Greece. The Conference was organized by the Department of Logistics of Alexander Technological Educational Institution (ATEI of Thessaloniki, in collaboration with the Laboratory of Quantitative Analysis, Logistics and Supply Chain Management of the Department of Mechanical Engineering, Aristotle University of Thessaloniki (AUTH. During the 2-Days Conference more than 50 research papers were presented covering the following thematic areas: (i Business Logistics, (ii Transportation, Telematics and Distribution Networks, (iii Green Logistics, (iv Information and Communication Technologies in Supply Chain Management, and (v Services and Quality. Three keynote invited speakers addressed interesting issues for the Humanitarian Logistics, Green Supply Chains of the Agrifood Sector and the Opportunities and Prospects of Greek Ports chaired Round Tables with other Greek and Foreign Scientists and Specialists.

  15. Characterizing Oregon's supply chains.

    Science.gov (United States)

    2013-03-01

    In many regions throughout the world, freight models are used to aid infrastructure investment and : policy decisions. Since freight is such an integral part of efficient supply chains, more realistic : transportation models can be of greater assista...

  16. Moldova - Value Chain Training

    Data.gov (United States)

    Millennium Challenge Corporation — The evaluation of the GHS value chain training subactivity wwas designed to measure the extent, if any, to which the training activities improved the productivity...

  17. Quantitative Methods in Supply Chain Management Models and Algorithms

    CERN Document Server

    Christou, Ioannis T

    2012-01-01

    Quantitative Methods in Supply Chain Management presents some of the most important methods and tools available for modeling and solving problems arising in the context of supply chain management. In the context of this book, “solving problems” usually means designing efficient algorithms for obtaining high-quality solutions. The first chapter is an extensive optimization review covering continuous unconstrained and constrained linear and nonlinear optimization algorithms, as well as dynamic programming and discrete optimization exact methods and heuristics. The second chapter presents time-series forecasting methods together with prediction market techniques for demand forecasting of new products and services. The third chapter details models and algorithms for planning and scheduling with an emphasis on production planning and personnel scheduling. The fourth chapter presents deterministic and stochastic models for inventory control with a detailed analysis on periodic review systems and algorithmic dev...

  18. Clinch River Breeder Reactor Plant Project: construction schedule

    International Nuclear Information System (INIS)

    Purcell, W.J.; Martin, E.M.; Shivley, J.M.

    1982-01-01

    The construction schedule for the Clinch River Breeder Reactor Plant and its evolution are described. The initial schedule basis, changes necessitated by the evaluation of the overall plant design, and constructability improvements that have been effected to assure adherence to the schedule are presented. The schedule structure and hierarchy are discussed, as are tools used to define, develop, and evaluate the schedule

  19. Innovation Across the Supply Chain

    DEFF Research Database (Denmark)

    Druehl, Cheryl; Carrillo, Janice; Hsuan, Juliana

    Innovation is an integral part of every firm’s ongoing operations. Beyond product innovation, supply chain innovations offer a unique source of competitive advantage. We synthesize recent research on innovation in the supply chain, specifically, innovative supply chain processes...

  20. NRC comprehensive records disposition schedule. Revision 3

    International Nuclear Information System (INIS)

    1998-02-01

    Title 44 US Code, ''Public Printing and Documents,'' regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ''Management and Use of Information and Records,'' and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA's General Records Schedule (dated August 1995)

  1. Schedule-Aware Workflow Management Systems

    Science.gov (United States)

    Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.

    Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.

  2. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

    MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.

  3. Scheduling multimedia services in cloud computing environment

    Science.gov (United States)

    Liu, Yunchang; Li, Chunlin; Luo, Youlong; Shao, Yanling; Zhang, Jing

    2018-02-01

    Currently, security is a critical factor for multimedia services running in the cloud computing environment. As an effective mechanism, trust can improve security level and mitigate attacks within cloud computing environments. Unfortunately, existing scheduling strategy for multimedia service in the cloud computing environment do not integrate trust mechanism when making scheduling decisions. In this paper, we propose a scheduling scheme for multimedia services in multi clouds. At first, a novel scheduling architecture is presented. Then, We build a trust model including both subjective trust and objective trust to evaluate the trust degree of multimedia service providers. By employing Bayesian theory, the subjective trust degree between multimedia service providers and users is obtained. According to the attributes of QoS, the objective trust degree of multimedia service providers is calculated. Finally, a scheduling algorithm integrating trust of entities is proposed by considering the deadline, cost and trust requirements of multimedia services. The scheduling algorithm heuristically hunts for reasonable resource allocations and satisfies the requirement of trust and meets deadlines for the multimedia services. Detailed simulated experiments demonstrate the effectiveness and feasibility of the proposed trust scheduling scheme.

  4. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    Directory of Open Access Journals (Sweden)

    Ladislav Rosocha

    2015-07-01

    Full Text Available Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem.Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a well-known method from statistical thermodynamics. We define hard constraints, which are linked to legal and working regulations, and minimize the violations of soft constraints, which are related to the quality of work, psychic, and work-life balance of staff.Findings: On a sample of 60 physicians and nurses from gynecology department we generated monthly schedules and optimized their preferences in terms of soft constraints. Our results indicate that the final value of objective function optimized by proposed algorithm is more than 18-times better in violations of soft constraints than initially generated random schedule that satisfied hard constraints.Research Limitation/implication: Even though the global optimality of final outcome is not guaranteed, desirable solutionwas obtained in reasonable time. Originality/Value of paper: We show that designed algorithm is able to successfully generate schedules regarding hard and soft constraints. Moreover, presented method is significantly faster than standard schedule generation and is able to effectively reschedule due to the local neighborhood search characteristics of simulated annealing.

  5. Scheduling nurses’ shifts at PGI Cikini Hospital

    Science.gov (United States)

    Nainggolan, J. C. T.; Kusumastuti, R. D.

    2018-03-01

    Hospitals play an essential role in the community by providing medical services to the public. In order to provide high quality medical services, hospitals must manage their resources (including nurses) effectively and efficiently. Scheduling of nurses’ work shifts, in particular, is crucial, and must be conducted carefully to ensure availability and fairness. This research discusses the job scheduling system for nurses in PGI Cikini Hospital, Jakarta with Goal Programming approach. The research objectives are to identify nurse scheduling criteria and find the best schedule that can meet the criteria. The model has hospital regulations (including government regulations) as hard constraints, and nurses’ preferences as soft constraints. We gather primary data (hospital regulations and nurses’ preferences) through interviews with three Head Nurses and distributing questionnaires to fifty nurses. The results show that on the best schedule, all hard constraints can be satisfied. However, only two out of four soft constraints are satisfied. Compared to current scheduling practice, the resulting schedule ensures the availability of nurses as it satisfies all hospital’s regulations and it has a higher level of fairness as it can accommodate some of the nurses’ preferences.

  6. PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

    International Nuclear Information System (INIS)

    Morgan, D.L.; Srite, B.E.

    1986-01-01

    1 - Description of problem or function: PROMSYS is a computer system designed to automate the scheduling of routine maintenance and inspection of plant equipment. This 'programmed maintenance' provides the detailed planning and accomplishment of lubrication, inspection, and similar repetitive maintenance activities which can be scheduled at specified predetermined intervals throughout the year. The equipment items included are the typical pumps, blowers, motors, compressors, automotive equipment, refrigeration units, filtering systems, machine shop equipment, cranes, elevators, motor-generator sets, and electrical switchgear found throughout industry, as well as cell ventilation, shielding, containment, and material handling equipment unique to nuclear research and development facilities. Four related programs are used to produce sorted schedule lists, delinquent work lists, and optional master lists. Five additional programs are used to create and maintain records of all scheduled and unscheduled maintenance history. 2 - Method of solution: Service specifications and frequency are established and stored. The computer program reviews schedules weekly and prints, on schedule cards, instructions for service that is due the following week. The basic output from the computer program comes in two forms: programmed-maintenance schedule cards and programmed-maintenance data sheets. The data sheets can be issued in numerical building, route, and location number sequence as equipment lists, grouped for work assigned to a particular foreman as the foreman's equipment list, or grouped by work charged to a particular work order as the work-order list. Data sheets grouped by equipment classification are called the equipment classification list

  7. NRC comprehensive records disposition schedule. Revision 3

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-02-01

    Title 44 US Code, ``Public Printing and Documents,`` regulations issued by the General Service Administration (GSA) in 41 CFR Chapter 101, Subchapter B, ``Management and Use of Information and Records,`` and regulations issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter 12, Subchapter B, ``Records Management,`` require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA`s General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 3, contains ``NRC`s Comprehensive Records Disposition Schedule,`` and the original authorized approved citation numbers issued by NARA. Rev. 3 incorporates NARA approved changes and additions to the NRC schedules that have been implemented since the last revision dated March, 1992, reflects recent organizational changes implemented at the NRC, and includes the latest version of NARA`s General Records Schedule (dated August 1995).

  8. Supply chain risk management

    OpenAIRE

    Christian Hollstein; Frank Himpel

    2013-01-01

    Background: Supply chain risk management increasingly gains prominence in many international industries. In order to strengthen supply chain structures, processes, and networks, adequate potentials for risk management need to be built (focus on effective logistics) and to be utilized (focus on efficient logistics). Natural-based disasters, such as the case of Fukushima, illustrate how crucial risk management is. Method: By aligning a theoretical-conceptual framework with empirical-induct...

  9. MASTERING SUPPLY CHAIN RISKS

    Directory of Open Access Journals (Sweden)

    Borut Jereb

    2012-11-01

    Full Text Available Risks in supply chains represent one of the major business issues today. Since every organizationstrives for success and uninterrupted operations, efficient supply chain risk management is crucial.During supply chain risk research at the Faculty of Logistics in Maribor (Slovenia some keyissues in the field were identified, the major being the lack of instruments which can make riskmanagement in an organization easier and more efficient. Consequently, a model which captures anddescribes risks in an organization and its supply chain was developed. It is in accordance with thegeneral risk management and supply chain security standards, the ISO 31000 and ISO 28000families. It also incorporates recent finding from the risk management field, especially from theviewpoint of segmenting of the public.The model described in this paper focuses on the risks itself by defining them by different keydimensions, so that risk management is simplified and can be undertaken in every supply chain andorganizations within them. Based on our mode and consequent practical research in actualorganizations, a freely accessible risk catalog has been assembled and published online from the risksthat have been identified so far. This catalog can serve as a checklist and a starting point in supplychain risk management in organizations. It also incorporates experts from the field into a community,in order to assemble an ever growing list of possible risks and to provide insight into the model andits value in practice.

  10. Bridging the Gap Between Planning and Scheduling

    Science.gov (United States)

    Smith, David E.; Frank, Jeremy; Jonsson, Ari K.; Norvig, Peter (Technical Monitor)

    2000-01-01

    Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast. Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of M planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.

  11. Artificial immune algorithm for multi-depot vehicle scheduling problems

    Science.gov (United States)

    Wu, Zhongyi; Wang, Donggen; Xia, Linyuan; Chen, Xiaoling

    2008-10-01

    In the fast-developing logistics and supply chain management fields, one of the key problems in the decision support system is that how to arrange, for a lot of customers and suppliers, the supplier-to-customer assignment and produce a detailed supply schedule under a set of constraints. Solutions to the multi-depot vehicle scheduling problems (MDVRP) help in solving this problem in case of transportation applications. The objective of the MDVSP is to minimize the total distance covered by all vehicles, which can be considered as delivery costs or time consumption. The MDVSP is one of nondeterministic polynomial-time hard (NP-hard) problem which cannot be solved to optimality within polynomial bounded computational time. Many different approaches have been developed to tackle MDVSP, such as exact algorithm (EA), one-stage approach (OSA), two-phase heuristic method (TPHM), tabu search algorithm (TSA), genetic algorithm (GA) and hierarchical multiplex structure (HIMS). Most of the methods mentioned above are time consuming and have high risk to result in local optimum. In this paper, a new search algorithm is proposed to solve MDVSP based on Artificial Immune Systems (AIS), which are inspirited by vertebrate immune systems. The proposed AIS algorithm is tested with 30 customers and 6 vehicles located in 3 depots. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving MDVSP problems.

  12. Concurrent sexual partners-A predictor of Chlamydia

    DEFF Research Database (Denmark)

    Jørgensen, Marianne Johansson; Olesen, Frede; Maindal, Helle Terkildsen

    2013-01-01

    , but the significance of this compared with other well-known predictors has only been briefly described. Aim: The aim is to examine if concurrent partners isan independent predictor for C. trachomatis infection in young Danes aged 15-29 years. Methods: Detailed sexual behavior data were collected via a web......:These preliminary results suggest that concurrent sexual partners is an important predictor for C.trachomatis infections among young Danes aged 15-29. A more concise conclusion will be presented at the Ph.D day......Background:Chlamydia trachomatis is the most common sexually transmitted bacterial infection among young Danes and the spread is highly dependent on the population’s sexual behavior. Previous studies have found concurrent partnerships to be a possible predictor for C. trachomatis...

  13. Mathematical techniques for analyzing concurrent and probabilistic systems

    CERN Document Server

    Rutten, J J M M; Panangaden, Prakash; Panangaden, Prakash; Breugel, Franck van

    2004-01-01

    The book consists of two sets of lecture notes devoted to slightly different methods of analysis of concurrent and probabilistic computational systems. The first set of lectures develops a calculus of streams (a generalization of the set of natural numbers) based on the coinduction principle coming from the theory of coalgebras. It is now well understood that the interplay between algebra (for describing structure) and coalgebra (for describing dynamics) is crucial for understanding concurrent systems. There is a striking analogy between streams and formula calculus reminiscent to those appearing in quantum calculus. These lecture notes will appeal to anyone working in concurrency theory but also to algebraists and logicians. The other set of lecture notes focuses on methods for automatically verifying probabilistic systems using techniques of model checking. The unique aspect of these lectures is the coverage of both theory and practice. The authors have been responsible for one of the most successful experi...

  14. How Formal Dynamic Verification Tools Facilitate Novel Concurrency Visualizations

    Science.gov (United States)

    Aananthakrishnan, Sriram; Delisi, Michael; Vakkalanka, Sarvani; Vo, Anh; Gopalakrishnan, Ganesh; Kirby, Robert M.; Thakur, Rajeev

    With the exploding scale of concurrency, presenting valuable pieces of information collected by formal verification tools intuitively and graphically can greatly enhance concurrent system debugging. Traditional MPI program debuggers present trace views of MPI program executions. Such views are redundant, often containing equivalent traces that permute independent MPI calls. In our ISP formal dynamic verifier for MPI programs, we present a collection of alternate views made possible by the use of formal dynamic verification. Some of ISP’s views help pinpoint errors, some facilitate discerning errors by eliminating redundancy, while others help understand the program better by displaying concurrent even orderings that must be respected by all MPI implementations, in the form of completes-before graphs. In this paper, we describe ISP’s graphical user interface (GUI) capabilities in all these areas which are currently supported by a portable Java based GUI, a Microsoft Visual Studio GUI, and an Eclipse based GUI whose development is in progress.

  15. Contemporary considerations in concurrent endoscopic sinus surgery and rhinoplasty.

    Science.gov (United States)

    Steele, Toby O; Gill, Amarbir; Tollefson, Travis T

    2018-06-11

    Characterize indications, perioperative considerations, clinical outcomes and complications for concurrent endoscopic sinus surgery (ESS) and rhinoplasty. Chronic rhinosinusitis and septal deviation with or without inferior turbinate hypertrophy independently impair patient-reported quality of life. Guidelines implore surgeons to include endoscopy to accurately evaluate patient symptoms. Complication rates parallel those of either surgery (ESS and rhinoplasty) alone and are not increased when performed concurrently. Operative time is generally longer for joint surgeries. Patient satisfaction rates are high. Concurrent functional and/or cosmetic rhinoplasty and ESS is a safe endeavor to perform in a single operative setting and most outcomes data suggest excellent patient outcomes. Additional studies that include patient-reported outcome measures are needed.

  16. Engineering Bereitschaft as an enabler for Concurrent Engineering

    DEFF Research Database (Denmark)

    Christiansen, Kåre; Vesterager, Johan

    1999-01-01

    Industrial companies observe a general trend towards more customised products and shorter product life cycles. Furthermore, the market demands shorter lead-time and high-quality products at a competitive price. Concurrent Engineering address these challenges. Product modelling is a key aspect...... of the Concurrent Engineering literature. One problem with the product modelling literature is that it tends to assume that product development is revolutionary. Very often product development is evolutionary and it means that product modelling should have a major emphasis on reuse. In this paper it is suggested...... that industrial companies should develop an engineering development Bereitschaft (preparatory engineering knowledge) as an approach to Concurrent Engineering and product modelling. To develop such an engineering development Bereitschaft, a company must develop company generic product models.This paper...

  17. How Do Developers Use APIs? A Case Study in Concurrency

    DEFF Research Database (Denmark)

    Blom, Stefan; Kiniry, Joseph; Huisman, Marieke

    2013-01-01

    and functionalities of the Java concurrency library java. util. concurrent. It discusses the Histogram tool that we developed for this purpose, i.e., to efficiently analyse a large collection of bytecode classes. The Histogram tool is used on a representative benchmark set, the Qualitas Corpus. The paper discusses...... the results of the analysis of this benchmark set in detail. This covers both an analysis of the important classes and methods used by the current releases of the benchmark collection, as well as an analysis of the time it took for the Java concurrency library to start being used in released software....... of static analysis and verification tools this information is highly important, because it indicates where and how to put the most efficient effort in annotating APIs, to make them usable for the static analysis and verification tools. This paper presents an analysis of the usage of the routines...

  18. Efficient Academic Scheduling at the U.S. Naval Academy

    National Research Council Canada - National Science Library

    Zane, David

    2003-01-01

    This research project examined academic scheduling problems at the U.S. Naval Academy. The focus was on devising methods to construct good final exam schedules and improve existing course schedules by facilitation course changes...

  19. Efficient Load Scheduling Method For Power Management

    Directory of Open Access Journals (Sweden)

    Vijo M Joy

    2015-08-01

    Full Text Available An efficient load scheduling method to meet varying power supply needs is presented in this paper. At peak load times the power generation system fails due to its instability. Traditionally we use load shedding process. In load shedding process disconnect the unnecessary and extra loads. The proposed method overcomes this problem by scheduling the load based on the requirement. Artificial neural networks are used for this optimal load scheduling process. For generate economic scheduling artificial neural network has been used because generation of power from each source is economically different. In this the total load required is the inputs of this network and the power generation from each source and power losses at the time of transmission are the output of the neural network. Training and programming of the artificial neural networks are done using MATLAB.

  20. Quantify Risk to Manage Cost and Schedule

    National Research Council Canada - National Science Library

    Raymond, Fred

    1999-01-01

    Too many projects suffer from unachievable budget and schedule goals, caused by unrealistic estimates and the failure to quantify and communicate the uncertainty of these estimates to managers and sponsoring executives...