WorldWideScience

Sample records for refining coordinated scheduling

  1. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

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

  2. Coordinating, Scheduling, Processing and Analyzing IYA09

    Science.gov (United States)

    Gipson, John; Behrend, Dirk; Gordon, David; Himwich, Ed; MacMillan, Dan; Titus, Mike; Corey, Brian

    2010-01-01

    The IVS scheduled a special astrometric VLBI session for the International Year of Astronomy 2009 (IYA09) commemorating 400 years of optical astronomy and 40 years of VLBI. The IYA09 session is the most ambitious geodetic session to date in terms of network size, number of sources, and number of observations. We describe the process of designing, coordinating, scheduling, pre-session station checkout, correlating, and analyzing this session.

  3. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  4. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  5. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

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

  6. Refinery production planning and scheduling: the refining core business

    Directory of Open Access Journals (Sweden)

    M. Joly

    2012-06-01

    Full Text Available Intelligent production planning and scheduling are of paramount importance to ensure refinery profitability, logistic reliability and safety at the local and corporate levels. In Brazil, such activities play a particularly critical role, since the Brazilian downstream model is moving towards a demand-driven model rather than a supply-driven one. Moreover, new and specialized non-linear constraints are continuously being incorporated into these large-scale problems: increases in oil prices implying the need for processing poor quality crudes, increasing demand and new demand patterns for petroleum products, new stringent environmental regulations related to clean fuels and start-up of new production technologies embedded into more complex refining schemes. This paper aims at clarifying the central role of refinery planning and scheduling activities in the Petrobras refining business. Major past and present results are outlined and corporate long-term strategies to deal with present and future challenges are presented.

  7. The Coordinated Scheduling Support System of Production and Delivery

    Directory of Open Access Journals (Sweden)

    Ming-Feng Yang

    2009-01-01

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

  8. Refining developmental coordination disorder subtyping with multivariate statistical methods

    Directory of Open Access Journals (Sweden)

    Lalanne Christophe

    2012-07-01

    Full Text Available Abstract Background With a large number of potentially relevant clinical indicators penalization and ensemble learning methods are thought to provide better predictive performance than usual linear predictors. However, little is known about how they perform in clinical studies where few cases are available. We used Random Forests and Partial Least Squares Discriminant Analysis to select the most salient impairments in Developmental Coordination Disorder (DCD and assess patients similarity. Methods We considered a wide-range testing battery for various neuropsychological and visuo-motor impairments which aimed at characterizing subtypes of DCD in a sample of 63 children. Classifiers were optimized on a training sample, and they were used subsequently to rank the 49 items according to a permuted measure of variable importance. In addition, subtyping consistency was assessed with cluster analysis on the training sample. Clustering fitness and predictive accuracy were evaluated on the validation sample. Results Both classifiers yielded a relevant subset of items impairments that altogether accounted for a sharp discrimination between three DCD subtypes: ideomotor, visual-spatial and constructional, and mixt dyspraxia. The main impairments that were found to characterize the three subtypes were: digital perception, imitations of gestures, digital praxia, lego blocks, visual spatial structuration, visual motor integration, coordination between upper and lower limbs. Classification accuracy was above 90% for all classifiers, and clustering fitness was found to be satisfactory. Conclusions Random Forests and Partial Least Squares Discriminant Analysis are useful tools to extract salient features from a large pool of correlated binary predictors, but also provide a way to assess individuals proximities in a reduced factor space. Less than 15 neuro-visual, neuro-psychomotor and neuro-psychological tests might be required to provide a sensitive and

  9. Separation Assurance and Scheduling Coordination in the Arrival Environment

    Science.gov (United States)

    Aweiss, Arwa S.; Cone, Andrew C.; Holladay, Joshua J.; Munoz, Epifanio; Lewis, Timothy A.

    2016-01-01

    Separation assurance (SA) automation has been proposed as either a ground-based or airborne paradigm. The arrival environment is complex because aircraft are being sequenced and spaced to the arrival fix. This paper examines the effect of the allocation of the SA and scheduling functions on the performance of the system. Two coordination configurations between an SA and an arrival management system are tested using both ground and airborne implementations. All configurations have a conflict detection and resolution (CD&R) system and either an integrated or separated scheduler. Performance metrics are presented for the ground and airborne systems based on arrival traffic headed to Dallas/ Fort Worth International airport. The total delay, time-spacing conformance, and schedule conformance are used to measure efficiency. The goal of the analysis is to use the metrics to identify performance differences between the configurations that are based on different function allocations. A surveillance range limitation of 100 nmi and a time delay for sharing updated trajectory intent of 30 seconds were implemented for the airborne system. Overall, these results indicate that the surveillance range and the sharing of trajectories and aircraft schedules are important factors in determining the efficiency of an airborne arrival management system. These parameters are not relevant to the ground-based system as modeled for this study because it has instantaneous access to all aircraft trajectories and intent. Creating a schedule external to the CD&R and the scheduling conformance system was seen to reduce total delays for the airborne system, and had a minor effect on the ground-based system. The effect of an external scheduler on other metrics was mixed.

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

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

  12. Improving Dense Network Performance through Centralized Scheduling and Interference Coordination

    DEFF Research Database (Denmark)

    Lopez, Victor Fernandez; Pedersen, Klaus I.; Alvarez, Beatriz Soret

    2017-01-01

    . Interference management at the receiver is achieved through the use of a Network-Assisted Interference Cancellation and Suppression (NAICS) receiver. In order to further boost the 5th percentile user data rates, the transmission rank at the interferers is selectively reduced by a centralized rank coordination......Dense network deployments comprising small cells pose a series of important challenges when it comes to achieving an efficient resource use and curbing inter-cell interference in the downlink. This article examines different techniques to treat these problems in a dynamic way, from the network...... and the receiver sides. As a network coordination scheme, we apply a centralized joint cell association and scheduling mechanism based on dynamic cell switching, by which users are not always served by the strongest perceived cell. The method simultaneously resultsin more balanced loads and increased performance...

  13. Schedule refinement for homogeneous multi-core processors in the presence of manufacturing-caused heterogeneity

    Institute of Scientific and Technical Information of China (English)

    Zhi-xiang CHEN; Zhao-lin LI; Shan CAO; Fang WANG; Jie ZHOU

    2015-01-01

    Multi-core homogeneous processors have been widely used to deal with computation-intensive embed-ded applications. However, with the continuous down scaling of CMOS technology, within-die variations in the manufacturing process lead to a significant spread in the operating speeds of cores within homogeneous multi-core processors. Task scheduling approaches, which do not consider such heterogeneity caused by within-die variations, can lead to an overly pessimistic result in terms of performance. To realize an optimal performance according to the actual maximum clock frequencies at which cores can run, we present a heterogeneity-aware schedule refining (HASR) scheme by fully exploiting the heterogeneities of homogeneous multi-core processors in embedded domains. We analyze and show how the actual maximum frequencies of cores are used to guide the scheduling. In the scheme, representative chip operating points are selected and the corresponding optimal schedules are generated as candidate schedules. During the booting of each chip, according to the actual maximum clock frequencies of cores, one of the candidate schedules is bound to the chip to maximize the performance. A set of applications are designed to evaluate the proposed scheme. Experimental results show that the proposed scheme can improve the performance by an average value of 22.2%, compared with the baseline schedule based on the worst case timing analysis. Compared with the conventional task scheduling approach based on the actual maximum clock frequencies, the proposed scheme also improves the performance by up to 12%.

  14. Stochastic versus Deterministic Approach to Coordinated Supply Chain Scheduling

    Directory of Open Access Journals (Sweden)

    Tadeusz Sawik

    2017-01-01

    Full Text Available The purpose of this paper is to consider coordinated selection of supply portfolio and scheduling of production and distribution in supply chains under regional and local disruption risks. Unlike many papers that assume the all-or-nothing supply disruption pattern, in this paper, only the regional disruptions belong to the all-or-nothing disruption category, while for the local disruptions all disruption levels can be considered. Two biobjective decision-making models, stochastic, based on the wait-and-see approach, and deterministic, based on the expected value approach, are proposed and compared to optimize the trade-off between expected cost and expected service. The main findings indicate that the stochastic programming wait-and-see approach with its ability to handle uncertainty by probabilistic scenarios of disruption events and the much simpler expected value problem, in which the random parameters are replaced by their expected values, lead to similar expected performance of a supply chain under multilevel disruptions. However, the stochastic approach, which accounts for all potential disruption scenarios, leads to a more diversified supply portfolio that will hedge against a variety of scenarios.

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

    Directory of Open Access Journals (Sweden)

    Yao Ruojun

    2015-01-01

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

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

  17. MAS based coordinated scheduling of storage capacities in a virtual microgrid

    DEFF Research Database (Denmark)

    Brehm, Robert; Top, Søren; Mátéfi-Tempfli, Stefan

    A distributed decentralized multi-agent system (MAS) for coordinated scheduling of charge and discharge intervals for storage capacities in a utility grid integrated microgrid is presented. As basis for the MAS based energy management system (EMS) serves a scheduling algorithm based on a distribu......A distributed decentralized multi-agent system (MAS) for coordinated scheduling of charge and discharge intervals for storage capacities in a utility grid integrated microgrid is presented. As basis for the MAS based energy management system (EMS) serves a scheduling algorithm based...... on a distributed optimization algorithm to minimize power flow from/to a virtual microgrid over a transformer substation. A cooperative low-level MAS scheme, which is based on the consensus algorithm is introduced. It is shown that using a cooperative MAS, load profile flattening (peak-shaving) for the utility...... be used, for example by a Distribution System Operator (DSO) to control grid load profiles of virtual microgrids....

  18. Coordination between Generation and Transmission Maintenance Scheduling by Means of Multi-agent Technique

    Science.gov (United States)

    Nagata, Takeshi; Tao, Yasuhiro; Utatani, Masahiro; Sasaki, Hiroshi; Fujita, Hideki

    This paper proposes a multi-agent approach to maintenance scheduling in restructured power systems. The restructuring of electric power industry has resulted in market-based approaches for unbundling a multitude of service provided by self-interested entities such as power generating companies (GENCOs), transmission providers (TRANSCOs) and distribution companies (DISCOs). The Independent System Operator (ISO) is responsible for the security of the system operation. The schedule submitted to ISO by GENCOs and TRANSCOs should satisfy security and reliability constraints. The proposed method consists of several GENCO Agents (GAGs), TARNSCO Agents (TAGs) and a ISO Agent(IAG). The IAG’s role in maintenance scheduling is limited to ensuring that the submitted schedules do not cause transmission congestion or endanger the system reliability. From the simulation results, it can be seen the proposed multi-agent approach could coordinate between generation and transmission maintenance schedules.

  19. FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION:THE CONTROL OF COMPLEXITY AND UNCERTAINTY

    Institute of Scientific and Technical Information of China (English)

    Peter B. LUH; Weidong FENG

    2003-01-01

    With time-based competition and rapid technology advancements, effective manufacturing scheduling and supply chain coordination are critical to quickly respond to changing market conditions. These problems, however, are difficult in view of inherent complexity and various uncertainties involved. Based on a series of results by the authors, decomposition and coordination by using Lagrangian relaxation is identified in this paper as an effective way to control complexity and uncertainty. A manufacturing scheduling problem is first formulated within the job shop context with uncertain order arrivals, processing times, due dates, and part priorities as a separable optimization problem. A solution methodology that combines Lagrangian relaxation, stochastic dynamic programming, and heuristics is developed. Method improvements to effectively solve large problems are also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomic members across chains of suppliers, a decentralized supply chain model is established in the second half of this paper. By relaxing cross-member constraints, the model is decomposed into member-wise subproblems, and a nested optimization structure is developed based on the job shop scheduling results. Coordination is performed through the iterative updating of cross-member prices without accessing other members' private information or intruding their decision-making authorities, either with or without a coordinator. Two examples are presented to demonstrate the effectiveness of the method. Future prospects to overcome problem inseparability and improve computing efficiency are then discussed.

  20. Coordinated scheduling of electricity and natural gas infrastructures with a transient model for natural gas flow.

    Science.gov (United States)

    Liu, Cong; Shahidehpour, Mohammad; Wang, Jianhui

    2011-06-01

    This paper focuses on transient characteristics of natural gas flow in the coordinated scheduling of security-constrained electricity and natural gas infrastructures. The paper takes into account the slow transient process in the natural gas transmission systems. Considering their transient characteristics, natural gas transmission systems are modeled as a set of partial differential equations (PDEs) and algebraic equations. An implicit finite difference method is applied to approximate PDEs by difference equations. The coordinated scheduling of electricity and natural gas systems is described as a bi-level programming formulation from the independent system operator's viewpoint. The objective of the upper-level problem is to minimize the operating cost of electric power systems while the natural gas scheduling optimization problem is nested within the lower-level problem. Numerical examples are presented to verify the effectiveness of the proposed solution and to compare the solutions for steady-state and transient models of natural gas transmission systems.

  1. Comparison of Ferrite Refinement Mechanisms by Different Processing Schedules in 08 and 20Mn Steels

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The influence of deforming temperature on ferrite refinement was analyzed by comparing the microstructures obtained by deformation at above Ar3, in two-phase region of (+) and at below A1 in clean 08 and 20Mn steels. The results indicate that ferrite refinement through strain induced transformation by deformation at above Ar3 is more effe ctive than that by deformation simply through ferrite dynamic recrysta llization. The main problem of ferrite refinement by deformation at be low Ar3 is the inhomogeneity of microstructure which is controlled by the orientations and sizes of ferrite grains and the distribution of s econd phases. Ferrite dynamic recrystallization after strain induced t ransformation can further effectively refine ferrite.

  2. Coordinated node scheduling for energy-conserving in large wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    SHI Gao-tao; LIAO Ming-hong; XU Wen-xu

    2008-01-01

    Aiming at developing a node scheduling protocol for sensor networks with fewer active nodes, we pro-pose a coordinated node scheduling protocol based on the presentation of a solution and its optimization to deter-mine whether a node is redundant. The proposed protocol can reduce the number of working nodes by turning off as many redundant nodes as possible without degrading the coverage and connectivity. The simulation result shows that our protocol outperforms the peer with respect to the working node number and dynamic coverage percentage.

  3. Coordinated scheduling for the downlink of cloud radio-access networks

    KAUST Repository

    Douik, Ahmed S.

    2015-09-11

    This paper addresses the coordinated scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of scheduling users to PZs and BSs in a coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments. © 2015 IEEE.

  4. Coordinated Scheduling and Power Control in Cloud-Radio Access Networks

    KAUST Repository

    Douik, Ahmed

    2015-12-01

    This paper addresses the joint coordinated scheduling and power control problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy, power control, and synchronization of the transmit frames across the single-antenna base-stations (BS). The transmit frame consists of several time/frequency blocks, called power-zones (PZ). The paper considers the problem of scheduling users to PZs and determining their power levels (PL), by maximizing the weighted sum-rate under the practical constraints that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the joint scheduling and power control graph formed by several clusters, where each is formed by a set of vertices, representing the possible association of users, BSs, and PLs for one specific PZ. The problem is, then, formulated as a maximumweight clique problem, in which the weight of each vertex is the sum of the benefits of the individual associations belonging to that vertex. Simulation results suggest that the proposed crosslayer scheme provides appreciable performance improvement as compared to schemes from recent literature.

  5. Hybrid Scheduling/Signal-Level Coordination in the Downlink of Multi-Cloud Radio-Access Networks

    KAUST Repository

    Douik, Ahmed

    2016-03-28

    In the context of resource allocation in cloud- radio access networks, recent studies assume either signal-level or scheduling-level coordination. This paper, instead, considers a hybrid level of coordination for the scheduling problem in the downlink of a multi-cloud radio- access network, so as to benefit from both scheduling policies. Consider a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and therefore allows joint signal processing between them. Across the multiple clouds, however, only scheduling-level coordination is permitted, as it requires a lower level of backhaul communication. The frame structure of every BS is composed of various time/frequency blocks, called power- zones (PZs), and kept at fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled, at most, to a single cloud, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs\\' frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The scheduling problem is, then, shown to be equivalent to a maximum- weight independent set problem in the constructed graph, in which each vertex symbolizes an association of cloud, user, BS and PZ, with a weight representing the utility of that association. Simulation results suggest that the proposed hybrid scheduling strategy provides appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

  6. Multi Objective Optimization of Coordinated Scheduling of Cranes and Vehicles at Container Terminals

    Directory of Open Access Journals (Sweden)

    Seyed Mahdi Homayouni

    2013-01-01

    Full Text Available According to previous researches, automated guided vehicles and quay cranes in container terminals have a high potential synergy. In this paper, a mixed integer programming model is formulated to optimize the coordinated scheduling of cranes and vehicles in container terminals. Objectives of the model are to minimize total traveling time of the vehicles and delays in tasks of cranes. A genetic algorithm is developed to solve the problem in reasonable computational time. The most appropriate control parameters for the proposed genetic algorithm are investigated in a medium size numerical test case. It is shown that balanced crossover and mutation rates have the best performance in finding a near optimal solution for the problem. Then, ten small size test cases are solved to evaluate the performance of the proposed optimization methods. The results show the applicability of the genetic algorithm since it can find near optimal solutions, precisely and accurately.

  7. Low-Complexity Scheduling and Power Adaptation for Coordinated Cloud-Radio Access Networks

    KAUST Repository

    Douik, Ahmed

    2017-07-17

    In practical wireless systems, the successful implementation of resource allocation techniques strongly depends on the algorithmic complexity. Consider a cloud-radio access network (CRAN), where the central cloud is responsible for scheduling devices to the frames’ radio resources blocks (RRBs) of the single-antenna base-stations (BSs), adjusting the transmit power levels, and for synchronizing the transmit frames across the connected BSs. Previous studies show that the jointly coordinated scheduling and power control problem in the considered CRAN can be solved using an approach that scales exponentially with the number of BSs, devices, and RRBs, which makes the practical implementation infeasible for reasonably sized networks. This paper instead proposes a low-complexity solution to the problem, under the constraints that each device cannot be served by more than one BS but can be served by multiple RRBs within each BS frame, and under the practical assumption that the channel is constant during the duration of each frame. The paper utilizes graph-theoretical based techniques and shows that constructing a single power control graph is sufficient to obtain the optimal solution with a complexity that is independent of the number of RRBs. Simulation results reveal the optimality of the proposed solution for slow-varying channels, and show that the solution performs near-optimal for highly correlated channels.

  8. Molecular structure refinement by direct fitting of atomic coordinates to experimental ESR spectra

    CERN Document Server

    Charnock, G T P; Kuprov, Ilya

    2011-01-01

    An attempt is made to bypass spectral analysis and fit internal coordinates of radicals directly to experimental liquid- and solid-state electron spin resonance (ESR) spectra. We take advantage of the recently introduced large-scale spin dynamics simulation algorithms and of the fact that the accuracy of quantum mechanical calculations of ESR parameters has improved to the point of quantitative correctness. Partial solutions are offered to the local minimum problem in spectral fitting and to the problem of spin interaction parameters (hyperfine couplings, chemical shifts, etc.) being very sensitive to distortions in molecular geometry.

  9. Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

    Institute of Scientific and Technical Information of China (English)

    Xiao-Lin Li; Jian-Nong Cao

    2008-01-01

    To minimize the execution time of a sensing task over a multi-hop hierarchical sensor network, we present acoordinated scheduling method following the divisible load scheduling paradigm. The proposed scheduling strategy builds on eliminating transmission collisions and idle gaps between two successive data transmissions. We consider a sensor network consisting of several clusters. In a cluster, after related raw data measured by source nodes are collected at the fusion node,in-network data aggregation is further considered. The scheduling strategies consist of two phases: intra-cluster scheduling and inter-cluster scheduling. Intra-cluster scheduling deals with assigning different fractions of a sensing workload among source nodes in each cluster; inter-cluster scheduling involves the distribution of fused data among all fusion nodes. Closed-form solutions to the problem of task scheduling are derived. Finally, numerical examples are presented to demonstrate the impacts of different system parameters such as the number of sensor nodes, measurement, communication, and processing speed, on the finish time and energy consumption.

  10. Integrated Feedback Scheduling and Control Codesign for Motion Coordination of Networked Induction Motor Systems

    Directory of Open Access Journals (Sweden)

    Dezong Zhao

    2014-01-01

    of multiple induction motors through a shared communication network. An integrated feedback scheduling algorithm is designed to allocate the optimal sampling period and priority to each control loop to optimize the global performance of a networked control system (NCS, while satisfying the constraints of stability and schedulability. A speed synchronization method is incorporated into the scheduling algorithm to improve the speed synchronization performance of multiple induction motors. The rational gain of the network speed controllers is calculated using the Lyapunov theorem and tuned online by fuzzy logic to guarantee the robustness against complicated variations on the communication network. Furthermore, a state predictor is designed to compensate the time delay which occurred in data transmission from the sensor to the controller, as a part of the networked controller. Simulation results support the effectiveness of the proposed control-and-scheduling codesign approach.

  11. Multi-flow scheduling for coordinated direct and relayed users in cellular systems

    DEFF Research Database (Denmark)

    Thai, Chan; Popovski, Petar; Kaneko, Megumi

    2013-01-01

    domain and they need to be assigned a communication resource simultaneously. In this paper we define a novel framework that can be used to analyze MFT schemes and assess the system-level gains. The framework is based on cellular wireless users with two-way traffic and it sets the basis for devising...... composite time-multiplexed MFT schemes, tailored to particular optimization criteria. Those criteria can be formulated by adapting well-known schedulers in order to incorporate MFT schemes. The results show rate advantages brought by the CDR schemes in pertinent scenarios. Another key contribution...

  12. Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint

    Directory of Open Access Journals (Sweden)

    Hua Gong

    2014-01-01

    Full Text Available This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further processing. One vehicle can load only one order in one shipment. Each order arriving at the facility must be processed in the limited waiting time. The orders are processed in batches on a parallel-batch machine, where a batch contains several orders and the processing time of the batch is the largest processing time of the orders in it. The goal is to find a schedule to minimize the sum of the total flow time and the production cost. We prove that the general problem is NP-hard in the strong sense. We also demonstrate that the problem with equal processing times on the machine is NP-hard. Furthermore, a dynamic programming algorithm in pseudopolynomial time is provided to prove its ordinarily NP-hardness. An optimal algorithm in polynomial time is presented to solve a special case with equal processing times and equal transportation times for each order.

  13. Coordinated preventive maintenance scheduling of GENCO and TRANSCO in restructured power systems

    Energy Technology Data Exchange (ETDEWEB)

    Geetha, T.; Swarup, K. Shanti [Department of Electrical Engineering, Indian Institute of Technology, Madras, Chennai 600036 (India)

    2009-11-15

    Preventive maintenance of generating units and lines, in a competitive electric energy environment is proposed. Inclusion of transmission constraints and forced outage rates, over a specified operational period is considered. For generator maintenance the objective of the ISO is to maintain adequate level of reliability throughout the operational period, for which Bender's decomposition technique is used. The objective of the GENCO is to maximize profit or to minimize loss in profit, for which transmission constrained price based unit commitment (TCPBUC), based on Lagrangian relaxation method is used. Bender's decomposition technique is used for line maintenance, with adequate level of reliability. A coordinating technique using penalty factors is incorporated to obtain convergence of the conflicting objectives. The transmission constraints are modeled using dc sensitivity factors. Detailed case studies of six-bus systems and IEEE RTS system are presented and discussed. (author)

  14. Service refinement

    Institute of Scientific and Technical Information of China (English)

    HE JiFeng

    2008-01-01

    This paper presents a refinement calculus for service components. We model the behaviour of individual service by a guarded design, which enables one to separate the responsibility of clients from the commitment made by the system, and to iden-tify a component by a set of failures and divergences. Protocols are introduced to coordinate the interactions between a component with the external environment. We adopt the notion of process refinement to formalize the substitutivity of components, and provide a complete proof method based on the notion of simulations.

  15. The Sharing Experimental Animal Resources, Coordinating Holdings (SEARCH) Framework: Encouraging Reduction, Replacement, and Refinement in Animal Research

    Science.gov (United States)

    Morrissey, Bethny; Blyth, Karen; Carter, Phil; Chelala, Claude; Jones, Louise; Holen, Ingunn; Speirs, Valerie

    2017-01-01

    While significant medical breakthroughs have been achieved through using animal models, our experience shows that often there is surplus material remaining that is frequently never revisited but could be put to good use by other scientists. Recognising that most scientists are willing to share this material on a collaborative basis, it makes economic, ethical, and academic sense to explore the option to utilise this precious resource before generating new/additional animal models and associated samples. To bring together those requiring animal tissue and those holding this type of archival material, we have devised a framework called Sharing Experimental Animal Resources, Coordinating Holdings (SEARCH) with the aim of making remaining material derived from animal studies in biomedical research more visible and accessible to the scientific community. We encourage journals, funding bodies, and scientists to unite in promoting a new way of approaching animal research by adopting the SEARCH framework. PMID:28081116

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

    Institute of Scientific and Technical Information of China (English)

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

    2015-01-01

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

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

  18. Refining the multisystem view of the stress response: coordination among cortisol, alpha-amylase, and subjective stress in response to relationship conflict.

    Science.gov (United States)

    Laurent, Heidemarie K; Powers, Sally I; Granger, Douglas A

    2013-07-01

    This study investigated associations among young adults' hypothalamic-pituitary-adrenal axis activity, autonomic nervous system activity, and subjective stress in response to interpersonal conflict to better characterize coordination across stress systems. Seven saliva samples were collected from 199 young adult opposite-sex couples before, during, and after they discussed an unresolved relationship conflict. Samples were later assayed for cortisol and alpha-amylase (sAA). Couples rated anticipatory stress prior to the conflict and perceived stress immediately following the task. Growth curve modeling was used to examine two possible levels of within-person coordination across physiological systems: alignment between cortisol and sAA responses throughout the sampling period ("matched phase coordination"), and association between overall levels of cortisol and sAA in response to conflict ("average level coordination"). Whereas both partners showed the former type of coordination, only women showed the latter type. Positive anticipation of the stressor predicted stronger cortisol-sAA matched phase coordination for women. Pre-task ratings related to women's sAA, and post-task ratings related to both partners' cortisol responses. Implications for a multisystem interpretation of normal and pathological responses to daily stress are discussed.

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

    Institute of Scientific and Technical Information of China (English)

    张宏远; 席裕庚; 谷寒雨

    2005-01-01

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

  20. 基于免疫算法的水火电联合调度模型%Hydrothermal coordination scheduling model based on immune algorithm

    Institute of Scientific and Technical Information of China (English)

    周德建; 杨莉; 郭文明

    2013-01-01

    由于梯级水电站的一系列电站间水能联系紧密,本文提出一种以集合形式处理梯级水电站的机组组合免疫算法.算法利用了免疫算法的记忆调节机制和便于处理离散变量的优势,将存在水能联系的梯级水电站机组看作一个集合进行统一编码,精简了含有梯级水电站的水火电联合调度机组组合的有效寻优空间,提高了求解效率.此外,由于免疫算法的特点是高变异率,本文考虑了电力系统中峰荷、腰荷、基荷的概念,提出变异率根据机组类型设定,以提高寻优的效率.最后以一个修正的IEEE 118系统算例验证了本文算法的有效性和合理性.%A set theory is proposed for encoding hydro-units of cascade reservoirs according to their close hydraulic connections. Such encoding technique can make use of the memory adjustment mechanism of immune algorithm to simplify discrete variables booking. Through unified encoding of all the related hydro-units, the optimization region of hydro-thermal coordination scheduling that involves cascade reservoirs, is greatly reduced and hence the efficiency of solution is enhanced. This paper also puts forth a method of varying the mutation rates according to generator types and considers peak load, middle load and base load, so as to achieve a high efficiency of optimization under the high mutation rate of immune algorithm. A modified IEEE 118-bus system is given to demonstrate the effectiveness of the proposed scheduling approach.

  1. Metroplex Coordinated Runway Scheduling Project

    Data.gov (United States)

    National Aeronautics and Space Administration — NASA's System Oriented Runway Management (SORM) project is studying operational concepts and algorithms to improve the efficiency and capacity of metroplex...

  2. Coordinating Production and Transportation of Jobs to Solve Single Machine Scheduling Problems%考虑加工与运输协同调度的单机排序问题

    Institute of Scientific and Technical Information of China (English)

    胡觉亮; 李红芳; 董建明; 蒋义伟

    2013-01-01

    在考虑加工与运输协同调度的单机排序问题中,每个工件尺寸不同,工件在一台机器加工后,由m辆有容量限制的运输工具运送到同一个顾客处,目标是极小化最后一个送到其顾客的工件的到达时间,本文给出了该问题的一个最优算法,并且证明了该算法的最坏情况界为3/2.%Supply chain management has been one of the most important and widely discussed topics in the production and operation field over the last decade. Generally speaking, a supply chain includes all the interactions among suppliers, manufactures, distributors, and customers. Due to market globalization, coordination among different stages in the supply chain to optimize overall system performance has become more practical and received attention from both industry professionals and academic researchers. In particular, the linkage between job scheduling and delivery of finished jobs is extremely important. Job scheduling and delivery of finished jobs are two critical steps in supply chain management, and they play important roles in the supply chain. The coordination between job scheduling and delivery of finished goods can improve customer service level, reduces operational cost, and optimize the whole system. In this paper, we consider a two-stage supply chain scheduling problem in which the first stage is job scheduling and the second stage is job delivery. Jobs are delivered in batches by a vehicle. The key problem is to coordinate scheduling and transportation of jobs with the objective of minimizing the time taken to have the last finished job arrive at its customer. In the study of the supply chain scheduling problem, many researches have considered scheduling problems with only one vehicle or unlimited vehicles. In this paper, we consider the more general case of the problem in which limited vehicles are employed and each job may occupy a different amount of physical space in a vehicle. The problem is described formally

  3. 基于全网统筹的联络线分层优化调度%Optimization of Tie-line Hierarchical Schedule Based on Network-wide Coordination

    Institute of Scientific and Technical Information of China (English)

    许丹; 李晓磊; 丁强; 崔晖; 韩彬

    2014-01-01

    The traditional tie-line schedule is entirely based on the electricity transaction,hence it is loosely coupled with power grid operation all along and relatively independent from the generation scheduling.These cause difficulties in adj usting tie-line schedule and lack of capacity in global allocation of resources.In face of these problems,a hierarchical tie-line schedule model based on network-wide coordination is proposed by resorting to the existing tie-line planning.The upper model gets the ideal tie-line schedule through the economical dispatch constrained by the whole network security.The lower model uses the ideal tie-line schedule as the optimization obj ective,and takes electricity transactions as constraints to achieve the tie-line schedule. This model has achieved automatic preparation and flexible adj ustment of tie-line scheduling,while providing an available manner that combines the schedule with the grid operating state.The proposed algorithm is applied to the tie-line schedule of Central China power grid,while the comparison between the proposed method and the traditional method showing the correctness and effectiveness of the proposed algorithm.%传统联络线计划完全基于电力交易,与电网运行长期处于松耦合状态且与机组计划相对独立,存在联络线计划调整困难,资源全局配置能力不足等问题。针对上述问题,文中以现有联络线计划编制方式为基础,提出了基于全网统筹的联络线分层优化模型。上层模型通过全网安全约束经济调度求取理想联络线计划。下层模型以理想联络线计划为优化目标,以交易合同实际执行为相关约束求解联络线计划。该模型实现了联络线计划自动编制与灵活调整,提供了一种将联络线计划与电网运行状态相结合的可用方式。将所提模型运用于华中电网联络线计划编制,并对优化结果与传统计划进行对比分析,验证了所提方法的正确性与有效性。

  4. Concurrent Scheduling of Event-B Models

    CERN Document Server

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

    2011-01-01

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

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

  6. Smart Manufacturing for the Oil Refining and Petrochemical Industry

    Directory of Open Access Journals (Sweden)

    Zhihong Yuan

    2017-04-01

    Full Text Available Smart manufacturing will transform the oil refining and petrochemical sector into a connected, information-driven environment. Using real-time and high-value support systems, smart manufacturing enables a coordinated and performance-oriented manufacturing enterprise that responds quickly to customer demands and minimizes energy and material usage, while radically improving sustainability, productivity, innovation, and economic competitiveness. In this paper, several examples of the application of so-called “smart manufacturing” for the petrochemical sector are demonstrated, such as the fault detection of a catalytic cracking unit driven by big data, advanced optimization for the planning and scheduling of oil refinery sites, and more. Key scientific factors and challenges for the further smart manufacturing of chemical and petrochemical processes are identified.

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

  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. Day-Ahead Reactive Power Scheduling for Distribution Network Considering Coordination of Distributed Generation With Capacitors%计及分布式电源与电容器协调的配电网日前无功计划

    Institute of Scientific and Technical Information of China (English)

    谭煌; 张璐; 丛鹏伟; 唐巍; 耿光飞; 杨德昌; 李绚丽

    2014-01-01

    针对目前含分布式电源(distributed generation,DG)的配电网中未考虑电容器补偿容量和 DG 无功出力协调调度的问题,研究了考虑 DG 与电容器组协调的无功优化方法。以网损和电压偏移满意度最高为目标,构建含DG的配电网日前动态无功优化调度模型。根据DG无功出力和电容器补偿的特点,提出 DG 和电容器协调的日前无功计划方法。分析了各类DG的无功出力极限并作为约束条件,对电容器和DG进行整体静态优化得到电容器的投切容量曲线;其次采用模糊聚类对电容器投切曲线进行时序分段并融合,制定电容器的日前计划;最后,在电容器补偿容量确定后,以DG作为优化变量,制定DG出力的日前计划。仿真结果验证了所提方法的有效性。%In allusion to the situation that in present distribution networks containing distributed generation (DG) the coordinated dispatching of the compensating capacity of capacitors with reactive output of DG is not taken into account, a reactive power optimization method considering the coordination of capacitor banks with DG is researched. Taking the highest satisfaction degree of both network loss and voltage deviation as the objective, an optimal day-ahead dynamic reactive power scheduling model for distribution network containing DG is constructed. Based on the reactive power output of DG and the features of capacitor compensation, a day-ahead reactive power scheduling that coordinates the DG with capacitor banks is proposed. Firstly, the limits of various DG’s reactive power output are analyzed and taken as constraints, the overall static state optimization of DG and capacitor banks is performed to attain the switching on/off capacity curve of capacitor banks; then fuzzy clustering is adapted to segment the capacity curve and subsection integration is used to formulate the day ahead schedule of capacitors;finally, after the determination of

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

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

  12. Refining Inductive Types

    CERN Document Server

    Atkey, Robert; Ghani, Neil

    2012-01-01

    Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of particular use in dependently typed programming are indexed types that refine data by computationally useful information. For example, the N-indexed type of vectors refines lists by their lengths. Other data types may be refined in similar ways, but programmers must produce purpose-specific refinements on an ad hoc basis, developers must anticipate which refinements to include in libraries, and implementations must often store redundant information about data and their refinements. In this paper we show how to generically derive inductive characterisations of refinements of inductive types, and argue that these characterisations can alleviate some of the aforementioned difficulties associated with ad hoc refinements. Our characterisations also ensure that standard techniques for programming with and reasoning about inductive types are applicable to refinements, and that refinements can the...

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

  14. Elevator Group Control Scheduling Based on Destination Reservation and Multi-agent Coordination%目的层预约与多智能体协调的电梯群控调度方法

    Institute of Scientific and Technical Information of China (English)

    陈海啸; 杨马英

    2012-01-01

    To deal with the uncertainty of the elevator traffic flow and the destination of passengers, overcome the computing bottleneck existed in collective EGCS, an elevator group control scheduling method is proposed based on destination registration and multi-agent coordination. The EGCS was firstly designed and the multi-objective evaluation function of destination registration was demonstrated. Then, the online update of elevator traffic pattern recognition based on fuzzy logic was proposed, to update different traffic modes corresponding to the weights of the control objectives in real-time. At last, the elevator car and group controller can be mapped to different agents. The distributed elevator group control scheduling is to implement a multi-objective optimization by various agents, with a coordination of minimum average waiting time (AWT), average riding time (ART), congestion degree (CD) and energy consumption EC).%针对电梯群控调度过程中交通流和乘客目的楼层的不确定性,为克服集中式群控系统计算瓶颈问题,提出了基于目的层预约结合多智能体技术的电梯群控调度方法.首先,设计了该电梯群控调度系统的结构,分析了目的层预约的多目标评价函数;然后,提出基于模糊逻辑的电梯交通模式在线识别方案,实现实时地更新不同交通模式下对应的各控制目标的权系数;最后,结合多智能体技术具有良好的实时性和自主性的特点,将各轿厢运行控制器和群控制器映射为多个代理,通过各个代理之间协调多目标优化任务以得到平均候梯时间、平均乘梯时间及能源消耗整体最优的分布式电梯群控调度算法.

  15. 经济批量与运送排产问题中的协调机制研究%Coordination Mechanism of Economic Lot and Delivery Scheduling Problem

    Institute of Scientific and Technical Information of China (English)

    李政道; 周泓

    2012-01-01

    Economic lot and delivery scheduling problem (ELDSP) is a typical research topic in the field of supply chain. Up to now, most research results obtained on this topic are based on centralized decision making. However, because of the autonomous nature of supply chain, it may not be always applicable. Thus, the ELDSP is studied by using decentralized decision making in this paper. A mathematical model is developed for this problem. Based on the model, it shows that an optimal solution cannot be obtained without coordination. Thus, the profit and cost sharing contract (PCS) is adopted for coordination. With PCS, the profit of the supply chain can be flexibly distributed between the vendor and buyer. In this way, an optimal solution for the ELDSP can be found if the profit and cost sharing contract is properly designed.%针对现有研究采用集中决策的局限,研究了分散决策情形下经济批量与运送排产问题的最优决策.分析表明在无协调机制作用时,分散决策无法实现供应链系统的最优绩效,进一步提出一种利润共享和成本分担协议(PCS),并证明在PCS协议作用下,采用分散决策可以实现供应链协调,同时供应链利润可以在供需双方任意分配,具有很好的柔性.

  16. The Business Change Initiative: A Novel Approach to Improved Cost and Schedule Management

    Science.gov (United States)

    Shinn, Stephen A.; Bryson, Jonathan; Klein, Gerald; Lunz-Ruark, Val; Majerowicz, Walt; McKeever, J.; Nair, Param

    2016-01-01

    Goddard Space Flight Center's Flight Projects Directorate employed a Business Change Initiative (BCI) to infuse a series of activities coordinated to drive improved cost and schedule performance across Goddard's missions. This sustaining change framework provides a platform to manage and implement cost and schedule control techniques throughout the project portfolio. The BCI concluded in December 2014, deploying over 100 cost and schedule management changes including best practices, tools, methods, training, and knowledge sharing. The new business approach has driven the portfolio to improved programmatic performance. The last eight launched GSFC missions have optimized cost, schedule, and technical performance on a sustained basis to deliver on time and within budget, returning funds in many cases. While not every future mission will boast such strong performance, improved cost and schedule tools, management practices, and ongoing comprehensive evaluations of program planning and control methods to refine and implement best practices will continue to provide a framework for sustained performance. This paper will describe the tools, techniques, and processes developed during the BCI and the utilization of collaborative content management tools to disseminate project planning and control techniques to ensure continuous collaboration and optimization of cost and schedule management in the future.

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

  18. On the refinement calculus

    CERN Document Server

    Vickers, Trevor

    1992-01-01

    On the Refinement Calculus gives one view of the development of the refinement calculus and its attempt to bring together - among other things - Z specifications and Dijkstra's programming language. It is an excellent source of reference material for all those seeking the background and mathematical underpinnings of the refinement calculus.

  19. OPTIMIZING EUCALYPTUS PULP REFINING

    Institute of Scientific and Technical Information of China (English)

    Vail Manfredi

    2004-01-01

    This paper discusses the refining of bleached eucalyptus kraft pulp (BEKP).Pilot plant tests were carried out in to optimize the refining process and to identify the effects of refining variables on final paper quality and process costs.The following parameters are discussed: pulp consistency, disk pattern design, refiner speed,energy input, refiner configuration (parallel or serial)and refining intensity.The effects of refining on pulp fibers were evaluated against the pulp quality properties, such as physical strengths, bulk, opacity and porosity, as well as the interactions with papermaking process, such as paper machine runnability, paper breaks and refining control.The results showed that process optimization,considering pulp quality and refining costs, were obtained when eucalyptus pulp is refined under the lowest intensity and the highest pulp consistency possible. Changes on the operational refining conditions will have the highest impact on total energy requirements (costs) without any significant effect on final paper properties.It was also observed that classical ways to control the industrial operation, such as those based on drainage measurements, do not represent the best alternative to maximize the final paper properties neither the paper machine runability.

  20. TECHNICAL COORDINATION,SCHEDULE AND INTEGRATION

    CERN Document Server

    A. Ball

    A pivotal milestone in CMS underground installation will be reached during this CMS week when the 1920 ton central wheel (YB0) of the iron yoke is lowered into the experimental cavern on Wednesday 28 February. This milestone will be reached on the on the date planned due to the hard work and dedication of many people, on the surface, underground and at supporting sites. Details of the programme for 28 February, visit opportunities and progress updates, can be found on the TC web pages on iCMS. http://cms.cern.ch/iCMS/jsp/page.jsp?mode=cms&ac-tion=url&urlkey=CMS_TC Heavy lowering The build-up to the above event started shortly after the December CMS week, when the YE+2 endcap disk was safely lowered into the cavern, followed by the YE+1 on January 9. The lowering of YE+1 was the most complicated so far because, due to the calorimetry nose, the centre of gravity lies outside the plane of the disk. However, after 10 hours it touched-down safely without any problems. On Jan. 19 the first barrel wheel ...

  1. TECHNICAL COORDINATION

    CERN Multimedia

    A. Ball

    2010-01-01

    Operational Experience At the end of the first full-year running period of LHC, CMS is established as a reliable, robust and mature experiment. In particular common systems and infrastructure faults accounted for <0.6 % CMS downtime during LHC pp physics. Technical operation throughout the entire year was rather smooth, the main faults requiring UXC access being sub-detector power systems and rack-cooling turbines. All such problems were corrected during scheduled technical stops, in the shadow of tunnel access needed by the LHC, or in negotiated accesses or access extensions. Nevertheless, the number of necessary accesses to the UXC averaged more than one per week and the technical stops were inevitably packed with work packages, typically 30 being executed within a few days, placing a high load on the coordination and area management teams. It is an appropriate moment for CMS Technical Coordination to thank all those in many CERN departments and in the Collaboration, who were involved in CMS techni...

  2. Level 5: user refinement to aid the fusion process

    Science.gov (United States)

    Blasch, Erik P.; Plano, Susan

    2003-04-01

    The revised JDL Fusion model Level 4 process refinement covers a broad spectrum of actions such as sensor management and control. A limitation of Level 4 is the purpose of control - whether it be for user needs or system operation. Level 5, User Refinement, is a modification to the Revised JDL model that distinguishes between machine process refinement and user refinement. User refinement can either be human control actions or refinement of the user's cognitive model. In many cases, fusion research concentrates on the machine and does not take full advantage of the human as not only a qualified expert to refine the fusion process, but also as customer for whom the fusion system is designed. Without user refinement, sensor fusion is incomplete, inadequate, and the user neglects its worthiness. To capture user capabilities, we explore the concept of user refinement through decision and action based on situational leadership models. We develop a Fuse-Act Situational User Refinement (FASUR) model that details four refinement behaviors: Neglect, Consult, Rely, and Interact and five refinement functions: Planning, Organizing, Coordinating, Directing, and Controlling. Process refinement varies for different systems and different user information needs. By designing a fusion system with a specific user in mind, vis Level 5, a fusion architecture can meet user's information needs for varying situations, extend user sensing capabilities for action, and increase the human-machine interaction.

  3. 考虑 V2 G模式的电动汽车与可再生能源协同调度%Coordinated scheduling of electric vehicles and renewable generation considering vehicle-to-grid mode

    Institute of Scientific and Technical Information of China (English)

    黄晓倩; 汪沨; 谭阳红; 王睿; 邵靖珂; 陈春

    2016-01-01

    For the purpose of reducing the difference between the peak and the valley for load of re‐gional power grid ,strengthening the ability of power grid accepting renewable energy and impro‐ving the response positivity of electric vehicles (EVs) users ,taking the minimized equivalent load fluctuation of regional power grid and the minimized charging price of EVs users as objective function and considering the vehicle‐to‐grid (V2G)mode ,a multi‐objective coordinated scheduling model ,in which the EVs ,wind power and photovoltaic generation system were taken into account simultaneously ,was established ,so that charging and discharging behavior of EVs could be ar‐ranged reasonably .Defining each objective membership function ,multi‐objective optimization problem was reformulated into a nonlinear single‐objective programming problem by means of fuzzy satisfaction‐maximizing method ,and this nonlinear single‐objective programming problem was solved by using adaptive particle swarm optimization algorithm .Simulation results show the effectiveness of multi‐objective model and the feasibility of solving method .%为减小地区电网负荷峰谷差,增强电力系统接纳可再生能源的能力,同时提高电动汽车用户响应积极性,以地区电网等效负荷波动最小和用户充电费用最低为目标函数,建立了考虑电动汽车与电网互动(vehicle‐to‐grid , V2G)模式并计及风电和光伏出力的多目标协同调度模型,以合理安排电动汽车的充放电行为。定义了各目标的隶属度函数,通过运用最大模糊满意度法,将该多目标优化问题转化为单目标非线性优化问题,并应用自适应权重粒子群寻优算法进行求解,得到最优调度方案。算例结果验证了模型的有效性和求解方法的可行性。

  4. OPTIMIZING EUCALYPTUS PULP REFINING

    Institute of Scientific and Technical Information of China (English)

    VailManfredi

    2004-01-01

    This paper discusses the refining of bleachedeucalyptus kraft pulp (BEKP).Pilot plant tests were carded out in to optimize therefining process and to identify the effects of refiningvariables on final paper quality and process costs.The following parameters are discussed: pulpconsistency, disk pattern design, refiner speed,energy input, refiner configuration (parallel or serial)and refining intensity.The effects of refining on pulp fibers were evaluatedagainst the pulp quality properties, such as physicalstrengths, bulk, opacity and porosity, as well as theinteractions with papermaking process, such as papermachine runnability, paper breaks and refiningcontrol.The results showed that process optimization,considering pulp quality and refining costs, wereobtained when eucalyptus pulp is refined under thelowest intensity and the highest pulp consistencypossible. Changes on the operational refiningconditions will have the highest impact on totalenergy requirements (costs) without any significanteffect on final paper properties.It was also observed that classical ways to control theindustrial operation, such as those based on drainagemeasurements, do not represent the best alternative tomaximize the final paper properties neither the papermachine runability.

  5. Schedule Uncertainty Control: A Literature Review

    Science.gov (United States)

    Jun-yan, Liu

    Risk control on project schedule is one of the focus problems in the academic circle and the practical area all the time. Lots of research about risk control on project schedule have been fulfilled and many achievements have appeared in recent several decades. The literature on the techniques of schedule uncertainty control was reviewed. A summary analysis on those chievements is presented such as CPM, PERT, MC, BBN, and so on and in light of that summary analysis a deep discussion in terms of advantages and disadvantages of existing research has been analyzed, so that researchers can continue to refine their research.

  6. 41 CFR 101-5.104-4 - Scheduling feasibility studies.

    Science.gov (United States)

    2010-07-01

    ... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and buildings... 41 Public Contracts and Property Management 2 2010-07-01 2010-07-01 true Scheduling...

  7. Refined Semilattices of Semigroups

    Institute of Scientific and Technical Information of China (English)

    Liang Zhang; K.P. Shum; Ronghua Zhang

    2001-01-01

    In this paper, we introduce the concept of refined semilattices of semigroups. This is a modified concept of the generally strong semilattice of semigroups initiated by Zhang and Huang. By using the concept of generally strong semilattice, Zhang and Huang showed that a regular band can be expressed by a generally strong semilattice of rectangular bands. However, the proof of the associativity for the multiplication is not complete and there exist some gaps in their construction of regular bands. We now revise the generally strong semilattices and call them refined semilattices. In this way, we are able to remove the gaps,and the associative law of the multiplication can be verified. As an application, we prove that a band is regular if and only if it is a refined semilattice of rectangular bands. In fact, refined semilattices provide a new device in the construction of new semigroups from the old ones.

  8. Reversed light-dark cycle and cage enrichment effects on ethanol-induced deficits in motor coordination assessed in inbred mouse strains with a compact battery of refined tests.

    Science.gov (United States)

    Munn, Elizabeth; Bunning, Mark; Prada, Sofia; Bohlen, Martin; Crabbe, John C; Wahlsten, Douglas

    2011-10-31

    The laboratory environment existing outside the test situation itself can have a substantial influence on results of some behavioral tests with mice, and the extent of these influences sometimes depends on genotype. For alcohol research, the principal issue is whether genotype-related ethanol effects will themselves be altered by common variations in the lab environment or instead will be essentially the same across a wide range of lab environments. Data from 20 inbred strains were used to reduce an original battery of seven tests of alcohol intoxication to a compact battery of four tests: the balance beam and grip strength with a 1.25 g/kg ethanol dose and the accelerating rotarod and open-field activation tests with 1.75 g/kg. The abbreviated battery was then used to study eight inbred strains housed under a normal or reversed light-dark cycle, or a standard or enriched home cage environment. The light-dark cycle had no discernable effects on any measure of behavior or response to alcohol. Cage enrichment markedly improved motor coordination in most strains. Ethanol-induced motor coordination deficits were robust; the well-documented strain-dependent effects of ethanol were not altered by cage enrichment.

  9. Refinement by interface instantiation

    DEFF Research Database (Denmark)

    Hallerstede, Stefan; Hoang, Thai Son

    2012-01-01

    be easily refined. Our first contribution hence is a proposal for a new construct called interface that encapsulates the external variables, along with a mechanism for interface instantiation. Using the new construct and mechanism, external variables can be refined consistently. Our second contribution...... is an approach for verifying the correctness of Event-B extensions using the supporting Rodin tool. We illustrate our approach by proving the correctness of interface instantiation....

  10. NAFTA opportunities: Petroleum refining

    Energy Technology Data Exchange (ETDEWEB)

    1993-01-01

    The North American Free Trade Agreement (NAFTA) creates a more transparent environment for the sale of refined petroleum products to Mexico, and locks in access to Canada's relatively open market for these products. Canada and Mexico are sizable United States export markets for refined petroleum products, with exports of $556 million and $864 million, respectively, in 1992. These markets represent approximately 24 percent of total U.S. exports of these goods.

  11. Refinement Modal Logic

    CERN Document Server

    Bozzelli, Laura; French, Tim; Hales, James; Pinchinat, Sophie

    2012-01-01

    In this paper we present refinement modal logic. A refinement is like a bisimulation, except that from the three relational requirements only 'atoms' and 'back' need to be satisfied. Our logic contains a new operator 'forall' in additional to the standard modalities 'Box' for each agent. The operator 'forall' acts as a quantifier over the set of all refinements of a given model. We call it the refinement operator. As a variation on a bisimulation quantifier, it can be seen as a refinement quantifier over a variable not occurring in the formula bound by the operator. The logic combines the simplicity of multi-agent modal logic with some powers of monadic second order quantification. We present a sound and complete axiomatization of multiagent refinement modal logic. We also present an extension of the logic to the modal mu-calculus, and an axiomatization for the single-agent version of this logic. Examples and applications are also discussed: to software verification and design (the set of agents can also be s...

  12. RUN COORDINATION

    CERN Multimedia

    Christophe Delaere

    2013-01-01

    The focus of Run Coordination during LS1 is to monitor closely the advance of maintenance and upgrade activities, to smooth interactions between subsystems and to ensure that all are ready in time to resume operations in 2015 with a fully calibrated and understood detector. After electricity and cooling were restored to all equipment, at about the time of the last CMS week, recommissioning activities were resumed for all subsystems. On 7 October, DCS shifts began 24/7 to allow subsystems to remain on to facilitate operations. That culminated with the Global Run in November (GriN), which   took place as scheduled during the week of 4 November. The GriN has been the first centrally managed operation since the beginning of LS1, and involved all subdetectors but the Pixel Tracker presently in a lab upstairs. All nights were therefore dedicated to long stable runs with as many subdetectors as possible. Among the many achievements in that week, three items may be highlighted. First, the Strip...

  13. Refining and petrochemicals

    Energy Technology Data Exchange (ETDEWEB)

    Constancio, Silva

    2006-07-01

    In 2004, refining margins showed a clear improvement that persisted throughout the first three quarters of 2005. This enabled oil companies to post significantly higher earnings for their refining activity in 2004 compared to 2003, with the results of the first half of 2005 confirming this trend. As for petrochemicals, despite a steady rise in the naphtha price, higher cash margins enabled a turnaround in 2004 as well as a clear improvement in oil company financial performance that should continue in 2005, judging by the net income figures reported for the first half-year. Despite this favorable business environment, capital expenditure in refining and petrochemicals remained at a low level, especially investment in new capacity, but a number of projects are being planned for the next five years. (author)

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

  15. Using OpenRefine

    CERN Document Server

    Verborgh, Ruben

    2013-01-01

    The book is styled on a Cookbook, containing recipes - combined with free datasets - which will turn readers into proficient OpenRefine users in the fastest possible way.This book is targeted at anyone who works on or handles a large amount of data. No prior knowledge of OpenRefine is required, as we start from the very beginning and gradually reveal more advanced features. You don't even need your own dataset, as we provide example data to try out the book's recipes.

  16. Incremental Bisimulation Abstraction Refinement

    DEFF Research Database (Denmark)

    Godskesen, Jens Christian; Song, Lei; Zhang, Lijun

    2013-01-01

    an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on incrementally computing a sequence of may- and must-quotient automata. These are induced by depth-bounded bisimulation equivalences of increasing depth. The approach is both sound and complete, since...

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

  18. Resource-Driven Scheduling Implementation in Malaysian Construction Industry

    Directory of Open Access Journals (Sweden)

    Aftab Hameed Memon

    2011-07-01

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

  19. Cyclic Steady State Refinement

    DEFF Research Database (Denmark)

    Bocewicz, Grzegorz; Nielsen, Peter; Banaszak, Zbigniew

    2012-01-01

    This paper deals with the problem of finding optimal feeding sequence in a manufacturing cell with feeders fed by a mobile robot with manipulation arm. The performance criterion is to minimize total traveling time of the robot in a given planning horizon. Besides, the robot has to be scheduled...

  20. An Augmented Lagrangian Approach for Scheduling Problems

    Science.gov (United States)

    Nishi, Tatsushi; Konishi, Masami

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

  1. Perspicuity and Granularity in Refinement

    CERN Document Server

    Boiten, Eerke

    2011-01-01

    This paper reconsiders refinements which introduce actions on the concrete level which were not present at the abstract level. It draws a distinction between concrete actions which are "perspicuous" at the abstract level, and changes of granularity of actions between different levels of abstraction. The main contribution of this paper is in exploring the relation between these different methods of "action refinement", and the basic refinement relation that is used. In particular, it shows how the "refining skip" method is incompatible with failures-based refinement relations, and consequently some decisions in designing Event-B refinement are entangled.

  2. Refinement for Administrative Policies

    OpenAIRE

    Dekker, MAC; Etalle, S Sandro

    2007-01-01

    Flexibility of management is an important requisite for access control systems as it allows users to adapt the access control system in accordance with practical requirements. This paper builds on earlier work where we defined administrative policies for a general class of RBAC models. We present a formal definition of administrative refinnement and we show that there is an ordering for administrative privileges which yields administrative refinements of policies. We argue (by giving an examp...

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

  4. 78 FR 15719 - Coordination Between Natural Gas and Electricity Markets; Notice of Technical Conference

    Science.gov (United States)

    2013-03-12

    ... Energy Regulatory Commission Coordination Between Natural Gas and Electricity Markets; Notice of... developed by industry will result in more efficient utilization of pipeline capacity. \\1\\ Coordination... conference also will explore coordination of gas and electric scheduling, including: whether...

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

  6. Protein structure refinement by optimization.

    Science.gov (United States)

    Carlsen, Martin; Røgen, Peter

    2015-09-01

    Knowledge-based protein potentials are simplified potentials designed to improve the quality of protein models, which is important as more accurate models are more useful for biological and pharmaceutical studies. Consequently, knowledge-based potentials often are designed to be efficient in ordering a given set of deformed structures denoted decoys according to how close they are to the relevant native protein structure. This, however, does not necessarily imply that energy minimization of this potential will bring the decoys closer to the native structure. In this study, we introduce an iterative strategy to improve the convergence of decoy structures. It works by adding energy optimized decoys to the pool of decoys used to construct the next and improved knowledge-based potential. We demonstrate that this strategy results in significantly improved decoy convergence on Titan high resolution decoys and refinement targets from Critical Assessment of protein Structure Prediction competitions. Our potential is formulated in Cartesian coordinates and has a fixed backbone potential to restricts motions to be close to those of a dihedral model, a fixed hydrogen-bonding potential and a variable coarse grained carbon alpha potential consisting of a pair potential and a novel solvent potential that are b-spline based as we use explicit gradient and Hessian for efficient energy optimization.

  7. Hirshfeld atom refinement.

    Science.gov (United States)

    Capelli, Silvia C; Bürgi, Hans-Beat; Dittrich, Birger; Grabowsky, Simon; Jayatilaka, Dylan

    2014-09-01

    Hirshfeld atom refinement (HAR) is a method which determines structural parameters from single-crystal X-ray diffraction data by using an aspherical atom partitioning of tailor-made ab initio quantum mechanical molecular electron densities without any further approximation. Here the original HAR method is extended by implementing an iterative procedure of successive cycles of electron density calculations, Hirshfeld atom scattering factor calculations and structural least-squares refinements, repeated until convergence. The importance of this iterative procedure is illustrated via the example of crystalline ammonia. The new HAR method is then applied to X-ray diffraction data of the dipeptide Gly-l-Ala measured at 12, 50, 100, 150, 220 and 295 K, using Hartree-Fock and BLYP density functional theory electron densities and three different basis sets. All positions and anisotropic displacement parameters (ADPs) are freely refined without constraints or restraints - even those for hydrogen atoms. The results are systematically compared with those from neutron diffraction experiments at the temperatures 12, 50, 150 and 295 K. Although non-hydrogen-atom ADPs differ by up to three combined standard uncertainties (csu's), all other structural parameters agree within less than 2 csu's. Using our best calculations (BLYP/cc-pVTZ, recommended for organic molecules), the accuracy of determining bond lengths involving hydrogen atoms from HAR is better than 0.009 Å for temperatures of 150 K or below; for hydrogen-atom ADPs it is better than 0.006 Å(2) as judged from the mean absolute X-ray minus neutron differences. These results are among the best ever obtained. Remarkably, the precision of determining bond lengths and ADPs for the hydrogen atoms from the HAR procedure is comparable with that from the neutron measurements - an outcome which is obtained with a routinely achievable resolution of the X-ray data of 0.65 Å.

  8. Refining and petrochemicals

    Energy Technology Data Exchange (ETDEWEB)

    Benazzi, E.; Alario, F

    2004-07-01

    In 2003, refining margins showed a clear improvement that continued throughout the first three quarters of 2004. Oil companies posted significantly higher earnings in 2003 compared to 2002, with the results of first quarter 2004 confirming this trend. Due to higher feedstock prices, the implementation of new capacity and more intense competition, the petrochemicals industry was not able to boost margins in 2003. In such difficult business conditions, aggravated by soaring crude prices, the petrochemicals industry is not likely to see any improvement in profitability before the second half of 2004. (author)

  9. Refining and petrochemicals

    Energy Technology Data Exchange (ETDEWEB)

    Benazzi, E

    2003-07-01

    Down sharply in 2002, refining margins showed a clear improvement in the first half-year of 2003. As a result, the earnings reported by oil companies for financial year 2002 were significantly lower than in 2001, but the prospects are brighter for 2003. In the petrochemicals sector, slow demand and higher feedstock prices eroded margins in 2002, especially in Europe and the United States. The financial results for the first part of 2003 seem to indicate that sector profitability will not improve before 2004. (author)

  10. Control by Exception for Tactical Departure Scheduling Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Tactical Departure Scheduling (TDS) is a common activity in Air Traffic Control (ATC) in the National Airspace System (NAS) that requires significant coordination...

  11. Macromolecular crystallographic estructure refinement

    Directory of Open Access Journals (Sweden)

    Afonine, Pavel V.

    2015-04-01

    Full Text Available Model refinement is a key step in crystallographic structure determination that ensures final atomic structure of macromolecule represents measured diffraction data as good as possible. Several decades have been put into developing methods and computational tools to streamline this step. In this manuscript we provide a brief overview of major milestones of crystallographic computing and methods development pertinent to structure refinement.El refinamiento es un paso clave en el proceso de determinación de una estructura cristalográfica al garantizar que la estructura atómica de la macromolécula final represente de la mejor manera posible los datos de difracción. Han hecho falta varias décadas para poder desarrollar nuevos métodos y herramientas computacionales dirigidas a dinamizar esta etapa. En este artículo ofrecemos un breve resumen de los principales hitos en la computación cristalográfica y de los nuevos métodos relevantes para el refinamiento de estructuras.

  12. Refines Efficiency Improvement

    Energy Technology Data Exchange (ETDEWEB)

    WRI

    2002-05-15

    Refinery processes that convert heavy oils to lighter distillate fuels require heating for distillation, hydrogen addition or carbon rejection (coking). Efficiency is limited by the formation of insoluble carbon-rich coke deposits. Heat exchangers and other refinery units must be shut down for mechanical coke removal, resulting in a significant loss of output and revenue. When a residuum is heated above the temperature at which pyrolysis occurs (340 C, 650 F), there is typically an induction period before coke formation begins (Magaril and Aksenova 1968, Wiehe 1993). To avoid fouling, refiners often stop heating a residuum before coke formation begins, using arbitrary criteria. In many cases, this heating is stopped sooner than need be, resulting in less than maximum product yield. Western Research Institute (WRI) has developed innovative Coking Index concepts (patent pending) which can be used for process control by refiners to heat residua to the threshold, but not beyond the point at which coke formation begins when petroleum residua materials are heated at pyrolysis temperatures (Schabron et al. 2001). The development of this universal predictor solves a long standing problem in petroleum refining. These Coking Indexes have great potential value in improving the efficiency of distillation processes. The Coking Indexes were found to apply to residua in a universal manner, and the theoretical basis for the indexes has been established (Schabron et al. 2001a, 2001b, 2001c). For the first time, a few simple measurements indicates how close undesired coke formation is on the coke formation induction time line. The Coking Indexes can lead to new process controls that can improve refinery distillation efficiency by several percentage points. Petroleum residua consist of an ordered continuum of solvated polar materials usually referred to as asphaltenes dispersed in a lower polarity solvent phase held together by intermediate polarity materials usually referred to as

  13. Hirshfeld atom refinement

    Directory of Open Access Journals (Sweden)

    Silvia C. Capelli

    2014-09-01

    Full Text Available Hirshfeld atom refinement (HAR is a method which determines structural parameters from single-crystal X-ray diffraction data by using an aspherical atom partitioning of tailor-made ab initio quantum mechanical molecular electron densities without any further approximation. Here the original HAR method is extended by implementing an iterative procedure of successive cycles of electron density calculations, Hirshfeld atom scattering factor calculations and structural least-squares refinements, repeated until convergence. The importance of this iterative procedure is illustrated via the example of crystalline ammonia. The new HAR method is then applied to X-ray diffraction data of the dipeptide Gly–l-Ala measured at 12, 50, 100, 150, 220 and 295 K, using Hartree–Fock and BLYP density functional theory electron densities and three different basis sets. All positions and anisotropic displacement parameters (ADPs are freely refined without constraints or restraints – even those for hydrogen atoms. The results are systematically compared with those from neutron diffraction experiments at the temperatures 12, 50, 150 and 295 K. Although non-hydrogen-atom ADPs differ by up to three combined standard uncertainties (csu's, all other structural parameters agree within less than 2 csu's. Using our best calculations (BLYP/cc-pVTZ, recommended for organic molecules, the accuracy of determining bond lengths involving hydrogen atoms from HAR is better than 0.009 Å for temperatures of 150 K or below; for hydrogen-atom ADPs it is better than 0.006 Å2 as judged from the mean absolute X-ray minus neutron differences. These results are among the best ever obtained. Remarkably, the precision of determining bond lengths and ADPs for the hydrogen atoms from the HAR procedure is comparable with that from the neutron measurements – an outcome which is obtained with a routinely achievable resolution of the X-ray data of 0.65 Å.

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

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

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

  17. RNA Structure Refinement using the ERRASER-Phenix pipeline

    Science.gov (United States)

    Chou, Fang-Chieh; Echols, Nathaniel; Terwilliger, Thomas C.; Das, Rhiju

    2015-01-01

    Summary The final step of RNA crystallography involves the fitting of coordinates into electron density maps. The large number of backbone atoms in RNA presents a difficult and tedious challenge, particularly when experimental density is poor. The ERRASER-Phenix pipeline can improve an initial set of RNA coordinates automatically based on a physically realistic model of atomic-level RNA interactions. The pipeline couples diffraction-based refinement in Phenix with the Rosetta-based real-space refinement protocol ERRASER (Enumerative Real-Space Refinement ASsisted by Electron density under Rosetta). The combination of ERRASER and Phenix can improve the geometrical quality of RNA crystallographic models while maintaining or improving the fit to the diffraction data (as measured by Rfree). Here we present a complete tutorial for running ERRASER-Phenix through the Phenix GUI, from the command-line, and via an application in the Rosetta On-line Server that Includes Everyone (ROSIE). PMID:26227049

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

  19. The Composition of the Master Schedule

    Science.gov (United States)

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

    2010-01-01

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

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

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

  2. 城市公共交通协调调度现状与发展趋势%The Current Situation and Development Trend of Urban Public Transport Coordination Scheduling

    Institute of Scientific and Technical Information of China (English)

    张晓利; 陆化普

    2014-01-01

    From the perspective of urban public transportation structure changes and informatization, this paper analyzes the necessity of public transportation coordination managing. It also presents the history and cur-rent situation of the coordination managing from multimode operation organization perspective. The problems about single transport mode are analyzed. Based on data mining and the mode, strategy and decision support of coordination managing, this paper points out the development trend of public transportation coordination manag-ing for the present and the future. The study also covers the study of public transport data from multiple sources to multiple topics, multi-dimensional data mining and the study of establishing compatible multi-way operation managing model with the main elements of the strategy and methodology. The paper proposes the researching di-rection of perfect public transport data, data storage and data mining analysis in the future and explores public transport intelligent dispatching model based on cloud service models in order to realize all kinds of dynamics, fine management of resources, and improvement of the efficiency of transportation organization.%从城市公共交通网络结构变化、信息化等角度分析公共交通协调调度的必要性;从多方式运营组织角度阐述城市公共交通协调调度的发展历史与现状,剖析目前我国公共交通单一交通方式下的运营组织协调调度存在的问题;从数据挖掘、协调调度模型与策略、调度决策支持等方面给出当前及今后一段时期内公共交通协调调度的发展趋势,研究针对多源公共交通数据进行多主题、多维度的数据挖掘并建立相适应的多方式运营组织调度模型与策略的主要内容和方法;提出今后一段时期内在完善公共交通数据资源库、海量数据存储和数据挖掘分析等方面的研究方向,探索基于云服务模式的公共交通智能调度

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

  4. Structure refinement of astrophyllite

    Institute of Scientific and Technical Information of China (English)

    MA; Zhesheng

    2001-01-01

    [1]Abdel-Fattah M. Abdel-Rahman., Mineral chemistry and paragenesis of astrophyllite from Egypt, Mineralogical Magazine, 1992, 56: 17-26.[2]Liu Yan, Ma Zhesheng, Han Xiuling et al, Astrophyllite from the Namjabarwa Area, Eastern Tibet, Acta Petrologica et Mineralogica, 1997,16(4): 338-340.[3]Peng Zhizhong, Ma Zhesheng, The crystal structure of astrophyllite (in Russian), Scientia Sinica, 1963, 12(2): 272-276.[4]Pen Zhizhong, Ma Zhesheng, The crystal structure of Tricinic Mangano-astrophyllite (in Russian), Scientia Sinica (Scien-ce in China), 1964, 13(7): 1180-1183.[5]Shi Nicheng, Ma Zhesheng, Li Guowu et al., Stucyure Refinement of Monoclinic astrophyllite, Acta Crystallographica, Section B, 1998, B54: 109-114.[6]Woodrow, P. J., The Crystal structure of astrophyllite, Acta Crystallographica, 1967, 22: 673-678.[7]СеменовЕ. И., Куплетскит-Новый Минерал Группы Астрофиллита, ДАН, 1956, 108(5), 933-936.[8]Nickel, E. H., Rowland, J. E., Charette, D. J., Niobophyllite the niobium analogue of astrophyllite: A new mineral from Sead Laxe Labrador, Canad. Mine., 1964, 8(1): 40.[9]X-Ray Laboratory of Hubei Geologic College, The crystal chemistry of astrophyllite group minerals (in Chinese), Scientia Geologica Sinica, 1974, (1): 18-30.[10]Sheldrick, G. M., Program for the solution of crystal structures, SHELX86, University of G?ttingen, 1985, Germany.[11]Sheldrick, G. M., Program for the refinement of crystal structures, SHELXL93, University of G?ttingen, 1993, Germany.[12]Liebau, F., Structural Chemistry of Silicates Structure, Bonding, and Classification, Heidelberg: Springer-Verlag QD181, S6L614, 1985.[13]Ferraris, G., Ivaldi, G., Khomyakov, A. P. et al., Nafertisite, a layer titanosilicate member of a polysomatic series including mica, Eur. J. Mineral.,1996, 8: 241-249.[14]Ferraris, G., Polysomatism as a tool for correlating properties and structure, in EMU Notes in

  5. Poisson Coordinates.

    Science.gov (United States)

    Li, Xian-Ying; Hu, Shi-Min

    2013-02-01

    Harmonic functions are the critical points of a Dirichlet energy functional, the linear projections of conformal maps. They play an important role in computer graphics, particularly for gradient-domain image processing and shape-preserving geometric computation. We propose Poisson coordinates, a novel transfinite interpolation scheme based on the Poisson integral formula, as a rapid way to estimate a harmonic function on a certain domain with desired boundary values. Poisson coordinates are an extension of the Mean Value coordinates (MVCs) which inherit their linear precision, smoothness, and kernel positivity. We give explicit formulas for Poisson coordinates in both continuous and 2D discrete forms. Superior to MVCs, Poisson coordinates are proved to be pseudoharmonic (i.e., they reproduce harmonic functions on n-dimensional balls). Our experimental results show that Poisson coordinates have lower Dirichlet energies than MVCs on a number of typical 2D domains (particularly convex domains). As well as presenting a formula, our approach provides useful insights for further studies on coordinates-based interpolation and fast estimation of harmonic functions.

  6. Effect of optimization postural training on the coordination compliance and postoperative complications risk in patients scheduled by thyroid surgery%优化体位训练对行择期甲状腺手术患者配合依从性及术后并发症发生风险的影响

    Institute of Scientific and Technical Information of China (English)

    邵敏; 段晓侠

    2016-01-01

    Objective:To investigate the effects of optimization postural training on the coordination compliance and postoperative complications risk in patients scheduled by thyroid surgery. Methods:Eighty patients scheduled by thyroid surgery were randomly divided into the control group and observation group(40 cases each group). The control group and observation group were treated with conventional postural training and optimization postural training, respectively. The coordination compliance, healthy knowledge, postoperative SF-36 score, postoperative complications and nursing satisfaction between two groups were compared. Results:The coordination compliance,healthy knowledge,postoperative SF-36 score and nursing satisfaction in observation group were higher than those in control group(P<0. 05 to P<0. 01). The incidences of the postoperative headache,nausea and vomiting and waist back pain in observation group were lower than those in control group(P<0. 05 to P<0. 01). Conclusions:The optimization postural training in nursing the patients scheduled by thyroid surgery can effectively improve the coordination compliance,healthy knowledge,quality of life and nurse-patient relationship, reduce the postoperative complications risk, and the clinical effects of which are better than those of conventional postural training.%目的::探讨优化体位训练对行择期甲状腺手术患者配合依从性及术后并发症发生风险的影响。方法:行择期甲状腺手术患者共80例,随机分为对照组和观察组,各40例,分别采用常规体位训练和优化体位训练。比较2组患者配合依从性、健康相关知识掌握率、术后SF-36评分、术后并发症发生率及护理满意度等。结果:观察组患者配合依从性、健康相关知识掌握率、SF-36评分及患者护理满意度均高于对照组(P<0.05~P<0.01);术后并发症头痛、恶心呕吐和腰背痛的发生率均低于对照组(P<0.05~P<0.01)。结论:优化体

  7. Crystal structure refinement with SHELXL

    Energy Technology Data Exchange (ETDEWEB)

    Sheldrick, George M., E-mail: gsheldr@shelx.uni-ac.gwdg.de [Department of Structural Chemistry, Georg-August Universität Göttingen, Tammannstraße 4, Göttingen 37077 (Germany)

    2015-01-01

    New features added to the refinement program SHELXL since 2008 are described and explained. The improvements in the crystal structure refinement program SHELXL have been closely coupled with the development and increasing importance of the CIF (Crystallographic Information Framework) format for validating and archiving crystal structures. An important simplification is that now only one file in CIF format (for convenience, referred to simply as ‘a CIF’) containing embedded reflection data and SHELXL instructions is needed for a complete structure archive; the program SHREDCIF can be used to extract the .hkl and .ins files required for further refinement with SHELXL. Recent developments in SHELXL facilitate refinement against neutron diffraction data, the treatment of H atoms, the determination of absolute structure, the input of partial structure factors and the refinement of twinned and disordered structures. SHELXL is available free to academics for the Windows, Linux and Mac OS X operating systems, and is particularly suitable for multiple-core processors.

  8. Parallel Adaptive Mesh Refinement

    Energy Technology Data Exchange (ETDEWEB)

    Diachin, L; Hornung, R; Plassmann, P; WIssink, A

    2005-03-04

    As large-scale, parallel computers have become more widely available and numerical models and algorithms have advanced, the range of physical phenomena that can be simulated has expanded dramatically. Many important science and engineering problems exhibit solutions with localized behavior where highly-detailed salient features or large gradients appear in certain regions which are separated by much larger regions where the solution is smooth. Examples include chemically-reacting flows with radiative heat transfer, high Reynolds number flows interacting with solid objects, and combustion problems where the flame front is essentially a two-dimensional sheet occupying a small part of a three-dimensional domain. Modeling such problems numerically requires approximating the governing partial differential equations on a discrete domain, or grid. Grid spacing is an important factor in determining the accuracy and cost of a computation. A fine grid may be needed to resolve key local features while a much coarser grid may suffice elsewhere. Employing a fine grid everywhere may be inefficient at best and, at worst, may make an adequately resolved simulation impractical. Moreover, the location and resolution of fine grid required for an accurate solution is a dynamic property of a problem's transient features and may not be known a priori. Adaptive mesh refinement (AMR) is a technique that can be used with both structured and unstructured meshes to adjust local grid spacing dynamically to capture solution features with an appropriate degree of resolution. Thus, computational resources can be focused where and when they are needed most to efficiently achieve an accurate solution without incurring the cost of a globally-fine grid. Figure 1.1 shows two example computations using AMR; on the left is a structured mesh calculation of a impulsively-sheared contact surface and on the right is the fuselage and volume discretization of an RAH-66 Comanche helicopter [35]. Note the

  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. Global coordination: weighted voting

    Directory of Open Access Journals (Sweden)

    Jan-Erik Lane

    2014-03-01

    Full Text Available In order to halt the depletion of global ecological capital, a number of different kinds of meetings between Governments of countries in the world has been scheduled. The need for global coordination of environmental policies has become ever more obvious, supported by more and more evidence of the running down of ecological capital. But there are no formal or binding arrangements in sight, as global environmental coordination suffers from high transaction costs (qualitative voting. The CO2 equivalent emissions, resulting in global warming, are driven by the unstoppable economic expansion in the global market economy, employing mainly fossil fuel generated energy, although at the same time lifting sharply the GDP per capita of several emerging countries. Only global environmental coordination on the successful model of the World Band and the IMF (quantitative voting can stem the rising emissions numbers and stop further environmental degradation. However, the system of weighted voting in the WB and the IMF must be reformed by reducing the excessive voting power disparities, for instance by reducing all member country votes by the cube root expression.

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

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

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

  14. 多微网配电系统协调优化调度和经济运行研究%Research on coordinated optimal scheduling and economic operation of multi-microgrid distribution system

    Institute of Scientific and Technical Information of China (English)

    沈鑫; 曹敏; 周年荣; 张林山

    2016-01-01

    多微网系统由多个子微网构成,其控制策略较单微网系统更为复杂,针对多微网系统,提出了一种基于预测控制的多微网协调控制策略,根据微网的动态出力范围,考虑网损和负荷波动方差构建多目标优化函数,通过预测控制求得多微网协调因子的最优值,基于此最优值协调各微网之间的功率分配,从而维持整个微网电压和频率的稳定,并运用基于随机模拟的粒子群算法求解上层优化问题。仿真结果显示:基于多微网与电网合理的调度,可充分发挥微网“荷-源”双重特性的灵活调度,平滑负荷曲线并降低系统网损并可减轻负荷波动对电网影响以及可再生能源出力的不确定性。%A multi-microgrid system consists of several microgrid systems,which requires more complex control strategy than a single microgrid system.The paper presents a coordination control strategy for multi-microgrid sys-tem.According to the situation that multi-microgrid connects to the distribution network,a scheme of joint dispatc-hing model of multi-microgrid and distribution network was introduced.Based on the dynamic output range of the microgrid,the distribution network loss and the load fluctuation were considered in upper objective function.The particle swarm optimization based on stochastic simulation was applied to solve the upper optimization problem.For the purpose of giving full play to microgrid energy management of micro power sources,this paper treated microgrid reserve constraint as a chance constraint which has considered the effect of uncertain random variables.Monte Carlo simulation particle swarm optimization was applied to solve lower level problem.The results demonstrate that the joint dispatching strategy for multi-microgrid and distribution network can reduce the network loss and smooth the load curve by using the dispatching flexibility of microgrid “source-load”characteristics.At the

  15. Crystal structure refinement with SHELXL.

    Science.gov (United States)

    Sheldrick, George M

    2015-01-01

    The improvements in the crystal structure refinement program SHELXL have been closely coupled with the development and increasing importance of the CIF (Crystallographic Information Framework) format for validating and archiving crystal structures. An important simplification is that now only one file in CIF format (for convenience, referred to simply as `a CIF') containing embedded reflection data and SHELXL instructions is needed for a complete structure archive; the program SHREDCIF can be used to extract the .hkl and .ins files required for further refinement with SHELXL. Recent developments in SHELXL facilitate refinement against neutron diffraction data, the treatment of H atoms, the determination of absolute structure, the input of partial structure factors and the refinement of twinned and disordered structures. SHELXL is available free to academics for the Windows, Linux and Mac OS X operating systems, and is particularly suitable for multiple-core processors.

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

  17. Residency Applicants Prefer Online System for Scheduling Interviews

    Directory of Open Access Journals (Sweden)

    Wills, Charlotte

    2015-03-01

    Full Text Available Introduction: Residency coordinators may be overwhelmed when scheduling residency interviews. Applicants often have to coordinate interviews with multiple programs at once, and relying on verbal or email confirmation may delay the process. Our objective was to determine applicant mean time to schedule and satisfaction using online scheduling. Methods: This pilot study is a retrospective analysis performed on a sample of applicants offered interviews at an urban county emergency medicine residency. Applicants were asked their estimated time to schedule with the online system compared to their average time using other methods. In addition, they were asked on a five-point anchored scale to rate their satisfaction. Results: Of 171 applicants, 121 completed the survey (70.8%. Applicants were scheduling an average of 13.3 interviews. Applicants reported scheduling interviews using the online system in mean of 46.2 minutes (median 10, range 1-1800 from the interview offer as compared with a mean of 320.2 minutes (median 60, range 3-2880 for other programs not using this system. This difference was statistically significant. In addition, applicants were more likely to rate their satisfaction using the online system as “satisfied” (83.5% vs 16.5%. Applicants were also more likely to state that they preferred scheduling their interviews using the online system rather than the way other programs scheduled interviews (74.2% vs 4.1% and that the online system aided them coordinating travel arrangements (52.1% vs 4.1%. Conclusion: An online interview scheduling system is associated with higher satisfaction among applicants both in coordinating travel arrangements and in overall satisfaction. [West J Emerg Med. 2015;16(2:352-354.

  18. On Modal Refinement and Consistency

    DEFF Research Database (Denmark)

    Nyman, Ulrik; Larsen, Kim Guldstrand; Wasowski, Andrzej

    2007-01-01

    Almost 20 years after the original conception, we revisit several fundamental question about modal transition systems. First, we demonstrate the incompleteness of the standard modal refinement using a counterexample due to Hüttel. Deciding any refinement, complete with respect to the standard...... notions of implementation, is shown to be computationally hard (co-NP hard). Second, we consider four forms of consistency (existence of implementations) for modal specifications. We characterize each operationally, giving algorithms for deciding, and for synthesizing implementations, together...

  19. Modeling and Analysis of Scheduling for Distributed Real-time Embedded Systems

    Institute of Scientific and Technical Information of China (English)

    Hai-Tao Zhang; Gui-Fang Wu

    2010-01-01

    Aimed at the deficiencies of resources based time Petri nets(RBTPN)in doing scheduling analysis for distributed real-time embedded systems,the assemblage condition of complex scheduling sequences is presented to easily compute scheduling length and simplify scheduling analysis.Based on this,a new hierarchical RBTPN model is proposed.The model introduces the definition of transition border set,and represents it as an abstract transition.The abstract transition possesses all resources of the set,and has the highest priority of each resource;the execution time of abstract transition is the longest time of all possible scheduling sequences.According to the characteristics and assemblage condition of RBTPN,the refinement conditions of transition border set are given,and the conditions ensure the correction of scheduling analysis.As a result,it is easy for us to understand the scheduling model and perform scheduling analysis.

  20. LiveGantt: Interactively Visualizing a Large Manufacturing Schedule.

    Science.gov (United States)

    Jo, Jaemin; Huh, Jaeseok; Park, Jonghun; Kim, Bohyoung; Seo, Jinwook

    2014-12-01

    In this paper, we introduce LiveGantt as a novel interactive schedule visualization tool that helps users explore highly-concurrent large schedules from various perspectives. Although a Gantt chart is the most common approach to illustrate schedules, currently available Gantt chart visualization tools suffer from limited scalability and lack of interactions. LiveGantt is built with newly designed algorithms and interactions to improve conventional charts with better scalability, explorability, and reschedulability. It employs resource reordering and task aggregation to display the schedules in a scalable way. LiveGantt provides four coordinated views and filtering techniques to help users explore and interact with the schedules in more flexible ways. In addition, LiveGantt is equipped with an efficient rescheduler to allow users to instantaneously modify their schedules based on their scheduling experience in the fields. To assess the usefulness of the application of LiveGantt, we conducted a case study on manufacturing schedule data with four industrial engineering researchers. Participants not only grasped an overview of a schedule but also explored the schedule from multiple perspectives to make enhancements.

  1. A NEW APPROACH BASED ON SCHEDULING TECHNIQUE TO THE MULTI-ROBOT PATH PLANNING AND COORDINATION PROBLEM%基于总体势减小的动态调度技术解决多机器人的路径规划

    Institute of Scientific and Technical Information of China (English)

    顾国昌; 李亚波

    2001-01-01

    本文提出了一种解决多机器人路径规划与协调问题的新方法:基于总体势减小的优先级动态调度策略.文中引入了总体势的概念,机器人从起始点向目标点运动过程中,始终沿着总体势减小的方向进行,逐步引导机器人导航任务的完成.%The paper presents a new approach, which is called dynamic priority scheduling based on total potential reduction, to solving the multi-robot path planning and coordination problem. In this algorithm, the concept of total potential is introduced into this paper. Only if the motion of one robot will reduce the total potential, can the robot change its position through this feasible motion. Therefore, when robots are moving from their start points to goal points, the total potential is reduced gradually. The navigation tasks of multiple robots are accomplished in this way.

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

  3. Smart Manufacturing for the Oil Refining and Petrochemical Industry

    OpenAIRE

    Zhihong Yuan; Weizhong Qin; Jinsong Zhao

    2017-01-01

    Smart manufacturing will transform the oil refining and petrochemical sector into a connected, information-driven environment. Using real-time and high-value support systems, smart manufacturing enables a coordinated and performance-oriented manufacturing enterprise that responds quickly to customer demands and minimizes energy and material usage, while radically improving sustainability, productivity, innovation, and economic competitiveness. In this paper, several examples of the applicatio...

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

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

  6. TECHNICAL COORDINATION

    CERN Multimedia

    A. Ball

    Overview From a technical perspective, CMS has been in “beam operation” state since 6th November. The detector is fully closed with all components operational and the magnetic field is normally at the nominal 3.8T. The UXC cavern is normally closed with the radiation veto set. Access to UXC is now only possible during downtimes of LHC. Such accesses must be carefully planned, documented and carried out in agreement with CMS Technical Coordination, Experimental Area Management, LHC programme coordination and the CCC. Material flow in and out of UXC is now strictly controlled. Access to USC remains possible at any time, although, for safety reasons, it is necessary to register with the shift crew in the control room before going down.It is obligatory for all material leaving UXC to pass through the underground buffer zone for RP scanning, database entry and appropriate labeling for traceability. Technical coordination (notably Stephane Bally and Christoph Schaefer), the shift crew and run ...

  7. Deriving force field parameters for coordination complexes

    DEFF Research Database (Denmark)

    Norrby, Per-Ola; Brandt, Peter

    2001-01-01

    The process of deriving molecular mechanics force fields for coordination complexes is outlined. Force field basics are introduced with an emphasis on special requirements for metal complexes. The review is then focused on how to set up the initial model, define the target, refine the parameters,...

  8. Zone refining of plutonium metal

    Energy Technology Data Exchange (ETDEWEB)

    Blau, Michael S. [Univ. of Idaho, Moscow, ID (United States)

    1994-08-01

    The zone refining process was applied to Pu metal containing known amounts of impurities. Rod specimens of plutonium metal were melted into and contained in tantalum boats, each of which was passed horizontally through a three-turn, high-frequency coil in such a manner as to cause a narrow molten zone to pass through the Pu metal rod 10 times. The impurity elements Co, Cr, Fe, Ni, Np, U were found to move in the same direction as the molten zone as predicted by binary phase diagrams. The elements Al, Am, and Ga moved in the opposite direction of the molten zone as predicted by binary phase diagrams. As the impurity alloy was zone refined, {delta}-phase plutonium metal crystals were produced. The first few zone refining passes were more effective than each later pass because an oxide layer formed on the rod surface. There was no clear evidence of better impurity movement at the slower zone refining speed. Also, constant or variable coil power appeared to have no effect on impurity movement during a single run (10 passes). This experiment was the first step to developing a zone refining process for plutonium metal.

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

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

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

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

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

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

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

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

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

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

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

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

  1. Bauxite Mining and Alumina Refining

    Science.gov (United States)

    Frisch, Neale; Olney, David

    2014-01-01

    Objective: To describe bauxite mining and alumina refining processes and to outline the relevant physical, chemical, biological, ergonomic, and psychosocial health risks. Methods: Review article. Results: The most important risks relate to noise, ergonomics, trauma, and caustic soda splashes of the skin/eyes. Other risks of note relate to fatigue, heat, and solar ultraviolet and for some operations tropical diseases, venomous/dangerous animals, and remote locations. Exposures to bauxite dust, alumina dust, and caustic mist in contemporary best-practice bauxite mining and alumina refining operations have not been demonstrated to be associated with clinically significant decrements in lung function. Exposures to bauxite dust and alumina dust at such operations are also not associated with the incidence of cancer. Conclusions: A range of occupational health risks in bauxite mining and alumina refining require the maintenance of effective control measures. PMID:24806720

  2. Data refinement for true concurrency

    Directory of Open Access Journals (Sweden)

    Brijesh Dongol

    2013-05-01

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

  3. Pointing Refinement of SIRTF Images

    CERN Document Server

    Masci, F; Moshir, M; Shupe, D; Fowler, J W; Fowler, John W.

    2002-01-01

    The soon-to-be-launched Space Infrared Telescope Facility (SIRTF) shall produce image data with an a-posteriori pointing knowledge of 1.4 arcsec (1 sigma radial) with a goal of 1.2 arcsec in the International Celestial Reference System (ICRS). To perform robust image coaddition, mosaic generation, extraction and position determination of faint sources, the pointing will need to be refined to better than a few-tenths of an arcsecond. We use a linear-sparse matrix solver to find a "global-minimization" of all relative image offsets in a mosaic from which refined pointings and orientations can be computed. This paper summarizes the pointing-refinement algorithm and presents the results of testing on simulated data.

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

  5. Planning and Scheduling for Environmental Sensor Networks

    Science.gov (United States)

    Frank, J. D.

    2005-12-01

    resources and to reduce the costs of communication. Planning and scheduling is generally a heavy consumer of time, memory and energy resources. This means careful thought must be given to how much planning and scheduling should be done on the sensors themselves, and how much to do elsewhere. The difficulty of planning and scheduling is exacerbated when reasoning about uncertainty. More time, memory and energy is needed to solve such problems, leading either to more expensive sensors, or suboptimal plans. For example, scientifically interesting events may happen at random times, making it difficult to ensure that sufficient resources are availanble. Since uncertainty is usually lowest in proximity to the sensors themselves, this argues for planning and scheduling onboard the sensors. However, cost minimization dictates sensors be kept as simple as possible, reducing the amount of planning and scheduling they can do themselves. Furthermore, coordinating each sensor's independent plans can be difficult. In the full presentation, we will critically review the planning and scheduling systems used by previously fielded sensor networks. We do so primarily from the perspective of the computational sciences, with a focus on taming computational complexity when operating sensor networks. The case studies are derived from sensor networks based on UAVs, satellites, and planetary rovers. Planning and scheduling considerations include multi-sensor coordination, optimizing science value, onboard power management, onboard memory, planning movement actions to acquire data, and managing communications.These case studies offer lessons for future designs of environmental sensor networks.

  6. DSm Vector Spaces of Refined Labels

    CERN Document Server

    Kandasamy, W B Vasantha

    2011-01-01

    In this book the authors introduce the notion of DSm vector spaces of refined labels. They also realize the refined labels as a plane and a n-dimensional space. Further, using these refined labels, several algebraic structures are defined. Finally DSm semivector space or refined labels is described. Authors also propose some research problems.

  7. Refining Nodes and Edges of State Machines

    DEFF Research Database (Denmark)

    Hallerstede, Stefan; Snook, Colin

    2011-01-01

    State machines are hierarchical automata that are widely used to structure complex behavioural specifications. We develop two notions of refinement of state machines, node refinement and edge refinement. We compare the two notions by means of examples and argue that, by adopting simple convention...... refinement theory and UML-B state machine refinement influences the style of node refinement. Hence we propose a method with direct proof of state machine refinement avoiding the detour via Event-B that is needed by UML-B....

  8. Conformal refinement of unstructured quadrilateral meshes

    Energy Technology Data Exchange (ETDEWEB)

    Garmella, Rao [Los Alamos National Laboratory

    2009-01-01

    We present a multilevel adaptive refinement technique for unstructured quadrilateral meshes in which the mesh is kept conformal at all times. This means that the refined mesh, like the original, is formed of only quadrilateral elements that intersect strictly along edges or at vertices, i.e., vertices of one quadrilateral element do not lie in an edge of another quadrilateral. Elements are refined using templates based on 1:3 refinement of edges. We demonstrate that by careful design of the refinement and coarsening strategy, we can maintain high quality elements in the refined mesh. We demonstrate the method on a number of examples with dynamically changing refinement regions.

  9. Integrated scheduling and resource management. [for Space Station Information System

    Science.gov (United States)

    Ward, M. T.

    1987-01-01

    This paper examines the problem of integrated scheduling during the Space Station era. Scheduling for Space Station entails coordinating the support of many distributed users who are sharing common resources and pursuing individual and sometimes conflicting objectives. This paper compares the scheduling integration problems of current missions with those anticipated for the Space Station era. It examines the facilities and the proposed operations environment for Space Station. It concludes that the pattern of interdependecies among the users and facilities, which are the source of the integration problem is well structured, allowing a dividing of the larger problem into smaller problems. It proposes an architecture to support integrated scheduling by scheduling efficiently at local facilities as a function of dependencies with other facilities of the program. A prototype is described that is being developed to demonstrate this integration concept.

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

    Directory of Open Access Journals (Sweden)

    Peng-fei Zhang

    2014-05-01

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

  11. Refining analgesia strategies using lasers.

    Science.gov (United States)

    Hampshire, Victoria

    2015-08-01

    Sound programs for the humane care and use of animals within research facilities incorporate experimental refinements such as multimodal approaches for pain management. These approaches can include non-traditional strategies along with more established ones. The use of lasers for pain relief is growing in popularity among companion animal veterinary practitioners and technologists. Therefore, its application in the research sector warrants closer consideration.

  12. On Interaction Refinement in Middleware

    DEFF Research Database (Denmark)

    Truyen, Eddy; Jørgensen, Bo Nørregaard; Joosen, Wouter;

    2000-01-01

    components together. We have examined a reflective technique that improve the dynamics of this gluing process such that interaction between components can be refined at run-time. In this paper, we show how we have used this reflective technique to dynamically integrate into the architecture of middleware...

  13. RUN COORDINATION

    CERN Multimedia

    Christophe Delaere

    2012-01-01

      On Wednesday 14 March, the machine group successfully injected beams into LHC for the first time this year. Within 48 hours they managed to ramp the beams to 4 TeV and proceeded to squeeze to β*=0.6m, settings that are used routinely since then. This brought to an end the CMS Cosmic Run at ~Four Tesla (CRAFT), during which we collected 800k cosmic ray events with a track crossing the central Tracker. That sample has been since then topped up to two million, allowing further refinements of the Tracker Alignment. The LHC started delivering the first collisions on 5 April with two bunches colliding in CMS, giving a pile-up of ~27 interactions per crossing at the beginning of the fill. Since then the machine has increased the number of colliding bunches to reach 1380 bunches and peak instantaneous luminosities around 6.5E33 at the beginning of fills. The average bunch charges reached ~1.5E11 protons per bunch which results in an initial pile-up of ~30 interactions per crossing. During the ...

  14. Scalable Social Coordination using Enmeshed Queries

    CERN Document Server

    Chen, Jianjun; Varghese, George

    2012-01-01

    Social coordination allows users to move beyond awareness of their friends to efficiently coordinating physical activities with others. While specific forms of social coordination can be seen in tools such as Evite, Meetup and Groupon, we introduce a more general model using what we call {\\em enmeshed queries}. An enmeshed query allows users to declaratively specify an intent to coordinate by specifying social attributes such as the desired group size and who/what/when, and the database returns matching queries. Enmeshed queries are continuous, but new queries (and not data) answer older queries; the variable group size also makes enmeshed queries different from entangled queries, publish-subscribe systems, and dating services. We show that even offline group coordination using enmeshed queries is NP-hard. We then introduce efficient heuristics that use selective indices such as location and time to reduce the space of possible matches; we also add refinements such as delayed evaluation and using the relative...

  15. Defining Service Coordination: A Social Work Perspective.

    Science.gov (United States)

    Bunger, Alicia C

    2010-10-01

    To address fragmentation, social workers are encouraged to "coordinate." This pilot study explores the meaning of, and factors that facilitate or prevent "coordination" and is intended as a first step toward future conceptual refinement, theory development, and system interventions. Using data from treatment guidelines archived by the National Guideline Clearinghouse (n=9) and semi-structured interviews with social workers (n=4), themes related to the definition, indicators, and perceptions of coordination were explored using a grounded theory approach. Data suggest the need for coordination is driven by complex client needs, but the quality of providers' personal relationships influence coordination. Future research might examine the impact of standardization of roles, referral procedures, and treatment philosophies.

  16. TECHNICAL COORDINATION

    CERN Multimedia

    W. Zeuner and A. Ball

    2013-01-01

    LS1 overview In general the LS1 project is progressing well and the workflow is holding to the original December 2012 schedule within two–three weeks, acceptable at this stage, with about 400 work packages already completed. In particular, the critical logistic configuration planned for summer 2013, giving simultaneous access to both ends of the vacuum tank interior and the exterior, plus the YE1 nose zones, was achieved significantly before the deadline at the end of June. The safety awareness of all those working on the CMS detector is currently very satisfactory and the general atmosphere at Point 5 is good, despite many concurrent activities and inevitable last minute adjustments to the day-to-day planning. LS1 services infrastructure work The “once-in-ten years” maintenance of the water-cooling infrastructure has been completed successfully by EN department teams; underground circuits were available again from 12 June. In the shadow of this activity, consolidation and m...

  17. TECHNICAL COORDINATION

    CERN Document Server

    Austin Ball

    The 2008-9 CMS shutdown has reached its final phase. The yoke is closed again and the HFs are being prepared for lifting to beam height. Assuming no last minute problems occur, the detector will be ready for magnetic field tests by the end of June. The commitment of all the teams involved has ensured that an ambitious programme of work, including several tasks unforeseen in November 08, is nevertheless concluding on-time and successfully. All efforts are now being made to be ready for the CRAFT09 exercise. The way to proceed after CRAFT will depend on the LHC re-start schedule (to be clarified around the end of June). Options will be discussed during this CMS week. Shutdown 2008-9 Sub-Detectors As a reminder, the major shutdown activities on the detector components are listed below; details on each point can be found elsewhere in this bulletin. •    Installation and check-out of the Preshower detector on both endcaps •    Mainten...

  18. TECHNICAL COORDINATION

    CERN Multimedia

    A. Ball

    2010-01-01

    Operational Experience Since the closure of the detector in February, the technical operation of CMS has been quite smooth and reliable. Some minor interventions in UXC were required to cure failures of power supplies, fans, readout boards and rack cooling connections, but all these failures were repaired in scheduled technical stops or parasitically during access dedicated to fixing LHC technical problems. The only occasion when CMS had to request an access between fills was to search for the source of an alarm from the leak-detection cables mounted in the DT racks. After a few minutes of diagnostic search, a leaking air-purge was found. Replacement was complete within 2 hours. This incident demonstrated once more the value of these leak detection cables; the system will be further extended (during the end of year technical stop) to cover more racks in UXC and the floor beneath the detector. The magnet has also been operating reliably and reacted correctly to the 14s power cut on 29 May (see below). In or...

  19. RUN COORDINATION

    CERN Multimedia

    C. Delaere

    2012-01-01

      With the analysis of the first 5 fb–1 culminating in the announcement of the observation of a new particle with mass of around 126 GeV/c2, the CERN directorate decided to extend the LHC run until February 2013. This adds three months to the original schedule. Since then the LHC has continued to perform extremely well, and the total luminosity delivered so far this year is 22 fb–1. CMS also continues to perform excellently, recording data with efficiency higher than 95% for fills with the magnetic field at nominal value. The highest instantaneous luminosity achieved by LHC to date is 7.6x1033 cm–2s–1, which translates into 35 interactions per crossing. On the CMS side there has been a lot of work to handle these extreme conditions, such as a new DAQ computer farm and trigger menus to handle the pile-up, automation of recovery procedures to minimise the lost luminosity, better training for the shift crews, etc. We did suffer from a couple of infrastructure ...

  20. Coordination Capacity

    CERN Document Server

    Cuff, Paul; Cover, Thomas

    2009-01-01

    We develop elements of a theory of cooperation and coordination in networks. Rather than considering a communication network as a means of distributing information, or of reconstructing random processes at remote nodes, we ask what dependence can be established among the nodes given the communication constraints. Specifically, in a network with communication rates between the nodes, we ask what is the set of all achievable joint distributions p(x1, ..., xm) of actions at the nodes on the network. Several networks are solved, including arbitrarily large cascade networks. Distributed cooperation can be the solution to many problems such as distributed games, distributed control, and establishing mutual information bounds on the influence of one part of a physical system on another.

  1. Essays on refining markets and environmental policy

    Science.gov (United States)

    Oladunjoye, Olusegun Akintunde

    This thesis is comprised of three essays. The first two essays examine empirically the relationship between crude oil price and wholesale gasoline prices in the U.S. petroleum refining industry while the third essay determines the optimal combination of emissions tax and environmental research and development (ER&D) subsidy when firms organize ER&D either competitively or as a research joint venture (RJV). In the first essay, we estimate an error correction model to determine the effects of market structure on the speed of adjustment of wholesale gasoline prices, to crude oil price changes. The results indicate that market structure does not have a strong effect on the dynamics of price adjustment in the three regional markets examined. In the second essay, we allow for inventories to affect the relationship between crude oil and wholesale gasoline prices by allowing them to affect the probability of regime change in a Markov-switching model of the refining margin. We find that low gasoline inventory increases the probability of switching from the low margin regime to the high margin regime and also increases the probability of staying in the high margin regime. This is consistent with the predictions of the competitive storage theory. In the third essay, we extend the Industrial Organization R&D theory to the determination of optimal environmental policies. We find that RJV is socially desirable. In comparison to competitive ER&D, we suggest that regulators should encourage RJV with a lower emissions tax and higher subsidy as these will lead to the coordination of ER&D activities and eliminate duplication of efforts while firms internalize their technological spillover externality.

  2. Exploring Coordination Structures in Open Source Software Development

    NARCIS (Netherlands)

    Amrit, Chintan; Hegeman, J.H.; Hillegersberg, van Jos; Hillegersberg, van Jos; Harmsen, Frank; Amrit, Chintan; Geisberger, Eva; Keil, Patrick; Kuhrmann, Marco

    2007-01-01

    Coordination is difficult to achieve in a large globally distributed project setting. The problem is multiplied in open source software development projects, where most of the traditional means of coordination such as plans, system-level designs, schedules and defined process are not used. In order

  3. Refining Visually Detected Object poses

    DEFF Research Database (Denmark)

    Holm, Preben; Petersen, Henrik Gordon

    2010-01-01

    Automated industrial assembly today require that the 3D position and orientation (hereafter ''pose`) of the objects to be assembled are known precisely. Today this precision is mostly established by a dedicated mechanical object alignment system. However, such systems are often dedicated...... that enables direct assembly. Conventional vision systems and laser triangulation systems can locate randomly placed known objects (with 3D CAD models available) with some accuracy, but not necessarily a good enough accuracy. In this paper, we present a novel method for refining the pose accuracy of an object...... that has been located based on the appearance as detected by a monocular camera. We illustrate the quality of our refinement method experimentally....

  4. A Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection

    Institute of Scientific and Technical Information of China (English)

    LinBo Zhang

    2009-01-01

    Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid (http: //lsec. cc. ac. cn/phg/J, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simultaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the bisectioning refinement procedure.AMS subject classifications: 65Y05, 65N50

  5. Iterative Goal Refinement for Robotics

    Science.gov (United States)

    2014-06-01

    Iterative Goal Refinement for Robotics Mark Roberts1, Swaroop Vattam1, Ronald Alford2, Bryan Auslander3, Justin Karneeb3, Matthew Molineaux3... robotics researchers and practitioners. We present a goal lifecycle and define a formal model for GR that (1) relates distinct disciplines concerning...researchers to collaborate in exploring this exciting frontier. 1. Introduction Robotic systems often act using incomplete models in environments

  6. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-01-01

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

  7. Model Migration Schedules

    OpenAIRE

    1981-01-01

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

  8. Personnel Scheduling in Laboratories

    NARCIS (Netherlands)

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

    2003-01-01

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

  9. Round Robin Schedules.

    Science.gov (United States)

    Iannone, Michael A.

    1983-01-01

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

  10. Harmonious personnel scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  11. Harmonious personnel scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  12. RUN COORDINATION

    CERN Multimedia

    C. Delaere

    2013-01-01

    Since the LHC ceased operations in February, a lot has been going on at Point 5, and Run Coordination continues to monitor closely the advance of maintenance and upgrade activities. In the last months, the Pixel detector was extracted and is now stored in the pixel lab in SX5; the beam pipe has been removed and ME1/1 removal has started. We regained access to the vactank and some work on the RBX of HB has started. Since mid-June, electricity and cooling are back in S1 and S2, allowing us to turn equipment back on, at least during the day. 24/7 shifts are not foreseen in the next weeks, and safety tours are mandatory to keep equipment on overnight, but re-commissioning activities are slowly being resumed. Given the (slight) delays accumulated in LS1, it was decided to merge the two global runs initially foreseen into a single exercise during the week of 4 November 2013. The aim of the global run is to check that we can run (parts of) CMS after several months switched off, with the new VME PCs installed, th...

  13. Scheduler for monitoring objects orbiting earth using satellite-based telescopes

    Energy Technology Data Exchange (ETDEWEB)

    Olivier, Scot S; Pertica, Alexander J; Riot, Vincent J; De Vries, Willem H; Bauman, Brian J; Nikolaev, Sergei; Henderson, John R; Phillion, Donald W

    2015-04-28

    An ephemeris refinement system includes satellites with imaging devices in earth orbit to make observations of space-based objects ("target objects") and a ground-based controller that controls the scheduling of the satellites to make the observations of the target objects and refines orbital models of the target objects. The ground-based controller determines when the target objects of interest will be near enough to a satellite for that satellite to collect an image of the target object based on an initial orbital model for the target objects. The ground-based controller directs the schedules to be uploaded to the satellites, and the satellites make observations as scheduled and download the observations to the ground-based controller. The ground-based controller then refines the initial orbital models of the target objects based on the locations of the target objects that are derived from the observations.

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

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

    Science.gov (United States)

    1993-09-01

    refinement of DISASTERTm. We can expect that the management of the constraints in USAF operations will contribute to future success in executing our global...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations ...Assignment Rules," Journal of Operations Management , 5: 27-39 (November 1984). Reynolds, Daniel E., Professor, Air Force Institute of Technology

  16. Does location matter for a scheduling department? A longitudinal case study on the effects of relocating the schedulers

    NARCIS (Netherlands)

    De Snoo, C.; Van Wezel, W.; Wortmann, J. C.

    2011-01-01

    Purpose - The purpose of this paper is to explore the importance of physical proximity between schedulers and operators within manufacturing firms. In literature, a small distance between interdependent employees is assumed to be a prerequisite for a high level of coordination. This study

  17. Does location matter for a scheduling department? A longitudinal case study on the effects of relocating the schedulers

    NARCIS (Netherlands)

    De Snoo, C.; Van Wezel, W.; Wortmann, J. C.

    2011-01-01

    Purpose - The purpose of this paper is to explore the importance of physical proximity between schedulers and operators within manufacturing firms. In literature, a small distance between interdependent employees is assumed to be a prerequisite for a high level of coordination. This study investigat

  18. The Refined Function-Behaviour-Structure Framework

    NARCIS (Netherlands)

    Diertens, B.

    2013-01-01

    We refine the function-behaviour-structure framework for design introduced by John Gero in order to deal with complexity. We do this by connecting the frameworks for the desing of two models, one the refinement of the other. The result is a refined framework for the design of an object on two levels

  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. Grain Refinement of Deoxidized Copper

    Science.gov (United States)

    Balart, María José; Patel, Jayesh B.; Gao, Feng; Fan, Zhongyun

    2016-10-01

    This study reports the current status of grain refinement of copper accompanied in particular by a critical appraisal of grain refinement of phosphorus-deoxidized, high residual P (DHP) copper microalloyed with 150 ppm Ag. Some deviations exist in terms of the growth restriction factor ( Q) framework, on the basis of empirical evidence reported in the literature for grain size measurements of copper with individual additions of 0.05, 0.1, and 0.5 wt pct of Mo, In, Sn, Bi, Sb, Pb, and Se, cast under a protective atmosphere of pure Ar and water quenching. The columnar-to-equiaxed transition (CET) has been observed in copper, with an individual addition of 0.4B and with combined additions of 0.4Zr-0.04P and 0.4Zr-0.04P-0.015Ag and, in a previous study, with combined additions of 0.1Ag-0.069P (in wt pct). CETs in these B- and Zr-treated casts have been ascribed to changes in the morphology and chemistry of particles, concurrently in association with free solute type and availability. No further grain-refining action was observed due to microalloying additions of B, Mg, Ca, Zr, Ti, Mn, In, Fe, and Zn (~0.1 wt pct) with respect to DHP-Cu microalloyed with Ag, and therefore are no longer relevant for the casting conditions studied. The critical microalloying element for grain size control in deoxidized copper and in particular DHP-Cu is Ag.

  1. Inflation in a refined racetrack

    CERN Document Server

    Wen, Wen-Yu

    2007-01-01

    In this note, we refine the racetrack inflation model constructed in arXiv:hep-th/0406230 by including the open string modulus. This modulus encodes the embedding of our braneworld inside some Calabi-Yau throat. We argue that in generic this open string modulus dynamically runs with the inflaton field thanks to its nonlinear coupling. A full analysis becomes difficult because the scalar potential changes progressively during the inflation epoch. Nevertheless, by explicit construction we are still able to build a realistic model through appropriate choices of the initial conditions.

  2. The Single And Multi Project Approach To Planning And Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas

    2008-01-01

    with the challenging coordination of the work of several actors. The project planning and scheduling should, from the subcontractor’s perspective, allow for scope and flexibility so that the subcontractor can reallocate its resources at will between its ongoing projects and thereby optimise its own production. However......, reallocations of subcontracting resources lead to project interruptions which counteract on the overall productivity of the single construction project. Thus, there is a planning and scheduling conflict between the operational multi project management of the subcontracting firm and the management of single...... projects carried out by the management on site. This paper explains the single and multi project perspective on construction planning and scheduling represented by the main and the subcontractors and further, it describes how the prevailing scheduling method of today, i.e. the critical path method, conduce...

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

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

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

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

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

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

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

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

  11. Motor coordination: a local hub for coordination.

    Science.gov (United States)

    Calabrese, Ronald L

    2014-03-31

    A local interneuron of a crayfish central pattern generator serves as a hub that integrates ascending and descending coordinating information and passes it on to a local oscillatory microcircuit to coordinate a series of segmental appendages known as swimmerets.

  12. Rotary impeller refinement of 7075Al alloy

    Institute of Scientific and Technical Information of China (English)

    WANG Liping; GUO Erjun; HUANG Yongchang; LU Bin

    2009-01-01

    The effects of four parameters, gas flow, rotational speed, refining time, and stewing time, on the rotary impeller refinement of 7075 Al were studied. The effects of C2Cl6refining, rotary impeller refuting, and composite refining of 7075 AI alloy were compared with each other. The results showed that the greatest impact parameter of rotary impeller refinement was rotational speed, followed by gas flow, refining time, and stewing time. The optimum purification parameters obtained by orthogonal analysis were as follows: rotor speed of 400 r/min, inert gas flow of 0.4 mL/h, refining time of 15 min, and stewing time of 6 min. The best degassing effect can be obtained by the composite refuting of C2Cl6 and rotary impeller. The degassing rate of C2Cl6 rotary impeller, and composite refining was 34.5%, 69.2%, and 78%, respectively. The mechanical properties of the specimen refined by rotary impeller were higher than those by C2C16 refining, but lower than those by composite refining.

  13. Zone refining of plutonium metal

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-05-01

    The purpose of this study was to investigate zone refining techniques for the purification of plutonium metal. The redistribution of 10 impurity elements from zone melting was examined. Four tantalum boats were loaded with plutonium impurity alloy, placed in a vacuum furnace, heated to 700{degrees}C, and held at temperature for one hour. Ten passes were made with each boat. Metallographic and chemical analyses performed on the plutonium rods showed that, after 10 passes, moderate movement of certain elements were achieved. Molten zone speeds of 1 or 2 inches per hour had no effect on impurity element movement. Likewise, the application of constant or variable power had no effect on impurity movement. The study implies that development of a zone refining process to purify plutonium is feasible. Development of a process will be hampered by two factors: (1) the effect on impurity element redistribution of the oxide layer formed on the exposed surface of the material is not understood, and (2) the tantalum container material is not inert in the presence of plutonium. Cold boat studies are planned, with higher temperature and vacuum levels, to determine the effect on these factors. 5 refs., 1 tab., 5 figs.

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

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

  16. The evolution of coordinated vocalizations before language.

    Science.gov (United States)

    Bryant, Gregory A

    2014-12-01

    Ackermann et al. briefly point out the potential significance of coordinated vocal behavior in the dual pathway model of acoustic communication. Rhythmically entrained and articulated pre-linguistic vocal activity in early hominins might have set the evolutionary stage for later refinements that manifest in modern humans as language-based conversational turn-taking, joint music-making, and other behaviors associated with prosociality.

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

  18. Adaptive mesh refinement in titanium

    Energy Technology Data Exchange (ETDEWEB)

    Colella, Phillip; Wen, Tong

    2005-01-21

    In this paper, we evaluate Titanium's usability as a high-level parallel programming language through a case study, where we implement a subset of Chombo's functionality in Titanium. Chombo is a software package applying the Adaptive Mesh Refinement methodology to numerical Partial Differential Equations at the production level. In Chombo, the library approach is used to parallel programming (C++ and Fortran, with MPI), whereas Titanium is a Java dialect designed for high-performance scientific computing. The performance of our implementation is studied and compared with that of Chombo in solving Poisson's equation based on two grid configurations from a real application. Also provided are the counts of lines of code from both sides.

  19. Algorithm refinement for fluctuating hydrodynamics

    Energy Technology Data Exchange (ETDEWEB)

    Williams, Sarah A.; Bell, John B.; Garcia, Alejandro L.

    2007-07-03

    This paper introduces an adaptive mesh and algorithmrefinement method for fluctuating hydrodynamics. This particle-continuumhybrid simulates the dynamics of a compressible fluid with thermalfluctuations. The particle algorithm is direct simulation Monte Carlo(DSMC), a molecular-level scheme based on the Boltzmann equation. Thecontinuum algorithm is based on the Landau-Lifshitz Navier-Stokes (LLNS)equations, which incorporate thermal fluctuations into macroscopichydrodynamics by using stochastic fluxes. It uses a recently-developedsolver for LLNS, based on third-order Runge-Kutta. We present numericaltests of systems in and out of equilibrium, including time-dependentsystems, and demonstrate dynamic adaptive refinement by the computationof a moving shock wave. Mean system behavior and second moment statisticsof our simulations match theoretical values and benchmarks well. We findthat particular attention should be paid to the spectrum of the flux atthe interface between the particle and continuum methods, specificallyfor the non-hydrodynamic (kinetic) time scales.

  20. SILICON REFINING BY VACUUM TREATMENT

    Directory of Open Access Journals (Sweden)

    André Alexandrino Lotto

    2014-12-01

    Full Text Available This work aims to investigate the phosphorus removal by vacuum from metallurgical grade silicon (MGSi (98.5% to 99% Si. Melting experiments were carried out in a vacuum induction furnace, varying parameters such as temperature, time and relation area exposed to the vacuum / volume of molten silicon. The results of chemical analysis were obtained by inductively coupled plasma (ICP, and evaluated based on thermodynamic and kinetic aspects of the reaction of vaporization of the phosphorus in the silicon. The phosphorus was decreased from 33 to approximately 1.5 ppm after three hours of vacuum treatment, concluding that the evaporation step is the controlling step of the process for parameters of temperature, pressure and agitation used and refining by this process is technically feasible.

  1. SCHEDULING PROBLEMS-AN OVERVIEW

    Institute of Scientific and Technical Information of China (English)

    Asmuliardi MULUK; Hasan AKPOLAT; Jichao XU

    2003-01-01

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

  2. On-orbit Geometric Parameters Refinement of Mapping Satellite-1 Triple Line Array Camera

    Directory of Open Access Journals (Sweden)

    GENG Hongyi

    2016-03-01

    Full Text Available To find the model and method of on-orbit geometric refinement suitable for the triple line array camera of Mapping Satellite-1, this paper first analyzed the impact of the exterior orientation line element error on the geometric parameters refinement, then eliminated the high-frequency noise by the preprocessing of the attitude data, and compensated the low-frequency flutter of satellite platform in the course of flying by sine function and designed the constant angular error model for the lens of the triple line array camera. In addition, an interior orientation model, using directly pixel coordinates as observations, was constructed based on conventional additional parameter model and the combination of the best refinement model parameters and the solution strategy were determined by the unilateral control extrapolative location. The experiments show that the planar accuracy and vertical accuracy are about 1 GSD and 0.8 GSD by the proposed refinement plan and the rational distribution of GCPS.

  3. Optimal Power Scheduling for an Islanded Hybrid Microgrid

    DEFF Research Database (Denmark)

    Hernández, Adriana Carolina Luna; Aldana, Nelson Leonardo Diaz; Savaghebi, Mehdi

    2016-01-01

    A microgrid is a system that integrates energy generation, energy storage, and loads and it is able to operate either in interconnected or islanded mode. Energy resources should be scheduled to supply the load properly in order to coordinate optimally the power exchange within the microgrid...... according to a defined objective function. In this paper, an optimal power scheduling for generation and demand side is presented to manage an islanded hybrid PV-wind-battery microgrid implemented in Shanghai-China. The optimization is addressed through a Mixed-Integer Linear Programming (MILP) mathematical......SPACE1006) in which a scaled down model of this microgrid is emulated....

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

  5. Zone refining of cadmium and related characterization

    Indian Academy of Sciences (India)

    N R Munirathnam; D S Prasad; Ch Sudheer; J V Rao; T L Prakash

    2005-06-01

    We present the zone refining results of cadmium using horizontal resistive zone refiner under constant flow of moisture free hydrogen gas. The boron impurity in cadmium can be avoided using quartz (GE 214 grade) boat in lieu of high pure graphite boat. The analytical results using inductively coupled plasma optical emission spectrometry (ICPOES) show that majority of the impurities are less than the detection limits. Comparatively, zinc is the most difficult impurity element to remove in cadmium matrix by zone refining.

  6. Refined curve counting on complex surfaces

    OpenAIRE

    Göttsche, Lothar; Shende, Vivek

    2012-01-01

    We define refined invariants which "count" nodal curves in sufficiently ample linear systems on surfaces, conjecture that their generating function is multiplicative, and conjecture explicit formulas in the case of K3 and abelian surfaces. We also give a refinement of the Caporaso-Harris recursion, and conjecture that it produces the same invariants in the sufficiently ample setting. The refined recursion specializes at y = -1 to the Itenberg-Kharlamov-Shustin recursion for Welschinger invari...

  7. Cyclic delivery scheduling to customers with different priorities

    Directory of Open Access Journals (Sweden)

    Katarzyna Zofia Gdowska

    2013-12-01

    Full Text Available Background: In this paper a cyclic delivery scheduling problem for customers with different priorities is presented. Shops, which are provided with deliveries, are occasionally located in places which are crucial for the proper flow of traffic. In such places coordination of deliveries is crucial; therefore it allows to completely eliminate the phenomenon of the simultaneous arrivals of suppliers. Methods: In this paper the cyclic delivery scheduling problem for customers with different priorities was presented. To this theoretical problem a mix integer programming model was developed. Specific approach to the cyclic delivery scheduling problem is inspired by timetabling problem for urban public transport. Results: Mixed integer programming model was employed for solving four cases of cyclic delivery scheduling problem for customers with different priorities. When the value of the synchronization priority assigned to a single customer raised then the total number of synchronizations in the whole network decreased. In order to compare solutions a synchronization rate was utilized. A simple factor was utilized - the proportion of number of synchronizations of deliveries to a given customer to the total number of synchronizations obtained for the whole network. When the value of synchronization priority raised then the value of synchronization rate of this customer improved significantly. Conclusions: The mixed integer programming model for the cyclic delivery scheduling problem for customers with different priorities presented in this paper can be utilized for generating schedules of serving customers located in places where only one delivery can be received and unloaded at one go and where there is no space for other suppliers to wait in a queue. Such a schedule can be very useful for organizing deliveries to small shops united in a franchising network, since they operate in a way that is very similar to the network presented in this paper

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

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

  10. Limitations of Radar Coordinates

    OpenAIRE

    Bini, Donato; Lusanna, Luca; Mashhoon, Bahram

    2004-01-01

    The construction of a radar coordinate system about the world line of an observer is discussed. Radar coordinates for a hyperbolic observer as well as a uniformly rotating observer are described in detail. The utility of the notion of radar distance and the admissibility of radar coordinates are investigated. Our results provide a critical assessment of the physical significance of radar coordinates.

  11. Multi-Objective Coordinated Scheduling of Electric Vehicles and Renewable Generation Based on Improved Chemical Reaction Optimization Algorithm%基于改进化学反应优化算法的电动汽车与可再生能源多目标协同调度

    Institute of Scientific and Technical Information of China (English)

    张智晟; 温令云; 李国; 张伟

    2014-01-01

    To mitigate the impact of fluctuation of renewable generation output on power grid and accelerate the population of electric vehicles (EV), taking the minimized output fluctuation of renewable generation and the maximized income of EV users as objective function and considering the constraints of the electricity quantity stored in the battery, the charging/discharging power and the charging/discharging times, a multi-objective coordinated scheduling model, in which the grid-connectible EV, wind power generation system and photovoltaic (PV) generation system are taken into account simultaneously, is established. A virtual ideal molecular based multi-objective improved chemical reaction optimization algorithm(CROA) is proposed, and the established model is solved by the proposed algorithm. In allusion to such defects of CROA as slow convergence and low accuracy, the update mode of particle swarm optimization algorithm is integrated with the improved CROA. Results of calculation example show that through reasonably arranging the charging/discharging of EV, the output fluctuation of renewable generation can be effectively suppressed and the income of EV users can be increased. Comparison results show that the virtual ideal molecular based improved multi-objective CROA possesses strong searching ability.%为减小可再生能源出力波动对电网的影响以及加快电动汽车的普及速率,以最小化可再生能源的出力波动和最大化电动汽车用户收益为目标函数,计及电池储存电量约束、充放电功率约束和充放电次数约束等条件,建立了同时计及可入网电动汽车、风力发电和光伏发电系统的多目标协同调度模型。提出了基于虚拟理想分子的多目标改进化学反应优化算法(chemical reaction optimization algorithm , CROA),并用该算法对模型进行了求解,针对化学反应算法收敛速度慢、精度低的缺陷,在算法中融入了粒子群优化算法的更

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

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

  14. Scheduling the powering tests

    CERN Document Server

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

    2008-01-01

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

  15. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

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

  16. Visually Exploring Transportation Schedules.

    Science.gov (United States)

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

    2016-01-01

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

  17. Global Optimization of Nonlinear Blend-Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Pedro A. Castillo Castillo

    2017-04-01

    Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.

  18. Model Checking Linearizability via Refinement

    Science.gov (United States)

    Liu, Yang; Chen, Wei; Liu, Yanhong A.; Sun, Jun

    Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires checking that 1) all executions of concurrent operations be serializable, and 2) the serialized executions be correct with respect to the sequential semantics. This paper describes a new method to automatically check linearizability based on refinement relations from abstract specifications to concrete implementations. Our method avoids the often difficult task of determining linearization points in implementations, but can also take advantage of linearization points if they are given. The method exploits model checking of finite state systems specified as concurrent processes with shared variables. Partial order reduction is used to effectively reduce the search space. The approach is built into a toolset that supports a rich set of concurrent operators. The tool has been used to automatically check a variety of implementations of concurrent objects, including the first algorithms for the mailbox problem and scalable NonZero indicators. Our system was able to find all known and injected bugs in these implementations.

  19. Collaborative Supply Chain Planning and Coordination

    DEFF Research Database (Denmark)

    Wong, Chee Yew

    This thesis contains main results from an industrial PhD research in the areas of supply chain strategy, planning, and coordination. It applies the concepts of responsiveness and coordination to reduce mismatch of supply and demand, especially for a volatile and seasonal supply chain. It involves...... products, differentiating retailers, accurate response (with forecast adjustment and premature replenishment), quick response (order-penetration-point relocation and lead-time reduction). These analyses extend the Fisher Model of responsiveness and refine six propositions or principles of responsiveness....... The thesis further explains the multi-characteristics of seasonal products in their life cycles and concludes an integrated framework of responsiveness. For coordination issue, the thesis develops a new bullwhip measure, and then quantifies and explains bullwhip effects in the toy supply chain. It also...

  20. Refinement Checking on Parametric Modal Transition Systems

    DEFF Research Database (Denmark)

    Benes, Nikola; Kretínsky, Jan; Larsen, Kim Guldstrand

    2015-01-01

    Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refin...

  1. Refined large N duality for torus knots

    DEFF Research Database (Denmark)

    Nawata, Satoshi; Kameyama, Masaya

    We formulate large N duality of U(N) refined Chern-Simons theory with a torus knot/link in S³. By studying refined BPS states in M-theory, we provide the explicit form of low-energy effective actions of Type IIA string theory with D4-branes on the Ω-background. This form enables us to relate...

  2. Refinement Checking on Parametric Modal Transition Systems

    DEFF Research Database (Denmark)

    Benes, Nikola; Kretínsky, Jan; Larsen, Kim Guldstrand

    2015-01-01

    Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refin...

  3. Refined Black Hole Ensembles and Topological Strings

    CERN Document Server

    Aganagic, Mina

    2012-01-01

    We formulate a refined version of the Ooguri-Strominger-Vafa (OSV) conjecture. The OSV conjecture that Z_{BH} = |Z_{top}|^2 relates the BPS black hole partition function to the topological string partition function Z_{top}. In the refined conjecture, Z_{BH} is the partition function of BPS black holes counted with spin, or more precisely the protected spin character. Z_{top} becomes the partition function of the refined topological string, which is itself an index. Both the original and the refined conjecture are examples of large N duality in the 't Hooft sense. The refined conjecture applies to non-compact Calabi-Yau manifolds only, so the black holes are really BPS particles with large entropy, of order N^2. The refined OSV conjecture states that the refined BPS partition function has a large N dual which is captured by the refined topological string. We provide evidence that the conjecture holds by studying local Calabi-Yau threefolds consisting of line bundles over a genus g Riemann surface. We show that...

  4. Refined large N duality for torus knots

    DEFF Research Database (Denmark)

    Nawata, Satoshi; Kameyama, Masaya

    We formulate large N duality of U(N) refined Chern-Simons theory with a torus knot/link in S³. By studying refined BPS states in M-theory, we provide the explicit form of low-energy effective actions of Type IIA string theory with D4-branes on the Ω-background. This form enables us to relate...

  5. China Becomes Globe's Second Largest Oil Refiner

    Institute of Scientific and Technical Information of China (English)

    Zhang Weijun

    2010-01-01

    @@ China's refining capacity of crude oil reached 477 million tons by the end of last year,ranking the second in the world.CNPC and Sinopec now own 27 percent of the country's oil refineries with a combined refining capacity amounting to 76 percent of the country's total.As the country's biggest oil refiner,Sinopec's refining ability has increased 72.8 percent in the past ten years with a growth rate of 6.3 percent per year,ranking the third in the world,according to statistics released by Sinopec.Meanwhile,China's local oil refining enterprises' total capacity has reached 88 million tons per year.According to Sinopec,China has built 17 ten-million-ton-oil refineries which amount to half of the country's total capacity.

  6. Protein structure refinement of CASP target proteins using GNEIMO torsional dynamics method.

    Science.gov (United States)

    Larsen, Adrien B; Wagner, Jeffrey R; Jain, Abhinandan; Vaidehi, Nagarajan

    2014-02-24

    A longstanding challenge in using computational methods for protein structure prediction is the refinement of low-resolution structural models derived from comparative modeling methods into highly accurate atomistic models useful for detailed structural studies. Previously, we have developed and demonstrated the utility of the internal coordinate molecular dynamics (MD) technique, generalized Newton-Euler inverse mass operator (GNEIMO), for refinement of small proteins. Using GNEIMO, the high-frequency degrees of freedom are frozen and the protein is modeled as a collection of rigid clusters connected by torsional hinges. This physical model allows larger integration time steps and focuses the conformational search in the low frequency torsional degrees of freedom. Here, we have applied GNEIMO with temperature replica exchange to refine low-resolution protein models of 30 proteins taken from the continuous assessment of structure prediction (CASP) competition. We have shown that GNEIMO torsional MD method leads to refinement of up to 1.3 Å in the root-mean-square deviation in coordinates for 30 CASP target proteins without using any experimental data as restraints in performing the GNEIMO simulations. This is in contrast with the unconstrained all-atom Cartesian MD method performed under the same conditions, where refinement requires the use of restraints during the simulations.

  7. North Dakota Refining Capacity Study

    Energy Technology Data Exchange (ETDEWEB)

    Dennis Hill; Kurt Swenson; Carl Tuura; Jim Simon; Robert Vermette; Gilberto Marcha; Steve Kelly; David Wells; Ed Palmer; Kuo Yu; Tram Nguyen; Juliam Migliavacca

    2011-01-05

    According to a 2008 report issued by the United States Geological Survey, North Dakota and Montana have an estimated 3.0 to 4.3 billion barrels of undiscovered, technically recoverable oil in an area known as the Bakken Formation. With the size and remoteness of the discovery, the question became 'can a business case be made for increasing refining capacity in North Dakota?' And, if so what is the impact to existing players in the region. To answer the question, a study committee comprised of leaders in the region's petroleum industry were brought together to define the scope of the study, hire a consulting firm and oversee the study. The study committee met frequently to provide input on the findings and modify the course of the study, as needed. The study concluded that the Petroleum Area Defense District II (PADD II) has an oversupply of gasoline. With that in mind, a niche market, naphtha, was identified. Naphtha is used as a diluent used for pipelining the bitumen (heavy crude) from Canada to crude markets. The study predicted there will continue to be an increase in the demand for naphtha through 2030. The study estimated the optimal configuration for the refinery at 34,000 barrels per day (BPD) producing 15,000 BPD of naphtha and a 52 percent refinery charge for jet and diesel yield. The financial modeling assumed the sponsor of a refinery would invest its own capital to pay for construction costs. With this assumption, the internal rate of return is 9.2 percent which is not sufficient to attract traditional investment given the risk factor of the project. With that in mind, those interested in pursuing this niche market will need to identify incentives to improve the rate of return.

  8. The Effectiveness of Block Scheduling.

    Science.gov (United States)

    Creamean, Sharon Lightle; Horvath, Robert Jeffery

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

  9. Nontraditional work schedules for pharmacists.

    Science.gov (United States)

    Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

    2008-11-15

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

  10. Synchronizing production and air transportation scheduling using mathematical programming models

    Science.gov (United States)

    Zandieh, M.; Molla-Alizadeh-Zavardehi, S.

    2009-08-01

    Traditional scheduling problems assume that there are always infinitely many resources for delivering finished jobs to their destinations, and no time is needed for their transportation, so that finished products can be transported to customers without delay. So, for coordination of these two different activities in the implementation of a supply chain solution, we studied the problem of synchronizing production and air transportation scheduling using mathematical programming models. The overall problem is decomposed into two sub-problems, which consists of air transportation allocation problem and a single machine scheduling problem which they are considered together. We have taken into consideration different constraints and assumptions in our modeling such as special flights, delivery tardiness and no delivery tardiness. For these purposes, a variety of models have been proposed to minimize supply chain total cost which encompass transportation, makespan, delivery earliness tardiness and departure time earliness tardiness costs.

  11. Astronaut Office Scheduling System Software

    Science.gov (United States)

    Brown, Estevancio

    2010-01-01

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

  12. Probabilistic Anonymity and Admissible Schedulers

    CERN Document Server

    Garcia, Flavio D; Sokolova, Ana

    2007-01-01

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

  13. Coordinated discharge of a collection of batteries

    Energy Technology Data Exchange (ETDEWEB)

    Sastry, Shivakumar; Gimdogmus, Omer; Hartley, Tom T.; Veillette, Robert J. [Department of Electrical and Computer Engineering, The University of Akron, Akron, OH 44325-3904 (United States)

    2007-03-30

    Collections of batteries are used to supply energy to a variety of applications. By utilizing the energy in such a collection efficiently, we can improve the lifetime over which energy can be supplied to the application. We say that the discharge of a collection of batteries is coordinated when, at the end of discharge, the difference in the remaining capacity of individual batteries is small. This paper presents a decision-maker based on a goal-seeking formulation that coordinates the discharge of a collection of batteries. This formulation allows us to use a simple battery model and simple decision-making algorithms. We present results from MATLAB simulations that demonstrate the performance of the decision-maker when energy is drawn out of the collection in three different discharge scenarios. The new decision-maker consistently improves the discharge efficiency obtained using scheduling methods. Our results show that when the discharge is coordinated, the lifetime of the collection is extended. (author)

  14. Integrating and scheduling an open set of static analyses

    DEFF Research Database (Denmark)

    Eichberg, Michael; Mezini, Mira; Kloppenburg, Sven

    2006-01-01

    to keep the set of analyses open. We propose an approach to integrating and scheduling an open set of static analyses which decouples the individual analyses and coordinates the analysis executions such that the overall time and space consumption is minimized. The approach has been implemented...... for the Eclipse IDE and has been used to integrate a wide range of analyses such as finding bug patterns, detecting violations of design guidelines, or type system extensions for Java....

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

  16. Grain refinement of AZ31 magnesium alloy by electromagnetic stirring under effect of grain-refiner

    Indian Academy of Sciences (India)

    S Y Gao; Q C Le; Z Q Zhang; J Z Cui

    2012-08-01

    The effects of electromagnetic stirring and Al4C3 grain refiner on the grain refinement of semicontinuously cast AZ31 magnesium alloy were discussed in this investigation. The results indicate that electromagnetic stirring has an effective refining effect on the grain size of AZ31 magnesium alloy under the effect of Al4C3 grain refiner. Electromagnetic stirring can `activate’ the Al4C3 particles, resulting in more heterogeneous nucleation sites for the primary -Mg grains. But, longer holding time can `deactivate’ the Al4C3 particles and poison the grain refining effect.

  17. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

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

  18. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

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

  19. 76 FR 18622 - Notice of Submission Deadline for Schedule Information for O'Hare International Airport, John F...

    Science.gov (United States)

    2011-04-04

    ... Airport (ORD), New York's John F. Kennedy International Airport (JFK), and Newark Liberty International... INFORMATION: The FAA has designated ORD as an IATA Level 2, Schedules Facilitated Airport, and JFK and EWR as Level 3, Coordinated Airports. Scheduled operations at JFK and EWR are limited by the FAA ] Orders,...

  20. Refinement for Probabilistic Systems with Nondeterminism

    Directory of Open Access Journals (Sweden)

    David Streader

    2011-06-01

    Full Text Available Before we combine actions and probabilities two very obvious questions should be asked. Firstly, what does "the probability of an action" mean? Secondly, how does probability interact with nondeterminism? Neither question has a single universally agreed upon answer but by considering these questions at the outset we build a novel and hopefully intuitive probabilistic event-based formalism. In previous work we have characterised refinement via the notion of testing. Basically, if one system passes all the tests that another system passes (and maybe more we say the first system is a refinement of the second. This is, in our view, an important way of characterising refinement, via the question "what sort of refinement should I be using?" We use testing in this paper as the basis for our refinement. We develop tests for probabilistic systems by analogy with the tests developed for non-probabilistic systems. We make sure that our probabilistic tests, when performed on non-probabilistic automata, give us refinement relations which agree with for those non-probabilistic automata. We formalise this property as a vertical refinement.

  1. Protein NMR structures refined without NOE data.

    Science.gov (United States)

    Ryu, Hyojung; Kim, Tae-Rae; Ahn, SeonJoo; Ji, Sunyoung; Lee, Jinhyuk

    2014-01-01

    The refinement of low-quality structures is an important challenge in protein structure prediction. Many studies have been conducted on protein structure refinement; the refinement of structures derived from NMR spectroscopy has been especially intensively studied. In this study, we generated flat-bottom distance potential instead of NOE data because NOE data have ambiguity and uncertainty. The potential was derived from distance information from given structures and prevented structural dislocation during the refinement process. A simulated annealing protocol was used to minimize the potential energy of the structure. The protocol was tested on 134 NMR structures in the Protein Data Bank (PDB) that also have X-ray structures. Among them, 50 structures were used as a training set to find the optimal "width" parameter in the flat-bottom distance potential functions. In the validation set (the other 84 structures), most of the 12 quality assessment scores of the refined structures were significantly improved (total score increased from 1.215 to 2.044). Moreover, the secondary structure similarity of the refined structure was improved over that of the original structure. Finally, we demonstrate that the combination of two energy potentials, statistical torsion angle potential (STAP) and the flat-bottom distance potential, can drive the refinement of NMR structures.

  2. Movement and Coordination

    Science.gov (United States)

    ... Español Text Size Email Print Share Movement and Coordination Page Content Article Body At this age, your ... level will strengthen his body and develop his coordination. In the months ahead, your child’s running will ...

  3. Developmental coordination disorder

    Science.gov (United States)

    ... page: //medlineplus.gov/ency/article/001533.htm Developmental coordination disorder To use the sharing features on this page, please enable JavaScript. Developmental coordination disorder is a childhood disorder. It leads to ...

  4. BOUSSINESQ MODELLING OF NEARSHORE WAVES UNDER BODY FITTED COORDINATE

    Institute of Scientific and Technical Information of China (English)

    FANG Ke-zhao; ZOU Zhi-li; LIU Zhong-bo; YIN Ji-wei

    2012-01-01

    A set of nonlinear Boussinesq equations with fully nonlinearity property is solved numerically in generalized coordinates,to develop a Boussinesq-type wave model in dealing with irregular computation boundaries in complex nearshore regions and to facilitate the grid refinements in simulations.The governing equations expressed in contravariant components of velocity vectors under curv ilinear coordinates are derived and a high order finite difference scheme on a staggered grid is employed for the numerical implementation.The developed model is used to simulate nearshore wave propagations under curvilinear coordinates,the numerical results are compared against analytical or experimental data with a good agreement.

  5. Optimal Deadline Scheduling with Commitment

    CERN Document Server

    Chen, Shiyao; He, Ting

    2011-01-01

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

  6. A Matricial Algorithm for Polynomial Refinement

    CERN Document Server

    King, Emily J

    2011-01-01

    In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are typically compactly supported. In 2002, David Larson posed the question, "Are all polynomials (of a single variable) finitely refinable?" That summer the author proved that the answer indeed was true using basic linear algebra. The result was presented in a number of talks but had not been typed up until now. The purpose of this short note is to record that particular proof.

  7. Atomic modeling of cryo-electron microscopy reconstructions--joint refinement of model and imaging parameters.

    Science.gov (United States)

    Chapman, Michael S; Trzynka, Andrew; Chapman, Brynmor K

    2013-04-01

    When refining the fit of component atomic structures into electron microscopic reconstructions, use of a resolution-dependent atomic density function makes it possible to jointly optimize the atomic model and imaging parameters of the microscope. Atomic density is calculated by one-dimensional Fourier transform of atomic form factors convoluted with a microscope envelope correction and a low-pass filter, allowing refinement of imaging parameters such as resolution, by optimizing the agreement of calculated and experimental maps. A similar approach allows refinement of atomic displacement parameters, providing indications of molecular flexibility even at low resolution. A modest improvement in atomic coordinates is possible following optimization of these additional parameters. Methods have been implemented in a Python program that can be used in stand-alone mode for rigid-group refinement, or embedded in other optimizers for flexible refinement with stereochemical restraints. The approach is demonstrated with refinements of virus and chaperonin structures at resolutions of 9 through 4.5 Å, representing regimes where rigid-group and fully flexible parameterizations are appropriate. Through comparisons to known crystal structures, flexible fitting by RSRef is shown to be an improvement relative to other methods and to generate models with all-atom rms accuracies of 1.5-2.5 Å at resolutions of 4.5-6 Å.

  8. KoBaMIN: a knowledge-based minimization web server for protein structure refinement

    Science.gov (United States)

    Rodrigues, João P. G. L. M.; Levitt, Michael; Chopra, Gaurav

    2012-01-01

    The KoBaMIN web server provides an online interface to a simple, consistent and computationally efficient protein structure refinement protocol based on minimization of a knowledge-based potential of mean force. The server can be used to refine either a single protein structure or an ensemble of proteins starting from their unrefined coordinates in PDB format. The refinement method is particularly fast and accurate due to the underlying knowledge-based potential derived from structures deposited in the PDB; as such, the energy function implicitly includes the effects of solvent and the crystal environment. Our server allows for an optional but recommended step that optimizes stereochemistry using the MESHI software. The KoBaMIN server also allows comparison of the refined structures with a provided reference structure to assess the changes brought about by the refinement protocol. The performance of KoBaMIN has been benchmarked widely on a large set of decoys, all models generated at the seventh worldwide experiments on critical assessment of techniques for protein structure prediction (CASP7) and it was also shown to produce top-ranking predictions in the refinement category at both CASP8 and CASP9, yielding consistently good results across a broad range of model quality values. The web server is fully functional and freely available at http://csb.stanford.edu/kobamin. PMID:22564897

  9. Coordination and Cooperation

    OpenAIRE

    Janssen, Maarten

    2003-01-01

    textabstractThis comment makes four related points. First, explaining coordination is different from explaining cooperation. Second, solving the coordination problem is more important for the theory of games than solving the cooperation problem. Third, a version of the Principle of Coordination can be rationalized on individualistic grounds. Finally, psychological game theory should consider how players perceive their gaming situation. ---------------------------------------------------------...

  10. Processing Coordination Ambiguity

    Science.gov (United States)

    Engelhardt, Paul E.; Ferreira, Fernanda

    2010-01-01

    We examined temporarily ambiguous coordination structures such as "put the butter in the bowl and the pan on the towel." Minimal Attachment predicts that the ambiguous noun phrase "the pan" will be interpreted as a noun-phrase coordination structure because it is syntactically simpler than clausal coordination. Constraint-based theories assume…

  11. Processing Coordination Ambiguity

    Science.gov (United States)

    Engelhardt, Paul E.; Ferreira, Fernanda

    2010-01-01

    We examined temporarily ambiguous coordination structures such as "put the butter in the bowl and the pan on the towel." Minimal Attachment predicts that the ambiguous noun phrase "the pan" will be interpreted as a noun-phrase coordination structure because it is syntactically simpler than clausal coordination. Constraint-based…

  12. Coordination and Cooperation

    NARCIS (Netherlands)

    M.C.W. Janssen (Maarten)

    2003-01-01

    textabstractThis comment makes four related points. First, explaining coordination is different from explaining cooperation. Second, solving the coordination problem is more important for the theory of games than solving the cooperation problem. Third, a version of the Principle of Coordination can

  13. Coordination and Cooperation

    NARCIS (Netherlands)

    M.C.W. Janssen (Maarten)

    2003-01-01

    textabstractThis comment makes four related points. First, explaining coordination is different from explaining cooperation. Second, solving the coordination problem is more important for the theory of games than solving the cooperation problem. Third, a version of the Principle of Coordination can

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

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

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

  15. Bipolar Neutrosophic Refined Sets and Their Applications in Medical Diagnosis

    OpenAIRE

    Deli, Irfan; Yusuf, Şubaş

    2016-01-01

    This paper proposes concept of bipolar neutrosophic refined set and its some operations. Firstly, a score certainty and accuracy function to compare the bipolar neutrosophic refined information is defined. Secondly, to aggregate the bipolar neutrosophic refined information, a bipolar neutrosophic refined weighted average operator and a bipolar neutrosophic refined weighted geometric operator is developed.

  16. Bipolar Neutrosophic Refined Sets and Their Applications in Medical Diagnosis

    OpenAIRE

    Deli, Irfan; Yusuf, Şubaş

    2016-01-01

    This paper proposes concept of bipolar neutrosophic refined set and its some operations. Firstly, a score certainty and accuracy function to compare the bipolar neutrosophic refined information is defined. Secondly, to aggregate the bipolar neutrosophic refined information, a bipolar neutrosophic refined weighted average operator and a bipolar neutrosophic refined weighted geometric operator is developed.

  17. Scheduling the Belgian soccer league.

    OpenAIRE

    Goossens, Dries; Spieksma, Frederik

    2009-01-01

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

  18. An empirical investigation of scheduling performance criteria

    NARCIS (Netherlands)

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

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

  19. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc Jochen

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

  20. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc

    2003-01-01

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

  1. CARMENES instrument control system and operational scheduler

    Science.gov (United States)

    Garcia-Piquer, Alvaro; Guàrdia, Josep; Colomé, Josep; Ribas, Ignasi; Gesa, Lluis; Morales, Juan Carlos; Pérez-Calpena, Ana; Seifert, Walter; Quirrenbach, Andreas; Amado, Pedro J.; Caballero, José A.; Reiners, Ansgar

    2014-07-01

    The main goal of the CARMENES instrument is to perform high-accuracy measurements of stellar radial velocities (1m/s) with long-term stability. CARMENES will be installed in 2015 at the 3.5 m telescope in the Calar Alto Observatory (Spain) and it will be equipped with two spectrographs covering from the visible to the near-infrared. It will make use of its near-IR capabilities to observe late-type stars, whose peak of the spectral energy distribution falls in the relevant wavelength interval. The technology needed to develop this instrument represents a challenge at all levels. We present two software packages that play a key role in the control layer for an efficient operation of the instrument: the Instrument Control System (ICS) and the Operational Scheduler. The coordination and management of CARMENES is handled by the ICS, which is responsible for carrying out the operations of the different subsystems providing a tool to operate the instrument in an integrated manner from low to high user interaction level. The ICS interacts with the following subsystems: the near-IR and visible channels, composed by the detectors and exposure meters; the calibration units; the environment sensors; the front-end electronics; the acquisition and guiding module; the interfaces with telescope and dome; and, finally, the software subsystems for operational scheduling of tasks, data processing, and data archiving. We describe the ICS software design, which implements the CARMENES operational design and is planned to be integrated in the instrument by the end of 2014. The CARMENES operational scheduler is the second key element in the control layer described in this contribution. It is the main actor in the translation of the survey strategy into a detailed schedule for the achievement of the optimization goals. The scheduler is based on Artificial Intelligence techniques and computes the survey planning by combining the static constraints that are known a priori (i.e., target

  2. Multivariate refinement equation with nonnegative masks

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper is concerned with multivariate refinement equations of the type ψ = ∑α∈Zs a(α)ψ(Mx - α),where ψ is the unknown function defined on the s-dimensional Euclidean space Rs, a is a finitely supported nonnegative sequence on Zs, and M is an s × s dilation matrix with m := |detM|. We characterize the existence of L2-solution of refinement equation in terms of spectral radius of a certain finite matrix or transition operator associated with refinement mask a and dilation matrix M. For s = 1 and M = 2, the sufficient and necessary conditions are obtained to characterize the existence of continuous solution of this refinement equation.

  3. Refining the theory of basic individual values.

    Science.gov (United States)

    Schwartz, Shalom H; Cieciuch, Jan; Vecchione, Michele; Davidov, Eldad; Fischer, Ronald; Beierlein, Constanze; Ramos, Alice; Verkasalo, Markku; Lönnqvist, Jan-Erik; Demirutku, Kursad; Dirilen-Gumus, Ozlem; Konty, Mark

    2012-10-01

    We propose a refined theory of basic individual values intended to provide greater heuristic and explanatory power than the original theory of 10 values (Schwartz, 1992). The refined theory more accurately expresses the central assumption of the original theory that research has largely ignored: Values form a circular motivational continuum. The theory defines and orders 19 values on the continuum based on their compatible and conflicting motivations, expression of self-protection versus growth, and personal versus social focus. We assess the theory with a new instrument in 15 samples from 10 countries (N = 6,059). Confirmatory factor and multidimensional scaling analyses support discrimination of the 19 values, confirming the refined theory. Multidimensional scaling analyses largely support the predicted motivational order of the values. Analyses of predictive validity demonstrate that the refined values theory provides greater and more precise insight into the value underpinnings of beliefs. Each value correlates uniquely with external variables.

  4. Progressive refinement for robust image registration

    Institute of Scientific and Technical Information of China (English)

    Li Song; Yuanhua Zhou; Jun Zhou

    2005-01-01

    @@ A new image registration algorithm with robust cost function and progressive refinement estimation is developed on the basis of direct method (DM). The robustness lies in M-estimation to avert larger local noise and outliers.

  5. Oil Refining Giants to Cut Output

    Institute of Scientific and Technical Information of China (English)

    Zhang Dingmin

    2002-01-01

    @@ China's refined oil product output rose slightly in the first five months of this year on strong demand,but the two biggest domestic producers plan to cut production rates in an attempt to bolster the sluggish price.

  6. Multidataset Refinement Resonant Diffraction, and Magnetic Structures

    OpenAIRE

    Attfield, J. Paul

    2004-01-01

    The scope of Rietveld and other powder diffraction refinements continues to expand, driven by improvements in instrumentation, methodology and software. This will be illustrated by examples from our research in recent years. Multidataset refinement is now commonplace; the datasets may be from different detectors, e.g., in a time-of-flight experiment, or from separate experiments, such as at several x-ray energies giving resonant information. The complementary use of x rays and neutrons is exe...

  7. Multiagent scheduling models and algorithms

    CERN Document Server

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

    2014-01-01

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

  8. Executive Schedule C System (ESCS)

    Data.gov (United States)

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

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

  10. Schedule Sales Query Raw Data

    Data.gov (United States)

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

  11. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

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

  12. Research on information models for the construction schedule management based on the IFC standard

    OpenAIRE

    Weirui Xue; Yaowu Wang; Qingpeng Man

    2015-01-01

    Purpose: The purpose of this article is to study the description and extension of the Industry Foundation Classes (IFC) standard in construction schedule management, which achieves the information exchange and sharing among the different information systems and stakeholders, and facilitates the collaborative construction in the construction projects. Design/methodology/approach: The schedule information processing and coordination are difficult in the complex construction project. Building In...

  13. Scheduling commercial advertisements for television

    OpenAIRE

    Garcia-Villoria, Alberto; Salhi, Said

    2014-01-01

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

  14. Needs analysis and project schedule for the Los Alamos National Laboratory (LANL) Health Physics Analysis Laboratory (HPAL) upgrade

    Energy Technology Data Exchange (ETDEWEB)

    Rhea, T.A.; Rucker, T.L. [Science Applications International Corp., Oak Ridge, TN (United States); Stafford, M.W. [NUS Corp., Aiken, SC (US)

    1990-09-28

    This report is a needs assessment and project schedule for the Health Physics Analysis Laboratory (HPAL) upgrade project at Los Alamos National Laboratory (LANL). After reviewing current and projected HPAL operations, two custom-developed laboratory information management systems (LIMS) for similar facilities were reviewed; four commercially available LIMS products were also evaluated. This project is motivated by new regulations for radiation protection and training and by increased emphasis on quality assurance (QA). HPAL data are used to: protect the health of radiation workers; document contamination levels for transportation of radioactive materials and for release of materials to the public for uncontrolled use; and verify compliance with environmental emission regulations. Phase 1 of the HPAL upgrade project concentrates on four types of counting instruments which support in excess of 90% of the sample workload at the existing central laboratories. Phase 2 is a refinement phase and also integrates summary-level databases on the central Health, Safety, and Environment (HSE) VAX. Phase 3 incorporates additional instrument types and integrates satellite laboratories into the HPAL LIMS. Phase 1 will be a multi-year, multimillion dollar project. The temptation to approach the upgrade of the HPAL program in a piece meal fashion should be avoided. This is a major project, with clearly-defined goals and priorities, and should be approached as such. Major programmatic and operational impacts will be felt throughout HSE as a result of this upgrade, so effective coordination with key customer contacts will be critical.

  15. Some Strategies for the Refinement of Disordered Structures with the SHELXL-97 Refinement Program

    Institute of Scientific and Technical Information of China (English)

    Ng Seik Weng

    2005-01-01

    Examples of the refinement of disordered structures taken from work published in Acta Crystallographica are presented together with explanations on how the disordered structures are dealt with. The constraint and restraint commands in the SHELXL-97 refinement program that are specific to the particular type of disorder are described. Some ways to divine the hydrogen atoms on water are given in detail. The refinements of the Flack parameters and twinned structures are briefly discussed.

  16. Research on information models for the construction schedule management based on the IFC standard

    Directory of Open Access Journals (Sweden)

    Weirui Xue

    2015-05-01

    Full Text Available Purpose: The purpose of this article is to study the description and extension of the Industry Foundation Classes (IFC standard in construction schedule management, which achieves the information exchange and sharing among the different information systems and stakeholders, and facilitates the collaborative construction in the construction projects. Design/methodology/approach: The schedule information processing and coordination are difficult in the complex construction project. Building Information Modeling (BIM provides the platform for exchanging and sharing information among information systems and stakeholders based on the IFC standard. Through analyzing the schedule plan, implementing, check and control, the information flow in the schedule management is reflected based on the IDEF. According to the IFC4, the information model for the schedule management is established, which not only includes the each aspect of the schedule management, but also includes the cost management, the resource management, the quality management and the risk management. Findings: The information requirement for the construction schedule management can be summarized into three aspects: the schedule plan information, the implementing information and the check and control information. The three aspects can be described through the existing and extended entities of IFC4, and the information models are established. Originality/value: The main contribution of the article is to establish the construction schedule management information model, which achieves the information exchange and share in the construction project, and facilitates the development of the application software to meet the requirements of the construction project.

  17. Critical Task Re-assignment under Hybrid Scheduling Approach in Multiprocessor Real-Time Systems

    CERN Document Server

    Nair, Gopalakrishnan T R

    2012-01-01

    Embedded hard real time systems require substantial amount of emergency processing power for the management of large scale systems like a nuclear power plant under the threat of an earth quake or a future transport systems under a peril. In order to meet a fully coordinated supervisory control of multiple domains of a large scale system, it requires the scenario of engaging multiprocessor real time design. There are various types of scheduling schemes existing for meeting the critical task assignment in multiple processor environments and it requires the tracking of faulty conditions of the subsystem to avoid system underperformance from failure patterns. Hybrid scheduling usually engages a combined scheduling philosophy comprising of a static scheduling of a set of tasks and a highly pre-emptive scheduling for another set of tasks in different situations of process control. There are instances where highly critical tasks need to be introduced at a least expected catastrophe and it cannot be ensured to meet a...

  18. 77 FR 43280 - Coordination Between Natural Gas and Electricity Markets; Supplemental Notice of Technical...

    Science.gov (United States)

    2012-07-24

    ... Energy Regulatory Commission Coordination Between Natural Gas and Electricity Markets; Supplemental... the conferences. \\1\\ Coordination between Natural Gas and Electricity Markets, Docket No. AD12-12-000...) issued a notice scheduling a series of regional technical conferences on the issue of...

  19. Enhanced time overcurrent coordination

    Energy Technology Data Exchange (ETDEWEB)

    Enriquez, Arturo Conde; Martinez, Ernesto Vazquez [Universidad Autonoma de Nuevo Leon, Facultad de Ingenieria Mecanica y Electrica, Apdo. Postal 114-F, Ciudad Universitaria, CP 66450 San Nicolas de los Garza, Nuevo Leon (Mexico)

    2006-04-15

    In this paper, we recommend a new coordination system for time overcurrent relays. The purpose of the coordination process is to find a time element function that allows it to operate using a constant back-up time delay, for any fault current. In this article, we describe the implementation and coordination results of time overcurrent relays, fuses and reclosers. Experiments were carried out in a laboratory test situation using signals of a power electrical system physics simulator. (author)

  20. An Improved Round Robin Scheduling Algorithm for CPU scheduling

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar yadav

    2010-07-01

    Full Text Available There are many functions which are provided by operating system like process management, memory management, file management, input/outputmanagement, networking, protection system and command interpreter system. In these functions, the process management is most important function because operating system is a system program that means at the runtime process interact with hardware. Therefore, we can say that for improving the efficiency of a CPU we need to manage all process. For managing the process we use various types scheduling algorithm. There are many algorithm are available for CPU scheduling. But all algorithms have its own deficiency and limitations. In this paper, I proposed a new approach for round robin scheduling algorithm which helps to improve the efficiency of CPU.

  1. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2010-10-01

    Full Text Available The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and less throughput. The proposed algorithm improves all the drawback of simple round robin architecture. The author have also given comparative analysis of proposed with simple round robin scheduling algorithm. Therefore, the author strongly feel that the proposed architecture solves all the problem encountered in simple round robin architecture by decreasing the performance parameters to desirable extent and thereby increasing the system throughput.

  2. A Real-time, Coupled, Refined Forecasting System for Coastal Prediction

    Science.gov (United States)

    Armstrong, B. N.; Warner, J. C.; Signell, R. P.

    2010-12-01

    In the coastal zone, storms are one of the primary environmental forces causing coastal change. These discrete events often produce large waves, storm surges, and flooding, resulting in coastal erosion. In addition, strong storm-generated currents may pose threats to life, property, and navigation. The ability to predict these events, their location, duration, and magnitude allows resource managers to better prepare for the storm impacts as well as guide post-storm survey assessments and recovery efforts. As a step towards increasing our capability for prediction of these events and to help us study the physical processes that occur we have developed an automated system to run components of the Coupled Ocean - Atmosphere - Wave - Sediment Transport (COAWST) Modeling System as a daily forecast. The current daily system couples Regional Ocean Model System (ROMS) and Simulation Waves Nearshore (SWAN) models to predict currents, salinity, temperature, wave height and direction, and sediment transport for the US East Coast and Gulf of Mexico on a 5 km scale. As part of the system a refined grid for the area of Cape Hatteras, NC at a resolution of 1 km is included. Management of the system is controlled by the Windows Scheduler to start Matlab® and run scripts and functions. Data required by the modeling system include daily modeled wave, wind, atmospheric surface inputs, and climatology fields. The Unidata Internet Data Distribution/Local Data Manager (http://www.unidata.ucar.edu/software/ldm/) is used to download National Centers for Environmental Prediction (NCEP) GFS global 5 degree data and NCEP NAM Conus 12km data to a local server. The Matlab “structs” tool and NJ-Toolbox (http://njtbx.sourceforge.net/njdocs/njtbxhelp/njtbxhelp.html) are used to access these large data sets on the local server as well as Wave Watch 3 (WW3) and NCEP model data sets available remotely on the Nomads http://nomads.ncep.noaa.gov site and Hybrid Coordinate Ocean Model (HYCOM) data

  3. Multidataset Refinement Resonant Diffraction, and Magnetic Structures.

    Science.gov (United States)

    Attfield, J Paul

    2004-01-01

    The scope of Rietveld and other powder diffraction refinements continues to expand, driven by improvements in instrumentation, methodology and software. This will be illustrated by examples from our research in recent years. Multidataset refinement is now commonplace; the datasets may be from different detectors, e.g., in a time-of-flight experiment, or from separate experiments, such as at several x-ray energies giving resonant information. The complementary use of x rays and neutrons is exemplified by a recent combined refinement of the monoclinic superstructure of magnetite, Fe3O4, below the 122 K Verwey transition, which reveals evidence for Fe(2+)/Fe(3+) charge ordering. Powder neutron diffraction data continue to be used for the solution and Rietveld refinement of magnetic structures. Time-of-flight instruments on cold neutron sources can produce data that have a high intensity and good resolution at high d-spacings. Such profiles have been used to study incommensurate magnetic structures such as FeAsO4 and β-CrPO4. A multiphase, multidataset refinement of the phase-separated perovskite (Pr0.35Y0.07Th0.04Ca0.04Sr0.5)MnO3 has been used to fit three components with different crystal and magnetic structures at low temperatures.

  4. The evolution of oil refining in Europe

    Energy Technology Data Exchange (ETDEWEB)

    Reid, A. [CONCAWE, Brussels (Belgium)

    2013-04-01

    Back in 1963 when CONCAWE was founded, the world looked very different from what it is today, and so did the global and European refining industry. Oil product markets were expanding fast and new refineries were being built at a steady rate. The oil crisis of the 1970s brought an abrupt end to this, heralding a long era of consolidation and stepwise adaptation. At the same time the nature of the global oil business shifted from fully integrated companies producing, transporting and refining their own oil to a much more diversified situation where oil production ('upstream') and refining/distribution ('downstream') gradually became two essentially separate businesses. From being purely a 'cost centre' in an integrated chain, refining has become a separate activity in its own right, operating as a 'profit centre' between two global markets - crude oil and products - which, although not entirely independent, have their own dynamics and influences. In addition demand gradually shifted towards lighter products while the quality requirements on all products were considerably tightened. This article explores the new challenges that these changes have imposed on EU refiners, and describes CONCAWE's contributions to understanding their impact on refinery production and investments.

  5. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

    ... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of... Information Act (FOIA) Fee Schedule Update pursuant to 10 CFR 1703.107(b)(6) of the Board's regulations. DATES... update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule Update was published in...

  6. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations... General Manager will update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule...

  7. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

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

  8. Multiuser switched diversity scheduling schemes

    KAUST Repository

    Shaqfeh, Mohammad

    2012-09-01

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

  9. Nurse Scheduling Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Komgrit Leksakul

    2014-01-01

    Full Text Available This study applied engineering techniques to develop a nurse scheduling model that, while maintaining the highest level of service, simultaneously minimized hospital-staffing costs and equitably distributed overtime pay. In the mathematical model, the objective function was the sum of the overtime payment to all nurses and the standard deviation of the total overtime payment that each nurse received. Input data distributions were analyzed in order to formulate a simulation model to determine the optimal demand for nurses that met the hospital’s service standards. To obtain the optimal nurse schedule with the number of nurses acquired from the simulation model, we proposed a genetic algorithm (GA with two-point crossover and random mutation. After running the algorithm, we compared the expenses and number of nurses between the existing and our proposed nurse schedules. For January 2013, the nurse schedule obtained by GA could save 12% in staffing expenses per month and 13% in number of nurses when compare with the existing schedule, while more equitably distributing overtime pay between all nurses.

  10. Batch Scheduling a Fresh Approach

    Science.gov (United States)

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

    1994-01-01

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

  11. Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology

    Science.gov (United States)

    Jackson, Justin Patrick

    This dissertation develops a framework to address centralized and distributed constrained task assignment and task scheduling problems. This framework is used to prove properties of these problems that can be exploited, develop effective solution algorithms, and to prove important properties such as correctness, completeness and optimality. The centralized task assignment and task scheduling problem treated here is expressed as a vehicle routing problem with the goal of optimizing mission time subject to mission constraints on task precedence and agent capability. The algorithm developed to solve this problem is able to coordinate vehicle (agent) timing for task completion. This class of problems is NP-hard and analytical guarantees on solution quality are often unavailable. This dissertation develops a technique for determining solution quality that can be used on a large class of problems and does not rely on traditional analytical guarantees. For distributed problems several agents must communicate to collectively solve a distributed task assignment and task scheduling problem. The distributed task assignment and task scheduling algorithms developed here allow for the optimization of constrained military missions in situations where the communication network may be incomplete and only locally known. Two problems are developed. The distributed task assignment problem incorporates communication constraints that must be satisfied; this is the Communication-Constrained Distributed Assignment Problem. A novel distributed assignment algorithm, the Stochastic Bidding Algorithm, solves this problem. The algorithm is correct, probabilistically complete, and has linear average-case time complexity. The distributed task scheduling problem addressed here is to minimize mission time subject to arbitrary predicate mission constraints; this is the Minimum-time Arbitrarily-constrained Distributed Scheduling Problem. The Optimal Distributed Non-sequential Backtracking Algorithm

  12. Refining Animal Models to Enhance Animal Welfare

    Institute of Scientific and Technical Information of China (English)

    Patricia V.Turner

    2012-01-01

    The use of animals in research will be necessary for scientific advances in the basic and biomedical sciences for the foreseeable future.As we learn more about the ability of animals to experience pain,suffering,and distress,and particularly for mammals,it becomes the responsibility of scientists,institutions,animal caregivers,and veterinarians to seek ways to improve the lives of research animals and refine their care and use.Refinement is one of the three R's emphasized by Russell and Burch,and refers to modification of procedures to minimise the potential for pain,suffering and distress. It may also refer to procedures used to enhance animal comfort. This paper summarizes considerations for refinements in research animal.

  13. FEM electrode refinement for electrical impedance tomography.

    Science.gov (United States)

    Grychtol, Bartlomiej; Adler, Andy

    2013-01-01

    Electrical Impedance Tomography (EIT) reconstructs images of electrical tissue properties within a body from electrical transfer impedance measurements at surface electrodes. Reconstruction of EIT images requires the solution of an inverse problem in soft field tomography, where a sensitivity matrix, J, of the relationship between internal changes and measurements is calculated, and then a pseudo-inverse of J is used to update the image estimate. It is therefore clear that a precise calculation of J is required for solution accuracy. Since it is generally not possible to use analytic solutions, the finite element method (FEM) is typically used. It has generally been recommended in the EIT literature that FEMs be refined near electrodes, since the electric field and sensitivity is largest there. In this paper we analyze the accuracy requirement for FEM refinement near electrodes in EIT and describe a technique to refine arbitrary FEMs.

  14. Model refinement for offshore platforms: Experimental study

    Science.gov (United States)

    Zhang, Min; Chen, Zongli; Wu, Yanjian

    2017-08-01

    Offshore jacket platforms are widely used in offshore oil and gas exploitation. Finite element models of such structures need to have many degrees of freedom (DOFs) to represent the geometrical detail of complex structures, thereby leading to incompatibility in the number of DOFs of experimental models. To bring them both to the same order while ensuring that the essential eigen- properties of the refined model match those of experimental models, an extended model refinement procedure is presented in this paper. Vibration testing of an offshore jacket platform model is performed to validate the applicability of the proposed approach. A full-order finite element model of the platform is established and then tuned to meet the measured modal properties identified from the acceleration signals. Both model reduction and modal expansion methods are investigated, as well as various scenarios of sensor arrangements. Upon completion of the refinement, the updated jacket platform model matches the natural frequencies of the measured model well.

  15. Refining Linear Fuzzy Rules by Reinforcement Learning

    Science.gov (United States)

    Berenji, Hamid R.; Khedkar, Pratap S.; Malkani, Anil

    1996-01-01

    Linear fuzzy rules are increasingly being used in the development of fuzzy logic systems. Radial basis functions have also been used in the antecedents of the rules for clustering in product space which can automatically generate a set of linear fuzzy rules from an input/output data set. Manual methods are usually used in refining these rules. This paper presents a method for refining the parameters of these rules using reinforcement learning which can be applied in domains where supervised input-output data is not available and reinforcements are received only after a long sequence of actions. This is shown for a generalization of radial basis functions. The formation of fuzzy rules from data and their automatic refinement is an important step in closing the gap between the application of reinforcement learning methods in the domains where only some limited input-output data is available.

  16. Feature-based telescope scheduler

    Science.gov (United States)

    Naghib, Elahesadat; Vanderbei, Robert J.; Stubbs, Christopher

    2016-07-01

    Feature-based Scheduler offers a sequencing strategy for ground-based telescopes. This scheduler is designed in the framework of Markovian Decision Process (MDP), and consists of a sub-linear online controller, and an offline supervisory control-optimizer. Online control law is computed at the moment of decision for the next visit, and the supervisory optimizer trains the controller by simulation data. Choice of the Differential Evolution (DE) optimizer, and introducing a reduced state space of the telescope system, offer an efficient and parallelizable optimization algorithm. In this study, we applied the proposed scheduler to the problem of Large Synoptic Survey Telescope (LSST). Preliminary results for a simplified model of LSST is promising in terms of both optimality, and computational cost.

  17. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

  18. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  19. Optimal randomized scheduling by replacement

    Energy Technology Data Exchange (ETDEWEB)

    Saias, I.

    1996-05-01

    In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.

  20. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Ravn, Anders P.;

    2010-01-01

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

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

  2. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1997-01-01

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

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

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

  5. The refinement of hypocenter parameters on the basis of three-dimensional velocity models of focal zones

    Science.gov (United States)

    Slavina, L. B.; Pivovarova, N. B.

    1982-11-01

    A complex approach to the processing of seismological data to determine hypocenter coordinates and to construct three-dimensional velocity fields of focal zones is considered. The iterative process includes the determination of focal coordinates under the assumption of a laterally homogeneous medium, the construction of a three-dimensional velocity model, and subsequent redefinition of the focal coordinates taking into account the inhomogeneous structure of the medium. The principal results of calculations of three-dimensional velocity fields and refined earthquake hypocenters are presented for focal zones in Vrancea (Carpathians), the Caucasus, and Kamchatka.

  6. Grid refinement for entropic lattice Boltzmann models.

    Science.gov (United States)

    Dorschner, B; Frapolli, N; Chikatamarla, S S; Karlin, I V

    2016-11-01

    We propose a multidomain grid refinement technique with extensions to entropic incompressible, thermal, and compressible lattice Boltzmann models. Its validity and accuracy are assessed by comparison to available direct numerical simulation and experiment for the simulation of isothermal, thermal, and viscous supersonic flow. In particular, we investigate the advantages of grid refinement for the setups of turbulent channel flow, flow past a sphere, Rayleigh-Bénard convection, as well as the supersonic flow around an airfoil. Special attention is paid to analyzing the adaptive features of entropic lattice Boltzmann models for multigrid simulations.

  7. Grid refinement for entropic lattice Boltzmann models

    CERN Document Server

    Dorschner, B; Chikatamarla, S S; Karlin, I V

    2016-01-01

    We propose a novel multi-domain grid refinement technique with extensions to entropic incompressible, thermal and compressible lattice Boltzmann models. Its validity and accuracy are accessed by comparison to available direct numerical simulation and experiment for the simulation of isothermal, thermal and viscous supersonic flow. In particular, we investigate the advantages of grid refinement for the set-ups of turbulent channel flow, flow past a sphere, Rayleigh-Benard convection as well as the supersonic flow around an airfoil. Special attention is payed to analyzing the adaptive features of entropic lattice Boltzmann models for multi-grid simulations.

  8. Contextual Distance Refining for Image Retrieval

    KAUST Repository

    Islam, Almasri

    2014-09-16

    Recently, a number of methods have been proposed to improve image retrieval accuracy by capturing context information. These methods try to compensate for the fact that a visually less similar image might be more relevant because it depicts the same object. We propose a new quick method for refining any pairwise distance metric, it works by iteratively discovering the object in the image from the most similar images, and then refine the distance metric accordingly. Test show that our technique improves over the state of art in terms of accuracy over the MPEG7 dataset.

  9. Concrete Cutting Refinement for Crater Repair

    Science.gov (United States)

    2015-08-01

    ER D C/ G SL T R- 15 -2 9 Concrete Cutting Refinement for Crater Repair G eo te ch ni ca l a nd S tr uc tu re s La bo ra to ry...by ERDC, visit the ERDC online library at http://acwc.sdp.sirsi.net/client/default. ERDC/GSL TR-15-29 August 2015 Concrete Cutting Refinement...equipment in both soft and hard aggregate-mixed concrete . The investigated equipment included the Vermeer RW1236W and CC1531, Caterpillar SW45 and

  10. Adaptive mesh refinement for storm surge

    KAUST Repository

    Mandli, Kyle T.

    2014-03-01

    An approach to utilizing adaptive mesh refinement algorithms for storm surge modeling is proposed. Currently numerical models exist that can resolve the details of coastal regions but are often too costly to be run in an ensemble forecasting framework without significant computing resources. The application of adaptive mesh refinement algorithms substantially lowers the computational cost of a storm surge model run while retaining much of the desired coastal resolution. The approach presented is implemented in the GeoClaw framework and compared to ADCIRC for Hurricane Ike along with observed tide gauge data and the computational cost of each model run. © 2014 Elsevier Ltd.

  11. Using supercritical fluids to refine hydrocarbons

    Science.gov (United States)

    Yarbro, Stephen Lee

    2015-06-09

    A system and method for reactively refining hydrocarbons, such as heavy oils with API gravities of less than 20 degrees and bitumen-like hydrocarbons with viscosities greater than 1000 cp at standard temperature and pressure, using a selected fluid at supercritical conditions. A reaction portion of the system and method delivers lightweight, volatile hydrocarbons to an associated contacting unit which operates in mixed subcritical/supercritical or supercritical modes. Using thermal diffusion, multiphase contact, or a momentum generating pressure gradient, the contacting unit separates the reaction products into portions that are viable for use or sale without further conventional refining and hydro-processing techniques.

  12. Relativistic MHD with Adaptive Mesh Refinement

    CERN Document Server

    Anderson, M; Liebling, S L; Neilsen, D; Anderson, Matthew; Hirschmann, Eric; Liebling, Steven L.; Neilsen, David

    2006-01-01

    We solve the relativistic magnetohydrodynamics (MHD) equations using a finite difference Convex ENO method (CENO) in 3+1 dimensions within a distributed parallel adaptive mesh refinement (AMR) infrastructure. In flat space we examine a Balsara blast wave problem along with a spherical blast wave and a relativistic rotor test both with unigrid and AMR simulations. The AMR simulations substantially improve performance while reproducing the resolution equivalent unigrid simulation results. We also investigate the impact of hyperbolic divergence cleaning for the spherical blast wave and relativistic rotor. We include unigrid and mesh refinement parallel performance measurements for the spherical blast wave.

  13. Adaptive Mesh Refinement for Storm Surge

    CERN Document Server

    Mandli, Kyle T

    2014-01-01

    An approach to utilizing adaptive mesh refinement algorithms for storm surge modeling is proposed. Currently numerical models exist that can resolve the details of coastal regions but are often too costly to be run in an ensemble forecasting framework without significant computing resources. The application of adaptive mesh refinement algorithms substantially lowers the computational cost of a storm surge model run while retaining much of the desired coastal resolution. The approach presented is implemented in the \\geoclaw framework and compared to \\adcirc for Hurricane Ike along with observed tide gauge data and the computational cost of each model run.

  14. Refining - Panorama 2008; Raffinage - Panorama 2008

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2008-07-01

    Investment rallied in 2007, and many distillation and conversion projects likely to reach the industrial stage were announced. With economic growth sustained in 2006 and still pronounced in 2007, oil demand remained strong - especially in emerging countries - and refining margins stayed high. Despite these favorable business conditions, tensions persisted in the refining sector, which has fallen far behind in terms of investing in refinery capacity. It will take renewed efforts over a long period to catch up. Looking at recent events that have affected the economy in many countries (e.g. the sub-prime crisis), prudence remains advisable.

  15. Characterizing traits of coordination

    NARCIS (Netherlands)

    Poss, R.

    2013-01-01

    How can one recognize coordination languages and technologies? As this report shows, the common approach that contrasts coordination with computation is intellectually unsound: depending on the selected understanding of the word "computation", it either captures too many or too few programming

  16. Coordination models and languages

    NARCIS (Netherlands)

    Papadopoulos, G.A.; Arbab, F.

    1998-01-01

    A new class of models, formalisms and mechanisms has recently evolved for describing concurrent and distributed computations based on the concept of ``coordination''. The purpose of a coordination model and associated language is to provide a means of integrating a number of possibly heterogeneous c

  17. Team coordination dynamics.

    Science.gov (United States)

    Gorman, Jamie C; Amazeen, Polemnia G; Cooke, Nancy J

    2010-07-01

    Team coordination consists of both the dynamics of team member interaction and the environmental dynamics to which a team is subjected. Focusing on dynamics, an approach is developed that contrasts with traditional aggregate-static concepts of team coordination as characterized by the shared mental model approach. A team coordination order parameter was developed to capture momentary fluctuations in coordination. Team coordination was observed in three-person uninhabited air vehicle teams across two experimental sessions. The dynamics of the order parameter were observed under changes of a team familiarity control parameter. Team members returned for the second session to either the same (Intact) or different (Mixed) team. 'Roadblock' perturbations, or novel changes in the task environment, were introduced in order to probe the stability of team coordination. Nonlinear dynamic methods revealed differences that a traditional approach did not: Intact and Mixed team coordination dynamics looked very different; Mixed teams were more stable than Intact teams and explored the space of solutions without the need for correction. Stability was positively correlated with the number of roadblock perturbations that were overcome successfully. The novel and non-intuitive contribution of a dynamical analysis was that Mixed teams, who did not have a long history working together, were more adaptive. Team coordination dynamics carries new implications for traditional problems such as training adaptive teams.

  18. Coordinate measuring machines

    DEFF Research Database (Denmark)

    De Chiffre, Leonardo

    This document is used in connection with three exercises of 2 hours duration as a part of the course GEOMETRICAL METROLOGY AND MACHINE TESTING. The exercises concern three aspects of coordinate measuring: 1) Measuring and verification of tolerances on coordinate measuring machines, 2) Traceability...

  19. Social Postural Coordination

    Science.gov (United States)

    Varlet, Manuel; Marin, Ludovic; Lagarde, Julien; Bardy, Benoit G.

    2011-01-01

    The goal of the current study was to investigate whether a visual coupling between two people can produce spontaneous interpersonal postural coordination and change their intrapersonal postural coordination involved in the control of stance. We examined the front-to-back head displacements of participants and the angular motion of their hip and…

  20. Social Postural Coordination

    Science.gov (United States)

    Varlet, Manuel; Marin, Ludovic; Lagarde, Julien; Bardy, Benoit G.

    2011-01-01

    The goal of the current study was to investigate whether a visual coupling between two people can produce spontaneous interpersonal postural coordination and change their intrapersonal postural coordination involved in the control of stance. We examined the front-to-back head displacements of participants and the angular motion of their hip and…

  1. Micro-Opportunistic Scheduling: The Micro-Boss Factory Scheduler

    Science.gov (United States)

    1994-01-01

    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979. [13] Eliyahu M. Goldratt ...techniques is the one developed by Goldratt and his colleagues within the context of the OPT factory scheduling system [13, 15, 10]. OPT demonstrated

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

  3. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

    Don Rosenthal, a former Ames Research Center computer scientist who helped design the Hubble Space Telescope's scheduling software, co-founded Allocade Inc. of Menlo Park, California, in 2004. Allocade's OnCue software helps hospitals reclaim unused capacity and optimize constantly changing schedules for imaging procedures. After starting to use the software, one medical center soon reported noticeable improvements in efficiency, including a 12 percent increase in procedure volume, 35 percent reduction in staff overtime, and significant reductions in backlog and technician phone time. Allocade now offers versions for outpatient and inpatient magnetic resonance imaging (MRI), ultrasound, interventional radiology, nuclear medicine, Positron Emission Tomography (PET), radiography, radiography-fluoroscopy, and mammography.

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

  5. Schedule Optimization Study, Hanford RI/FS Program

    Energy Technology Data Exchange (ETDEWEB)

    1992-12-01

    A Schedule Optimization Study (SOS) of the US Department of Energy (DOE) Hanford Site Remedial Investigation/Feasibility Study (RI/FS) Program was conducted by an independent team of professionals from other federal agencies and the private sector experienced in environmental restoration. This team spent two weeks at Hanford in September 1992 examining the reasons for the lengthy RI/FS process at Hanford and developing recommendations to expedite the process. The need for the study arose out of a schedule dispute regarding the submission of the 1100-EM-1 Operable Unit RI/FS Work Plan. This report documents the study called for in the August 29, 1991, Dispute Resolution Committee Decision Statement. Battelle's Environmental Management Operations (EMO) coordinated the effort for DOE's Richland Field Office (RL).

  6. Mesh Generation via Local Bisection Refinement of Triangulated Grids

    Science.gov (United States)

    2015-06-01

    tb [Maubach 1995, Theorem 5.1]. This is exploited in the recursive algorithm RefineTriangle (Algorithm 2) to com- patibly refine a given triangle; the... recursion depth of RefineTriangle is bounded by the maximum level of refinement in T [Maubach 1995]. RefineTriangle calls itself repeatedly on a... sequence of triangles until a compatibly divisible triangle is found. This sequence of triangles is then bisected in reverse order to preserve

  7. POLY-SCALE REFINABLE FUNCTION AND THEIR PROPERTIES

    Institute of Scientific and Technical Information of China (English)

    YANG Shou-zhi

    2006-01-01

    Poly-scale refinable function with dilation factor a is introduced. The existence of solution of poly-scale refinable equation is investigated. Specially, necessary and sufficient conditions for the orthonormality of solution function φ of poly-scale refinable equation with integer dilation factor a are established. Some properties of poly-scale refinable function are discussed. Several examples illustrating how to use the method to construct poly-scale refinable function are given.

  8. Anomalies in the refinement of isoleucine

    NARCIS (Netherlands)

    Berntsen, K.R.M.; Vriend, G.

    2014-01-01

    A study of isoleucines in protein structures solved using X-ray crystallography revealed a series of systematic trends for the two side-chain torsion angles chi1 and chi2 dependent on the resolution, secondary structure and refinement software used. The average torsion angles for the nine rotamers w

  9. Structural refinement and coarsening in deformed metals

    DEFF Research Database (Denmark)

    Hansen, N.; Huang, X.; Xing, Q.

    2005-01-01

    The microstructural refinement by plastic deformation is analysed in terms of key parameters, the spacing between and the misorientation angle across the boundaries subdividing the structure. Coarsening of such structures by annealing is also characterised. For both deformed and annealed structur...

  10. Energy Bandwidth for Petroleum Refining Processes

    Energy Technology Data Exchange (ETDEWEB)

    none,

    2006-10-01

    The petroleum refining energy bandwidth report analyzes the most energy-intensive unit operations used in U.S. refineries: crude oil distillation, fluid catalytic cracking, catalytic hydrotreating, catalytic reforming, and alkylation. The "bandwidth" provides a snapshot of the energy losses that can potentially be recovered through best practices and technology R&D.

  11. SOME REFINEMENTS OF ENESTROM-KAKEYA THEOREM

    Institute of Scientific and Technical Information of China (English)

    A.Aziz; B.A.Zargar

    2007-01-01

    In this paper we present certain interesting refinements of a well-known Enestrom-Kakeya theorem in the theory of distribution of zeros of polynomials which among other things also improve upon some results of Aziz and Mohammad, Govil and Rehman and others.

  12. Refinement from a control problem to program

    DEFF Research Database (Denmark)

    Schenke, Michael; Ravn, Anders P.

    1996-01-01

    for a control task, exemplified by a steam boiler.The same formalism is used to refine requirements to a functional design.Through a suitable transformation this is taken to an event andaction based formalism. Finally components in this design for a distributedarchitecture are transformed to occam-like programs....

  13. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

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

    2013-01-01

    is available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact...

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

  15. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

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

    2012-01-01

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

  16. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

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

    2011-01-01

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

  17. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

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

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

  18. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

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

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

  19. CROP UNDER DEFICIT IRRIGATION SCHEDULING

    African Journals Online (AJOL)

    This study presents crop coefficient (Kc) values of TMV 1 -ST maize variety ... given time from planting to the time it is harvested. ... real time irrigation scheduling for high frequent and non-fiequent water .... 10 m, and the average soil bulk density was 1420 kg/m'. ...... Performance Evaluation of Fadama Irrigation Practice.

  20. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1996-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the US Department of Energy (DOE). This document contains the planned 1996 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project.

  1. Decentralized Real-Time Scheduling

    Science.gov (United States)

    1990-08-01

    917-932, August, 1987. [ Daniels 86] D. C. Daniels and H. F. Wedde. Real-Time Performance of a Completely Distributed Operating System. In Proceedings...imnmediate execuoon The schedule c.-eated by the SeltctPhaseProcfj procedure is an ordere-d lis t of mocl -phnise pairs, each placed according to the

  2. Cooperation in Networks and Scheduling

    NARCIS (Netherlands)

    van Velzen, S.

    2005-01-01

    This thesis deals with various models of cooperation in networks and scheduling. The main focus is how the benefits of this cooperation should be divided among the participating individuals. A major part of this analysis is concerned with stability of the cooperation. In addition, allocation rules a

  3. Satellite SAR geocoding with refined RPC model

    Science.gov (United States)

    Zhang, Lu; Balz, Timo; Liao, Mingsheng

    2012-04-01

    Recent studies have proved that the Rational Polynomial Camera (RPC) model is able to act as a reliable replacement of the rigorous Range-Doppler (RD) model for the geometric processing of satellite SAR datasets. But its capability in absolute geolocation of SAR images has not been evaluated quantitatively. Therefore, in this article the problems of error analysis and refinement of SAR RPC model are primarily investigated to improve the absolute accuracy of SAR geolocation. Range propagation delay and azimuth timing error are identified as two major error sources for SAR geolocation. An approach based on SAR image simulation and real-to-simulated image matching is developed to estimate and correct these two errors. Afterwards a refined RPC model can be built from the error-corrected RD model and then used in satellite SAR geocoding. Three experiments with different settings are designed and conducted to comprehensively evaluate the accuracies of SAR geolocation with both ordinary and refined RPC models. All the experimental results demonstrate that with RPC model refinement the absolute location accuracies of geocoded SAR images can be improved significantly, particularly in Easting direction. In another experiment the computation efficiencies of SAR geocoding with both RD and RPC models are compared quantitatively. The results show that by using the RPC model such efficiency can be remarkably improved by at least 16 times. In addition the problem of DEM data selection for SAR image simulation in RPC model refinement is studied by a comparative experiment. The results reveal that the best choice should be using the proper DEM datasets of spatial resolution comparable to that of the SAR images.

  4. Uranyl ion coordination

    Science.gov (United States)

    Evans, H.T.

    1963-01-01

    A review of the known crystal structures containing the uranyl ion shows that plane-pentagon coordination is equally as prevalent as plane-square or plane-hexagon. It is suggested that puckered-hexagon configurations of OH - or H2O about the uranyl group will tend to revert to plane-pentagon coordination. The concept of pentagonal coordination is invoked for possible explanations of the complex crystallography of the natural uranyl hydroxides and the unusual behavior of polynuclear ions in hydrolyzed uranyl solutions.

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

    CERN Document Server

    Vanhoucke, Mario

    2013-01-01

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

  6. Modeling electron density distributions from X-ray diffraction to derive optical properties: Constrained wavefunction versus multipole refinement

    Science.gov (United States)

    Hickstein, Daniel D.; Cole, Jacqueline M.; Turner, Michael J.; Jayatilaka, Dylan

    2013-08-01

    The rational design of next-generation optical materials requires an understanding of the connection between molecular structure and the solid-state optical properties of a material. A fundamental challenge is to utilize the accurate structural information provided by X-ray diffraction to explain the properties of a crystal. For years, the multipole refinement has been the workhorse technique for transforming high-resolution X-ray diffraction datasets into the detailed electron density distribution of crystalline material. However, the electron density alone is not sufficient for a reliable calculation of the nonlinear optical properties of a material. Recently, the X-ray constrained wavefunction refinement has emerged as a viable alternative to the multipole refinement, offering several potential advantages, including the calculation of a wide range of physical properties and seeding the refinement process with a physically reasonable starting point. In this study, we apply both the multipole refinement and the X-ray constrained wavefunction technique to four molecules with promising nonlinear optical properties and diverse structural motifs. In general, both techniques obtain comparable figures of merit and generate largely similar electron densities, demonstrating the wide applicability of the X-ray constrained wavefunction method. However, there are some systematic differences between the electron densities generated by each technique. Importantly, we find that the electron density generated using the X-ray constrained wavefunction method is dependent on the exact location of the nuclei. The X-ray constrained wavefunction refinement makes smaller changes to the wavefunction when coordinates from the Hartree-Fock-based Hirshfeld atom refinement are employed rather than coordinates from the multipole refinement, suggesting that coordinates from the Hirshfeld atom refinement allow the X-ray constrained wavefunction method to produce more accurate wavefunctions. We

  7. BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

    OpenAIRE

    Butt, Nouman

    2009-01-01

    In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on ...

  8. Distributed Wake-Up Scheduling for Energy Saving in Wireless Networks

    CERN Document Server

    De Pellegrini, Francesco; Miorandi, Daniele; Chlamtac, Imrich

    2011-01-01

    A customary solution to reduce the energy consumption of wireless communication devices is to periodically put the radio into low-power sleep mode. A relevant problem is to schedule the wake-up of nodes in such a way as to ensure proper coordination among devices, respecting delay constraints while still saving energy. In this paper, we introduce a simple algebraic characterization of the problem of periodic wake-up scheduling under both energy consumption and delay constraints. We demonstrate that the general problem of wake-up times coordination is equivalent to integer factorization and discuss the implications on the design of efficient scheduling algorithms. We then propose simple polynomial time heuristic algorithms that can be implemented in a distributed fashion and present a message complexity of the order of the number of links in the network. Numerical results are provided in order to assess the performance of the proposed techniques when applied to wireless sensor networks.

  9. Model of Production Planning and Scheduling in Shop Floor Based on Collaboration and Competition

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    The planning and scheduling in real shop floor is actually achieved by coordination betweendifferent persons. in this process, cooperation is mainstream, but competition also exists, for example.,the competition between different groups, operators with the same skill, etc. In multi-agent based shopfloor management and control system, this competition and cooperation relation must be embodied. Thegeneral process of shop floor production planning and scheduling is studied, and a colored Petri-net modelfor the competition and cooperation process of three main agents in such system to achieve shop floor pro-duction planning and scheduling is presented. The evaluating method of bids in bidding process that espe-cially embodies the competition relationship is also presented. This colored Petri-net model gives a clear il-lustration of this complex coordination process to system designers, effectively promotes the cooperativedevelopment.

  10. A Distributed Fair Scheduling Scheme in Wireless LAN

    Institute of Scientific and Technical Information of China (English)

    WU HaiTao(邬海涛); LIN Yu(林宇); CHENG ShiDuan(程时端)

    2003-01-01

    This paper proposes an algorithm named WLFVC, which is a fully distributed wireless packet scheduling algorithm based on LFVC (Leap Forward Virtual Clock), to providestreams with fairness, especially in the short time scale. This algorithm is able to allocate band-width to streams proportional to their weights. Thus, better delay and jitter performance can beachieved. Since collisions and wireless link error degrade the performance of MAC protocols in the WLAN environment, WLFVC also takes them into consideration. Finally, this algorithm works ina fully distributed way and it can coexist with other stations that only support DCF (Distributed Coordination Function).

  11. Magnetic Coordinate Systems

    CERN Document Server

    Laundal, K M

    2016-01-01

    Geospace phenomena such as the aurora, plasma motion, ionospheric currents and associated magnetic field disturbances are highly organized by Earth's main magnetic field. This is due to the fact that the charged particles that comprise space plasma can move almost freely along magnetic field lines, but not across them. For this reason it is sensible to present such phenomena relative to Earth's magnetic field. A large variety of magnetic coordinate systems exist, designed for different purposes and regions, ranging from the magnetopause to the ionosphere. In this paper we review the most common magnetic coordinate systems and describe how they are defined, where they are used, and how to convert between them. The definitions are presented based on the spherical harmonic expansion coefficients of the International Geomagnetic Reference Field (IGRF) and, in some of the coordinate systems, the position of the Sun which we show how to calculate from the time and date. The most detailed coordinate systems take the...

  12. Supercritical Airfoil Coordinates

    Data.gov (United States)

    National Aeronautics and Space Administration — Rectangular Supercritical Wing (Ricketts) - design and measured locations are provided in an Excel file RSW_airfoil_coordinates_ricketts.xls . One sheet is with Non...

  13. Understanding social motor coordination.

    Science.gov (United States)

    Schmidt, R C; Fitzpatrick, Paula; Caron, Robert; Mergeche, Joanna

    2011-10-01

    Recently there has been much interest in social coordination of motor movements, or as it is referred to by some researchers, joint action. This paper reviews the cognitive perspective's common coding/mirror neuron theory of joint action, describes some of its limitations and then presents the behavioral dynamics perspective as an alternative way of understanding social motor coordination. In particular, behavioral dynamics' ability to explain the temporal coordination of interacting individuals is detailed. Two experiments are then described that demonstrate how dynamical processes of synchronization are apparent in the coordination underlying everyday joint actions such as martial art exercises, hand-clapping games, and conversations. The import of this evidence is that emergent dynamic patterns such as synchronization are the behavioral order that any neural substrate supporting joint action (e.g., mirror systems) would have to sustain.

  14. Environmental Compliance Issue Coordination

    Science.gov (United States)

    An order to establish the Department of Energy (DOE) requirements for coordination of significant environmental compliance issues to ensure timely development and consistent application of Departmental environmental policy and guidance

  15. [Coordination and donation].

    Science.gov (United States)

    Elizalde, J; Lorente, M

    2006-01-01

    The progressive incorporation of organ transplants as a therapeutic resource resulted in organisational adaptation and overall transplant management, leading to the emergence of the figure of the transplant coordinator in the mid-1980s. In Spain, the National Organisation of Transplants (Organización Nacional de Transplantes - ONT) was created, establishing a system - called the "Spanish model" - based on a network of coordinators at three levels: national, the autonomous community and the hospital. This organisational structure is a point of reference at the world level. The prevalence of the Intensive Medicine specialisation amongst hospital transplant coordinators is remarkable. The majority of organs proceed from brain-dead patients with beating hearts and this requires the infrastructure offered by intensive care units. The functions of the coordinator can be summarised in guaranteeing a synchrony of all the elements and teams that come together in an organisational chain that has come to be called the "process of donation". Schematically, the crucial points that the hospital coordinator develops are the following: - Detection of the potential donor. - Maintenance of the donor. - Diagnosis of brain death. - Family consent. - Preparation of the hospital logistics. - Helping the relatives. - Direct involvement in the Program of Guarantee of Quality. - Person of reference in any activity related to the transplant. It would be desirable to achieve the creation of transplant coordination teams, with univocal messages, professionalism and a permanent input of the so-called "human factor", which is so necessary and also so close to the transplant world.

  16. Continuous parallel coordinates.

    Science.gov (United States)

    Heinrich, Julian; Weiskopf, Daniel

    2009-01-01

    Typical scientific data is represented on a grid with appropriate interpolation or approximation schemes,defined on a continuous domain. The visualization of such data in parallel coordinates may reveal patterns latently contained in the data and thus can improve the understanding of multidimensional relations. In this paper, we adopt the concept of continuous scatterplots for the visualization of spatially continuous input data to derive a density model for parallel coordinates. Based on the point-line duality between scatterplots and parallel coordinates, we propose a mathematical model that maps density from a continuous scatterplot to parallel coordinates and present different algorithms for both numerical and analytical computation of the resulting density field. In addition, we show how the 2-D model can be used to successively construct continuous parallel coordinates with an arbitrary number of dimensions. Since continuous parallel coordinates interpolate data values within grid cells, a scalable and dense visualization is achieved, which will be demonstrated for typical multi-variate scientific data.

  17. Magnetic Coordinate Systems

    Science.gov (United States)

    Laundal, K. M.; Richmond, A. D.

    2017-03-01

    Geospace phenomena such as the aurora, plasma motion, ionospheric currents and associated magnetic field disturbances are highly organized by Earth's main magnetic field. This is due to the fact that the charged particles that comprise space plasma can move almost freely along magnetic field lines, but not across them. For this reason it is sensible to present such phenomena relative to Earth's magnetic field. A large variety of magnetic coordinate systems exist, designed for different purposes and regions, ranging from the magnetopause to the ionosphere. In this paper we review the most common magnetic coordinate systems and describe how they are defined, where they are used, and how to convert between them. The definitions are presented based on the spherical harmonic expansion coefficients of the International Geomagnetic Reference Field (IGRF) and, in some of the coordinate systems, the position of the Sun which we show how to calculate from the time and date. The most detailed coordinate systems take the full IGRF into account and define magnetic latitude and longitude such that they are constant along field lines. These coordinate systems, which are useful at ionospheric altitudes, are non-orthogonal. We show how to handle vectors and vector calculus in such coordinates, and discuss how systematic errors may appear if this is not done correctly.

  18. Identification of coordination factors affecting building projects performance

    Directory of Open Access Journals (Sweden)

    Wesam Salah Alaloul

    2016-09-01

    Full Text Available Construction projects performance requires improvement to fulfil the complexity of the stakeholders’ needs and expectations. Coordination process is proposed as an efficient solution for weak performance of construction projects. Therefore, coordination factors are vital in ensuring a successful implementation of all project phases. This study aimed to identify and prioritise coordination factors that influence the performance of building projects in Malaysian context. A vast body of literature on coordination process was reviewed and resulted in 53 coordination factor. Three rounds of Delphi technique were conducted. The most effective coordination factors were ranked based on the Relative Importance Index (RII such as Scheduling (RII = 0.97, Quality assurance plan (RII = 0.93, and all parties’ participation in plans (RII = 0.89. These coordination factors have fulfilled the research gap and provided better management and higher performance for project parties. The results offer insightful perspectives to define the most effective coordination factors, for addressing the dependency between project tasks and the parties to enhance project performance.

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

    Science.gov (United States)

    Luczynski, Kevin C; Hanley, Gregory P

    2014-01-01

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

  20. A Scheduling Problem for Hospital Operating Theatre

    CERN Document Server

    Sufahani, Suliadi F; Ismail, Zuhaimy

    2012-01-01

    This paper provides a classification of real scheduling problems. Various ways have been examined and described on the problem. Scheduling problem faces a tremendous challenges and difficulties in order to meet the preferences of the consumer. Dealing with scheduling problem is complicated, inefficient and time-consuming. This study aims to develop a mathematical model for scheduling the operating theatre during peak and off peak time. Scheduling problem is a well known optimization problem and the goal is to find the best possible optimal solution. In this paper, we used integer linear programming technique for scheduling problem in a high level of synthesis. In addition, time and resource constrained scheduling was used. An optimal result was fully obtained by using the software GLPK/AMPL. This model can be adopted to solve other scheduling problems, such as the Lecture Theatre, Cinemas and Work Shift.

  1. Immunization Schedules for Infants and Children

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

  2. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

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

  3. GSA eLibrary Schedules and Contracts

    Data.gov (United States)

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

  4. CMS Planning and Scheduling System

    CERN Document Server

    Kotamaki, M

    1998-01-01

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

  5. LDRD Report: Scheduling Irregular Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Boman, Erik G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2014-10-01

    This LDRD project was a campus exec fellowship to fund (in part) Donald Nguyen’s PhD research at UT-Austin. His work has focused on parallel programming models, and scheduling irregular algorithms on shared-memory systems using the Galois framework. Galois provides a simple but powerful way for users and applications to automatically obtain good parallel performance using certain supported data containers. The naïve user can write serial code, while advanced users can optimize performance by advanced features, such as specifying the scheduling policy. Galois was used to parallelize two sparse matrix reordering schemes: RCM and Sloan. Such reordering is important in high-performance computing to obtain better data locality and thus reduce run times.

  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. Building Better Nurse Scheduling Algorithms

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

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

  8. Parabolic refined invariants and Macdonald polynomials

    CERN Document Server

    Chuang, Wu-yen; Donagi, Ron; Pantev, Tony

    2013-01-01

    A string theoretic derivation is given for the conjecture of Hausel, Letellier, and Rodriguez-Villegas on the cohomology of character varieties with marked points. Their formula is identified with a refined BPS expansion in the stable pair theory of a local root stack, generalizing previous work of the first two authors in collaboration with G. Pan. Haiman's geometric construction for Macdonald polynomials is shown to emerge naturally in this context via geometric engineering. In particular this yields a new conjectural relation between Macdonald polynomials and refined local orbifold curve counting invariants. The string theoretic approach also leads to a new spectral cover construction for parabolic Higgs bundles in terms of holomorphic symplectic orbifolds.

  9. Adaptive Mesh Refinement for Characteristic Grids

    CERN Document Server

    Thornburg, Jonathan

    2009-01-01

    I consider techniques for Berger-Oliger adaptive mesh refinement (AMR) when numerically solving partial differential equations with wave-like solutions, using characteristic (double-null) grids. Such AMR algorithms are naturally recursive, and the best-known past Berger-Oliger characteristic AMR algorithm, that of Pretorius & Lehner (J. Comp. Phys. 198 (2004), 10), recurses on individual "diamond" characteristic grid cells. This leads to the use of fine-grained memory management, with individual grid cells kept in 2-dimensional linked lists at each refinement level. This complicates the implementation and adds overhead in both space and time. Here I describe a Berger-Oliger characteristic AMR algorithm which instead recurses on null \\emph{slices}. This algorithm is very similar to the usual Cauchy Berger-Oliger algorithm, and uses relatively coarse-grained memory management, allowing entire null slices to be stored stored in contiguous arrays in memory. The algorithm is very efficient in both space and ti...

  10. Crystallization in lactose refining-a review.

    Science.gov (United States)

    Wong, Shin Yee; Hartel, Richard W

    2014-03-01

    In the dairy industry, crystallization is an important separation process used in the refining of lactose from whey solutions. In the refining operation, lactose crystals are separated from the whey solution through nucleation, growth, and/or aggregation. The rate of crystallization is determined by the combined effect of crystallizer design, processing parameters, and impurities on the kinetics of the process. This review summarizes studies on lactose crystallization, including the mechanism, theory of crystallization, and the impact of various factors affecting the crystallization kinetics. In addition, an overview of the industrial crystallization operation highlights the problems faced by the lactose manufacturer. The approaches that are beneficial to the lactose manufacturer for process optimization or improvement are summarized in this review. Over the years, much knowledge has been acquired through extensive research. However, the industrial crystallization process is still far from optimized. Therefore, future effort should focus on transferring the new knowledge and technology to the dairy industry.

  11. Cleaning Data with OpenRefine

    Directory of Open Access Journals (Sweden)

    Seth van Hooland

    2013-08-01

    Full Text Available Duplicate records, empty values and inconsistent formats are phenomena we should be prepared to deal with when using historical data sets. This lesson will teach you how to discover inconsistencies in data contained within a spreadsheet or a database. As we increasingly share, aggregate and reuse data on the web, historians will need to respond to data quality issues which inevitably pop up. Using a program called OpenRefine, you will be able to easily identify systematic errors such as blank cells, duplicates, spelling inconsistencies, etc. OpenRefine not only allows you to quickly diagnose the accuracy of your data, but also to act upon certain errors in an automated manner.

  12. Using supercritical fluids to refine hydrocarbons

    Science.gov (United States)

    Yarbro, Stephen Lee

    2014-11-25

    This is a method to reactively refine hydrocarbons, such as heavy oils with API gravities of less than 20.degree. and bitumen-like hydrocarbons with viscosities greater than 1000 cp at standard temperature and pressure using a selected fluid at supercritical conditions. The reaction portion of the method delivers lighter weight, more volatile hydrocarbons to an attached contacting device that operates in mixed subcritical or supercritical modes. This separates the reaction products into portions that are viable for use or sale without further conventional refining and hydro-processing techniques. This method produces valuable products with fewer processing steps, lower costs, increased worker safety due to less processing and handling, allow greater opportunity for new oil field development and subsequent positive economic impact, reduce related carbon dioxide, and wastes typical with conventional refineries.

  13. European refiners re-adjust margins strategy

    Energy Technology Data Exchange (ETDEWEB)

    Gonzalez, R.G. [ed.

    1996-05-01

    Refiners in Europe are adjusting operating strategies to reflect the volatilities of tight operating margins. From the unexpected availability of quality crudes (e.g., Brent, 0.3% sulfur), to the role of government in refinery planning, the European refining industry is positioning itself to reverse the past few years of steadily declining profitability. Unlike expected increases in US gasoline demand, European gasoline consumption is not expected to increase, and heavy fuel oil consumption is also declining. However, diesel fuel consumption is expected to increase, even though diesel processing capacity has recently decreased (i.e., more imports). Some of the possible strategies that Europeans may adapt to improve margins and reduce volatility include: Increase conversion capacity to supply growing demand for middle distillates and LPG; alleviate refinery cash flow problems with alliances; and direct discretionary investment toward retail merchandising (unless there is a clear trend toward a widening of the sweet-sour crude price differential).

  14. Security Policy Enforcement Through Refinement Process

    CERN Document Server

    Stouls, Nicolas

    2010-01-01

    In the area of networks, a common method to enforce a security policy expressed in a high-level language is based on an ad-hoc and manual rewriting process. We argue that it is possible to build a formal link between concrete and abstract terms, which can be dynamically computed from the environment data. In order to progressively introduce configuration data and then simplify the proof obligations, we use the B refinement process. We present a case study modeling a network monitor. This program, described by refinement following the layers of the TCP/IP suite protocol, has to warn for all observed events which do not respect the security policy. To design this model, we use the event-B method because it is suitable for modeling network concepts. This work has been done within the framework of the POTESTAT project, based on the research of network testing methods from a high-level security policy.

  15. HOW GOOD IS A DENSE SHOP SCHEDULE?

    Institute of Scientific and Technical Information of China (English)

    陈礴; 俞文(鱼此)

    2001-01-01

    In this paper, we study a class of simple and easy-to-construct shop schedules, known as dense schedules. We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones. For dense open-shop schedules, we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture.

  16. Scheduling Coast Guard District Cutters

    Science.gov (United States)

    1992-09-01

    DESCRIPTION ..... ............ .. 14 D. COSTS, PENALTIES, AND MEASURES OF EFFECTIVENESS 15 iv IV . COMPUTATIONAL EXPERIENCE ............ 19 A. TEST PROBLEMS...used. Using the model of Chapter III, computational performance for a year’s worth of actual data from the First District is presented in Chapter IV ...2G, B-2NY, B-2SAR, C); t - week the cutter assumes the patrol status. COSTO - cost of scheduling cutter i to patrol k; (1 if ship i is available for

  17. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

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

  18. Solidification Based Grain Refinement in Steels

    Science.gov (United States)

    2009-07-24

    and a coarser microstructure forms (See Figure 17). ROLE OF COBALT ALUMINATE CoAI204 produced very different results in the 1010 and 1030 TA...determine what role CoAl204 played in both steels. Other researchers have observed refinement with cobalt aluminate .2"󈧙 Their work has been using...produced in this work. The one unexplained result for CoAl204 is the different undercooling behavior found. Cobalt aluminate reduced undercooling in the

  19. Mesh refinement strategy for optimal control problems

    OpenAIRE

    Paiva, Luis Tiago; Fontes, Fernando,

    2013-01-01

    International audience; Direct methods are becoming the most used technique to solve nonlinear optimal control problems. Regular time meshes having equidistant spacing are frequently used. However, in some cases these meshes cannot cope accurately with nonlinear behavior. One way to improve the solution is to select a new mesh with a greater number of nodes. Another way, involves adaptive mesh refinement. In this case, the mesh nodes have non equidistant spacing which allow a non uniform node...

  20. Understanding Solidification Based Grain Refinement in Steels

    Science.gov (United States)

    2014-12-18

    interatomic spacing along [uvw]s, and 0 = the angle between the [uvwjjand [uvw]n.^’ Work on the grain refinement of aluminum and magnesium alloys has found...chemistry ternary plot from ASPEX system. The author found some evidence of reactions occurring with some rare earth oxide or sulfide inclusions and... sulfide .^^"^^ Another approach would be to react a sample of misch metal or rare earth silicide at elevated temperatures to form the desired oxide or

  1. REFINEMENTS OF THE FAN-TODD'S INEQUALITIES

    Institute of Scientific and Technical Information of China (English)

    庄国基

    2002-01-01

    Refinements to inequalities oninner product spaces are presented. In this respect, inequalities dealt with in this paper are: Cauchy's inequality, Bessel's inequality, Fan-Todd's inequality and Fan-Todd's determinantal inequality. In each case, a strictly increasing function is put forward, which lies between the smaller and the larger quantities of each inequality. As a result,an improved condition for equality of the Fan-Todd's determinantal inequality is deduced.

  2. Vehicle-Scheduling Model for Operation Based on Single-Depot

    Directory of Open Access Journals (Sweden)

    Jing Teng

    2015-01-01

    Full Text Available Centralized assigning of bus running between multiple lines can save operation cost of transit agency. As more big transit terminals can serve for multiple bus lines being established, coordinating the operation of these lines’ vehicles becomes more economical and perspective. This paper proposed a vehicle-scheduling model for multiple lines which share vehicle resource together and service based on the same terminal. The optimization goal is to minimize the number of vehicles while considering reducing the invalid operation time under the constraint of timetable schemes and matching time for vehicle crossing two lines. A case in Ningbo city, China, was conducted to compare the performance of the cross-line schedules with the original schedules assigning vehicles within respective lines. The optimized schedules can reduce 7.14% vehicles in need while meeting the timetable schemes of all bus lines, which indicated that the proposed model is suitable for operation practice.

  3. Integrated scheduling of a container handling system with simultaneous loading and discharging operations

    Science.gov (United States)

    Li, Chen; Lu, Zhiqiang; Han, Xiaole; Zhang, Yuejun; Wang, Li

    2016-03-01

    The integrated scheduling of container handling systems aims to optimize the coordination and overall utilization of all handling equipment, so as to minimize the makespan of a given set of container tasks. A modified disjunctive graph is proposed and a mixed 0-1 programming model is formulated. A heuristic algorithm is presented, in which the original problem is divided into two subproblems. In the first subproblem, contiguous bay crane operations are applied to obtain a good quay crane schedule. In the second subproblem, proper internal truck and yard crane schedules are generated to match the given quay crane schedule. Furthermore, a genetic algorithm based on the heuristic algorithm is developed to search for better solutions. The computational results show that the proposed algorithm can efficiently find high-quality solutions. They also indicate the effectiveness of simultaneous loading and discharging operations compared with separate ones.

  4. Guidelines of Decommissioning Schedule Establishment

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-15

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

  5. Crystal Structure Refinement of Synthetic Pure Gyrolite

    Directory of Open Access Journals (Sweden)

    Arūnas Baltušnikas

    2015-03-01

    Full Text Available Pure calcium silicate hydrate – gyrolite was prepared under the saturated steam pressure at 473 K temperature in rotating autoclave. The crystal structure of synthetic gyrolite was investigated by X-ray diffraction and refined using Le Bail, Rietveld and crystal structure modelling methods. Background, peak shape parameters and verification of the space group were performed by the Le Bail full pattern decomposition. Peculiarities of interlayer sheet X of gyrolite unit cell were highlighted by Rietveld refinement. Possible atomic arrangement in interlayer sheet X was solved by global optimization method. Most likelihood crystal structure model of gyrolite was calculated by final Rietveld refinement. It was crystallographically showed, that cell parameters are: a = 0.9713(2 nm, b = 0.9715(2 nm, c = 2.2442(3 nm and alfa = 95.48(2 º, beta = 91.45(2 °, gamma = l20.05(3 °.DOI: http://dx.doi.org/10.5755/j01.ms.21.1.5460

  6. Mesh refinement strategy for optimal control problems

    Science.gov (United States)

    Paiva, L. T.; Fontes, F. A. C. C.

    2013-10-01

    Direct methods are becoming the most used technique to solve nonlinear optimal control problems. Regular time meshes having equidistant spacing are frequently used. However, in some cases these meshes cannot cope accurately with nonlinear behavior. One way to improve the solution is to select a new mesh with a greater number of nodes. Another way, involves adaptive mesh refinement. In this case, the mesh nodes have non equidistant spacing which allow a non uniform nodes collocation. In the method presented in this paper, a time mesh refinement strategy based on the local error is developed. After computing a solution in a coarse mesh, the local error is evaluated, which gives information about the subintervals of time domain where refinement is needed. This procedure is repeated until the local error reaches a user-specified threshold. The technique is applied to solve the car-like vehicle problem aiming minimum consumption. The approach developed in this paper leads to results with greater accuracy and yet with lower overall computational time as compared to using a time meshes having equidistant spacing.

  7. Refining of biodiesel by ceramic membrane separation

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Yong; Ou, Shiyi; Tan, Yanlai; Tang, Shuze [Department of Food Science and Engineering, Jinan University, Guangzhou 510632 (China); Wang, Xingguo; Liu, Yuanfa [School of Food Science and Technology, Jiangnan University, Wuxi 214112 (China)

    2009-03-15

    A ceramic membrane separation process for biodiesel refining was developed to reduce the considerable usage of water needed in the conventional water washing process. Crude biodiesel produced by refined palm oil was micro-filtered by ceramic membranes of the pore size of 0.6, 0.2 and 0.1 {mu}m to remove the residual soap and free glycerol, at the transmembrane pressure of 0.15 MPa and temperature of 60 C. The flux through membrane maintained at 300 L m{sup -} {sup 2} h{sup -} {sup 1} when the volumetric concentrated ratio reached 4. The content of potassium, sodium, calcium and magnesium in the whole permeate was 1.40, 1.78, 0.81 and 0.20 mg/kg respectively, as determined by inductively coupled plasma-atomic emission spectroscopy. These values are lower than the EN 14538 specifications. The residual free glycerol in the permeate was estimated by water extraction, its value was 0.0108 wt.%. This ceramic membrane technology was a potential environmental process for the refining of biodiesel. (author)

  8. Using Induction to Refine Information Retrieval Strategies

    Science.gov (United States)

    Baudin, Catherine; Pell, Barney; Kedar, Smadar

    1994-01-01

    Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices describing the document's content. Such retrieval strategies increase the set of relevant documents retrieved (increase recall), but at the expense of returning additional irrelevant documents (decrease precision). Usually in conceptual information retrieval systems this tradeoff is managed by hand and with difficulty. This paper discusses ways of managing this tradeoff by the application of standard induction algorithms to refine the retrieval strategies in an engineering design domain. We gathered examples of query/retrieval pairs during the system's operation using feedback from a user on the retrieved information. We then fed these examples to the induction algorithm and generated decision trees that refine the existing set of retrieval strategies. We found that (1) induction improved the precision on a set of queries generated by another user, without a significant loss in recall, and (2) in an interactive mode, the decision trees pointed out flaws in the retrieval and indexing knowledge and suggested ways to refine the retrieval strategies.

  9. Parallel object-oriented adaptive mesh refinement

    Energy Technology Data Exchange (ETDEWEB)

    Balsara, D.; Quinlan, D.J.

    1997-04-01

    In this paper we study adaptive mesh refinement (AMR) for elliptic and hyperbolic systems. We use the Asynchronous Fast Adaptive Composite Grid Method (AFACX), a parallel algorithm based upon the of Fast Adaptive Composite Grid Method (FAC) as a test case of an adaptive elliptic solver. For our hyperbolic system example we use TVD and ENO schemes for solving the Euler and MHD equations. We use the structured grid load balancer MLB as a tool for obtaining a load balanced distribution in a parallel environment. Parallel adaptive mesh refinement poses difficulties in expressing both the basic single grid solver, whether elliptic or hyperbolic, in a fashion that parallelizes seamlessly. It also requires that these basic solvers work together within the adaptive mesh refinement algorithm which uses the single grid solvers as one part of its adaptive solution process. We show that use of AMR++, an object-oriented library within the OVERTURE Framework, simplifies the development of AMR applications. Parallel support is provided and abstracted through the use of the P++ parallel array class.

  10. Formal refinement of extended state machines

    Directory of Open Access Journals (Sweden)

    Thomas Fayolle

    2016-06-01

    Full Text Available In a traditional formal development process, e.g. using the B method, the informal user requirements are (manually translated into a global abstract formal specification. This translation is especially difficult to achieve. The Event-B method was developed to incrementally and formally construct such a specification using stepwise refinement. Each increment takes into account new properties and system aspects. In this paper, we propose to couple a graphical notation called Algebraic State-Transition Diagrams (ASTD with an Event-B specification in order to provide a better understanding of the software behaviour. The dynamic behaviour is captured by the ASTD, which is based on automata and process algebra operators, while the data model is described by means of an Event-B specification. We propose a methodology to incrementally refine such specification couplings, taking into account new refinement relations and consistency conditions between the control specification and the data specification. We compare the specifications obtained using each approach for readability and proof complexity. The advantages and drawbacks of the traditional approach and of our methodology are discussed. The whole process is illustrated by a railway CBTC-like case study. Our approach is supported by tools for translating ASTD's into B and Event-B into B.

  11. 19 CFR 122.63 - Scheduled airlines.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 1 2010-04-01 2010-04-01 false Scheduled airlines. 122.63 Section 122.63 Customs... AIR COMMERCE REGULATIONS Clearance of Aircraft and Permission To Depart § 122.63 Scheduled airlines... scheduled airlines covered by this subpart. (a) Clearance at other than airport of final departure. Aircraft...

  12. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  13. Models and algorithms for stochastic online scheduling

    NARCIS (Netherlands)

    Megow, N.; Uetz, Marc Jochen; Vredeveld, T.

    We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that

  14. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations..., the Board's General Manager will update the FOIA Fee Schedule once every 12 months. The previous...

  15. Optimization of Daily Flight Training Schedules

    Science.gov (United States)

    2014-03-01

    training syllabus . 14. SUBJECT TERMS Scheduling, optimization, flight training, Advance Strike Training, pilot 15. NUMBER OF...SKEDSOs that can help them increase throughput of students in the advanced strike training syllabus . vi THIS PAGE INTENTIONALLY LEFT BLANK vii...instructor pilots with student naval aviators to achieve syllabus events. The schedule is built manually each day by squadron scheduling officers (SKEDSOs

  16. Centralized scheduling an unanticipated revenue cycle opportunity.

    Science.gov (United States)

    O'Neill, Daniel P; Kenniff, Peter B

    2007-09-01

    Centralized outpatient scheduling can provide acute care hospitals with accessibility and service levels equal to freestanding facilities, enabling hospitals to recapture lost market share. Two implementation strategies are critical to the success of centralized scheduling: Correctly developing the schedule. Managing the incoming call volume.

  17. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

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

  18. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  19. A Formal Software Development Approach Using Refinement Calculus

    Institute of Scientific and Technical Information of China (English)

    王云峰; 庞军; 等

    2001-01-01

    The advantage of COOZ(Complete Object-Oriented Z) is to specify large scale software,but it does not support refinement calculus.Thus its application is comfined for software development.Including refinement calculus into COOZ overcomes its disadvantage during design and implementation.The separation between the design and implementation for structure and notation is removed as well .Then the software can be developed smoothly in the same frame.The combination of COOZ and refinement calculus can build object-oriented frame,in which the specification in COOZ is refined stepwise to code by calculus.In this paper,the development model is established.which is based on COOZ and refinement calculus.Data refinement is harder to deal with in a refinement tool than ordinary algorithmic refinement,since data refinement usually has to be done on a large program component at once.As to the implementation technology of refinement calculus,the data refinement calculator is constructed and an approach for data refinement which is based on data refinement calculus and program window inference is offered.

  20. A Formal Software Development Approach Using Refinement Calculus

    Institute of Scientific and Technical Information of China (English)

    WANG Yunfeng; PANG Jun; ZHA Ming; YANG Zhaohui; ZHENG Guoliang

    2001-01-01

    The advantage of COOZ (Complete Object-Oriented Z) is to specify large scale software, but it does not support refinement calculus. Thus its applica tion is confined for software development. Including refinement calculus into COOZ overcomes its disadvantage during design and implementation. The separation be tween the design and implementation for structure and notation is removed as well. Then the software can be developed smoothly in the same frame. The combina tion of COOZ and refinement calculus can build object-oriented frame, in which the specification in COOZ is refined stepwise to code by calculus. In this paper, the development model is established, which is based on COOZ and refinement calculus. Data refinement is harder to deal with in a refinement tool than ordinary algorithmic refinement, since data refinement usually has to be done on a large program compo nent at once. As to the implementation technology of refinement calculus, the data refinement calculator is constructed and an approach for data refinement which is based on data refinement calculus and program window inference is offered.

  1. Distributed Wi-Fi Interference Coordination for Dense Deployments

    DEFF Research Database (Denmark)

    Abinader, Fuad; Choudhury, Sayantan; Souza Jr., Vicente A.

    2017-01-01

    with proper OBSS interference coordination. We propose a novel distributed interference coordination scheme for Wi-Fi scheduled mode operation, and evaluate it through system level simulations. Results indicate that the proposed scheme provides significant improvements over Enhanced Distributed Channel Access......Unlicensed spectrum is increasingly being used by mobile operators to meet the mobile traffic demand, and Wi-Fi is foreseen as one of the technologies for implementing mobile traffic offloading. However, Wi-Fi efficiency does not scale well as node density increases, and IEEE 802.11ax Task Group...... (TGax) was created in 2014 for developing WiFi technology enhancements in dense deployments. This paper investigates Wi-Fi performance in the presence of Overlapping Basic Subscriber Set (OBSS) Wi-Fi networks in indoor dense deployments. We observe that Wi-Fi could benefit from scheduled operation...

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

    Science.gov (United States)

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

    2008-01-01

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

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

    NARCIS (Netherlands)

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

    1990-01-01

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

  4. New VLBI2010 scheduling strategies and implications on the terrestrial reference frames.

    Science.gov (United States)

    Sun, Jing; Böhm, Johannes; Nilsson, Tobias; Krásná, Hana; Böhm, Sigrid; Schuh, Harald

    In connection with the work for the next generation VLBI2010 Global Observing System (VGOS) of the International VLBI Service for Geodesy and Astrometry, a new scheduling package (Vie_Sched) has been developed at the Vienna University of Technology as a part of the Vienna VLBI Software. In addition to the classical station-based approach it is equipped with a new scheduling strategy based on the radio sources to be observed. We introduce different configurations of source-based scheduling options and investigate the implications on present and future VLBI2010 geodetic schedules. By comparison to existing VLBI schedules of the continuous campaign CONT11, we find that the source-based approach with two sources has a performance similar to the station-based approach in terms of number of observations, sky coverage, and geodetic parameters. For an artificial 16 station VLBI2010 network, the source-based approach with four sources provides an improved distribution of source observations on the celestial sphere. Monte Carlo simulations yield slightly better repeatabilities of station coordinates with the source-based approach with two sources or four sources than the classical strategy. The new VLBI scheduling software with its alternative scheduling strategy offers a promising option with respect to applications of the VGOS.

  5. CAMERA: Coordination and Management Environments for Responsive Agents

    Science.gov (United States)

    2005-02-01

    simple solution, the outcome was much better than the pre- existing way of doing business , which involved coordinating the schedules by talking on...a probabilistic model based on statistical mechanics. In our implementation of SA we start by randomly assigning resources to tasks until all...Program: http://www.isi.edu/~szekely/antsebook/ ebook / The e-book was edited by Alejandro Bugacov, Stephen Fitzpatrick, Gabor Karsai, Victor Lesser

  6. Grain Refinement of Permanent Mold Cast Copper Base Alloys

    Energy Technology Data Exchange (ETDEWEB)

    M.Sadayappan; J.P.Thomson; M.Elboujdaini; G.Ping Gu; M. Sahoo

    2005-04-01

    Grain refinement is a well established process for many cast and wrought alloys. The mechanical properties of various alloys could be enhanced by reducing the grain size. Refinement is also known to improve casting characteristics such as fluidity and hot tearing. Grain refinement of copper-base alloys is not widely used, especially in sand casting process. However, in permanent mold casting of copper alloys it is now common to use grain refinement to counteract the problem of severe hot tearing which also improves the pressure tightness of plumbing components. The mechanism of grain refinement in copper-base alloys is not well understood. The issues to be studied include the effect of minor alloy additions on the microstructure, their interaction with the grain refiner, effect of cooling rate, and loss of grain refinement (fading). In this investigation, efforts were made to explore and understand grain refinement of copper alloys, especially in permanent mold casting conditions.

  7. The Analysis of the Refined Financial Management of Modern Enterprises

    OpenAIRE

    Li Ran

    2016-01-01

    This paper briefly introduces the concept of the refined financial management, elaborates on its characteristics and puts forward some main points about it. It also comes up with some personal suggestions for reference on effective ways of refining financial management.

  8. Coordinating Interactions: The Event Coordination Notation

    DEFF Research Database (Denmark)

    Kindler, Ekkart

    on a much more technical level. The Event Coordination Notation (ECNO) allows modelling the behaviour of an application on a high level of abstraction that is closer to the application’s domain than to the software realizing it. Still, these models contain all necessary details for actually executing...... implementation of ECNO, which consists of a modelling environment based on Eclipse and the Eclipse Modeling Framework (EMF) and an execution engine, which fully supports all the concepts and features of ECNO discussed in this technical report. All the examples are based on EMF, but the ECNO Engine can be used......The purpose of a domain model is to concisely capture the concepts of an application’s domain, and their relation among each other. Even though the main purpose of domain models is not on implementing the application, major parts of an application can be generated from the application’s domain...

  9. Bayesian Optimisation Algorithm for Nurse Scheduling

    CERN Document Server

    Li, Jingpeng

    2008-01-01

    Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurses assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

  10. Multicore Real-Time Scheduling

    Science.gov (United States)

    2015-05-18

    University Need of Coordinated Protection Need to constrain interference through each resource type • CPU cycles • Cache • Memory Banks • Memory Bus / inter ...to different parts of same tasks • Down to different colors for each page of a task Inter -task shared partitions • Shared partitions between parts of

  11. Quantifying linguistic coordination

    DEFF Research Database (Denmark)

    Fusaroli, Riccardo; Tylén, Kristian

    ). We employ nominal recurrence analysis (Orsucci et al 2005, Dale et al 2011) on the decision-making conversations between the participants. We report strong correlations between various indexes of recurrence and collective performance. We argue this method allows us to quantify the qualities......Language has been defined as a social coordination device (Clark 1996) enabling innovative modalities of joint action. However, the exact coordinative dynamics over time and their effects are still insufficiently investigated and quantified. Relying on the data produced in a collective decision...

  12. Introduction to Coordination Chemistry

    CERN Document Server

    Lawrance, Geoffrey Alan

    2010-01-01

    Introduction to Coordination Chemistry examines and explains how metals and molecules that bind as ligands interact, and the consequences of this assembly process. This book describes the chemical and physical properties and behavior of the complex assemblies that form, and applications that may arise as a result of these properties. Coordination complexes are an important but often hidden part of our world?even part of us?and what they do is probed in this book. This book distills the essence of this topic for undergraduate students and for research scientists.

  13. Coordinate Standard Measurement Development

    Energy Technology Data Exchange (ETDEWEB)

    Hanshaw, R.A.

    2000-02-18

    A Shelton Precision Interferometer Base, which is used for calibration of coordinate standards, was improved through hardware replacement, software geometry error correction, and reduction of vibration effects. Substantial increases in resolution and reliability, as well as reduction in sampling time, were achieved through hardware replacement; vibration effects were reduced substantially through modification of the machine component dampening and software routines; and the majority of the machine's geometry error was corrected through software geometry error correction. Because of these modifications, the uncertainty of coordinate standards calibrated on this device has been reduced dramatically.

  14. Simplified Scheduling for Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Wouter van Kleunen

    2013-01-01

    Full Text Available The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this paper we present an extended set of simplified scheduling constraints which allows easy scheduling of underwater acoustic communication. We also present two algorithms for scheduling communications, i.e. a centralized scheduling approach and a distributed scheduling approach. The centralized approach achieves the highest throughput while the distributed approach aims to minimize the computation and communication overhead. We further show how the centralized scheduling approach can be extended with transmission dependencies to reduce the end-to-end delay of packets. We evaluate the performance of the centralized and distributed scheduling approaches using simulation. The centralized approach outperforms the distributed approach in terms of throughput, however we also show the distributed approach has significant benefits in terms of communication and computational overhead required to setup the schedule. We propose a novel way of estimating the performance of scheduling approaches using the ratio of modulation time and propagation delay. We show the performance is largely dictated by this ratio, although the number of links to be scheduled also has a minor impact on the performance.

  15. Reactive Scheduling in Multipurpose Batch Plants

    Science.gov (United States)

    Narayani, A.; Shaik, Munawar A.

    2010-10-01

    Scheduling is an important operation in process industries for improving resource utilization resulting in direct economic benefits. It has a two-fold objective of fulfilling customer orders within the specified time as well as maximizing the plant profit. Unexpected disturbances such as machine breakdown, arrival of rush orders and cancellation of orders affect the schedule of the plant. Reactive scheduling is generation of a new schedule which has minimum deviation from the original schedule in spite of the occurrence of unexpected events in the plant operation. Recently, Shaik & Floudas (2009) proposed a novel unified model for short-term scheduling of multipurpose batch plants using unit-specific event-based continuous time representation. In this paper, we extend the model of Shaik & Floudas (2009) to handle reactive scheduling.

  16. Routine environmental monitoring schedule, calendar year 1995

    Energy Technology Data Exchange (ETDEWEB)

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

    1994-12-01

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

  17. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    (schedules expected to perform well after some degree of modification when the environment changes). This thesis presents two fundamentally different approaches for scheduling job shops facing machine breakdowns. The first method is called neighbourhood based robustness and is based on an idea of minimising...... environments include machine breakdowns, uncertain processing times, workers getting sick, materials being delayed and the appearance of new jobs. These possible environmental changes mean that a schedule which was optimal for the information available at the time of scheduling can end up being highly...... suboptimal when it is implemented and subjected to the uncertainty of the real world. For this reason it is very important to find methods capable of creating robust schedules (schedules expected to perform well after a minimal amount of modification when the environment changes) or flexible schedules...

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

    Directory of Open Access Journals (Sweden)

    Jianhong Hao

    2015-01-01

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

  19. Coloured Petri Net Refinement Specification and Correctness Proof with Coq

    Science.gov (United States)

    Choppy, Christine; Mayero, Micaela; Petrucci, Laure

    2009-01-01

    In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of their type refinement in COQ. Then the COQ proof assistant is used to prove the refinement correctness lemma. An example adapted from a protocol example illustrates our work.

  20. Current State and Prospect of China's Refining Sector%Current State and Prospect of China's Refining Sector

    Institute of Scientific and Technical Information of China (English)

    Zhu He

    2012-01-01

    (1) China's refining capacity will reach 650 million tons per year, the cooperation with oil producing countries in refining sector will be strengthened and a diversified competitive framework for the sector will be further pushed forward.

  1. Coordination failure caused by sunspots

    DEFF Research Database (Denmark)

    Beugnot, Julie; Gürgüç, Zeynep; Øvlisen, Frederik Roose

    2012-01-01

    In a coordination game with Pareto-ranked equilibria, we study whether a sunspot can lead to either coordination on an inferior equilibrium (mis-coordination) or to out-of equilibrium behavior (dis-coordination). While much of the literature searches for mechanisms to attain coordination...... on the efficient equilibrium, we consider sunspots as a potential reason for coordination failure. We conduct an experiment with a three player 2x2x2 game in which coordination on the efficient equilibrium is easy and should normally occur. In the control session, we find almost perfect coordination on the payoff......-dominant equilibrium, but in the sunspot treatment, dis-coordination is frequent. Sunspots lead to significant inefficiency, and we conclude that sunspots can indeed cause coordination failure....

  2. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

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

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

  3. Scheduling of an aircraft fleet

    Science.gov (United States)

    Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

    1992-01-01

    Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

  4. Quantum Geometry of Refined Topological Strings

    CERN Document Server

    Aganagic, Mina; Dijkgraaf, Robbert; Krefl, Daniel; Vafa, Cumrun

    2011-01-01

    We consider branes in refined topological strings. We argue that their wave-functions satisfy a Schr\\"odinger equation depending on multiple times and prove this in the case where the topological string has a dual matrix model description. Furthermore, in the limit where one of the equivariant rotations approaches zero, the brane partition function satisfies a time-independent Schroedinger equation. We use this observation, as well as the back reaction of the brane on the closed string geometry, to offer an explanation of the connection between integrable systems and N=2 gauge systems in four dimensions observed by Nekrasov and Shatashvili.

  5. Quantum geometry of refined topological strings

    Science.gov (United States)

    Aganagic, Mina; Cheng, Miranda C. N.; Dijkgraaf, Robbert; Krefl, Daniel; Vafa, Cumrun

    2012-11-01

    We consider branes in refined topological strings. We argue that their wavefunctions satisfy a Schrödinger equation depending on multiple times and prove this in the case where the topological string has a dual matrix model description. Furthermore, in the limit where one of the equivariant rotations approaches zero, the brane partition function satisfies a time-independent Schrödinger equation. We use this observation, as well as the back reaction of the brane on the closed string geometry, to offer an explanation of the connection between integrable systems and {N}=2 gauge systems in four dimensions observed by Nekrasov and Shatashvili.

  6. A refinement driven component-based design

    DEFF Research Database (Denmark)

    Chen, Zhenbang; Liu, Zhiming; Ravn, Anders Peter;

    2007-01-01

    to integrate sophisticated checkers, generators and transformations. A feasible approach to ensuring high quality of such add-ins is to base them on sound formal foundations. This paper summarizes our research on the Refinement of Component and Object Systems (rCOS) and illustrates it with experiences from...... the work on the Common Component Modelling Example (CoCoME). This gives evidence that the formal techniques developed in rCOS can be integrated into a model-driven development process and shows where it may be integrated in computer-aided software engineering (CASE) tools for adding formally supported...

  7. Liquid rheology study on refined rapeseed oil

    Institute of Scientific and Technical Information of China (English)

    刘其梅; 罗迎社; 殷水平; 陈胜铭; 张党权; 彭万喜

    2008-01-01

    The rapeseed oil extracted from the mature seeds was purified by refining processing,and the rheological characteristic analysis of the viscosity and dynamic shear rate at gradient temperatures was made.The result shows that at 20,40,60 and 80 ℃ respectively,when the shear rate gradually rises,the torque increases accordingly but its viscosity does not vary distinctly.The result suggests that when rapeseed oil is used as the raw of edible oils and industries,the working procedures at high temperature will not influence its rheological characteristic distinctly.

  8. Retrenchment. An engineering variation on refinement

    Energy Technology Data Exchange (ETDEWEB)

    Banach, R.; Poppleton, M

    1999-07-01

    It is argued that refinement, in which I/O signatures stay the same, preconditions are weakened and postconditions strengthened, is too restrictive to describe all but a fraction of many realistic developments. An alternative notion is proposed called retrenchment, which allows information to migrate between I/O and state aspects of operations at different levels of abstraction, and which allows only a fraction of the high level behaviour to be captured at the low level. This permits more of the informal aspects of design to be formally captured and checked. The details are worked out for the B-Method. (author)

  9. Surface biotechnology for refining cochlear implants.

    Science.gov (United States)

    Tan, Fei; Walshe, Peter; Viani, Laura; Al-Rubeai, Mohamed

    2013-12-01

    The advent of the cochlear implant is phenomenal because it is the first surgical prosthesis that is capable of restoring one of the senses. The subsequent rapid evolution of cochlear implants through increasing complexity and functionality has been synchronized with the recent advancements in biotechnology. Surface biotechnology has refined cochlear implants by directly influencing the implant–tissue interface. Emerging surface biotechnology strategies are exemplified by nanofibrous polymeric materials, topographical surface modification, conducting polymer coatings, and neurotrophin-eluting implants. Although these novel developments have received individual attention in the recent literature, the time has come to investigate their collective applications to cochlear implants to restore lost hearing.

  10. Adaptive refinement tools for tetrahedral unstructured grids

    Science.gov (United States)

    Pao, S. Paul (Inventor); Abdol-Hamid, Khaled S. (Inventor)

    2011-01-01

    An exemplary embodiment providing one or more improvements includes software which is robust, efficient, and has a very fast run time for user directed grid enrichment and flow solution adaptive grid refinement. All user selectable options (e.g., the choice of functions, the choice of thresholds, etc.), other than a pre-marked cell list, can be entered on the command line. The ease of application is an asset for flow physics research and preliminary design CFD analysis where fast grid modification is often needed to deal with unanticipated development of flow details.

  11. Computing Refined Buneman Trees in Cubic Time

    DEFF Research Database (Denmark)

    Brodal, G.S.; Fagerberg, R.; Östlin, A.

    2003-01-01

    Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based tree reconstruction method. It always proposes fully resolved binary trees despite missing evidence...... in the underlying distance data. Distance based methods based on the theory of Buneman trees and refined Buneman trees avoid this problem by only proposing evolutionary trees whose edges satisfy a number of constraints. These trees might not be fully resolved but there is strong combinatorial evidence for each...

  12. Acoustic Logging Modeling by Refined Biot's Equations

    Science.gov (United States)

    Plyushchenkov, Boris D.; Turchaninov, Victor I.

    An explicit uniform completely conservative finite difference scheme for the refined Biot's equations is proposed. This system is modified according to the modern theory of dynamic permeability and tortuosity in a fluid-saturated elastic porous media. The approximate local boundary transparency conditions are constructed. The acoustic logging device is simulated by the choice of appropriate boundary conditions on its external surface. This scheme and these conditions are satisfactory for exploring borehole acoustic problems in permeable formations in a real axial-symmetrical situation. The developed approach can be adapted for a nonsymmetric case also.

  13. Refining thick brane models via electroweak data

    CERN Document Server

    Chumbes, A E R; Hott, M B

    2015-01-01

    After discussing the localization of Abelian and non-Abelian gauge fields and Higgs fields on a thick brane, we introduce a procedure of dimensional reduction and its consequences to the rescaled parameters of the boson sector of the Standard Model. The parameters encodes some power dependence on the extra dimension, usually narrow, warp factor and hence it also depend on the position related with the extra dimension inside the thick brane. In this vein, the observable parameters may be used to refine the braneworld models via the brane thickness.

  14. Formal language theory: refining the Chomsky hierarchy.

    Science.gov (United States)

    Jäger, Gerhard; Rogers, James

    2012-07-19

    The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages).

  15. A Technical Refinement of the Vernier Optometer.

    Science.gov (United States)

    1988-07-01

    Naa Aeropc Meia Reeac - -.- .r* ES * A TECHNICAL REFINEMENT OF THE VERNIER OPTOMETER William B. Cushman and Leonard A. Temme N DTIC fELECTE NOVI 6 W8...Vernier Optometer 12 PERSONAL AUTHOR(S) William B. Cushman* and Leonard A. Temme 14._ DATE_ OF_ REPORT_(YearMonth, _Day)_15_______COUN 13a14. DATE OF...Fellow 17 COSATI CODES 18 SUBJECT TERMS (Continue on reverse if necessary and identify by block number) FIELD GROUP SUB-GROUP Vernier optometer , laser

  16. Refining the asteroid taxonomy by polarimetric observations

    Science.gov (United States)

    Belskaya, I. N.; Fornasier, S.; Tozzi, G. P.; Gil-Hutton, R.; Cellino, A.; Antonyuk, K.; Krugly, Yu. N.; Dovgopol, A. N.; Faggi, S.

    2017-03-01

    We present new results of polarimetric observations of 15 main belt asteroids of different composition. By merging new and published data we determined polarimetric parameters characterizing individual asteroids and mean values of the same parameters characterizing different taxonomic classes. The majority of asteroids show polarimetric phase curves close to the average curve of the corresponding class. We show that using polarimetric data it is possible to refine asteroid taxonomy and derive a polarimetric classification for 283 main belt asteroids. Polarimetric observations of asteroid (21) Lutetia are found to exhibit possible variations of the position angle of the polarization plane over the surface.

  17. Relativistic MHD with adaptive mesh refinement

    Energy Technology Data Exchange (ETDEWEB)

    Anderson, Matthew [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, LA 70803-4001 (United States); Hirschmann, Eric W [Department of Physics and Astronomy, Brigham Young University, Provo, UT 84602 (United States); Liebling, Steven L [Department of Physics, Long Island University-C W Post Campus, Brookville, NY 11548 (United States); Neilsen, David [Department of Physics and Astronomy, Brigham Young University, Provo, UT 84602 (United States)

    2006-11-22

    This paper presents a new computer code to solve the general relativistic magnetohydrodynamics (GRMHD) equations using distributed parallel adaptive mesh refinement (AMR). The fluid equations are solved using a finite difference convex ENO method (CENO) in 3 + 1 dimensions, and the AMR is Berger-Oliger. Hyperbolic divergence cleaning is used to control the {nabla} . B = 0 constraint. We present results from three flat space tests, and examine the accretion of a fluid onto a Schwarzschild black hole, reproducing the Michel solution. The AMR simulations substantially improve performance while reproducing the resolution equivalent unigrid simulation results. Finally, we discuss strong scaling results for parallel unigrid and AMR runs.

  18. Unitary appreciative inquiry: evolution and refinement.

    Science.gov (United States)

    Cowling, W Richard; Repede, Elizabeth

    2010-01-01

    Unitary appreciative inquiry (UAI), developed over the past 20 years, provides an orientation and process for uncovering human wholeness and discovering life patterning in individuals and groups. Refinements and a description of studies using UAI are presented. Assumptions and conceptual underpinnings of the method distinguishing its contributions from other methods are reported. Data generation strategies that capture human wholeness and elucidate life patterning are proposed. Data synopsis as an alternative to analysis is clarified and explicated. Standards that suggest enhancing the legitimacy of knowledge and credibility of research are specified. Potential expansions of UAI offer possibilities for extending epistemologies, aesthetic integration, and theory development.

  19. Coordinating Work with Groupware

    DEFF Research Database (Denmark)

    Pors, Jens Kaaber; Simonsen, Jesper

    2003-01-01

    One important goal of employing groupware is to make possible complex collaboration between geographically distributed groups. This requires a dual transformation of both technology and work practice. The challenge is to re­duce the complexity of the coordination work by successfully inte­grating...

  20. Rockin' Readers Coordinator Handbook.

    Science.gov (United States)

    Alachua County Schools, Gainesville, FL.

    This coordinator's handbook describes the "Rockin' Readers" program, in which senior-citizen volunteers are matched with specifically targeted at-risk children (usually of kindergarten age or slightly older) in Alachua County, Florida, who tested below their peer group in language development and reading readiness skills. The handbook…

  1. Explicit Spin Coordinates

    CERN Document Server

    Hunter, G; Hunter, Geoffrey; Schlifer, Ian

    2005-01-01

    The recently established existence of spherical harmonic functions, $Y_\\ell^{m}(\\theta,\\phi)$ for half-odd-integer values of $\\ell$ and $m$, allows for the introduction into quantum chemistry of explicit electron spin-coordinates; i.e. spherical polar angles $\\theta_s, \\phi_s$, that specify the orientation of the spin angular momentum vector in space. In this coordinate representation the spin angular momentum operators, $S^2, S_z$, are represented by the usual differential operators in spherical polar coordinates (commonly used for $L^2, L_z$), and their electron-spin eigenfunctions are $\\sqrt{\\sin\\theta_s} \\exp(\\pm\\phi_s/2)$. This eigenfunction representation has the pedagogical advantage over the abstract spin eigenfunctions, $\\alpha, \\beta,$ that ``integration over spin coordinates'' is a true integration (over the angles $\\theta_s, \\phi_s$). In addition they facilitate construction of many electron wavefunctions in which the electron spins are neither parallel nor antiparallel, but inclined at an interme...

  2. Equilibria with Coordination Failures

    NARCIS (Netherlands)

    Herings, P.J.J.; van der Laan, G.; Talman, A.J.J.

    2004-01-01

    This paper extends the recent literature on equilibria with coordination failures to arbitrary convex sets of admissible prices.We introduce a new equilibrium concept, called quantity constrained equilibrium (QCE), giving a uni.ed treatment to all cases considered in the literature so far.At a QCE

  3. Block coordination copolymers

    Science.gov (United States)

    Koh, Kyoung Moo; Wong-Foy, Antek G; Matzger, Adam J; Benin, Annabelle I; Willis, Richard R

    2012-11-13

    The present invention provides compositions of crystalline coordination copolymers wherein multiple organic molecules are assembled to produce porous framework materials with layered or core-shell structures. These materials are synthesized by sequential growth techniques such as the seed growth technique. In addition, the invention provides a simple procedure for controlling functionality.

  4. General coordinate invariance in quantum many-body systems

    CERN Document Server

    Brauner, Tomas; Monin, Alexander; Penco, Riccardo

    2014-01-01

    We extend the notion of general coordinate invariance to many-body, not necessarily relativistic, systems. As an application, we investigate nonrelativistic general covariance in Galilei-invariant systems. The peculiar transformation rules for the background metric and gauge fields, first introduced by Son and Wingate in 2005 and refined in subsequent works, follow naturally from our framework. Our approach makes it clear that Galilei or Poincare symmetry is by no means a necessary prerequisite for making the theory invariant under coordinate diffeomorphisms. General covariance merely expresses the freedom to choose spacetime coordinates at will, whereas the true, physical symmetries of the system can be separately implemented as "internal" symmetries within the vielbein formalism. A systematic way to implement such symmetries is provided by the coset construction. We illustrate this point by applying our formalism to nonrelativistic s-wave superfluids.

  5. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1994-02-01

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

  6. Steps Toward Optimal Competitive Scheduling

    Science.gov (United States)

    Frank, Jeremy; Crawford, James; Khatib, Lina; Brafman, Ronen

    2006-01-01

    This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, se@sh preferences for when and for how long they are allocated this resource. Thus, they value different resource access durations differently, and they value different time slots differently. We seek an optimal allocation schedule for this resource. This problem arises in many institutional settings where, e.g., different departments, agencies, or personal, compete for a single resource. We are particularly motivated by the problem of scheduling NASA's Deep Space Satellite Network (DSN) among different users within NASA. Access to DSN is needed for transmitting data from various space missions to Earth. Each mission has different needs for DSN time, depending on satellite and planetary orbits. Typically, the DSN is over-subscribed, in that not all missions will be allocated as much time as they want. This leads to various inefficiencies - missions spend much time and resource lobbying for their time, often exaggerating their needs. NASA, on the other hand, would like to make optimal use of this resource, ensuring that the good for NASA is maximized. This raises the thorny problem of how to measure the utility to NASA of each allocation. In the typical case, it is difficult for the central agency, NASA in our case, to assess the value of each interval to each user - this is really only known to the users who understand their needs. Thus, our problem is more precisely formulated as follows: find an allocation schedule for the resource that maximizes the sum of users preferences, when the preference values are private information of the users. We bypass this problem by making the assumptions that one can assign money to customers. This assumption is reasonable; a

  7. Escalonamento cooperativo interorganizacional Cooperative inter-organizational scheduling

    Directory of Open Access Journals (Sweden)

    Ricardo J. Rabelo

    2000-12-01

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

  8. Refining Automatically Extracted Knowledge Bases Using Crowdsourcing

    Directory of Open Access Journals (Sweden)

    Chunhua Li

    2017-01-01

    Full Text Available Machine-constructed knowledge bases often contain noisy and inaccurate facts. There exists significant work in developing automated algorithms for knowledge base refinement. Automated approaches improve the quality of knowledge bases but are far from perfect. In this paper, we leverage crowdsourcing to improve the quality of automatically extracted knowledge bases. As human labelling is costly, an important research challenge is how we can use limited human resources to maximize the quality improvement for a knowledge base. To address this problem, we first introduce a concept of semantic constraints that can be used to detect potential errors and do inference among candidate facts. Then, based on semantic constraints, we propose rank-based and graph-based algorithms for crowdsourced knowledge refining, which judiciously select the most beneficial candidate facts to conduct crowdsourcing and prune unnecessary questions. Our experiments show that our method improves the quality of knowledge bases significantly and outperforms state-of-the-art automatic methods under a reasonable crowdsourcing cost.

  9. Multiuser Successive Refinement and Multiple Description Coding

    CERN Document Server

    Tian, Chao; Diggavi, Suhas

    2007-01-01

    We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An achievable region is given for the two-user two-layer case and it provides the complete rate-distortion region for the Gaussian source under the MSE distortion measure. The key observation is that this problem includes the multiple description (MD) problem (with two descriptions) as a subsystem, and the techniques useful in the MD problem can be extended to this case. We show that the coding scheme based on the universality of random binning is sub-optimal, because multiple Gaussian side informations only at the decoders do incur performance loss, in contrast to the case of single side information at the decoder. We further show that unlike the single user case, when there are multiple users, the loss of performance by a multistage coding approach can be unbounded for the Gaussi...

  10. Improved Appliance Coordination Scheme with Waiting Time in Smart Grids

    Directory of Open Access Journals (Sweden)

    Firas A. Al Balas

    2016-04-01

    Full Text Available Smart grids aim to merge the advances in communications and information technologies with traditional power grids. In smart grids, users can generate energy and sell it to the local utility supplier. The users can reduce energy consumption by shifting appliances’ start time to off-peak hours. Many researchers have proposed techniques to reduce the previous issue for home appliances, such as the Appliances Coordination (ACORD scheme and Appliances Coordination with Feed In (ACORD-FI scheme. The goal of this work is to introduce an efficient scheme to reduce the total cost of energy bills by utilizing the ACORD-FI scheme to obtain an effective solution. In this work three scheduling schemes are proposed: the Appliances Coordination by Giving Waiting Time (ACORD-WT, the Appliances Coordination by Giving Priority (ACORD-P, and using photovoltaic (PV with priority and waiting time scheduling algorithms. A simulator written in C++ is used to test the performance of the proposed schemes using. The performance metric used is the total savings in the cost of the energy bill in dollars. The first comparison for the proposed schemes with the ACORD-FI, and the results show that the efficiency of the proposed ACORD-WT is better than the ACORD-FI, regardless of the number of appliances. Moreover, the proposed ACORD-P, is also better than the standard ACORD-FI.

  11. Belief Propagation Methods for Intercell Interference Coordination

    CERN Document Server

    Rangan, Sundeep

    2010-01-01

    We consider a broad class of interference coordination and resource allocation problems for wireless links where the goal is to maximize the sum of functions of individual link rates. Such problems arise in the context of, for example, fractional frequency reuse (FFR) for macro-cellular networks and dynamic interference management in femtocells. The resulting optimization problems are typically hard to solve optimally even using centralized algorithms but are an essential computational step in implementing rate-fair and queue stabilizing scheduling policies in wireless networks. We consider a belief propagation framework to solve such problems approximately. In particular, we construct approximations to the belief propagation iterations to obtain computationally simple and distributed algorithms with low communication overhead. Notably, our methods are very general and apply to, for example, the optimization of transmit powers, transmit beamforming vectors, and sub-band allocation to maximize the above object...

  12. Distributed sensor coordination for advanced energy systems

    Energy Technology Data Exchange (ETDEWEB)

    Tumer, Kagan [Oregon State Univ., Corvallis, OR (United States). School of Mechanical, Industrial and Manufacturing Engineering

    2015-03-12

    coordination, and sensor network control in advanced power systems. Each application has specific needs, but they all share the one crucial underlying problem: how to ensure that the interactions of a large number of heterogenous agents lead to coordinated system behavior. This proposal describes a new paradigm that addresses that very issue in a systematic way. Key Results and Findings: All milestones have been completed. Our results demonstrate that by properly shaping agent objective functions, we can develop large (up to 10,000 devices) heterogeneous sensor networks with key desirable properties. The first milestone shows that properly choosing agent-specific objective functions increases system performance by up to 99.9% compared to global evaluations. The second milestone shows evolutionary algorithms learn excellent sensor network coordination policies prior to network deployment, and these policies can be refined online once the network is deployed. The third milestone shows the resulting sensor networks networks are extremely robust to sensor noise, where networks with up to 25% sensor noise are capable of providing measurements with errors on the order of 10⁻³. The fourth milestone shows the resulting sensor networks are extremely robust to sensor failure, with 25% of the sensors in the system failing resulting in no significant performance losses after system reconfiguration.

  13. 40 CFR 80.235 - How does a refiner obtain approval as a small refiner?

    Science.gov (United States)

    2010-07-01

    ... small refiner status, plus any subsidiary companies, any parent company and subsidiaries of the parent company, and any joint venture partners: (1)(i) A listing of the name and address of each location where... corporate contact person. (d) For joint ventures, the total number of employees includes the...

  14. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    overlap of the design and construction processes. Consequently, the overall scheduling is primarily based on intuition and personal experiences, rather than well founded figures of the specific project. Finally, the overall schedule is comprehensive and complex, and consequently, difficult to overview......The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM...... and communicate. Scheduling on the detailed level, on the other hand, follows a stipulated approach to scheduling, i.e. the Last Planner System (LPS), which is characterized by involvement of all actors in the construction phase. Thus, the major challenge when implementing BIM-based scheduling is to improve...

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

  16. PRACTICAL IMPLICATIONS OF LOCATION-BASED SCHEDULING

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    2007-01-01

    The traditional method for planning, scheduling and controlling activities and resources in construction projects is the CPM-scheduling, which has been the predominant scheduling method since its introduction in the late 1950s. Over the years, CPM has proven to be a very powerful technique...... for planning, scheduling and controlling projects. However, criticism has been raised on the CPM method, specifically in the case of construction projects, for deficient management of construction work and discontinuous flow of resources. Alternative scheduling techniques, often called repetitive or linear...... that will be used in this study. LBS is a scheduling method that rests upon the theories of line-of-balance and which uses the graphic representation of a flowline chart. As such, LBS is adapted for planning and management of workflows and, thus, may provide a solution to the identified shortcomings of CPM. Even...

  17. Greedy Maximal Scheduling in Wireless Networks

    CERN Document Server

    Li, Qiao

    2010-01-01

    In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.

  18. BIM-BASED SCHEDULING OF CONSTRUCTION

    DEFF Research Database (Denmark)

    Andersson, Niclas; Büchmann-Slorup, Rolf

    2010-01-01

    The potential of BIM is generally recognized in the construction industry, but the practical application of BIM for management purposes is, however, still limited among contractors. The objective of this study is to review the current scheduling process of construction in light of BIM...... overlap of the design and construction processes. Consequently, the overall scheduling is primarily based on intuition and personal experiences, rather than well founded figures of the specific project. Finally, the overall schedule is comprehensive and complex, and consequently, difficult to overview...... and communicate. Scheduling on the detailed level, on the other hand, follows a stipulated approach to scheduling, i.e. the Last Planner System (LPS), which is characterized by involvement of all actors in the construction phase. Thus, the major challenge when implementing BIM-based scheduling is to improve...

  19. Fair Scheduling in Networks Through Packet Election

    CERN Document Server

    Jagabathula, Srikanth

    2008-01-01

    We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like network switches, interference in wireless networks, bandwidth sharing for congestion control and traffic scheduling in road roundabouts. Fair scheduling is required because it provides isolation to different traffic flows; isolation makes the system more robust and enables providing quality of service. Existing work on fairness for constrained networks concentrates on flow based fairness. As a main result, we describe a notion of packet based fairness by establishing an analogy with the ranked election problem: packets are voters, schedules are candidates and each packet ranks the schedules based on its priorities. We then obtain a scheduling algorithm that achieves the described notion of fairness by drawing upon ...

  20. A Hybrid Advection Scheme for Conserving Angular Momentum on a Refined Cartesian Mesh

    CERN Document Server

    Byerly, Zachary D; Tohline, Joel E; Marcello, Dominic C

    2014-01-01

    We test a new "hybrid" scheme for simulating dynamical fluid flows in which cylindrical components of the momentum are advected across a rotating Cartesian coordinate mesh. This hybrid scheme allows us to conserve angular momentum to machine precision while capitalizing on the advantages offered by a Cartesian mesh, such as a straightforward implementation of mesh refinement. Our test focuses on measuring the real and imaginary parts of the eigenfrequency of unstable axisymmetric modes that naturally arise in massless polytropic tori having a range of different aspect ratios, and quantifying the uncertainty in these measurements. Our measured eigenfrequencies show good agreement with the results obtained from the linear stability analysis of Kojima (1986) and from nonlinear hydrodynamic simulations performed on a cylindrical coordinate mesh by Woodward et al. (1994). When compared against results conducted with a traditional Cartesian advection scheme, the hybrid scheme achieves qualitative convergence at the...

  1. Two-Dimensional Scheduling: A Review

    Directory of Open Access Journals (Sweden)

    Zhuolei Xiao

    2013-07-01

    Full Text Available In this study, we present a literature review, classification schemes and analysis of methodology for scheduling problems on Batch Processing machine (BP with both processing time and job size constraints which is also regarded as Two-Dimensional (TD scheduling. Special attention is given to scheduling problems with non-identical job sizes and processing times, with details of the basic algorithms and other significant results.

  2. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

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

  3. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

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

  4. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

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

  5. Global Coordinate System

    Science.gov (United States)

    1985-02-01

    Time in hours at Oh UT is GAST (hours) = GMST + E (41) GAST in radians is GASTo (radians) = GAST (hours) L (42) The angle e required for transforming...inertial coordinates to ECEF is- 6(radians) GASTo + 6.3003880.99 (ti - th) (43) o ~ooUT Mod ( E 27) where St.i - tohLjT = (JD -2.4 106). (JDOE -2.4 x

  6. International Monetary Policy Coordination

    OpenAIRE

    Carlberg, Michael

    2005-01-01

    This paper studies the international coordination of monetary policies in the world economy. It carefully discusses the process of policy competition and the structure of policy cooperation. As to policy competition, the focus is on monetary competition between Europe and America. Similarly, as to policy cooperation, the focus is on monetary cooperation between Europe and America. The spillover effects of monetary policy are negative. The policy targets are price stability and full employment.

  7. Simulating Nonequilibrium Radiation via Orthogonal Polynomial Refinement

    Science.gov (United States)

    2015-01-07

    from data bases which are derived from quantum physics and transmit across the two different coordinates by a nearest neighbor search algorithm [7,8...complex radiative simulation must be built on the interaction of quantum physics, chemical kinetics, aerodynamics, and radiation transfer. The most...created a space partition algorithm for the nearest neighbor search optimization on both structured/unstructured grids and integrated with the high

  8. Universal mechatronics coordinator

    Science.gov (United States)

    Muir, Patrick F.

    1999-11-01

    Mechatronic systems incorporate multiple actuators and sensor which must be properly coordinated to achieve the desired system functionality. Many mechatronic systems are designed as one-of-a-kind custom projects without consideration for facilitating future system or alterations and extensions to the current syste. Thus, subsequent changes to the system are slow, different, and costly. It has become apparent that manufacturing processes, and thus the mechatronics which embody them, need to be agile in order to more quickly and easily respond to changing customer demands or market pressures. To achieve agility, both the hardware and software of the system need to be designed such that the creation of new system and the alteration and extension of current system is fast and easy. This paper describes the design of a Universal Mechatronics Coordinator (UMC) which facilitates agile setup and changeover of coordination software for mechatronic systems. The UMC is capable of sequencing continuous and discrete actions that are programmed as stimulus-response pairs, as state machines, or a combination of the two. It facilitates the modular, reusable programing of continuous actions such as servo control algorithms, data collection code, and safety checking routines; and discrete actions such as reporting achieved states, and turning on/off binary devices. The UMC has been applied to the control of a z- theta assembly robot for the Minifactory project and is applicable to a spectrum of widely differing mechatronic systems.

  9. Improving Project Manufacturing Coordination

    Directory of Open Access Journals (Sweden)

    Korpivaara Ville

    2014-09-01

    Full Text Available The objective of this research is to develop firms’ project manufacturing coordination. The development will be made by centralizing the manufacturing information flows in one system. To be able to centralize information, a deep user need assessment is required. After user needs have been identified, the existing system will be developed to match these needs. The theoretical background is achieved through exploring the literature of project manufacturing, development project success factors and different frameworks and tools for development project execution. The focus of this research is rather in customer need assessment than in system’s technical expertise. To ensure the deep understanding of customer needs this study is executed by action research method. As a result of this research the information system for project manufacturing coordination was developed to respond revealed needs of the stakeholders. The new system improves the quality of the manufacturing information, eliminates waste in manufacturing coordination processes and offers a better visibility to the project manufacturing. Hence it provides a solid base for the further development of project manufacturing.

  10. Network-Aware HEFT Scheduling for Grid

    Directory of Open Access Journals (Sweden)

    Muhammad Murtaza Yousaf

    2014-01-01

    Full Text Available We present a network-aware HEFT. The original HEFT does not take care of parallel network flows while designing its schedule for a computational environment where computing nodes are physically at distant locations. In the proposed mechanism, such data transfers are stretched to their realistic completion time. A HEFT schedule with stretched data transfers exhibits the realistic makespan of the schedule. It is shown how misleading a schedule can be if the impact of parallel data transfers that share a bottleneck is ignored. A network-aware HEFT can be used to yield a benefit for Grid applications.

  11. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

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

  12. 15 CFR 700.14 - Preferential scheduling.

    Science.gov (United States)

    2010-01-01

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

  13. Scheduling By Using Fuzzy Logic in Manufacturing

    Directory of Open Access Journals (Sweden)

    Miss. Ashwini. A. Mate

    2014-07-01

    Full Text Available This paper represents the scheduling process in furniture manufacturing unit. It gives the fuzzy logic application in flexible manufacturing system. Flexible manufacturing systems are production system in furniture manufacturing unit. FMS consist of same multipurpose numerically controlled machines. Here in this project the scheduling has been done in FMS by using fuzzy logic tool in Matlab software. The fuzzy logic based scheduling model in this paper will deals with the job and best alternative route selection with multi-criteria of machine. Here two criteria for job and sequencing and routing with rules. This model is applicable to the scheduling of any manufacturing industry.

  14. Flexible Personnel Scheduling in the Parallel Environment

    Institute of Scientific and Technical Information of China (English)

    XU Ben-zhu; ZHANG Xing-ling

    2014-01-01

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

  15. CASSIUS: The Cassini Uplink Scheduler

    Science.gov (United States)

    Bellinger, Earl

    2012-01-01

    The Cassini Uplink Scheduler (CASSIUS) is cross-platform software used to generate a radiation sequence plan for commands being sent to the Cassini spacecraft. Because signals must travel through varying amounts of Earth's atmosphere, several different modes of constant telemetry rates have been devised. These modes guarantee that the spacecraft and the Deep Space Network agree with respect to the data transmission rate. However, the memory readout of a command will be lost if it occurs on a telemetry mode boundary. Given a list of spacecraft message files as well as the available telemetry modes, CASSIUS can find an uplink sequence that ensures safe transmission of each file. In addition, it can predict when the two on-board solid state recorders will swap. CASSIUS prevents data corruption by making sure that commands are not planned for memory readout during telemetry rate changes or a solid state recorder swap.

  16. GRChombo: Numerical relativity with adaptive mesh refinement

    Science.gov (United States)

    Clough, Katy; Figueras, Pau; Finkel, Hal; Kunesch, Markus; Lim, Eugene A.; Tunyasuvunakool, Saran

    2015-12-01

    In this work, we introduce {\\mathtt{GRChombo}}: a new numerical relativity code which incorporates full adaptive mesh refinement (AMR) using block structured Berger-Rigoutsos grid generation. The code supports non-trivial ‘many-boxes-in-many-boxes’ mesh hierarchies and massive parallelism through the message passing interface. {\\mathtt{GRChombo}} evolves the Einstein equation using the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. The AMR capability permits the study of a range of new physics which has previously been computationally infeasible in a full 3 + 1 setting, while also significantly simplifying the process of setting up the mesh for these problems. We show that {\\mathtt{GRChombo}} can stably and accurately evolve standard spacetimes such as binary black hole mergers and scalar collapses into black holes, demonstrate the performance characteristics of our code, and discuss various physics problems which stand to benefit from the AMR technique.

  17. Formal language theory: refining the Chomsky hierarchy

    Science.gov (United States)

    Jäger, Gerhard; Rogers, James

    2012-01-01

    The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages). PMID:22688632

  18. Algorithm refinement for stochastic partial differential equations.

    Energy Technology Data Exchange (ETDEWEB)

    Alexander, F. J. (Francis J.); Garcia, Alejandro L.,; Tartakovsky, D. M. (Daniel M.)

    2001-01-01

    A hybrid particle/continuum algorithm is formulated for Fickian diffusion in the fluctuating hydrodynamic limit. The particles are taken as independent random walkers; the fluctuating diffusion equation is solved by finite differences with deterministic and white-noise fluxes. At the interface between the particle and continuum computations the coupling is by flux matching, giving exact mass conservation. This methodology is an extension of Adaptive Mesh and Algorithm Refinement to stochastic partial differential equations. A variety of numerical experiments were performed for both steady and time-dependent scenarios. In all cases the mean and variance of density are captured correctly by the stochastic hybrid algorithm. For a non-stochastic version (i.e., using only deterministic continuum fluxes) the mean density is correct, but the variance is reduced except within the particle region, far from the interface. Extensions of the methodology to fluid mechanics applications are discussed.

  19. Performance of a streaming mesh refinement algorithm.

    Energy Technology Data Exchange (ETDEWEB)

    Thompson, David C.; Pebay, Philippe Pierre

    2004-08-01

    In SAND report 2004-1617, we outline a method for edge-based tetrahedral subdivision that does not rely on saving state or communication to produce compatible tetrahedralizations. This report analyzes the performance of the technique by characterizing (a) mesh quality, (b) execution time, and (c) traits of the algorithm that could affect quality or execution time differently for different meshes. It also details the method used to debug the several hundred subdivision templates that the algorithm relies upon. Mesh quality is on par with other similar refinement schemes and throughput on modern hardware can exceed 600,000 output tetrahedra per second. But if you want to understand the traits of the algorithm, you have to read the report!

  20. Refinement and stability of grain structure

    Energy Technology Data Exchange (ETDEWEB)

    John Humphreys, F.; Bate, P.S. [Manchester Univ. (United Kingdom). Manchester Materials Science Centre

    2001-07-01

    The various methods of producing fine-grained alloys are discussed and it is concluded that thermomechanical processing routes are most suitable for the economic production of the large quantities of material required for structural applications. The limits of grain refinement by conventional discontinuous recrystallization are considered, and the production of micron-grained alloys by continuous recrystallization processes during or after large strain deformation is discussed. The stability of highly deformed microstructures against recrystallization is analysed, and the effect of second-phase particles on grain growth is discussed. It is shown that perturbations of the Zener drag during high temperature deformation may lead to dynamic grain growth in two-phase alloys. (orig.)

  1. Error bounds from extra precise iterative refinement

    Energy Technology Data Exchange (ETDEWEB)

    Demmel, James; Hida, Yozo; Kahan, William; Li, Xiaoye S.; Mukherjee, Soni; Riedy, E. Jason

    2005-02-07

    We present the design and testing of an algorithm for iterative refinement of the solution of linear equations, where the residual is computed with extra precision. This algorithm was originally proposed in the 1960s [6, 22] as a means to compute very accurate solutions to all but the most ill-conditioned linear systems of equations. However two obstacles have until now prevented its adoption in standard subroutine libraries like LAPACK: (1) There was no standard way to access the higher precision arithmetic needed to compute residuals, and (2) it was unclear how to compute a reliable error bound for the computed solution. The completion of the new BLAS Technical Forum Standard [5] has recently removed the first obstacle. To overcome the second obstacle, we show how a single application of iterative refinement can be used to compute an error bound in any norm at small cost, and use this to compute both an error bound in the usual infinity norm, and a componentwise relative error bound. We report extensive test results on over 6.2 million matrices of dimension 5, 10, 100, and 1000. As long as a normwise (resp. componentwise) condition number computed by the algorithm is less than 1/max{l_brace}10,{radical}n{r_brace} {var_epsilon}{sub w}, the computed normwise (resp. componentwise) error bound is at most 2 max{l_brace}10,{radical}n{r_brace} {center_dot} {var_epsilon}{sub w}, and indeed bounds the true error. Here, n is the matrix dimension and w is single precision roundoff error. For worse conditioned problems, we get similarly small correct error bounds in over 89.4% of cases.

  2. Technical Considerations for Filler and Neuromodulator Refinements

    Science.gov (United States)

    Wilson, Anthony J.; Chang, Brian L.; Percec, Ivona

    2016-01-01

    Background: The toolbox for cosmetic practitioners is growing at an unprecedented rate. There are novel products every year and expanding off-label indications for neurotoxin and soft-tissue filler applications. Consequently, aesthetic physicians are increasingly challenged by the task of selecting the most appropriate products and techniques to achieve optimal patient outcomes. Methods: We employed a PubMed literature search of facial injectables from the past 10 years (2005–2015), with emphasis on those articles embracing evidence-based medicine. We evaluated the scientific background of every product and the physicochemical properties that make each one ideal for specific indications. The 2 senior authors provide commentary regarding their clinical experience with specific technical refinements of neuromodulators and soft-tissue fillers. Results: Neurotoxins and fillers are characterized by unique physical characteristics that distinguish each product. This results in subtle but important differences in their clinical applications. Specific indications and recommendations for the use of the various neurotoxins and soft-tissue fillers are reviewed. The discussion highlights refinements in combination treatments and product physical modifications, according to specific treatment zones. Conclusions: The field of facial aesthetics has evolved dramatically, mostly secondary to our increased understanding of 3-dimensional structural volume restoration. Our work reviews Food and Drug Administration–approved injectables. In addition, we describe how to modify products to fulfill specific indications such as treatment of the mid face, décolletage, hands, and periorbital regions. Although we cannot directly evaluate the duration or exact physical properties of blended products, we argue that “product customization” is safe and provides natural results with excellent patient outcomes. PMID:28018778

  3. Technical Considerations for Filler and Neuromodulator Refinements.

    Science.gov (United States)

    Montes, José Raúl; Wilson, Anthony J; Chang, Brian L; Percec, Ivona

    2016-12-01

    Background: The toolbox for cosmetic practitioners is growing at an unprecedented rate. There are novel products every year and expanding off-label indications for neurotoxin and soft-tissue filler applications. Consequently, aesthetic physicians are increasingly challenged by the task of selecting the most appropriate products and techniques to achieve optimal patient outcomes. Methods: We employed a PubMed literature search of facial injectables from the past 10 years (2005-2015), with emphasis on those articles embracing evidence-based medicine. We evaluated the scientific background of every product and the physicochemical properties that make each one ideal for specific indications. The 2 senior authors provide commentary regarding their clinical experience with specific technical refinements of neuromodulators and soft-tissue fillers. Results: Neurotoxins and fillers are characterized by unique physical characteristics that distinguish each product. This results in subtle but important differences in their clinical applications. Specific indications and recommendations for the use of the various neurotoxins and soft-tissue fillers are reviewed. The discussion highlights refinements in combination treatments and product physical modifications, according to specific treatment zones. Conclusions: The field of facial aesthetics has evolved dramatically, mostly secondary to our increased understanding of 3-dimensional structural volume restoration. Our work reviews Food and Drug Administration-approved injectables. In addition, we describe how to modify products to fulfill specific indications such as treatment of the mid face, décolletage, hands, and periorbital regions. Although we cannot directly evaluate the duration or exact physical properties of blended products, we argue that "product customization" is safe and provides natural results with excellent patient outcomes.

  4. Self-consistent QM/MM methodologies for structural refinement of photosystem II and other macromolecules of biological interest

    Energy Technology Data Exchange (ETDEWEB)

    Batista, Enrique R [Los Alamos National Laboratory; Sproviero, Eduardo M [YALE UNIV; Newcomer, Michael [YALE UNIV; Gascon, Jose A [YALE UNIV; Batista, Victor S [YALE UNIV

    2008-01-01

    The combination of quantum mechanics and molecular mechanics (QM/MM) is one of the most promising approaches to study the structure, function, and properties of proteins and nucleic acids. However, there some instances in which the limitations of either the MM (lack of a proper electronic description) or QM (limited to a few number of atoms) methods prevent a proper description of the system. To address this issue, we review here our approach to fine-tune the structure of biological systems using post-QM/MM refinements. These protocols are based on spectroscopy data, and/or partitioning of the system to extend the QM description to a larger region of a protein. We illustrate these methodologies through applications to several biomolecules, which were pre-optimized at the QM/MM level and then further refined using postQM/MM refinement methodologies: mod(QM/MM), which refines the atomic charges of the residues included in the MM region accounting for polarization effects; mod(QM/MM)-opt that partition the MM region in smaller parts and optimizes each part in an iterative. self-consistent way, and the Polarized-Extended X-Ray Absorption Fine Structure (P-EXAFS) fitting procedure, which fine-tune the atomic coordinates to reproduce experimental polarized EXAFS spectra. The first two techniques were applied to the guanine quadruplex. while the P-EXAFS refinement was applied to the oxygen evolving complex of photosystem II.

  5. Dosing Schedules for Pneumococcal Conjugate Vaccine

    Science.gov (United States)

    2014-01-01

    Since second generation pneumococcal conjugate vaccines (PCVs) targeting 10 and 13 serotypes became available in 2010, the number of national policy makers considering these vaccines has steadily increased. An important consideration for a national immunization program is the timing and number of doses—the schedule—that will best prevent disease in the population. Data on disease epidemiology and the efficacy or effectiveness of PCV schedules are typically considered when choosing a schedule. Practical concerns, such as the existing vaccine schedule, and vaccine program performance are also important. In low-income countries, pneumococcal disease and deaths typically peak well before the end of the first year of life, making a schedule that provides PCV doses early in life (eg, a 6-, 10- and 14-week schedule) potentially the best option. In other settings, a schedule including a booster dose may address disease that peaks in the second year of life or may be seen to enhance a schedule already in place. A large and growing body of evidence from immunogenicity studies, as well as clinical trials and observational studies of carriage, pneumonia and invasive disease, has been systematically reviewed; these data indicate that schedules of 3 or 4 doses all work well, and that the differences between these regimens are subtle, especially in a mature program in which coverage is high and indirect (herd) effects help enhance protection provided directly by a vaccine schedule. The recent World Health Organization policy statement on PCVs endorsed a schedule of 3 primary doses without a booster or, as a new alternative, 2 primary doses with a booster dose. While 1 schedule may be preferred in a particular setting based on local epidemiology or practical considerations, achieving high coverage with 3 doses is likely more important than the specific timing of doses. PMID:24336059

  6. Symmetric two-coordinate photodiode

    Directory of Open Access Journals (Sweden)

    Dobrovolskiy Yu. G.

    2008-12-01

    Full Text Available The two-coordinate photodiode is developed and explored on the longitudinal photoeffect, which allows to get the coordinate descriptions symmetric on the steepness and longitudinal resistance great exactness. It was shown, that the best type of the coordinate description is observed in the case of scanning by the optical probe on the central part of the photosensitive element. The ways of improvement of steepness and linear of its coordinate description were analyzed.

  7. Invariant Manifolds and Collective Coordinates

    CERN Document Server

    Papenbrock, T

    2001-01-01

    We introduce suitable coordinate systems for interacting many-body systems with invariant manifolds. These are Cartesian in coordinate and momentum space and chosen such that several components are identically zero for motion on the invariant manifold. In this sense these coordinates are collective. We make a connection to Zickendraht's collective coordinates and present certain configurations of few-body systems where rotations and vibrations decouple from single-particle motion. These configurations do not depend on details of the interaction.

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

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

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

  9. Coordination Processes in International Organisations

    DEFF Research Database (Denmark)

    Nedergaard, Peter

    2008-01-01

    to coordinate relatively elaborate agreements due to the strength of its coordination as far as professional or technical and political activities (excepting the ILO budget) are concerned. In other more clear-cut or 'simple' policy areas such as the ILO budget, the EU coordination is weak: this contrast...

  10. 75 FR 66195 - Schedules of Controlled Substances: Placement of Propofol Into Schedule IV

    Science.gov (United States)

    2010-10-27

    ... Propofol Into Schedule IV; Proposed Rule #0;#0;Federal Register / Vol. 75, No. 207 / Wednesday, October 27... Schedules of Controlled Substances: Placement of Propofol Into Schedule IV AGENCY: Drug Enforcement... propofol, including its salts, isomers, and salts of isomers whenever the existence of such salts, isomers...

  11. Effects and mechanisms of grain refinement in aluminium alloys

    Indian Academy of Sciences (India)

    K T Kashyap; T Chandrashekar

    2001-08-01

    Grain refinement plays a crucial role in improving characteristics and properties of cast and wrought aluminium alloys. Generally Al–Ti and Al–Ti–B master alloys are added to the aluminium alloys to grain refine the solidified product. The mechanism of grain refinement is of considerable controversy in the scientific literature. The nucleant effects i.e. which particle and its characteristics nucleate -Al, has been the subject of intensive research. Lately the solute effect i.e. the effect of dissolved titanium on grain refinement, has come into forefront of grain refinement research. The present paper attempts to review the literature on the nucleant effects and solute effects on grain refinement and addresses the importance of dissolved titanium in promoting nucleation of -Al on nucleant particles.

  12. On macromolecular refinement at subatomic resolution withinteratomic scatterers

    Energy Technology Data Exchange (ETDEWEB)

    Afonine, Pavel V.; Grosse-Kunstleve, Ralf W.; Adams, Paul D.; Lunin, Vladimir Y.; Urzhumtsev, Alexandre

    2007-11-09

    A study of the accurate electron density distribution in molecular crystals at subatomic resolution, better than {approx} 1.0 {angstrom}, requires more detailed models than those based on independent spherical atoms. A tool conventionally used in small-molecule crystallography is the multipolar model. Even at upper resolution limits of 0.8-1.0 {angstrom}, the number of experimental data is insufficient for the full multipolar model refinement. As an alternative, a simpler model composed of conventional independent spherical atoms augmented by additional scatterers to model bonding effects has been proposed. Refinement of these mixed models for several benchmark datasets gave results comparable in quality with results of multipolar refinement and superior of those for conventional models. Applications to several datasets of both small- and macro-molecules are shown. These refinements were performed using the general-purpose macromolecular refinement module phenix.refine of the PHENIX package.

  13. Deformable elastic network refinement for low-resolution macromolecular crystallography.

    Science.gov (United States)

    Schröder, Gunnar F; Levitt, Michael; Brunger, Axel T

    2014-09-01

    Crystals of membrane proteins and protein complexes often diffract to low resolution owing to their intrinsic molecular flexibility, heterogeneity or the mosaic spread of micro-domains. At low resolution, the building and refinement of atomic models is a more challenging task. The deformable elastic network (DEN) refinement method developed previously has been instrumental in the determinion of several structures at low resolution. Here, DEN refinement is reviewed, recommendations for its optimal usage are provided and its limitations are discussed. Representative examples of the application of DEN refinement to challenging cases of refinement at low resolution are presented. These cases include soluble as well as membrane proteins determined at limiting resolutions ranging from 3 to 7 Å. Potential extensions of the DEN refinement technique and future perspectives for the interpretation of low-resolution crystal structures are also discussed.

  14. Refinement of herpesvirus B-capsid structure on parallel supercomputers.

    Science.gov (United States)

    Zhou, Z H; Chiu, W; Haskell, K; Spears, H; Jakana, J; Rixon, F J; Scott, L R

    1998-01-01

    Electron cryomicroscopy and icosahedral reconstruction are used to obtain the three-dimensional structure of the 1250-A-diameter herpesvirus B-capsid. The centers and orientations of particles in focal pairs of 400-kV, spot-scan micrographs are determined and iteratively refined by common-lines-based local and global refinement procedures. We describe the rationale behind choosing shared-memory multiprocessor computers for executing the global refinement, which is the most computationally intensive step in the reconstruction procedure. This refinement has been implemented on three different shared-memory supercomputers. The speedup and efficiency are evaluated by using test data sets with different numbers of particles and processors. Using this parallel refinement program, we refine the herpesvirus B-capsid from 355-particle images to 13-A resolution. The map shows new structural features and interactions of the protein subunits in the three distinct morphological units: penton, hexon, and triplex of this T = 16 icosahedral particle.

  15. RAM: a Relativistic Adaptive Mesh Refinement Hydrodynamics Code

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Wei-Qun; /KIPAC, Menlo Park; MacFadyen, Andrew I.; /Princeton, Inst. Advanced Study

    2005-06-06

    The authors have developed a new computer code, RAM, to solve the conservative equations of special relativistic hydrodynamics (SRHD) using adaptive mesh refinement (AMR) on parallel computers. They have implemented a characteristic-wise, finite difference, weighted essentially non-oscillatory (WENO) scheme using the full characteristic decomposition of the SRHD equations to achieve fifth-order accuracy in space. For time integration they use the method of lines with a third-order total variation diminishing (TVD) Runge-Kutta scheme. They have also implemented fourth and fifth order Runge-Kutta time integration schemes for comparison. The implementation of AMR and parallelization is based on the FLASH code. RAM is modular and includes the capability to easily swap hydrodynamics solvers, reconstruction methods and physics modules. In addition to WENO they have implemented a finite volume module with the piecewise parabolic method (PPM) for reconstruction and the modified Marquina approximate Riemann solver to work with TVD Runge-Kutta time integration. They examine the difficulty of accurately simulating shear flows in numerical relativistic hydrodynamics codes. They show that under-resolved simulations of simple test problems with transverse velocity components produce incorrect results and demonstrate the ability of RAM to correctly solve these problems. RAM has been tested in one, two and three dimensions and in Cartesian, cylindrical and spherical coordinates. they have demonstrated fifth-order accuracy for WENO in one and two dimensions and performed detailed comparison with other schemes for which they show significantly lower convergence rates. Extensive testing is presented demonstrating the ability of RAM to address challenging open questions in relativistic astrophysics.

  16. Work Coordination Engine

    Science.gov (United States)

    Zendejas, Silvino; Bui, Tung; Bui, Bach; Malhotra, Shantanu; Chen, Fannie; Kim, Rachel; Allen, Christopher; Luong, Ivy; Chang, George; Sadaqathulla, Syed

    2009-01-01

    The Work Coordination Engine (WCE) is a Java application integrated into the Service Management Database (SMDB), which coordinates the dispatching and monitoring of a work order system. WCE de-queues work orders from SMDB and orchestrates the dispatching of work to a registered set of software worker applications distributed over a set of local, or remote, heterogeneous computing systems. WCE monitors the execution of work orders once dispatched, and accepts the results of the work order by storing to the SMDB persistent store. The software leverages the use of a relational database, Java Messaging System (JMS), and Web Services using Simple Object Access Protocol (SOAP) technologies to implement an efficient work-order dispatching mechanism capable of coordinating the work of multiple computer servers on various platforms working concurrently on different, or similar, types of data or algorithmic processing. Existing (legacy) applications can be wrapped with a proxy object so that no changes to the application are needed to make them available for integration into the work order system as "workers." WCE automatically reschedules work orders that fail to be executed by one server to a different server if available. From initiation to completion, the system manages the execution state of work orders and workers via a well-defined set of events, states, and actions. It allows for configurable work-order execution timeouts by work-order type. This innovation eliminates a current processing bottleneck by providing a highly scalable, distributed work-order system used to quickly generate products needed by the Deep Space Network (DSN) to support space flight operations. WCE is driven by asynchronous messages delivered via JMS indicating the availability of new work or workers. It runs completely unattended in support of the lights-out operations concept in the DSN.

  17. Email for the coordination of healthcare appointments and attendance reminders.

    Science.gov (United States)

    Atherton, Helen; Sawmynaden, Prescilla; Meyer, Barbara; Car, Josip

    2012-08-15

    Email is a popular and commonly-used method of communication, but its use in health care is not routine. Where email communication has been utilised in health care, its purposes have included the coordination of healthcare appointments and attendance reminders, but the effects of using email in this way are not known. This review considers the use of email for the coordination of healthcare appointments and reminders for attendance; particularly scheduling, rescheduling and cancelling healthcare appointments, and providing prompts/reminders for attendance at appointments. To assess the effects of using email for the coordination of healthcare appointments and attendance reminders, compared to other forms of coordinating appointments and reminders, on outcomes for health professionals, patients and carers, and health services, including harms. We searched: the Cochrane Consumers and Communication Review Group Specialised Register, the Cochrane Central Register of Controlled Trials (CENTRAL, The Cochrane Library, Issue 1 2010), MEDLINE (OvidSP) (1950 to January 2010), EMBASE (OvidSP) (1980 to January 2010), PsycINFO (OvidSP) (1967 to January 2010), CINAHL (EbscoHOST) (1982 to February 2010),and ERIC (CSA) (1965 to January 2010). We searched grey literature: theses/dissertation repositories, trials registers and Google Scholar (searched July 2010). We used additional search methods: examining reference lists and contacting authors. Randomised controlled trials, quasi-randomised trials, controlled before and after studies and interrupted time series studies of interventions that use email for scheduling health appointments, for reminders for a scheduled health appointment or for ongoing coordination of health appointments and that took the form of 1) unsecured email 2) secure email or 3) web messaging. All healthcare professionals, patients and caregivers in all settings were considered. Two review authors independently assessed the titles and abstracts of retrieved

  18. Mirror of the refined topological vertex from a matrix model

    CERN Document Server

    Eynard, B

    2011-01-01

    We find an explicit matrix model computing the refined topological vertex, starting from its representation in terms of plane partitions. We then find the spectral curve of that matrix model, and thus the mirror symmetry of the refined vertex. With the same method we also find a matrix model for the strip geometry, and we find its mirror curve. The fact that there is a matrix model shows that the refined topological string amplitudes also satisfy the remodeling the B-model construction.

  19. 37 CFR 2.85 - Classification schedules.

    Science.gov (United States)

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Classification schedules. 2..., DEPARTMENT OF COMMERCE RULES OF PRACTICE IN TRADEMARK CASES Classification § 2.85 Classification schedules. (a) International classification system. Section 6.1 of this chapter sets forth the...

  20. 10 CFR 51.15 - Time schedules.

    Science.gov (United States)

    2010-01-01

    ... REGULATORY FUNCTIONS National Environmental Policy Act-Regulations Implementing Section 102(2) § 51.15 Time... 10 Energy 2 2010-01-01 2010-01-01 false Time schedules. 51.15 Section 51.15 Energy NUCLEAR... NEPA review in accordance with any time schedule established under this section. (b) As specified in...