WorldWideScience

Sample records for maximum scheduled duration

  1. Selection and scheduling of jobs with time-dependent duration

    OpenAIRE

    DM Seegmuller; SE Visagie; HC de Kock; WJ Pienaar

    2007-01-01

    In this paper two mathematical programming models, both with multiple objective functions, are proposed to solve four related categories of job scheduling problems. All four of these categories have the property that the duration of the jobs is dependent on the time of implementation and in some cases the preceding job. Furthermore, some jobs (restricted to subsets of the total pool of jobs) can, to different extents, run in parallel. In addition, not all the jobs need necessarily be implemen...

  2. Selection and scheduling of jobs with time-dependent duration

    Directory of Open Access Journals (Sweden)

    DM Seegmuller

    2007-06-01

    Full Text Available In this paper two mathematical programming models, both with multiple objective functions, are proposed to solve four related categories of job scheduling problems. All four of these categories have the property that the duration of the jobs is dependent on the time of implementation and in some cases the preceding job. Furthermore, some jobs (restricted to subsets of the total pool of jobs can, to different extents, run in parallel. In addition, not all the jobs need necessarily be implemented during the given time period.

  3. Maximum surgical blood ordering schedules for revision lower limb arthroplasty.

    Science.gov (United States)

    Mahadevan, Devendra; Challand, Christopher; Clarke, Andrew; Keenan, Jonathan

    2011-05-01

    Effective utilisation of blood products is fundamental. The introduction of maximum surgical blood ordering schedules (MSBOS) for operations has been shown to improve transfusion services. A retrospective analysis was undertaken to establish an evidence-based MSBOS for revision total hip replacement (THR) and total knee revision (TKR). The impact of this schedule on blood conservation was analysed. A retrospective analysis was undertaken on 397 patients who underwent revision THR and TKR over a 4-year period. The cross-match-to-transfusion ratio (CTR) and transfusion index (TI) were calculated. A MSBOS protocol was created based on the TIs and its' impact on transfusion services was assessed prospectively on 125 patients by comparing CTRs. In revision THR, TI was 1.19 for elective cases, 1.55 for emergency cases and 2.35 for infected cases. There was no difference in TI for revisions of cemented and uncemented components. Single component THR revision required less transfusion. In revision TKR, TI was 0.31 for elective cases, 2.0 for emergency cases and 1.23 for cases with infection. The introduction of the MSBOS protocol had resulted in a considerable improvement in blood ordering. Reductions in the CTR were seen for all types of revision surgery, but most evident in elective revision THR (3.24-2.18) and elective revision TKR (7.95-1.2). Analysis confirmed that excessive cross-matching occurred for revision lower limb arthroplasty. The introduction of our MSBOS protocol promoted blood conservation and compliance with established national guidelines.

  4. Homework schedule: an important factor associated with shorter sleep duration among Chinese school-aged children.

    Science.gov (United States)

    Li, Shenghui; Yang, Qian; Chen, Zhe; Jin, Xingming; Jiang, Fan; Shen, Xiaoming

    2014-09-03

    This study was designed to examine the hypothesis that homework schedule has adverse impacts on Chinese children's sleep-wake habits and sleep duration. A random sample of 19,299 children aged 5.08 to 11.99 years old participated in a large, cross-sectional survey. A parent-administered questionnaire was completed to quantify children's homework schedule and sleep behaviors. Generally, it was demonstrated that more homework schedule was significantly associated with later bedtime, later wake time, and shorter sleep duration. Among all sleep variables, bedtime and sleep duration during weekdays appeared to be most affected by homework schedule, especially homework schedule during weekdays.

  5. Selection and scheduling of jobs with time-dependent duration

    African Journals Online (AJOL)

    †Department of Logistics, University of Stellenbosch, Private Bag X1, ... station must apply to occupy the test station and sometimes may even choose ... are considered where the job duration and cost are dependent on the time and sequence.

  6. 49 CFR Appendix B to Part 386 - Penalty Schedule; Violations and Maximum Civil Penalties

    Science.gov (United States)

    2010-10-01

    ... Maximum Civil Penalties The Debt Collection Improvement Act of 1996 [Public Law 104-134, title III... civil penalties set out in paragraphs (e)(1) through (4) of this appendix results in death, serious... 49 Transportation 5 2010-10-01 2010-10-01 false Penalty Schedule; Violations and Maximum Civil...

  7. Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs

    Directory of Open Access Journals (Sweden)

    Long Wan

    2015-01-01

    Full Text Available This paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent processing time of one job is characterized by variable function dependent on the position of the job in the sequence. Each agent wants to fulfil the objective of minimizing the maximum cost of its own jobs. We develop a feasible method to achieve all the Pareto optimal points in polynomial time.

  8. Modelling of extreme rainfall events in Peninsular Malaysia based on annual maximum and partial duration series

    Science.gov (United States)

    Zin, Wan Zawiah Wan; Shinyie, Wendy Ling; Jemain, Abdul Aziz

    2015-02-01

    In this study, two series of data for extreme rainfall events are generated based on Annual Maximum and Partial Duration Methods, derived from 102 rain-gauge stations in Peninsular from 1982-2012. To determine the optimal threshold for each station, several requirements must be satisfied and Adapted Hill estimator is employed for this purpose. A semi-parametric bootstrap is then used to estimate the mean square error (MSE) of the estimator at each threshold and the optimal threshold is selected based on the smallest MSE. The mean annual frequency is also checked to ensure that it lies in the range of one to five and the resulting data is also de-clustered to ensure independence. The two data series are then fitted to Generalized Extreme Value and Generalized Pareto distributions for annual maximum and partial duration series, respectively. The parameter estimation methods used are the Maximum Likelihood and the L-moment methods. Two goodness of fit tests are then used to evaluate the best-fitted distribution. The results showed that the Partial Duration series with Generalized Pareto distribution and Maximum Likelihood parameter estimation provides the best representation for extreme rainfall events in Peninsular Malaysia for majority of the stations studied. Based on these findings, several return values are also derived and spatial mapping are constructed to identify the distribution characteristic of extreme rainfall in Peninsular Malaysia.

  9. On the Road to Improved Scheduling: Reducing the Effects of Variation in Duration

    DEFF Research Database (Denmark)

    Lindhard, Søren; Wandahl, Søren

    2013-01-01

    Scheduling in onsite construction is based on commitments. Unmet commitments result in non-completions which leads to waste. Moreover, it is important that commitments are realistic to avoid both positive and negative variation in duration. Negative variation is destructive to plans and schedules...... and results in delays, while positive variation is destructive to productivity by creating unexploited gaps between activities, thus inducing unexploited capacity. By registering non-completion at three construction sites, the magnitude of activities inducing negative variation has been mapped. In total, 5424...

  10. Accurate computations of monthly average daily extraterrestrial irradiation and the maximum possible sunshine duration

    International Nuclear Information System (INIS)

    Jain, P.C.

    1985-12-01

    The monthly average daily values of the extraterrestrial irradiation on a horizontal plane and the maximum possible sunshine duration are two important parameters that are frequently needed in various solar energy applications. These are generally calculated by solar scientists and engineers each time they are needed and often by using the approximate short-cut methods. Using the accurate analytical expressions developed by Spencer for the declination and the eccentricity correction factor, computations for these parameters have been made for all the latitude values from 90 deg. N to 90 deg. S at intervals of 1 deg. and are presented in a convenient tabular form. Monthly average daily values of the maximum possible sunshine duration as recorded on a Campbell Stoke's sunshine recorder are also computed and presented. These tables would avoid the need for repetitive and approximate calculations and serve as a useful ready reference for providing accurate values to the solar energy scientists and engineers

  11. Table for monthly average daily extraterrestrial irradiation on horizontal surface and the maximum possible sunshine duration

    International Nuclear Information System (INIS)

    Jain, P.C.

    1984-01-01

    The monthly average daily values of the extraterrestrial irradiation on a horizontal surface (H 0 ) and the maximum possible sunshine duration are two important parameters that are frequently needed in various solar energy applications. These are generally calculated by scientists each time they are needed and by using the approximate short-cut methods. Computations for these values have been made once and for all for latitude values of 60 deg. N to 60 deg. S at intervals of 1 deg. and are presented in a convenient tabular form. Values of the maximum possible sunshine duration as recorded on a Campbell Stoke's sunshine recorder are also computed and presented. These tables should avoid the need for repetition and approximate calculations and serve as a useful ready reference for solar energy scientists and engineers. (author)

  12. Contrast and autoshaping in multiple schedules varying reinforcer rate and duration.

    Science.gov (United States)

    Hamilton, B E; Silberberg, A

    1978-07-01

    Thirteen master pigeons were exposed to multiple schedules in which reinforcement frequency (Experiment I) or duration (Experiment II) was varied. In Phases 1 and 3 of Experiment I, the values of the first and second components' random-interval schedules were 33 and 99 seconds, respectively. In Phase 2, these values were 99 seconds for both components. In Experiment II, a random-interval 33-second schedule was associated with each component. During Phases 1 and 3, the first and second components had hopper durations of 7.5 and 2.5 seconds respectively. During Phase 2, both components' hopper durations were 2.5 seconds. In each experiment, positive contrast obtained for about half the master subjects. The rest showed a rate increase in both components (positive induction). Each master subject's key colors and reinforcers were synchronously presented on a response-independent basis to a yoked control. Richer component key-pecking occurred during each experiment's Phases 1 and 3 among half these subjects. However, none responded during the contrast condition (unchanged component of each experiment's Phase 2). From this it is inferred that autoshaping did not contribute to the contrast and induction findings among master birds. Little evidence of local contrast (highest rate at beginning of richer component) was found in any subject. These data show that (a) contrast can occur independently from autoshaping, (b) contrast assays during equal-valued components may produce induction, (c) local contrast in multiple schedules often does not occur, and (d) differential hopper durations can produce autoshaping and contrast.

  13. Operating room scheduling and surgeon assignment problem under surgery durations uncertainty.

    Science.gov (United States)

    Liu, Hongwei; Zhang, Tianyi; Luo, Shuai; Xu, Dan

    2017-12-29

    Scientific management methods are urgently needed to balance the demand and supply of heath care services in Chinese hospitals. Operating theatre is the bottleneck and costliest department. Therefore, the surgery scheduling is crucial to hospital management. To increase the utilization and reduce the cost of operating theatre, and to improve surgeons' satisfaction in the meantime, a practical surgery scheduling which could assign the operating room (OR) and surgeon for the surgery and sequence surgeries in each OR was provided for hospital managers. Surgery durations were predicted by fitting the distributions. A two-step mixed integer programming model considering surgery duration uncertainty was proposed, and sample average approximation (SAA) method was applied to solve the model. Durations of various surgeries were log-normal distributed respectively. Numerical experiments showed the model and method could get good solutions with different sample sizes. Real-life constraints and duration uncertainty were considered in the study, and the model was also very applicable in practice. Average overtime of each OR was reducing and tending to be stable with the number of surgeons increasing, which is a discipline for OR management.

  14. 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.

  15. Sick and tired: how molecular regulators of human sleep schedules and duration impact immune function.

    Science.gov (United States)

    Kurien, Philip A; Chong, S Y Christin; Ptáček, Louis J; Fu, Ying-Hui

    2013-10-01

    Why do we need to sleep? What regulates when we sleep? And what dictates the number of hours we require? These are often viewed as three separate biological questions. Here, we propose they share molecular etiologies, whereby regulators of sleep schedules and sleep duration also govern the physiological purposes of sleep. To support our hypothesis, we review Mendelian human genetic variants sufficient to advance sleep-wake onset (PER2) and shorten sleep length (DEC2), and evaluate their emerging roles in immune responses that may rely on a sound night of slumber. Copyright © 2013 Elsevier Ltd. All rights reserved.

  16. Comparison of annual maximum series and partial duration series methods for modeling extreme hydrologic events

    DEFF Research Database (Denmark)

    Madsen, Henrik; Rasmussen, Peter F.; Rosbjerg, Dan

    1997-01-01

    Two different models for analyzing extreme hydrologic events, based on, respectively, partial duration series (PDS) and annual maximum series (AMS), are compared. The PDS model assumes a generalized Pareto distribution for modeling threshold exceedances corresponding to a generalized extreme value......). In the case of ML estimation, the PDS model provides the most efficient T-year event estimator. In the cases of MOM and PWM estimation, the PDS model is generally preferable for negative shape parameters, whereas the AMS model yields the most efficient estimator for positive shape parameters. A comparison...... of the considered methods reveals that in general, one should use the PDS model with MOM estimation for negative shape parameters, the PDS model with exponentially distributed exceedances if the shape parameter is close to zero, the AMS model with MOM estimation for moderately positive shape parameters, and the PDS...

  17. Negotiating on location, timing, duration, and participant in agent-mediated joint activity-travel scheduling

    Science.gov (United States)

    Ma, Huiye; Ronald, Nicole; Arentze, Theo A.; Timmermans, Harry J. P.

    2013-10-01

    Agent-based simulation has become an important modeling approach in activity-travel analysis. Social activities account for a large amount of travel and have an important effect on activity-travel scheduling. Participants in joint activities usually have various options regarding location, participants, and timing and take different approaches to make their decisions. In this context, joint activity participation requires negotiation among agents involved, so that conflicts among the agents can be addressed. Existing mechanisms do not fully provide a solution when utility functions of agents are nonlinear and non-monotonic. Considering activity-travel scheduling in time and space as an application, we propose a novel negotiation approach, which takes into account these properties, such as continuous and discrete issues, and nonlinear and non-monotonic utility functions, by defining a concession strategy and a search mechanism. The results of experiments show that agents having these properties can negotiate efficiently. Furthermore, the negotiation procedure affects individuals’ choices of location, timing, duration, and participants.

  18. P wave dispersion and maximum P wave duration are independently associated with rapid renal function decline.

    Science.gov (United States)

    Su, Ho-Ming; Tsai, Wei-Chung; Lin, Tsung-Hsien; Hsu, Po-Chao; Lee, Wen-Hsien; Lin, Ming-Yen; Chen, Szu-Chia; Lee, Chee-Siong; Voon, Wen-Chol; Lai, Wen-Ter; Sheu, Sheng-Hsiung

    2012-01-01

    The P wave parameters measured by 12-lead electrocardiogram (ECG) are commonly used as noninvasive tools to assess for left atrial enlargement. There are limited studies to evaluate whether P wave parameters are independently associated with decline in renal function. Accordingly, the aim of this study is to assess whether P wave parameters are independently associated with progression to renal end point of ≥25% decline in estimated glomerular filtration rate (eGFR). This longitudinal study included 166 patients. The renal end point was defined as ≥25% decline in eGFR. We measured two ECG P wave parameters corrected by heart rate, i.e. corrected P wave dispersion (PWdisperC) and corrected P wave maximum duration (PWdurMaxC). Heart function and structure were measured from echocardiography. Clinical data, P wave parameters, and echocardiographic measurements were compared and analyzed. Forty-three patients (25.9%) reached renal end point. Kaplan-Meier curves for renal end point-free survival showed PWdisperC > median (63.0 ms) (log-rank P = 0.004) and PWdurMaxC > median (117.9 ms) (log-rank Pfunction decline.

  19. A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

    Science.gov (United States)

    1993-09-01

    goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

  20. Using Coevolution Genetic Algorithm with Pareto Principles to Solve Project Scheduling Problem under Duration and Cost Constraints

    Directory of Open Access Journals (Sweden)

    Alexandr Victorovich Budylskiy

    2014-06-01

    Full Text Available This article considers the multicriteria optimization approach using the modified genetic algorithm to solve the project-scheduling problem under duration and cost constraints. The work contains the list of choices for solving this problem. The multicriteria optimization approach is justified here. The study describes the Pareto principles, which are used in the modified genetic algorithm. We identify the mathematical model of the project-scheduling problem. We introduced the modified genetic algorithm, the ranking strategies, the elitism approaches. The article includes the example.

  1. Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date

    OpenAIRE

    Liu, Peng; Wang, Xiaoli

    2017-01-01

    A new maximum lateness scheduling model in which both cooperative games and variable processing times exist simultaneously is considered in this paper. The job variable processing time is described by an increasing or a decreasing function dependent on the position of a job in the sequence. Two persons have to cooperate in order to process a set of jobs. Each of them has a single machine and their processing cost is defined as the minimum value of maximum lateness. All jobs have a common due ...

  2. Sleep duration, schedule and quality among urban Chinese children and adolescents: associations with routine after-school activities.

    Directory of Open Access Journals (Sweden)

    Xiaoxiao Jiang

    Full Text Available BACKGROUND: With rapid urbanization accompanied by lifestyle changes, children and adolescents living in metropolitan areas are faced with many time use choices that compete with sleep. This study reports on the sleep hygiene of urban Chinese school students, and investigates the relationship between habitual after-school activities and sleep duration, schedule and quality on a regular school day. METHODS: Cross-sectional, school-based survey of school children (Grades 4-8 living in Shanghai, China, conducted in 2011. Self-reported data were collected on students' sleep duration and timing, sleep quality, habitual after-school activities (i.e. homework, leisure-time physical activity, recreational screen time and school commuting time, and potential correlates. RESULTS: Mean sleep duration of this sample (mean age: 11.5-years; 48.6% girls was 9 hours. Nearly 30% of students reported daytime tiredness. On school nights, girls slept less (p<0.001 and went to bed later (p<0.001, a sex difference that was more pronounced in older students. Age by sex interactions were observed for both sleep duration (p=0.005 and bedtime (p=0.002. Prolonged time spent on homework and mobile phone playing was related to shorter sleep duration and later bedtime. Adjusting for all other factors, with each additional hour of mobile phone playing, the odds of daytime tiredness and having difficulty maintaining sleep increased by 30% and 27% among secondary students, respectively. CONCLUSION: There are sex differences in sleep duration, schedule and quality. Habitual activities had small but significant associations with sleep hygiene outcomes especially among secondary school students. Intervention strategies such as limiting children's use of electronic screen devices after school are implicated.

  3. Evaluating Annual Maximum and Partial Duration Series for Estimating Frequency of Small Magnitude Floods

    Directory of Open Access Journals (Sweden)

    Fazlul Karim

    2017-06-01

    Full Text Available Understanding the nature of frequent floods is important for characterising channel morphology, riparian and aquatic habitat, and informing river restoration efforts. This paper presents results from an analysis on frequency estimates of low magnitude floods using the annual maximum and partial series data compared to actual flood series. Five frequency distribution models were fitted to data from 24 gauging stations in the Great Barrier Reef (GBR lagoon catchments in north-eastern Australia. Based on the goodness of fit test, Generalised Extreme Value, Generalised Pareto and Log Pearson Type 3 models were used to estimate flood frequencies across the study region. Results suggest frequency estimates based on a partial series are better, compared to an annual series, for small to medium floods, while both methods produce similar results for large floods. Although both methods converge at a higher recurrence interval, the convergence recurrence interval varies between catchments. Results also suggest frequency estimates vary slightly between two or more partial series, depending on flood threshold, and the differences are large for the catchments that experience less frequent floods. While a partial series produces better frequency estimates, it can underestimate or overestimate the frequency if the flood threshold differs largely compared to bankfull discharge. These results have significant implications in calculating the dependency of floodplain ecosystems on the frequency of flooding and their subsequent management.

  4. An Experimental Study of Scheduling and Duration of "Tier 2" First-Grade Reading Intervention

    Science.gov (United States)

    Denton, Carolyn A.; Cirino, Paul T.; Barth, Amy E.; Romain, Melissa; Vaughn, Sharon; Wexler, Jade; Francis, David J.; Fletcher, Jack M.

    2011-01-01

    This study compared the effects on reading outcomes of delivering supplemental, small-group intervention to first-grade students at risk for reading difficulties randomly assigned to one of three different treatment schedules: extended (4 sessions per week, 16 weeks; n = 66), concentrated (4 sessions per week, 8 weeks; n = 64), or distributed (2…

  5. Negotiating on location, timing, duration, and participant in agent-mediated joint activity-travel scheduling

    NARCIS (Netherlands)

    Ma, Huiye; Ronald, N.A.; Arentze, T.A.; Timmermans, H.J.P.

    2013-01-01

    Agent-based simulation has become an important modeling approach in activity-travel analysis. Social activities account for a large amount of travel and have an important effect on activity-travel scheduling. Participants in joint activities usually have various options regarding location,

  6. Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date

    Directory of Open Access Journals (Sweden)

    Peng Liu

    2017-01-01

    Full Text Available A new maximum lateness scheduling model in which both cooperative games and variable processing times exist simultaneously is considered in this paper. The job variable processing time is described by an increasing or a decreasing function dependent on the position of a job in the sequence. Two persons have to cooperate in order to process a set of jobs. Each of them has a single machine and their processing cost is defined as the minimum value of maximum lateness. All jobs have a common due date. The objective is to maximize the multiplication of their rational positive cooperative profits. A division of those jobs should be negotiated to yield a reasonable cooperative profit allocation scheme acceptable to them. We propose the sufficient and necessary conditions for the problems to have positive integer solution.

  7. Early Mucosal Reactions During and After Head-and-Neck Radiotherapy: Dependence of Treatment Tolerance on Radiation Dose and Schedule Duration

    International Nuclear Information System (INIS)

    Fenwick, John D.; Lawrence, Geoff P.; Malik, Zafar; Nahum, Alan E.; Mayles, W. Philip M.

    2008-01-01

    Purpose: To more precisely localize the dose-time boundary between head-and-neck radiotherapy schedules inducing tolerable and intolerable early mucosal reactions. Methods and Materials: Total cell-kill biologically effective doses (BED CK ) have been calculated for 84 schedules, including incomplete repair effects, but making no other corrections for the effect of schedule duration T. [BED CK ,T] scatterplots are graphed, overlying BED CKboundary (T) curves on the plots and using discriminant analysis to optimize BED CKboundary (T) to best represent the boundary between the tolerable and intolerable schedules. Results: More overlap than expected is seen between the tolerable and intolerable treatments in the 84-schedule [BED CK ,T] scatterplot, but this was largely eliminated by removing gap and tolerated accelerating schedules from the plot. For the remaining 57 predominantly regular schedules, the BED CKboundary (T) boundary increases with increasing T (p = 0.0001), curving upwards significantly nonlinearly (p = 0.00007) and continuing to curve beyond 15 days (p = 0.035). The regular schedule BED CKboundary (T) boundary does not describe tolerability well for accelerating schedules (p = 0.002), with several tolerated accelerating schedules lying above the boundary where regular schedules would be intolerable. Gap schedule tolerability also is not adequately described by the regular schedule boundary (p = 0.04), although no systematic offset exists between the regular boundary and the overall gap schedule tolerability pattern. Conclusions: All schedules analyzed (regular, gap, and accelerating) with BED CK values below BED CKboundary (T)=69.5x(T/32.2)/sin((T/32.2) (radians) )-3.5Gy 10 (forT≤50 days) are tolerable, and many lying above the boundary are intolerable. The accelerating schedules analyzed were tolerated better overall than are the regular schedules with similar [BED CK ,T] values.

  8. A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs

    Directory of Open Access Journals (Sweden)

    Ahmad Zeraatkar Moghaddam

    2012-01-01

    Full Text Available This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which delivering goods to customers entails cost. Under such situation, keeping completed jobs to deliver in batches may result in reducing delivery costs. In literature review of batch scheduling, minimizing the maximum lateness is known as NP-Hard problem; therefore the present issue aiming at minimizing the costs of delivering, in addition to the aforementioned objective function, remains an NP-Hard problem. In order to solve the proposed model, a Simulation annealing meta-heuristic is used, where the parameters are calibrated by Taguchi approach and the results are compared to the global optimal values generated by Lingo 10 software. Furthermore, in order to check the efficiency of proposed method to solve larger scales of problem, a lower bound is generated. The results are also analyzed based on the effective factors of the problem. Computational study validates the efficiency and the accuracy of the presented model.

  9. Diagnostic of annual cycle and effects of the ENSO about the maximum intensity of duration rains between 1 and 24 hours at the Andes of Colombia

    International Nuclear Information System (INIS)

    Poveda, German; Mesa, Oscar; Toro, Vladimir; Agudelo, Paula; Alvarez, Juan F; Arias, Paola; Moreno, Hernan; Salazar, Luis; Vieira, Sara

    2002-01-01

    We study the distribution of maximum rainfall events during the annual cycle, for storms ranging from 1 to 24-hour in duration; by using information over 51 rain gauges locate at the Colombian Andes. Also, the effects of both phases of ENSO (El Nino and La Nina) are quantified. We found that maximum rainfall intensity events occur during the rainy periods of march-may and September-November. There is a strong similarity between the annual cycle of mean total rainfall and that of the maximum intensities of rainfall over the tropical Andes. This result is quite consistent throughout the three ranges of the Colombian Andes. At inter annual timescales, we found that both phases of ENSO are associated with disturbances of maximum rainfall events; since during La Nina there are more intense precipitation events than during El Nino, overall, for durations longer than 3 hours, rainfall intensity gets reduced by one order of magnitude with respect to shorter durations (1-3 hours). The most extreme recorded rainfall events are apparently not associated with the annual and inter annual large scales forcing and appear to be randomly generated by the important role of the land surface atmosphere in the genesis and dynamics of intense storm over central Colombia

  10. Using mean duration and variation of procedure times to plan a list of surgical operations to fit into the scheduled list time.

    Science.gov (United States)

    Pandit, Jaideep J; Tavare, Aniket

    2011-07-01

    It is important that a surgical list is planned to utilise as much of the scheduled time as possible while not over-running, because this can lead to cancellation of operations. We wished to assess whether, theoretically, the known duration of individual operations could be used quantitatively to predict the likely duration of the operating list. In a university hospital setting, we first assessed the extent to which the current ad-hoc method of operating list planning was able to match the scheduled operating list times for 153 consecutive historical lists. Using receiver operating curve analysis, we assessed the ability of an alternative method to predict operating list duration for the same operating lists. This method uses a simple formula: the sum of individual operation times and a pooled standard deviation of these times. We used the operating list duration estimated from this formula to generate a probability that the operating list would finish within its scheduled time. Finally, we applied the simple formula prospectively to 150 operating lists, 'shadowing' the current ad-hoc method, to confirm the predictive ability of the formula. The ad-hoc method was very poor at planning: 50% of historical operating lists were under-booked and 37% over-booked. In contrast, the simple formula predicted the correct outcome (under-run or over-run) for 76% of these operating lists. The calculated probability that a planned series of operations will over-run or under-run was found useful in developing an algorithm to adjust the planned cases optimally. In the prospective series, 65% of operating lists were over-booked and 10% were under-booked. The formula predicted the correct outcome for 84% of operating lists. A simple quantitative method of estimating operating list duration for a series of operations leads to an algorithm (readily created on an Excel spreadsheet, http://links.lww.com/EJA/A19) that can potentially improve operating list planning.

  11. Validation of probabilistic methodology for generating actual inhabitants' behavior schedules for accurate prediction of maximum energy requirements

    Energy Technology Data Exchange (ETDEWEB)

    Tanimoto, Jun; Hagishima, Aya; Sagara, Hiroki [Interdisciplinary Graduate School of Engineering Sciences, Kyushu University 6-1, Kasuga-koen, Kasuga-shi, Fukuoka 816-8580 (Japan)

    2008-07-01

    A data set of myriad and time-varying inhabitant-behavior schedules with a 15 min time resolution, generated by the authors in a previous study, is validated through a comparison analysis. We show three comparisons. The first and second compare the estimated demand with a time series of actual utility demand. The comparisons indicate that the generated data and its algorithm, described by the authors, have an appropriate robustness. Another comparison between the estimate and the annual averaged daily water demand of a residential area, consisting of 9327 residences, also shows an acceptable consistency. (author)

  12. Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling

    NARCIS (Netherlands)

    Liao, F.

    2016-01-01

    Multi-state supernetworks have been advanced recently for modeling individual activity-travel scheduling decisions. The main advantage is that multi-dimensional choice facets are modeled simultaneously within an integral framework, supporting systematic assessments of a large spectrum of policies

  13. Sleep duration as a mediator between an alternating day and night shift work schedule and metabolic syndrome among female hospital employees.

    Science.gov (United States)

    Korsiak, Jill; Tranmer, Joan; Day, Andrew; Aronson, Kristan J

    2018-02-01

    The main objective was to determine whether sleep duration on work shifts mediates the relationship between a current alternating day and night shift work schedule and metabolic syndrome among female hospital employees. The secondary objective was to assess whether cumulative lifetime shift work exposure was associated with metabolic syndrome. In this cross-sectional study of 294 female hospital employees, sleep duration was measured with the ActiGraph GT3X+. Shift work status was determined through self-report. Investigation of the total, direct and indirect effects between shift work, sleep duration on work shifts and metabolic syndrome was conducted using regression path analysis. Logistic regression was used to determine the association between cumulative shift work exposure and metabolic syndrome. Shift work is strongly associated with metabolic syndrome (OR Total =2.72, 95% CI 1.38 to 5.36), and the relationship is attenuated when work shift sleep duration is added to the model (OR Direct =1.18, 95% CI 0.49 to 2.89). Sleep duration is an important intermediate between shift work and metabolic syndrome (OR Indirect =2.25, 95% CI 1.27 to 4.26). Cumulative shift work exposure is not associated with metabolic syndrome in this population. Sleep duration mediates the association between a current alternating day-night shift work pattern and metabolic syndrome. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

  14. Duration of protection against hepatitis A for the current two-dose vaccine compared to a three-dose vaccine schedule in children

    Science.gov (United States)

    Raczniak, Gregory A.; Thomas, Timothy K.; Bulkow, Lisa R.; Negus, Susan E.; Zanis, Carolyn L.; Bruce, Michael G.; Spradling, Philip R.; Teshale, Eyasu H.; McMahon, Brian J.

    2015-01-01

    Background Hepatitis A is mostly a self-limiting disease but causes substantial economic burden. Consequently, United States Advisory Committee for Immunization Practices recommends inactivated hepatitis A vaccination for all children beginning at age 1 year and for high risk adults. The hepatitis A vaccine is highly effective but the duration of protection is unknown. Methods We examined the proportion of children with protective hepatitis A antibody levels (anti-HAV ≥20 mIU/mL) as well as the geometric mean concentration (GMC) of anti-HAV in a cross sectional convenience sample of individuals aged 12–24 years, who had been vaccinated with a two-dose schedule in childhood, with the initial dose at least 5 years ago. We compared a subset of data from persons vaccinated with two-doses (720 EL.U.) at age 3–6 years with a demographically similar prospective cohort that received a three-dose (360 EL.U.) schedule and have been followed for 17 years. Results No significant differences were observed when comparing GMC between the two cohorts at 10 (P = 0.467), 12 (P = 0.496), and 14 (P = 0.175) years post-immunization. For the three-dose cohort, protective antibody levels remain for 17 years and have leveled-off over the past 7 years. Conclusion The two- and three-dose schedules provide similar protection >14 years after vaccination, indicating a booster dose is not needed at this time. Plateauing anti-HAV GMC levels suggest protective antibody levels may persist long-term. PMID:23470239

  15. The analysis of the possibility of using 10-minute rainfall series to determine the maximum rainfall amount with 5 minutes duration

    Science.gov (United States)

    Kaźmierczak, Bartosz; Wartalska, Katarzyna; Wdowikowski, Marcin; Kotowski, Andrzej

    2017-11-01

    Modern scientific research in the area of heavy rainfall analysis regarding to the sewerage design indicates the need to develop and use probabilistic rain models. One of the issues that remains to be resolved is the length of the shortest amount of rain to be analyzed. It is commonly believed that the best time is 5 minutes, while the least rain duration measured by the national services is often 10 or even 15 minutes. Main aim of this paper is to present the difference between probabilistic rainfall models results given from rainfall time series including and excluding 5 minutes rainfall duration. Analysis were made for long-time period from 1961-2010 on polish meteorological station Legnica. To develop best fitted to measurement rainfall data probabilistic model 4 probabilistic distributions were used. Results clearly indicates that models including 5 minutes rainfall duration remains more appropriate to use.

  16. New approach of determinations of earthquake moment magnitude using near earthquake source duration and maximum displacement amplitude of high frequency energy radiation

    Energy Technology Data Exchange (ETDEWEB)

    Gunawan, H.; Puspito, N. T.; Ibrahim, G.; Harjadi, P. J. P. [ITB, Faculty of Earth Sciences and Tecnology (Indonesia); BMKG (Indonesia)

    2012-06-20

    The new approach method to determine the magnitude by using amplitude displacement relationship (A), epicenter distance ({Delta}) and duration of high frequency radiation (t) has been investigated for Tasikmalaya earthquake, on September 2, 2009, and their aftershock. Moment magnitude scale commonly used seismic surface waves with the teleseismic range of the period is greater than 200 seconds or a moment magnitude of the P wave using teleseismic seismogram data and the range of 10-60 seconds. In this research techniques have been developed a new approach to determine the displacement amplitude and duration of high frequency radiation using near earthquake. Determination of the duration of high frequency using half of period of P waves on the seismograms displacement. This is due tothe very complex rupture process in the near earthquake. Seismic data of the P wave mixing with other wave (S wave) before the duration runs out, so it is difficult to separate or determined the final of P-wave. Application of the 68 earthquakes recorded by station of CISI, Garut West Java, the following relationship is obtained: Mw = 0.78 log (A) + 0.83 log {Delta}+ 0.69 log (t) + 6.46 with: A (m), d (km) and t (second). Moment magnitude of this new approach is quite reliable, time processing faster so useful for early warning.

  17. New approach of determinations of earthquake moment magnitude using near earthquake source duration and maximum displacement amplitude of high frequency energy radiation

    Science.gov (United States)

    Gunawan, H.; Puspito, N. T.; Ibrahim, G.; Harjadi, P. J. P.

    2012-06-01

    The new approach method to determine the magnitude by using amplitude displacement relationship (A), epicenter distance (Δ) and duration of high frequency radiation (t) has been investigated for Tasikmalaya earthquake, on September 2, 2009, and their aftershock. Moment magnitude scale commonly used seismic surface waves with the teleseismic range of the period is greater than 200 seconds or a moment magnitude of the P wave using teleseismic seismogram data and the range of 10-60 seconds. In this research techniques have been developed a new approach to determine the displacement amplitude and duration of high frequency radiation using near earthquake. Determination of the duration of high frequency using half of period of P waves on the seismograms displacement. This is due tothe very complex rupture process in the near earthquake. Seismic data of the P wave mixing with other wave (S wave) before the duration runs out, so it is difficult to separate or determined the final of P-wave. Application of the 68 earthquakes recorded by station of CISI, Garut West Java, the following relationship is obtained: Mw = 0.78 log (A) + 0.83 log Δ + 0.69 log (t) + 6.46 with: A (m), d (km) and t (second). Moment magnitude of this new approach is quite reliable, time processing faster so useful for early warning.

  18. New approach of determinations of earthquake moment magnitude using near earthquake source duration and maximum displacement amplitude of high frequency energy radiation

    International Nuclear Information System (INIS)

    Gunawan, H.; Puspito, N. T.; Ibrahim, G.; Harjadi, P. J. P.

    2012-01-01

    The new approach method to determine the magnitude by using amplitude displacement relationship (A), epicenter distance (Δ) and duration of high frequency radiation (t) has been investigated for Tasikmalaya earthquake, on September 2, 2009, and their aftershock. Moment magnitude scale commonly used seismic surface waves with the teleseismic range of the period is greater than 200 seconds or a moment magnitude of the P wave using teleseismic seismogram data and the range of 10-60 seconds. In this research techniques have been developed a new approach to determine the displacement amplitude and duration of high frequency radiation using near earthquake. Determination of the duration of high frequency using half of period of P waves on the seismograms displacement. This is due tothe very complex rupture process in the near earthquake. Seismic data of the P wave mixing with other wave (S wave) before the duration runs out, so it is difficult to separate or determined the final of P-wave. Application of the 68 earthquakes recorded by station of CISI, Garut West Java, the following relationship is obtained: Mw = 0.78 log (A) + 0.83 log Δ+ 0.69 log (t) + 6.46 with: A (m), d (km) and t (second). Moment magnitude of this new approach is quite reliable, time processing faster so useful for early warning.

  19. Uma proposta de solução para o problema da construção de escalas de motoristas e cobradores de ônibus por meio do algoritmo do matching de peso máximo A proposed solution for bus driver and fare collector scheduling problems using the maximum weight matching algorithm

    Directory of Open Access Journals (Sweden)

    Paulo Henrique Siqueira

    2004-08-01

    idle hours, thereby minimizing the operational costs of public transportation companies. In the first phase of this study, assuming that the timetables are already divided into long and short duration schedules, the short schedules can be combined to make up an employee's workday. This combination is done by the maximum weight Matching Algorithm, in which the scales are represented by vertices on a graph and the maximum weight is attributed to combinations of scales that do not lead to overtime or idle hours. In the second phase, a weekend schedule is assigned for every weekly work schedule. Based on these two phases, the weekly work schedules of bus drivers and bus fare collectors can be arranged at a minimal cost. The third and final phase of this study consisted of assigning a weekly work schedule to each bus driver and collector, considering his/her preferences. The maximum weight Matching Algorithm was also used in this phase. This method was applied in three public transportation companies in Curitiba, state of Paraná, which had until then used old heuristic algorithms based solely on managerial experience.

  20. Erosivity under two durations of maximum rain intensities in Pelotas/RS = Erosividade sob duas durações de intensidades máximas da chuva em Pelotas - RS

    Directory of Open Access Journals (Sweden)

    Jacira Porto dos Santos

    2012-04-01

    Full Text Available In the Universal Equation of Soil Loss (USLE, erosivity is the factor related to rain and express its potential to cause soil erosion, being necessary to know its kinetic energy and the maximum intensities of rain in duration of 30 min. Thus, the aim of this study was to verify and quantify the impact of the rain duration, considering 15 and 30 min, on the USLE erosivity factor. To achieve this, 863 rain gauge records were used, duiring the period of 1983 to 1998 in the city of Pelotas, RS, obtained from the Agrometeorological Station - Covenant EMBRAPA/UFPel, INMET (31o51´S; 52o21´O and altitude of 13,2 m. With the records, it was estimated the erosivity values from the maximum intensities of rain during the period evaluated. The average annual values of erosivity was 2551,3 MJ ha-1 h-1 ano-1 and 1406,1 MJ ha-1 h-1 ano-1, for the average intensities of 6,40 mm h-1 and 3,74 mm h-1, in durations of 15 and 30 min, respectively. The results of this study have shown that the percentage of erosive rainfalls in relation to the total precipitation was of 91.0%, and that the erosivity was influenced by the duration of the maximum intensity of rain.= Na Equação Universal de Perdas de Solo (EUPS a erosividade é o fator relacionado à chuva e expressa o seu potencial em provocar a erosão do solo, sendo necessário que se conheça a energia cinética da mesma e as máximas intensidades da chuva na duração de 30 min. Objetivou-se com este trabalho verificar e quantificar o impacto da duração da chuva, considerando 15 e 30 min, sobre o fator erosividade da EUPS. Para tanto foram utilizados 863 registros pluviográficos de chuva, no período de 1983 a 1998 da localidade de Pelotas, RS, obtidos na Estação Agroclimatológica – Convênio EMBRAPA/UFPel, INMET (31o51´S;52o21´O e altitude de 13,2 m. Com os registros foram estimados os valores de erosividade a partir de intensidades máximas de chuva nas durações consideradas. Os valores m

  1. 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...

  2. 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)

  3. Advertisement scheduling on commercial radio station using genetics algorithm

    Science.gov (United States)

    Purnamawati, S.; Nababan, E. B.; Tsani, B.; Taqyuddin, R.; Rahmat, R. F.

    2018-03-01

    On the commercial radio station, the advertising schedule is done manually, which resulted in ineffectiveness of ads schedule. Playback time consists of two types such as prime time and regular time. Radio Ads scheduling will be discussed in this research is based on ad playback schedule between 5am until 12am which rules every 15 minutes. It provides 3 slots ads with playback duration per ads maximum is 1 minute. If the radio broadcast time per day is 12 hours, then the maximum number of ads per day which can be aired is 76 ads. The other is the enactment of rules of prime time, namely the hours where the common people (listeners) have the greatest opportunity to listen to the radio, namely between the hours and hours of 4 am - 8 am, 6 pm - 10 pm. The number of screenings of the same ads on one day are limited to prime time ie 5 times, while for regular time is 8 times. Radio scheduling process is done using genetic algorithms which are composed of processes initialization chromosomes, selection, crossover and mutation. Study on chromosome 3 genes, each chromosome will be evaluated based on the value of fitness calculated based on the number of infractions that occurred on each individual chromosome. Where rule 1 is the number of screenings per ads must not be more than 5 times per day and rule 2 is there should never be two or more scheduling ads delivered on the same day and time. After fitness value of each chromosome is acquired, then the do the selection, crossover and mutation. From this research result, the optimal advertising schedule with schedule a whole day and ads data playback time ads with this level of accuracy: the average percentage was 83.79%.

  4. 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

  5. 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.

  6. 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.

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

  8. 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

  9. 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

  10. 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.)

  11. 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.

  12. A master surgical scheduling approach for cyclic scheduling in operating room departments

    NARCIS (Netherlands)

    van Oostrum, Jeroen M.; van Houdenhoven, M.; Hurink, Johann L.; Hans, Elias W.; Wullink, Gerhard; Kazemier, G.

    This paper addresses the problem of operating room (OR) scheduling at the tactical level of hospital planning and control. Hospitals repetitively construct operating room schedules, which is a time-consuming, tedious, and complex task. The stochasticity of the durations of surgical procedures

  13. A model for generating master surgical schedules to allow cyclic scheduling in operating room departments

    NARCIS (Netherlands)

    van Oostrum, J.M.; van Houdenhoven, M.; Hurink, Johann L.; Hans, Elias W.; Wullink, Gerhard; Kazemier, G.

    2005-01-01

    This paper addresses the problem of operating room scheduling at the tactical level of hospital planning and control. Hospitals repetitively construct operating room schedules, which is a time consuming tedious and complex task. The stochasticity of the durations of surgical procedures complicates

  14. Maternal Nonstandard Work Schedules and Breastfeeding Behaviors.

    Science.gov (United States)

    Zilanawala, Afshin

    2017-06-01

    Objectives Although maternal employment rates have increased in the last decade in the UK, there is very little research investigating the linkages between maternal nonstandard work schedules (i.e., work schedules outside of the Monday through Friday, 9-5 schedule) and breastfeeding initiation and duration, especially given the wide literature citing the health advantages of breastfeeding for mothers and children. Methods This paper uses a population-based, UK cohort study, the Millennium Cohort Study (n = 17,397), to investigate the association between types of maternal nonstandard work (evening, night, away from home overnight, and weekends) and breastfeeding behaviors. Results In unadjusted models, exposure to evening shifts was associated with greater odds of breastfeeding initiation (OR 1.71, CI 1.50-1.94) and greater odds of short (OR 1.55, CI 1.32-1.81), intermediate (OR 2.01, CI 1.64-2.47), prolonged partial duration (OR 2.20, CI 1.78-2.72), and prolonged exclusive duration (OR 1.53, CI 1.29-1.82), compared with mothers who were unemployed and those who work other types of nonstandard shifts. Socioeconomic advantage of mothers working evening schedules largely explained the higher odds of breastfeeding initiation and duration. Conclusions Socioeconomic characteristics explain more breastfeeding behaviors among mothers working evening shifts. Policy interventions to increase breastfeeding initiation and duration should consider the timing of maternal work schedules.

  15. Modeling Change in Project Duration and Completion

    DEFF Research Database (Denmark)

    Wiltshire, Travis; Butner, Jonathan E.; Pirtle, Zachary

    2017-01-01

    In complex work domains and organizations, understanding scheduleing dynamics can ensure objectives are reached and delays are mitigated. In the current paper, we examine the scheduling dynamics for NASA’s Exploration Flight Test 1 (EFT-1) activities. For this examination, we specifically modeled...... simultaneous change in percent complete and estimated duration for a given project as they were included in monthly reports over time. In short, we utilized latent change score mixture modeling to extract the attractor dynamics within the scheduling data. We found three primarily patterns: an attractor at low...

  16. Maximum permissible voltage of YBCO coated conductors

    Energy Technology Data Exchange (ETDEWEB)

    Wen, J.; Lin, B.; Sheng, J.; Xu, J.; Jin, Z. [Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai (China); Hong, Z., E-mail: zhiyong.hong@sjtu.edu.cn [Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai (China); Wang, D.; Zhou, H.; Shen, X.; Shen, C. [Qingpu Power Supply Company, State Grid Shanghai Municipal Electric Power Company, Shanghai (China)

    2014-06-15

    Highlights: • We examine three kinds of tapes’ maximum permissible voltage. • We examine the relationship between quenching duration and maximum permissible voltage. • Continuous I{sub c} degradations under repetitive quenching where tapes reaching maximum permissible voltage. • The relationship between maximum permissible voltage and resistance, temperature. - Abstract: Superconducting fault current limiter (SFCL) could reduce short circuit currents in electrical power system. One of the most important thing in developing SFCL is to find out the maximum permissible voltage of each limiting element. The maximum permissible voltage is defined as the maximum voltage per unit length at which the YBCO coated conductors (CC) do not suffer from critical current (I{sub c}) degradation or burnout. In this research, the time of quenching process is changed and voltage is raised until the I{sub c} degradation or burnout happens. YBCO coated conductors test in the experiment are from American superconductor (AMSC) and Shanghai Jiao Tong University (SJTU). Along with the quenching duration increasing, the maximum permissible voltage of CC decreases. When quenching duration is 100 ms, the maximum permissible of SJTU CC, 12 mm AMSC CC and 4 mm AMSC CC are 0.72 V/cm, 0.52 V/cm and 1.2 V/cm respectively. Based on the results of samples, the whole length of CCs used in the design of a SFCL can be determined.

  17. Lift scheduling organization : Lift Concept for Lemminkainen

    OpenAIRE

    Mingalimov, Iurii

    2015-01-01

    The purpose of the work was to make a simple schedule for the main contractors and clients to check and control workflow connected with lifts. It gathers works with electricity, construction, engineering networks, installing equipment and commissioning works. The schedule was carried out during working on the building site Aino in Saint Petersburg in Lemminkӓinen. The duration of work was 5 months. The lift concept in Lemminkӓinen is very well controlled in comparison with other buil...

  18. 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…

  19. Schedule control in Ling Ao nuclear power project

    International Nuclear Information System (INIS)

    Xie Ahai

    2007-01-01

    Ling Ao Nuclear Power Station (LANP) is first one built up by self-reliance in China with power capacity 990x2 MWe. The results of quality control, schedule control and cost control are satisfactory. The commercial operation days of Unit 1 and Unit 2 were 28th May 2002 and 8th Jan. 2003 respectively, which were 48 days and 66 days in advance of the project schedule. This paper presents the practices of self-reliance schedule control system in LANP. The paper includes 10 sections: schedule control system; targets of schedule control; schedule control at early stage of project; construction schedule; scheduling practice; Point curves; schedule control of design and procurement; a good practice of construction schedule control on site; commissioning and startup schedule; schedule control culture. Three figures are attached. The main contents of the self-reliance schedule control system are as follows: to draw up reasonable schedules and targets; to setup management mechanism and procedures; to organize powerful project management team; to establish close monitoring system; to provide timely progress reports and statistics information. Five kinds of schedule control targets are introduced, i.e. bar-chart schedule; milesones; Point curves; interface management; hydraulic test schedule of auxiliary piping loops; EMR/EMC/EESR issuance schedules. Six levels of bar-chart schedules were adopted in LANP, but the bar-chart schedules were not satisfactory for complicated erection condition on site, even using six levels of schedules. So a kind of Point curves was developed and their advantages are explained. Scheduling method of three elements: activity, duration, logic, which was adopted in LANP, is introduced. The duration of each piping activities in LANP level 2 project schedule was calculated based on the relevant working Point quantities. The analysis and adjustment of Point curves are illustrated, i.e. balance of monthly quantities; possible production in the peakload

  20. Approximate maximum parsimony and ancestral maximum likelihood.

    Science.gov (United States)

    Alon, Noga; Chor, Benny; Pardi, Fabio; Rapoport, Anat

    2010-01-01

    We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP-hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to a 16/9 approximation ratio for AML and asymptotically to a 1.55 approximation ratio for MP.

  1. Maximum permissible dose

    International Nuclear Information System (INIS)

    Anon.

    1979-01-01

    This chapter presents a historic overview of the establishment of radiation guidelines by various national and international agencies. The use of maximum permissible dose and maximum permissible body burden limits to derive working standards is discussed

  2. 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 ...

  3. 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 ...

  4. Issue of CILRT duration

    International Nuclear Information System (INIS)

    Dougan, J.R.

    1983-01-01

    Containment Integrated Leakage Rate Tests (CILRTs) represent large investments of time and money on the part of the utilities operating nuclear power plants. In the early days of containment testing, leak rate tests were conducted from a minimum of 24 hours to a maximum of several days. The minimum time period of 24 hours was adopted and continues to form the fundamental approach of the Nuclear Regulatory Commission (NRC). However, there does not appear to be technical justification for the minimum test period of 24 hours. In fact, several industry sources have shown that successful CILRTs can be conducted in much less time. The NRC has recognized this fact and has approved CILRTs of less than 24 hours. But some utilities still feel constrained to use the 24 hour test due to their Technical Specifications. And although criteria for determining the duration of a CILRT have been published, no specific criteria have been agreed upon as final. Therefore, it is the purpose of this paper to highlight several of the proposed criteria and the concerns that might arise following the implementation of such criteria

  5. 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.

  6. 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

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

  8. 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

  9. 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

  10. Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

    Science.gov (United States)

    Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly

    2014-01-01

    We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

  11. Maternal Nonstandard Work Schedules and Child Cognitive Outcomes

    Science.gov (United States)

    Han, Wen-Jui

    2005-01-01

    This paper examined associations between mothers' work schedules and children's cognitive outcomes in the first 3 years of life for approximately 900 children from the National Institute of Child Health and Human Development Study of Early Child Care. Both the timing and duration of maternal nonstandard work schedules were examined. Although…

  12. Pulse duration discriminator

    International Nuclear Information System (INIS)

    Kosakovskij, L.F.

    1980-01-01

    Basic circuits of a discriminator for discrimination of pulses with the duration greater than the preset one, and of a multifunctional discriminator allowing to discriminate pulses with the duration greater (tsub(p)>tsub(s)) and lesser (tsub(p) tsub(s) and with the duration tsub(p) [ru

  13. 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.

  14. Measuring Chemotherapy Appointment Duration and Variation Using Real-Time Location Systems.

    Science.gov (United States)

    Barysauskas, Constance M; Hudgins, Gina; Gill, Katie Kupferberg; Camuso, Kristen M; Bagley, Janet; Rozanski, Sheila; Kadish, Sarah

    Clinical schedules drive resource utilization, cost, and patient wait time. Accurate appointment duration allocation ensures appropriate staffing ratios to daily caseloads and maximizes scarce resources. Dana-Farber Cancer Institute (DFCI) infusion appointment duration is adjusted by regimen using a consensus method of experts including pharmacists, nurses, and administrators. Using real-time location system (RTLS), we examined the accuracy of observed appointment duration compared with the scheduled duration. Appointment duration was calculated using RTLS at DFCI between August 1, 2013, and September 30, 2013. Duration was defined as the total time a patient occupied an infusion chair. The top 10 administered infusion regimens were investigated (n = 805). Median observed appointment durations were statistically different than the scheduled durations. Appointment durations were shorter than scheduled 98% (C), 95% (I), and 75% (F) of the time and longer than scheduled 77% (A) and 76% (G) of the time. Fifty-six percent of the longer than scheduled (A) appointments were at least 30 minute longer. RTLS provides reliable and unbiased data to improve schedule accuracy. Replacing consensus with system-based data may improve clinic flow, relieve staff stress, and increase patient satisfaction. Further investigation is warranted to elucidate factors that impact variation in appointment duration.

  15. 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)

  16. 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).

  17. Maximum Acceleration Recording Circuit

    Science.gov (United States)

    Bozeman, Richard J., Jr.

    1995-01-01

    Coarsely digitized maximum levels recorded in blown fuses. Circuit feeds power to accelerometer and makes nonvolatile record of maximum level to which output of accelerometer rises during measurement interval. In comparison with inertia-type single-preset-trip-point mechanical maximum-acceleration-recording devices, circuit weighs less, occupies less space, and records accelerations within narrower bands of uncertainty. In comparison with prior electronic data-acquisition systems designed for same purpose, circuit simpler, less bulky, consumes less power, costs and analysis of data recorded in magnetic or electronic memory devices. Circuit used, for example, to record accelerations to which commodities subjected during transportation on trucks.

  18. Maximum Quantum Entropy Method

    OpenAIRE

    Sim, Jae-Hoon; Han, Myung Joon

    2018-01-01

    Maximum entropy method for analytic continuation is extended by introducing quantum relative entropy. This new method is formulated in terms of matrix-valued functions and therefore invariant under arbitrary unitary transformation of input matrix. As a result, the continuation of off-diagonal elements becomes straightforward. Without introducing any further ambiguity, the Bayesian probabilistic interpretation is maintained just as in the conventional maximum entropy method. The applications o...

  19. Maximum power demand cost

    International Nuclear Information System (INIS)

    Biondi, L.

    1998-01-01

    The charging for a service is a supplier's remuneration for the expenses incurred in providing it. There are currently two charges for electricity: consumption and maximum demand. While no problem arises about the former, the issue is more complicated for the latter and the analysis in this article tends to show that the annual charge for maximum demand arbitrarily discriminates among consumer groups, to the disadvantage of some [it

  20. 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

  1. 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

  2. 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...

  3. 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...

  4. Discounted Duration Calculus

    DEFF Research Database (Denmark)

    Ody, Heinrich; Fränzle, Martin; Hansen, Michael Reichhardt

    2016-01-01

    To formally reason about the temporal quality of systems discounting was introduced to CTL and LTL. However, these logic are discrete and they cannot express duration properties. In this work we introduce discounting for a variant of Duration Calculus. We prove decidability of model checking...... for a useful fragment of discounted Duration Calculus formulas on timed automata under mild assumptions. Further, we provide an extensive example to show the usefulness of the fragment....

  5. Developing Project Duration Models in Software Engineering

    Institute of Scientific and Technical Information of China (English)

    Pierre Bourque; Serge Oligny; Alain Abran; Bertrand Fournier

    2007-01-01

    Based on the empirical analysis of data contained in the International Software Benchmarking Standards Group(ISBSG) repository, this paper presents software engineering project duration models based on project effort. Duration models are built for the entire dataset and for subsets of projects developed for personal computer, mid-range and mainframeplatforms. Duration models are also constructed for projects requiring fewer than 400 person-hours of effort and for projectsre quiring more than 400 person-hours of effort. The usefulness of adding the maximum number of assigned resources as asecond independent variable to explain duration is also analyzed. The opportunity to build duration models directly fromproject functional size in function points is investigated as well.

  6. 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…

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

  8. 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

  9. 20 CFR 10.806 - How are the maximum fees defined?

    Science.gov (United States)

    2010-04-01

    ... AMENDED Information for Medical Providers Medical Fee Schedule § 10.806 How are the maximum fees defined? For professional medical services, the Director shall maintain a schedule of maximum allowable fees.../Current Procedural Terminology (HCPCS/CPT) code which represents the relative skill, effort, risk and time...

  10. Maximum likely scale estimation

    DEFF Research Database (Denmark)

    Loog, Marco; Pedersen, Kim Steenstrup; Markussen, Bo

    2005-01-01

    A maximum likelihood local scale estimation principle is presented. An actual implementation of the estimation principle uses second order moments of multiple measurements at a fixed location in the image. These measurements consist of Gaussian derivatives possibly taken at several scales and/or ...

  11. Robust Maximum Association Estimators

    NARCIS (Netherlands)

    A. Alfons (Andreas); C. Croux (Christophe); P. Filzmoser (Peter)

    2017-01-01

    textabstractThe maximum association between two multivariate variables X and Y is defined as the maximal value that a bivariate association measure between one-dimensional projections αX and αY can attain. Taking the Pearson correlation as projection index results in the first canonical correlation

  12. 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.

  13. Maximum power point tracking

    International Nuclear Information System (INIS)

    Enslin, J.H.R.

    1990-01-01

    A well engineered renewable remote energy system, utilizing the principal of Maximum Power Point Tracking can be m ore cost effective, has a higher reliability and can improve the quality of life in remote areas. This paper reports that a high-efficient power electronic converter, for converting the output voltage of a solar panel, or wind generator, to the required DC battery bus voltage has been realized. The converter is controlled to track the maximum power point of the input source under varying input and output parameters. Maximum power point tracking for relative small systems is achieved by maximization of the output current in a battery charging regulator, using an optimized hill-climbing, inexpensive microprocessor based algorithm. Through practical field measurements it is shown that a minimum input source saving of 15% on 3-5 kWh/day systems can easily be achieved. A total cost saving of at least 10-15% on the capital cost of these systems are achievable for relative small rating Remote Area Power Supply systems. The advantages at larger temperature variations and larger power rated systems are much higher. Other advantages include optimal sizing and system monitor and control

  14. PLAN-IT - Scheduling assistant for solar system exploration

    International Nuclear Information System (INIS)

    Dias, W. C.; Henricks, J. A.; Wong, J. C.; California Institute of Technology, Pasadena)

    1987-01-01

    A frame-based expert scheduling system shell, PLAN-IT, is developed for spacecraft scheduling in the Request Integration Phase, using the Comet Rendezvous Asteroid Flyby (CRAF) mission as a development base. Basic, structured, and expert scheduling techniques are reviewed. Data elements such as activity representation and resource conflict representation are discussed. Resource constraints include minimum and maximum separation times between activities, percentage of time pointed at specific targets, and separation time between targeted intervals of a given activity. The different scheduling technique categories and the rationale for their selection are also considered. 13 references

  15. 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,...

  16. 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...

  17. 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.

  18. 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...

  19. 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....

  20. 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...

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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.

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

  8. 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....

  9. Maximum entropy methods

    International Nuclear Information System (INIS)

    Ponman, T.J.

    1984-01-01

    For some years now two different expressions have been in use for maximum entropy image restoration and there has been some controversy over which one is appropriate for a given problem. Here two further entropies are presented and it is argued that there is no single correct algorithm. The properties of the four different methods are compared using simple 1D simulations with a view to showing how they can be used together to gain as much information as possible about the original object. (orig.)

  10. The last glacial maximum

    Science.gov (United States)

    Clark, P.U.; Dyke, A.S.; Shakun, J.D.; Carlson, A.E.; Clark, J.; Wohlfarth, B.; Mitrovica, J.X.; Hostetler, S.W.; McCabe, A.M.

    2009-01-01

    We used 5704 14C, 10Be, and 3He ages that span the interval from 10,000 to 50,000 years ago (10 to 50 ka) to constrain the timing of the Last Glacial Maximum (LGM) in terms of global ice-sheet and mountain-glacier extent. Growth of the ice sheets to their maximum positions occurred between 33.0 and 26.5 ka in response to climate forcing from decreases in northern summer insolation, tropical Pacific sea surface temperatures, and atmospheric CO2. Nearly all ice sheets were at their LGM positions from 26.5 ka to 19 to 20 ka, corresponding to minima in these forcings. The onset of Northern Hemisphere deglaciation 19 to 20 ka was induced by an increase in northern summer insolation, providing the source for an abrupt rise in sea level. The onset of deglaciation of the West Antarctic Ice Sheet occurred between 14 and 15 ka, consistent with evidence that this was the primary source for an abrupt rise in sea level ???14.5 ka.

  11. 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

  12. Maximum Entropy Fundamentals

    Directory of Open Access Journals (Sweden)

    F. Topsøe

    2001-09-01

    Full Text Available Abstract: In its modern formulation, the Maximum Entropy Principle was promoted by E.T. Jaynes, starting in the mid-fifties. The principle dictates that one should look for a distribution, consistent with available information, which maximizes the entropy. However, this principle focuses only on distributions and it appears advantageous to bring information theoretical thinking more prominently into play by also focusing on the "observer" and on coding. This view was brought forward by the second named author in the late seventies and is the view we will follow-up on here. It leads to the consideration of a certain game, the Code Length Game and, via standard game theoretical thinking, to a principle of Game Theoretical Equilibrium. This principle is more basic than the Maximum Entropy Principle in the sense that the search for one type of optimal strategies in the Code Length Game translates directly into the search for distributions with maximum entropy. In the present paper we offer a self-contained and comprehensive treatment of fundamentals of both principles mentioned, based on a study of the Code Length Game. Though new concepts and results are presented, the reading should be instructional and accessible to a rather wide audience, at least if certain mathematical details are left aside at a rst reading. The most frequently studied instance of entropy maximization pertains to the Mean Energy Model which involves a moment constraint related to a given function, here taken to represent "energy". This type of application is very well known from the literature with hundreds of applications pertaining to several different elds and will also here serve as important illustration of the theory. But our approach reaches further, especially regarding the study of continuity properties of the entropy function, and this leads to new results which allow a discussion of models with so-called entropy loss. These results have tempted us to speculate over

  13. 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

  14. Probable maximum flood control

    International Nuclear Information System (INIS)

    DeGabriele, C.E.; Wu, C.L.

    1991-11-01

    This study proposes preliminary design concepts to protect the waste-handling facilities and all shaft and ramp entries to the underground from the probable maximum flood (PMF) in the current design configuration for the proposed Nevada Nuclear Waste Storage Investigation (NNWSI) repository protection provisions were furnished by the United States Bureau of Reclamation (USSR) or developed from USSR data. Proposed flood protection provisions include site grading, drainage channels, and diversion dikes. Figures are provided to show these proposed flood protection provisions at each area investigated. These areas are the central surface facilities (including the waste-handling building and waste treatment building), tuff ramp portal, waste ramp portal, men-and-materials shaft, emplacement exhaust shaft, and exploratory shafts facility

  15. Introduction to maximum entropy

    International Nuclear Information System (INIS)

    Sivia, D.S.

    1988-01-01

    The maximum entropy (MaxEnt) principle has been successfully used in image reconstruction in a wide variety of fields. We review the need for such methods in data analysis and show, by use of a very simple example, why MaxEnt is to be preferred over other regularizing functions. This leads to a more general interpretation of the MaxEnt method, and its use is illustrated with several different examples. Practical difficulties with non-linear problems still remain, this being highlighted by the notorious phase problem in crystallography. We conclude with an example from neutron scattering, using data from a filter difference spectrometer to contrast MaxEnt with a conventional deconvolution. 12 refs., 8 figs., 1 tab

  16. Solar maximum observatory

    International Nuclear Information System (INIS)

    Rust, D.M.

    1984-01-01

    The successful retrieval and repair of the Solar Maximum Mission (SMM) satellite by Shuttle astronauts in April 1984 permitted continuance of solar flare observations that began in 1980. The SMM carries a soft X ray polychromator, gamma ray, UV and hard X ray imaging spectrometers, a coronagraph/polarimeter and particle counters. The data gathered thus far indicated that electrical potentials of 25 MeV develop in flares within 2 sec of onset. X ray data show that flares are composed of compressed magnetic loops that have come too close together. Other data have been taken on mass ejection, impacts of electron beams and conduction fronts with the chromosphere and changes in the solar radiant flux due to sunspots. 13 references

  17. Introduction to maximum entropy

    International Nuclear Information System (INIS)

    Sivia, D.S.

    1989-01-01

    The maximum entropy (MaxEnt) principle has been successfully used in image reconstruction in a wide variety of fields. The author reviews the need for such methods in data analysis and shows, by use of a very simple example, why MaxEnt is to be preferred over other regularizing functions. This leads to a more general interpretation of the MaxEnt method, and its use is illustrated with several different examples. Practical difficulties with non-linear problems still remain, this being highlighted by the notorious phase problem in crystallography. He concludes with an example from neutron scattering, using data from a filter difference spectrometer to contrast MaxEnt with a conventional deconvolution. 12 refs., 8 figs., 1 tab

  18. Functional Maximum Autocorrelation Factors

    DEFF Research Database (Denmark)

    Larsen, Rasmus; Nielsen, Allan Aasbjerg

    2005-01-01

    MAF outperforms the functional PCA in concentrating the interesting' spectra/shape variation in one end of the eigenvalue spectrum and allows for easier interpretation of effects. Conclusions. Functional MAF analysis is a useful methods for extracting low dimensional models of temporally or spatially......Purpose. We aim at data where samples of an underlying function are observed in a spatial or temporal layout. Examples of underlying functions are reflectance spectra and biological shapes. We apply functional models based on smoothing splines and generalize the functional PCA in......\\verb+~+\\$\\backslash\\$cite{ramsay97} to functional maximum autocorrelation factors (MAF)\\verb+~+\\$\\backslash\\$cite{switzer85,larsen2001d}. We apply the method to biological shapes as well as reflectance spectra. {\\$\\backslash\\$bf Methods}. MAF seeks linear combination of the original variables that maximize autocorrelation between...

  19. Regularized maximum correntropy machine

    KAUST Repository

    Wang, Jim Jing-Yan; Wang, Yunji; Jing, Bing-Yi; Gao, Xin

    2015-01-01

    In this paper we investigate the usage of regularized correntropy framework for learning of classifiers from noisy labels. The class label predictors learned by minimizing transitional loss functions are sensitive to the noisy and outlying labels of training samples, because the transitional loss functions are equally applied to all the samples. To solve this problem, we propose to learn the class label predictors by maximizing the correntropy between the predicted labels and the true labels of the training samples, under the regularized Maximum Correntropy Criteria (MCC) framework. Moreover, we regularize the predictor parameter to control the complexity of the predictor. The learning problem is formulated by an objective function considering the parameter regularization and MCC simultaneously. By optimizing the objective function alternately, we develop a novel predictor learning algorithm. The experiments on two challenging pattern classification tasks show that it significantly outperforms the machines with transitional loss functions.

  20. Regularized maximum correntropy machine

    KAUST Repository

    Wang, Jim Jing-Yan

    2015-02-12

    In this paper we investigate the usage of regularized correntropy framework for learning of classifiers from noisy labels. The class label predictors learned by minimizing transitional loss functions are sensitive to the noisy and outlying labels of training samples, because the transitional loss functions are equally applied to all the samples. To solve this problem, we propose to learn the class label predictors by maximizing the correntropy between the predicted labels and the true labels of the training samples, under the regularized Maximum Correntropy Criteria (MCC) framework. Moreover, we regularize the predictor parameter to control the complexity of the predictor. The learning problem is formulated by an objective function considering the parameter regularization and MCC simultaneously. By optimizing the objective function alternately, we develop a novel predictor learning algorithm. The experiments on two challenging pattern classification tasks show that it significantly outperforms the machines with transitional loss functions.

  1. Multiprocessor Global Scheduling on Frame-Based DVFS Systems

    OpenAIRE

    Berten, Vandy; Goossens, Joël

    2008-01-01

    International audience; In this work, we are interested in multiprocessor energy efficient systems where task durations are not known in advance but are known stochastically. More precisely we consider global scheduling algorithms for frame-based multiprocessor stochastic DVFS (Dynamic Voltage and Frequency Scaling) systems. Moreover we consider processors with a discrete set of available frequencies. We provide a global scheduling algorithm, and formally show that no deadline will ever be mi...

  2. SU-F-19A-08: Optimal Time Release Schedule of In-Situ Drug Release During Permanent Prostate Brachytherapy

    International Nuclear Information System (INIS)

    Cormack, R; Ngwa, W; Makrigiorgos, G; Tangutoori, S; Rajiv, K; Sridhar, S

    2014-01-01

    Purpose: Permanent prostate brachytherapy spacers can be used to deliver sustained doses of radiosentitizing drug directly to the target, in order to enhance the radiation effect. Implantable nanoplatforms for chemo-radiation therapy (INCeRTs) have a maximum drug capacity and can be engineered to control the drug release schedule. The optimal schedule for sensitization during continuous low dose rate irradiation is unknown. This work studies the optimal release schedule of drug for both traditional sensitizers, and those that work by suppressing DNA repair processes. Methods: Six brachytherapy treatment plans were used to model the anatomy, implant geometry and calculate the spatial distribution of radiation dose and drug concentrations for a range of drug diffusion parameters. Three state partial differential equations (cells healthy, damaged or dead) modeled the effect of continuous radiation (radiosensitivities α,β) and cellular repair (time tr) on a cell population. Radiosensitization was modeled as concentration dependent change in α,β or tr which with variable duration under the constraint of fixed total drug release. Average cell kill was used to measure effectiveness. Sensitization by means of both enhanced damage and reduced repair were studied. Results: Optimal release duration is dependent on the concentration of radiosensitizer compared to the saturation concentration (csat) above which additional sensitization does not occur. Long duration drug release when enhancing α or β maximizes cell death when drug concentrations are generally over csat. Short term release is optimal for concentrations below saturation. Sensitization by suppressing repair has a similar though less distinct trend that is more affected by the radiation dose distribution. Conclusion: Models of sustained local radiosensitization show potential to increase the effectiveness of radiation in permanent prostate brachytherapy. INCeRTs with high drug capacity produce the greatest

  3. 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.

  4. 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.

  5. 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...

  6. Duration Calculus: Logical Foundations

    DEFF Research Database (Denmark)

    Hansen, Michael Reichhardt; Chaochen, Zhou

    1997-01-01

    The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...

  7. Duration of load revisited

    DEFF Research Database (Denmark)

    Hoffmeyer, Preben; Sørensen, John Dalsgaard

    2007-01-01

    A duration of load study representing 13 years of testing was recently terminated. Preliminary results have been published over the years. This paper represents the final account of the study, which was focused on the influ-ence of moisture content on time to failure for structural timber subject...

  8. duration diabetes mellitus

    African Journals Online (AJOL)

    ... group, type of diabetes, age of onset and duration of diabetes), presence of retinopathy, markers of nephropathy and biochemical variables. ... type 2 diabetes and for each ethnic group. Results. ... time of diabetes diagnosis in blacks than Indians. In the type ... countries, minority groups and disadvantaged communities in.

  9. ‘It is time to prepare the next patient’ real-time prediction of procedure duration in laparoscopic cholecystectomies

    NARCIS (Netherlands)

    Geudon, A.C.P.; Paalvast, M.S.M.; Meeuwsen, F.C.; Tax, D.M.J.; van Dijke, A.P.; Wauben, L.S.G.L.; van der Elst, M; Dankelman, J.; van den Dobbelsteen, J.J.

    2016-01-01

    Operating Room (OR) scheduling is crucial to allow efficient use of ORs. Currently, the predicted durations of surgical procedures are unreliable and the OR schedulers have to follow the progress of the procedures in order to update the daily planning accordingly. The OR schedulers often acquire

  10. Adaptation to an Illusory Duration: Nothing Like the Real Thing?

    Directory of Open Access Journals (Sweden)

    John Hotchkiss

    2012-05-01

    Full Text Available Recent work has shown that adapting to a visual or auditory stimulus of a particular duration leads to a repulsive distortion of the perceived duration of a subsequently presented test stimulus. This distortion seems to be modality-specific and manifests itself as an expansion or contraction of perceived duration dependent upon whether the test stimulus is longer or shorter than the adapted duration. It has been shown (Berger et al 2003, Journal of Vision 3, 406–412 that perceived events can be as effective as actual events in inducing improvements in performance. In light of this, we investigated whether an illusory visual duration was capable of inducing a duration after-effect in a visual test stimulus that was actually no different in duration from the adaptor. Pairing a visual stimulus with a concurrent auditory stimulus of subtly longer or shorter duration expands or contracts the duration of the visual stimulus. We mapped out this effect and then chose two auditory durations (one long, one short that produced the maximum distortion in the perceived duration of the visual stimulus. After adapting to this bimodal stimulus, our participants were asked to reproduce a visual duration. Group data showed that participants, on average, reproduced the physical duration of the visual test stimulus accurately; in other words, there was no consistent effect of adaptation to an illusory duration.

  11. Statistical analysis of random duration times

    International Nuclear Information System (INIS)

    Engelhardt, M.E.

    1996-04-01

    This report presents basic statistical methods for analyzing data obtained by observing random time durations. It gives nonparametric estimates of the cumulative distribution function, reliability function and cumulative hazard function. These results can be applied with either complete or censored data. Several models which are commonly used with time data are discussed, and methods for model checking and goodness-of-fit tests are discussed. Maximum likelihood estimates and confidence limits are given for the various models considered. Some results for situations where repeated durations such as repairable systems are also discussed

  12. 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.

  13. Master schedule for CY-1981 Hanford environmental surveillance routine program

    International Nuclear Information System (INIS)

    Blumer, P.J.; Sula, M.J.; Eddy, P.A.

    1980-12-01

    The current schedule of data collection for the routine environmental surveillance program at the Hanford Site is provided. Questions about specific entries should be referred to the authors since modifications to the schedule are made during the year and special areas of study, usually of short duration, are not scheduled. The environmental surveillance program objectives are to evaluate the levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in Manual Chapter 0513, and to monitor Hanford operations for compliance with applicable environmental criteria given in Manual Chapter 0524 and Washington State Water Quality Standards. Air quality data obtained in a separate program are also reported. The collection schedule for potable water is shown but it is not part of the routine environmental surveillance program. Schedules are presented for the following subjects: air, Columbia River, sanitary water, surface water, ground water, foodstuffs, wildlife, soil and vegetation, external radiation measurement, portable instrument surveys, and surveillance of waste disposal sites

  14. Solar maximum mission

    International Nuclear Information System (INIS)

    Ryan, J.

    1981-01-01

    By understanding the sun, astrophysicists hope to expand this knowledge to understanding other stars. To study the sun, NASA launched a satellite on February 14, 1980. The project is named the Solar Maximum Mission (SMM). The satellite conducted detailed observations of the sun in collaboration with other satellites and ground-based optical and radio observations until its failure 10 months into the mission. The main objective of the SMM was to investigate one aspect of solar activity: solar flares. A brief description of the flare mechanism is given. The SMM satellite was valuable in providing information on where and how a solar flare occurs. A sequence of photographs of a solar flare taken from SMM satellite shows how a solar flare develops in a particular layer of the solar atmosphere. Two flares especially suitable for detailed observations by a joint effort occurred on April 30 and May 21 of 1980. These flares and observations of the flares are discussed. Also discussed are significant discoveries made by individual experiments

  15. 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.

  16. 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.

  17. 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,

  18. 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

  19. 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

  20. "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…

  1. Strong motion duration and earthquake magnitude relationships

    International Nuclear Information System (INIS)

    Salmon, M.W.; Short, S.A.; Kennedy, R.P.

    1992-06-01

    Earthquake duration is the total time of ground shaking from the arrival of seismic waves until the return to ambient conditions. Much of this time is at relatively low shaking levels which have little effect on seismic structural response and on earthquake damage potential. As a result, a parameter termed ''strong motion duration'' has been defined by a number of investigators to be used for the purpose of evaluating seismic response and assessing the potential for structural damage due to earthquakes. This report presents methods for determining strong motion duration and a time history envelope function appropriate for various evaluation purposes, for earthquake magnitude and distance, and for site soil properties. There are numerous definitions of strong motion duration. For most of these definitions, empirical studies have been completed which relate duration to earthquake magnitude and distance and to site soil properties. Each of these definitions recognizes that only the portion of an earthquake record which has sufficiently high acceleration amplitude, energy content, or some other parameters significantly affects seismic response. Studies have been performed which indicate that the portion of an earthquake record in which the power (average rate of energy input) is maximum correlates most closely with potential damage to stiff nuclear power plant structures. Hence, this report will concentrate on energy based strong motion duration definitions

  2. A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper

    2011-01-01

    in their fresh meat supply logistics system. The problem consists of a 1‐week planning horizon, heterogeneous vehicles, and drivers with predefined work regulations. These regulations include, among other things, predefined workdays, fixed starting time, maximum weekly working duration, and a break rule......The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Crown....... The objective is to minimize the total delivery cost that is a weighted sum of two kinds of delivery costs. A multilevel variable neighborhood search heuristic is proposed for the problem. In a preprocessing step, the problem size is reduced through an aggregation procedure. Thereafter, the aggregated weekly...

  3. On the maximum drawdown during speculative bubbles

    Science.gov (United States)

    Rotundo, Giulia; Navarra, Mauro

    2007-08-01

    A taxonomy of large financial crashes proposed in the literature locates the burst of speculative bubbles due to endogenous causes in the framework of extreme stock market crashes, defined as falls of market prices that are outlier with respect to the bulk of drawdown price movement distribution. This paper goes on deeper in the analysis providing a further characterization of the rising part of such selected bubbles through the examination of drawdown and maximum drawdown movement of indices prices. The analysis of drawdown duration is also performed and it is the core of the risk measure estimated here.

  4. 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.

  5. 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...

  6. Duration in Production Contracts

    OpenAIRE

    MacDonald, James M.; Korb, Penelope J.

    2006-01-01

    We use 2003 and 2004 ARMS data to analyze variations in contract duration among growers of broilers who hold production contracts. Most contracts cover just a single flock, but many extend for 1-2 years, and a significant minority of broiler contracts specify lengths of 5, 10, and even 15 years. We find that grower debt and production volume are inversely related to the choice of a short term (a year or less) contract, while lengthy prior experience with the contractor promotes short term con...

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

  8. Cost-efficient scheduling of FAST observations

    Science.gov (United States)

    Luo, Qi; Zhao, Laiping; Yu, Ce; Xiao, Jian; Sun, Jizhou; Zhu, Ming; Zhong, Yi

    2018-03-01

    A cost-efficient schedule for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) requires to maximize the number of observable proposals and the overall scientific priority, and minimize the overall slew-cost generated by telescope shifting, while taking into account the constraints including the astronomical objects visibility, user-defined observable times, avoiding Radio Frequency Interference (RFI). In this contribution, first we solve the problem of maximizing the number of observable proposals and scientific priority by modeling it as a Minimum Cost Maximum Flow (MCMF) problem. The optimal schedule can be found by any MCMF solution algorithm. Then, for minimizing the slew-cost of the generated schedule, we devise a maximally-matchable edges detection-based method to reduce the problem size, and propose a backtracking algorithm to find the perfect matching with minimum slew-cost. Experiments on a real dataset from NASA/IPAC Extragalactic Database (NED) show that, the proposed scheduler can increase the usage of available times with high scientific priority and reduce the slew-cost significantly in a very short time.

  9. A new variable interval schedule with constant hazard rate and finite time range.

    Science.gov (United States)

    Bugallo, Mehdi; Machado, Armando; Vasconcelos, Marco

    2018-05-27

    We propose a new variable interval (VI) schedule that achieves constant probability of reinforcement in time while using a bounded range of intervals. By sampling each trial duration from a uniform distribution ranging from 0 to 2 T seconds, and then applying a reinforcement rule that depends linearly on trial duration, the schedule alternates reinforced and unreinforced trials, each less than 2 T seconds, while preserving a constant hazard function. © 2018 Society for the Experimental Analysis of Behavior.

  10. Development of Milestone Schedules for Selected Logistics Support Directorate Programs. Appendix A. Part 2. Task Summaries.

    Science.gov (United States)

    1987-09-15

    LOGISTIC SUPPORT (ILS) COST ESTIMATE SCODE NUMBER: NONE -ESPONSIBILITY: ROY & ILS ’,!,RATION: 22.00 WORK DAYS A-221 * .9 ..- 9 * PAGE: .LSMTEST SCHEDULE: CE...0/ TIPO SCHEDULE: DV CONDUCT A PERFORMANCE DEMONSTRATION PRIOR TO TECHNICAL TEST CODE NUMBER: NONE (TT) I AND USER TEST (UT) I. RESPONSIBILITY...RESPONSIBILITY: BELVOIR LAB DURATION: 20.00 WORK DAYS ENG DE I SCHEDULE: DV ENGINEERING DESIGN INITIATED. CODE NUMBER: NONE RESPONSIBILITY: BELVOIR LAB

  11. 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

  12. Project Scheduling Based on Risk of Gas Transmission Pipe

    Science.gov (United States)

    Silvianita; Nurbaity, A.; Mulyadi, Y.; Suntoyo; Chamelia, D. M.

    2018-03-01

    The planning of a project has a time limit on which must be completed before or right at a predetermined time. Thus, in a project planning, it is necessary to have scheduling management that is useful for completing a project to achieve maximum results by considering the constraints that will exists. Scheduling management is undertaken to deal with uncertainties and negative impacts of time and cost in project completion. This paper explains about scheduling management in gas transmission pipeline project Gresik-Semarang to find out which scheduling plan is most effectively used in accordance with its risk value. Scheduling management in this paper is assissted by Microsoft Project software to find the critical path of existing project scheduling planning data. Critical path is the longest scheduling path with the fastest completion time. The result is found a critical path on project scheduling with completion time is 152 days. Furthermore, the calculation of risk is done by using House of Risk (HOR) method and it is found that the critical path has a share of 40.98 percent of all causes of the occurence of risk events that will be experienced.

  13. 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.

  14. 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...

  15. Credal Networks under Maximum Entropy

    OpenAIRE

    Lukasiewicz, Thomas

    2013-01-01

    We apply the principle of maximum entropy to select a unique joint probability distribution from the set of all joint probability distributions specified by a credal network. In detail, we start by showing that the unique joint distribution of a Bayesian tree coincides with the maximum entropy model of its conditional distributions. This result, however, does not hold anymore for general Bayesian networks. We thus present a new kind of maximum entropy models, which are computed sequentially. ...

  16. Rats do not respond differently in the presence of stimuli signaling wheel-running reinforcers of different durations.

    Science.gov (United States)

    Belke, Terry W

    2007-05-01

    Rats were exposed to a fixed interval 30 s schedule that produced opportunities to run of equal or unequal durations to assess the effect of differences in duration on responding. Each duration was signaled by a different stimulus. Wheel-running reinforcer duration pairs were 30 s 30 s, 50 s 10 s, and 55 s 5 s. An analysis of median postreinforcement pause duration and mean local lever-pressing rates broken down by previous reinforcer duration and duration of signaled upcoming reinforcer showed that postreinforcement pause duration was affected by the duration of the previous reinforcer but not by the stimulus signaling the duration of the upcoming reinforcer. Local lever-pressing rates were not affected by either previous or upcoming reinforcer duration. In general, the results are consistent with indifference between these durations obtained using a concurrent choice procedure.

  17. 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.

  18. 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.

  19. Duration judgements over multiple elements

    Directory of Open Access Journals (Sweden)

    Inci eAyhan

    2012-11-01

    Full Text Available We investigated the limits of the number of events observers can simultaneously time. For single targets occurring in one of eight positions sensitivity to duration was improved for spatially pre-cued items as compared to post-cued items indicating that exogenous driven attention can improve duration discrimination. Sensitivity to duration for pre-cued items was also marginally better for single items as compared to eight items indicating that even after the allocation of focal attention, distracter items can interfere with the encoding of duration. For an eight item array discrimination was worse for post-cued locations as compared to pre-cued locations indicating both that attention can improve duration discrimination performance and that it was not possible to access a perfect memory trace of the duration of eight elements. The interference from the distracters in the pre-cued eight item array may reflect some mandatory averaging of target and distracter events. To further explore duration averaging we asked subjects to explicitly compare average durations of multiple item arrays against a single item standard duration. Duration discrimination thresholds were significantly lower for single elements as compared to multiple elements, showing that averaging, either automatically or intentionally, impairs duration discrimination. There was no set size effect. Performance was the same for averages of two and eight items, but performance with even an average of two items was worse than for one item. This was also true for sequential presentation indicating poor performance was not due to limits on the division of attention across items. Rather performance appears to be limited by an inability to remember or aggregate duration information from two or more items. Although it is possible to manipulate perceived duration locally, there appears to be no perceptual mechanisms for aggregating local durations across space.

  20. Cognitive Assessment in Long-Duration Space Flight

    Science.gov (United States)

    Kane, Robert; Seaton, Kimberly; Sipes, Walter

    2011-01-01

    This slide presentation reviews the development and use of a tool for assessing spaceflight cognitive ability in astronauts. This tool. the Spaceflight Cognitive Assessment Tool for Windows (WinSCAT) has been used to provide ISS flight surgeons with an objective clinical tool to monitor the astronauts cognitive status during long-duration space flight and allow immediate feedback to the astronaut. Its use is medically required for all long-duration missions and it contains a battery of five cognitive assessment subtests that are scheduled monthly and compared against the individual preflight baseline.

  1. 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...

  2. 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.

  3. Probabilistic maximum-value wind prediction for offshore environments

    DEFF Research Database (Denmark)

    Staid, Andrea; Pinson, Pierre; Guikema, Seth D.

    2015-01-01

    statistical models to predict the full distribution of the maximum-value wind speeds in a 3 h interval. We take a detailed look at the performance of linear models, generalized additive models and multivariate adaptive regression splines models using meteorological covariates such as gust speed, wind speed......, convective available potential energy, Charnock, mean sea-level pressure and temperature, as given by the European Center for Medium-Range Weather Forecasts forecasts. The models are trained to predict the mean value of maximum wind speed, and the residuals from training the models are used to develop...... the full probabilistic distribution of maximum wind speed. Knowledge of the maximum wind speed for an offshore location within a given period can inform decision-making regarding turbine operations, planned maintenance operations and power grid scheduling in order to improve safety and reliability...

  4. 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.

  5. 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...

  6. 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.

  7. Scheduling language and algorithm development study. Volume 2: Use of the basic language and module library

    Science.gov (United States)

    Chamberlain, R. A.; Cornick, D. E.; Flater, J. F.; Odoherty, R. J.; Peterson, F. M.; Ramsey, H. R.; Willoughby, J. K.

    1974-01-01

    The capabilities of the specified scheduling language and the program module library are outlined. The summary is written with the potential user in mind and, therefore, provides maximum insight on how the capabilities will be helpful in writing scheduling programs. Simple examples and illustrations are provided to assist the potential user in applying the capabilities of his problem.

  8. Controlling maximum evaluation duration in on-line and on-board evolutionary robotics

    NARCIS (Netherlands)

    Atta-ul-Qayyum, A.; Nedev, D.G.; Haasdijk, E.W.

    2014-01-01

    On-line evolution of robot controllers allows robots to adapt while they perform their proper tasks. In our investigations, robots contain their own self-sufficient evolutionary algorithm (known as the encapsulated approach) where individual solutions are evaluated by means of a time sharing scheme:

  9. Comparison of annual maximum series and partial duration series methods for modeling extreme hydrologic events

    DEFF Research Database (Denmark)

    Madsen, Henrik; Pearson, Charles P.; Rosbjerg, Dan

    1997-01-01

    procedures are subsequently applied to flood records from 48 catchments in New Zealand. To identify homogeneous groupings of catchments, a split-sample regionalization approach based on catchment characteristics is adopted. The defined groups are more homogeneous for PDS data than for AMS data; a two...

  10. 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

  11. 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.

  12. 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.

  13. 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…

  14. 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)

  15. 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...

  16. A Study of the Pelagic Larval Duration of Acropora humilis, Coral Recruitment and Connectivity in the Saudi Arabian Red Sea

    KAUST Repository

    Khalil, Maha

    2011-01-01

    Combined knowledge of the pelagic larval duration of coral species and coral recruitment patterns can provide evidence of inter-reef connectivity and indicate a reef’s ability to recover. We attempted to determine the maximum pelagic larval duration

  17. Maximum Entropy in Drug Discovery

    Directory of Open Access Journals (Sweden)

    Chih-Yuan Tseng

    2014-07-01

    Full Text Available Drug discovery applies multidisciplinary approaches either experimentally, computationally or both ways to identify lead compounds to treat various diseases. While conventional approaches have yielded many US Food and Drug Administration (FDA-approved drugs, researchers continue investigating and designing better approaches to increase the success rate in the discovery process. In this article, we provide an overview of the current strategies and point out where and how the method of maximum entropy has been introduced in this area. The maximum entropy principle has its root in thermodynamics, yet since Jaynes’ pioneering work in the 1950s, the maximum entropy principle has not only been used as a physics law, but also as a reasoning tool that allows us to process information in hand with the least bias. Its applicability in various disciplines has been abundantly demonstrated. We give several examples of applications of maximum entropy in different stages of drug discovery. Finally, we discuss a promising new direction in drug discovery that is likely to hinge on the ways of utilizing maximum entropy.

  18. The influence of the operating schedule of the Greek Research Reactor on the radiological consequences of the reactor

    International Nuclear Information System (INIS)

    Kollas, J.G.

    1986-04-01

    The sensitivity of the radiological consequences of the Greek Research Reactor to the operating schedule of the reactor is assessed in this report. The consequences are due to the occurrence of a postulated accident, a 20% core melt loss of coolant accident. Three different operating schedules are considered: (a) the present 8 hrs/day, 5 days/wk schedule, (b) a 16 hrs/day, 5 days/wk schedule, and (c) a continuous operation schedule. The results of the analysis indicate that there is a direct relation between consequences and duration of operation. (author)

  19. Prediction Based Proactive Thermal Virtual Machine Scheduling in Green Clouds

    Science.gov (United States)

    Kinger, Supriya; Kumar, Rajesh; Sharma, Anju

    2014-01-01

    Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM) scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs) before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated. PMID:24737962

  20. Prediction Based Proactive Thermal Virtual Machine Scheduling in Green Clouds

    Directory of Open Access Journals (Sweden)

    Supriya Kinger

    2014-01-01

    Full Text Available Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated.

  1. Prediction based proactive thermal virtual machine scheduling in green clouds.

    Science.gov (United States)

    Kinger, Supriya; Kumar, Rajesh; Sharma, Anju

    2014-01-01

    Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM) scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs) before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated.

  2. 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....

  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. Maximum stellar iron core mass

    Indian Academy of Sciences (India)

    60, No. 3. — journal of. March 2003 physics pp. 415–422. Maximum stellar iron core mass. F W GIACOBBE. Chicago Research Center/American Air Liquide ... iron core compression due to the weight of non-ferrous matter overlying the iron cores within large .... thermal equilibrium velocities will tend to be non-relativistic.

  5. Maximum entropy beam diagnostic tomography

    International Nuclear Information System (INIS)

    Mottershead, C.T.

    1985-01-01

    This paper reviews the formalism of maximum entropy beam diagnostic tomography as applied to the Fusion Materials Irradiation Test (FMIT) prototype accelerator. The same formalism has also been used with streak camera data to produce an ultrahigh speed movie of the beam profile of the Experimental Test Accelerator (ETA) at Livermore. 11 refs., 4 figs

  6. Maximum entropy beam diagnostic tomography

    International Nuclear Information System (INIS)

    Mottershead, C.T.

    1985-01-01

    This paper reviews the formalism of maximum entropy beam diagnostic tomography as applied to the Fusion Materials Irradiation Test (FMIT) prototype accelerator. The same formalism has also been used with streak camera data to produce an ultrahigh speed movie of the beam profile of the Experimental Test Accelerator (ETA) at Livermore

  7. A portable storage maximum thermometer

    International Nuclear Information System (INIS)

    Fayart, Gerard.

    1976-01-01

    A clinical thermometer storing the voltage corresponding to the maximum temperature in an analog memory is described. End of the measurement is shown by a lamp switch out. The measurement time is shortened by means of a low thermal inertia platinum probe. This portable thermometer is fitted with cell test and calibration system [fr

  8. A Review Of Fault Tolerant Scheduling In Multicore Systems

    Directory of Open Access Journals (Sweden)

    Shefali Malhotra

    2015-05-01

    Full Text Available Abstract In this paper we have discussed about various fault tolerant task scheduling algorithm for multi core system based on hardware and software. Hardware based algorithm which is blend of Triple Modulo Redundancy and Double Modulo Redundancy in which Agricultural Vulnerability Factor is considered while deciding the scheduling other than EDF and LLF scheduling algorithms. In most of the real time system the dominant part is shared memory.Low overhead software based fault tolerance approach can be implemented at user-space level so that it does not require any changes at application level. Here redundant multi-threaded processes are used. Using those processes we can detect soft errors and recover from them. This method gives low overhead fast error detection and recovery mechanism. The overhead incurred by this method ranges from 0 to 18 for selected benchmarks. Hybrid Scheduling Method is another scheduling approach for real time systems. Dynamic fault tolerant scheduling gives high feasibility rate whereas task criticality is used to select the type of fault recovery method in order to tolerate the maximum number of faults.

  9. Neutron spectra unfolding with maximum entropy and maximum likelihood

    International Nuclear Information System (INIS)

    Itoh, Shikoh; Tsunoda, Toshiharu

    1989-01-01

    A new unfolding theory has been established on the basis of the maximum entropy principle and the maximum likelihood method. This theory correctly embodies the Poisson statistics of neutron detection, and always brings a positive solution over the whole energy range. Moreover, the theory unifies both problems of overdetermined and of underdetermined. For the latter, the ambiguity in assigning a prior probability, i.e. the initial guess in the Bayesian sense, has become extinct by virtue of the principle. An approximate expression of the covariance matrix for the resultant spectra is also presented. An efficient algorithm to solve the nonlinear system, which appears in the present study, has been established. Results of computer simulation showed the effectiveness of the present theory. (author)

  10. Optimising radiation outcomes, scheduling patient waiting lists for maximum population tumour control

    International Nuclear Information System (INIS)

    Ebert, M.A.; Jennings, L.; Kearvell, R.; Bydder, S.

    2011-01-01

    Full text: Delays in the commencement of radiotherapy, possibly due to resource constraints, are known to impact on control-related outcomes. We sought an objective solution for patient prioritisation based on tumour control probability (TCP). With a utilitarian objective for maximising TCP in a population of M patients, with patient i waiting a time between diagnosis and treatment of Ti and a mean wait time of TMean, the optimisation problem is as shown. A linear-quadratic/Poissonian model for cell survival/TCP was considered including cell doubling during the wait time. Solutions to several distributions of patient population characteristics were examined together with the expected change in TCP for the population and individuals. An analytical solution to the optimisation problem was found which gives the optimal wait time for each patient as a function of the distribution of radiobiological characteristics in the population. This solution does not allow a negativity constraint on an individual's optimised waiting time so a waiting list simulation was developed to enforce that. Optimal wait time distributions were calculated for situations where patients are allocated distinct diagnostic groups (sharing radiobiological parameters) and for a (log-normal) distribution of doubling times in the population. In order to meet the utilitarian objective, the optimal solutions require patients with rapid cell doubling times to be accelerated up the waiting list at the expense of those with slowly proliferating tumours. The net population benefit however is comparable to or greater then the expected benefit from beam intensity modulation or dose escalation.

  11. 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 ...

  12. 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

  13. 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...

  14. 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.

  15. 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...

  16. 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

  17. Synthesizing controllers from duration calculus

    DEFF Research Database (Denmark)

    Fränzle, Martin

    1996-01-01

    Duration Calculus is a logic for reasoning about requirements for real-time systems at a high level of abstraction from operational detail, which qualifies it as an interesting starting point for embedded controller design. Such a design activity is generally thought to aim at a control device...... the physical behaviours of which satisfy the requirements formula, i.e. the refinement relation between requirements and implementations is taken to be trajectory inclusion. Due to the abstractness of the vocabulary of Duration Calculus, trajectory inclusion between control requirements and controller designs...... for embedded controller design and exploit this fact for developing an automatic procedure for controller synthesis from specifications formalized in Duration Calculus. As far as we know, this is the first positive result concerning feasibility of automatic synthesis from dense-time Duration Calculus....

  18. 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.

  19. ELIMINATION OF THE DISADVANTAGES OF SCHEDULING-NETWORK PLANNING BY APPLYING THE MATRIX OF KEY PROJECT EVENTS

    OpenAIRE

    Morozenko Andrey Aleksandrovich; Krasovskiy Dmitriy Viktorovich

    2017-01-01

    The article discusses the current disadvantages of the scheduling-network planning in the management of the terms of investment-construction project. Problems associated with the construction of the schedule and the definitions of the duration of the construction project are being studied. The problems of project management for the management apparatus are shown, which consists in the absence of mechanisms for prompt response to deviations in the parameters of the scheduling-network diagram. ...

  20. On Maximum Entropy and Inference

    Directory of Open Access Journals (Sweden)

    Luigi Gresele

    2017-11-01

    Full Text Available Maximum entropy is a powerful concept that entails a sharp separation between relevant and irrelevant variables. It is typically invoked in inference, once an assumption is made on what the relevant variables are, in order to estimate a model from data, that affords predictions on all other (dependent variables. Conversely, maximum entropy can be invoked to retrieve the relevant variables (sufficient statistics directly from the data, once a model is identified by Bayesian model selection. We explore this approach in the case of spin models with interactions of arbitrary order, and we discuss how relevant interactions can be inferred. In this perspective, the dimensionality of the inference problem is not set by the number of parameters in the model, but by the frequency distribution of the data. We illustrate the method showing its ability to recover the correct model in a few prototype cases and discuss its application on a real dataset.

  1. Maximum Water Hammer Sensitivity Analysis

    OpenAIRE

    Jalil Emadi; Abbas Solemani

    2011-01-01

    Pressure waves and Water Hammer occur in a pumping system when valves are closed or opened suddenly or in the case of sudden failure of pumps. Determination of maximum water hammer is considered one of the most important technical and economical items of which engineers and designers of pumping stations and conveyance pipelines should take care. Hammer Software is a recent application used to simulate water hammer. The present study focuses on determining significance of ...

  2. Maximum Gene-Support Tree

    Directory of Open Access Journals (Sweden)

    Yunfeng Shan

    2008-01-01

    Full Text Available Genomes and genes diversify during evolution; however, it is unclear to what extent genes still retain the relationship among species. Model species for molecular phylogenetic studies include yeasts and viruses whose genomes were sequenced as well as plants that have the fossil-supported true phylogenetic trees available. In this study, we generated single gene trees of seven yeast species as well as single gene trees of nine baculovirus species using all the orthologous genes among the species compared. Homologous genes among seven known plants were used for validation of the finding. Four algorithms—maximum parsimony (MP, minimum evolution (ME, maximum likelihood (ML, and neighbor-joining (NJ—were used. Trees were reconstructed before and after weighting the DNA and protein sequence lengths among genes. Rarely a gene can always generate the “true tree” by all the four algorithms. However, the most frequent gene tree, termed “maximum gene-support tree” (MGS tree, or WMGS tree for the weighted one, in yeasts, baculoviruses, or plants was consistently found to be the “true tree” among the species. The results provide insights into the overall degree of divergence of orthologous genes of the genomes analyzed and suggest the following: 1 The true tree relationship among the species studied is still maintained by the largest group of orthologous genes; 2 There are usually more orthologous genes with higher similarities between genetically closer species than between genetically more distant ones; and 3 The maximum gene-support tree reflects the phylogenetic relationship among species in comparison.

  3. LCLS Maximum Credible Beam Power

    International Nuclear Information System (INIS)

    Clendenin, J.

    2005-01-01

    The maximum credible beam power is defined as the highest credible average beam power that the accelerator can deliver to the point in question, given the laws of physics, the beam line design, and assuming all protection devices have failed. For a new accelerator project, the official maximum credible beam power is determined by project staff in consultation with the Radiation Physics Department, after examining the arguments and evidence presented by the appropriate accelerator physicist(s) and beam line engineers. The definitive parameter becomes part of the project's safety envelope. This technical note will first review the studies that were done for the Gun Test Facility (GTF) at SSRL, where a photoinjector similar to the one proposed for the LCLS is being tested. In Section 3 the maximum charge out of the gun for a single rf pulse is calculated. In Section 4, PARMELA simulations are used to track the beam from the gun to the end of the photoinjector. Finally in Section 5 the beam through the matching section and injected into Linac-1 is discussed

  4. Responsive versus scheduled feeding for preterm infants.

    Science.gov (United States)

    Watson, Julie; McGuire, William

    2015-10-13

    Feeding preterm infants in response to their hunger and satiation cues (responsive, cue-based, or infant-led feeding) rather than at scheduled intervals might enhance infants' and parents' experience and satisfaction, help in the establishment of independent oral feeding, increase nutrient intake and growth rates, and allow earlier hospital discharge. To assess the effect of feeding preterm infants on a responsive basis versus feeding prescribed volumes at scheduled intervals on growth, duration of hospital stay, and parental satisfaction. We used the standard search strategy of the Cochrane Neonatal Review Group. This included searches of the Cochrane Central Register of Controlled Trials (CENTRAL, The Cochrane Library, Issue 9, 2015), MEDLINE (1966 to September 2015), EMBASE (1980 to September 2015), and CINAHL (1982 to September 2015), conference proceedings, previous reviews, and trial registries. Randomised controlled trials (RCTs) or quasi-RCTs that compared a policy of feeding preterm infants on a responsive basis versus feeding at scheduled intervals. Two review authors assessed trial eligibility and risk of bias and undertook data extraction independently. We analysed the treatment effects in the individual trials and reported the risk ratio and risk difference for dichotomous data and mean difference (MD) for continuous data, with respective 95% confidence intervals (CIs). We used a fixed-effect model in meta-analyses and explored the potential causes of heterogeneity in sensitivity analyses. We found nine eligible RCTs including 593 infants in total. These trials compared responsive with scheduled interval regimens in preterm infants in the transition phase from intragastric tube to oral feeding. The trials were generally small and contained various methodological weaknesses including lack of blinding and incomplete assessment of all randomised participants. Meta-analyses, although limited by data quality and availability, suggest that responsive feeding

  5. An Efficient Algorithm for the Maximum Distance Problem

    Directory of Open Access Journals (Sweden)

    Gabrielle Assunta Grün

    2001-12-01

    Full Text Available Efficient algorithms for temporal reasoning are essential in knowledge-based systems. This is central in many areas of Artificial Intelligence including scheduling, planning, plan recognition, and natural language understanding. As such, scalability is a crucial consideration in temporal reasoning. While reasoning in the interval algebra is NP-complete, reasoning in the less expressive point algebra is tractable. In this paper, we explore an extension to the work of Gerevini and Schubert which is based on the point algebra. In their seminal framework, temporal relations are expressed as a directed acyclic graph partitioned into chains and supported by a metagraph data structure, where time points or events are represented by vertices, and directed edges are labelled with < or ≤. They are interested in fast algorithms for determining the strongest relation between two events. They begin by developing fast algorithms for the case where all points lie on a chain. In this paper, we are interested in a generalization of this, namely we consider the problem of finding the maximum ``distance'' between two vertices in a chain ; this problem arises in real world applications such as in process control and crew scheduling. We describe an O(n time preprocessing algorithm for the maximum distance problem on chains. It allows queries for the maximum number of < edges between two vertices to be answered in O(1 time. This matches the performance of the algorithm of Gerevini and Schubert for determining the strongest relation holding between two vertices in a chain.

  6. Intercell scheduling: A negotiation approach using multi-agent coalitions

    Science.gov (United States)

    Tian, Yunna; Li, Dongni; Zheng, Dan; Jia, Yunde

    2016-10-01

    Intercell scheduling problems arise as a result of intercell transfers in cellular manufacturing systems. Flexible intercell routes are considered in this article, and a coalition-based scheduling (CBS) approach using distributed multi-agent negotiation is developed. Taking advantage of the extended vision of the coalition agents, the global optimization is improved and the communication cost is reduced. The objective of the addressed problem is to minimize mean tardiness. Computational results show that, compared with the widely used combinatorial rules, CBS provides better performance not only in minimizing the objective, i.e. mean tardiness, but also in minimizing auxiliary measures such as maximum completion time, mean flow time and the ratio of tardy parts. Moreover, CBS is better than the existing intercell scheduling approach for the same problem with respect to the solution quality and computational costs.

  7. Scheduling home appliances for energy efficient buildings

    DEFF Research Database (Denmark)

    Rossello Busquet, Ana; Kardaras, Georgios; Iversen, Villy Bæk

    2010-01-01

    The number of appliances found in users’ homes is increasing together with electricity consumption of users’ residences. In addition, there is a tendency to consume during the same period leading to demand peaks. During these periods, electricity providers are forced to develop costly methods...... to generate enough power to meet consumers’ requirements. In addition, high demand peaks can lead to electricity shortages or even blackouts in certain areas. In order to avoid demand peaks, users’ appliances should consume electricity in a more distributed way. A new methodology to schedule the usage of home...... appliances is proposed and analyzed. The main concept behind this approach is the aggregation of home appliances into priority classes and the definition of a maximum power consumption threshold, which is not allowed to be exceeded during peak hours. The scenario simulated describes a modern household, where...

  8. Solving University Scheduling Problem Using Hybrid Approach

    Directory of Open Access Journals (Sweden)

    Aftab Ahmed Shaikh

    2011-10-01

    Full Text Available In universities scheduling curriculum activity is an essential job. Primarily, scheduling is a distribution of limited resources under interrelated constraints. The set of hard constraints demand the highest priority and should not to be violated at any cost, while the maximum soft constraints satisfaction mounts the quality scale of solution. In this research paper, a novel bisected approach is introduced that is comprisesd of GA (Genetic Algorithm as well as Backtracking Recursive Search. The employed technique deals with both hard and soft constraints successively. The first phase decisively is focused over elimination of all the hard constraints bounded violations and eventually produces partial solution for subsequent step. The second phase is supposed to draw the best possible solution on the search space. Promising results are obtained by implementation on the real dataset. The key points of the research approach are to get assurance of hard constraints removal from the dataset and minimizing computational time for GA by initializing pre-processed set of chromosomes.

  9. Analysis of the Swift Gamma-Ray Bursts duration

    International Nuclear Information System (INIS)

    Horvath, I.; Veres, P.; Balazs, L. G.; Kelemen, J.; Bagoly, Z.; Tusnady, G.

    2008-01-01

    Two classes of gamma-ray bursts have been identified in the BATSE catalogs characterized by durations shorter and longer than about 2 seconds. There are, however, some indications for the existence of a third type of burst. Swift satellite detectors have different spectral sensitivity than pre-Swift ones for gamma-ray bursts. Therefore it is worth to reanalyze the durations and their distribution and also the classification of GRBs. Using The First BAT Catalog the maximum likelihood estimation was used to analyzed the duration distribution of GRBs. The three log-normal fit is significantly (99.54% probability) better than the two for the duration distribution. Monte-Carlo simulations also confirm this probability (99.2%).

  10. Cross-layer optimized rate adaptation and scheduling for multiple-user wireless video streaming

    NARCIS (Netherlands)

    Ozcelebi, T.; Sunay, M.O.; Tekalp, A.M.; Civanlar, M.R.

    2007-01-01

    We present a cross-layer optimized video rate adaptation and user scheduling scheme for multi-user wireless video streaming aiming for maximum quality of service (QoS) for each user,, maximum system video throughput, and QoS fairness among users. These objectives are jointly optimized using a

  11. Multidrug resistance circumvention by a new triazinoaminopiperidine derivative S9788 in vitro: definition of the optimal schedule and comparison with verapamil.

    Science.gov (United States)

    Julia, A. M.; Roché, H.; Berlion, M.; Lucas, C.; Milano, G.; Robert, J.; Bizzari, J. P.; Canal, P.

    1994-01-01

    The current work was undertaken to investigate the importance of exposure sequence and duration in achieving the maximum reversal action of S9788 on doxorubicin (DOX) cytotoxicity against cells that exhibit the (MDR) multidrug resistance phenotype: the MCF7/DOX cell line. Accumulation and release of DOX were examined in this cell line. The reversal effect was compared with that obtained with verapamil. S9788 activity was schedule dependent: when comparing incubation with S9788 before or after treatment with DOX, the best reversal factor was obtained in the case of a post-treatment incubation (65.6 +/- 7.7 vs 20.8 +/- 7.0). S9788 was a more potent modulating agent than verapamil, whatever the schedule of exposure of the cells to the reversal agent. The reversal of resistance after short-term DOX exposures was caused not only by prolonged cellular accumulation of DOX, but also by its prolonged retention after transfer of cells to DOX-free medium. A relationship was noted between cellular exposure to DOX and the cytotoxic effect, and so the reversal of resistance induced by S9788 appears to be directly linked to the level of cell exposure to DOX. This work provided a rationale for improving the schedule of administration of S9788 in clinical trials. PMID:8180016

  12. Generic maximum likely scale selection

    DEFF Research Database (Denmark)

    Pedersen, Kim Steenstrup; Loog, Marco; Markussen, Bo

    2007-01-01

    in this work is on applying this selection principle under a Brownian image model. This image model provides a simple scale invariant prior for natural images and we provide illustrative examples of the behavior of our scale estimation on such images. In these illustrative examples, estimation is based......The fundamental problem of local scale selection is addressed by means of a novel principle, which is based on maximum likelihood estimation. The principle is generally applicable to a broad variety of image models and descriptors, and provides a generic scale estimation methodology. The focus...

  13. 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

  14. 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.

  15. 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.

  16. 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.

  17. 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

  18. 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.

  19. Applying mathematical models to predict resident physician performance and alertness on traditional and novel work schedules.

    Science.gov (United States)

    Klerman, Elizabeth B; Beckett, Scott A; Landrigan, Christopher P

    2016-09-13

    In 2011 the U.S. Accreditation Council for Graduate Medical Education began limiting first year resident physicians (interns) to shifts of ≤16 consecutive hours. Controversy persists regarding the effectiveness of this policy for reducing errors and accidents while promoting education and patient care. Using a mathematical model of the effects of circadian rhythms and length of time awake on objective performance and subjective alertness, we quantitatively compared predictions for traditional intern schedules to those that limit work to ≤ 16 consecutive hours. We simulated two traditional schedules and three novel schedules using the mathematical model. The traditional schedules had extended duration work shifts (≥24 h) with overnight work shifts every second shift (including every third night, Q3) or every third shift (including every fourth night, Q4) night; the novel schedules had two different cross-cover (XC) night team schedules (XC-V1 and XC-V2) and a Rapid Cycle Rotation (RCR) schedule. Predicted objective performance and subjective alertness for each work shift were computed for each individual's schedule within a team and then combined for the team as a whole. Our primary outcome was the amount of time within a work shift during which a team's model-predicted objective performance and subjective alertness were lower than that expected after 16 or 24 h of continuous wake in an otherwise rested individual. The model predicted fewer hours with poor performance and alertness, especially during night-time work hours, for all three novel schedules than for either the traditional Q3 or Q4 schedules. Three proposed schedules that eliminate extended shifts may improve performance and alertness compared with traditional Q3 or Q4 schedules. Predicted times of worse performance and alertness were at night, which is also a time when supervision of trainees is lower. Mathematical modeling provides a quantitative comparison approach with potential to aid

  20. Extreme Maximum Land Surface Temperatures.

    Science.gov (United States)

    Garratt, J. R.

    1992-09-01

    There are numerous reports in the literature of observations of land surface temperatures. Some of these, almost all made in situ, reveal maximum values in the 50°-70°C range, with a few, made in desert regions, near 80°C. Consideration of a simplified form of the surface energy balance equation, utilizing likely upper values of absorbed shortwave flux (1000 W m2) and screen air temperature (55°C), that surface temperatures in the vicinity of 90°-100°C may occur for dry, darkish soils of low thermal conductivity (0.1-0.2 W m1 K1). Numerical simulations confirm this and suggest that temperature gradients in the first few centimeters of soil may reach 0.5°-1°C mm1 under these extreme conditions. The study bears upon the intrinsic interest of identifying extreme maximum temperatures and yields interesting information regarding the comfort zone of animals (including man).

  1. 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....

  2. 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

  3. Factors associated with sleep duration in Brazilian high school students.

    Science.gov (United States)

    Gomes Felden, Érico Pereira; Barbosa, Diego Grasel; Junior, Geraldo Jose Ferrari; Santos, Manoella De Oliveira; Pelegrini, Andreia; Silva, Diego Augusto Santos

    2017-01-01

    The aim of this study was to investigate the factors associated with short sleep duration on southern Brazilian high school students. Our study was comprised of 1,132 adolescents aged 14 to 19 years, enrolled in public high schools in São José, Brazil. The students answered a questionnaire about working (work and workload), health perception, smoking, school schedule, sleep (duration and daytime sleepiness), and socio-demographics data. The results showed that more than two thirds of adolescent workers had short sleep duration (76.7%), and those with a higher workload (more than 20 hours) had a shorter sleep duration (7.07 hours) compared to non-workers (7.83 hours). In the analysis of factors associated with short sleep duration, adolescents who worked (OR = 2.12, 95% CI 1.53 to 2.95) were more likely to have short sleep duration compared to those who did not work. In addition, older adolescents (17-19 years) and students with poor sleep quality were 40% and 55% more likely to have short sleep duration compared to younger adolescents (14-16 years) and students with good sleep quality, respectively. Adolescents with daytime sleepiness were more likely to have short sleep duration (OR = 1.49, 95% CI 1.06 to 2.07) compared to those without excessive daytime sleepiness. In addition students of the morning shift (OR = 6.02, 95% CI 4.23 to 8.57) and evening shift (OR = 2.16, 95% CI 1.45 to 3.22) were more likely to have short sleep duration compared to adolescents of the afternoon shift. Thereby adolescents who are workers, older, attended morning and evening classes and have excessive daytime sleepiness showed risk factors for short sleep duration. In this sense, it is pointed out the importance of raising awareness of these risk factors for short sleep duration of students from public schools from São José, located in southern Brazil.

  4. Statistics of the first passage time of Brownian motion conditioned by maximum value or area

    International Nuclear Information System (INIS)

    Kearney, Michael J; Majumdar, Satya N

    2014-01-01

    We derive the moments of the first passage time for Brownian motion conditioned by either the maximum value or the area swept out by the motion. These quantities are the natural counterparts to the moments of the maximum value and area of Brownian excursions of fixed duration, which we also derive for completeness within the same mathematical framework. Various applications are indicated. (paper)

  5. Energy-driven scheduling algorithm for nanosatellite energy harvesting maximization

    Science.gov (United States)

    Slongo, L. K.; Martínez, S. V.; Eiterer, B. V. B.; Pereira, T. G.; Bezerra, E. A.; Paiva, K. V.

    2018-06-01

    The number of tasks that a satellite may execute in orbit is strongly related to the amount of energy its Electrical Power System (EPS) is able to harvest and to store. The manner the stored energy is distributed within the satellite has also a great impact on the CubeSat's overall efficiency. Most CubeSat's EPS do not prioritize energy constraints in their formulation. Unlike that, this work proposes an innovative energy-driven scheduling algorithm based on energy harvesting maximization policy. The energy harvesting circuit is mathematically modeled and the solar panel I-V curves are presented for different temperature and irradiance levels. Considering the models and simulations, the scheduling algorithm is designed to keep solar panels working close to their maximum power point by triggering tasks in the appropriate form. Tasks execution affects battery voltage, which is coupled to the solar panels through a protection circuit. A software based Perturb and Observe strategy allows defining the tasks to be triggered. The scheduling algorithm is tested in FloripaSat, which is an 1U CubeSat. A test apparatus is proposed to emulate solar irradiance variation, considering the satellite movement around the Earth. Tests have been conducted to show that the scheduling algorithm improves the CubeSat energy harvesting capability by 4.48% in a three orbit experiment and up to 8.46% in a single orbit cycle in comparison with the CubeSat operating without the scheduling algorithm.

  6. 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....

  7. Constraint optimization model of a scheduling problem for a robotic arm in automatic systems

    DEFF Research Database (Denmark)

    Kristiansen, Ewa; Smith, Stephen F.; Kristiansen, Morten

    2014-01-01

    are characteristics of the painting process application itself. Unlike spot-welding, painting tasks require movement of the entire robot arm. In addition to minimizing intertask duration, the scheduler must strive to maximize painting quality and the problem is formulated as a multi-objective optimization problem....... The scheduling model is implemented as a stand-alone module using constraint programming, and integrated with a larger automatic system. The results of a number of simulation experiments with simple parts are reported, both to characterize the functionality of the scheduler and to illustrate the operation...... of the entire software system for automatic generation of robot programs for painting....

  8. Predicting Schedule Duration for Defense Acquisition Programs: Program Initiation to Initial Operational Capability

    Science.gov (United States)

    2016-03-24

    statistically significant. Variance inflation is a consequence of multicollinearity and the VIF scores are a common way for detecting 43 such a...produced an initial model and we have ascertained there are no issues (and tested that) with respect to multicollinearity (VIF scores), influential...The analysis of this tells us that there is no consequence of multicollinearity present in the preliminary model. By this, there is no linear

  9. 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.

  10. Effect of current on the maximum possible reward.

    Science.gov (United States)

    Gallistel, C R; Leon, M; Waraczynski, M; Hanau, M S

    1991-12-01

    Using a 2-lever choice paradigm with concurrent variable interval schedules of reward, it was found that when pulse frequency is increased, the preference-determining rewarding effect of 0.5-s trains of brief cathodal pulses delivered to the medial forebrain bundle of the rat saturates (stops increasing) at values ranging from 200 to 631 pulses/s (pps). Raising the current lowered the saturation frequency, which confirms earlier, more extensive findings showing that the rewarding effect of short trains saturates at pulse frequencies that vary from less than 100 pps to more than 800 pps, depending on the current. It was also found that the maximum possible reward--the magnitude of the reward at or beyond the saturation pulse frequency--increases with increasing current. Thus, increasing the current reduces the saturation frequency but increases the subjective magnitude of the maximum possible reward.

  11. System for memorizing maximum values

    Science.gov (United States)

    Bozeman, Richard J., Jr.

    1992-08-01

    The invention discloses a system capable of memorizing maximum sensed values. The system includes conditioning circuitry which receives the analog output signal from a sensor transducer. The conditioning circuitry rectifies and filters the analog signal and provides an input signal to a digital driver, which may be either linear or logarithmic. The driver converts the analog signal to discrete digital values, which in turn triggers an output signal on one of a plurality of driver output lines n. The particular output lines selected is dependent on the converted digital value. A microfuse memory device connects across the driver output lines, with n segments. Each segment is associated with one driver output line, and includes a microfuse that is blown when a signal appears on the associated driver output line.

  12. Remarks on the maximum luminosity

    Science.gov (United States)

    Cardoso, Vitor; Ikeda, Taishi; Moore, Christopher J.; Yoo, Chul-Moon

    2018-04-01

    The quest for fundamental limitations on physical processes is old and venerable. Here, we investigate the maximum possible power, or luminosity, that any event can produce. We show, via full nonlinear simulations of Einstein's equations, that there exist initial conditions which give rise to arbitrarily large luminosities. However, the requirement that there is no past horizon in the spacetime seems to limit the luminosity to below the Planck value, LP=c5/G . Numerical relativity simulations of critical collapse yield the largest luminosities observed to date, ≈ 0.2 LP . We also present an analytic solution to the Einstein equations which seems to give an unboundedly large luminosity; this will guide future numerical efforts to investigate super-Planckian luminosities.

  13. Maximum mutual information regularized classification

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-09-07

    In this paper, a novel pattern classification approach is proposed by regularizing the classifier learning to maximize mutual information between the classification response and the true class label. We argue that, with the learned classifier, the uncertainty of the true class label of a data sample should be reduced by knowing its classification response as much as possible. The reduced uncertainty is measured by the mutual information between the classification response and the true class label. To this end, when learning a linear classifier, we propose to maximize the mutual information between classification responses and true class labels of training samples, besides minimizing the classification error and reducing the classifier complexity. An objective function is constructed by modeling mutual information with entropy estimation, and it is optimized by a gradient descend method in an iterative algorithm. Experiments on two real world pattern classification problems show the significant improvements achieved by maximum mutual information regularization.

  14. Scintillation counter, maximum gamma aspect

    International Nuclear Information System (INIS)

    Thumim, A.D.

    1975-01-01

    A scintillation counter, particularly for counting gamma ray photons, includes a massive lead radiation shield surrounding a sample-receiving zone. The shield is disassembleable into a plurality of segments to allow facile installation and removal of a photomultiplier tube assembly, the segments being so constructed as to prevent straight-line access of external radiation through the shield into radiation-responsive areas. Provisions are made for accurately aligning the photomultiplier tube with respect to one or more sample-transmitting bores extending through the shield to the sample receiving zone. A sample elevator, used in transporting samples into the zone, is designed to provide a maximum gamma-receiving aspect to maximize the gamma detecting efficiency. (U.S.)

  15. Maximum mutual information regularized classification

    KAUST Repository

    Wang, Jim Jing-Yan; Wang, Yi; Zhao, Shiguang; Gao, Xin

    2014-01-01

    In this paper, a novel pattern classification approach is proposed by regularizing the classifier learning to maximize mutual information between the classification response and the true class label. We argue that, with the learned classifier, the uncertainty of the true class label of a data sample should be reduced by knowing its classification response as much as possible. The reduced uncertainty is measured by the mutual information between the classification response and the true class label. To this end, when learning a linear classifier, we propose to maximize the mutual information between classification responses and true class labels of training samples, besides minimizing the classification error and reducing the classifier complexity. An objective function is constructed by modeling mutual information with entropy estimation, and it is optimized by a gradient descend method in an iterative algorithm. Experiments on two real world pattern classification problems show the significant improvements achieved by maximum mutual information regularization.

  16. Rhythmic constraints in durational control

    NARCIS (Netherlands)

    Grover, C.N.; Terken, J.M.B.

    1994-01-01

    Two potential factors in durational control are addressed. First, we investigate whether lengthening a syllable implies lengthening all of its constituent phonemes in a regular way. Analysis of a small corpus of syllables shows that this is not the case. Second, we investigate the influence of

  17. Rent control and unemployment duration

    DEFF Research Database (Denmark)

    Svarer, Michael; Rosholm, Michael; Munch, Jakob Roland

    2005-01-01

    In this paper we analyse how rent control affects the duration of individual unemployment. In atheoretical search model we distinguish between two effects of rent control. On one hand, rentcontrol reduces housing mobility and hence mobility in the labour market. On the other hand, tomaintain rent...

  18. JACEE long duration balloon flights

    International Nuclear Information System (INIS)

    Burnett, T.; Iwai, J.; Lord, J.J.; Strausz, S.; Wilkes, R.J.; Dake, S.; Oda, H.; Miyamura, O.; Fuki, M.; Jones, W.V.; Gregory, J.; Hayashi, T.; Takahashi, U.; Tominaga, Y.; Wefel, J.P.; Fountain, W.; Derrickson, J.; Parnell, T.A.; Roberts, E.; Tabuki, T.; Watts, J.W.

    1989-01-01

    JACEE balloon-borne emulsion chamber detectors are used to observe the spectra and interactions of cosmic ray protons and nuclei in the energy range 1-100A TeV. Experience with long duration mid-latitude balloon flights and characteristics of the detector system that make it ideal for planned Antarctic balloon flights are discussed. 5 refs., 2 figs

  19. Estimating potential diapause duration in Calanus finmarchicus

    Science.gov (United States)

    Saumweber, Whitley J.; Durbin, Edward G.

    2006-11-01

    Deep basins in the Gulf of Maine act as refuge for a large population of diapausing Calanus finmarchicus during the summer and fall. This population acts as the primary seed population for Georges Bank in the spring and is thought to be composed primarily of individuals that developed during the previous spring bloom. The factors affecting growth and mortality in the summer-fall population are not well understood, however, and loss terms from advection and starvation may be large. To assess the potential energetic limitation and loss of C. finmarchicus from the Gulf of Maine basins, a new nitrogen-specific respiration model has been developed for the resting stage of the species. Stage C5 C. finmarchicus were collected during July, September, and December 2003 from Wilkinson and Georges Basins. Animals were collected using both MOCNESS tows and zooplankton samplers on the Johnson Sea Link II submersible. Metabolic rates were measured using a Micro-Oxymax gas analyzer and Winkler incubation techniques both at sea and on animals kept in culture on shore. Respiration rates measured in the field were not significantly different from those measured on shore, with a mean of 130 μmol O 2 gN -1 h -1 (14.4 μmol O 2 gC -1 h -1) at 0 °C and a Q10 of 2.77 (2.58 for carbon-specific respiration). Using the nitrogen-specific rates in conjunction with visual estimates of nitrogen weight and lipid stores, we derived a discrete function for predicting potential diapause duration based on an animal's length, oil sac volume, and the in situ temperature. The maximum potential diapause duration for a C5 C. finmarchicus is predicted to range from 280 days at 0 °C to approximately 90 days at 11 °C. The maximum potential diapause duration in the Gulf of Maine is predicted to be between 3.5 and 5.5 months. These results suggest that energetic limitation may play a role in controlling the population dynamics of diapausing C. finmarchicus in the Gulf of Maine. A reassessment of the

  20. Effect of Load Duration on Timber Structures in Denmark

    DEFF Research Database (Denmark)

    Sørensen, John Dalsgaard; Stang, Birgitte Friis Dela; Svensson, Staffan

    2003-01-01

    . The parameters in these models are fitted by the Maximum Likelihood Method using data relevant for Danish structural timber and the statistical uncertainty is quantified. The reliability is evaluated using representative shortand long-term limit states, and the load duration factor kmod is estimated using......Load duration effects are estimated on basis of simulation of realizations of wind, snow and imposed loads in accordance with the load models in the Danish structural codes. Three damage accumulation models are considered, namely Gerhards model, Barret & Foschi's model and Foschi & Yao's model...

  1. Some effects of overall rate of earning reinforcers on run lengths and visit durations.

    Science.gov (United States)

    Macdonall, James S

    2006-07-01

    In a concurrent schedule, responding at each alternative is controlled by a pair of schedules that arrange reinforcers for staying at that alternative and reinforcers for switching to the other alternative. Each pair of schedules operates only while at the associated alternative. When only one pair of stay and switch schedules is presented, the rates of earning reinforcers for staying divided by the rates of earning reinforcers for switching controls the mean number responses in a visit and the mean duration of visits. The purpose of the present experiment was to see whether the sum of the rates of earning stay and switch reinforcers changed the way that run length and visit duration were affected by the ratio of the rates of stay to switch reinforcers. Rats were exposed to pairs of stay and switch schedules that varied both the ratio of the rates of earning stay and switch reinforcers and the sum of the rates of earning stay and switch reinforcers. Run lengths and visit durations were joint functions of the ratio of the rates of earning stay and switch reinforcers and the sum of the rates of earning stay and switch reinforcers. These results shows that the effect of the ratio of the sum of the rates of earning stay and switch reinforcers results from processes operating at the alternative, rather than from processes operating at both alternatives.

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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)

  8. 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

  9. 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

  10. 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

  11. The algorithm for duration acceleration of repetitive projects considering the learning effect

    Science.gov (United States)

    Chen, Hongtao; Wang, Keke; Du, Yang; Wang, Liwan

    2018-03-01

    Repetitive project optimization problem is common in project scheduling. Repetitive Scheduling Method (RSM) has many irreplaceable advantages in the field of repetitive projects. As the same or similar work is repeated, the proficiency of workers will be correspondingly low to high, and workers will gain experience and improve the efficiency of operations. This is learning effect. Learning effect is one of the important factors affecting the optimization results in repetitive project scheduling. This paper analyzes the influence of the learning effect on the controlling path in RSM from two aspects: one is that the learning effect changes the controlling path, the other is that the learning effect doesn't change the controlling path. This paper proposes corresponding methods to accelerate duration for different types of critical activities and proposes the algorithm for duration acceleration based on the learning effect in RSM. And the paper chooses graphical method to identity activities' types and considers the impacts of the learning effect on duration. The method meets the requirement of duration while ensuring the lowest acceleration cost. A concrete bridge construction project is given to verify the effectiveness of the method. The results of this study will help project managers understand the impacts of the learning effect on repetitive projects, and use the learning effect to optimize project scheduling.

  12. Maximum total organic carbon limit for DWPF melter feed

    International Nuclear Information System (INIS)

    Choi, A.S.

    1995-01-01

    DWPF recently decided to control the potential flammability of melter off-gas by limiting the total carbon content in the melter feed and maintaining adequate conditions for combustion in the melter plenum. With this new strategy, all the LFL analyzers and associated interlocks and alarms were removed from both the primary and backup melter off-gas systems. Subsequently, D. Iverson of DWPF- T ampersand E requested that SRTC determine the maximum allowable total organic carbon (TOC) content in the melter feed which can be implemented as part of the Process Requirements for melter feed preparation (PR-S04). The maximum TOC limit thus determined in this study was about 24,000 ppm on an aqueous slurry basis. At the TOC levels below this, the peak concentration of combustible components in the quenched off-gas will not exceed 60 percent of the LFL during off-gas surges of magnitudes up to three times nominal, provided that the melter plenum temperature and the air purge rate to the BUFC are monitored and controlled above 650 degrees C and 220 lb/hr, respectively. Appropriate interlocks should discontinue the feeding when one or both of these conditions are not met. Both the magnitude and duration of an off-gas surge have a major impact on the maximum TOC limit, since they directly affect the melter plenum temperature and combustion. Although the data obtained during recent DWPF melter startup tests showed that the peak magnitude of a surge can be greater than three times nominal, the observed duration was considerably shorter, on the order of several seconds. The long surge duration assumed in this study has a greater impact on the plenum temperature than the peak magnitude, thus making the maximum TOC estimate conservative. Two models were used to make the necessary calculations to determine the TOC limit

  13. Master schedule for CY-1979 Hanford environmental surveillance routine program

    International Nuclear Information System (INIS)

    Blumer, P.J.; Houston, J.R.; Eddy, P.A.

    1978-12-01

    The current schedule of data collection for the routine environmental surveillance program at the Hanford Site, as conducted by the Environmental Evaluation Section of Battelle, Pacific Northwest Laboratory for the Department of Energy (DOE), is given. Modifications to the schedule are made during the year and special areas of study, usually of short duration, are not scheduled. The environmental surveillance program objectives are to evaluate the levels of radioactive and nonradioactive pollutants in the Hanford environs, and to monitor Hanford operations for compliance with applicable environmental criteria and Washington State Water Quality Standards. Air quality data are obtained in a separate program administered by the Hanford Environmental Health Foundation. The collection schedule for potable water is shown but it is not part of the routine environmental surveillance program. Water quality data for Hanford Site potable water systems are published each year by the Hanford Environmental Health Foundation. The data collected are available in routine reports issued by the Environmental Evaluations staff. Groundwater data and evaluation are reported in the series, ''Radiological Status of the Groundwater Beneath the Hanford Project for...,'' the latest issue being PNL-2624 for CY-1977. Data from locations within the plant boundaries are presented in the annual ''Environmental Status of the Hanford Site for...'' report series, the most recent report being PNL-2677 for 1977. Data from offsite locations are presented in the annual ''Environmental Surveillance at Hanford for...'' series of reports, the latest being PNL-2614 for 1977

  14. Road transport of farm animals: effects of journey duration on animal welfare

    DEFF Research Database (Denmark)

    Nielsen, Birte Lindstrøm; Dybkjær, Lise; Herskin, Mette S

    2011-01-01

    Transport of farm animals gives rise to concern about their welfare. Specific attention has been given to the duration of animal transport, and maximum journey durations are used in legislation that seek to minimise any negative impact of transport on animal welfare. This paper reviews the relati...

  15. Maximum entropy and Bayesian methods

    International Nuclear Information System (INIS)

    Smith, C.R.; Erickson, G.J.; Neudorfer, P.O.

    1992-01-01

    Bayesian probability theory and Maximum Entropy methods are at the core of a new view of scientific inference. These 'new' ideas, along with the revolution in computational methods afforded by modern computers allow astronomers, electrical engineers, image processors of any type, NMR chemists and physicists, and anyone at all who has to deal with incomplete and noisy data, to take advantage of methods that, in the past, have been applied only in some areas of theoretical physics. The title workshops have been the focus of a group of researchers from many different fields, and this diversity is evident in this book. There are tutorial and theoretical papers, and applications in a very wide variety of fields. Almost any instance of dealing with incomplete and noisy data can be usefully treated by these methods, and many areas of theoretical research are being enhanced by the thoughtful application of Bayes' theorem. Contributions contained in this volume present a state-of-the-art overview that will be influential and useful for many years to come

  16. Null Space Based Preemptive Scheduling For Joint URLLC and eMBB Traffic in 5G Networks

    DEFF Research Database (Denmark)

    Abdul-Mawgood Ali Ali Esswie, Ali; Pedersen, Klaus

    2018-01-01

    In this paper, we propose a null-space-based preemptive scheduling framework for cross-objective optimization to always guarantee robust URLLC performance, while extracting the maximum possible eMBB capacity. The proposed scheduler perpetually grants incoming URLLC traffic a higher priority for i...

  17. Scaling in the distribution of intertrade durations of Chinese stocks

    Science.gov (United States)

    Jiang, Zhi-Qiang; Chen, Wei; Zhou, Wei-Xing

    2008-10-01

    The distribution of intertrade durations, defined as the waiting times between two consecutive transactions, is investigated based upon the limit order book data of 23 liquid Chinese stocks listed on the Shenzhen Stock Exchange in the whole year 2003. A scaling pattern is observed in the distributions of intertrade durations, where the empirical density functions of the normalized intertrade durations of all 23 stocks collapse onto a single curve. The scaling pattern is also observed in the intertrade duration distributions for filled and partially filled trades and in the conditional distributions. The ensemble distributions for all stocks are modeled by the Weibull and the Tsallis q-exponential distributions. Maximum likelihood estimation shows that the Weibull distribution outperforms the q-exponential for not-too-large intertrade durations which account for more than 98.5% of the data. Alternatively, nonlinear least-squares estimation selects the q-exponential as a better model, in which the optimization is conducted on the distance between empirical and theoretical values of the logarithmic probability densities. The distribution of intertrade durations is Weibull followed by a power-law tail with an asymptotic tail exponent close to 3.

  18. Influence of earthquake strong motion duration on nonlinear structural response

    International Nuclear Information System (INIS)

    Meskouris, K.

    1983-01-01

    The effects of motion duration on nonlinear structural response of high-rise, moment resisting frames are studied by subjecting shear beam models of a 10- and a 5-story frame to a series of synthetic accelerograms, all matching the same NEWMARK/HALL design spectrum. Two different hysteretic laws are used for the story springs, and calculations are carried out for target ductility values of 2 and 4. Maximum ductilities reached and energy-based damage indicators (maximum seismically input energy, hysteretically dissipated energy) are evaluated and correlated with the motion characteristics. A reasonable extrapolative determination of structural response characteristics based on these indicators seems possible. (orig.)

  19. 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.

  20. An Extended Flexible Job Shop Scheduling Model for Flight Deck Scheduling with Priority, Parallel Operations, and Sequence Flexibility

    Directory of Open Access Journals (Sweden)

    Lianfei Yu

    2017-01-01

    Full Text Available Efficient scheduling for the supporting operations of aircrafts in flight deck is critical to the aircraft carrier, and even several seconds’ improvement may lead to totally converse outcome of a battle. In the paper, we ameliorate the supporting operations of carrier-based aircrafts and investigate three simultaneous operation relationships during the supporting process, including precedence constraints, parallel operations, and sequence flexibility. Furthermore, multifunctional aircrafts have to take off synergistically and participate in a combat cooperatively. However, their takeoff order must be restrictively prioritized during the scheduling period accorded by certain operational regulations. To efficiently prioritize the takeoff order while minimizing the total time budget on the whole takeoff duration, we propose a novel mixed integer liner programming formulation (MILP for the flight deck scheduling problem. Motivated by the hardness of MILP, we design an improved differential evolution algorithm combined with typical local search strategies to improve computational efficiency. We numerically compare the performance of our algorithm with the classical genetic algorithm and normal differential evolution algorithm and the results show that our algorithm obtains better scheduling schemes that can meet both the operational relations and the takeoff priority requirements.

  1. 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.

  2. Maximum entropy principal for transportation

    International Nuclear Information System (INIS)

    Bilich, F.; Da Silva, R.

    2008-01-01

    In this work we deal with modeling of the transportation phenomenon for use in the transportation planning process and policy-impact studies. The model developed is based on the dependence concept, i.e., the notion that the probability of a trip starting at origin i is dependent on the probability of a trip ending at destination j given that the factors (such as travel time, cost, etc.) which affect travel between origin i and destination j assume some specific values. The derivation of the solution of the model employs the maximum entropy principle combining a priori multinomial distribution with a trip utility concept. This model is utilized to forecast trip distributions under a variety of policy changes and scenarios. The dependence coefficients are obtained from a regression equation where the functional form is derived based on conditional probability and perception of factors from experimental psychology. The dependence coefficients encode all the information that was previously encoded in the form of constraints. In addition, the dependence coefficients encode information that cannot be expressed in the form of constraints for practical reasons, namely, computational tractability. The equivalence between the standard formulation (i.e., objective function with constraints) and the dependence formulation (i.e., without constraints) is demonstrated. The parameters of the dependence-based trip-distribution model are estimated, and the model is also validated using commercial air travel data in the U.S. In addition, policy impact analyses (such as allowance of supersonic flights inside the U.S. and user surcharge at noise-impacted airports) on air travel are performed.

  3. Sleep schedules and school performance in Indigenous Australian children.

    Science.gov (United States)

    Blunden, Sarah; Magee, Chris; Attard, Kelly; Clarkson, Larissa; Caputi, Peter; Skinner, Timothy

    2018-04-01

    Sleep duration and sleep schedule variability have been related to negative health and well-being outcomes in children, but little is known about Australian Indigenous children. Data for children aged 7-9 years came from the Australian Longitudinal Study of Indigenous Children and the National Assessment Program-Literacy and Numeracy (NAPLAN). Latent class analysis determined sleep classes taking into account sleep duration, bedtimes, waketimes, and variability in bedtimes from weekdays to weekends. Regression models tested whether the sleep classes were cross-sectionally associated with grade 3 NAPLAN scores. Latent change score modeling then examined whether the sleep classes predicted changes in NAPLAN performance from grades 3 to 5. Five sleep schedule classes were identified: normative sleep, early risers, long sleep, variable sleep, and short sleep. Overall, long sleepers performed best, with those with reduced sleep (short sleepers and early risers) performing the worse on grammar, numeracy, and writing performance. Latent change score results also showed that long sleepers performed best in spelling and writing and short sleepers and typical sleepers performed the worst over time. In this sample of Australian Indigenous children, short sleep was associated with poorer school performance compared with long sleep, with this performance worsening over time for some performance indicators. Other sleep schedules (eg, early wake times and variable sleep) also had some relationships with school performance. As sleep scheduling is modifiable, this offers opportunity for improvement in sleep and thus performance outcomes for these and potentially all children. Copyright © 2018 National Sleep Foundation. Published by Elsevier Inc. All rights reserved.

  4. Updating Linear Schedules with Lowest Cost: a Linear Programming Model

    Science.gov (United States)

    Biruk, Sławomir; Jaśkowski, Piotr; Czarnigowska, Agata

    2017-10-01

    Many civil engineering projects involve sets of tasks repeated in a predefined sequence in a number of work areas along a particular route. A useful graphical representation of schedules of such projects is time-distance diagrams that clearly show what process is conducted at a particular point of time and in particular location. With repetitive tasks, the quality of project performance is conditioned by the ability of the planner to optimize workflow by synchronizing the works and resources, which usually means that resources are planned to be continuously utilized. However, construction processes are prone to risks, and a fully synchronized schedule may expire if a disturbance (bad weather, machine failure etc.) affects even one task. In such cases, works need to be rescheduled, and another optimal schedule should be built for the changed circumstances. This typically means that, to meet the fixed completion date, durations of operations have to be reduced. A number of measures are possible to achieve such reduction: working overtime, employing more resources or relocating resources from less to more critical tasks, but they all come at a considerable cost and affect the whole project. The paper investigates the problem of selecting the measures that reduce durations of tasks of a linear project so that the cost of these measures is kept to the minimum and proposes an algorithm that could be applied to find optimal solutions as the need to reschedule arises. Considering that civil engineering projects, such as road building, usually involve less process types than construction projects, the complexity of scheduling problems is lower, and precise optimization algorithms can be applied. Therefore, the authors put forward a linear programming model of the problem and illustrate its principle of operation with an example.

  5. Patients' preference for radiotherapy fractionation schedule in the palliation of symptomatic unresectable lung cancer

    International Nuclear Information System (INIS)

    Tang, J. I.; Lu, J. J.; Wong, L. C.

    2008-01-01

    Full text: The palliative radiotherapeutic management of unresectable non-small-cell lung cancer is controversial, with various fractionation (F x) schedules available. We aimed to determine patient's choice of F x schedule after involvement in a decision-making process using a decision board. A decision board outlining the various advantages and disadvantages apparent in the Medical Research Council study of F x schedules (17 Gy in two fractions vs 39 Gy in 13 fractions) was discussed with patients who met Medical Research Council eligibility criteria. Patients were then asked to indicate their preferred F x schedules, reasons and their level of satisfaction with being involved in the decision making process. Radiation oncologists (R O ) could prescribe radiotherapy schedules irrespective of patients' preferences. Of 92 patients enrolled, 55% chose the longer schedule. English-speaking patients were significantly more likely to choose the longer schedule (P 0.02, 95% confidence interval: 1.2-7.6). Longer F x was chosen because of longer survival (90%) and better local control (12%). Shorter F x was chosen for shorter overall treatment duration (80%), cost (61%) and better symptom control (20%). In all, 56% of patients choosing the shorter schedule had their treatment altered by the treating R O , whereas only 4% of patients choosing longer F x had their treatment altered (P O 's own biases.

  6. Flexible job-shop scheduling based on genetic algorithm and simulation validation

    Directory of Open Access Journals (Sweden)

    Zhou Erming

    2017-01-01

    Full Text Available This paper selects flexible job-shop scheduling problem as the research object, and Constructs mathematical model aimed at minimizing the maximum makespan. Taking the transmission reverse gear production line of a transmission corporation as an example, genetic algorithm is applied for flexible jobshop scheduling problem to get the specific optimal scheduling results with MATLAB. DELMIA/QUEST based on 3D discrete event simulation is applied to construct the physical model of the production workshop. On the basis of the optimal scheduling results, the logical link of the physical model for the production workshop is established, besides, importing the appropriate process parameters to make virtual simulation on the production workshop. Finally, through analyzing the simulated results, it shows that the scheduling results are effective and reasonable.

  7. Working multiple jobs over a day or a week: Short-term effects on sleep duration.

    Science.gov (United States)

    Marucci-Wellman, Helen R; Lombardi, David A; Willetts, Joanna L

    Approximately 10% of the employed population in the United States works in multiple jobs. They are more likely to work long hours and in nonstandard work schedules, factors known to impact sleep duration and quality, and increase the risk of injury. In this study we used multivariate regression models to compare the duration of sleep in a 24-hour period between workers working in multiple jobs (MJHs) with single job holders (SJHs) controlling for other work schedule and demographic factors. We used data from the Bureau of Labor Statistics US American Time Use Survey (ATUS) pooled over a 9-year period (2003-2011). We found that MJHs had significantly reduced sleep duration compared with SJHs due to a number of independent factors, such as working longer hours and more often late at night. Male MJHs, working in their primary job or more than one job on the diary day, also had significantly shorter sleep durations (up to 40 minutes less on a weekend day) than male SJHs, even after controlling for all other factors. Therefore, duration of work hours, time of day working and duration of travel for work may not be the only factors to consider when understanding if male MJHs are able to fit in enough recuperative rest from their busy schedule. Work at night had the greatest impact on sleep duration for females, reducing sleep time by almost an hour compared with females who did not work at night. We also hypothesize that the high frequency or fragmentation of non-leisure activities (e.g. work and travel for work) throughout the day and between jobs may have an additional impact on the duration and quality of sleep for MJHs.

  8. 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...

  9. 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.

  10. Voltage scheduling for low power/energy

    Science.gov (United States)

    Manzak, Ali

    2001-07-01

    Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned

  11. 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...

  12. Last Glacial Maximum Salinity Reconstruction

    Science.gov (United States)

    Homola, K.; Spivack, A. J.

    2016-12-01

    It has been previously demonstrated that salinity can be reconstructed from sediment porewater. The goal of our study is to reconstruct high precision salinity during the Last Glacial Maximum (LGM). Salinity is usually determined at high precision via conductivity, which requires a larger volume of water than can be extracted from a sediment core, or via chloride titration, which yields lower than ideal precision. It has been demonstrated for water column samples that high precision density measurements can be used to determine salinity at the precision of a conductivity measurement using the equation of state of seawater. However, water column seawater has a relatively constant composition, in contrast to porewater, where variations from standard seawater composition occur. These deviations, which affect the equation of state, must be corrected for through precise measurements of each ion's concentration and knowledge of apparent partial molar density in seawater. We have developed a density-based method for determining porewater salinity that requires only 5 mL of sample, achieving density precisions of 10-6 g/mL. We have applied this method to porewater samples extracted from long cores collected along a N-S transect across the western North Atlantic (R/V Knorr cruise KN223). Density was determined to a precision of 2.3x10-6 g/mL, which translates to salinity uncertainty of 0.002 gms/kg if the effect of differences in composition is well constrained. Concentrations of anions (Cl-, and SO4-2) and cations (Na+, Mg+, Ca+2, and K+) were measured. To correct salinities at the precision required to unravel LGM Meridional Overturning Circulation, our ion precisions must be better than 0.1% for SO4-/Cl- and Mg+/Na+, and 0.4% for Ca+/Na+, and K+/Na+. Alkalinity, pH and Dissolved Inorganic Carbon of the porewater were determined to precisions better than 4% when ratioed to Cl-, and used to calculate HCO3-, and CO3-2. Apparent partial molar densities in seawater were

  13. Maximum Parsimony on Phylogenetic networks

    Science.gov (United States)

    2012-01-01

    Background Phylogenetic networks are generalizations of phylogenetic trees, that are used to model evolutionary events in various contexts. Several different methods and criteria have been introduced for reconstructing phylogenetic trees. Maximum Parsimony is a character-based approach that infers a phylogenetic tree by minimizing the total number of evolutionary steps required to explain a given set of data assigned on the leaves. Exact solutions for optimizing parsimony scores on phylogenetic trees have been introduced in the past. Results In this paper, we define the parsimony score on networks as the sum of the substitution costs along all the edges of the network; and show that certain well-known algorithms that calculate the optimum parsimony score on trees, such as Sankoff and Fitch algorithms extend naturally for networks, barring conflicting assignments at the reticulate vertices. We provide heuristics for finding the optimum parsimony scores on networks. Our algorithms can be applied for any cost matrix that may contain unequal substitution costs of transforming between different characters along different edges of the network. We analyzed this for experimental data on 10 leaves or fewer with at most 2 reticulations and found that for almost all networks, the bounds returned by the heuristics matched with the exhaustively determined optimum parsimony scores. Conclusion The parsimony score we define here does not directly reflect the cost of the best tree in the network that displays the evolution of the character. However, when searching for the most parsimonious network that describes a collection of characters, it becomes necessary to add additional cost considerations to prefer simpler structures, such as trees over networks. The parsimony score on a network that we describe here takes into account the substitution costs along the additional edges incident on each reticulate vertex, in addition to the substitution costs along the other edges which are

  14. 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

  15. 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...

  16. 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...

  17. 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

  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.

    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.

  1. 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.

  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. 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)

  4. 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...

  5. 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...

  6. 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...

  7. 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)...

  8. 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...

  9. Investigations of timing during the schedule and reinforcement intervals with wheel-running reinforcement.

    Science.gov (United States)

    Belke, Terry W; Christie-Fougere, Melissa M

    2006-11-01

    Across two experiments, a peak procedure was used to assess the timing of the onset and offset of an opportunity to run as a reinforcer. The first experiment investigated the effect of reinforcer duration on temporal discrimination of the onset of the reinforcement interval. Three male Wistar rats were exposed to fixed-interval (FI) 30-s schedules of wheel-running reinforcement and the duration of the opportunity to run was varied across values of 15, 30, and 60s. Each session consisted of 50 reinforcers and 10 probe trials. Results showed that as reinforcer duration increased, the percentage of postreinforcement pauses longer than the 30-s schedule interval increased. On probe trials, peak response rates occurred near the time of reinforcer delivery and peak times varied with reinforcer duration. In a second experiment, seven female Long-Evans rats were exposed to FI 30-s schedules leading to 30-s opportunities to run. Timing of the onset and offset of the reinforcement period was assessed by probe trials during the schedule interval and during the reinforcement interval in separate conditions. The results provided evidence of timing of the onset, but not the offset of the wheel-running reinforcement period. Further research is required to assess if timing occurs during a wheel-running reinforcement period.

  10. 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.

  11. Increasing operating room productivity by duration categories and a newsvendor model.

    Science.gov (United States)

    Lehtonen, Juha-Matti; Torkki, Paulus; Peltokorpi, Antti; Moilanen, Teemu

    2013-01-01

    Previous studies approach surgery scheduling mainly from the mathematical modeling perspective which is often hard to apply in a practical environment. The aim of this study is to develop a practical scheduling system that considers the advantages of both surgery categorization and newsvendor model to surgery scheduling. The research was carried out in a Finnish orthopaedic specialist centre that performs only joint replacement surgery. Four surgery categorization scenarios were defined and their productivity analyzed by simulation and newsvendor model. Detailed analyses of surgery durations and the use of more accurate case categories and their combinations in scheduling improved OR productivity 11.3 percent when compared to the base case. Planning to have one OR team to work longer led to remarkable decrease in scheduling inefficiency. In surgical services, productivity and cost-efficiency can be improved by utilizing historical data in case scheduling and by increasing flexibility in personnel management. The study increases the understanding of practical scheduling methods used to improve efficiency in surgical services.

  12. Lifetime predictions for the Solar Maximum Mission (SMM) and San Marco spacecraft

    Science.gov (United States)

    Smith, E. A.; Ward, D. T.; Schmitt, M. W.; Phenneger, M. C.; Vaughn, F. J.; Lupisella, M. L.

    1989-01-01

    Lifetime prediction techniques developed by the Goddard Space Flight Center (GSFC) Flight Dynamics Division (FDD) are described. These techniques were developed to predict the Solar Maximum Mission (SMM) spacecraft orbit, which is decaying due to atmospheric drag, with reentry predicted to occur before the end of 1989. Lifetime predictions were also performed for the Long Duration Exposure Facility (LDEF), which was deployed on the 1984 SMM repair mission and is scheduled for retrieval on another Space Transportation System (STS) mission later this year. Concepts used in the lifetime predictions were tested on the San Marco spacecraft, which reentered the Earth's atmosphere on December 6, 1988. Ephemerides predicting the orbit evolution of the San Marco spacecraft until reentry were generated over the final 90 days of the mission when the altitude was less than 380 kilometers. The errors in the predicted ephemerides are due to errors in the prediction of atmospheric density variations over the lifetime of the satellite. To model the time dependence of the atmospheric densities, predictions of the solar flux at the 10.7-centimeter wavelength were used in conjunction with Harris-Priester (HP) atmospheric density tables. Orbital state vectors, together with the spacecraft mass and area, are used as input to the Goddard Trajectory Determination System (GTDS). Propagations proceed in monthly segments, with the nominal atmospheric drag model scaled for each month according to the predicted monthly average value of F10.7. Calibration propagations are performed over a period of known orbital decay to obtain the effective ballistic coefficient. Progagations using plus or minus 2 sigma solar flux predictions are also generated to estimate the despersion in expected reentry dates. Definitive orbits are compared with these predictions as time expases. As updated vectors are received, these are also propagated to reentryto continually update the lifetime predictions.

  13. Unemployment duration and unemployment insurance

    DEFF Research Database (Denmark)

    Røed, Knut; Jensen, Peter; Thoursie, Anna

    2008-01-01

    Based on pooled register data from Norway and Sweden, we find that differences in unemployment duration patterns reflect dissimilarities in unemployment insurance (UI) systems in a way that convincingly establishes the link between economic incentives and job search behaviour. Specifically, UI...... benefits are relatively more generous for low-income workers in Sweden than in Norway, leading to relatively longer unemployment spells for low-income workers in Sweden. Based on the between-countries variation in replacement ratios, we find that the elasticity of the outflow rate from insured unemployment...

  14. Sort-Mid tasks scheduling algorithm in grid computing

    Directory of Open Access Journals (Sweden)

    Naglaa M. Reda

    2015-11-01

    Full Text Available Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

  15. Sort-Mid tasks scheduling algorithm in grid computing.

    Science.gov (United States)

    Reda, Naglaa M; Tawfik, A; Marzok, Mohamed A; Khamis, Soheir M

    2015-11-01

    Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

  16. Implementation Learning and Forgetting Curve to Scheduling in Garment Industry

    Science.gov (United States)

    Muhamad Badri, Huda; Deros, Baba Md; Syahri, M.; Saleh, Chairul; Fitria, Aninda

    2016-02-01

    The learning curve shows the relationship between time and the cumulative number of units produced which using the mathematical description on the performance of workers in performing repetitive works. The problems of this study is level differences in the labors performance before and after the break which affects the company's production scheduling. The study was conducted in the garment industry, which the aims is to predict the company production scheduling using the learning curve and forgetting curve. By implementing the learning curve and forgetting curve, this paper contributes in improving the labors performance that is in line with the increase in maximum output 3 hours productive before the break are 15 unit product with learning curve percentage in the company is 93.24%. Meanwhile, the forgetting curve improving maximum output 3 hours productive after the break are 11 unit product with the percentage of forgetting curve in the company is 92.96%. Then, the obtained 26 units product on the productive hours one working day is used as the basic for production scheduling.

  17. Project Robust Scheduling Based on the Scattered Buffer Technology

    Directory of Open Access Journals (Sweden)

    Nansheng Pang

    2018-04-01

    Full Text Available The research object in this paper is the sub network formed by the predecessor’s affect on the solution activity. This paper is to study three types of influencing factors from the predecessors that lead to the delay of starting time of the solution activity on the longest path, and to analyze the influence degree on the delay of the solution activity’s starting time from different types of factors. On this basis, through the comprehensive analysis of various factors that influence the solution activity, this paper proposes a metric that is used to evaluate the solution robustness of the project scheduling, and this metric is taken as the optimization goal. This paper also adopts the iterative process to design a scattered buffer heuristics algorithm based on the robust scheduling of the time buffer. At the same time, the resource flow network is introduced in this algorithm, using the tabu search algorithm to solve baseline scheduling. For the generation of resource flow network in the baseline scheduling, this algorithm designs a resource allocation algorithm with the maximum use of the precedence relations. Finally, the algorithm proposed in this paper and some other algorithms in previous literature are taken into the simulation experiment; under the comparative analysis, the experimental results show that the algorithm proposed in this paper is reasonable and feasible.

  18. Time while waiting: patients' experiences of scheduled surgery.

    Science.gov (United States)

    Carr, Tracey; Teucher, Ulrich C; Casson, Alan G

    2014-12-01

    Research on patients' experiences of wait time for scheduled surgery has centered predominantly on the relative tolerability of perceived wait time and impacts on quality of life. We explored patients' experiences of time while waiting for three types of surgery with varied wait times--hip or knee replacement, shoulder surgery, and cardiac surgery. Thirty-two patients were recruited by their surgeons. We asked participants about their perceptions of time while waiting in two separate interviews. Using interpretative phenomenological analysis (IPA), we discovered connections between participant suffering, meaningfulness of time, and agency over the waiting period and the lived duration of time experience. Our findings reveal that chronological duration is not necessarily the most relevant consideration in determining the quality of waiting experience. Those findings helped us create a conceptual framework for lived wait time. We suggest that clinicians and policy makers consider the complexity of wait time experience to enhance preoperative patient care. © The Author(s) 2014.

  19. Duration-frequency relationships of heavy rainfall in Santa Catarina, Brazil

    Directory of Open Access Journals (Sweden)

    Álvaro José Back

    2012-06-01

    Full Text Available The purpose of this study was to adjust equations that establish relationships between rainfall events with different duration and data from weather stations in the state of Santa Catarina, Brazil. In this study, the relationships between different duration heavy rainfalls from 13 weather stations of Santa Catarina were analyzed. From series of maximum annual rainfalls, and using the Gumbel-Chow distribution, the maximum rainfall for durations between 5 min and 24 h were estimated considering return periods from 2 to 100 years. The data fit to the Gumbel-Chow model was verified by the Kolmogorov-Smirnov test at 5 % significance. The coefficients of Bell's equation were adjusted to estimate the relationship between rainfall duration t (min and the return period T (y in relation to the maximum rainfall with a duration of 1 hour and a 10 year return period. Likewise, the coefficients of Bell's equation were adjusted based on the maximum rainfall with a duration of 1 day and a 10 year return period. The results showed that these relationships are viable to estimate short-duration rainfall events at locations where there are no rainfall records.

  20. 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

  1. 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...

  2. 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...

  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. Two-dimensional maximum entropy image restoration

    International Nuclear Information System (INIS)

    Brolley, J.E.; Lazarus, R.B.; Suydam, B.R.; Trussell, H.J.

    1977-07-01

    An optical check problem was constructed to test P LOG P maximum entropy restoration of an extremely distorted image. Useful recovery of the original image was obtained. Comparison with maximum a posteriori restoration is made. 7 figures

  8. 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…

  9. 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.

  10. Joint Scheduling for Dual-Hop Block-Fading Broadcast Channels

    KAUST Repository

    Zafar, Ammar

    2012-09-16

    In this paper, we propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal priority weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum rate scheduler and the proportional fair scheduler. We demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.

  11. 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

  12. 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.

  13. Scheduling of Multiple Chillers in Trigeneration Plants

    Directory of Open Access Journals (Sweden)

    Chris Underwood

    2015-10-01

    Full Text Available The scheduling of both absorption cycle and vapour compression cycle chillers in trigeneration plants is investigated in this work. Many trigeneration plants use absorption cycle chillers only but there are potential performance advantages to be gained by using a combination of absorption and compression chillers especially in situations where the building electrical demand to be met by the combined heat and power (CHP plant is variable. Simulation models of both types of chillers are developed together with a simple model of a variable-capacity CHP engine developed by curve-fitting to supplier’s data. The models are linked to form an optimisation problem in which the contribution of both chiller types is determined at a maximum value of operating cost (or carbon emission saving. Results show that an optimum operating condition arises at moderately high air conditioning demands and moderately low power demand when the air conditioning demand is shared between both chillers, all recovered heat is utilised, and the contribution arising from the compression chiller results in an increase in CHP power generation and, hence, engine efficiency.

  14. Optimization of operating schedule of machines in granite industry using evolutionary algorithms

    International Nuclear Information System (INIS)

    Loganthurai, P.; Rajasekaran, V.; Gnanambal, K.

    2014-01-01

    Highlights: • Operating time of machines in granite industries was studied. • Operating time has been optimized using evolutionary algorithms such as PSO, DE. • The maximum demand has been reduced. • Hence the electricity cost of the industry and feeder stress have been reduced. - Abstract: Electrical energy consumption cost plays an important role in the production cost of any industry. The electrical energy consumption cost is calculated as two part tariff, the first part is maximum demand cost and the second part is energy consumption cost or unit cost (kW h). The maximum demand cost can be reduced without affecting the production. This paper focuses on the reduction of maximum demand by proper operating schedule of major equipments. For this analysis, various granite industries are considered. The major equipments in granite industries are cutting machine, polishing machine and compressor. To reduce the maximum demand, the operating time of polishing machine is rescheduled by optimization techniques such as Differential Evolution (DE) and particle swarm optimization (PSO). The maximum demand costs are calculated before and after rescheduling. The results show that if the machines are optimally operated, the cost is reduced. Both DE and PSO algorithms reduce the maximum demand cost at the same rate for all the granite industries. However, the optimum scheduling obtained by DE reduces the feeder power flow than the PSO scheduling

  15. 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.

  16. 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

  17. Receiver function estimated by maximum entropy deconvolution

    Institute of Scientific and Technical Information of China (English)

    吴庆举; 田小波; 张乃铃; 李卫平; 曾融生

    2003-01-01

    Maximum entropy deconvolution is presented to estimate receiver function, with the maximum entropy as the rule to determine auto-correlation and cross-correlation functions. The Toeplitz equation and Levinson algorithm are used to calculate the iterative formula of error-predicting filter, and receiver function is then estimated. During extrapolation, reflective coefficient is always less than 1, which keeps maximum entropy deconvolution stable. The maximum entropy of the data outside window increases the resolution of receiver function. Both synthetic and real seismograms show that maximum entropy deconvolution is an effective method to measure receiver function in time-domain.

  18. Vehicle scheduling schemes for commercial and emergency logistics integration.

    Science.gov (United States)

    Li, Xiaohui; Tan, Qingmei

    2013-01-01

    In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models.

  19. Urbanization effect on trends in sunshine duration in China

    Directory of Open Access Journals (Sweden)

    Y. Wang

    2017-07-01

    Full Text Available There is an ongoing debate on whether the observed decadal variations in surface solar radiation, known as dimming and brightening periods, are a large-scale or solely local phenomenon. We investigated this issue using long-term sunshine duration records from China, which experienced a rapid increase in urbanization during the past decades. Over the period 1960–2013, 172 pairs of urban and nearby rural stations were analyzed. Urban and rural sunshine duration trends show similar spatial patterns during a dimming phase (1960–1989 and a subsequent period during which trends were leveling off (1990–2013. This indicates that rather than local effects, the trends in sunshine duration are on more of a national or regional scale in China. Nevertheless, in the dimming phase, the declining rate of sunshine duration in rural areas is around two-thirds of that in urban areas. The ratio of rural to urban dimming generally increases from a minimum of 0.39 to a maximum of 0.87 with increasing indices of urbanization calculated based on the year 2013. It reaches a maximum when the urbanization level exceeds 50 %, the urban population exceeds 20 million, or the population density becomes higher than 250 person km−2. After the transition into the leveling-off period, sunshine duration trends are no longer significantly affected by urbanization. Meanwhile, the number of laws and regulations related to air pollution and investment in pollution treatment have been increasing in China.

  20. Maximum Power from a Solar Panel

    Directory of Open Access Journals (Sweden)

    Michael Miller

    2010-01-01

    Full Text Available Solar energy has become a promising alternative to conventional fossil fuel sources. Solar panels are used to collect solar radiation and convert it into electricity. One of the techniques used to maximize the effectiveness of this energy alternative is to maximize the power output of the solar collector. In this project the maximum power is calculated by determining the voltage and the current of maximum power. These quantities are determined by finding the maximum value for the equation for power using differentiation. After the maximum values are found for each time of day, each individual quantity, voltage of maximum power, current of maximum power, and maximum power is plotted as a function of the time of day.

  1. 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

  2. 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

  3. 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.

  4. Development and comparison of different intensity duration ...

    African Journals Online (AJOL)

    Nigerian Journal of Technology ... Microsoft Excel software was used to develop exponential, logarithmic and power intensity-duration-frequency models for return period (T) of duration-frequency models for return period (T) of between 2 years and 100 years using rainfall intensity data for durations of 2, 5, 10, 15, 30, 60, ...

  5. Speaker-specific variability of phoneme durations

    CSIR Research Space (South Africa)

    Van Heerden, CJ

    2007-11-01

    Full Text Available The durations of phonemes varies for different speakers. To this end, the correlations between phonemes across different speakers are studied and a novel approach to predict unknown phoneme durations from the values of known phoneme durations for a...

  6. 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)

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

  8. 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...

  9. 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

  10. 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.

  11. 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.

  12. 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....

  13. 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...

  14. 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

  15. 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

  16. 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 ...

  17. 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...

  18. 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.

  19. 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...

  20. 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

  1. 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.

  2. Televised antismoking advertising: effects of level and duration of exposure.

    Science.gov (United States)

    Dunlop, Sally; Cotter, Trish; Perez, Donna; Wakefield, Melanie

    2013-08-01

    We assessed the effects of levels and duration of exposure to televised antismoking advertising on cognitive and behavioral changes. We used data from a serial cross-sectional telephone survey with weekly interviews of adult smokers and recent quitters in New South Wales, Australia (n = 13,301), between April 2005 and December 2010. We merged survey data with commercial TV ratings data to estimate individuals' exposure to antismoking advertising. Logistic regression analyses indicated that after adjustment for a wide range of potential confounders, exposure to antismoking advertising at levels between 100 and 200 gross rating points per week on average over 6 to 9 weeks was associated with an increased likelihood of having (1) salient quitting thoughts and (2) recent quit attempts. Associations between exposure for shorter periods and these outcomes were not significant. Broadcasting schedules may affect the success of antismoking ads. Campaign planners should ensure advertising exposure at adequate frequency over relatively sustained periods to maximize impact.

  3. Scheduling participants of Assessment Centres

    DEFF Research Database (Denmark)

    Lysgaard, Jens; Løber, Janni

      Assessment Centres are used as a tool for psychologists and coaches to observe a number of dimensions in a person's behaviour and test his/her potential within a number of chosen focus areas. This is done in an intense course, with a number of different exercises which expose each participant...... Centres usually last two days and involve 3-6 psychologists or trained coaches as assessors. An entire course is composed of a number of rounds, with each round having its individual duration. In each round, the participants are divided into a number of groups with prespecifed pairing of group sizes...

  4. 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.

  5. 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.

  6. 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...

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

  8. 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...

  9. Power scheduling in islanded-mode microgrids using fuel cell vehicles

    NARCIS (Netherlands)

    Alavi, Farid; Van De Wouw, Nathan; De Schutter, Bart

    2018-01-01

    We consider power scheduling in a microgrid operated in the islanded mode. It is assumed that at any time all the renewable energy sources are generating the maximum achievable electrical power based on the weather conditions and the power balance of the microgrid is exclusively done by a fleet of

  10. Integrating planning and scheduling in an oil refinery with a rolling horizon approach

    NARCIS (Netherlands)

    Zondervan, E.; Kaland, M.; van Elzakker, M.A.H.; Fransoo, J.C.; Meuldijk, J.; Klemes, J.J.; Varbanov, P.S.; Liew, P.Y.

    2014-01-01

    Decisions in an oil refinery are made at three levels: planning, scheduling and control. Existing facilities have to be operated close to their maximum capacity, while continuously responding to cost fluctuations. In many of the currently reported planning models each decision level has its own

  11. Single-machine scheduling with release dates, due dates and family setup times

    NARCIS (Netherlands)

    Schutten, Johannes M.J.; van de Velde, S.L.; van de Velde, S.L.; Zijm, Willem H.M.

    1996-01-01

    We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery

  12. Single-machine scheduling with release dates, due dates, and family setup times

    NARCIS (Netherlands)

    J.M.J. Schutten (Marco); S.L. van de Velde (Steef); W.H.M. Zijm

    1996-01-01

    textabstractWe address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery

  13. Improved irrigation scheduling for pear-jujube trees based on trunk ...

    African Journals Online (AJOL)

    A suitable indicator for scheduling pear-jujube (Ziziphus jujuba Mill.) irrigation in China was developed based on trunk diameter fluctuations (TDF). Parameters derived from TDF responses to variations in soil matrix potential (Ψsoil) were compared under deficit and well irrigation. Maximum daily shrinkage (MDS) increased ...

  14. Probabilistic representation of duration of load effects in timber structures

    DEFF Research Database (Denmark)

    Svensson, Staffan

    2011-01-01

    Reliability analysis of structures for the purpose of code calibration or reliability verification of specific structures requires that the relevant failure modes are represented and analyzed. For structural timber, sustaining a life load, two failure cases for each failure mode have......-based design of timber structures in terms of a modification factor View the MathML source which is multiplied on the short-term resistance of the timber material. The scenario of a beam subject to office space life loads is analyzed and the modification factor View the MathML source is calibrated by using...... to be considered. These two cases are maximum load level exceeding load-carrying capacity and damage accumulation (caused by the load and its duration) leading to failure. The effect of both load intensity and load duration on the capacity of timber has been an area of large interest over the last decades...

  15. 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.

  16. A preliminary analysis of the reactor-based plutonium disposition alternative deployment schedules

    International Nuclear Information System (INIS)

    Zurn, R.M.

    1997-09-01

    This paper discusses the preliminary analysis of the implementation schedules of the reactor-based plutonium disposition alternatives. These schedule analyses are a part of a larger process to examine the nine decision criteria used to determine the most appropriate method of disposing of U.S. surplus weapons plutonium. The preliminary analysis indicates that the mission durations for the reactor-based alternatives range from eleven years to eighteen years and the initial mission fuel assemblies containing surplus weapons-usable plutonium could be loaded into the reactors between nine and fourteen years after the Record of Decision

  17. Optimization of Multiperiod Mixed Train Schedule on High-Speed Railway

    Directory of Open Access Journals (Sweden)

    Wenliang Zhou

    2015-01-01

    Full Text Available For providing passengers with periodic operation trains and making trains’ time distribution better fit that of passengers, the multiperiod mixed train schedule is first proposed in this paper. It makes each type of train having same origin, destination, route, and stop stations operate based on a periodic basis and allows different types of train to have various operation periods. Then a model of optimizing multiperiod mixed train schedule is built to minimize passengers generalized travel costs with the constraints of trains of same type operating periodically, safe interval requirements of trains’ departure, and arrival times, and so forth. And its heuristic algorithm is designed to optimize the multiperiod mixed train schedule beginning with generating an initial solution by scheduling all types of train type by type and then repeatedly improving their periodic schedules until the objective value cannot be reduced or the iteration number reaches its maximum. Finally, example results illustrate that the proposed model and algorithm can effectively gain a better multiperiod mixed train schedule. However, its passengers deferred times and advanced times are a little higher than these of an aperiodic train schedule.

  18. 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.

  19. Revealing the Maximum Strength in Nanotwinned Copper

    DEFF Research Database (Denmark)

    Lu, L.; Chen, X.; Huang, Xiaoxu

    2009-01-01

    boundary–related processes. We investigated the maximum strength of nanotwinned copper samples with different twin thicknesses. We found that the strength increases with decreasing twin thickness, reaching a maximum at 15 nanometers, followed by a softening at smaller values that is accompanied by enhanced...

  20. Modelling maximum canopy conductance and transpiration in ...

    African Journals Online (AJOL)

    There is much current interest in predicting the maximum amount of water that can be transpired by Eucalyptus trees. It is possible that industrial waste water may be applied as irrigation water to eucalypts and it is important to predict the maximum transpiration rates of these plantations in an attempt to dispose of this ...

  1. Maximum Work of Free-Piston Stirling Engine Generators

    Science.gov (United States)

    Kojima, Shinji

    2017-04-01

    Using the method of adjoint equations described in Ref. [1], we have calculated the maximum thermal efficiencies that are theoretically attainable by free-piston Stirling and Carnot engine generators by considering the work loss due to friction and Joule heat. The net work done by the Carnot cycle is negative even when the duration of heat addition is optimized to give the maximum amount of heat addition, which is the same situation for the Brayton cycle described in our previous paper. For the Stirling cycle, the net work done is positive, and the thermal efficiency is greater than that of the Otto cycle described in our previous paper by a factor of about 2.7-1.4 for compression ratios of 5-30. The Stirling cycle is much better than the Otto, Brayton, and Carnot cycles. We have found that the optimized piston trajectories of the isothermal, isobaric, and adiabatic processes are the same when the compression ratio and the maximum volume of the same working fluid of the three processes are the same, which has facilitated the present analysis because the optimized piston trajectories of the Carnot and Stirling cycles are the same as those of the Brayton and Otto cycles, respectively.

  2. The effect of predictability on subjective duration.

    Directory of Open Access Journals (Sweden)

    Vani Pariyadath

    2007-11-01

    Full Text Available Events can sometimes appear longer or shorter in duration than other events of equal length. For example, in a repeated presentation of auditory or visual stimuli, an unexpected object of equivalent duration appears to last longer. Illusions of duration distortion beg an important question of time representation: when durations dilate or contract, does time in general slow down or speed up during that moment? In other words, what entailments do duration distortions have with respect to other timing judgments? We here show that when a sound or visual flicker is presented in conjunction with an unexpected visual stimulus, neither the pitch of the sound nor the frequency of the flicker is affected by the apparent duration dilation. This demonstrates that subjective time in general is not slowed; instead, duration judgments can be manipulated with no concurrent impact on other temporal judgments. Like spatial vision, time perception appears to be underpinned by a collaboration of separate neural mechanisms that usually work in concert but are separable. We further show that the duration dilation of an unexpected stimulus is not enhanced by increasing its saliency, suggesting that the effect is more closely related to prediction violation than enhanced attention. Finally, duration distortions induced by violations of progressive number sequences implicate the involvement of high-level predictability, suggesting the involvement of areas higher than primary visual cortex. We suggest that duration distortions can be understood in terms of repetition suppression, in which neural responses to repeated stimuli are diminished.

  3. Preliminary flood-duration frequency estimates using naturalized streamflow records for the Willamette River Basin, Oregon

    Science.gov (United States)

    Lind, Greg D.; Stonewall, Adam J.

    2018-02-13

    In this study, “naturalized” daily streamflow records, created by the U.S. Army Corps of Engineers and the Bureau of Reclamation, were used to compute 1-, 3-, 7-, 10-, 15-, 30-, and 60-day annual maximum streamflow durations, which are running averages of daily streamflow for the number of days in each duration. Once the annual maximum durations were computed, the floodduration frequencies could be estimated. The estimated flood-duration frequencies correspond to the 50-, 20-, 10-, 4-, 2-, 1-, 0.5-, and 0.2-percent probabilities of their occurring or being exceeded each year. For this report, the focus was on the Willamette River Basin in Oregon, which is a subbasin of the Columbia River Basin. This study is part of a larger one encompassing the entire Columbia Basin.

  4. Likelihood Estimation of Gamma Ray Bursts Duration Distribution

    OpenAIRE

    Horvath, Istvan

    2005-01-01

    Two classes of Gamma Ray Bursts have been identified so far, characterized by T90 durations shorter and longer than approximately 2 seconds. It was shown that the BATSE 3B data allow a good fit with three Gaussian distributions in log T90. In the same Volume in ApJ. another paper suggested that the third class of GRBs is may exist. Using the full BATSE catalog here we present the maximum likelihood estimation, which gives us 0.5% probability to having only two subclasses. The MC simulation co...

  5. Maximum Hours Legislation and Female Employment in the 1920s: A Reasse ssment

    OpenAIRE

    Claudia Goldin

    1986-01-01

    The causes and consequences of state maximum hours laws for female workers, passed from the mid-1800s to the 1920s, are explored and are found to differ from a recent reinterpretation. Although maximum hours legislation reduced scheduled hours in 1920, the impact was minimal and it operated equally for men. Legislation affecting only women was symptomatic of a general desire by labor for lower hours, and these lower hours were achieved in the tight, and otherwise special, World War I labor ma...

  6. 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...

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

  8. 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

  9. 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

  10. The operational flight and multi-crew scheduling problem

    Directory of Open Access Journals (Sweden)

    Stojković Mirela

    2005-01-01

    Full Text Available This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-day planned duties for the considered crew members. A new type of the same flight departure time constraints is introduced. They ensure that a flight which belongs to several personalized duties, where the number of duties is equal to the number of crew members assigned to the flight, will have the same departure time in each of these duties. Two variants of the problem are considered. The first variant allows covering of flights by less than the planned number of crew members, while the second one requires covering of flights by a complete crew. The problem is mathematically formulated as an integer nonlinear multi-commodity network flow model with time windows and supplementary constraints. The optimal solution approach is based on Dantzig-Wolfe decomposition/column generation embedded into a branch-and-bound scheme. The resulting computational times on commercial-size problems are very good. Our new simultaneous approach produces solutions whose quality is far better than that of the traditional sequential approach where the flight schedule has been changed first and then input as a fixed data to the crew scheduling problem.

  11. Prioritizing and scheduling Portsmouth Gaseous Diffusion Plant safeguards upgrades

    International Nuclear Information System (INIS)

    Edmunds, T.; Saleh, R.; Zevanove, S.

    1992-02-01

    As part of the Site Safeguards and Security Plan (SSSP), facilities are required to develop a Resource Plan (RP). The Resource Plan provides documentation and justification for the facility's planned upgrades, including the schedule, priority, and cost estimates for the safeguards and security upgrades. Portsmouth Gaseous Diffusion Plant (PORTS) management has identified and obtained funding approval for a number of safeguards and security upgrades, including line-item construction projects. These upgrade projects were selected to address a variety of concerns identified in the PORTS vulnerability assessments and other reviews performed in support of the SSSP process. However, budgeting and scheduling constraints do not make it possible to simultaneously begin implementation of all of the upgrade projects. A formal methodology and analysis are needed to explicitly address the trade-offs between competing safeguards objectives, and to prioritize and schedule the upgrade projects to ensure that the maximum benefit can be realized in the shortest possible time frame. The purpose of this report is to describe the methodology developed to support these upgrade project scheduling decisions. The report also presents the results obtained from applying the methodology to a set of the upgrade projects selected by PORTS S ampersand S management. Data for the analysis are based on discussions with personnel familiar with the PORTS safeguards and security needs, the requirements for implementing these upgrades, and upgrade funding limitations. The analysis results presented here assume continued highly enriched uranium (HEU) operations at PORTS. However, the methodology developed is readily adaptable for the evaluation of other operational scenarios and other resource allocation issues relevant to PORTS

  12. 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.

  13. 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

  14. 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…

  15. 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

  16. 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...

  17. 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...

  18. 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...

  19. 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…

  20. 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

  1. 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

  2. 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...

  3. 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...

  4. 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

  5. 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...

  6. Algeria schedules onshore licensing round

    International Nuclear Information System (INIS)

    Anon.

    1992-01-01

    This paper reports that Algeria's Sonatrach will conduct its first international onshore exploration licensing round in a move designed to triple drilling activity in the country. A second round will follow next April. Sonatrach plans to drill 200 wells during 1991-95, which will require the current level of 37/year to be almost trebled toward the end of the period. To this end foreign operators are being courted in an open exploration bidding round. Deadline for bid submittal in Nov. 30. Companies may enter singly or in groups to form partnerships with Sonatrach. Foreign licensees will be able to take a maximum 49% of production under Algerian law

  7. Subjective duration distortions mirror neural repetition suppression.

    Science.gov (United States)

    Pariyadath, Vani; Eagleman, David M

    2012-01-01

    Subjective duration is strongly influenced by repetition and novelty, such that an oddball stimulus in a stream of repeated stimuli appears to last longer in duration in comparison. We hypothesize that this duration illusion, called the temporal oddball effect, is a result of the difference in expectation between the oddball and the repeated stimuli. Specifically, we conjecture that the repeated stimuli contract in duration as a result of increased predictability; these duration contractions, we suggest, result from decreased neural response amplitude with repetition, known as repetition suppression. Participants viewed trials consisting of lines presented at a particular orientation (standard stimuli) followed by a line presented at a different orientation (oddball stimulus). We found that the size of the oddball effect correlates with the number of repetitions of the standard stimulus as well as the amount of deviance from the oddball stimulus; both of these results are consistent with a repetition suppression hypothesis. Further, we find that the temporal oddball effect is sensitive to experimental context--that is, the size of the oddball effect for a particular experimental trial is influenced by the range of duration distortions seen in preceding trials. Our data suggest that the repetition-related duration contractions causing the oddball effect are a result of neural repetition suppression. More generally, subjective duration may reflect the prediction error associated with a stimulus and, consequently, the efficiency of encoding that stimulus. Additionally, we emphasize that experimental context effects need to be taken into consideration when designing duration-related tasks.

  8. Incorporating Duration Information in Activity Recognition

    Science.gov (United States)

    Chaurasia, Priyanka; Scotney, Bryan; McClean, Sally; Zhang, Shuai; Nugent, Chris

    Activity recognition has become a key issue in smart home environments. The problem involves learning high level activities from low level sensor data. Activity recognition can depend on several variables; one such variable is duration of engagement with sensorised items or duration of intervals between sensor activations that can provide useful information about personal behaviour. In this paper a probabilistic learning algorithm is proposed that incorporates episode, time and duration information to determine inhabitant identity and the activity being undertaken from low level sensor data. Our results verify that incorporating duration information consistently improves the accuracy.

  9. 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.

  10. 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.

  11. MXLKID: a maximum likelihood parameter identifier

    International Nuclear Information System (INIS)

    Gavel, D.T.

    1980-07-01

    MXLKID (MaXimum LiKelihood IDentifier) is a computer program designed to identify unknown parameters in a nonlinear dynamic system. Using noisy measurement data from the system, the maximum likelihood identifier computes a likelihood function (LF). Identification of system parameters is accomplished by maximizing the LF with respect to the parameters. The main body of this report briefly summarizes the maximum likelihood technique and gives instructions and examples for running the MXLKID program. MXLKID is implemented LRLTRAN on the CDC7600 computer at LLNL. A detailed mathematical description of the algorithm is given in the appendices. 24 figures, 6 tables

  12. Can we predict the duration of an interglacial?

    Directory of Open Access Journals (Sweden)

    P. C. Tzedakis

    2012-09-01

    Full Text Available Differences in the duration of interglacials have long been apparent in palaeoclimate records of the Late and Middle Pleistocene. However, a systematic evaluation of such differences has been hampered by the lack of a metric that can be applied consistently through time and by difficulties in separating the local from the global component in various proxies. This, in turn, means that a theoretical framework with predictive power for interglacial duration has remained elusive. Here we propose that the interval between the terminal oscillation of the bipolar seesaw and three thousand years (kyr before its first major reactivation provides an estimate that approximates the length of the sea-level highstand, a measure of interglacial duration. We apply this concept to interglacials of the last 800 kyr by using a recently-constructed record of interhemispheric variability. The onset of interglacials occurs within 2 kyr of the boreal summer insolation maximum/precession minimum and is consistent with the canonical view of Milankovitch forcing pacing the broad timing of interglacials. Glacial inception always takes place when obliquity is decreasing and never after the obliquity minimum. The phasing of precession and obliquity appears to influence the persistence of interglacial conditions over one or two insolation peaks, leading to shorter (~ 13 kyr and longer (~ 28 kyr interglacials. Glacial inception occurs approximately 10 kyr after peak interglacial conditions in temperature and CO2, representing a characteristic timescale of interglacial decline. Second-order differences in duration may be a function of stochasticity in the climate system, or small variations in background climate state and the magnitude of feedbacks and mechanisms contributing to glacial inception, and as such, difficult to predict. On the other hand, the broad duration of an interglacial may be determined by the phasing of astronomical parameters and the history of

  13. 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

  14. Developing an efficient scheduling template of a chemotherapy treatment unit: A case study.

    Science.gov (United States)

    Ahmed, Z; Elmekkawy, Ty; Bates, S

    2011-01-01

    This study was undertaken to improve the performance of a Chemotherapy Treatment Unit by increasing the throughput and reducing the average patient's waiting time. In order to achieve this objective, a scheduling template has been built. The scheduling template is a simple tool that can be used to schedule patients' arrival to the clinic. A simulation model of this system was built and several scenarios, that target match the arrival pattern of the patients and resources availability, were designed and evaluated. After performing detailed analysis, one scenario provide the best system's performance. A scheduling template has been developed based on this scenario. After implementing the new scheduling template, 22.5% more patients can be served. 1. CancerCare Manitoba is a provincially mandated cancer care agency. It is dedicated to provide quality care to those who have been diagnosed and are living with cancer. MacCharles Chemotherapy unit is specially built to provide chemotherapy treatment to the cancer patients of Winnipeg. In order to maintain an excellent service, it tries to ensure that patients get their treatment in a timely manner. It is challenging to maintain that goal because of the lack of a proper roster, the workload distribution and inefficient resource allotment. In order to maintain the satisfaction of the patients and the healthcare providers, by serving the maximum number of patients in a timely manner, it is necessary to develop an efficient scheduling template that matches the required demand with the availability of resources. This goal can be reached using simulation modelling. Simulation has proven to be an excellent modelling tool. It can be defined as building computer models that represent real world or hypothetical systems, and hence experimenting with these models to study system behaviour under different scenarios.1, 2 A study was undertaken at the Children's Hospital of Eastern Ontario to identify the issues behind the long waiting

  15. Maximum neutron flux in thermal reactors

    International Nuclear Information System (INIS)

    Strugar, P.V.

    1968-12-01

    Direct approach to the problem is to calculate spatial distribution of fuel concentration if the reactor core directly using the condition of maximum neutron flux and comply with thermal limitations. This paper proved that the problem can be solved by applying the variational calculus, i.e. by using the maximum principle of Pontryagin. Mathematical model of reactor core is based on the two-group neutron diffusion theory with some simplifications which make it appropriate from maximum principle point of view. Here applied theory of maximum principle are suitable for application. The solution of optimum distribution of fuel concentration in the reactor core is obtained in explicit analytical form. The reactor critical dimensions are roots of a system of nonlinear equations and verification of optimum conditions can be done only for specific examples

  16. Maximum allowable load on wheeled mobile manipulators

    International Nuclear Information System (INIS)

    Habibnejad Korayem, M.; Ghariblu, H.

    2003-01-01

    This paper develops a computational technique for finding the maximum allowable load of mobile manipulator during a given trajectory. The maximum allowable loads which can be achieved by a mobile manipulator during a given trajectory are limited by the number of factors; probably the dynamic properties of mobile base and mounted manipulator, their actuator limitations and additional constraints applied to resolving the redundancy are the most important factors. To resolve extra D.O.F introduced by the base mobility, additional constraint functions are proposed directly in the task space of mobile manipulator. Finally, in two numerical examples involving a two-link planar manipulator mounted on a differentially driven mobile base, application of the method to determining maximum allowable load is verified. The simulation results demonstrates the maximum allowable load on a desired trajectory has not a unique value and directly depends on the additional constraint functions which applies to resolve the motion redundancy

  17. Maximum phytoplankton concentrations in the sea

    DEFF Research Database (Denmark)

    Jackson, G.A.; Kiørboe, Thomas

    2008-01-01

    A simplification of plankton dynamics using coagulation theory provides predictions of the maximum algal concentration sustainable in aquatic systems. These predictions have previously been tested successfully against results from iron fertilization experiments. We extend the test to data collect...

  18. Cost and schedule reduction for next-generation Candu

    International Nuclear Information System (INIS)

    Hopwood, J.M.; Yu, S.; Pakan, M.; Soulard, M.

    2002-01-01

    AECL has developed a suite of technologies for Candu R reactors that enable the next step in the evolution of the Candu family of heavy-water-moderated fuel-channel reactors. These technologies have been combined in the design for the Advanced Candu Reactor TM1 (ACRTM), AECL's next generation Candu power plant. The ACR design builds extensively on the existing Candu experience base, but includes innovations, in design and in delivery technology, that provide very substantial reductions in capital cost and in project schedules. In this paper, main features of next generation design and delivery are summarized, to provide the background basis for the cost and schedule reductions that have been achieved. In particular the paper outlines the impact of the innovative design steps for ACR: - Selection of slightly enriched fuel bundle design; - Use of light water coolant in place of traditional Candu heavy water coolant; - Compact core design with unique reactor physics benefits; - Optimized coolant and turbine system conditions. In addition to the direct cost benefits arising from efficiency improvement, and from the reduction in heavy water, the next generation Candu configuration results in numerous additional indirect cost benefits, including: - Reduction in number and complexity of reactivity mechanisms; - Reduction in number of heavy water auxiliary systems; - Simplification in heat transport and its support systems; - Simplified human-machine interface. The paper also describes the ACR approach to design for constructability. The application of module assembly and open-top construction techniques, based on Candu and other worldwide experience, has been proven to generate savings in both schedule durations and overall project cost, by reducing premium on-site activities, and by improving efficiency of system and subsystem assembly. AECL's up-to-date experience in the use of 3-D CADDS and related engineering tools has also been proven to reduce both engineering and

  19. Maximum-Likelihood Detection Of Noncoherent CPM

    Science.gov (United States)

    Divsalar, Dariush; Simon, Marvin K.

    1993-01-01

    Simplified detectors proposed for use in maximum-likelihood-sequence detection of symbols in alphabet of size M transmitted by uncoded, full-response continuous phase modulation over radio channel with additive white Gaussian noise. Structures of receivers derived from particular interpretation of maximum-likelihood metrics. Receivers include front ends, structures of which depends only on M, analogous to those in receivers of coherent CPM. Parts of receivers following front ends have structures, complexity of which would depend on N.

  20. 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.

  1. Excessive daytime sleepiness, nocturnal sleep duration and ...

    African Journals Online (AJOL)

    Background and objectives. Short nocturnal sleep duration resulting in sleep debt may be a cause of excessive daytime sleepiness (EDS). Severity of depression (psychopathology) has been found to be directly related to EDS. There is an association between sleep duration and mental health, so there may therefore be an ...

  2. Unemployment Duration over the Business Cycle

    DEFF Research Database (Denmark)

    Rosholm, Michael

    1996-01-01

    In this paper I study the way in which individual unemployment durations vary over the business cycle, as measured by the aggregate unemployment rate. I decompose the cyclical variations in observed unemployment durations into a composition al and a general part. The compositional part consists...

  3. Word Durations in Non-Native English

    Science.gov (United States)

    Baker, Rachel E.; Baese-Berk, Melissa; Bonnasse-Gahot, Laurent; Kim, Midam; Van Engen, Kristin J.; Bradlow, Ann R.

    2010-01-01

    In this study, we compare the effects of English lexical features on word duration for native and non-native English speakers and for non-native speakers with different L1s and a range of L2 experience. We also examine whether non-native word durations lead to judgments of a stronger foreign accent. We measured word durations in English paragraphs read by 12 American English (AE), 20 Korean, and 20 Chinese speakers. We also had AE listeners rate the `accentedness' of these non-native speakers. AE speech had shorter durations, greater within-speaker word duration variance, greater reduction of function words, and less between-speaker variance than non-native speech. However, both AE and non-native speakers showed sensitivity to lexical predictability by reducing second mentions and high frequency words. Non-native speakers with more native-like word durations, greater within-speaker word duration variance, and greater function word reduction were perceived as less accented. Overall, these findings identify word duration as an important and complex feature of foreign-accented English. PMID:21516172

  4. On the Limitation of Warranty Duration.

    OpenAIRE

    Emons, Winand

    1989-01-01

    This paper analyzes the frequently-observed phenomenon that firms offer product warranties that are of much shorter duration than the life expectancy of these products. It is shown that competitive equilibria may entail limitation of warranty duration if firms face adverse selection problems with respect to different consumers. Copyright 1989 by Blackwell Publishing Ltd.

  5. An Arrival and Departure Time Predictor for Scheduling Communication in Opportunistic IoT

    Science.gov (United States)

    Pozza, Riccardo; Georgoulas, Stylianos; Moessner, Klaus; Nati, Michele; Gluhak, Alexander; Krco, Srdjan

    2016-01-01

    In this article, an Arrival and Departure Time Predictor (ADTP) for scheduling communication in opportunistic Internet of Things (IoT) is presented. The proposed algorithm learns about temporal patterns of encounters between IoT devices and predicts future arrival and departure times, therefore future contact durations. By relying on such predictions, a neighbour discovery scheduler is proposed, capable of jointly optimizing discovery latency and power consumption in order to maximize communication time when contacts are expected with high probability and, at the same time, saving power when contacts are expected with low probability. A comprehensive performance evaluation with different sets of synthetic and real world traces shows that ADTP performs favourably with respect to previous state of the art. This prediction framework opens opportunities for transmission planners and schedulers optimizing not only neighbour discovery, but the entire communication process. PMID:27827909

  6. An Arrival and Departure Time Predictor for Scheduling Communication in Opportunistic IoT.

    Science.gov (United States)

    Pozza, Riccardo; Georgoulas, Stylianos; Moessner, Klaus; Nati, Michele; Gluhak, Alexander; Krco, Srdjan

    2016-11-04

    In this article, an Arrival and Departure Time Predictor (ADTP) for scheduling communication in opportunistic Internet of Things (IoT) is presented. The proposed algorithm learns about temporal patterns of encounters between IoT devices and predicts future arrival and departure times, therefore future contact durations. By relying on such predictions, a neighbour discovery scheduler is proposed, capable of jointly optimizing discovery latency and power consumption in order to maximize communication time when contacts are expected with high probability and, at the same time, saving power when contacts are expected with low probability. A comprehensive performance evaluation with different sets of synthetic and real world traces shows that ADTP performs favourably with respect to previous state of the art. This prediction framework opens opportunities for transmission planners and schedulers optimizing not only neighbour discovery, but the entire communication process.

  7. INTEGRATION OF SHIP HULL ASSEMBLY SEQUENCE PLANNING, SCHEDULING AND BUDGETING

    Directory of Open Access Journals (Sweden)

    Remigiusz Romuald Iwańkowicz

    2015-02-01

    Full Text Available The specificity of the yard work requires the particularly careful treatment of the issues of scheduling and budgeting in the production planning processes. The article presents the method of analysis of the assembly sequence taking into account the duration of individual activities and the demand for resources. A method of the critical path and resource budgeting were used. Modelling of the assembly was performed using the acyclic graphs. It has been shown that the assembly sequences can have very different feasible budget regions. The proposed model is applied to the assembly processes of large-scale welded structures, including the hulls of ships. The presented computational examples have a simulation character. They show the usefulness of the model and the possibility to use it in a variety of analyses.

  8. The influence of stimulus phase duration on discomfort and electrically induced torque of quadriceps femoris

    Directory of Open Access Journals (Sweden)

    Richard E. Liebano

    2013-10-01

    Full Text Available BACKGROUND: Although a number of studies have compared the influence of different electrical pulse parameters on maximum electrically induced torque (MEIT and discomfort, the role of phase duration has been poorly investigated. OBJECTIVE: To examine the variation in muscle torque and discomfort produced when electrically stimulating quadriceps femoris using pulsed current with three different phase durations in order to establish whether there are any advantages or disadvantages in varying the phase duration over the range examined. METHOD: This is a two repeated-measures, within-subject study conducted in a research laboratory. The study was divided into 2 parts with 19 healthy young adults in each part.In part 1, MEIT was determined for each phase duration (400, 700, and 1000 µs, using a biphasic pulsed current at a frequency of 50 Hz. In part 2, stimulus amplitude was increased until the contractions reached 40% of maximum voluntary isometric contraction (MVIC and the associated discomfort produced by each phase duration was measured. RESULTS: In part 1 of the study, we found that the average MEITs generated with each phase duration (400, 700, and 1000 µs were 55.0, 56.3, and 58.0% of MVIC respectively, but the differences were not statistically significant (p=.45. In part 2, we found a statistically significant increase in discomfort over the same range of phase durations. The results indicate that, for a given level of torque production, discomfort increases with increasing phase duration (p=.008. CONCLUSIONS: Greater muscle torque cannot be produced by increasing the stimulus phase duration over the range examined. Greater discomfort is produced by increasing the stimulus phase duration.

  9. 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

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. 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

  16. From Sleep Duration to Childhood Obesity

    DEFF Research Database (Denmark)

    Börnhorst, Claudia; Hense, Sabrina; Ahrens, Wolfgang

    2012-01-01

    Sleep duration has been identified as risk factor for obesity already in children. Besides investigating the role of fat mass (FM), this study addressed the question whether endocrine mechanisms act as intermediates in the association between sleep duration and overweight/obesity. Within...... the framework of the IDEFICS study, the present research was conducted in 609 German resident children aged 2–9 years with information on fasting insulin, C-reactive protein and cortisol levels next to anthropometric measurements and parental questionnaires. Emphasising methodological aspects, an age......-specific measure of sleep duration was derived to account for alteration in sleep duration during childhood/period of growth. Multivariate linear regression and quantile regression models confirmed an inverse relationship between sleep duration and measures of overweight/obesity. The estimate for the association...

  17. Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

    KAUST Repository

    Douik, Ahmed

    2017-09-07

    Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and, therefore, allows for joint signal processing within the cloud transmission. Across the multiple clouds, however, only scheduling-level coordination is permitted, as low levels of backhaul communication are feasible. The frame structure of every BS is composed of various time/frequency blocks, called power-zones (PZs), which are maintained at a fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled to a single cloud at most, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs’ frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The considered scheduling problem is, then, shown to be equivalent to a maximum-weight independent set problem in the constructed graph, which can be solved using efficient techniques. The paper then proposes solving the problem using both optimal and heuristic algorithms that can be implemented in a distributed fashion across the network. The proposed distributed algorithms rely on the well-chosen structure of the constructed conflict graph utilized to solve the maximum-weight independent set problem. Simulation results suggest that the proposed optimal and heuristic hybrid scheduling strategies provide appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

  18. 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.

  19. Techniques for establishing schedules with wheel running as reinforcement in rats.

    Science.gov (United States)

    Iversen, I H

    1993-07-01

    In three experiments, access to wheel running was contingent on lever pressing. In each experiment, the duration of access to running was reduced gradually to 4, 5, or 6 s, and the schedule parameters were expanded gradually. The sessions lasted 2 hr. In Experiment 1, a fixed-ratio 20 schedule controlled a typical break-and-run pattern of lever pressing that was maintained throughout the session for 3 rats. In Experiment 2, a fixed-interval schedule of 6 min maintained lever pressing throughout the session for 3 rats, and for 1 rat, the rate of lever pressing was positively accelerated between reinforcements. In Experiment 3, a variable-ratio schedule of 20 or 35 was in effect and maintained lever pressing at a very stable pace throughout the session for 2 of 3 rats; for 1 rat, lever pressing was maintained at an irregular rate. When the session duration was extended to successive 24-hr periods, with food and water accessible in Experiment 3, lever pressing settled into a periodic pattern occurring at a high rate at approximately the same time each day. In each experiment, the rats that developed the highest local rates of running during wheel access also maintained the most stable and highest rates of lever pressing.

  20. A global quantification of "normal" sleep schedules using smartphone data.

    Science.gov (United States)

    Walch, Olivia J; Cochran, Amy; Forger, Daniel B

    2016-05-01

    The influence of the circadian clock on sleep scheduling has been studied extensively in the laboratory; however, the effects of society on sleep remain largely unquantified. We show how a smartphone app that we have developed, ENTRAIN, accurately collects data on sleep habits around the world. Through mathematical modeling and statistics, we find that social pressures weaken and/or conceal biological drives in the evening, leading individuals to delay their bedtime and shorten their sleep. A country's average bedtime, but not average wake time, predicts sleep duration. We further show that mathematical models based on controlled laboratory experiments predict qualitative trends in sunrise, sunset, and light level; however, these effects are attenuated in the real world around bedtime. Additionally, we find that women schedule more sleep than men and that users reporting that they are typically exposed to outdoor light go to sleep earlier and sleep more than those reporting indoor light. Finally, we find that age is the primary determinant of sleep timing, and that age plays an important role in the variability of population-level sleep habits. This work better defines and personalizes "normal" sleep, produces hypotheses for future testing in the laboratory, and suggests important ways to counteract the global sleep crisis.

  1. Short term scheduling of multiple grid-parallel PEM fuel cells for microgrid applications

    Energy Technology Data Exchange (ETDEWEB)

    El-Sharkh, M.Y.; Rahman, A.; Alam, M.S. [Dept. of Electrical and Computer Engineering, University of South Alabama, Mobile, AL 36688 (United States)

    2010-10-15

    This paper presents a short term scheduling scheme for multiple grid-parallel PEM fuel cell power plants (FCPPs) connected to supply electrical and thermal energy to a microgrid community. As in the case of regular power plants, short term scheduling of FCPP is also a cost-based optimization problem that includes the cost of operation, thermal power recovery, and the power trade with the local utility grid. Due to the ability of the microgrid community to trade power with the local grid, the power balance constraint is not applicable, other constraints like the real power operating limits of the FCPP, and minimum up and down time are therefore used. To solve the short term scheduling problem of the FCPPs, a hybrid technique based on evolutionary programming (EP) and hill climbing technique (HC) is used. The EP is used to estimate the optimal schedule and the output power from each FCPP. The HC technique is used to monitor the feasibility of the solution during the search process. The short term scheduling problem is used to estimate the schedule and the electrical and thermal power output of five FCPPs supplying a maximum power of 300 kW. (author)

  2. 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...

  3. Maximum gravitational redshift of white dwarfs

    International Nuclear Information System (INIS)

    Shapiro, S.L.; Teukolsky, S.A.

    1976-01-01

    The stability of uniformly rotating, cold white dwarfs is examined in the framework of the Parametrized Post-Newtonian (PPN) formalism of Will and Nordtvedt. The maximum central density and gravitational redshift of a white dwarf are determined as functions of five of the nine PPN parameters (γ, β, zeta 2 , zeta 3 , and zeta 4 ), the total angular momentum J, and the composition of the star. General relativity predicts that the maximum redshifts is 571 km s -1 for nonrotating carbon and helium dwarfs, but is lower for stars composed of heavier nuclei. Uniform rotation can increase the maximum redshift to 647 km s -1 for carbon stars (the neutronization limit) and to 893 km s -1 for helium stars (the uniform rotation limit). The redshift distribution of a larger sample of white dwarfs may help determine the composition of their cores

  4. Subjective duration distortions mirror neural repetition suppression.

    Directory of Open Access Journals (Sweden)

    Vani Pariyadath

    Full Text Available Subjective duration is strongly influenced by repetition and novelty, such that an oddball stimulus in a stream of repeated stimuli appears to last longer in duration in comparison. We hypothesize that this duration illusion, called the temporal oddball effect, is a result of the difference in expectation between the oddball and the repeated stimuli. Specifically, we conjecture that the repeated stimuli contract in duration as a result of increased predictability; these duration contractions, we suggest, result from decreased neural response amplitude with repetition, known as repetition suppression.Participants viewed trials consisting of lines presented at a particular orientation (standard stimuli followed by a line presented at a different orientation (oddball stimulus. We found that the size of the oddball effect correlates with the number of repetitions of the standard stimulus as well as the amount of deviance from the oddball stimulus; both of these results are consistent with a repetition suppression hypothesis. Further, we find that the temporal oddball effect is sensitive to experimental context--that is, the size of the oddball effect for a particular experimental trial is influenced by the range of duration distortions seen in preceding trials.Our data suggest that the repetition-related duration contractions causing the oddball effect are a result of neural repetition suppression. More generally, subjective duration may reflect the prediction error associated with a stimulus and, consequently, the efficiency of encoding that stimulus. Additionally, we emphasize that experimental context effects need to be taken into consideration when designing duration-related tasks.

  5. 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.

  6. 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...

  7. Alternative Work Schedules Increase Employee Satisfaction.

    Science.gov (United States)

    Turney, John R.; Cohen, Stanley L.

    1983-01-01

    Facets of alternative work schedules (AWS) are discussed: importance of employee control, possible negative consequences, AWS handbook, time monitoring systems, and treatment of exceptions. AWS' effect on productivity and motivation is examined. (SK)

  8. The Composition of the Master Schedule

    Science.gov (United States)

    Thomas, Cynthia C.; Behrend, Dirk; MacMillan, Daniel S.

    2010-01-01

    Over a period of about four months, the IVS Coordinating Center (IVSCC) each year composes the Master Schedule for the IVS observing program of the next calendar year. The process begins in early July when the IVSCC contacts the IVS Network Stations to request information about available station time as well as holiday and maintenance schedules for the upcoming year. Going through various planning stages and a review process with the IVS Observing Program Committee (OPC), the final version of the Master Schedule is posted by early November. We describe the general steps of the composition and illustrate them with the example of the planning for the Master Schedule of the 2010 observing year.

  9. 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...

  10. Schedule Sales Query Report Generation System

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

  11. Knowledge-based scheduling of arrival aircraft

    Science.gov (United States)

    Krzeczowski, K.; Davis, T.; Erzberger, H.; Lev-Ram, I.; Bergh, C.

    1995-01-01

    A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

  12. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

    This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...

  13. Congruent Validity of the Rathus Assertiveness Schedule.

    Science.gov (United States)

    Harris, Thomas L.; Brown, Nina W.

    1979-01-01

    The validity of the Rathus Assertiveness Schedule (RAS) was investigated by correlating it with the six Class I scales of the California Psychological Inventory on a sample of undergraduate students. Results supported the validity of the RAS. (JKS)

  14. Cure Schedule for Stycast 2651/Catalyst 11.

    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 Henkel technical data sheet (TDS) for Stycast 2651/Catalyst 11 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 was motivated by (1) a desire to cure at a single temperature for ease of manufacture and (2) a desire to keep the cure temperature low (to minimize residual stress build-up associated with the cooldown from the cure temperature to room temperature) without excessively limiting the cure reaction due to vitrification (i.e., material glass transition temperature, Tg, exceeding cure temperature).

  15. Job shop scheduling by local search

    NARCIS (Netherlands)

    Aarts, E.H.L.; Lenstra, J.K.; Laarhoven, van P.J.M.; Ulder, N.L.J.

    1992-01-01

    We present a computational performance analysis of local search algorithms for job shop scheduling. The algorithms under investigation are iterative improvement, simulated annealing, threshold accepting and genetic local search. Our study shows that simulated annealing performs best in the sense

  16. Scheduling job shop - A case study

    Science.gov (United States)

    Abas, M.; Abbas, A.; Khan, W. A.

    2016-08-01

    The scheduling in job shop is important for efficient utilization of machines in the manufacturing industry. There are number of algorithms available for scheduling of jobs which depend on machines tools, indirect consumables and jobs which are to be processed. In this paper a case study is presented for scheduling of jobs when parts are treated on available machines. Through time and motion study setup time and operation time are measured as total processing time for variety of products having different manufacturing processes. Based on due dates different level of priority are assigned to the jobs and the jobs are scheduled on the basis of priority. In view of the measured processing time, the times for processing of some new jobs are estimated and for efficient utilization of the machines available an algorithm is proposed and validated.

  17. Job scheduling in a heterogenous grid environment

    Energy Technology Data Exchange (ETDEWEB)

    Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren

    2004-02-11

    Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

  18. The School Schedule--Servant or Mistress?

    Science.gov (United States)

    Holmes, Mark

    1984-01-01

    Pointing out that time is a dimension of school wealth, the author explores its use in school schedules. Administrators need to be aware of the relationship between time allocation and learning consequences. (MD)

  19. Economic and psychological burden of scheduled surgery ...

    African Journals Online (AJOL)

    Background: Cancellation of scheduled surgery creates a financial burden for hospitals, caregivers and ..... costs and disregard some of the aspects mentioned in the ..... cancellation of elective surgical procedures in a Spanish general.

  20. Onboard Autonomous Scheduling Intelligence System, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Scheduling the daily activities of the crew on a human space mission is currently a cumbersome job performed by a large team of operations experts on the ground....

  1. Home Appliance Load Scheduling with SEMIAH

    DEFF Research Database (Denmark)

    Jacobsen, Rune Hylsberg; Ghasem Azar, Armin; Zhang, Qi

    2015-01-01

    The European research project SEMIAH aims at designing a scalable infrastructure for residential demand response. This paper presents the progress towards a centralized load scheduling algorithm for controlling home appliances taking power grid constraints and satisfaction of consumers into account....

  2. Courts, Scheduled Damages, and Medical Malpractice Insurance

    DEFF Research Database (Denmark)

    Bertoli, Paola; Grembi, Veronica

    We assess the impact of the introduction of schedules of non-economic damages (i.e. tiered caps systems) on the behavior of insurers operating in the medical liability market for hospitals while controlling the performance of the judicial system, measured as court backlog. Using a difference......-in-differences strategy on Italian data, we find that the introduction of schedules increases the presence of insurers (i.e. medical liability market attractiveness) only in inefficient judicial districts. In the same way, court inefficiency is attractive to insurers for average values of schedules penetration...... of the market, with an increasing positive impact of inefficiency as the territorial coverage of schedules increases. Finally, no significant impact is registered on paid premiums. Our analysis sheds light on a complex set of elements affecting the decisions of insurers in malpractice markets. The analysis...

  3. 76 FR 18262 - January 2011 Pay Schedules

    Science.gov (United States)

    2011-04-01

    ... an OPM memorandum, CPM 2009-27. (See http://www.opm.gov/oca/compmemo/index.asp .) Executive Order... Schedule ($165,300 in 2011, the same level as in 2010). On December 27, 2010, OPM issued a memorandum (CPM...

  4. Multiple time-scale optimization scheduling for islanded microgrids including PV, wind turbine, diesel generator and batteries

    DEFF Research Database (Denmark)

    Xiao, Zhao xia; Nan, Jiakai; Guerrero, Josep M.

    2017-01-01

    A multiple time-scale optimization scheduling including day ahead and short time for an islanded microgrid is presented. In this paper, the microgrid under study includes photovoltaics (PV), wind turbine (WT), diesel generator (DG), batteries, and shiftable loads. The study considers the maximum...... efficiency operation area for the diesel engine and the cost of the battery charge/discharge cycle losses. The day-ahead generation scheduling takes into account the minimum operational cost and the maximum load satisfaction as the objective function. Short-term optimal dispatch is based on minimizing...

  5. Duration of therapy – Does it matter?

    DEFF Research Database (Denmark)

    Kramer Schmidt, Lotte; Bojesen, Anders Bo; Nielsen, Anette Søgaard

    2018-01-01

    Background The recommendations in clinical guidelines for duration of therapy for alcohol use disorder (AUD) are based on consensus decisions. In reality, we do not know the optimal duration of an alcohol treatment course. Methods A systematic review and meta-regression of randomized controlled...... project in itself may influence outcome in studies of psychosocial treatment for alcohol use disorder....... across studies. Treatment outcome was defined as long-term alcohol use measured in percentage of days abstinent (PDA), percentage of heavy days drinking (PHD), and/or proportion of participants abstinent (ABS). Results 48 studies encompassing 8984 participants. Mean planned duration of therapy: 18 (8...

  6. Maximum entropy analysis of EGRET data

    DEFF Research Database (Denmark)

    Pohl, M.; Strong, A.W.

    1997-01-01

    EGRET data are usually analysed on the basis of the Maximum-Likelihood method \\cite{ma96} in a search for point sources in excess to a model for the background radiation (e.g. \\cite{hu97}). This method depends strongly on the quality of the background model, and thus may have high systematic unce...... uncertainties in region of strong and uncertain background like the Galactic Center region. Here we show images of such regions obtained by the quantified Maximum-Entropy method. We also discuss a possible further use of MEM in the analysis of problematic regions of the sky....

  7. The Maximum Resource Bin Packing Problem

    DEFF Research Database (Denmark)

    Boyar, J.; Epstein, L.; Favrholdt, L.M.

    2006-01-01

    Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used...... algorithms, First-Fit-Increasing and First-Fit-Decreasing for the maximum resource variant of classical bin packing. For the on-line variant, we define maximum resource variants of classical and dual bin packing. For dual bin packing, no on-line algorithm is competitive. For classical bin packing, we find...

  8. Shower maximum detector for SDC calorimetry

    International Nuclear Information System (INIS)

    Ernwein, J.

    1994-01-01

    A prototype for the SDC end-cap (EM) calorimeter complete with a pre-shower and a shower maximum detector was tested in beams of electrons and Π's at CERN by an SDC subsystem group. The prototype was manufactured from scintillator tiles and strips read out with 1 mm diameter wave-length shifting fibers. The design and construction of the shower maximum detector is described, and results of laboratory tests on light yield and performance of the scintillator-fiber system are given. Preliminary results on energy and position measurements with the shower max detector in the test beam are shown. (authors). 4 refs., 5 figs

  9. Topics in Bayesian statistics and maximum entropy

    International Nuclear Information System (INIS)

    Mutihac, R.; Cicuttin, A.; Cerdeira, A.; Stanciulescu, C.

    1998-12-01

    Notions of Bayesian decision theory and maximum entropy methods are reviewed with particular emphasis on probabilistic inference and Bayesian modeling. The axiomatic approach is considered as the best justification of Bayesian analysis and maximum entropy principle applied in natural sciences. Particular emphasis is put on solving the inverse problem in digital image restoration and Bayesian modeling of neural networks. Further topics addressed briefly include language modeling, neutron scattering, multiuser detection and channel equalization in digital communications, genetic information, and Bayesian court decision-making. (author)

  10. Density estimation by maximum quantum entropy

    International Nuclear Information System (INIS)

    Silver, R.N.; Wallstrom, T.; Martz, H.F.

    1993-01-01

    A new Bayesian method for non-parametric density estimation is proposed, based on a mathematical analogy to quantum statistical physics. The mathematical procedure is related to maximum entropy methods for inverse problems and image reconstruction. The information divergence enforces global smoothing toward default models, convexity, positivity, extensivity and normalization. The novel feature is the replacement of classical entropy by quantum entropy, so that local smoothing is enforced by constraints on differential operators. The linear response of the estimate is proportional to the covariance. The hyperparameters are estimated by type-II maximum likelihood (evidence). The method is demonstrated on textbook data sets

  11. Heuristic Approach for Balancing Shift Schedules

    International Nuclear Information System (INIS)

    Kim, Dae Ho; Yun, Young Su; Lee, Yong Hee

    2005-01-01

    In this paper, a heuristic approach for balancing shift schedules is proposed. For the shift schedules, various constraints which have usually been considered in realworld industry are used, and the objective is to minimize the differences of the workloads in each workgroup. The constraints and objective function are implemented in the proposed heuristic approach. Using a simple instance, the efficiency of the proposed heuristic approach is proved

  12. Algorithms for classical and modern scheduling problems

    OpenAIRE

    Ott, Sebastian

    2016-01-01

    Subject of this thesis is the design and the analysis of algorithms for scheduling problems. In the first part, we focus on energy-efficient scheduling, where one seeks to minimize the energy needed for processing certain jobs via dynamic adjustments of the processing speed (speed scaling). We consider variations and extensions of the standard model introduced by Yao, Demers, and Shenker in 1995 [79], including the addition of a sleep state, the avoidance of preemption, and variable speed lim...

  13. Maritime wideband communication networks video transmission scheduling

    CERN Document Server

    Yang, Tingting

    2014-01-01

    This Springer Brief covers emerging maritime wideband communication networks and how they facilitate applications such as maritime distress, urgency, safety and general communications. It provides valuable insight on the data transmission scheduling and protocol design for the maritime wideband network. This brief begins with an introduction to maritime wideband communication networks including the architecture, framework, operations and a comprehensive survey on current developments. The second part of the brief presents the resource allocation and scheduling for video packet transmission wit

  14. Revised data taking schedule with ion beams

    CERN Document Server

    Gazdzicki, Marek; Aduszkiewicz, A; Andrieu, B; Anticic, T; Antoniou, N; Argyriades, J; Asryan, A G; Baatar, B; Blondel, A; Blumer, J; Boldizsar, L; Bravar, A; Brzychczyk, J; Bubak, A; Bunyatov, S A; Choi, K U; Christakoglou, P; Chung, P; Cleymans, J; Derkach, D A; Diakonos, F; Dominik, W; Dumarchez, J; Engel, R; Ereditato, A; Feofilov, G A; Fodor, Z; Ferrero, A; Gazdzicki, M; Golubeva, M; Grebieszkow, K; Grzeszczuk, A; Guber, F; Hasegawa, T; Haungs, A; Igolkin, S; Ivanov, A S; Ivashkin, A; Kadija, K; Katrynska, N; Kielczewska, D; Kikola, D; Kisiel, J; Kobayashi, T; Kolesnikov, V I; Kolev, D; Kolevatov, R S; Kondratiev, V P; Kowalski, S; Kurepin, A; Lacey, R; Laszlo, A; Lyubushkin, V V; Majka, Z; I Malakhov, A; Marchionni, A; Marcinek, A; Maris, I; Matveev, V; Melkumov, G L; Meregaglia, A; Messina, M; Mijakowski, P; Mitrovski, M; Montaruli, T; Mrówczynski, St; Murphy, S; Nakadaira, T; Naumenko, P A; Nikolic, V; Nishikawa, K; Palczewski, T; Pálla, G; Panagiotou, A D; Peryt, W; Planeta, R; Pluta, J; Popov, B A; Posiadala, M; Przewlocki, P; Rauch, W; Ravonel, M; Renfordt, R; Röhrich, D; Rondio, E; Rossi, B; Roth, M; Rubbia, A; Rybczynski, M; Sadovskii, A; Sakashita, K; Schuster, T; Sekiguchi, T; Seyboth, P; Shibata, M; Sissakian, A N; Skrzypczak, E; Slodkowski, M; Sorin, A S; Staszel, P; Stefanek, G; Stepaniak, J; Strabel, C; Ströbele, H; Susa, T; Szentpétery, I; Szuba, M; Tada, M; Taranenko, A; Tsenov, R; Ulrich, R; Unger, M; Vassiliou, M; Vechernin, V V; Vesztergombi, G; Wlodarczyk, Z; Wojtaszek, A; Zipper, W; CERN. Geneva. SPS and PS Experiments Committee; SPSC

    2009-01-01

    This document presents the revised data taking schedule of NA61 with ion beams. The revision takes into account limitations due to the new LHC schedule as well as final results concerning the physics performance with secondary ion beams. It is proposed to take data with primary Ar and Xe beams in 2012 and 2014, respectively, and to test and use for physics a secondary B beam from primary Pb beam fragmentation in 2010, 2011 and 2013.

  15. Job schedul in Grid batch farms

    International Nuclear Information System (INIS)

    Gellrich, Andreas

    2014-01-01

    We present here a study for a scheduler which cooperates with the queueing system TORQUE and is tailored to the needs of a HEP-dominated large Grid site with around 10000 jobs slots. Triggered by severe scaling problems of MAUI, a scheduler, referred to as MYSCHED, was developed and put into operation. We discuss conceptional aspects as well as experiences after almost two years of running.

  16. Proposed maximum surgical blood ordering schedule for common orthopedic surgeries in a Tertiary Health - Care Center in Northern India

    Directory of Open Access Journals (Sweden)

    Sonam Kumari

    2017-01-01

    CONCLUSIONS: MSBOS based on the past blood utilization records for different surgeries and keeping patients variables in consideration wherever required would provide an efficient way of blood utilization and appropriate management of blood bank resources.

  17. Prescribed Travel Schedules for Fatigue Management

    Science.gov (United States)

    Whitmire, Alexandra; Johnston, Smith; Lockley, Steven

    2011-01-01

    The NASA Fatigue Management Team is developing recommendations for managing fatigue during travel and for shift work operations, as Clinical Practice Guidelines for the Management of Circadian Desynchrony in ISS Operations. The Guidelines provide the International Space Station (ISS ) flight surgeons and other operational clinicians with evidence-based recommendations for mitigating fatigue and other factors related to sleep loss and circadian desynchronization. As much international travel is involved both before and after flight, the guidelines provide recommendations for: pre-flight training, in-flight operations, and post-flight rehabilitation. The objective of is to standardize the process by which care is provided to crewmembers, ground controllers, and other support personnel such as trainers, when overseas travel or schedule shifting is required. Proper scheduling of countermeasures - light, darkness, melatonin, diet, exercise, and medications - is the cornerstone for facilitating circadian adaptation, improving sleep, enhancing alertness, and optimizing performance. The Guidelines provide, among other things, prescribed travel schedules that outline the specific implementation of these mitigation strategies. Each travel schedule offers evidence based protocols for properly using the NASA identified countermeasures for fatigue. This presentation will describe the travel implementation schedules and how these can be used to alleviate the effects of jet lag and/or schedule shifts.

  18. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number of resou...... indicate that the algorithm can be used as an actual scheduling algorithm in the Grid or as a tool for analyzing Grid performance when adding extra machines or jobs. © 2012 Wiley Periodicals, Inc.......We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig...

  19. Staffing, overtime, and shift scheduling project

    International Nuclear Information System (INIS)

    Lewis, P.M.

    1989-01-01

    Recent events at the Peach Bottom nuclear power plant have demonstrated the need to establish a quantifiable basis for assessing the safety significance of long work hours on nuclear power plant operators. The incidents at TMI-2, Chernobyl, and Bhopal, which all occurred during the late evening/night shift, further highlight the importance of the relationship between shift scheduling and performance. The objective of this project is to estimate, using statistical analysis on data from the nuclear industry, the effects on safety of staffing levels, overtime, and shift scheduling for operators and maintenance personnel. Regarding staffing levels, the Nuclear Regulatory Commission (NRC) currently has no explicit regulation concerning the minimum acceptable levels of staffing in a plant that has an operating license. The NRC has no systematic method for collecting data on the number of licensed operators on the operating crews. In 1982 the NRC recommended that plants write into their technical specifications a model policy on overtime. Currently, 77 nuclear power plant units have the model policy or a modification of it written into their technical specifications; 33 units have no policy on overtime. The model policy sets limits on overtime for safety related personnel, although these limits can be exceeded with plant manger approval. The US nuclear power industry has three types of shift schedules: (1) forward-rotating 8-hour/day shift schedules, (2) backward-rotating 8-hour/day schedules, and (3) 12-hour/day schedules

  20. Interactive Dynamic Mission Scheduling for ASCA

    Science.gov (United States)

    Antunes, A.; Nagase, F.; Isobe, T.

    The Japanese X-ray astronomy satellite ASCA (Advanced Satellite for Cosmology and Astrophysics) mission requires scheduling for each 6-month observation phase, further broken down into weekly schedules at a few minutes resolution. Two tools, SPIKE and NEEDLE, written in Lisp and C, use artificial intelligence (AI) techniques combined with a graphic user interface for fast creation and alteration of mission schedules. These programs consider viewing and satellite attitude constraints as well as observer-requested criteria and present an optimized set of solutions for review by the planner. Six-month schedules at 1 day resolution are created for an oversubscribed set of targets by the SPIKE software, originally written for HST and presently being adapted for EUVE, XTE and AXAF. The NEEDLE code creates weekly schedules at 1 min resolution using in-house orbital routines and creates output for processing by the command generation software. Schedule creation on both the long- and short-term scale is rapid, less than 1 day for long-term, and one hour for short-term.

  1. Self-scheduling with Microsoft Excel.

    Science.gov (United States)

    Irvin, S A; Brown, H N

    1999-01-01

    Excessive time was being spent by the emergency department (ED) staff, head nurse, and unit secretary on a complex 6-week manual self-scheduling system. This issue, plus inevitable errors and staff dissatisfaction, resulted in a manager-lead initiative to automate elements of the scheduling process using Microsoft Excel. The implementation of this initiative included: common coding of all 8-hour and 12-hour shifts, with each 4-hour period represented by a cell; the creation of a 6-week master schedule using the "count-if" function of Excel based on current staffing guidelines; staff time-off requests then entered by the department secretary; the head nurse, with staff input, then fine-tuned the schedule to provide even unit coverage. Outcomes of these changes included an increase in staff satisfaction, time saved by the head nurse, and staff work time saved because there was less arguing about the schedule. Ultimately, the automated self-scheduling method was expanded to the entire 700-bed hospital.

  2. How Changes in Unemployment Benefit Duration Affect the Inflow Into Unemployment

    NARCIS (Netherlands)

    van Ours, J.C.; Tuit, S.

    2010-01-01

    We study how changes in the maximum benefit duration affec the inow into unemployment in the Netherlands. Until August 2003, workers who became un- employed after age 57.5 were entitled to unemployment benefits until the age of 65, after which they would receive old age pensions. This characteristic

  3. Do Projects really end late? On the shortcomings of the classical scheduling techniques

    Directory of Open Access Journals (Sweden)

    Pablo Ballesteros-Pérez

    2018-03-01

    Full Text Available Many engineering projects fail to meet their planned completion dates in real practice. This a recurrent topic in the project management literature, with poor planning and controlling practices frequently cited among the most significant causes of delays. Unfortunately, hardly any attention has been paid to the fact that the classical scheduling techniques: Gantt chart, Critical Path Method (CPM, and Program Evaluation and Review Technique (PERT, may not be as fit for purpose as they seem. Arguably, because of their relative simplicity, these techniques are still almost the only ones taught nowadays in most introductory courses to scheduling in many engineering and management degrees. However, by utterly ignoring or inappropriately dealing with activity duration variability, these techniques provide optimistic completion dates, while suffering from other shortcomings. Through a series of simple case studies that can be developed with a few participants and common dice, a systematic critique of the classical scheduling techniques is offered. Discussion of the case studies results illustrate why limiting the contents of scheduling education and teaching can be detrimental, as the aforementioned classical scheduling techniques cannot not provide project managers with sufficient resources to effectively plan and control real projects.

  4. Computer use, sleep duration and health symptoms

    DEFF Research Database (Denmark)

    Nuutinen, Teija; Roos, Eva; Ray, Carola

    2014-01-01

    OBJECTIVES: This study investigated whether computer use is associated with health symptoms through sleep duration among 15-year olds in Finland, France and Denmark. METHODS: We used data from the WHO cross-national Health Behaviour in School-aged Children study collected in Finland, France...... and Denmark in 2010, including data on 5,402 adolescents (mean age 15.61 (SD 0.37), girls 53 %). Symptoms assessed included feeling low, irritability/bad temper, nervousness, headache, stomachache, backache, and feeling dizzy. We used structural equation modeling to explore the mediating effect of sleep...... duration on the association between computer use and symptom load. RESULTS: Adolescents slept approximately 8 h a night and computer use was approximately 2 h a day. Computer use was associated with shorter sleep duration and higher symptom load. Sleep duration partly mediated the association between...

  5. Long Duration Space Shelter Shielding, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Physical Sciences Inc. (PSI) has developed fiber reinforced ceramic composites for radiation shielding that can be used for external walls in long duration manned...

  6. Nonsymmetric entropy and maximum nonsymmetric entropy principle

    International Nuclear Information System (INIS)

    Liu Chengshi

    2009-01-01

    Under the frame of a statistical model, the concept of nonsymmetric entropy which generalizes the concepts of Boltzmann's entropy and Shannon's entropy, is defined. Maximum nonsymmetric entropy principle is proved. Some important distribution laws such as power law, can be derived from this principle naturally. Especially, nonsymmetric entropy is more convenient than other entropy such as Tsallis's entropy in deriving power laws.

  7. Maximum speed of dewetting on a fiber

    NARCIS (Netherlands)

    Chan, Tak Shing; Gueudre, Thomas; Snoeijer, Jacobus Hendrikus

    2011-01-01

    A solid object can be coated by a nonwetting liquid since a receding contact line cannot exceed a critical speed. We theoretically investigate this forced wetting transition for axisymmetric menisci on fibers of varying radii. First, we use a matched asymptotic expansion and derive the maximum speed

  8. Maximum potential preventive effect of hip protectors

    NARCIS (Netherlands)

    van Schoor, N.M.; Smit, J.H.; Bouter, L.M.; Veenings, B.; Asma, G.B.; Lips, P.T.A.M.

    2007-01-01

    OBJECTIVES: To estimate the maximum potential preventive effect of hip protectors in older persons living in the community or homes for the elderly. DESIGN: Observational cohort study. SETTING: Emergency departments in the Netherlands. PARTICIPANTS: Hip fracture patients aged 70 and older who

  9. Maximum gain of Yagi-Uda arrays

    DEFF Research Database (Denmark)

    Bojsen, J.H.; Schjær-Jacobsen, Hans; Nilsson, E.

    1971-01-01

    Numerical optimisation techniques have been used to find the maximum gain of some specific parasitic arrays. The gain of an array of infinitely thin, equispaced dipoles loaded with arbitrary reactances has been optimised. The results show that standard travelling-wave design methods are not optimum....... Yagi–Uda arrays with equal and unequal spacing have also been optimised with experimental verification....

  10. correlation between maximum dry density and cohesion

    African Journals Online (AJOL)

    HOD

    represents maximum dry density, signifies plastic limit and is liquid limit. Researchers [6, 7] estimate compaction parameters. Aside from the correlation existing between compaction parameters and other physical quantities there are some other correlations that have been investigated by other researchers. The well-known.

  11. Weak scale from the maximum entropy principle

    Science.gov (United States)

    Hamada, Yuta; Kawai, Hikaru; Kawana, Kiyoharu

    2015-03-01

    The theory of the multiverse and wormholes suggests that the parameters of the Standard Model (SM) are fixed in such a way that the radiation of the S3 universe at the final stage S_rad becomes maximum, which we call the maximum entropy principle. Although it is difficult to confirm this principle generally, for a few parameters of the SM, we can check whether S_rad actually becomes maximum at the observed values. In this paper, we regard S_rad at the final stage as a function of the weak scale (the Higgs expectation value) vh, and show that it becomes maximum around vh = {{O}} (300 GeV) when the dimensionless couplings in the SM, i.e., the Higgs self-coupling, the gauge couplings, and the Yukawa couplings are fixed. Roughly speaking, we find that the weak scale is given by vh ˜ T_{BBN}2 / (M_{pl}ye5), where ye is the Yukawa coupling of electron, T_BBN is the temperature at which the Big Bang nucleosynthesis starts, and M_pl is the Planck mass.

  12. The maximum-entropy method in superspace

    Czech Academy of Sciences Publication Activity Database

    van Smaalen, S.; Palatinus, Lukáš; Schneider, M.

    2003-01-01

    Roč. 59, - (2003), s. 459-469 ISSN 0108-7673 Grant - others:DFG(DE) XX Institutional research plan: CEZ:AV0Z1010914 Keywords : maximum-entropy method, * aperiodic crystals * electron density Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 1.558, year: 2003

  13. Achieving maximum sustainable yield in mixed fisheries

    NARCIS (Netherlands)

    Ulrich, Clara; Vermard, Youen; Dolder, Paul J.; Brunel, Thomas; Jardim, Ernesto; Holmes, Steven J.; Kempf, Alexander; Mortensen, Lars O.; Poos, Jan Jaap; Rindorf, Anna

    2017-01-01

    Achieving single species maximum sustainable yield (MSY) in complex and dynamic fisheries targeting multiple species (mixed fisheries) is challenging because achieving the objective for one species may mean missing the objective for another. The North Sea mixed fisheries are a representative example

  14. 5 CFR 534.203 - Maximum stipends.

    Science.gov (United States)

    2010-01-01

    ... maximum stipend established under this section. (e) A trainee at a non-Federal hospital, clinic, or medical or dental laboratory who is assigned to a Federal hospital, clinic, or medical or dental... Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS PAY UNDER OTHER SYSTEMS Student...

  15. Minimal length, Friedmann equations and maximum density

    Energy Technology Data Exchange (ETDEWEB)

    Awad, Adel [Center for Theoretical Physics, British University of Egypt,Sherouk City 11837, P.O. Box 43 (Egypt); Department of Physics, Faculty of Science, Ain Shams University,Cairo, 11566 (Egypt); Ali, Ahmed Farag [Centre for Fundamental Physics, Zewail City of Science and Technology,Sheikh Zayed, 12588, Giza (Egypt); Department of Physics, Faculty of Science, Benha University,Benha, 13518 (Egypt)

    2014-06-16

    Inspired by Jacobson’s thermodynamic approach, Cai et al. have shown the emergence of Friedmann equations from the first law of thermodynamics. We extend Akbar-Cai derivation http://dx.doi.org/10.1103/PhysRevD.75.084003 of Friedmann equations to accommodate a general entropy-area law. Studying the resulted Friedmann equations using a specific entropy-area law, which is motivated by the generalized uncertainty principle (GUP), reveals the existence of a maximum energy density closed to Planck density. Allowing for a general continuous pressure p(ρ,a) leads to bounded curvature invariants and a general nonsingular evolution. In this case, the maximum energy density is reached in a finite time and there is no cosmological evolution beyond this point which leaves the big bang singularity inaccessible from a spacetime prospective. The existence of maximum energy density and a general nonsingular evolution is independent of the equation of state and the spacial curvature k. As an example we study the evolution of the equation of state p=ωρ through its phase-space diagram to show the existence of a maximum energy which is reachable in a finite time.

  16. 50 CFR 259.34 - Minimum and maximum deposits; maximum time to deposit.

    Science.gov (United States)

    2010-10-01

    ... B objective. A time longer than 10 years, either by original scheduling or by subsequent extension... OCEANIC AND ATMOSPHERIC ADMINISTRATION, DEPARTMENT OF COMMERCE AID TO FISHERIES CAPITAL CONSTRUCTION FUND...) Minimum annual deposit. The minimum annual (based on each party's taxable year) deposit required by the...

  17. Laser-driven short-duration heating angioplasty: dilatation performance in cadaver atherosclerotic femoral arteries

    Science.gov (United States)

    Shimazaki, Natsumi; Naruse, Sho; Arai, Tsunenori; Imanishi, Nobuaki; Aiso, Sadakazu

    2013-03-01

    The purpose of this study was to investigate the artery dilatation performance of the short-duration heating balloon catheter in cadaver stenotic arteries. We designed a prototype short-duration heating balloon catheter that can heat artery media to around 60 °C in 15-25 s by a combination of laser-driven heat generation and continuous fluid irrigation in the balloon. We performed ex vivo short-duration heating dilatation in the cadaver atherosclerotic femoral arteries (initial percent diameter stenosis was 36-98%), with the maximum balloon temperature of 65+/-5 °C, laser irradiation duration of 25 s, and balloon dilatation pressure of 3.5 atm. The artery lumen configurations before and after the dilatations were assessed with a commercial IVUS system. After the short-duration heating dilatations, the percent diameter stenosis was reduced below 30% without any artery tears or dissections. We estimated that the artery media temperature was raised to around 60 °C in which plaque thickness was below 0.8 mm by a thermal conduction calculation. The estimated maximum temperature in artery adventitia and surrounding tissue was up to 45 °C. We found that the short-duration heating balloon could sufficiently dilate the cadaver stenotic arteries, without thermal injury in artery adventitia and surroundings.

  18. 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.

  19. Integrating Preventive Maintenance Scheduling As Probability Machine Failure And Batch Production Scheduling

    Directory of Open Access Journals (Sweden)

    Zahedi Zahedi

    2016-06-01

    Full Text Available This paper discusses integrated model of batch production scheduling and machine maintenance scheduling. Batch production scheduling uses minimize total actual flow time criteria and machine maintenance scheduling uses the probability of machine failure based on Weibull distribution. The model assumed no nonconforming parts in a planning horizon. The model shows an increase in the number of the batch (length of production run up to a certain limit will minimize the total actual flow time. Meanwhile, an increase in the length of production run will implicate an increase in the number of PM. An example was given to show how the model and algorithm work.

  20. Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

    International Nuclear Information System (INIS)

    Kim, Woojoong; Ryu, Dongsoo; Jung, Youngsoo

    2014-01-01

    Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation

  1. Application of linear scheduling method (LSM) for nuclear power plant (NPP) construction

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Woojoong, E-mail: minidung@nate.com [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Ryu, Dongsoo, E-mail: energyboy@khnp.co.kr [Central Research Institute, Korea Hydro and Nuclear Power Co., Ltd, Daejeon 305-343 (Korea, Republic of); Jung, Youngsoo, E-mail: yjung97@mju.ac.kr [College of Architecture, Myongji University, Yongin 449-728 (Korea, Republic of)

    2014-04-01

    Highlights: • Mixed use of linear scheduling method with traditional CPM is suggested for NPP. • A methodology for selecting promising areas for LSM application is proposed. • A case-study is conducted to validate the proposed LSM selection methodology. • A case-study of reducing NPP construction duration by using LSM is introduced. - Abstract: According to a forecast, global energy demand is expected to increase by 56% from 2010 to 2040 (EIA, 2013). The nuclear power plant construction market is also growing with sharper competition. In nuclear power plant construction, scheduling is one of the most important functions due to its large size and complexity. Therefore, it is crucial to incorporate the ‘distinct characteristics of construction commodities and the complex characteristics of scheduling techniques’ (Jung and Woo, 2004) when selecting appropriate schedule control methods for nuclear power plant construction. However, among various types of construction scheduling techniques, the traditional critical path method (CPM) has been used most frequently in real-world practice. In this context, the purpose of this paper is to examine the viability and effectiveness of linear scheduling method (LSM) applications for specific areas in nuclear power plant construction. In order to identify the criteria for selecting scheduling techniques, the characteristics of CPM and LSM were compared and analyzed first through a literature review. Distinct characteristics of nuclear power plant construction were then explored by using a case project in order to develop a methodology to select effective areas of LSM application to nuclear power plant construction. Finally, promising areas for actual LSM application are suggested based on the proposed evaluation criteria and the case project. Findings and practical implications are discussed for further implementation.

  2. Satellite-Based Sunshine Duration for Europe

    Directory of Open Access Journals (Sweden)

    Bodo Ahrens

    2013-06-01

    Full Text Available In this study, two different methods were applied to derive daily and monthly sunshine duration based on high-resolution satellite products provided by the European Organisation for the Exploitation of Meteorological Satellites (EUMETSAT Satellite Application Facility on Climate Monitoring using data from Meteosat Second Generation (MSG SEVIRI (Spinning Enhanced Visible and Infrared Imager. The satellite products were either hourly cloud type or hourly surface incoming direct radiation. The satellite sunshine duration estimates were not found to be significantly different using the native 15-minute temporal resolution of SEVIRI. The satellite-based sunshine duration products give additional spatial information over the European continent compared with equivalent in situ-based products. An evaluation of the satellite sunshine duration by product intercomparison and against station measurements was carried out to determine their accuracy. The satellite data were found to be within ±1 h/day compared to high-quality Baseline Surface Radiation Network or surface synoptic observations (SYNOP station measurements. The satellite-based products differ more over the oceans than over land, mainly because of the treatment of fractional clouds in the cloud type-based sunshine duration product. This paper presents the methods used to derive the satellite sunshine duration products and the performance of the different retrievals. The main benefits and disadvantages compared to station-based products are also discussed.

  3. Collective behaviors of book holding durations

    Science.gov (United States)

    Li, Ren-De; Guo, Qiang; Han, Jing-Ti; Liu, Jian-Guo

    2016-10-01

    Duration can directly reflect the collective reading behaviors of library user book holding. In this paper, by introducing the burstiness and memory coefficients, we empirically investigate the collective book holding behavior of three university libraries. The statistical results show that there are similar properties among the students with different backgrounds, presenting the burstiness = - 0.2 and memory = 0.5 for three datasets, which indicates that memory and random effects coexist in student book holding durations. In addition, we analyze the behavior patterns without duplicate durations by merging a series of books borrowed and returned at the same time. The results show the average burstiness B increases to -0.16 and memory M drops to 0.16 for three datasets, which indicates that both duplicate behavior and student's preference affect the memory effect. Furthermore, we present a model which assumes student's next book holding duration follows the previous one with probability p, and with probability 1 - p, the student would hold the book independently. The experimental results show that the presented model can reproduce the burstiness and memory effect of student book holding durations when p = 0.5 for empirical datasets and p = 0.2 for de-duplicate datasets, which indicate that the student's preferential holding behavior occurs with the probability p. This work helps in deeply understanding the regularity of duration-based human behaviors.

  4. Call Duration Characteristics based on Customers Location

    Directory of Open Access Journals (Sweden)

    Žvinys Karolis

    2014-05-01

    Full Text Available Nowadays a lot of different researches are performed based on call duration distributions (CDD analysis. However, the majority of studies are linked with social relationships between the people. Therefore the scarcity of information, how the call duration is associated with a user's location, is appreciable. The goal of this paper is to reveal the ties between user's voice call duration and the location of call. For this reason we analyzed more than 5 million calls from real mobile network, which were made over the base stations located in rural areas, roads, small towns, business and entertainment centers, residential districts. According to these site types CDD’s and characteristic features for call durations are given and discussed. Submitted analysis presents the users habits and behavior as a group (not an individual. The research showed that CDD’s of customers being them in different locations are not equal. It has been found that users at entertainment, business centers are tend to talk much shortly, than people being at home. Even more CDD can be distorted strongly, when machinery calls are evaluated. Hence to apply a common CDD for a whole network it is not recommended. The study also deals with specific parameters of call duration for distinguished user groups, the influence of network technology for call duration is considered.

  5. Second unit scheduling concerns on a dual-unit nuclear project

    International Nuclear Information System (INIS)

    Block, H.R.; Mazzini, R.A.

    1978-01-01

    This paper explores the planning and scheduling problems of Unit 2 of the Susquehanna steam electric station. The causes of these problems and methods to avoid or mitigate their consequences are discussed. The Susquehanna steam electric station has two boiling water reactors rated at 1,100 MW each. Topics considered include cost factors, structures, equipment, engineering and home office, construction services, completion data phasing, work sequencing, structural dependences, and segregation. Substatial cost and schedule benefits can result if two nuclear units are designed and constructed as one integral station, and if maximum sharing of facilities and services between the units occurs. It is concluded that the cost benefits of highly integrated dual unit construction outweigh the schedule and logistical problems caused by that approach

  6. Associations Among Work and Family Health Climate, Health Behaviors, Work Schedule, and Body Weight.

    Science.gov (United States)

    Buden, Jennifer C; Dugan, Alicia G; Faghri, Pouran D; Huedo-Medina, Tania B; Namazi, Sara; Cherniack, Martin G

    2017-06-01

    Correctional employees exhibit elevated obesity rates. This study examines interrelations among health behaviors, health climate, body mass index (BMI), and work schedule. Using survey results from correctional supervisors (n = 157), mediation and moderated-mediation analyses were performed to examine how health behaviors explain relationships between obesity, work health climate (WHC) and family health climate (FHC), and work schedule. Over 85% of the sample was overweight/obese (mean BMI = 30.20). Higher WHC and FHC were associated with lower BMI, mediated by nutrition, and physical activity. The interaction effect between health behavior and work schedule revealed a protective effect on BMI. Overtime shift work may share a relationship with BMI. Findings may have implications for reexamining organizational policies on maximum weekly overtime in corrections. They provide direction for targeted obesity interventions that encourage a supportive FHC and promote healthy behaviors among supervisors working overtime.

  7. Associations among Work and Family Health Climate, Health Behaviors, Work Schedule and Body Weight

    Science.gov (United States)

    Buden, Jennifer C.; Dugan, Alicia G.; Faghri, Pouran D.; Huedo-Medina, Tania B.; Namazi, Sara; Cherniack, Martin G.

    2017-01-01

    Objectives Correctional employees exhibit elevated obesity rates. This study examines interrelations among health behaviors, health climate, BMI, and work schedule. Methods Using survey results from correctional supervisors (n=157), mediation and moderated-mediation analyses were performed to examine how health behaviors explain relationships between obesity, work health climate (WHC) and family health climate (FHC), and work schedule. Results Over 85% of the sample was overweight/obese (mean BMI=30.20). Higher WHC and FHC were associated with lower BMI, mediated by nutrition and physical activity. The interaction effect between health behavior and work schedule revealed a protective effect on BMI. Overtime shiftwork may share a relationship with BMI. Conclusions Findings may have implications for reexamining organizational policies on maximum weekly overtime in corrections. They provide direction for targeted obesity interventions that encourage a supportive FHC and promote healthy behaviors among supervisors working overtime. PMID:28471768

  8. Optimal methodology for a machining process scheduling in spot electricity markets

    International Nuclear Information System (INIS)

    Yusta, J.M.; Torres, F.; Khodr, H.M.

    2010-01-01

    Electricity spot markets have introduced hourly variations in the price of electricity. These variations allow the increase of the energy efficiency by the appropriate scheduling and adaptation of the industrial production to the hourly cost of electricity in order to obtain the maximum profit for the industry. In this article a mathematical optimization model simulates costs and the electricity demand of a machining process. The resultant problem is solved using the generalized reduced gradient approach, to find the optimum production schedule that maximizes the industry profit considering the hourly variations of the price of electricity in the spot market. Different price scenarios are studied to analyze the impact of the spot market prices for electricity on the optimal scheduling of the machining process and on the industry profit. The convenience of the application of the proposed model is shown especially in cases of very high electricity prices.

  9. DAILY SCHEDULING OF SMALL HYDRO POWER PLANTS DISPATCH WITH MODIFIED PARTICLES SWARM OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Sinvaldo Rodrigues Moreno

    2015-04-01

    Full Text Available This paper presents a new approach for short-term hydro power scheduling of reservoirs using an algorithm-based Particle Swarm Optimization (PSO. PSO is a population-based algorithm designed to find good solutions to optimization problems, its characteristics have encouraged its adoption to tackle a variety of problems in different fields. In this paper the authors consider an optimization problem related to a daily scheduling of small hydro power dispatch. The goal is construct a feasible solution that maximize the cascade electricity production, following the environmental constraints and water balance. The paper proposes an improved Particle Swarm Optimization (PSO algorithm, which takes advantage of simplicity and facility of implementation. The algorithm was successfully applied to the optimization of the daily schedule strategies of small hydro power plants, considering maximum water utilization and all constraints related to simultaneous water uses. Extensive computational tests and comparisons with other heuristics methods showed the effectiveness of the proposed approach.

  10. Outpacing the Anthropocene: New Constraints for the Rate of Carbon Release at the Paleocene-Eocene Thermal Maximum

    Science.gov (United States)

    Wright, J. D.; Schaller, M. F.

    2012-12-01

    The Paleocene/Eocene Thermal Maximum (PETM) Carbon Isotope Excursion (CIE) is linked to benthic foraminiferal extinction and excursion taxa in planktonic foraminifera and calcareous nannofossils. Previous studies have used integrated bio-magneto-stratigraphies, cycle counting, and extraterrestrial 3He accumulation rates to produce a range of estimates for the duration of the initial onset of the PETM CIE between 750 years to 30 kyr. Durations for the total release time (onset to initiation of recovery) range from 45 to 95 kyr. Uncertainty in the timing of the onset of the PETM CIE prevents the identification of a causal mechanism, and hence understanding the biological responses. Recent work on the Paleocene/Eocene Marlboro Clay has unveiled the presence of regular couplets (~2 cm) expressed in multiple cores and exposures throughout the Atlantic Coastal Plain. Specifically, the Millville and newly recovered Wilson Lake B cores contain 750 and 660 layers through the CIE, respectively. These couplets have corresponding oxygen stable isotope cycles, arguing for a climatic origin. Orbital and millennial periodicities are far too long to explain the ~750 layers identified in the Millville core. Seasonal insolation is the only regular climate cycle that can plausibly account for the observed δ18O amplitudes (~1‰, with some cycles up to 2‰) and layer counts. Seasonal freshwater input can also augment the cyclic oscillations in δ18O, but the majority of the variability is most plausibly ascribed to temperature. Wilson Lake B and Millville have total δ13C excursions of -5 and -4.5‰ respectively, as well as highly expanded sections of the PETM CIE. In the Millville core, high-resolution, bulk stable isotope records show a 3.5‰ δ13C decrease over 12 layers across the PETM CIE onset. Concomitant with this δ13C decrease is a sharp drop in CaCO3. Decreases in both proxies require a large, sudden release of isotopically light carbon. The couplet chronology indicates

  11. Reducing Electricity Demand Peaks by Scheduling Home Appliances Usage

    DEFF Research Database (Denmark)

    Rossello Busquet, Ana; Kardaras, Georgios; Iversen, Villy Bæk

    2011-01-01

    Nowadays there is a tendency to consume electricity during the same period of the day leading to demand peaks. Regular energy consumption habits lead to demand peaks at specific temporal intervals, because users consume power at the same time. In order to avoid demand peaks, users’ appliances...... should consume electricity in a more temporarily distributed way. A new methodology to schedule the usage of home appliances is proposed and analyzed in this paper. The main concept behind this approach is the aggregation of home appliances into priority classes and the definition of a maximum power...... consumption limit, which is not allowed to be exceeded during peak hours. The scenario simulated describes a modern household, where the electrical devices are classified in low and high priority groups. The high priority devices are always granted power in order to operate without temporal restrictions...

  12. Quality-aware media scheduling on MPSoC platforms

    DEFF Research Database (Denmark)

    Gangadharan, Deepak; Chakraborty, Samarjit; Zimmermann, Roger

    2013-01-01

    and personal computers by providing maximum quality of service to the multiple streams, it is a difficult task in devices with resource constraints. In order to efficiently utilize the resources, it is essential to derive the necessary processor cycles for multiple video streams such that they are displayed...... be scheduled such that a prespecified quality constraint is satisfied with the available service. We present this framework in the context of a PiP application, but it is applicable in general for multiple media streams. The results obtained using the formal framework were further verified using experiments......Applications that stream multiple video/audio or video+audio clips are being implemented in embedded devices. A Picture-in-Picture (PiP) application is one such application scenario, where two videos are played simultaneously. Although the PiP application is very efficiently handled in televisions...

  13. Dynamic Vehicle Scheduling for Working Service Network with Dual Demands

    Directory of Open Access Journals (Sweden)

    Bing Li

    2017-01-01

    Full Text Available This study aims to develop some models to aid in making decisions on the combined fleet size and vehicle assignment in working service network where the demands include two types (minimum demands and maximum demands, and vehicles themselves can act like a facility to provide services when they are stationary at one location. This type of problem is named as the dynamic working vehicle scheduling with dual demands (DWVS-DD and formulated as a mixed integer programming (MIP. Instead of a large integer program, the problem is decomposed into small local problems that are guided by preset control parameters. The approach for preset control parameters is given. By introducing them into the MIP formulation, the model is reformulated as a piecewise form. Further, a piecewise method by updating preset control parameters is proposed for solving the reformulated model. Numerical experiments show that the proposed method produces better solution within reasonable computing time.

  14. JIT single machine scheduling problem with periodic preventive maintenance

    Science.gov (United States)

    Shahriari, Mohammadreza; Shoja, Naghi; Zade, Amir Ebrahimi; Barak, Sasan; Sharifi, Mani

    2016-09-01

    This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.

  15. Generator scheduling under competitive environment using Memory Management Algorithm

    Directory of Open Access Journals (Sweden)

    A. Amudha

    2013-09-01

    Full Text Available This paper presents a new approach for Real-Time Application of Profit Based Unit Commitment using Memory Management Algorithm. The main objective of the restructured system is to maximize its own profit without the responsibility of satisfying the forecasted demand. The Profit Based Unit Commitment (PBUC is solved by Memory Management Algorithm (MMA in Real-Time Application. MMA approach is introduced in this paper considering power and reserve generation. The proposed method MMA uses Best Fit and Worst Fit allocation for generator scheduling in order to receive the maximum profit by considering the softer demand. Also, this method gives an idea regarding how much power and reserve should be sold in markets. The proposed approach has been tested on a power system with 2, 3, and 10 generating units. Simulation results of the proposed approach have been compared with the existing methods.

  16. A manpower scheduling heuristic for aircraft maintenance application

    Science.gov (United States)

    Sze, San-Nah; Sze, Jeeu-Fong; Chiew, Kang-Leng

    2012-09-01

    This research studies a manpower scheduling for aircraft maintenance, focusing on in-flight food loading operation. A group of loading teams with flexible shifts is required to deliver and upload packaged meals from the ground kitchen to aircrafts in multiple trips. All aircrafts must be served within predefined time windows. The scheduling process takes into account of various constraints such as meal break allocation, multi-trip traveling and food exposure time limit. Considering the aircrafts movement and predefined maximum working hours for each loading team, the main objective of this study is to form an efficient roster by assigning a minimum number of loading teams to the aircrafts. We proposed an insertion based heuristic to generate the solutions in a short period of time for large instances. This proposed algorithm is implemented in various stages for constructing trips due to the presence of numerous constraints. The robustness and efficiency of the algorithm is demonstrated in computational results. The results show that the insertion heuristic more efficiently outperforms the company's current practice.

  17. Comparing fixed-amount and progressive-amount DRO Schedules for tic suppression in youth with chronic tic disorders.

    Science.gov (United States)

    Capriotti, Matthew R; Turkel, Jennifer E; Johnson, Rachel A; Espil, Flint M; Woods, Douglas W

    2017-01-01

    Chronic tic disorders (CTDs) involve motor and/or vocal tics that often cause substantial distress and impairment. Differential reinforcement of other behavior (DRO) schedules of reinforcement produce robust, but incomplete, reductions in tic frequency in youth with CTDs; however, a more robust reduction may be needed to affect durable clinical change. Standard, fixed-amount DRO schedules have not commonly yielded such reductions, so we evaluated a novel, progressive-amount DRO schedule, based on its ability to facilitate sustained abstinence from functionally similar behaviors. Five youth with CTDs were exposed to periods of baseline, fixed-amount DRO (DRO-F), and progressive-amount DRO (DRO-P). Both DRO schedules produced decreases in tic rate and increases in intertic interval duration, but no systematic differences were seen between the two schedules on any dimension of tic occurrence. The DRO-F schedule was generally preferred to the DRO-P schedule. Possible procedural improvements and other future directions are discussed. © 2016 Society for the Experimental Analysis of Behavior.

  18. Integrated Cost and Schedule using Monte Carlo Simulation of a CPM Model - 12419

    Energy Technology Data Exchange (ETDEWEB)

    Hulett, David T. [Hulett and Associates, LLC (United States); Nosbisch, Michael R. [Project Time and Cost, Inc. (United States)

    2012-07-01

    This discussion of the recommended practice (RP) 57R-09 of AACE International defines the integrated analysis of schedule and cost risk to estimate the appropriate level of cost and schedule contingency reserve on projects. The main contribution of this RP is to include the impact of schedule risk on cost risk and hence on the need for cost contingency reserves. Additional benefits include the prioritizing of the risks to cost, some of which are risks to schedule, so that risk mitigation may be conducted in a cost-effective way, scatter diagrams of time-cost pairs for developing joint targets of time and cost, and probabilistic cash flow which shows cash flow at different levels of certainty. Integrating cost and schedule risk into one analysis based on the project schedule loaded with costed resources from the cost estimate provides both: (1) more accurate cost estimates than if the schedule risk were ignored or incorporated only partially, and (2) illustrates the importance of schedule risk to cost risk when the durations of activities using labor-type (time-dependent) resources are risky. Many activities such as detailed engineering, construction or software development are mainly conducted by people who need to be paid even if their work takes longer than scheduled. Level-of-effort resources, such as the project management team, are extreme examples of time-dependent resources, since if the project duration exceeds its planned duration the cost of these resources will increase over their budgeted amount. The integrated cost-schedule risk analysis is based on: - A high quality CPM schedule with logic tight enough so that it will provide the correct dates and critical paths during simulation automatically without manual intervention. - A contingency-free estimate of project costs that is loaded on the activities of the schedule. - Resolves inconsistencies between cost estimate and schedule that often creep into those documents as project execution proceeds

  19. Are chronotype, social jetlag and sleep duration associated with health measured by Work Ability Index?

    Science.gov (United States)

    Yong, Mei; Fischer, Dorothee; Germann, Christina; Lang, Stefan; Vetter, Céline; Oberlinner, Christoph

    The present study investigates the impact of chronotype, social jetlag and sleep duration on self-perceived health, measured by Work Ability Index (WAI), within an industrial setting. Between 2011 and 2013, 2474 day and shift workers participated in a health check offered by an occupational health promotion program and filled out the Munich ChronoType Questionnaire (adapted to the rotational 12-h schedule for shift workers) and the WAI. We computed sleep duration on work and free days, chronotype, and social jetlag. We used linear regression models to examine chronotype, sleep duration and social jetlag for association with the WAI sum score, and proportional odds models to estimate the combined effect of social jetlag and sleep duration. Participants reported an average daily sleep duration of 7.35 h (SD: 1.2 h), had an average chronotype of 3:08 a.m. (SD: 1 h), and the average social jetlag corresponded to 1.96 h (SD: 2.05 h). Increasing social jetlag and shorter sleep duration were independently associated with a decreasing WAI, while chronotype per se was not associated with WAI. Short sleep duration combined with high social jetlag significantly increased the risk of poor WAI (OR = 1.36; 95% CI: 1.09-1.72), while long sleep duration and high social jetlag were not associated with poor WAI (OR = 1.09; 95% CI: 0.88-1.35). Our results add to a growing body of literature, suggesting that circadian misalignment, but not chronotype per se, may be critical for health. Our results indicate that longer sleep may override the adverse effects of social jetlag on WAI.

  20. Scheduling algorithms for saving energy and balancing load

    Energy Technology Data Exchange (ETDEWEB)

    Antoniadis, Antonios

    2012-08-03

    In this thesis we study problems of scheduling tasks in computing environments. We consider both the modern objective function of minimizing energy consumption, and the classical objective of balancing load across machines. We first investigate offline deadline-based scheduling in the setting of a single variable-speed processor that is equipped with a sleep state. The objective is that of minimizing the total energy consumption. Apart from settling the complexity of the problem by showing its NP-hardness, we provide a lower bound of 2 for general convex power functions, and a particular natural class of schedules called s{sub crit}-schedules. We also present an algorithmic framework for designing good approximation algorithms. For general convex power functions our framework improves the best known approximation-factor from 2 to 4/3. This factor can be reduced even further to 137/117 for a specific well-motivated class of power functions. Furthermore, we give tight bounds to show that our framework returns optimal s{sub crit}-schedules for the two aforementioned power-function classes. We then focus on the multiprocessor setting where each processor has the ability to vary its speed. Job migration is allowed, and we again consider classical deadline-based scheduling with the objective of energy minimization. We first study the offline problem and show that optimal schedules can be computed efficiently in polynomial time for any convex and non-decreasing power function. Our algorithm relies on repeated maximum flow computations. Regarding the online problem and power functions P(s) = s{sup {alpha}}, where s is the processor speed and {alpha} > 1 a constant, we extend the two well-known single-processor algorithms Optimal Available and Average Rate. We prove that Optimal Available is {alpha}{sup {alpha}}-competitive as in the single-processor case. For Average Rate we show a competitive factor of (2{alpha}){sup {alpha}}/2 + 1, i.e., compared to the single