WorldWideScience

Sample records for repetitive scheduling method

  1. Self-controlled KR schedules: does repetition order matter?

    Science.gov (United States)

    Patterson, Jae T; Carter, Michael J; Hansen, Steve

    2013-08-01

    The impact of an experimenter-defined repetition schedule on the utility of a self-controlled KR context during motor skill acquisition was examined. Participants were required to learn three novel spatial-temporal tasks in either a random or blocked repetition schedule with or without the opportunity to control their KR. Results from the retention period showed that participants provided control over their KR schedule in a random repetition schedule demonstrated superior learning. However, performance measures from the transfer test showed that, independent of repetition schedule, learners provided the opportunity to control their KR schedule demonstrated superior transfer performance compared to their yoked counterparts. The dissociated impact of repetition schedule and self-controlled KR schedules on retention and transfer is discussed.

  2. Likelihood methods and classical burster repetition

    CERN Document Server

    Graziani, C; Graziani, Carlo; Lamb, Donald Q

    1995-01-01

    We develop a likelihood methodology which can be used to search for evidence of burst repetition in the BATSE catalog, and to study the properties of the repetition signal. We use a simplified model of burst repetition in which a number N_{\\rm r} of sources which repeat a fixed number of times N_{\\rm rep} are superposed upon a number N_{\\rm nr} of non-repeating sources. The instrument exposure is explicitly taken into account. By computing the likelihood for the data, we construct a probability distribution in parameter space that may be used to infer the probability that a repetition signal is present, and to estimate the values of the repetition parameters. The likelihood function contains contributions from all the bursts, irrespective of the size of their positional errors --- the more uncertain a burst's position is, the less constraining is its contribution. Thus this approach makes maximal use of the data, and avoids the ambiguities of sample selection associated with data cuts on error circle size. We...

  3. Model predictive control-based scheduler for repetitive discrete event systems with capacity constraints

    Directory of Open Access Journals (Sweden)

    Hiroyuki Goto

    2013-07-01

    Full Text Available A model predictive control-based scheduler for a class of discrete event systems is designed and developed. We focus on repetitive, multiple-input, multiple-output, and directed acyclic graph structured systems on which capacity constraints can be imposed. The target system’s behaviour is described by linear equations in max-plus algebra, referred to as state-space representation. Assuming that the system’s performance can be improved by paying additional cost, we adjust the system parameters and determine control inputs for which the reference output signals can be observed. The main contribution of this research is twofold, 1: For systems with capacity constraints, we derived an output prediction equation as functions of adjustable variables in a recursive form, 2: Regarding the construct for the system’s representation, we improved the structure to accomplish general operations which are essential for adjusting the system parameters. The result of numerical simulation in a later section demonstrates the effectiveness of the developed controller.

  4. Buffer Size Setting Method for DBR Scheduling

    Science.gov (United States)

    Park, Soonyoung; Woo, Kiyun; Fujimura, Shigeru

    There are many kinds of delay in real-world production systems caused by many reasons including unexpected accidents. A delay of order may inflict great damages for not only itself but also the other affected orders. To prevent these types of loss from frequent delay, DBR (Drum-Buffer-Rope) scheduling method of TOC (Theory of Constraints) manages production schedule observing the state of time buffers. The current buffer size setting method for DBR scheduling is very simple and depends on user's experience. Although it makes possible to keep the due time for production orders, it leads to the redundant production lead time and stock. For DBR scheduling, it is not clear how the buffer size should be set. Therefore, this paper proposes a buffer size setting method for DBR scheduling providing a numerical model for the buffer size. In addition, a simulation gives the result of comparison between the current method and the proposed method, and the effect of the proposed method is shown.

  5. High Repetition Rate Thermometry System And Method

    KAUST Repository

    Chrystie, Robin

    2015-05-14

    A system and method for rapid thermometry using intrapulse spectroscopy can include a laser for propagating pulses of electromagnetic radiation to a region. Each of the pulses can be chirped. The pulses from the region can be detected. An intrapulse absorbance spectrum can be determined from the pulses. An instantaneous temperature of the region based on the intrapulse absorbance spectrum can be determined.

  6. Scheduled Relaxation Jacobi method: improvements and applications

    CERN Document Server

    Adsuara, J E; Cerdá-Durán, P; Aloy, M A

    2015-01-01

    Elliptic partial differential equations (ePDEs) appear in a wide variety of areas of mathematics, physics and engineering. Typically, ePDEs must be solved numerically, which sets an ever growing demand for efficient and highly parallel algorithms to tackle their computational solution. The Scheduled Relaxation Jacobi (SRJ) is a promising class of methods, atypical for combining simplicity and efficiency, that has been recently introduced for solving linear Poisson-like ePDEs. The SRJ methodology relies on computing the appropriate parameters of a multilevel approach with the goal of minimizing the number of iterations needed to cut down the residuals below specified tolerances. The efficiency in the reduction of the residual increases with the number of levels employed in the algorithm. Applying the original methodology to compute the algorithm parameters with more than 5 levels notably hinders obtaining optimal SRJ schemes, as the mixed (non-linear) algebraic-differential equations from which they result bec...

  7. Distributed Research Project Scheduling Based on Multi-Agent Methods

    Directory of Open Access Journals (Sweden)

    Constanta Nicoleta Bodea

    2011-01-01

    Full Text Available Different project planning and scheduling approaches have been developed. The Operational Research (OR provides two major planning techniques: CPM (Critical Path Method and PERT (Program Evaluation and Review Technique. Due to projects complexity and difficulty to use classical methods, new approaches were developed. Artificial Intelligence (AI initially promoted the automatic planner concept, but model-based planning and scheduling methods emerged later on. The paper adresses the project scheduling optimization problem, when projects are seen as Complex Adaptive Systems (CAS. Taken into consideration two different approaches for project scheduling optimization: TCPSP (Time- Constrained Project Scheduling and RCPSP (Resource-Constrained Project Scheduling, the paper focuses on a multiagent implementation in MATLAB for TCSP. Using the research project as a case study, the paper includes a comparison between two multi-agent methods: Genetic Algorithm (GA and Ant Colony Algorithm (ACO.

  8. Scheduled Relaxation Jacobi method: Improvements and applications

    Science.gov (United States)

    Adsuara, J. E.; Cordero-Carrión, I.; Cerdá-Durán, P.; Aloy, M. A.

    2016-09-01

    Elliptic partial differential equations (ePDEs) appear in a wide variety of areas of mathematics, physics and engineering. Typically, ePDEs must be solved numerically, which sets an ever growing demand for efficient and highly parallel algorithms to tackle their computational solution. The Scheduled Relaxation Jacobi (SRJ) is a promising class of methods, atypical for combining simplicity and efficiency, that has been recently introduced for solving linear Poisson-like ePDEs. The SRJ methodology relies on computing the appropriate parameters of a multilevel approach with the goal of minimizing the number of iterations needed to cut down the residuals below specified tolerances. The efficiency in the reduction of the residual increases with the number of levels employed in the algorithm. Applying the original methodology to compute the algorithm parameters with more than 5 levels notably hinders obtaining optimal SRJ schemes, as the mixed (non-linear) algebraic-differential system of equations from which they result becomes notably stiff. Here we present a new methodology for obtaining the parameters of SRJ schemes that overcomes the limitations of the original algorithm and provide parameters for SRJ schemes with up to 15 levels and resolutions of up to 215 points per dimension, allowing for acceleration factors larger than several hundreds with respect to the Jacobi method for typical resolutions and, in some high resolution cases, close to 1000. Most of the success in finding SRJ optimal schemes with more than 10 levels is based on an analytic reduction of the complexity of the previously mentioned system of equations. Furthermore, we extend the original algorithm to apply it to certain systems of non-linear ePDEs.

  9. Restricted and repetitive behaviors in toddlers and preschoolers with autism spectrum disorders based on the Autism Diagnostic Observation Schedule (ADOS).

    Science.gov (United States)

    Kim, So Hyun; Lord, Catherine

    2010-08-01

    Restricted and repetitive behaviors (RRBs) observed during the Autism Diagnostic Observation Schedule [ADOS: Lord et al., 2000] were examined in a longitudinal data set of 455 toddlers and preschoolers (age 8-56 months) with clinical diagnosis of Autism Spectrum Disorders (ASD; autism, n=121 and pervasive developmental disorders-not otherwise specified (PDD-NOS), n=71), a nonspectrum disorder (NS; n=90), or typical development (TD; n=173). Even in the relatively brief semi-structured observations, GEE analyses of the severity and prevalence of RRBs differentiated children with ASD from those with NS and TD across all ages. RRB total scores on the ADOS were stable over time for children with ASD and NS; however, typically developing preschoolers showed lower RRB scores than typically developing toddlers. Nonverbal IQ (NVIQ) was more strongly related to the prevalence of RRBs in older children with PDD-NOS, NS, and TD than younger children under 2 years and those with autism. Item analyses revealed different relationships between individual items and NVIQ, age, diagnosis, and gender. These findings are discussed in terms of their implications for the etiology and treatment of RRBs as well as for the framework of ASD diagnostic criteria in future diagnostic systems.

  10. Evaluation of Scheduling Methods for Multiple Runways

    Science.gov (United States)

    Bolender, Michael A.; Slater, G. L.

    1996-01-01

    Several scheduling strategies are analyzed in order to determine the most efficient means of scheduling aircraft when multiple runways are operational and the airport is operating at different utilization rates. The study compares simulation data for two and three runway scenarios to results from queuing theory for an M/D/n queue. The direction taken, however, is not to do a steady-state, or equilibrium, analysis since this is not the case during a rush period at a typical airport. Instead, a transient analysis of the delay per aircraft is performed. It is shown that the scheduling strategy that reduces the delay depends upon the density of the arrival traffic. For light traffic, scheduling aircraft to their preferred runways is sufficient; however, as the arrival rate increases, it becomes more important to separate traffic by weight class. Significant delay reduction is realized when aircraft that belong to the heavy and small weight classes are sent to separate runways with large aircraft put into the 'best' landing slot.

  11. Multi-criteria evaluation methods in the production scheduling

    Science.gov (United States)

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

    2016-08-01

    The paper presents a discussion on the practical application of different methods of multi-criteria evaluation in the process of scheduling in manufacturing systems. Among the methods two main groups are specified: methods based on the distance function (using metacriterion) and methods that create a Pareto set of possible solutions. The basic criteria used for scheduling were also described. The overall procedure of evaluation process in production scheduling was presented. It takes into account the actions in the whole scheduling process and human decision maker (HDM) participation. The specified HDM decisions are related to creating and editing a set of evaluation criteria, selection of multi-criteria evaluation method, interaction in the searching process, using informal criteria and making final changes in the schedule for implementation. According to need, process scheduling may be completely or partially automated. Full automatization is possible in case of metacriterion based objective function and if Pareto set is selected - the final decision has to be done by HDM.

  12. A Dynamic Job Shop Scheduling Method Based on Lagrangian Relaxation

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    Due to the complexity of dynamic job shop scheduling in flexible manufacturing s ystem(FMS), many heuristic rules are still used today. A dynamic scheduling appr oach based on Lagrangian relaxation is proposed to improve the quality and guara ntee the real-time capability of dynamic scheduling. The proposed method makes use of the dynamic predictive optimal theory combined with Lagrangian relaxation to obtain a good solution that can be evaluated quantitatively. The Lagrangian multipliers introduced here are capable of describing machine predictive states and system capacity constraints. This approach can evaluate the suboptimality of the scheduling systems. It can also quickly obtain high quality feasible schedu les, thus enabling Lagrangian relaxation to be better used in the dynamic schedu ling of manufacturing system. The efficiency and effectiveness of this method ar e verified by numerical experiments.

  13. METHODS FOR THE SHIFT DESIGN AND PERSONNEL TASK SCHEDULING PROBLEM

    OpenAIRE

    Lapègue, Tanguy; Bellenguez-Morineau, Odile; Prot, Damien

    2014-01-01

    Colloque avec actes et comité de lecture. internationale.; International audience; This paper introduces an overview of the methods that have been used in the literature to solve the Shift Design and Personnel Task Scheduling Problem with Equity. Basically, this problem aims at designing a schedule while assigning fixed tasks, that cannot be preempted, to an heterogeneous workforce. Such problem may occur in several contexts, where industrial activity requires a sharp and efficient management...

  14. Schedulability Analysis Method of Timing Constraint Petri Nets

    Institute of Scientific and Technical Information of China (English)

    李慧芳; 范玉顺

    2002-01-01

    Timing constraint Petri nets (TCPNs) can be used to model a real-time system specification and to verify the timing behavior of the system. This paper describes the limitations of the reachability analysis method in analyzing complex systems for existing TCPNs. Based on further research on the schedulability analysis method with various topology structures, a more general state reachability analysis method is proposed. To meet various requirements of timely response for actual systems, this paper puts forward a heuristic method for selecting decision-spans of transitions and develops a heuristic algorithm for schedulability analysis of TCPNs. Examples are given showing the practicality of the method in the schedulability analysis for real-time systems with various structures.

  15. SD-REE: A Cryptographic Method to Exclude Repetition from a Message

    CERN Document Server

    Dey, Somdip

    2012-01-01

    In this paper, the author presents a new cryptographic technique, SD-REE, to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm [1,2] or retrieve the key, used for encryption, by inserting repetitive bytes / characters in the message and encrypt the message or by analyzing repetitions in the encrypted message, to find out the encryption algorithm or retrieve the key used for the encryption. But in SD-REE method the repetitive bytes / characters are removed and there is no trace of any repetition in the message, which was encrypted.

  16. Tramp Ship Routing and Scheduling - Models, Methods and Opportunities

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin

    and scheduling. This includes a review on existing literature, modelling approaches, solution methods as well as an analysis of the current status and future opportunities of research within tramp ship routing and scheduling. We argue that rather than developing new solution methods for the basic routing...... to mergers, pooling, and collaboration efforts between shipping companies, the fleet sizes have grown to a point where manual planning is no longer adequate in a market with tough competition and low freight rates. The aim of this paper is to provide a comprehensive introduction to tramp ship routing...... and scheduling problem, focus should now be on extending this basic problem to include additional real-world complexities and develop suitable solution methods for those extensions. Such extensions will enable more tramp operators to benefit from the solution methods while simultaneously creating new...

  17. A Scheduling Method for Painting Line under Pull Production

    Science.gov (United States)

    Yoo, Jae Kyu; Shinbo, Kojiro; Shimizu, Yoshiaki

    This paper concerns with a scheduling method for painting (preceding) line with much longer production lead-time than assembly (subsequent) line. In general, production schedule of the painting line is made independently based on the forecasted job requirement at the assembly line. When the job requirement changes at the assembly line by virtue of the change of customer order, therefore, production balance is destroyed between the both lines. To avoid the tardiness caused by such unbalance, we need to have many inventories for the painting line. Such countermeasure is taken place in many companies actually. Thus, to avoid the tardiness while keeping small inventory, we propose a scheduling method that makes a Pseudo-Pull production possible for the painting line. We have evaluated the proposed method through computer simulations.

  18. An Agent Interaction Based Method for Nonlinear Process Plan Scheduling

    Institute of Scientific and Technical Information of China (English)

    GAO Qinglu; WU Bo; GUO Guang

    2006-01-01

    This article puts forward a scheduling method for nonlinear process plan shop floor. Task allocation and load balance are realized by bidding mechanism. Though the agent interaction process, the execution of tasks is determined and the coherence of manufacturing decision is verified. The employment of heuristic index can help to optimize the system performance.

  19. Trajectory Scheduling Methods for minimizing total tardiness in a flowshop

    Directory of Open Access Journals (Sweden)

    Xiaoping Li

    2015-12-01

    Full Text Available In this paper, Trajectory Scheduling Methods (TSMs are proposed for the permutation flowshop scheduling problem with total tardiness minimization criterion. TSMs belong to an iterative local search framework, in which local search is performed on an initial solution, a perturbation operator is deployed to improve diversification, and a restart point mechanism is used to select the new start point of another cycle. In terms of the insertion and swap neighborhood structures, six composite heuristics are introduced, which exploit the search space with a strong intensification effect. Based on purely insertion-based or swap-based perturbation structures, three compound perturbation structures are developed that construct a candidate restart point set rather than just a single restart point. The distance between the current best solution and each start point of the set is defined, according to which the diversification effect of TSMs can be boosted by choosing the most appropriate restart point for the next iteration. A total of 18 trajectory scheduling methods are constructed by different combinations of composite heuristics. Both the best and worst combinations are compared with three best existing sequential meta-heuristics for the considered problem on 540 benchmark instances. Experimental results show that the proposed heuristics significantly outperform the three best existing algorithms within the same computation time.

  20. Method and apparatus for scheduling broadcasts in social networks

    KAUST Repository

    Manzoor, Emaad Ahmed

    2016-08-25

    A method, apparatus, and computer readable medium are provided for maximizing consumption of broadcasts by a producer. An example method includes receiving selection of a total number of time slots to use for scheduling broadcasts, and receiving information regarding the producer\\'s followers. The example method further 5 includes identifying, by a processor and based on the received information, discount factors associated with the producer\\'s followers, and calculating, by the processor and based on the received information, a predicted number of competitor broadcasts during each time slot of the total number of time slots. Finally, the example method includes determining, by the processor and based on the discount factors and the predicted 10 number of competitor broadcasts during each time slot, a number of broadcasts for the producer to transmit in each time slot of the total number of time slots.

  1. Stable schedule matchings by a fixed point method

    CERN Document Server

    Komornik, Vilmos; Viauroux, Christelle K

    2010-01-01

    We generalize several schedule matching theorems of Baiou-Balinski (Math. Oper. Res., 27 (2002), 485) and Alkan-Gale (J. Econ. Th. 112 (2003), 289) by applying a fixed point method of Fleiner (Math. Oper. Res., 28 (2003), 103). Thanks to a more general construction of revealing choice maps we develop an algorithm to solve rather complex matching problems. The flexibility and efficiency of our approach is illustrated by various examples. We also revisit the mathematical structure of the matching theory by comparing various definitions of stable sets and various classes of choice maps. We demonstrate, by several examples, that the revealing property of the choice maps is the most suitable one to ensure the existence of stable matchings; both from the theoretical and the practical point of view.

  2. Bayesian Methods for Analysis and Adaptive Scheduling of Exoplanet Observations

    CERN Document Server

    Loredo, Thomas J; Chernoff, David F; Clyde, Merlise A; Liu, Bin

    2011-01-01

    We describe work in progress by a collaboration of astronomers and statisticians developing a suite of Bayesian data analysis tools for extrasolar planet (exoplanet) detection, planetary orbit estimation, and adaptive scheduling of observations. Our work addresses analysis of stellar reflex motion data, where a planet is detected by observing the "wobble" of its host star as it responds to the gravitational tug of the orbiting planet. Newtonian mechanics specifies an analytical model for the resulting time series, but it is strongly nonlinear, yielding complex, multimodal likelihood functions; it is even more complex when multiple planets are present. The parameter spaces range in size from few-dimensional to dozens of dimensions, depending on the number of planets in the system, and the type of motion measured (line-of-sight velocity, or position on the sky). Since orbits are periodic, Bayesian generalizations of periodogram methods facilitate the analysis. This relies on the model being linearly separable, ...

  3. Analysis of sequencing and scheduling methods for arrival traffic

    Science.gov (United States)

    Neuman, Frank; Erzberger, Heinz

    1990-01-01

    The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.

  4. An Improved Clutter Suppression Method for Weather Radars Using Multiple Pulse Repetition Time Technique

    Directory of Open Access Journals (Sweden)

    Yingjie Yu

    2017-01-01

    Full Text Available This paper describes the implementation of an improved clutter suppression method for the multiple pulse repetition time (PRT technique based on simulated radar data. The suppression method is constructed using maximum likelihood methodology in time domain and is called parametric time domain method (PTDM. The procedure relies on the assumption that precipitation and clutter signal spectra follow a Gaussian functional form. The multiple interleaved pulse repetition frequencies (PRFs that are used in this work are set to four PRFs (952, 833, 667, and 513 Hz. Based on radar simulation, it is shown that the new method can provide accurate retrieval of Doppler velocity even in the case of strong clutter contamination. The obtained velocity is nearly unbiased for all the range of Nyquist velocity interval. Also, the performance of the method is illustrated on simulated radar data for plan position indicator (PPI scan. Compared with staggered 2-PRT transmission schemes with PTDM, the proposed method presents better estimation accuracy under certain clutter situations.

  5. Hybrid IP/CP Methods for Solving Sports Scheduling Problems

    DEFF Research Database (Denmark)

    Rasmussen, Rasmus Vinther

    2006-01-01

    The field of sports scheduling comprises a challenging research areawith a great variety of hard combinatorial optimization problems andchallenging practical applications. This dissertation gives acomprehensive survey of the area and a number of new contributionsare presented. First a general sol...

  6. Research for Global Coordinating Method of Large Equipment Scheduling in Construction Site

    Directory of Open Access Journals (Sweden)

    Yao Ruojun

    2015-01-01

    Full Text Available Much energy is dissipated when large equipment moves slowly. Generally, equipment scheduling at construction site is supposed to minimize equipment slowdown and deadhead moving. Table methods are always adopted to optimize transfer sequence, but the feasible solution is well disappointing. For the acceptable solution relevant to task points in construction equipment scheduling, transfer table is divided into four regions. After proper augmentation and deflation, the acceptable solution evolves into global coordinating solution of construction scheduling, which contributes to minimizing slowdown and deadhead mileages. This method has been verified in practical engineering and is a significant reference on decision making of construction equipment scheduling.

  7. Production of ethyl alcohol with a repetitive batch fermentation method. Kurikaeshi kaibun hakkoho ni yoru alcohol no seizoho

    Energy Technology Data Exchange (ETDEWEB)

    Saiki, T. (Tokyo (Japan)); Takagi, Y. (Chiba (Japan)); Shiba, M. (Kagashima (Japan))

    1994-01-11

    This invention aims to present a production method of ethyl alcohol with a repetitive batch fermentation method in which each batch fermentation is performed rapidly with high concentration of yeast to overcome weak points of conventional procedures and the end point of the fermentation is determined accurately and quickly to switch to the next batch with long-term stability. This invention relates to a production method of ethyl alcohol with repetitive batch fermentation by use of carbohydrate and starchy raw materials, in which a gas flow meter to measure velocity water head is equipped and the end point of the fermentation is judged when the flow rate of fermentation exhaust gas is 0.35-0.1 m[sup 3]/kl[center dot]hr or under. This invention produces ethyl alcohol effectively from raw materials and enables efficient repetitive batch fermentation with less damage of the yeast. 6 figs., 2 tabs.

  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...... for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and discontinuous flow of resources. Alternative scheduling techniques, often called repetitive or linear...... 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. Multiagent scheduling method with earliness and tardiness objectives in flexible job shops.

    Science.gov (United States)

    Wu, Zuobao; Weng, Michael X

    2005-04-01

    Flexible job-shop scheduling problems are an important extension of the classical job-shop scheduling problems and present additional complexity. Such problems are mainly due to the existence of a considerable amount of overlapping capacities with modern machines. Classical scheduling methods are generally incapable of addressing such capacity overlapping. We propose a multiagent scheduling method with job earliness and tardiness objectives in a flexible job-shop environment. The earliness and tardiness objectives are consistent with the just-in-time production philosophy which has attracted significant attention in both industry and academic community. A new job-routing and sequencing mechanism is proposed. In this mechanism, two kinds of jobs are defined to distinguish jobs with one operation left from jobs with more than one operation left. Different criteria are proposed to route these two kinds of jobs. Job sequencing enables to hold a job that may be completed too early. Two heuristic algorithms for job sequencing are developed to deal with these two kinds of jobs. The computational experiments show that the proposed multiagent scheduling method significantly outperforms the existing scheduling methods in the literature. In addition, the proposed method is quite fast. In fact, the simulation time to find a complete schedule with over 2000 jobs on ten machines is less than 1.5 min.

  10. Efficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing

    Directory of Open Access Journals (Sweden)

    Hilda Lawrance

    2013-03-01

    Full Text Available Cloud computing is increasingly been used in enterprises and business markets for serving demanding jobs. The performance of resource scheduling in cloud computing is important due to the increase in number of users, services and type of services. Resource scheduling is influenced by many factors such as CPU speed, memory, bandwidth etc. Therefore resource scheduling can be modeled as a multi criteria decision making problem. This study proposes an efficient QoS based resource scheduling algorithm using potentially all pair-wise rankings of all possible alternatives (PAPRIKA. The tasks are arranged based on the QoS parameters and the resources are allocated to the appropriate tasks based on PAPRIKA method and user satisfaction. The scheduling algorithm was simulated with cloudsim tool package. The experiment shows that, the algorithm reduces task completion time and improves resource utility rate.

  11. Introducing an Efficient Method for Scheduling Independent Tasks in Grid Environment using Meta-Heuristic Algorithms

    Directory of Open Access Journals (Sweden)

    Masoud Shirzadi

    2015-11-01

    Full Text Available Since the dynamicity and inhomogeneity of resources complicates scheduling, it is not possible to use accurate scheduling algorithms. Therefore, many studies focus on heuristic algorithms like the artificial bee colony algorithm. Since, the artificial bee colony algorithm searches the problem space locally and has a poor performance in global search; global search algorithms like genetic algorithms should also be used to overcome this drawback. This study proposes a scheduling algorithm, which is combination of the genetic and artificial bee colony algorithms for the independent scheduling problem in a computing grid. This study aims to reduce the maximum total scheduling time. Simulation results indicate that the proposed algorithm reduces the maximum execution time (makespan by 10% in comparison to the compared methods.

  12. One-repetition maximum bench press performance estimated with a new accelerometer method.

    Science.gov (United States)

    Rontu, Jari-Pekka; Hannula, Manne I; Leskinen, Sami; Linnamo, Vesa; Salmi, Jukka A

    2010-08-01

    The one repetition maximum (1RM) is an important method to measure muscular strength. The purpose of this study was to evaluate a new method to predict 1RM bench press performance from a submaximal lift. The developed method was evaluated by using different load levels (50, 60, 70, 80, and 90% of 1RM). The subjects were active floorball players (n = 22). The new method is based on the assumption that the estimation of 1RM can be calculated from the submaximal weight and the maximum acceleration of the submaximal weight during the lift. The submaximal bench press lift was recorded with a 3-axis accelerometer integrated to a wrist equipment and a data acquisition card. The maximum acceleration was calculated from the measurement data of the sensor and analyzed in personal computer with LabView-based software. The estimated 1RM results were compared with traditionally measured 1RM results of the subjects. An own estimation equation was developed for each load level, that is, 5 different estimation equations have been used based on the measured 1RM values of the subjects. The mean (+/-SD) of measured 1RM result was 69.86 (+/-15.72) kg. The mean of estimated 1RM values were 69.85-69.97 kg. The correlations between measured and estimated 1RM results were high (0.89-0.97; p < 0.001). The differences between the methods were very small (-0.11 to 0.01 kg) and were not significantly different from each other. The results of this study showed promising prediction accuracy for estimating bench press performance by performing just a single submaximal bench press lift. The estimation accuracy is competitive with other known estimation methods, at least with the current study population.

  13. An Integrated Control and Scheduling Optimization Method of Networked Control Systems

    Institute of Scientific and Technical Information of China (English)

    HE Jian-qiang; ZHANG Huan-chun; JING Ya-zhi

    2004-01-01

    Feedback control systems wherein the control loops are closed through a real-time network are called networked control systems (NCSs). The limitation of communication bandwidth results in transport delay, affects the property of real-time system, and degrades the performance of NCSs. An integrated control and scheduling optimization method using genetic algorithm is proposed in this paper.This method can synchronously optimize network scheduling and improve the performance of NCSs. To illustrate its effectiveness, an example is provided.

  14. DEADLOCK-FREE SCHEDULING METHOD BASED ON PETRI NET AND GA

    Institute of Scientific and Technical Information of China (English)

    Xu Gang; Wu Zhiming

    2003-01-01

    An efficient algorithm for finding an optimal deadlock-free schedule in a manufacturing system with very limited buffer is presented. This algorithm is based on the effective genetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, Petri net is involved to make the implementation of the job scheduling in an FMS deadlock-free. The effectiveness and efficiency of the proposed approach is illustrated by using an example.

  15. Repetitive transcranial magnetic stimulation as an adjuvant method in the treatment of depression: Preliminary results

    Directory of Open Access Journals (Sweden)

    Jovičić Milica

    2014-01-01

    Full Text Available Introduction. Repetitive transcranial magnetic stimulation (rTMS is a method of brain stimulation which is increasingly used in both clinical practice and research. Up-to-date studies have pointed out a potential antidepressive effect of rTMS, but definitive superiority over placebo has not yet been confirmed. Objective. The aim of the study was to examine the effect of rTMS as an adjuvant treatment with antidepressants during 18 weeks of evaluation starting from the initial application of the protocol. Methods. Four patients with the diagnosis of moderate/severe major depression were included in the study. The protocol involved 2000 stimuli per day (rTMS frequency of 10 Hz, intensity of 120% motor threshold administered over the left dorsolateral prefrontal cortex (DLPFC for 15 days. Subjective and objective depressive symptoms were measured before the initiation of rTMS and repeatedly evaluated at week 3, 6, 12 and 18 from the beginning of the stimulation. Results. After completion of rTMS protocol two patients demonstrated a reduction of depressive symptoms that was sustained throughout the 15-week follow-up period. One patient showed a tendency of remission during the first 12 weeks of the study, but relapsed in week 18. One patient showed no significant symptom reduction at any point of follow-up. Conclusion. Preliminary findings suggest that rTMS has a good tolerability and can be efficient in accelerating the effect of antidepressants, particularly in individuals with shorter duration of depressive episodes and moderate symptom severity. [Projekat Ministarstva nauke Republike Srbije, br. III41029 i br. ON175090

  16. A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity

    Directory of Open Access Journals (Sweden)

    Kenzo KURIHARA

    2005-02-01

    Full Text Available We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1the variation of productive capacity, and (2the variation of products' quantities themselves. In this paper, we deal with the former variation, or productive capacities, at flow-shop works. When production machines in a shop go out of order at flow-shops, we cannot continue to operate the productions and we have to stop the production line. To the contrary, we can continue to operate the shops even if some workers absent themselves. Of course, in this case, the production capacities become lower, because workers need to move from a machine to another to overcome the shortage of workers and some shops cannot be operated because of the worker shortage. We developed a new re-scheduling method based on Branch-and Bound method. We proposed an equation for calculating the lower bound for our Branch-and Bound method in a practical time. Some evaluation experiments are done using practical data of real flow-shop works. We compared our results with those of another simple scheduling method, and we confirmed the total production time of our result is shorter than that of another method by 4%.

  17. A Fast Method for Heuristics in Large-Scale Flow Shop Scheduling

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Fast computation methods are needed for the heuristics of flow shop scheduling problems in practical manufacturing environments. This paper describes a generalized flow shop model, which is an extension of the classical model, in which not all machines are available at time zero. The general completion-time computing method is used to compute completion time of generalized flow shops. The transform classical flow shop to generalized shop (TCG) method is used to transform classical schedules into generalized schedules with less jobs. INSERT and SWAP, extended from job-insertion and pair-wise exchange which are fundamental procedures used in most heuristics for classical flow shops, reduce the CPU time by 1/2 and 1/3, respectively. The CPU time of 14 job-insertion and pair-wise exchange-based heuristics are analyzed with and without the TCG method. The results show that TCG considerably reduces the CPU time.

  18. Exact methods for time constrained routing and related scheduling problems

    DEFF Research Database (Denmark)

    Kohl, Niklas

    1995-01-01

    This dissertation presents a number of optimization methods for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP), where a fleet of vehicles based at a central depot must service a set of custo......This dissertation presents a number of optimization methods for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP), where a fleet of vehicles based at a central depot must service a set...

  19. A Scheduling Method to Reduce Waiting Time for Close-Range Broadcasting

    Directory of Open Access Journals (Sweden)

    Yusuke Gotoh

    2012-01-01

    Full Text Available Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main program continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. However, these methods do not consider the broadcast schedule for two types of continuous media data. When the server schedules two types of continuous media data, waiting time that occurs from finishing the highlight scene to starting the main scene, may increase. In this paper, we propose a scheduling method to reduce the waiting time for close-range broadcasting. In our proposed method, by dividing two types of data and producing an effective broadcast schedule considering the available bandwidth, we can reduce the waiting time.

  20. Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Guan, X. [Pacific Gas and Electric, San Francisco, CA (United States); Luh, P.B.; Zhang, L. [Univ. of Connecticut, Storrs, CT (United States). Dept. of Electrical and Systems Engineering

    1995-05-01

    When the Lagrangian relaxation technique is used to solve hydrothermal scheduling problems, many subproblems have linear stage-wise cost functions. A well recognized difficulty is that the solutions to these subproblems may oscillate between maximum and minimum generations with slight changes of the multipliers. Furthermore, the subproblem solutions may become singular, i.e., they are un-determined when the linear coefficients become zero. This may result in large differences between subproblem solutions and the optimal primal schedule. In this paper, a nonlinear approximation method is presented which utilizes nonlinear functions, quadratic in this case, to approximate relevant linear cost functions. The analysis shows that the difficulty associated with solution oscillation is reduced, and singularity is avoided. Extensive testing based on Northeast Utilities data indicates that the method consistently generates better schedules than the standard Lagrangian relaxation method.

  1. On the equivalence between the Scheduled Relaxation Jacobi method and Richardson's non-stationary method

    CERN Document Server

    Adsuara, J E; Cerdá-Durán, P; Mewes, V; Aloy, M A

    2016-01-01

    The Scheduled Relaxation Jacobi (SRJ) method is an extension of the classical Jacobi iterative method to solve linear systems of equations ($Au=b$) associated with elliptic problems. It inherits its robustness and accelerates its convergence rate computing a set of $P$ relaxation factors that result from a minimization problem. In a typical SRJ scheme, the former set of factors is employed in cycles of $M$ consecutive iterations until a prescribed tolerance is reached. We present the analytic form for the optimal set of relaxation factors for the case in which all of them are different, and find that the resulting algorithm is equivalent to a non-stationary generalized Richardson's method. Our method to estimate the weights has the advantage that the explicit computation of the maximum and minimum eigenvalues of the matrix $A$ is replaced by the (much easier) calculation of the maximum and minimum frequencies derived from a von Neumann analysis. This set of weights is also optimal for the general problem, res...

  2. Scheduling method considering register-to-register data transfers; Resister kan data tenso wo koryoshita scheduling shuho

    Energy Technology Data Exchange (ETDEWEB)

    Tajima, H.; Fukunaga, K. [Osaka Prefecture University, Osaka (Japan); Harashima, K. [Osaka Institute of Technology, Osaka (Japan)

    1997-10-20

    In high level synthesis, Scheduling is an important stage which assigns each operation appeared in a data flow graph to a specific control step, of which results influence the design quality directly. This paper describes a scheduling approach for pipelined datapaths. Since few previous approaches estimate the inter connection cost between registers (register-to-register cost), our approach introduces a datapath model with the interconnection between registers across buses, and minimizes the total hardware cost including the register-to-register cost with the Force-Directed Scheduling. 10 refs., 11 figs., 4 tabs.

  3. NOISE REDUCTION SCHEDULING METHOD IN A SHOP FLOOR AND ITS CASE STUDY

    Institute of Scientific and Technical Information of China (English)

    Liu Fei; Cao Huajun; Zhang Hua; Yuan Chuanping

    2003-01-01

    Noise reduction in a shop floor is one of the important parts of green manufacturing. In a shop floor, machine tools are the main noise sources in a shop floor. A new approach is discovered by investigation that the noise can be obviously reduced in a shop floor by optimizing the scheduling between work pieces and machine tools. Based on the discovery, a new method of noise reduction is proposed. A noise reduction scheduling model in a shop floor is established, and the application of the model is also discussed. A case is studied, which shows that the method and model are practical.

  4. Modeling of Intermesh Schedule for Strong Heavy Plate Roller Straightener and Finite Element Method Modification

    Directory of Open Access Journals (Sweden)

    Meng Xu

    2016-01-01

    Full Text Available Regarding straightening unit as the research object, considered the different of roller spacing, a mathematical model of intermesh schedule suitable to the 2800 seven-roller strong heavy plate straightening machine was deduced by the geometric method. According to the mathematical model, the intermesh schedules of several specifications of plate were calculated, and the finite element model of straightening process was established in the finite element analysis software Abaqus. By analysing, it was found that those plates after straightening cannot meet the requirement of flatness, due to the existence of the work hardening. The bending deflection of the last straightening unit was modified and the new calculation formula of intermesh schedule was obtained. The values of the modified coefficients were determined by the finite element method. The intermesh schedules of other specifications of plate were calculated by the modified calculation formula and then verified it in Abaqus. The simulation results showed that those plates after straightening meet the requirement of flatness. So, the research results provide a theoretical basis for development of a new plate straightening machine and formulation of intermesh schedule.

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

  6. Local Search Method for a Parallel Machine Scheduling Problemof Minimizing the Number of Machines Operated

    Science.gov (United States)

    Yamana, Takashi; Iima, Hitoshi; Sannomiya, Nobuo

    Although there have been many studies on parallel machine scheduling problems, the number of machines operated is fixed in these studies. It is desirable to generate a schedule with fewer machines operated from the viewpoint of the operation cost of machines. In this paper, we cope with a problem of minimizing the number of parallel machines subject to the constraint that the total tardiness is not greater than the value given in advance. For this problem, we introduce a local search method in which the number of machines operated is changed efficiently and appropriately in a short time as well as reducing the total tardiness.

  7. Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method

    Directory of Open Access Journals (Sweden)

    Shahram Saeidi

    2012-09-01

    Full Text Available The process scheduling, is one of the most important tasks of the operating system. One of the most common scheduling algorithms used by the most operating systems is the Round Robin method in which, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice circularly. In this paper, a non-linear programming mathematical model is developed to determine the optimum value of the time quantum, in order to minimize the average waiting time of the processes. The model is implemented and solved by Lingo 8.0 software on four selected problems from the literature.

  8. A novel algorithm combining finite state method and genetic algorithm for solving crude oil scheduling problem.

    Science.gov (United States)

    Duan, Qian-Qian; Yang, Gen-Ke; Pan, Chang-Chun

    2014-01-01

    A hybrid optimization algorithm combining finite state method (FSM) and genetic algorithm (GA) is proposed to solve the crude oil scheduling problem. The FSM and GA are combined to take the advantage of each method and compensate deficiencies of individual methods. In the proposed algorithm, the finite state method makes up for the weakness of GA which is poor at local searching ability. The heuristic returned by the FSM can guide the GA algorithm towards good solutions. The idea behind this is that we can generate promising substructure or partial solution by using FSM. Furthermore, the FSM can guarantee that the entire solution space is uniformly covered. Therefore, the combination of the two algorithms has better global performance than the existing GA or FSM which is operated individually. Finally, a real-life crude oil scheduling problem from the literature is used for conducting simulation. The experimental results validate that the proposed method outperforms the state-of-art GA method.

  9. Automation of a center pivot using the temperature-time-threshold method of irriation scheduling

    Science.gov (United States)

    A center pivot was completely automated using the temperature-time-threshold (TTT) method of irrigation scheduling. An array of infrared thermometers was mounted on the center pivot and these were used to remotely determine the crop leaf temperature as an indicator of crop water stress. We describ...

  10. a Quadtree Organization Construction and Scheduling Method for Urban 3d Model Based on Weight

    Science.gov (United States)

    Yao, C.; Peng, G.; Song, Y.; Duan, M.

    2017-09-01

    The increasement of Urban 3D model precision and data quantity puts forward higher requirements for real-time rendering of digital city model. Improving the organization, management and scheduling of 3D model data in 3D digital city can improve the rendering effect and efficiency. This paper takes the complexity of urban models into account, proposes a Quadtree construction and scheduling rendering method for Urban 3D model based on weight. Divide Urban 3D model into different rendering weights according to certain rules, perform Quadtree construction and schedule rendering according to different rendering weights. Also proposed an algorithm for extracting bounding box extraction based on model drawing primitives to generate LOD model automatically. Using the algorithm proposed in this paper, developed a 3D urban planning&management software, the practice has showed the algorithm is efficient and feasible, the render frame rate of big scene and small scene are both stable at around 25 frames.

  11. Heuristics methods for the flow shop scheduling problem with separated setup times

    Directory of Open Access Journals (Sweden)

    Marcelo Seido Nagano

    2012-06-01

    Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.

  12. A method for generating subtractive cDNA libraries retaining clones containing repetitive elements.

    OpenAIRE

    1997-01-01

    Here we describe a two-stepped photobiotin-based procedure to enrich a target (canine retinal) cDNA library for tissue specific clones without removing those containing repetitive ( SINE ) elements, despite the presence of these elements in the driver population. In a first hybridization excess SINE elements were hybridized to a driver (canine cerebellar) cDNA. In a second hybridization target cDNA was added to this reaction. The resulting cDNA library was enriched for retinal specific clones...

  13. [Evaluation of the risk related to repetitive work activities: testing of several methods proposed in the literature].

    Science.gov (United States)

    Capodaglio, E M; Facioli, M; Bazzini, G

    2001-01-01

    Pathologies due to the repetitive activity of the upper limbs constitutes a growing part of the work-related musculo-skeletal disorders. At the moment, there are no universally accepted and validated methods for the description and assessment of the work-related risks. Yet, the criteria fundamentally characterizing the exposure are rather clear and even. This study reports a practical example of the application of some recent risk assessment methods proposed in the literature, combining objective and subjective measures obtained on the field, with the traditional activity analysis.

  14. Energy-Efficient Node Scheduling Method for Cooperative Target Tracking in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weirong Liu

    2015-01-01

    Full Text Available Using the sensor nodes to achieve target tracking is a challenging problem in resource-limited wireless sensor networks. The tracking nodes are usually required to consume much energy to improve the tracking performance. In this paper, an energy-efficient node scheduling method is proposed to minimize energy consumption while ensuring the tracking accuracy. Firstly, the Kalman-consensus filter is constructed to improve the tracking accuracy and predict the target position. Based on the predicted position, an adaptive node scheduling mechanism is utilized to adjust the sample interval and the number of active nodes dynamically. Rather than using traditional search algorithm, the scheduling problem is decomposed to decouple the sample interval and number of nodes. And the node index is mapped into real domain to get closed-form solution to decide the active nodes. Thus, the NP-complete nature is avoided in the proposed method. The proposed scheduling method can keep the tracking accuracy while minimizing energy consumption. Simulation results validate its effective performance for target tracking in wireless sensor networks.

  15. On the equivalence between the Scheduled Relaxation Jacobi method and Richardson's non-stationary method

    Science.gov (United States)

    Adsuara, J. E.; Cordero-Carrión, I.; Cerdá-Durán, P.; Mewes, V.; Aloy, M. A.

    2017-03-01

    The Scheduled Relaxation Jacobi (SRJ) method is an extension of the classical Jacobi iterative method to solve linear systems of equations (Au = b) associated with elliptic problems. It inherits its robustness and accelerates its convergence rate computing a set of P relaxation factors that result from a minimization problem. In a typical SRJ scheme, the former set of factors is employed in cycles of M consecutive iterations until a prescribed tolerance is reached. We present the analytic form for the optimal set of relaxation factors for the case in which all of them are strictly different, and find that the resulting algorithm is equivalent to a non-stationary generalized Richardson's method where the matrix of the system of equations is preconditioned multiplying it by D = diag (A). Our method to estimate the weights has the advantage that the explicit computation of the maximum and minimum eigenvalues of the matrix A (or the corresponding iteration matrix of the underlying weighted Jacobi scheme) is replaced by the (much easier) calculation of the maximum and minimum frequencies derived from a von Neumann analysis of the continuous elliptic operator. This set of weights is also the optimal one for the general problem, resulting in the fastest convergence of all possible SRJ schemes for a given grid structure. The amplification factor of the method can be found analytically and allows for the exact estimation of the number of iterations needed to achieve a desired tolerance. We also show that with the set of weights computed for the optimal SRJ scheme for a fixed cycle size it is possible to estimate numerically the optimal value of the parameter ω in the Successive Overrelaxation (SOR) method in some cases. Finally, we demonstrate with practical examples that our method also works very well for Poisson-like problems in which a high-order discretization of the Laplacian operator is employed (e.g., a 9- or 17-points discretization). This is of interest since the

  16. Improved methods for scheduling flexible manufacturing systems based on Petri nets and heuristic search

    Institute of Scientific and Technical Information of China (English)

    Bo HUANG; Yamin SUN

    2005-01-01

    This paper proposes and evaluates two improved Petri net (PN)-based hybrid search strategies and their applications to flexible manufacturing system (FMS) scheduling.The algorithms proposed in some previous papers,which combine PN simulation capabilities with A* heuristic search within the PN reachability graph,may not find an optimum solution even with an admissible heuristic function.To remedy the defects an improved heuristic search strategy is proposed,which adopts a different method for selecting the promising markings and reserves the admissibility of the algorithm.To speed up the search process,another algorithm is also proposed which invokes faster termination conditions and still guarantees that the solution found is optimum.The scheduling results are compared through a simple FMS between our algorithms and the previous methods.They are also applied and evaluated in a set of randomly-generated FMSs with such characteristics as multiple resources and alternative routes.

  17. Non-contact thrust stand calibration method for repetitively pulsed electric thrusters.

    Science.gov (United States)

    Wong, Andrea R; Toftul, Alexandra; Polzin, Kurt A; Pearson, J Boise

    2012-02-01

    A thrust stand calibration technique for use in testing repetitively pulsed electric thrusters for in-space propulsion has been developed and tested using a modified hanging pendulum thrust stand. In the implementation of this technique, current pulses are applied to a solenoid to produce a pulsed magnetic field that acts against a permanent magnet mounted to the thrust stand pendulum arm. The force on the magnet is applied in this non-contact manner, with the entire pulsed force transferred to the pendulum arm through a piezoelectric force transducer to provide a time-accurate force measurement. Modeling of the pendulum arm dynamics reveals that after an initial transient in thrust stand motion the quasi-steady average deflection of the thrust stand arm away from the unforced or "zero" position can be related to the average applied force through a simple linear Hooke's law relationship. Modeling demonstrates that this technique is universally applicable except when the pulsing period is increased to the point where it approaches the period of natural thrust stand motion. Calibration data were obtained using a modified hanging pendulum thrust stand previously used for steady-state thrust measurements. Data were obtained for varying impulse bit at constant pulse frequency and for varying pulse frequency. The two data sets exhibit excellent quantitative agreement with each other. The overall error on the linear regression fit used to determine the calibration coefficient was roughly 1%.

  18. Non-Contact Thrust Stand Calibration Method for Repetitively-Pulsed Electric Thrusters

    Science.gov (United States)

    Wong, Andrea R.; Toftul, Alexandra; Polzin, Kurt A.; Pearson, J. Boise

    2011-01-01

    A thrust stand calibration technique for use in testing repetitively-pulsed electric thrusters for in-space propulsion has been developed and tested using a modified hanging pendulum thrust stand. In the implementation of this technique, current pulses are applied to a solenoidal coil to produce a pulsed magnetic field that acts against the magnetic field produced by a permanent magnet mounted to the thrust stand pendulum arm. The force on the magnet is applied in this non-contact manner, with the entire pulsed force transferred to the pendulum arm through a piezoelectric force transducer to provide a time-accurate force measurement. Modeling of the pendulum arm dynamics reveals that after an initial transient in thrust stand motion the quasisteady average deflection of the thrust stand arm away from the unforced or zero position can be related to the average applied force through a simple linear Hooke s law relationship. Modeling demonstrates that this technique is universally applicable except when the pulsing period is increased to the point where it approaches the period of natural thrust stand motion. Calibration data were obtained using a modified hanging pendulum thrust stand previously used for steady-state thrust measurements. Data were obtained for varying impulse bit at constant pulse frequency and for varying pulse frequency. The two data sets exhibit excellent quantitative agreement with each other as the constant relating average deflection and average thrust match within the errors on the linear regression curve fit of the data. Quantitatively, the error on the calibration coefficient is roughly 1% of the coefficient value.

  19. Parallel Branch-and-Bound Methods for the Job Shop Scheduling

    DEFF Research Database (Denmark)

    Clausen, Jens; Perregaard, Michael

    1998-01-01

    Job-shop scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions...... for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study, we focus on parallel methods for solving JSS problems. We implement two different parallel branch-and-bound algorithms...

  20. An SPN analysis method for parallel scheduling in Ad Hoc networks

    Institute of Scientific and Technical Information of China (English)

    盛琳阳; 徐文超; 贾世楼

    2004-01-01

    In this paper, a new analytic method for modeling and evaluating mobile ad hoc networks (MANET)is proposed. Petri nets technique is introduced into MANET and a packet-flow parallel scheduling scheme is presented using Stochastic Petri Nets (SPN). The flowing of tokens is used in graphics mode to characterize dynamical features of sharing a single wireless channel. Through SPN reachability analysis and isomorphic continuous time Markov process equations, some network parameters, such as channel efficiency, one-hop transmission delay etc. , can be obtained. Compared with conventional performance evaluation methods, the above parameters are mathematical expressions instead of test results from a simulator.

  1. Multiple Computing Task Scheduling Method Based on Dynamic Data Replication and Hierarchical Strategy

    Directory of Open Access Journals (Sweden)

    Xiang Zhou

    2014-02-01

    Full Text Available As for the problem of how to carry out task scheduling and data replication effectively in the grid and to reduce task’s execution time, this thesis proposes the task scheduling algorithm and the optimum dynamic data replication algorithm and builds a scheme to effectively combine these two algorithms. First of all, the scheme adopts the ISS algorithm considering the number of tasks waiting queue, the location of task demand data and calculation capacity of site by adopting the method of network structure’s hierarchical scheduling to calculate the cost of comprehensive task with the proper weight efficiency and search out the best compute node area. And then the algorithm of ODHRA is adopted to analyze the data transmission time, memory access latency, waiting copy requests in the queue and the distance between nodes, choose out the best replications location in many copies combined with copy placement and copy management to reduce the file access time. The simulation results show that the proposed scheme compared with other algorithm has better performance in terms of average task execution time. 

  2. Feasibility of High-Repetition, Task-Specific Training for Individuals With Upper-Extremity Paresis

    Science.gov (United States)

    Waddell, Kimberly J.; Birkenmeier, Rebecca L.; Moore, Jennifer L.; Hornby, T. George

    2014-01-01

    OBJECTIVE. We investigated the feasibility of delivering an individualized, progressive, high-repetition upper-extremity (UE) task-specific training protocol for people with stroke in the inpatient rehabilitation setting. METHOD. Fifteen patients with UE paresis participated in this study. Task-specific UE training was scheduled for 60 min/day, 4 days/wk, during occupational therapy for the duration of a participant’s inpatient stay. During each session, participants were challenged to complete ≥300 repetitions of various tasks. RESULTS. Participants averaged 289 repetitions/session, spending 47 of 60 min in active training. Participants improved on impairment and activity level outcome measures. CONCLUSION. People with stroke in an inpatient setting can achieve hundreds of repetitions of task-specific training in 1-hr sessions. As expected, all participants improved on functional outcome measures. Future studies are needed to determine whether this high-repetition training program results in better outcomes than current UE interventions. PMID:25005508

  3. Thermal Unit Commitment Scheduling Problem in Utility System by Tabu Search Embedded Genetic Algorithm Method

    Directory of Open Access Journals (Sweden)

    C. Christober Asir Rajan

    2008-06-01

    Full Text Available The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal unit commitment in the power system for the next H hours. A 66-bus utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 24, 57 and 175 buses. Numerical results are shown comparing the cost solutions and computation time obtained by different intelligence and conventional methods.

  4. Scheduling method based on virtual flattened architecture for Hierarchical system-on-chip

    Institute of Scientific and Technical Information of China (English)

    ZHANG Dong; ZHANG Jin-yi; YANG Xiao-dong; YANG Yi

    2009-01-01

    As the technology of IP-core-reused has been widely used, a lot of intellectual property (IP) cores have been embedded in different layers of system-on-chip (SOC). Although the cycles of development and overhead are reduced by this method, it is a challenge to the SOC test. This paper proposes a scheduling method based on the virtual flattened architecture for hierarchical SOC, which breaks the hierarchical architecture to the virtual flattened one. Moreover, this method has more advantages compared with the traditional one, which tests the parent cores and child cores separately. Finally, the method is verified by the ITC'02 benchmark, and gives good results that reduce the test time and overhead effectively.

  5. A user-oriented resource scheduling method for improving agile software pattern in cloud environment

    Institute of Scientific and Technical Information of China (English)

    龙飞; 杨昌; 荣辉桂; 李建方

    2016-01-01

    The crowdsourcing, as a service pattern in cloud environment, usually aims at the cross-disciplinary cooperation and creating value together with customers and becomes increasingly prevalent. Software process, as a kind of software development and management strategy, is defined as a series of activities implemented by software life cycle and provides a set of rules for various phases of the software engineering to achieve the desired objectives. With the current software development cycle getting shorter, facing more frequent needs change and fierce competition, a new resource management pattern is proposed to respond to these issues agilely by introducing the crowdsourcing service to agile software development for pushing the agility of software process. Then, a user-oriented resource scheduling method is proposed for rational use of various resources in the process and maximizing the benefits of all parties. From the experimental results, the proposed pattern and resources scheduling method reduces greatly the resource of project resource manager and increases the team resource utilization rate, which greatly improves the agility of software process and delivers software products quickly in crowdsourcing pattern.

  6. Manufacturing scheduling systems an integrated view on models, methods and tools

    CERN Document Server

    Framinan, Jose M; Ruiz García, Rubén

    2014-01-01

    The book is devoted to the problem of manufacturing scheduling, which is the efficient allocation of jobs (orders) over machines (resources) in a manufacturing facility. It offers a comprehensive and integrated perspective on the different aspects required to design and implement systems to efficiently and effectively support manufacturing scheduling decisions. Obtaining economic and reliable schedules constitutes the core of excellence in customer service and efficiency in manufacturing operations. Therefore, scheduling forms an area of vital importance for competition in manufacturing companies. However, only a fraction of scheduling research has been translated into practice, due to several reasons. First, the inherent complexity of scheduling has led to an excessively fragmented field in which different sub problems and issues are treated in an independent manner as goals themselves, therefore lacking a unifying view of the scheduling problem. Furthermore, mathematical brilliance and elegance has sometime...

  7. Optimal Scheduling Method of Controllable Loads in DC Smart Apartment Building

    Science.gov (United States)

    Shimoji, Tsubasa; Tahara, Hayato; Matayoshi, Hidehito; Yona, Atsushi; Senjyu, Tomonobu

    2015-12-01

    From the perspective of global warming suppression and the depletion of energy resources, renewable energies, such as the solar collector (SC) and photovoltaic generation (PV), have been gaining attention in worldwide. Houses or buildings with PV and heat pumps (HPs) are recently being used in residential areas widely due to the time of use (TOU) electricity pricing scheme which is essentially inexpensive during middle-night and expensive during day-time. If fixed batteries and electric vehicles (EVs) can be introduced in the premises, the electricity cost would be even more reduced. While, if the occupants arbitrarily use these controllable loads respectively, power demand in residential buildings may fluctuate in the future. Thus, an optimal operation of controllable loads such as HPs, batteries and EV should be scheduled in the buildings in order to prevent power flow from fluctuating rapidly. This paper proposes an optimal scheduling method of controllable loads, and the purpose is not only the minimization of electricity cost for the consumers, but also suppression of fluctuation of power flow on the power supply side. Furthermore, a novel electricity pricing scheme is also suggested in this paper.

  8. CASE STUDY OF THE OPTIMIZING THE AUTOMOTIVE MANUFACTURING SYSTEMS EFFICIENCY VIA APPLYING NEW METHOD OF SCHEDULING

    Directory of Open Access Journals (Sweden)

    Seyedehfarzaneh Nojabaei

    2014-01-01

    Full Text Available Efficiency is becoming a pivotal aspect in each manufacturing system and scheduling plays a crucial role in sustaining it. The applicability of distributed computing to coordinate and execute jobs has been investigated in the past literature. Moreover, it is significant that even for sensitive industrial systems the only criterion of allocating jobs to appropriate machines is the FIFO policy. On the other flip, many researchers are of the opinion that the main reason behind failing to provide fairness in distributed systems is considering the only criterion of time stamp to judge upon and form the queue of jobs with the aim of allocating those jobs to the machines. In order to increase the efficiency of sensitive industrial system, this study takes into consideration of three criteria of each job including priority, time action and time stamp. The methodology adopted by this study is definition of job scheduler and positioning jobs in temporary queue and sorting via developing bubble sort. In sorting algorithm criterion of priority, time action should be considered besides time stamp to recognize the tense jobs for processing earlier. To evaluate this algorithm first a numerical test case (simulation is programmed and then the case study performing in order to optimize efficiency of applying this method in real manufacturing system. Eventually the results of this study provided evidence on that the rate of efficiency is increased.

  9. An UAV scheduling and planning method for post-disaster survey

    Science.gov (United States)

    Li, G. Q.; Zhou, X. G.; Yin, J.; Xiao, Q. Y.

    2014-11-01

    Annually, the extreme climate and special geological environments lead to frequent natural disasters, e.g., earthquakes, floods, etc. The disasters often bring serious casualties and enormous economic losses. Post-disaster surveying is very important for disaster relief and assessment. As the Unmanned Aerial Vehicle (UAV) remote sensing with the advantage of high efficiency, high precision, high flexibility, and low cost, it is widely used in emergency surveying in recent years. As the UAVs used in emergency surveying cannot stop and wait for the happening of the disaster, when the disaster happens the UAVs usually are working at everywhere. In order to improve the emergency surveying efficiency, it is needed to track the UAVs and assign the emergency surveying task for each selected UAV. Therefore, a UAV tracking and scheduling method for post-disaster survey is presented in this paper. In this method, Global Positioning System (GPS), and GSM network are used to track the UAVs; an emergency tracking UAV information database is built in advance by registration, the database at least includes the following information, e.g., the ID of the UAVs, the communication number of the UAVs; when catastrophe happens, the real time location of all UAVs in the database will be gotten using emergency tracking method at first, then the traffic cost time for all UAVs to the disaster region will be calculated based on the UAVs' the real time location and the road network using the nearest services analysis algorithm; the disaster region is subdivided to several emergency surveying regions based on DEM, area, and the population distribution map; the emergency surveying regions are assigned to the appropriated UAV according to shortest cost time rule. The UAVs tracking and scheduling prototype is implemented using SQLServer2008, ArcEnginge 10.1 SDK, Visual Studio 2010 C#, Android, SMS Modem, and Google Maps API.

  10. A Component Based Heuristic Search method with Adaptive Perturbations for Hospital Personnel Scheduling

    CERN Document Server

    Li, Jingpeng; Burke, Edmund

    2008-01-01

    Nurse rostering is a complex scheduling problem that affects hospital personnel on a daily basis all over the world. This paper presents a new component-based approach with adaptive perturbations, for a nurse scheduling problem arising at a major UK hospital. The main idea behind this technique is to decompose a schedule into its components (i.e. the allocated shift pattern of each nurse), and then mimic a natural evolutionary process on these components to iteratively deliver better schedules. The worthiness of all components in the schedule has to be continuously demonstrated in order for them to remain there. This demonstration employs a dynamic evaluation function which evaluates how well each component contributes towards the final objective. Two perturbation steps are then applied: the first perturbation eliminates a number of components that are deemed not worthy to stay in the current schedule; the second perturbation may also throw out, with a low level of probability, some worthy components. The eli...

  11. Multi-Agent Based Beam Search for Real-Time Production Scheduling and Control Method, Software and Industrial Application

    CERN Document Server

    Kang, Shu Gang

    2013-01-01

    The Multi-Agent Based Beam Search (MABBS) method systematically integrates four major requirements of manufacturing production - representation capability, solution quality, computation efficiency, and implementation difficulty - within a unified framework to deal with the many challenges of complex real-world production planning and scheduling problems. Multi-agent Based Beam Search for Real-time Production Scheduling and Control introduces this method, together with its software implementation and industrial applications.  This book connects academic research with industrial practice, and develops a practical solution to production planning and scheduling problems. To simplify implementation, a reusable software platform is developed to build the MABBS method into a generic computation engine.  This engine is integrated with a script language, called the Embedded Extensible Application Script Language (EXASL), to provide a flexible and straightforward approach to representing complex real-world problems. ...

  12. Nonstandard Work Schedules, Couple Desynchronization, and Parent-Child Interaction : A Mixed-Methods Analysis

    NARCIS (Netherlands)

    Taeht, Kadri; Mills, Melinda

    Many children live in households where either one or both parents work nonstandard schedules in the evening, night, or weekend. This study tests two competing hypotheses of whether nonstandard schedules result in lower levels of parent-child interaction or in more time with children. Using the first

  13. Application of Approximation Full-Load Distribution Method to Pass Scheduling on Plate Mill With Hydro-Bending System

    Institute of Scientific and Technical Information of China (English)

    HU Xian-lei; ZHANG Qi-sheng; ZHAO Zhong; TIAN Yong; LIU Xiang-hua; WANG Guo-dong

    2006-01-01

    The influence of positive bending system on plate crown control was researched. The approximation full-load distribution method for pass scheduling was put forward. This method can not only make full use of the mill capacity with decreased pass number, but also give quality product of excellent flatness.

  14. IOPS advisor: Research in progress on knowledge-intensive methods for irregular operations airline scheduling

    Science.gov (United States)

    Borse, John E.; Owens, Christopher C.

    1992-01-01

    Our research focuses on the problem of recovering from perturbations in large-scale schedules, specifically on the ability of a human-machine partnership to dynamically modify an airline schedule in response to unanticipated disruptions. This task is characterized by massive interdependencies and a large space of possible actions. Our approach is to apply the following: qualitative, knowledge-intensive techniques relying on a memory of stereotypical failures and appropriate recoveries; and quantitative techniques drawn from the Operations Research community's work on scheduling. Our main scientific challenge is to represent schedules, failures, and repairs so as to make both sets of techniques applicable to the same data. This paper outlines ongoing research in which we are cooperating with United Airlines to develop our understanding of the scientific issues underlying the practicalities of dynamic, real-time schedule repair.

  15. Effects of gain-scheduling methods in a classical wind turbine controller on wind turbine aeroservoelastic modes and loads

    DEFF Research Database (Denmark)

    Tibaldi, Carlo; Henriksen, Lars Christian; Hansen, Morten Hartvig

    2014-01-01

    The eects of dierent gain-scheduling methods for a classical wind turbine controller, operating in full load region, on the wind turbine aeroservoelastic modes and loads are investigated in this work. The dierent techniques are derived looking at the physical problem to take into account the chan......The eects of dierent gain-scheduling methods for a classical wind turbine controller, operating in full load region, on the wind turbine aeroservoelastic modes and loads are investigated in this work. The dierent techniques are derived looking at the physical problem to take into account...

  16. An Optimization-oriented Simulation-based Job Shop Scheduling Method with Four Parameters Using Pattern Search

    Science.gov (United States)

    Arakawa, Masahiro; Fuyuki, Masahiko; Inoue, Ichiro

    Aiming at the elimination of tardy jobs in a job shop production schedule, an optimization-oriented simulation-based scheduling (OSBS) method incorporating capacity adjustment function is proposed. In order to determine the pertinent additional capacities and to control job allocations simultaneously the proposed method incorporates the parameter-space search improvement (PSSI) method into the scheduling procedure. In previous papers, we have introduced four parameters; two of them are used to control the upper limit to the additional capacity and the balance of the capacity distribution among machines, while the others are used to control the job allocation procedure. We found that a ‘direct' optimization procedure which uses the enumeration method produces a best solution with practical significance, but it takes too much computation time for practical use. In this paper, we propose a new method which adopts a pattern search method in the schedule generation procedure to obtain an approximate optimal solution. It is found that the computation time becomes short enough for a practical use. Moreover, the extension of the parameter domain yields an approximate optimal solution which is better than the best solution obtained by the ‘direct' optimization.

  17. Feedback shape control for deployable mesh reflectors using gain scheduling method

    Science.gov (United States)

    Xie, Yangmin; Shi, Hang; Alleyne, Andrew; Yang, Bingen

    2016-04-01

    This paper presents a theoretical study on the dynamic shape control problem of deployable mesh reflectors (DMRs) via feedback approaches. The reflector structure is simplified from a nonlinear model to be quasi-static with respect to temperature variations but dynamic with respect to mechanical vibrations. The orbital cycle is segmented into multiple temperature zones, and an H∞ robust state feedback controller is designed for each zone to guarantee the local stability of the system under the model uncertainty caused by thermal effects and to reject external force disturbances. At the same time, gain scheduling control method is adopted to compensate thermal distortions and to ensure smooth transition response when switching among the local robust controllers. A DMR model is considered in the case study to show the effectiveness of the control approach. The structural vibrations caused by external force disturbances can be sufficiently suppressed in a much shorter time. The closed loop response of the DMR structure shows that much higher surface accuracy is obtained during the orbiting mission compared to the open-loop configuration, and transient focal length and transient de-focus of the reflector are well controlled within the satisfactory bounds, demonstrating the numerical feasibility of the proposed method to solve the dynamic shape control problem of DMRs.

  18. Application of predictive control scheduling method to real-time periodic control tasks overrun

    Institute of Scientific and Technical Information of China (English)

    SHEN Qing; GUI Wei-hua; YANG Chun-hua; YANG Tie-jun

    2007-01-01

    Based on the abort strategy of fixed periods, a novel predictive control scheduling methodology was proposed to efficiently solve overrun problems. By applying the latest control value in the prediction sequences to the control objective, the new strategy was expected to optimize the control system for better performance and yet guarantee the schedulability of all tasks under overrun. The schedulability of the real-time systems with p-period overruns was analyzed, and the corresponding stability criteria was given as well. The simulation results show that the new approach can improve the performance of control system compared to that of conventional abort strategy, it can reduce the overshoot and adjust time as well as ensure the schedulability and stability.

  19. Reinforcement learning in scheduling

    Science.gov (United States)

    Dietterich, Tom G.; Ok, Dokyeong; Zhang, Wei; Tadepalli, Prasad

    1994-01-01

    The goal of this research is to apply reinforcement learning methods to real-world problems like scheduling. In this preliminary paper, we show that learning to solve scheduling problems such as the Space Shuttle Payload Processing and the Automatic Guided Vehicle (AGV) scheduling can be usefully studied in the reinforcement learning framework. We discuss some of the special challenges posed by the scheduling domain to these methods and propose some possible solutions we plan to implement.

  20. A Dynamic Job Shop Scheduling Method Based on Ant Colony Coordination System

    Institute of Scientific and Technical Information of China (English)

    ZHU Qiong; WU Li-hui; ZHANG Jie

    2009-01-01

    Due to the stubborn nature of dynamic job shop scheduling problem, a novel ant colony coordination mechanism is proposed in this paper to search for an optimal schedule in dynamic environment. In ant colony coordination mechanism, the dynamic .job shop is composed of several autonomous ants. These ants coordinate with each other by simulating the ant foraging behavior of spreading pheromone on the trails, by which they can make information available globally, and further more guide ants make optimal decisions. The proposed mechanism is tested by several instances and the results confirm the validity of it.

  1. The role of scheduled second TACE in early-stage hepatocellular carcinoma with complete response to initial TACE

    Directory of Open Access Journals (Sweden)

    Jung Hee Kim

    2017-03-01

    Full Text Available Background/Aims We investigated the outcomes of early-stage hepatocellular carcinoma (HCC patients who showed a complete response (CR to initial transarterial chemoembolization (TACE, with a focus on the role of scheduled TACE repetition. Methods A total of 178 patients with early-stage HCC who were initially treated with TACE and showed a CR based on the modified Response Evaluation Criteria in Solid Tumors (mRECIST criteria on one month follow-up computed tomography (CT were analyzed. Among them, 90 patients underwent scheduled repetition of TACE in the absence of viable tumor on CT. Results During a median follow-up period of 4.6 years (range: 0.4-8.8 years, mortality was observed in 71 patients (39.9%. The overall recurrence-free and local recurrence-free survival rates at 1 year were 44.4% and 56.2%. In the multivariable model, scheduled repetition of TACE was an independent factor associated with survival (hazard ratio [95% confidence interval]: 0.56 [0.34-0.93], P=0.025. When stratified using Barcelona clinic liver cancer (BCLC stage, scheduled repetition of TACE was associated with a favorable survival rate in BCLC stage A patients, but not in BCLC 0 patients. Conclusions Scheduled repetition of TACE was associated with better survival for early-stage HCC patients showing a CR after initial TACE, especially in BCLC stage A patients.

  2. A New Method to Improve Round Robin Scheduling Algorithm with Quantum Time Based on Harmonic-Arithmetic Mean (HARM

    Directory of Open Access Journals (Sweden)

    Ashkan Emami Ale Agha

    2013-06-01

    Full Text Available One of the most important concepts in multi programming Operating Systems is scheduling. It helps in choosing the processes for execution. Round robin method is one of the most important algorithms in scheduling. It is the most popular algorithm due to its fairness and starvation free nature towards the processes, which is achieved by using proper quantum time. The main challenge in this algorithm is selection of quantum time. This parameter affects on average Waiting Time and average Turnaround Time in execution queue. As the quantum time is static, it causes less context switching in case of high quantum time and high context switching in case of less quantum time. Increasing context switch leads to high average waiting time, high average turnaround time which is an overhead and degrades the system performance. With respect to these points, the algorithms should calculate proper value for the quantum time. Two main classes of algorithms that are proposed to calculate the quantum time include static and dynamic methods. In static methods quantum time is fixed during the scheduling. Dynamic algorithms are one of these methods that change the value of quantum time in each cycle. For example in one method the value of quantum time in each cycle is equal to the median of burst times of processes in ready queue and for another method this value is equal to arithmetic mean of burst times of ready processes.In this paper we proposed a new method to obtaining quantum time in each cycle based on arithmetic-harmonic mean (HARM. Harmonic mean is calculated by dividing the number of observations by the reciprocal of each number in the series. With examples we show that in some cases it can provides better scheduling criteria and improves the average Turnaround Time and average Waiting Time.

  3. CP Methods for Scheduling and Routing with Time-Dependent Task Costs

    DEFF Research Database (Denmark)

    Tierney, Kevin; Kelareva, Elena; Kilby, Philip

    2013-01-01

    A particularly difficult class of scheduling and routing problems in- volves an objective that is a sum of time-varying action costs, which increases the size and complexity of the problem. Solve-and-improve approaches, which find an initial solution for a simplified model and improve it using...... a cost function, and Mixed Integer Programming (MIP) are often used for solving such problems. However, Constraint Programming (CP), particularly with Lazy Clause Genera- tion (LCG), has been found to be faster than MIP for some scheduling problems with time-varying action costs. In this paper, we...... compare CP and LCG against a solve-and-improve approach for two recently introduced problems in maritime logistics with time-varying action costs: the Liner Shipping Fleet Repositioning Problem (LSFRP) and the Bulk Port Cargo Throughput Optimisation Problem (BPCTOP). We present a novel CP model...

  4. Developing a new method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources

    Directory of Open Access Journals (Sweden)

    Aidin Delgoshaei

    2016-09-01

    Full Text Available The issue of resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating is frequently seen after initial scheduling of a project in practice and causes significant amount of efforts to modify the initial schedules. In this research, a new method is developed for modifying over-allocated schedules in a multi-mode resource constrained project scheduling problems (MRCPSPs with positive cash flows (MRCPSP-PCF. The aim is to maximize profit of the MRCPSPs or logically minimizing costs. The proposed method can be used as a macro in Microsoft Office Project® Software to modify resource over-allocated days after scheduling a project. This research considers progress payment method and preemptive resources. The proposed approach maximizes profit by scheduling activities through the resource calendar respecting to the available level of preemptive resources and activity numbers. To examine the performance of the proposed method a number of experiments derived from the literature are solved. The results are then compared with the circumstances where resource constraints are relaxed. The outcomes show that in all studied cases, the proposed algorithm can provide modified schedules with no over-allocated days. Afterward the method is applied to modify a manufacturing project in practice.

  5. Project scheduling method with time using MRP system – A case study: Construction project in Libya

    Directory of Open Access Journals (Sweden)

    Abdallah Ali Imetieg

    2015-04-01

    Full Text Available Materials Requirements and Planning (MRP is a system of production planning and inventory control, which is used to manage manufacturing processes. Most MRP systems are software-based and are used to ensure that the materials are available for production, that the products are available for delivery to customers, that the lowest possible material and product level is maintained in store, as well as to plan delivery schedules and purchasing activities. Upon completion of scheduling, begins the process of follow-up, which includes the achievement of the project goals in terms of quantity, quality and costs in accordance with deadlines. MRP system was applied to project of 5000 housing units in Solug area, which is close to Benghazi city, Libya, with the aim to provide necessary cash flow to pay dues on time without delay to all involved project sub-contractors and material suppliers, to ensure the smooth flow of operations, as well as to diminish costs by reduction of temporary storages and rented areas. There is a correlation between time and cost of each activity. If the required time is shorter than the scheduled time of the certain activity, it would demand more resources, which further leads to the increase in direct costs of the given activity. Therefore, the output of MRP is important since commands are issued through planning in order to launch the suggested orders with the required quantities and within the limited time period.

  6. Systematic Evaluation of Stochastic Methods in Power System Scheduling and Dispatch with Renewable Energy

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Yishen [Univ. of Washington, Seattle, WA (United States); Argonne National Lab. (ANL), Argonne, IL (United States); Zhou, Zhi [Argonne National Lab. (ANL), Argonne, IL (United States); Liu, Cong [Argonne National Lab. (ANL), Argonne, IL (United States); Electric Reliability Council of Texas (ERCOT), Austin, TX (United States); Botterud, Audun [Argonne National Lab. (ANL), Argonne, IL (United States)

    2016-08-01

    As more wind power and other renewable resources are being integrated into the electric power grid, the forecast uncertainty brings operational challenges for the power system operators. In this report, different operational strategies for uncertainty management are presented and evaluated. A comprehensive and consistent simulation framework is developed to analyze the performance of different reserve policies and scheduling techniques under uncertainty in wind power. Numerical simulations are conducted on a modified version of the IEEE 118-bus system with a 20% wind penetration level, comparing deterministic, interval, and stochastic unit commitment strategies. The results show that stochastic unit commitment provides a reliable schedule without large increases in operational costs. Moreover, decomposition techniques, such as load shift factor and Benders decomposition, can help in overcoming the computational obstacles to stochastic unit commitment and enable the use of a larger scenario set to represent forecast uncertainty. In contrast, deterministic and interval unit commitment tend to give higher system costs as more reserves are being scheduled to address forecast uncertainty. However, these approaches require a much lower computational effort Choosing a proper lower bound for the forecast uncertainty is important for balancing reliability and system operational cost in deterministic and interval unit commitment. Finally, we find that the introduction of zonal reserve requirements improves reliability, but at the expense of higher operational costs.

  7. Novel Method of Unambiguous Moving Target Detection in Pulse-Doppler Radar with Random Pulse Repetition Interval

    Directory of Open Access Journals (Sweden)

    Liu Zhen

    2012-03-01

    Full Text Available Blind zones and ambiguities in range and velocity measurement are two important issues in traditional pulse-Doppler radar. By generating random deviations with respect to a mean Pulse Repetition Interval (PRI, this paper proposes a novel algorithm of Moving Target Detection (MTD based on the Compressed Sensing (CS theory, in which the random deviations of the PRIare converted to the Restricted Isometry Property (RIP of the observing matrix. The ambiguities of range and velocity are eliminated by designing the signal parameters. The simulation results demonstrate that this scheme has high performance of detection, and there is no ambiguity and blind zones as well. It can also shorten the coherent processing interval compared to traditional staggered PRI mode because only one pulse train is needed instead of several trains.

  8. Safety and Efficacy of Tree Pollen Specific Immunotherapy on the Ultrarush Administration Schedule Method Using Purethal Trees

    Directory of Open Access Journals (Sweden)

    Andrzej Bozek

    2014-01-01

    Full Text Available Background. Specific immunotherapy (SIT with an ultrarush administration schedule with Purethal for tree pollen allergens has been evaluated to assess its efficacy and safety. Methods. The study group consisted of 22 patients with symptoms of allergic rhinitis and confirmed allergy to tree pollens. Patients were randomized and given an administration schedule of either ultrarush therapy or conventional preseasonal SIT. Treatment was performed during three consecutive years. Results. After three years of treatment, a similar reduction in nasal symptoms was observed; according to the visual analog scale, there was a decrease from 3.991 ± 0.804 points to 1.634 ± 0.540 in the ultrarush group and from 3.845 ± 0.265 to 1.501 ± 0.418 in the group desensitized using the conventional method (P>0.05. There was also a comparable reduction in the use of relief drugs during pollen season and an increase in the serum concentration of IgG4 to tree pollens. No significant differences in the safety profile were observed. Conclusion. An administration schedule of ultrarush SIT with Purethal Trees is a safe treatment in preliminary observations. This therapy is comparable with conventional administration of SIT in the field of efficacy and safety.

  9. A Model and Solution Method for Solving the Real-world and Complex Problem of Scheduling Visits to Customers

    Directory of Open Access Journals (Sweden)

    M.G. Baldoquin de la Peña

    2014-06-01

    Full Text Available Some of the complex logistical problems faced by companies combine the needs for strategic and tactical decisions concerning the interrelated issues of clustering, scheduling, and routing. Various strategies can be used to solve these problems. We present a problem of this type, involving a company whose fundamental objective is the commercialization of its product in the domestic market. The paper focuses on a model of and method for a solution to the problem of scheduling visits to customers, taking into account the relationship with other phases of product marketing. The model is nonlinear, involves binary and continuous variables, and solved heuristically. Computational experiments show that the proposed solution performed very well for both real-life and theoretical instances.

  10. Mycobacterium avium restriction fragment lenght polymorphism-IS IS1245 and the simple double repetitive element polymerase chain reaction typing method to screen genetic diversity in Brazilian strains

    Directory of Open Access Journals (Sweden)

    Patrícia Carvalho de Sequeira

    2005-11-01

    Full Text Available Simple double repetitive element polymerase chain reaction (MaDRE-PCR and Pvu II-IS1245 restriction fragment length polymorphism (RFLP typing methods were used to type 41 Mycobacterium avium isolates obtained from 14 Aids inpatients and 10 environment and animals specimens identified among 53 mycobacteria isolated from 237 food, chicken, and pig. All environmental and animals strains showed orphan patterns by both methods. By MaDRE-PCR four patients, with multiple isolates, showed different patterns, suggesting polyclonal infection that was confirmed by RFLP in two of them. This first evaluation of MaDRE-PCR on Brazilian M. avium strains demonstrated that the method seems to be useful as simple and less expensive typing method for screening genetic diversity in M. avium strains on selected epidemiological studies, although with limitation on analysis identical patterns except for one band.

  11. A new method on hydrothermal scheduling optimization in electric power market

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The hydrothermal scheduling in the electric power market becomes difficult because of introducing competition and considering sorts of constraints. An augmented Lagrangian approach is adopted to solve the problem, which adds to the standard Lagrangian function a quadratic penalty term without changing its dual property, and reduces the oscillation in iterations. According to the theory of large system coordination and decomposition, the problem is divided into hydro sub-problem and thermal sub-problem, which are coordinated by updating the Lagrangian multipliers, then the optimal solution is obtained. Our results for a test system show that the augmented Lagrangian approach can make the problem converge into the optimal solution quickly.

  12. Safety and efficacy of tree pollen specific immunotherapy on the ultrarush administration schedule method using purethal trees.

    Science.gov (United States)

    Bozek, Andrzej; Kolodziejczyk, Krzysztof; Jarzab, Jerzy

    2014-01-01

    Specific immunotherapy (SIT) with an ultrarush administration schedule with Purethal for tree pollen allergens has been evaluated to assess its efficacy and safety. The study group consisted of 22 patients with symptoms of allergic rhinitis and confirmed allergy to tree pollens. Patients were randomized and given an administration schedule of either ultrarush therapy or conventional preseasonal SIT. Treatment was performed during three consecutive years. After three years of treatment, a similar reduction in nasal symptoms was observed; according to the visual analog scale, there was a decrease from 3.991 ± 0.804 points to 1.634 ± 0.540 in the ultrarush group and from 3.845 ± 0.265 to 1.501 ± 0.418 in the group desensitized using the conventional method (P > 0.05). There was also a comparable reduction in the use of relief drugs during pollen season and an increase in the serum concentration of IgG4 to tree pollens. No significant differences in the safety profile were observed. An administration schedule of ultrarush SIT with Purethal Trees is a safe treatment in preliminary observations. This therapy is comparable with conventional administration of SIT in the field of efficacy and safety.

  13. Evaluation of Selected Resource Allocation and Scheduling Methods in Heterogeneous Many-Core Processors and Graphics Processing Units

    Directory of Open Access Journals (Sweden)

    Ciznicki Milosz

    2014-12-01

    Full Text Available Heterogeneous many-core computing resources are increasingly popular among users due to their improved performance over homogeneous systems. Many developers have realized that heterogeneous systems, e.g. a combination of a shared memory multi-core CPU machine with massively parallel Graphics Processing Units (GPUs, can provide significant performance opportunities to a wide range of applications. However, the best overall performance can only be achieved if application tasks are efficiently assigned to different types of processor units in time taking into account their specific resource requirements. Additionally, one should note that available heterogeneous resources have been designed as general purpose units, however, with many built-in features accelerating specific application operations. In other words, the same algorithm or application functionality can be implemented as a different task for CPU or GPU. Nevertheless, from the perspective of various evaluation criteria, e.g. the total execution time or energy consumption, we may observe completely different results. Therefore, as tasks can be scheduled and managed in many alternative ways on both many-core CPUs or GPUs and consequently have a huge impact on the overall computing resources performance, there are needs for new and improved resource management techniques. In this paper we discuss results achieved during experimental performance studies of selected task scheduling methods in heterogeneous computing systems. Additionally, we present a new architecture for resource allocation and task scheduling library which provides a generic application programming interface at the operating system level for improving scheduling polices taking into account a diversity of tasks and heterogeneous computing resources characteristics.

  14. Molecular Fingerprinting of Mycobacterium tuberculosis Isolates Obtained in Havana, Cuba, by IS6110 Restriction Fragment Length Polymorphism Analysis and by the Double-Repetitive-Element PCR Method

    Science.gov (United States)

    Montoro, Ernesto; Valdivia, José; Leão, Sylvia Cardoso

    1998-01-01

    Mycobacterium tuberculosis sputum isolates from 38 patients, obtained in the first 6 months of 1997 in Havana, Cuba, were characterized by IS6110 restriction fragment length polymorphism (RFLP) analysis and the double-repetitive-element PCR (DRE-PCR) method. Among 41 strains from 38 patients, 24 and 25 unique patterns, and 5 and 4 cluster patterns, were found by the RFLP and DRE-PCR methods, respectively. Patients within two of these clusters were found to be epidemiologically related, while no relation was observed in patients in the other clusters. The DRE-PCR method is rapid, and it was as discriminating as IS6110 RFLP analysis in identifying an epidemiological association. Its simplicity makes the technique accessible for subtyping of M. tuberculosis strains in laboratories not equipped to perform RFLP analysis. PMID:9738082

  15. A Decision Support Method for Truck Scheduling and Storage Allocation Problem at Container

    Institute of Scientific and Technical Information of China (English)

    CAO Jinxin; SHI Oixin; Der-Horng Lee

    2008-01-01

    Truck scheduling and storage allocation, as two separate subproblems in port operations, have been deeply studied in past decades. However, from the operational point of view, they are highly interde-pendent. Storage allocation for import containers has to balance the travel time and queuing time of each container in yard. This paper proposed an integer programming model handling these two problems as a whole. The objective of this model is to reduce congestion and waiting time of container trucks in the termi-nal so as to decrease the makespan of discharging containers. Due to the inherent complexity of the prob-lem, a genetic algorithm and a greedy heuristic algorithm are designed to attain near optimal solutions. It shows that the heuristic algorithm can achieve the optimal solution for small-scale problems. The solutions of small- and large-scale problems obtained from the heuristic algorithm are better than those from the ge-netic algorithm.

  16. Relation of Chaos equation to the Schedule for the evaluation of individual Quality of Life-direct Weighting Method

    OpenAIRE

    Hideaki Yanagisawa

    2014-01-01

    The SEIQoL-DW (Schedule for the Evaluation of Individual Quality of Life-Direct Weighting) method may be misused because of lack of confirmation by scientific theory. It is compared with the representative chaos equation. Y (n + 1) = p [1 – Y (n)] Y (n) The Z (m) axis is perpendicular to the "p" and Y (n) axes. Z (m + 1) = p [1 – Z (m)] Z (m) From both equations, a three dimensional logistic map is imagined. [Y (n + 1) / Z (m + 1)] = [1 – Y (n)] Y (n) / [1 – Z (m)] Z (m) Acc...

  17. Deadlock-free genetic scheduling algorithm for automated manufacturing systems based on deadlock control policy.

    Science.gov (United States)

    Xing, KeYi; Han, LiBin; Zhou, MengChu; Wang, Feng

    2012-06-01

    Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly.

  18. Repetitive maladaptive behavior: beyond repetition compulsion.

    Science.gov (United States)

    Bowins, Brad

    2010-09-01

    Maladaptive behavior that repeats, typically known as repetition compulsion, is one of the primary reasons that people seek psychotherapy. However, even with psychotherapeutic advances it continues to be extremely difficult to treat. Despite wishes and efforts to the contrary repetition compulsion does not actually achieve mastery, as evidenced by the problem rarely resolving without therapeutic intervention, and the difficulty involved in producing treatment gains. A new framework is proposed, whereby such behavior is divided into behavior of non-traumatic origin and traumatic origin with some overlap occurring. Repetitive maladaptive behavior of non-traumatic origin arises from an evolutionary-based process whereby patterns of behavior frequently displayed by caregivers and compatible with a child's temperament are acquired and repeated. It has a familiarity and ego-syntonic aspect that strongly motivates the person to retain the behavior. Repetitive maladaptive behavior of traumatic origin is characterized by defensive dissociation of the cognitive and emotional components of trauma, making it very difficult for the person to integrate the experience. The strong resistance of repetitive maladaptive behavior to change is based on the influence of both types on personality, and also factors specific to each. Psychotherapy, although very challenging at the best of times, can achieve the mastery wished and strived for, with the aid of several suggestions provided.

  19. Satellite range scheduling with the priority constraint: An improved genetic algorithm using a station ID encoding method

    Directory of Open Access Journals (Sweden)

    Li Yuqing

    2015-06-01

    Full Text Available Satellite range scheduling with the priority constraint is one of the most important problems in the field of satellite operation. This paper proposes a station coding based genetic algorithm to solve this problem, which adopts a new chromosome encoding method that arranges tasks according to the ground station ID. The new encoding method contributes to reducing the complexity in conflict checking and resolving, and helps to improve the ability to find optimal resolutions. Three different selection operators are designed to match the new encoding strategy, namely random selection, greedy selection, and roulette selection. To demonstrate the benefits of the improved genetic algorithm, a basic genetic algorithm is designed in which two cross operators are presented, a single-point crossover and a multi-point crossover. For the purpose of algorithm test and analysis, a problem-generating program is designed, which can simulate problems by modeling features encountered in real-world problems. Based on the problem generator, computational results and analysis are made and illustrated for the scheduling of multiple ground stations.

  20. An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

    Science.gov (United States)

    Rash, James

    2014-01-01

    NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial

  1. Distributed scheduling

    OpenAIRE

    Toptal, Ayşegül

    1999-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent Univ., 1999. Thesis (Master's) -- Bilkent University, 1999. Includes bibliographical references. Distributed Scheduling (DS) is a new paradigm that enables the local decisionmakers make their own schedules by considering local objectives and constraints within the boundaries and the overall objective of the whole system. Local schedules from different parts of the system are...

  2. Personnel scheduling

    OpenAIRE

    Vanden Berghe, Greet

    2012-01-01

    Personnel scheduling can become a particularly difficult optimisation problem due to human factors. And yet: people working in healthcare, transportation and other round the clock service regimes perform their duties based on a schedule that was often manually constructed. The unrewarding manual scheduling task deserves more attention from the timetabling community so as to support computation of fair and good quality results. The present abstract touches upon a set of particular characterist...

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

    NARCIS (Netherlands)

    Oostrum, van J.M.; Houdenhoven, van M.; Hurink, J.L.; Hans, E.W.; Wullink, G.; 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 t

  4. Grammatical Change through Repetition.

    Science.gov (United States)

    Arevart, Supot

    1989-01-01

    The effect of repetition on grammatical change in an unrehearsed talk is examined based on a case study of a single learner. It was found that repetition allows for accuracy monitoring in that errors committed in repeated contexts undergo correction. Implications for teaching are discussed. (23 references) (LB)

  5. The Negative Repetition Effect

    Science.gov (United States)

    Mulligan, Neil W.; Peterson, Daniel J.

    2013-01-01

    A fundamental property of human memory is that repetition enhances memory. Peterson and Mulligan (2012) recently documented a surprising "negative repetition effect," in which participants who studied a list of cue-target pairs twice recalled fewer targets than a group who studied the pairs only once. Words within a pair rhymed, and…

  6. Roles of repetitive sequences

    Energy Technology Data Exchange (ETDEWEB)

    Bell, G.I.

    1991-12-31

    The DNA of higher eukaryotes contains many repetitive sequences. The study of repetitive sequences is important, not only because many have important biological function, but also because they provide information on genome organization, evolution and dynamics. In this paper, I will first discuss some generic effects that repetitive sequences will have upon genome dynamics and evolution. In particular, it will be shown that repetitive sequences foster recombination among, and turnover of, the elements of a genome. I will then consider some examples of repetitive sequences, notably minisatellite sequences and telomere sequences as examples of tandem repeats, without and with respectively known function, and Alu sequences as an example of interspersed repeats. Some other examples will also be considered in less detail.

  7. Roles of repetitive sequences

    Energy Technology Data Exchange (ETDEWEB)

    Bell, G.I.

    1991-12-31

    The DNA of higher eukaryotes contains many repetitive sequences. The study of repetitive sequences is important, not only because many have important biological function, but also because they provide information on genome organization, evolution and dynamics. In this paper, I will first discuss some generic effects that repetitive sequences will have upon genome dynamics and evolution. In particular, it will be shown that repetitive sequences foster recombination among, and turnover of, the elements of a genome. I will then consider some examples of repetitive sequences, notably minisatellite sequences and telomere sequences as examples of tandem repeats, without and with respectively known function, and Alu sequences as an example of interspersed repeats. Some other examples will also be considered in less detail.

  8. Scheduling Supercomputers.

    Science.gov (United States)

    1983-02-01

    no task is scheduled with overlap. Let numpi be the total number of preemptions and idle slots of size at most to that are introduced. We see that if...no usable block remains on Qm-*, then numpi < m-k. Otherwise, numpi ! m-k-1. If j>n when this procedure terminates, then all tasks have been scheduled

  9. Mapping of Primary Instructional Methods and Teaching Techniques for Regularly Scheduled, Formal Teaching Sessions in an Anesthesia Residency Program

    DEFF Research Database (Denmark)

    Vested Madsen, Matias; Macario, Alex; Yamamoto, Satoshi

    2016-01-01

    In this study, we examined the regularly scheduled, formal teaching sessions in a single anesthesiology residency program to (1) map the most common primary instructional methods, (2) map the use of 10 known teaching techniques, and (3) assess if residents scored sessions that incorporated active......; range, 0-9). Clinical applicability (85%) and attention grabbers (85%) were the 2 most common teaching techniques. Thirty-eight percent of the sessions defined learning objectives, and one-third of sessions engaged in active learning. The overall survey response rate equaled 42%, and passive sessions...... learning as higher quality than sessions with little or no verbal interaction between teacher and learner. A modified Delphi process was used to identify useful teaching techniques. A representative sample of each of the formal teaching session types was mapped, and residents anonymously completed a 5...

  10. Repetition and Translation Shifts

    Directory of Open Access Journals (Sweden)

    Simon Zupan

    2006-06-01

    Full Text Available Repetition manifests itself in different ways and at different levels of the text. The first basic type of repetition involves complete recurrences; in which a particular textual feature repeats in its entirety. The second type involves partial recurrences; in which the second repetition of the same textual feature includes certain modifications to the first occurrence. In the article; repetitive patterns in Edgar Allan Poe’s short story “The Fall of the House of Usher” and its Slovene translation; “Konec Usherjeve hiše”; are compared. The author examines different kinds of repetitive patterns. Repetitions are compared at both the micro- and macrostructural levels. As detailed analyses have shown; considerable microstructural translation shifts occur in certain types of repetitive patterns. Since these are not only occasional; sporadic phenomena; but are of a relatively high frequency; they reduce the translated text’s potential for achieving some of the gothic effects. The macrostructural textual property particularly affected by these shifts is the narrator’s experience as described by the narrative; which suffers a reduction in intensity.

  11. Comparison of pulsed-field gel electrophoresis & repetitive sequence-based PCR methods for molecular epidemiological studies of Escherichia coli clinical isolates

    Directory of Open Access Journals (Sweden)

    Il Kwon Bae

    2014-01-01

    Full Text Available Background & objectives: PFGE, rep-PCR, and MLST are widely used to identify related bacterial isolates and determine epidemiologic associations during outbreaks. This study was performed to compare the ability of repetitive sequence-based PCR (rep-PCR and pulsed-field gel electrophoresis (PFGE to determine the genetic relationships among Escherichia coli isolates assigned to various sequence types (STs by two multilocus sequence typing (MLST schemes. Methods: A total of 41 extended-spectrum β-lactamase- (ESBL- and/or AmpC β-lactamase-producing E. coli clinical isolates were included in this study. MLST experiments were performed following the Achtman′s MLST scheme and the Whittam′s MLST scheme, respectively. Rep-PCR experiments were performed using the DiversiLab system. PFGE experiments were also performed. Results: A comparison of the two MLST methods demonstrated that these two schemes yielded compatible results. PFGE correctly segregated E. coli isolates belonging to different STs as different types, but did not group E. coli isolates belonging to the same ST in the same group. Rep-PCR accurately grouped E. coli isolates belonging to the same ST together, but this method demonstrated limited ability to discriminate between E. coli isolates belonging to different STs. Interpretation & conclusions: These results suggest that PFGE would be more effective when investigating outbreaks in a limited space, such as a specialty hospital or an intensive care unit, whereas rep-PCR should be used for nationwide or worldwide epidemiology studies.

  12. 动态调度的研究方法综述%Dynamic Scheduling: A Survey of Research Methods

    Institute of Scientific and Technical Information of China (English)

    钱晓龙; 唐立新; 刘文新

    2001-01-01

    A systemic introduction of existing research methods and latestdevelopment of d ynamic scheduling are given. The research methods are divided into two classes from a new point of view. Methods such as optimization, heuristic and simulation belong to the traditional class. While methods such as expert system, artificial neural network, intelligent search and multi-agent belong to the intelligent class. Characters of each method are analyzed and compared here. At last, problems which need further research and possible research directions are pointed out.%介绍了动态调度的研究方法和最新进展。将动态调度的研究方法分成两类:一类是传统方法,如最优化方法、启发式方法和仿真方法等;另一类是智能方法,如专家系统、神经网络、智能搜索以及Multi-agent等。对动态调度的各种研究方法逐一进行分析,并指出该领域应进一步研究的问题和未来的可能发展方向。

  13. Scheduling for Responsive Grids

    CERN Document Server

    Germain-Renaud, C; Moscicki,JT; Texier, R

    2008-01-01

    Grids are facing the challenge of seamless integration of the Grid power into everyday use. One critical component for this integration is responsiveness, the capacity to support on-demand computing and interactivity. Grid scheduling is involved at two levels in order to provide responsiveness: the policy level and the implementation level. The main contributions of this paper are as follows. First, we present a detailed analysis of the performance of the EGEE Grid with respect to responsiveness. Second, we examine two user-level schedulers located between the general scheduling layer and the application layer. These are the DIANE (distributed analysis environment) framework, a general-purpose overlay system, and a specialized, embedded scheduler for gPTM3D, an interactive medical image analysis application. Finally, we define and demonstrate a virtualization scheme, which achieves guaranteed turnaround time, schedulability analysis, and provides the basis for differentiated services. Both methods target a br...

  14. 22 CFR 212.35 - Schedule of fees and method of payment for services rendered.

    Science.gov (United States)

    2010-04-01

    .... Moreover, as traditional methods of news delivery evolve (e.g., electronic dissemination of newspapers through telecommunications services), such alternative media would be included in this category. In the... request down into a series of requests for the purpose of evading the assessment of fees, the Agency...

  15. Trialogue: Preparation, Repetition and...

    Science.gov (United States)

    Oberg, Antoinette; And Others

    1996-01-01

    This paper interrogates both curriculum theory and the limits and potentials of textual forms. A set of overlapping discourses (a trialogue) focuses on inquiring into the roles of obsession and repetition in creating deeply interpretive locations for understanding. (SM)

  16. 基于TOPSIS的卫星数传调度策略评价方法%Evaluation Method of Satellite Data Transmission Scheduling Strategy Based on TOPSIS

    Institute of Scientific and Technical Information of China (English)

    赵岳

    2012-01-01

    卫星数传调度策略评价是一类多属性决策问题.对调度策略的选用和提升有重要的理论意义和实际价值.在介绍了卫星数传调度模型和调度策略原理的基础上,构建任务调度实例,获取了调度方案和算法运行的数据.根据所建评价指标体系,应用TOPSIS法综合评价卫星数传调度策略.评价结果表明,STK/Scheduler的五种调度策略的求解能力和适用范围存在较大差异.基于TOPSIS法对卫星数传调度策略进行评价,具有一定的可行性和科学性,能够为调度策略的选择提供参考依据.同时对复杂调度策略的评价有借鉴作用.%Evaluation of satellite data transmission scheduling strategy is a kind of multiple attribute decision making problems with a very important significance for selecting and improve scheduling strategy. Data of scheduling schema and algorithm running on the basis of discussion of satellite data transmission scheduling model and feathers of scheduling strategy principle are got. According to the created evaluation index system, overall evaluations of satellite data transmission scheduling strategy with TOPSIS are maken. The results of evaluation method show that there is a big difference between five scheduling strategies of STK/Scheduler in solving ability and scope of application. Evaluation of satellite data transmission scheduling strategy based on TOPSIS can offer valuable references for selecting scheduling strategy and has some reference for evaluation of complex scheduling strategy with feasibility and scientific nature.

  17. Cotton Water Use Efficiency under Two Different Deficit Irrigation Scheduling Methods

    Directory of Open Access Journals (Sweden)

    Jeffrey T. Baker

    2015-08-01

    Full Text Available Declines in Ogallala aquifer levels used for irrigation has prompted research to identify methods for optimizing water use efficiency (WUE of cotton (Gossypium hirsutum L. In this experiment, conducted at Lubbock, TX, USA in 2014, our objective was to test two canopy temperature based stress indices, each at two different irrigation trigger set points: the Stress Time (ST method with irrigation triggers set at 5.5 (ST_5.5 and 8.5 h (ST_8.5 and the Crop Water Stress Index (CWSI method with irrigation triggers set at 0.3 (CWSI_0.3 and 0.6 (CWSI_0.6. When these irrigation triggers were exceeded on a given day, the crop was deficit irrigated with 5 mm of water via subsurface drip tape. Also included in the experimental design were a well-watered (WW control irrigated at 110% of potential evapotranspiration and a dry land (DL treatment that relied on rainfall only. Seasonal crop water use ranged from 353 to 625 mm across these six treatments. As expected, cotton lint yield increased with increasing crop water use but lint yield WUE displayed asignificant (p ≤ 0.05 peak near 3.6 to 3.7 kg ha−1 mm−1 for the ST_5.5 and CWSI_0.3 treatments, respectively. Our results suggest that WUE may be optimized in cotton with less water than that needed for maximum lint yield.

  18. Prediction and optimization methods for electric vehicle charging schedules in the EDISON project

    DEFF Research Database (Denmark)

    Aabrandt, Andreas; Andersen, Peter Bach; Pedersen, Anders Bro;

    2012-01-01

    project has been launched to investigate various areas relevant to electric vehicle integration. As part of EDISON an electric vehicle aggregator has been developed to demonstrate smart charging of electric vehicles. The emphasis of this paper is the mathematical methods on which the EDISON aggregator......Smart charging, where the charging of an electric vehicle battery is delayed or advanced in time based on energy costs, grid capacity or renewable contents, has a great potential for increasing the value of the electric vehicle to the owner, the grid and society as a whole. The Danish EDISON...

  19. Should We Expand the Toolbox of Psychiatric Treatment Methods to Include Repetitive Transcranial Magnetic Stimulation (rTMS)? A Meta-Analysis of the Efficacy of rTMS in Psychiatric Disorders

    NARCIS (Netherlands)

    Slotema, Christina W.; Blom, Jan Dirk; Hoek, Hans W.; Sommer, Iris E. C.

    2010-01-01

    Objective: Repetitive transcranial magnetic stimulation (rTMS) is a safe treatment method with few side effects However, efficacy for various psychiatric disorders is currently not clear Data sources: A literature search was performed from 1966 through October 2008 using PubMed, Ovid Medline, Embase

  20. Perceptual Repetition Blindness Effects

    Science.gov (United States)

    Hochhaus, Larry; Johnston, James C.; Null, Cynthia H. (Technical Monitor)

    1994-01-01

    The phenomenon of repetition blindness (RB) may reveal a new limitation on human perceptual processing. Recently, however, researchers have attributed RB to post-perceptual processes such as memory retrieval and/or reporting biases. The standard rapid serial visual presentation (RSVP) paradigm used in most RB studies is, indeed, open to such objections. Here we investigate RB using a "single-frame" paradigm introduced by Johnston and Hale (1984) in which memory demands are minimal. Subjects made only a single judgement about whether one masked target word was the same or different than a post-target probe. Confidence ratings permitted use of signal detection methods to assess sensitivity and bias effects. In the critical condition for RB a precue of the post-target word was provided prior to the target stimulus (identity precue), so that the required judgement amounted to whether the target did or did not repeat the precue word. In control treatments, the precue was either an unrelated word or a dummy.

  1. A method for identifying satiation versus extinction effects under noncontingent reinforcement schedules.

    Science.gov (United States)

    Kahng, S W; Iwata, B A; Thompson, R H; Hanley, G P

    2000-01-01

    We evaluated one method for determining whether response suppression under noncontingent reinforcement (NCR) is a function of satiation or extinction. Three individuals with developmental disabilities who engaged in self-injurious behavior (SIB) or aggression participated. Results of functional analyses indicated that their problem behavior was maintained by social-positive reinforcement. NCR procedures, individualized for each participant, were implemented in a multiple baseline across subjects design and were associated with decreases in all participants' problem behavior. Identification of the mechanism by which NCR produced these effects was based on examination of cumulative records showing response patterns during and immediately following each NCR session. Satiation during NCR should lead to a temporary increase in responding during the post-NCR (extinction) period due to a transition from the availability to the unavailability of reinforcement (satiation to deprivation). Alternatively, extinction during NCR should reveal no increase in responding during the extinction period because the contingency for the problem behavior would remain unchanged and the transition from satiation to deprivation conditions would be irrelevant. Results suggested that the operative mechanisms of NCR were idiosyncratic across the 3 participants and appeared to change during treatment for 1 of the participants.

  2. Off-site consequences of radiological accidents: methods, costs and schedules for decontamination

    Energy Technology Data Exchange (ETDEWEB)

    Tawil, J.J.; Bold, F.C.; Harrer, B.J.; Currie, J.W.

    1985-08-01

    This report documents a data base and a computer program for conducting a decontamination analysis of a large, radiologically contaminated area. The data base, which was compiled largely through interviews with knowledgeable persons both in the public and private sectors, consists of the costs, physical inputs, rates and contaminant removal efficiencies of a large number of decontamination procedures. The computer program utilizes this data base along with information specific to the contaminated site to provide detailed information that includes the least costly method for effectively decontaminating each surface at the site, various types of property losses associated with the contamination, the time at which each subarea within the site should be decontaminated to minimize these property losses, the quantity of various types of labor and equipment necessary to complete the decontamination, dose to radiation workers, the costs for surveying and monitoring activities, and the disposal costs associated with radiological waste generated during cleanup. The program and data base are demonstrated with a decontamination analysis of a hypothetical site. 39 refs., 24 figs., 155 tabs.

  3. Simplified Methods for Calculating Aircraft Load Repetition%飞机荷载重复作用次数的简化计算方法

    Institute of Scientific and Technical Information of China (English)

    赵鸿铎; 凌建明; 姚祖康

    2011-01-01

    对力学-经验型沥青道面结构设计方法中的飞机交通荷载分析方法进行研究,探讨了一种简化的荷载重复作用次数计算方法.通过理论分析,提出了以应力(应变)扩散斜率和等效宽度为中心的荷载重复作用次数简化计算概念.双层体系的结构响应分析表明,等效宽度是结构厚度和上下层结构相对刚度的函数.经过回归分析,给出了等效宽度和结构厚度的线性关系式,回归计算结果与基于道面空间响应得到的等效宽度之间的误差在5%以内.对于多层的道面结构,建议按照力学等效的方法转换成双层结构后进行计算.在此基础上,提出了单轮的荷载重复作用次数计算方法,并详细分析了横向多轮和纵向多轴的影响.基于单机型的计算分析,进一步扩展提出了混合交通条件下的荷载重复作用次数简化计算方法.%The paper presents a discussion on the simplified methods for calculating aircraft load repetition, which is used in mechanistic-empirical pavement design procedure.A simplified concept based on stress/strain spread angle and equivalent width is put forward as the basis of load repletion calculation.The results based on double pavement layers analysis show that the equivalent width is the function of top layer thickness and relative stiffness of the layers.Then, the simplified equations for calculating equivalent width are put forward.The width differences between simplified method and spatial response-based method are within 5%.The pavement with more than two layers can be transferred to two layers according the equivalent approach.With the equivalent width,load repetition methods are developed for single tire, and a detailed analysis is made of the multiple tires and multiple axles as well.Furthermore, the equations with a consideration of the mixed traffic are put forward.

  4. A Comparison of Earned Value and Earned Schedule Duration Forecast Methods on Department of Defense Major Defense Acquisition Programs

    OpenAIRE

    Bruchey, William J.

    2012-01-01

    Approved for public release; distribution is unlimited Earned value management is a project management tool that integrates project scope with cost, schedule, and performance elements for optimum project planning and control. Earned value management is required by the Department of Defense for cost and incentive type contracts equal or greater than $20 million as part of a comprehensive approach to improving critical acquisitions. It is used to forecast the programs schedule performance us...

  5. Methods to model and predict the ViewRay treatment deliveries to aid patient scheduling and treatment planning.

    Science.gov (United States)

    Liu, Shi; Wu, Yu; Wooten, H Omar; Green, Olga; Archer, Brent; Li, Harold; Yang, Deshan

    2016-03-08

    A software tool is developed, given a new treatment plan, to predict treatment delivery time for radiation therapy (RT) treatments of patients on ViewRay magnetic resonance image-guided radiation therapy (MR-IGRT) delivery system. This tool is necessary for managing patient treatment scheduling in our clinic. The predicted treatment delivery time and the assessment of plan complexities could also be useful to aid treatment planning. A patient's total treatment delivery time, not including time required for localization, is modeled as the sum of four components: 1) the treatment initialization time; 2) the total beam-on time; 3) the gantry rotation time; and 4) the multileaf collimator (MLC) motion time. Each of the four components is predicted separately. The total beam-on time can be calculated using both the planned beam-on time and the decay-corrected dose rate. To predict the remain-ing components, we retrospectively analyzed the patient treatment delivery record files. The initialization time is demonstrated to be random since it depends on the final gantry angle of the previous treatment. Based on modeling the relationships between the gantry rotation angles and the corresponding rotation time, linear regression is applied to predict the gantry rotation time. The MLC motion time is calculated using the leaves delay modeling method and the leaf motion speed. A quantitative analysis was performed to understand the correlation between the total treatment time and the plan complexity. The proposed algorithm is able to predict the ViewRay treatment delivery time with the average prediction error 0.22min or 1.82%, and the maximal prediction error 0.89 min or 7.88%. The analysis has shown the correlation between the plan modulation (PM) factor and the total treatment delivery time, as well as the treatment delivery duty cycle. A possibility has been identified to significantly reduce MLC motion time by optimizing the positions of closed MLC pairs. The accuracy of

  6. 海心沙工程进度款的管控方法%Manage and Control Method of Haixinsha Project Schedule Fund

    Institute of Scientific and Technical Information of China (English)

    王冬梅; 唐辉; 刘子铭

    2011-01-01

    在简述海心沙工程及其进度款类别特征的基础上,分析该工程如何对工程进度款进行科学、有效的管理和控制,并具体介绍该工程"预先测算、先行支付、分类控制、决算修正"的工程进度款支付方法。%Resumes the Haixinsha project and the class features of its schedule fund,analyzes and sums up how to manage and control the project schedule fund effectively,and introduces the payment method about schedule fund with"beforehand calculation,payment in advance,classified control,final accounts amend".

  7. Mapping of Primary Instructional Methods and Teaching Techniques for Regularly Scheduled, Formal Teaching Sessions in an Anesthesia Residency Program.

    Science.gov (United States)

    Vested Madsen, Matias; Macario, Alex; Yamamoto, Satoshi; Tanaka, Pedro

    2016-06-01

    In this study, we examined the regularly scheduled, formal teaching sessions in a single anesthesiology residency program to (1) map the most common primary instructional methods, (2) map the use of 10 known teaching techniques, and (3) assess if residents scored sessions that incorporated active learning as higher quality than sessions with little or no verbal interaction between teacher and learner. A modified Delphi process was used to identify useful teaching techniques. A representative sample of each of the formal teaching session types was mapped, and residents anonymously completed a 5-question written survey rating the session. The most common primary instructional methods were computer slides-based classroom lectures (66%), workshops (15%), simulations (5%), and journal club (5%). The number of teaching techniques used per formal teaching session averaged 5.31 (SD, 1.92; median, 5; range, 0-9). Clinical applicability (85%) and attention grabbers (85%) were the 2 most common teaching techniques. Thirty-eight percent of the sessions defined learning objectives, and one-third of sessions engaged in active learning. The overall survey response rate equaled 42%, and passive sessions had a mean score of 8.44 (range, 5-10; median, 9; SD, 1.2) compared with a mean score of 8.63 (range, 5-10; median, 9; SD, 1.1) for active sessions (P = 0.63). Slides-based classroom lectures were the most common instructional method, and faculty used an average of 5 known teaching techniques per formal teaching session. The overall education scores of the sessions as rated by the residents were high.

  8. 一种改进的 Hadoop 多用户作业调度方法%Improved method in solving Hadoop multi-user scheduling

    Institute of Scientific and Technical Information of China (English)

    曹书豪; 张昌宏; 麻旻

    2015-01-01

    Aiming at the job scheduling method of Hadoop operation service level is not high,and the low utilization rate of resources problem,this paper proposed an improved Hadoop multiuser scheduling algorithm.Firstly,it analyzed the shortcom-ings existed in Hadoop scheduling algorithm.Then put forward a job selection method based on the quality of service,and a task selection equalization method based on genetic algorithm.Finally,it simulated the algorithm by using the Hadoop plat-form.The simulation results show that,the resource scheduling method improves the operation quality of service,to achieve a reasonable scheduling of resources.%针对目前 Hadoop 作业调度方法服务水平不高、资源利用率低的问题,提出了一种改进的 Hadoop 多用户作业调度算法。分析了 Hadoop 现行调度算法存在的不足,提出了基于服务质量(QoS)的作业选择量化和基于遗传算法的任务选择均衡化的方法,最后采用 Hadoop 平台对算法进行了仿真。仿真结果表明,该资源调度方法提高了作业的服务质量,实现了资源的合理调度。

  9. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

    Dobrkovic, Andrej; Liu, Luyao; Iacob, Maria-Eugenia; Hillegersberg, van Jos

    2016-01-01

    The scheduling process in a typical business environment consists of predominantly repetitive tasks that have to be completed in limited time and often containing some form of uncertainty. The intelligence amplification is a symbiotic relationship between a human and an intelligent agent. This partn

  10. Intelligence amplification framework for enhancing scheduling processes

    NARCIS (Netherlands)

    Dobrkovic, Andrej; Liu, Luyao; Iacob, Maria Eugenia; van Hillegersberg, Jos

    2016-01-01

    The scheduling process in a typical business environment consists of predominantly repetitive tasks that have to be completed in limited time and often containing some form of uncertainty. The intelligence amplification is a symbiotic relationship between a human and an intelligent agent. This

  11. Novel porcine repetitive elements

    Directory of Open Access Journals (Sweden)

    Nonneman Dan J

    2006-12-01

    Full Text Available Abstract Background Repetitive elements comprise ~45% of mammalian genomes and are increasingly known to impact genomic function by contributing to the genomic architecture, by direct regulation of gene expression and by affecting genomic size, diversity and evolution. The ubiquity and increasingly understood importance of repetitive elements contribute to the need to identify and annotate them. We set out to identify previously uncharacterized repetitive DNA in the porcine genome. Once found, we characterized the prevalence of these repeats in other mammals. Results We discovered 27 repetitive elements in 220 BACs covering 1% of the porcine genome (Comparative Vertebrate Sequencing Initiative; CVSI. These repeats varied in length from 55 to 1059 nucleotides. To estimate copy numbers, we went to an independent source of data, the BAC-end sequences (Wellcome Trust Sanger Institute, covering approximately 15% of the porcine genome. Copy numbers in BAC-ends were less than one hundred for 6 repeat elements, between 100 and 1000 for 16 and between 1,000 and 10,000 for 5. Several of the repeat elements were found in the bovine genome and we have identified two with orthologous sites, indicating that these elements were present in their common ancestor. None of the repeat elements were found in primate, rodent or dog genomes. We were unable to identify any of the replication machinery common to active transposable elements in these newly identified repeats. Conclusion The presence of both orthologous and non-orthologous sites indicates that some sites existed prior to speciation and some were generated later. The identification of low to moderate copy number repetitive DNA that is specific to artiodactyls will be critical in the assembly of livestock genomes and studies of comparative genomics.

  12. On-demand data broadcast scheduling based on AHP and GRA methods in wireless broadcast/UMTS integrated systems

    Institute of Scientific and Technical Information of China (English)

    WANG Hui; LI Chun; JI Yang

    2007-01-01

    The increasing demand for interactive mobile multimedia service is causing the integration of 3rd generation (3G) cellular systems and wireless broadcast systems. The key challenge is to support data dissemination with low response time, request drop rate, and the unfairness of request drop. This article proposes a novel scheduling algorithm called DAG (on-demand scheduling utilizing analytic hierarchy process (AHP) and grey relational analysis (GRA)), which takes multiple factors-waiting time, number of active requests, deadline-into consideration, and models the data scheduling process as a multiple factors' decision-making and best option-selecting process. The proposed approach comprises two parts. The first part applies AHP to decide the relative weights of multiple decision factors according to user requests, while the second adopts GRA to rank the data item alternatives through the similarity between each option and the ideal option. Simulation results are presented to demonstrate that DAG performs well in the multiple criterions mentioned above.

  13. A Hybrid Approach for Scheduling and Replication based on Multi-criteria Decision Method in Grid Computing

    Directory of Open Access Journals (Sweden)

    Nadia Hadi

    2012-09-01

    Full Text Available Grid computing environments have emerged following the demand of scientists to have a very high computing power and storage capacity. One among the challenges imposed in the use of these environments is the performance problem. To improve performance, scheduling and replicating techniques are used. In this paper we propose an approach to task scheduling combined with data replication decision based on multi criteria principle. This is to improve performance by reducing the response time of tasks and the load of system. This hybrid approach is based on a non-hierarchical model that allows scalability.

  14. An Analysis of Selected Quantitative Methods to Air Force Communications Command Electronics Installation Workload Assignment and Scheduling.

    Science.gov (United States)

    1981-06-01

    schedule workload assigned to the Air Force Comunications omand Engineering and Installations Activities. Each model applies mission nd unit unique...Anderson, David R., Dennis J. Sweeney, and Thomas A. Williams. An Introduction to Management Science, Quantitative Approaches to Decision Making. St Paul MN

  15. 日内及实时发电计划的递进协调方法%Hierarchical Coordinated Method for Intraday and Real-time Generation Scheduling

    Institute of Scientific and Technical Information of China (English)

    邓勇; 朱泽磊; 黄文英; 李顺宁; 黄金富; 李稳

    2015-01-01

    为了提高日内及实时发电计划的实用化水平,文中设计了日内发电计划、实时发电计划及自动发电控制(AGC)的递进协调方法,提出了日内及实时发电计划两阶段多组合的优化策略;采用预先故障排除技术,建立了数据源质量分析和告警逻辑,整体提高了发电计划实时平衡自动化的灵活性、安全性以及系统稳定性。通过实际运行应用说明,该系统可实现负荷偏差的自动优化分配,有效减少了调度人员的人工干预,提高了工作效率,提升了电网运行的安全性和经济性。%In order to improve the practical level of intraday and real-time generation Scheduling,a hierarchical coordinated method is designed for intraday generation scheduling,real-time generation scheduling and automatic generation control (AGC).And a two-stage multi-combination optimization strategy for intraday and real-time generation scheduling is proposed. By using pre-trouble shooting techniques to design data source quality analysis and alarm logic,the overall flexibility,security and stability of the automation of generation scheduling real-time balance is improved.Actual application shows that the system is capable of achieving automatic optimal allocation of load deviation,effectively reducing manual intervention by operator, improving work efficiency and enhancing power grid security and economy.

  16. 关键链项目进度控制技术综合分析研究%Analysis on Critical Chain Project Comprehensive Schedule Control Method

    Institute of Scientific and Technical Information of China (English)

    李俊亭

    2015-01-01

    Critical chain project management(CCPM)is an important breakthrough in the development of project management, but critical chain project schedule controlling technology based on buffer mechanism is not comprehensive enough,and lacks of important control sector,and has no association with traditional project schedule control technology and so on. This paper analyzes the fundamental of CCPM schedule control method and traditional project schedule control technology. Based on buffer time management it proposes buffer time consumption ratio,buffer consumption & critical chain completion ratio,and critical chain project schedule control technology based on earned value. Based on resource management it puts forward three principles for critical chain project schedule control with CCPM characteristics. As a whole,this paper brings forward a comprehensive critical chain project schedule control technology,and provides a foundation for critical chain project control system.%关键链项目管理是现代项目管理理论的一个重要突破,但是基于缓冲机制的关键链项目进度控制技术还不够全面、存在部分控制环节缺失、未能与传统项目进度控制技术融合等问题.通过分析关键链项目进度控制基础和传统的项目进度控制技术,基于缓冲时间管理提出缓冲区消耗比例、缓冲区消耗与关键链完成比率和关键链挣值进度控制技术;基于资源管理提出具有关键链项目特色的3个进度控制准则,为系统研究关键链项目进度控制体系奠定了基础.

  17. An Enhanced Method for Scheduling Observations of Large Sky Error Regions for Finding Optical Counterparts to Transients

    Science.gov (United States)

    Rana, Javed; Singhal, Akshat; Gadre, Bhooshan; Bhalerao, Varun; Bose, Sukanta

    2017-04-01

    The discovery and subsequent study of optical counterparts to transient sources is crucial for their complete astrophysical understanding. Various gamma-ray burst (GRB) detectors, and more notably the ground-based gravitational wave detectors, typically have large uncertainties in the sky positions of detected sources. Searching these large sky regions spanning hundreds of square degrees is a formidable challenge for most ground-based optical telescopes, which can usually image less than tens of square degrees of the sky in a single night. We present algorithms for better scheduling of such follow-up observations in order to maximize the probability of imaging the optical counterpart, based on the all-sky probability distribution of the source position. We incorporate realistic observing constraints such as the diurnal cycle, telescope pointing limitations, available observing time, and the rising/setting of the target at the observatory’s location. We use simulations to demonstrate that our proposed algorithms outperform the default greedy observing schedule used by many observatories. Our algorithms are applicable for follow-up of other transient sources with large positional uncertainties, such as Fermi-detected GRBs, and can easily be adapted for scheduling radio or space-based X-ray follow-up.

  18. MIMICRY, DIFFERENCE AND REPETITION

    Directory of Open Access Journals (Sweden)

    Marcelo Mendes de Souza

    2008-07-01

    Full Text Available This article addresses Homi K. Bhabha’s concept of mimicry in a broader context, other than that of cultural studies and post-colonial studies, bringing together other concepts, such as that of Gilles Deleuze in Difference and repetition, among other texts, and other names, such as Silviano Santiago, Jorge Luís Borges, Franz Kafka and Giorgio Agamben. As a partial conclusion, the article intends to oppose Bhabha’s freudian-marxist view to Five propositions on Psychoanalysis (1973, Gilles Deleuze’s text about Psychoanalysis published right after his book The Anti-Oedipus.

  19. Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart

    NARCIS (Netherlands)

    Heemstra de Groot, Sonia M.; Herrmann, Otto E.

    1990-01-01

    A method for rate-optimal scheduling of recursive DSP algorithms is presented. The approach is based on the determination of the scheduling window of each operation and the construction of a scheduling-range chart. The information in the chart is used during scheduling to optimize some quality crite

  20. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been the predomin......The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been...... the predominant scheduling method since it was introduced in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects, which among other things is indicated by the development of a large number of CPM-based software applications available...... 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...

  1. Instruction Scheduling Across Control Flow

    Directory of Open Access Journals (Sweden)

    Martin Charles Golumbic

    1993-01-01

    Full Text Available Instruction scheduling algorithms are used in compilers to reduce run-time delays for the compiled code by the reordering or transformation of program statements, usually at the intermediate language or assembly code level. Considerable research has been carried out on scheduling code within the scope of basic blocks, i.e., straight line sections of code, and very effective basic block schedulers are now included in most modern compilers and especially for pipeline processors. In previous work Golumbic and Rainis: IBM J. Res. Dev., Vol. 34, pp.93–97, 1990, we presented code replication techniques for scheduling beyond the scope of basic blocks that provide reasonable improvements of running time of the compiled code, but which still leaves room for further improvement. In this article we present a new method for scheduling beyond basic blocks called SHACOOF. This new technique takes advantage of a conventional, high quality basic block scheduler by first suppressing selected subsequences of instructions and then scheduling the modified sequence of instructions using the basic block scheduler. A candidate subsequence for suppression can be found by identifying a region of a program control flow graph, called an S-region, which has a unique entry and a unique exit and meets predetermined criteria. This enables scheduling of a sequence of instructions beyond basic block boundaries, with only minimal changes to an existing compiler, by identifying beneficial opportunities to cover delays that would otherwise have been beyond its scope.

  2. Heuristic methods for the single machine scheduling problem with different ready times and a common due date

    Science.gov (United States)

    Birgin, Ernesto G.; Ronconi, Débora P.

    2012-10-01

    The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs.

  3. Performance analysis of active schedules in identical parallel machine

    Institute of Scientific and Technical Information of China (English)

    Changjun WANG; Yugeng XI

    2007-01-01

    Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs' dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.

  4. Repetition in Waiting for Godot

    Institute of Scientific and Technical Information of China (English)

    李想; 魏妍

    2015-01-01

    Waiting for Godot is one of the most famous plays written by Samuel Barclay Beckett, and also is the founding work of“Theatre of the Absurd”. In the drama, repetitive phenomena shed light on the whole construction considerably. All the charac-ters were helpless and unthinking. Their dialogues were simple, nonsense and repetitive. Two scenes were cyclical. Repetition was used subtly in order to express the theme of the play, showing mental crisis after depravation of WWII.

  5. A Study on Human Oriented Autonomous Distributed Manufacturing System —Real-time Scheduling Method Based on Preference of Human Operators

    Science.gov (United States)

    Iwamura, Koji; Kuwahara, Shinya; Tanimizu, Yoshitaka; Sugimura, Nobuhiro

    Recently, new distributed architectures of manufacturing systems are proposed, aiming at realizing more flexible control structures of the manufacturing systems. Many researches have been carried out to deal with the distributed architectures for planning and control of the manufacturing systems. However, the human operators have not yet been discussed for the autonomous components of the distributed manufacturing systems. A real-time scheduling method is proposed, in this research, to select suitable combinations of the human operators, the resources and the jobs for the manufacturing processes. The proposed scheduling method consists of following three steps. In the first step, the human operators select their favorite manufacturing processes which they will carry out in the next time period, based on their preferences. In the second step, the machine tools and the jobs select suitable combinations for the next machining processes. In the third step, the automated guided vehicles and the jobs select suitable combinations for the next transportation processes. The second and third steps are carried out by using the utility value based method and the dispatching rule-based method proposed in the previous researches. Some case studies have been carried out to verify the effectiveness of the proposed method.

  6. Scheduling the Secondary School.

    Science.gov (United States)

    Dempsey, Richard A.; Traverso, Henry P.

    This "how-to-do-it" manual on the intricacies of school scheduling offers both technical information and common sense advice about the process of secondary school scheduling. The first of six chapters provides an overview of scheduling; chapter 2 examines specific considerations for scheduling; chapter 3 surveys the scheduling models and their…

  7. An optimal method for scheduling observations of large sky error regions for finding optical counterparts to transients

    CERN Document Server

    Rana, Javed; Gadre, Bhooshan; Bhalerao, Varun; Bose, Sukanta

    2016-01-01

    The discovery and subsequent study of optical counterparts to transient sources is crucial for their complete astrophysical understanding. Various gamma ray burst (GRB) detectors, and more notably the ground--based gravitational wave detectors, typically have large uncertainties in the sky positions of detected sources. Searching these large sky regions spanning hundreds of square degrees is a formidable challenge for most ground--based optical telescopes, which can usually image less than tens of square degrees of the sky in a single night. We present algorithms for optimal scheduling of such follow--up observations in order to maximize the probability of imaging the optical counterpart, based on the all--sky probability distribution of the source position. We incorporate realistic observing constraints like the diurnal cycle, telescope pointing limitations, available observing time, and the rising/setting of the target at the observatory location. We use simulations to demonstrate that our proposed algorith...

  8. 外科实施APN连续性排班方式的效果与体会%The effect and experience of APN continuity scheduling method

    Institute of Scientific and Technical Information of China (English)

    黄房珍

    2012-01-01

    Objective:To study the effect and nursing management experience of surgical nurse implementation APN continuity scheduling method . Meth-ods:A group's work time from 8:00 -12:00,14:30 -17:30 adjusted to 8:00 -16:00. P group's work time from 17:30 -1:00 adjusted to 16:00 -22: 00. N group's work time adjusted to 22:00 - 8:00 . Each shift team has a leader. Implementation of APN continuity scheduling method not only give full play to the advantage of nursing leader management experience, but also make good use of good physical quality of young nurse . Results: APN continuity scheduling method can reduce repeated handing - over time, frequency, improve work efficiency, and guarantee the quality of work and nursing safety. Conclusion:After implementation APN continuity scheduling method, nursing human resource can get rational application, develop nursing staff potential maximumly and improve working efficiency.%目的:探讨外科护士实施APN连续性排班方式的效果.方法:将A班上班时间由8:00~12:00,14:30~17:30调整为:8:00~16:00;P班由17:30~1:00调整为16:00~22:00;N班由1:00~8:00调整为22:00~8:00.实施APN连续性排班方式.结果:APN连续性排班方式能够减少重复交接班时间、次数,提高工作效率,有效保证了病区护理工作质量和护理安全.结论:外科护士实施APN连续性排班方式后,护理人力资源能够得到合理使用,最大限度的发挥护理人员的潜能,确实提高了工作效率.

  9. The Information Modeling and Intelligent Optimization Method for Logistics Vehicle Routing and Scheduling with Multi-objective and Multi-constraint

    Institute of Scientific and Technical Information of China (English)

    LI Bei-zhi; ZHOU Ya-qin; LAN Shi-hai; YANG Jian-guo

    2007-01-01

    The vehicle routing and scheduling (VRS)problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering. The objective and constraint includes loading,the dispatch and arrival time, transportation conditions,total cost, etc. An information model and a mathematical model are built, and a method based on knowledge and biologic immunity is put forward for optimizing and evaluating the programs dimensions in vehicle routing and scheduling with multi-objective and multi-constraints. The proposed model and method are illustrated in a case study concerning a transport network, and the result shows that more optimization solutions can be easily obtained and the method is efficient and feasible. Comparing with the standard GA and the standard GA without time constraint,the computational time of the algorithm is less in this paper.And the probability of gaining optimal solution is bigger and the result is better under the condition of multi-con,traint.

  10. Understanding maximal repetitions in strings

    CERN Document Server

    Crochemore, Maxime

    2008-01-01

    The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach, the stronger result concerning the linearity of the sum of exponents of all runs follows easily.

  11. A Scheduling Method for Avionics WDM Networks%一种航空电子WDM网络消息调度方法

    Institute of Scientific and Technical Information of China (English)

    宋丽茹; 周立; 何锋; 熊华钢

    2011-01-01

    针对WDM(wavelength division multiplexing)广播选择型网络结构,提出了一种高信道利用率的航空电子周期和非周期消息的实时调度方法MMAS(multichannel multielass avionics scheduling).对周期消息,采用多信道静态轮转调度策略,其中RL(round length)轮转参数优化方法,可以有效地提高信道负载率,减少带宽碎片;同时提出的多信道消息分配策略能有效减少消息拆分次数.对非周期消息,采用动态预留的多信道调度策略,提出了基于周期消息剩余带宽循环序列矩阵的方法提高了信道利用率,提出了非周期实时消息的准入条件.最后,一个具体的算例验证了MMAS中周期消息RL优化方法、消息分配方法以及非周期消息剩余带宽调度策略.结果表明,周期消息分配方法能降低消息的拆分次数,RL优化设计方法和非周期剩余带宽的调度方法能有效提高信道利用率水平.%On the basis of the WDM broadcasting network structure, a real time scheduling method for avionics periodic or aperiodic real time messages named MMAS (multichannel multiclass avionics scheduling) was proposed to improve the utilization of the channels. For the periodic real time messages, the multichannel static round robin scheduling method was applied, in which the RL parameter optimization strategy was involved to increase the load rate of channels and decrease the fragments of the bandwidth at the same time. The message allocation method was provided to reduce the splitting times of the messages. For the aperiodic real time messages, the dynamic reservation multichannel scheduling method was adopted. The surplus bandwidths of periodic messages in every period were reused to improve the utilization of the channels. Then the admitting control condition for aperiodic messages was presented. The evaluation of an example verifies that the utilization of the channels could be efficiently increased by using the RL parameter

  12. 声纳并行处理系统的设计方法与调度策略%Design and scheduling method of sonar parallel processing systems

    Institute of Scientific and Technical Information of China (English)

    艾锐峰; 蔡志明; 王希敏; 陈宝柱

    2011-01-01

    针对声纳系统实时处理的要求,讨论了其并行程序设计方法和程序调度策略.根据声纳处理系统的功能分布、结构分层、数据流脉动的特性,将并行设计与调度映射统一考虑,建立了一种设计模式.先自上而下层层分解,以有向非循环图(directed acyclic graph,DAG)描述系统,采用网络计划技术建立数学约束模型;再从下至上逐层整合;然后按宏观大粒度调度,微观小粒度映射,程序并行流水执行的方法实现系统的运行与调度.据此设计模式对一个实例进行设计,验证其有效性.%Aiming at the demand for real-time processing, the parallel programming method and scheduling stratagem of a sonar system is discussed. A design pattern, which considers the parallel design, scheduling and mapping comprehensively, is constructed from the characteristics of the sonar processing system, such as distributed function, partition in layer and pulsating data flow. First, decomposing in layer, then the system is described by using the directed acyclic graph. Second, the network programming technique is used to build the mathematical model. Then, the entire system is reshaped from low layer to high layer, the system's operation and stratagem is implemented in accordance with scheduling in big granularity, mapping in small granularity and execution in parallel flow. In this pattern an instance is designed. The result shows that it is efficient.

  13. Integration of Building Information Modeling and Critical Path Method Schedules to Simulate the Impact of Temperature and Humidity at the Project Level

    Directory of Open Access Journals (Sweden)

    Yongwei Shan

    2014-07-01

    Full Text Available Steel construction activities are often undertaken in an environment with limited climate control. Both hot and cold temperatures can physically and psychologically affect construction workers, thus decreasing their productivity. Temperature and humidity are two factors that constantly exert forces on workers and influence their performance and efficiency. Previous studies have established a relationship between labor productivity and temperature and humidity. This research is built on the existing body of knowledge and develops a framework of integrating building information modeling (BIM with a lower level critical path method (CPM schedule to simulate the overall impact of temperature and humidity on a healthcare facility’s structural steel installation project in terms of total man hours required to build the project. This research effort utilized historical weather data of four cities across the U.S., with each city having workable seasons year-round and conducted a baseline assessment to test if various project starting dates and locations could significantly impact the project’s schedule performance. It was found that both varied project start dates and locations can significantly contribute to the difference in the man hours required to build the model project and that the project start date and location can have an interaction effect. This study contributes to the overall body of knowledge by providing a framework that can help practitioners better understand the overall impact of a productivity influencing factor at a project level, in order to facilitate better decision making.

  14. List scheduling revisited

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1996-01-01

    We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem.

  15. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    (schedules expected to perform well after some degree of modification when the environment changes). This thesis presents two fundamentally different approaches for scheduling job shops facing machine breakdowns. The first method is called neighbourhood based robustness and is based on an idea of minimising...... 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...... suboptimal when it is implemented and subjected to the uncertainty of the real world. For this reason it is very important to find methods capable of creating robust schedules (schedules expected to perform well after a minimal amount of modification when the environment changes) or flexible schedules...

  16. Dynamic Fractional Resource Scheduling vs. Batch Scheduling

    CERN Document Server

    Casanova, Henri; Vivien, Frédéric

    2011-01-01

    We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our scheduling problem. We further evaluate these algorithms in simulation against both synthetic and real-world HPC workloads and compare our algorithms to standard batch scheduling approaches. We find that our approach improves over batch scheduling by orders of magnitude in terms of job stretch, while leading to comparable or better resource utilization. Our results demonstrate that virtualization technology coupled with light...

  17. Effects of Material Emotional Valence on the Time Course of Massive Repetition Priming

    Science.gov (United States)

    Hu, Zhiguo; Liu, Hongyan; Zhang, John X.

    2010-01-01

    Learning through repetition is a fundamental form and also an effective method of language learning critical for achieving proficient and automatic language use. Massive repetition priming as a common research paradigm taps into the dynamic processes involved in repetition learning. Research with this paradigm has so far used only emotionally…

  18. Hierarchical classification of dynamically varying radar pulse repetition interval modulation patterns.

    Science.gov (United States)

    Kauppi, Jukka-Pekka; Martikainen, Kalle; Ruotsalainen, Ulla

    2010-12-01

    The central purpose of passive signal intercept receivers is to perform automatic categorization of unknown radar signals. Currently, there is an urgent need to develop intelligent classification algorithms for these devices due to emerging complexity of radar waveforms. Especially multifunction radars (MFRs) capable of performing several simultaneous tasks by utilizing complex, dynamically varying scheduled waveforms are a major challenge for automatic pattern classification systems. To assist recognition of complex radar emissions in modern intercept receivers, we have developed a novel method to recognize dynamically varying pulse repetition interval (PRI) modulation patterns emitted by MFRs. We use robust feature extraction and classifier design techniques to assist recognition in unpredictable real-world signal environments. We classify received pulse trains hierarchically which allows unambiguous detection of the subpatterns using a sliding window. Accuracy, robustness and reliability of the technique are demonstrated with extensive simulations using both static and dynamically varying PRI modulation patterns. Copyright © 2010 Elsevier Ltd. All rights reserved.

  19. Scheduling trucks in cross docking systems with temporary storage and dock repeat truck holding pattern using GRASP method

    Directory of Open Access Journals (Sweden)

    Hassan Javanshir

    2012-10-01

    Full Text Available Cross docking play an important role in management of supply chains where items delivered to a warehouse by inbound trucks are directly sorted out, reorganized based on customer demands, routed and loaded into outbound trucks for delivery to customers without virtually keeping them at the warehouse. If any item is held in storage, it is usually for a short time, which is normally less than 24 hours. The proposed model of this paper considers a special case of cross docking where there is temporary storage and uses GRASP technique to solve the resulted problem for some realistic test problems. In our method, we first use some heuristics as initial solutions and then improve the final solution using GRASP method. The preliminary test results indicate that the GRASP method performs better than alternative solution strategies.

  20. Integrated maintenance support scheduling method of multi-carrier aircrafts%舰载机多机一体化机务保障调度方法

    Institute of Scientific and Technical Information of China (English)

    韩维; 苏析超; 陈俊锋

    2015-01-01

    为了有效提升舰载机多机机务保障的效率和保障人员的利用率,根据单机机务保障流程约束特性,建立了基于多计划评审技术网络的多目标多机一体化机务保障调度模型。针对问题的求解,提出了一种自适应混合差分进化算法。首先根据调度的网络化排队过程,设计了基于事件调度策略的解码方法。其次为了协调算法“探索”与“开发”的能力,引入了自适应的变异操作和交叉、变异参数控制。再次,针对工序块的平行组合排列特征,提出了4种邻域结构,进而在算法框架中嵌入了一种自适应多邻域局部搜索策略。最后通过仿真实验验证了模型和算法的可行性和有效性。%In order to improve the maintenance support efficiency and support personnel availability of multi-carrier aircrafts effectively,according to the constraint characteristics of maintenance support process for single-carrier aircraft,a multi-objective integrated maintenance support scheduling model of multi-carrier air-crafts based on multiple program evaluation and review technique networks is established.To solve the pro-blem,a self-adaptive hybrid differential evolution algorithm is presented.First,a decoding method based on event scheduling is designed according to networked queuing process of scheduling.Second,for coordinating the exploration and exploitation in algorithm,a self-adaptive mutation operation,an adaptive control strategy of crossover and mutation parameters are introduced.Third,in view of the characteristics of parallel-arrangement of process blocks,four kinds of neighborhood structure are defined,and then a novel local search based on the newly defined neighborhoods is presented and imbedded in the SaHDE algorithm.The simulation results show the feasibility of the model and the effectiveness of the algorithm.

  1. Repetition in English Political Public Speaking

    Institute of Scientific and Technical Information of China (English)

    李红梅

    2010-01-01

    Repetition is frequently used in English political public speaking to make it easy to be remembered and powerful to move the feelings of the public. This paper is intended to analyze the functions of repetition and different levels of repetition to highlight the significance of repetition in English political public speaking and the ability of using it in practice.

  2. Robust Repetitive Controller for Fast AFM Imaging

    CERN Document Server

    Necipoglu, Serkan; Has, Yunus; Guvenc, Levent; Basdogan, Cagatay

    2012-01-01

    Currently, Atomic Force Microscopy (AFM) is the most preferred Scanning Probe Microscopy (SPM) method due to its numerous advantages. However, increasing the scanning speed and reducing the interaction forces between the probe's tip and the sample surface are still the two main challenges in AFM. To meet these challenges, we take advantage of the fact that the lateral movements performed during an AFM scan is a repetitive motion and propose a Repetitive Controller (RC) for the z-axis movements of the piezo-scanner. The RC utilizes the profile of the previous scan line while scanning the current line to achieve a better scan performance. The results of the scanning experiments performed with our AFM set-up show that the proposed RC significantly outperforms a conventional PI controller that is typically used for the same task. The scan error and the average tapping forces are reduced by 66% and 58%, respectively when the scan speed is increased by 7-fold.

  3. TCSC control structures for line power scheduling and methods to determine their location and tuning to damp system oscillations

    Energy Technology Data Exchange (ETDEWEB)

    Martins, N.; Pinto, H.J.C.P.; Bianco, A. [Centro de Pesquisas de Energia Eletrica (CEPEL), Rio de Janeiro, RJ (Brazil); Macedo, N.J.P. [FURNAS, Rio de Janeiro, RJ (Brazil)

    1994-12-31

    This paper describes control structures and computer methods to enhance the practical use of thyristor controlled series compensation (TCSC) in power systems. The location and controller design of the TCS devices, to damp system oscillations, are based on modal analysis and frequency response techniques, respectively. Results are given for a large practical power system. (author) 15 refs., 18 figs., 5 tabs.

  4. Modeling repetitive motions using structured light.

    Science.gov (United States)

    Xu, Yi; Aliaga, Daniel G

    2010-01-01

    Obtaining models of dynamic 3D objects is an important part of content generation for computer graphics. Numerous methods have been extended from static scenarios to model dynamic scenes. If the states or poses of the dynamic object repeat often during a sequence (but not necessarily periodically), we call such a repetitive motion. There are many objects, such as toys, machines, and humans, undergoing repetitive motions. Our key observation is that when a motion-state repeats, we can sample the scene under the same motion state again but using a different set of parameters; thus, providing more information of each motion state. This enables robustly acquiring dense 3D information difficult for objects with repetitive motions using only simple hardware. After the motion sequence, we group temporally disjoint observations of the same motion state together and produce a smooth space-time reconstruction of the scene. Effectively, the dynamic scene modeling problem is converted to a series of static scene reconstructions, which are easier to tackle. The varying sampling parameters can be, for example, structured-light patterns, illumination directions, and viewpoints resulting in different modeling techniques. Based on this observation, we present an image-based motion-state framework and demonstrate our paradigm using either a synchronized or an unsynchronized structured-light acquisition method.

  5. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

    computational results of these large-scale instances. To validate the models and solution algorithms developed, this thesis also compares the daily flight schedules that it designs with the schedules of the existing airlines. Furthermore, it creates instances that represent different economic and fuel-prices conditions and derives schedules under these different conditions. In addition, it discusses the implication of using new aircraft in the future flight schedules. Finally, future research in three areas---model, computational method, and simulation for validation---is proposed.

  6. Immunization Schedules for Adults

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  7. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  8. School Construction Scheduling.

    Science.gov (United States)

    Delaney, J. B.

    1983-01-01

    Explains that favorable market and working conditions influence the scheduling of school construction projects. Facility planners, architects, and contractors are advised to develop a realistic time schedule for the entire project. (MLF)

  9. Varianish: Jamming with Pattern Repetition

    Directory of Open Access Journals (Sweden)

    Jort Band

    2014-10-01

    Full Text Available In music, patterns and pattern repetition are often regarded as a machine-like task, indeed often delegated to drum Machines and sequencers. Nevertheless, human players add subtle differences and variations to repeated patterns that are musically interesting and often unique. Especially when looking at minimal music, pattern repetitions create hypnotic effects and the human mind blends out the actual pattern to focus on variation and tiny differences over time. Varianish is a musical instrument that aims at turning this phenomenon into a new musical experience for musician and audience: Musical pattern repetitions are found in live music and Varianish generates additional (musical output accordingly that adds substantially to the overall musical expression. Apart from the theory behind the pattern finding and matching and the conceptual design, a demonstrator implementation of Varianish is presented and evaluated.

  10. Long repetition time experiments for measurement of concentrations in systems with chemical exchange and undergoing temporal variation-comparison of methods with and without correction for saturation

    Science.gov (United States)

    Galbán, Craig J.; Spencer, Richard G. S.

    2003-02-01

    The purpose of this paper is to compare two methods for quantifying metabolite concentrations using the one-pulse experiment for a sample undergoing chemical exchange and subject to an intervention or other temporal variation. The methods, LATR-C (Long Acquisition TR (interpulse delay); Corrected for partial saturation) and LATR-NC (Long Acquisition TR; Not Corrected), are compared in terms of signal-to-noise ratio, SNR, per unit time and quantitation errors. Parameters relevant to the isolated perfused rat heart are used as a specific application, although the results are general. We assume throughout that spin-lattice relaxation times, T1, do not change. For a given flip angle, θ, TR's are calculated which result in maximal SNR per unit time under 10%, 5%, and 1% constraints on quantitation errors. Additional simulations were performed to demonstrate explicitly the dependence of the quantitation errors on TR for a fixed θ. We find (i) if the allowed error is large, and when both metabolite concentrations and rate constants vary, LATR-C permits use of shorter TR, and hence yields greater SNR per unit time, than LATR-NC; (ii) for small allowed error, the two methods give similar TR's and SNR per unit time, so that the simpler LATR-NC experiment may be preferred; (iii) large values of θ result in similar constrained TR's and hence SNR per unit time for the two methods; (iv) the ratio of concentrations of metabolites with similar T1 exhibit similar errors for the two methods.

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

  12. Analysis of repetitive DNA in chromosomes by flow cytometry.

    Science.gov (United States)

    Brind'Amour, Julie; Lansdorp, Peter M

    2011-06-01

    We developed a flow cytometry method, chromosome flow fluorescence in situ hybridization (FISH), called CFF, to analyze repetitive DNA in chromosomes using FISH with directly labeled peptide nucleic acid (PNA) probes. We used CFF to measure the abundance of interstitial telomeric sequences in Chinese hamster chromosomes and major satellite sequences in mouse chromosomes. Using CFF we also identified parental homologs of human chromosome 18 with different amounts of repetitive DNA.

  13. REPETITIVE CLUSTER-TILTED ALGEBRAS

    Institute of Scientific and Technical Information of China (English)

    Zhang Shunhua; Zhang Yuehui

    2012-01-01

    Let H be a finite-dimensional hereditary algebra over an algebraically closed field k and CFm be the repetitive cluster category of H with m ≥ 1.We investigate the properties of cluster tilting objects in CFm and the structure of repetitive clustertilted algebras.Moreover,we generalize Theorem 4.2 in [12](Buan A,Marsh R,Reiten I.Cluster-tilted algebra,Trans.Amer.Math.Soc.,359(1)(2007),323-332.) to the situation of CFm,and prove that the tilting graph KCFm of CFm is connected.

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

  15. Parallel scheduling algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Dekel, E.; Sahni, S.

    1983-01-01

    Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms. 26 references.

  16. FRB repetition and non-Poissonian statistics

    CERN Document Server

    Connor, Liam; Oppermann, Niels

    2016-01-01

    We discuss some of the claims that have been made regarding the statistics of fast radio bursts (FRBs). In an earlier paper \\citep{2015arXiv150505535C} we conjectured that flicker noise associated with FRB repetition could show up in non-cataclysmic neutron star emission models, like supergiant pulses. We show how the current limits of repetition would be significantly weakened if their repeat rate really were non-Poissonian and had a pink or red spectrum. Repetition and its statistics have implications for observing strategy, generally favouring shallow wide-field surveys, since in the non-repeating scenario survey depth is unimportant. We also discuss the statistics of the apparent latitudinal dependence of FRBs, and offer a simple method for calculating the significance of this effect. We provide a generalized Bayesian framework for addressing this problem, which allows for direct model comparison. It is shown how the evidence for a steep latitudinal gradient of the FRB rate is less strong than initially s...

  17. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

    Approved for public release; distribution unlimited. In this thesis we study the Marine Corps Tactical Aerial Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are drawn between our problem and recent work. A model for the problem, which we call the Multi...

  18. Repetitive elements in parasitic protozoa

    Directory of Open Access Journals (Sweden)

    Clayton Christine

    2010-05-01

    Full Text Available Abstract A recent paper published in BMC Genomics suggests that retrotransposition may be active in the human gut parasite Entamoeba histolytica. This adds to our knowledge of the various types of repetitive elements in parasitic protists and the potential influence of such elements on pathogenicity. See research article http://www.biomedcentral.com/1471-2164/11/321

  19. The repetition effect in building and construction works

    DEFF Research Database (Denmark)

    Gottlieb, Stefan Christoffer; Haugbølle, Kim

    are then applied on the Public Transport Authorities' main account structure of units and costs, and a method for assessing the possibilities of achieving effects of repetition for each account is described. Finally, the report summarises the core conditions necessary to take into consideration in relation......This report summarises the results from the work undertaken for the Public Transport Authority on the effect of learning and repetition in building and construction works. The results are applied by the Public Transport Authority in a new budgeting model, while the agency investigates...... the establishment of a new railway between Copenhagen and Ringsted. Drawing on an extensive literature review, the effect of repetition is determined to be in the range of 6-12 %. Further, the report identifies a series of factors affecting the possibilities of achieving effects of repetition. These factors...

  20. DSN Scheduling Engine

    Science.gov (United States)

    Clement, Bradley; Johnston, Mark; Wax, Allan; Chouinard, Caroline

    2008-01-01

    The DSN (Deep Space Network) Scheduling Engine targets all space missions that use DSN services. It allows clients to issue scheduling, conflict identification, conflict resolution, and status requests in XML over a Java Message Service interface. The scheduling requests may include new requirements that represent a set of tracks to be scheduled under some constraints. This program uses a heuristic local search to schedule a variety of schedule requirements, and is being infused into the Service Scheduling Assembly, a mixed-initiative scheduling application. The engine resolves conflicting schedules of resource allocation according to a range of existing and possible requirement specifications, including optional antennas; start of track and track duration ranges; periodic tracks; locks on track start, duration, and allocated antenna; MSPA (multiple spacecraft per aperture); arraying/VLBI (very long baseline interferometry)/delta DOR (differential one-way ranging); continuous tracks; segmented tracks; gap-to-track ratio; and override or block-out of requirements. The scheduling models now include conflict identification for SOA(start of activity), BOT (beginning of track), RFI (radio frequency interference), and equipment constraints. This software will search through all possible allocations while providing a best-effort solution at any time. The engine reschedules to accommodate individual emergency tracks in 0.2 second, and emergency antenna downtime in 0.2 second. The software handles doubling of one mission's track requests over one week (to 42 total) in 2.7 seconds. Further tests will be performed in the context of actual schedules.

  1. 附表计量法在工程预算编审中的应用研究%Application of Schedule Measurement Method in Engineering Budget Preparation and Audit

    Institute of Scientific and Technical Information of China (English)

    马行耀; 齐琳

    2014-01-01

    附表计量法主要是利用预先设计好的附表参数或计算结果作为工程量计算表中计算式计算式的方法。主要是在附表计量法中参照工程项目的计量特征进行独立设置的,因此不同的项目分布工程有着不同的计量附表。作为计算表附属的计量附表,在设置上可以相对灵活,还可以图文并茂,以便于预算的编制和审核,同样可以供工程施工管理相关人员使用,实现了一表通用、一表多用。通常我们在反复进行各个使用方法后,能够对计量附表中的错误进行及时纠正,以保证计量附表能够直接应用于计量全过程。%Schedule measurement method is a method that using pre planned schedule parameters or results as the engineering calculation formula method to calculate the type table. The main feature is measured reference project in schedule measurement method in the independent, therefore the different project distribution engineering with different measurement schedules. As the attached computing metering schedule, measurement schedule can be relative flexible in arrangement, also can be illustrated, easy to prepare and review budget, also can be used for engineering construction management personnel to achieve a universal and a multi-purpose. Usually using all methods, the error in the schedule can be corrected to ensure that the metering schedule can be directly applied to the whole measuring process.

  2. Reversal learning in C58 mice: Modeling higher order repetitive behavior.

    Science.gov (United States)

    Whitehouse, Cristina M; Curry-Pochy, Lisa S; Shafer, Robin; Rudy, Joseph; Lewis, Mark H

    2017-08-14

    Restricted, repetitive behaviors are diagnostic for autism and prevalent in other neurodevelopmental disorders. These behaviors cluster as repetitive sensory-motor behaviors and behaviors reflecting resistance to change. The C58 mouse strain is a promising model for these behaviors as it emits high rates of aberrant repetitive sensory-motor behaviors. The purpose of the present study was to extend characterization of the C58 model to resistance to change. This was done by comparing C58 to C57BL/6 mice on a reversal learning task under either a 100% or 80%/20% probabilistic reinforcement schedule. In addition, the effect of environmental enrichment on performance of this task was assessed as this rearing condition markedly reduces repetitive sensory-motor behavior in C58 mice. Little difference was observed between C58 and control mice under a 100% schedule of reinforcement. The 80%/20% probabilistic schedule of reinforcement generated substantial strain differences, however. Importantly, no strain difference was observed in acquisition, but C58 mice were markedly impaired in their ability to reverse their pattern of responding from the previously high density reinforcement side. Environmental enrichment did not impact acquisition under the probabilistic reinforcement schedule, but enriched C58 mice performed significantly better than standard housed C58 mice in reversal learning. Thus, C58 mice exhibit behaviors that reflect both repetitive sensory motor behaviors as well as behavior that reflects resistance to change. Moreover, both clusters of repetitive behavior were attenuated by environmental enrichment. Such findings, along with the reported social deficits in C58 mice, increase the translational value of this mouse model to autism. Copyright © 2017 Elsevier B.V. All rights reserved.

  3. Group Elevator Peak Scheduling Based on Robust Optimization Model

    Directory of Open Access Journals (Sweden)

    ZHANG, J.

    2013-08-01

    Full Text Available Scheduling of Elevator Group Control System (EGCS is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is realized without getting exact numbers of each calling floor's waiting passengers. Specifically, energy-saving oriented multi-objective scheduling price is proposed, RO uncertain peak scheduling model is built to minimize the price. Because RO uncertain model could not be solved directly, RO uncertain model is transformed to RO certain model by elevator scheduling robust counterparts. Because solution space of elevator scheduling is enormous, to solve RO certain model in short time, ant colony solving algorithm for elevator scheduling is proposed. Based on the algorithm, optimal scheduling solutions are found quickly, and group elevators are scheduled according to the solutions. Simulation results show the method could improve scheduling performances effectively in peak pattern. Group elevators' efficient operation is realized by the RO scheduling method.

  4. A refined, rapid and reproducible high resolution melt (HRM-based method suitable for quantification of global LINE-1 repetitive element methylation

    Directory of Open Access Journals (Sweden)

    Tse M Yat

    2011-12-01

    Full Text Available Abstract Background The methylation of DNA is recognized as a key mechanism in the regulation of genomic stability and evidence for its role in the development of cancer is accumulating. LINE-1 methylation status represents a surrogate measure of genome-wide methylation. Findings Using high resolution melt (HRM curve analysis technology, we have established an in-tube assay that is linear (r > 0.9986 with a high amplification efficiency (90-105%, capable of discriminating between partcipant samples with small differences in methylation, and suitable for quantifying a wide range of LINE-1 methylation levels (0-100%--including the biologically relevant range of 50-90% expected in human DNA. We have optimized this procedure to perform using 2 μg of starting DNA and 2 ng of bisulfite-converted DNA for each PCR reaction. Intra- and inter-assay coefficients of variation were 1.44% and 0.49%, respectively, supporting the high reproducibility and precision of this approach. Conclusions In summary, this is a completely linear, quantitative HRM PCR method developed for the measurement of LINE-1 methylation. This cost-efficient, refined and reproducible assay can be performed using minimal amounts of starting DNA. These features make our assay suitable for high throughput analysis of multiple samples from large population-based studies.

  5. A Decomposition and Coordination Scheduling Method for Flow-shop Problem Based on TOC%基于约束理论的Flow-shop分解协调算法

    Institute of Scientific and Technical Information of China (English)

    张宏远; 席裕庚; 谷寒雨

    2005-01-01

    There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on the analysis of FSPT and under the support of TOC (theory of constraint). A flow shop is at first decomposed into two subsystems named PULL and PUSH by means of bottleneck. Then the subsystem is decomposed into single machine scheduling problems,so the original NP-HARD problem can be transferred into a serial of single machine optimization problems finally. This method reduces the computational complexity, and has been used in a real project successfully.

  6. Research on massive data stream scheduling method under the condition of multimedia cloud computation%多媒体云计算下的大规模数据流调度方法研究

    Institute of Scientific and Technical Information of China (English)

    安海涛

    2015-01-01

    The traditional multimedia data stream scheduling method does not consider the difference of the server informa⁃tion scheduling in the cloud environment,and is easy to form the data scheduling conflict,which may result in low scheduling efficiency. In order to solve the problem of the above analysis,by constructing the data stream scheduling platform under the condition of multimedia cloud computation to achieve rational scheduling of multi⁃channel large⁃scale multimedia data stream,the massive data stream scheduling process of multiple servers in multimedia cloud computation is divided into management level, control level and data level by using multi⁃stage stratified structure,so as to ensure that the data packet is evenly assigned to each server,give full play to the parallel processing features of multiple servers in cloud computation,and enhance the scheduling quality of data stream. The software framework of dispatching platform is described in detail. According to the multi⁃level feature of software framework,the scheduling optimization of large⁃scale data stream is realized. The specific implementation process of massive data streams scheduling is analyzed. The design of the software code for massive data streams scheduling platform is giv⁃en. The experimental results indicate that the proposed method has enhanced the concurrent performance of massive data flow scheduling under the condition of multimedia cloud computation and improved the scheduling quality of data stream.%传统的多媒体数据流调度方法在云平台环境下,未考虑服务器信息调度的差异性,容易形成数据调度冲突,调度效率低。为了解决上述分析的问题,通过构建多媒体云计算下数据流调度平台,实现对多路大规模多媒体数据流的合理调度,利用多级分层结构将多媒体云计算下的多服务器大规模数据流调度过程划分成管理层面、控制层面以及数据层面,可确保将

  7. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

    Full Text Available Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem. The heuristic approach provides optimal solution for NP hard problems .The ant colony algorithm provides optimal solution. The existing ant colony algorithm takes more time to schedule the tasks. In this paper ant colony algorithm improved by enhancing pheromone updating rule such that it schedules the tasks efficiently and better resource utilization. The simulation results prove that proposed method reduces the execution time of tasks compared to existing ant colony algorithm.

  8. Flexible Personnel Scheduling in the Parallel Environment

    Institute of Scientific and Technical Information of China (English)

    XU Ben-zhu; ZHANG Xing-ling

    2014-01-01

    In the view of staff shortages and the huge inventory of products in the current market, we put forward a personnel scheduling model in the target of closing to the delivery date considering the parallelism. Then we designed a scheduling algorithm based on genetic algorithm and proposed a flexible parallel decoding method which take full use of the personal capacity. Case study results indicate that the flexible personnel scheduling considering the order-shop scheduling, machine automatic capabilities and personnel flexible in the target of closing to the delivery date optimize the allocation of human resources, then maximize the efficiency.

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

  10. Batch Scheduling a Fresh Approach

    Science.gov (United States)

    Cardo, Nicholas P.; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    The Network Queueing System (NQS) was designed to schedule jobs based on limits within queues. As systems obtain more memory, the number of queues increased to take advantage of the added memory resource. The problem now becomes too many queues. Having a large number of queues provides users with the capability to gain an unfair advantage over other users by tailoring their job to fit in an empty queue. Additionally, the large number of queues becomes confusing to the user community. The High Speed Processors group at the Numerical Aerodynamics Simulation (NAS) Facility at NASA Ames Research Center developed a new approach to batch job scheduling. This new method reduces the number of queues required by eliminating the need for queues based on resource limits. The scheduler examines each request for necessary resources before initiating the job. Also additional user limits at the complex level were added to provide a fairness to all users. Additional tools which include user job reordering are under development to work with the new scheduler. This paper discusses the objectives, design and implementation results of this new scheduler

  11. Repetition suppression and repetition priming are processing outcomes.

    Science.gov (United States)

    Wig, Gagan S

    2012-01-01

    Abstract There is considerable evidence that repetition suppression (RS) is a cortical signature of previous exposure to the environment. In many instances RS in specific brain regions is accompanied by improvements in specific behavioral measures; both observations are outcomes of repeated processing. In understanding the mechanism by which brain changes give rise to behavioral changes, it is important to consider what aspect of the environment a given brain area or set of areas processes, and how this might be expressed behaviorally.

  12. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    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.

  13. Cohesive Function of Lexical Repetition in Text

    Institute of Scientific and Technical Information of China (English)

    张莉; 卢沛沛

    2013-01-01

    Lexical repetition is the most direct form of lexical cohesion,which is the central device for making texts hang together. Although repetition is the most direct way to emphasize,it performs the cohesive effect more apparently.

  14. Grade repetition in primary school from teachers’ perspective

    Directory of Open Access Journals (Sweden)

    Malinić Dušica

    2011-01-01

    Full Text Available School underachievement is exhibited gradually, in different forms, while grade repetition figures as one of the most prominent forms of underachievement. In order to observe this phenomenon from different perspectives, we conducted a research aimed at identifying teacher attitudes towards grade repetition and grade repeaters in primary school, based on their perceptions of: (a the cause of grade repetition; (b the responsibility for grade repetition and (c grade repetition as an educational measure. The administered questionnaire was constructed for the purposes of the research, descriptive statistics was used, and data were obtained on the sample of 136 teachers from 31 primary schools from the territory of the City of Belgrade. The results point out to the conclusion that teachers perceive grade repetition as, first and foremost, the consequence of students’ lack of interest in school and learning and undisciplined behavior in class. By treating student underachievement mainly as a consequence of laziness, lack of motivation and insufficient effort, teachers transfer responsibility to others, assessing that the personal degree of responsibility for the underachievement of their students is very low. The responsibility for underachievement is perceived more as a problem of the student, his/her family, peer group, than as the problem of teachers themselves. The concluding part points out to certain teaching procedures and methods that have proved to be useful in the prevention of student underachievement.

  15. Properties of water surface discharge at different pulse repetition rates

    Energy Technology Data Exchange (ETDEWEB)

    Ruma,; Yoshihara, K. [Graduate School of Science and Technology, Kumamoto University, Kumamoto 860-8555 (Japan); Hosseini, S. H. R., E-mail: hosseini@kumamoto-u.ac.jp; Sakugawa, T.; Akiyama, H. [Graduate School of Science and Technology, Kumamoto University, Kumamoto 860-8555 (Japan); Institute of Pulsed Power Science, Kumamoto University, Kumamoto 860-8555 (Japan); Akiyama, M. [Department of Electrical and Electronic Engineering, Kagoshima University, Kagoshima 890-0065 (Japan); Lukeš, P. [Institute of Plasma Physics, AS CR, Prague, Prague 18200 (Czech Republic)

    2014-09-28

    The properties of water surface discharge plasma for variety of pulse repetition rates are investigated. A magnetic pulse compression (MPC) pulsed power modulator able to deliver pulse repetition rates up to 1000 Hz, with 0.5 J per pulse energy output at 25 kV, was used as the pulsed power source. Positive pulse with a point-to-plane electrode configuration was used for the experiments. The concentration and production yield of hydrogen peroxide (H₂O₂) were quantitatively measured and orange II organic dye was treated, to evaluate the chemical properties of the discharge reactor. Experimental results show that the physical and chemical properties of water surface discharge are not influenced by pulse repetition rate, very different from those observed for under water discharge. The production yield of H₂O₂ and degradation rate per pulse of the dye did not significantly vary at different pulse repetition rates under a constant discharge mode on water surface. In addition, the solution temperature, pH, and conductivity for both water surface and underwater discharge reactors were measured to compare their plasma properties for different pulse repetition rates. The results confirm that surface discharge can be employed at high pulse repetition rates as a reliable and advantageous method for industrial and environmental decontamination applications.

  16. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...... of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...

  17. Shaping Academic Task Engagement with Percentile Schedules

    Science.gov (United States)

    Athens, Elizabeth S.; Vollmer, Timothy R.; St. Peter Pipkin, Claire C.

    2007-01-01

    The purpose of this study was to examine the use of percentile schedules as a method of quantifying the shaping procedure in an educational setting. We compared duration of task engagement during baseline measurements for 4 students to duration of task engagement during a percentile schedule. As a secondary purpose, we examined the influence on…

  18. A mouse model of human repetitive mild traumatic brain injury

    OpenAIRE

    Kane, Michael J; Pérez, Mariana Angoa; Briggs, Denise I.; Viano, David C.; Kreipke, Christian W.; Kuhn, Donald M.

    2011-01-01

    A novel method for the study of repetitive mild traumatic brain injury (rmTBI) that models the most common form of head injury in humans is presented. Existing animal models of TBI impart focal, severe damage unlike that seen in repeated and mild concussive injuries, and few are configured for repetitive application. Our model is a modification of the Marmarou weight drop method and allows repeated head impacts to lightly anesthetized mice. A key facet of this method is the delivery of an imp...

  19. Application of Fuzzy theory to project scheduling with critical path ...

    African Journals Online (AJOL)

    Application of Fuzzy theory to project scheduling with critical path method. ... Journal of Applied Sciences and Environmental Management. Journal Home · ABOUT ... In this paper, we analyze the project scheduling problem using fuzzy theory.

  20. Resistance to change of operant variation and repetition.

    Science.gov (United States)

    Doughty, A H; Lattal, K A

    2001-09-01

    A multiple chained schedule was used to compare the relative resistance to change of variable and fixed four-peck response sequences in pigeons. In one terminal link, a response sequence produced food only if it occurred infrequently relative to 15 other response sequences (vary). In the other terminal link, a single response sequence produced food (repeat). Identical variable-interval schedules operated in the initial links. During baseline, lower response rates generally occurred in the vary initial link, and similar response and reinforcement rates occurred in each terminal link. Resistance of responding to prefeeding and three rates of response-independent food delivered during the intercomponent intervals then was compared between components. During each disruption condition, initial- and terminal-link response rates generally were more resistant in the vary component than in the repeat component. During the response-independent food conditions, terminal-link response rates were more resistant than initial-link response rates in each component, but this did not occur during prefeeding. Variation (in vary) and repetition (in repeat) both decreased during the response-independent food conditions in the respective components, but with relatively greater disruption in repeat. These results extend earlier findings demonstrating that operant variation is more resistant to disruption than is operant repetition and suggest that theories of response strength, such as behavioral momentum theory, must consider factors other than reinforcement rate. The implications of the results for understanding operant response classes are discussed.

  1. 云环境下仿真平台资源调度方法的研究%Research on Resource Scheduling Method of Simulated Platform in Cloud Environment

    Institute of Scientific and Technical Information of China (English)

    李丹程; 魏东宇; 金维鹏; 刘湃

    2012-01-01

    This paper studied the cloud resource scheduling method is studied. Combining with the operational characteristics, a new method is proposed. The method uses the theory of fuzzy clustering to classify the resources. It is based on the improved genetic algorithm to obtain the priority queue of the combination of resources of tasks. The improved Min-min algorithm combining with the priority queue of the combination of resources are used to complete the resource dynamic scheduling of tasks in the task queue. At last, the cloud resource scheduling method is applied to the departure scheduling module in the system of Air Traffic Management. After the experimental results are compared using the method in this thesis and the non-preemptive priority scheduling method, the statistical experimental results verifies the effectiveness and practicality of the cloud scheduling method which is proposed by this thesis.%针对常用的云资源调度方法进行研究,并结合其业务特点,提出一种新的调度方法.该方法采用模糊聚类的方式将云平台资源聚类划分,根据改进的遗传算法求得任务的资源组合优先级队列,用改进的Min-min算法并结合资源组合优先级队列完成任务队列中任务的资源动态调度.最后将此调度方法应用到航空交通管理系统仿真平台中的离港调度模块中,采用对比的方法比较使用本文方法与非抢占式优先级调度方法的实验结果,对实验结果统计和分析,验证本文提出的云资源调度方法的有效性与实用性.

  2. Widening the Schedulability Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

    Boudjadar, Jalil; David, Alexandre; Kim, Jin Hyun

    2014-01-01

    the supply of resources in each component. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets. We also provide a way to estimate the minimum resource supply (budget) that a component...

  3. Interval Scheduling: A Survey

    NARCIS (Netherlands)

    Kolen, A.W.J.; Lenstra, J.K.; Papadimitriou, C.H.; Spieksma, F.C.R.

    2007-01-01

    In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability o

  4. Scheduling: Seven Period Day

    Science.gov (United States)

    Williamson, Ronald

    2010-01-01

    Driven by stable or declining financial resources many school districts are considering the costs and benefits of a seven-period day. While there is limited evidence that any particular scheduling model has a greater impact on student learning than any other, it is clear that the school schedule is a tool that can significantly impact teacher…

  5. Automated scheduling and planning from theory to practice

    CERN Document Server

    Ozcan, Ender; Urquhart, Neil

    2013-01-01

      Solving scheduling problems has long presented a challenge for computer scientists and operations researchers. The field continues to expand as researchers and practitioners examine ever more challenging problems and develop automated methods capable of solving them. This book provides 11 case studies in automated scheduling, submitted by leading researchers from across the world. Each case study examines a challenging real-world problem by analysing the problem in detail before investigating how the problem may be solved using state of the art techniques.The areas covered include aircraft scheduling, microprocessor instruction scheduling, sports fixture scheduling, exam scheduling, personnel scheduling and production scheduling.  Problem solving methodologies covered include exact as well as (meta)heuristic approaches, such as local search techniques, linear programming, genetic algorithms and ant colony optimisation.The field of automated scheduling has the potential to impact many aspects of our lives...

  6. 78 FR 12755 - Federal Acquisition Regulation; Submission for OMB Review; Schedules for Construction Contracts

    Science.gov (United States)

    2013-02-25

    ... Regulation; Submission for OMB Review; Schedules for Construction Contracts AGENCY: Department of Defense... collection requirement concerning schedules for construction contracts. A notice was published in the Federal..., Schedules for Construction Contracts by any of the following methods: Regulations.gov :...

  7. Repetitive control of electrically driven robot manipulators

    Science.gov (United States)

    Fateh, Mohammad Mehdi; Ahsani Tehrani, Hojjat; Karbassi, Seyed Mehdi

    2013-04-01

    This article presents a novel robust discrete repetitive control of electrically driven robot manipulators for tracking of a periodic trajectory. We propose a novel model, which presents the highly non-linear dynamics of robot manipulator in the form of linear discrete-time time-varying system. Based on the proposed model, we develop a two-term control law. The first term is an ordinary time-optimal and minimum-norm (TOMN) control by employing parametric controllers to guarantee stability. The second term is a novel robust control to improve the control performance in the face of uncertainties. The robust control estimates and compensates uncertainties including the parametric uncertainty, unmodelled dynamics and external disturbances. Performance of the proposed method is compared with two discrete methods, namely the TOMN control and an adaptive iterative learning (AIL) control. Simulation results confirm superiority of the proposed method in terms of the convergence speed and precision.

  8. Building Better Nurse Scheduling Algorithms

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

    The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence building better scheduling algorithms by identifying successful algorithm modifications. The comparison method captures the results of algorithms in a single figure that can then be compared using traditional statistical techniques. Thus, the proposed method of comparing algorithms is an objective procedure designed to assist in the process of improving an algorithm. This is achieved even when some results are non-numeric or missing due to infeasibility. The final algorithm outperforms all previous evolutionary algorithms, which relied on human expertise for modification.

  9. Circuit considerations for repetitive railguns

    Energy Technology Data Exchange (ETDEWEB)

    Honih, E.M.

    1986-01-01

    Railgun electromagnetic launchers have significant military and scientific potential. They provide direct conversion of electrical energy to projectile kinetic energy, and they offer the hope of achieving projectile velocities greatly exceeding the limits of conventional guns. With over 10 km/sec already demonstrated, railguns are attracting attention for tactical and strategic weapons systems and for scientific equation-of-state research. The full utilization of railguns will require significant improvements in every aspect of system design - projectile, barrel, and power source - to achieve operation on a large scale. This paper will review fundamental aspects of railguns, with emphasis on circuit considerations and repetitive operation.

  10. Request-Driven Schedule Automation for the Deep Space Network

    Science.gov (United States)

    Johnston, Mark D.; Tran, Daniel; Arroyo, Belinda; Call, Jared; Mercado, Marisol

    2010-01-01

    The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.

  11. Approximation algorithm for multiprocessor parallel job scheduling

    Institute of Scientific and Technical Information of China (English)

    陈松乔; 黄金贵; 陈建二

    2002-01-01

    Pk|fix|Cmax problem is a new scheduling problem based on the multiprocessor parallel job, and it is proved to be NP-hard problem when k≥3. This paper focuses on the case of k=3. Some new observations and new techniques for P3|fix|Cmax problem are offered. The concept of semi-normal schedulings is introduced, and a very simple linear time algorithm Semi-normal Algorithm for constructing semi-normal schedulings is developed. With the method of the classical Graham List Scheduling, a thorough analysis of the optimal scheduling on a special instance is provided, which shows that the algorithm is an approximation algorithm of ratio of 9/8 for any instance of P3|fix|Cmax problem, and improves the previous best ratio of 7/6 by M.X.Goemans.

  12. Concurrent Scheduling of Event-B Models

    CERN Document Server

    Boström, Pontus; Sere, Kaisa; Waldén, Marina; 10.4204/EPTCS.55.11

    2011-01-01

    Event-B is a refinement-based formal method that has been shown to be useful in developing concurrent and distributed programs. Large models can be decomposed into sub-models that can be refined semi-independently and executed in parallel. In this paper, we show how to introduce explicit control flow for the concurrent sub-models in the form of event schedules. We explore how schedules can be designed so that their application results in a correctness-preserving refinement step. For practical application, two patterns for schedule introduction are provided, together with their associated proof obligations. We demonstrate our method by applying it on the dining philosophers problem.

  13. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

    Full Text Available This study examined the effects of a tri-schedule on the academic achievement of students in a high school. The tri-schedule consists of traditional, 4x4 block, and hybrid schedules running at the same time in the same high school. Effectiveness of the schedules was determined from the state mandated test of basic skills in reading, language, and mathematics. Students who were in a particular schedule their freshman year were tested at the beginning of their sophomore year. A statistical ANCOVA test was performed using the schedule types as independent variables and cognitive skill index and GPA as covariates. For reading and language, there was no statistically significant difference in test results. There was a statistical difference mathematics-computation. Block mathematics is an ideal format for obtaining more credits in mathematics, but the block format does little for mathematics achievement and conceptual understanding. The results have content specific implications for schools, administrations, and school boards who are considering block scheduling adoption.

  14. Generator scheduling under competitive environment using genetic ...

    African Journals Online (AJOL)

    DR OKE

    Some hybrid methods are GA and artificial ...... Market Operations in Electric Power Systems: forecasting, scheduling, and risk ... artificial intelligence applications to power system optimization problems, evolutionary computation, neural ...

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

  16. Resource-Driven Scheduling Implementation in Malaysian Construction Industry

    Directory of Open Access Journals (Sweden)

    Aftab Hameed Memon

    2011-07-01

    Full Text Available Resource-driven scheduling techniques focus on resource. Their objective is to schedule activities so that a project dead line is met using predefined resource availability limits. This paper reports about the status of resource-driven scheduling implementation in Malaysian construction industry. An investigation Survey was conducted to determine the level of resource-driven scheduling and factors affecting the concerned implementation. Construction Firm registered under G7 (A Class, G6 (B class and G5 (C class were used in investigation. Data was analyzed by Statistical package SPSS to find the means and rank. Average index method was adapted to for the level of features of resource scheduling implementation and barrier to resource-driven scheduling. It is significant 59.65% firms are implementing resource-driven scheduling as partial. Also methods of project scheduling and resource options adopted were investigated. A Significant majority of construction firms (approximately 65% adopt Microsoft project for scheduling. Study showed that the features of resource scheduling are being implemented at Medium Level. Lack of understanding / awareness of concepts, lack of genuine commitment, lack of coordination of key personnel and Lack of coordination of constructors consultants were found major factors that affect resource-driven scheduling. While, expensive to prepare is most contributing factor, no enforcement on schedules from authority, difficult to prepare and hurdles by personnel/authorities were found as major constraints in implementing resource driven scheduling.

  17. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  18. The shop floor scheduling game

    NARCIS (Netherlands)

    Riezebos, Jan; Slomp, Jannes

    1995-01-01

    The aim of the shop floor scheduling game is getting participants acquainted with: - developing robust planning and scheduling procedures; - accepting orders under uncertainty and competition; - using information from cost accounting in scheduling; - creating an adequate communication structure

  19. 震灾应急对策时刻表编制方法研究%Establishing Method of Earthquake Disaster Response Time Schedule

    Institute of Scientific and Technical Information of China (English)

    王海鹰; 孙刚; 欧阳春; 陈思羽; 赖俊彦

    2014-01-01

    为了进一步提高地震灾害应急处置能力,我国于2012年8月颁布修订后的《国家地震应急预案》,新版预案充分吸取了汶川、玉树等抗震救灾经验,并在芦山7.0级等地震应急工作中发挥了重要作用。但是在实际工作中,地震应急预案仍存在一些问题,包括编制时对涉及的灾害程度估计不足,定位不准、实施过程中部门间协调不够顺畅,部分条文过于原则、缺乏可操作性等。针对以上问题,引入美国“事件后回顾方法(After Ac-tion Review)”和日本“新!县震灾应急对策时刻表(Time Schedule)”,提出改进建议以促进地震应急预案的发展和完善。%In order to improve on the ability of earthquake disaster response and management,China issued the new version of The National Earthquake Emergency Plan in August 2012 based on the experience of Wenchuan and Yushu earthquake emergency management,and it also played an important role in Lushan M7.0 earthquake in April 2013.However,there are some shortages of the plan in practical work,including insufficient damage and loss assessment of disaster level,hindered cooperation between departments in headquarters,over principled of some terms in emergency plan,lack of operability,etc.To solve the above problems,After Action Review method using in American Army and Earthquake Disaster Response Time Schedule of Niigata,Japan are introduced to ac-celerate the development and modification of the emergency plan.

  20. Understanding work related musculoskeletal pain: does repetitive work cause stress symptoms?

    DEFF Research Database (Denmark)

    Bonde, J. P.; Mikkelsen, S.; Andersen, JH

    2005-01-01

    for development of regional pain in repetitive work, stress symptoms would likely be on the causal path. AIMS: To examine whether objective measures of repetitive monotonous work are related to occurrence and development of stress symptoms. METHODS: In 1994-95, 2033 unskilled workers with continuous repetitive...... work and 813 workers with varied work were enrolled. Measures of repetitiveness and force requirements were quantified using video observations to obtain individual exposure estimates. Stress symptoms were recorded at baseline and after approximately one, two, and three years by the Setterlind Stress...... Profile Inventory. RESULTS: Repetitive work, task cycle time, and quantified measures of repetitive upper extremity movements including force requirements were not related to occurrence of stress symptoms at baseline or development of stress symptoms during three years of follow up. CONCLUSIONS...

  1. Risk Assessment and Optimization Method for Markov Chain-based Scheduling Operations%基于马尔可夫链的调度操作流程风险评估及优选方法

    Institute of Scientific and Technical Information of China (English)

    侯恺; 曾沅; 贾宏杰; 卢恩; 刘嘉宁; 呼士召

    2015-01-01

    A Markov chain-based scheduling operations hierarchical risk assessment method is proposed.The characteristics of two major influencing factors of scheduling operations,which are operation result of each step and facility failures,are analyzed and decoupled with the hierarchical method.In the external layer,Markov chain is used to simulate the evaluation of system topologies during scheduling operations and achieve their probability distributions.In the internal layer,the state enumeration method is used to calculate risk indices of each system topology.By calculating the weighted sum of all system topologies according to the probability distribution of each operation step,final indices of scheduling operations will be obtained.The proposed approach is able to assess risk indices of scheduling operation efficiently and accurately,and provide index support for operators to optimize scheduling operations.Case studies based on a modified IEEE reliability test system and a practical system demonstrate the validity,effectiveness and utility value of the proposed approach.%提出了一种基于马尔可夫链调度操作流程风险评估及优选方法。分析了影响调度操作风险水平的两类主要因素(各步操作结果、设备故障)的特点,并利用分层方法将二者解耦处理:外层利用马尔可夫链模拟调度操作过程中系统拓扑的变化,并计算各环节对应系统拓扑的概率分布;内层利用状态枚举法计算各系统拓扑对应风险指标,并按外层所得概率分布加权求和,得到各操作环节及整体操作流程的风险指标,基于所得指标,可量化分析不同调度操作流程风险差异。该方法能够快速准确计算调度操作风险指标,为调度工作人员优选操作流程提供指标支持。测试系统及实际系统算例验证了所述方法的正确性、高效性和实用性。

  2. Risk factors for hand-wrist disorders in repetitive work

    DEFF Research Database (Denmark)

    Thomsen, J. F.; Mikkelsen, S.; Andersen, JH

    2007-01-01

    (wrist pain and palpation tenderness) were determined in 3123 employees in 19 industrial settings. With the use of questionnaires and video recordings of homogenous work tasks number of wrist movements, hand force requirements and wrist position were analysed as risk factors for hand-wrist disorders......OBJECTIVES: To identify the risk of hand-wrist disorders related to repetitive movements, use of hand force and wrist position in repetitive monotonous work. METHODS: Using questionnaires and physical examinations, the prevalence and incidence of hand-wrist pain and possible extensor tendonitis...... were less consistent. Working with the hand in a non-neutral position could not be identified as a risk factor...

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

  4. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

  5. CERN confirms LHC schedule

    CERN Multimedia

    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.

  6. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

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

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff...... 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...

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

  8. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    Despite several attempts to accurately predict duration and cost of software projects, initial plans still do not reflect real-life situations. Since commitments with customers are usually decided based on these initial plans, software companies frequently fail to deliver on time and many projects...... 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...

  9. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

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

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

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

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

  12. CMS Records Schedule

    Data.gov (United States)

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

  13. Resource Minimization Job Scheduling

    Science.gov (United States)

    Chuzhoy, Julia; Codenotti, Paolo

    Given a set J of jobs, where each job j is associated with release date r j , deadline d j and processing time p j , our goal is to schedule all jobs using the minimum possible number of machines. Scheduling a job j requires selecting an interval of length p j between its release date and deadline, and assigning it to a machine, with the restriction that each machine executes at most one job at any given time. This is one of the basic settings in the resource-minimization job scheduling, and the classical randomized rounding technique of Raghavan and Thompson provides an O(logn/loglogn)-approximation for it. This result has been recently improved to an O(sqrt{log n})-approximation, and moreover an efficient algorithm for scheduling all jobs on O((OPT)^2) machines has been shown. We build on this prior work to obtain a constant factor approximation algorithm for the problem.

  14. ROBUST REPETITIVE CONTROL FOR IMPROVING RATE SMOOTHNESS OF TEST TURNTABLE

    Institute of Scientific and Technical Information of China (English)

    LIUYu; ZENGMing; SUBao-ku

    2005-01-01

    A robust repetitive control scheme is used to improve the rate smoothness of a brushless DC motor (BLDCM) driven test turntable. The method synthesizes variable structure control (VSC) laws and repetitive control (RC) laws in a complementary manner. The VSC strategy can stabilize the system and suppress uncertainties, such as the aperiodic disturbance and noises, while RC strategy can eliminate the periodic rate fluctuation in a steady state. The convergence of the repetitive learning process is also guaranteed by VSC. A general nonlinear system model is discussed. The model can be considered as an extension of BLDCMs. The stability and asymptotic position tracking performance are validated by using Lyapunov functions. Simulation results show the effectiveness of the proposed approach for improving the rate smoothness.

  15. Effects of repetition and temperature on Contingent Electrical Stimulation

    DEFF Research Database (Denmark)

    Castrillon, Eduardo E.; Zhou, Xinwen; Svensson, Peter

    Effects of repetition and temperature on Contingent Electrical Stimulation. E.E. Castrillon W1, 2, Xinwen Zhou 3, P. Svensson1, 2, 4 1 Department of Dentistry and Oral Health, Section of Orofacial Pain and Jaw Function, Aarhus University, Denmark2 Scandinavian Center for Orofacial Neuroscience...... (SCON)3 Department of Dentistry, Beijing Shijitan Hospital, Capital Medical University, Beijing, China. 4 Department of Dental Medicine, Karolinska Institutet, Huddinge, Sweden  Background: Contingent electrical stimulation (CES) of the facial skin has been shown to reduce electromyographic (EMG......) activity associated with bruxism. Repetition of the electrical stimulus and skin surface temperature (ST) may affect the perception of CES and possibly also the inhibitory EMG effects.Objectives: To determine the effects of stimulus repetition and skin ST on the perception of CES.  Methods: Healthy...

  16. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

    The schedule for the installation of the PAR slurry loop experiment in the South Facility of the ORR has been reviewed and revised. The design, fabrications and Installation is approximately two weeks behind schedule at this time due to many factors; however, indications are that this time can be made up. Design is estimated to be 75% complete, fabrication 32% complete and installation 12% complete.

  17. Chaos genetic programming method for job-shop scheduling problem%一种求解车间调度问题的混沌遗传规划方法

    Institute of Scientific and Technical Information of China (English)

    周强; 崔逊学

    2011-01-01

    作业车间调度问题是制造业的一个经典 NP-hard 组合优化难题.提出一种基于混沌遗传规划的调度算法,利用遗传规划进行染色体的结构设计,采用混沌序列改善初始种群质量,利用混沌扰动来维持进化群体的多样性,并自适应调整个体权重,使算法具有优良的综合求解性能.实验表明,算法对典型的标准调度测试问题具有较强的全局搜索能力,甘特图表明其获得的最优解优于当前已知的最优解历史记录,对比结果表明了该方法的有效性.%The job-shop scheduling problem is an NP-hard combinational optimization problem in the manufacturing field. The paper proposes a job-shop scheduling algorithm based on chaos genetic programming. Genetic programming is adopted to design a chromosome structure,the chaos sequence method is used to improve the quality of initial population,chaos disturbances are taken to maintain the diversity of evolutionary population, and the self-adaptive adjusting method of individual weight is applied.Accordingly the proposed algorithm has a comprehensive solving capacity for a scheduling problem. Simulation experiments show that it has better ability to find the global optimum for several typical scheduling testing benchmarks. The results of Gantt charts point out that the optimum solutions obtained by this novel algorithm are better than the historic ones. The comparison of the results reveals the feasibility and efficiency of the method.

  18. Digital repetitive control under varying frequency conditions

    OpenAIRE

    Ramos Fuentes, Germán Andrés

    2012-01-01

    The tracking/rejection of periodic signals constitutes a wide field of research in the control theory and applications area and Repetitive Control has proven to be an efficient way to face this topic; however, in some applications the period of the signal to be tracked/rejected changes in time or is uncertain, which causes and important performance degradation in the standard repetitive controller. This thesis presents some contributions to the open topic of repetitive control workin...

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

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

  1. [Repetition and fear of dying].

    Science.gov (United States)

    Lerner, B D

    1995-03-01

    In this paper a revision is made of the qualifications of Repetition (R) in Freuds work, i.e. its being at the service of the Pleasure Principle and, beyond it, the binding of free energy due to trauma. Freud intends to explain with this last concept the "fort-da" and the traumatic dreams (obsessively reiterated self-reproaches may be added to them). The main thesis of this work is that R. is not only a defense against the recollection of the ominous past (as in the metaphorical deaths of abandonment and desertion) but also a way of maintaining life and identify fighting against the inescapable omninous future (known but yet experienced), i.e. our own death. Some forms of R. like habits, identificatory behaviors and sometimes even magic, are geared to serve the life instinct. A literary illustration shows this desperate fight.

  2. Pressure rig for repetitive casting

    Science.gov (United States)

    Vasquez, Peter (Inventor); Hutto, William R. (Inventor); Philips, Albert R. (Inventor)

    1989-01-01

    The invention is a pressure rig for repetitive casting of metal. The pressure rig performs like a piston for feeding molten metal into a mold. Pressure is applied to an expandable rubber diaphragm which expands like a balloon to force the metal into the mold. A ceramic cavity which holds molten metal is lined with blanket-type insulating material, necessitating only a relining for subsequent use and eliminating the lengthy cavity preparation inherent in previous rigs. In addition, the expandable rubber diaphragm is protected by the insulating material thereby decreasing its vulnerability to heat damage. As a result of the improved design the life expectancy of the pressure rig contemplated by the present invention is more than doubled. Moreover, the improved heat protection has allowed the casting of brass and other alloys with higher melting temperatures than possible in the conventional pressure rigs.

  3. 基于微粒群算法的柔性作业车间调度方法%Methods of Solving Flexible Job Shop Scheduling Problems Based on Particle Swarm Optimization

    Institute of Scientific and Technical Information of China (English)

    胡乃平; 王培丽

    2011-01-01

    针对以最小化完工时间为目标的柔性作业车间调度问题,提出了一种基于微粒群算法的求解方法.该方法利用二元组粒子的形式并采用基于扩展工序和优先规则的编码方法,解决了工序调度的优先级问题和机器分配问题;应用动态惯性权重系数提高了算法的收敛速度.实验仿真证明了该方法可以有效地解决偏柔性作业车间调度问题.%A new method based on particle swarm optimization is proposed to deal with minimizing completion time of flexible job shop scheduling problems. In this method, particle is presented in the form of binary group. Encoding process based on extended operation and priority rule is designed to solve process scheduling priority issues and machinery distribution. Besides, the dynamic inertia weight factor is used to improve the convergence speed of the algorithm. The simulation experiment results indicate that the proposed algorithm is an efficient for the flexible job shop scheduling problems.

  4. Randomization of Symbol Repetition of Punch Cards with Superimposed Coding in Information-Search Systems.

    Science.gov (United States)

    Pirovich, L. Ya

    The article shows the effect of the irregularity of using separate symbols on search noise on punch cards with superimposed symbol coding in information-search system (IPS). A binomial law of random value distribution of repetition of each symbol is established and analyzed. A method of determining the maximum value of symbol repetition is…

  5. Facilitating memory for novel characters by reducing neural repetition suppression in the left fusiform cortex.

    Directory of Open Access Journals (Sweden)

    Gui Xue

    Full Text Available BACKGROUND: The left midfusiform and adjacent regions have been implicated in processing and memorizing familiar words, yet its role in memorizing novel characters has not been well understood. METHODOLOGY/PRINCIPAL FINDINGS: Using functional MRI, the present study examined the hypothesis that the left midfusiform is also involved in memorizing novel characters and spaced learning could enhance the memory by enhancing the left midfusiform activity during learning. Nineteen native Chinese readers were scanned while memorizing the visual form of 120 Korean characters that were novel to the subjects. Each character was repeated four times during learning. Repetition suppression was manipulated by using two different repetition schedules: massed learning and spaced learning, pseudo-randomly mixed within the same scanning session. Under the massed learning condition, the four repetitions were consecutive (with a jittered inter-repetition interval to improve the design efficiency. Under the spaced learning condition, the four repetitions were interleaved with a minimal inter-repetition lag of 6 stimuli. Spaced learning significantly improved participants' performance during the recognition memory test administered one hour after the scan. Stronger left midfusiform and inferior temporal gyrus activities during learning (summed across four repetitions were associated with better memory of the characters, based on both within- and cross-subjects analyses. Compared to massed learning, spaced learning significantly reduced neural repetition suppression and increased the overall activities in these regions, which were associated with better memory for novel characters. CONCLUSIONS/SIGNIFICANCE: These results demonstrated a strong link between cortical activity in the left midfusiform and memory for novel characters, and thus challenge the visual word form area (VWFA hypothesis. Our results also shed light on the neural mechanisms of the spacing effect in

  6. Transdiagnostic Treatment of Co-occurrence of Anxiety and Depressive Disorders based on Repetitive Negative Thinking: A Case Series

    Directory of Open Access Journals (Sweden)

    Mehdi Akbari

    2015-11-01

    Full Text Available  Objective: The transdiagnostic cognitive behavioral treatments for treating the coexistence of anxiety and mood disorders received useful empirical supports in the recent years. However, these treatments still have moderate efficacy. Following the improvements and developments in transdiagnostic protocols and considering the importance of repetitive negative thinking as a core transdiagnostic factor in emotional disorders, this study examined a new form of transdiagnostic treatment based on Repetitive Negative Thinking (TTRNT of co-occurrence of anxiety and depressive disorders.  Methods:Treatment efficacy was assessed using single case series with multiple baselines. Three patients meeting the criteria for co-occurrence of anxiety and depressive disorders were selected using the Anxiety Disorders Interview Schedule for DSM-IV. The patients were treated individually for 12 weekly sessions. Participants completed the standardized outcome measures during the baseline, treatment and one-month follow-up. Results:At post-treatment, all participants showed significant clinical changes on a range of standardized outcome measures, and these gains were largely maintained through the one-month follow-up both in the principle and co-principal diagnosis. Conclusions:Although the results of this preliminary investigation indicated that TTRNT could be a time effective and efficient treatment for individuals with co-occurrence of anxiety and depressive disorders, further controlled clinical trials are necessary to examine this new treatment approach.

  7. Security Evaluation and Auxiliary Decision-making Method for Integrated Generation and Transmission Outage Schedule%发输电一体化检修计划安全评估与辅助决策方法

    Institute of Scientific and Technical Information of China (English)

    谢丽荣; 杨争林; 张淳; 环加飞

    2012-01-01

    In light of the current status of outage schedule based mostly on experience, security evaluation and optimization method of outage schedule based on bus load supply adequacy (LSA) and equivalent generation capacity loss (EGCL) is proposed with practical engineering computation method studied in detail. Besides, quantization security evaluation and optimization of outage schedule is implemented. By the results of sensitivity analysis based on the net model topology, the load supply adequacy (LSA) and equivalent generation capacity loss (EGCL) are calculated. This method is instructive for the outage schedule and has been applied in integrative optimization and management of outage schedule. The feasibility of this method is proved by engineering application.%检修计划编制过程中需要对设定检修方式下的系统运行状态进行安全评估,而目前检修计划编制缺乏必要的安全分析手段,过度依赖经验,难以适应大电网运行控制需要。提出基于母线负荷供应充裕度和等效发电容量损失指标的检修计划评估与安全辅助方法。利用网络拓扑灵敏度分析技术计算满足静态安全约束的母线负荷供应充裕度和等效发电容量损失,并根据该指标评估检修计划的安全性。该方法已在某区域电网检修计划优化管理系统中得到应用,结果表明该方法能够为计划编制人员提供指导性意见。

  8. Effect of repetitive mckenzie lumbar spine exercises on cardiovascular system

    Directory of Open Access Journals (Sweden)

    Agrawal Sonal S

    2014-07-01

    Full Text Available Background & Purpose: McKenzie exercises for the lumbar spine, which are done repeatedly, such as flexion in standing (FIS, extension in standing flexion in lying (FIL & extension in lying (EIL have been used in the management of low back pain for over three decades. The cardiovascular effects of exercises that involve postural stabilization, arm exercises and of exercises performed in lying are well known, but there are seldom studies performed to assess the cardiovascular effects of these commonly used McKenzie exercises. Therefore the study focused on evaluating the effects of 4 commonly used McKenzie exercises on the cardiovascular system. Methods: 80 subjects in the age group of 20-59 years were randomly assigned into 4 groups according to their age, such that such that each group comprised of an equal number of subjects & equal number of males & females. Each subject performed all the 4 exercises (FIS, EIS, FIL & EIL for 10, 15 & 20 repetitions respectively. Heart rate, blood pressure & rate pressure product were recorded before & after each set of repetitions & after each type of exercise. Results: Repetitive McKenzie lumbar spine exercises had cardiovascular effects in apparently healthy subjects (both male & female. Exercises performed in lying were hemodynamically more demanding than that performed in standing, also exercises involving flexion of the lumbar spine elicited greater cardiovascular demand as compared to extension exercises i.e. FIL>EIL>FIS>EIS irrespective of the number of repetitions, 10, 15 or 20. The cardiovascular demand for a given subject increased as the number of repetitions increased, for all the 4 exercises. Conclusion: McKenzie exercises when done repetitively have cardiovascular effects in healthy subjects.

  9. Downlink Scheduling for Multiclass Traffic in LTE

    Directory of Open Access Journals (Sweden)

    Madan Ritesh

    2009-01-01

    Full Text Available We present a design of a complete and practical scheduler for the 3GPP Long Term Evolution (LTE downlink by integrating recent results on resource allocation, fast computational algorithms, and scheduling. Our scheduler has low computational complexity. We define the computational architecture and describe the exact computations that need to be done at each time step (1 milliseconds. Our computational framework is very general, and can be used to implement a wide variety of scheduling rules. For LTE, we provide quantitative performance results for our scheduler for full buffer, streaming video (with loose delay constraints, and live video (with tight delay constraints. Simulations are performed by selectively abstracting the PHY layer, accurately modeling the MAC layer, and following established network evaluation methods. The numerical results demonstrate that queue- and channel-aware QoS schedulers can and should be used in an LTE downlink to offer QoS to a diverse mix of traffic, including delay-sensitive flows. Through these results and via theoretical analysis, we illustrate the various design tradeoffs that need to be made in the selection of a specific queue-and-channel-aware scheduling policy. Moreover, the numerical results show that in many scenarios strict prioritization across traffic classes is suboptimal.

  10. Comparing repetition-based melody segmentation models

    NARCIS (Netherlands)

    Rodríguez López, M.E.; de Haas, Bas; Volk, Anja

    2014-01-01

    This paper reports on a comparative study of computational melody segmentation models based on repetition detection. For the comparison we implemented five repetition-based segmentation models, and subsequently evaluated their capacity to automatically find melodic phrase boundaries in a corpus of 2

  11. Task Repetition and Second Language Speech Processing

    Science.gov (United States)

    Lambert, Craig; Kormos, Judit; Minn, Danny

    2017-01-01

    This study examines the relationship between the repetition of oral monologue tasks and immediate gains in L2 fluency. It considers the effect of aural-oral task repetition on speech rate, frequency of clause-final and midclause filled pauses, and overt self-repairs across different task types and proficiency levels and relates these findings to…

  12. Repetitions: A Cross-Cultural Study.

    Science.gov (United States)

    Murata, Kumiko

    1995-01-01

    This study investigated how repetition is used in conversation among native speakers of British English, native speakers of Japanese, and Japanese speakers of English. Five interactional functions of repetition (interruption-orientated, solidarity, silence-avoidance, hesitation, and reformulation) were identified, as well as the cultural factors…

  13. Digital repetitive control under varying frequency conditions

    CERN Document Server

    Ramos, Germán A; Olm, Josep M

    2013-01-01

    The tracking/rejection of periodic signals constitutes a wide field of research in the control theory and applications area. Repetitive Control has proven to be an efficient way to face this topic. However, in some applications the frequency of the reference/disturbance signal is time-varying or uncertain. This causes an important performance degradation in the standard Repetitive Control scheme. This book presents some solutions to apply Repetitive Control in varying frequency conditions without loosing steady-state performance. It also includes a complete theoretical development and experimental results in two representative systems. The presented solutions are organized in two complementary branches: varying sampling period Repetitive Control and High Order Repetitive Control. The first approach allows dealing with large range frequency variations while the second allows dealing with small range frequency variations. The book also presents applications of the described techniques to a Roto-magnet plant and...

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

  15. 基于定量递归分析的天然气管线输送流量均衡调度方法%Balance scheduling method for natural gas pipeline transportation flow based on quantitative recursive analysis

    Institute of Scientific and Technical Information of China (English)

    尤冬石; 刘亚龙; 殷若鹏

    2016-01-01

    通过对天然气管线输送流量进行优化均衡调度设计,实现对天然气管线运行工况的准确监测。传统方法采用线性时间序列Wolf一步预测方法进行天然气管线输送流量调度,没能有效挖掘天然气管线输送网络中天然气流量的非线性特征,导致调度的准确性不好。提出一种基于定量递归分析的天然气管线输送流量均衡调度方法。首先构建了天然气管线的网络配置结构模型,进行输送流量序列的信号模型构建和非线性时间序列分析,对天然气流量进行相空间重构,在高维相空间中进行递归图构建,实现对天然气管线输送流量的定量递归分析,达到流量准确预测和均衡调度的目的,实现算法改进。仿真实验分析结果表明,采用该方法进行天然气管线输送流量均衡调度,天然气输送运行的工况得到改善,输送配置的均衡性较好,流量预测精度较高,调度效能增强。%Through the optimization of the natural gas pipeline transportation flow to optimize the balanced scheduling design, to achieve an accurate monitoring of the operating conditions of natural gas pipeline. Traditional method using one step prediction method for linear time series Wolf for natural gas pipeline transportation scheduling flow, could not effectively tap nonlinear characteristic of natural gas pipeline to transport gas flow in a network, and lead to the bad accuracy of the scheduling. A natural gas pipeline transportation flow balancing scheduling method based on quantitative recursive analysis is proposed. First construct a network configuration structure model of natural gas pipeline, propose transportation flow sequence signal model construction and nonlinear time series analysis; Next provide the gas flow of phase space reconstruction, recursive graph construction in a high-dimensional phase space, realize recurrence quantification analysis of natural gas pipeline

  16. Optimal radiotherapy dose schedules under parametric uncertainty

    Science.gov (United States)

    Badri, Hamidreza; Watanabe, Yoichi; Leder, Kevin

    2016-01-01

    We consider the effects of parameter uncertainty on the optimal radiation schedule in the context of the linear-quadratic model. Our interest arises from the observation that if inter-patient variability in normal and tumor tissue radiosensitivity or sparing factor of the organs-at-risk (OAR) are not accounted for during radiation scheduling, the performance of the therapy may be strongly degraded or the OAR may receive a substantially larger dose than the allowable threshold. This paper proposes a stochastic radiation scheduling concept to incorporate inter-patient variability into the scheduling optimization problem. Our method is based on a probabilistic approach, where the model parameters are given by a set of random variables. Our probabilistic formulation ensures that our constraints are satisfied with a given probability, and that our objective function achieves a desired level with a stated probability. We used a variable transformation to reduce the resulting optimization problem to two dimensions. We showed that the optimal solution lies on the boundary of the feasible region and we implemented a branch and bound algorithm to find the global optimal solution. We demonstrated how the configuration of optimal schedules in the presence of uncertainty compares to optimal schedules in the absence of uncertainty (conventional schedule). We observed that in order to protect against the possibility of the model parameters falling into a region where the conventional schedule is no longer feasible, it is required to avoid extremal solutions, i.e. a single large dose or very large total dose delivered over a long period. Finally, we performed numerical experiments in the setting of head and neck tumors including several normal tissues to reveal the effect of parameter uncertainty on optimal schedules and to evaluate the sensitivity of the solutions to the choice of key model parameters.

  17. Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling

    CERN Document Server

    Thamilselvan, R

    2009-01-01

    This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-complete problem, but it is difficult to find the optimal solution. This paper applies Genetic Algorithms and Tabu Search for Job Shop Scheduling problem and compares the results obtained by each. With the implementation of our approach the JSS problems reaches optimal solution and minimize the makespan.

  18. New Proactive Time Buffer Heuristics for Robust Project Scheduling

    Science.gov (United States)

    Elshaer, Raafat; Yamamoto, Hidehiko

    Robust scheduling is aiming at constructing proactive schedules capable of dealing with multiple disruptions during project execution. Insertion a time buffer, before an activity start time, is a method to improve the robustness (stability) of a baseline schedule. In this paper, we introduce new heuristics for inserting time buffers in a given baseline schedule while the project due date is predefined and stochastic activity duration is considered. Computational results obtained from a set of benchmark projects show that the proposed heuristics capable of generating proactive schedules with acceptable quality and solution robustness.

  19. Variable training does not lead to better motor learning compared to repetitive training in children with and without DCD when exposed to active video games.

    Science.gov (United States)

    Bonney, Emmanuel; Jelsma, Dorothee; Ferguson, Gillian; Smits-Engelsman, Bouwien

    2017-03-01

    Little is known about the influence of practice schedules on motor learning and skills transfer in children with and without developmental coordination disorder (DCD). Understanding how practice schedules affect motor learning is necessary for motor skills development and rehabilitation. The study investigated whether active video games (exergames) training delivered under variable practice led to better learning and transfer than repetitive practice. 111 children aged 6-10 years (M=8.0, SD=1.0) with no active exergaming experience were randomized to receive exergames training delivered under variable (Variable Game Group (VGG), n=56) or repetitive practice schedule (Repetitive Game Group (RGG), n=55). Half the participants were identified as DCD using the DSM-5 criteria, while the rest were typically developing (TD), age-matched children. Both groups participated in two 20min sessions per week for 5 weeks. Both participant groups (TD and DCD) improved equally well on game performance. There was no significant difference in positive transfer to balance tasks between practice schedules (Repetitive and Variable) and participant groups (TD and DCD). Children with and without DCD learn balance skills quite well when exposed to exergames. Gains in learning and transfer are similar regardless of the form of practice schedule employed. This is the first paper to compare the effect of practice schedules on learning in children with DCD and those with typical development. No differences in motor learning were found between repetitive and variable practice schedules. When children with and without DCD spend the same amount of time on exergames, they do not show any differences in acquisition of motor skills. Transfer of motor skills is similar in children with and without DCD regardless of differences in practice schedules. Copyright © 2017 Elsevier Ltd. All rights reserved.

  20. Strategies for Using Repetition as a Powerful Teaching Tool

    Science.gov (United States)

    Saville, Kirt

    2011-01-01

    Brain research indicates that repetition is of vital importance in the learning process. Repetition is an especially useful tool in the area of music education. The success of repetition can be enhanced by accurate and timely feedback. From "simple repetition" to "repetition with the addition or subtraction of degrees of freedom," there are many…

  1. Strategies for Using Repetition as a Powerful Teaching Tool

    Science.gov (United States)

    Saville, Kirt

    2011-01-01

    Brain research indicates that repetition is of vital importance in the learning process. Repetition is an especially useful tool in the area of music education. The success of repetition can be enhanced by accurate and timely feedback. From "simple repetition" to "repetition with the addition or subtraction of degrees of freedom," there are many…

  2. Repetition priming from moving faces.

    Science.gov (United States)

    Lander, Karen; Bruce, Vicki

    2004-06-01

    Recent experiments have suggested that seeing a familiar face move provides additional dynamic information to the viewer, useful in the recognition of identity. In four experiments, repetition priming was used to investigate whether dynamic information is intrinsic to the underlying face representations. The results suggest that a moving image primes more effectively than a static image, even when the same static image is shown in the prime and the test phases (Experiment 1). Furthermore, when moving images are presented in the test phase (Experiment 2), there is an advantage for moving prime images. The most priming advantage is found with naturally moving faces, rather than with those shown in slow motion (Experiment 3). Finally, showing the same moving sequence at prime and test produced more priming than that found when different moving sequences were shown (Experiment 4). The results suggest that dynamic information is intrinsic to the face representations and that there is an advantage to viewing the same moving sequence at prime and test.

  3. Intelligent Feedback Scheduling of Control Tasks

    Directory of Open Access Journals (Sweden)

    Fatin I. Telchy

    2014-12-01

    Full Text Available an efficient feedback scheduling scheme based on the proposed Feed Forward Neural Network (FFNN scheme is employed to improve the overall control performance while minimizing the overhead of feedback scheduling which exposed using the optimal solutions obtained offline by mathematical optimization methods. The previously described FFNN is employed to adapt online the sampling periods of concurrent control tasks with respect to changes in computing resource availability. The proposed intelligent scheduler will be examined with different optimization algorithms. An inverted pendulum cost function is used in these experiments. Then, simulation of three inverted pendulums as intelligent Real Time System (RTS is described in details. Numerical simulation results demonstrates that the proposed scheme can reduce the computational overhead significantly while delivering almost the same overall control performance as compared to optimal feedback scheduling

  4. Scheduling Analysis Method Study for AADL Module%针对AADL模型的可调度性分析方法研究

    Institute of Scientific and Technical Information of China (English)

    黄英兰

    2013-01-01

    AADL (Architecture Analysis & Design Language) is a kind of modeling language which was defined by SAE (Society of Automotive Engineers) of USA for integration avionics system.It can describe the function and non-functional system requirements of the performance-critical embedded real-time systems.The non-functional requirements,such as reliability,security and scheduling,are analyzed to correct defects in design phase to reduce the cycle and the cost of the system development.This article summarizes the support of AADL to the scheduling analysis,and compares several scheduling analysis tools.Based on the comparison mentioned above,the advantage and disadvantage of these tools can be identified so that the users select the proper tools according to their requirements.%AADL(Architecture Analysis&Design Language)语言是美国SAE(Society of AutomotiveEngineers)组织定义的一组满足航空电子综合化设计用的建模语言.它可以描述安全关键嵌入式实时系统功能和非功能性属性,非功能属性包括可靠性、安全性、可调度性等.通过对这些非功能属性进行分析,可以在设计阶段而不是实现阶段纠正系统设计缺陷,缩短系统开发周期和降低开发成本.总结了AADL语言对可调度性分析方面提供的支持,并分析比较了几种针对AADL模型的可调度性分析工具,在此分析和比较基础上,识别它们各自的优缺点,方便使用者根据需要选择合适的工具使用.

  5. Healthcare Scheduling by Data Mining: Literature Review and Future Directions

    Directory of Open Access Journals (Sweden)

    Maria M. Rinder

    2012-01-01

    Full Text Available This article presents a systematic literature review of the application of industrial engineering methods in healthcare scheduling, with a focus on the role of patient behavior in scheduling. Nine articles that used mathematical programming, data mining, genetic algorithms, and local searches for optimum schedules were obtained from an extensive search of literature. These methods are new approaches to solve the problems in healthcare scheduling. Some are adapted from areas such as manufacturing and transportation. Key findings from these studies include reduced time for scheduling, capability of solving more complex problems, and incorporation of more variables and constraints simultaneously than traditional scheduling methods. However, none of these methods modeled no-show and walk-ins patient behavior. Future research should include more variables related to patient and/or environment.

  6. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

    Perez-Calero Yzquierdo, Antonio [Madrid, CIEMAT; Hernandez, Jose [Madrid, CIEMAT; Holzman, Burt [Fermilab; Majewski, Krista [Fermilab; McCrea, Alison [UC, San Diego

    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.

  7. Model Migration Schedules

    OpenAIRE

    1981-01-01

    This report draws on the fundamental regularity exhibited by age profiles of migration all over the world to develop a system of hypothetical model schedules that can be used in multiregional population analyses carried out in countries that lack adequate migration data.

  8. Personnel Scheduling in Laboratories

    NARCIS (Netherlands)

    Franses, Philip; Post, Gerhard; Burke, Edmund; De Causmaecker, Patrick

    2003-01-01

    We describe an assignment problem particular to the personnel scheduling of organisations such as laboratories. Here we have to assign tasks to employees. We focus on the situation where this assignment problem reduces to constructing maximal matchings in a set of interrelated bipartite graphs. We d

  9. Round Robin Schedules.

    Science.gov (United States)

    Iannone, Michael A.

    1983-01-01

    Presented is a computer program written in BASIC that covers round-robin schedules for team matches in competitions. The program was originally created to help teams in a tennis league play one match against every other team. Part of the creation of the program involved use of modulo arithmetic. (MP)

  10. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard; 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, l

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

  12. Precision markedly attenuates repetitive lift capacity.

    Science.gov (United States)

    Collier, Brooke R; Holland, Laura; McGhee, Deirdre; Sampson, John A; Bell, Alison; Stapley, Paul J; Groeller, Herbert

    2014-01-01

    This study investigated the effect of precision on time to task failure in a repetitive whole-body manual handling task. Twelve participants were required to repetitively lift a box weighing 65% of their single repetition maximum to shoulder height using either precise or unconstrained box placement. Muscle activity, forces exerted at the ground, 2D body kinematics, box acceleration and psychophysical measures of performance were recorded until task failure was reached. With precision, time to task failure for repetitive lifting was reduced by 72%, whereas the duration taken to complete a single lift and anterior deltoid muscle activation increased by 39% and 25%, respectively. Yet, no significant difference was observed in ratings of perceived exertion or heart rate at task failure. In conclusion, our results suggest that when accuracy is a characteristic of a repetitive manual handling task, physical work capacity will decline markedly. The capacity to lift repetitively to shoulder height was reduced by 72% when increased accuracy was required to place a box upon a shelf. Lifting strategy and muscle activity were also modified, confirming practitioners should take into consideration movement precision when evaluating the demands of repetitive manual handling tasks.

  13. An educational approach to an epidemic of repetitive motion injuries among office workers

    Energy Technology Data Exchange (ETDEWEB)

    Halunen, L.J.

    1988-09-23

    Among office workers, repetitive motion injuries such as tendonitis, muscle fatigue, and nerve irritation (caused by poor posture and arm/hand positioning while performing repetitive tasks) are a fairly new phenomenon. Office workers and their managers are not prepared to respond properly to the identification and treatment of these injuries. We found an unusually high incidence within one department at a large research facility--the Lawrence Livermore National Laboratory--and developed an educational approach to reduce the frequency and severity of these injuries. Our approach was to inform the workers and managers about the origins and severity of repetitive motion injuries and their effect on the work force. Classes in ergonomic adjustment of video workstations were scheduled for all personnel who had jobs that required heavy keyboard use. The individual's responsibility in reporting any symptoms of repetitive motion injury was emphasized. We stressed to management the seriousness of the problem, the desirability of obtaining improved equipment workers may need, or the possibility of arranging a lighter workload for those showing symptoms of repetitive motion injuries. We followed these classes and briefings with additional videotaped material and written guidelines, pamphlets, and articles for further study and discussion. Early results indicate that informed workers in a supportive environment detect symptoms earlier, and therefore recover more quickly; managers who understand the problem and are able to respond positively gain better labor relations as well as lower injury rates. 4 refs., 2 figs.

  14. A Heuristic and Dynamic Method for Task Scheduling and Path Planning%启发式动态任务调度与航路规划方法

    Institute of Scientific and Technical Information of China (English)

    沈淑梅; 姚臣

    2012-01-01

    A hierarchical structure of mission planning system was proposed for task scheduling and path planning. The multi-task priority and conflict resolution were implemented in the upper layer of the mission planning system, and path planning and real-time re-planning were implemented in the lower layer. The algorithms of heuristic and dynamic task scheduling and path planning were proposed, which can improve the situation adaptability and conflict resolution ability to various emergencies, and the capability to attack time-critical target, and thus can increase the autonomy level of UAV under dynamic and uncertain environment.%针对任务、资源、航路的调度与规划需要,建立了一种分层递阶的任务规划系统结构,上层主要解决任务优先级和冲突消解问题;下层主要解决满足各种要求的航路规划与实时重规划问题.提出了启发式动态任务调度与航路实时规划算法,可以有效提高对各种突发事件的态势自适应和冲突消解能力以及对时敏目标的打击能力,进而提高无人机在动态不确定环境下的自主性.

  15. Class Schedules--Computer Loaded or Student Self-Scheduled?

    Science.gov (United States)

    Wall, Edward F.

    1979-01-01

    In the two-step process of student scheduling, the initial phase of course selection is the most important. At Chesterton High School in Indiana, student self-scheduling is preferred over computer loading. (Author/MLF)

  16. Repetitive Bibliographical Information in Relational Databases.

    Science.gov (United States)

    Brooks, Terrence A.

    1988-01-01

    Proposes a solution to the problem of loading repetitive bibliographic information in a microcomputer-based relational database management system. The alternative design described is based on a representational redundancy design and normalization theory. (12 references) (Author/CLB)

  17. Computer-Related Repetitive Stress Injuries

    Science.gov (United States)

    ... on the shoulder Epicondylitis: elbow soreness often called "tennis elbow" Ganglion cyst: swelling or lump in the wrist ... Bones, Muscles, and Joints Carpal Tunnel Syndrome Medial Epicondylitis Repetitive Stress Injuries Contact Us Print Resources Send ...

  18. Digital repetitive control under varying frequency conditions

    OpenAIRE

    Ramos Fuentes, Germán Andrés

    2012-01-01

    Premi extraordinari doctorat curs 2011-2012, àmbit d’Enginyeria Industrial The tracking/rejection of periodic signals constitutes a wide field of research in the control theory and applications area and Repetitive Control has proven to be an efficient way to face this topic; however, in some applications the period of the signal to be tracked/rejected changes in time or is uncertain, which causes and important performance degradation in the standard repetitive controller. This the...

  19. Revisiting conjugate schedules.

    Science.gov (United States)

    MacAleese, Kenneth R; Ghezzi, Patrick M; Rapp, John T

    2015-07-01

    The effects of conjugate reinforcement on the responding of 13 college students were examined in three experiments. Conjugate reinforcement was provided via key presses that changed the clarity of pictures displayed on a computer monitor in a manner proportional to the rate of responding. Experiment 1, which included seven parameters of clarity change per response, revealed that responding decreased as the percentage clarity per response increased for all five participants. These results indicate that each participant's responding was sensitive to intensity change, which is a parameter of conjugate reinforcement schedules. Experiment 2 showed that responding increased during conjugate reinforcement phases and decreased during extinction phases for all four participants. Experiment 3 also showed that responding increased during conjugate reinforcement and further showed that responding decreased during a conjugate negative punishment condition for another four participants. Directions for future research with conjugate schedules are briefly discussed.

  20. 基于图形操作的电网检修计划编制方法研究%Compilation method based on graphic operation for grid maintenance scheduling

    Institute of Scientific and Technical Information of China (English)

    梁峰; 刘文颖; 邹品元; 李世伟; 杨旭东

    2011-01-01

    分析传统检修计划编制工程中存在的问题,提出了一种通过图形操作辅助编制电网检修计划的设计方案.所提出的电网检险修计划编制方法一方面保证了电网检修基础数据的规范性;另一方面提高了检修计划编制图形化与智能化的关联性和互动性.通过图形操作,采用图元与标准数据映射的机制,在设备映射库中启发式搜索生成数据规范、格式统一的电网检修基础数据.在此基础上,图形操作触发结线分析,将生成的检修基础数据与电网检修知识库相关联,并在图形环境下互动地完成数据的调整和最终检修计划的编制.以兰州供电公司月检修计划编制为例进一步说明了该方法的科学性,有效性.%After analyzing some problems in the traditional project of grid maintenance scheduling, the paper proposes a new design scheme using graphic operation to assist the compilation of grid maintenance scheduling. On the one hand, the proposed compilation method ensures the normalization of basic data of grid maintenance. On the other hand, the association and interaction between the graphical interface and intelligent analysis for the grid maintenance scheduling are improved. The graphic operation compilation is proposed and graphic element and standard data mapping mechanism is used to obtain the normative basic data from the equipment mapping database by heuristic search. On this basis, graphic operation triggers the connectivity analysis, makes the obtained basic data associated with the grid maintenance knowledge-base, and then completes the adjustment and compilation interactively in graphic environment. The month maintenance scheduling from Lanzhou Power Supply Corporation is presented as a real-world case to prove the feasibility and scientific of the proposed method.

  1. Interaction of Repetitively Pulsed High Energy Laser Radiation With Matter

    Science.gov (United States)

    Hugenschmidt, Manfred

    1986-10-01

    The paper is concerned with laser target interaction processes involving new methods of improving the overall energy balance. As expected theoretically, this can be achieved with high repetition rate pulsed lasers even for initially highly reflecting materials, such as metals. Experiments were performed by using a pulsed CO2 laser at mean powers up to 2 kW and repetition rates up to 100 Hz. The rates of temperature rise of aluminium for example were thereby increased by lore than a factor of 3 as compared to cw-radiation of comparable power density. Similar improvements were found for the overall absorptivities that were increased by this method by more than an order of magnitude.

  2. 敏捷光学卫星密集区域推扫成像任务规划方法%Push-broom Imaging Scheduling Method of the Optical Agile Satellite in the Dense Regions

    Institute of Scientific and Technical Information of China (English)

    林晓辉; 潘小彤; 张锦绣

    2014-01-01

    The agile satellite could achieve the linescan imaging model with the ability of three-axis-maneuvering , w hile imaging synchronously during the maneuvering . Based on the imaging agile satellite task , the model of the problem of scheduling agile earth observing satellite (AEOS) with the linescan imaging was established . Using the Gauss projection , the preliminary method of the linescan strip was established ,and solved by the existing algorithms in the Matlab . Because of the complexity of the model , the solution strategy of the hierarchical optimization was designed .During the sub-problem , generating the linescan stripe with groups , the solution method can be solved easily . In the upper scheduling problem , according to the two directions of the stripe , the hierarchical optimization based on heuristic rule was designed to solve the problem .Then ,turning the stripes that could not be scheduled into the point target , the whole scheduling was completed with the second-time-scheduling . The simulation shows that the algorithm can solve the actual problem of the scheduling of the linescan imaging agile satellite .%敏捷成像卫星可以实现利用三轴姿态机动所形成的推扫成像模式,同时可以在机动过程中同步成像。在敏捷卫星成像任务的基础上,建立考虑推扫成像模式的敏捷卫星任务规划模型。通过高斯投影建立球面直线扫描条带的数学生成模型,并利用Matlab现有函数进行优化解算;由于模型解算的复杂性,将整体规划问题分为两层子问题分别进行处理,在条带任务分配中,设计了适用于计算机计算的含有条带分配策略的解算算法;在上层规划中,基于推扫成像的双向扫描特性,设计了基于启发式规则的敏捷卫星任务规划算法;之后,将不可规划条带拆作孤立点目标进行处理,最后通过再合成处理完成整体规划。仿真结果表明,文章所设计的算法可以

  3. Intelligent Transportation Scheduling Model Based on Reverse Nearest Neighbor Query Method%基于反向最近邻查询的智能交通调度模型

    Institute of Scientific and Technical Information of China (English)

    尚晓丽; 包向辉

    2015-01-01

    The intelligent transportation scheduling model design is the key to ensure the smooth flow of traffic network. In⁃telligent transportation scheduling model PID control law in the presence of survivability and robustness of the problem based on the traditional. Reverse nearest neighbor query intelligent transportation scheduling model based on the improved method, the introduction of follow bee search nectar operator, reverse nearest neighbor queries based on the improved meth⁃od, the establishment of a feed forward compensation of dynamic game mathematical model based on rough set theory, fea⁃ture extraction of control traffic congestion, vehicle density of different lanes within the vehicle weighted draw speed and other information. As the output of PID network system, overcome the entity irregular growth leading to scheduling control problem of high precision. Artificial bee colony algorithm using reverse nearest neighbor query improved extraction method based on the characteristics of traffic information, improve the realization of intelligent scheduling algorithm and control model. The simulation experiments, using the intelligent transportation scheduling model, can effectively improve the traffic throughput, shorten the road resistance time, it ensures the smooth operation of the vehicle.%智能交通调度模型设计是保障交通网络畅通的关键。传统的基于PID控制律的智能交通调度模型存在抗毁性和鲁棒性不好的问题。提出基于反向最近邻查询改进方法的智能交通调度模型,引入跟随蜂搜索蜜源算子,基于反向最近邻查询改进方法,建立一种基于粗糙集理论的前馈补偿动态博弈数学模型,提取制约交通拥堵的车辆密度、不同车道内的车辆加权平局速度等信息特征,作为PID路网系统的输出,克服实体无规则增长导致调度控制精度不高的问题。采用基于蜂群算法的反向最近邻查询改进方法交通信息特

  4. Tree canopy light interception estimates in almond and a walnut orchards using ground, low flying aircraft, and satellite based methods to improve irrigation scheduling programs.

    Science.gov (United States)

    Rosecrance, R. C.; Johnson, L.; Soderstrom, D.

    2016-12-01

    Canopy light interception is a main driver of water use and crop yield in almond and walnut production. Fractional green canopy cover (Fc) is a good indicator of light interception and can be estimated remotely from satellite using the normalized difference vegetation index (NDVI) data. Satellite-based Fc estimates could be used to inform crop evapotranspiration models, and hence support improvements in irrigation evaluation and management capabilities. Satellite estimates of Fc in almond and walnut orchards, however, need to be verified before incorporating them into irrigation scheduling or other crop water management programs. In this study, Landsat-based NDVI and Fc from NASA's Satellite Irrigation Management Support (SIMS) were compared with four estimates of canopy cover: 1. light bar measurement, 2. in-situ and image-based dimensional tree-crown analyses, 3. high-resolution NDVI data from low flying aircraft, and 4. orchard photos obtained via Google Earth and processed by an Image J thresholding routine. Correlations between the various estimates are discussed.

  5. Tree Canopy Light Interception Estimates in Almond and a Walnut Orchards Using Ground, Low Flying Aircraft, and Satellite Based Methods to Improve Irrigation Scheduling Programs

    Science.gov (United States)

    Rosecrance, Richard C.; Johnson, Lee; Soderstrom, Dominic

    2016-01-01

    Canopy light interception is a main driver of water use and crop yield in almond and walnut production. Fractional green canopy cover (Fc) is a good indicator of light interception and can be estimated remotely from satellite using the normalized difference vegetation index (NDVI) data. Satellite-based Fc estimates could be used to inform crop evapotranspiration models, and hence support improvements in irrigation evaluation and management capabilities. Satellite estimates of Fc in almond and walnut orchards, however, need to be verified before incorporating them into irrigation scheduling or other crop water management programs. In this study, Landsat-based NDVI and Fc from NASA's Satellite Irrigation Management Support (SIMS) were compared with four estimates of canopy cover: 1. light bar measurement, 2. in-situ and image-based dimensional tree-crown analyses, 3. high-resolution NDVI data from low flying aircraft, and 4. orchard photos obtained via Google Earth and processed by an Image J thresholding routine. Correlations between the various estimates are discussed.

  6. Multiprocessor scheduling with rejection

    Energy Technology Data Exchange (ETDEWEB)

    Bartal, Y. [Tel-Aviv Univ. (Israel); Leonardi, S.; Marchetti-Spaccamela, A. [Universita di Roma (Italy); Sgall, J. [Mathematical Inst., Zitna (Czechoslovakia)] [and others

    1996-12-31

    We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected for a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the on-line version the jobs arrive one by one and we have to schedule or reject a job before we have any information about future jobs. The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs. The main result is a 1 + {phi} {approx} 2.618 competitive algorithm for the on-line version of the problem, where 0 is the golden ratio. A matching lower bound shows that this is the best possible algorithm working for all m. For fixed m we give improved bounds, in particular for m = 2 we give an optimal {phi} {approx} 1.618 competitive algorithm. For the off-line problem we present a fully polynomial approximation scheme for fixed m and an approximation algorithm which runs in time O(n log n) for arbitrary m and guarantees 2 - 1/m approximation ratio.

  7. CMS Multicore Scheduling Strategy

    CERN Document Server

    Perez-Calero Yzquierdo, Antonio

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue Moores Law style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications. 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 multi-core jobs on the GRID based on the glideIn WMS submission infrastructure. We will present the individual components of the strategy, from special site specific queues used during provisioning of resources and implications to scheduling; to dynamic partitioning within a single pilot to allow to transition to multi-core or whole-node scheduling on site level without disallowing single-core jobs. In this presentation, we will present the experiences mad...

  8. Customer Appeasement Scheduling

    CERN Document Server

    Nikseresht, Mohammad R; Maheshwari, Anil

    2010-01-01

    Almost all of the current process scheduling algorithms which are used in modern operating systems (OS) have their roots in the classical scheduling paradigms which were developed during the 1970's. But modern computers have different types of software loads and user demands. We think it is important to run what the user wants at the current moment. A user can be a human, sitting in front of a desktop machine, or it can be another machine sending a request to a server through a network connection. We think that OS should become intelligent to distinguish between different processes and allocate resources, including CPU, to those processes which need them most. In this work, as a first step to make the OS aware of the current state of the system, we consider process dependencies and interprocess communications. We are developing a model, which considers the need to satisfy interactive users and other possible remote users or customers, by making scheduling decisions based on process dependencies and interproce...

  9. Scheduling a C-Section

    Science.gov (United States)

    ... Pregnancy > Labor & birth > Scheduling a c-section Scheduling a c-section E-mail to a friend Please fill in all fields. Please enter ... and develop before she’s born. Why can scheduling a c-section for non-medical reasons be a ...

  10. Flexible Scheduling: Making the Transition

    Science.gov (United States)

    Creighton, Peggy Milam

    2008-01-01

    Citing literature that supports the benefits of flexible scheduling on student achievement, the author exhorts readers to campaign for flexible scheduling in their library media centers. She suggests tips drawn from the work of Graziano (2002), McGregor (2006) and Stripling (1997) for making a smooth transition from fixed to flexible scheduling:…

  11. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Godskesen, Jens Christian; Hermanns, Holger

    2015-01-01

    . This holds in the classical context of arbitrary schedulers, but it has been argued that this class of schedulers is unrealistically powerful. This paper studies a strictly coarser notion of bisimilarity, which still enjoys these properties in the context of realistic subclasses of schedulers: Trace...

  12. Continuous Media Tasks Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Myungryun Yoo

    2016-03-01

    Full Text Available In this paper the authors propose modified proportional share scheduling algorithm considering the characteristics of continuous media such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and decreases the number of context switching. Proposed scheduling algorithm is evaluated using several numerical tests under various conditions, especially overloaded situation.

  13. Flexible Software for Flexible Scheduling

    Science.gov (United States)

    Economou, Frossie; Jenness, Tim; Tilanus, Remo P. J.; Hirst, Paul; Adamson, Andy J.; Rippa, Mathew; Delorey, Kynan K.; Isaak, Kate G.

    The JAC Observation Management Project (OMP) provides software for the James Clerk Maxwell (JCMT) and the United Kingdom Infrared (UKIRT) telescopes that manages the life-cycle of flexibly scheduled observations. Its aim is to increase observatory efficiency under flexible (queue) scheduled observing, without depriving the principal investigator (PI) of the flexibility associated with classical scheduling.

  14. A Scalable Parallel Reinforcement Learning Method Based on Intelligent Scheduling%一种基于智能调度的可扩展并行强化学习方法

    Institute of Scientific and Technical Information of China (English)

    刘全; 傅启明; 杨旭东; 荆玲; 李瑾; 李娇

    2013-01-01

    Aiming at the "curse of dimensionality" problem of reinforcement learning in large state space or continuous state space, a scalable reinforcement learning method, IS-SRL method, is proposed on the basis of divide-and-conquer strategy, and its convergence is proved. In this method, the learning problem with large state space or continuous state space is divided into smaller subproblems so that each subproblem can be learned independently in memory. After a cycle of learning, next subproblem will be swapped in to continue the learning process. Information exchanges between the subproblems during the process of swap so that the learning process will converge to optima eventually. The order of subproblems' executing significantly affects the efficiency of learning. Therefore, we propose an efficient scheduling algorithm which takes advantage of the distribution of value function's backup in reinforcement learning and the idea of weighting the priorities of multiple scheduling strategies. This scheduling algorithm ensures that computation is focused on regions of the problem space which are expected to be maximally productive. To expedite the learning process, a parallel scheduling architecture, which can flexibly allocate learning tasks between learning agents, is proposed. A new method, IS-SPRL, is obtained after we blended the proposed architecture into the IS-SRL method. The experimental results show that learning based on this scheduling architecture has faster convergence speed and good scalability.%针对强化学习在大状态空间或连续状态空间中存在的“维数灾”问题,提出一种基于智能调度的可扩展并行强化学习方法—IS-SRL,并从理论上进行分析,证明其收敛性.该方法采用分而治之策略对大状态空间进行分块,使得每个分块能够调入内存独立学习.在每个分块学习了一个周期之后交换到外存上,调入下一个分块继续学习.分块之间在换入换出的过程中交换

  15. An Augmented Lagrangian Approach for Scheduling Problems

    Science.gov (United States)

    Nishi, Tatsushi; Konishi, Masami

    The paper describes an augmented Lagrangian decomposition and coordination approach for solving single machine scheduling problems to minimize the total weighted tardiness. The problem belongs to the class of NP-hard combinatorial optimization problem. We propose an augmented Lagrangian decomposition and coordination approach, which is commonly used for continuous optimization problems, for solving scheduling problems despite the fact that the problem is nonconvex and non-differentiable. The proposed method shows a good convergence to a feasible solution without heuristically constructing a feasible solution. The performance of the proposed method is compared with that of an ordinary Lagrangian relaxation.

  16. An Integrated Expert System for Linear Scheduling Heavy Earthmoving Operations

    Directory of Open Access Journals (Sweden)

    Nizar Markiz

    2016-01-01

    Full Text Available Heavy earthmoving operations are repetitive in nature and vulnerable to time-related restraints and uncertainties. Therefore, at the conceptual stage, scheduling these operations can take a linear form, known as linear schedule or line of balance (LOB. In such type of work, generating a preliminary line of balance for variable sequencing of activities is crucial. In this paper, an integrated expert system for determining preliminary linear schedules for heavy earthmoving operations at the conceptual stage is presented. The proposed system incorporates numerous factors that influence the analysis of earthmoving operations, which include geological and topographical parameters used to determine productivity rates at the conceptual stage. Also, the proposed system is capable of automatically generating a line of balance based on a stochastic scheduling technique via the metaheuristic simulated annealing intelligent approach to incorporate randomness and uncertainties in performing the associated activities. A parametric analysis is conducted in order to quantify the system’s degree of accuracy. An actual case project is then utilized to illustrate its numerical capabilities. Generating accurate linear schedules for heavy earthmoving operations at the conceptual design stage is anticipated to be of major significance to infrastructure project stakeholders, engineers, and construction managers by detecting schedule’s conflicts early in order to enhance overall operational logistics.

  17. SCHOOL SCHEDULING BY COMPUTER, THE STORY OF GASP.

    Science.gov (United States)

    MURPHY, JUDITH; SUTTER, ROBERT

    GENERALIZED ACADEMIC SIMULATION PROGRAMS (GASP) IS SCHOOL SCHEDULING BY COMPUTER. THE PUBLICATION COMPARES THE MANUAL METHOD OF DEVELOPING A SCHOOL SCHEDULE WITH THE NEW METHOD OF COMPUTER PROGRAMING. A MAJOR ADVANTAGE OF COMPUTER PROGRAMING IS THAT IT RELIEVES THE ADMINISTRATOR OF THIS BUSY WORK SO THAT HE CAN DEVOTE HIS ENERGIES AND TIME TO MORE…

  18. [Rehabilitation Using Repetitive Transcranial Magnetic Stimulation].

    Science.gov (United States)

    Takeuchi, Naoyuki; Izumi, Shin-Ichi

    2017-03-01

    Various novel stroke rehabilitative methods have been developed based on findings in basic science and clinical research. Recently, many reports have shown that repetitive transcranial magnetic stimulation (rTMS) improves function in stroke patients by altering the excitability of the human cortex. The interhemispheric competition model proposes that deficits in stroke patients are due to reduced output from the affected hemisphere and excessive interhemispheric inhibition from the unaffected hemisphere to the affected hemisphere. The interhemispheric competition model indicates that improvement in deficits can be achieved either by increasing the excitability of the affected hemisphere using excitatory rTMS or by decreasing the excitability of the unaffected hemisphere using inhibitory rTMS. Recovery after stroke is related to neural plasticity, which involves developing new neural connections, acquiring new functions, and compensating for impairments. Artificially modulating the neural network by rTMS may induce a more suitable environment for use-dependent plasticity and also may interfere with maladaptive neural activation, which weakens function and limits recovery. There is potential, therefore, for rTMS to be used as an adjuvant therapy for developed neurorehabilitation techniques in stroke patients.

  19. SI Engine with repetitive NS spark plug

    Science.gov (United States)

    Pancheshniy, Sergey; Nikipelov, Andrey; Anokhin, Eugeny; Starikovskiy, Andrey; Laplase Team; Mipt Team; Pu Team

    2013-09-01

    Now de-facto the only technology for fuel-air mixtures ignition in IC engines exists. It is a spark discharge of millisecond duration in a short discharge gap. The reason for such a small variety of methods of ignition initiation is very specific conditions of the engine operation. First, it is very high-pressure of fuel-air mixture - from 5-7 atmospheres in old-type engines and up to 40-50 atmospheres on the operating mode of HCCI. Second, it is a very wide range of variation of the oxidizer/fuel ratio in the mixture - from almost stoichiometric (0.8-0.9) at full load to very lean (φ = 0.3-0.5) mixtures at idle and/or economical cruising mode. Third, the high velocity of the gas in the combustion chamber (up to 30-50 m/s) resulting in a rapid compression of swirling inlet flow. The paper presents the results of tests of distributed spark ignition system powered by repetitive pulse nanosecond discharge. Dynamic pressure measurements show the increased pressure and frequency stability for nanosecond excitation in comparison with the standard spark plug. Excitation by single nanosecond high-voltage pulse and short train of pulses was examined. In all regimes the nanosecond pulsed excitation demonstrate a better performance.

  20. 挣时管理:一种基于挣值的项目进度绩效评价方法%Earned time:a new optimal method of project schedule performance evaluation based on earned value

    Institute of Scientific and Technical Information of China (English)

    郭文静; 周晓宏

    2014-01-01

    The Earned Value Management methodology is a very important and systematic technique that evaluates project performance.This paper studies the disadvantages and limitations of traditional earned value method while evaluating the project Schedule Performance from the application point of view based on the introduction of the traditional earned value management method,and puts forward a performance evaluation method called Earned Time method.It corrects the deviation from traditional earned value method when evaluating the project Schedule Performance,and all the information needed comes form the traditional earned value management.%挣值管理方法是现代项目管理中评价项目绩效的一个非常重要的系统方法。本文在对传统挣值管理方法简要介绍基础上,从实际应用角度就传统挣值管理方法在项目进度绩效评价方面存在的不足和局限进行分析,提出了一种基于时间进度的进度绩效评价方法-挣时分析法。该方法能够改进传统挣值法在进度评价方面的偏差,而且该方法所有信息都来自传统挣值分析,不需要增加额外的信息。

  1. AN OPTIMISED TASK-PERSONNEL MATCHING METHOD SUPPORTING SOFTWARE PROJECT RESOURCES SCHEDULING%一种支持软件项目资源调度的任务人员优化匹配方法

    Institute of Scientific and Technical Information of China (English)

    吴安琪; 谢利子; 肖俊超

    2011-01-01

    依赖主观判断和个人经验的任务人员分配方法具有不稳定性和不可靠性,直接导致较低的人力资源利用效率.已有的资源调度方法对人力资源的复杂性和能力差异性考虑不足.提出了一种支持软件项目资源调度的任务人员优化匹配方法.方法将心理学与软件项目管理进行结合,通过挖掘人力资源的性格能力属性,综合技术能力属性,对任务人员的匹配过程进行优化.工具和实验表明,方法可为项目管理人员进行任务分配时提供有效的决策支持.%The task-personnel assignment method depending on subjective judgment and individual experiences is instable and unreliable,which directly leads to low staffing efficiency. Existing resource scheduling methods do not pay enough attention to the complexity and capability diversity of human resources. An optimised task-personnel matching method supporting software project resource scheduling is proposed in this paper. The method combines software project management with psychology,and optimises task-personnel matching process by mining the character capabilities property in HR resource as well as integrating the skill capabilities property. The prototype tool and internal experiment indicate that the method can offer effective decision support to project managers on task assignments.

  2. 基于缓冲区和挣值分析的项目成本与进度风险预警%A Method of Risk Warning for Project Cost and Schedule Based on Buffer and Earned Value Analysis

    Institute of Scientific and Technical Information of China (English)

    李南; 戴育雷; 杨莉

    2015-01-01

    为弥补挣值分析法不具有对项目成本与进度风险量进行测评的缺陷,在挣值分析法的基础上,提出了运用缓冲区定期监测项目成本与进度风险动态变化的定量方法。该方法定义了项目成本与时间的动态缓冲区,用于表示项目成本与工期在受控范围内的变化量,并运用蒙特卡罗仿真法获取动态缓冲区尺寸;在此基础上,结合挣值分析指标,构建了项目成本与进度风险动态预警指标,对预警指标值的范围进行划分与说明。并以某弹体分系统中尾段子系统初样研制项目为例演示了该方法的使用过程,表明该方法具有良好的有效性与可操作性。%This paper proposes a quantitative method of regular monitoring the dynamic change of project cost and schedule risk using buffer based earned value analysis method to against the defect of the earned value analysis method which does not evaluate project cost and schedule risk. The dynamic buffers of project cost and time are defined,which indicates the variable amount of project cost and duration in the controlled range,and monte carlo simulation is applied to obtain the dynamic buffers size. Based on them,combined with the earned value analysis indexes,the indexes of dynamic risk warning for project cost and schedule are made and the dynamic warning value ranges are divided and explained. Finally,the application process of the proposed method is illustrated by a case study of tail subsystem in a missile system. This proves the method effective and maneuverable.

  3. MULTITASK SCHEDULING IN NETWORKED CONTROL SYSTEMS WITH APPLICATION TO LARGE SCALE VEHICLE CONTROL

    Institute of Scientific and Technical Information of China (English)

    YANG Liman; LI Yunhua

    2007-01-01

    Aiming at scheduling problems of networked control system (NCS) used to fulfill motion synthesis and cooperation control of the distributed multi-mechatronic systems, the differences of network scheduling and task scheduling are compared, and the mathematic description of task scheduling is presented. A performance index function of task scheduling of NCS according to task balance and traffic load matching principles is defined. According to this index, a static scheduling method is designed and implemented to controlling task set simulation of the DCY100 transportation vehicle. The simulation results are applied successfully to practical engineering in this case so as to validate the effectiveness of the proposed performance index and scheduling algorithm.

  4. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

    Full Text Available This paper deals with the representation of scheduling results and it introduces a new tool for visualization and simulation in time scheduling called VISIS. The purpose of this tool is to provide an environment for visualization, e.g. in production line scheduling. The simulation also proposes a way to simulate the influence of a schedule on a user defined system, e.g. for designing filters in digital signal processing. VISIS arises from representing scheduling results using the well-known Gantt chart. The application is implemented in the Matlab programming environment using Simulink and the Virtual Reality toolbox. 

  5. CPU Scheduling Algorithms: A Survey

    Directory of Open Access Journals (Sweden)

    Imran Qureshi

    2014-01-01

    Full Text Available Scheduling is the fundamental function of operating system. For scheduling, resources of system shared among processes which are going to be executed. CPU scheduling is a technique by which processes are allocating to the CPU for a specific time quantum. In this paper the review of different scheduling algorithms are perform with different parameters, such as running time, burst time and waiting times etc. The reviews algorithms are first come first serve, Shortest Job First, Round Robin, and Priority scheduling algorithm.

  6. Impact of Personnel Flexibility on Job Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Ren Lin

    2016-01-01

    Full Text Available Considering the lack of the research on the relationship between HR flexibility and scheduling effect, a resource-competency matrix-based method was proposed in order to reveal the quantitative relationship between them. Meanwhile, a job shop scheduling model with HR flexibility was established and the improved genetic algorithm was used to solve the model. A case analysis demonstrated significant impact of HR flexibility on the scheduling effect, which provided valuable guidance for building flexible manufacturing systems.

  7. An estimation of distribution algorithm (EDA) variant with QGA for Flowshop scheduling problem

    Science.gov (United States)

    Latif, Muhammad Shahid; Hong, Zhou; Ali, Amir

    2014-04-01

    In this research article, a hybrid approach is presented which based on well-known meta-heuristics algorithms. This study based on integration of Quantum Genetic Algorithm (QGA) and Estimation of Distribution Algorithm, EDA, (for simplicity we use Q-EDA) for flowshop scheduling, a well-known NP hard Problem, while focusing on the total flow time minimization criterion. A relatively new method has been adopted for the encoding of jobs sequence in flowshop known as angel rotations instead of random keys, so QGA become more efficient. Further, EDA has been integrated to update the population of QGA by making a probability model. This probabilistic model is built and used to generate new candidate solutions which comprised on best individuals, obtained after several repetitions of proposed (Q-EDA) approach. As both heuristics based on probabilistic characteristics, so exhibits excellent learning capability and have minimum chances of being trapped in local optima. The results obtained during this study are presented and compared with contemporary approaches in literature. The current hybrid Q-EDA has implemented on different benchmark problems. The experiments has showed better convergence and results. It is concluded that hybrid Q-EDA algorithm can generally produce better results while implemented for Flowshop Scheduling Problem (FSSP).

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

  9. REPETITIVE MANUAL OPERATIONS IN THE DAIRY SECTOR: ANALYSES AND CRITERIA FOR INTERVENTION

    Directory of Open Access Journals (Sweden)

    Pier Riccardo Porceddu

    2008-03-01

    Full Text Available For the health of workers it is necessary to consider, together with traditional risks (noise, vibrations, microclimate etc., risks deriving from repetitive movements, which can generate muscolo-skeletal disorders. These risks can be found in artisan dairies, where the limited use of machinery and the rapid successive passages for processing the milk require high-frequency repetitive manual movements. The study analysed the risks of repetitive movements for workers in a dairy, using the OCRA method. Various risk-involving operations emerged, which require the re-planning of the workplace. The proposed interventions have not involved high costs for the dairy, or a loss of productivity.

  10. The Prevalence and Phenomenology of Repetitive Behavior in Genetic Syndromes

    Science.gov (United States)

    Moss, Joanna; Oliver, Chris; Arron, Kate; Burbidge, Cheryl; Berg, Katy

    2009-01-01

    We investigated the prevalence and phenomenology of repetitive behavior in genetic syndromes to detail profiles of behavior. The Repetitive Behaviour Questionnaire (RBQ) provides fine-grained identification of repetitive behaviors. The RBQ was employed to examine repetitive behavior in Angelman (N = 104), Cornelia de Lange (N = 101), Cri-du-Chat…

  11. Repetitive transients extraction algorithm for detecting bearing faults

    Science.gov (United States)

    He, Wangpeng; Ding, Yin; Zi, Yanyang; Selesnick, Ivan W.

    2017-02-01

    Rolling-element bearing vibrations are random cyclostationary. This paper addresses the problem of noise reduction with simultaneous components extraction in vibration signals for faults diagnosis of bearing. The observed vibration signal is modeled as a summation of two components contaminated by noise, and each component composes of repetitive transients. To extract the two components simultaneously, an approach by solving an optimization problem is proposed in this paper. The problem adopts convex sparsity-based regularization scheme for decomposition, and non-convex regularization is used to further promote the sparsity but preserving the global convexity. A synthetic example is presented to illustrate the performance of the proposed approach for repetitive feature extraction. The performance and effectiveness of the proposed method are further demonstrated by applying to compound faults and single fault diagnosis of a locomotive bearing. The results show the proposed approach can effectively extract the features of outer and inner race defects.

  12. 基于PSO算法的舰载机舰面布放调度方法研究%Research on Deck-disposed Scheduling Method of Carrier Planes Based on PSO Algorithm

    Institute of Scientific and Technical Information of China (English)

    司维超; 韩维; 史玮韦

    2012-01-01

    基于智能粒子群(PSO)算法对戴高乐航母舰载机舰面布放调度问题的解决方法进行了研究.首先,分析了舰载机舰面布放调度的必备条件,包括设置舰面战位;测量计算舰载机由各个停机战位分别到2个准备战位的近似移动距离;分析了舰载机正常的出动流程;设计了不同数量舰载机的出动时间计算公式等.其次,将舰载机舰面布放调度问题转换为带有约束条件的多目标函数求最小解问题,并给出了数学模型.再次,分析PSO算法本身的特点、优点,给出其用于解决舰载机舰面布放调度问题的可行性,并具体分析了解决思路.最后,通过编制程序对该解决方法予以实现.实验结果表明,基于PSO算法的舰载机舰面布放调度问题解决方法是可行的,与实际要求也基本一致.%This paper presents a study of the deck-disposed scheduling method of carrier planes on board French aircraft carrier Charles de Gaulle based on the particle swarm optimization (PSO) algorithm. First, it analyzes the basic conditions of deck-disposed scheduling of carrier planes, which include battle position setting, distance measurement between gate position and preparative position, natural takeoff flow analysis, and takeoff time expressions about different numbers of carrier planes. Second, it transforms the deck-disposed scheduling to a multi-object function with constraints which seeks a minimum solution, and then provides its mathematical model. Third, it analyzes the characteristics and merits of the PSO algorithm to explore the feasibility of using the PSO algorithm to solve deck-disposed scheduling, and then presents an idiographic resolving method. Finally, it realizes the solution of PSO by compiling a program. The experimental result confirms that it is feasible to use the PSO algorithm to resolve the deck-disposed scheduling problem of carrier planes, and it is consistent with the practical demands of aircraft

  13. Integration of DEA and Taguchi method of multi-task scheduling scheme in cloud computing%融合DEA和田口方法的云计算多任务调度方案

    Institute of Scientific and Technical Information of China (English)

    王振超

    2015-01-01

    针对云计算中多任务调度和资源分配问题,提出一种融合田口方法和差分进化算法(DEA)的改进差分进化算法(IDEA),优化云计算中多任务调度和资源分配。利用田口方法的一个正交表(OA)作为掩膜变异算子对任务进行编码,通过变异、交叉过程产生更好的后代。建立成本和时间模型,以此寻找调度方案的帕累托最优解。仿真具有5个任务和5个资源的云平台环境,以平均交叉率、分布距离、最大宽度和高维空间比率作为性能指标,将IDEA算法与DEA、NSGA-II等现有算法进行比较。实验结果表明,IDEA算法在寻找任务调度和资源分配的帕累托最优解上优于NSGA-II和DEA等算法。此外,对于不同的完工时间和任务调度成本的目标,分别列出了提出算法所寻找到的最优调度方案,能够为决策者提供很大帮助。%For the issue that multi-task scheduling and resource allocation problems in cloud computing, an Improved Dif-ferential Evolution Algorithm(IDEA)fusing Taguchi method and Differential Evolution Algorithm(DEA)is proposed. The algorithm encodes the tasks by using an Orthogonal(OA)of Taguchi method as a mask mutation operator, produces better offspring by the mutation and crossover process, and establishes a cost and time model in order to find out the Pareto optimal scheduling scheme. A cloud platform environment containing five tasks and five resource is simulated to compare IDEA algorithm with DEA, NSGA-II and other existing algorithms by using average cross rate, distribution distance, max-imum width and high-dimensional space ratio as the performance index. Experimental results show that, IDEA algorithm outperforms NSGA-II, DEA and other algorithms in finding Pareto optimal solution for task scheduling and resource alloca-tion. In addition, the optimal scheduling schemes finding out by this algorithm are listed for the targets with different completion

  14. Manufacturing Scheduling Using Colored Petri Nets and Reinforcement Learning

    Directory of Open Access Journals (Sweden)

    Maria Drakaki

    2017-02-01

    Full Text Available Agent-based intelligent manufacturing control systems are capable to efficiently respond and adapt to environmental changes. Manufacturing system adaptation and evolution can be addressed with learning mechanisms that increase the intelligence of agents. In this paper a manufacturing scheduling method is presented based on Timed Colored Petri Nets (CTPNs and reinforcement learning (RL. CTPNs model the manufacturing system and implement the scheduling. In the search for an optimal solution a scheduling agent uses RL and in particular the Q-learning algorithm. A warehouse order-picking scheduling is presented as a case study to illustrate the method. The proposed scheduling method is compared to existing methods. Simulation and state space results are used to evaluate performance and identify system properties.

  15. A reduced feedback proportional fair multiuser scheduling scheme

    KAUST Repository

    Shaqfeh, Mohammad

    2011-12-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. A 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 propose a novel proportional fair multiuser switched-diversity scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the per-user feedback thresholds. We demonstrate by numerical examples that our reduced feedback proportional fair scheduler operates within 0.3 bits/sec/Hz from the achievable rates by the conventional full feedback proportional fair scheduler in Rayleigh fading conditions. © 2011 IEEE.

  16. A revised artificial insemination schedule for broiler breeder hens.

    Science.gov (United States)

    Van Krey, H P; Siegel, P B

    1976-03-01

    Broiler type hens maintained in individual cages were artificially inseminated with either 0.023, 0.035, or 0.047 ml. of pooled semen. Insemination intervals were nine, nine, and ten days on a repetitive basis. This schedule was adopted because it allowed an extension of the conventional insemination interval and yet remained compatible with a five-day industrial work-week. The results demonstrated that maintaining broiler breeder hens in cages and utilizing artificial insemination as a means of obtaining fertile eggs were feasible. The data also indicated that extending the insemination interval to 10 days is possible providing the number of spermatozoa inseminated is increased.

  17. Do DNA extraction methods and Taq polimerase quality improve the double repetitive element (DRE PCR typing method for Mycobacterium tuberculosis strains? Os métodos de extração de DNA e a qualidade DA Taq polimerase podem melhorar a tipagem molecular de M. tuberculosis por DRE-PCR

    Directory of Open Access Journals (Sweden)

    Hebe Rodrigues Cavalcanti

    2007-09-01

    Full Text Available Double repetitive element (DRE PCR amplification is a simple Mycobacterium tuberculosis typing method, however amplification failure or poor resolution of bands commit its efficacy. In order to verify if whether or not these features could be minimized by improving DNA extraction procedures or Taq polymerise quality, DRE-PCR was performed on 24 M. tuberculosis DNA samples extracted by heat-shock, mechanical and enzymatic methods applying conventional and hot start Taq pol. We demonstrated that when dealing with the Mycobacterium tuberculosis DRE-PCR typing method, Taq pol of better quality might be more important to improve amplification than the DNA extraction method.Amplificação de duplo elemento repetido (DRE por PCR é um método simples para tipagem de Mycobacterium tuberculosis, entretanto falha ou a baixa resolução das bandas na amplificação compromete a eficiência do método. Com o objetivo de verificar se estes problemas podem ou não ser minimizados pela utilização de diferentes procedimentos de extração de DNA ou de qualidades de Taq polimerase, DRE-PCR foi ensaiado em 24 amostras de DNA de M. tuberculosis extraídos pelos métodos de choque-térmico, - mecânico e enzimático utilizando Taq polimerase convencional e hot start Taq pol. Foi demonstrado que a qualidade da Taq pol utilizada talvez seja mais importante para uma melhor amplificação que o método de extração de DNA empregado.

  18. Garnet composite films with Au particles fabricated by repetitive formation for enhancement of Faraday effect

    Energy Technology Data Exchange (ETDEWEB)

    Uchida, H; Nakai, Y [Department of Electronics and Intelligent Systems, Tohoku Institute of Technology, 35-1 Yagiyama-Kasumi, Taihaku, Sendai, Miyagi 982-8577 (Japan); Mizutani, Y; Inoue, M [Department of Electrical and Electronic Information Engineering, Toyohashi University of Technology, Tempaku, Toyohashi, Aichi 441-8580 (Japan); Fedyanin, A A, E-mail: uchida_hn@tohtech.ac.jp [Faculty of Physics, Moscow State University, Moscow 119992 (Russian Federation)

    2011-02-16

    To prepare garnet (Bi : YIG) composite films with Au particles, we used a repetitive formation method to increase the number density of particles. On increasing the number of repetitions, the diameter distribution of the particles changed. After five repetitions using 5 nm Au films, the diameter distribution separated into two size groups. Shift of wavelength-excited localized surface plasmon resonance is discussed relative to the diameter distribution. In the composite films, enhancement of Faraday rotation associated with surface plasmons was observed. With six repetitions, a maximum enhanced rotation of -1.2{sup 0} was obtained, which is 20 times larger than that of a single Bi : YIG film. The figures of merit for the composite films are discussed. The thickness of a Bi : YIG composite film working for enhanced Faraday rotation was examined using an ion milling method.

  19. Communication contention in APN list scheduling algorithm

    Institute of Scientific and Technical Information of China (English)

    TANG XiaoYong; LI KenLi; PADUA Divid

    2009-01-01

    Task scheduling is an essential aspect of parallel process system. This NP-hard problem assumes fully connected homogeneous processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. This paper investigates the Incorporation of contention awareness into task scheduling. The innovation is the idea of dynamically scheduling edges to links, for which we use the earliest finish communication time search algorithm based on shortest-path search method. The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary processor network. In the end, to reduce time complexity of algorithm, a parallel algorithm is proposed and speedup O(PPE) is achieved. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm significantly surpasses classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application.

  20. Integrated network design and scheduling problems :

    Energy Technology Data Exchange (ETDEWEB)

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01

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

  1. SCHEDULING PROBLEMS-AN OVERVIEW

    Institute of Scientific and Technical Information of China (English)

    Asmuliardi MULUK; Hasan AKPOLAT; Jichao XU

    2003-01-01

    There seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling model. However in the practice, the optimum that is built into the scheduling applications seems to face some challenges when dealing with the dynamic character of a scheduling system, for instance machine breakdown or change of orders. Scheduling systems have become quite complex in the past few years. Competitive business environments and shorter product life cycles are the imminent challenges being faced by many companies these days.These challenges push companies to anticipate a demand driven supply chain in their business environment. A demand-driven supply chain incorporates the customer view into the supply chain processes. As a consequence of this, scheduling as a core process of the demand-driven supply chain must also reflect the customer view. In addition, other approaches to solving scheduling problems, for instance approaches based on human factors, prefer the scheduling system to be more flexible in both design and implementation. After discussion of these factors, the authors propose the integration of a different set of criteria for the development of scheduling systems which not only appears to have a better flexibility but also increased customer-focus.

  2. Sensory dysfunction associated with repetitive strain injuries of tendinitis and focal hand dystonia: a comparative study.

    Science.gov (United States)

    Byl, N; Wilson, F; Merzenich, M; Melnick, M; Scott, P; Oakes, A; McKenzie, A

    1996-04-01

    Repetitive strain injuries are reaching epidemic levels among workers who perform heavy schedules of rapid alternating movements (eg., computer programmers, data entry workers) or repetitive, sustained, coordinated movements (eg., editors, writers, salespeople). The purpose of this study was to determine if patients with repetitive strain injury demonstrated degraded sensory motor performance with their hands. Sixty age-matched adults were recruited, with 15 each assigned to a healthy adult control group, a healthy musician control group, a tendinitis group, or a focal dystonia group. Four sensory motor subtests from the Sensory Integration and Praxis Test were given to the subjects according to a standardized protocol. Using multiple one-factor analyses of variance in the parametric or nonparametric mode followed by post hoc pairwise testing, no significant differences were found between the healthy controls and the musician controls. On the test of kinesthesia, using the left hand, subjects with tendinitis performed significantly worse than controls and subjects with focal dystonia. Compared with controls, subjects with focal dystonia did significantly worse on graphesthesia and manual form perception (part 1 and part 2). Subjects with focal dystonia also did significantly worse than subjects with tendinitis when using the left hand on graphesthesia and manual form perception (part 2). When treating patients with repetitive strain injury, discriminative sensory motor skills must be carefully assessed and may need to be addressed as part of an effective treatment program.

  3. ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS

    OpenAIRE

    Gennady A. Berketov

    2015-01-01

    The article considers the original algorithmfor solving the generalized problem ofscheduling theory, based on the branch and bound method. Task schedulingperform works (operations) and restrictions on resources used often occur with scheduling discrete manufacturing operations, optimizing network implementationschedules of scientific, economic or technical projects. Tools to solve suchproblems are included in the decisionsupport system ACS in many businesses.The effectiveness of the proposed ...

  4. Deterministic Real-time Thread Scheduling

    CERN Document Server

    Yun, Heechul; Sha, Lui

    2011-01-01

    Race condition is a timing sensitive problem. A significant source of timing variation comes from nondeterministic hardware interactions such as cache misses. While data race detectors and model checkers can check races, the enormous state space of complex software makes it difficult to identify all of the races and those residual implementation errors still remain a big challenge. In this paper, we propose deterministic real-time scheduling methods to address scheduling nondeterminism in uniprocessor systems. The main idea is to use timing insensitive deterministic events, e.g, an instruction counter, in conjunction with a real-time clock to schedule threads. By introducing the concept of Worst Case Executable Instructions (WCEI), we guarantee both determinism and real-time performance.

  5. Validity and reliability of the Behavior Problems Inventory, the Aberrant Behavior Checklist, and the Repetitive Behavior Scale-Revised among infants and toddlers at risk for intellectual or developmental disabilities: a multi-method assessment approach.

    Science.gov (United States)

    Rojahn, Johannes; Schroeder, Stephen R; Mayo-Ortega, Liliana; Oyama-Ganiko, Rosao; LeBlanc, Judith; Marquis, Janet; Berke, Elizabeth

    2013-05-01

    Reliable and valid assessment of aberrant behaviors is essential in empirically verifying prevention and intervention for individuals with intellectual or developmental disabilities (IDD). Few instruments exist which assess behavior problems in infants. The current longitudinal study examined the performance of three behavior-rating scales for individuals with IDD that have been proven psychometrically sound in older populations: the Aberrant Behavior Checklist (ABC), the Behavior Problems Inventory (BPI-01), and the Repetitive Behavior Scale - Revised (RBS-R). Data were analyzed for 180 between six and 36 months old children at risk for IDD. Internal consistency (Cronbach's α) across the subscales of the three instruments was variable. Test-retest reliability of the three BPI-01 subscales ranged from .68 to .77 for frequency ratings and from .65 to .80 for severity ratings (intraclass correlation coefficients). Using a multitrait-multimethod matrix approach high levels of convergent and discriminant validity across the three instruments was found. As anticipated, there was considerable overlap in the information produced by the three instruments; however, each behavior-rating instrument also contributed unique information. Our findings support using all three scales in conjunction if possible.

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

  7. Integrated multi-objective optimization method for equal lot splitting flexible job-shop scheduling problem%多目标等量分批柔性作业车间调度集成优化方法

    Institute of Scientific and Technical Information of China (English)

    曾强; 沈玲; 杨育; 宋红娜

    2012-01-01

    Aiming at the multi-objective optimization problem for the equal lot splitting flexible job-shop scheduling, an integrated optimization method is proposed. Firstly, a multi-objective optimization model is established with the objective to minimize the makespan and minimize the manufacturing cost. Then, an improved Non-dominated Sorting Genetic Algorithm II (NSGA II) is presented and designed to solve the model. In the algorithm, an object-oriented technique is introduced to deal with the complicated logical relation between different entities, a three-segment encoding technique is used to encode the lot splitting scheme, the process sequences and machines, a three-segment hybrid crossover and mutation operator is used to implement genetic evolution, and two delicacy scheduling techniques are applied to reduce the flow time of each sub-batch. Finally, the effectiveness of the scheduling method proposed is validated by case study.%针对多目标等量分批柔性作业车间调度问题,提出了一种集成优化方法.构建了一种以完工时间最短、生产成本最低为优化目标的多目标等量分批柔性调度集成优化模型.提出并设计了一种改进的非支配排序遗传算法对模型加以求解.算法中引入面向对象技术处理复杂的实体逻辑关系,采用三段式分段编码技术分别对分批方案、加工顺序、设备进行编码,采用三段式分段交叉和变异的混合遗传算子实现遗传进化,采用两种精细化调度技术进行解码以缩短流程时间.通过案例分析验证了所提方法的有效性.

  8. High-efficiency synthesis of nanoparticles in a repetitive multigap spark discharge generator

    Science.gov (United States)

    Ivanov, V. V.; Efimov, A. A.; Mylnikov, D. A.; Lizunova, A. A.; Bagazeev, A. V.; Beketov, I. V.; Shcherbinin, S. V.

    2016-08-01

    We describe a method of obtaining aerosol nanoparticles in a repetitive spark discharge generator with 12 interelectrode gaps between tin electrodes, which operates at a pulse repetition frequency of 2.5 kHz. During synthesis of tin oxide nanoparticles in air, the mass productivity of the gas discharge generator reaches up to 9 g/h for primary particles with characteristic sizes within 5-10 nm and agglomerate size on the order of 50 nm.

  9. Repetitive Cyclic Potentiodynamic Polarization Scan Results for Reduced Sample Volume Testing

    Energy Technology Data Exchange (ETDEWEB)

    LaMothe, Margaret E. [Washington River Protection Solutions, Richland, WA (United States)

    2016-03-15

    This report is the compilation of data gathered after repetitively testing simulated tank waste and a radioactive tank waste sample using a cyclic potentiodynamic polarization (CPP) test method to determine corrosion resistance of metal samples. Electrochemistry testing of radioactive tank samples is often used to assess the corrosion susceptibility and material integrity of waste tank steel. Repetitive testing of radiological tank waste is occasionally requested at 222-S Laboratory due to the limited volume of radiological tank sample received for testing.

  10. Acceleration schedules for a recirculating heavy-ion accelerator

    Energy Technology Data Exchange (ETDEWEB)

    Sharp, W.M.; Grote, D.P.

    2002-05-01

    Recent advances in solid-state switches have made it feasible to design programmable, high-repetition-rate pulsers for induction accelerators. These switches could lower the cost of recirculating induction accelerators, such as the ''small recirculator'' at Lawrence Livermore National Laboratory (LLNL), by substantially reducing the number of induction modules. Numerical work is reported here to determine what effects the use of fewer pulsers at higher voltage would have on the beam quality of the LLNL small recirculator. Lattices with different numbers of pulsers are examined using the fluid/envelope code CIRCE, and several schedules for acceleration and compression are compared for each configuration. For selected schedules, the phase-space dynamics is also studied using the particle-in-cell code WARP3d.

  11. Extended precedence preservative crossover for job shop scheduling problems

    Science.gov (United States)

    Ong, Chung Sin; Moin, Noor Hasnah; Omar, Mohd

    2013-04-01

    Job shop scheduling problems (JSSP) is one of difficult combinatorial scheduling problems. A wide range of genetic algorithms based on the two parents crossover have been applied to solve the problem but multi parents (more than two parents) crossover in solving the JSSP is still lacking. This paper proposes the extended precedence preservative crossover (EPPX) which uses multi parents for recombination in the genetic algorithms. EPPX is a variation of the precedence preservative crossover (PPX) which is one of the crossovers that perform well to find the solutions for the JSSP. EPPX is based on a vector to determine the gene selected in recombination for the next generation. Legalization of children (offspring) can be eliminated due to the JSSP representation encoded by using permutation with repetition that guarantees the feasibility of chromosomes. The simulations are performed on a set of benchmarks from the literatures and the results are compared to ensure the sustainability of multi parents recombination in solving the JSSP.

  12. FBFN-based adaptive repetitive control of nonlinearly parameterized systems

    Institute of Scientific and Technical Information of China (English)

    Wenli Sun; Hong Cai; Fu Zhao

    2013-01-01

    An adaptive repetitive control scheme is presented for a class of nonlinearly parameterized systems based on the fuzzy ba-sis function network (FBFN). The parameters of the fuzzy rules are tuned with adaptive schemes. To attenuate chattering effectively, the discontinuous control term is approximated by an adaptive PI control structure. The bound of the discontinuous control term is assumed to be unknown and estimated by an adaptive mecha-nism. Based on the Lyapunov stability theory, an adaptive repeti-tive control law is proposed to guarantee the closed-loop stability and the tracking performance. By means of FBFNs, which avoid the nonlinear parameterization from entering into the adaptive repetitive control, the control er singularity problem is solved. The proposed approach does not require an exact structure of the sys-tem dynamics, and the proposed control er is utilized to control a model of permanent-magnet linear synchronous motor subject to significant disturbances and parameter uncertainties. The simula-tion results demonstrate the effectiveness of the proposed method.

  13. An Iterated Local Search Algorithm for a Place Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Shicheng Hu

    2013-01-01

    Full Text Available We study the place scheduling problem which has many application backgrounds in realities. For the block manufacturing project with special manufacturing platform requirements, we propose a place resource schedule problem. First, the mathematical model for the place resource schedule problem is given. On the basis of resource-constrained project scheduling problem and packing problem, we develop a hybrid heuristic method which combines priority rules and three-dimensional best fit algorithm, in which the priority rules determine the scheduling order and the three-dimensional best fit algorithm solves the placement. After this method is used to get an initial solution, the iterated local search is employed to get an improvement. Finally, we use a set of simulation data to demonstrate the steps of the proposed method and verify its feasibility.

  14. The LSST OCS scheduler design

    Science.gov (United States)

    Delgado, Francisco; Schumacher, German

    2014-08-01

    The Large Synoptic Survey Telescope (LSST) is a complex system of systems with demanding performance and operational requirements. The nature of its scientific goals requires a special Observatory Control System (OCS) and particularly a very specialized automatic Scheduler. The OCS Scheduler is an autonomous software component that drives the survey, selecting the detailed sequence of visits in real time, taking into account multiple science programs, the current external and internal conditions, and the history of observations. We have developed a SysML model for the OCS Scheduler that fits coherently in the OCS and LSST integrated model. We have also developed a prototype of the Scheduler that implements the scheduling algorithms in the simulation environment provided by the Operations Simulator, where the environment and the observatory are modeled with real weather data and detailed kinematics parameters. This paper expands on the Scheduler architecture and the proposed algorithms to achieve the survey goals.

  15. DTS: Building custom, intelligent schedulers

    Science.gov (United States)

    Hansson, Othar; Mayer, Andrew

    1994-01-01

    DTS is a decision-theoretic scheduler, built on top of a flexible toolkit -- this paper focuses on how the toolkit might be reused in future NASA mission schedulers. The toolkit includes a user-customizable scheduling interface, and a 'Just-For-You' optimization engine. The customizable interface is built on two metaphors: objects and dynamic graphs. Objects help to structure problem specifications and related data, while dynamic graphs simplify the specification of graphical schedule editors (such as Gantt charts). The interface can be used with any 'back-end' scheduler, through dynamically-loaded code, interprocess communication, or a shared database. The 'Just-For-You' optimization engine includes user-specific utility functions, automatically compiled heuristic evaluations, and a postprocessing facility for enforcing scheduling policies. The optimization engine is based on BPS, the Bayesian Problem-Solver (1,2), which introduced a similar approach to solving single-agent and adversarial graph search problems.

  16. Analyzing scheduling in the food-processing industry

    DEFF Research Database (Denmark)

    Akkerman, Renzo; van Donk, Dirk Pieter

    2009-01-01

    Production scheduling has been widely studied in several research areas, resulting in a large number of methods, prescriptions, and approaches. However, the impact on scheduling practice seems relatively low. This is also the case in the food-processing industry, where industry-specific character...

  17. 5 CFR 2100.6 - Schedule of fees.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Schedule of fees. 2100.6 Section 2100.6 Administrative Personnel ARMED FORCES RETIREMENT HOME ARMED FORCES RETIREMENT HOME PRIVACY ACT PROCEDURES § 2100... production of the copies is in the interest of the Government. (c) Fee Schedule and method of payment....

  18. Refining borders of genome-rearrangements including repetitions

    Directory of Open Access Journals (Sweden)

    JA Arjona-Medina

    2016-10-01

    Full Text Available Abstract Background DNA rearrangement events have been widely studied in comparative genomic for many years. The importance of these events resides not only in the study about relatedness among different species, but also to determine the mechanisms behind evolution. Although there are many methods to identify genome-rearrangements (GR, the refinement of their borders has become a huge challenge. Until now no accepted method exists to achieve accurate fine-tuning: i.e. the notion of breakpoint (BP is still an open issue, and despite repeated regions are vital to understand evolution they are not taken into account in most of the GR detection and refinement methods. Methods and results We propose a method to refine the borders of GR including repeated regions. Instead of removing these repetitions to facilitate computation, we take advantage of them using a consensus alignment sequence of the repeated region in between two blocks. Using the concept of identity vectors for Synteny Blocks (SB and repetitions, a Finite State Machine is designed to detect transition points in the difference between such vectors. The method does not force the BP to be a region or a point but depends on the alignment transitions within the SBs and repetitions. Conclusion The accurate definition of the borders of SB and repeated genomic regions and consequently the detection of BP might help to understand the evolutionary model of species. In this manuscript we present a new proposal for such a refinement. Features of the SBs borders and BPs are different and fit with what is expected. SBs with more diversity in annotations and BPs short and richer in DNA replication and stress response, which are strongly linked with rearrangements.

  19. Repetition-based Interactive Facade Modeling

    KAUST Repository

    AlHalawani, Sawsan

    2012-07-01

    Modeling and reconstruction of urban environments has gained researchers attention throughout the past few years. It spreads in a variety of directions across multiple disciplines such as image processing, computer graphics and computer vision as well as in architecture, geoscience and remote sensing. Having a virtual world of our real cities is very attractive in various directions such as entertainment, engineering, governments among many others. In this thesis, we address the problem of processing a single fa cade image to acquire useful information that can be utilized to manipulate the fa cade and generate variations of fa cade images which can be later used for buildings\\' texturing. Typical fa cade structures exhibit a rectilinear distribution where in windows and other elements are organized in a grid of horizontal and vertical repetitions of similar patterns. In the firt part of this thesis, we propose an efficient algorithm that exploits information obtained from a single image to identify the distribution grid of the dominant elements i.e. windows. This detection method is initially assisted with the user marking the dominant window followed by an automatic process for identifying its repeated instances which are used to define the structure grid. Given the distribution grid, we allow the user to interactively manipulate the fa cade by adding, deleting, resizing or repositioning the windows in order to generate new fa cade structures. Having the utility for the interactive fa cade is very valuable to create fa cade variations and generate new textures for building models. Ultimately, there is a wide range of interesting possibilities of interactions to be explored.

  20. Littoral Combat Ship Crew Scheduling

    Science.gov (United States)

    2015-03-01

    package DON Department of the Navy F&R Fix and Relax GAMS General Algebraic Modeling System LCS Littoral Combat Ship LCSRON Littoral Combat Ship...but that can be acceptable depending on the scheduler needs. F&R produces superior long-term schedules when compared to a similar-length RH schedule...LEFT BLANK 29 IV. MODEL IMPLEMENTATION LCSS is implemented with the General Algebraic Modeling System (GAMS) using the GAMS/CPLEX (GAMS, 2014

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

  2. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  3. Visually Exploring Transportation Schedules.

    Science.gov (United States)

    Palomo, Cesar; Guo, Zhan; Silva, Cláudio T; Freire, Juliana

    2016-01-01

    Public transportation schedules are designed by agencies to optimize service quality under multiple constraints. However, real service usually deviates from the plan. Therefore, transportation analysts need to identify, compare and explain both eventual and systemic performance issues that must be addressed so that better timetables can be created. The purely statistical tools commonly used by analysts pose many difficulties due to the large number of attributes at trip- and station-level for planned and real service. Also challenging is the need for models at multiple scales to search for patterns at different times and stations, since analysts do not know exactly where or when relevant patterns might emerge and need to compute statistical summaries for multiple attributes at different granularities. To aid in this analysis, we worked in close collaboration with a transportation expert to design TR-EX, a visual exploration tool developed to identify, inspect and compare spatio-temporal patterns for planned and real transportation service. TR-EX combines two new visual encodings inspired by Marey's Train Schedule: Trips Explorer for trip-level analysis of frequency, deviation and speed; and Stops Explorer for station-level study of delay, wait time, reliability and performance deficiencies such as bunching. To tackle overplotting and to provide a robust representation for a large numbers of trips and stops at multiple scales, the system supports variable kernel bandwidths to achieve the level of detail required by users for different tasks. We justify our design decisions based on specific analysis needs of transportation analysts. We provide anecdotal evidence of the efficacy of TR-EX through a series of case studies that explore NYC subway service, which illustrate how TR-EX can be used to confirm hypotheses and derive new insights through visual exploration.

  4. 铁路车站取送车系统优化理论与方法研究%Study on Optimization Theory and Method of the Wagon's Takeout and Delivery Scheduling System in Railway Station

    Institute of Scientific and Technical Information of China (English)

    牟峰; 王慈光

    2012-01-01

    The wagon's takeout and delivery scheduling system in railway freight station (WTDSS) is a subsystem of railway station scheduling system, and its operation efficiency has a close bearing on the on-schedule rate of departure trains, wagon turnaround time and many other transportation production indexes. Based on the system optimization theory and methodology, the combinatorial mathematics theory, the set theory as well as some transportation production experiences, this dissertation analyzes the elements, structure, environment and characteristics of the wagon' s takeout and delivery scheduling system and studies modeling method, the construction method of model solution, optimization algorithm and heuristic methods for improving optimization efficiency of the wagon's delivery and takeout problem. The applicability of the research results has been validated by example. The main research contents and conclusions are as follows.(1) The operation objects, the loading-unloading locations and their layout forms, all kinds of takeout and delivery operations and their component elements, the operation organization modes are systematically analyzed in details. The WTDSS functional factors, environment and characteristics are comprehensively analyzed. The relevant concepts are clearly defined.(2) The wagon's delivery and takeout problem (WTDP) whose loading-unloading locations show radial layout (R-WTDP) is studied. Under the assumption that the locomotive haulage capacity and the wagon acceptance capacity of each loading-unloading location are both unlimited, the ideal mathematical models for the non-through and theunfixed form wagon flow are respectively established based on the fact that the sequence, moment and batch number problems of takeout and delivery operations during a period of time are a whole system. According to features of the models, expression method of the solution is designed, and modular implementation method for the models is proposed to construct

  5. 铁路货运机车动态周转与运用优化方法研究%Method for Optimization of Freight Locomotive Scheduling and Routing Problem

    Institute of Scientific and Technical Information of China (English)

    王龙; 马建军; 林柏梁; 陈雷; 温旭红

    2014-01-01

    Optimization of formulation of freight locomotive scheduling and routing plans from the angle of dy-namic states is of great significance to improving the daily working efficiency of locomotives and to satisfying requirements of traction power of trains.In this paper,the continuous multi-level time-space network applica-ble to any locomotive run was constructed in comprehensive consideration of locomotive servicing work,repair and stand-by etc in locomotive shunting and with figuring out the correct and efficient locomotive daily working diagram as the objective.Thus,the freight locomotive scheduling and routing problem was transformed into route choice of freight locomotives in the time-space network.Applying the thought of path-based model,sets of available routes were generated for any of locomotives,the model for route choice was constructed and the genetic algorithm was used to solve the model.Therefore,a set of theoretical methods for optimization of freight locomotive scheduling and routing problem was formed.Finally,a numerical example was given to veri-fy the rationality and effectiveness of the proposed model and algorithm.%从动态角度出发优化编制铁路货运机车周转与运用计划对于提高机车日常工作效率、及时配备牵引动力具有重要意义。本文以编制高效的日计划机车周转图为目标,综合兼顾机车调度过程中整备、检修、备用等因素,针对任意机车交路建立多层次连续型时空网络,从而将铁路货运机车动态周转与运用问题转化为时空网络中机车走行径路的选择问题。采用弧-路模型思想为其中任意一台机车生成可选径路集,构建相应的径路优化模型,应用遗传算法对模型求解,形成一套解决铁路货运机车动态周转与运用问题的理论优化方法。最后,通过算例验证模型与算法的合理性及有效性。

  6. Talking Picture Schedules: Embedding Video Models into Visual Activity Schedules to Increase Independence for Students with ASD

    Science.gov (United States)

    Spriggs, Amy D.; Knight, Victoria; Sherrow, Lauren

    2015-01-01

    Studies examining video modeling and visual activity schedules independent of one another have been shown to be effective in teaching skills for students with autism, but there is little research about the effectiveness of combining the two methods. Use of visual activity schedules with embedded video models via an iPad application was…

  7. The neurobiology of repetitive behavior : of mice…

    NARCIS (Netherlands)

    Langen, Marieke; Kas, Martien J H; Staal, Wouter G; van Engeland, Herman; Durston, Sarah

    2011-01-01

    Repetitive and stereotyped behavior is a prominent element of both animal and human behavior. Similar behavior is seen across species, in diverse neuropsychiatric disorders and in key phases of typical development. This raises the question whether these similar classes of behavior are caused by simi

  8. Large-scale detection of repetitions.

    Science.gov (United States)

    Smyth, W F

    2014-05-28

    Combinatorics on words began more than a century ago with a demonstration that an infinitely long string with no repetitions could be constructed on an alphabet of only three letters. Computing all the repetitions (such as ∙∙∙TTT ∙∙∙ or ∙∙∙ CGACGA ∙∙∙ ) in a given string x of length n is one of the oldest and most important problems of computational stringology, requiring time in the worst case. About a dozen years ago, it was discovered that repetitions can be computed as a by-product of the Θ(n)-time computation of all the maximal periodicities or runs in x. However, even though the computation is linear, it is also brute force: global data structures, such as the suffix array, the longest common prefix array and the Lempel-Ziv factorization, need to be computed in a preprocessing phase. Furthermore, all of this effort is required despite the fact that the expected number of runs in a string is generally a small fraction of the string length. In this paper, I explore the possibility that repetitions (perhaps also other regularities in strings) can be computed in a manner commensurate with the size of the output.

  9. Verbal Repetitions and Echolalia in Alzheimer's Discourse

    Science.gov (United States)

    Da Cruz, Fernanda Miranda

    2010-01-01

    This article reports on an investigation of echolalic repetition in Alzheimer's disease (AD). A qualitative analysis of data from spontaneous conversations with MHI, a woman with AD, is presented. The data come from the DALI Corpus, a corpus of spontaneous conversations involving subjects with AD. This study argues that echolalic effects can be…

  10. Neurobehavioural Correlates of Abnormal Repetitive Behaviour

    Directory of Open Access Journals (Sweden)

    R. A. Ford

    1991-01-01

    Full Text Available Conditions in which echolalia and echopraxia occur are reviewed, followed by an attempt to elicit possible mechanisms of these phenomena. A brief description of stereotypical and perseverative behaviour and obsessional phenomena is given. It is suggested that abnormal repetitive behaviour may occur partly as a result of central dopaminergic dysfunction.

  11. Reducing Repetitive Speech: Effects of Strategy Instruction.

    Science.gov (United States)

    Dipipi, Caroline M.; Jitendra, Asha K.; Miller, Judith A.

    2001-01-01

    This article describes an intervention with an 18-year-old young woman with mild mental retardation and a seizure disorder, which focused on her repetitive echolalic verbalizations. The intervention included time delay, differential reinforcement of other behaviors, and self-monitoring. Overall, the intervention was successful in facilitating…

  12. Verbal Repetitions and Echolalia in Alzheimer's Discourse

    Science.gov (United States)

    Da Cruz, Fernanda Miranda

    2010-01-01

    This article reports on an investigation of echolalic repetition in Alzheimer's disease (AD). A qualitative analysis of data from spontaneous conversations with MHI, a woman with AD, is presented. The data come from the DALI Corpus, a corpus of spontaneous conversations involving subjects with AD. This study argues that echolalic effects can be…

  13. Combinatorial codon scrambling enables scalable gene synthesis and amplification of repetitive proteins

    Science.gov (United States)

    Tang, Nicholas C.; Chilkoti, Ashutosh

    2016-04-01

    Most genes are synthesized using seamless assembly methods that rely on the polymerase chain reaction (PCR). However, PCR of genes encoding repetitive proteins either fails or generates nonspecific products. Motivated by the need to efficiently generate new protein polymers through high-throughput gene synthesis, here we report a codon-scrambling algorithm that enables the PCR-based gene synthesis of repetitive proteins by exploiting the codon redundancy of amino acids and finding the least-repetitive synonymous gene sequence. We also show that the codon-scrambling problem is analogous to the well-known travelling salesman problem, and obtain an exact solution to it by using De Bruijn graphs and a modern mixed integer linear programme solver. As experimental proof of the utility of this approach, we use it to optimize the synthetic genes for 19 repetitive proteins, and show that the gene fragments are amenable to PCR-based gene assembly and recombinant expression.

  14. Combinatorial codon scrambling enables scalable gene synthesis and amplification of repetitive proteins.

    Science.gov (United States)

    Tang, Nicholas C; Chilkoti, Ashutosh

    2016-04-01

    Most genes are synthesized using seamless assembly methods that rely on the polymerase chain reaction (PCR). However, PCR of genes encoding repetitive proteins either fails or generates nonspecific products. Motivated by the need to efficiently generate new protein polymers through high-throughput gene synthesis, here we report a codon-scrambling algorithm that enables the PCR-based gene synthesis of repetitive proteins by exploiting the codon redundancy of amino acids and finding the least-repetitive synonymous gene sequence. We also show that the codon-scrambling problem is analogous to the well-known travelling salesman problem, and obtain an exact solution to it by using De Bruijn graphs and a modern mixed integer linear programme solver. As experimental proof of the utility of this approach, we use it to optimize the synthetic genes for 19 repetitive proteins, and show that the gene fragments are amenable to PCR-based gene assembly and recombinant expression.

  15. Repetitive control mechanism of disturbance cancellation using a hybrid regression and genetic algorithm

    Science.gov (United States)

    Lin, Jeng-Wen; Shen, Pu Fun; Wen, Hao-Ping

    2015-10-01

    The application of a repetitive control mechanism for use in a mechanical control system has been a topic of investigation. The fundamental purpose of repetitive control is to eliminate disturbances in a mechanical control system. This paper presents two different repetitive control laws using individual types of basis function feedback and their combinations. These laws adjust the command given to a feedback control system to eliminate tracking errors, generally resulting from periodic disturbance. Periodic errors can be reduced through linear basis functions using regression and a genetic algorithm. The results illustrate that repetitive control is most effective method for eliminating disturbances. When the data are stabilized, the tracking error of the obtained convergence value, 10-14, is the optimal solution, verifying that the proposed regression and genetic algorithm can satisfactorily reduce periodic errors.

  16. An evaluation of factors affecting duration of treatment with repetitive transcranial magnetic stimulation for depression

    Directory of Open Access Journals (Sweden)

    Roni Broder Cohen

    2007-12-01

    Full Text Available Objective: To investigate the effects of repetitive transcranialmagnetic stimulation in patients with major depression who weresubmitted to this treatment during the period from 2000 to 2006.Methods: A retrospective study with 204 patients who underwenttreatment with repetitive transcranial magnetic stimulation, collectingdata from those who experienced remission (defined as a HDRS scoreequal to or lower than 7. The patients were followed for up to 6 monthsafter treatment. Mean duration of remission for this cohort of patientswas 70.2 (± 58.4 days. Results: The only variable associated withthe duration of remission in the linear regression model was numberof repetitive transcranial magnetic stimulation sessions. Conclusion:Our findings suggest that the greater the number of sessions, the longerthe duration of repetitive transcranial magnetic stimulation effects.Consequently, future research investigating the effects of repetitivetranscranial magnetic stimulation should explore this variable in orderto maximize the therapeutic effects of this new brain stimulationtechnique.

  17. A novel concept for scheduling and effect assessment of soft-kill against an antiship missile based on the adjoint method

    NARCIS (Netherlands)

    Weiss, M.; Vermeulen, A.; Bos, J.; Bucco, D.

    2011-01-01

    The Adjoint Method is a well establised tool for assessement of guidance loops in conceptual design studies. It allows one to perform quick assessments of the performance both in deterministic settings, to determine a nominal or average miss distance, and in stochastic settings, to determine the

  18. Energy-saving-oriented production scheduling method for injection molding process with multiple products%单机多产品注塑过程的节能调度方法

    Institute of Scientific and Technical Information of China (English)

    陆宁云; 公桂霞; 吕建华; 杨毅

    2013-01-01

    A production scheduling method was proposed for injection molding (IM) process with multiple products produced by a single machine, in order to achieve global minimum energy consumption. The total energy consumption was split into three parts. The first part was defined as switchover energy consumption, i.e. , the energy used for replacing the die and mold, changing the color or material, etc. The second part was defined as transitional energy consumption, which was determined by the regulation time for controlling the end-product with desired quality. The third part was the energy consumed during the stable production periods, which was defined as stable energy consumption. The total energy consumption model was described by a directed graph, where the nodes represented the stable production of different products and the arcs represented product switchovers. The single-machine-multi-product scheduling problem was formulated as a typical traveling salesman problem (TSP). A genetic algorithm (GA) based lexicographic optimization framework was proposed to solve such a scheduling problem. The first-layer optimization was to search the feasible process parameters that contributed to reliable production of each product. The second-layer optimization was to solve a TSP problem by finding the optimal switching path among the multiple products in order to minimize the global energy consumption. The proposed scheduling method could improve production efficiency and reduce energy consumption. Experimental results in laboratory scale tests demonstrated its feasibility and effectiveness.%为减小单机多产品注塑过程的生产总能耗,提出一种基于旅行商算法(TSP)和遗传算法(GA)的节能调度方法.研究了注塑生产总能耗的3个重要组成:产品切换能耗、过渡调整能耗和稳定生产能耗,建立了产品切换过渡的能耗模型.以单产平稳模态为节点、过渡模态为支路,建立了单机多产品过程生产总能耗的有

  19. Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance

    Science.gov (United States)

    Carter, Christine E.; Grahn, Jessica A.

    2016-01-01

    Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the “contextual interference effect.” While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

  20. Optimizing music learning: Exploring how blocked and interleaved practice schedules affect advanced performance

    Directory of Open Access Journals (Sweden)

    Christine E Carter

    2016-08-01

    Full Text Available Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the contextual interference effect. While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (twelve minutes per piece and a second concerto exposition and technical excerpt to practice in an interleaved schedule (three minutes per piece, alternating until a total of twelve minutes of practice were completed on each piece. Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated

  1. Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance.

    Science.gov (United States)

    Carter, Christine E; Grahn, Jessica A

    2016-01-01

    Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the "contextual interference effect." While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule

  2. 基于多目标粒子群算法的柔性作业车间调度优化方法%Optimization Method of Flexible Job-shop Scheduling Based on Multiobjective Particle Swarm Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    王云; 冯毅雄; 谭建荣; 李中凯

    2011-01-01

    针对柔性作业车间的多目标调度问题,构建了以制造工期、加工成本及提前/拖期惩罚值为目标函数的柔性作业车间调度模型,提出基于密集距离排序的自适应多目标粒子群算法.采用精英策略保留进化过程中的优势个体,基于个体密集距离降序排列进行外部种群的缩减和全局最优值的更新,并引入小概率的变异机制以增强解的多样性和算法的全局寻优能力.最后,将该方法应用于某机械公司的柔性作业车间多目标调度中,仿真结果证明了该方法的有效性和适应性.%To solve flexible job-shop multiobjective scheduling problem, the optimization model was set up. Considering of the makespan, manufacturing cost and earliness/tardiness penalties, a crowding distance sorting based on multiobjective particle swarm optimization algorithm was proposed. With the elitism strategy, dominant individuals were preserved in evolution process. The shrink of the external population and update of the global best were achieved by the individuals' crowding distance sorting in descending order. A small ratio mutation was introduced to enhance the diversity of solutions and the global searching capacity of the algorithm. Finally, the feasibility and validity of the method was proved by the simulation results of a flexible job-shop multiobjective scheduling in a workshop.

  3. A feasible repetitive transcranial magnetic stimulation clinical protocol in migraine prevention

    Directory of Open Access Journals (Sweden)

    Shawn Zardouz

    2016-10-01

    Full Text Available Objective: This case series was conducted to determine the clinical feasibility of a repetitive transcranial magnetic stimulation protocol for the prevention of migraine (with and without aura. Methods: Five patients with migraines underwent five repetitive transcranial magnetic stimulation sessions separated in 1- to 2-week intervals for a period of 2 months at a single tertiary medical center. Repetitive transcranial magnetic stimulation was applied to the left motor cortex with 2000 pulses (20 trains with 1s inter-train interval delivered per session, at a frequency of 10 Hz and 80% resting motor threshold. Pre- and post-treatment numerical rating pain scales were collected, and percent reductions in intensity, frequency, and duration were generated. Results: An average decrease in 37.8%, 32.1%, and 31.2% were noted in the intensity, frequency, and duration of migraines post-repetitive transcranial magnetic stimulation, respectively. A mean decrease in 1.9±1.0 (numerical rating pain scale ± standard deviation; range: 0.4–2.8 in headache intensity scores was noted after the repetitive transcranial magnetic stimulation sessions. Conclusion: The tested repetitive transcranial magnetic stimulation protocol is a well-tolerated, safe, and effective method for migraine prevention.

  4. Tramp Ship Routing and Scheduling - Incorporating Additional Complexities

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte

    for tramp ship routing and scheduling problems. This is done in the context of Operations Research, a research field that has achieved great success within optimisation-based planning for vehicle routing problems and in many other areas. The first part of this thesis contains a comprehensive introduction...... of their demand in advance. However, the detailed requirements of these contract cargoes can be subject to ongoing changes, e.g. the destination port can be altered. For tramp operators, a main concern is therefore the efficient and continuous planning of routes and schedules for the individual ships. Due...... to tramp ship routing and scheduling. This includes modelling approaches, solution methods as well as an analysis of the current status and future direction of research within tramp ship routing and scheduling. We argue that rather than developing new solution methods for the basic routing and scheduling...

  5. Neural Network Based Scheduling for Variable-Length Packets in Gigabit Router with Crossbar Switch Fabric and Input Queuing

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    A high-speed and effective packet scheduling method is crucial to the performance of Gigabit routers. The paper studies the variable-length packet scheduling problem in Gigabit router with crossbar switch fabric and input queuing, and a scheduling method based on neural network is proposed. For the proposed method, a scheduling system structure fit for the variable-length packet case is presented first, then some rules for scheduling are given, At last, an optimal scheduling method using Hopfield neural network is proposed based on the rules. Furthermore, the paper discusses that the proposed method can be realized by hardware circuit. The simulation result shows the effectiveness of the proposed method.

  6. Task scheduling for high performance low power embedded computing

    Science.gov (United States)

    Deniziak, Stanislaw; Dzitkowski, Albert

    2016-12-01

    In this paper we present a method of task scheduling for low-power real-time embedded systems. We assume that the system is specified as a task graph, then it is implemented using multi-core embedded processor with low-power processing capabilities. We propose a new scheduling method to create the optimal schedule. The goal of optimization is to minimize the power consumption while all time constraints will be satisfied. We present experimental results, obtained for some standard benchmarks, showing advantages of our method.

  7. KDD-based rolling schedule model for plate mill

    Institute of Scientific and Technical Information of China (English)

    Zhichun Mu; Dangxian Ma; Shaobo Wang; Changsong Wang

    2005-01-01

    A novel method for generating a rolling schedule is presented, which is fundamentally different from the existing ones.KDD (knowledge discovery in database) techniques are applied for discovering association rules between rolling parameters in a large database of rolling operation, and based on these rules, the schedule for the crucial last six finishing passes is generated. Operational evaluation shows that the schedule generated by the new method outperforms that generated by existing methods. It also shows how in this application the human's domain knowledge is applied to speed up the KDD process and to ensure the validity of the knowledge discovered.

  8. Schedulers with load-store queue awareness

    Science.gov (United States)

    Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.; Sura, Zehra N.

    2017-01-24

    In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

  9. Schedulers with load-store queue awareness

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.; Sura, Zehra N.

    2017-01-24

    In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

  10. Schedulers with load-store queue awareness

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.; Sura, Zehra N.

    2017-02-07

    In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

  11. The Effectiveness of Block Scheduling.

    Science.gov (United States)

    Creamean, Sharon Lightle; Horvath, Robert Jeffery

    This report describes a program for the exploration of block scheduling. The targeted population consists of high school students in a growing, middle-class community, located in a suburban setting of a large mid-western city. The historical background of block scheduling is documented through data gathered using attendance reports, student…

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

  13. Tunnel Engineering Construction Schedule Analysis and Management Based on Visual Simulation

    Institute of Scientific and Technical Information of China (English)

    SONG Yang; ZHONG Wei

    2007-01-01

    The methodology of visual simulation for a tunnel engineering construction schedule is presented. Visualization of simulation model, calculation and result of construction schedule simulation is realized, and the construction simulation and the resource optimization of tunnel engineering are made. A risk analysis and a decision-making method of tunnel engineering construction schedule based on visual simulation are presented. Furthermore, using S curve theory and schedule management method, the real-time management and control method of tunnel engineering construction based on visual simulation is presented. The application to the tunnel engineering construction schedule analysis and management shows the feasibility and effectiveness of the method presented in this paper.

  14. Astronaut Office Scheduling System Software

    Science.gov (United States)

    Brown, Estevancio

    2010-01-01

    AOSS is a highly efficient scheduling application that uses various tools to schedule astronauts weekly appointment information. This program represents an integration of many technologies into a single application to facilitate schedule sharing and management. It is a Windows-based application developed in Visual Basic. Because the NASA standard office automation load environment is Microsoft-based, Visual Basic provides AO SS developers with the ability to interact with Windows collaboration components by accessing objects models from applications like Outlook and Excel. This also gives developers the ability to create newly customizable components that perform specialized tasks pertaining to scheduling reporting inside the application. With this capability, AOSS can perform various asynchronous tasks, such as gathering/ sending/ managing astronauts schedule information directly to their Outlook calendars at any time.

  15. Probabilistic Anonymity and Admissible Schedulers

    CERN Document Server

    Garcia, Flavio D; Sokolova, Ana

    2007-01-01

    When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing protocols, this gives the adversary too much power; for instance, the contents of encrypted messages and internal computations by the parties should be considered invisible to the adversary. We restrict the class of schedulers to a class of admissible schedulers which better model adversarial behaviour. These admissible schedulers base their decision solely on the past behaviour of the system that is visible to the adversary. Using this, we propose a definition of anonymity: for all admissible schedulers the identity of the users and the observations of the adversary are independent stochastic variables. We also develop a proof technique for typical cases that can be used to proof anonymity: a system is anonymous if it is possible to `exchange' the behaviour of two...

  16. The GBT Dynamic Scheduling System: A New Scheduling Paradigm

    Science.gov (United States)

    O'Neil, K.; Balser, D.; Bignell, C.; Clark, M.; Condon, J.; McCarty, M.; Marganian, P.; Shelton, A.; Braatz, J.; Harnett, J.; Maddalena, R.; Mello, M.; Sessoms, E.

    2009-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) is implementing a new Dynamic Scheduling System (DSS) designed to maximize the observing efficiency of the telescope while ensuring that none of the flexibility and ease of use of the GBT is harmed and that the data quality of observations is not adversely affected. To accomplish this, the GBT DSS is implementing a dynamic scheduling system which schedules observers, rather than running scripts. The DSS works by breaking each project into one or more sessions which have associated observing criteria such as RA, Dec, and frequency. Potential observers may also enter dates when members of their team will not be available for either on-site or remote observing. The scheduling algorithm uses those data, along with the predicted weather, to determine the most efficient schedule for the GBT. The DSS provides all observers at least 24 hours notice of their upcoming observing. In the uncommon (DSS project, including the ranking and scheduling algorithms for the sessions, the scheduling probabilities generation, the web framework for the system, and an overview of the results from the beta testing which were held from June - September, 2008.

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

  18. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

    The final edition (Nos 51-52/2011 and 1-2-3/2012) of the Bulletin this year will be published on Friday 16 December and will cover events at CERN from 19 December 2011 to 19 January 2012. Announcements for publication in this issue should reach the Communication Group or the Staff Association, as appropriate, by noon on Tuesday 13 December. Bulletin publication schedule for 2012 The table below lists the 2012 publication dates for the paper version of the Bulletin and the corresponding deadlines for the submission of announcements. Please note that all announcements must be submitted by 12.00 noon on Tuesdays at the latest.   Bulletin No. Week number Submission of announcements (before 12.00 midday) Bulletin Web version Bulletin Printed version 4-5   Tuesday 17 January Fridays 20 and 27 January Wednesday25 January 6-7   Tuesday 31 January Fridays 3 and 10 February Wednesday 8 February 8-9 Tuesday 14 February Fridays 17 and 24 february Wednesday 22 Februa...

  19. Effective constitutive relations for large repetitive frame-like structures

    Science.gov (United States)

    Nayfeh, A. H.; Hefzy, M. S.

    1981-01-01

    Effective mechanical properties for large repetitive framelike structures are derived using combinations of strength of material and orthogonal transformation techniques. Symmetry considerations are used in order to identify independent property constants. The actual values of these constants are constructed according to a building block format which is carried out in the three consecutive steps: (1) all basic planar lattices are identified; (2) effective continuum properties are derived for each of these planar basic grids using matrix structural analysis methods; and (3) orthogonal transformations are used to determine the contribution of each basic set to the overall effective continuum properties of the structure.

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

  1. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-07-01

    In this thesis we consider production planning and scheduling in refinery industry, in particular we study the planning and scheduling at the Nynaes AB refinery and at the Scanraff AB refinery. The purpose is to contribute to the development and the use of optimization models to support efficient decision making. We identify various decision problems concerning the aggregated production planning, the shipment planning, the scheduling of operation modes, and the utilization of pipes and tanks; and we discuss the potential to successfully apply optimization models on these problems. We formulate a mixed integer linear programming model for the scheduling of operation modes at Nynaes. The model concerns decisions about which mode of operation to use at a particular point in time in order to minimize costs of changing modes and costs of keeping inventories, given demands for products. We derive several types of valid inequalities for this mathematical problem and show how these inequalities can improve the lower bound obtained from the linear programming relaxation of the problem. We also show how the valid inequalities can be used to improve the performance of a branch and bound solution approach. Further, a tabu search heuristic is developed for the scheduling problem. The solution methods are tested on data provided by the Nynaes refinery, and the performance of the methods are discussed. We present several extensions of the proposed model, and illustrate how the model can be used to support both operational and strategic decision making at the refinery. 66 refs, 6 figs, 32 tabs. Also published as: Dissertation from the International Graduate School of Management and Industrial Engineering, No 25, Licenciate Thesis.

  2. Production planning and scheduling in refinery industry

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Jan

    1999-06-01

    In this thesis we consider production planning and scheduling in refinery industry, in particular we study the planning and scheduling at the Nynaes AB refinery and at the Scanraff AB refinery. The purpose is to contribute to the development and the use of optimization models to support efficient decision making. We identify various decision problems concerning the aggregated production planning, the shipment planning, the scheduling of operation modes, and the utilization of pipes and tanks; and we discuss the potential to successfully apply optimization models on these problems. We formulate a mixed integer linear programming model for the scheduling of operation modes at Nynaes. The model concerns decisions about which mode of operation to use at a particular point in time in order to minimize costs of changing modes and costs of keeping inventories, given demands for products. We derive several types of valid inequalities for this mathematical problem and show how these inequalities can improve the lower bound obtained from the linear programming relaxation of the problem. We also show how the valid inequalities can be used to improve the performance of a branch and bound solution approach. Further, a tabu search heuristic is developed for the scheduling problem. The solution methods are tested on data provided by the Nynaes refinery, and the performance of the methods are discussed. We present several extensions of the proposed model, and illustrate how the model can be used to support both operational and strategic decision making at the refinery. 66 refs, 6 figs, 32 tabs. Also published as: Dissertation from the International Graduate School of Management and Industrial Engineering, No 25, Licenciate Thesis

  3. Repetitive speech elicits widespread deactivation in the human cortex: the “Mantra” effect?

    Science.gov (United States)

    Berkovich-Ohana, Aviva; Wilf, Meytal; Kahana, Roni; Arieli, Amos; Malach, Rafael

    2015-01-01

    Background Mantra (prolonged repetitive verbal utterance) is one of the most universal mental practices in human culture. However, the underlying neuronal mechanisms that may explain its powerful emotional and cognitive impact are unknown. In order to try to isolate the effect of silent repetitive speech, which is used in most commonly practiced Mantra meditative practices, on brain activity, we studied the neuronal correlates of simple repetitive speech in nonmeditators – that is, silent repetitive speech devoid of the wider context and spiritual orientations of commonly practiced meditation practices. Methods We compared, using blood oxygenated level-dependent (BOLD) functional magnetic resonance imaging (fMRI), a simple task of covertly repeating a single word to resting state activity, in 23 subjects, none of which practiced meditation before. Results We demonstrate that the repetitive speech was sufficient to induce a widespread reduction in BOLD signal compared to resting baseline. The reduction was centered mainly on the default mode network, associated with intrinsic, self-related processes. Importantly, contrary to most cognitive tasks, where cortical-reduced activation in one set of networks is typically complemented by positive BOLD activity of similar magnitude in other cortical networks, the repetitive speech practice resulted in unidirectional negative activity without significant concomitant positive BOLD. A subsequent behavioral study showed a significant reduction in intrinsic thought processes during the repetitive speech condition compared to rest. Conclusions Our results are compatible with a global gating model that can exert a widespread induction of negative BOLD in the absence of a corresponding positive activation. The triggering of a global inhibition by the minimally demanding repetitive speech may account for the long-established psychological calming effect associated with commonly practiced Mantra-related meditative practices. PMID

  4. Scheduling constrained tools using heuristic techniques

    Science.gov (United States)

    Maram, Venkataramana; Rahman, Syariza Abdul; Maram, Sandhya Rani

    2015-12-01

    One of the main challenge to the current manufacturing production planning is to provide schedules of operations to maximize resource utilization to yield highest overall productivity. This is achieved by scheduling available resources to activities. There can be many different real time scenarios with different combination of input resources to produce parts. In this paper, the problem is simplified to single machine with individual process times and due dates to represent the real world scheduling problem. The main objective function is to minimize the total tardiness or late jobs. Nearest greedy method of assignment problem algorithm is used to find the initial solution followed by Simulated Annealing (SA) algorithm for the improvement part. Simulated Annealing is one of the meta-heuristic techniques in solving combinatorial optimization problem. The general purpose Microsoft Visual C++ is used to developed algorithm for finding the best solution. The proposed hybrid approach able to generate best schedule in 7th and optimal in 170th iteration with tardiness 8 and 7 hours respectively.

  5. Multi-objective optimization method of flexible job-shop lot-splitting scheduling%柔性作业车间分批调度多目标优化方法

    Institute of Scientific and Technical Information of China (English)

    王云; 冯毅雄; 谭建荣; 高一聪

    2011-01-01

    The multi-objective flexible job-shop scheduling optimization model was conducted in order to solve multi-objective optimization problem of flexible job-shop small batch lot-splitting scheduling. The model was concerned with makespan, tardiness penalty, manufacturing cost, count of batch and total workload. The optimal solutions were obtained by using improved strength Pareto evolutionary algorithm (SPEA). The algorithm was improved by using the fuzzy c-means clustering algorithm to accelerate the clustering procedure within the external population. A self-adaptive mutation operator was also introduced to enhance the diversity of solutions. A Pareto optimal set can be achieved in a single run with the constraint Pareto domination concept and the flexible representation schema. Then the preference sequence of Pareto solutions was achieved and a solution was extracted as the best compromise one based on set theory. The jobs were split into flexible size batch, and the batch routing and sequencing were simultaneously optimized by the method. The performance of the method was evaluated through simulation. The feasibility and validity of the method were proved in a workshop scheduling.%为了解决柔性作业车间中小批量工件的分批调度多目标优化问题,构建以制造工期、拖期惩罚、加工成本、批次数量和机器总负荷为目标函数的柔性作业车间多目标调度模型.应用改进的强度Pareto进化算法(SPEA)求解.在该算法中,应用模糊c均值聚类(FCM)加快外部种群的聚类过程,引入自适应的变异算子来增强解的多样性.采用约束Pareto支配和可变长度的编码策略,一次运行就能够求得Pareto最优解集.利用模糊集合理论得到Pareto解的优先选择序列,并从中选出一个最优解.该方法将工件分割成具有柔性数量的多个批次,使各批次的工艺路线选取及加工顺序得到优化.通过实例仿真对该方法的性能进行比较分析.将该方

  6. Scheduling Problem, Modeling and Method of Satellite Orienting to Atmosphere Background Measurement%面向大气背景测量卫星的任务规划问题——建模及求解方法

    Institute of Scientific and Technical Information of China (English)

    李臻; 白国庆; 贺仁杰

    2012-01-01

    The scheduling of satellite orienting to the experiment of atmosphere background measurement was studied. First, on the basis of planning method combined short-term and long-term mission planning, rolling planning model based on the model forecasting was built. Then tabu search algorithm was used to solve the problem. Results of experiments show the effeteness of this method. Great experiments of the research on this satellites is provided to go by.%研究了面向大气背景测量试验的卫星任务规划问题.采用长短期相结合的规划方式,建立了基于模型预测控制的滚动规划模型,运用禁忌搜索算法进行求解.最后实例验证了方法的有效性;为此类卫星的研制提供了重要的借鉴意义.

  7. THE DISCRETE TIME, COST AND QUALITY TRADE-OFF PROBLEM IN PROJECT SCHEDULING: AN EFFICIENT SOLUTION METHOD BASED ON CELLDE ALGORITHM

    Directory of Open Access Journals (Sweden)

    Gh. Assadipour

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT:The trade-off between time, cost, and quality is one of the important problems of project management. This problem assumes that all project activities can be executed in different modes of cost, time, and quality. Thus a manager should select each activity’s mode such that the project can meet the deadline with the minimum possible cost and the maximum achievable quality. As the problem is NP-hard and the objectives are in conflict with each other, a multi-objective meta-heuristic called CellDE, which is a hybrid cellular genetic algorithm, is implemented as the optimisation method. The proposed algorithm provides project managers with a set of non-dominated or Pareto-optimal solutions, and enables them to choose the best one according to their preferences. A set of problems of different sizes is generated and solved using the proposed algorithm. Three metrics are employed for evaluating the performance of the algorithm, appraising the diversity and convergence of the achieved Pareto fronts. Finally a comparison is made between CellDE and another meta-heuristic available in the literature. The results show the superiority of CellDE.

    AFRIKAANSE OPSOMMING: ‘n Balans tussen tyd, koste en gehalte is een van die belangrike probleme van projekbestuur. Die vraagstuk maak gewoonlik die aanname dat alle projekaktiwiteite uitgevoer kan word op uiteenlopende wyses wat verband hou met koste, tyd en gehalte. ‘n Projekbestuurder selekteer gewoonlik die uitvoeringsmetodes sodanig per aktiwiteit dat gehoor gegegee word aan minimum koste en maksimum gehalte teen die voorwaarde van voltooiingsdatum wat bereik moet word.

    Aangesien die beskrewe problem NP-hard is, word dit behandel ten opsigte van konflikterende doelwitte met ‘n multidoelwit metaheuristiese metode (CellDE. Die metode is ‘n hibride-sellulêre genetiese algoritme. Die algoritme lewer aan die besluitvormer ‘n versameling van ongedomineerde of Pareto

  8. Research on remanufacturing scheduling problem based on critical chain management

    Science.gov (United States)

    Cui, Y.; Guan, Z.; He, C.; Yue, L.

    2017-06-01

    Remanufacturing is the recycling process of waste products as “as good as new products”, compared with materials recycling, remanufacturing represents a higher form of recycling. The typical structure of remanufacturing system consists of three parts: disassembly workshop, remanufacturing workshop and assembly workshop. However, the management of production planning and control activities can differ greatly from management activities in traditional manufacturing. Scheduling in a remanufacturing environment is more complex and the scheduler must deal with more uncertainty than in a traditional manufacturing environment. In order to properly schedule in a remanufacturing environment the schedule must be able to cope with several complicating factors which increase variability. This paper introduced and discussed seven complicating characteristics that require significant changes in production planning and control activities, in order to provide a new method for remanufacturing production scheduling system.

  9. Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

    Directory of Open Access Journals (Sweden)

    Shyamala Loganathan

    2015-01-01

    Full Text Available Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

  10. Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter.

    Science.gov (United States)

    Loganathan, Shyamala; Mukherjee, Saswati

    2015-01-01

    Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

  11. Grid Computing based on Game Optimization Theory for Networks Scheduling

    Directory of Open Access Journals (Sweden)

    Peng-fei Zhang

    2014-05-01

    Full Text Available The resource sharing mechanism is introduced into grid computing algorithm so as to solve complex computational tasks in heterogeneous network-computing problem. However, in the Grid environment, it is required for the available resource from network to reasonably schedule and coordinate, which can get a good workflow and an appropriate network performance and network response time. In order to improve the performance of resource allocation and task scheduling in grid computing method, a game model based on non-cooperation game is proposed. Setting the time and cost of user’s resource allocation can increase the performance of networks, and incentive resource of networks uses an optimization scheduling algorithm, which minimizes the time and cost of resource scheduling. Simulation experiment results show the feasibility and suitability of model. In addition, we can see from the experiment result that model-based genetic algorithm is the best resource scheduling algorithm

  12. Improved Quantum Genetic Algorithm in Application of Scheduling Engineering Personnel

    Directory of Open Access Journals (Sweden)

    Huaixiao Wang

    2014-01-01

    Full Text Available To verify the availability of the improved quantum genetic algorithm in solving the scheduling engineering personnel problem, the following work has been carried out: the characteristics of the scheduling engineering personnel problem are analyzed, the quantum encoding method is proposed, and an improved quantum genetic algorithm is applied to address the issue. Taking the low efficiency and the bad performance of the conventional quantum genetic algorithm into account, a universal improved quantum genetic algorithm is introduced to solve the scheduling engineering personnel problem. Finally, the examples are applied to verify the effectiveness and superiority of the improved quantum genetic algorithm and the rationality of the encoding method.

  13. A repetitive elements perspective in Polycomb epigenetics.

    Directory of Open Access Journals (Sweden)

    Valentina eCasa

    2012-10-01

    Full Text Available Repetitive elements comprise over two-thirds of the human genome. For a long time, these elements have received little attention since they were considered non functional. On the contrary, recent evidence indicates that they play central roles in genome integrity, gene expression and disease. Indeed, repeats display meiotic instability associated with disease and are located within common fragile sites, which are hotspots of chromosome rearrangements in tumors. Moreover, a variety of diseases have been associated with aberrant transcription of repetitive elements. Overall this indicates that appropriate regulation of repetitive elements’ activity is fundamental.Polycomb group (PcG proteins are epigenetic regulators that are essential for the normal development of multicellular organisms. Mammalian PcG proteins are involved in fundamental processes, such as cellular memory, cell proliferation, genomic imprinting, X-inactivation, and cancer development. PcG proteins can convey their activity through long-distance interactions also on different chromosomes. This indicates that the 3D organization of PcG proteins contributes significantly to their function. However, it is still unclear how these complex mechanisms are orchestrated and which role PcG proteins play in the multi-level organization of gene regulation. Intriguingly, the greatest proportion of Polycomb-mediated chromatin modifications is located in genomic repeats and it has been suggested that they could provide a binding platform for Polycomb proteins.Here, these lines of evidence are woven together to discuss how repetitive elements could contribute to chromatin organization in the 3D nuclear space.

  14. Emotional arousal enhances word repetition priming

    OpenAIRE

    Thomas, Laura A.; LaBar, Kevin S.

    2005-01-01

    Three experiments were conducted to determine if emotional content increases repetition priming magnitude. In the study phase of Experiment 1, participants rated high-arousing negative (taboo) words and neutral words for concreteness. In the test phase, they made lexical decision judgements for the studied words intermixed with novel words (half taboo, half neutral) and pseudowords. In Experiment 2, low-arousing negative (LAN) words were substituted for the taboo words, and in Experiment 3 al...

  15. The Rhythms of Echo. Variations on Repetition

    Directory of Open Access Journals (Sweden)

    Rosa María Aradra Sánchez

    2015-04-01

    Full Text Available This paper presents a study on the echo as metric and rhetorical procedure. It makes a brief tour through some of the poetic manifestations of echo in the Spanish literary tradition, and a brief tour through the attention that metric theory has paid to this phenomenon. Then it stops at the possibilities that rhetoric offers for its analysis from the generic approach of the discursive repetition phenomena.

  16. Optimal Deadline Scheduling with Commitment

    CERN Document Server

    Chen, Shiyao; He, Ting

    2011-01-01

    We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept or decline a job immediately upon arrival. The scheduler's decision to accept an arriving job constitutes a contract with the customer; if the accepted job is not completed by its deadline as promised, the scheduler loses the value of the corresponding job and has to pay an additional penalty depending on the amount of unfinished workload. The objective of the online scheduler is to maximize the overall profit, i.e., the total value of the admitted jobs completed before their deadlines less the penalty paid for the admitted jobs that miss their deadlines. We show that the maximum competitive ratio is $3-2\\sqrt{2}$ and propose a simple online algorithm to achieve this competitive ratio. The optimal scheduling includes a threshold admission and a greedy scheduling policies. The proposed algorithm has direct applications to the chargin...

  17. Repetitive behaviour in autism: Imaging pathways and trajectories

    NARCIS (Netherlands)

    Langen, M.J.G.

    2009-01-01

    Repetitive behaviour in autism: Imaging pathways and trajectories Repetitive and rigid behaviour is one of the core symptoms of autism, a severe and lifelong child psychiatric disorder. Although repetitive behaviour symptoms often form a significant impairment for affected individuals, systematic st

  18. Neural Correlates of Restricted, Repetitive Behaviors in Autism Spectrum Disorders

    Science.gov (United States)

    2014-12-01

    Restrictive Repetitive Behaviors in Autism Spectrum Disorder . Authors: T.Q.Nguyen, B...Manoach. Functional Connectivity of the Dorsal Anterior Cingulate Cortex Predicts Restrictive Repetitive Behaviors in Autism Spectrum Disorder We...Introduction: Although restricted , repetitive behaviors (RRBs) are a highly disabling core feature of Autism Spectrum Disorders (ASDs), they

  19. Lingual Kinematics during Rapid Syllable Repetition in Parkinson's Disease

    Science.gov (United States)

    Wong, Min Ney; Murdoch, Bruce E.; Whelan, Brooke-Mai

    2012-01-01

    Background: Rapid syllable repetition tasks are commonly used in the assessment of motor speech disorders. However, little is known about the articulatory kinematics during rapid syllable repetition in individuals with Parkinson's disease (PD). Aims: To investigate and compare lingual kinematics during rapid syllable repetition in dysarthric…

  20. Factors contributing to defaulting scheduled therapy sessions by ...

    African Journals Online (AJOL)

    contributing to caregivers' defaulting scheduled rehabilitation therapy sessions. Methods ... disabilities poses excess psychological2,3, physical, and economic strain on the caregiver4. ... Weekly clinics are conducted every. Monday for ...

  1. An improved formulation of the underground mine scheduling ...

    African Journals Online (AJOL)

    2014-06-12

    Jun 12, 2014 ... will allow the generation of mine production schedules that improve profitability through ... Irrespective of the mining method, the tasks of planning and ...... I & Karunatillake G, 2003, Using MIP for strategic life-of-mine planning.

  2. Schedulability of Herschel revisited using statistical model checking

    DEFF Research Database (Denmark)

    David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel

    2015-01-01

    Schedulability analysis is a main concern for several embedded applications due to their safety-critical nature. The classical method of response time analysis provides an efficient technique used in industrial practice. However, the method is based on conservative assumptions related to execution...... to obtain some guarantee on the (un)schedulability of the model even in the presence of undecidability. Two methods are considered: symbolic model checking and statistical model checking. Since the model uses stop-watches, the reachability problem becomes undecidable so we are using an over......-approximation technique. We can safely conclude that the system is schedulable for varying values of BCET. For the cases where deadlines are violated, we use polyhedra to try to confirm the witnesses. Our alternative method to confirm non-schedulability uses statistical model-checking (SMC) to generate counter...

  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. Repetitive Elements in Mycoplasma hyopneumoniae Transcriptional Regulation

    Science.gov (United States)

    Cattani, Amanda Malvessi; Siqueira, Franciele Maboni; Guedes, Rafael Lucas Muniz; Schrank, Irene Silveira

    2016-01-01

    Transcriptional regulation, a multiple-step process, is still poorly understood in the important pig pathogen Mycoplasma hyopneumoniae. Basic motifs like promoters and terminators have already been described, but no other cis-regulatory elements have been found. DNA repeat sequences have been shown to be an interesting potential source of cis-regulatory elements. In this work, a genome-wide search for tandem and palindromic repetitive elements was performed in the intergenic regions of all coding sequences from M. hyopneumoniae strain 7448. Computational analysis demonstrated the presence of 144 tandem repeats and 1,171 palindromic elements. The DNA repeat sequences were distributed within the 5’ upstream regions of 86% of transcriptional units of M. hyopneumoniae strain 7448. Comparative analysis between distinct repetitive sequences found in related mycoplasma genomes demonstrated different percentages of conservation among pathogenic and nonpathogenic strains. qPCR assays revealed differential expression among genes showing variable numbers of repetitive elements. In addition, repeats found in 206 genes already described to be differentially regulated under different culture conditions of M. hyopneumoniae strain 232 showed almost 80% conservation in relation to M. hyopneumoniae strain 7448 repeats. Altogether, these findings suggest a potential regulatory role of tandem and palindromic DNA repeats in the M. hyopneumoniae transcriptional profile. PMID:28005945

  5. Repetitive element hypermethylation in multiple sclerosis patients.

    Science.gov (United States)

    Neven, K Y; Piola, M; Angelici, L; Cortini, F; Fenoglio, C; Galimberti, D; Pesatori, A C; Scarpini, E; Bollati, V

    2016-06-18

    Multiple sclerosis (MS) is a complex disorder of the central nervous system whose cause is currently unknown. Evidence is increasing that DNA methylation alterations could be involved in inflammatory and neurodegenerative diseases and could contribute to MS pathogenesis. Repetitive elements Alu, LINE-1 and SAT-α, are widely known as estimators of global DNA methylation. We investigated Alu, LINE-1 and SAT-α methylation levels to evaluate their difference in a case-control setup and their role as a marker of disability. We obtained blood samples from 51 MS patients and 137 healthy volunteers matched by gender, age and smoking. Methylation was assessed using bisulfite-PCR-pyrosequencing. For all participants, medical history, physical and neurological examinations and screening laboratory tests were collected. All repetitive elements were hypermethylated in MS patients compared to healthy controls. A lower Expanded Disability Status Scale (EDSS) score was associated with a lower levels of LINE-1 methylation for 'EDSS = 1.0' and '1.5 ≤ EDSS ≤ 2.5' compared to an EDSS higher than 3, while Alu was associated with a higher level of methylation in these groups: 'EDSS = 1.0' and '1.5 ≤ EDSS ≤ 2.5'. MS patients exhibit an hypermethylation in repetitive elements compared to healthy controls. Alu and LINE-1 were associated with degree of EDSS score. Forthcoming studies focusing on epigenetics and the multifactorial pathogenetic mechanism of MS could elucidate these links further.

  6. The Coordinated Scheduling Support System of Production and Delivery

    Directory of Open Access Journals (Sweden)

    Ming-Feng Yang

    2009-01-01

    Full Text Available Problem statement: Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. In a rapidly changing environment, competition among enterprises has a tendency to turn towards competing between supply chain systems instead of competing between individual companies. Emphasizing on the coordination and the integration among various members of a supply chain has become one of the vital strategies for the modern manufacturers to gain competitive advantages. Approach: This research focuses mainly on a class of two-stage scheduling problem, in which jobs need to be delivered to customers by vehicles after the completion of their respective production. It is assumed that the transportation time of a vehicle is constant and jobs to be delivered occupy different physical spaces. Results: The result of this research is to show the scheduling problem with the objective of minimizing total completion time is intractable and to develop a heuristic by incorporating properties inherited in an the optimal schedule. In addition, we take a Decision Support System (DSS view to construct a Scheduling Support System (SSS for solving the scheduling problem with delivery coordination. Conclusion/Recommendations: The scheduling support system with an additional problem management subsystem can provide more useful information for users when the management makes a strategic decision than traditional scheduling methods can. It can give firms a competitive advantage on the global competitive market.

  7. 直流跨区互联电网发输电计划模型与方法%Model and Methods of Generation and Transmission Scheduling of Inter-regional Power Grid via HVDC Tie-line

    Institute of Scientific and Technical Information of China (English)

    王斌; 夏叶; 夏清; 张慧玲; 韩红卫

    2016-01-01

    直流跨区输电为大范围资源优化配置和清洁能源跨区消纳提供了高效的物理平台。充分利用区域间电源结构互济、负荷特性互补的优势,可以有效挖掘电力资源跨区协调优化潜力、提升电网清洁能源消纳能力。为此,文中在兼顾现有国(分)、省两级调度模式的基础上,提出了以直流联络线功率为协调变量,区内优化、跨区协调的直流跨区互联电网发输电计划模式;建立了考虑直流调整灵活性、直流联络线日交易电量、联络线运行功率曲线阶梯化等实际运行要求的发输电计划模型;提出了以直流功率为引导变量的跨区边际机组识别方法,解决了上述大规模混合整数规划模型的求解效率问题。基于省网实际负荷曲线进行算例分析,验证了所提模式、模型、方法的有效性。%A highly efficient physical platform is provided by inter-regional high voltage direct current (HVDC) tie-line for large-range cross-region clean energy accommodation and resources allocation.The cross-regional coordinative optimization potential of power resources can be tapped and the accommodation capability of clean energy improved if complementary characteristics of power supply structure and system load of each region are well utilized.To this end,a generation and transmission scheduling mode of inter-regional power grid via HVDC tie-line is proposed based on the two-level “state-province" system operation pattern.In this mode,the transmission power of HVDC tie-line is viewed as cross-regional coordinative variable while generator scheduling is optimized inside each region.A mathematical model of generation and transmission scheduling mode of inter-regional power grid via HVDC tie-line is developed with various practical operation constraints taken into account,including the HVDC flexible adjustment constraints,tie-line daily transaction energy limit and tie-line power profile stair

  8. 中长期发电计划的值函数近似动态规划方法%A Method of Value Function Approximate Dynamic Programming for Medium/Long Term Generation Scheduling

    Institute of Scientific and Technical Information of China (English)

    梁振成; 韦化; 李凌; 田君杨

    2015-01-01

    With respect to the features in medium/long- term optimal scheduling such as long period, large scale and strong randomness, a multi-stage optimized decision model based on approximate dynamic programming (ADP) was proposed. Prediction scenarios were used to represent uncertainties in day-ahead coal prices, water inflows and wind speeds. Decisions including forward contracts coal, day-ahead coal and water usage were recognized as stage decisions in ADP framework. Staged solution was used to reduce the size and difficulty of the problem. The proposed value function approximation strategy of coal and reservoir storage was used to make decisions and maintain the overall optimization after staged decomposition. Through the iterations between the decisions and the approximate value functions, the approximate decisions sequence was solved to obtain the optimal scheduling. The calculation results of annual scheduling in some provinces show that the proposed method can get the high quality stochastic solution and the deviation of cost expectation of less than 0.5%, and reduce the computation time substantially compared with traditional methods. Meanwhile, it is concise in modeling, convenient in dealing with uncertainties, and has a promising future.%针对中长期发电优化调度问题周期长、规模大、随机性强等特点,提出一种基于近似动态规划(approximate dynamic programming,ADP)的多阶段优化决策模型.以预测场景表示日前市场煤价、流域来水、风速等随机变量,将远期合约购煤与市场购煤、水库用水等视为ADP框架下的阶段决策.分阶段决策降低了问题的求解规模和难度,提出的燃煤和水库蓄水的值函数近似策略解决了如何优化决策以保持阶段分解后的整体优化特性问题.通过在决策与近似值函数之间的迭代,求解出近似最优决策序列,进而获取发电优化调度方案.某省年度发电计划的计算分析结果表明,所提方法建模

  9. Scheduling the Belgian soccer league.

    OpenAIRE

    Goossens, Dries; Spieksma, Frederik

    2009-01-01

    Any sports league needs a schedule of play, and such a schedule can be important, as it may influence the outcome of the sports competition itself and since it may have an impact on the interests of all parties involved. As in many other sports leagues and countries, the interest for Belgian soccer has increased over the last years. This paper describes our experiences in scheduling the highest Belgian soccer league. We describe how we automated and improved the way in which the calendar is ...

  10. With 1,670 Students--Student Self-Scheduling Works Well for Us

    Science.gov (United States)

    Wall, F. Edward

    1976-01-01

    Chesterton High School, which has used both computer scheduling and student self-scheduling, finds the latter method produces the most satisfactory results. In response to Richard Tilwick's article in the November 1975 Bulletin (Student Self-Scheduling: An Unintentional Deception), F. Edward Wall explains why his students and teachers favor…

  11. An empirical investigation of scheduling performance criteria

    NARCIS (Netherlands)

    de Snoo, C.; van Wezel, W.M.C.; Jorna, R.J.J.M.

    Planning and scheduling significantly influence organizational performance, but literature that pays attention to how organizations could or should organize and assess their planning processes is limited. We extend planning and scheduling theory with a categorization of scheduling performance

  12. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc Jochen

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  13. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc

    2003-01-01

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  14. Energy Scheduling Method of the Heliostat Field in a Solar Tower Power System Based on Integer Programming%基于整数规划的塔式太阳能镜场能量调度方法

    Institute of Scientific and Technical Information of China (English)

    刘紫军; 王昊; 李佳燕; 赵豫红

    2016-01-01

    We propose an energy scheduling method of the heliostat field,based on integer programming,to meet the requirements of power generation and to save operation costs in a solar tower power plant.We adopt a greedy-PSO (particle swarm optimization)algorithm to solve the optimization problem.The simulation results show that the heliostat field can export a specified energy value in the case of DNI (direct normal insolation) change,which verifies the effectiveness of the proposed method.Furthermore,the method is applied to the control of a water-steam receiver and simulation results indicate that real-time energy demand can be satisfied with the proposed method.%针对塔式太阳能热发电过程中镜场调度既需要满足发电能量需求又需要节省操作成本的问题,提出了一种基于整数规划的镜场能量调度方法,同时采用了一种贪婪—粒子群优化算法进行求解,并通过模拟在DNI(太阳直射辐射,direct nor-mal insolation)变化的情况下,使镜场输出固定的能量值,验证了方法的有效性。将此方法应用于水/蒸汽接收器的系统控制中,仿真结果表明方法能够实时跟踪系统所需能量的变化。

  15. Scheduling Broadcasts in a Network of Timelines

    KAUST Repository

    Manzoor, Emaad A.

    2015-05-12

    method of marginal allocation, discover a new scheduling strategy that outperforms popular scheduling heuristics while producing fewer posts.

  16. Estimating demand schedules in hedonic analysis

    DEFF Research Database (Denmark)

    Panduro, Toke Emil; Jensen, Cathrine Ulla; Lundhede, Thomas;

    The hedonic pricing method has been used extensively to obtain implicit prices for availability of urban green space, but few hedonic studies have obtained households’ preference parameters. We estimate willingness to pay functions for park availability in Copenhagen using an approach that places...... an alternative path for estimation of demand schedules for public goods using hedonic data. The findings also stress the importance of paying attention to how public goods are defined when undertaking welfare economic policy analyses....

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

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

  19. The GBT Dynamic Scheduling System

    Science.gov (United States)

    McCarty, M. T.; Balser, D. S.; Braatz, J.; Clark, M. H.; Condon, J.; Creager, R. E.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2012-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) Dynamic Scheduling System (DSS), in use since September, 2009, was designed to maximize observing efficiency while preserving telescope flexibility and data quality without creating undue adversity for the observers. Using observing criteria; observer availability and qualifications for remote observing; three-dimensional weather forecasts; and telescope state, the DSS software optimally schedules observers 24 to 48 hours in advance for a telescope that has a wide-range of capabilities and a geographical location with variable weather patterns. The DSS project was closed October 28, 2011 and will now enter a continuing maintenance and enhancement phase. Recent improvements include a new resource calendar for incorporating telescope maintenance activities, a sensitivity calculator that leverages the scheduling algorithms to facilitate consistent tools for proposal preparation, improved support for monitoring observations, scheduling of high frequency continuum and spectral line observations for both sparse and fully sampled array receivers, and additional session parameters for observations having special requirements.

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

  1. Shifts Scheduling Method for Physicians in Emergency Department with Time-Varying Demand%面向动态时变需求的急诊科医生排班研究

    Institute of Scientific and Technical Information of China (English)

    刘强; 谢晓岚; 刘冉; 陈尔真; 杨之涛

    2015-01-01

    急诊室的病人到达率是随时间动态变化而非恒定的,因此急诊室在病人到达的高峰时刻会出现病人拥挤、等待时间过长等现象,而在病人达到率低的时期内医生的工作时间利用率又相对较低。设计针对病人时变到达率的人员排班计划,能够缓解病人等待时间长、医生工作时间利用率低等问题。针对上述实际问题,首先提出了一种可以估计动态需求系统中顾客等待时间的方法,该方法利用 M/M/c 排队论理论对病人的等待时间加以近似表达。基于此方法构造了急诊室医生排班的混合整数规划模型并加以求解,数值仿真试验显示得到的结果明显优于目前医院实际的医生排班方案。%Significant variation in patient arrival rate is a key feature of emergency department (ED)and a main cause of the paradox between congestion in rush hours and resource redundancy in less busy hours.Appropriate personnel scheduling can help to relief this phenomenon.In this paper,we develop a mix integer programming model for daily personnel scheduling for EDs with non-stationary patient arrival over time.The goal is to minimize the total expected waiting time which is estimated by a combination of steady-state analysis of M/M/c queues and inventory-like flow balance equations.We then develop an improved estimation method and analyze the new model based on it.Numerical experiments and simulations are performed to validate the proposed models.

  2. A Heuristic Method for Vehicle Scheduling Problems

    Institute of Scientific and Technical Information of China (English)

    1995-01-01

    AHeuristicMethodforVehicleSchedulingProblemsCuoYaohuang;LiJun;TongShuliul(SchoolofEconomicsandManagement,SchoolofCivilEnginee...

  3. 基于灰熵并行分析法的多目标作业车间调度优化%Multi-Objectives Job Shop Scheduling Optimization Based on Grey Entropy Parallel Analysis Method

    Institute of Scientific and Technical Information of China (English)

    朱光宇; 杨志锋; 陈旭斌

    2015-01-01

    提出利用信息熵理论与灰色关联分析法并行地处理多目标优化问题,将多目标优化的目标值构成数据序列,挖掘序列关系实现多目标优化。首先,并行的对目标值序列计算灰关联系数以及熵值权重,之后将信息熵与灰关联系数结合计算灰熵并行关联度,建立灰熵并行分析法。最终,利用灰熵并行关联度作为优化算法的适应值计算策略,以该策略引导智能优化算法进化。建立作业车间调度问题的三目标优化模型,以灰熵并行分析法为基础,分别应用差分算法、遗传算法解决三目标作业车间调度问题,验证新方法的可行性。实验表明:新方法均能使两算法收敛且得到分布均匀的 Pareto 前端,表明其有效和可靠。同时,差分算法得到的解较遗传算法的解具有明显的优势。%In this paper, the multi-objective optimization problem was solved with the theory of information entropy and gray correlation analysis method in parallel. The objective function values were used to structure a data sequence. The multi-objective optimization was complicated by using data sequence relation model. Firstly, the grey relational coefficient and the entropy weight were calculated in parallel based on multi-objective value sequence. Then, the information entropy and the grey relational coefficient were combined and used to calculate the grey entropy parallel relational degree (GEPRD), that is, the grey entropy parallel analysis method was built. Finally, the GEPRD was used as the fitness value calculation strategy to guide the evolution of the heuristic algorithm. The Tri-objectives optimization model of job shop scheduling problem was established. In order to verify the feasibility of the new method ,the grey entropy parallel analysis method was testified with differential algorithm and genetic algorithm respectively to solve the Tri-objectives job shop scheduling problem

  4. Spectroscopic Investigation of a Repetitively-Pulsed Nanosecond Discharge

    Science.gov (United States)

    Yee, Benjamin T.

    This work reports on an investigation of a repetitively-pulsed nanosecond discharge (RPND) in helium over a range of 0.3-16.0 Torr. The discharge was studied experimentally via laser-absorption spectroscopy and opticals emission spectroscopy measurements. In concert with the experimental campaign, a global model of a helium plasma was developed with the aid of particle-in-cell simulations. The global model was then used to predict the population kinetics and emissions of the RPND. Synthesis of the results provided new data and insights on the development of the RPND. Among the results were direct measurements of the triplet metastable states during the excitation period. This period was found to be unexpectedly long at low pressures (less than or equal to 1.0 Torr), suggesting an excess in high-energy electrons as compared to an equilibrium distribution. Other phenomena such as a prominent return stroke and additional energy deposition by reflections in the transmission line were also identified. Estimates of the electric field and electron temperatures were obtained for several conditions. Furthermore, several optical methods for electron temperature measurement were evaluated for application to the discharge. Based on the global model simulations, the coronal model was found to apply to the line ratio of the 33S-23Po and 31S-2 1Po transitions, however further work is needed to ascertain its applicability to experimental discharges. These results provide new insight on the development of the repetitively-pulsed nanosecond discharge. Specifically, they reveal new information about the excited state dynamics within the discharge, the non-equilibrium nature of its electrons, and several avenues for future studies. This study extends the present understanding of repetitively-pulsed discharges, and advances the knowledge of energy coupling between electric fields and plasmas.

  5. Study on lot-splitting method for multi-objective flexible Job-Shop scheduling problem%多目标柔性车间作业调度分批方法研究

    Institute of Scientific and Technical Information of China (English)

    许秀林; 胡克瑾

    2011-01-01

    针对柔性分批有可能导致不规则的分批方案,提出了基于批量规则的有序分批方法,并按照最大批量规则,分析了影响确定最佳额定批量的主要因素,设计了一种基于工件工序时间分布的差异批量的分批方案.通过实例仿真,结果表明该方案的调度周期等主要指标均优于相同批量的分批方案,对实际生产调度具有指导作用.%Flexible size lot-splitting method, for multi-objective flexible Job-Shop scheduling problem, may produce irregular lot-splitting scheme. To resolve this problem, proposed the idea of regular lot-splitting. According to the rule of maximum batch size, it analysed the main factors which determined the best batch size. It presented a lot-splitting scheme that determined batch size by process time of each job. Experiment shows that main indexes of the scheme with different batch size, including make span, are better than one with same batch size, and the scheme can provide reference for production practice.

  6. Decision Support for Iteration Scheduling in Agile Environments

    Science.gov (United States)

    Szőke, Ákos

    Today’s software business development projects often lay claim to low-risk value to the customers in order to be financed. Emerging agile processes offer shorter investment periods, faster time-to-market and better customer satisfaction. To date, however, in agile environments there is no sound methodological schedule support contrary to the traditional plan-based approaches. To address this situation, we present an agile iteration scheduling method whose usefulness is evaluated with post-mortem simulation. It demonstrates that the method can significantly improve load balancing of resources (cca. 5×), produce higher quality and lower-risk feasible schedule, and provide more informed and established decisions by optimized schedule production. Finally, the paper analyzes benefits and issues from the use of this method.

  7. Scheduling commercial advertisements for television

    OpenAIRE

    Garcia-Villoria, Alberto; Salhi, Said

    2014-01-01

    The problem of scheduling the commercial advertisements in the television industry is investigated. Each advertiser client demands that the multiple airings of the same brand advertisement should be as spaced as possible over a given time period. Moreover, audience rating requests have to be taken into account in the scheduling. This is the first time this hard decision problem is dealt with in the literature. We design two mixed integer linear programming (MILP) models. Two constructive heur...

  8. fMRI repetition suppression: neuronal adaptation or stimulus expectation?

    Science.gov (United States)

    Larsson, Jonas; Smith, Andrew T

    2012-03-01

    Measurements of repetition suppression with functional magnetic resonance imaging (fMRI adaptation) have been used widely to probe neuronal population response properties in human cerebral cortex. fMRI adaptation techniques assume that fMRI repetition suppression reflects neuronal adaptation, an assumption that has been challenged on the basis of evidence that repetition-related response changes may reflect unrelated factors, such as attention and stimulus expectation. Specifically, Summerfield et al. (Summerfield C, Trittschuh EH, Monti JM, Mesulam MM, Egner T. 2008. Neural repetition suppression reflects fulfilled perceptual expectations. Nat Neurosci. 11:1004-1006) reported that the relative frequency of stimulus repetitions and non-repetitions influenced the magnitude of repetition suppression in the fusiform face area, suggesting that stimulus expectation accounted for most of the effect of repetition. We confirm that stimulus expectation can significantly influence fMRI repetition suppression throughout visual cortex and show that it occurs with long as well as short adaptation durations. However, the effect was attention dependent: When attention was diverted away from the stimuli, the effects of stimulus expectation completely disappeared. Nonetheless, robust and significant repetition suppression was still evident. These results suggest that fMRI repetition suppression reflects a combination of neuronal adaptation and attention-dependent expectation effects that can be experimentally dissociated. This implies that with an appropriate experimental design, fMRI adaptation can provide valid measures of neuronal adaptation and hence response specificity.

  9. Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

    Directory of Open Access Journals (Sweden)

    Marcelo Nobre

    2015-04-01

    Full Text Available Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA. As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques forWirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of theWirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed.

  10. Reductions in CI amplitude after repetitive transcranial magnetic stimulation (rTMS) over the striate cortex

    NARCIS (Netherlands)

    Schutter, D.J.L.G.; Honk, E.J. van

    2003-01-01

    Slow repetitive transcranial magnetic stimulation (rTMS) is a method capable of transiently inhibiting cortical excitability and disrupting information processing in the visual system. This method can be used to topographically map the functional contribution of different cortical brain areas in vis

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

  12. Stochastic Scheduling and Planning Using Reinforcement Learning

    Science.gov (United States)

    2007-11-02

    reinforcement learning (RL) methods to large-scale optimization problems relevant to Air Force operations planning, scheduling, and maintenance. The objectives of this project were to: (1) investigate the utility of RL on large-scale logistics problems; (2) extend existing RL theory and practice to enhance the ease of application and the performance of RL on these problems; and (3) explore new problem formulations in order to take maximal advantage of RL methods. A method using RL to modify local search cost functions was developed and shown to yield significant

  13. Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

    Directory of Open Access Journals (Sweden)

    Stanimirović Ivan

    2009-01-01

    Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project.

  14. Agile Scheduling for MES in a Complex Information Environment

    Institute of Scientific and Technical Information of China (English)

    LIShu-xia; RAOYun-qing; ZHANGChao-yong

    2005-01-01

    Since Manufacturing Execution System (MES) is a bridge which links the upper planning system of the enterprise and the control system of the shop floor, various kinds of the information with different characteristics flow through the system. The information environment of MES and its effect on MES scheduling are analyzed. A methodological proposal is given to address the problem of agile scheduling in a complex information environment, based on which a microeconomic market and game theoretic model-based scheduling approach is presented. The future development of this method is also discussed.

  15. Trusted dynamic level scheduling based on Bayes trust model

    Institute of Scientific and Technical Information of China (English)

    WANG Wei; ZENG GuoSun

    2007-01-01

    A kind of trust mechanism-based task scheduling model was presented. Referring to the trust relationship models of social persons, trust relationship is built among Grid nodes, and the trustworthiness of nodes is evaluated by utilizing the Bayes method. Integrating the trustworthiness of nodes into a Dynamic Level Scheduling (DLS) algorithm, the Trust-Dynamic Level Scheduling (Trust-DLS) algorithm is proposed. Theoretical analysis and simulations prove that the Trust-DLS algorithm can efficiently meet the requirement of Grid tasks in trust, sacrificing fewer time costs, and assuring the execution of tasks in a security way in Grid environment.

  16. GIS-Based Simulation of Engineering Construction Schedule

    Institute of Scientific and Technical Information of China (English)

    ZHANG Jing; ZHONG Denghua; HU Chengshun

    2005-01-01

    For its complexity, engineering construction schedule design is limited by various factors.Simulation-based engineering construction schedule takes critical path method (CPM) network as frame and calls complex cyclic operation network (CYCLONE) simulation model enclosed in advance for its simulation nodes. CYCLONE simulation model takes charge of simulating stochastic duration of activity and efficiency of resources, while CPM model performs project scheduling. This combination avoids the shortcomings of both models. Furthermore, geographic information system (GIS) technique is utilized to visualize the construction processes which are otherwise difficult to be understood by static results described. Application in practical project verifies the feasibility and advantage of the technique.

  17. Basis Function Repetitive And Feedback Control With Application To A Particle Accelerator

    CERN Document Server

    Akogyeram, R A

    2002-01-01

    The thesis addresses three problem areas within repetitive control. Firstly, it addresses issues concerning the ability of repetitive control and feedback control systems to eliminate periodic disturbances occurring above the Nyquist frequency of the hardware. Methods are developed for decomposing and unfolding notch filter or comb filter feedback control so that disturbances above Nyquist frequency can be canceled. Phenomena affecting final error levels are discussed, including error in unfolding, coarseness of zero-order hold cancellation, and waterbed effects in the feedback control system frequency response for different sample rates. Secondly, matched basis function repetitive control laws are developed for batch mode and real time implementation to converge to zero tracking error in the presence of periodic disturbances. For both control methods, conditions are given that guarantee asymptotic and monotonic convergence. Stability tests are formulated to examine stability when the period of a disturbance ...

  18. Power Efficient Hierarchical Scheduling for DSP Transformations

    Directory of Open Access Journals (Sweden)

    P. K. Merakos

    2002-01-01

    Full Text Available In this paper, the problem of scheduling the computation of partial products in transformational Digital Signal Processing (DSP algorithms, aiming at the minimization of the switching activity in data and address buses, is addressed. The problem is stated as a hierarchical scheduling problem. Two different optimization algorithms, which are based on the Travelling Salesman Problem (TSP, are defined. The proposed optimization algorithms are independent on the target architecture and can be adapted to take into account it. Experimental results obtained from the application of the proposed algorithms in various widely used DSP transformations, like Discrete Cosine Transform (DCT and Discrete Fourier Transform (DFT, show that significant switching activity savings in data and address buses can be achieved, resulting in corresponding power savings. In addition, the differences between the two proposed methods are underlined, providing envisage for their suitable selection for implementation, in particular transformational algorithms and architectures.

  19. Off-Line and Dynamic Production Scheduling – A Comparative Case Study

    Directory of Open Access Journals (Sweden)

    Bożek Andrzej

    2016-03-01

    Full Text Available A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.

  20. On the scheduling method and the result analysis of production plan in the complex market environment%复杂市场环境下的生产计划编排方法及结果分析

    Institute of Scientific and Technical Information of China (English)

    董鹏; 朱复生; 张立甫; 胡左浩

    2011-01-01

    在经济全球化的背景下,企业面对国内外市场强大的竞争压力,我们必须要从企业的实际出发,寻求新的计划编排方法,符合企业的现状,以适应复杂多变的市场需求。本文从不同角度对生产计划类型的编制方法进行分析,分析其利弊。当然,对于计划的编排以及过程中的调控,市场部应始终处于决策建议和市场产品动态信息处理的核心地位,生产单位的各环节必须服务于、服从于市场需求的基本原则,服从于企业的经营战略,为企业的经济效益服务。%In the context of economical globalization, an enterp~'ise is facing great competitive market pressure at home and abroad. It must proceed from its reality and explores new plan layout method so as to meet the demand of the complex and changing market. This paper analyzes the scheduling method of production plan types from different perspectives. As for plan layout and proeess control, the marketing department should always be at the core position of decision-making advice and dynamic information processing of market products. And all the items of its production units must be subject to the basic principles of market demand and its marketing strategy so as to serve its economical benefits.

  1. Storytelling and Repetitive Narratives for Design Empathy

    DEFF Research Database (Denmark)

    Fritsch, Jonas; Judice, Andrea; Soini, Katja

    2007-01-01

    Today it is widely established in design research that empathy is an important part of creating a true understanding of user experience as a resource for design. A typical challenge is how to transmit the feeling of empathy acquired by user studies to designers who have not participated in the user...... study. In this paper, we show how we attained an empathic understanding through storytelling and aroused empathy to others using repetitive narratives in an experimental presentation bringing forth factual, reflective and experiential aspects of the user information. Taking as a starting point our...... experiences with the design project Suomenlinna Seclusive, we conclude with the potential of using narratives for invoking design empathy....

  2. A miniature high repetition rate shock tube.

    Science.gov (United States)

    Tranter, R S; Lynch, P T

    2013-09-01

    A miniature high repetition rate shock tube with excellent reproducibility has been constructed to facilitate high temperature, high pressure, gas phase experiments at facilities such as synchrotron light sources where space is limited and many experiments need to be averaged to obtain adequate signal levels. The shock tube is designed to generate reaction conditions of T > 600 K, P shock waves with predictable characteristics are created, repeatably. Two synchrotron-based experiments using this apparatus are also briefly described here, demonstrating the potential of the shock tube for research at synchrotron light sources.

  3. Storytelling and Repetitive Narratives for Design Empathy

    DEFF Research Database (Denmark)

    Fritsch, Jonas; Judice, Andrea; Soini, Katja

    2007-01-01

    Today it is widely established in design research that empathy is an important part of creating a true understanding of user experience as a resource for design. A typical challenge is how to transmit the feeling of empathy acquired by user studies to designers who have not participated in the user...... study. In this paper, we show how we attained an empathic understanding through storytelling and aroused empathy to others using repetitive narratives in an experimental presentation bringing forth factual, reflective and experiential aspects of the user information. Taking as a starting point our...... experiences with the design project Suomenlinna Seclusive, we conclude with the potential of using narratives for invoking design empathy....

  4. The repetitive component of the sunflower genome

    Directory of Open Access Journals (Sweden)

    T. Giordani

    2014-08-01

    Full Text Available The sunflower (Helianthus annuus and species belonging to the genus Helianthus are emerging as a model species and genus for a number of studies on genome evolution. In this review, we report on the repetitive component of the H. annuus genome at the biochemical, molecular, cytological, and genomic levels. Recent work on sunflower genome composition is described, with emphasis on different types of repeat sequences, especially LTR-retrotransposons, of which we report on isolation, characterisation, cytological localisation, transcription, dynamics of proliferation, and comparative analyses within the genus Helianthus.

  5. Nurse Scheduling System based on Dynamic Weighted Maximal Constraint Satisfaction Problem

    Science.gov (United States)

    Hattori, Hiromitsu; Isomura, Atsushi; Ito, Takayuki; Ozono, Tadachika; Shintani, Toramatsu

    Scheduling has been an important research field in Artificial Intelligence. Because typical scheduling problems could be modeled as a Constraint Satisfaction Problem(CSP), several constraint satisfaction techniques have been proposed. In order to handle the different levels of importance of the constraints, solving a problem as a Weighted Maximal Constraint Satisfaction Problem(W-MaxCSP) is an promising approach. However, there exists the case where unexpected events are added and some sudden changes are required, i.e., the case with dynamic changes in scheduling problems. In this paper, we describe such dynamic scheduling problem as a Dynamic Weighted Maximal Constraint Satisfaction Problem(DW-MaxCSP) in which constraints would changes dynamically. Generally, it is undesirable to determine vastly modified schedule even if re-scheduling is needed. A new schedule should be close to the current one as much as possible. In order to obtain stable solutions, we propose the methodology to maintain portions of the current schedule using the provisional soft constraints, which explicitly penalize the changes from the current schedule. We have experimentally confirmed the efficacy of re-scheduling based on our method with provisional constraints. In this paper, we construct the nurse scheduling system for applying the proposed scheduling method.

  6. Residency Applicants Prefer Online System for Scheduling Interviews

    Directory of Open Access Journals (Sweden)

    Wills, Charlotte

    2015-03-01

    Full Text Available Introduction: Residency coordinators may be overwhelmed when scheduling residency interviews. Applicants often have to coordinate interviews with multiple programs at once, and relying on verbal or email confirmation may delay the process. Our objective was to determine applicant mean time to schedule and satisfaction using online scheduling. Methods: This pilot study is a retrospective analysis performed on a sample of applicants offered interviews at an urban county emergency medicine residency. Applicants were asked their estimated time to schedule with the online system compared to their average time using other methods. In addition, they were asked on a five-point anchored scale to rate their satisfaction. Results: Of 171 applicants, 121 completed the survey (70.8%. Applicants were scheduling an average of 13.3 interviews. Applicants reported scheduling interviews using the online system in mean of 46.2 minutes (median 10, range 1-1800 from the interview offer as compared with a mean of 320.2 minutes (median 60, range 3-2880 for other programs not using this system. This difference was statistically significant. In addition, applicants were more likely to rate their satisfaction using the online system as “satisfied” (83.5% vs 16.5%. Applicants were also more likely to state that they preferred scheduling their interviews using the online system rather than the way other programs scheduled interviews (74.2% vs 4.1% and that the online system aided them coordinating travel arrangements (52.1% vs 4.1%. Conclusion: An online interview scheduling system is associated with higher satisfaction among applicants both in coordinating travel arrangements and in overall satisfaction. [West J Emerg Med. 2015;16(2:352-354.

  7. The Single And Multi Project Approach To Planning And Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas

    2008-01-01

    with the challenging coordination of the work of several actors. The project planning and scheduling should, from the subcontractor’s perspective, allow for scope and flexibility so that the subcontractor can reallocate its resources at will between its ongoing projects and thereby optimise its own production. However......, reallocations of subcontracting resources lead to project interruptions which counteract on the overall productivity of the single construction project. Thus, there is a planning and scheduling conflict between the operational multi project management of the subcontracting firm and the management of single...... projects carried out by the management on site. This paper explains the single and multi project perspective on construction planning and scheduling represented by the main and the subcontractors and further, it describes how the prevailing scheduling method of today, i.e. the critical path method, conduce...

  8. Planning and Scheduling for Fleets of Earth Observing Satellites

    Science.gov (United States)

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

    2001-01-01

    We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.

  9. Verbal behavior in Alzheimer disease patients: Analysis of phrase repetition

    Directory of Open Access Journals (Sweden)

    Juliana Francisca Cecato

    Full Text Available Abstract Language problems in the elderly with AD are due to the fact that deterioration occurs not only in semantic memory, but in a group of cognitive factors, evidenced by a deficiency in search strategies for linguistic information. Objectives: To evaluate phrase repetition in two cognitive tests, the MMSE and MoCA, in a group of Alzheimer disease patients (AD and normal controls. Methods: A Cross-sectional study was conducted involving 20 patients who sought medical assistance at a geriatric institute in Jundiaí, São Paulo. The subjects underwent a detailed clinical examination and neuropsychometric evaluation. All subjects with AD met DSM-IV and NINCDS-ADRDA criteria. Ten patients received a diagnosis of AD and 10 were healthy subjects, forming the control group (CG. Results: All participants correctly answered the phrase from the MMSE (phrase 1. The MoCA phrases (phrases 2 and 3 were correct in 80% and 90%, respectively in the CG and in 40% and 50%, respectively in the AD group. Conclusions: The MoCA test proved more effective in evaluating the echoic behavior in AD patients compared to the MMSE. The simpler phrase repetition task in the MMSE was found to be less sensitive in detecting mild language decline in AD patients.

  10. Multiple repetition time balanced steady-state free precession imaging.

    Science.gov (United States)

    Cukur, Tolga; Nishimura, Dwight G

    2009-07-01

    Although balanced steady-state free precession (bSSFP) imaging yields high signal-to-noise ratio (SNR) efficiency, the bright lipid signal is often undesirable. The bSSFP spectrum can be shaped to suppress the fat signal with scan-efficient alternating repetition time (ATR) bSSFP. However, the level of suppression is limited, and the pass-band is narrow due to its nonuniform shape. A multiple repetition time (TR) bSSFP scheme is proposed that creates a broad stop-band with a scan efficiency comparable with ATR-SSFP. Furthermore, the pass-band signal uniformity is improved, resulting in fewer shading/banding artifacts. When data acquisition occurs in more than a single TR within the multiple-TR period, the echoes can be combined to significantly improve the level of suppression. The signal characteristics of the proposed technique were compared with bSSFP and ATR-SSFP. The multiple-TR method generates identical contrast to bSSFP, and achieves up to an order of magnitude higher stop-band suppression than ATR-SSFP. In vivo studies at 1.5 T and 3 T demonstrate the superior fat-suppression performance of multiple-TR bSSFP.

  11. An Improved Round Robin Scheduling Algorithm for CPU scheduling

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar yadav

    2010-07-01

    Full Text Available There are many functions which are provided by operating system like process management, memory management, file management, input/outputmanagement, networking, protection system and command interpreter system. In these functions, the process management is most important function because operating system is a system program that means at the runtime process interact with hardware. Therefore, we can say that for improving the efficiency of a CPU we need to manage all process. For managing the process we use various types scheduling algorithm. There are many algorithm are available for CPU scheduling. But all algorithms have its own deficiency and limitations. In this paper, I proposed a new approach for round robin scheduling algorithm which helps to improve the efficiency of CPU.

  12. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2010-10-01

    Full Text Available The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and less throughput. The proposed algorithm improves all the drawback of simple round robin architecture. The author have also given comparative analysis of proposed with simple round robin scheduling algorithm. Therefore, the author strongly feel that the proposed architecture solves all the problem encountered in simple round robin architecture by decreasing the performance parameters to desirable extent and thereby increasing the system throughput.

  13. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

    ... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of... Information Act (FOIA) Fee Schedule Update pursuant to 10 CFR 1703.107(b)(6) of the Board's regulations. DATES... update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule Update was published in...

  14. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations... General Manager will update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule...

  15. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

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

  16. DRSCRO: A Metaheuristic Algorithm for Task Scheduling on Heterogeneous Systems

    OpenAIRE

    2015-01-01

    An efficient DAG task scheduling is crucial for leveraging the performance potential of a heterogeneous system and finding a schedule that minimizes the makespan (i.e., the total execution time) of a DAG is known to be NP-complete. A recently proposed metaheuristic method, Chemical Reaction Optimization (CRO), demonstrates its capability for solving NP-complete optimization problems. This paper develops an algorithm named Double-Reaction-Structured Chemical Reaction Optimization (DRSCRO) for ...

  17. Improved Quantum Genetic Algorithm in Application of Scheduling Engineering Personnel

    OpenAIRE

    Huaixiao Wang; Ling Li; Jianyong Liu; Yong Wang; Chengqun Fu

    2014-01-01

    To verify the availability of the improved quantum genetic algorithm in solving the scheduling engineering personnel problem, the following work has been carried out: the characteristics of the scheduling engineering personnel problem are analyzed, the quantum encoding method is proposed, and an improved quantum genetic algorithm is applied to address the issue. Taking the low efficiency and the bad performance of the conventional quantum genetic algorithm into account, a universal improved q...

  18. Nurse Scheduling Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Komgrit Leksakul

    2014-01-01

    Full Text Available This study applied engineering techniques to develop a nurse scheduling model that, while maintaining the highest level of service, simultaneously minimized hospital-staffing costs and equitably distributed overtime pay. In the mathematical model, the objective function was the sum of the overtime payment to all nurses and the standard deviation of the total overtime payment that each nurse received. Input data distributions were analyzed in order to formulate a simulation model to determine the optimal demand for nurses that met the hospital’s service standards. To obtain the optimal nurse schedule with the number of nurses acquired from the simulation model, we proposed a genetic algorithm (GA with two-point crossover and random mutation. After running the algorithm, we compared the expenses and number of nurses between the existing and our proposed nurse schedules. For January 2013, the nurse schedule obtained by GA could save 12% in staffing expenses per month and 13% in number of nurses when compare with the existing schedule, while more equitably distributing overtime pay between all nurses.

  19. Scheduling of distributed applications for high performance computing as a service

    Science.gov (United States)

    Båk, Slawomir; Czarnecki, Radosław; Deniziak, Stanislaw

    2016-12-01

    In this paper we propose the method for scheduling parallel applications in HPCaaS cloud. Applications are specified as distributed algorithms. The goal of our method is to optimize the cost of resource hiring and minimize the execution time of all incoming applications. Experimental results showed that our method gives significantly better utilization of computational resources than classical scheduling methods.

  20. Repetition priming of words and nonwords in Alzheimer's disease and normal aging

    Science.gov (United States)

    Ober, Beth A.; Shenaut, Gregory K.

    2014-01-01

    Objective This study examines the magnitude and direction of nonword and word lexical decision repetition priming effects in Alzheimer’s disease (AD) and normal aging, focusing specifically on the negative priming effect sometimes observed with repeated nonwords. Method Probable Alzheimer's disease (AD) patients (30), elderly normal controls (34), and young normal controls (49) participated in a repetition priming experiment using low-frequency words and word-like nonwords with a letter-level orthographic orienting task at study followed by a lexical decision test phase. Results Although participants' reaction times were longer in AD compared to elderly normal, and elderly normal compared to young normal, the repetition priming effect and the degree to which the repetition priming effect was reversed for nonwords compared to words was unaffected by AD or normal aging. Conclusion AD patients, like young and elderly normal participants, are able to modify (in the case of words) and create (in the case of nonwords) long-term memory traces for lexical stimuli, based on a single orthographic processing trial. The nonword repetition results are discussed from the perspective of new vocabulary learning commencing with a provisional lexical memory trace created after orthographic encoding of a novel word-like letter string. PMID:25000325

  1. Genetic Algorithms for Satellite Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Fatos Xhafa

    2012-01-01

    Full Text Available Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.

  2. Hanford site environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1998-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy (DOE). Sampling is conducted to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1 {open_quotes}General Environmental Protection Program,{close_quotes} and DOE Order 5400.5, {open_quotes}Radiation Protection of the Public and the Environment.{close_quotes} The sampling methods are described in the Environmental Monitoring Plan, United States Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 2, U.S. Department of Energy, Richland, Washington. This document contains the 1998 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. Each section of this document describes the planned sampling schedule for a specific media (air, surface water, biota, soil and vegetation, sediment, and external radiation). Each section includes the sample location, sample type, and analyses to be performed on the sample. In some cases, samples are scheduled on a rotating basis and may not be planned for 1998 in which case the anticipated year for collection is provided. In addition, a map is included for each media showing sample locations.

  3. Feature-based telescope scheduler

    Science.gov (United States)

    Naghib, Elahesadat; Vanderbei, Robert J.; Stubbs, Christopher

    2016-07-01

    Feature-based Scheduler offers a sequencing strategy for ground-based telescopes. This scheduler is designed in the framework of Markovian Decision Process (MDP), and consists of a sub-linear online controller, and an offline supervisory control-optimizer. Online control law is computed at the moment of decision for the next visit, and the supervisory optimizer trains the controller by simulation data. Choice of the Differential Evolution (DE) optimizer, and introducing a reduced state space of the telescope system, offer an efficient and parallelizable optimization algorithm. In this study, we applied the proposed scheduler to the problem of Large Synoptic Survey Telescope (LSST). Preliminary results for a simplified model of LSST is promising in terms of both optimality, and computational cost.

  4. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

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

  6. Optimal randomized scheduling by replacement

    Energy Technology Data Exchange (ETDEWEB)

    Saias, I.

    1996-05-01

    In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.

  7. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Ravn, Anders P.;

    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 ...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.......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...

  8. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... 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....

  9. A Disk Scheduling Algorithm: SPFF

    Institute of Scientific and Technical Information of China (English)

    HU Ming

    2005-01-01

    We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically. Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first (SPFF). This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head-moving distance, it has the stronger globality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system's different demands.

  10. Safe self-scheduling: A parallel loop scheduling scheme for shared-memory multiprocessors

    Energy Technology Data Exchange (ETDEWEB)

    Liu, J. [Western Oregon State College, Monmouth, OR (United States); Saletore, V.A. [Oregon State Univ., Corvallis, OR (United States); Lewis, T.G. [Naval Postgraduate School, Monterey, CA (United States)

    1994-12-01

    In this paper we present Safe Self-Scheduling (SSS), a new scheduling scheme that schedules parallel loops with variable length iteration execution times not known at compile time. The scheme assumes a shared memory space. SSS combines static scheduling with dynamic scheduling and draws favorable advantages from each. First, it reduces the dynamic scheduling overhead by statistically scheduling a major portion of loop iterations. Second, the workload is balanced with simple and efficient self-scheduling scheme by applying a new measure, the smallest critical chore size. Experimental results comparing SSS with other scheduling schemes indicate that SSS surpasses other scheduling schemes. In the experiment on Gauss-Jordan, an application that is suitable for static scheduling schemes, SSS is the only self-scheduling scheme that outperforms the static scheduling scheme. This indicates that SSS achieves a balanced workload with a very small amount of overhead.

  11. A Method for Generating Diffuse Discharge via Repetitive Nanosecond Pulses and Wire Electrodes in Room-temperature Atmospheric Air%利用重复频率纳秒脉冲和线电极产生常温常压下的大气压弥散放电

    Institute of Scientific and Technical Information of China (English)

    李黎; 刘云龙; 俞斌; 葛亚峰; 林福昌

    2014-01-01

    The non-equilibrium plasmas produced by diffuse discharges have a great potential of application in many high technology fields. In room-temperature atmospheric air, the formation mechanism of non-equilibrium plasma is discussed and analysed. It is concluded that generating diffuse discharge in open air should meet the three conditions: low-voltage excitation, plentiful electron avalanches and temperature inhibition of spatial charge particles. A method of generating diffuse discharge is proposed and implemented. Based on runaway electrons breakdown theory, a low duty-ratio, high voltage repetitive nanosecond pulse generator is chosen as discharge excitation source. Using the wire-electrodes with small curvature radius, the gaps with highly non-uniform electrical field are structured. The experiments are performed in linear-type and ring-type electrode pairs. The results prove that the proposed method can generate typical diffuse discharges in cm. gaps via nanosecond pluses with less than 100kV peak voltage, hundreds of Hz repetitive frequency.%大气压弥散放电产生非热平衡等离子体在诸多高新技术领域具有较大应用潜力。分析了在常温常压的大气压条件下,形成和维持非热平衡等离子体的机制,提出了实现弥散放电应设法满足低放电电压、多电子崩发展和带电粒子温度抑制的条件。由此设计了在开放的大气压空气环境中实现大面积弥散放电的装置。根据逃逸电子击穿理论,选择重复频率、较低占空比的纳秒脉冲电激励方式作为弥散放电的低电压驱动源。利用线型电极的小曲率半径,构成极不均匀电场间隙。弥散放电分别在直线型电极和圆环型电极中进行。实验结果表明,所研制的放电装置能够以百kV以内峰值纳秒脉冲电压、数百Hz的频率激励若干厘米等级间距的大气压弥散放电。

  12. The role of short-term memory impairment in nonword repetition, real word repetition, and nonword decoding: A case study.

    Science.gov (United States)

    Peter, Beate

    2017-09-21

    In a companion study, adults with dyslexia and adults with a probable history of childhood apraxia of speech showed evidence of difficulty with processing sequential information during nonword repetition, multisyllabic real word repetition and nonword decoding. Results suggested that some errors arose in visual encoding during nonword reading, all levels of processing but especially short-term memory storage/retrieval during nonword repetition, and motor planning and programming during complex real word repetition. To further investigate the role of short-term memory, a participant with short-term memory impairment (MI) was recruited. MI was confirmed with poor performance during a sentence repetition and three nonword repetition tasks, all of which have a high short-term memory load, whereas typical performance was observed during tests of reading, spelling, and static verbal knowledge, all with low short-term memory loads. Experimental results show error-free performance during multisyllabic real word repetition but high counts of sequence errors, especially migrations and assimilations, during nonword repetition, supporting short-term memory as a locus of sequential processing deficit during nonword repetition. Results are also consistent with the hypothesis that during complex real word repetition, short-term memory is bypassed as the word is recognized and retrieved from long-term memory prior to producing the word.

  13. Gemcitabine and cisplatin in locally advanced and metastatic bladder cancer; 3- or 4-week schedule?

    DEFF Research Database (Denmark)

    Als, Anne Birgitte; Sengeløv, Lisa; Von Der Maase, Hans

    2008-01-01

    BACKGROUND: Chemotherapy with gemcitabine and cisplatin (GC) is an active regimen in advanced transitional cell carcinoma (TCC). Traditionally, GC has been administered as a 4-week schedule. However, an alternative 3-week schedule may be more feasible. Long-term survival data for the alternative 3......-week schedule and comparisons of the feasibility and toxicity between the two schedules have not previously been published. MATERIAL AND METHODS: We performed a retrospective analysis of patients with stage IV TCC, treated with GC by a standard 4-week or by an alternative 3-week schedule. RESULTS...

  14. A phonetic approach to consonant repetition in early words.

    Science.gov (United States)

    Kim, Namhee; Davis, Barbara L

    2015-08-01

    The goal of this study was to evaluate movement-based principles for understanding early speech output patterns. Consonant repetition patterns within children's actual productions of word forms were analyzed using spontaneous speech data from 10 typically developing American-English learning children between 12 and 36 months of age. Place of articulation, word level patterns, and developmental trends in CVC and CVCV repeated word forms were evaluated. Labial and coronal place repetitions dominated. Regressive repetition (e.g., [gag] for "dog") occurred frequently in CVC but not in CVCV word forms. Consonant repetition decreased over time. However, the children produced sound types available reported as being within young children's production system capabilities in consonant repetitions in all time periods. Findings suggest that a movement-based approach can provide a framework for comprehensively characterizing consonant place repetition patterns in early speech development.

  15. Repetition and Reactance in Graham’s "Underneath" Poems

    Directory of Open Access Journals (Sweden)

    Roghayeh Farsi

    2017-09-01

    Full Text Available The present paper gives a detailed analysis and interpretation of 16 poems in Jorie Graham's collection, Swarm (2000, which bear "UNDERNEATH" as their main titles. The poems are marked with different types of repetition such as graphological repetition, word, phrase, and sentential repetition, semantic repetition, and syntactic repetition. The study draws on Lakoff and Johnson's theories on metaphor and Brehm and Brehm’s reactance theory. It is argued "underneath" is a conceptual (orientational metaphor which signifies a state of being limited, lack of control and freedom, and loss of power. The paper investigates the speaker's reactant behavior in "Underneath" poems, seeking a way to restore her lost freedom. Reactance behaviors can be skepticism, inertia, aggression, and resistance. It is concluded despite her thematic inertia, representing her submission to the oppressed state, her stylistic reactance reflected in repetitions, innovations, and disruptive diction stands for her attempts to regain her lost control.

  16. A contactless microwave-based diagnostic tool for high repetition rate laser systems

    CERN Document Server

    Braggio, C

    2014-01-01

    We report on a novel electro-optic device for the diagnostics of high repetition rate laser systems. It is composed of a microwave receiver and of a second order nonlinear crystal, whose irradiation with a train of short laser pulses produces a time-dependent polarization in the crystal itself as a consequence of optical rectification. This process gives rise to the emission of microwave radiation that is detected by a receiver and is analyzed to infer the repetition rate and intensity of the pulses. We believe that this new method may overcome some of the limitations of photodetection techniques.

  17. Injector Beam Dynamics for a High-Repetition Rate 4th-Generation Light Source

    Energy Technology Data Exchange (ETDEWEB)

    Papadopoulos, C. F.; Corlett, J.; Emma, P.; Filippetto, D.; Penn, G.; Qiang, J.; Reinsch, M.; Sannibale, F.; Steier, C.; Venturini, M.; Wells, R.

    2013-05-20

    We report on the beam dynamics studies and optimization methods for a high repetition rate (1 MHz) photoinjector based on a VHF normal conducting electron source. The simultaneous goals of beamcompression and reservation of 6-dimensional beam brightness have to be achieved in the injector, in order to accommodate a linac driven FEL light source. For this, a parallel, multiobjective optimization algorithm is used. We discuss the relative merits of different injector design points, as well as the constraints imposed on the beam dynamics by technical considerations such as the high repetition rate.

  18. Risk of shoulder tendinitis in relation to shoulder loads in monotonous repetitive work

    DEFF Research Database (Denmark)

    Frost, P.; Bonde, J. P.; Mikkelsen, S.

    2002-01-01

    BACKGROUND: Few studies relate the occurrence of shoulder disorders to quantified ergonomic exposures. This study evaluates the hypothesis that shoulder loads in repetitive work might contribute to the occurrence of shoulder tendinitis. METHODS: This is a cross-sectional study of 1961 workers...... in repetitive work and 782 referents. Shoulder loads were quantified at task level and measures of exposures were assigned based on task distribution. Symptoms in combination with clinical criteria defined shoulder tendinitis. RESULTS: The prevalence of shoulder tendinitis was higher among exposed workers...... risk slightly (OR 1.6, 95% CI 1.0-2.6 per unit). CONCLUSIONS: The results indicate that workers with repetitive tasks have increased risk of shoulder tendinitis, which partially can be attributed to force requirements...

  19. Polymerase Chain Reaction-based Suppression of Repetitive Sequences in Whole Chromosome Painting Probes for FISH

    Energy Technology Data Exchange (ETDEWEB)

    Dugan, L C; Pattee, M; Williams, J; Eklund, M; Bedford, J S; Christian, A T

    2004-04-21

    We have developed a method to suppress the PCR amplification of repetitive sequences in whole chromosome painting probes by adding Cot-1 DNA to the amplification mixture. The repetitive sequences in the Cot-1 DNA bind to their homologous sequences in the probe library, prevent the binding of primers, and interfere with extension of the probe sequences, greatly decreasing PCR efficiency selectively across these blocked regions. A second labeling reaction is then done and this product is resuspended in FISH hybridization mixture without further addition of blocking DNA. The hybridization produces little if any non-specific binding on any other chromosomes. We have been able to successfully use this procedure with both human and rat chromosome probes. This technique should be applicable in producing probes for CGH, M-FISH and SKY, as well as reducing the presence of repetitive DNA in genomic libraries.

  20. Micro-Opportunistic Scheduling: The Micro-Boss Factory Scheduler

    Science.gov (United States)

    1994-01-01

    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979. [13] Eliyahu M. Goldratt ...techniques is the one developed by Goldratt and his colleagues within the context of the OPT factory scheduling system [13, 15, 10]. OPT demonstrated

  1. Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling

    CERN Document Server

    Moseley, Benjamin

    2010-01-01

    In this paper we initiate the study of minimizing power consumption in the broadcast scheduling model. In this setting there is a wireless transmitter. Over time requests arrive at the transmitter for pages of information. Multiple requests may be for the same page. When a page is transmitted, all requests for that page receive the transmission simulteneously. The speed the transmitter sends data at can be dynamically scaled to conserve energy. We consider the problem of minimizing flow time plus energy, the most popular scheduling metric considered in the standard scheduling model when the scheduler is energy aware. We will assume that the power consumed is modeled by an arbitrary convex function. For this problem there is a $\\Omega(n)$ lower bound. Due to the lower bound, we consider the resource augmentation model of Gupta \\etal \\cite{GuptaKP10}. Using resource augmentation, we give a scalable algorithm. Our result also gives a scalable non-clairvoyant algorithm for minimizing weighted flow time plus energ...

  2. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

    Don Rosenthal, a former Ames Research Center computer scientist who helped design the Hubble Space Telescope's scheduling software, co-founded Allocade Inc. of Menlo Park, California, in 2004. Allocade's OnCue software helps hospitals reclaim unused capacity and optimize constantly changing schedules for imaging procedures. After starting to use the software, one medical center soon reported noticeable improvements in efficiency, including a 12 percent increase in procedure volume, 35 percent reduction in staff overtime, and significant reductions in backlog and technician phone time. Allocade now offers versions for outpatient and inpatient magnetic resonance imaging (MRI), ultrasound, interventional radiology, nuclear medicine, Positron Emission Tomography (PET), radiography, radiography-fluoroscopy, and mammography.

  3. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... 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...

  4. An Energy Management Method of Island Microgrid Based on Load Classification and Scheduling%基于负荷分类调度的孤岛型微网能量管理方法

    Institute of Scientific and Technical Information of China (English)

    张忠; 王建学; 曹晓宇

    2015-01-01

    目前,国内外对微网运行的能量管理研究已取得了一定的成果,但是,主要是针对并网型微网运行的研究,而对孤岛型微网能量管理的研究还相对较少。因此,针对孤岛型微网的运行特点,研究了微网中的需求侧管理与调度方法,建立了孤岛型微网能量管理的优化调度模型。首先分析了在微网中开展需求侧管理的意义,将微网内的负荷按重要程度和用电特性分为三类,并作为可调度的对象。其次以总运行费用与停电损失之和最小为目标,计及停电量约束、储能设备运行约束和备用容量约束等条件,建立了孤岛型微网能量管理的混合整数规划模型,并使用 CPLEX 软件进行求解。算例结果表明,引入需求侧管理增加了孤岛型微网能量管理的灵活性,提高了可再生能源发电的利用率,降低了微网的运行成本。%Currently,studies on energy management of microgrid operation have gained some achievement at home and abroad. However,most of the studies are concerned with the grid-connected microgrid while those on the islanded microgrid are relatively few.So,with an eye to the operation characteristics of the island microgrid,the demand-side management and dispatching method are enumerated.And an optimal operation model for energy management of an island microgrid is developed.Firstly,the significance of conducting demand-side management in the microgrid is analyzed.The load in the island microgrid is classified into three classes and treated as schedulable variables based on their electrical features and degree of importance.Secondly,a mixed integer programming optimization scheduling model is exploited to minimize the sum of the total operating cost and the value of lost load considering related constraints and then solved by CPLEX software.Simulation results show that the introduction of the demand-side management has enhanced the flexibility of energy

  5. Wireless Network Coding with Local Network Views: Coded Layer Scheduling

    CERN Document Server

    Vahid, Alireza; Avestimehr, A Salman; Sabharwal, Ashutosh

    2011-01-01

    One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire limited local views of the whole network to design their transmission strategies. In this paper, we study multi-layer wireless networks and assume that each node has only a limited knowledge, namely 1-local view, where each S-D pair has enough information to perform optimally when other pairs do not interfere, along with connectivity information for rest of the network. We investigate the information-theoretic limits of communication with such limited knowledge at the nodes. We develop a novel transmission strategy, namely Coded Layer Scheduling, that solely relies on 1-local view at the nodes and incorporates three different techniques: (1) per layer interference avoidance, (2) repetition coding to allow overhearing of the interference, and (3) network coding to allow inter...

  6. Modeling of Agile Intelligent Manufacturing-oriented Production Scheduling System

    Institute of Scientific and Technical Information of China (English)

    Zhong-Qi Sheng; Chang-Ping Tang; Ci-Xing Lv

    2010-01-01

    Agile intelligent manufacturing is one of the new manufacturing paradigms that adapt to the fierce globalizing market competition and meet the survival needs of the enterprises, in which the management and control of the production system have surpassed the scope of individual enterprise and embodied some new features including complexity, dynamicity, distributivity, and compatibility. The agile intelligent manufacturing paradigm calls for a production scheduling system that can support the cooperation among various production sectors, the distribution of various resources to achieve rational organization, scheduling and management of production activities. This paper uses multi-agents technology to build an agile intelligent manufacturing-oriented production scheduling system. Using the hybrid modeling method, the resources and functions of production system are encapsulated, and the agent-based production system model is established. A production scheduling-oriented multi-agents architecture is constructed and a multi-agents reference model is given in this paper.

  7. Multi-objective Scheduling Using an Artificial Immune System

    Institute of Scientific and Technical Information of China (English)

    杨建国; 李蓓智

    2003-01-01

    Production scheduling is one of the most important problems to be considered in the effective performance of the automatic manufacturing system.It is the typical kind of NP-complete problem. The methods commonly used are not suitable to solve complicated problems because the calculating time rises exponentially with the increase of the problem size. In this paper, a new algorithm - immune based scheduling algorithm (IBSA) is proposed. After the description of the mathematics model and the calculating procedure of immune based scheduling,some examples are tested in the software system called HM IM& C that is developed usingVC+ +6.0. The testing results show that IBSA has high efficiency to solve scheduling problem.

  8. FEMA Hazard Mitigation Assistance Repetitive Flood Claims (RFC) Data

    Data.gov (United States)

    Department of Homeland Security — This dataset contains closed and obligated projects funded under the following Hazard Mitigation Assistance (HMA) grant programs: Repetitive Flood Claims (RFC). The...

  9. A review of neuroimaging findings in repetitive brain trauma.

    Science.gov (United States)

    Koerte, Inga K; Lin, Alexander P; Willems, Anna; Muehlmann, Marc; Hufschmidt, Jakob; Coleman, Michael J; Green, Isobel; Liao, Huijun; Tate, David F; Wilde, Elisabeth A; Pasternak, Ofer; Bouix, Sylvain; Rathi, Yogesh; Bigler, Erin D; Stern, Robert A; Shenton, Martha E

    2015-05-01

    Chronic traumatic encephalopathy (CTE) is a neurodegenerative disease confirmed at postmortem. Those at highest risk are professional athletes who participate in contact sports and military personnel who are exposed to repetitive blast events. All neuropathologically confirmed CTE cases, to date, have had a history of repetitive head impacts. This suggests that repetitive head impacts may be necessary for the initiation of the pathogenetic cascade that, in some cases, leads to CTE. Importantly, while all CTE appears to result from repetitive brain trauma, not all repetitive brain trauma results in CTE. Magnetic resonance imaging has great potential for understanding better the underlying mechanisms of repetitive brain trauma. In this review, we provide an overview of advanced imaging techniques currently used to investigate brain anomalies. We also provide an overview of neuroimaging findings in those exposed to repetitive head impacts in the acute/subacute and chronic phase of injury and in more neurodegenerative phases of injury, as well as in military personnel exposed to repetitive head impacts. Finally, we discuss future directions for research that will likely lead to a better understanding of the underlying mechanisms separating those who recover from repetitive brain trauma vs. those who go on to develop CTE.

  10. FEMA Hazard Mitigation Assistance Severe Repetitive Loss (SRL) Data

    Data.gov (United States)

    Department of Homeland Security — This dataset contains closed and obligated projects funded under the following Hazard Mitigation Assistance (HMA) grant programs: Severe Repetitive Loss (SRL). The...

  11. The Effect of Event Repetition on the Production of Story Grammar in Children's Event Narratives

    Science.gov (United States)

    Feltis, Brooke B.; Powell, Martine B.; Roberts, Kim P.

    2011-01-01

    Objective: This study examined the effect of event repetition on the amount and nature of story-grammar produced by children when recalling the event. Method: Children aged 4 years (N=50) and 7 years (N=56) participated in either 1 or 6 occurrences of a highly similar event where details varied across the occurrences. Half the children in each age…

  12. Towards a Post-Modern Science Education Curriculum-Discourse: Repetition of a Dream Catcher.

    Science.gov (United States)

    Blades, David W.

    1997-01-01

    Discusses Kierkegaard's idea of repetition as a dynamic conversation between groups that reveals possible changes in a discourse. Describes an instructor's experiences imparting a science education methods course in a Native American school in Saskatchewan, highlighting the conversation between the instructors' past and Native American culture.…

  13. Transitions between corona, glow, and spark regimes of nanosecond repetitively pulsed discharges in air at atmospheric pressure

    OpenAIRE

    Pai, David,; Lacoste, Deanna,; Laux, C.

    2010-01-01

    International audience; In atmospheric pressure air preheated from 300 to 1000 K, the nanosecond repetitively pulsed (NRP) method has been used to generate corona, glow, and spark discharges. Experiments have been performed to determine the parameter space (applied voltage, pulse repetition frequency, ambient gas temperature, and interelectrode gap distance) of each discharge regime. In particular, the experimental conditions necessary for the glow regime of NRP discharges have been determine...

  14. Studies of the uncanny: the repetition factor

    Directory of Open Access Journals (Sweden)

    Julia Teitelroit Martins

    2011-06-01

    Full Text Available Freud’s essay The Uncanny (Das Unheimliche offers many indications for the comprehension of an aesthetics of the uncanny which deserve to be explored. Nonetheless, a concept traverses it from beginning to end: the return – which enables its reading under the light of Beyond the pleasure principle, written along the same span of time. Emphasis is given to the uncanny in the sense of repetition of the different – a paradox in terms, like the strangely familiar uncanny. In order to test the validity of an aesthetic reading under this perspective, follows an analysis of the brief short story “A terceira margem do rio” (“The third margin of the river”, by Guimarães Rosa.

  15. Object color affects identification and repetition priming.

    Science.gov (United States)

    Uttl, Bob; Graf, Peter; Santacruz, Pilar

    2006-10-01

    We investigated the influence of color on the identification of both non-studied and studied objects. Participants studied black and white and color photos of common objects and memory was assessed with an identification test. Consistent with our meta-analysis of prior research, we found that objects were easier to identify from color than from black and white photos. We also found substantial priming in all conditions, and study-to-test changes in an object's color reduced the magnitude of priming. Color-specific priming effects were large for color-complex objects, but minimal for color-simple objects. The pattern and magnitude of priming effects was not influenced either by the extent to which an object always appears in the same color (i.e., whether a color is symptomatic of an object) or by the object's origin (natural versus fabricated). We discuss the implications of our findings for theoretical accounts of object perception and repetition priming.

  16. 基于x域重复控制的磁通切换永磁直线电机定位力抑制方法%A Cogging Force Reduction Method for Linear Flux-Switching Permanent Magnet Machines Based on thex-Domain Repetitive Controller

    Institute of Scientific and Technical Information of China (English)

    孟高军; 余海涛; 黄磊; 张笑薇

    2015-01-01

    The primary linear flux-switching permanent magnet (LFSPM) machine is a competitive candidate for direct-drive applications in feeding systems of the machine tool which need high force capability. However, the resulting cogging force is serious because of the double salient structure. Based on repetitive control of time-varying periodic signals, a new method of restraining cogging force for LFSPM was proposed, and the principle of the cogging force was analyzed. The idea is to transform the time-varying periodic toque disturbance in thet-domain to the signals defined in the x-domain and moreover to design a repetitive controller, so as to restrain the cogging force and speed vibration. Experimental evaluations of the proposed scheme were carried out on a AD5435-controlled LFSPM drive platform. The simulation and experiment results show that the control scheme is effective.%初级永磁型磁通切换直线电机在推力性能要求较高的机床伺服进给系统应用中具有一定的优势,而初次级双凸极结构会引起较大的定位力,从而限制了磁通切换永磁直线电机的应用。该文首先分析了磁通切换永磁直线(linear flux-switching permanent magnet,LFSPM)电机定位力产生的原理,随后从控制角度出发,提出一种利用时变周期信号的重复控制来抑制定位力的新型控制策略。首先将时变的t域信号,变换为具有固定周期的x域信号,再对其进行重复控制器的设计,从而达到抑制定位力和速度脉动的目的。通过半实物仿真平台AD5435实现了该控制算法,仿真及实验验证了该方法的有效性。

  17. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  18. A scheduling model for astronomy

    Science.gov (United States)

    Solar, M.; Michelon, P.; Avarias, J.; Garces, M.

    2016-04-01

    Astronomical scheduling problem has several external conditions that change dynamically at any time during observations, like weather condition (humidity, temperature, wind speed, opacity, etc.), and target visibility conditions (target over the horizon, Sun/Moon blocking the target). Therefore, a dynamic re-scheduling is needed. An astronomical project will be scheduled as one or more Scheduling Blocks (SBs) as an atomic unit of astronomical observations. We propose a mixed integer linear programming (MILP) solution to select the best SBs, favors SBs with high scientific values, and thus maximizing the quantity of completed observation projects. The data content of Atacama Large Millimeter/Submillimeter Array (ALMA) projects of cycle 0 and cycle 1 were analyzed, and a synthetic set of tests of the real instances was created. Two configurations, one of 5000 SBs in a 3 months season and another 10,000 SBs a 6 months season were created. These instances were evaluated with excellent results. Through the testing it is showed that the MILP proposal has optimal solutions.

  19. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

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

    2012-01-01

    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

  20. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

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

    2011-01-01

    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