WorldWideScience

Sample records for dynamic weapon scheduling

  1. A Novel Two-Staged Decision Support based Threat Evaluation and Weapon Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial Intelligence Techinques

    CERN Document Server

    Naeem, Huma; Hussain, Mukhtar; Khan, Shoab A

    2009-01-01

    Surveillance control and reporting (SCR) system for air threats play an important role in the defense of a country. SCR system corresponds to air and ground situation management/processing along with information fusion, communication, coordination, simulation and other critical defense oriented tasks. Threat Evaluation and Weapon Assignment (TEWA) sits at the core of SCR system. In such a system, maximal or near maximal utilization of constrained resources is of extreme importance. Manual TEWA systems cannot provide optimality because of different limitations e.g.surface to air missile (SAM) can fire from a distance of 5Km, but manual TEWA systems are constrained by human vision range and other constraints. Current TEWA systems usually work on target-by-target basis using some type of greedy algorithm thus affecting the optimality of the solution and failing in multi-target scenario. his paper relates to a novel two-staged flexible dynamic decision support based optimal threat evaluation and weapon assignment...

  2. A Novel Two-Staged Decision Support based Threat Evaluation and Weapon Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial Intelligence Techinques

    OpenAIRE

    Naeem, Huma; Masood, Asif; Hussain, Mukhtar; Shoab A. Khan

    2009-01-01

    Surveillance control and reporting (SCR) system for air threats play an important role in the defense of a country. SCR system corresponds to air and ground situation management/processing along with information fusion, communication, coordination, simulation and other critical defense oriented tasks. Threat Evaluation and Weapon Assignment (TEWA) sits at the core of SCR system. In such a system, maximal or near maximal utilization of constrained resources is of extreme importance. Manual TEW...

  3. Application of a Dynamic Programming Algorithm for Weapon Target Assignment

    Science.gov (United States)

    2016-02-01

    UNCLASSIFIED UNCLASSIFIED Application of a Dynamic Programming Algorithm for Weapon Target Assignment Lloyd Hammond Weapons and...Combat Systems Division Defence Science and Technology Group DST Group-TR-3221 ABSTRACT Threat evaluation and weapon assignment...dynamic programming algorithm for Weapon Target Assignment which, after more rigorous testing, could be used as a concept demonstrator and as an auxiliary

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

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

  6. Dynamic Broadcast Scheduling in DDBMS

    Directory of Open Access Journals (Sweden)

    Babu Santhalingam,

    2011-01-01

    Full Text Available This system will address the problem of online scheduling sequential data objects with the principle of periodicity in the context of dynamic information dissemination. Many modern information applications spread dynamically generated data objects and answer the complex query for retrieving multiple data objects. In dynamic environments, data streams need to be online processed rather than being stored and later retrieved to answer queries. Particularly, data objects are produced dynamically by the information providers, interleaved and disseminated efficiently by the broadcasting servers, and associated sequentially in the client sides. The proposed algorithm with a well-specific gain measure function prominently outperforms the FIFO schedule and is able to minimize the mean service access time to the extent close to the theoretical optimum.

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

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

    CERN Document Server

    Vanhoucke, Mario

    2013-01-01

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

  9. Force dynamics in fixed-ratio schedules.

    Science.gov (United States)

    Pinkston, Jonathan W; McBee, Lindsey N

    2014-03-01

    Fixed-ratio schedules are widely used in behavioral research. Although fixed-ratio schedules often conjure up relationships to work and effort, little is known about effort-related measures in these schedules. Early research had shown that force and effort of operant behavior vary systematically during the execution of ratio schedules, and the goal of the present study was to revisit early research on force dynamics in fixed-ratio schedules. Four rats earned sucrose by pressing an isometric force transducer. Presses produced sucrose after ten or twenty responses. In general, the force of responses increased then decreased systematically across the ratio. The possibility that decreases in force during ratio execution was due to a trade-off with the differential reinforcement of short inter-response times (IRT) was investigated in an additional condition where sucrose was made available according to a tandem fixed-ratio 19 inter-response (IRT)> t schedule. The tandem IRT requirement did not eliminate decreasing trends in force across the ratio; unexpectedly, the tandem requirement did eliminate increases in force early in the ratio, which may reflect sequence-level organization operating in the control of force dynamics.

  10. The GBT Dynamic Scheduling System: An Update

    Science.gov (United States)

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

    2011-07-01

    The Robert C. Byrd Green Bank Telescope's (GBT) Dynamic Scheduling System (DSS), in production use since September 2009, was designed to maximize observing efficiency while maintaining the GBT's flexibility, improving data quality, and minimizing any undue adversity for the observers. Using observing criteria, observer availability and qualifications, three-dimensional weather forecasts, and telescope state, the DSS software is capable of optimally scheduling observers 24 to 48 hours in advance on a telescope having a wide-range of capabilities in a geographical location with variable weather patterns. Recent improvements for the GBT include an expanded frequency coverage (0.390-90 GHz), proper treatment of fully sampled array receivers, increasingly diverse observing criteria, the ability to account for atmospheric instability from clouds, and new tools for scheduling staff to control and interact with generated schedules and the underlying database.

  11. The Dynamical Kernel Scheduler - Part 1

    CERN Document Server

    Adelmann, Andreas; Suter, Andreas

    2015-01-01

    Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software using these hardware accelerators introduces additional challenges for the developer such as exposing additional parallelism, dealing with different hardware designs and using multiple development frameworks in order to use devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between host application and different hardware accelerators. DKS handles the communication between the host and device, schedules task execution, and provides a library of built-in algorithms. Algorithms available in the DKS library will be written in CUDA, OpenCL and OpenMP. Depending on the available hardware, the DKS can select the appropriate implementation of the algorithm. The first DKS version was created using CUDA for the Nvidia GPUs and OpenMP for Intel MIC. DKS was further integrated in OPAL (Object-or...

  12. The Novel Heuristic for Data Transmission Dynamic Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Hao Xu

    2013-01-01

    Full Text Available The data transmission dynamic scheduling is a process that allocates the ground stations and available time windows to the data transmission tasks dynamically for improving the resource utilization. A novel heuristic is proposed to solve the data transmission dynamic scheduling problem. The characteristic of this heuristic is the dynamic hybridization of simple rules. Experimental results suggest that the proposed algorithm is correct, feasible, and available. The dynamic hybridization of simple rules can largely improve the efficiency of scheduling.

  13. DYNAMIC TASK SCHEDULING ON MULTICORE AUTOMOTIVE ECUS

    Directory of Open Access Journals (Sweden)

    Geetishree Mishra

    2014-12-01

    Full Text Available Automobile manufacturers are controlled by stringent govt. regulations for safety and fuel emissions and motivated towards adding more advanced features and sophisticated applications to the existing electronic system. Ever increasing customer’s demands for high level of comfort also necessitate providing even more sophistication in vehicle electronics system. All these, directly make the vehicle software system more complex and computationally more intensive. In turn, this demands very high computational capability of the microprocessor used in electronic control unit (ECU. In this regard, multicore processors have already been implemented in some of the task rigorous ECUs like, power train, image processing and infotainment. To achieve greater performance from these multicore processors, parallelized ECU software needs to be efficiently scheduled by the underlaying operating system for execution to utilize all the computational cores to the maximum extent possible and meet the real time constraint. In this paper, we propose a dynamic task scheduler for multicore engine control ECU that provides maximum CPU utilization, minimized preemption overhead, minimum average waiting time and all the tasks meet their real time deadlines while compared to the static priority scheduling suggested by Automotive Open Systems Architecture (AUTOSAR

  14. Dynamic Task Scheduling on Multicore Automotive ECUs

    Directory of Open Access Journals (Sweden)

    Geetishree Mishra

    2014-12-01

    Full Text Available Automobile manufacturers are controlled by stringen t govt. regulations for safety and fuel emissions a nd motivated towards adding more advanced features and sophisticated applications to the existing electro nic system. Ever increasing customer’s demands for high level of comfort also necessitate providing even m ore sophistication in vehicle electronics system. All t hese, directly make the vehicle software system mor e complex and computationally more intensive. In turn , this demands very high computational capability o f the microprocessor used in electronic control unit (ECU. In this regard, multicore processors have already been implemented in some of the task rigoro us ECUs like, power train, image processing and infotainment. To achieve greater performance from t hese multicore processors, parallelized ECU softwar e needs to be efficiently scheduled by the underlayin g operating system for execution to utilize all the computational cores to the maximum extent possible and meet the real time constraint. In this paper, w e propose a dynamic task scheduler for multicore engi ne control ECU that provides maximum CPU utilization, minimized preemption overhead, minimum average waiting time and all the tasks meet their real time deadlines while compared to the static pr iority scheduling suggested by Automotive Open Syst ems Architecture (AUTOSAR.

  15. Runway Scheduling Using Generalized Dynamic Programming

    Science.gov (United States)

    Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

    2011-01-01

    A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

  16. The Dynamic Kernel Scheduler-Part 1

    Science.gov (United States)

    Adelmann, Andreas; Locans, Uldis; Suter, Andreas

    2016-10-01

    Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software that uses these hardware accelerators introduces additional challenges for the developer. These challenges may include exposing increased parallelism, handling different hardware designs, and using multiple development frameworks in order to utilise devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between the host application and different hardware accelerators. DKS handles the communication between the host and the device, schedules task execution, and provides a library of built-in algorithms. Algorithms available in the DKS library will be written in CUDA, OpenCL, and OpenMP. Depending on the available hardware, the DKS can select the appropriate implementation of the algorithm. The first DKS version was created using CUDA for the Nvidia GPUs and OpenMP for Intel MIC. DKS was further integrated into OPAL (Object-oriented Parallel Accelerator Library) in order to speed up a parallel FFT based Poisson solver and Monte Carlo simulations for particle-matter interaction used for proton therapy degrader modelling. DKS was also used together with Minuit2 for parameter fitting, where χ2 and max-log-likelihood functions were offloaded to the hardware accelerator. The concepts of the DKS, first results, and plans for the future will be shown in this paper.

  17. A PSL Ontology-based Shop Floor Dynamical Scheduler Design

    Institute of Scientific and Technical Information of China (English)

    WANG Wei-da; XU He; PENG Gao-liang; LIU Wen-jian; Khalil Alipour

    2008-01-01

    Due to the complex,uncertainty and dynamics in the modern manufacturing environment,a flexible and robust shop floor scheduler is essential to achieve the production goals.A design framework of a shop floor dynamical scheduler is presented in this paper.The workflow and function modules of the scheduler are discussed in detail.A multi-step adaptive scheduling strategy and a process specification language,which is an ontology-based representation of process plan,are utilized in the proposed scheduler.The scheduler acquires the dispatching rule from the knowledge base and uses the build in on-line simulator to evaluate the obtained rule.These technologies enable the scheduler to improve its fine-tune ability and effectively transfer process information into other heterogeneous information systems in a shop floor.The effectiveness of the suggested structure will be demonstrated via its application in the scheduling system of a manufacturing enterprise.

  18. Scheduling based on a dynamic resource connection

    Science.gov (United States)

    Nagiyev, A. E.; Botygin, I. A.; Shersntneva, A. I.; Konyaev, P. A.

    2017-02-01

    The practical using of distributed computing systems associated with many problems, including troubles with the organization of an effective interaction between the agents located at the nodes of the system, with the specific configuration of each node of the system to perform a certain task, with the effective distribution of the available information and computational resources of the system, with the control of multithreading which implements the logic of solving research problems and so on. The article describes the method of computing load balancing in distributed automatic systems, focused on the multi-agency and multi-threaded data processing. The scheme of the control of processing requests from the terminal devices, providing the effective dynamic scaling of computing power under peak load is offered. The results of the model experiments research of the developed load scheduling algorithm are set out. These results show the effectiveness of the algorithm even with a significant expansion in the number of connected nodes and zoom in the architecture distributed computing system.

  19. Dynamic Scheduling of Flexible Job Shops

    Institute of Scientific and Technical Information of China (English)

    SHAHID Ikramullah Butt; SUN Hou-fang

    2007-01-01

    Aim of this research is to minimize makespan in the flexible job shop environment by the use of genetic algorithms and scheduling rules.Software is developed using genetic algorithms and scheduling rules based on certain constraints such as non-preemption of jobs,recirculation,set up times,non-breakdown of machines etc.Purpose of the software is to develop a schedule for flexible job shop environment,which is a special case of job shop scheduling problem.Scheduling algorithm used in the software is verified and tested by using MT10 as benchmark problem,presented in the flexible job shop environment at the end.LEKIN(R) software results are also compared with results of the developed software by the use of MT10 benchmark problem to show that the latter is a practical software and can be used successfully at BIT Training Workshop.

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

  1. Interactive Dynamic Mission Scheduling for ASCA

    Science.gov (United States)

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

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

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

  3. Dynamic Scheduling for Cloud Reliability using Transportation Problem

    Directory of Open Access Journals (Sweden)

    P. Balasubramanie

    2012-01-01

    Full Text Available Problem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliability and availability of the cloud computing environment. Therefore there is a need to implement a scheduling algorithm that can improve the availability and reliability in cloud environment. Approach: We propose a new algorithm using modified linear programming problem transportation based task scheduling and resource allocation for decentralized dynamic cloud computing. The Main objective is to improve the reliability of cloud computing environment by considering the resources available and it’s working status of each Cluster periodically and maximizes the profit for the cloud providers by minimizing the total cost for scheduling, allocation and execution cost and minimizing total turn-around, total waiting time and total execution time. Our proposed algorithm also utilizes task historical values such as past success rate, failure rate of task in each Cluster and previous execution time and total cost for various Clusters for each task from Task Info Container (TFC for tasks scheduling resource allocation for near future. Results: Our approach TP Scheduling (Transpotation Problem based responded for various tasks assigned by clients in poisson arrival pattern and achieved the improved reliability in dynamic decentralized cloud environment. Conclusion: With our proposed TP Scheduling algorithn we improve the Reliability of the decentralized dynamic cloud computing.

  4. Dynamic Packet Scheduling in Wireless Networks

    CERN Document Server

    Kesselheim, Thomas

    2012-01-01

    We consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, we take the geometry of the network and power control into account, both allowing to increase the network's performance significantly. We introduce a stochastic and an adversarial model to bound the packet injection. Although taken as the primary motivation, this approach is not only suitable for models based on the signal-to-interference-plus-noise ratio (SINR). It also covers virtually all other common interference models, for example the multiple-access channel, the radio-network model, the protocol model, and distance-2 matching. Packet-routing networks allowing each edge or each node to transmit or receive one packet at a time can be modeled as well. Starting from algorithms for the respective scheduling problem with static transmission requests, we build distributed stable protocols. This is more involved than in previous, similar approaches because...

  5. Automated Guide Vehicles Dynamic Scheduling Based on Annealing Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Zou Gan

    2013-05-01

    Full Text Available Dispatching automated guided vehicles (AGVs is the common approach for AGVs scheduling in practice, the information about load arrivals in advance was not used to optimize the performance of the automated guided vehicles system (AGVsS. According to the characteristics of the AGVsS, the mathematical model of AGVs scheduling was established. A heuristic algorithm called Annealing Genetic Algorithm (AGA was presented to deal with the AGVs scheduling problem,and applied the algorithm dynamically by using it repeatedly under a combined rolling optimization strategy. the performance of the proposed approach for AGVs scheduling was compared with the dispatching rules by simulation. Results showed that the approach performs significantly better than the dispatching rules and proved that it is really effective for AGVsS.

  6. Dynamic Extra Buses Scheduling Strategy in Public Transport

    Directory of Open Access Journals (Sweden)

    Bin Yu

    2015-06-01

    Full Text Available This paper presents a dynamic extra buses scheduling strategy to improve the transit service of transit routes. In this strategy, in order to decide when to dispatch an extra bus, the service reliability of transit route is assessed firstly. A model aimed at maximizing the benefit of the extra buses scheduling strategy is constructed to determine how many stops extra buses need to skip from the terminal to accommodate passengers at the following stops. A heuristic algorithm is defined and implemented to estimate the service reliability of transit route and to optimize the initial stop of extra buses scheduling strategy. Finally, the strategy is tested on two examples: a simple and a real-life transit route in the Dalian city in China. The results show that the extra buses scheduling strategy based on terminal stops with a reasonable threshold can save 8.01% waiting time of passengers.

  7. Deadlock-free Production Scheduling with Dynamic Buffers in MES

    Directory of Open Access Journals (Sweden)

    Taiping Mo

    2014-11-01

    Full Text Available In order to enable enterprises to change the production management mode and improve efficiency, MES provides overall solutions to information integration of manufacturing enterprises. Production scheduling is an important functional module in MES, and research of shop scheduling in MES has important significance. The concept deadlock is first put forward by computer science researchers who are engaged in resource allocation in the operation system. Modern manufacturing enterprises need to process complex workpieces with different processing step, so it is easy to produce a deadlock in the production process. A deadlock will bring many serious consequences for the system. Equipping with enough buffers can solve the problem of deadlock. However, it is costly and there is even no way to allocate buffers in some manufacturing industries. Considering the buffer cost and scheduling index, this paper puts forward the dynamic buffers deadlock-free scheduling to reduce cost and lower risk of the enterprise to a minimum.

  8. GC-MS Study of Mono- and Bishaloethylphosphonates Related to Schedule 2.B.04 of the Chemical Weapons Convention: The Discovery of a New Intramolecular Halogen Transfer

    Science.gov (United States)

    Picazas-Márquez, Nerea; Sierra, María; Nova, Clara; Moreno, Juan Manuel; Aboitiz, Nuria; de Rivas, Gema; Sierra, Miguel A.; Martínez-Álvarez, Roberto; Gómez-Caballero, Esther

    2016-09-01

    A new class of compounds, mono- and bis-haloethylphosphonates (HAPs and bisHAPs, respectively), listed in Schedule 2.B.04 of the Chemical Weapons Convention (CWC), has been synthesized and studied by GC-MS with two aims. First, to improve the identification of this type of chemicals by the Organization for the Prohibition of Chemical Weapons, (OPCW). Second, to study the synergistic effect of halogen and silicon atoms in molecules undergoing mass spectrometry. Fragmentation patterns of trimethylsilyl derivatives of HAPs were found to depend on the nature of the halogen atom; this was in agreement with DFT-calculations. The data suggest that a novel intramolecular halogen transfer takes place during the fragmentation process.

  9. GBT Dynamic Scheduling System: Algorithms, Metrics, and Simulations

    Science.gov (United States)

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

    2009-09-01

    We discuss the scoring algorithm of the Robert C. Byrd Green Bank Telescope (GBT) Dynamic Scheduling System (DSS). Since the GBT is located in a continental, mid-latitude region where weather is dominated by water vapor and small-scale effects, the weather plays an important role in optimizing the observing efficiency of the GBT. We score observing sessions as a product of many factors. Some are continuous functions while others are binary limits taking values of 0 or 1, any one of which can eliminate a candidate session by forcing the score to zero. Others reflect management decisions to expedite observations by visiting observers, ensure the timely completion of projects, etc. Simulations indicate that dynamic scheduling can increase the effective observing time at frequencies higher than 10 GHz by about 50% over one full year. Beta tests of the DSS during Summer 2008 revealed the significance of various scheduling constraints and telescope overhead time to the overall observing efficiency.

  10. A Dynamic Scheduler for a Computer Aided Protyping System.

    Science.gov (United States)

    1988-03-01

    and then "hand-packing’" all the important tasks into them. This is typically done in the context of a cyclical execu- tive (the cyclical executive...hroce ssrt eanil ni interrpt 3. Figure 6. CREATION AND EXECUTION OF THlE DYNAM1IC SCHEDULE 4. Non-time critical processes will be sequenced in the

  11. The GBT Dynamic Scheduling System: The Observers' Perspective

    Science.gov (United States)

    Braatz, J.; Balser, D. A.; Bignell, C.; Clark, M.; Harnett, J.; McCarty, M.; Marganian, P.; O'Neil, K.; Shelton, A.

    2009-09-01

    To make the most efficient use of telescope time, the NRAO is implementing a Dynamic Scheduling System (DSS) for the Robert C. Byrd Green Bank Telescope (GBT). The DSS aims to match observing projects to the weather and other observing conditions, without sacrificing observers' interactive control of their experiments. To meet this goal, the DSS schedules people, not observing scripts. Each observer can then attend to the observation, control the telescope, and modify the observing program, if necessary, in real time. Observing under the DSS is often done remotely, by necessity. Every day, the DSS generates a new schedule for the 24-hour period beginning one day hence. Observers therefore must be prepared to run observations with 24 to 48 hours notice. Being available and ready to observe on short notice requires that observers adopt a new mindset, unlike their experiences with other telescopes. While it may be an inconvenience for some, the benefits of the DSS are substantial, the primary one being that astronomers are almost assured of observing in appropriate weather and getting high quality data. The DSS gives observers the opportunity to black out time ranges to avoid for scheduling, so the telescope schedule can fit around other demands. In addition to the scheduling algorithms, the DSS team has developed a set of software tools to help observers manage their projects, to notify observers of scheduling news, and to help observers anticipate when their projects will get scheduled. In this contribution we will report observers' experiences from the first tests of the GBT DSS, which took place from June 1 to September 30, 2008.

  12. A Dynamic Job Scheduling Algorithm for Parallel System

    Institute of Scientific and Technical Information of China (English)

    张建; 陆鑫达; 加力

    2003-01-01

    One of the fundamental problems in parallel and distributed systems is deciding how to allocate jobs toprocessors. The goals of job scheduling in a parallel environment are to minimize the parallel execution time of ajob and try to balance the user's desire with the system's desire. The users always want their jobs be completed asquickly as possible, while the system wants to service as many jobs as possible. In this paper, a dynamic job-scheduling algorithm was introduced. This algorithm tries to utilize the information of a practical system to allo-cate the jobs more evenly. The communication time between the processor and scheduler is overlapped with thecomputation time of the processor. So the communication overhead can be little. The principle of scheduling thejob is based on the desirability of each processor. The scheduler would not allocate a new job to a processor that isalready fully utilized. The execution efficiency of the system will be increased. This algorithm also can be reused inother complex algorithms.

  13. Robust Satellite Scheduling Approach for Dynamic Emergency Tasks

    Directory of Open Access Journals (Sweden)

    Xuejun Zhai

    2015-01-01

    Full Text Available Earth observation satellites play a significant role in rapid responses to emergent events on the Earth’s surface, for example, earthquakes. In this paper, we propose a robust satellite scheduling model to address a sequence of emergency tasks, in which both the profit and robustness of the schedule are simultaneously maximized in each stage. Both the multiobjective genetic algorithm NSGA2 and rule-based heuristic algorithm are employed to obtain solutions of the model. NSGA2 is used to obtain a flexible and highly robust initial schedule. When every set of emergency tasks arrives, a combined algorithm called HA-NSGA2 is used to adjust the initial schedule. The heuristic algorithm (HA is designed to insert these tasks dynamically to the waiting queue of the initial schedule. Then the multiobjective genetic algorithm NSGA2 is employed to find the optimal solution that has maximum revenue and robustness. Meanwhile, to improve the revenue and resource utilization, we adopt a compact task merging strategy considering the duration of task execution in the heuristic algorithm. Several experiments are used to evaluate the performance of HA-NSGA2. All simulation experiments show that the performance of HA-NSGA2 is significantly improved.

  14. Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling

    CERN Document Server

    Leung, Lap-Fai; Hu, Xiaobo Sharon

    2011-01-01

    A novel energy reduction strategy to maximally exploit the dynamic workload variation is proposed for the offline voltage scheduling of preemptive systems. The idea is to construct a fully-preemptive schedule that leads to minimum energy consumption when the tasks take on approximately the average execution cycles yet still guarantees no deadline violation during the worst-case scenario. End-time for each sub-instance of the tasks obtained from the schedule is used for the on-line dynamic voltage scaling (DVS) of the tasks. For the tasks that normally require a small number of cycles but occasionally a large number of cycles to complete, such a schedule provides more opportunities for slack utilization and hence results in larger energy saving. The concept is realized by formulating the problem as a Non-Linear Programming (NLP) optimization problem. Experimental results show that, by using the proposed scheme, the total energy consumption at runtime is reduced by as high as 60% for randomly generated task set...

  15. Dynamic Intelligent Feedback Scheduling in Networked Control Systems

    Directory of Open Access Journals (Sweden)

    Hui-ying Chen

    2013-01-01

    Full Text Available For the networked control system with limited bandwidth and flexible workload, a dynamic intelligent feedback scheduling strategy is proposed. Firstly, a monitor is used to acquire the current available network bandwidth. Then, the new available bandwidth in the next interval is predicted by using LS_SVM approach. At the same time, the dynamic performance indices of all control loops are obtained with a two-dimensional fuzzy logic modulator. Finally, the predicted network bandwidth is dynamically allocated by the bandwidth manager and the priority allocator in terms of the loops' dynamic performance indices. Simulation results show that the sampling periods and priorities of control loops are adjusted timely according to the network workload condition and the dynamic performance of control loops, which make the system running in the optimal state all the time.

  16. Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites

    Directory of Open Access Journals (Sweden)

    Maocai Wang

    2014-01-01

    Full Text Available Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.

  17. Nuclear weapons modernizations

    Energy Technology Data Exchange (ETDEWEB)

    Kristensen, Hans M. [Federation of American Scientists, Washington, DC (United States)

    2014-05-09

    This article reviews the nuclear weapons modernization programs underway in the world's nine nuclear weapons states. It concludes that despite significant reductions in overall weapons inventories since the end of the Cold War, the pace of reductions is slowing - four of the nuclear weapons states are even increasing their arsenals, and all the nuclear weapons states are busy modernizing their remaining arsenals in what appears to be a dynamic and counterproductive nuclear competition. The author questions whether perpetual modernization combined with no specific plan for the elimination of nuclear weapons is consistent with the nuclear Non-Proliferation Treaty and concludes that new limits on nuclear modernizations are needed.

  18. Survey of the research on dynamic weapon-target assignment problem

    Institute of Scientific and Technical Information of China (English)

    Cai Huaiping; Liu Jingxu; Chen Yingwu; Wang Hao

    2006-01-01

    The basic concepts and models of weapon-target assignment (WTA) are introduced and the mathematical nature of the WTA models is also analyzed. A systematic survey of research on WTA problem is provided. The present research on WTA is focused on models and algorithms. In the research on models of WTA, the static WTA models are mainly studied and the dynamic WTA models are not fully studied in deed. In the research on algorithms of WTA, the intelligent algorithms are often used to solve the WTA problem. The small scale of static WTA problems has been solved very well, however, the large scale of dynamic WTA problems has not been solved effectively so far. Finally, the characteristics of dynamic WTA are analyzed and directions for the future research on dynamic WTA are discussed.

  19. Coordinated scheduling for dynamic real-time systems

    Science.gov (United States)

    Natarajan, Swaminathan; Zhao, Wei

    1994-01-01

    In this project, we addressed issues in coordinated scheduling for dynamic real-time systems. In particular, we concentrated on design and implementation of a new distributed real-time system called R-Shell. The design objective of R-Shell is to provide computing support for space programs that have large, complex, fault-tolerant distributed real-time applications. In R-shell, the approach is based on the concept of scheduling agents, which reside in the application run-time environment, and are customized to provide just those resource management functions which are needed by the specific application. With this approach, we avoid the need for a sophisticated OS which provides a variety of generalized functionality, while still not burdening application programmers with heavy responsibility for resource management. In this report, we discuss the R-Shell approach, summarize the achievement of the project, and describe a preliminary prototype of R-Shell system.

  20. Dynamic Planning of Experiments for the Optimisation of Managerial Scheduling

    Directory of Open Access Journals (Sweden)

    Tomáš Macák

    2016-01-01

    Full Text Available Time management has a crucial role in organizations and also in our personal lives. Managerial scheduling is an important tool for the time management, especially It can serve as a tool for the first phase, of time management - namely for effective planning. This paper focusses on finding the best possible setting for determining significant the best layout for activities according to the criteria of urgency and importance using a modified steepest ascent method, which can be referred as dynamic scheduling. This term indicates the nature of the method; wherein the experimental design space is changed to look for the best conditions for adjustment factors influencing a managerial process. Existing methods for layout optimization mentioned in the literature and conventionally implemented in practice have only shown local optima.

  1. User-Assisted Store Recycling for Dynamic Task Graph Schedulers

    Energy Technology Data Exchange (ETDEWEB)

    Kurt, Mehmet Can [Quantcast Corporation, San Francisco, CA; Krishnamoorthy, Sriram [Pacific Northwest National Laboratory, Richland, WA; Agrawal, Gagan [The Ohio State University, Neil Avenue Columbus, OH; Ren, Bin [The College of William and Mary, Williamsburg, VA

    2016-12-28

    The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

  2. The GBT Dynamic Scheduling System: Powered by the Web

    Science.gov (United States)

    Marganian, P.; Clark, M.; McCarty, M.; Sessoms, E.; Shelton, A.

    2009-09-01

    The web technologies utilized for the Robert C. Byrd Green Bank Telescope's (GBT) new Dynamic Scheduling System are discussed, focusing on languages, frameworks, and tools. We use a popular Python web framework, TurboGears, to take advantage of the extensive web services the system provides. TurboGears is a model-view-controller framework, which aggregates SQLAlchemy, Genshi, and CherryPy respectively. On top of this framework, Javascript (Prototype, script.aculo.us, and JQuery) and cascading style sheets (Blueprint) are used for desktop-quality web pages.

  3. Hydrothermal scheduling via extended differential dynamic programming and mixed coordination

    Energy Technology Data Exchange (ETDEWEB)

    Tang, J. [Alfred Univ., NY (United States). Div. of Electrical Engineering; Luh, P.B. [Univ. of Connecticut, Storrs, CT (United States). Dept. of Electrical and Systems Engineering

    1995-11-01

    This paper addresses short-term scheduling of hydrothermal systems by using extended differential dynamic programming and mixed coordination. The problem is first decomposed into a thermal subproblem and a hydro subproblem by relaxing the supply-demand constraints. The thermal subproblem is solved analytically. The hydro subproblem is further decomposed into a set of smaller problems that can be solved in parallel. Extended differential dynamic programming and mixed coordination are used to solve the hydro subproblem. Two problems are tested and the results show that the new approach performs well under a simulated parallel processing environment, and high speedup is obtained. The method is then extended to handle unpredictable changes in natural inflow by utilizing the variational feedback nature of the control strategy. A quick estimate on the impact of an unpredictable change on total cost is also obtained. Numerical results show that estimates are accurate, and unpredictable change in natural inflow can be quickly and effectively handled.

  4. Throughput optimization for dual collaborative spectrum sensing with dynamic scheduling

    Science.gov (United States)

    Cui, Cuimei; Yang, Dezhi

    2017-07-01

    Cognitive radio technology is envisaged to alleviate both spectrum inefficiency and spectrum scarcity problems by exploiting the existing licensed spectrum opportunistically. However, cognitive radio ad hoc networks (CRAHNs) impose unique challenges due to the high dynamic scheduling in the available spectrum, diverse quality of service (QOS) requirements, as well as hidden terminals and shadow fading issues in a harsh radio environment. To solve these problems, this paper proposes a dynamic and variable time-division multiple-access scheduling mechanism (DV-TDMA) incorporated with dual collaborative spectrum sensing scheme for CRAHNs. This study involves the cross-layered cooperation between the Physical (PHY) layer and Medium Access Control (MAC) layer under the consideration of average sensing time, sensing accuracy and the average throughput of cognitive radio users (CRs). Moreover, multiple-objective optimization algorithm is proposed to maximize the average throughput of CRs while still meeting QOS requirements on sensing time and detection error. Finally, performance evaluation is conducted through simulations, and the simulation results reveal that this optimization algorithm can significantly improve throughput and sensing accuracy and reduce average sensing time.

  5. Adaptive Dynamic Process Scheduling on Distributed Memory Parallel Computers

    Directory of Open Access Journals (Sweden)

    Wei Shu

    1994-01-01

    Full Text Available One of the challenges in programming distributed memory parallel machines is deciding how to allocate work to processors. This problem is particularly important for computations with unpredictable dynamic behaviors or irregular structures. We present a scheme for dynamic scheduling of medium-grained processes that is useful in this context. The adaptive contracting within neighborhood (ACWN is a dynamic, distributed, load-dependent, and scalable scheme. It deals with dynamic and unpredictable creation of processes and adapts to different systems. The scheme is described and contrasted with two other schemes that have been proposed in this context, namely the randomized allocation and the gradient model. The performance of the three schemes on an Intel iPSC/2 hypercube is presented and analyzed. The experimental results show that even though the ACWN algorithm incurs somewhat larger overhead than the randomized allocation, it achieves better performance in most cases due to its adaptiveness. Its feature of quickly spreading the work helps it outperform the gradient model in performance and scalability.

  6. Humanoid Walking Robot: Modeling, Inverse Dynamics, and Gain Scheduling Control

    Directory of Open Access Journals (Sweden)

    Elvedin Kljuno

    2010-01-01

    Full Text Available This article presents reference-model-based control design for a 10 degree-of-freedom bipedal walking robot, using nonlinear gain scheduling. The main goal is to show concentrated mass models can be used for prediction of the required joint torques for a bipedal walking robot. Relatively complicated architecture, high DOF, and balancing requirements make the control task of these robots difficult. Although linear control techniques can be used to control bipedal robots, nonlinear control is necessary for better performance. The emphasis of this work is to show that the reference model can be a bipedal walking model with concentrated mass at the center of gravity, which removes the problems related to design of a pseudo-inverse system. Another significance of this approach is the reduced calculation requirements due to the simplified procedure of nominal joint torques calculation. Kinematic and dynamic analysis is discussed including results for joint torques and ground force necessary to implement a prescribed walking motion. This analysis is accompanied by a comparison with experimental data. An inverse plant and a tracking error linearization-based controller design approach is described. We propose a novel combination of a nonlinear gain scheduling with a concentrated mass model for the MIMO bipedal robot system.

  7. The GBT Dynamic Scheduling System: Development and Testing

    Science.gov (United States)

    McCarty, M.; Clark, M.; Marganian, P.; O'Neil, K.; Shelton, A.; Sessoms, E.

    2009-09-01

    During the summer trimester of 2008, all observations on the Robert C. Byrd Green Bank Telescope (GBT) were scheduled using the new Dynamic Scheduling System (DSS). Beta testing exercised the policies, algorithms, and software developed for the DSS project. Since observers are located all over the world, the DSS was implemented as a web application. Technologies such as iCalendar, Really Simple Syndication (RSS) feeds, email, and instant messaging are used to transfer as much or as little information to observers as they request. We discuss the software engineering challenges leading to our implementation such as information distribution and building rich user interfaces in the web browser. We also relate our adaptation of agile development practices to design and develop the DSS. Additionally, we describe handling differences in expected versus actual initial conditions in the pool of project proposals for the 08B trimester. We then identify lessons learned from beta testing and present statistics on how the DSS was used during the trimester.

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

  9. Evolutionary decision-makings for the dynamic weapon-target assignment problem

    Institute of Scientific and Technical Information of China (English)

    CHEN Jie; XIN Bin; PENG ZhiHong; DOU LiHua; ZHANG Juan

    2009-01-01

    The dynamic weapon-target assignment (DWTA) problem is an important issue In the field of military command and control.An asset-based DWTA optimization model was proposed with four kinds of constraints considered,including capability constraints,strategy constraints,resource constraints and engagement feasibility constraints.A general "virtual"representation of decisions was presented to facilitate the generation of feasible decisions.The representation is in essence the permutation of all assignment pairs.A construction procedure converts the permutations into real feasible decisions.In order to solve this problem,three evolutionary decision-making algorithms,Including a genetic algorithm and two memeitc algorithms,were developed.Experimental results show that the memetic algorithm based on greedy local search can generate obviously better DWTA decisions,especially for large-scale problems,than the genetic algorithm and the memetic algorithm based on steepest local search.

  10. 坦克分队动态火力优化配置建模%Research on the Model of Dynamic Weapon Target Assignment for Tank Unit

    Institute of Scientific and Technical Information of China (English)

    徐克虎; 黄大山; 王天召

    2013-01-01

      充分考虑信息化战场上坦克分队战斗中我方作战单元、目标及战场环境等因素的影响,依据火力单元的战场感知能力、射击命中概率与目标的防护能力、战场价值确定射击价值,依据火力单元的战场机动时间和射击预留时间确定射击时机,建立动态火力优化配置模型。%The weapon and environment features in informationization battlefield have been considered sufficiently to analyse shooting value and shooting time. The shooting value was determined by the battlefield awareness ability and hit probability of fire unit and the protection ability and battlefield value of target. The shooting time was determined by the appointed-motion time and scheduled time of fire unit. The model of dynamic weapon target assignment has been established based on the two above-mentioned elements.

  11. Characteristic specific prioritized dynamic average burst round robin scheduling for uniprocessor and multiprocessor environment

    OpenAIRE

    Dash, Amar Ranjan; Sahu, Sandipta kumar; Samantra, Sanjay Kumar; Sabat, Sradhanjali

    2015-01-01

    CPU scheduling is one of the most crucial operations performed by operating systems. Different conventional algorithms like FCFS, SJF, Priority, and RR (Round Robin) are available for CPU Scheduling. The effectiveness of Priority and Round Robin scheduling algorithm completely depends on selection of priority features of processes and on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as CSPDABRR (Characteristic specific Prioritized Dynamic Av...

  12. System Level Analysis of Dynamic User-Centric Scheduling for a Flexible 5G Design

    DEFF Research Database (Denmark)

    Pedersen, Klaus I.; Niparko, Maciej; Steiner, Jens;

    2016-01-01

    In this paper we present our latest findings on dynamic user-centric scheduling for a flexible 5G radio design, capable of serving users with highly diverse QoS requirements. The benefits of being able to schedule users with different transmission time intervals (TTIs) are demonstrated...... to the conclusion that a future 5G design shall include support for dynamic scheduling with different TTI sizes to achieve the best performance....

  13. Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems

    Science.gov (United States)

    Sun, Wei; Yu, Chen; Défago, Xavier; Inoguchi, Yasushi

    The scheduling of real-time tasks with fault-tolerant requirements has been an important problem in multiprocessor systems. The primary-backup (PB) approach is often used as a fault-tolerant technique to guarantee the deadlines of tasks despite the presence of faults. In this paper we propose a dynamic PB-based task scheduling approach, wherein an allocation parameter is used to search the available time slots for a newly arriving task, and the previously scheduled tasks can be re-scheduled when there is no available time slot for the newly arriving task. In order to improve the schedulability we also propose an overloading strategy for PB-overloading and Backup-backup (BB) overloading. Our proposed task scheduling algorithm is compared with some existing scheduling algorithms in the literature through simulation studies. The results have shown that the task rejection ratio of our real-time task scheduling algorithm is almost 50% lower than the compared algorithms.

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

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

  16. Adaptive workflow scheduling in grid computing based on dynamic resource availability

    Directory of Open Access Journals (Sweden)

    Ritu Garg

    2015-06-01

    Full Text Available Grid computing enables large-scale resource sharing and collaboration for solving advanced science and engineering applications. Central to the grid computing is the scheduling of application tasks to the resources. Various strategies have been proposed, including static and dynamic strategies. The former schedules the tasks to resources before the actual execution time and later schedules them at the time of execution. Static scheduling performs better but it is not suitable for dynamic grid environment. The lack of dedicated resources and variations in their availability at run time has made this scheduling a great challenge. In this study, we proposed the adaptive approach to schedule workflow tasks (dependent tasks to the dynamic grid resources based on rescheduling method. It deals with the heterogeneous dynamic grid environment, where the availability of computing nodes and links bandwidth fluctuations are inevitable due to existence of local load or load by other users. The proposed adaptive workflow scheduling (AWS approach involves initial static scheduling, resource monitoring and rescheduling with the aim to achieve the minimum execution time for workflow application. The approach differs from other techniques in literature as it considers the changes in resources (hosts and links availability and considers the impact of existing load over the grid resources. The simulation results using randomly generated task graphs and task graphs corresponding to real world problems (GE and FFT demonstrates that the proposed algorithm is able to deal with fluctuations of resource availability and provides overall optimal performance.

  17. A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

    Science.gov (United States)

    Xie, Zhiqiang; Shao, Xia; Xin, Yu

    2016-01-01

    To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

  18. Imaging-Duration Embedded Dynamic Scheduling of Earth Observation Satellites for Emergent Events

    Directory of Open Access Journals (Sweden)

    Xiaonan Niu

    2015-01-01

    Full Text Available We present novel two-stage dynamic scheduling of earth observation satellites to provide emergency response by making full use of the duration of the imaging task execution. In the first stage, the multiobjective genetic algorithm NSGA-II is used to produce an optimal satellite imaging schedule schema, which is robust to dynamic adjustment as possible emergent events occur in the future. In the second stage, when certain emergent events do occur, a dynamic adjusting heuristic algorithm (CTM-DAHA is applied to arrange new tasks into the robust imaging schedule. Different from the existing dynamic scheduling methods, the imaging duration is embedded in the two stages to make full use of current satellite resources. In the stage of robust satellite scheduling, total task execution time is used as a robust indicator to obtain a satellite schedule with less imaging time. In other words, more imaging time is preserved for future emergent events. In the stage of dynamic adjustment, a compact task merging strategy is applied to combine both of existing tasks and emergency tasks into a composite task with least imaging time. Simulated experiments indicate that the proposed method can produce a more robust and effective satellite imaging schedule.

  19. Fuzzy-Based Dynamic Distributed Queue Scheduling for Packet Switched Networks

    Institute of Scientific and Technical Information of China (English)

    Chollette C.Chude-Olisah; Uche A.K.Chude-Okonkwo; Kamalrulnizam A.Balar; Ghazali Sulong

    2013-01-01

    Addressing the problem of queue scheduling for the packet-switched system is a vital aspect of congestion control.In this paper,the fuzzy logic based decision method is adopted for queue scheduling in order to enforce some level of control for traffic of different quality of service requirements using predetermined values.The fuzzy scheduler proposed in this paper takes into account the dynamic nature of the Internet traffic with respect to its time-varying packet arrival process that affects the network states and performance.Three queues are defined,viz low,medium and high priority queues.The choice of prioritizing packets influences how queues are served.The fuzzy scheduler not only utilizes queue priority in the queue scheduling scheme,but also considers packet drop susceptibility and queue limit.Through simulation it is shown that the fuzzy scheduler is more appropriate for the dynamic nature of Internet traffic in a packet-switched system as compared with some existing queue scheduling methods.Results show that the scheduling strategy of the proposed fuzzy scheduler reduces packet drop,provides good link utilization and minimizes queue delay as compared with the priority queuing (PQ),first-in-first-out (FIFO),and weighted fair queuing (WFQ).

  20. Dynamic scheduling and analysis of real time systems with multiprocessors

    Directory of Open Access Journals (Sweden)

    M.D. Nashid Anjum

    2016-08-01

    Full Text Available This research work considers a scenario of cloud computing job-shop scheduling problems. We consider m realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met, and the profit of processing a packet of a job differs from other jobs. Moreover, considered deadlines are either hard or soft and a penalty is applied if a deadline is missed where the penalty is considered as an exponential function of time. The scheduling problem has been formulated as a mixed integer non-linear programming problem whose objective is to maximize net-profit. The formulated problem is computationally hard and not solvable in deterministic polynomial time. This research work proposes an algorithm named the Tube-tap algorithm as a solution to this scheduling optimization problem. Extensive simulation shows that the proposed algorithm outperforms existing solutions in terms of maximizing net-profit and preserving deadlines.

  1. Real-time and dynamic schedule optimization of construction projects on the basis of lean construction

    Institute of Scientific and Technical Information of China (English)

    QI Shen-jun; DING Lie-yun; LUO Han-bin; DONG Xiao-yan

    2007-01-01

    Lean construction has been newly applied to construction industry. The best performance of a project can be achieved through the precise definition of construction product, rational work break structure, lean supply chain, decrease of resources waste, objective control and so forth. Referring to the characteristics of schedule planning of construction projects and lean construction philosophy, we proposed optimizing methodology of real-time and dynamic schedule of construction projects based on lean construction. The basis of the methodology is process reorganization and lean supply in construction enterprises. The traditional estimating method of the activity duration is fuzzy and random; however, a newly proposed lean forecasting method employs multi-components linear-regression, back-propagation artificial neural networks and learning curve. Taking account of the limited resources and the fixed duration of a project, the optimizing method of the real-time and dynamic schedule adopts the concept of resource driving. To optimize the schedule of a construction project timely and effectively, an intellectualized schedule management system was developed. It can work out the initial schedule, optimize the real-time and dynamic schedule, and display the schedule with the Gant Chart, the net-work graph and the space-time line chart. A case study was also presented to explain the proposed method.

  2. Dynamic Task-Scheduling in Grid Computing using Prioritized Round Robin Algorithm

    Directory of Open Access Journals (Sweden)

    Sunita Bansal

    2011-03-01

    Full Text Available Over the years, grid computing has emerged as one of the most viable and scalable alternatives to high performance supercomputing, tapping into computing power of the order of Gigaflops. However, the inherent dynamicity in grid computing has made it extremely difficult to come up with near-optimal solutions to efficiently schedule tasks in grids. The present paper proposes a novel grid-scheduling heuristic that adaptively and dynamically schedules tasks without requiring any prior information on the workload of incoming tasks. The approach models the grid system in the form of a state-transition diagram, employing a prioritized round-robin algorithm with task replication to optimally schedule tasks, using prediction information on processor utilization of individual nodes. Simulations, comparing the proposed approach with the round-robin heuristic, have shown the given heuristic to be more effective in scheduling tasks as compared to the latter.

  3. HOLD MODE BASED DYNAMIC PRIORITY LOAD ADAPTIVE INTERPICONET SCHEDULING FOR BLUETOOTH SCATTERNETS

    Directory of Open Access Journals (Sweden)

    G.S. Mahalakshmi

    2011-09-01

    Full Text Available Scheduling in piconets has emerged as a challenging research area. Interpiconet scheduling focuses on when a bridge is switched among various piconets and how a bridge node communicates with the masters in different piconets. This paper proposes an interpiconet scheduling algorithm named, hold mode based dynamic traffic priority load adaptive scheduling. The bridges are adaptively switched between the piconets according to various traffic loads. The main goal is to maximize the utilization of the bridge by reducing the bridge switch wastes, utilize intelligent decision making algorithm, resolve conflict between the masters, and allow negotiation for bridge utilization in HDPLIS using bridge failure-bridge repair procedure . The Hold mode - dynamic traffic - priority based - load adaptive scheduling reduces the number of bridge switch wastes and hence increases the efficiency of the bridge which results in increased performance of the system.

  4. Scheduling Performance Evaluation of Logistics Service Supply Chain Based on the Dynamic Index Weight

    Directory of Open Access Journals (Sweden)

    Weihua Liu

    2014-01-01

    Full Text Available Scheduling is crucial to the operation of logistics service supply chain (LSSC, so scientific performance evaluation method is required to evaluate the scheduling performance. Different from general project performance evaluation, scheduling activities are usually continuous and multiperiod. Therefore, the weight of scheduling performance evaluation index is not unchanged, but dynamically varied. In this paper, the factors that influence the scheduling performance are analyzed in three levels which are strategic environment, operating process, and scheduling results. Based on these three levels, the scheduling performance evaluation index system of LSSC is established. In all, a new performance evaluation method proposed based on dynamic index weight will have three innovation points. Firstly, a multiphase dynamic interaction method is introduced to improve the quality of quantification. Secondly, due to the large quantity of second-level indexes and the requirements of dynamic weight adjustment, the maximum attribute deviation method is introduced to determine weight of second-level indexes, which can remove the uncertainty of subjective factors. Thirdly, an adjustment coefficient method based on set-valued statistics is introduced to determine the first-level indexes weight. In the end, an application example from a logistics company in China is given to illustrate the effectiveness of the proposed method.

  5. Hybrid static/dynamic scheduling for already optimized dense matrix factorization

    CERN Document Server

    Donfack, Simplice; Gropp, William D; Kale, Vivek

    2011-01-01

    We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully static scheduling. On a 16-core Intel Xeon machine, our hybrid static/dynamic scheduling approach is up to 8% faster than the version of CALU that uses a fully static scheduling or fully dynamic scheduling. Our algorithm leads to speedups over the corresponding routines for computing LU factorization in well known libraries. On the 48 core AMD NUMA machine, our best implementation is up to 110% faster than MKL, while on...

  6. Humanoid Walking Robot: Modeling, Inverse Dynamics, and Gain Scheduling Control

    OpenAIRE

    Elvedin Kljuno; Williams, Robert L.

    2010-01-01

    This article presents reference-model-based control design for a 10 degree-of-freedom bipedal walking robot, using nonlinear gain scheduling. The main goal is to show concentrated mass models can be used for prediction of the required joint torques for a bipedal walking robot. Relatively complicated architecture, high DOF, and balancing requirements make the control task of these robots difficult. Although linear control techniques can be used to control bipedal robots, nonlinear control is n...

  7. Dynamic Resource Management and Job Scheduling for High Performance Computing

    OpenAIRE

    2016-01-01

    Job scheduling and resource management plays an essential role in high-performance computing. Supercomputing resources are usually managed by a batch system, which is responsible for the effective mapping of jobs onto resources (i.e., compute nodes). From the system perspective, a batch system must ensure high system utilization and throughput, while from the user perspective it must ensure fast response times and fairness when allocating resources across jobs. Parallel jobs can be divide...

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

  9. DYNAMIC ADVANCED PLANNING AND SCHEDULING WITH FROZEN INTERVAL FOR NEW ORDERS

    Institute of Scientific and Technical Information of China (English)

    CHEN Kejia; JI Ping

    2007-01-01

    A dynamic advanced planning and scheduling (DAPS) problem is addressed where new Orders arrive on a continuous basis. A periodic policy with frozen interval is adopted to increase stability on the shop floor. A genetic algorithm is developed to find a schedule at each rescheduling point for both original Orders and new orders that both production idle time and penalties on tardiness and earliness of orders are minimized. The proposed methodology is tested on a small example to illustrate the effect of the frozen interval. The results indicate that the suggested approach can improve the schedule stability while retaining efficiency.

  10. Dynamic Environmental/Economic Scheduling for Microgrid Using Improved MOEA/D-M2M

    Directory of Open Access Journals (Sweden)

    Xin Li

    2016-01-01

    Full Text Available The environmental/economic dynamic scheduling for microgrids (MGs is a complex multiobjective optimization problem, which usually has dynamic system parameters and constraints. In this paper, a biobjective optimization model of MG scheduling is established. And various types of microsources (like the conventional sources, various types of renewable sources, etc., electricity markets, and dynamic constraints are considered. A recently proposed MOEA/D-M2M framework is improved (I-MOEA/D-M2M to solve the real-world MG scheduling problems. In order to deal with the constraints, the processes of solutions sorting and selecting in the original MOEA/D-M2M are revised. In addition, a self-adaptive decomposition strategy and a modified allocation method of individuals are introduced to enhance the capability of dealing with uncertainties, as well as reduce unnecessary computational work in practice and meet the time requirements for the dynamic optimization tasks. Thereafter, the proposed I-MOEA/D-M2M is applied to the independent MG scheduling problems, taking into account the load demand variation and the electricity price changes. The simulation results by MATLAB show that the proposed method can achieve better distributed fronts in much less running time than the typical multiobjective evolutionary algorithms (MOEAs like the improved strength Pareto evolutionary algorithm (SPEA2 and the nondominated sorting genetic algorithm II (NSGAII. Finally, I-MOEA/D-M2M is used to solve a 24-hour MG dynamic operation scheduling problem and obtains satisfactory results.

  11. Multi-Satellite Scheduling Approach for Dynamic Areal Tasks Triggered by Emergent Disasters

    Science.gov (United States)

    Niu, X. N.; Zhai, X. J.; Tang, H.; Wu, L. X.

    2016-06-01

    The process of satellite mission scheduling, which plays a significant role in rapid response to emergent disasters, e.g. earthquake, is used to allocate the observation resources and execution time to a series of imaging tasks by maximizing one or more objectives while satisfying certain given constraints. In practice, the information obtained of disaster situation changes dynamically, which accordingly leads to the dynamic imaging requirement of users. We propose a satellite scheduling model to address dynamic imaging tasks triggered by emergent disasters. The goal of proposed model is to meet the emergency response requirements so as to make an imaging plan to acquire rapid and effective information of affected area. In the model, the reward of the schedule is maximized. To solve the model, we firstly present a dynamic segmenting algorithm to partition area targets. Then the dynamic heuristic algorithm embedding in a greedy criterion is designed to obtain the optimal solution. To evaluate the model, we conduct experimental simulations in the scene of Wenchuan Earthquake. The results show that the simulated imaging plan can schedule satellites to observe a wider scope of target area. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

  12. Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment

    Directory of Open Access Journals (Sweden)

    Pradeep Kumar Yadav

    2008-01-01

    Full Text Available Distributed computing systems [DCSs] offer the potential for improved performance and resource sharing. To make the best use of the computational power available, it is essential to assign the tasks dynamically to that processor whose characteristics are most appropriate for the execution of the tasks in distributed processing system. We have developed a mathematical model for allocating “M” tasks of distributed program to “N” multiple processors (M>N that minimizes the total cost of the program. Relocating the tasks from one processor to another at certain points during the course of execution of the program that contributes to the total cost of the running program has been taken into account. Phasewise execution cost [EC], intertask communication cost [ITCT], residence cost [RC] of each task on different processors, and relocation cost [REC] for each task have been considered while preparing a dynamic tasks allocation model. The present model is suitable for arbitrary number of phases and processors with random program structure.

  13. Efficient Academic Scheduling at the U.S. Naval Academy

    Science.gov (United States)

    2006-05-31

    courses consecutively, such as Plebe Chemistry and Calculus. Once these factors have been determined and prioritized, a schedule can be formed. Note...Leadership II Slot 3: Criminal Justice, Chemistry PARENT 2 Slot 1: Chemistry, Dynamics Slot 2: Criminal Justice, Plebe Navigation...Slot 3: Statistics, Weapons CHILD: ROUND 1 Slot 1: Calculus, IR Slot 2: Criminal Justice, Plebe Navigation Slot 3: Chemistry

  14. Enhanced Precedence Scheduling Algorithm with Dynamic Time Quantum (EPSADTQ

    Directory of Open Access Journals (Sweden)

    G. Siva Nageswara Rao

    2015-07-01

    Full Text Available This study proposes a new algorithm which is a logical extension of the popular Round Robin CPU scheduling algorithm. The Round Robin algorithm can be effective only if the time quantum is chosen accurately. Even by taking mean average of burst times as time quantum, the performance of the RR cannot be improved beyond a certain point. However, the novel method proposed here, suggests that a priority be assigned to each process based on balanced precedence factor. The novel method also uses mean average as a time quantum. Experiments are conducted in order to measure the effectiveness of this novel method. The results clearly showed that EPSADTQ is superior to RR and PSMTQ and its variants. EPSADTQ resulted in a significant reduction of the no. of context switches, average waiting time and average turnaround time.

  15. Special Weapons

    Data.gov (United States)

    Federal Laboratory Consortium — Supporting Navy special weapons, the division provides an array of engineering services, technical publication support services, logistics support services, safety...

  16. A Forager Bee’s Intelligence Inspired Dynamic Queue Scheduling for the Internet Traffic

    Directory of Open Access Journals (Sweden)

    M. A. Bhagyaveni

    2012-01-01

    Full Text Available Problem statement: In the present evolution of large scale internet communication, per flow control scheme faces scalability issue due to tremendous number of flows. The aggregation based approaches such as differentiated architecture relieve the storage of state of flows in core router. TCP is the dominating protocol that carries majority of the total internet traffic. Recent internet traffic measurement shows most of the TCP flows are short lived. The performance improvement in the internet traffic can be achieved by the advantages of scheduling algorithms to favor short TCP flows first However long TCP flows competing against short TCP flows starve at some point. Approach: In this study we propose aggregation based scheduling algorithm namely Guaranteed Dynamic Queue Scheduling (G-DQS that estimates the available bandwidth of the network using the forager bee’s intelligence for providing guaranteed throughput. In addition, G-DQS algorithm is proposed to favor the short TCP flows without penalizing the performance of long flows using dynamic scheduling ratio. Results: Simulation of the proposed scheduling method show that mean transmission time of flows and packet loss significantly decrease in comparison with FIFO and RuN2C. Conclusion: Proposed forager bee’s intelligence inspired scheduling approach achieves the guaranteed throughput in the large scale network.

  17. Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments

    CERN Document Server

    Fu, Fangwen

    2010-01-01

    In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate the dynamic scheduling problem as a Markov decision process (MDP) that explicitly considers the users' heterogeneous multimedia data characteristics (e.g. delay deadlines, distortion impacts and dependencies etc.) and time-varying channel conditions, which are not simultaneously considered in state-of-the-art packet scheduling algorithms. This formulation allows us to perform foresighted decisions to schedule multiple data units for transmission at each time in order to optimize the long-term utilities of the multimedia applications. The heterogeneity of the media data enables us to express the transmission priorities between the different data units as a priority graph, which is a directed acyclic graph (DAG). This priority graph provides us with an elegant structure to decompose the multi-data unit foresighted decision at each time i...

  18. A New Efficient Dynamic System Information Scheduling Strategy in TDD-LTE

    Directory of Open Access Journals (Sweden)

    Zhiyuan Shi

    2013-09-01

    Full Text Available The TDD-LTE system information which is also necessary to communicate each other well is a kind of important message between user equipment(UE and eNodeB. Some important parameters are provided by system information to enable the UE to camp on a cell normally and access to common channel. The system information,of course,can provide the mobility management for UE in idle mode.  On the base station side, there are two kinds of scheduling methods of in the TDD-LTE system, and they are fixed scheduling and dynamic scheduling. The MasterInformationBlock (MIB and the System Information Block Type1 use the fixed scheduling,while the dynamic scheduling is applied to other System Information Blocks (SIB2~SIB13; and these system information are transmitted on the Downlink Shared Channel(DL-SCH. In consideration of using the radio resources reasonably and not affecting other downlink transmitted data,we proposed a dynamic scheduling strategy of system information based on the base station side.  

  19. Chemical process dynamic optimization based on the differential evolution algorithm with an adaptive scheduling mutation strategy

    Science.gov (United States)

    Zhu, Jun; Yan, Xuefeng; Zhao, Weixiang

    2013-10-01

    To solve chemical process dynamic optimization problems, a differential evolution algorithm integrated with adaptive scheduling mutation strategy (ASDE) is proposed. According to the evolution feedback information, ASDE, with adaptive control parameters, adopts the round-robin scheduling algorithm to adaptively schedule different mutation strategies. By employing an adaptive mutation strategy and control parameters, the real-time optimal control parameters and mutation strategy are obtained to improve the optimization performance. The performance of ASDE is evaluated using a suite of 14 benchmark functions. The results demonstrate that ASDE performs better than four conventional differential evolution (DE) algorithm variants with different mutation strategies, and that the whole performance of ASDE is equivalent to a self-adaptive DE algorithm variant and better than five conventional DE algorithm variants. Furthermore, ASDE was applied to solve a typical dynamic optimization problem of a chemical process. The obtained results indicate that ASDE is a feasible and competitive optimizer for this kind of problem.

  20. The GBT Dynamic Scheduling System: ``When do I observe?'' Guiding Users' Expectations

    Science.gov (United States)

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

    2009-09-01

    Because of variable local weather in Green Bank, West Virginia, along with the wide frequency coverage of the Robert C. Byrd Green Bank Telescope (GBT), substantial improvement in efficient use of telescope time is possible by dynamically scheduling observers within a time range when weather forecasts are reliable; however, using the best forecasts would require observers to be constantly ``on-call.'' During the 2008 summer trimester beta testing, the GBT Dynamic Scheduling System (DSS) attempted to mitigate this inherent conflict by 1) compromising between the best weather forecasts vs. short-term observer notification and 2) providing earlier indicators of the likelihood of being selected by the scheduling algorithms. These indicators were derived from simulations based on Green Bank weather forecasts from previous years and from relative project rankings covering the entire time range of available weather forecasts. We report our experience on the generation of the information, its presentation, and its use by observers.

  1. [Biological weapons].

    Science.gov (United States)

    Kerwat, K; Becker, S; Wulf, H; Densow, D

    2010-08-01

    Biological weapons are weapons of mass destruction that use pathogens (bacteria, viruses) or the toxins produced by them to target living organisms or to contaminate non-living substances. In the past, biological warfare has been repeatedly used. Anthrax, plague and smallpox are regarded as the most dangerous biological weapons by various institutions. Nowadays it seems quite unlikely that biological warfare will be employed in any military campaigns. However, the possibility remains that biological weapons may be used in acts of bioterrorism. In addition all diseases caused by biological weapons may also occur naturally or as a result of a laboratory accident. Risk assessment with regard to biological danger often proves to be difficult. In this context, an early identification of a potentially dangerous situation through experts is essential to limit the degree of damage. Georg Thieme Verlag KG Stuttgart * New York.

  2. A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Lei Wang

    2017-01-01

    Full Text Available In real-world manufacturing systems, production scheduling systems are often implemented under random or dynamic events like machine failure, unexpected processing times, stochastic arrival of the urgent orders, cancellation of the orders, and so on. These dynamic events will lead the initial scheduling scheme to be nonoptimal and/or infeasible. Hence, appropriate dynamic rescheduling approaches are needed to overcome the dynamic events. In this paper, we propose a dynamic rescheduling method based on variable interval rescheduling strategy (VIRS to deal with the dynamic flexible job shop scheduling problem considering machine failure, urgent job arrival, and job damage as disruptions. On the other hand, an improved genetic algorithm (GA is proposed for minimizing makespan. In our improved GA, a mix of random initialization population by combining initialization machine and initialization operation with random initialization is designed for generating high-quality initial population. In addition, the elitist strategy (ES and improved population diversity strategy (IPDS are used to avoid falling into the local optimal solution. Experimental results for static and several dynamic events in the FJSP show that our method is feasible and effective.

  3. Associating Memory Through Case-Based Immune Mechanisms for Dynamic Job-Shop Scheduling

    Institute of Scientific and Technical Information of China (English)

    尹文君; 刘民; 吴澄

    2004-01-01

    Knowledge plays an active role in job-shop scheduling,especially in dynamic environments.A novel case-based immune framework was developed for static and dynamic job-shop problems,using the associative memory and knowledge reuse from case-based reasoning (CBR) and immune response mechanisms.A 2-level similarity index which combines both job routing and problem solution characteristics based on DNA matching ideas was defined for both the CBR and immune algorithms.A CBR-embedded immune algorithms (CBR-IAs) framework was then developed focusing on case retrieval and adaptation methods.In static environments,the CBR-IAs have excellent population diversity and fast convergence which are necessary for dynamic problems with jobs arriving and leaving continually.The results with dynamic scheduling problems further confirm the CBR-IAs effectiveness as a problem solving method with knowledge reuse.

  4. A DiffServ Supporting And Distributed Dynamic Dual Round Robin Scheduling Algorithm on DS-CICQ

    Science.gov (United States)

    Xiuqin, Li; Luoheng, Yan; Julong, Lan

    A distributed dynamic dual round robin scheduling algorithm (DSDRR) that can support differential services is presented. For each scheduler, the strategy of double pointer and round robin is adopted and scheduling complexity is substantially reduced. Its quantum function, related to the status of input queue and priority, is a traffic-adaptive dynamic scheduling mechanism and is rather sensitive to the changing network; therefore, it has the traits of dynamics and fairness. It can better support differential services and guarantee the realization of QoS.

  5. Dynamic Airline Scheduling: An Analysis of the Potentials of Refleeting and Retiming

    DEFF Research Database (Denmark)

    Warburg, Valdemar; Hansen, Troels G.; Larsen, Allan

    We present a Dynamic Airline Scheduling (DAS) technique which is able to change departure times and reassign aircraft types during the booking process to meet fluctuating passenger demands. The procedure is tested on several different days before departure, resulting in a significant profit...... increase for a major European airline. The results also indicate that applying DAS close to departure yields the largest potential....

  6. Dynamic Airline Scheduling: An Analysis of the Potentials of Refleeting and Retiming

    DEFF Research Database (Denmark)

    Warburg, Valdemar; Hansen, Troels G.; Larsen, Allan

    2008-01-01

    We present a Dynamic Airline Scheduling (DAS) technique which is able to change departure times and reassign aircraft types during the booking process to meet fluctuating passenger demands. The procedure is tested on several different days before departure, resulting in a significant profit...... increase for a major European airline. The results also indicate that applying DAS close to departure yields the largest potential....

  7. Dynamic Airline Scheduling: An Analysis of the Potentials of Refleeting and Retiming

    DEFF Research Database (Denmark)

    Warburg, Valdemar; Hansen, Troels G.; Larsen, Allan

    2008-01-01

    We present a Dynamic Airline Scheduling (DAS) technique which is able to change departure times and reassign aircraft types during the booking process to meet fluctuating passenger demands. The procedure is tested on several different days before departure, resulting in a significant profit...

  8. Heuristics in dynamic scheduling: a practical framework with a case study in elevator dispatching

    NARCIS (Netherlands)

    De Jong, J.L.

    2012-01-01

    Dynamic scheduling problems are ubiquitous: traffic lights, elevators, planning of manufacturing plants, air traffic control, etc. Tasks have to be put on a timeline as smart as possible to reach certain goals. These goals may be related to production costs, the use of (scarce) resources, deadlines.

  9. An FMS Dynamic Production Scheduling Algorithm Considering Cutting Tool Failure and Cutting Tool Life

    Science.gov (United States)

    Setiawan, A.; Wangsaputra, R.; Martawirya, Y. Y.; Halim, A. H.

    2016-02-01

    This paper deals with Flexible Manufacturing System (FMS) production rescheduling due to unavailability of cutting tools caused either of cutting tool failure or life time limit. The FMS consists of parallel identical machines integrated with an automatic material handling system and it runs fully automatically. Each machine has a same cutting tool configuration that consists of different geometrical cutting tool types on each tool magazine. The job usually takes two stages. Each stage has sequential operations allocated to machines considering the cutting tool life. In the real situation, the cutting tool can fail before the cutting tool life is reached. The objective in this paper is to develop a dynamic scheduling algorithm when a cutting tool is broken during unmanned and a rescheduling needed. The algorithm consists of four steps. The first step is generating initial schedule, the second step is determination the cutting tool failure time, the third step is determination of system status at cutting tool failure time and the fourth step is the rescheduling for unfinished jobs. The approaches to solve the problem are complete-reactive scheduling and robust-proactive scheduling. The new schedules result differences starting time and completion time of each operations from the initial schedule.

  10. Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chih-Yu Wen

    2009-05-01

    Full Text Available This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

  11. Dynamic Fair Priority Optimization Task Scheduling Algorithm in Cloud Computing: Concepts and Implementations

    Directory of Open Access Journals (Sweden)

    Deepika Saxena

    2016-02-01

    Full Text Available Cloud computing has become buzzword today. It is a digital service where dynamically scalable and virtualized resources are provided as a service over internet. Task scheduling is premier research topic in cloud computing. It is always a challenging task to map variety of complex task on various available heterogenous resources in scalable and efficient way. The very objective of this paper is to dynamically optimize task scheduling at system level as well as user level. This paper relates benefit-fairness algorithm based on weighted-fair Queuing model which is much more efficient than simple priority queuing. In proposed algorithm, we have classified and grouped all tasks as deadline based and minimum cost based constraints and after dynamic optimization, priority of fairness is applied. Here different priority queue (high, mid, low are implemented in round-robin fashion as per weights assign to them .We recompile the CloudSim and simulate the proposed algorithm and results of this algorithm is compared with sequential task scheduling and simple constraints (cost and deadline based task scheduling algorithm. The experimental results indicates that proposed algorithm is, not only beneficial to user and service provider, but also provides better efficiency and fairness at priority level, i.e. benefit at system level.

  12. Dynamic scheduling with due dates and time windows: an application to chemotherapy patient appointment booking.

    Science.gov (United States)

    Gocgun, Yasin; Puterman, Martin L

    2014-03-01

    We study a scheduling problem in which arriving patients require appointments at specific future days within a treatment specific time window. This research is motivated by a study of chemotherapy scheduling practices at the British Columbia Cancer Agency (Canada). We formulate this problem as a Markov Decision Process (MDP). Since the resulting MDPs are intractable to exact methods, we employ linear-programming-based Approximate Dynamic Programming (ADP) to obtain approximate solutions. Using simulation, we compare the performance of the resulting ADP policies to practical and easy-to-use heuristic decision rules under diverse scenarios. The results indicate that ADP is promising in several scenarios, and that a specific easy-to-use heuristic performs well in the idealized chemotherapy scheduling setting we study.

  13. SWARM INTELLIGENCE BASED DYNAMIC REAL-TIME SCHEDULING APPROACH FOR SEMICONDUCTOR WAFER FAB

    Institute of Scientific and Technical Information of China (English)

    Li Li; Fei Qiao; Wu Qidi

    2005-01-01

    Based on the analysis of collective activities of ant colonies, the typical example of swarm intelligence, a new approach to construct swarm intelligence based multi-agent-system (SMAS) for dynamic real-time scheduling for semiconductor wafer fab is proposed. The relevant algorithm,pheromone-based dynamic real-time scheduling algorithm (PBDR), is given. MIMAC test bed data set mini-fab is used to compare PBDR with FIFO (first in first out), SRPT(shortest remaining processing time) and CR(critical ratio) under three different release rules, i.e. deterministic rule, Poisson rule and CONWIP (constant WIP). It is shown that PBDR is prior to FIFO, SRPT and CR with better performance of cycle time, throughput, and on-time delivery, especially for on-time delivery performance.

  14. A SCHEDULING SCHEME WITH DYNAMIC FREQUENCY CLOCKING AND MULTIPLE VOLTAGES FOR LOW POWER DESIGNS

    Institute of Scientific and Technical Information of China (English)

    Wen Dongxin; Wang Ling; Yang Xiaozong

    2007-01-01

    In this letter, a scheduling scheme based on Dynamic Frequency Clocking (DFC) and multiple voltages is proposed for low power designs under the timing and the resource constraints.Unlike the conventional methods at high level synthesis where only voltages of nodes were considered,the scheme based on a gain function considers both voltage and frequency simultaneously to reduce energy consumption. Experiments with a number of DSP benchmarks show that the proposed scheme achieves an effective energy reduction.

  15. Fair Energy Scheduling for Vehicle-to-Grid Networks Using Adaptive Dynamic Programming.

    Science.gov (United States)

    Xie, Shengli; Zhong, Weifeng; Xie, Kan; Yu, Rong; Zhang, Yan

    2016-08-01

    Research on the smart grid is being given enormous supports worldwide due to its great significance in solving environmental and energy crises. Electric vehicles (EVs), which are powered by clean energy, are adopted increasingly year by year. It is predictable that the huge charge load caused by high EV penetration will have a considerable impact on the reliability of the smart grid. Therefore, fair energy scheduling for EV charge and discharge is proposed in this paper. By using the vehicle-to-grid technology, the scheduler controls the electricity loads of EVs considering fairness in the residential distribution network. We propose contribution-based fairness, in which EVs with high contributions have high priorities to obtain charge energy. The contribution value is defined by both the charge/discharge energy and the timing of the action. EVs can achieve higher contribution values when discharging during the load peak hours. However, charging during this time will decrease the contribution values seriously. We formulate the fair energy scheduling problem as an infinite-horizon Markov decision process. The methodology of adaptive dynamic programming is employed to maximize the long-term fairness by processing online network training. The numerical results illustrate that the proposed EV energy scheduling is able to mitigate and flatten the peak load in the distribution network. Furthermore, contribution-based fairness achieves a fast recovery of EV batteries that have deeply discharged and guarantee fairness in the full charge time of all EVs.

  16. Dynamic Scheduling of Skippable Periodic Tasks With Energy Efficiency In Weakly Hard Real-Time System

    Directory of Open Access Journals (Sweden)

    Santhi Baskaran

    2010-12-01

    Full Text Available Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between charges is an interesting challenge for system designers. Dynamic Voltage Scaling (DVS allows a processor to dynamically change speed and voltage at run time, thereby saving energy by spreading run cycles into idle time.Knowing when to use full power and when not, requires the cooperation of the operating system scheduler. Usually, higher processor voltage and frequency leads to higher system throughput whileenergy reduction can be obtained using lower voltage and frequency. Instead of lowering processorvoltage and frequency as much as possible, energy efficient real-time scheduling adjusts voltage andfrequency according to some optimization criteria, such as low energy consumption or high throughput,while it meets the timing constraints of the real-time tasks. As the quantity and functional complexity ofbattery powered portable devices continues to raise, energy efficient design of such devices has becomeincreasingly important. Many real-time scheduling algorithms have been developed recently to reduceenergy consumption in the portable devices that use DVS capable processors. Extensive power awarescheduling techniques have been published for energy reduction, but most of them have been focusedsolely on reducing the processor energy consumption. While the processor is one of the major powerhungry units in the system, other peripherals such as network interface card, memory banks, disks alsoconsume significant amount of power. Dynamic Power Down (DPD technique is used to reduce energyconsumption by shutting down the processing unit and peripheral devices, when the system is idle. Threealgorithms namely Red Tasks Only (RTO, Blue When Possible (BWP and Red as Late as Possible (RLPare proposed in the literature to schedule the real-time tasks in Weakly-hard real

  17. Dynamic task scheduling algorithm with load balancing for heterogeneous computing system

    Directory of Open Access Journals (Sweden)

    Doaa M. Abdelkader

    2012-07-01

    Full Text Available In parallel computation, the scheduling and mapping tasks is considered the most critical problem which needs High Performance Computing (HPC to solve it by breaking the problem into subtasks and working on those subtasks at the same time. The application sub tasks are assigned to underline machines and ordered for execution according to its proceeding to grantee efficient use of available resources such as minimize execution time and satisfy load balance between processors of the underline machine. The underline infrastructure may be homogeneous or heterogeneous. Homogeneous infrastructure could use the same machines power and performance. While heterogeneous infrastructure include machines differ in its performance, speed, and interconnection. According to work in this paper a new dynamic task scheduling algorithm for Heterogeneous called a Clustering Based HEFT with Duplication (CBHD have been developed. The CBHD algorithm is considered an amalgamation between the most two important task scheduling in Heterogeneous machine, The Heterogeneous Earliest Finish Time (HEFT and the Triplet Clustering algorithms. In the CBHD algorithm the duplication is required to improve the performance of algorithm. A comparative study among the developed CBHD, the HEFT, and the Triplet Cluster algorithms has been done. According to the comparative results, it is found that the developed CBHD algorithm satisfies better execution time than both HEFT algorithm and Triplet Cluster algorithm, and in the same time, it achieves the load balancing which considered one of the main performance factors in the dynamic environment.

  18. Swarm satellite mission scheduling & planning using Hybrid Dynamic Mutation Genetic Algorithm

    Science.gov (United States)

    Zheng, Zixuan; Guo, Jian; Gill, Eberhard

    2017-08-01

    Space missions have traditionally been controlled by operators from a mission control center. Given the increasing number of satellites for some space missions, generating a command list for multiple satellites can be time-consuming and inefficient. Developing multi-satellite, onboard mission scheduling & planning techniques is, therefore, a key research field for future space mission operations. In this paper, an improved Genetic Algorithm (GA) using a new mutation strategy is proposed as a mission scheduling algorithm. This new mutation strategy, called Hybrid Dynamic Mutation (HDM), combines the advantages of both dynamic mutation strategy and adaptive mutation strategy, overcoming weaknesses such as early convergence and long computing time, which helps standard GA to be more efficient and accurate in dealing with complex missions. HDM-GA shows excellent performance in solving both unconstrained and constrained test functions. The experiments of using HDM-GA to simulate a multi-satellite, mission scheduling problem demonstrates that both the computation time and success rate mission requirements can be met. The results of a comparative test between HDM-GA and three other mutation strategies also show that HDM has outstanding performance in terms of speed and reliability.

  19. Event-driven Dynamic and Intelligent Scheduling for Agile Manufacturing Based on Immune Mechanism and Expert System

    Institute of Scientific and Technical Information of China (English)

    李蓓智; 杨建国; 周亚勤; 邵世煌

    2003-01-01

    Based on the biological immune concept, immune response mechanism and expert system, a dynamic and intelligent scheduling model toward the disturbance of the production such as machine fault,task insert and cancel etc. Is proposed. The antibody generation method based on the sequence constraints and the coding rule of antibody for the machining procedure is also presented. Using the heuristic antibody generation method based on the physiology immune mechanism, the validity of the scheduling optimization is improved, and based on the immune and expert system under the event-driven constraints, not only Job-shop scheduling problem with multi-objective can be solved, but also the disturbance of the production be handled rapidly. A case of the job-shop scheduling is studied and dynamic optimal solutions with multi-objective function for agile manufacturing are obtained in this paper. And the event-driven dynamic rescheduling result is compared with right-shift rescheduling and total rescheduling.

  20. Efficient Parallelization of the Stochastic Dual Dynamic Programming Algorithm Applied to Hydropower Scheduling

    Directory of Open Access Journals (Sweden)

    Arild Helseth

    2015-12-01

    Full Text Available Stochastic dual dynamic programming (SDDP has become a popular algorithm used in practical long-term scheduling of hydropower systems. The SDDP algorithm is computationally demanding, but can be designed to take advantage of parallel processing. This paper presents a novel parallel scheme for the SDDP algorithm, where the stage-wise synchronization point traditionally used in the backward iteration of the SDDP algorithm is partially relaxed. The proposed scheme was tested on a realistic model of a Norwegian water course, proving that the synchronization point relaxation significantly improves parallel efficiency.

  1. Nonlinear dynamic positioning of ships with gain-scheduled wave filtering

    DEFF Research Database (Denmark)

    Torsetnes, Guttorm; Jouffroy, Jerome; Fossen, Thor I.

    This paper presents a globally contracting controller for regulation and dynamic positioning of ships, using only position measurements. For this purpose a globally contracting observer which reconstructs the unmeasured states is constructed. The observer produces accurate estimates of position......, slowly varying environmental disturbances (bias terms) and velocity. The estimates are automatically adjusted to the present sea state by gain-scheduling the wave model parameters in the observer. Finally, the estimates are used in a nonlinear PID control law and the stability proof of the observer...

  2. Dynamic workload balancing of parallel applications with user-level scheduling on the Grid

    CERN Document Server

    Korkhov, Vladimir V; Krzhizhanovskaya, Valeria V

    2009-01-01

    This paper suggests a hybrid resource management approach for efficient parallel distributed computing on the Grid. It operates on both application and system levels, combining user-level job scheduling with dynamic workload balancing algorithm that automatically adapts a parallel application to the heterogeneous resources, based on the actual resource parameters and estimated requirements of the application. The hybrid environment and the algorithm for automated load balancing are described, the influence of resource heterogeneity level is measured, and the speedup achieved with this technique is demonstrated for different types of applications and resources.

  3. Automatic programming via iterated local search for dynamic job shop scheduling.

    Science.gov (United States)

    Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

    2015-01-01

    Dispatching rules have been commonly used in practice for making sequencing and scheduling decisions. Due to specific characteristics of each manufacturing system, there is no universal dispatching rule that can dominate in all situations. Therefore, it is important to design specialized dispatching rules to enhance the scheduling performance for each manufacturing environment. Evolutionary computation approaches such as tree-based genetic programming (TGP) and gene expression programming (GEP) have been proposed to facilitate the design task through automatic design of dispatching rules. However, these methods are still limited by their high computational cost and low exploitation ability. To overcome this problem, we develop a new approach to automatic programming via iterated local search (APRILS) for dynamic job shop scheduling. The key idea of APRILS is to perform multiple local searches started with programs modified from the best obtained programs so far. The experiments show that APRILS outperforms TGP and GEP in most simulation scenarios in terms of effectiveness and efficiency. The analysis also shows that programs generated by APRILS are more compact than those obtained by genetic programming. An investigation of the behavior of APRILS suggests that the good performance of APRILS comes from the balance between exploration and exploitation in its search mechanism.

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

  5. A dynamic simulation/optimization model for scheduling restoration of degraded military training lands.

    Science.gov (United States)

    Önal, Hayri; Woodford, Philip; Tweddale, Scott A; Westervelt, James D; Chen, Mengye; Dissanayake, Sahan T M; Pitois, Gauthier

    2016-04-15

    Intensive use of military vehicles on Department of Defense training installations causes deterioration in ground surface quality. Degraded lands restrict the scheduled training activities and jeopardize personnel and equipment safety. We present a simulation-optimization approach and develop a discrete dynamic optimization model to determine an optimum land restoration for a given training schedule and availability of financial resources to minimize the adverse effects of training on military lands. The model considers weather forecasts, scheduled maneuver exercises, and unique qualities and importance of the maneuver areas. An application of this approach to Fort Riley, Kansas, shows that: i) starting with natural conditions, the total amount of training damages would increase almost linearly and exceed a quarter of the training area and 228 gullies would be formed (mostly in the intensive training areas) if no restoration is carried out over 10 years; ii) assuming an initial state that resembles the present conditions, sustaining the landscape requires an annual restoration budget of $957 thousand; iii) targeting a uniform distribution of maneuver damages would increase the total damages and adversely affect the overall landscape quality, therefore a selective restoration strategy may be preferred; and iv) a proactive restoration strategy would be optimal where land degradations are repaired before they turn into more severe damages that are more expensive to repair and may pose a higher training risk. The last finding can be used as a rule-of-thumb for land restoration efforts in other installations with similar characteristics.

  6. A Revive on 32×32 Bit Multiprecision Dynamic Voltage Scaling Multiplier with Operands Scheduler

    Directory of Open Access Journals (Sweden)

    Mrs.S.N.Rawat

    2016-02-01

    Full Text Available In this paper, we present a Multiprecision (MP reconfigurable multiplier that incorporates variable precision, parallel processing (PP, razor-based dynamic voltage scaling (DVS, and dedicated MP operands scheduling to provide optimum performance for a variety of operating conditions. All of the building blocks of the proposed reconfigurable multiplier can either work as independent smaller-precision multipliers or work in parallel to perform higher-precision multiplications. Given the user’s requirements (e.g., throughput, a dynamic voltage/ frequency scaling management unit configures the multiplier to operate at the proper precision and frequency. Adapting to the run-time workload of the targeted application, razor flip-flops together with a dithering voltage unit then configure the multiplier to achieve the lowest power consumption. The single-switch dithering voltage unit and razor flip-flops help to reduce the voltage safety margins and overhead typically associated to DVS to the lowest level. The large silicon area and power overhead typically associated to reconfigurability features are removed. Finally, the proposed novel MP multiplier can further benefit from an operands scheduler that rearranges the input data, hence to determine the optimum voltage and frequency operating conditions for minimum power consumption. This low-power MP multiplier is fabricated in AMIS 0.35-μm technology. Experimental results show that the proposed MP design features a 28.2% and 15.8% reduction in circuit area and power consumption compared with conventional fixed-width multiplier. When combining this MP design with error-tolerant razor-based DVS, PP, and the proposed novel operands scheduler, 77.7%–86.3% total power reduction is achieved with a total silicon area overhead as low as 11.1%. This paper successfully demonstrates that a MP architecture can allow more aggressive frequency/supply voltage scaling for improved power efficiency

  7. Self-balancing dynamic scheduling of electrical energy for energy-intensive enterprises

    Science.gov (United States)

    Gao, Yunlong; Gao, Feng; Zhai, Qiaozhu; Guan, Xiaohong

    2013-06-01

    Balancing production and consumption with self-generation capacity in energy-intensive enterprises has huge economic and environmental benefits. However, balancing production and consumption with self-generation capacity is a challenging task since the energy production and consumption must be balanced in real time with the criteria specified by power grid. In this article, a mathematical model for minimising the production cost with exactly realisable energy delivery schedule is formulated. And a dynamic programming (DP)-based self-balancing dynamic scheduling algorithm is developed to obtain the complete solution set for such a multiple optimal solutions problem. For each stage, a set of conditions are established to determine whether a feasible control trajectory exists. The state space under these conditions is partitioned into subsets and each subset is viewed as an aggregate state, the cost-to-go function is then expressed as a function of initial and terminal generation levels of each stage and is proved to be a staircase function with finite steps. This avoids the calculation of the cost-to-go of every state to resolve the issue of dimensionality in DP algorithm. In the backward sweep process of the algorithm, an optimal policy is determined to maximise the realisability of energy delivery schedule across the entire time horizon. And then in the forward sweep process, the feasible region of the optimal policy with the initial and terminal state at each stage is identified. Different feasible control trajectories can be identified based on the region; therefore, optimising for the feasible control trajectory is performed based on the region with economic and reliability objectives taken into account.

  8. A QoS-Based Dynamic Queue Length Scheduling Algorithm in Multiantenna Heterogeneous Systems

    Directory of Open Access Journals (Sweden)

    Verikoukis Christos

    2010-01-01

    Full Text Available The use of real-time delay-sensitive applications in wireless systems has significantly grown during the last years. Therefore the designers of wireless systems have faced a challenging issue to guarantee the required Quality of Service (QoS. On the other hand, the recent advances and the extensive use of multiple antennas have already been included in several commercial standards, where the multibeam opportunistic transmission beamforming strategies have been proposed to improve the performance of the wireless systems. A cross-layer-based dynamically tuned queue length scheduler is presented in this paper, for the Downlink of multiuser and multiantenna WLAN systems with heterogeneous traffic requirements. To align with modern wireless systems transmission strategies, an opportunistic scheduling algorithm is employed, while a priority to the different traffic classes is applied. A tradeoff between the maximization of the throughput of the system and the guarantee of the maximum allowed delay is obtained. Therefore, the length of the queue is dynamically adjusted to select the appropriate conditions based on the operator requirements.

  9. New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

    Science.gov (United States)

    Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

    2017-01-01

    In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

  10. New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

    Science.gov (United States)

    Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

    2017-01-01

    In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

  11. Resource management and job scheduling of China earthquake grid experiment system:Construction of resource management and job dynamic scheduling model ProRMJS

    Institute of Scientific and Technical Information of China (English)

    HOU Jian-min; LIU Rui-feng; SHAN Bao-hua; ZHAO Yong; NIU Ai-jun; ZOU Li-ye; HOU Li-hua; HAN-Jun

    2006-01-01

    Grid technique is taken as the third generation intemet technology and resource management is the core of it.Aiming at the problems of resource management of CEDAGrid (China Earthquake Disaster Alleviation and Simulation Grid) in its preliminary construction, this paper presents a resource management and job scheduling model:ProRMJS to solve these problems. For platform supposed agreeably each computing node can provide computation service, ProRMJS uses "computation pool" to support scheduler, and then the scheduler allocates jobs dynamically according to computing capability and status of each node to ensure the stability of the platform. At the same time, ProRMJS monitors the status of job on each node and sets a time threshold to manage the job scheduling. By estimating the computing capability of each node, ProRMJS allocates jobs on demand to solve the problem of supposing each node can finish the job acquiescently. When calculating the computing capability of each node,ProRMJS allows for the various factors that affect the computing capability and then the efficiency of the platform is improved. Finally the validity of the model is verified by an example.

  12. Resource management and job scheduling of China earthquake grid experiment system: Construction of resource management and job dynamic scheduling model ProRMJS

    Science.gov (United States)

    Hou, Jian-Min; Liu, Rui-Feng; Shan, Bao-Hua; Zhao, Yong; Niu, Ai-Jun; Zou, Li-Ye; Hou, Li-Hua; Han, Jun

    2006-11-01

    Grid technique is taken as the third generation internet technology and resource management is the core of it. Aiming at the problems of resource management of CEDAGrid (China Earthquake Disaster Alleviation and Simulation Grid) in its preliminary construction, this paper presents a resource management and job scheduling model: ProRMJS to solve these problems. For platform supposed agreeably each computing node can provide computation service, ProRMJS uses “computation pool” to support scheduler, and then the scheduler allocates jobs dynamically according to computing capability and status of each node to ensure the stability of the platform. At the same time, ProRMJS monitors the status of job on each node and sets a time threshold to manage the job scheduling. By estimating the computing capability of each node, ProRMJS allocates jobs on demand to solve the problem of supposing each node can finish the job acquiescently. When calculating the computing capability of each node, ProRMJS allows for the various factors that affect the computing capability and then the efficiency of the platform is improved. Finally the validity of the model is verified by an example.

  13. A MODIFIED GIFFLER AND THOMPSON ALGORITHM COMBINED WITH DYNAMIC SLACK TIME FOR SOLVING DYNAMIC SCHEDULE PROBLEMS

    Directory of Open Access Journals (Sweden)

    Tanti Octavia

    2003-01-01

    Full Text Available A Modified Giffler and Thompson algorithm combined with dynamic slack time is used to allocate machines resources in dynamic nature. It was compared with a Real Time Order Promising (RTP algorithm. The performance of modified Giffler and Thompson and RTP algorithms are measured by mean tardiness. The result shows that modified Giffler and Thompson algorithm combined with dynamic slack time provides significantly better result compared with RTP algorithm in terms of mean tardiness.

  14. A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average

    CERN Document Server

    Noon, Abbas; Kadry, Seifedine

    2011-01-01

    Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the other hand, if this quantum is too small, it increases the overhead of the CPU. In this paper, we propose a new algorithm, called AN, based on a new approach called dynamic-time-quantum; the idea of this approach is to make the operating systems adjusts the time quantum according to the burst time of the set of waiting processes in the ready queue. Based on the simulations and experiments, we show that the new proposed algorithm solves the fixed time quantum problem and increases the performance of Round Robin.

  15. QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

    Science.gov (United States)

    Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun

    2016-02-01

    As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

  16. Handling machine breakdown for dynamic scheduling by a colony of cognitive agents in a holonic manufacturing framework

    Directory of Open Access Journals (Sweden)

    T. K. Jana

    2015-09-01

    Full Text Available There is an ever increasing need of providing quick, yet improved solution to dynamic scheduling by better responsiveness following simple coordination mechanism to better adapt to the changing environments. In this endeavor, a cognitive agent based approach is proposed to deal with machine failure. A Multi Agent based Holonic Adaptive Scheduling (MAHoAS architecture is developed to frame the schedule by explicit communication between the product holons and the resource holons in association with the integrated process planning and scheduling (IPPS holon under normal situation. In the event of breakdown of a resource, the cooperation is sought by implicit communication. Inspired by the cognitive behavior of human being, a cognitive decision making scheme is proposed that reallocates the incomplete task to another resource in the most optimized manner and tries to expedite the processing in view of machine failure. A metamorphic algorithm is developed and implemented in Oracle 9i to identify the best candidate resource for task re-allocation. Integrated approach to process planning and scheduling realized under Multi Agent System (MAS framework facilitates dynamic scheduling with improved performance under such situations. The responsiveness of the resources having cognitive capabilities helps to overcome the adverse consequences of resource failure in a better way.

  17. A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis

    CERN Document Server

    Behera, H S; Nayak, Debashree

    2011-01-01

    Scheduling is the central concept used frequently in Operating System. It helps in choosing the processes for execution. Round Robin (RR) is one of the most widely used CPU scheduling algorithm. But, its performance degrades with respect to context switching, which is an overhead and it occurs during each scheduling. Overall performance of the system depends on choice of an optimal time quantum, so that context switching can be reduced. In this paper, we have proposed a new variant of RR scheduling algorithm, known as Dynamic Quantum with Readjusted Round Robin (DQRRR) algorithm. We have experimentally shown that performance of DQRRR is better than RR by reducing number of context switching, average waiting time and average turn around time.

  18. Final Report on DOE Project entitled Dynamic Optimized Advanced Scheduling of Bandwidth Demands for Large-Scale Science Applications

    Energy Technology Data Exchange (ETDEWEB)

    Ramamurthy, Byravamurthy [University of Nebraska-Lincoln

    2014-05-05

    In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published several conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operatin optical WDM networks.

  19. Risk-constrained dynamic self-scheduling of a pumped-storage plant in the energy and ancillary service markets

    Energy Technology Data Exchange (ETDEWEB)

    Kazempour, S. Jalal; Moghaddam, M. Parsa; Haghifam, M.R.; Yousefi, G.R. [Department of Electrical Engineering, Tarbiat Modares University (TMU), Tehran (Iran)

    2009-05-15

    This work addresses a new framework for self-scheduling of an individual price-taker pumped-storage plant in a day-ahead (DA) market. The goal is achieving the best trade-off between the expected profit and the risks when the plant participates in DA energy, spinning reserve and regulation markets. In this paper, a set of uncertainties including price forecasting errors and also the uncertainty of power delivery requests in the ancillary service markets are contemplated. Considering these uncertainties, a new approach is proposed which is called dynamic self-scheduling (DSS). This risk-constrained dynamic self-scheduling problem is therefore formulated and solved as a mixed integer programming (MIP) problem. Numerical results for a case study are discussed. (author)

  20. Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm

    OpenAIRE

    Mohanty, Rakesh; Das, Manas; Prasanna, M. Lakshmi; Sudhashree

    2011-01-01

    In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing the processes according to the new calculated Fit Factor f and using the concept of dynamic time quantum. We have compared the performance of our proposed Fittest Job First Dynamic Round Robin(FJFDRR) algorithm with the Priority Based Static Round Robin(PBSRR) algorithm. Experimental results show that our proposed algorithm performs better than PBSRR in terms of reducing the number of context switch...

  1. An Adaptive Algorithm for Dynamic Priority Based Virtual Machine Scheduling in Cloud

    Directory of Open Access Journals (Sweden)

    Subramanian S

    2012-11-01

    Full Text Available Cloud computing, a relatively new technology, has been gaining immense popularity over the last few years. The number of cloud users has been growing exponentially and apparently scheduling of virtual machines in the cloud becomes an important issue to analyze. This paper throws light on the various scheduling algorithms present for scheduling virtual machines and also proposes a new algorithm that combines the advantages of all the existing algorithms and overcomes their disadvantages.

  2. Distributed Scheduling in MANET: Tackling the Challenges of Dimensionality, Non-convexity, and Stochastic Dynamics

    Science.gov (United States)

    2012-09-12

    RESPONSIBLE PERSON 19b. TELEPHONE NUMBER (Include area code) 12/09/12 Final Report 27 FEB 2009 -- 28 FEB 2012 Distributed Scheduling in MANET ...wireless scheduling algorithms in mobile ad hoc wireless networks, (2) the adaptive CSMA algorithm is the first utility optimal random access algorithm...Complex systems U U U U 6 Mung Chiang (609)240-6941 Reset AFOSR FA9550-09-1-0134 Distributed Scheduling in MANET Final Report 1 Project Participants at

  3. Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: A dynamic forward approach

    Directory of Open Access Journals (Sweden)

    Aidin Delgoshaei

    2016-09-01

    Full Text Available Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.

  4. An Optimal Energy Management System for Electric Vehicles using Firefly Optimization Algorithm based Dynamic EDF Scheduling

    Directory of Open Access Journals (Sweden)

    E.Kayalvizhi

    2015-08-01

    Full Text Available Mitigation of global warming gases from burning gasoline for transportation in vehicles is one of the biggest and most complex issues the world has ever faced. In an intention to eradicate the environmental crisis caused due to global warming, electric vehicles were been introduced that are powered by electric motor which works on the energy stored in a battery pack. Inspired by the research on power management in electric vehicles, this paper focuses on the development of an energy management system for electric vehicles (EMSEV to optimally balance the energy from battery pack. The proposed methodology uses firefly optimization algorithm to optimize the power consumption of the devices like electric motor, power steering, air conditioner, power window, automatic door locks, radio, speaker, horn, wiper, GPS, internal and external lights etc., from the battery in electric vehicles. Depending upon the distance to cover and the battery availability, the devices are made to switch down automatically through dynamic EDF scheduling. CAN protocol is used for effective communication between the devices and the controller. Simulation results are obtained using MATLAB.

  5. Relative-Residual-Based Dynamic Schedule for Belief Propagation Decoding of LDPC Codes

    Institute of Scientific and Technical Information of China (English)

    Huang Jie; Zhang Lijun

    2011-01-01

    Two Relative-Residual-based Dynamic Schedules (RRDS) for Belief Propagation (BP) decoding of Low-Density Parity-Check (LDPC) codes are proposed,in which the Variable code-RRDS (VN-RRDS) is a greediness-reduced version of the Check code-RRDS (CN-RRDS).The RRDS only processes the variable (or check) node,which has the maximum relative residual among all the variable (or check) nodes in each decoding iteration,thus keeping less greediness and decreased complexity in comparison with the edge-based Variable-to-Check Residual Belief Propagation (VC-RBP) algorithm.Moreover,VN-RRDS propagates first the message which has the largest residual based on all check equations.For different types of LDPC codes,simulation results show that the convergence rate of RRDS is higher than that of VC-RBP while keeping very low computational complexity.Furthermore,VN-RRDS achieves faster convergence as well as better performance than CN-RRDS.

  6. Development of a Dynamic Operational Scheduling Algorithm for an Independent Micro-Grid with Renewable Energy

    Science.gov (United States)

    Obara, Shin'ya

    A micro-grid with the capacity for sustainable energy is expected to be a distributed energy system that exhibits quite a small environmental impact. In an independent micro-grid, “green energy,” which is typically thought of as unstable, can be utilized effectively by introducing a battery. In the past study, the production-of-electricity prediction algorithm (PAS) of the solar cell was developed. In PAS, a layered neural network is made to learn based on past weather data and the operation plan of the compound system of a solar cell and other energy systems was examined using this prediction algorithm. In this paper, a dynamic operational scheduling algorithm is developed using a neural network (PAS) and a genetic algorithm (GA) to provide predictions for solar cell power output. We also do a case study analysis in which we use this algorithm to plan the operation of a system that connects nine houses in Sapporo to a micro-grid composed of power equipment and a polycrystalline silicon solar cell. In this work, the relationship between the accuracy of output prediction of the solar cell and the operation plan of the micro-grid was clarified. Moreover, we found that operating the micro-grid according to the plan derived with PAS was far superior, in terms of equipment hours of operation, to that using past average weather data.

  7. Multi-objective Mobile Robot Scheduling Problem with Dynamic Time Windows

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa; Steger-Jensen, Kenn

    2012-01-01

    This paper deals with the problem of scheduling feeding tasks of a single mobile robot which has capability of supplying parts to feeders on pro-duction lines. The performance criterion is to minimize the total traveling time of the robot and the total tardiness of the feeding tasks being schedul...

  8. A Bee Optimization Algorithm for Scheduling a Job Dynamically in Grid Environment

    Directory of Open Access Journals (Sweden)

    P. Rajeswari M. Prakash

    2011-12-01

    Full Text Available Grid computing is based on large scale resources sharing in a widely connected network. Grid scheduling is defined as the process of making scheduling decisions involving allocating jobs to resources over multiple administrative domains. Scheduling is the one of the key issues in the research. Matchmaking is a key aspect in the grid environment. Matching a job with available suitable resources has to satisfy certain constraints. Resource discovery is one of the key issues for job scheduling in the grid environment. The proposed Bee optimization algorithm is to analyze Quality of Service (QoS metrics such as service class, job type in the heterogeneous grid environment. QoS parameters play a major role in selecting grid resources and optimizing resources effectively and efficiently. The output of the proposed algorithm is compared with max-min and min-min algorithm.

  9. Dynamic Production Scheduling in Computer-Aided Fabrication of Integrated Circuits,

    Science.gov (United States)

    1986-01-01

    research. or -I’d - - Most researchfinvolves performing operations on silicon wafes. grup o waersthat is processed together is calleda 12t. The...scheduling requires a numerical objective function L. One possible objective is the minimization of the average expec- ted time between the arrival of an order...middle level of the scheduler has two functions : first, it responds to random events such as machine failures. When a machine goes down, it adjusts

  10. A Comparison of Resistance to Extinction Following Dynamic and Static Schedules of Reinforcement

    OpenAIRE

    Craig, Andrew R.

    2013-01-01

    Resistance to extinction of single-schedule performance is negatively related to the reinforcer rate that an organism experienced in the pre-extinction context. This finding opposes the predications of behavioral momentum theory, which states that resistance to change, in general, is positively related to reinforcer rates. The quantitative model of extinction provided by behavioral momentum theory can describe resistance to extinction following single schedules in a post-hoc fashion, and only...

  11. Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm

    CERN Document Server

    Mohanty, Rakesh; Prasanna, M Lakshmi; Sudhashree,

    2011-01-01

    In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing the processes according to the new calculated Fit Factor f and using the concept of dynamic time quantum. We have compared the performance of our proposed Fittest Job First Dynamic Round Robin(FJFDRR) algorithm with the Priority Based Static Round Robin(PBSRR) algorithm. Experimental results show that our proposed algorithm performs better than PBSRR in terms of reducing the number of context switches, average waiting time and average turnaround time.

  12. 一种基于PVM的主动的任务动态调度策略%A PVM-Based Active Dynamic Task Scheduling Strategy

    Institute of Scientific and Technical Information of China (English)

    朱世进; 李毅; 周明天; 王月

    2000-01-01

    This paper introduces a new PVM-based active dynamic task schcduling strategy. This strategy makes node machine to play an active role in task scheduling. In this way,task scheduling can take full account of loading of node machine and distribute tasks according to this strategy. So we can fulfill load balancing for system and avoid extra burden due to task migration.

  13. Comparative Performance Analysis of Best Performance Round Robin Scheduling Algorithm (BPRR) using Dynamic Time Quantum with Priority Based Round Robin (PBRR) CPU Scheduling Algorithm in Real Time Systems

    OpenAIRE

    Pallab Banerjee; Talat Zabin; ShwetaKumai; Pushpa Kumari

    2015-01-01

    Round Robin Scheduling algorithm is designed especially for Real Time Operating system (RTOS). It is a preemptive CPU scheduling algorithm which switches between the processes when static time Quantum expires .Existing Round Robin CPU scheduling algorithm cannot be implemented in real time operating system due to their high context switch rates, large waiting time, large response time, large turnaround time and less throughput . In this paper a new algorithm is presented called Best Performan...

  14. 一种基于强化学习的作业车间动态调度方法%A Reinforcement Learning-based Approach to Dynamic Job-shop Scheduling

    Institute of Scientific and Technical Information of China (English)

    魏英姿; 赵明扬

    2005-01-01

    Production scheduling is critical to manufacturing system. Dispatching rules are usually applied dynamically to schedule the job in a dynamic job-shop. Existing scheduling approaches seldom address machine selection in the scheduling process. Composite rules, considering both machine selection andjob selection, are proposed in this paper. The dynamic system is trained to enhance its learning and adaptive capability by a reinforcement learning (RL) algorithm. We define the conception of pressure to describe the system feature. Designing a reward function should be guided by the scheduling goal to accurately record the learning progress. Competitive results with the RL-based approach show that it can be used as real-time scheduling technology.

  15. On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

    DEFF Research Database (Denmark)

    Neumann, Frank; Witt, Carsten

    2015-01-01

    combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...

  16. Optimal dynamic scheduling of a power generation system to satisfy multiple criteria

    DEFF Research Database (Denmark)

    Forouzbakhsh, Farshid; Deiters, Robert M.; Shoushtari Kermanshahi, Bahman

    1991-01-01

    A computer algorithm for the optimal scheduling of generators in a power system is presented and tested. The algorithm, based on goal programming, automatically and dynami cally schedules the output of each generator in the system for optimal operation. The optimal operation can take into conside......A computer algorithm for the optimal scheduling of generators in a power system is presented and tested. The algorithm, based on goal programming, automatically and dynami cally schedules the output of each generator in the system for optimal operation. The optimal operation can take...... into consideration multiple objectives such as economy, security, and reduction of pollution as well as practical constraints. To validate and test the algorithm, an example system of 5 generators, 10 busses, and 11 transmission lines is optimized for two objectives: minimal generation cost and minimal emission...... of nitrous oxides (NOx). Hourly changes in total power demand in the range of 90% to 110% are considered together with a constraint of maximum permissible total NOx emission. Other practical equality and inequality constraints are incorporated into the optimization algorithm. The simulation results...

  17. LOAD ADAPTIVE DYNAMIC SCHEDULING OF TASKS WITH HARD DEADLINES USEFUL FOR INDUSTRIAL APPLICATIONS

    NARCIS (Netherlands)

    HALANG, WA

    1992-01-01

    All intrinsic properties of the earliest deadline task scheduling discipline are compiled and discussed in order to show that this is the most advantageous scheme at hand, characterised by efficiency and allowing predictable system behaviour. It is then pointed out how the method naturally extends t

  18. Nonstrategic Nuclear Weapons

    Science.gov (United States)

    2014-01-03

    William Potter , and Nikolai Sokov, Reducing and Regulating Tactical (Nonstrategic) Nuclear Weapons in Europe, The James Martin Center For...See William C. Potter and Nikolai Sokov, “Nuclear Weapons that People Forget,” International Herald Tribune, May 31, 2000. 87 Sam Nunn, Igor...their security.97 94 Kent Harris , “NATO Allies Want U.S. Nuclear Weapons out of Europe

  19. Reconversion of nuclear weapons

    CERN Document Server

    Kapitza, Sergei P

    1993-01-01

    The nuclear predicament or nuclear option. Synopsis of three lectures : 1- The physical basis of nuclear technology. Physics of fission. Chain reaction in reactors and weapons. Fission fragments. Separration of isotopes. Radiochemistry.2- Nuclear reactors with slow and fast neutrons. Power, size, fuel and waste. Plutonium production. Dose rate, shielding and health hazard. The lessons of Chernobyl3- Nuclear weapons. Types, energy, blast and fallout. Fusion and hydrogen bombs. What to do with nuclear weapons when you cannot use them? Testing. Nonmilittary use. Can we get rid of the nuclear weapon? Nuclear proliferation. Is there a nuclear future?

  20. Design and performance evaluation of dynamic wavelength scheduled hybrid WDM/TDM PON for distributed computing applications.

    Science.gov (United States)

    Zhu, Min; Guo, Wei; Xiao, Shilin; Dong, Yi; Sun, Weiqiang; Jin, Yaohui; Hu, Weisheng

    2009-01-19

    This paper investigates the design and implementation of distributed computing applications in local area network. We propose a novel Dynamical Wavelength Scheduled Hybrid WDM/TDM Passive Optical Network, which is termed as DWS-HPON. The system is implemented by using spectrum slicing techniques of broadband light source and overlay broadcast-signaling scheme. The Time-Wavelength Co-Allocation (TWCA) Problem is defined and an effective greedy approach to this problem is presented for aggregating large files in distributed computing applications. The simulations demonstrate that the performance is improved significantly compared with the conventional TDM-over-WDM PON.

  1. Saline Water Irrigation Scheduling Through a Crop-Water-Salinity Production Function and a Soil-Water-Salinity Dynamic Model

    Institute of Scientific and Technical Information of China (English)

    WANG Yang-Ren; KANG Shao-Zhong; LI Fu-heng; ZHANG Lu; ZHANG Jian-Hua

    2007-01-01

    Using a crop-water-salinity production function and a soil-water-salinity dynamic model, optimal irrigation scheduling was developed to maximize net return per irrigated area. Plot and field experiments were used to obtain the crop water sensitivity index, the salinity sensitivity index, and other parameters. Using data collected during 35 years to calculate the 10-day mean precipitation and evaporation, the variation in soil salinity concentrations and in the yields of winter wheat and cotton were simulated for 49 irrigation scheduling that were combined from 7 irrigation schemes over 3 irrigation dates and 7 salinity concentrations of saline irrigation water (fresh water and 6 levels of saline water). Comparison of predicted results with irrigation data obtained from a large area of the field showed that the model was valid and reliable. Based on the analysis of the investment cost of the irrigation that employed deep tube wells or shallow tube wells, a saline water irrigation schedule and a corresponding strategy for groundwater development and utilization were proposed. For wheat or cotton, if the salinity concentration was higher than 7.0 g L-1 in groundwater, irrigation was needed with only fresh water; if about 5.0 g L-1, irrigation was required twice with fresh water and once with saline water; and if not higher than 3.0 g L-1, irrigation could be solely with saline water.

  2. Multirunway Optimization Schedule of Airport Based on Improved Genetic Algorithm by Dynamical Time Window

    Directory of Open Access Journals (Sweden)

    Hang Zhou

    2015-01-01

    Full Text Available Reasonable airport runway scheduling is an effective measure to alleviate air traffic congestion. This paper proposes a new model and algorithm for flight scheduling. Considering the factors such as operating conditions and flight safety interval, the runway throughput, flight delays cost, and controller workload composes a multiobjective optimization model. The genetic algorithm combined with sliding time window algorithm is used to solve the model proposed in this paper. Simulation results show that the algorithm presented in this paper gets the optimal results, the runway throughput is increased by 12.87%, the delay cost is reduced by 61.46%, and the controller workload is also significantly reduced compared with FCFS (first come first served. Meanwhile, compared with the general genetic algorithm, it also reduces the time complexity and improves real-time and work efficiency significantly. The analysis results can provide guidance for air traffic controllers to make better air traffic control.

  3. EZDCP:A new static task scheduling algorithm with edge-zeroing based on dynamic critical paths

    Institute of Scientific and Technical Information of China (English)

    陈志刚; 华强胜

    2003-01-01

    A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed.The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; secondly, select one of the critical paths of the partially clustered directed acyclic graph; thirdly, try to zero one of graph communication edges; fourthly, repeat above three processes until all edges are zeroed; finally, check the generated clusters to see if some of them can be further merged without increasing the parallel time. Comparisons of the previous algorithms with edge-zeroing based on dynamic critical paths show that the new algorithm has not only a low complexity but also a desired performance comparable or even better on average to much higher complexity heuristic algorithms.

  4. Final Report - Dynamic Path Scheduling through Extensions to Generalized Multiprotocol Label Switching (GMPLS)

    Energy Technology Data Exchange (ETDEWEB)

    Principal Investigator: Dr. Abdella Battou

    2009-05-22

    The major accomplishments of the project are the successful software implementation of the Phase I scheduling algorithms for GMPLS Label Switched Paths (LSPs) and the extension of the IETF Path Computation Element (PCE) Protocol to support scheduling extensions. In performing this work, we have demonstrated the theoretical work of Phase I, analyzed key issues, and made relevant extensions. Regarding the software implementation, we developed a proof of concept prototype as part of our Algorithm Evaluation System (AES). This implementation uses the Linux operating system to provide software portability and will be the foundation for our commercial software. To demonstrate proof of concept, we have implemented LSP scheduling algorithms to support two of the key GMPLS switching technologies (Lambda and Packet) and support both Fixed Path (FP) and Switched Path (SP) routing. We chose Lambda and Packet because we felt it was essential to include both circuit and packet switching technologies as well as to address all-optical switching in the study. As conceptualized in Phase I, the FP algorithms use a traditional approach where the LSP uses the same physical path for the entire service duration while the innovative SP algorithms allow the physical path to vary during the service duration. As part of this study, we have used the AES to conduct a performance analysis using metro size networks (up to 32 nodes) that showed that these algorithms are suitable for commercial implementation. Our results showed that the CPU time required to compute an LSP schedule was small compared to expected inter-arrival time between LSP requests. Also, when the network size increased from 7 to 15 to 32 nodes with 10, 26, and 56 TE links, the CPU processing time showed excellent scaling properties. When Fixed Path and Switched Path routing were compared, SP provided only modestly better performance with respect to LSP completion rate, service duration, path length, and start time deviation

  5. Dynamic scheduling of virtual machines running hpc workloads in scientific grids

    CERN Document Server

    Khalid, Omer; Anthony, Richard; Petridis, Miltos; Parrot, Kevin; Schulz, Markus; 10.1145/1330555.1330556

    2010-01-01

    The primary motivation for uptake of virtualization has been resource isolation, capacity management and resource customization allowing resource providers to consolidate their resources in virtual machines. Various approaches have been taken to integrate virtualization in to scientific Grids especially in the arena of High Performance Computing (HPC) to run grid jobs in virtual machines, thus enabling better provisioning of the underlying resources and customization of the execution environment on runtime. Despite the gains, virtualization layer also incur a performance penalty and its not very well understood that how such an overhead will impact the performance of systems where jobs are scheduled with tight deadlines. Since this overhead varies the types of workload whether they are memory intensive, CPU intensive or network I/O bound, and could lead to unpredictable deadline estimation for the running jobs in the system. In our study, we have attempted to tackle this problem by developing an intelligent s...

  6. Color image fusion for concealed weapon detection

    Science.gov (United States)

    Toet, Alexander

    2003-09-01

    Recent advances in passive and active imaging sensor technology offer the potential to detect weapons that are concealed underneath a person's clothing or carried along in bags. Although the concealed weapons can sometimes easily be detected, it can be difficult to perceive their context, due to the non-literal nature of these images. Especially for dynamic crowd surveillance purposes it may be impossible to rapidly asses with certainty which individual in the crowd is the one carrying the observed weapon. Sensor fusion is an enabling technology that may be used to solve this problem. Through fusion the signal of the sensor that depicts the weapon can be displayed in the context provided by a sensor of a different modality. We propose an image fusion scheme in which non-literal imagery can be fused with standard color images such that the result clearly displays the observed weapons in the context of the original color image. The procedure is such that the relevant contrast details from the non-literal image are transferred to the color image without altering the original color distribution of this image. The result is a natural looking color image that fluently combines all details from both input sources. When an observer who performs a dynamic crowd surveillance task, detects a weapon in the scene, he will also be able to quickly determine which person in the crowd is actually carrying the observed weapon (e.g. "the man with the red T-shirt and blue jeans"). The method is illustrated by the fusion of thermal 8-12 μm imagery with standard RGB color images.

  7. Fuzzy Mixed Assembly Line Sequencing and Scheduling Optimization Model Using Multiobjective Dynamic Fuzzy GA

    Science.gov (United States)

    Tahriri, Farzad; Dawal, Siti Zawiah Md; Taha, Zahari

    2014-01-01

    A new multiobjective dynamic fuzzy genetic algorithm is applied to solve a fuzzy mixed-model assembly line sequencing problem in which the primary goals are to minimize the total make-span and minimize the setup number simultaneously. Trapezoidal fuzzy numbers are implemented for variables such as operation and travelling time in order to generate results with higher accuracy and representative of real-case data. An improved genetic algorithm called fuzzy adaptive genetic algorithm (FAGA) is proposed in order to solve this optimization model. In establishing the FAGA, five dynamic fuzzy parameter controllers are devised in which fuzzy expert experience controller (FEEC) is integrated with automatic learning dynamic fuzzy controller (ALDFC) technique. The enhanced algorithm dynamically adjusts the population size, number of generations, tournament candidate, crossover rate, and mutation rate compared with using fixed control parameters. The main idea is to improve the performance and effectiveness of existing GAs by dynamic adjustment and control of the five parameters. Verification and validation of the dynamic fuzzy GA are carried out by developing test-beds and testing using a multiobjective fuzzy mixed production assembly line sequencing optimization problem. The simulation results highlight that the performance and efficacy of the proposed novel optimization algorithm are more efficient than the performance of the standard genetic algorithm in mixed assembly line sequencing model. PMID:24982962

  8. A New Round Robin Based Scheduling Algorithm for Operating Systems-Dynamic Quantum Using the Mean Average

    Directory of Open Access Journals (Sweden)

    Abbas Noon

    2011-05-01

    Full Text Available Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the other hand, if this quantum is too small, it increases the overhead of the CPU. In this paper, we propose a new algorithm, called AN, based on a new approach called dynamic-time-quantum; the idea of this approach is to make the operating systems adjusts the time quantum according to the burst time of the set of waiting processes in the ready queue. Based on the simulations and experiments, we show that the new proposed algorithm solves the fixed time quantum problem and increases the performance of Round Robin.

  9. Virtual nuclear weapons

    Energy Technology Data Exchange (ETDEWEB)

    Pilat, J.F.

    1997-08-01

    The term virtual nuclear weapons proliferation and arsenals, as opposed to actual weapons and arsenals, has entered in recent years the American lexicon of nuclear strategy, arms control, and nonproliferation. While the term seems to have an intuitive appeal, largely due to its cyberspace imagery, its current use is still vague and loose. The author believes, however, that if the term is clearly delineated, it might offer a promising approach to conceptualizing certain current problems of proliferation. The first use is in a reference to an old problem that has resurfaced recently: the problem of growing availability of weapon-usable nuclear materials in civilian nuclear programs along with materials made `excess` to defense needs by current arms reduction and dismantlement. It is argued that the availability of these vast materials, either by declared nuclear-weapon states or by technologically advanced nonweapon states, makes it possible for those states to rapidly assemble and deploy nuclear weapons. The second use has quite a different set of connotations. It is derived conceptually from the imagery of computer-generated reality. In this use, one thinks of virtual proliferation and arsenals not in terms of the physical hardware required to make the bomb but rather in terms of the knowledge/experience required to design, assemble, and deploy the arsenal. Virtual weapons are a physics reality and cannot be ignored in a world where knowledge, experience, materials, and other requirements to make nuclear weapons are widespread, and where dramatic army reductions and, in some cases, disarmament are realities. These concepts are useful in defining a continuum of virtual capabilities, ranging from those at the low end that derive from general technology diffusion and the existence of nuclear energy programs to those at the high end that involve conscious decisions to develop or maintain militarily significant nuclear-weapon capabilities.

  10. Neurotoxic Weapons and Syndromes.

    Science.gov (United States)

    Carota, Antonio; Calabrese, Pasquale; Bogousslavsky, Julien

    2016-01-01

    The modern era of chemical and biological warfare began in World War I with the large-scale production and use of blistering and choking agents (chlorine, phosgene and mustard gases) in the battlefield. International treaties (the 1925 Geneva Protocol, the 1975 Biological and Toxin Weapons Convention and the 1993 Chemical Weapons Convention) banned biological and chemical weapons. However, several countries are probably still engaged in their development. Hence, there is risk of these weapons being used in the future. This chapter will focus on neurotoxic weapons (e.g. nerve agents, chemical and biological neurotoxins, psychostimulants), which act specifically or preeminently on the central nervous system and/or the neuromuscular junction. Deeply affecting the function of the nervous system, these agents either have incapacitating effects or cause clusters of casualties who manifest primary symptoms of encephalopathy, seizures, muscle paralysis and respiratory failure. The neurologist should be prepared both to notice patterns of symptoms and signs that are sufficiently consistent to raise the alarm of neurotoxic attacks and to define specific therapeutic interventions. Additionally, extensive knowledge on neurotoxic syndromes should stimulate scientific research to produce more effective antidotes and antibodies (which are still lacking for most neurotoxic weapons) for rapid administration in aerosolized forms in the case of terrorist or warfare scenarios. © 2016 S. Karger AG, Basel.

  11. Multi-objective Mobile Robot Scheduling Problem with Dynamic Time Windows

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa; Steger-Jensen, Kenn

    2012-01-01

    , simul-taneously. In operation, the feeders have to be replenished a number of times so as to maintain the manufacture of products during a planning horizon. A meth-od based on predefined characteristics of the feeders is presented to generate dynamic time windows of the feeding tasks which are dependent...

  12. ON THE OFFENSE: USING CYBER WEAPONS TO INFLUENCE COGNITIVE BEHAVIOR

    Directory of Open Access Journals (Sweden)

    Mary Fendley

    2012-12-01

    Full Text Available There is an increasing recognition that cyber warfare is an important area of development for targeting and weaponeering, with far-reaching effects in national defense and economic security. The ability to conduct effective operations in cyberspace relies on a robust situational awareness of events occurring in both the physical and information domains, with an understanding of how they affect the cognitive domain of friendly, neutral, and adversary population sets. The dynamic nature of the battlefield complicates efforts to understand shifting adversary motivations and intentions. There are very few approaches, to date, that systematically evaluate the effects of the repertoire of cyber weapons on the cognitive, perceptual, and behavioral characteristics of the adversary. In this paper, we describe a software environment called Cognitive Cyber Weapon Selection Tool (CCWST that simulates a scenario involving cyber weaponry.This tool provides the capabilities to test weapons which may induce behavioral state changes in the adversaries. CCWST provides the required situational awareness to the Cyber Information Operations (IO planner to conduct intelligent weapon selection during weapon activation in order to induce the desired behavioral change in the perception of the adversary. Weapons designed to induce the cognitive state changes of deception, distraction, distrust and confusion were then tested empirically to evaluate the capabilities and expected cognitive state changes induced by these weapons. The results demonstrated that CCWST is a powerful environment within which to test and evaluate the impact of cyber weapons on influencing cognitive behavioral states during information processing.

  13. Operational research in weapon system

    Directory of Open Access Journals (Sweden)

    R. S. Varma

    1958-04-01

    Full Text Available "The paper is divided into three parts: (a The first part deals with what operational research is. (bThe second part gives what we mean by Weapon Systems and discusses considerations that determine the choice of a particular weapon system from a class weapon systems. (cThe third part deals with some aspects of weapon replacement policy.The effectiveness of a weapon system is defined as E=D/C where E is weapon effectiveness (a comparative figure of merit; D is total damage inflicted or prevented and C is total cost, D and C being reduced to common dimensions. During the course of investigations, criteria regarding to choice of weapon or weapons from a set of weapon systems are established through production function and military effect curves. A procedure is described which maximizes the expectation of military utility in order to select a weapon system from the class of weapon systems. This is done under the following simplifying assumptions: (a Non- decreasing utility function; (b Constant average cost for each kind of weapons; and (c Independence of the performance of each unit of weapon. Some of the difficulties which arises when any of these restrictions is relaxed are briefly mentioned. Finally, the policy of weapon replacement and the factors governing the same are described."

  14. Dynamic Test Mechanism of Weapon Cabin’s Door in FL-24 Wind Tunnel%FL-24风洞武器舱舱门动态试验装置

    Institute of Scientific and Technical Information of China (English)

    黄存栋; 徐来武; 吴继飞; 高鹏

    2014-01-01

    针对先进作战飞机发射或投放武器后,武器舱舱门的高速运动将对周围流场产生强烈干扰的问题,在FL-24风洞中建立了舱门开闭动态模拟试验装置。介绍试验装置的构成,利用舱门和舱内布置的动态及静态压力传感器对如舱门动态载荷特性、舱内气动噪声特性、以及St数变化影响等进行研究,并通过预先分析运动历程,估算驱动舱门所需力矩和电机功率,进行机电系统优化设计,反复调试控制程序,达到舱门转动高速响应、精确定位的目的。试验结果表明:试验装置设计合理,运行可靠,舱门最短开/闭时间约为0.15 s,能够准确模拟舱门高速开闭历程,并可拓展到其他多项试验研究。%Aiming at intense interference on fluid field close to weapon cabin’s door, which takes place before/after launching or injecting of fighting plane’s weapon, a dynamic test mechanism of weapon cabin’s door was established successfully in FL-24 wind tunnel. Constituent of the mechanism is introduced. It was used to research aerodynamic loads of weapon cabin’s door, and aero-acoustic noise of weapon bay, and the influence of theirs with variable St, with dynamic and static pressure sensors that were planted in the door and weapon cavity of the test equipment. The model door can turn responsively and accurately by analysis of rotating process, and calculating of drive torque, and estimate motor power, and optimization design of mechanical-electronic system, and a lot of adjusting on control program. The experimental results indicate that the dynamic test mechanism is designed reasonably and can run reliably. The shortest opening/closing time is about 0.15s of weapon cabin’s door. The system has capacity to simulate opening or closing process of the door precisely. At the same time, more test ability of the mechanism can be expanded.

  15. Multi-Day Activity Scheduling Reactions to Planned Activities and Future Events in a Dynamic Model of Activity-Travel Behavior

    NARCIS (Netherlands)

    Nijland, L.; Arentze, T.; Timmermans, H.

    2014-01-01

    Modeling multi-day planning has received scarce attention in activity-based transport demand modeling so far. However, new dynamic activity-based approaches are being developed at the current moment. The frequency and inflexibility of planned activities and events in activity schedules of individual

  16. Wounds and weapons

    Energy Technology Data Exchange (ETDEWEB)

    Vogel, H. [Asklepios Klinik St. Georg, Roentgenabteilung, Lohmuehlenstrasse 5, 20099 Hamburg (Germany)], E-mail: Hermann.vogel@ak-stgeorg.lbk-hh.de; Dootz, B. [Asklepios Klinik St. Georg, Roentgenabteilung, Lohmuehlenstrasse 5, 20099 Hamburg (Germany)

    2007-08-15

    Purpose: X-ray findings are described, which are typical for injuries due to conventional weapons. It is intended to demonstrate that radiographs can show findings characteristic for weapons. Material and method: The radiograms have been collected in Vietnam, Croatia, Serbia, Bosnia, Chad, Iran, Afghanistan, USA, Great Britain, France, Israel, Palestine, and Germany. Results: Radiograms of injuries due to hand grenades show their content (globes) and cover fragments. The globes are localized regionally in the victim's body. Survivors of cluster bombs show singular or few globes; having been hit by many globes would have been lethal. Shotguns produce characteristic distributions of the pallets and depth of penetration different from those of hand grenades and cluster bombs; cover fragments are lacking. Gunshot wounds (GSW) can be differentiated in those to low velocity bullets, high velocity projectiles, and projectiles, which disintegrate on impact. The radiogram furnishes the information about a dangerous shock and helps to recognize the weapon. Radiograms of victims of explosion show fragments and injuries due to the blast, information valid for therapy planning and prognosis. The radiogram shows details which can be used in therapy, forensic medicine and in war propaganda - examples could be findings typical for cluster bombs and for dumdum bullets; it shows the cruelty of the employment of weapons against humans and the conflict between the goal of medical care and those of military actions. Conclusion: Radiographs may show, which weapon has been employed; they can be read as war reports.

  17. Wounds and weapons.

    Science.gov (United States)

    Vogel, H; Dootz, B

    2007-08-01

    X-ray findings are described, which are typical for injuries due to conventional weapons. It is intended to demonstrate that radiographs can show findings characteristic for weapons. The radiograms have been collected in Vietnam, Croatia, Serbia, Bosnia, Chad, Iran, Afghanistan, USA, Great Britain, France, Israel, Palestine, and Germany. Radiograms of injuries due to hand grenades show their content (globes) and cover fragments. The globes are localized regionally in the victim's body. Survivors of cluster bombs show singular or few globes; having been hit by many globes would have been lethal. Shotguns produce characteristic distributions of the pallets and depth of penetration different from those of hand grenades and cluster bombs; cover fragments are lacking. Gunshot wounds (GSW) can be differentiated in those to low velocity bullets, high velocity projectiles, and projectiles, which disintegrate on impact. The radiogram furnishes the information about a dangerous shock and helps to recognize the weapon. Radiograms of victims of explosion show fragments and injuries due to the blast, information valid for therapy planning and prognosis. The radiogram shows details which can be used in therapy, forensic medicine and in war propaganda - examples could be findings typical for cluster bombs and for dumdum bullets; it shows the cruelty of the employment of weapons against humans and the conflict between the goal of medical care and those of military actions. Radiographs may show, which weapon has been employed; they can be read as war reports.

  18. Dynamic scheduling model of computing resource based on MAS cooperation mechanism

    Institute of Scientific and Technical Information of China (English)

    JIANG WeiJin; ZHANG LianMei; WANG Pu

    2009-01-01

    Allocation of grid resources aims at improving resource utility and grid application performance. Currently, the algorithms proposed for this purpose do not fit well the autonomic, dynamic, distributive and heterogeneous features of the grid environment. According to MAS (multi-agent system) cooperation mechanism and market bidding game rules, a model of allocating allocation of grid resources based on market economy is introduced to reveal the relationship between supply and demand. This model can make good use of the studying and negotiating ability of consumers' agent and takes full consideration of the consumer's behavior, thus rendering the application and allocation of resource of the consumers rational and valid. In the meantime, the utility function of consumer Is given; the existence and the uniqueness of Nash equilibrium point in the resource allocation game and the Nash equilibrium solution are discussed. A dynamic game algorithm of allocating grid resources is designed. Experimental results demonstrate that this algorithm diminishes effectively the unnecessary latency, improves significantly the smoothness of response time, the ratio of throughput and resource utility, thus rendering the supply and demand of the whole grid resource reasonable and the overall grid load balanceable.

  19. Bioterrorism: toxins as weapons.

    Science.gov (United States)

    Anderson, Peter D

    2012-04-01

    The potential for biological weapons to be used in terrorism is a real possibility. Biological weapons include infectious agents and toxins. Toxins are poisons produced by living organisms. Toxins relevant to bioterrorism include ricin, botulinum, Clostridium perfrigens epsilson toxin, conotoxins, shigatoxins, saxitoxins, tetrodotoxins, mycotoxins, and nicotine. Toxins have properties of biological and chemical weapons. Unlike pathogens, toxins do not produce an infection. Ricin causes multiorgan toxicity by blocking protein synthesis. Botulinum blocks acetylcholine in the peripheral nervous system leading to muscle paralysis. Epsilon toxin damages cell membranes. Conotoxins block potassium and sodium channels in neurons. Shigatoxins inhibit protein synthesis and induce apoptosis. Saxitoxin and tetrodotoxin inhibit sodium channels in neurons. Mycotoxins include aflatoxins and trichothecenes. Aflatoxins are carcinogens. Trichothecenes inhibit protein and nucleic acid synthesis. Nicotine produces numerous nicotinic effects in the nervous system.

  20. Weapon of the Weak?

    DEFF Research Database (Denmark)

    Amber, Van der Graaf; Otjes, Simon; Rasmussen, Anne

    2016-01-01

    Social media have the potential to offset existing inequalities in representation among interest groups and act as a ‘weapon of the weak’ by providing a technological infrastructure that allows even groups with limited resources to create content and interact across the globe. We expand on the sp......Social media have the potential to offset existing inequalities in representation among interest groups and act as a ‘weapon of the weak’ by providing a technological infrastructure that allows even groups with limited resources to create content and interact across the globe. We expand...

  1. The Optimum Replacement of Weapon

    Institute of Scientific and Technical Information of China (English)

    ZHANG Xiao; ZHANG Jin-chun

    2002-01-01

    The theory of LCC (Life Cycle Cost) is applied in this paper. The relation between the economic life of weapon and the optimum replacement is analyzed. The method to define the optimum replacement time of weapon is discussed.

  2. Multiple smart weapons employment mechanism

    Energy Technology Data Exchange (ETDEWEB)

    McGlynn, M.P.; Meiklejohn, W.D.

    1993-07-20

    A digital communications armament network adaptor is described for carrying multiple smart weapons on a single wing pylon station of an aircraft, comprising: an aircraft having a weapons controller configured in compliance with MIL-STD 1553; multiple wing-mounted pylons on said aircraft, each providing a weapons station with communications and ejection and release mechanisms electrically connected to said controller for the airborne launch of smart weapons; a multiple ejector rack affixed to at least one pylon, said rack holding a plurality of smart weapons; and an electronic digital network connected between the controller and said rack-mounted smart weapons, said network located in said rack and including circuitry which receives coded digital communications from said controller and selectively rebroadcasts said communications to one of said smart weapons on said rack designated by said coded communications, thereby controlling all required functions of said designated smart weapon.

  3. Adaptive reproduction schedule as a cause of worker policing in social hymenoptera: a dynamic game analysis.

    Science.gov (United States)

    Ohtsuki, Hisashi; Tsuji, Kazuki

    2009-06-01

    Evolutionary theories predict conflicts over sex allocation, male parentage, and reproductive allocation in hymenopteran societies. However, no theory to date has considered the evolution when a colony faces these three conflicts simultaneously. We tackled this issue by developing a dynamic game model, focusing especially on worker policing. Whereas a Nash equilibrium predicts male parentage patterns that are basically the same as those of relatedness-based worker-policing theory (queen multiple mating impedes worker reproduction), we also show the potential for worker policing under queen single mating. Worker policing will depend on the stage of colony growth that is caused by interaction with reproductive allocation conflict or a trade-off between current and future reproduction. Male production at an early stage greatly hinders the growth of the work force and undermines future inclusive fitness of colony members, leading to worker policing at the ergonomic stage. This new mechanism can explain much broader ranges of existing worker-policing behavior than that predicted from relatedness. Predictions differ in many respects from those of models assuming operation of only one or two of the three conflicts, suggesting the importance of interactions among conflicts.

  4. Dynamic Grid Scheduling with Job Migration and Rescheduling in the GridLab Resource Management System

    Directory of Open Access Journals (Sweden)

    K. Kurowski

    2004-01-01

    Full Text Available Grid computing has become one of the most important research topics that appeared in the field of computing in the last years. Simultaneously, we have noticed the growing popularity of new Web-based technologies which allow us to create application-oriented Grid middleware services providing capabilities required for dynamic resource and job management, monitoring, security, etc. Consequently, end users are able to get easier access to geographically distributed resources. In this paper we present the results of our experiments with the Grid(Lab Resource Management System (GRMS, which acts on behalf of end users and controls their computations efficiently using distributed heterogeneous resources. We show how resource matching techniques used within GRMS can be improved by the use of a job migration based rescheduling policy. The main aim of this policy is to shorten job pending times and reduce machine overloads. The influence of this method on application performance and resource utilization is studied in detail and compared with two other simple policies.

  5. Nuclear weapon detection categorization analysis

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-12-01

    This statement of work is for the Proof of Concept for nuclear weapon categories utility in Arms control. The focus of the project will be to collect, analyze and correlate Intrinsic Radiation (INRAD) calculation results for the purpose of defining measurable signatures that differentiate categories of nuclear weapons. The project will support START III negotiations by identifying categories of nuclear weapons. The categories could be used to clarify sub-limits on the total number of nuclear weapons.

  6. Processings of Conference on Dynamics of Precision Gun Weapons (1st), held at Rock Island, Illinois, on January 26-27, 1977

    Science.gov (United States)

    1977-02-18

    Thomas lutchings Rodman Laboratory, Rock Island (iv) ______ TABLE OF CONTENTS Page SESSION 1: MECHANICS OF WEAPONS Chairman: Mr. Victor Linder ...drooped tube. Inertia of both the tube and projectile 1 Personal communication, B. I. Hart , formerly Mathematician at the USA Ballistic Research...element displacements therefore reduces the number of generalized DI pont dslacements. For the three beam elements shown in fig 1(a), the number of

  7. Applying Agile MethodstoWeapon/Weapon-Related Software

    Energy Technology Data Exchange (ETDEWEB)

    Adams, D; Armendariz, M; Blackledge, M; Campbell, F; Cloninger, M; Cox, L; Davis, J; Elliott, M; Granger, K; Hans, S; Kuhn, C; Lackner, M; Loo, P; Matthews, S; Morrell, K; Owens, C; Peercy, D; Pope, G; Quirk, R; Schilling, D; Stewart, A; Tran, A; Ward, R; Williamson, M

    2007-05-02

    This white paper provides information and guidance to the Department of Energy (DOE) sites on Agile software development methods and the impact of their application on weapon/weapon-related software development. The purpose of this white paper is to provide an overview of Agile methods, examine the accepted interpretations/uses/practices of these methodologies, and discuss the applicability of Agile methods with respect to Nuclear Weapons Complex (NWC) Technical Business Practices (TBPs). It also provides recommendations on the application of Agile methods to the development of weapon/weapon-related software.

  8. Dynamic gene expression in fish muscle during recovery growth induced by a fasting-refeeding schedule

    Directory of Open Access Journals (Sweden)

    Esquerré Diane

    2007-11-01

    Full Text Available Abstract Background Recovery growth is a phase of rapid growth that is triggered by adequate refeeding of animals following a period of weight loss caused by starvation. In this study, to obtain more information on the system-wide integration of recovery growth in muscle, we undertook a time-course analysis of transcript expression in trout subjected to a food deprivation-refeeding sequence. For this purpose complex targets produced from muscle of trout fasted for one month and from muscle of trout fasted for one month and then refed for 4, 7, 11 and 36 days were hybridized to cDNA microarrays containing 9023 clones. Results Significance analysis of microarrays (SAM and temporal expression profiling led to the segregation of differentially expressed genes into four major clusters. One cluster comprising 1020 genes with high expression in muscle from fasted animals included a large set of genes involved in protein catabolism. A second cluster that included approximately 550 genes with transient induction 4 to 11 days post-refeeding was dominated by genes involved in transcription, ribosomal biogenesis, translation, chaperone activity, mitochondrial production of ATP and cell division. A third cluster that contained 480 genes that were up-regulated 7 to 36 days post-refeeding was enriched with genes involved in reticulum and Golgi dynamics and with genes indicative of myofiber and muscle remodelling such as genes encoding sarcomeric proteins and matrix compounds. Finally, a fourth cluster of 200 genes overexpressed only in 36-day refed trout muscle contained genes with function in carbohydrate metabolism and lipid biosynthesis. Remarkably, among the genes induced were several transcriptional regulators which might be important for the gene-specific transcriptional adaptations that underlie muscle recovery. Conclusion Our study is the first demonstration of a coordinated expression of functionally related genes during muscle recovery growth

  9. Nonstrategic Nuclear Weapons

    Science.gov (United States)

    2017-02-21

    have eased in recent years, with their nuclear tests in 1998 and continued animosity toward each other, India and Pakistan have joined the list of...could be complex, difficult, and very time- consuming . 137 Given the large disparity in the numbers of U.S. and Russian nonstrategic nuclear weapons

  10. Medicalized weapons & modern war.

    Science.gov (United States)

    Gross, Michael L

    2010-01-01

    "Medicalized" weapons--those that rely on advances in neuroscience, physiology, and pharmacology--offer the prospect of reducing casualties and protecting civilians. They could be especially useful in modern asymmetric wars in which conventional states are pitted against guerrilla or insurgent forces. But may physicians and other medical workers participate in their development?

  11. Neutrino Counter Nuclear Weapon

    CERN Document Server

    Tang, Alfred

    2008-01-01

    Radiations produced by neutrino-antineutrino annihilation at the Z0 pole can be used to heat up the primary stage of a thermonuclear warhead and can in principle detonate the device remotely. Neutrino-antineutrino annihilation can also be used as a tactical assault weapon to target hideouts that are unreachable by conventional means.

  12. Nuclear weapons in Europe

    CERN Document Server

    Calogero, F

    1981-01-01

    Information speech given by Prof. Calogero from the university of Roma to describe the actual situation of nuclear weapons in Europe, the strategical reasons or justifications for this deployment, the prospects of negociations, and what scientists could do and do on this issue.

  13. Pakistans Nuclear Weapons

    Science.gov (United States)

    2016-02-12

    Memorandum from Air Commodore Khalid Banuri, 2011. 84 Mahmud Ali Durrani, “Pakistan’s Strategic Thinking and the Role of Nuclear Weapons...Richard P. Cronin , K. Alan Kronstadt, and Sharon Squassoni. Also see CRS Report RL33498, Pakistan-U.S. Relations, by K. Alan Kronstadt. 168 For a

  14. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

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

    2004-07-01

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

  15. Non-lethal weapons and their characteristics

    OpenAIRE

    DAMJANOVIC DRAGAN Z.

    2015-01-01

    Non-lethal weapons, also called less-lethal weapons, less-than lethal weapons, non-deadly weapons, compliance weapons, or pain-inducing weapons are weapons intended to be less likely to kill a living target than conventional weapons. It is often understood that accidental, incidental, and correlative casualties are risked wherever force is applied, but non-lethal weapons try to minimise the risk as much as possible. Non-lethal weapons are used in combat situations to limit the escalation of c...

  16. NON-LETHAL WEAPONS AND THEIR CHARACTERISTICS

    OpenAIRE

    2015-01-01

    Non-lethal weapons, also called less-lethal weapons, less-than lethal weapons, non-deadly weapons, compliance weapons, or pain-inducing weapons are weapons intended to be less likely to kill a living target than conventional weapons. It is often understood that accidental, incidental, and correlative casualties are risked wherever force is applied, but non-lethal weapons try to minimise the risk as much as possible. Non-lethal weapons are used in combat situations to limit the escalation of c...

  17. Electronic eyebox for weapon sights

    Science.gov (United States)

    Szapiel, Stan; Greenhalgh, Catherine; Wagner, Kevin; Nobes, Ryan

    2016-05-01

    We expand the effective size of the eyebox of a magnified telescopic weapon sight by following the movements of the operator's eye to create a larger, `electronic eyebox'. The original eyebox of the telescope is dynamically relocated in space so that proper overlap between the pupil of the eye and the exit pupil of the device is maintained. Therefore, the operator will perceive the entire field of view of the instrument in a much bigger spatial region than the one defined by the original eyebox. Proof-of-the-concept results are presented with a more than 3.5X enlargement of the eyebox volume along with recommendations for the next phase of development.

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

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

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

  1. 基于评价函数的动态协同任务调度算法%Evaluation function-based dynamic collaboration task scheduling algorithm

    Institute of Scientific and Technical Information of China (English)

    王璇; 颜景龙

    2011-01-01

    As the problems that resources change dynamically and tasks access in complex grid environment,a dynamic collaboration task scheduling based on the evaluation function was proposed.This algorithm solves the task cooperation scheduling in dynamic grid by using evaluation function of tasks and collaborators,which vary with time.Compared with distributed cooperation scheduling algorithm based on contract net,theoretical analysis and experimental results show that the algorithm is effective to reduce the system overhead and improve the resource allocation.%针对复杂网格环境中节点资源动态变化及大量任务协作访问的问题,提出一种基于评价函数的动态协作任务调度算法.该算法通过为网格中的协作任务与协作成员建立随时间变化的任务评价函数和协作成员评价函数,实现动态网格环境中的任务协同调度.理论分析与仿真实验表明:与基于合同网的分布式合作调度算法相比,本算法能够减小系统开销,提高资源分配效率.

  2. Bioterrorism: pathogens as weapons.

    Science.gov (United States)

    Anderson, Peter D; Bokor, Gyula

    2012-10-01

    Biowarfare has been used for centuries. The use of biological weapons in terrorism remains a threat. Biological weapons include infectious agents (pathogens) and toxins. The most devastating bioterrorism scenario would be the airborne dispersal of pathogens over a concentrated population area. Characteristics that make a specific pathogen a high-risk for bioterrorism include a low infective dose, ability to be aerosolized, high contagiousness, and survival in a variety of environmental conditions. The most dangerous potential bioterrorism agents include the microorganisms that produce anthrax, plague, tularemia, and smallpox. Other diseases of interest to bioterrorism include brucellosis, glanders, melioidosis, Q fever, and viral encephalitis. Food safety and water safety threats are another area of concern.

  3. Illegal Weapons Exports?

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Amnesty International, a human rights organization, released a report on June 11 accusing China of facilitating regional conflicts and human rights violations by exporting a large quantity of weapons to Sudan, Nepal, Myanmar and the Great Lakes countries of Africa. Responding to such charges, Teng Jianqun, a researcher with the China Arms Control and Disarmament Association, told the official Xinhua News Agency that China has always put its limited arms exports under strict control and surveillance, deno...

  4. Counterproliferation of Nuclear Weapons

    Science.gov (United States)

    2010-04-01

    an occurrence. In his book, Atomic Tragedy, Sean Malloy writes that Henry Stimson, the United States Secretary of War, warned in April, 1945 that...Ibid., 380. 41 Ibid. 42 Sean L. Malloy , Atomic Tragedy: Henry L. Stimson and the Decision to use the Bomb Against Japan (Ithaca, New York...Weapons of Mass Destruction in the Middle East, 96-97. 45 Robert M. Gates, National Defense Strategy (Washington, DC: US Government Printing Office

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

  6. 集装箱码头集卡动态调度模型优化%A Model Optimization of Yard Truck Dynamic Scheduling in Container Terminal

    Institute of Scientific and Technical Information of China (English)

    徐远琴; 韩晓龙

    2013-01-01

    集卡调度问题是影响集装箱码头操作效率的重要决策问题.在同一时段对集装箱进行装卸作业的情况下,考虑到集卡调度优化问题,为此建立了以集卡运作时间最小的动态调度优化模型,该模型为码头装卸作业调度提供了决策支持.算例结果表明了该模型的有效性和实用性.%Yard truck scheduling is an important decision factor which influences the container terminal operation efficiency.Under the condition of synchronously handling operations both loading and unloading,an optimization problem of yard truck scheduling was studied.The problem was formulated as a yard truck dynamic scheduling model.The objective was to minimize the time of yard truck operation.The model was useful for the loading and unloading operation decision of scheduling in container terminals.The effectiveness and usefulness of the model were verified by a case.

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

  8. The morality of weapons research.

    Science.gov (United States)

    Forge, John

    2004-07-01

    I ask whether weapons research is ever justified. Weapons research is identified as the business of the engineer. It is argued that the engineer has responsibility for the uses to which the tools that he designs can be put, and that responsibility extends to the use of weapons. It is maintained that there are no inherently defensive weapons, and hence there is no such thing as 'defensive' weapons research. The issue then is what responsibilities as a professional the engineer has in regard to such research. An account is given to ground the injunction not to provide the means to harm as a duty for the engineers. This account is not, however, absolutist, and as such it allows justifiable exceptions. The answer to my question is thus not that weapons research is never justified but there must be a strong assurance that the results will only be used as a just means in a just cause.

  9. Mixed Tabu Search Algorithm for Dynamic Vehicle Scheduling Problem%基于TS的动态车辆调度问题的混合算法研究

    Institute of Scientific and Technical Information of China (English)

    袁建清

    2011-01-01

    对带时间窗的动态车辆调度问题进行分析,采用实时再优化方法进行研究,引入时间轴概念,建立动态车辆调度模型,并给出求解的混合禁忌搜索算法.该算法先用C-K节约算法求得初始解,然后用禁忌搜索进行优化,得到全局最优解.禁忌搜索算法中采用动态邻域移动方法构造候选解和动态禁忌长度选取策略设置紧急长度,提高算法的收敛速度.最后用实例证明该混合算法的可行性和有效性.%On the basis of studying dynamic vehicle scheduling problem with time windows, a dynamic vehicle scheduling mathematical model is established through introducing time axis concept and adopting real-time optimizing research methods. Then a mixture algorithm based on a C-K economical method and Tabu Search algorithm is designed to solve dynamic vehicle scheduling problem.This algorithm improves convergence speed by using dynamic candidate solutions constructor method and dynamic length selection strategy. Finally computational results are provided to show that the mixed Tabu Search algorithm is feasible and efficient.

  10. 32 CFR 234.10 - Weapons.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 2 2010-07-01 2010-07-01 false Weapons. 234.10 Section 234.10 National Defense... PENTAGON RESERVATION § 234.10 Weapons. (a) Except as otherwise authorized under this section, the following are prohibited: (1) Possessing a weapon. (2) Carrying a weapon. (3) Using a weapon. (b) This section...

  11. Handheld ultrasound concealed weapons detector

    Science.gov (United States)

    Felber, Franklin S.; Wild, Norbert C.; Nunan, Scott C.; Breuner, Dennis; Doft, Frank

    1998-12-01

    A handheld, battery-operated prototype of a remove concealed weapons detector has been built and tested. The concealed weapons detector will enable law enforcement and security officers to detect metallic and nonmetallic weapons concealed beneath clothing remotely from beyond arm's length to about 20 feet. These detectors may be used to: (1) allow hands-off, stand-off frisking of suspects for metallic and nonmetallic weapons; and (2) search for metallic and nonmetallic weapons on cooperative subjects at courthouse entrances and other monitored security portals. We have demonstrated that we image weapons concealed under heavy clothing, not just detect them, at ranges up to 15 feet using the same ultrasound frequency (40 kHz) used by commercial rangefinders. The concealed weapons detector operates much as a rangefinder, but at higher peak fluxes and pulse repetition frequencies. The detector alerts the user to concealed weapons audibly and visibly by detecting ultrasound glints above a body/clothing baseline, and by compensating for changing range and attenuation. The detector locates concealed weapons within a 6-inch illuminated spot at 10 feet. The signal processor eliminates any signal from behind the target.

  12. Weapons Neutron Research Facility (WNR)

    Data.gov (United States)

    Federal Laboratory Consortium — The Weapons Neutron Research Facility (WNR) provides neutron and proton beams for basic, applied, and defense-related research. Neutron beams with energies ranging...

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

  14. Weapons barrel life cycle determination

    Directory of Open Access Journals (Sweden)

    Nebojša Pene Hristov

    2013-10-01

    Full Text Available This article describes the dynamic processes within the gun barrel during the firing process in exploitation. It generally defines the basic principles of constructing tube elements, and shows the distortion of the basic geometry of the tube interior due to wear as well as the impact it causes during exploitation. The article also defines basic empirical models as well as a model based on fracture mechanics for the calculation of a use-life of the barrel, and other elements essential for the safe use of the barrel as the basic weapon element. Erosion causes are analysed in order to control and reduce wear and prolong the lifetime of the gun barrel. It gives directions for the reparation of barrels with wasted resources. In conclusion, the most influential elements of tube wear are given as well as possible modifications of existing systems, primarily propellant charges, with a purpose of prolonging lifetime of gun barrels. The guidelines for a proper determination of the lifetime based on the barrel condition assessment are given as well. INTRODUCTION The barrel as the basic element of each weapon is described as well as the processes occurring during the firing that have impulsive character and are accompanied by large amounts of energy. The basic elements of barrel and itheir constructive characteristics are descibed. The relation between Internal ballistics, ie calculation of the propellant gas pressure in the firing process, and structural elements defined by the barrel material resistance is shown. In general, this part of the study explains the methodology of the gun barrel structural elements calculation, ie. barrel geometry, taking into account the degrees of safety in accordance with Military Standards.   TUBE WEAR AND DEFORMATIONS The weapon barrel gradually wears out during exploitation due to which it no longer satisfies the set requirements. It is considered that the barrel has experienced a lifetime when it fails to fulfill the

  15. Insulin as a weapon.

    Science.gov (United States)

    Robinson, Samuel D; Safavi-Hemami, Helena

    2016-12-01

    The discovery of insulin and its use for the treatment of diabetes is undoubtedly one of the true successes of modern medicine. Injectable insulin would prove the first effective treatment for a previously incurable and usually fatal disease. Soon after however, the powerful effects of insulin overdose would be reported, and subsequently exploited for dubious medical and sometimes nefarious purposes. In this article we describe the discovery that certain venomous marine snails of the genus Conus also exploit the powerful effects of insulin overdose, employing it as a weapon for prey capture. Copyright © 2016 Elsevier Ltd. All rights reserved.

  16. 基于TBS时限分配的CAN动态调度方法%Dynamic scheduling of CAN bus based on TBS deadline allocation

    Institute of Scientific and Technical Information of China (English)

    张本宏; 韩江洪; 刘啸然; 王跃飞; 张利

    2012-01-01

    To avoid the mutual interference between periodic and non-periodic messages, and to guarantee the fairness of transmitting CAN messages, a dynamic scheduling method based on TBS deadline allocation (TDA-DS) is presented. In this method elementary time snot is introduced into TDA-DS to implement bottom-layer round-robin scheduling based on non-fixed cycle by transferring trigger message (TM) and stop message (ST). And total bandwidth server (TBS) is introduced to implement upper-layer dynamic priority mixed scheduling of periodic and non-periodic messages by Earliest Deadline First (EDF) algorithm. The simulation result indicates that the method can improve the real-time character of non-periodic messages as well as meet the schedulability of periodic messages.%为避免周期性和非周期性消息相互干扰,保证CAN总线消息传输公平性,提出了基于总带宽服务器时限分配的动态调度(TDA-DS)方法.引入基本时间片,以传输触发消息帧(TM)和结束帧(ST)实现底层基于非固定周期的时间片轮转调度;引入总带宽服务器(TBS),以最早时限优先算法(EDF)实现上层周期性和非周期性消息的动态优先级混合调度.仿真结果表明,该方法在满足周期性消息可调度性的同时提高了非周期性消息的实时性.

  17. Application of inertial confinement fusion to weapon technology

    Energy Technology Data Exchange (ETDEWEB)

    Toepfer, A.J.; Posey, L.D.

    1978-12-01

    This report reviews aspects of the military applications of the inertial confinement fusion (ICF) program at Sandia Laboratories. These applications exist in the areas of: (1) weapon physics research, and (2) weapon effects simulation. In the area of weapon physics research, ICF source technology can be used to study: (1) equations-of-state at high energy densities, (2) implosion dynamics, and (3) laboratory simulation of exoatmospheric burst phenomena. In the area of weapon effects simulation, ICF technology and facilities have direct near, intermediate, and far term applications. In the near term, short pulse x-ray simulation capabilities exist for electronic component effects testing. In the intermediate term, capabilities can be developed for high energy neutron exposures and bremsstrahlung x-ray exposures of components. In the far term, system level exposures of full reentry vehicles will be possible if sufficiently high pellet gains are achieved.

  18. Naval Weapons Station Earle Reassessment

    Science.gov (United States)

    2013-12-01

    surveys for their Section 110 compliance: Architectural Resources Survey, Naval Weapons Station Earle, Monmouth County, New Jersey (Louis Berger 1999...text within brackets. Berger Report 1999 Architectural Resources Survey, Naval Weapons Station Earle, Monmouth County, New Jersey (Louis Berger... architectural treatment of buildings at NWS Earle: a traditional vernacular theme with minimal decorative detailing. This so-called minimal traditional

  19. Proportionality and Autonomous Weapons Systems

    NARCIS (Netherlands)

    van den Boogaard, J.

    2015-01-01

    Given the swift technologic development, it may be expected that the availability of the first truly autonomous weapons systems is fast approaching. Once they are deployed, these weapons will use artificial intelligence to select and attack targets without further human intervention. Autonomous

  20. Proportionality and Autonomous Weapons Systems

    NARCIS (Netherlands)

    van den Boogaard, J.

    2015-01-01

    Given the swift technologic development, it may be expected that the availability of the first truly autonomous weapons systems is fast approaching. Once they are deployed, these weapons will use artificial intelligence to select and attack targets without further human intervention. Autonomous weap

  1. Musculoskeletal colloquialisms based on weapons.

    Science.gov (United States)

    Agrawal, Anuj

    2017-01-01

    Eponyms and colloquialisms are commonly used in orthopaedic literature and convey a great deal of information in a concise fashion. Several orthopaedic conditions have characteristic clinical or radiologic appearances, mimicking the appearance of certain arms or weapons. Most of these are easy to memorise and recognise, provided the orthopaedic surgeon is aware of the colloquialism and familiar with the appearance of the weapon on which it is based. Unfortunately, many such colloquialisms are based on traditional weapons no longer in current use, and their appearances are not familiar to most orthopaedists, creating confusion and difficulty in understanding them. In this paper, we have reviewed the musculoskeletal colloquialisms based on weapons, including a brief description of the weapon with illustrations, highlighting the importance of the colloquialism in diagnosis or treatment of musculoskeletal conditions.

  2. Nuclear weapon reliability evaluation methodology

    Energy Technology Data Exchange (ETDEWEB)

    Wright, D.L. [Sandia National Labs., Albuquerque, NM (United States)

    1993-06-01

    This document provides an overview of those activities that are normally performed by Sandia National Laboratories to provide nuclear weapon reliability evaluations for the Department of Energy. These reliability evaluations are first provided as a prediction of the attainable stockpile reliability of a proposed weapon design. Stockpile reliability assessments are provided for each weapon type as the weapon is fielded and are continuously updated throughout the weapon stockpile life. The reliability predictions and assessments depend heavily on data from both laboratory simulation and actual flight tests. An important part of the methodology are the opportunities for review that occur throughout the entire process that assure a consistent approach and appropriate use of the data for reliability evaluation purposes.

  3. Assessing Weapon System Acquisition Cycle Times: Setting Program Schedules

    Science.gov (United States)

    2015-06-01

    capability gaps (and when projected?) Materiel Sol. needed Materiel Dev . Decision Analysis of Alternatives (AoA) • Trade offs • Capability vs. cost...Force Protection Capability IDA Institute for Defense Analyses IOC Initial Operational Capability IOT &E Initial Operational Testing and Evaluation

  4. 一种编队控制的动态调整与规划方法%A Dynamic Regulation and Scheduling Scheme for Formation Control

    Institute of Scientific and Technical Information of China (English)

    陈余庆; 庄严; 王伟

    2007-01-01

    This article is concerned with cooperative control problems in formation of mobile robots under the nonholonomic constraints that certain geometrical constraints are imposed on multiple mobile robots throughout their travel. For this purpose, a new method of motion control for formation is presented, which is based on the dynamic regulation and scheduling scheme. It is attractive for its adaptability to the formation structure and desired trajectory. The quality of formation keeping can be evaluated by the instantaneous errors of formation offset and spacing distance. Some kinematics laws are developed to regulate and maintain the formation shape. Simulation results and data analysis show the validity of the proposed approach for a group of robots.

  5. Efficient Scheduling of Scientific Workflows with Energy Reduction Using Novel Discrete Particle Swarm Optimization and Dynamic Voltage Scaling for Computational Grids

    Directory of Open Access Journals (Sweden)

    M. Christobel

    2015-01-01

    Full Text Available One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation time may yield a cost effective energy consumption. Proficient scheduling of Bag-of-Tasks in the grid environment ravages in minimum computation time. In this paper, a novel discrete particle swarm optimization (DPSO algorithm based on the particle’s best position (pbDPSO and global best position (gbDPSO is adopted to find the global optimal solution for higher dimensions. This novel DPSO yields better schedule with minimum computation time compared to Earliest Deadline First (EDF and First Come First Serve (FCFS algorithms which comparably reduces energy. Other scheduling parameters, such as job completion ratio and lateness, are also calculated and compared with EDF and FCFS. An energy improvement of up to 28% was obtained when Makespan Conservative Energy Reduction (MCER and Dynamic Voltage Scaling (DVS were used in the proposed DPSO algorithm.

  6. Decision making for dynamic scheduling with flexible resource constraints%弹性资源约束的动态调度决策

    Institute of Scientific and Technical Information of China (English)

    徐赐军; 李爱平; 刘雪梅

    2011-01-01

    针对产品开发过程中由于活动变化导致原调度需要重新调整的问题,提出一种利用弹性资源特性进行动态调度决策的方法.以活动添加的变化为对象,根据活动间时序约束、资源约束等特点,分别构建时序冲突消解模型以及基于资源推拉技术的资源冲突消解模型,为提高活动冲突消解效率,提出一种虚拟前置活动和虚拟后续活动的构建方法,并确定动态调度决策指标值,最后通过船舶分段制造实例,验证了弹性资源约束的动态调度决策方法的可行性和有效性.%A dynamic scheduling strategy using the properties of flexible resource is presented for rescheduling problems caused by activity changes in product development process.Mainly to the adding activity in product development process,the timing-conflict resolution model and the resource-conflict resolution model based on resource Push-Pull technology are constructed according to the characteristics of timing constraints and resource constraints, respectively.In order to improve efficiency of conflict resolution, virtual upstream activity and virtual downstream activity are defined and their construction methods are given.Finally, the value of decision index for dynamic scheduling is calculated according to the duration of flexible resources under the condition of full load.The feasibility and effectiveness of the dynamic scheduling strategy with flexible resource constraints are demonstrated by an illustrative example showing block construction scheduling.

  7. 基于时延的动态优先级调度算法%Delay-Based Dynamic Priority Queue Scheduling

    Institute of Scientific and Technical Information of China (English)

    张登银; 许扬扬; 蒋娟

    2011-01-01

    队列管理是提高网络 QoS 的一种有效方法.在基于时延的调度算法(BDS)基础上将时间片与优先级相结合,提出了一种基于时延的动态优先级调度算法(DDPQS).为了实现该算法,针对进入缓冲区的每个子队列设置一个计数器,以调整的计数器值为基准来动态的改变队列的优先级,从而达到队列调度的效果;又从研究该算法的过程中,发现其局限性,即计数器值对时间片过于敏感的问题,于是进一步采用设置阈值进行区分的方法来优化.优化前后的仿真结果表明,时延和吞吐率性能具有明显改善.%Queue management is an effective method to improve the QoS of network. Investigating queue management based on the delay scheduling (BDS), combining the time chip and priority, advances Delay-based Dynamic Priority Queue Scheduling (DDPQS) algorithm. To achieve the algorithm, sets a counter for every sub-queue entering the buffer. It dynamically adjusts the sub-queue priorities by the value of counters to achieve the effect of queue scheduling. During the research, the limitation was found that the counters are sensitive to the time chip. The paper uses threshold values to optimize the algorithm. The simulation results before and after the optimizations demonstrate that the performance of the delay and the throughput rate has significantly improved.

  8. 一种动态的单组播集成调度算法%Dynamic Integrated Schedule Algorithm of Unicast and Multicast

    Institute of Scientific and Technical Information of China (English)

    任涛; 兰巨龙; 扈红超

    2011-01-01

    Most existing integrated unicast and multicast schedule algorithms can not keep high throughput when the ratio of unicast and multicast traffic changes, a dynamic integrated schedule algorithm of unicast and multicast is proposed. The algorithm is designed based on Input Queued(IQ) switch which is used widely. By monitoring the ratio of unicast and multicast traffic of the latest several time slots at the input port, it dynamically decides the integrated schedule scheme of unicast and multicast. Simulation results show that the unicast throughput, multicast throughput and overall throughput of the proposed algorithm are always higher than that of FILM and fSCIA, and the overall average delay of the proposed algorithm is also the best.%在单组播比例发生变化的情况下,现有单组播集成调度算法无法保持较高吞吐率.针对该问题,提出一种动态的单组播集成调度算法.基于输入排队(IQ)的交换结构,通过在输入端口处监测最近若干个时隙的单组播业务输入情况,动态决定当前的单组播集成调度策略.仿真结果表明,该算法的单播吞吐率、组播吞吐率和总体吞吐率均高于FILM算法和fSCIA算法,并具有较好的时延性能.

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

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

  11. Youths Carrying a Weapon or Using a Weapon in a Fight: What Makes the Difference?

    Science.gov (United States)

    Thurnherr, Judit; Michaud, Pierre-Andre; Berchtold, Andre; Akre, Christina; Suris, Joan-Carles

    2009-01-01

    The objective of this study was to characterize weapon-carrying adolescents and to assess whether weapon carriers differ from weapon users. Data were drawn from a cross-sectional school-based survey of 7548 adolescents aged 16-20 years in Switzerland. Youths carrying a weapon were compared with those who do not. Subsequently, weapon carriers were…

  12. Variable-mass Thermodynamics Calculation Model for Gas-operated Automatic Weapon%Variable-mass Thermodynamics Calculation Model for Gas-operated Automatic Weapon

    Institute of Scientific and Technical Information of China (English)

    陈建彬; 吕小强

    2011-01-01

    Aiming at the fact that the energy and mass exchange phenomena exist between barrel and gas-operated device of the automatic weapon, for describing its interior ballistics and dynamic characteristics of the gas-operated device accurately, a new variable-mass thermodynamics model is built. It is used to calculate the automatic mechanism velocity of a certain automatic weapon, the calculation results coincide with the experimental results better, and thus the model is validated. The influences of structure parameters on gas-operated device' s dynamic characteristics are discussed. It shows that the model is valuable for design and accurate performance prediction of gas-operated automatic weapon.

  13. Risk in the Weapons Stockpile

    Energy Technology Data Exchange (ETDEWEB)

    Noone, Bailey C [Los Alamos National Laboratory

    2012-08-14

    When it comes to the nuclear weapons stockpile, risk must be as low as possible. Design and care to keep the stockpile healthy involves all aspects of risk management. Design diversity is a method that helps to mitigate risk.

  14. The Weaponization of Social Media

    Science.gov (United States)

    2016-06-10

    media efforts will be compared to similar Western business and civic social media centric marketing efforts from both a technical and theoretical...THE WEAPONIZATION OF SOCIAL MEDIA A thesis presented to the Faculty of the U.S. Army Command and General Staff College in...The Weaponization of Social Media 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Jack B. Irby III, MAJ 5d

  15. OIL AS POLITICAL WEAPON

    Directory of Open Access Journals (Sweden)

    Mariana, BUICAN

    2013-12-01

    Full Text Available Oil (called by some black gold has not always been as coveted and used, but only in the last hundred years has established itself as a highly sought after as an indispensable proper functioning of modern economic activity that an important factor in international politics. International oil regime has changed in the last decades. In 1960, oil regime was a private oligopol which had links with governments main consuming countries. By then the price of a barrel of oil was two U.S. dollars and seven major transnational oil companies decided the amount of oil that will be produced. Meanwhile the world region with the largest oil exports were more strongly expressed nationalism and decolonization. Result, it was so in the late 60s in the region occur independent states. They have created an organization aim of this resource to their advantage - OPEC (Organization of Petroleum Exporting Countries. Thus since 1973 there have been changes in the international regime governing oil field, namely producing countries were fixed production rate and price. After this time the oil weapon has become increasingly important in the management of international relations. Oil influenced the great powers to Middle East conflicts that occurred in the last century, but their attitude about the emergence of new sources of oil outside OPEC. In the late 90's, Russia has become a major supplier of oil to the West.

  16. A Scheduler for Hadoop Based on Dynamic Resource Collection%一种基于动态资源采集的 Hadoop作业调度算法

    Institute of Scientific and Technical Information of China (English)

    彭志伟; 谷建华

    2014-01-01

    In order to overcome the problem of wasting of resources in hadoop cluser based on the slot resource model ,a scheduler based on the dynamic resource collection has been proposed .According to collect theCPU , Memory and IO resource utilization of part of tasks in the hadoop job ,We estimate the resource demand of the rest tasks in the job ,and then schedule these tasks according to their resource demand and the load of every Tasktracker . The contrast experiment shows the scheduler we proposed can increase the resource utilization of the hadoop cluser and reduce the completion time of the Hadoop job .%为了克服 Hadoop中基于槽的资源模型对集群资源的浪费,提高 Hadoop集群的资源利用率,提出了一种基于动态资源采集的 Hadoop作业调度算法。通过在作业运行过程中动态采集部分任务的CPU ,内存和IO的资源利用率来评估同一作业中其他任务的资源需求,然后根据任务的实际资源需求以及 TaskTracker节点的负载情况进行任务调度,以充分利用各TaskTracker节点的计算资源。通过对比实验表明该调度算法能明显提高集群的资源利用率,缩短作业的完成时间。

  17. An Algorithm of Dynamic Vehicle Scheduling Problem Based on Approximate Dynamic Programming%基于近似动态规划的动态车辆调度算法

    Institute of Scientific and Technical Information of China (English)

    李雪; 聂兰顺; 齐文艳; 战德臣

    2015-01-01

    针对物流配送服务业中,车辆调度问题日渐呈现任务规模大,车辆类型多、属性多,调度实时性要求越来越高等特点,提出了基于近似动态规划的动态车辆调度算法。根据当前的任务需求与车辆状态以及相应的约束条件作出相应的调度,并且对一些样本进行训练,得到了一个近似价值函数。通过该价值函数,即可对任务迅速作出相应的决策。仿真模拟实验证明了该算法的有效性和优越性。%Vehicle scheduling in service industry of logistics distribution was presenting features including the tasks tended to be of large scale,vehicles were multi-type and had multiple attributes as well as high demands for real-time scheduling.To solve these problems,this paper proposed a dy-namic vehicle scheduling algorithm based on the approximate dynamic programming.An approximate value function was obtained through training of some samples,and according to mission require-ments,vehicle state and conditions,and quick scheduling decisions could be made with the value func-tion.The simulation test has proved the correctness and effectiveness of the algorithm.

  18. 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.%针对任务、资源、航路的调度与规划需要,建立了一种分层递阶的任务规划系统结构,上层主要解决任务优先级和冲突消解问题;下层主要解决满足各种要求的航路规划与实时重规划问题.提出了启发式动态任务调度与航路实时规划算法,可以有效提高对各种突发事件的态势自适应和冲突消解能力以及对时敏目标的打击能力,进而提高无人机在动态不确定环境下的自主性.

  19. Recent reinforcement-schedule research and applied behavior analysis

    OpenAIRE

    Lattal, Kennon A; Neef, Nancy A

    1996-01-01

    Reinforcement schedules are considered in relation to applied behavior analysis by examining several recent laboratory experiments with humans and other animals. The experiments are drawn from three areas of contemporary schedule research: behavioral history effects on schedule performance, the role of instructions in schedule performance of humans, and dynamic schedules of reinforcement. All of the experiments are discussed in relation to the role of behavioral history in current schedule pe...

  20. OPERATION GREENHOUSE. Scientific Director’s Report of Atomic Weapon Tests at Eniwetok, 1951, Annex 9.5. Base Facilities

    Science.gov (United States)

    1951-09-01

    pursued. The manpower question became more pressing in the light of the scheduling losses sustained during the suspension of shipping. By the...in operation were the following: 55 jeeps, 12 Cushman scooters , 9 cargo trucks, 19 pickup trucks, 26 weapons carriers, 3 fire trucks, 21 dump...and personnel carriers — including pickups, weapons carriers, jeeps, and motor scooters . As a result of these inspections, necessary re- pairs were

  1. 动态调度的研究方法综述%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等。对动态调度的各种研究方法逐一进行分析,并指出该领域应进一步研究的问题和未来的可能发展方向。

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

  3. The Effects of Nuclear Weapons

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, Samuel

    1964-02-01

    This book is a revision of "The Effects of Nuclear Weapons" which was issued in 1957. It was prepared by the Defense Atomic Support Agency of the Department of Defense in coordination with other cognizant governmental agencies and was published by the U.S. Atomc Energy Commission. Although the complex nature of nuclear weapons effects does not always allow exact evaluation, the conclusions reached herein represent the combined judgment of a number of the most competent scientists working the problem. There is a need for widespread public understanding of the best information available on the effects of nuclear weapons. The purpose of this book is to present as accurately as possible, within the limits of national security, a comprehensive summary of this information.

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

    Science.gov (United States)

    2016-03-24

    65  x Figure 22: Pie Chart of Standard Betas ... Corporation found that increases in schedule effort tend to be the reason for increases in the cost of acquiring a new weapons system due to, at a minimum...in-depth finance and schedule data for selected programs (Brown et al., 2015). We also give extra focus on Research Development Test & Evaluation

  5. The Effects of Nuclear Weapons

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, Samuel

    1957-06-01

    This handbook prepared by the Armed Forces Special Weapons Project of the Department of Defense in coordination with other cognizant government agencies and published by the United States Atomic Energy Commission, is a comprehensive summary of current knowledge on the effects of nuclear weapons. The effects information contained herein is calculated for yields up to 20 megatons and the scaling laws for hypothetically extending the calculations beyond this limit are given. The figure of 20 megatons however is not be taken as an indication of capabilities or developments.

  6. Computation of Weapons Systems Effectiveness

    Science.gov (United States)

    2013-09-01

    Aircraft Dive Angle : Initial Weapon Release Velocity at x-axis VOx VOz x: x-axis z: z-axis : Initial Weapon Release Velocity at z...altitude Impact Velocity (x− axis), Vix = VOx (3.4) Impact Velocity (z− axis), Viz = VOz + (g ∗ TOF) (3.5) Impact Velocity, Vi = �Vix2 + Viz2 (3.6...compute the ballistic partials to examine the effects that varying h, VOx and VOz have on RB using the following equations: ∂RB ∂h = New RB−Old RB

  7. Testing three explanations of the emergence of weapon carrying in peer context: the roles of aggression, victimization, and the social network.

    Science.gov (United States)

    Dijkstra, Jan Kornelis; Gest, Scott D; Lindenberg, Siegwart; Veenstra, René; Cillessen, Antonius H N

    2012-04-01

    To examine the relative contribution of weapon carrying of peers, aggression, and victimization to weapon carrying of male and female adolescents over time. Data were derived from a population-based sample of male (N = 224) and female (N = 244) adolescents followed from grade 10 (M age = 15.5) to grade 11 (M age = 16.5). Peer networks were derived from best friend nominations. Self-reports were used to assess weapon carrying. Aggression and victimization were assessed using both self- and peer-reports. Use of dynamic social network modeling (SIENA) allowed prediction of weapon carrying in grade 11 as a function of weapon carrying of befriended peers, aggression, and victimization in grade 10, while selection processes and structural network effects (reciprocity and transitivity) were controlled for. Peer influence processes accounted for changes in weapon carrying over time. Self-reported victimization decreased weapon carrying 1 year later. Peer-reported victimization increased the likelihood of weapon carrying, particularly for highly aggressive adolescents. Boys were more likely to carry weapons than girls, but the processes associated with weapon carrying did not differ for boys and girls. These findings revealed that, in this population-based sample, weapon carrying of best friends, as well as aggression, contributed to the proliferation of weapons in friendship networks, suggesting processes of peer contagion as well as individual vulnerability to weapon carrying. Copyright © 2012 Society for Adolescent Health and Medicine. Published by Elsevier Inc. All rights reserved.

  8. Multi-day activity scheduling reactions to planned activities and future events in a dynamic model of activity-travel behavior

    Science.gov (United States)

    Nijland, Linda; Arentze, Theo; Timmermans, Harry

    2014-01-01

    Modeling multi-day planning has received scarce attention in activity-based transport demand modeling so far. However, new dynamic activity-based approaches are being developed at the current moment. The frequency and inflexibility of planned activities and events in activity schedules of individuals indicate the importance of incorporating those pre-planned activities in the new generation of dynamic travel demand models. Elaborating and combining previous work on event-driven activity generation, the aim of this paper is to develop and illustrate an extension of a need-based model of activity generation that takes into account possible influences of pre-planned activities and events. This paper describes the theory and shows the results of simulations of the extension. The simulation was conducted for six different activities, and the parameter values used were consistent with an earlier estimation study. The results show that the model works well and that the influences of the parameters are consistent, logical, and have clear interpretations. These findings offer further evidence of face and construct validity to the suggested modeling approach.

  9. 区分服务网络队列调度策略的研究与仿真%RESEARCHING AND SIMULATING DYNAMIC QUEUE SCHEDULING IN DiffServ NETWORK

    Institute of Scientific and Technical Information of China (English)

    关学铭; 刘种

    2011-01-01

    In this paper we make a study on several queue scheduling algorithms in DiflServ network and put forward a dynamic queue scheduling strategy to improve the efficiency of the queue forwarding. Dynamic queue management is achieved by dynamically adjusting the queue weight so as to have the network resources utilisation improved and the QoS in DiffServ network meliorated. The queue scheduling algorithm is simulated by NS2 and experiment results show that the dynamic queue scheduling algorithm can effectively improve the DiffServ network data forwarding efficiency.%针对目前几种DiffServ( Differentiated Service)网络队列调度算法进行研究,提出一种动态队列调度策略来提高队列转发效率.通过动态调整队列权值实现队列的动态管理,从而改进网络资源的利用效率,改善DiffServ网络QoS.利用NS2模拟动态队列调度算法,实验表明动态队列调度算法有效地提高了区分服务网络的队列转发效率.

  10. Two Improved EDF Dynamic Scheduling Algorithms in Soft Real-Time Systems%两种改进的EDF软实时动态调度算法

    Institute of Scientific and Technical Information of China (English)

    李琦; 巴巍

    2011-01-01

    软实时系统中,任务的随意抢占浪费了CPU资源,过多的任务丢失降低了系统的调度性能.文章引入"动态模糊阈值"概念,提出了两种新的类似EDF调度的模糊阈值调度算法.两种算法在任务执行过程中,分别通过缩短和延长当前任务截止期至动态模糊阈值的方法节约资源、提高任务完成率.给出模糊阈值的临界值计算公式,分析算法的可调度性,进行仿真与性能分析比较.结果表明,与EDF调度算法比较,两种算法有效地提高了重要任务的完成率,当截止期被延长时,任务的错失率明显降低,当截止期被缩短时,任务间的切换次数大大减少.因此,新算法提高了CPU的利用率,改善了系统的实时性能.%In soft real-time systems, the CPU resource is wasted by switching optionally and the schedulability of the system is decreased by the losing of overmany tasks.The concept of dynamic fuzzy threshold is introduced in this paper, based on which two improved EDF scheduling algorithms are proposed.The deadline of the executing task is delayed to save the resource in one algorithm and is shorten to increase the ratio of success in the other.In this paper, the formulae of the critical value for fuzzy threshold are given and the schedulability is discussed.Finally, the performance of the algorithms is experimentally examined and compared with the EDF algorithm in detail.Results show that, the ratio of success for important tasks is increased efficiently by using these two methods.The missed deadline percentage is decreased obviously while the deadline is delayed and the switching number is reduced greatly while the deadline is shorten.Therefore, by using the new algorithms, the ratio of CPU utilization is enhanced and the real-time capability of the system is improved.

  11. A Dynamic Scheduling Algorithm Based on UWB in Wearable Network%一种基于UWB穿戴式网络的调度算法

    Institute of Scientific and Technical Information of China (English)

    夏兵; 李光耀

    2014-01-01

    Wearable computer is a hot research topic in recent years;however multiple nodes communication between each other in weara-ble network has been the important impact of the development of wearable computer. So it is necessary to improve the wearable network communication. The wearable computers and wearable network are introduced,discussing several kinds of network technologies which are frequently used in the wearable network. And then introduced the UWB ( Ultra-Wide Band) structure model,and UWB communication mechanism,and a dynamic scheduling algorithm based on UWB in wearable network is introduced which has priority in the scheduling al-gorithm. This scheduling algorithm can improve the performance between each nodes in wearable network and help promote the develop-ment of wearable computer.%可穿戴式计算机是近几年的一个研究热点,穿戴式网络多个节点之间的协调通信一直是影响穿戴式计算机发展的一个重要原因,因此有必要对穿戴式网络通信进行优化。文中介绍了可穿戴式计算机以及穿戴式网络。论述了穿戴式网络中常用的几种网络技术的优缺点。然后重点解析了UWB(Ultra-Wide Band)的结构模型,以及UWB通信机制,在UWB通信机制的基础上引入了动态调度的思想,由此引出具有优先级的动态UWB网络调度算法。此调度算法能够很好地协调穿戴式网络节点之前的通信,有利于推进可穿戴式计算机的发展。

  12. 32 CFR 1903.10 - Weapons.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 6 2010-07-01 2010-07-01 false Weapons. 1903.10 Section 1903.10 National... INSTALLATIONS § 1903.10 Weapons. (a) Except as provided in paragraph (c) of this section, knowingly possessing or causing to be present a weapon on an Agency installation, or attempting to do so is prohibited. (b...

  13. 48 CFR 25.301-3 - Weapons.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Weapons. 25.301-3 Section... FOREIGN ACQUISITION Contracts Performed Outside the United States 25.301-3 Weapons. The contracting officer shall follow agency procedures and the weapons policy established by the combatant commander or...

  14. Handheld Concealed Weapons Detector Development

    Science.gov (United States)

    2003-03-01

    Enforcement, Edward M. Carapezza, Donald Spector, Eds., Proc. SPIE 2938, 110 - 119 (1997). 3. Franklin Felber, Norbert Wild, Scott Nunan , Dennis Breuner... Nunan , D. Breuner, and F. Doft, "Handheld Ultrasound Concealed-Weapons Detector," in Enforcement and Security Technologies, A. Trent DePersia, J. J

  15. [Modern pneumatic weapons and injuries they cause].

    Science.gov (United States)

    Kozachenko, I N

    2013-01-01

    The data on the history of development and further improvement of pneumatic weapons are presented with special reference to specific features of different types and varieties of these weapons, cartridges for them, and the sphere of their application. Investigations into peculiarities of damages caused by high-capacity pneumatic weapons to the objects of forensic medical expertise affected from different distances are reviewed. Results of forensic medical expertise and clinical studies on the structure of body injuries inflicted by gunshots from pneumatic weapons to the human body are discussed. The author emphasizes the necessity of developing up-to-date terminology and classification of gunshot injuries caused by shooting from pneumatic weapons.

  16. The tale of the shrinking weapon: seasonal changes in nutrition affect weapon size and sexual dimorphism, but not contemporary evolution.

    Science.gov (United States)

    Miller, C W; McDonald, G C; Moore, A J

    2016-11-01

    Sexually selected traits are often highly variable in size within populations due to their close link with the physical condition of individuals. Nutrition has a large impact on physical condition, and thus, any seasonal changes in nutritional quality are predicted to alter the average size of sexually selected traits as well as the degree of sexual dimorphism in populations. However, although traits affected by mate choice are well studied, we have a surprising lack of knowledge of how natural variation in nutrition affects the expression of sexually selected weapons and sexual dimorphism. Further, few studies explicitly test for differences in the heritability and mean-scaled evolvability of sexually selected traits across conditions. We studied Narnia femorata (Hemiptera: Coreidae), an insect where males use their hind legs as weapons and the femurs are enlarged, to understand the extent to which weapon expression, sexual dimorphism and evolvability change across the actual range of nutrition available in the wild. We found that insects raised on a poor diet (cactus without fruit) are nearly monomorphic, whereas those raised on a high-quality diet (cactus with ripe fruit) are distinctly sexually dimorphic via the expression of large hind leg weapons in males. Contrary to our expectations, we found little evidence of a potential for evolutionary change for any trait measured. Thus, although we show weapons are highly condition dependent, and changes in weapon expression and dimorphism could alter evolutionary dynamics, our populations are unlikely to experience further evolutionary changes under current conditions. © 2016 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2016 European Society For Evolutionary Biology.

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

  18. Why Sexually Selected Weapons Are Not Ornaments.

    Science.gov (United States)

    McCullough, Erin L; Miller, Christine W; Emlen, Douglas J

    2016-10-01

    The elaboration and diversification of sexually selected weapons remain poorly understood. We argue that progress in this topic has been hindered by a strong bias in sexual selection research, and a tendency for weapons to be conflated with ornaments used in mate choice. Here, we outline how male-male competition and female choice are distinct mechanisms of sexual selection, and why weapons and ornaments are fundamentally different types of traits. We call for research on the factors contributing to weapon divergence, the potential for male-male competition to drive speciation, and the specific use of weapons in the context of direct fights versus displays. Given that weapons are first and foremost fighting structures, biomechanical approaches are an especially promising direction for understanding weapon design. Copyright © 2016 Elsevier Ltd. All rights reserved.

  19. 求解动态车辆调度问题的混合禁忌搜索算法%HYBRID TABU SEARCH ALGORITHM FOR SOLVING DYNAMIC VEHICLE SCHEDULING

    Institute of Scientific and Technical Information of China (English)

    袁建清

    2012-01-01

    On the basis of analysing dynamic vehicle scheduling problem with time windows, a dynamic vehicle scheduling mathematical model based on time axis is proposed by introducing the concept of virtual point and time axis. A hybrid tabu algorithm based on C-W algorithm and tabu algorithm is designed to solve the problem, which uses the candidate solutions constructed with dynamic method and the dynamic tabu length selection strategy to improve convergence speed. Then the test instances are provided to demonstrate that the hybrid tabu search algorithm is effective and feasible in solving dynamic vehicle scheduling problem.%对带时间窗的动态车辆调度问题进行分析,引入虚拟点和时间轴概念,建立基于时间轴的动态车辆调度模型,并提出基于C-W节约法和禁忌搜索的混合禁忌搜索算法进行求解.算法中使用动态方法构造候选解和动态禁忌长度的选取策略来提高算法的收敛速度,最后通过测试实例验证了该混合算法解决动态车辆调度问题的有效性和可行性.

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

  1. Operando lithium plating quantification and early detection of a commercial LiFePO4 cell cycled under dynamic driving schedule

    Science.gov (United States)

    Anseán, D.; Dubarry, M.; Devie, A.; Liaw, B. Y.; García, V. M.; Viera, J. C.; González, M.

    2017-07-01

    Lithium plating is considered one of the most detrimental phenomenon in lithium ion batteries (LIBs), as it increases cell degradation and might lead to safety issues. Plating induced LIB failure presents a major concern for emerging applications in transportation and electrical energy storage. Hence, the necessity to operando monitor, detect and analyze lithium plating becomes critical for safe and reliable usage of LIB systems. Here, we report in situ lithium plating analyses for a commercial graphite||LiFePO4 cell cycled under dynamic stress test (DST) driving schedule. We designed a framework based on incremental capacity (IC) analysis and mechanistic model simulations to quantify degradation modes, relate their effects to lithium plating occurrence and assess cell degradation. The results show that lithium plating was induced by large loss of active material on the negative electrode that eventually led the electrode to over-lithiate. Moreover, when lithium plating emerged, we quantified that the loss of lithium inventory pace was increased by a factor of four. This study illustrates the benefits of the proposed framework to improve lithium plating analysis. It also discloses the symptoms of lithium plating formation, which prove valuable for novel, online strategies on early lithium plating detection.

  2. History of Laser Weapon Research

    Science.gov (United States)

    2012-01-01

    surgery/medicine, hair re- moval, presentation pointers, law enforcement, ranging and sighting devices, welding applications, and much more. Using...other laser technology develop- ments. The first chemical laser, hydrogen fluoride ( HF ), was built in 1965, producing 1 kW. It was then that DoD became...energy laser (HEL) weapons. In industry, the more powerful CO2 lasers are used for weld - ing, drilling, and cutting. There are many different types

  3. Deterrence and Cyber-Weapons

    Science.gov (United States)

    2013-03-01

    67, no. 4 (2012): 41. 4 Scott Shackelford , “Estonia Three Years Later,” Journal of Internet Law 8, no. 13 (2010): 25. 3 weapons were employed...effects of 134 Scott Shackelford , “From Nuclear War to Net War: Analogizing Cyber-Attacks in...International Law,” (unpublished paper, Stanford University), 5-6. 135 Shackelford , unpublished paper, 76. 136 Ibid., 73. 137 Mary Ellen O’Connell, “Cyber

  4. A scheduling framework applied to digital publishing workflows

    Science.gov (United States)

    Lozano, Wilson; Rivera, Wilson

    2006-02-01

    This paper presents the advances in developing a dynamic scheduling technique suitable for automating digital publishing workflows. Traditionally scheduling in digital publishing has been limited to timing criteria. The proposed scheduling strategy takes into account contingency and priority fluctuations. The new scheduling algorithm, referred to as QB-MUF, gives high priority to jobs with low probability of failing according to artifact recognition and workflow modeling critera. The experimental results show the suitability and efficiency of the scheduling strategy.

  5. Comparison of dynamic scheduling policies for hybrid make-to-order and make-to-stock production systems with stochastic demand

    NARCIS (Netherlands)

    Soman, Chetan Anil; van Donk, Dirk Pieter; Gaalman, Gerard

    2006-01-01

    We examine the previously under-researched problem of scheduling a single stage, capacitated, hybrid make-to-order (MTO) and make-to-stock (MTS) production system with stochastic demand. We build on the Economic Lot Scheduling Problem (ELSP) literature and make some modifications to incorporate MTO

  6. Small Arms - Hand and Shoulder Weapons and Machine Guns

    Science.gov (United States)

    2016-06-24

    77 4.20.2 Altitude (Low Air Pressure) ............................................... 78 4.20.3 Proof Firing...test weapon. The chamber is provided with the same dust feeder and electric blower as for the dynamic chamber. Vents are provided to relieve any...USDA permit for ATCC 11797 which is considered a plant pathogen. See USDA site for permit information). 4.20.2 Altitude (Low Air Pressure

  7. 36 CFR 2.4 - Weapons, traps and nets.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 1 2010-07-01 2010-07-01 false Weapons, traps and nets. 2.4... PROTECTION, PUBLIC USE AND RECREATION § 2.4 Weapons, traps and nets. (a)(1) Except as otherwise provided in... prohibited: (i) Possessing a weapon, trap or net (ii) Carrying a weapon, trap or net (iii) Using a weapon...

  8. Agent-based scheduling for aircraft deicing

    NARCIS (Netherlands)

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

    2006-01-01

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

  9. Optimization of Aimpoints for Coordinate Seeking Weapons

    Science.gov (United States)

    2015-09-01

    process. The program works by first taking in the number of weapons used and arranging them in a fixed uniform spacing on a circle centered on the...MATLAB program is used as the coding tool for the development of this algorithm and the optimization process. The program works by first taking in the...number of weapons used and arranging them in a fixed uniform spacing on a circle centered on the assumed target location. Then, the weapon

  10. New weapons and the arms race

    Energy Technology Data Exchange (ETDEWEB)

    Tsipis, K.

    1983-01-01

    In speaking about technologies that could further animate the weapons competition between the US and the USSR, it is useful to distinguish between technologies that have already been incorporated into specific weapons systems, and new technologies that are of a generic nature, can be used in a variety of applications, and can best be described by the tasks that they can perform rather than any specific weapons' application. The author discusses these in reverse order.

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

  12. A different kind of weapon focus: simulated training with ballistic weapons reduces change blindness

    OpenAIRE

    Taylor, J. Eric T.; Witt, Jessica K.; Pratt, Jay

    2017-01-01

    Attentional allocation is flexibly altered by action-related priorities. Given that tools – and specifically weapons – can affect attentional allocation, we asked whether training with a weapon or holding a weapon during search would affect change detection. In three experiments, participants searched for changes to agents, shootable objects, or environments in the popular flicker paradigm. Participants trained with a simulated weapon or watched a video from the same training perspective and ...

  13. OPTIMIZING PERFORMANCE CAPACITY IN WOMEN’S HAMMER THROW, BASED ON A JUST SCHEDULING OF ACTION MEANS AND A RATIONAL DYNAMIC OF TRAINING EFFORT PARAMETERS – CASE STUDY

    Directory of Open Access Journals (Sweden)

    Grigore Ursanu

    2016-09-01

    Full Text Available The attaining and maintenance of maximum performance capacity level throughout the most important events of a competitive season represent major objectives of modern training methodology. Hence, I considered it necessary to conduct a study on the particularities of achieving this goal in women’s hammer throw, by analyzing a training macrocycle of the best thrower Romania has ever had in this event. My aim was to turn this research into a thorough debate topic, considering that sports performances of Romanian athletes have decreased significantly within the past few years. My scientific endeavour is designed as a case study concerning the means and methods used to develop dominant motor skills and the dynamic of the main effort parameters within the training macrocycle comprising the major competitions attended by the research subject. The starting point of this study was the following hypothesis: a correct and rational scheduling of the main training means and an optimal ratio between the main effort parameters (volume and intensity guarantee an optimal athletic form for a previously set date. Calculations made to this end were meant to highlight the training demands for each period of the macrocycle, with a focus of the main stage within the competitive season. The analysis conduct led to several conclusions, which may represent reference points for the future training of this female athlete or of other athletes. The most important of these conclusions is that the athletic form phenomenon represents the result of an optimal ratio between the main effort parameters, considering the training process as a whole (where exercise capacity recovery becomes a core component of sports training.

  14. Dynamic Scheduling Model of XEN Virtual Machine in Multi-core System%多核平台下XEN虚拟机动态调度算法研究

    Institute of Scientific and Technical Information of China (English)

    黄漾

    2014-01-01

    The virtual machine scheduling algorithm doesn’t fully consider the execution efficiency of parallel applica-tion.Modern processors have multiple available computing core,so that concurrent execution of multiple virtual machines become a reality.In this paper,a parallel multicore platform virtual machine scheduling problems,Presents a task-based Virtual Machine CON-Credit scheduling algorithm.The algorithm in the scheduling of parallel tasks,Dynamically allocated using a computer core,using the traditional virtual machine scheduling algorithm to perform common tasks allocated virtual machines;Using custom synchronization algorithm to perform parallel tasks assigned virtual machine.Related experiments show,CON-Credit scheduling algorithm can significantly improve the efficiency of the parallel task execution.%虚拟机调度算法对并行任务的执行效率考虑不够充分。现代处理器平台具备了多个可用的计算核心,使多个虚拟机并发执行成为了现实。针对多核平台下的并行虚拟机调度优化问题,提出一种基于任务特征虚拟机CON-Credit调度算法。该算法在调度并行任务时,使用动态方式对计算机核心进行分配,采用传统的虚拟机调度算法为执行普通任务的虚拟机进行分配;采用定制的同步算法给执行并行任务的虚拟机分进分配。相关实验显示,CON-Credit调度算法能显著提高并行任务的执行效率。

  15. 76 FR 6087 - Draft Weapons Safety Assessment on the Use of Enhanced Weapons; Notice of Availability and...

    Science.gov (United States)

    2011-02-03

    ... Draft Weapons Safety Assessment on the Use of Enhanced Weapons; Notice of Availability and Request for... ``Weapons Safety Assessment'' (WSA). This guidance would be used by licensees and certificate holders applying to the NRC to obtain enhanced weapons under the NRC's proposed rule titled ``Enhanced Weapons...

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

  17. Minimally disruptive schedule repair for MCM missions

    Science.gov (United States)

    Molineaux, Matthew; Auslander, Bryan; Moore, Philip G.; Gupta, Kalyan M.

    2015-05-01

    Mine countermeasures (MCM) missions entail planning and operations in very dynamic and uncertain operating environments, which pose considerable risk to personnel and equipment. Frequent schedule repairs are needed that consider the latest operating conditions to keep mission on target. Presently no decision support tools are available for the challenging task of MCM mission rescheduling. To address this capability gap, we have developed the CARPE system to assist operation planners. CARPE constantly monitors the operational environment for changes and recommends alternative repaired schedules in response. It includes a novel schedule repair algorithm called Case-Based Local Schedule Repair (CLOSR) that automatically repairs broken schedules while satisfying the requirement of minimal operational disruption. It uses a case-based approach to represent repair strategies and apply them to new situations. Evaluation of CLOSR on simulated MCM operations demonstrates the effectiveness of case-based strategy. Schedule repairs are generated rapidly, ensure the elimination of all mines, and achieve required levels of clearance.

  18. Self-Healing Distributed Scheduling Platform

    OpenAIRE

    Frincu M.E.; Villegas N.M.; Petcu D.; Muller H.A.; Rouvoy R.

    2011-01-01

    International audience; Distributed systems require effective mechanisms to manage the reliable provisioning of computational resources from different and distributed providers. Moreover, the dynamic environment that affects the behaviour of such systems and the complexity of these dynamics demand autonomous capabilities to ensure the behaviour of distributed scheduling platforms and to achieve business and user objectives. In this paper we propose a self-adaptive distributed scheduling platf...

  19. Heuristic Based Task Scheduling In Grid

    Directory of Open Access Journals (Sweden)

    Manpreet Singh

    2012-09-01

    Full Text Available Grid computing is concerned with coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Efficient scheduling of complex applications in a grid environment reveals several challenges due to its high heterogeneity, dynamic behavior and space shared utilization. Objectives of scheduling algorithms are increase in system throughput, efficiency and reduction in task completion time. The main focus of this paper is to highlight the merits of resource and task selection technique based on certain heuristics.

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

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

  2. [Myocardial infarction after conduction electrical weapon shock].

    Science.gov (United States)

    Ben Ahmed, H; Bouzouita, K; Selmi, K; Chelli, M; Mokaddem, A; Ben Ameur, Y; Boujnah, M R

    2013-04-01

    Controversy persists over the safety of conducted electrical weapons, which are increasingly used by law enforcement agencies around the world. We report a case of 33-year-old man who had an acute inferior myocardial infarction after he was shot in the chest with an electrical weapon. Copyright © 2012 Elsevier Masson SAS. All rights reserved.

  3. Radioactive Fallout From Nuclear Weapons Testing ...

    Science.gov (United States)

    2017-08-07

    Detonating nuclear weapons above ground sends radioactive materials into the atmosphere from the ground level up to very high elevations. Overtime, these materials settle out of the atmosphere and fall to the ground. Fallout typically contains hundreds of different radionuclides. Since the end of aboveground nuclear weapons testing, radionuclides have largely decayed away.

  4. Color image fusion for concealed weapon detection

    NARCIS (Netherlands)

    Toet, A.

    2003-01-01

    Recent advances in passive and active imaging sensor technology offer the potential to detect weapons that are concealed underneath a person's clothing or carried along in bags. Although the concealed weapons can sometimes easily be detected, it can be difficult to perceive their context, due to the

  5. Weapons Acquisition. Processes of Selected Foreign Government.

    Science.gov (United States)

    1986-02-01

    period from 1977 to 1985: (1) 5.56mm calibre assault rifle. (2) Milan and Hot antitank weapon systems. (3) Roland ground-to-air weapon system. (4) AMX 30...and standardization edicts . Awards and penalties are laid on accordingly. (7/17, 13/20) The ministries stand apart from one another in the same way

  6. Nuclear weapons, nuclear effects, nuclear war

    Energy Technology Data Exchange (ETDEWEB)

    Bing, G.F.

    1991-08-20

    This paper provides a brief and mostly non-technical description of the militarily important features of nuclear weapons, of the physical phenomena associated with individual explosions, and of the expected or possible results of the use of many weapons in a nuclear war. Most emphasis is on the effects of so-called ``strategic exchanges.``

  7. Color image fusion for concealed weapon detection

    NARCIS (Netherlands)

    Toet, A.

    2003-01-01

    Recent advances in passive and active imaging sensor technology offer the potential to detect weapons that are concealed underneath a person's clothing or carried along in bags. Although the concealed weapons can sometimes easily be detected, it can be difficult to perceive their context, due to the

  8. Overview of surplus weapons plutonium disposition

    Energy Technology Data Exchange (ETDEWEB)

    Rudy, G.

    1996-05-01

    The safe disposition of surplus weapons useable plutonium is a very important and urgent task. While the functions of long term storage and disposition directly relate to the Department`s weapons program and the environmental management program, the focus of this effort is particularly national security and nonproliferation.

  9. Childhood maltreatment and threats with weapons.

    Science.gov (United States)

    Casiano, Hygiea; Mota, Natalie; Afifi, Tracie O; Enns, Murray W; Sareen, Jitender

    2009-11-01

    The relationship between childhood maltreatment and future threats with weapons is unknown. We examined data from the nationally representative National Comorbidity Survey Replication (n = 5692) and conducted multiple logistic regression analyses to determine the association between childhood maltreatment and lifetime behavior of threatening others with a gun or other weapon. After adjusting for sociodemographic variables, physical abuse, sexual abuse, and witnessing domestic violence were significantly associated with threats made with a gun (adjusted odds ratios [AOR] ranging between 3.38 and 4.07) and other weapons (AOR ranging between 2.16 and 2.83). The greater the number of types of maltreatment experienced, the stronger the association with lifetime threats made to others with guns and any weapons. Over 94% of respondents who experienced maltreatment and made threats reported that the maltreatment occurred prior to threatening others with weapons. Prevention efforts that reduce exposure to maltreatment may reduce violent behavior in later life.

  10. Weapon Control System for Airborne Application.

    Directory of Open Access Journals (Sweden)

    M. Sankar Kishore

    2000-07-01

    Full Text Available The integrated fire' control system (IFCS plays an important role in the present-day fighter aircraft and helicopters. Wecapons, such as missiles (active/passive, rockets and guns may be present on thelfighter aircraft or helicopter .IFCS monitors the status of the weapons present on the vehicle and passes the information to pilot/co-pilot. Depending upon the health/availability of the weapons, IFCS selects/fires the weapons. An attempt has been made to bring out the details of one such IFCS. As a I stepping stone, smaller version is developed and same philosophy can be used for integrating ftlore and I more weapons. Here, emphasis has been made on design and development of weapon control unit which is the heart f IFCS, both in hardware and software. The system has been developed using a 486 DX2 processor, and an elaborate software has been developed in PL/M.

  11. Weapon Involvement in the Victimization of Children.

    Science.gov (United States)

    Mitchell, Kimberly J; Hamby, Sherry L; Turner, Heather A; Shattuck, Anne; Jones, Lisa M

    2015-07-01

    To report the prevalence of weapons involved in the victimization of youth with particular emphasis on weapons with a "high lethality risk" and how such exposure fits into the broader victimization and life experiences of children and adolescents. Data were collected as part of the Second National Survey of Children's Exposure to Violence, a nationally representative telephone survey of youth ages 2 to 17 years and caregivers (N = 4114) conducted in 2011. Estimates from the Second National Survey of Children's Exposure to Violence indicate that almost 14 million youth, ages 2–17, in the United States have been exposed to violence involving a weapon in their lifetimes as witnesses or victims,or .1 in 5 children in this age group [corrected]. More than 2 million youth in the United States (1 in 33) have been directly assaulted in incidents where the high lethality risk weapons of guns and knives were used. Differences were noted between victimizations involving higher and lower lethality risk weapons as well as between any weapon involvement versus none. Poly-victims, youth with 7 or more victimization types, were particularly likely to experience victimization with any weapon, as well as victimization with a highly lethal weapon compared with nonpoly-victims. Findings add to the field's broadening conceptualization of youth victimization highlighting the potentially highly consequential risk factor of weapon exposure as a component of victimization experiences on the mental health of youth. Further work on improving gun safety practices and taking steps to reduce children's exposure to weapon-involved violence is warranted to reduce this problem. Copyright © 2015 by the American Academy of Pediatrics.

  12. Concealed weapons detection using electromagnetic resonances

    Science.gov (United States)

    Hunt, Allen R.; Hogg, R. Douglas; Foreman, William

    1998-12-01

    Concealed weapons pose a significant threat to both law enforcement and security agency personnel. The uncontrolled environments associated with peacekeeping and the move toward relaxation of concealed weapons laws here in the U.S. provide a strong motivation for developing weapons detection technologies which are noninvasive and can function noncooperatively. Existing weapons detection systems are primarily oriented to detecting metal and require the cooperation of the person being searched. The new generation of detectors under development that focuses primarily on imaging methods, faces problems associated with privacy issues. There remains a need for a weapons detector which is portable, detects weapons remotely, avoids the issues associated with privacy rights, can tell the difference between car keys and a knife, and is affordable enough that one can be issued to every peacekeeper and law enforcement officer. AKELA is developing a concealed weapons detector that uses wideband radar techniques to excite natural electromagnetic resonances that characterize the size, shape, and material composition of an object. Neural network processing is used to classify the difference between weapons and nuisance objects. We have constructed both time and frequency domain test systems and used them to gather experimental data on a variety of armed and unarmed individuals. These experiments have been performed in an environment similar to the operational environment. Preliminary results from these experiments show that it is possible to detect a weapon being carried by an individual from a distance of 10 to 15 feet, and to detect a weapon being concealed behind the back. The power required is about 100 milliwatts. A breadboard system is being fabricated and will be used by AKELA and our law enforcement partner to gather data in operationally realistic situations. While a laptop computer will control the breadboard system, the wideband radar electronics will fit in a box the

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

  14. User interface issues in supporting human-computer integrated scheduling

    Science.gov (United States)

    Cooper, Lynne P.; Biefeld, Eric W.

    1991-09-01

    The topics are presented in view graph form and include the following: characteristics of Operations Mission Planner (OMP) schedule domain; OMP architecture; definition of a schedule; user interface dimensions; functional distribution; types of users; interpreting user interaction; dynamic overlays; reactive scheduling; and transitioning the interface.

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

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

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

  18. 基于多Agent可互操作知识化制造动态自适应调度策略%Interoperable dynamic adaptive scheduling strategy in knowledgeable manufacturing based on multi-agent

    Institute of Scientific and Technical Information of China (English)

    汪浩祥; 严洪森

    2013-01-01

    Aiming to the uncetainty of production enviroment in knowledgeable manufacturing system, an interoperable knowledgeable dynamic scheduling system based on multi-agent is built, in which a knowledge representation with a series of problem characteristics for various scheduling problems is adopted and problem-based function modules are constructed by using agent technology. An adaptive scheduling mechanism based on modified Q-learning agrorithm known as weighted subordination based Q-learning(WSQ) is proposed for guiding the equipment agent to select scheduling strategy in a dynamic enviroment By the analysis of its complexity and simulation experiments, the results show the effectiveness of this strategy. The system is of adaptive and self-learning features, and high intelligence and interoperability.%针对知识化制造系统生产环境的不确定性,构建一个基于多Agent可互操作的知识化动态调度系统.该系统对各种调度问题采用具有一系列问题特征的知识表示,利用Agent技术构建基于问题的功能模块,提出一种基于改进Q-学习算法(WSQ)的自适应调度机制,以此指导设备Agent在动态环境下的调度策略选择.通过对其进行复杂性分析和仿真实验,验证了该控制策略的有效性.该系统具有自适应和自学习特征,具有高度智能化和可互操作性.

  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. Taser and Conducted Energy Weapons.

    Science.gov (United States)

    LeClair, Thomas G; Meriano, Tony

    2015-01-01

    It is clear that CEWs are an increasingly prevalent law enforcement tool, adopted to address a complex and challenging problem. The potential for serious injury from a single deployment of a CEW is extremely low. The debate regarding the link between these electrical weapons and sudden in-custody death is likely to continue because their use is often in complex and volatile situations. Any consideration of injuries has to be put into that context. One must also consider what injuries to a subject would result if an alternative force method was used. Furthermore, the potential benefits of CEWs, including reduction in injuries to the public and law-enforcement officers, need to be considered.

  1. Air guns: toys or weapons?

    Science.gov (United States)

    Aslan, Sahin; Uzkeser, Mustafa; Katirci, Yavuz; Cakir, Zeynep; Bilir, Ozlem; Bilge, Fatih; Cakir, Murtaza

    2006-09-01

    Air guns and blank guns may appear relatively harmless at first glance, but they are, in fact, potentially destructive, even lethal, weapons. Approximately 2 to 2.5 million nonpowder firearms are sold annually, and again approximately 12.9 per 100,000 population are treated for such injuries in hospital emergency departments each year in the United States. Unfortunately, these guns are considered to be a toy for children. Therefore, incidents of air gun injuries are gradually increasing. Although such injuries may initially be considered trivial, it may signify severe internal tissue pathologies. These apparently trivial injuries may have catastrophic consequences if unnoticed. In this study, we report 4 cases with head injury due to a shot by these guns. The cases indicate that these people had used the guns belonging to their parents for the purpose of suicide. The cases also show that these machines are not innocent.

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

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

  4. Online Scheduling in Manufacturing A Cumulative Delay Approach

    CERN Document Server

    Suwa, Haruhiko

    2013-01-01

    Online scheduling is recognized as the crucial decision-making process of production control at a phase of “being in production" according to the released shop floor schedule. Online scheduling can be also considered as one of key enablers to realize prompt capable-to-promise as well as available-to-promise to customers along with reducing production lead times under recent globalized competitive markets. Online Scheduling in Manufacturing introduces new approaches to online scheduling based on a concept of cumulative delay. The cumulative delay is regarded as consolidated information of uncertainties under a dynamic environment in manufacturing and can be collected constantly without much effort at any points in time during a schedule execution. In this approach, the cumulative delay of the schedule has the important role of a criterion for making a decision whether or not a schedule revision is carried out. The cumulative delay approach to trigger schedule revisions has the following capabilities for the ...

  5. RFID-enabled dynamic storage vehicle scheduling based on immune glowworm swarm optimization algorithm%基于免疫萤火虫算法的RFID仓储车辆动态调度

    Institute of Scientific and Technical Information of China (English)

    李雪竹

    2014-01-01

    For the real-time warehousing logistics vehicle scheduling problem(LVCP), an RFID-enabled vehicle dynamic scheduling algorithm based on Immune Glowworm Swarm Optimization Algorithm(IGSOA)is proposed. A mathematical model for Vehicle Routing Problem(VRP)with delivery cost is established, and the IGSOA is used to solve this model. IGSOA combines the GSO and CSA technology, and adopts a multi-layer evolution pattern. The polymorphic adaptive population mechanism and global extreme screening strategy are introduced in the low GSO operation and high immune operation, in order to improve the IGSOA convergence efficiency. Based on above analysis, a vehicle dynamic scheduling framework is presented, and the vehicle dynamic scheduling process is divided into two stages as vehicle scheduling tasks control and VRP optimization. The process of LVCP is given. Experimental results show that, the IGSOA can effectively solve large-scale LVCP.%针对物流配送实时仓储车辆调度问题,提出了一种基于RFID技术的免疫萤火虫车辆动态调度框架。建立了基于配送成本的带约束条件车辆路径问题数学模型,运用免疫萤火虫优化算法求解该模型,免疫萤火虫优化算法将萤火虫优化及免疫克隆技术融合,采用多层进化模式,在低层萤火虫操作中及高层免疫操作中分别引入多态子种群自适应机制和全局极值筛选策略,以提高算法全局收敛效率,在此基础上设计了仓储车辆动态调度框架,将车辆动态调度过程分为车辆调度任务控制和路径优化两个阶段,给出了车辆动态调度任务处理流程。实验仿真表明,该车辆动态调度算法能够有效地解决大规模动态物流车辆调度问题。

  6. Toward a nuclear weapons free world?

    Energy Technology Data Exchange (ETDEWEB)

    Maaranen, S.A. [Los Alamos National Lab., NM (United States). Center for International Security Affairs

    1996-09-01

    Doubts about the wisdom of relying on nuclear weapons are as old as nuclear weapons themselves. But despite this questioning, nuclear weapons came to be seen as the indispensable element of American (indeed Western) security during the Cold War. By the 1970s and 1980s, however, discontent was growing about the intense US-Soviet nuclear arms competition, as it failed to provide any enduring improvement in security; rather, it was seen as creating ever greater risks and dangers. Arms control negotiations and limitations, adopted as a means to regulate the technical competition, may also have relieved some of the political pressures and dangers. But the balance of terror, and the fears of it, continued. The Strategic Defense Initiative (SDI) under President Reagan was a very different approach to escaping from the precarious protection of nuclear weapons, in that it sought a way to continue to defend the US and the West, but without the catastrophic risks of mutual deterrence. As such, SDI connoted unhappiness with the precarious nuclear balance and, for many, with nuclear weapons in general. The disappearance of the Warsaw Pact, the disintegration of the Soviet Union, and the sudden end of the Cold War seemed to offer a unique opportunity to fashion a new, more peaceful world order that might allow for fading away of nuclear weapons. Scholars have foreseen two different paths to a nuclear free world. The first is a fundamental improvement in the relationships between states such that nuclear weapons are no longer needed. The second path is through technological development, e.g., missile defenses which could provide effective protection against nuclear attacks. The paper discusses nuclear weapon policy in the US, views of other nuclear states, the future of nuclear weapons, and issues in a less-nuclear world.

  7. Weapon container catalog. Volumes 1 & 2

    Energy Technology Data Exchange (ETDEWEB)

    Brown, L.A.; Higuera, M.C.

    1998-02-01

    The Weapon Container Catalog describes H-gear (shipping and storage containers, bomb hand trucks and the ancillary equipment required for loading) used for weapon programs and for special use containers. When completed, the catalog will contain five volumes. Volume 1 for enduring stockpile programs (B53, B61, B83, W62, W76, W78, W80, W84, W87, and W88) and Volume 2, Special Use Containers, are being released. The catalog is intended as a source of information for weapon program engineers and also provides historical information. The catalog also will be published on the SNL Internal Web and will undergo periodic updates.

  8. [New challenges in the biological weapons convention].

    Science.gov (United States)

    Sissonen, Susanna; Raijas, Tiina; Haikala, Olli; Hietala, Heikki; Virri, Markku; Nikkari, Simo

    2012-01-01

    Microbes and their toxins are biological weapons that can cause disease in humans, animals or plants, and which can be used with hostile intent in warfare and terrorism. Biological agents can be used as weapons of mass destruction and therefore, immense human and social and major economical damage can be caused. Rapid development of life sciences and technologies during the recent decades has posed new challenges to the Biological Weapons Convention. The Convention states that the States Parties to the BWC strive to ensure that the Convention remains relevant and effective, despite changes in science, technology or politics.

  9. The Spear: An Effective Weapon Since Antiquity

    OpenAIRE

    Robert E. Dohrenwend

    2012-01-01

    The spear is perhaps man’s oldest weapon, and may even be his oldest tool. Over the hundreds of thousands of years of the weapon’s existence, it evolved from a pointed stick into an efficient hunting missile, and then became the most effective hand-held bladed weapon humans ever devised. The spear and its use is the only martial art originally devised for use against species other than our own, and more than any other weapon, the spear emphasizes the relationship between hunting and warfare. ...

  10. The Importance of Designating Cyberspace Weapon Systems

    Science.gov (United States)

    2013-10-01

    PerspectiveSpace Focus Cyberspace Vulnerability Assessment / Hunter Weapon System The Air Force Cyberspace Vulnerability Assessment ( CVA ) / Hunter  weapon...system can perform defensive sorties worldwide via remote or on-site access. The  CVA /Hunter weapon sys- tem is operated by one active duty unit, the...support all of the mission crews. Developed by the for- mer Air Force Information Operations Center, the  CVA /Hunter  weapon system was fielded to the 688th

  11. 48 CFR 217.173 - Multiyear contracts for weapon systems.

    Science.gov (United States)

    2010-10-01

    ... weapon systems. 217.173 Section 217.173 Federal Acquisition Regulations System DEFENSE ACQUISITION... Mulityear Contracting 217.173 Multiyear contracts for weapon systems. As authorized by 10 U.S.C. 2306b(h... contract for— (a) A weapon system and associated items, services, and logistics support for a weapon system...

  12. 36 CFR 1002.4 - Weapons, traps and nets.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons, traps and nets. 1002... AND RECREATION § 1002.4 Weapons, traps and nets. (a)(1) Except as otherwise provided in this section, the following are prohibited: (i) Possessing a weapon, trap or net. (ii) Carrying a weapon, trap or...

  13. 43 CFR 15.11 - Explosives and dangerous weapons.

    Science.gov (United States)

    2010-10-01

    ... 43 Public Lands: Interior 1 2010-10-01 2010-10-01 false Explosives and dangerous weapons. 15.11... § 15.11 Explosives and dangerous weapons. No person shall carry, use or possess within the Preserve... other kind of weapon potentially harmful to the reef structure. The use of such weapons from beyond the...

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

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

  16. A different kind of weapon focus: simulated training with ballistic weapons reduces change blindness.

    Science.gov (United States)

    Taylor, J Eric T; Witt, Jessica K; Pratt, Jay

    2017-01-01

    Attentional allocation is flexibly altered by action-related priorities. Given that tools - and specifically weapons - can affect attentional allocation, we asked whether training with a weapon or holding a weapon during search would affect change detection. In three experiments, participants searched for changes to agents, shootable objects, or environments in the popular flicker paradigm. Participants trained with a simulated weapon or watched a video from the same training perspective and then searched for changes while holding a weapon or a control object. Results show an effect of training, highlighting the importance of sensorimotor experience for the action-relevant allocation of attention, and a possible interaction between training and the object held during search. Simulated training with ballistic weapons reduces change blindness. This result has implications for the interaction between tool use and attentional allocation.

  17. 基于SD的船舶敏捷制造项目进度管理模型研究%The Schedule Management Model of Ship Agile Manufacturing Project Based on System Dynamics

    Institute of Scientific and Technical Information of China (English)

    杨兴林; 韩凯

    2013-01-01

    针对传统项目管理方法的不足,提出利用系统动力学方法来研究船舶敏捷制造项目的进度管理问题.通过传统项目管理方法与系统动力学方法的比较,证明利用系统动力学研究船舶敏捷制造项目进度管理的可行性和必要性,然后确定建模边界,构建因果关系图,对其中的反馈关系进行详细分析,得到四种反馈回路,进而对系统做进一步分析,建立船舶敏捷制造项目进度管理系统的系统动力学模型,最后通过实例仿真对模型进行有效性验证.%According to the deficiency of the traditional methods of project management,this paper presents researching schedule management of ship agile manufacturing project by using system dynamics method.The system dynamics method is introduced and the characteristics of ship agile manufacturing project is analyzed,then the cause mapping of schedule management system of ship agile manufacturing project is set up.By analyzing the cause mapping,the system dynamics model of schedule management system of ship agile manufacturing project is established.Finally,model validation is made through the simulation of an example.

  18. μC/OS-Ⅱ基于动态优先级的时间片轮转任务调度策略%Time slice rotation task scheduling strategy based on dynamic priority

    Institute of Scientific and Technical Information of China (English)

    巩思亮; 左秀婷; 梁庆伟; 邢涛

    2012-01-01

    针对μC/OS-Ⅱ仅支持高优先级独占内核,不支持任务时间片轮转调度的缺陷,提出了一种基于动态优先级方案的时间片轮转任务调度策略.该方案在没有改变内核源代码的前提下,仅在应用层面就能实现任务的时间片轮转调度,具有安全可靠、简单实用的特点.%To solve the problem that the kernel of μC/OS-Ⅱ does not support the round robin scheduling, a time slice rotation task scheduling strategy based on dynamic priority is proposed. The strategy realizes the task scheduling based on time slice rotation in the application level without changing the kernel source code. The analysis and experiment show that the strategy has the advaiages of safety, reliability, simpleness and practicability.

  19. Controlling Weapons-Grade Fissile Material

    Science.gov (United States)

    Rotblat, J.

    1977-01-01

    Discusses the problems of controlling weapons-grade fissionable material. Projections of the growth of fission nuclear reactors indicates sufficient materials will be available to construct 300,000 atomic bombs each containing 10 kilograms of plutonium by 1990. (SL)

  20. Weapons dismantlement issues in independent Ukraine

    Energy Technology Data Exchange (ETDEWEB)

    Zack, N.R. [Los Alamos National Lab., NM (United States); Kirk, E.J. [American Association for the Advancement of Science, Washington, DC (United States)

    1994-07-01

    The American Association for the Advancement of Science sponsored a seminar during September 1993, in Kiev, Ukraine, entitled ``Toward a Nuclear Free Future -- Barriers and Problems.`` It brought together Ukrainians, Belarusians, and Americans to discuss the legal, political, safeguards and security, economic, and technical dimensions of nuclear weapons dismantlement and destruction. US representatives initiated discussions on legal and treaty requirements and constraints, safeguards and security issues surrounding dismantlement, storage and disposition of nuclear materials, warhead transportation, and economic considerations. Ukrainians gave presentations on arguments for and against the Ukraine keeping nuclear weapons, Ukrainian Parliament non-approval of START I, alternative strategies for dismantling silos and launchers, and economic and security implications of nuclear weapons removal from the Ukraine. Participants from Belarus discussed proliferation and control regime issues, This paper will highlight and detail the issues, concerns, and possible impacts of the Ukraine`s dismantlement of its nuclear weapons.

  1. Computational Challenges in Nuclear Weapons Simulation

    Energy Technology Data Exchange (ETDEWEB)

    McMillain, C F; Adams, T F; McCoy, M G; Christensen, R B; Pudliner, B S; Zika, M R; Brantley, P S; Vetter, J S; May, J M

    2003-08-29

    After a decade of experience, the Stockpile Stewardship Program continues to ensure the safety, security and reliability of the nation's nuclear weapons. The Advanced Simulation and Computing (ASCI) program was established to provide leading edge, high-end simulation capabilities needed to meet the program's assessment and certification requirements. The great challenge of this program lies in developing the tools and resources necessary for the complex, highly coupled, multi-physics calculations required to simulate nuclear weapons. This paper describes the hardware and software environment we have applied to fulfill our nuclear weapons responsibilities. It also presents the characteristics of our algorithms and codes, especially as they relate to supercomputing resource capabilities and requirements. It then addresses impediments to the development and application of nuclear weapon simulation software and hardware and concludes with a summary of observations and recommendations on an approach for working with industry and government agencies to address these impediments.

  2. Europium-155 in Debris from Nuclear Weapons

    DEFF Research Database (Denmark)

    Aarkrog, Asker; Lippert, Jørgen Emil

    1967-01-01

    The lithium-drifted germanium detector enables determination of europium-155 on a routine basis in environmental samples contaminated with debris from nuclear weapons. From measurements of europium-155, cesium-144, and strontium-90 in air filters collected between 1961 and 1966, the yield...... of europium-155 from weapons was estimated at 1400 atoms per 10$^{6}$ fissions, which is close to the yield of europium-155 from fast fission of uranium-238....

  3. Overall View of Chemical and Biochemical Weapons

    Science.gov (United States)

    Pitschmann, Vladimír

    2014-01-01

    This article describes a brief history of chemical warfare, which culminated in the signing of the Chemical Weapons Convention. It describes the current level of chemical weapons and the risk of using them. Furthermore, some traditional technology for the development of chemical weapons, such as increasing toxicity, methods of overcoming chemical protection, research on natural toxins or the introduction of binary technology, has been described. In accordance with many parameters, chemical weapons based on traditional technologies have achieved the limit of their development. There is, however, a big potential of their further development based on the most recent knowledge of modern scientific and technical disciplines, particularly at the boundary of chemistry and biology. The risk is even higher due to the fact that already, today, there is a general acceptance of the development of non-lethal chemical weapons at a technologically higher level. In the future, the chemical arsenal will be based on the accumulation of important information from the fields of chemical, biological and toxin weapons. Data banks obtained in this way will be hardly accessible and the risk of their materialization will persist. PMID:24902078

  4. Overall view of chemical and biochemical weapons.

    Science.gov (United States)

    Pitschmann, Vladimír

    2014-06-04

    This article describes a brief history of chemical warfare, which culminated in the signing of the Chemical Weapons Convention. It describes the current level of chemical weapons and the risk of using them. Furthermore, some traditional technology for the development of chemical weapons, such as increasing toxicity, methods of overcoming chemical protection, research on natural toxins or the introduction of binary technology, has been described. In accordance with many parameters, chemical weapons based on traditional technologies have achieved the limit of their development. There is, however, a big potential of their further development based on the most recent knowledge of modern scientific and technical disciplines, particularly at the boundary of chemistry and biology. The risk is even higher due to the fact that already, today, there is a general acceptance of the development of non-lethal chemical weapons at a technologically higher level. In the future, the chemical arsenal will be based on the accumulation of important information from the fields of chemical, biological and toxin weapons. Data banks obtained in this way will be hardly accessible and the risk of their materialization will persist.

  5. Overall View of Chemical and Biochemical Weapons

    Directory of Open Access Journals (Sweden)

    Vladimír Pitschmann

    2014-06-01

    Full Text Available This article describes a brief history of chemical warfare, which culminated in the signing of the Chemical Weapons Convention. It describes the current level of chemical weapons and the risk of using them. Furthermore, some traditional technology for the development of chemical weapons, such as increasing toxicity, methods of overcoming chemical protection, research on natural toxins or the introduction of binary technology, has been described. In accordance with many parameters, chemical weapons based on traditional technologies have achieved the limit of their development. There is, however, a big potential of their further development based on the most recent knowledge of modern scientific and technical disciplines, particularly at the boundary of chemistry and biology. The risk is even higher due to the fact that already, today, there is a general acceptance of the development of non-lethal chemical weapons at a technologically higher level. In the future, the chemical arsenal will be based on the accumulation of important information from the fields of chemical, biological and toxin weapons. Data banks obtained in this way will be hardly accessible and the risk of their materialization will persist.

  6. Scheduling and Subcontracting under Parallel Machines

    Institute of Scientific and Technical Information of China (English)

    CHEN Rong-jun; TANG Guo-chun

    2012-01-01

    In this paper,we study a model on joint decisions of scheduling and subcontracting,in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.The manufacturer needs to determine which jobs should be produced in-house and which jobs should be subcontracted.Furthermore,it needs to determine a production schedule for jobs to be produced in-house.We discuss five classical scheduling objectives as production costs.For each problem with different objective functions,we give optimality conditions and propose dynamic programming algorithms.

  7. Nuclear Weapons: NNSA Needs to Establish a Cost and Schedule Baseline for Manufacturing a Critical Nuclear Weapon Component

    Science.gov (United States)

    2008-05-01

    MOX mixed-oxide NNSA National Nuclear Security Administration PF-4 Plutonium Facility-4 building RRW Reliable Replacement Warhead TA-50...disassembles legacy pits and removes and oxidizes the plutonium, which can be used as a feed metal for the mixed-oxide ( MOX ) fuel polishing activities...Facility at the Savannah River Site. MOX fuel polishing This program purifies plutonium from the ARIES project to specifications that would allow direct

  8. ENVIRONMENTAL CONTAMINATION FROM WEAPON TESTS

    Energy Technology Data Exchange (ETDEWEB)

    none

    1958-10-01

    The program of the Atomic Energy Commission on environmental contamination from weapons tests is designed for the overall evaluation of the hazard to humans from test operations. It is limited to studies of the deposition of activity at long range rather than the problems associated with immediate, close-in fallout. The program has largely been a study of Sr{sup 90}, since considerations based on experience and measurement indicate that it is the isotope of greatest potential hazard. Data are presented pertinent to the monitoring of long-range fallout, particularly Sr{sup 90} and Cs{sup 137}. Values are tabulated for the fallout deposition, air concentrations, water concentrations, and the amounts in foods and human bone. In addition, results are given for some experimental investigations. The report of these results is not interpretative although certain papers that do attempt to interpret the present situation with respect to Sr{sup 90} in particular are reprinted. Bibliographies are presented covering the period since the 1957 hearings before the Joint Committee on Atomic Energy concerning the nature of radioactive fallout and its effects on man. A document list of submissions to the United Nations Scientific Committee on the Effects of Atomic Radiation is given to illustrate the work done in other countries. Several papers on the subject, which have not been generally available, are reprinted.

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

  10. 层次化动态实时调度框架的设计与实现%Design and Realization of Hierarchical Dynamic Real-time Scheduling Framework

    Institute of Scientific and Technical Information of China (English)

    胡家义; 张激; 刘玲

    2013-01-01

    The development of embedded systems is facing new trends including variousness of usage scenarios, strict requirement for real-time feature, complexity of upper applications and assurance of strong robustness, demanding the advance of system safety by means of promoting embedded operating systems. Temporal isolation mechanism is an important part to improve the safety of system, proposing a hierarchical dynamic real-time scheduling framework to be the implementation of temporal isolation. This paper uses the homogeneity of task to generate task sets, which can be the basis of hierarchical framework for task partitioning;testifies the schedulable condition of the framework, designs the structure of scheduling algorithm and realizes the dynamic switching of scheduling algorithm. The simulation result and theoretical analysis indicate that the issued framework can improve the safety of system and dynamically adjust to the variation of system load while guaranteeing the stability of time complexity of context switch.%现有嵌入式系统具有应用场景多变、实时性要求严格、上层应用复杂、鲁棒性较强等特点,在嵌入式操作系统层面对系统防危性要求较高。时间隔离机制是提高系统防危性的重要组成部分,为此,提出一种将层次化动态实时调度框架作为时间隔离的实现策略。引入任务同质性的概念进行任务分划,将产生的任务集作为层次框架的基础,证明多层次框架下实时任务的可调度性条件,设计调度算法结构并实现调度算法的动态切换。仿真结果和理论分析表明,该调度框架在保证上下文切换时间复杂度稳定的前提下,可提高系统防危性并动态应对系统负载的变化。

  11. Dynamic Scheduling Algorithms for Streaming Media Based on Hybrid Content Delivery Network%基于混合模式的流媒体缓存调度算法

    Institute of Scientific and Technical Information of China (English)

    叶剑虹; 叶双

    2013-01-01

    A hybrid content delivery network combining complementary advantages of CDN and P2P called HyCDN for streaming media was presented. The CVCR4P2P (Comprehensive Value Cache Replacement Algorithm for P2P) algorithm was proposed for the peers inside domain, which considers bytes benefit of prefix data, transmission cost and access rate of streaming media. Another algorithm,DSA4ProxyC (Dynamic Scheduling Algorithm for Proxy Caching), which joints the proxy caching and server scheduling strategies for proxies between domain was also shown. It employs the scheme of cache allocation based on the current batching interval that has non-zero requests, which can be updated periodically according to the popularity of streaming media object The principle is obeyed that the data cached for each streaming media object are in proportion to their popularity at the proxy server. Theoretical analysis and simulation results show that the hybrid dynamic scheduling can effectively reduce server and network bandwidth usage,and also has a very good adaptability for the variety of the request arrival rate.%介绍了一种结合了CDN和P2P互补优势的流媒体混合内容分发网络(HyCDN).针对HyCDN不同区域提出了相应的缓存算法,域内用户端综合考虑了流媒体前缀字节的有用性、文件的传输代价及点播热度,在此基础上提出缓存替换算法(Comprehensive Value Cache Replacement Algorithm for P2P,CVCR4P2P);对域间边缘服务器采用补丁预取与调度算法(Dynamic Scheduling Algorithm for Proxy Caching,DSA4ProxyC),通过基于用户访问情况自适应伸缩缓存的分配方案,使流媒体后缀部分在边缘服务器中缓存的数据段与其流行度成正比.理论分析及实验结果表明,混合流媒体缓存调度策略的实施能有效地降低骨干网络带宽资源消耗,对用户请求到达速率的变化具有良好的适应性.

  12. Feedback Scheduling of Priority-Driven Control Networks

    CERN Document Server

    Xia, Feng; Tian, Yu-Chu

    2008-01-01

    With traditional open-loop scheduling of network resources, the quality-of-control (QoC) of networked control systems (NCSs) may degrade significantly in the presence of limited bandwidth and variable workload. The goal of this work is to maximize the overall QoC of NCSs through dynamically allocating available network bandwidth. Based on codesign of control and scheduling, an integrated feedback scheduler is developed to enable flexible QoC management in dynamic environments. It encompasses a cascaded feedback scheduling module for sampling period adjustment and a direct feedback scheduling module for priority modification. The inherent characteristics of priority-driven control networks make it feasible to implement the proposed feedback scheduler in real-world systems. Extensive simulations show that the proposed approach leads to significant QoC improvement over the traditional open-loop scheduling scheme under both underloaded and overloaded network conditions.

  13. 考虑任务排序策略的舰船建造车间虚拟制造单元动态调度%Virtual manufacturing cell dynamic scheduling of ship construction workshop considering the task sorting strategy

    Institute of Scientific and Technical Information of China (English)

    韩文民; 孙晓梅; 孔鹏; 吕洁

    2014-01-01

    为提高舰船制造系统作业调度的柔性和效率,从车间层的作业计划角度出发,研究周期驱动条件下的虚拟制造单元多阶段动态调度问题并构建了动态调度数学模型。模型中考虑了加工任务动态需求、设备加工能力、负荷平衡、同类设备有多台的情况且提出共享资源协调排序策略,以实现最大完工时间和总物料运输距离之和最小化的目标。运用改进蚁群算法与启发式规则的混合算法进行求解。通过某船厂的实际生产数据验证了虚拟单元动态调度方法的可行性和有效性。%In order to improve the flexibility and efficiency of shipbuilding production scheduling system and develop shop floor short - term plans, virtual manufacturing cell multi-period dynamic scheduling model was established in condition of cycle driving mechanism. The model incorporated parameters of the processing task dynamic demand, equipment processing capability, load balance, and similar equipments have multiple; and put forward sharing resources coordination sorting strategy. The objective is to minimize completion time and the total materials and components travelling distance incurred. A hybrid algorithm, based on the improved ant colony algorithm and heuristic rules was proposed to solve the complex scheduling problem. Actual production data proved that the proposed approach was feasible and effective.

  14. Modern weapons and military equipment for issue no. 3-2015

    OpenAIRE

    ЙЕВТИЧ МИЛОШ М.

    2015-01-01

    Optimal features for concealed carry weapons. The specificity of jobs and tasks that require concealed carrying of weapons by officials require specific criteria when choosing personal weapons specialist.

  15. MODERN WEAPONS AND MILITARY EQUIPMENT FOR ISSUE NO. 3-2015

    OpenAIRE

    2015-01-01

    Optimal features for concealed carry weapons. The specificity of jobs and tasks that require concealed carrying of weapons by officials require specific criteria when choosing personal weapons specialist.

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

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

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

  19. An approach of basing - on fuzzy, grey noncooperative Nash games to multi- team dynamic weapon- target assignment%基于模糊-灰色非合作Nash博弈的多组动态武器-目标分配方法

    Institute of Scientific and Technical Information of China (English)

    张毅; 姜青山; 陈国生

    2012-01-01

    Aiming at the uncertainties in weapon - target assignment ( WTA), a kind of oppositive multi - team dynamic WTA( MT- DWTA) problem is studied. Firstly,the oppositive MT- DWTA model is built. Sec- ondly, with distance discount factor (DDF) and fuzzy - grey target relative value and team Nash pair of strategies, a model of MT - DWTA is formed basing on fuzzy - grey noncooperative Nash games. And then the MT - DWTA model is transformed into quadratic programming problem. Finally, a kind of genetic algorithm (GA) and ant colo- ny optimization(ACO) with cyclic multiexehange(CME) heuristic algorithm is designed to solve a more large - scale MT- DWTA problem, and the simulation result shows that new algorithm can solve it in a short time%针对武器-目标分配(weapon-targetassignment,WTA)中的不确定性因素,研究了一类对抗性质的多组动态WTA(muhi-teamdynamicWTA,MT-DWTA)问题.首先,构建了对抗性质的MT-DWTA模型;其次,引入距离折算因子、模糊一灰色的目标相对价值和组Nash策略对的概念,构建了模糊-灰色非合作Nash博弈的MT-DWTA模型;然后,把该模型转化为二次规划模型;最后,设计一种循环多次交换启发式遗传-蚁群优化算法,仿真结果表明新算法能够在较短时间内求解较大规模的MT-DWTA的优化问题.

  20. Detecting necessary and sufficient parts for assembling a functional weapon

    Science.gov (United States)

    Hempelmann, Christian F.; Solomon, Divya; Arslan, Abdullah N.; Attardo, Salvatore; Blount, Grady P.; Adkins, Tracy; Sirakov, Nikolay M.

    2017-05-01

    Continuing our previous research to visually extract and visually and conceptually match weapons, this study develops a method to determine whether a set of weapon parts visually extracted from images taken from different scenes can be assembled as a firing weapon. This new approach identifies potential weapons in the ontology via tracing detected necessary and sufficient parts through their meronymic relation to the whole weapon. A fast algorithm for identifying potential weapons that can be assembled from a given set of detected parts is presented.

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

  2. Two-level Rolling Procedure Based on Dummy Schedule for Dynamic Scheduling Problem with Incomplete Global Information%全局信息不全的动态调度问题基于虚拟调度的两级滚动方法

    Institute of Scientific and Technical Information of China (English)

    王冰; 席裕庚

    2006-01-01

    This paper addresses the single-machine scheduling problem with release times minimizing the total completion time. Under the circumstance of incomplete global information at each decision time, a two-level rolling scheduling strategy (TRSS) is presented to create the global schedule step by step. The estimated global schedules are established based on a dummy schedule of unknown jobs. The first level is the preliminary scheduling based on the predictive window and the second level is the local scheduling for sub-problems based on the rolling window. Performance analysis demonstrates that TRSS can improve the global schedules. Computational results show that the solution quality of TRSS outperforms that of the existing rolling procedure in most cases.

  3. 一种基于动态配额的虚拟网带宽公平调度算法%Dynamical Weighted Scheduling Algorithm Supporting Fair Bandwidth Allocation of Virtual Networks

    Institute of Scientific and Technical Information of China (English)

    刘中金; 卓子寒; 何跃鹰; 李勇; 苏厉; 金德鹏; 曾烈光

    2016-01-01

    Network virtualization is widely deployed in network experiment platforms and data center networks. As a key networking equipment in virtualized environment, the virtual router can build many virtual router instances to run different virtual networks. The key problem for a virtual router lies in how to schedule the packets into different virtual instances according to the virtual networks’ bandwidth requirement. In this article, a model is given to the scheduling problem and a dynamical weighted scheduling algorithm is proposed. The experimental results show that the proposed algorithm has superiority over miDRR algorithm in terms of the efficiency and the fairness.%网络虚拟化被广泛用于网络实验平台和数据中心等场景中。作为虚拟化网络中的核心组网设备,虚拟路由器可以在同一物理底层上构建多个虚拟路由器实例来承载多个虚拟网。其核心调度问题在于如何根据不同虚拟网对带宽的不同需求,将网络数据包调度到不同的实例中。该文针对该问题对虚拟化场景下的队列调度问题进行建模,提出了基于动态配额的队列调度算法,与miDRR等算法相比,该文算法在虚拟网带宽分配的有效性和公平性上有明显优势。

  4. Prions: the danger of biochemical weapons

    Directory of Open Access Journals (Sweden)

    Eric Almeida Xavier

    2014-09-01

    Full Text Available The knowledge of biotechnology increases the risk of using biochemical weapons for mass destruction. Prions are unprecedented infectious pathogens that cause a group of fatal neurodegenerative diseases by a novel mechanism. They are transmissible particles that are devoid of nucleic acid. Due to their singular characteristics, Prions emerge as potential danger since they can be used in the development of such weapons. Prions cause fatal infectious diseases, and to date there is no therapeutic or prophylactic approach against these diseases. Furthermore, Prions are resistant to food-preparation treatments such as high heat and can find their way from the digestive system into the nervous system; recombinant Prions are infectious either bound to soil particles or in aerosols. Therefore, lethal Prions can be developed by malicious researchers who could use it to attack political enemies since such weapons cause diseases that could be above suspicion.

  5. 对地观测卫星任务规划的启发式动态调整算法%Heuristic dynamic adjust of task scheduling for earth observing satellite

    Institute of Scientific and Technical Information of China (English)

    张利宁; 黄小军; 邱涤珊; 李皓平

    2011-01-01

    针对对地观测卫星任务规划,分析了单个资源失效与多个高优先级任务动态插入情况下已有任务规划方案的动态调整问题.以最大化规划方案任务权值总和为优化目标,提出了基于任务替换的启发式动态调整算法,包括选择替换任务的五种启发式策略:最大灵活度,最小冲突集,最小争议部分、区间剪枝以及任务剪枝策略.分析了影响动态调整算法运行效率的两个关键因素:冲突任务集与动态搜索深度.采用任务重规划率、规划权值变化率与算法运行时间三项指标考察算法效果,通过仿真实验验证了算法的可行性和有效性.%The dynamic adjust problem of task scheduling for multi-earth observing satellite is analyzed,in cases of single resource fail and multi-prior tasks' dynamic insertion.The optimizing objective is to maximize the sum of all scheduled tasks. The heuristic dynamic adjust algorithm has been proposed based on task swapping, including five heuristic strategies to choosing swapped task:maximum flexibility,minimum conflict set,minimum contention,interval prune and task prune.Two critical elements that impact efficiency of the algorithm have been analyzed also.Three indices, including re-scheduling ratio, change ratio of sum weight and total running time are deployed to check the result of this algorithm;the feasibility and effectiveness have been tested through simulation,and promised result is fulfilled.

  6. Dynamic Hierarchical Scheduling Strategy of Service Components for Real-Time System%面向实时系统的服务组件动态等级调度策略

    Institute of Scientific and Technical Information of China (English)

    杨成群; 陈述平; 谭宏华

    2012-01-01

    OSGi是基于组件的面向服务架构,其服务组件可在运行时远程地被安装、卸载和更新,但其服务实现的各项属性必须安装后才可知,这对于有时限要求的实时系统来说,是一个挑战.在执行时间服务和准入控制协议等研究基础上,提出了一种动态等级调度策略.通过动态地计算和分配组件的权限,以时间片轮转的方式调度组件,并设置不被中断的超级组件使服务组件能够应用在有特殊实时要求的系统中.最后通过实验和实践,分析和证明动态等级调度在面向服务架构上的良好应用.%OSGi is a service-oriented framework based on components, it is very useful to configurate dynamic reorganizable real-time system that the service components can remotely be installed, uninstalled and updated at run-time. But it is challenging the relation attributes are unknown until the services reach. On the basis of execution time service and admission control, this article proposed a dynamic hierarchical scheduling strategy (DHSS) which computs and assigns dynamically the rights of components and constituts a scheduling list. DHSS limited the running time of components by time slice circular scheduling and met the requirement of some especial real-time application by super-component which won't be interrupted. Finally experimental results and practical application analysis proves the feasibility of the DHSS on the SOA.

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

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

  9. Task Analyses of Three Selected Weapons Systems.

    Science.gov (United States)

    1976-10-01

    using weapons is a joint function of the specific weapon system, the goals (missions) of the system, and the environment in which it is used. The first...Identification of fire mission profiles which state general job functions for each type of typical mission. Documentary sources such as Field Manuals...nd Arin,,, Ui, Guni i A,!i" tant uuPnrr No. I Can; n , r Grup - ( nile. .rs and Prir Diff,-ront S, tm: -inch L,,t.’r _, Fort Hood l::t Cavall, I

  10. #TheWeaponizationOfSocialMedia

    DEFF Research Database (Denmark)

    Nissen, Thomas Elkjer

    In today’s conflict environment, transformed by information technology and of who can communicate and how, states, non-state actors, ad hoc activist networks and individuals create effect(s) in and through social network media in support of their objectives. #TheWeaponizationOfSocialMedia develops...... a framework for understanding how social network media shapes global politics and contemporary conflicts by examining their role as a platform for conduction intelligence collection, targeting, cyber-operations, psychological warfare and command and control activities. Through these, the weaponization...

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

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

  13. Investigations into Generalization of Constraint-Based Scheduling Theories with Applications to Space Telescope Observation Scheduling

    Science.gov (United States)

    Muscettola, Nicola; Smith, Steven S.

    1996-01-01

    This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.

  14. Energy-aware scheduling on multiprocessor platforms

    CERN Document Server

    Li, Dawei

    2014-01-01

    Multiprocessor platforms play important roles in modern computing systems, and appear in various applications, ranging from energy-limited hand-held devices to large data centers. As the performance requirements increase, energy-consumption in these systems also increases signi cantly. Dynamic Voltage and Frequency Scaling (DVFS), which allows processors to dynamically adjust the supply voltage and the clock frequency to operate on di erent power/energy levels, is considered an e ective way to achieve the goal of energy-saving. This book surveys existing works that have been on energy-aware task scheduling on DVFS multiprocessor platforms. Energy-aware scheduling problems are intrinsically optimization problems, the formulations of which greatly depend on the platform and task models under consideration. Thus, Energy-aware Scheduling on Multiprocessor Platforms covers current research on this topic and classi es existing works according to two key standards, namely, homogeneity/heterogeneity of multi processo...

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

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

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

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

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

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

  1. Fee Schedules - General Information

    Data.gov (United States)

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

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

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

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

  5. Implementing the chemical weapons convention

    Energy Technology Data Exchange (ETDEWEB)

    Kellman, B.; Tanzman, E. A.

    1999-12-07

    In 1993, as the CWC ratification process was beginning, concerns arose that the complexity of integrating the CWC with national law could cause each nation to implement the Convention without regard to what other nations were doing, thereby causing inconsistencies among States as to how the CWC would be carried out. As a result, the author's colleagues and the author prepared the Manual for National Implementation of the Chemical Weapons Convention and presented it to each national delegation at the December 1993 meeting of the Preparatory Commission in The Hague. During its preparation, the Committee of CWC Legal Experts, a group of distinguished international jurists, law professors, legally-trained diplomats, government officials, and Parliamentarians from every region of the world, including Central Europe, reviewed the Manual. In February 1998, they finished the second edition of the Manual in order to update it in light of developments since the CWC entered into force on 29 April 1997. The Manual tries to increase understanding of the Convention by identifying its obligations and suggesting methods of meeting them. Education about CWC obligations and available alternatives to comply with these requirements can facilitate national response that are consistent among States Parties. Thus, the Manual offers options that can strengthen international realization of the Convention's goals if States Parties act compatibly in implementing them. Equally important, it is intended to build confidence that the legal issues raised by the Convention are finite and addressable. They are now nearing competition of an internet version of this document so that interested persons can access it electronically and can view the full text of all of the national implementing legislation it cites. The internet address, or URL, for the internet version of the Manual is http: //www.cwc.ard.gov. This paper draws from the Manual. It comparatively addresses approximately thirty

  6. 10 CFR Appendix H to Part 73 - Weapons Qualification Criteria

    Science.gov (United States)

    2010-01-01

    ... position, then fire 2 rounds and reholster 2 15 yards 2 5 seconds Standing, draw weapon, move to kneeling...) Standing, draw weapon, fire 2 rounds, move to kneeling position and fire 2 rounds, reload and reholster Minimum qualifying = 70%. 4 15 yards 2 5 seconds Draw weapon and fire 2 rounds standing, come to low...

  7. 25 CFR 11.444 - Carrying concealed weapons.

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Carrying concealed weapons. 11.444 Section 11.444 Indians... ORDER CODE Criminal Offenses § 11.444 Carrying concealed weapons. A person who goes about in public places armed with a dangerous weapon concealed upon his or her person is guilty of a misdemeanor unless...

  8. Someone at School Has a Weapon. What Should I Do?

    Science.gov (United States)

    ... for You Shyness Someone at School Has a Weapon. What Should I Do? KidsHealth > For Teens > Someone at School Has a Weapon. What Should I Do? Print A A A ... Why do students bring guns, knives, or other weapons to school? Some are just showing off, others ...

  9. 76 FR 1136 - Electroshock Weapons Test and Measurement Workshop

    Science.gov (United States)

    2011-01-07

    ... National Institute of Standards and Technology Electroshock Weapons Test and Measurement Workshop AGENCY..., academia, military, test instrument manufacturers, etc.) of electroshock weapons that provide stand-off... requirements for electroshock weapons, the Law Enforcement Standards Office (OLES) at NIST has developed...

  10. 46 CFR 386.23 - Weapons and explosives.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 8 2010-10-01 2010-10-01 false Weapons and explosives. 386.23 Section 386.23 Shipping... AND GROUNDS AT THE UNITED STATES MERCHANT MARINE ACADEMY § 386.23 Weapons and explosives. No person shall carry or possess firearms, other dangerous or deadly weapons or parts thereof, explosives or items...

  11. Agent-based Modeling Methodology for Analyzing Weapons Systems

    Science.gov (United States)

    2015-03-26

    43 Figure 14: Simulation Study Methodology for the Weapon System Analysis Metrics Definition and Data Collection The analysis plan calls for...AGENT-BASED MODELING METHODOLOGY FOR ANALYZING WEAPONS SYSTEMS THESIS Casey D. Connors, Major, USA...AGENT-BASED MODELING METHODOLOGY FOR ANALYZING WEAPONS SYSTEMS THESIS Presented to the Faculty Department of Operational Sciences

  12. 36 CFR 702.7 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons and explosives. 702.7... Weapons and explosives. Except where duly authorized by law, and in the performance of law enforcement functions, no person shall carry firearms, other dangerous or deadly weapons, or explosives, either openly...

  13. 7 CFR 501.12 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 501.12 Section 501.12... OF AGRICULTURE CONDUCT ON U.S. MEAT ANIMAL RESEARCH CENTER, CLAY CENTER, NEBRASKA § 501.12 Weapons... arrows, darts, other dangerous or deadly weapons, or explosives, either openly or concealed, except as...

  14. 31 CFR 407.13 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Weapons and explosives. 407.13... TREASURY ANNEX § 407.13 Weapons and explosives. No person while on the property shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or concealed, except for official purposes. ...

  15. 49 CFR 1544.219 - Carriage of accessible weapons.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 9 2010-10-01 2010-10-01 false Carriage of accessible weapons. 1544.219 Section...: AIR CARRIERS AND COMMERCIAL OPERATORS Operations § 1544.219 Carriage of accessible weapons. (a... weapons, do not apply to a law enforcement officer (LEO) aboard a flight for which screening is required...

  16. 31 CFR 91.13 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 1 2010-07-01 2010-07-01 false Weapons and explosives. 91.13 Section... CONDUCT IN OR ON THE BUREAU OF THE MINT BUILDINGS AND GROUNDS § 91.13 Weapons and explosives. No person while on the property shall carry firearms, other dangerous or deadly weapons, or explosives, either...

  17. 44 CFR 15.15 - Weapons and explosives.

    Science.gov (United States)

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Weapons and explosives. 15.15... EMERGENCY TRAINING CENTER § 15.15 Weapons and explosives. No person entering or while at Mt. Weather or the NETC will carry or possess firearms, other dangerous or deadly weapons, explosives or items intended to...

  18. 7 CFR 502.13 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 502.13 Section 502.13....13 Weapons and explosives. No person while in or on BARC property shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or concealed, except as officially authorized for...

  19. 32 CFR 552.125 - Disposition of confiscated weapons.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 3 2010-07-01 2010-07-01 true Disposition of confiscated weapons. 552.125..., Ammunition, and Explosives-Fort Lewis, Washington § 552.125 Disposition of confiscated weapons. Commanders will maintain confiscated weapons in the unit arms room pending final disposition. They will provide...

  20. 36 CFR 504.14 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons and explosives. 504... GOVERNING SMITHSONIAN INSTITUTION BUILDINGS AND GROUNDS § 504.14 Weapons and explosives. No person while on the premises shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or...

  1. 31 CFR 0.215 - Possession of weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 1 2010-07-01 2010-07-01 false Possession of weapons and explosives... OF THE TREASURY EMPLOYEE RULES OF CONDUCT Rules of Conduct § 0.215 Possession of weapons and explosives. (a) Employees shall not possess firearms, explosives, or other dangerous or deadly weapons...

  2. 7 CFR 500.12 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 500.12 Section 500.12... OF AGRICULTURE NATIONAL ARBORETUM Conduct on U.S. National Arboreturm Property § 500.12 Weapons and... weapons, or explosives, either openly or concealed, except for authorized official purposes. (b) No person...

  3. 7 CFR 503.13 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 6 2010-01-01 2010-01-01 false Weapons and explosives. 503.13 Section 503.13... OF AGRICULTURE CONDUCT ON PLUM ISLAND ANIMAL DISEASE CENTER § 503.13 Weapons and explosives. No person while in or on the PIADC shall carry firearms or other dangerous or deadly weapons or explosives...

  4. 36 CFR 13.30 - Weapons, traps and nets.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 1 2010-07-01 2010-07-01 false Weapons, traps and nets. 13... INTERIOR NATIONAL PARK SYSTEM UNITS IN ALASKA General Provisions § 13.30 Weapons, traps and nets. (a... of this chapter, the following are prohibited— (1) Possessing a weapon, trap, or net; (2) Carrying a...

  5. 14 CFR 135.119 - Prohibition against carriage of weapons.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false Prohibition against carriage of weapons... Flight Operations § 135.119 Prohibition against carriage of weapons. No person may, while on board an aircraft being operated by a certificate holder, carry on or about that person a deadly or dangerous weapon...

  6. 32 CFR 228.7 - Prohibition on weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 2 2010-07-01 2010-07-01 false Prohibition on weapons and explosives. 228.7... (CONTINUED) MISCELLANEOUS SECURITY PROTECTIVE FORCE § 228.7 Prohibition on weapons and explosives. No persons... illegal or legally controlled weapon (e.g., throwing stars, switchblades), explosives, or items intended...

  7. 4 CFR 25.14 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 4 Accounts 1 2010-01-01 2010-01-01 false Weapons and explosives. 25.14 Section 25.14 Accounts... AND ON ITS GROUNDS § 25.14 Weapons and explosives. No person while entering or in the GAO Building or on its grounds shall carry or possess firearms, other dangerous or deadly weapons, explosives or...

  8. 31 CFR 700.11 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Weapons and explosives. 700.11... FEDERAL LAW ENFORCEMENT TRAINING CENTER (FLETC) BUILDINGS AND GROUNDS § 700.11 Weapons and explosives. No person, while on the property, shall carry firearms, other dangerous or deadly weapons, or explosives...

  9. 50 CFR 27.43 - Weapons other than firearms.

    Science.gov (United States)

    2010-10-01

    ... 50 Wildlife and Fisheries 6 2010-10-01 2010-10-01 false Weapons other than firearms. 27.43 Section... (CONTINUED) THE NATIONAL WILDLIFE REFUGE SYSTEM PROHIBITED ACTS Disturbing Violations: With Weapons § 27.43 Weapons other than firearms. The use or possession of cross bows, bows and arrows, air guns, spears, gigs...

  10. 43 CFR 423.30 - Weapons, firearms, explosives, and fireworks.

    Science.gov (United States)

    2010-10-01

    ... 43 Public Lands: Interior 1 2010-10-01 2010-10-01 false Weapons, firearms, explosives, and... WATERBODIES Rules of Conduct § 423.30 Weapons, firearms, explosives, and fireworks. (a) You may possess... exceptions: (1) You must not have a weapon in your possession when at or in a Reclamation facility. (2) You...

  11. 36 CFR 520.15 - Weapons and explosives.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 3 2010-07-01 2010-07-01 false Weapons and explosives. 520... Weapons and explosives. No person while on the premises shall carry firearms, other dangerous or deadly weapons, or explosives, either openly or concealed, except for official purposes, nor shall any person...

  12. 15 CFR 265.39 - Weapons and explosives.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 1 2010-01-01 2010-01-01 false Weapons and explosives. 265.39 Section..., GAITHERSBURG, MARYLAND, AND BOULDER AND FORT COLLINS, COLORADO Buildings and Grounds § 265.39 Weapons and... dangerous or deadly weapons or materials, or explosives, either openly or concealed, without the written...

  13. Demand Analysis of Informational Shipboard Gun Weapon System Interface Design

    Directory of Open Access Journals (Sweden)

    WANG Hui-chuan

    2013-04-01

    Full Text Available According to development demand of informational shipboard gun weapon system, design concept of shipboard gun weapon system interface is proposed. System composition is put forward and function demand of interface is analyzed from combat, training and detection aspects. General principle need to be followed in design process. A new concept is provided for development of shipboard gun weapon system interface.

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

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

  16. 运力受限的应急物资动态调度模型及算法%Model and algorithm of relief materials dynamic scheduling without sufficient vehicle quantity

    Institute of Scientific and Technical Information of China (English)

    王旭坪; 马超; 阮俊虎

    2013-01-01

    针对大规模突发事件下应急物资动态调度问题,把灾民的损失用物资未满足度的形式进行量化,构建以最小化灾民损失和车辆调度费用为目标的混合整数规划模型,以对运力受限情况下的救援车辆路径选择和应急物资分配进行综合决策.利用分层求解策略缩小问题的求解空间,改进基于客户点的编码方式,设计了针对此问题的遗传算法.代入实验数据得出了物资集散地不同运力下的应急物资动态调度方案,进而确定了最优运力配置量,与现实情况下的配送方案比较表明此模型和算法是有效的.%This paper focused on relief materials dynamic scheduling after large emergency.We quantified the loss of victims in terms of unmet needs,and formulated a mixed integer programming model in order to minimize victims' loss and vehicle scheduling expense.The main decisions were determining the delivery routes and allocating the relief supplies from relief distribution center (RDC) to save points without sufficient vehicle quantity.We used the hierarchical thinking to reduce solution space,improved the coding method and designed the genetic algorithm for this problem.Finally,experimental results show the dynamic scheduling scheme under different vehicle quantity,and determine the optimal vehicle quantity in RDC through comparative analysis,the validity of this model and algorithm is verified combining with realistic distribution scheme.

  17. Planning and scheduling for agile manufacturers: The Pantex Process Model

    Energy Technology Data Exchange (ETDEWEB)

    Kjeldgaard, E.A. [Sandia National Labs., Albuquerque, NM (United States). Transportation Systems Analysis Dept.; Jones, D.A. [Parallax, Inc., Albuquerque, NM (United States); List, G.F. [Rensselaer Polytechnic Inst., Troy, NY (United States); Tumquist, M.A. [Cornell Univ., Ithaca, NY (United States)

    1998-02-01

    Effective use of resources that are shared among multiple products or processes is critical for agile manufacturing. This paper describes the development and implementation of a computerized model to support production planning in a complex manufacturing system at the Pantex Plant, a US Department of Energy facility. The model integrates two different production processes (nuclear weapon disposal and stockpile evaluation) that use common facilities and personnel at the plant. The two production processes are characteristic of flow-shop and job shop operations. The model reflects the interactions of scheduling constraints, material flow constraints, and the availability of required technicians and facilities. Operational results show significant productivity increases from use of the model.

  18. Managing nuclear weapons in the United States

    Energy Technology Data Exchange (ETDEWEB)

    Miller, G.

    1993-03-16

    This report discusses the management and security of nuclear weapons in the post-cold war United States. The definition of what constitutes security is clearly changing in the US. It is now a much more integrated view that includes defense and the economy. The author tries to bring some semblance of order to these themes in this brief adaptation of a presentation.

  19. Optical countermeasures against CLOS weapon systems

    NARCIS (Netherlands)

    Toet, A.; Benoist, K.W.; Lingen, J.N.J. van; Schleijpen, H.M.A.

    2013-01-01

    There are many weapon systems in which a human operator acquires a target, tracks it and designates it. Optical countermeasures against this type of systems deny the operator the possibility to fulfill this visual task. We describe the different effects that result from stimulation of the human

  20. Europium-155 in Debris from Nuclear Weapons

    DEFF Research Database (Denmark)

    Aarkrog, Asker; Lippert, Jørgen Emil

    1967-01-01

    The lithium-drifted germanium detector enables determination of europium-155 on a routine basis in environmental samples contaminated with debris from nuclear weapons. From measurements of europium-155, cesium-144, and strontium-90 in air filters collected between 1961 and 1966, the yield...

  1. The Politics of Weapons Standardization in NATO.

    Science.gov (United States)

    1981-07-01

    does raise new and useful perspectives on the problem. And, as he notes, it raises the spectre that instead of attacking the causes of NATO’s malaise...construct- ing his Utopia . 1 58 Two articles, which focus on the weapons procurement process within the United States alone, note the unnecessary

  2. Nuclear Weapon Testing Limitations and International Security

    Science.gov (United States)

    Corden, Pierce S.

    2017-01-01

    For over 50 years stopping nuclear weapon tests has been sought to support achieving international security without nuclear weapons. Testing is the critical path beyond primitive fission devices, e.g. to develop thermonuclear weapons, reduce weight and volume and increase yield. The 1958 Geneva Conference of Experts considered ways to verify a test ban. With then-limitations on seismology, and lack of in-country monitoring and on-site inspections, the 1963 Limited Test Ban Treaty prohibits testing only in the atmosphere, outer space and under water, and is verified by National Technical Means. The US and USSR agreed to a limit of 150 kilotons on underground explosions in the 1970s-80s. The 1996 Comprehensive Nuclear-Test-Ban Treaty bans all nuclear explosions. Its International Monitoring System - seismic, hydroacoustic, infrasound and radionuclide sensors - is being used, and has easily detected testing by the DPRK. On-site inspections will be available under an in-force Treaty. A 2012 National Academy report concludes that cheating attempts would not undermine U.S. security, and the program for monitoring and extending the life of US weapons has succeeded since US testing ceased in 1992.

  3. Principles of Guided Missiles and Nuclear Weapons.

    Science.gov (United States)

    Naval Personnel Program Support Activity, Washington, DC.

    Fundamentals of missile and nuclear weapons systems are presented in this book which is primarily prepared as the second text of a three-volume series for students of the Navy Reserve Officers' Training Corps and the Officer Candidate School. Following an introduction to guided missiles and nuclear physics, basic principles and theories are…

  4. The Spear: An Effective Weapon Since Antiquity

    Directory of Open Access Journals (Sweden)

    Robert E. Dohrenwend

    2012-07-01

    Full Text Available The spear is perhaps man’s oldest weapon, and may even be his oldest tool. Over the hundreds of thousands of years of the weapon’s existence, it evolved from a pointed stick into an efficient hunting missile, and then became the most effective hand-held bladed weapon humans ever devised. The spear and its use is the only martial art originally devised for use against species other than our own, and more than any other weapon, the spear emphasizes the relationship between hunting and warfare. Virtually without exception, the spear is present wherever there are humans. The spear may claim to be the senior martial art, and the weapon is still in use today. Early techniques are preserved by the small number of Japanese sojutsu schools, and modern Chinese martial artists have developed elegant and impressive gymnastic routines for the spear. The javelin throw is a modern Olympic track and field event, and there are people who have resurrected the Aztec atlatl for sporting competition. Today, the spear is still used in Europe for hunting wild boar, and the continued issue of the obsolete bayonet to modern soldiers testifies to a deep, almost instinctive respect still possessed by the military for the spear.

  5. Data analysis with the DIANA meta-scheduling approach

    CERN Document Server

    Anjum, A; Willers, I

    2008-01-01

    The concepts, design and evaluation of the Data Intensive and Network Aware (DIANA) meta-scheduling approach for solving the challenges of data analysis being faced by CERN experiments are discussed in this paper. Our results suggest that data analysis can be made robust by employing fault tolerant and decentralized meta-scheduling algorithms supported in our DIANA meta-scheduler. The DIANA meta-scheduler supports data intensive bulk scheduling, is network aware and follows a policy centric meta-scheduling. In this paper, we demonstrate that a decentralized and dynamic meta-scheduling approach is an effective strategy to cope with increasing numbers of users, jobs and datasets. We present 'quality of service' related statistics for physics analysis through the application of a policy centric fair-share scheduling model. The DIANA meta-schedulers create a peer-to-peer hierarchy of schedulers to accomplish resource management that changes with evolving loads and is dynamic and adapts to the volatile nature of t...

  6. Scheduling Activity in an Agent Architecture

    OpenAIRE

    Soto, Ignacio

    2000-01-01

    Agents for applications in dynamic environments require artificial intelligence techniques to solve problems to achieve their objectives. For example, they must develop plans of actions to carry out missions in their environment, in other words, to achieve some state in the world. But also, the agents must fulfill real-time requirements that arise because the characteristics of the applications and the dynamism of the environment. In this paper we analyze the use of a schedule of activity in ...

  7. Agent-based transportation planning compared with scheduling heuristics

    NARCIS (Netherlands)

    Mes, Martijn; Heijden, van der Matthieu; Harten, van Aart

    2004-01-01

    Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule thei

  8. Improving the performance of sorter systems by scheduling inbound containers

    NARCIS (Netherlands)

    Haneyah, S.W.A.; Schutten, Johannes M.J.; Fikse, K.

    2013-01-01

    This paper addresses the inbound containers scheduling problem for automated sorter systems in two different industrial sectors: parcel & postal sorting and baggage handling. We build on existing literature, particularly on the dynamic load balancing algorithm designed for the parcel hub scheduling

  9. Agent-based transportation planning compared with scheduling heuristics

    NARCIS (Netherlands)

    Mes, Martijn R.K.; van der Heijden, Matthijs C.; van Harten, Aart

    2004-01-01

    Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule

  10. Air gun wounding and current UK laws controlling air weapons.

    Science.gov (United States)

    Bruce-Chwatt, Robert Michael

    2010-04-01

    Air weapons whether rifles or pistols are, potentially, lethal weapons. The UK legislation is complex and yet little known to the public. Hunting with air weapons and the laws controlling those animals that are permitted to be shot with air weapons is even more labyrinthine due to the legal power limitations on the possession of air weapons. Still relatively freely available by mail order or on the Internet, an increasing number of deaths have been reported from the misuse of air weapons or accidental discharges. Ammunition for air weapons has become increasingly sophisticated, effective and therefore increasingly dangerous if misused, though freely available being a mere projectile without a concomitant cartridge containing a propellant and an initiator.

  11. Environmental management of assembled chemical weapons assessment program.

    Energy Technology Data Exchange (ETDEWEB)

    Frey, G.; Mohrman, G.; Templin, B. R.

    1999-05-07

    Environmental planning and management was an integral part of the ACWA Program planning process. To ensure that environmental protection issues could be addressed expeditiously and not delay the demonstrations, the PMACWA scaled the technology demonstrations such that simplified regulatory processes and existing research and development facilities could be used. The use of enclosed facilities for the demonstrations prevents any uncontrolled discharges to the environment and made it possible to conduct environmental assessments relatively quickly. The PMACWA also arranged for public briefings to ease any community concerns over the operations with chemical weapons. These steps precluded regulatory and community resistance to the ACWA activities. The cooperation of the regulators and stakeholders has been a key element in enabling the ACWA Program to move with the speed that it has to date. Technology demonstrations are currently underway and are scheduled to be completed in late May 1999. The data collected during these demonstrations will be used to prepare and submit a summary report to Congress by August 1999. The challenge continues for the ACWA management to guide the demonstrations to completion and to plan for possible pilot testing. As the scale of the ACWA facilities increase in size, the ease of reduced regulatory processes and environmental analyses will no longer be possible. However, the PMACWA will continue to explore all paths through the environmental process to speed the ACWA program to its goals while at the same time ensuring adequate protection of public health and safety and of the environment.

  12. PRI: An Periodically Receiver-Initiated Task Scheduling Algorithm

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Task scheduling is a key problem for the distributed computation. This thesis analyzes receiver-initiated(RI) task scheduling algorithm, finds its weakness and presents an improved algorithm-PRI algorithm. This algorithm schedules the concurrent tasks onto network of workstation dynamically at runtime, and initiates task scheduling by the node of low load. The threshold on each node can be modified according to the system information which is periodically detected. Meanwhile, the detecting period can be adjusted in terms of the change of the system state. The result of the experiments shows that the PRI algorithm is superior to the RI algorithm.

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

  14. 含间歇性电源的电力系统动态有功优化调度的思路构建%Power System Containing Intermittent Power Supply Construction Dynamic Optimization Scheduling of Active Thinking

    Institute of Scientific and Technical Information of China (English)

    车轮

    2014-01-01

    近年来,随着风电场和光伏电站的大量并网,对电力系统的运行造成了一定影响。在电力系统中,可将风电场和光伏电站等作为间歇性电源。为了实现间歇性电源在电力系统内部的合理消纳,有必要制订合理、可行的调度策略,这样不仅可以提高间歇性电源本身的调节能力,还能提高电力系统运行的安全性和经济性。基于此,就含间歇性电源的电力系统动态有功优化调度思路的构建展开研究。%In recent years, with wind farms and solar power plants and a large network of operation of power systems caused some impact. In the power system can be such as wind farms and solar power plants, as intermittent power supply. In order to achieve intermittent electricity supply at a reasonable consumptive internal system, it is necessary to establish a reasonable and feasible scheduling policy, so not only can improve the intermittent ability to regulate its own power supply, but also improve the operation of the power system security and economy. Based on this, the intermittent power supply systems with active optimization of dynamic scheduling idea to build a study.

  15. Process Planning and Scheduling Integration in an Open Manufacturing Environment

    Institute of Scientific and Technical Information of China (English)

    LOU Ping; LIU Quan; ZHOU Zu-de; QUAN Shu-hai; FANG Ban-hang

    2009-01-01

    New open manufacturing environments have been proposed aiming at realizing more flexible distributed manufacturing paradigms, which can deal with not only dynamic changes in volume and variety of products, but also changes of machining equipments, dispersals of processing locations, and also with unscheduled disruptions. This research is to develop an integrated process planning and scheduling system, which is suited to this open, dynamic,distributed manufacturing environment. Multi-agent system (MAS) approaches are used for integration of manufacturing processing planning and scheduling in an open distributed manufacturing environment, in which process planning can be adjusted dynamically and manufacturing resources can increase/decrease according to the requirements. One kind of multi-level dynamic negotiated approaches to process planning and scheduling is presented for the integration of manufacturing process planning and scheduling.

  16. #TheWeaponizationOfSocialMedia

    DEFF Research Database (Denmark)

    Nissen, Thomas Elkjer

    In today’s conflict environment, transformed by information technology and of who can communicate and how, states, non-state actors, ad hoc activist networks and individuals create effect(s) in and through social network media in support of their objectives. #TheWeaponizationOfSocialMedia develops...... a framework for understanding how social network media shapes global politics and contemporary conflicts by examining their role as a platform for conduction intelligence collection, targeting, cyber-operations, psychological warfare and command and control activities. Through these, the weaponization...... of social media shows both the possibilities and the limitations of social network media in contemporary conflicts and makes a contribution to theorizing and studying contemporary conflicts....

  17. Emergency management of chemical weapons injuries.

    Science.gov (United States)

    Anderson, Peter D

    2012-02-01

    The potential for chemical weapons to be used in terrorism is a real possibility. Classes of chemical weapons include nerve agents, vesicants (blister agents), choking agents, incapacitating agents, riot control agents, blood agents, and toxic industrial chemicals. The nerve agents work by blocking the actions of acetylcholinesterase leading to a cholinergic syndrome. Nerve agents include sarin, tabun, VX, cyclosarin, and soman. The vesicants include sulfur mustard and lewisite. The vesicants produce blisters and also damage the upper airways. Choking agents include phosgene and chlorine gas. Choking agents cause pulmonary edema. Incapacitating agents include fentanyl and its derivatives and adamsite. Riot control agents include Mace and pepper spray. Blood agents include cyanide. The mechanism of toxicity for cyanide is blocking oxidative phosphorylation. Toxic industrial chemicals include agents such as formaldehyde, hydrofluoric acid, and ammonia.

  18. Making Weapons for the Terracotta Army

    Directory of Open Access Journals (Sweden)

    Marcos Martinón-Torres

    2011-10-01

    Full Text Available The Terracotta Army of the First Emperor of China is one of the most emblematic archaeological sites in the world. Many questions remain about the logistics of technology, standardisation and labour organisation behind the creation of such a colossal construction in just a few decades over 2,000 years ago. An ongoing research project co-ordinated between the UCL Institute of Archaeology and the Emperor Qin Shihang's Terracotta Army Museum is beginning to address some of these questions. This paper outlines some results of the typological, metric, microscopic, chemical and spatial analyses of the 40,000 bronze weapons recovered with the Terracotta Warriors. Thanks to a holistic approach developed specifically for this project, it is possible to reveal remarkable aspects of the organisation of the Qin workforce in production cells, of the standardisation, efficiency and quality-control procedures employed, and of the sophisticated technical knowledge of the weapon-makers.

  19. Ending the scourge of chemical weapons

    Energy Technology Data Exchange (ETDEWEB)

    Brin, J.

    1993-04-01

    After more than 20 years of arduous negotiations, representatives from 131 countries gathered in Paris in January to sign a treaty banning the development, production, and transfer to other countries of chemical-warfare agents and their means of delivery. The treaty - called the Chemical Weapons Convention, or CWC - complements the more limited Geneva Protocol of 1925, which bans the use of toxic chemicals in warfare. When the CWC enters into force in about two years, it will prohibit the manufacture for military purposes of lethal chemicals such as sulfur mustard, which causes painful skin blistering and lung damage, and nerve agents, which cause rapid death by interfering with the transmission of nerve impulses. The goal is to eliminate from the earth this particularly inhumane form of warfare. The paper discusses facets of the treaty, especially the verification challenge with its inspection on demand features. Short accompanying pieces discuss classifying chemicals and the destruction of chemical weapons under the CWC.

  20. Effects of nuclear weapons. Third edition

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, S.; Dolan, P.J.

    1977-01-01

    Since the last edition of ''The Effects of Nuclear Weapons'' in 1962 much new information has become available concerning nuclear weapon effects. This has come in part from the series of atmospheric tests, including several at very high altitudes, conducted in the Pacific Ocean area in 1962. In addition, laboratory studies, theoretical calculations, and computer simulations have provided a better understanding of the various effects. A new chapter has been added on the electromagnetic pulse. The chapter titles are as follows: general principles of nuclear explosions; descriptions of nuclear explosions; air blast phenomena in air and surface bursts; air blast loading; structural damage from air blast; shock effects of surface and subsurface bursts; thermal radiation and its effects; initial nuclear radiation; residual nuclear radiation and fallout; radio and radar effects; the electromagnetic pulse and its effects; and biological effects. (LTN)

  1. The Effects of Nuclear Weapons. Third edition

    Energy Technology Data Exchange (ETDEWEB)

    Glasstone, S; Dolan, P J

    1977-01-01

    Since the last edition of ''The Effects of Nuclear Weapons'' in 1962 much new information has become available concerning nuclear weapon effects. This has come in part from the series of atmospheric tests, including several at very high altitudes, conducted in the Pacific Ocean area in 1962. In addition, laboratory studies, theoretical calculations, and computer simulations have provided a better understanding of the various effects. A new chapter has been added on the electromagnetic pulse. The chapter titles are as follows: general principles of nuclear explosions; descriptions of nuclear explosions; air blast phenomena in air and surface bursts; air blast loading; structural damage from air blast; shock effects of surface and subsurface bursts; thermal radiation and its effects; initial nuclear radiation; residual nuclear radiation and fallout; radio and radar effects; the electromagnetic pulse and its effects; and biological effects. (LTN)

  2. New packet scheduling algorithm in wireless CDMA data networks

    Science.gov (United States)

    Wang, Yu; Gao, Zhuo; Li, Shaoqian; Li, Lemin

    2002-08-01

    The future 3G/4G wireless communication systems will provide internet access for mobile users. Packet scheduling algorithms are essential for QoS of diversified data traffics and efficient utilization of radio spectrum.This paper firstly presents a new packet scheduling algorithm DSTTF under the assumption of continuous transmission rates and scheduling intervals for CDMA data networks . Then considering the constraints of discrete transmission rates and fixed scheduling intervals imposed by the practical system, P-DSTTF, a modified version of DSTTF, is brought forward. Both scheduling algorithms take into consideration of channel condition, packet size and traffic delay bounds. The extensive simulation results demonstrate that the proposed scheduling algorithms are superior to some typical ones in current research. In addition, both static and dynamic wireless channel model of multi-level link capacity are established. These channel models sketch better the characterizations of wireless channel than two state Markov model widely adopted by the current literature.

  3. The US nuclear weapon infrastructure and a stable global nuclear weapon regime

    Energy Technology Data Exchange (ETDEWEB)

    Immele, John D [Los Alamos National Laboratory; Wagner, Richard L [Los Alamos National Laboratory

    2009-01-01

    US nuclear weapons capabilities -- extant force structure and nuclear weapons infrastructure as well as declared policy -- influence other nations' nuclear weapons postures, at least to some extent. This influence can be desirable or undesirable, and is, of course, a mixture of both. How strong the influence is, and its nature, are complicated, controversial, and -- in our view -- not well understood but often overstated. Divergent views about this influence and how it might shape the future global nuclear weapons regime seem to us to be the most serious impediment to reaching a national consensus on US weapons policy, force structure and supporting infrastructure. We believe that a paradigm shift to capability-based deterrence and dissuasion is not only consistent with the realities of the world and how it has changed, but also a desirable way for nuclear weapon postures and infrastructures to evolve. The US and other nuclear states could not get to zero nor even reduce nuclear arms and the nuclear profile much further without learning to manage latent capability. This paper has defined three principles for designing NW infrastructure both at the 'next plateau' and 'near zero.' The US can be a leader in reducing weapons and infrastructure and in creating an international regime in which capability gradually substitutes for weapons in being and is transparent. The current 'strategy' of not having policy or a Congressionally-approved plan for transforming the weapons complex is not leadership. If we can conform the US infrastructure to the next plateau and architect it in such a way that it is aligned with further arms reductions, it will have these benefits: The extant stockpile can be reduced in size, while the smaller stockpile still deters attack on the US and Allies. The capabilities of the infrastructure will dissuade emergence of new challenges/threats; if they emerge, nevertheless, the US will be able to deal with them in

  4. Warhead politics: Livermore and the competitive system of nuclear weapon design

    Energy Technology Data Exchange (ETDEWEB)

    Francis, Sybil [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)

    1995-06-01

    From the 1950s onward, US evolved a two-laboratory system to design, develop, and test nuclear weapons. LANL (New Mexico) dates from World War II. The founding in 1952 of LLNL in California effectively established the two-laboratory system. Despite essentially identical missions, LANL and LLNL adopted different strategies and approaches to the development of nuclear weapons. This thesis looks to their joint history for an explanation of this and consequent questions (how did the two-laboratory system originate and evolve? how did it function? what impact did it have on nuclear weapons development?) The incentives and constraints that shaped laboratory strategies and outputs was determined by military demand for nuclear weapons, an informal mandate against laboratory duplication, congressional support for competition, and Livermore`s role as the ``second lab.`` This thesis discusses the laboratories` role in the arms race, organizational strategies for coping with changing political environments, dynamics of technological innovation, and the leverage of policymakers over large organizations.

  5. Adversarial Use of Weapons of Mass Destruction

    Science.gov (United States)

    2000-01-01

    had weaponized 10,000 liters of concentrated botu- linum toxin, 6,500 liters of concentrated anthrax, and 1,580 liters of concentrated aflatoxin .2 The...might cost only $30–50 million, according to the Research Institute for the Study of Conflict and Terrorism. That could be cut in half if safety ...10 Most nations pursuing NBC capabilities today are also consider- ing long-range delivery means. On the strategic level adversaries are likely to use

  6. Defense Acquisitions: Assessments of Selected Weapon Programs

    Science.gov (United States)

    2016-03-01

    of contractors delivering the 10 costliest programs have performed well relative to broad-based market indices, indicating that investors expect...16-329SP Assessments of Major Weapon Programs Two programs—the B-2 Extremely High Frequency Satellite Communications and Computer...expected. The B-2 Extremely High Frequency Satellite Communications and Computer Increment 1 date was revised to reflect the actual delivery of

  7. The Aerodynamics of High Speed Aerial Weapons

    OpenAIRE

    Prince, Simon A.

    1999-01-01

    The focus of this work is the investigation of the complex compressible flow phenomena associated with high speed aerial weapons. A three dimen- sional multiblock finite volume flow solver was developed with the aim of studying the aerodynamics of missile configurations and their component structures. The first component of the study involved the aerodynamic investigation of the isolated components used in the design of conventional missile config- urations. The computati...

  8. Imprecise Probability Methods for Weapons UQ

    Energy Technology Data Exchange (ETDEWEB)

    Picard, Richard Roy [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Vander Wiel, Scott Alan [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2016-05-13

    Building on recent work in uncertainty quanti cation, we examine the use of imprecise probability methods to better characterize expert knowledge and to improve on misleading aspects of Bayesian analysis with informative prior distributions. Quantitative approaches to incorporate uncertainties in weapons certi cation are subject to rigorous external peer review, and in this regard, certain imprecise probability methods are well established in the literature and attractive. These methods are illustrated using experimental data from LANL detonator impact testing.

  9. Defense Acquisitions: Assessments of Selected Weapon Programs

    Science.gov (United States)

    2015-03-01

    Assessment 56 Figure 13: Examples of Knowledge Scorecards 58 Contents Page v GAO-15-342SP Assessments of Selected Weapon Programs Abbreviations...efficiencies realized through contract negotiations (13 programs), • design trades to balance affordability and capability (10 programs), • changed...at the time of our review with a scorecard and narrative summary at the bottom of the first page of each assessment. As illustrated in figure 12

  10. Conventional Weapons Effects on Reinforced Soil Walls.

    Science.gov (United States)

    1995-03-01

    of the reinforced soil wall. 14. SUBJECT TERMS 15. NUMBER OF PAGES Reinforced soil, conventional weapons, protective structures, 388 geosynthetics ...high tensile strength materials such as steel strips or geosynthetics . A single face of a reinforced soil berm can be constructed to approximately...yards of geosynthetics representing $3.1 billion have been used in a wide range of civil engineering applications (Koerner, 1990). Between 1991 and 1992

  11. RESTRICTIONS BY THE USE OF WEAPONS OF RUSSIAN CITIZENS

    Directory of Open Access Journals (Sweden)

    Lyatsa A. Kodzokova

    2016-01-01

    Full Text Available Abstract: The article considers the restrictions imposed on the circulation of civilian and service weapons. The author analyzes the restrictions on the circulation of weapons, the procedure for their implementation in practice. Federal Law "On weapons" only in paragraph 6 p. 1, art. 6 "Restrictions imposed on the circulation of civilian and service weapons" refers to the prohibition of 'turnover as a civilian and service weapons and other items affecting the action is based on the use of radiation and biological factors; weapons and other items affecting the action is based on the use of electromagnetic, light, thermal, subsonic or ultrasonic radiation and which have output parameters that exceed the value set by state standards of the Russian Federation and the relevant regulations of the federal executive authority in the field of public health, as well as these weapons and items produced outside the Russian territory " How to regard this provision of the law? As the transfer of new weapons, not specific item. 25 of the Federal Law "On weapons", or items prohibited for circulation in the territory of our state? This inconsistency decreases the effectiveness of the legal regulation of arms trafficking. Unification of definitions in this area will allow applying the law correctly and reasonably, including criminal. But for this it is necessary taking into account the experience and the modern needs of the various branches of law provide a clearer definition of "weapon" and its species. The author's conclusions may be used in law enforcement. 

  12. Why are sexually selected weapons almost absent in females?

    Institute of Scientific and Technical Information of China (English)

    Anders BERGLUND

    2013-01-01

    In sex role reversed species,predominantly females evolve sexually selected traits,such as ornaments and/or weapons.Female ornaments are common and their function well documented in many species,whether sex role reversed or not.However,sexually selected female weapons seem totally absent except for small wing spurs in three jacana species,present in both males and females.This poor female weaponry is in sharp contrast to the situation in species with conventional sex roles:males commonly have evolved sexually selected weapons as well as ornaments.At the same time,females in many taxa have naturally selected weapons,used in competition over resources or in predator defence.Why are sexually selected weapons then so rare,almost absent,in females? Here I briefly review weaponry in females and the function of these weapons,conclude that the near absence of sexually selected weapons begs an explanation,and suggest that costs of sexually selected weapons may exceed costs of ornaments.Females are more constrained when evolving sexually selected traits compared to males,at least compared to those males that do not provide direct benefits,as trait costs reduce a female's fecundity.I suggest that this constraining trade-off between trait and fecundity restricts females to evolve ornaments but rarely weapons.The same may apply to paternally investing males.Whether sexually selected weapons actually are more costly than sexually selected ornaments remains to be investigated.

  13. An introduction to optimal satellite range scheduling

    CERN Document Server

    Vázquez Álvarez, Antonio José

    2015-01-01

    The satellite range scheduling (SRS) problem, an important operations research problem in the aerospace industry consisting of allocating tasks among satellites and Earth-bound objects, is examined in this book. SRS principles and solutions are applicable to many areas, including: Satellite communications, where tasks are communication intervals between sets of satellites and ground stations Earth observation, where tasks are observations of spots on the Earth by satellites Sensor scheduling, where tasks are observations of satellites by sensors on the Earth. This self-contained monograph begins with a structured compendium of the problem and moves on to explain the optimal approach to the solution, which includes aspects from graph theory, set theory, game theory and belief networks. This book is accessible to students, professionals and researchers in a variety of fields, including: operations research, optimization, scheduling theory, dynamic programming and game theory. Taking account of the distributed, ...

  14. Distributed job scheduling in MetaCentrum

    Science.gov (United States)

    Tóth, Šimon; Ruda, Miroslav

    2015-05-01

    MetaCentrum - The Czech National Grid provides access to various resources across the Czech Republic. The utilized resource management and scheduling system is based on a heavily modified version of the Torque Batch System. This open source resource manager is maintained in a local fork and was extended to facilitate the requirements of such a large installation. This paper provides an overview of unique features deployed in MetaCentrum. Notably, we describe our distributed setup that encompasses several standalone independent servers while still maintaining full cooperative scheduling across the grid. We also present the benefits of our virtualized infrastructure that enables our schedulers to dynamically request ondemand virtual machines, that are then used to facilitate the varied requirements of users in our system, as well as enabling support for user requested virtual clusters that can be further interconnected using a private VLAN.

  15. Dispatch Scheduling to Maximize Exoplanet Detection

    Science.gov (United States)

    Johnson, Samson; McCrady, Nate; MINERVA

    2016-01-01

    MINERVA is a dedicated exoplanet detection telescope array using radial velocity measurements of nearby stars to detect planets. MINERVA will be a completely robotic facility, with a goal of maximizing the number of exoplanets detected. MINERVA requires a unique application of queue scheduling due to its automated nature and the requirement of high cadence observations. A dispatch scheduling algorithm is employed to create a dynamic and flexible selector of targets to observe, in which stars are chosen by assigning values through a weighting function. I designed and have begun testing a simulation which implements the functions of a dispatch scheduler and records observations based on target selections through the same principles that will be used at the commissioned site. These results will be used in a larger simulation that incorporates weather, planet occurrence statistics, and stellar noise to test the planet detection capabilities of MINERVA. This will be used to heuristically determine an optimal observing strategy for the MINERVA project.

  16. Dynamic load balancing scheduling strategy against vulnerability in P2P sub-domain network%P2P分域网络动态负载均衡调度的抗脆弱性策略

    Institute of Scientific and Technical Information of China (English)

    王建勇; 李玉玲; 景秀; 刘峰

    2011-01-01

    The hubs in P2P network increase the network vulnerability.To reduce this kind of vulnerability, a dynamically scheduling strategy for network load balancing is proposed, in which, a P2P network is devided into several domains according to the physical location of P2P nodes, and then it designs a function which can quantify the load of nodes equitably and dynamically.When a consumer node sends a downloading request, the node with the smallest dynamic factor is selected as a server node, which can balance the load of P2P network effectively.Simulations show that this strategy can avoid the forming of hubs,enhance the robustness of network,and make P2P networks develop sustainably and healthily.%P2P网络中集散节点的存在加重了网络的脆弱性.提出一种动态负载均衡调度的抗脆弱性策略,该策略依据节点物理位置的邻近性对网络进行了分域,并设计出更为公平的函数对节点的负载进行动态的量化,当消费节点发出下载请求后,选择负载动态变化因子最小的节点作为服务节点,避免了单个节点负载猛增的情况,均衡了节点的负载.仿真证明该策略能有效抑制网络中集散节点的形成,增强网络的健壮性,从而达到保障P2P网络可持续健康发展的目的.

  17. Nuclear weapons and NATO-Russia relations

    Energy Technology Data Exchange (ETDEWEB)

    Cornwell, G.C.

    1998-12-01

    Despite the development of positive institutional arrangements such as Russian participation in the NATO-led peacekeeping force in Bosnia and the NATO- Russia Permanent Joint Council, the strategic culture of Russia has not changed in any fundamental sense. Russian strategic culture has not evolved in ways that would make Russian policies compatible with those of NATO countries in the necessary economic, social, technological, and military spheres. On the domestic side, Russia has yet to establish a stable democracy and the necessary legal, judicial, and regulatory institutions for a free-market economy. Russia evidently lacks the necessary cultural traditions, including concepts of accountability and transparency, to make these adaptations in the short-term. Owing in part to its institutional shortcomings, severe socioeconomic setbacks have afflicted Russia. Russian conventional military strength has been weakened, and a concomitant reliance by the Russians on nuclear weapons as their ultimate line of defense has increased. The breakdown in the infrastructure that supports Russian early warning and surveillance systems and nuclear weapons stewardship defense, coupled with a tendency towards has exacerbated Russian anxiety and distrust toward NATO. Russia`s reliance on nuclear weapons as the ultimate line of defense, coupled with a tendency toward suspicion and distrust toward NATO, could lead to dangerous strategic miscalculation and nuclear catastrophe.

  18. The Chemical Weapons Convention -- Legal issues

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-08-01

    The Chemical Weapons Convention (CWC) offers a unique challenge to the US system of constitutional law. Its promise of eliminating what is the most purely genocidal type of weapon from the world`s arsenals as well as of destroying the facilities for producing these weapons, brings with it a set of novel legal issues. The reservations about the CWC expressed by US business people are rooted in concern about safeguarding confidential business information and protecting the constitutional right to privacy. The chief worry is that international verification inspectors will misuse their power to enter commercial property and that trade secrets or other private information will be compromised as a result. It has been charged that the Convention is probably unconstitutional. The author categorically disagrees with that view and is aware of no scholarly writing that supports it. The purpose of this presentation is to show that CWC verification activities can be implemented in the US consistently with the traditional constitutional regard for commercial and individual privacy. First, he very briefly reviews the types of verification inspections that the CWC permits, as well as some of its specific privacy protections. Second, he explains how the Fourth Amendment right to privacy works in the context of CWC verification inspections. Finally, he reviews how verification inspections can be integrated into these constitutional requirements in the SU through a federal implementing statute.

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

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

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

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

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

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

  5. D-DRR:一种可动态改变带宽的分组调度算法%Dynamic Deficit Round Robin Scheduling Algorithm

    Institute of Scientific and Technical Information of China (English)

    孙力娟; 吴斌; 张登银

    2004-01-01

    在分组网络设备中,采用适当的调度算法是为网络上运行的业务提供服务质量(QoS:quality of service)的关键.在差额循环(DRR:deficit round robin)调度算法的基础上提出了一种动态差额循环(D-DRR:dynamic deficit round robin)调度算法,该算法通过实时跟踪特定服务队列长度来调整量子值,以改变预约带宽,从而满足一些特定的实时业务类型的QoS.

  6. 与开工时间有关的加工时间的超前有奖迟后受罚的排序问题的动态规划算法%A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time

    Institute of Scientific and Technical Information of China (English)

    余英; 孙世杰; 何龙敏

    2008-01-01

    In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.

  7. Measures to implement the Chemical Weapons Convention

    Energy Technology Data Exchange (ETDEWEB)

    Tanzman, E.; Kellman, B.

    1999-11-05

    This seminar is another excellent opportunity for those involved in preventing chemical weapons production and use to learn from each other about how the Chemical Weapons Convention (CWC) can become a foundation of arms control in Africa and around the world. The author is grateful to the staff of the Organization for the Prohibition of Chemical Weapons (OPCW) for inviting him to address this distinguished seminar. The views expressed in this paper are those of the authors alone, and do not represent the position of the government of the US nor or of any other institution. In 1993, as the process of CWC ratification was beginning, concerns arose that the complexity of integrating the treaty with national law would cause each nation to implement the Convention without regard to what other nations were doing, thereby causing inconsistencies among States Parties in how the Convention would be carried out. As a result the Manual for National Implementation of the Chemical Weapons Convention was prepared and presented it to each national delegation at the December 1993 meeting of the Preparatory Commission in The Hague. During its preparation, the Manual was reviewed by the Committee of Legal Experts on National Implementation of the Chemical Weapons Convention, a group of distinguished international jurists, law professors, legally-trained diplomats, government officials, and Parliamentarians from every region of the world, including Mica. In February 1998, the second edition of the Manual was published in order to update it in light of developments since the CWC entered into force on 29 April 1997. The second edition 1998 clarified the national implementation options to reflect post-entry-into-force thinking, added extensive references to national implementing measures that had been enacted by various States Parties, and included a prototype national implementing statute developed by the authors to provide a starting point for those whose national implementing

  8. Measures to implement the Chemical Weapons Convention

    Energy Technology Data Exchange (ETDEWEB)

    Tanzman, E.; Kellman, B.

    1999-11-05

    This seminar is another excellent opportunity for those involved in preventing chemical weapons production and use to learn from each other about how the Chemical Weapons Convention (CWC) can become a foundation of arms control in Africa and around the world. The author is grateful to the staff of the Organization for the Prohibition of Chemical Weapons (OPCW) for inviting him to address this distinguished seminar. The views expressed in this paper are those of the authors alone, and do not represent the position of the government of the US nor or of any other institution. In 1993, as the process of CWC ratification was beginning, concerns arose that the complexity of integrating the treaty with national law would cause each nation to implement the Convention without regard to what other nations were doing, thereby causing inconsistencies among States Parties in how the Convention would be carried out. As a result the Manual for National Implementation of the Chemical Weapons Convention was prepared and presented it to each national delegation at the December 1993 meeting of the Preparatory Commission in The Hague. During its preparation, the Manual was reviewed by the Committee of Legal Experts on National Implementation of the Chemical Weapons Convention, a group of distinguished international jurists, law professors, legally-trained diplomats, government officials, and Parliamentarians from every region of the world, including Mica. In February 1998, the second edition of the Manual was published in order to update it in light of developments since the CWC entered into force on 29 April 1997. The second edition 1998 clarified the national implementation options to reflect post-entry-into-force thinking, added extensive references to national implementing measures that had been enacted by various States Parties, and included a prototype national implementing statute developed by the authors to provide a starting point for those whose national implementing

  9. Realistic Scheduling Mechanism for Smart Homes

    Directory of Open Access Journals (Sweden)

    Danish Mahmood

    2016-03-01

    Full Text Available In this work, we propose a Realistic Scheduling Mechanism (RSM to reduce user frustration and enhance appliance utility by classifying appliances with respective constraints and their time of use effectively. Algorithms are proposed regarding functioning of home appliances. A 24 hour time slot is divided into four logical sub-time slots, each composed of 360 min or 6 h. In these sub-time slots, only desired appliances (with respect to appliance classification are scheduled to raise appliance utility, restricting power consumption by a dynamically modelled power usage limiter that does not only take the electricity consumer into account but also the electricity supplier. Once appliance, time and power usage limiter modelling is done, we use a nature-inspired heuristic algorithm, Binary Particle Swarm Optimization (BPSO, optimally to form schedules with given constraints representing each sub-time slot. These schedules tend to achieve an equilibrium amongst appliance utility and cost effectiveness. For validation of the proposed RSM, we provide a comparative analysis amongst unscheduled electrical load usage, scheduled directly by BPSO and RSM, reflecting user comfort, which is based upon cost effectiveness and appliance utility.

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

  11. Coordinated Dynamic Spectrum Allocation Mechanism Design Based on Combined Priority Scheduling%基于联合优先级调度的协作动态频谱分配机制设计

    Institute of Scientific and Technical Information of China (English)

    王凡; 姚富强; 赵杭生; 冯少栋; 张建照

    2011-01-01

    在协作频谱接入过程中,共享频谱各网络中的频谱需求呈现高度动态性,现有机制难以兼顾分组传输时延和服务公平性.针对这一问题,提出一种基于联合优先级调度的协作动态频谱分配机制.将频谱分配问题建模为比例公平模型并联合网络的服务等级和用频请求的到达时间为各网络设定动态服务优先级,解得分配结果后,基于分配频谱的中心频率与需求频谱的中心频率最近的原则将频谱资源分配给各网络.仿真结果表明,与已有的基于网络固定优先级调度、基于网络动态优先级调度和基于用频请求动态优先级调度的协作频谱分配机制相比,本机制能够更好地保证网络获取频谱的公平性,并且在分组传输时延性能上有所改进.%In coordinated spectrum access.when the networks sharing the same spectrum have highly varying spectrum requirement,existing mechanisms cannot provide better performance of end-to-end time delay and fairness. To tackle this problem, a coordinated dynamic spectrum allocation mechanism based on combined priority scheduling was proposed. The mechanism models the spectrum allocation as proportional fairness and set dynamic priority to networks by combining the service grade of networks and the arrival time of spectrum requirement. After figuring out the results of the proportional fairness model,the mechanism allocates spectrum according to the results based on the criterion that the center frequency of allocated spectrum is close to the spectrum requirement The simulation results show that the proposed mechanism can provide better fairness of spectrum allocation than existing mechanisms as network(or terminal) static priority, network (or terminal) dynamic priority and request dynamic priority based coordinated dynamic spectrum allocation,and also brings improvement in terms of performance of end-to-end time delay of packet transmission.

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

  13. Systems engineering analysis of kinetic energy weapon concepts

    Energy Technology Data Exchange (ETDEWEB)

    Senglaub, M.

    1996-06-01

    This study examines, from a systems engineering design perspective, the potential of kinetic energy weapons being used in the role of a conventional strategic weapon. Within the Department of Energy (DOE) complex, strategic weapon experience falls predominantly in the nuclear weapons arena. The techniques developed over the years may not be the most suitable methodologies for use in a new design/development arena. For this reason a more fundamental approach was pursued with the objective of developing an information base from which design decisions might be made concerning the conventional strategic weapon system concepts. The study examined (1) a number of generic missions, (2) the effects of a number of damage mechanisms from a physics perspective, (3) measures of effectiveness (MOE`s), and (4) a design envelope for kinetic energy weapon concepts. With the base of information a cut at developing a set of high-level system requirements was made, and a number of concepts were assessed against these requirements.

  14. Systems engineering analysis of kinetic energy weapon concepts

    Energy Technology Data Exchange (ETDEWEB)

    Senglaub, M.

    1996-06-01

    This study examines, from a systems engineering design perspective, the potential of kinetic energy weapons being used in the role of a conventional strategic weapon. Within the Department of Energy (DOE) complex, strategic weapon experience falls predominantly in the nuclear weapons arena. The techniques developed over the years may not be the most suitable methodologies for use in a new design/development arena. For this reason a more fundamental approach was pursued with the objective of developing an information base from which design decisions might be made concerning the conventional strategic weapon system concepts. The study examined (1) a number of generic missions, (2) the effects of a number of damage mechanisms from a physics perspective, (3) measures of effectiveness (MOE`s), and (4) a design envelope for kinetic energy weapon concepts. With the base of information a cut at developing a set of high-level system requirements was made, and a number of concepts were assessed against these requirements.

  15. 76 FR 70317 - Continuation of the National Emergency With Respect to Weapons of Mass Destruction

    Science.gov (United States)

    2011-11-10

    ... With Respect to Weapons of Mass Destruction #0; #0; #0; Presidential Documents #0; #0; #0;#0;Federal... Weapons of Mass Destruction On November 14, 1994, by Executive Order 12938, the President declared a... weapons (weapons of mass destruction) and the means of delivering such weapons. On July 28, 1998, the...

  16. 采用梯级水电站动态弃水策略的多目标短期优化调度%Short Term Multi-objective Optimization Scheduling With Dynamic Water Spillage Strategy for Cascade Hydroelectric Plants

    Institute of Scientific and Technical Information of China (English)

    吴杰康; 郭壮志; 丁国强

    2011-01-01

    弃水是影响梯级水电站经济运行的一个重要因素,针对静态弃水策略的不足,在协调条件的基础上,建立了梯级水电站的动态弃水模型,以此为基础建立调度期内发电量最大、年调节或季调节水库末蓄水量最大、日调节水库末蓄水量偏差平方和最小、总耗水量最小及末级水电站弃水量最小的多目标短期优化调度模型.针对仿电磁学算法原理(electro-magnetism-like mechanism,ELM)简单及收敛迅速的特点,采用嵌入数据包络分析(data envelopment analysis,DEA)的混合仿电磁学算法对多目标优化调度模型进行求解,该算法避免了传统权重系数法的盲目性.对一个8级梯级水电站系统进行仿真分析,结果表明所提出的动态弃水策略可以有效地提高梯级水电站的发电效益,同时也验证了混合仿电磁学算法在求解多目标优化问题时的有效性.%One of the key factors of affecting hydroelectric plant economic operation is water spillage. A novel dynamic water spillage model was presented based on the coordination condition in view of the insufficiency of the static water spillage strategy. A novel multi-objective scheduling model for maximizing the total power generation in all schedule time,maximizing the final water storage for yearly or quarterly regulating reservoir, minimizing the sum of bias squares of final water storage for daily regulating reservoir, minimizing the total water consumption and minimizing the total water spillage of the last hydroelectric plant was proposed based on the dynamic water spillage strategy to realize the optimal trade-off between water volume for generation and power generation. A hybrid global optimization method which can overcome the shortcoming of weighted method was proposed for solving multi-objective optimization problem efficiently by embedding data envelopment analysis (DEA) into electromagnetism-like mechanism (ELM). Simulations for a test system with

  17. 中长期发电计划的值函数近似动态规划方法%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框架下的阶段决策.分阶段决策降低了问题的求解规模和难度,提出的燃煤和水库蓄水的值函数近似策略解决了如何优化决策以保持阶段分解后的整体优化特性问题.通过在决策与近似值函数之间的迭代,求解出近似最优决策序列,进而获取发电优化调度方案.某省年度发电计划的计算分析结果表明,所提方法建模

  18. Small sample Bayesian analyses in assessment of weapon performance

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Abundant test data are required in assessment of weapon performance.When weapon test data are insufficient,Bayesian analyses in small sample circumstance should be considered and the test data should be provided by simulations.The several Bayesian approaches are discussed and some limitations are founded.An improvement is put forward after limitations of Bayesian approaches available are analyzed and t he improved approach is applied to assessment of some new weapon performance.

  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. Strategies for denaturing the weapons-grade plutonium stockpile

    Energy Technology Data Exchange (ETDEWEB)

    Buckner, M.R.; Parks, P.B.

    1992-10-01

    In the next few years, approximately 50 metric tons of weapons-grade plutonium and 150 metric tons of highly-enriched uranium (HEU) may be removed from nuclear weapons in the US and declared excess. These materials represent a significant energy resource that could substantially contribute to our national energy requirements. HEU can be used as fuel in naval reactors, or diluted with depleted uranium for use as fuel in commercial reactors. This paper proposes to use the weapons-grade plutonium as fuel in light water reactors. The first such reactor would demonstrate the dual objectives of producing electrical power and denaturing the plutonium to prevent use in nuclear weapons.

  1. DOE Nuclear Weapon Reliability Definition: History, Description, and Implementation

    Energy Technology Data Exchange (ETDEWEB)

    Wright, D.L.; Cashen, J.J.; Sjulin, J.M.; Bierbaum, R.L.; Kerschen, T.J.

    1999-04-01

    The overarching goal of the Department of Energy (DOE) nuclear weapon reliability assessment process is to provide a quantitative metric that reflects the ability of the weapons to perform their intended function successfully. This white paper is intended to provide insight into the current and long-standing DOE definition of nuclear weapon reliability, which can be summarized as: The probability of achieving the specified yield, at the target, across the Stockpile-To-Target Sequence of environments, throughout the weapon's lifetime, assuming proper inputs.

  2. Granular analyzing of weapon SoS demand description

    Institute of Scientific and Technical Information of China (English)

    Zhao Qingsong; Yang Kewei; Chen Yingwu; Li Mengjun

    2009-01-01

    The systematism of weapon combat is the typical characteristic of a modern battlefield. The process of combat is complex and the demand description of weapon system of systems (SOS) is difficult. Granular analyzing is an important method for solving the complex problem in the world. Granular thinking is introduced into the demand description of weapon SoS. Granular computing and granular combination based on a relation of compatibility is proposed. Based on the level of degree and degree of detail, the granular resolution of weapon SoS is defined and an example is illustrated at the end.

  3. 基于 OPN ET 动态调度时隙分配数据链研究及仿真%Dynamic Scheduling Slot Allocation of Data Link Research and Simulation Based on O PNET

    Institute of Scientific and Technical Information of China (English)

    熊诗成; 周安栋; 杨路刚

    2014-01-01

    The tactical data link is a digital communications technology in the military aspects of a typical application , time division multiple access technology is the core technology inside the data link .Tactical data link network for traditional slot allocation algorithms is unable to adapt to changing battlefield environment ,the slot serious waste of resources ,and oth-er issues can not be dynamically allocated .A priority-based scheduling policy dynamic slot allocation algorithm is proposed , using OPNET simulation platform designed and implemented based on this algorithm naval maritime communications simula-tion system ,the application system carries out a detailed network planning ,network performance and system simulation a-nalysis and comparison .%战术数据链是数字通信技术在军事方面的典型应用,时分多址接入技术是数据链里面的核心技术。针对战术数据链网络中传统时隙分配算法无法适应战场多变环境,时隙资源浪费严重,无法动态分配等问题,提出一种基于优先级调度策略的动态时隙分配算法,利用OPNET仿真平台设计实现基于此算法的舰艇海上通信仿真系统,对应用系统进行了详细网络规划,并对系统网络性能进行仿真分析和比较。

  4. 对抗高超声速武器的机载激光武器发展研究%Research on the Development of Airborne Laser Weapons Against Hypersonic Weapons

    Institute of Scientific and Technical Information of China (English)

    张同鑫; 李权

    2016-01-01

    The military threat of hypersonic weapon to current air defense system, and the potential military value of airborne laser weapon confronted to the hypersonic weapon were illustrated. Detailed introduction was made on the technical barriers of airborne laser weapon and the state of the art research progress. It is emphasized that now to research airborne laser weapon, its weight and size must be decreased, beam control system and aiming and tracking system in dynamic environments must be researched, special aerodynamic layout must be designed and smart energy sources management must be established.%介绍了高超声速武器对现有军事防御系统的威胁,机载激光武器对抗高超声速武器的军事价值。详细描述了国外机载激光武器的研究进展以及研究机载激光武器的技术难点,指出当前研究机载激光武器必须进一步降低激光武器的重量和体积,研发动态环境的光束控制与瞄准跟踪系统,开展特殊气动布局设计研究,建立周密的能源管理系统。

  5. On program restructuring, scheduling, and communication for parallel processor systems

    Energy Technology Data Exchange (ETDEWEB)

    Polychronopoulos, Constantine D.

    1986-08-01

    This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems. The issues covered are program restructuring, partitioning, scheduling and interprocessor communication, synchronization, and hardware design issues of specialized units. All this work was performed focusing on a single goal: to maximize program speedup, or equivalently, to minimize parallel execution time. Parafrase, a Fortran restructuring compiler was used to transform programs in a parallel form and conduct experiments. Two new program restructuring techniques are presented, loop coalescing and subscript blocking. Compile-time and run-time scheduling schemes are covered extensively. Depending on the program construct, these algorithms generate optimal or near-optimal schedules. For the case of arbitrarily nested hybrid loops, two optimal scheduling algorithms for dynamic and static scheduling are presented. Simulation results are given for a new dynamic scheduling algorithm. The performance of this algorithm is compared to that of self-scheduling. Techniques for program partitioning and minimization of interprocessor communication for idealized program models and for real Fortran programs are also discussed. The close relationship between scheduling, interprocessor communication, and synchronization becomes apparent at several points in this work. Finally, the impact of various types of overhead on program speedup and experimental results are presented. 69 refs., 74 figs., 14 tabs.

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

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

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

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

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

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

  13. Lifetime Assessments of Weapon Organics and Polymers FY05 Annual Report

    Energy Technology Data Exchange (ETDEWEB)

    Chinn, S; Maxwell, R; Sawvel, A; Madabhushi, R; Dinh, L; Solyom, D; Cohenour, R

    2006-11-01

    Non-nuclear organics, while not yet regarded to be at risk, figure in a large percentage of Significant Findings Investigations. Further, early application of advanced lifetime, compatibility, and base-lining assessments for LEP replacement materials and emerging materials for the Reliable Replacement Warhead (RRW) provides data for rational material choices. This task is currently assessing the chemical and mechanical characteristics of a variety of weapon organics prioritized by the risk-consequence of material aging. The majority of effort to date has been dedicated to silicone elastomer components known to lose their load resistance with age, with additional effort dedicated to urethane adhesives. This fiscal year, we have focused on initial aging studies of UNI620-3, a candidate replacement material for DC745U, and Adiprene (LW520). Aging studies of S5455, originally scheduled for testing in FY05, were postponed until FY07. We have initiated aging studies on these materials by employing accelerated aging tests with exposure to Co-60 {gamma}-radiation and elevated temperatures and studying their mechanical properties using a variety of analytical tools including nuclear magnetic resonance (NMR), dynamic mechanical analysis (DMA), and differential scanning calorimetry (DSC). Additionally, we have investigated aging signatures present in parts returned from surveillance as well as initiated long and short term stress relaxation studies for a thorough understanding of compression set occurring in silicone elastomers components. Additional investigations of aging processes in fluoropolymer binders and the combined effects of radiation and tensile set on silicone pads were performed. Finally, we have used temperature programmed desorption (TPD) studies to significantly improve the accuracy of our H{sub 2}O outgassing model in comparison with last year through the use of the isoconversion technique as well as to measure the equilibrium vapor pressure of hydrogenated

  14. Cardiac fibrillation risk of Taser weapons.

    Science.gov (United States)

    Leitgeb, Norbert

    2014-06-01

    The debate on potential health hazards associated with delivering electric discharges to incapacitated subjects, in particular on whether electric discharge weapons are lethal, less lethal or non-lethal, is still controversial. The cardiac fibrillation risks of Taser weapons X26 and X3 have been investigated by measuring the delivered high-tension pulses in dependence on load impedance. Excitation thresholds and sinus-to-Taser conversion factors have been determined by numerical modeling of endocardial, myocardial, and epicardial cells. Detailed quantitative assessment of cardiac electric exposure has been performed by numerical simulation at the normal-weighted anatomical model NORMAN. The impact of anatomical variation has been quantified at an overweight model (Visible Man), both with a spatial resolution of 2 × 2 × 2 mm voxels. Spacing and location of dart electrodes were systematically varied and the worst-case position determined. Based on volume-weighted cardiac exposure assessment, the fibrillation probability of the worst-case hit was determined to 30% (Taser X26) and 9% (Taser X3). The overall risk assessment of Taser application accounting for realistic spatial hit distributions was derived from training sessions of police officers under realistic scenarios and by accounting for the influence of body (over-)weight as well as gender. The analysis of the results showed that the overall fibrillation risk of Taser use is not negligible. It is higher at Taser X26 than at Taser X3 and amounts to about 1% for Europeans with an about 20% higher risk for Asians. Results demonstrate that enhancement as well as further reduction of fibrillation risk depends on responsible use or abuse of Taser weapons.

  15. Rolling optimization algorithm based on collision window for single machine scheduling problem

    Institute of Scientific and Technical Information of China (English)

    Wang Changjun; Xi Yugeng

    2005-01-01

    Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm is proposed based on the analysis of the character and structure of scheduling. An optimal scheduling strategy in collision window is presented. Performance evaluation of this algorithm is given. Simulation indicates that the proposed algorithm is better than other common heuristic algorithms on both the total performance and stability.

  16. The Regulation of the Possession of Weapons at Gatherings

    Directory of Open Access Journals (Sweden)

    Pieter du Toit

    2013-12-01

    Full Text Available The Dangerous Weapons Act 15 of 2013 provides for certain prohibitions and restrictions in respect of the possession of a dangerous weapon and it repeals the Dangerous Weapons Act 71 of 1968 as well as the different Dangerous Weapons Acts in operation in the erstwhile TBVC States. The Act also amends the Regulation of Gatherings Act 205 of 1993 to prohibit the possession of any dangerous weapon at a gathering or demonstration. The Dangerous Weapons Act provides for a uniform system of law governing the use of dangerous weapons for the whole of South Africa and it furthermore no longer places the onus on the individual charged with the offence of the possession of a dangerous weapon to show that he or she did not have any intention of using the firearm for an unlawful purpose. The Act also defines the meaning of a dangerous weapon. According to our court’s interpretation of the Dangerous Weapons Act 71 of 1968 a dangerous weapon was regarded as an object used or intended to be used as a weapon even if it had not been designed for use as a weapon. The Act, however, requires the object to be capable of causing death or inflicting serious bodily harm if it were used for an unlawful purpose. The possession of a dangerous weapon, in circumstances which may raise a reasonable suspicion that the person intends to use it for an unlawful purpose, attracts criminal liability. The Act also provides a useful set of guidelines to assist courts to determine if a person charged with the offence of the possession of a dangerous weapon had indeed intended to use the weapon for an unlawful purpose. It seems, however, that the Act prohibits the possession of a dangerous weapon at gatherings, even if the person carrying the weapon does not intend to use it for an unlawful purpose. The state will, however, have to prove that the accused had the necessary control over the object and the intention to exercise such control, as well as that the object is capable of

  17. Scheduling and Outsourcing with Multiple Customers

    Institute of Scientific and Technical Information of China (English)

    FENG Yan-ling; ZHANG Yu-zhong; JIA Guo-zhu

    2015-01-01

    In this paper, we study a new scheduling and outsourcing model with multiple customers in which jobs can be processed by either in-house machine or outsourcing machine. All processed jobs have to be delivered in batches to their respective customers and each shipment incurs a delivery cost as well as a fixed amount of time. We discuss three commonly used ob jective functions, analyze their complexity and solve them by dynamic programming algorithms.

  18. Postulated accident scenarios in weapons disassembly

    Energy Technology Data Exchange (ETDEWEB)

    Payne, S.S. [Dept. of Energy, Albuquerque, NM (United States)

    1997-06-01

    A very brief summary of three postulated accident scenarios for weapons disassembly is provided in the paper. The first deals with a tetrahedral configuration of four generic pits; the second, an infinite planar array of generic pits with varying interstitial water density; and the third, a spherical shell with internal mass suspension in water varying the size and mass of the shell. Calculations were performed using the Monte Carlo Neutron Photon transport code MCNP4A. Preliminary calculations pointed to a need for higher resolution of small pit separation regimes and snapshots of hydrodynamic processes of water/plutonium mixtures.

  19. Stinging plants: as future bio-weapon.

    Science.gov (United States)

    Gupta, Sanjay Mohan; Kumar, Kamal

    2016-09-01

    In the present opinion paper, we have been introducing for the first time the stinging plants and/or their biological toxins as novel bio-threat agents that may be used for the development of bio-weapons for self-defence purpose. The selected studied stinging plants are having dual role as nutraceutical and ethno-pharmacological uses apart from their less explored stinging property. However, future detailed work is required for identification and characterization of the precise stinging chemical components that will be used for the formulation of novel bio-warfare agents for self-defence purpose.

  20. Millimeter Wave Radar Applications to Weapons Systems

    Science.gov (United States)

    1976-06-01

    ocity, and azimuth and elevation arRles ; assignment of target to L weapon for engagement; and assessment of the damage by the indication of cessa- tion...paper. 29 D.E. Gray, American institute of Physics Handbook ," McGraw-Hill, New S~York, 1957. --. . - - . .A • -•• =_ . . . . •,,- - - The complex...B-13) is the target-to-clutter power ratio. I. 41I 7 Handbook of Mathematical Functions, U.S. Department of Commerce, National Bureau of Standards

  1. Environmental Detection of Clandestine Nuclear Weapon Programs

    Science.gov (United States)

    Kemp, R. Scott

    2016-06-01

    Environmental sensing of nuclear activities has the potential to detect nuclear weapon programs at early stages, deter nuclear proliferation, and help verify nuclear accords. However, no robust system of detection has been deployed to date. This can be variously attributed to high costs, technical limitations in detector technology, simple countermeasures, and uncertainty about the magnitude or behavior of potential signals. In this article, current capabilities and promising opportunities are reviewed. Systematic research in a variety of areas could improve prospects for detecting covert nuclear programs, although the potential for countermeasures suggests long-term verification of nuclear agreements will need to rely on methods other than environmental sensing.

  2. DOE battery program for weapon applications

    Science.gov (United States)

    Clark, R. P.; Baldwin, A. R.

    This report discusses the Department of Energy (DOE) Weapons Battery program which originates from Sandia National Laboratories (SNL) and involves activities ranging from research, design and development to testing, consulting, and production support. The primary customer is the DOE/Office of Defense Programs, although work is also done for various Department of Defense agencies and their contractors. The majority of the SNL activities involve thermal battery (TB) and lithium ambient temperature battery (LAMB)technologies. Smaller efforts are underway in the areas of silver oxide/zinc and nickel oxide/cadmium batteries as well as double layer capacitors.

  3. Recoil Considerations for Shoulder-Fired Weapons

    Science.gov (United States)

    2012-05-01

    2012) Steyr 15.2 mm 35 g 1450 m/s 39.6 lb 11.4 Burns (2012) Type 97 (Japanese) 20 mm 162 g 790 m/s 130 lb 28.7 Burns (2012) 12HB00 ( Remington ...shotgun 0.727 in 807 gr (12 × 00) 1225 ft/s 7.0 lb 4.37 Remington (2011) Remington Express 12B0 shotgun 0.727 in 580 gr (12 × 0) 1275 ft/s...7.0 lb 3.28 Remington 5 Table 3. Recoil-related characteristics of selected shoulder-fired weapons cited in table 1. Nomenclature

  4. [Botulinum toxin as a biological weapon].

    Science.gov (United States)

    Rossow, Heidi; Kinnunen, Paula M; Nikkari, Simo

    2012-01-01

    Botulism is caused by botulinum neurotoxin produced by the bacterium Clostridium botulinum. It is a flaccid paralysis in which consciousness and nociception are preserved. Natural botulism typically results from ingestion of inadequately heated or unheated vacuum-packed foods. In addition, botulinum toxin is one of the most feared biological weapons. In the diagnosis and treatment of botulism early suspicion is essential. Several coinciding or local clusters without a typical connecting source, or an uncommon type of toxin may indicate an intentionally caused epidemic.

  5. 76 FR 6199 - Enhanced Weapons, Firearms Background Checks, and Security Event Notifications

    Science.gov (United States)

    2011-02-03

    ... Regulatory Commission 10 CFR Part 73 Enhanced Weapons, Firearms Background Checks, and Security Event... Enhanced Weapons, Firearms Background Checks, and Security Event Notifications AGENCY: Nuclear Regulatory... revisions in these implementing regulations that address the voluntary application for enhanced weapons and...

  6. 77 FR 59891 - Proposed Information Collection; Comment Request; Chemical Weapons Convention Declaration and...

    Science.gov (United States)

    2012-10-01

    ... Bureau of Industry and Security Proposed Information Collection; Comment Request; Chemical Weapons...@bis.doc.gov . SUPPLEMENTARY INFORMATION: ] I. Abstract The Chemical Weapons Convention Implementation Act of 1998 and Commerce Chemical Weapons Convention Regulations (CWCR) specify the rights...

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

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

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

  10. A Scheduling Algorithm Based on Petri Nets and Simulated Annealing

    Directory of Open Access Journals (Sweden)

    Rachida H. Ghoul

    2007-01-01

    Full Text Available This study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static and dynamic behavior of the HFMS and design scheduling solutions. Hierarchical Petri nets model was regarded as being made up a set of single timed colored Petri nets models. Each single model represents one process which was composed of many operations and tasks. The complex scheduling problem was decomposed in simple sub-problems. Scheduling algorithm was applied on each sub model in order to resolve conflicts on shared production resources.

  11. 基于Petri网的原油处理生产作业计划油罐动态分配分析%Dynamic tank assignment analysis for short-term scheduling of crude oil operations by using Petri net model

    Institute of Scientific and Technical Information of China (English)

    王炜; 伍乃骐; 李林伟

    2011-01-01

    石化炼油企业采用递阶方法进行调度,以使短期调度方法在生产运作中切实可行.在上层,企业根据市场需求产生一个目标炼油计划.在下层,企业得到一个详细调度以实现目标炼油计划.在这个过程中,如何动态分配油罐将起到至关重要的作用,同时也是生产运作中的难题,为了解决这个难题,建立Petri网模型描述原油处理生产过程的行为特征.基于该模型,分析了油罐分配对目标炼油计划可实现性的影响,鉴别出那些使系统进入不可行状态的操作,并对其进行调整,这样,通过避免这样的不可行操作而提出一种实现目标炼油计划的油罐动态分配方法,最后,用一个工业实例验证了提出的方法的应用.%To make a short-term scheduling method practical, it can be done in a hierarchical way. At the upper level, a target refining schedule is created according to market demands. Then, at the lower level, a detailed schedule is to realize the target refining schedule. To make the target refining schedule realized, the key is how to dynamically assign the tanks in the plant. To solve the realizability problem of target refining schedule, a Petri net model is developed to describe the behaviors of the system. Based on this model, how tank assignment affects the realizability of a target refining schedule is analyzed and operations that leed to an infeasible state are identified and adjusted. Thus, a dynamic tank assignment method is proposed to realize a target refining schedule by avoiding such operations. A practical industrial case problem is used to show the application of the proposed method.

  12. The Relationship between Social Capital and Weapon Possession on Campus

    Science.gov (United States)

    Messer, Rachel H.; Bradley, Kristopher I.; Calvi, Jessica L.; Kennison, Shelia M.

    2012-01-01

    The present research focused on the problem of how college officials might be able to predict weapon possession on college campuses. We hypothesized that measures of social capital (i.e., trust and participation in society) may be useful in identifying individuals who are likely to possess weapons on campuses. Prior research has shown that those…

  13. Victimization and Health Risk Factors among Weapon-Carrying Youth

    Science.gov (United States)

    Stayton, Catherine; McVeigh, Katharine H.; Olson, E. Carolyn; Perkins, Krystal; Kerker, Bonnie D.

    2011-01-01

    Objective: To compare health risks of 2 subgroups of weapon carriers: victimized and nonvictimized youth. Methods: 2003-2007 NYC Youth Risk Behavior Surveys were analyzed using bivariate analyses and multinomial logistic regression. Results: Among NYC teens, 7.5% reported weapon carrying without victimization; 6.9% reported it with victimization.…

  14. Rethinking the Development of Weapons and Their Impact

    Science.gov (United States)

    Katsioloudis, Petros J.; Jones, Mildred V.

    2011-01-01

    As one reads about the history of humans, he/she sees very early on that humans are naturally "tool users." More specifically, humans used tools as a means of subsistence and survival. Even today humans use tools to extend their capabilities beyond imagination. These tools are even used as weapons. However primitive, these early weapons would soon…

  15. 32 CFR 552.116 - Privately owned weapons-security.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 3 2010-07-01 2010-07-01 true Privately owned weapons-security. 552.116 Section..., Ammunition, and Explosives-Fort Lewis, Washington § 552.116 Privately owned weapons—security. Privately owned arms and ammunition will be secured in the manner required for military weapons and ammunition but...

  16. Monoclonal Antibodies to Prevent Use of Mycotoxins as Biological Weapons

    Science.gov (United States)

    2007-07-01

    Mycotoxins as Biological Weapons PRINCIPAL INVESTIGATOR: Marta Feldmesser, M.D. CONTRACTING ORGANIZATION: Albert Einstein College of...Monoclonal Antibodies to Prevent Use of Mycotoxins as Biological Weapons 5b. GRANT NUMBER W81XWH-06-1-0085 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR

  17. Adapting the Law of Armed Conflict to Autonomous Weapon Systems

    Science.gov (United States)

    2014-01-01

    remains in the realm of theory . Still, several modern highly- automated—and some would call them autonomous—weapon systems already exist. These are...CROSS, 483, 507 (2012). 58. Backstrom & Henderson, supra note 57, at 401. 59. Justin McClelland , The Review of Weapons in Accordance with Article 36

  18. Civilian preparedness and counter-terrorism: conventional weapons.

    Science.gov (United States)

    Lucci, Edward B

    2006-06-01

    Most terrorist attacks involve conventional weapons. These explosive devices produce injury patterns that are sometimes predict-able. The chaos produced from these weapons can be greatly reduced with prior planning, response practice, and realization by the entire medical community of the need to participate in preparation for these devastating events.

  19. Willingness to pay for defense against weapons of mass destruction.

    Science.gov (United States)

    Mulvaney, J M; LaBarre, D; Pastel, R; Landauer, M

    2001-12-01

    A survey assessed the willingness to pay for defense against weapons of mass destruction. The results were evaluated according to the benefit to society. The results indicated preferences for increased spending on intelligence gathering, training, and equipment. We concluded that the United States is spending less for weapons of mass destruction defense than the sample population was willing to pay.

  20. Rethinking the Development of Weapons and Their Impact

    Science.gov (United States)

    Katsioloudis, Petros J.; Jones, Mildred V.

    2011-01-01

    As one reads about the history of humans, he/she sees very early on that humans are naturally "tool users." More specifically, humans used tools as a means of subsistence and survival. Even today humans use tools to extend their capabilities beyond imagination. These tools are even used as weapons. However primitive, these early weapons would soon…

  1. HFE (Human Factors Engineering) Technology for Navy Weapon System Acquisition.

    Science.gov (United States)

    1979-07-01

    uncovering of improved propulsion systems, sensors , weapons, etc., by industry or governr-ient agencies, may in.tiate the development of a new weapon system...needs. (No. A-109) _L a f. Tailor an acquisition stratagy for each program, as soon as the agency decides to solict alternative system design concepto

  2. Fuzzy Networked Control Systems Design Considering Scheduling Restrictions

    Directory of Open Access Journals (Sweden)

    H. Benítez-Pérez

    2012-01-01

    known a priory but from a dynamic real-time behavior. To do so, the use of priority dynamic Priority exchange scheduling is performed. The objective of this paper is to show a way to tackle multiple time delays that are bounded and the dynamic response from real-time scheduling approximation. The related control law is designed considering fuzzy logic approximation for nonlinear time delays coupling, where the main advantage is the integration of this behavior through extended state space representation keeping certain linear and bounded behavior and leading to a stable situation during events presentation by guaranteeing stability through Lyapunov.

  3. The LSST Scheduler from design to construction

    Science.gov (United States)

    Delgado, Francisco; Reuter, Michael A.

    2016-07-01

    The Large Synoptic Survey Telescope (LSST) will be a highly robotic facility, demanding a very high efficiency during its operation. To achieve this, the LSST Scheduler has been envisioned as an autonomous software component of the Observatory Control System (OCS), that selects the sequence of targets in real time. The Scheduler will drive the survey using optimization of a dynamic cost function of more than 200 parameters. Multiple science programs produce thousands of candidate targets for each observation, and multiple telemetry measurements are received to evaluate the external and the internal conditions of the observatory. The design of the LSST Scheduler started early in the project supported by Model Based Systems Engineering, detailed prototyping and scientific validation of the survey capabilities required. In order to build such a critical component, an agile development path in incremental releases is presented, integrated to the development plan of the Operations Simulator (OpSim) to allow constant testing, integration and validation in a simulated OCS environment. The final product is a Scheduler that is also capable of running 2000 times faster than real time in simulation mode for survey studies and scientific validation during commissioning and operations.

  4. Effect of speedup delay on shuttle bus schedule

    Science.gov (United States)

    Nagatani, Takashi

    2016-10-01

    We study the bus schedule in the shuttle bus transportation system controlled by speedup. The bus schedule is closely related to the dynamic motion of the bus. The motion of a shuttle bus depends on the inflow rate of passengers and the delayed speedup control. The delayed speedup control has an important effect on the dynamic motion of the bus. We present the delayed map model for the dynamics of the shuttle bus with the delayed speedup control. The bus motion changes from a stable state, through a periodic state, to a quasi-periodic state by the delayed speedup control. The return map of the tour time displays a smooth closed curve and the bus motion is quasi-periodic. The dynamic transition to the quasi-periodic motion changes greatly with the delay time. We clarify the effect of the delayed speedup control on the bus schedule.

  5. Low-Energy Real-Time OS Using Voltage Scheduling Algorithm for Variable Voltage Processors

    OpenAIRE

    Okuma, Takanori; Yasuura, Hiroto

    2001-01-01

    This paper presents a real-time OS based on $ mu $ITRON using proposed voltage scheduling algorithm for variable voltage processors which can vary supply voltage dynamically. The proposed voltage scheduling algorithms assign voltage level for each task dynamically in order to minimize energy consumption under timing constraints. Using the presented real-time OS, running tasks with low supply voltage leads to drastic energy reduction. In addition, the presented voltage scheduling algorithm is ...

  6. Weapons Retrieved After the Implementation of Emergency Department Metal Detection.

    Science.gov (United States)

    Malka, S Terez; Chisholm, Robin; Doehring, Marla; Chisholm, Carey

    2015-09-01

    Several high-profile violent incidents have occurred within emergency departments (EDs). There are no recent studies reporting the effectiveness of ED metal detection. Our aim was to assess the effect of metal detection on ED weapons retrieval. In September 2011, a metal detector was installed at the entrance of an urban, high-volume teaching hospital ED. The security company recorded retrieved firearms, knives, chemical sprays, and other weapons. We performed qualitative analysis of weapons retrieval data for a 26-month period. A total of 5877 weapons were retrieved, an average of 218 per month: 268 firearms, 4842 knives, 512 chemical sprays, and 275 other weapons, such as brass knuckles, stun guns, and box cutters. The number of retrieved guns decreased from 2012 to 2013 (from 182 to 47), despite an increase in metal detection hours from 8 h per day to 16 h per day. The number of retrieved knives, chemical sprays, and other weapons increased. Recovered knives increased from 2062 in 2012 to 2222 in 2013, chemical sprays increased from 170 to 305, and other weapons increased from 51 to 201. A large number of weapons were retrieved after the initiation of metal detection in the ED entrance. Increasing hours of metal detection increased the number of retrieved knives, chemical sprays, and other weapons. Retrieved firearms decreased after increasing metal detection hours. Metal detection in the ED entrance is effective in reducing entrance of weapons into the ED. Metal detectors may offer additional benefit in reducing attempts to enter with firearms. Copyright © 2015 Elsevier Inc. All rights reserved.

  7. Integrated and Dynamic Vehicle and Crew Scheduling

    NARCIS (Netherlands)

    D. Huisman (Dennis)

    2004-01-01

    textabstractDue to increased competition in the public transport market and the pressure on governments to cut expenses, increasing attention has been paid to cost reductions in public transportation. Since the main resources used in public transportation are vehicles and crews, producing efficient

  8. Dynamic Scheduling for Web Monitoring Crawler

    Science.gov (United States)

    2009-02-27

    Badminton , Baseball, Basketball, Boxing, Canoeing, Cycling, Equestrian, Fencing, Gymnastics, Handball, Hocky, Judo, Morden Pentathlon, Rowing, Sailing...efficiency significantly. 4 Personnel Supported Dr. Claire DeEstate Research Assistant, School of Computing and Information Systems, University of...Tasmania Yang Sok Kim Ph.D Student, School of Computing, University of Tasmania 5 Publications Journal Kim, Y. S., Kang, B.H. (2007). "Tracking

  9. Low Power Dynamic Scheduling for Computing Systems

    CERN Document Server

    Neely, Michael J

    2011-01-01

    This paper considers energy-aware control for a computing system with two states: "active" and "idle." In the active state, the controller chooses to perform a single task using one of multiple task processing modes. The controller then saves energy by choosing an amount of time for the system to be idle. These decisions affect processing time, energy expenditure, and an abstract attribute vector that can be used to model other criteria of interest (such as processing quality or distortion). The goal is to optimize time average system performance. Applications of this model include a smart phone that makes energy-efficient computation and transmission decisions, a computer that processes tasks subject to rate, quality, and power constraints, and a smart grid energy manager that allocates resources in reaction to a time varying energy price. The solution methodology of this paper uses the theory of optimization for renewal systems developed in our previous work. This paper is written in tutorial form and devel...

  10. Distinguishing among weapons offenders, drug offenders, and weapons and drug offenders based on childhood predictors and adolescent correlates.

    Science.gov (United States)

    Stephens, Skye; Day, David M

    2013-07-01

    Weapons and drug offences incur a large cost to society and tend to be strongly associated. Improved understanding of their antecedents could inform targeted early intervention and prevention programmes. This study aimed to examine differences in criminal careers, childhood predictors and adolescent correlates among weapons-only offenders, drugs-only offenders and a versatile group of weapons + drugs offenders. We conducted a longitudinal records study of 455 young Canadians charged with drug and/or weapons offences who started their offending in late childhood/early adolescence. Consistent with expectation, differences emerged in their criminal careers as the versatile group had a longer criminal career and desisted from offending at a later age than weapons-only offenders. Against prediction, weapons-only offenders experienced the greatest number of childhood predictors and adolescent correlates. The three offending groups could be differentiated on offending trajectories and developmental factors.In making links between past events and later behaviour, life-course criminology may inform development of effective early intervention and prevention strategies.As weapons-only offenders experience the greatest level of adversity in childhood and adolescence, they may benefit most (of these three groups) from early intervention and prevention programmes.A reduction in weapon carrying and use might be achieved by early identification of children risk factors (e.g. family adversity) and appropriate intervention. Copyright © 2013 John Wiley & Sons, Ltd.

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

  12. Integrating Process Planning and Scheduling with an Intelligent Facilitator

    Institute of Scientific and Technical Information of China (English)

    WANG; Jiao; ZHANG; Y; F; NEE; A; Y; C

    2002-01-01

    This paper introduces a dynamic facilitating mechan is m for the integration of process planning and scheduling in a batch-manufacturi ng environment. This integration is essential for the optimum use of production resources and generation of realistic process plans that can be readily executed with little or no modification. In this paper, integration is modeled in two le vels, viz., process planning and scheduling, which are linked by an intelligent facilitator. The process planning module employs an o...

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

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

  15. Evaluation of alternatives for the disposition of surplus weapons-usable plutonium

    Energy Technology Data Exchange (ETDEWEB)

    Dyer, J.S.; Butler, J.C. [Univ. of Texas, Austin, TX (United States); Edmunds, T. [Lawrence Livermore National Lab., CA (United States)] [and others

    1997-04-04

    The Department of Energy Record of Decision (ROD) selected alternatives for disposition of surplus, weapons grade plutonium. A major objective of this decision was to prevent the proliferation of nuclear weapons. Other concerns addressed included economic, technical, institutional, schedule, environmental, and health and safety issues. The analysis reported here was conducted in parallel with technical, environmental, and nonproliferation analyses; it uses multiattribute utility theory to combine these considerations in order to facilitate an integrated evaluation of alternatives. This analysis is intended to provide additional insight regarding alternative evaluation and to assist in understanding the rationale for the choice of alternatives recommended in the ROD. Value functions were developed for objectives of disposition, and used to rank alternatives. Sensitivity analyses indicated that the ranking of alternatives for the base case was relatively insensitive to changes in assumptions over reasonable ranges. The analyses support the recommendation of the ROD to pursue parallel development of the vitrification immobilization alternative and the use of existing light water reactors alternative. 27 refs., 109 figs., 20 tabs.

  16. Steps towards universality of the Chemical Weapons Convention: How can Africa contribute?

    Energy Technology Data Exchange (ETDEWEB)

    Tanzman, E.

    1999-11-02

    Universality is a fundamental principal of the Chemical Weapons Convention (CWC). It suffuses the fabric of the Convention, found not only in the very first ringing clauses of Article I, but also in the many technical details of its Annexes and Schedules. Consequently, universality is a topic on which commentary is appropriate from all quarters. The author offers his personal views as a lawyer on this important matter in the hope that, this distinguished audience may gain a perspective not available from practitioners of other professions. The views expressed in this paper are those of the author alone, and do not represent the position of the government of the US or of any other institution.

  17. Petri net-based scheduling of time constrained single-arm cluster tools with wafer revisiting

    Directory of Open Access Journals (Sweden)

    ZiCheng Liu

    2016-05-01

    Full Text Available It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. This article conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition process. With a so-called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, the existence of a feasible schedule is analyzed, schedulability conditions are derived, and scheduling algorithms are presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time if schedulable, and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.

  18. Proportionality, just war theory and weapons innovation.

    Science.gov (United States)

    Forge, John

    2009-03-01

    Just wars are supposed to be proportional responses to aggression: the costs of war must not greatly exceed the benefits. This proportionality principle raises a corresponding 'interpretation problem': what are the costs and benefits of war, how are they to be determined, and a 'measurement problem': how are costs and benefits to be balanced? And it raises a problem about scope: how far into the future do the states of affairs to be measured stretch? It is argued here that weapons innovation always introduces costs, and that these costs cannot be determined in advance of going to war. Three examples, the atomic bomb, the AK-47 and the ancient Greek catapult, are given as examples. It is therefore argued that the proportionality principle is inapplicable prospectively. Some replies to the argument are discussed and rejected. Some more general defences of the proportionality principle are considered and also rejected. Finally, the significance of the argument for Just War Theory as a whole is discussed.

  19. Nuclear weapons issues in South Asia

    Energy Technology Data Exchange (ETDEWEB)

    Joeck, N.

    1993-07-02

    This report discusses how the US can play a productive mediating role in South Asia by engaging India and Pakistan in an international forum to manage nuclear weapons, as Edward Teller advocated. India and Pakistan have developed their nuclear capabilities because they fear their neighbors, not because they want to threaten fear their neighbors, not because they want to threaten the US. The appropriate response for the US, therefore, is diplomatic engagement and negotiations. In addition to the international approach, encouragement and facilitation of regional and bilateral interactions will also be important. Formal arms control agreements have been reached, but less formal confidence-building measures, and unilateral security pledges may well be combined to form a more secure strategic environment in South Asia than a nuclear armed confrontation across the porous South Asian border.

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