Segment Fixed Priority Scheduling for Self Suspending Real Time Tasks

DTIC Science & Technology

2016-08-11

Segment-Fixed Priority Scheduling for Self-Suspending Real -Time Tasks Junsung Kim, Department of Electrical and Computer Engineering, Carnegie...4 2.1 Application of a Multi-Segment Self-Suspending Real -Time Task Model ............................. 5 3 Fixed Priority Scheduling...1 Figure 2: A multi-segment self-suspending real -time task model

Joint Cross-Layer Design for Wireless QoS Content Delivery

NASA Astrophysics Data System (ADS)

Chen, Jie; Lv, Tiejun; Zheng, Haitao

2005-12-01

In this paper, we propose a joint cross-layer design for wireless quality-of-service (QoS) content delivery. Central to our proposed cross-layer design is the concept of adaptation. Adaptation represents the ability to adjust protocol stacks and applications to respond to channel variations. We focus our cross-layer design especially on the application, media access control (MAC), and physical layers. The network is designed based on our proposed fast frequency-hopping orthogonal frequency division multiplex (OFDM) technique. We also propose a QoS-awareness scheduler and a power adaptation transmission scheme operating at both the base station and mobile sides. The proposed MAC scheduler coordinates the transmissions of an IP base station and mobile nodes. The scheduler also selects appropriate transmission formats and packet priorities for individual users based on current channel conditions and the users' QoS requirements. The test results show that our cross-layer design provides an excellent framework for wireless QoS content delivery.

How do employees prioritise when they schedule their own shifts?

PubMed

Nabe-Nielsen, Kirsten; Lund, Henrik; Ajslev, Jeppe Z; Hansen, Åse Marie; Albertsen, Karen; Hvid, Helge; Garde, Anne Helene

2013-01-01

We investigated how employees prioritised when they scheduled their own shifts and whether priorities depended on age, gender, educational level, cohabitation and health status. We used cross-sectional questionnaire data from the follow-up survey of an intervention study investigating the effect of self-scheduling (n = 317). Intervention group participants were asked about their priorities when scheduling their own shifts succeeded by 17 items covering family/private life, economy, job content, health and sleep. At least half of the participants reported that they were giving high priority to their family life, having consecutive time off, leisure-time activities, rest between shifts, sleep, regularity of their everyday life, health and that the work schedule balanced. Thus, employees consider both their own and the workplace's needs when they have the opportunity to schedule their own shifts. Age, gender, cohabitation and health status were all significantly associated with at least one of these priorities. Intervention studies report limited health effects of self-scheduling. Therefore, we investigated to what extent employees prioritise their health and recuperation when scheduling their own shifts. We found that employees not only consider both their health and family but also the workplace's needs when they schedule their own shifts.

15 CFR 700.14 - Preferential scheduling.

Code of Federal Regulations, 2010 CFR

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

Dynamic autonomous routing technology for IP-based satellite ad hoc networks

NASA Astrophysics Data System (ADS)

Wang, Xiaofei; Deng, Jing; Kostas, Theresa; Rajappan, Gowri

2014-06-01

IP-based routing for military LEO/MEO satellite ad hoc networks is very challenging due to network and traffic heterogeneity, network topology and traffic dynamics. In this paper, we describe a traffic priority-aware routing scheme for such networks, namely Dynamic Autonomous Routing Technology (DART) for satellite ad hoc networks. DART has a cross-layer design, and conducts routing and resource reservation concurrently for optimal performance in the fluid but predictable satellite ad hoc networks. DART ensures end-to-end data delivery with QoS assurances by only choosing routing paths that have sufficient resources, supporting different packet priority levels. In order to do so, DART incorporates several resource management and innovative routing mechanisms, which dynamically adapt to best fit the prevailing conditions. In particular, DART integrates a resource reservation mechanism to reserve network bandwidth resources; a proactive routing mechanism to set up non-overlapping spanning trees to segregate high priority traffic flows from lower priority flows so that the high priority flows do not face contention from low priority flows; a reactive routing mechanism to arbitrate resources between various traffic priorities when needed; a predictive routing mechanism to set up routes for scheduled missions and for anticipated topology changes for QoS assurance. We present simulation results showing the performance of DART. We have conducted these simulations using the Iridium constellation and trajectories as well as realistic military communications scenarios. The simulation results demonstrate DART's ability to discriminate between high-priority and low-priority traffic flows and ensure disparate QoS requirements of these traffic flows.

Sources of unbounded priority inversions in real-time systems and a comparative study of possible solutions

NASA Technical Reports Server (NTRS)

Davari, Sadegh; Sha, Lui

1992-01-01

In the design of real-time systems, tasks are often assigned priorities. Preemptive priority driven schedulers are used to schedule tasks to meet the timing requirements. Priority inversion is the term used to describe the situation when a higher priority task's execution is delayed by lower priority tasks. Priority inversion can occur when there is contention for resources among tasks of different priorities. The duration of priority inversion could be long enough to cause tasks to miss their dead lines. Priority inversion cannot be completely eliminated. However, it is important to identify sources of priority inversion and minimize the duration of priority inversion. In this paper, a comprehensive review of the problem of and solutions to unbounded priority inversion is presented.

Expert Design Advisor

DTIC Science & Technology

1990-10-01

to economic, technological, spatial or logistic concerns, or involve training, man-machine interfaces, or integration into existing systems. Once the...probabilistic reasoning, mixed analysis- and simulation-oriented, mixed computation- and communication-oriented, nonpreemptive static priority...scheduling base, nonrandomized, preemptive static priority scheduling base, randomized, simulation-oriented, and static scheduling base. The selection of both

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

PubMed Central

Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok

2018-01-01

Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology. PMID:29659508

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

PubMed

Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok

2018-04-16

Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

Analysis of Factors for Incorporating User Preferences in Air Traffic Management: A system Perspective

NASA Technical Reports Server (NTRS)

Sheth, Kapil S.; Gutierrez-Nolasco, Sebastian

2010-01-01

This paper presents an analysis of factors that impact user flight schedules during air traffic congestion. In pre-departure flight planning, users file one route per flight, which often leads to increased delays, inefficient airspace utilization, and exclusion of user flight preferences. In this paper, first the idea of filing alternate routes and providing priorities on each of those routes is introduced. Then, the impact of varying planning interval and system imposed departure delay increment is discussed. The metrics of total delay and equity are used for analyzing the impact of these factors on increased traffic and on different users. The results are shown for four cases, with and without the optional routes and priority assignments. Results demonstrate that adding priorities to optional routes further improves system performance compared to filing one route per flight and using first-come first-served scheme. It was also observed that a two-hour planning interval with a five-minute system imposed departure delay increment results in highest delay reduction. The trend holds for a scenario with increased traffic.

Design and architecture of the Mars relay network planning and analysis framework

NASA Technical Reports Server (NTRS)

Cheung, K. M.; Lee, C. H.

2002-01-01

In this paper we describe the design and architecture of the Mars Network planning and analysis framework that supports generation and validation of efficient planning and scheduling strategy. The goals are to minimize the transmitting time, minimize the delaying time, and/or maximize the network throughputs. The proposed framework would require (1) a client-server architecture to support interactive, batch, WEB, and distributed analysis and planning applications for the relay network analysis scheme, (2) a high-fidelity modeling and simulation environment that expresses link capabilities between spacecraft to spacecraft and spacecraft to Earth stations as time-varying resources, and spacecraft activities, link priority, Solar System dynamic events, the laws of orbital mechanics, and other limiting factors as spacecraft power and thermal constraints, (3) an optimization methodology that casts the resource and constraint models into a standard linear and nonlinear constrained optimization problem that lends itself to commercial off-the-shelf (COTS)planning and scheduling algorithms.

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

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

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

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

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

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

Evaluation and Selection of Best Priority Sequencing Rule in Job Shop Scheduling using Hybrid MCDM Technique

NASA Astrophysics Data System (ADS)

Kiran Kumar, Kalla; Nagaraju, Dega; Gayathri, S.; Narayanan, S.

2017-05-01

Priority Sequencing Rules provide the guidance for the order in which the jobs are to be processed at a workstation. The application of different priority rules in job shop scheduling gives different order of scheduling. More experimentation needs to be conducted before a final choice is made to know the best priority sequencing rule. Hence, a comprehensive method of selecting the right choice is essential in managerial decision making perspective. This paper considers seven different priority sequencing rules in job shop scheduling. For evaluation and selection of the best priority sequencing rule, a set of eight criteria are considered. The aim of this work is to demonstrate the methodology of evaluating and selecting the best priority sequencing rule by using hybrid multi criteria decision making technique (MCDM), i.e., analytical hierarchy process (AHP) with technique for order preference by similarity to ideal solution (TOPSIS). The criteria weights are calculated by using AHP whereas the relative closeness values of all priority sequencing rules are computed based on TOPSIS with the help of data acquired from the shop floor of a manufacturing firm. Finally, from the findings of this work, the priority sequencing rules are ranked from most important to least important. The comprehensive methodology presented in this paper is very much essential for the management of a workstation to choose the best priority sequencing rule among the available alternatives for processing the jobs with maximum benefit.

Proportional fair scheduling algorithm based on traffic in satellite communication system

NASA Astrophysics Data System (ADS)

Pan, Cheng-Sheng; Sui, Shi-Long; Liu, Chun-ling; Shi, Yu-Xin

2018-02-01

In the satellite communication network system, in order to solve the problem of low system capacity and user fairness in multi-user access to satellite communication network in the downlink, combined with the characteristics of user data service, an algorithm study on throughput capacity and user fairness scheduling is proposed - Proportional Fairness Algorithm Based on Traffic(B-PF). The algorithm is improved on the basis of the proportional fairness algorithm in the wireless communication system, taking into account the user channel condition and caching traffic information. The user outgoing traffic is considered as the adjustment factor of the scheduling priority and presents the concept of traffic satisfaction. Firstly,the algorithm calculates the priority of the user according to the scheduling algorithm and dispatches the users with the highest priority. Secondly, when a scheduled user is the business satisfied user, the system dispatches the next priority user. The simulation results show that compared with the PF algorithm, B-PF can improve the system throughput, the business satisfaction and fairness.

Operating room scheduling using hybrid clustering priority rule and genetic algorithm

NASA Astrophysics Data System (ADS)

Santoso, Linda Wahyuni; Sinawan, Aisyah Ashrinawati; Wijaya, Andi Rahadiyan; Sudiarso, Andi; Masruroh, Nur Aini; Herliansyah, Muhammad Kusumawan

2017-11-01

Operating room is a bottleneck resource in most hospitals so that operating room scheduling system will influence the whole performance of the hospitals. This research develops a mathematical model of operating room scheduling for elective patients which considers patient priority with limit number of surgeons, operating rooms, and nurse team. Clustering analysis was conducted to the data of surgery durations using hierarchical and non-hierarchical methods. The priority rule of each resulting cluster was determined using Shortest Processing Time method. Genetic Algorithm was used to generate daily operating room schedule which resulted in the lowest values of patient waiting time and nurse overtime. The computational results show that this proposed model reduced patient waiting time by approximately 32.22% and nurse overtime by approximately 32.74% when compared to actual schedule.

Dynamic Hop Service Differentiation Model for End-to-End QoS Provisioning in Multi-Hop Wireless Networks

NASA Astrophysics Data System (ADS)

Youn, Joo-Sang; Seok, Seung-Joon; Kang, Chul-Hee

This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc environments.

Advanced Numerical Techniques of Performance Evaluation. Volume 1

DTIC Science & Technology

1990-06-01

system scheduling3thread. The scheduling thread then runs any other ready thread that can be found. A thread can only sleep or switch out on itself...Polychronopoulos and D.J. Kuck. Guided Self- Scheduling : A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Transactions on Computers C...Kuck 1987] C.D. Polychronopoulos and D.J. Kuck. Guided Self- Scheduling : A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Trans. on Comp

A bi-objective integer programming model for partly-restricted flight departure scheduling

PubMed Central

Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows. PMID:29715299

A bi-objective integer programming model for partly-restricted flight departure scheduling.

PubMed

Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

Variable disparity estimation based intermediate view reconstruction in dynamic flow allocation over EPON-based access networks

NASA Astrophysics Data System (ADS)

Bae, Kyung-Hoon; Lee, Jungjoon; Kim, Eun-Soo

2008-06-01

In this paper, a variable disparity estimation (VDE)-based intermediate view reconstruction (IVR) in dynamic flow allocation (DFA) over an Ethernet passive optical network (EPON)-based access network is proposed. In the proposed system, the stereoscopic images are estimated by a variable block-matching algorithm (VBMA), and they are transmitted to the receiver through DFA over EPON. This scheme improves a priority-based access network by converting it to a flow-based access network with a new access mechanism and scheduling algorithm, and then 16-view images are synthesized by the IVR using VDE. Some experimental results indicate that the proposed system improves the peak-signal-to-noise ratio (PSNR) to as high as 4.86 dB and reduces the processing time to 3.52 s. Additionally, the network service provider can provide upper limits of transmission delays by the flow. The modeling and simulation results, including mathematical analyses, from this scheme are also provided.

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

PubMed

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

2016-02-01

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

Cost-efficient scheduling of FAST observations

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

Scheduling Future Water Supply Investments Under Uncertainty

NASA Astrophysics Data System (ADS)

Huskova, I.; Matrosov, E. S.; Harou, J. J.; Kasprzyk, J. R.; Reed, P. M.

2014-12-01

Uncertain hydrological impacts of climate change, population growth and institutional changes pose a major challenge to planning of water supply systems. Planners seek optimal portfolios of supply and demand management schemes but also when to activate assets whilst considering many system goals and plausible futures. Incorporation of scheduling into the planning under uncertainty problem strongly increases its complexity. We investigate some approaches to scheduling with many-objective heuristic search. We apply a multi-scenario many-objective scheduling approach to the Thames River basin water supply system planning problem in the UK. Decisions include which new supply and demand schemes to implement, at what capacity and when. The impact of different system uncertainties on scheme implementation schedules are explored, i.e. how the choice of future scenarios affects the search process and its outcomes. The activation of schemes is influenced by the occurrence of extreme hydrological events in the ensemble of plausible scenarios and other factors. The approach and results are compared with a previous study where only the portfolio problem is addressed (without scheduling).

A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks

PubMed Central

Gil, Joon-Min; Han, Youn-Hee

2011-01-01

As a promising tool for monitoring the physical world, directional sensor networks (DSNs) consisting of a large number of directional sensors are attracting increasing attention. As directional sensors in DSNs have limited battery power and restricted angles of sensing range, maximizing the network lifetime while monitoring all the targets in a given area remains a challenge. A major technique to conserve the energy of directional sensors is to use a node wake-up scheduling protocol by which some sensors remain active to provide sensing services, while the others are inactive to conserve their energy. In this paper, we first address a Maximum Set Covers for DSNs (MSCD) problem, which is known to be NP-complete, and present a greedy algorithm-based target coverage scheduling scheme that can solve this problem by heuristics. This scheme is used as a baseline for comparison. We then propose a target coverage scheduling scheme based on a genetic algorithm that can find the optimal cover sets to extend the network lifetime while monitoring all targets by the evolutionary global search technique. To verify and evaluate these schemes, we conducted simulations and showed that the schemes can contribute to extending the network lifetime. Simulation results indicated that the genetic algorithm-based scheduling scheme had better performance than the greedy algorithm-based scheme in terms of maximizing network lifetime. PMID:22319387

Science Planning for the Solar Probe Plus NASA Mission

NASA Astrophysics Data System (ADS)

Kusterer, M. B.; Fox, N. J.; Turner, F. S.; Vandegriff, J. D.

2015-12-01

With a planned launch in 2018, there are a number of challenges for the Science Planning Team (SPT) of the Solar Probe Plus mission. The geometry of the celestial bodies and the spacecraft during some of the Solar Probe Plus mission orbits cause limited uplink and downlink opportunities. The payload teams must manage the volume of data that they write to the spacecraft solid-state recorders (SSR) for their individual instruments for downlink to the ground. The aim is to write the instrument data to the spacecraft SSR for downlink before a set of data downlink opportunities large enough to get the data to the ground and before the start of another data collection cycle. The SPT also intend to coordinate observations with other spacecraft and ground based systems. To add further complexity, two of the spacecraft payloads have the capability to write a large volumes of data to their internal payload SSR while sending a smaller "survey" portion of the data to the spacecraft SSR for downlink. The instrument scientists would then view the survey data on the ground, determine the most interesting data from their payload SSR, send commands to transfer that data from their payload SSR to the spacecraft SSR for downlink. The timing required for downlink and analysis of the survey data, identifying uplink opportunities for commanding data transfers, and downlink opportunities big enough for the selected data within the data collection period is critical. To solve these challenges, the Solar Probe Plus Science Working Group has designed a orbit-type optimized data file priority downlink scheme to downlink high priority survey data quickly. This file priority scheme would maximize the reaction time that the payload teams have to perform the survey and selected data method on orbits where the downlink and uplink availability will support using this method. An interactive display and analysis science planning tool is being designed for the SPT to use as an aid to planning. The tool will integrate the data file priority downlink scheme, payload data volume allocations, spacecraft ephemeris, attitude, downlink and uplink schedules, spacecraft and payload activities, and other spacecraft ephemeris. A prototype of the tool is in development using notional inputs obtained from the spacecraft engineering teams.

An advanced approach to traditional round robin CPU scheduling algorithm to prioritize processes with residual burst time nearest to the specified time quantum

NASA Astrophysics Data System (ADS)

Swaraj Pati, Mythili N.; Korde, Pranav; Dey, Pallav

2017-11-01

The purpose of this paper is to introduce an optimised variant to the round robin scheduling algorithm. Every algorithm works in its own way and has its own merits and demerits. The proposed algorithm overcomes the shortfalls of the existing scheduling algorithms in terms of waiting time, turnaround time, throughput and number of context switches. The algorithm is pre-emptive and works based on the priority of the associated processes. The priority is decided on the basis of the remaining burst time of a particular process, that is; lower the burst time, higher the priority and higher the burst time, lower the priority. To complete the execution, a time quantum is initially specified. In case if the burst time of a particular process is less than 2X of the specified time quantum but more than 1X of the specified time quantum; the process is given high priority and is allowed to execute until it completes entirely and finishes. Such processes do not have to wait for their next burst cycle.

Dedicated heterogeneous node scheduling including backfill scheduling

DOEpatents

Wood, Robert R [Livermore, CA; Eckert, Philip D [Livermore, CA; Hommes, Gregg [Pleasanton, CA

2006-07-25

A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

Hybrid scheduling mechanisms for Next-generation Passive Optical Networks based on network coding

NASA Astrophysics Data System (ADS)

Zhao, Jijun; Bai, Wei; Liu, Xin; Feng, Nan; Maier, Martin

2014-10-01

Network coding (NC) integrated into Passive Optical Networks (PONs) is regarded as a promising solution to achieve higher throughput and energy efficiency. To efficiently support multimedia traffic under this new transmission mode, novel NC-based hybrid scheduling mechanisms for Next-generation PONs (NG-PONs) including energy management, time slot management, resource allocation, and Quality-of-Service (QoS) scheduling are proposed in this paper. First, we design an energy-saving scheme that is based on Bidirectional Centric Scheduling (BCS) to reduce the energy consumption of both the Optical Line Terminal (OLT) and Optical Network Units (ONUs). Next, we propose an intra-ONU scheduling and an inter-ONU scheduling scheme, which takes NC into account to support service differentiation and QoS assurance. The presented simulation results show that BCS achieves higher energy efficiency under low traffic loads, clearly outperforming the alternative NC-based Upstream Centric Scheduling (UCS) scheme. Furthermore, BCS is shown to provide better QoS assurance.

Scheduling job shop - A case study

NASA Astrophysics Data System (ADS)

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

2016-08-01

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

Impact Analysis of Flow Shaping in Ethernet-AVB/TSN and AFDX from Network Calculus and Simulation Perspective

PubMed Central

He, Feng; Zhao, Lin; Li, Ershuai

2017-01-01

Ethernet-AVB/TSN (Audio Video Bridging/Time-Sensitive Networking) and AFDX (Avionics Full DupleX switched Ethernet) are switched Ethernet technologies, which are both candidates for real-time communication in the context of transportation systems. AFDX implements a fixed priority scheduling strategy with two priority levels. Ethernet-AVB/TSN supports a similar fixed priority scheduling with an additional Credit-Based Shaper (CBS) mechanism. Besides, TSN can support time-triggered scheduling strategy. One direct effect of CBS mechanism is to increase the delay of its flows while decreasing the delay of other priority ones. The former effect can be seen as the shaping restriction and the latter effect can be seen as the shaping benefit from CBS. The goal of this paper is to investigate the impact of CBS on different priority flows, especially on the intermediate priority ones, as well as the effect of CBS bandwidth allocation. It is based on a performance comparison of AVB/TSN and AFDX by simulation in an automotive case study. Furthermore, the shaping benefit is modeled based on integral operation from network calculus perspective. Combing with the analysis of shaping restriction and shaping benefit, some configuration suggestions on the setting of CBS bandwidth are given. Results show that the effect of CBS depends on flow loads and CBS configurations. A larger load of high priority flows in AVB tends to a better performance for the intermediate priority flows when compared with AFDX. Shaping benefit can be explained and calculated according to the changing from the permitted maximum burst. PMID:28531158

Performance Optimization of Priority Assisted CSMA/CA Mechanism of 802.15.6 under Saturation Regime

PubMed Central

Shakir, Mustafa; Rehman, Obaid Ur; Rahim, Mudassir; Alrajeh, Nabil; Khan, Zahoor Ali; Khan, Mahmood Ashraf; Niaz, Iftikhar Azim; Javaid, Nadeem

2016-01-01

Due to the recent development in the field of Wireless Sensor Networks (WSNs), the Wireless Body Area Networks (WBANs) have become a major area of interest for the developers and researchers. Human body exhibits postural mobility due to which distance variation occurs and the status of connections amongst sensors change time to time. One of the major requirements of WBAN is to prolong the network lifetime without compromising on other performance measures, i.e., delay, throughput and bandwidth efficiency. Node prioritization is one of the possible solutions to obtain optimum performance in WBAN. IEEE 802.15.6 CSMA/CA standard splits the nodes with different user priorities based on Contention Window (CW) size. Smaller CW size is assigned to higher priority nodes. This standard helps to reduce delay, however, it is not energy efficient. In this paper, we propose a hybrid node prioritization scheme based on IEEE 802.15.6 CSMA/CA to reduce energy consumption and maximize network lifetime. In this scheme, optimum performance is achieved by node prioritization based on CW size as well as power in respective user priority. Our proposed scheme reduces the average back off time for channel access due to CW based prioritization. Additionally, power based prioritization for a respective user priority helps to minimize required number of retransmissions. Furthermore, we also compare our scheme with IEEE 802.15.6 CSMA/CA standard (CW assisted node prioritization) and power assisted node prioritization under postural mobility in WBAN. Mathematical expressions are derived to determine the accurate analytical model for throughput, delay, bandwidth efficiency, energy consumption and life time for each node prioritization scheme. With the intention of analytical model validation, we have performed the simulations in OMNET++/MIXIM framework. Analytical and simulation results show that our proposed hybrid node prioritization scheme outperforms other node prioritization schemes in terms of average network delay, average throughput, average bandwidth efficiency and network lifetime. PMID:27598167

Geometric Distribution-Based Readers Scheduling Optimization Algorithm Using Artificial Immune System.

PubMed

Duan, Litian; Wang, Zizhong John; Duan, Fu

2016-11-16

In the multiple-reader environment (MRE) of radio frequency identification (RFID) system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS) is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression) quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range.

Geometric Distribution-Based Readers Scheduling Optimization Algorithm Using Artificial Immune System

PubMed Central

Duan, Litian; Wang, Zizhong John; Duan, Fu

2016-01-01

In the multiple-reader environment (MRE) of radio frequency identification (RFID) system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS) is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression) quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range. PMID:27854342

Modernizing sports facilities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dustin, R.

Modernization and renovation of sports facilities challenge the design team to balance a number of requirements: spectator and owner expectations, existing building and site conditions, architectural layouts, code and legislation issues, time constraints and budget issues. System alternatives are evaluated and selected based on the relative priorities of these requirements. These priorities are unique to each project. At Alexander Memorial Coliseum, project schedules, construction funds and facility usage became the priorities. The ACC basketball schedule and arrival of the Centennial Olympics dictated the construction schedule. Initiation and success of the project depended on the commitment of the design team tomore » meet coliseum funding levels established three years ago. Analysis of facility usage and system alternative capabilities drove the design team to select a system that met the project requirements and will maximize the benefits to the owner and spectators for many years to come.« less

A subjective scheduler for subjective dedicated networks

NASA Astrophysics Data System (ADS)

Suherman; Fakhrizal, Said Reza; Al-Akaidi, Marwan

2017-09-01

Multiple access technique is one of important techniques within medium access layer in TCP/IP protocol stack. Each network technology implements the selected access method. Priority can be implemented in those methods to differentiate services. Some internet networks are dedicated for specific purpose. Education browsing or tutorial video accesses are preferred in a library hotspot, while entertainment and sport contents could be subjects of limitation. Current solution may use IP address filter or access list. This paper proposes subjective properties of users or applications are used for priority determination in multiple access techniques. The NS-2 simulator is employed to evaluate the method. A video surveillance network using WiMAX is chosen as the object. Subjective priority is implemented on WiMAX scheduler based on traffic properties. Three different traffic sources from monitoring video: palace, park, and market are evaluated. The proposed subjective scheduler prioritizes palace monitoring video that results better quality, xx dB than the later monitoring spots.

Real-Time Support on IEEE 802.11 Wireless Ad-Hoc Networks: Reality vs. Theory

NASA Astrophysics Data System (ADS)

Kang, Mikyung; Kang, Dong-In; Suh, Jinwoo

The usable throughput of an IEEE 802.11 system for an application is much less than the raw bandwidth. Although 802.11b has a theoretical maximum of 11Mbps, more than half of the bandwidth is consumed by overhead leaving at most 5Mbps of usable bandwidth. Considering this characteristic, this paper proposes and analyzes a real-time distributed scheduling scheme based on the existing IEEE 802.11 wireless ad-hoc networks, using USC/ISI's Power Aware Sensing Tracking and Analysis (PASTA) hardware platform. We compared the distributed real-time scheduling scheme with the real-time polling scheme to meet deadline, and compared a measured real bandwidth with a theoretical result. The theoretical and experimental results show that the distributed scheduling scheme can guarantee real-time traffic and enhances the performance up to 74% compared with polling scheme.

Systolic array processing of the sequential decoding algorithm

NASA Technical Reports Server (NTRS)

Chang, C. Y.; Yao, K.

1989-01-01

A systolic array processing technique is applied to implementing the stack algorithm form of the sequential decoding algorithm. It is shown that sorting, a key function in the stack algorithm, can be efficiently realized by a special type of systolic arrays known as systolic priority queues. Compared to the stack-bucket algorithm, this approach is shown to have the advantages that the decoding always moves along the optimal path, that it has a fast and constant decoding speed and that its simple and regular hardware architecture is suitable for VLSI implementation. Three types of systolic priority queues are discussed: random access scheme, shift register scheme and ripple register scheme. The property of the entries stored in the systolic priority queue is also investigated. The results are applicable to many other basic sorting type problems.

Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management.

PubMed

Silva, Bhagya Nathali; Khan, Murad; Han, Kijun

2018-02-25

The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST) algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism.

Strategic workload management and decision biases in aviation

NASA Technical Reports Server (NTRS)

Raby, Mireille; Wickens, Christopher D.

1994-01-01

Thirty pilots flew three simulated landing approaches under conditions of low, medium, and high workload. Workload conditions were created by varying time pressure and external communications requirements. Our interest was in how the pilots strategically managed or adapted to the increasing workload. We independently assessed the pilot's ranking of the priority of different discrete tasks during the approach and landing. Pilots were found to sacrifice some aspects of primary flight control as workload increased. For discrete tasks, increasing workload increased the amount of time in performing the high priority tasks, decreased the time in performing those of lowest priority, and did not affect duration of performance episodes or optimality of scheduling of tasks of any priority level. Individual differences analysis revealed that high-performing subjects scheduled discrete tasks earlier in the flight and shifted more often between different activities.

Pricing the Computing Resources: Reading Between the Lines and Beyond

NASA Technical Reports Server (NTRS)

Nakai, Junko; Veronico, Nick (Editor); Thigpen, William W. (Technical Monitor)

2001-01-01

Distributed computing systems have the potential to increase the usefulness of existing facilities for computation without adding anything physical, but that is realized only when necessary administrative features are in place. In a distributed environment, the best match is sought between a computing job to be run and a computer to run the job (global scheduling), which is a function that has not been required by conventional systems. Viewing the computers as 'suppliers' and the users as 'consumers' of computing services, markets for computing services/resources have been examined as one of the most promising mechanisms for global scheduling. We first establish why economics can contribute to scheduling. We further define the criterion for a scheme to qualify as an application of economics. Many studies to date have claimed to have applied economics to scheduling. If their scheduling mechanisms do not utilize economics, contrary to their claims, their favorable results do not contribute to the assertion that markets provide the best framework for global scheduling. We examine the well-known scheduling schemes, which concern pricing and markets, using our criterion of what application of economics is. Our conclusion is that none of the schemes examined makes full use of economics.

15 CFR 200.110 - Priorities and time of completion.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 15 Commerce and Foreign Trade 1 2011-01-01 2011-01-01 false Priorities and time of completion. 200..., SERVICES, PROCEDURES, AND FEES § 200.110 Priorities and time of completion. Schedule work assignments for calibrations and other tests will generally be made in the order in which confirmed requests are received...

Knowledge-based systems for power management

NASA Technical Reports Server (NTRS)

Lollar, L. F.

1992-01-01

NASA-Marshall's Electrical Power Branch has undertaken the development of expert systems in support of further advancements in electrical power system automation. Attention is given to the features (1) of the Fault Recovery and Management Expert System, (2) a resource scheduler or Master of Automated Expert Scheduling Through Resource Orchestration, and (3) an adaptive load-priority manager, or Load Priority List Management System. The characteristics of an advisory battery manager for the Hubble Space Telescope, designated the 'nickel-hydrogen expert system', are also noted.

A Novel Component Carrier Configuration and Switching Scheme for Real-Time Traffic in a Cognitive-Radio-Based Spectrum Aggregation System

PubMed Central

Fu, Yunhai; Ma, Lin; Xu, Yubin

2015-01-01

In spectrum aggregation (SA), two or more component carriers (CCs) of different bandwidths in different bands can be aggregated to support a wider transmission bandwidth. The scheduling delay is the most important design constraint for the broadband wireless trunking (BWT) system, especially in the cognitive radio (CR) condition. The current resource scheduling schemes for spectrum aggregation become questionable and are not suitable for meeting the challenge of the delay requirement. Consequently, the authors propose a novel component carrier configuration and switching scheme for real-time traffic (RT-CCCS) to satisfy the delay requirement in the CR-based SA system. In this work, the authors consider a sensor-network-assisted CR network. The authors first introduce a resource scheduling structure for SA in the CR condition. Then the proposed scheme is analyzed in detail. Finally, simulations are carried out to verify the analysis on the proposed scheme. Simulation results prove that our proposed scheme can satisfy the delay requirement in the CR-based SA system. PMID:26393594

Optimal updating magnitude in adaptive flat-distribution sampling

NASA Astrophysics Data System (ADS)

Zhang, Cheng; Drake, Justin A.; Ma, Jianpeng; Pettitt, B. Montgomery

2017-11-01

We present a study on the optimization of the updating magnitude for a class of free energy methods based on flat-distribution sampling, including the Wang-Landau (WL) algorithm and metadynamics. These methods rely on adaptive construction of a bias potential that offsets the potential of mean force by histogram-based updates. The convergence of the bias potential can be improved by decreasing the updating magnitude with an optimal schedule. We show that while the asymptotically optimal schedule for the single-bin updating scheme (commonly used in the WL algorithm) is given by the known inverse-time formula, that for the Gaussian updating scheme (commonly used in metadynamics) is often more complex. We further show that the single-bin updating scheme is optimal for very long simulations, and it can be generalized to a class of bandpass updating schemes that are similarly optimal. These bandpass updating schemes target only a few long-range distribution modes and their optimal schedule is also given by the inverse-time formula. Constructed from orthogonal polynomials, the bandpass updating schemes generalize the WL and Langfeld-Lucini-Rago algorithms as an automatic parameter tuning scheme for umbrella sampling.

Optimal updating magnitude in adaptive flat-distribution sampling.

PubMed

Zhang, Cheng; Drake, Justin A; Ma, Jianpeng; Pettitt, B Montgomery

2017-11-07

We present a study on the optimization of the updating magnitude for a class of free energy methods based on flat-distribution sampling, including the Wang-Landau (WL) algorithm and metadynamics. These methods rely on adaptive construction of a bias potential that offsets the potential of mean force by histogram-based updates. The convergence of the bias potential can be improved by decreasing the updating magnitude with an optimal schedule. We show that while the asymptotically optimal schedule for the single-bin updating scheme (commonly used in the WL algorithm) is given by the known inverse-time formula, that for the Gaussian updating scheme (commonly used in metadynamics) is often more complex. We further show that the single-bin updating scheme is optimal for very long simulations, and it can be generalized to a class of bandpass updating schemes that are similarly optimal. These bandpass updating schemes target only a few long-range distribution modes and their optimal schedule is also given by the inverse-time formula. Constructed from orthogonal polynomials, the bandpass updating schemes generalize the WL and Langfeld-Lucini-Rago algorithms as an automatic parameter tuning scheme for umbrella sampling.

Active Solution Space and Search on Job-shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Watanabe, Masato; Ida, Kenichi; Gen, Mitsuo

In this paper we propose a new searching method of Genetic Algorithm for Job-shop scheduling problem (JSP). The coding method that represent job number in order to decide a priority to arrange a job to Gannt Chart (called the ordinal representation with a priority) in JSP, an active schedule is created by using left shift. We define an active solution at first. It is solution which can create an active schedule without using left shift, and set of its defined an active solution space. Next, we propose an algorithm named Genetic Algorithm with active solution space search (GA-asol) which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it for some benchmark problems to compare with other method. The experimental results show good performance.

Wavelength assignment algorithm considering the state of neighborhood links for OBS networks

NASA Astrophysics Data System (ADS)

Tanaka, Yu; Hirota, Yusuke; Tode, Hideki; Murakami, Koso

2005-10-01

Recently, Optical WDM technology is introduced into backbone networks. On the other hand, as the future optical switching scheme, Optical Burst Switching (OBS) systems become a realistic solution. OBS systems do not consider buffering in intermediate nodes. Thus, it is an important issue to avoid overlapping wavelength reservation between partially interfered paths. To solve this problem, so far, the wavelength assignment scheme which has priority management tables has been proposed. This method achieves the reduction of burst blocking probability. However, this priority management table requires huge memory space. In this paper, we propose a wavelength assignment algorithm that reduces both the number of priority management tables and burst blocking probability. To reduce priority management tables, we allocate and manage them for each link. To reduce burst blocking probability, our method announces information about the change of their priorities to intermediate nodes. We evaluate its performance in terms of the burst blocking probability and the reduction rate of priority management tables.

Strategies GeoCape Intelligent Observation Studies @ GSFC

NASA Technical Reports Server (NTRS)

Cappelaere, Pat; Frye, Stu; Moe, Karen; Mandl, Dan; LeMoigne, Jacqueline; Flatley, Tom; Geist, Alessandro

2015-01-01

This presentation provides information a summary of the tradeoff studies conducted for GeoCape by the GSFC team in terms of how to optimize GeoCape observation efficiency. Tradeoffs include total ground scheduling with simple priorities, ground scheduling with cloud forecast, ground scheduling with sub-area forecast, onboard scheduling with onboard cloud detection and smart onboard scheduling and onboard image processing. The tradeoffs considered optimzing cost, downlink bandwidth and total number of images acquired.

Collision Resolution Scheme with Offset for Improved Performance of Heterogeneous WLAN

NASA Astrophysics Data System (ADS)

Upadhyay, Raksha; Vyavahare, Prakash D.; Tokekar, Sanjiv

2016-03-01

CSMA/CA based DCF of 802.11 MAC layer employs best effort delivery model, in which all stations compete for channel access with same priority. Heterogeneous conditions result in unfairness among stations and degradation in throughput, therefore, providing different priorities to different applications for required quality of service in heterogeneous networks is challenging task. This paper proposes a collision resolution scheme with a novel concept of introducing offset, which is suitable for heterogeneous networks. Selection of random value by a station for its contention with offset results in reduced probability of collision. Expression for the optimum value of the offset is also derived. Results show that proposed scheme, when applied to heterogeneous networks, has improved throughput and fairness than conventional scheme. Results show that proposed scheme also exhibits higher throughput and fairness with reduced delay in homogeneous networks.

An Efficient Scheduling Scheme on Charging Stations for Smart Transportation

NASA Astrophysics Data System (ADS)

Kim, Hye-Jin; Lee, Junghoon; Park, Gyung-Leen; Kang, Min-Jae; Kang, Mikyung

This paper proposes a reservation-based scheduling scheme for the charging station to decide the service order of multiple requests, aiming at improving the satisfiability of electric vehicles. The proposed scheme makes it possible for a customer to reduce the charge cost and waiting time, while a station can extend the number of clients it can serve. A linear rank function is defined based on estimated arrival time, waiting time bound, and the amount of needed power, reducing the scheduling complexity. Receiving the requests from the clients, the power station decides the charge order by the rank function and then replies to the requesters with the waiting time and cost it can guarantee. Each requester can decide whether to charge at that station or try another station. This scheduler can evolve to integrate a new pricing policy and services, enriching the electric vehicle transport system.

Research on crude oil storage and transportation based on optimization algorithm

NASA Astrophysics Data System (ADS)

Yuan, Xuhua

2018-04-01

At present, the optimization theory and method have been widely used in the optimization scheduling and optimal operation scheme of complex production systems. Based on C++Builder 6 program development platform, the theoretical research results are implemented by computer. The simulation and intelligent decision system of crude oil storage and transportation inventory scheduling are designed. The system includes modules of project management, data management, graphics processing, simulation of oil depot operation scheme. It can realize the optimization of the scheduling scheme of crude oil storage and transportation system. A multi-point temperature measuring system for monitoring the temperature field of floating roof oil storage tank is developed. The results show that by optimizing operating parameters such as tank operating mode and temperature, the total transportation scheduling costs of the storage and transportation system can be reduced by 9.1%. Therefore, this method can realize safe and stable operation of crude oil storage and transportation system.

Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management

PubMed Central

Silva, Bhagya Nathali; Khan, Murad; Han, Kijun

2018-01-01

The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST) algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism. PMID:29495346

Unstructured P2P Network Load Balance Strategy Based on Multilevel Partitioning of Hypergraph

NASA Astrophysics Data System (ADS)

Feng, Lv; Chunlin, Gao; Kaiyang, Ma

2017-05-01

With rapid development of computer performance and distributed technology, P2P-based resource sharing mode plays important role in Internet. P2P network users continued to increase so the high dynamic characteristics of the system determine that it is difficult to obtain the load of other nodes. Therefore, a dynamic load balance strategy based on hypergraph is proposed in this article. The scheme develops from the idea of hypergraph theory in multilevel partitioning. It adopts optimized multilevel partitioning algorithms to partition P2P network into several small areas, and assigns each area a supernode for the management and load transferring of the nodes in this area. In the case of global scheduling is difficult to be achieved, the priority of a number of small range of load balancing can be ensured first. By the node load balance in each small area the whole network can achieve relative load balance. The experiments indicate that the load distribution of network nodes in our scheme is obviously compacter. It effectively solves the unbalanced problems in P2P network, which also improve the scalability and bandwidth utilization of system.

Two-Level Scheduling for Video Transmission over Downlink OFDMA Networks

PubMed Central

Tham, Mau-Luen

2016-01-01

This paper presents a two-level scheduling scheme for video transmission over downlink orthogonal frequency-division multiple access (OFDMA) networks. It aims to maximize the aggregate quality of the video users subject to the playback delay and resource constraints, by exploiting the multiuser diversity and the video characteristics. The upper level schedules the transmission of video packets among multiple users based on an overall target bit-error-rate (BER), the importance level of packet and resource consumption efficiency factor. Instead, the lower level renders unequal error protection (UEP) in terms of target BER among the scheduled packets by solving a weighted sum distortion minimization problem, where each user weight reflects the total importance level of the packets that has been scheduled for that user. Frequency-selective power is then water-filled over all the assigned subcarriers in order to leverage the potential channel coding gain. Realistic simulation results demonstrate that the proposed scheme significantly outperforms the state-of-the-art scheduling scheme by up to 6.8 dB in terms of peak-signal-to-noise-ratio (PSNR). Further test evaluates the suitability of equal power allocation which is the common assumption in the literature. PMID:26906398

Scheduling algorithm for data relay satellite optical communication based on artificial intelligent optimization

NASA Astrophysics Data System (ADS)

Zhao, Wei-hu; Zhao, Jing; Zhao, Shang-hong; Li, Yong-jun; Wang, Xiang; Dong, Yi; Dong, Chen

2013-08-01

Optical satellite communication with the advantages of broadband, large capacity and low power consuming broke the bottleneck of the traditional microwave satellite communication. The formation of the Space-based Information System with the technology of high performance optical inter-satellite communication and the realization of global seamless coverage and mobile terminal accessing are the necessary trend of the development of optical satellite communication. Considering the resources, missions and restraints of Data Relay Satellite Optical Communication System, a model of optical communication resources scheduling is established and a scheduling algorithm based on artificial intelligent optimization is put forwarded. According to the multi-relay-satellite, multi-user-satellite, multi-optical-antenna and multi-mission with several priority weights, the resources are scheduled reasonable by the operation: "Ascertain Current Mission Scheduling Time" and "Refresh Latter Mission Time-Window". The priority weight is considered as the parameter of the fitness function and the scheduling project is optimized by the Genetic Algorithm. The simulation scenarios including 3 relay satellites with 6 optical antennas, 12 user satellites and 30 missions, the simulation result reveals that the algorithm obtain satisfactory results in both efficiency and performance and resources scheduling model and the optimization algorithm are suitable in multi-relay-satellite, multi-user-satellite, and multi-optical-antenna recourses scheduling problem.

Emergency material allocation and scheduling for the application to chemical contingency spills under multiple scenarios.

PubMed

Liu, Jie; Guo, Liang; Jiang, Jiping; Jiang, Dexun; Wang, Peng

2017-01-01

In the emergency management relevant to chemical contingency spills, efficiency emergency rescue can be deeply influenced by a reasonable assignment of the available emergency materials to the related risk sources. In this study, an emergency material scheduling model (EMSM) with time-effective and cost-effective objectives is developed to coordinate both allocation and scheduling of the emergency materials. Meanwhile, an improved genetic algorithm (IGA) which includes a revision operation for EMSM is proposed to identify the emergency material scheduling schemes. Then, scenario analysis is used to evaluate optimal emergency rescue scheme under different emergency pollution conditions associated with different threat degrees based on analytic hierarchy process (AHP) method. The whole framework is then applied to a computational experiment based on south-to-north water transfer project in China. The results demonstrate that the developed method not only could guarantee the implementation of the emergency rescue to satisfy the requirements of chemical contingency spills but also help decision makers identify appropriate emergency material scheduling schemes in a balance between time-effective and cost-effective objectives.

Science Planning and Orbit Classification for Solar Probe Plus

NASA Astrophysics Data System (ADS)

Kusterer, M. B.; Fox, N. J.; Rodgers, D. J.; Turner, F. S.

2016-12-01

There are a number of challenges for the Science Planning Team (SPT) of the Solar Probe Plus (SPP) Mission. Since SPP is using a decoupled payload operations approach, tight coordination between the mission operations and payload teams will be required. The payload teams must manage the volume of data that they write to the spacecraft solid-state recorders (SSR) for their individual instruments for downlink to the ground. Making this process more difficult, the geometry of the celestial bodies and the spacecraft during some of the SPP mission orbits cause limited uplink and downlink opportunities. The payload teams will also be required to coordinate power on opportunities, command uplink opportunities, and data transfers from instrument memory to the spacecraft SSR with the operation team. The SPT also intend to coordinate observations with other spacecraft and ground based systems. To solve these challenges, detailed orbit activity planning is required in advance for each orbit. An orbit planning process is being created to facilitate the coordination of spacecraft and payload activities for each orbit. An interactive Science Planning Tool is being designed to integrate the payload data volume and priority allocations, spacecraft ephemeris, attitude, downlink and uplink schedules, spacecraft and payload activities, and other spacecraft ephemeris. It will be used during science planning to select the instrument data priorities and data volumes that satisfy the orbit data volume constraints and power on, command uplink and data transfer time periods. To aid in the initial stages of science planning we have created an orbit classification scheme based on downlink availability and significant science events. Different types of challenges arise in the management of science data driven by orbital geometry and operational constraints, and this scheme attempts to identify the patterns that emerge.

Synchronization of Leisure Conflicts in the Family Schedule.

ERIC Educational Resources Information Center

Kelly, John R.

The model of the family as a set of contingent careers is brought into focus by Wilbert Moore's suggestions that in schedule synchronization the family takes priority in claiming time, the wife-mother asserts such claims and arranges the schedule, and common leisure activities symbolize the solidarity of the unit. The perception of parents of the…

Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

PubMed Central

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

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

Dynamic hierarchical sleep scheduling for wireless ad-hoc sensor networks.

PubMed

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

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

Performance comparison of token ring protocols for hard-real-time communication

NASA Technical Reports Server (NTRS)

Kamat, Sanjay; Zhao, Wei

1992-01-01

The ability to guarantee the deadlines of synchronous messages while maintaining a good aggregate throughput is an important consideration in the design of distributed real-time systems. In this paper, we study two token ring protocols, the priority driven protocol and the timed token protocol, for their suitability for hard real-time systems. Both these protocols use a token to control access to the transmission medium. In a priority driven protocol, messages are assigned priorities and the protocol ensures that messages are transmitted in the order of their priorities. Timed token protocols do not provide for priority arbitration but ensure that the maximum access delay for a station is bounded. For both protocols, we first derive the schedulability conditions under which the transmission deadlines of a given set of synchronous messages can be guaranteed. Subsequently, we use these schedulability conditions to quantitatively compare the average case behavior of the protocols. This comparison demonstrates that each of the protocols has its domain of superior performance and neither dominates the other for the entire range of operating conditions.

PWFQ: a priority-based weighted fair queueing algorithm for the downstream transmission of EPON

NASA Astrophysics Data System (ADS)

Xu, Sunjuan; Ye, Jiajun; Zou, Junni

2005-11-01

In the downstream direction of EPON, all ethernet frames share one downlink channel from the OLT to destination ONUs. To guarantee differentiated services, a scheduling algorithm is needed to solve the link-sharing issue. In this paper, we first review the classical WFQ algorithm and point out the shortcomings existing in the fair queueing principle of WFQ algorithm for EPON. Then we propose a novel scheduling algorithm called Priority-based WFQ (PWFQ) algorithm which distributes bandwidth based on priority. PWFQ algorithm can guarantee the quality of real-time services whether under light load or under heavy load. Simulation results also show that PWFQ algorithm not only can improve delay performance of real-time services, but can also meet the worst-case delay bound requirements.

Range and mission scheduling automation using combined AI and operations research techniques

NASA Technical Reports Server (NTRS)

Arbabi, Mansur; Pfeifer, Michael

1987-01-01

Ground-based systems for Satellite Command, Control, and Communications (C3) operations require a method for planning, scheduling and assigning the range resources such as: antenna systems scattered around the world, communications systems, and personnel. The method must accommodate user priorities, last minute changes, maintenance requirements, and exceptions from nominal requirements. Described are computer programs which solve 24 hour scheduling problems, using heuristic algorithms and a real time interactive scheduling process.

Smart sensing to drive real-time loads scheduling algorithm in a domotic architecture

NASA Astrophysics Data System (ADS)

Santamaria, Amilcare Francesco; Raimondo, Pierfrancesco; De Rango, Floriano; Vaccaro, Andrea

2014-05-01

Nowadays the focus on power consumption represent a very important factor regarding the reduction of power consumption with correlated costs and the environmental sustainability problems. Automatic control load based on power consumption and use cycle represents the optimal solution to costs restraint. The purpose of these systems is to modulate the power request of electricity avoiding an unorganized work of the loads, using intelligent techniques to manage them based on real time scheduling algorithms. The goal is to coordinate a set of electrical loads to optimize energy costs and consumptions based on the stipulated contract terms. The proposed algorithm use two new main notions: priority driven loads and smart scheduling loads. The priority driven loads can be turned off (stand by) according to a priority policy established by the user if the consumption exceed a defined threshold, on the contrary smart scheduling loads are scheduled in a particular way to don't stop their Life Cycle (LC) safeguarding the devices functions or allowing the user to freely use the devices without the risk of exceeding the power threshold. The algorithm, using these two kind of notions and taking into account user requirements, manages loads activation and deactivation allowing the completion their operation cycle without exceeding the consumption threshold in an off-peak time range according to the electricity fare. This kind of logic is inspired by industrial lean manufacturing which focus is to minimize any kind of power waste optimizing the available resources.

Service-Oriented Node Scheduling Scheme for Wireless Sensor Networks Using Markov Random Field Model

PubMed Central

Cheng, Hongju; Su, Zhihuang; Lloret, Jaime; Chen, Guolong

2014-01-01

Future wireless sensor networks are expected to provide various sensing services and energy efficiency is one of the most important criterions. The node scheduling strategy aims to increase network lifetime by selecting a set of sensor nodes to provide the required sensing services in a periodic manner. In this paper, we are concerned with the service-oriented node scheduling problem to provide multiple sensing services while maximizing the network lifetime. We firstly introduce how to model the data correlation for different services by using Markov Random Field (MRF) model. Secondly, we formulate the service-oriented node scheduling issue into three different problems, namely, the multi-service data denoising problem which aims at minimizing the noise level of sensed data, the representative node selection problem concerning with selecting a number of active nodes while determining the services they provide, and the multi-service node scheduling problem which aims at maximizing the network lifetime. Thirdly, we propose a Multi-service Data Denoising (MDD) algorithm, a novel multi-service Representative node Selection and service Determination (RSD) algorithm, and a novel MRF-based Multi-service Node Scheduling (MMNS) scheme to solve the above three problems respectively. Finally, extensive experiments demonstrate that the proposed scheme efficiently extends the network lifetime. PMID:25384005

User modeling techniques for enhanced usability of OPSMODEL operations simulation software

NASA Technical Reports Server (NTRS)

Davis, William T.

1991-01-01

The PC based OPSMODEL operations software for modeling and simulation of space station crew activities supports engineering and cost analyses and operations planning. Using top-down modeling, the level of detail required in the data base can be limited to being commensurate with the results required of any particular analysis. To perform a simulation, a resource environment consisting of locations, crew definition, equipment, and consumables is first defined. Activities to be simulated are then defined as operations and scheduled as desired. These operations are defined within a 1000 level priority structure. The simulation on OPSMODEL, then, consists of the following: user defined, user scheduled operations executing within an environment of user defined resource and priority constraints. Techniques for prioritizing operations to realistically model a representative daily scenario of on-orbit space station crew activities are discussed. The large number of priority levels allows priorities to be assigned commensurate with the detail necessary for a given simulation. Several techniques for realistic modeling of day-to-day work carryover are also addressed.

Exploring the role of voluntary disease schemes on UK farmer bio-security behaviours: Findings from the Norfolk-Suffolk Bovine Viral Diarrhoea control scheme.

PubMed

Azbel-Jackson, Lena; Heffernan, Claire; Gunn, George; Brownlie, Joe

2018-01-01

The article describes the influence of a disease control scheme (the Norfolk-Suffolk Bovine Viral Diarrhoea Disease (BVD) Eradication scheme) on farmers' bio-security attitudes and behaviours. In 2010, a survey of 100 cattle farmers (53 scheme members vs. 47 out of scheme farmers) was undertaken among cattle farmers residing in Norfolk and Suffolk counties in the UK. A cross-sectional independent measures design was employed. The main analytical tool was content analysis. The following variables at the farmer-level were explored: the specific BVD control measures adopted, livestock disease priorities, motivation for scheme membership, wider knowledge acquisition, biosecurity behaviours employed and training course attendance. The findings suggest that participation in the BVD scheme improved farmers' perception of the scheme benefits and participation in training courses. However, no association was found between the taking part in the BVD scheme and livestock disease priorities or motivation for scheme participation, or knowledge about BVD bio-security measures employed. Equally importantly, scheme membership did appear to influence the importance accorded specific bio-security measures. Yet such ranking did not appear to reflect the actual behaviours undertaken. As such, disease control efforts alone while necessary, are insufficient. Rather, to enhance farmer bio-security behaviours significant effort must be made to address underlying attitudes to the specific disease threat involved.

Exploring the role of voluntary disease schemes on UK farmer bio-security behaviours: Findings from the Norfolk-Suffolk Bovine Viral Diarrhoea control scheme

PubMed Central

Azbel-Jackson, Lena; Heffernan, Claire; Gunn, George; Brownlie, Joe

2018-01-01

The article describes the influence of a disease control scheme (the Norfolk-Suffolk Bovine Viral Diarrhoea Disease (BVD) Eradication scheme) on farmers' bio-security attitudes and behaviours. In 2010, a survey of 100 cattle farmers (53 scheme members vs. 47 out of scheme farmers) was undertaken among cattle farmers residing in Norfolk and Suffolk counties in the UK. A cross-sectional independent measures design was employed. The main analytical tool was content analysis. The following variables at the farmer-level were explored: the specific BVD control measures adopted, livestock disease priorities, motivation for scheme membership, wider knowledge acquisition, biosecurity behaviours employed and training course attendance. The findings suggest that participation in the BVD scheme improved farmers' perception of the scheme benefits and participation in training courses. However, no association was found between the taking part in the BVD scheme and livestock disease priorities or motivation for scheme participation, or knowledge about BVD bio-security measures employed. Equally importantly, scheme membership did appear to influence the importance accorded specific bio-security measures. Yet such ranking did not appear to reflect the actual behaviours undertaken. As such, disease control efforts alone while necessary, are insufficient. Rather, to enhance farmer bio-security behaviours significant effort must be made to address underlying attitudes to the specific disease threat involved. PMID:29432435

An Analysis of Task-Scheduling for a Generic Avionics Mission Computer

DTIC Science & Technology

2006-04-01

3 3. 1. 3 Response Time Analysis........................................................................... 8 3. 2 Non - Preemptive ...Fixed Priority Scheduling ...................................................... 10 3. 2. 1 Simple Non - Preemptive Response Time Test...10 3. 2. 2 Non - Preemptive Response Time Test .................................................. 12 3. 3 Asynchronous Fixed

76 FR 46856 - Mail Classification Schedule Change

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-03

... POSTAL REGULATORY COMMISSION [Docket No. MC2011-26; Order No. 777] Mail Classification Schedule... recently-filed Postal Service request regarding classification changes to Priority Mail packaging. This...). SUPPLEMENTARY INFORMATION: On July 26, 2011, the Postal Service filed a notice of two classification changes...

Web server for priority ordered multimedia services

NASA Astrophysics Data System (ADS)

Celenk, Mehmet; Godavari, Rakesh K.; Vetnes, Vermund

2001-10-01

In this work, our aim is to provide finer priority levels in the design of a general-purpose Web multimedia server with provisions of the CM services. The type of services provided include reading/writing a web page, downloading/uploading an audio/video stream, navigating the Web through browsing, and interactive video teleconferencing. The selected priority encoding levels for such operations follow the order of admin read/write, hot page CM and Web multicasting, CM read, Web read, CM write and Web write. Hot pages are the most requested CM streams (e.g., the newest movies, video clips, and HDTV channels) and Web pages (e.g., portal pages of the commercial Internet search engines). Maintaining a list of these hot Web pages and CM streams in a content addressable buffer enables a server to multicast hot streams with lower latency and higher system throughput. Cold Web pages and CM streams are treated as regular Web and CM requests. Interactive CM operations such as pause (P), resume (R), fast-forward (FF), and rewind (RW) have to be executed without allocation of extra resources. The proposed multimedia server model is a part of the distributed network with load balancing schedulers. The SM is connected to an integrated disk scheduler (IDS), which supervises an allocated disk manager. The IDS follows the same priority handling as the SM, and implements a SCAN disk-scheduling method for an improved disk access and a higher throughput. Different disks are used for the Web and CM services in order to meet the QoS requirements of CM services. The IDS ouput is forwarded to an Integrated Transmission Scheduler (ITS). The ITS creates a priority ordered buffering of the retrieved Web pages and CM data streams that are fed into an auto regressive moving average (ARMA) based traffic shaping circuitry before being transmitted through the network.

Collaborative Scheduling Using JMS in a Mixed Java and .NET Environment

NASA Technical Reports Server (NTRS)

Wang, Yeou-Fang; Wax, Allan; Lam, Ray; Baldwin, John; Borden, Chet

2006-01-01

A collaborative framework/environment was proto-typed to prove the feasibility of scheduling space flight missions on NASA's Deep Space Network (DSN) in a distributed fashion. In this environment, effective collaboration relies on efficient communications among all flight mission and DSN scheduling users. There-fore, messaging becomes critical to timely event notification and data synchronization. In the prototype, a rapid messaging system using Java Message Service (JMS) in a mixed Java and .NET environment is established. This scheme allows both Java and .NET applications to communicate with each other for data synchronization and schedule negotiation. The JMS approach we used is based on a centralized messaging scheme. With proper use of a high speed messaging system, all users in this collaborative framework can communicate with each other to generate a schedule collaboratively to meet DSN and projects tracking needs.

Scheduling multimedia services in cloud computing environment

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

An approach to rescheduling activities based on determination of priority and disruptivity

NASA Technical Reports Server (NTRS)

Sponsler, Jeffrey L.; Johnston, Mark D.

1990-01-01

A constraint-based scheduling system called SPIKE is being used to create long term schedules for the Hubble Space Telescope. Feedback for the spacecraft or from other ground support systems may invalidate some scheduling decisions and those activities concerned must be reconsidered. A function rescheduling priority is defined which for a given activity performs a heuristic analysis and produces a relative numerical value which is used to rank all such entities in the order that they should be rescheduled. A function disruptivity is also defined that is used to place a relative numeric value on how much a pre-existing schedule would be changed in order to reschedule an activity. Using these functions, two algorithms (a stochastic neural network approach and an exhaustive search approach) are proposed to find the best place to reschedule an activity. Prototypes were implemented and preliminary testing reveals that the exhaustive technique produces only marginally better results at much greater computational cost.

A new scheduling algorithm to provide proportional QoS in optical burst switching networks

NASA Astrophysics Data System (ADS)

Tan, Wei; Luo, Yunhan; Wang, Sheng; Xu, Du; Pan, Yonghong; Li, Lemin

2005-02-01

A new scheduling algorithm, which aims to provide proportional and controllable QoS in terms of burst loss probability for OBS (optical burst switching) networks, is proposed on the basis of a summary of current QoS schemes in OBS. With simulations, performance analyses and comparisons are studied in detail. The results show that, in the proposed scheme, burst loss probabilities are proportional to the given factors and the control of QoS performance can be achieved with better performance. This scheme will be beneficial to the OBS network management and the tariff policy making.

Microgravity

NASA Image and Video Library

1998-09-30

The Electrostatic Levitator (ESL) Facility established at Marshall Space Flight Center (MSFC) supports NASA's Microgravity Materials Science Research Program. NASA materials science investigations include ground-based, flight definition and flight projects. Flight definition projects, with demanding science concept review schedules, receive highest priority for scheduling experiment time in the Electrostatic Levitator (ESL) Facility.

14 CFR 1215.109 - Scheduling user service.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 5 2011-01-01 2010-01-01 true Scheduling user service. 1215.109 Section 1215.109 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION TRACKING AND DATA RELAY... highest priority: (i) Launch, reentry, landing of the STS Shuttle, or other NASA launches. (ii) NASA...

14 CFR 1215.109 - Scheduling user service.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 14 Aeronautics and Space 5 2012-01-01 2012-01-01 false Scheduling user service. 1215.109 Section 1215.109 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION TRACKING AND DATA RELAY... highest priority: (i) Launch, reentry, landing of the STS Shuttle, or other NASA launches. (ii) NASA...

14 CFR 1215.109 - Scheduling user service.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Scheduling user service. 1215.109 Section 1215.109 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION TRACKING AND DATA RELAY... highest priority: (i) Launch, reentry, landing of the STS Shuttle, or other NASA launches. (ii) NASA...

IDMA-Based MAC Protocol for Satellite Networks with Consideration on Channel Quality

PubMed Central

2014-01-01

In order to overcome the shortcomings of existing medium access control (MAC) protocols based on TDMA or CDMA in satellite networks, interleave division multiple access (IDMA) technique is introduced into satellite communication networks. Therefore, a novel wide-band IDMA MAC protocol based on channel quality is proposed in this paper, consisting of a dynamic power allocation algorithm, a rate adaptation algorithm, and a call admission control (CAC) scheme. Firstly, the power allocation algorithm combining the technique of IDMA SINR-evolution and channel quality prediction is developed to guarantee high power efficiency even in terrible channel conditions. Secondly, the effective rate adaptation algorithm, based on accurate channel information per timeslot and by the means of rate degradation, can be realized. What is more, based on channel quality prediction, the CAC scheme, combining the new power allocation algorithm, rate scheduling, and buffering strategies together, is proposed for the emerging IDMA systems, which can support a variety of traffic types, and offering quality of service (QoS) requirements corresponding to different priority levels. Simulation results show that the new wide-band IDMA MAC protocol can make accurate estimation of available resource considering the effect of multiuser detection (MUD) and QoS requirements of multimedia traffic, leading to low outage probability as well as high overall system throughput. PMID:25126592

Performance Analysis of Physical Layer Security of Opportunistic Scheduling in Multiuser Multirelay Cooperative Networks

PubMed Central

Shim, Kyusung; Do, Nhu Tri; An, Beongku

2017-01-01

In this paper, we study the physical layer security (PLS) of opportunistic scheduling for uplink scenarios of multiuser multirelay cooperative networks. To this end, we propose a low-complexity, yet comparable secrecy performance source relay selection scheme, called the proposed source relay selection (PSRS) scheme. Specifically, the PSRS scheme first selects the least vulnerable source and then selects the relay that maximizes the system secrecy capacity for the given selected source. Additionally, the maximal ratio combining (MRC) technique and the selection combining (SC) technique are considered at the eavesdropper, respectively. Investigating the system performance in terms of secrecy outage probability (SOP), closed-form expressions of the SOP are derived. The developed analysis is corroborated through Monte Carlo simulation. Numerical results show that the PSRS scheme significantly improves the secure ability of the system compared to that of the random source relay selection scheme, but does not outperform the optimal joint source relay selection (OJSRS) scheme. However, the PSRS scheme drastically reduces the required amount of channel state information (CSI) estimations compared to that required by the OJSRS scheme, specially in dense cooperative networks. PMID:28212286

Performance analyses and improvements for the IEEE 802.15.4 CSMA/CA scheme with heterogeneous buffered conditions.

PubMed

Zhu, Jianping; Tao, Zhengsu; Lv, Chunfeng

2012-01-01

Studies of the IEEE 802.15.4 Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme have been received considerable attention recently, with most of these studies focusing on homogeneous or saturated traffic. Two novel transmission schemes-OSTS/BSTS (One Service a Time Scheme/Bulk Service a Time Scheme)-are proposed in this paper to improve the behaviors of time-critical buffered networks with heterogeneous unsaturated traffic. First, we propose a model which contains two modified semi-Markov chains and a macro-Markov chain combined with the theory of M/G/1/K queues to evaluate the characteristics of these two improved CSMA/CA schemes, in which traffic arrivals and accessing packets are bestowed with non-preemptive priority over each other, instead of prioritization. Then, throughput, packet delay and energy consumption of unsaturated, unacknowledged IEEE 802.15.4 beacon-enabled networks are predicted based on the overall point of view which takes the dependent interactions of different types of nodes into account. Moreover, performance comparisons of these two schemes with other non-priority schemes are also proposed. Analysis and simulation results show that delay and fairness of our schemes are superior to those of other schemes, while throughput and energy efficiency are superior to others in more heterogeneous situations. Comprehensive simulations demonstrate that the analysis results of these models match well with the simulation results.

Energy-saving framework for passive optical networks with ONU sleep/doze mode.

PubMed

Van, Dung Pham; Valcarenghi, Luca; Dias, Maluge Pubuduni Imali; Kondepu, Koteswararao; Castoldi, Piero; Wong, Elaine

2015-02-09

This paper proposes an energy-saving passive optical network framework (ESPON) that aims to incorporate optical network unit (ONU) sleep/doze mode into dynamic bandwidth allocation (DBA) algorithms to reduce ONU energy consumption. In the ESPON, the optical line terminal (OLT) schedules both downstream (DS) and upstream (US) transmissions in the same slot in an online and dynamic fashion whereas the ONU enters sleep mode outside the slot. The ONU sleep time is maximized based on both DS and US traffic. Moreover, during the slot, the ONU might enter doze mode when only its transmitter is idle to further improve energy efficiency. The scheduling order of data transmission, control message exchange, sleep period, and doze period defines an energy-efficient scheme under the ESPON. Three schemes are designed and evaluated in an extensive FPGA-based evaluation. Results show that whilst all the schemes significantly save ONU energy for different evaluation scenarios, the scheduling order has great impact on their performance. In addition, the ESPON allows for a scheduling order that saves ONU energy independently of the network reach.

Multi-Satellite Observation Scheduling for Large Area Disaster Emergency Response

NASA Astrophysics Data System (ADS)

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

2018-04-01

an optimal imaging plan, plays a key role in coordinating multiple satellites to monitor the disaster area. In the paper, to generate imaging plan dynamically according to the disaster relief, we propose a dynamic satellite task scheduling method for large area disaster response. First, an initial robust scheduling scheme is generated by a robust satellite scheduling model in which both the profit and the robustness of the schedule are simultaneously maximized. Then, we use a multi-objective optimization model to obtain a series of decomposing schemes. Based on the initial imaging plan, we propose a mixed optimizing algorithm named HA_NSGA-II to allocate the decomposing results thus to obtain an adjusted imaging schedule. A real disaster scenario, i.e., 2008 Wenchuan earthquake, is revisited in terms of rapid response using satellite resources and used to evaluate the performance of the proposed method with state-of-the-art approaches. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

Surgical demand scheduling: a review.

PubMed Central

Magerlein, J M; Martin, J B

1978-01-01

This article reviews the literature on scheduling of patient demand for surgery and outlines an approach to improving overall performance of hospital surgical suites. Reported scheduling systems are categorized into those that schedule patients in advance of the surgical date and those that schedule available patients on the day of surgery. Approaches to estimating surgical procedure times are also reviewed, and the article concludes with a discussion of the failure to implement the majority of reported scheduling schemes. PMID:367987

75 FR 9879 - Office of Innovation and Improvement; Overview Information Magnet Schools Assistance Program...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-04

... narrative is where you, the applicant, address the selection criteria and two of the competitive preference priorities that reviewers use to evaluate your application. The two competitive preference priorities that... person listed in this notice at least two weeks before the scheduled meeting date. Although we will...

Performance Analyses and Improvements for the IEEE 802.15.4 CSMA/CA Scheme with Heterogeneous Buffered Conditions

PubMed Central

Zhu, Jianping; Tao, Zhengsu; Lv, Chunfeng

2012-01-01

Studies of the IEEE 802.15.4 Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme have been received considerable attention recently, with most of these studies focusing on homogeneous or saturated traffic. Two novel transmission schemes—OSTS/BSTS (One Service a Time Scheme/Bulk Service a Time Scheme)—are proposed in this paper to improve the behaviors of time-critical buffered networks with heterogeneous unsaturated traffic. First, we propose a model which contains two modified semi-Markov chains and a macro-Markov chain combined with the theory of M/G/1/K queues to evaluate the characteristics of these two improved CSMA/CA schemes, in which traffic arrivals and accessing packets are bestowed with non-preemptive priority over each other, instead of prioritization. Then, throughput, packet delay and energy consumption of unsaturated, unacknowledged IEEE 802.15.4 beacon-enabled networks are predicted based on the overall point of view which takes the dependent interactions of different types of nodes into account. Moreover, performance comparisons of these two schemes with other non-priority schemes are also proposed. Analysis and simulation results show that delay and fairness of our schemes are superior to those of other schemes, while throughput and energy efficiency are superior to others in more heterogeneous situations. Comprehensive simulations demonstrate that the analysis results of these models match well with the simulation results. PMID:22666076

System and Method for Network Bandwidth, Buffers and Timing Management Using Hybrid Scheduling of Traffic with Different Priorities and Guarantees

NASA Technical Reports Server (NTRS)

Bonk, Ted (Inventor); Hall, Brendan (Inventor); Smithgall, William Todd (Inventor); Varadarajan, Srivatsan (Inventor); DeLay, Benjamin F. (Inventor)

2017-01-01

Systems and methods for network bandwidth, buffers and timing management using hybrid scheduling of traffic with different priorities and guarantees are provided. In certain embodiments, a method of managing network scheduling and configuration comprises, for each transmitting end station, reserving one exclusive buffer for each virtual link to be transmitted from the transmitting end station; for each receiving end station, reserving exclusive buffers for each virtual link to be received at the receiving end station; and for each switch, reserving a exclusive buffer for each virtual link to be received at an input port of the switch. The method further comprises determining if each respective transmitting end station, receiving end station, and switch has sufficient capability to support the reserved buffers; and reporting buffer infeasibility if each respective transmitting end station, receiving end station, and switch does not have sufficient capability to support the reserved buffers.

Resource-constrained scheduling with hard due windows and rejection penalties

NASA Astrophysics Data System (ADS)

Garcia, Christopher

2016-09-01

This work studies a scheduling problem where each job must be either accepted and scheduled to complete within its specified due window, or rejected altogether. Each job has a certain processing time and contributes a certain profit if accepted or penalty cost if rejected. There is a set of renewable resources, and no resource limit can be exceeded at any time. Each job requires a certain amount of each resource when processed, and the objective is to maximize total profit. A mixed-integer programming formulation and three approximation algorithms are presented: a priority rule heuristic, an algorithm based on the metaheuristic for randomized priority search and an evolutionary algorithm. Computational experiments comparing these four solution methods were performed on a set of generated benchmark problems covering a wide range of problem characteristics. The evolutionary algorithm outperformed the other methods in most cases, often significantly, and never significantly underperformed any method.

PSO-tuned PID controller for coupled tank system via priority-based fitness scheme

NASA Astrophysics Data System (ADS)

Jaafar, Hazriq Izzuan; Hussien, Sharifah Yuslinda Syed; Selamat, Nur Asmiza; Abidin, Amar Faiz Zainal; Aras, Mohd Shahrieel Mohd; Nasir, Mohamad Na'im Mohd; Bohari, Zul Hasrizal

2015-05-01

The industrial applications of Coupled Tank System (CTS) are widely used especially in chemical process industries. The overall process is require liquids to be pumped, stored in the tank and pumped again to another tank. Nevertheless, the level of liquid in tank need to be controlled and flow between two tanks must be regulated. This paper presents development of an optimal PID controller for controlling the desired liquid level of the CTS. Two method of Particle Swarm Optimization (PSO) algorithm will be tested in optimizing the PID controller parameters. These two methods of PSO are standard Particle Swarm Optimization (PSO) and Priority-based Fitness Scheme in Particle Swarm Optimization (PFPSO). Simulation is conducted within Matlab environment to verify the performance of the system in terms of settling time (Ts), steady state error (SSE) and overshoot (OS). It has been demonstrated that implementation of PSO via Priority-based Fitness Scheme (PFPSO) for this system is potential technique to control the desired liquid level and improve the system performances compared with standard PSO.

A Generic and Target Architecture For Command and Control Information Systems

DTIC Science & Technology

1991-09-01

forces, logistics, and optimum routing of forces to destination; supports development of the force, material and personnel 9 lists, schedules , and...recommendations T.5, T.6, and T.73 for Telefax. Teletex, Textfax, and Telefax are not currently scheduled to become a part of GOSIP. In the 1995-1997 time...defining application interfaces to the func- tional areas that impact resource management, for example, priority scheduling , real-time files, and

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

NASA Astrophysics Data System (ADS)

Schumacher, André; Haanpää, Harri

We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximation algorithm by applying linear programming approximation techniques. Our algorithm is an application of the Garg-Könemann (GK) scheme that requires solving an instance of the minimum weight dominating set (MWDS) problem as a subroutine. Our two main contributions are a distributed implementation of the GK scheme for the sleep-scheduling problem and a novel asynchronous distributed algorithm for approximating MWDS based on a primal-dual analysis of Chvátal's set-cover algorithm. We evaluate our algorithm with ns2 simulations.

Scheduling elective surgeries: the tradeoff among bed capacity, waiting patients and operating room utilization using goal programming.

PubMed

Li, Xiangyong; Rafaliya, N; Baki, M Fazle; Chaouch, Ben A

2017-03-01

Scheduling of surgeries in the operating rooms under limited competing resources such as surgical and nursing staff, anesthesiologist, medical equipment, and recovery beds in surgical wards is a complicated process. A well-designed schedule should be concerned with the welfare of the entire system by allocating the available resources in an efficient and effective manner. In this paper, we develop an integer linear programming model in a manner useful for multiple goals for optimally scheduling elective surgeries based on the availability of surgeons and operating rooms over a time horizon. In particular, the model is concerned with the minimization of the following important goals: (1) the anticipated number of patients waiting for service; (2) the underutilization of operating room time; (3) the maximum expected number of patients in the recovery unit; and (4) the expected range (the difference between maximum and minimum expected number) of patients in the recovery unit. We develop two goal programming (GP) models: lexicographic GP model and weighted GP model. The lexicographic GP model schedules operating rooms when various preemptive priority levels are given to these four goals. A numerical study is conducted to illustrate the optimal master-surgery schedule obtained from the models. The numerical results demonstrate that when the available number of surgeons and operating rooms is known without error over the planning horizon, the proposed models can produce good schedules and priority levels and preference weights of four goals affect the resulting schedules. The results quantify the tradeoffs that must take place as the preemptive-weights of the four goals are changed.

Energy Efficient Cluster Based Scheduling Scheme for Wireless Sensor Networks

PubMed Central

Srie Vidhya Janani, E.; Ganesh Kumar, P.

2015-01-01

The energy utilization of sensor nodes in large scale wireless sensor network points out the crucial need for scalable and energy efficient clustering protocols. Since sensor nodes usually operate on batteries, the maximum utility of network is greatly dependent on ideal usage of energy leftover in these sensor nodes. In this paper, we propose an Energy Efficient Cluster Based Scheduling Scheme for wireless sensor networks that balances the sensor network lifetime and energy efficiency. In the first phase of our proposed scheme, cluster topology is discovered and cluster head is chosen based on remaining energy level. The cluster head monitors the network energy threshold value to identify the energy drain rate of all its cluster members. In the second phase, scheduling algorithm is presented to allocate time slots to cluster member data packets. Here congestion occurrence is totally avoided. In the third phase, energy consumption model is proposed to maintain maximum residual energy level across the network. Moreover, we also propose a new packet format which is given to all cluster member nodes. The simulation results prove that the proposed scheme greatly contributes to maximum network lifetime, high energy, reduced overhead, and maximum delivery ratio. PMID:26495417

Optimum Adaptive Modulation and Channel Coding Scheme for Frequency Domain Channel-Dependent Scheduling in OFDM Based Evolved UTRA Downlink

NASA Astrophysics Data System (ADS)

Miki, Nobuhiko; Kishiyama, Yoshihisa; Higuchi, Kenichi; Sawahashi, Mamoru; Nakagawa, Masao

In the Evolved UTRA (UMTS Terrestrial Radio Access) downlink, Orthogonal Frequency Division Multiplexing (OFDM) based radio access was adopted because of its inherent immunity to multipath interference and flexible accommodation of different spectrum arrangements. This paper presents the optimum adaptive modulation and channel coding (AMC) scheme when resource blocks (RBs) is simultaneously assigned to the same user when frequency and time domain channel-dependent scheduling is assumed in the downlink OFDMA radio access with single-antenna transmission. We start by presenting selection methods for the modulation and coding scheme (MCS) employing mutual information both for RB-common and RB-dependent modulation schemes. Simulation results show that, irrespective of the application of power adaptation to RB-dependent modulation, the improvement in the achievable throughput of the RB-dependent modulation scheme compared to that for the RB-common modulation scheme is slight, i.e., 4 to 5%. In addition, the number of required control signaling bits in the RB-dependent modulation scheme becomes greater than that for the RB-common modulation scheme. Therefore, we conclude that the RB-common modulation and channel coding rate scheme is preferred, when multiple RBs of the same coded stream are assigned to one user in the case of single-antenna transmission.

Wireless Sensor Network Metrics for Real-Time Systems

DTIC Science & Technology

2009-05-20

to compute the probability of end-to-end packet delivery as a function of latency, the expected radio energy consumption on the nodes from relaying... schedules for WSNs. Particularly, we focus on the impact scheduling has on path diversity, using short repeating schedules and Greedy Maximal Matching...a greedy algorithm for constructing a mesh routing topology. Finally, we study the implications of using distributed scheduling schemes to generate

A Multi-Objective Compounded Local Mobile Cloud Architecture Using Priority Queues to Process Multiple Jobs.

PubMed

Wei, Xiaohui; Sun, Bingyi; Cui, Jiaxu; Xu, Gaochao

2016-01-01

As a result of the greatly increased use of mobile devices, the disadvantages of portable devices have gradually begun to emerge. To solve these problems, the use of mobile cloud computing assisted by cloud data centers has been proposed. However, cloud data centers are always very far from the mobile requesters. In this paper, we propose an improved multi-objective local mobile cloud model: Compounded Local Mobile Cloud Architecture with Dynamic Priority Queues (LMCpri). This new architecture could briefly store jobs that arrive simultaneously at the cloudlet in different priority positions according to the result of auction processing, and then execute partitioning tasks on capable helpers. In the Scheduling Module, NSGA-II is employed as the scheduling algorithm to shorten processing time and decrease requester cost relative to PSO and sequential scheduling. The simulation results show that the number of iteration times that is defined to 30 is the best choice of the system. In addition, comparing with LMCque, LMCpri is able to effectively accommodate a requester who would like his job to be executed in advance and shorten execution time. Finally, we make a comparing experiment between LMCpri and cloud assisting architecture, and the results reveal that LMCpri presents a better performance advantage than cloud assisting architecture.

A Multi-Objective Compounded Local Mobile Cloud Architecture Using Priority Queues to Process Multiple Jobs

PubMed Central

Wei, Xiaohui; Sun, Bingyi; Cui, Jiaxu; Xu, Gaochao

2016-01-01

As a result of the greatly increased use of mobile devices, the disadvantages of portable devices have gradually begun to emerge. To solve these problems, the use of mobile cloud computing assisted by cloud data centers has been proposed. However, cloud data centers are always very far from the mobile requesters. In this paper, we propose an improved multi-objective local mobile cloud model: Compounded Local Mobile Cloud Architecture with Dynamic Priority Queues (LMCpri). This new architecture could briefly store jobs that arrive simultaneously at the cloudlet in different priority positions according to the result of auction processing, and then execute partitioning tasks on capable helpers. In the Scheduling Module, NSGA-II is employed as the scheduling algorithm to shorten processing time and decrease requester cost relative to PSO and sequential scheduling. The simulation results show that the number of iteration times that is defined to 30 is the best choice of the system. In addition, comparing with LMCque, LMCpri is able to effectively accommodate a requester who would like his job to be executed in advance and shorten execution time. Finally, we make a comparing experiment between LMCpri and cloud assisting architecture, and the results reveal that LMCpri presents a better performance advantage than cloud assisting architecture. PMID:27419854

Scheduling revisited workstations in integrated-circuit fabrication

NASA Technical Reports Server (NTRS)

Kline, Paul J.

1992-01-01

The cost of building new semiconductor wafer fabrication factories has grown rapidly, and a state-of-the-art fab may cost 250 million dollars or more. Obtaining an acceptable return on this investment requires high productivity from the fabrication facilities. This paper describes the Photo Dispatcher system which was developed to make machine-loading recommendations on a set of key fab machines. Dispatching policies that generally perform well in job shops (e.g., Shortest Remaining Processing Time) perform poorly for workstations such as photolithography which are visited several times by the same lot of silicon wafers. The Photo Dispatcher evaluates the history of workloads throughout the fab and identifies bottleneck areas. The scheduler then assigns priorities to lots depending on where they are headed after photolithography. These priorities are designed to avoid starving bottleneck workstations and to give preference to lots that are headed to areas where they can be processed with minimal waiting. Other factors considered by the scheduler to establish priorities are the nearness of a lot to the end of its process flow and the time that the lot has already been waiting in queue. Simulations that model the equipment and products in one of Texas Instrument's wafer fabs show the Photo Dispatcher can produce a 10 percent improvement in the time required to fabricate integrated circuits.

Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs

PubMed Central

Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung

2017-01-01

Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes. PMID:28471416

Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs.

PubMed

Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung

2017-05-04

Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes.

Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

2013-03-01

With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

Integrating economic costs and biological traits into global conservation priorities for carnivores.

PubMed

Loyola, Rafael Dias; Oliveira-Santos, Luiz Gustavo Rodrigues; Almeida-Neto, Mário; Nogueira, Denise Martins; Kubota, Umberto; Diniz-Filho, José Alexandre Felizola; Lewinsohn, Thomas Michael

2009-08-27

Prioritization schemes usually highlight species-rich areas, where many species are at imminent risk of extinction. To be ecologically relevant these schemes should also include species biological traits into area-setting methods. Furthermore, in a world of limited funds for conservation, conservation action is constrained by land acquisition costs. Hence, including economic costs into conservation priorities can substantially improve their conservation cost-effectiveness. We examined four global conservation scenarios for carnivores based on the joint mapping of economic costs and species biological traits. These scenarios identify the most cost-effective priority sets of ecoregions, indicating best investment opportunities for safeguarding every carnivore species, and also establish priority sets that can maximize species representation in areas harboring highly vulnerable species. We compared these results with a scenario that minimizes the total number of ecoregions required for conserving all species, irrespective of other factors. We found that cost-effective conservation investments should focus on 41 ecoregions highlighted in the scenario that consider simultaneously both ecoregion vulnerability and economic costs of land acquisition. Ecoregions included in priority sets under these criteria should yield best returns of investments since they harbor species with high extinction risk and have lower mean land cost. Our study highlights ecoregions of particular importance for the conservation of the world's carnivores defining global conservation priorities in analyses that encompass socioeconomic and life-history factors. We consider the identification of a comprehensive priority-set of areas as a first step towards an in-situ biodiversity maintenance strategy.

Job Priorities on Peregrine | High-Performance Computing | NREL

Science.gov Websites

allocation when run with qos=high. Requesting a Node Reservation If you are doing work that requires real scheduler more efficiently plan resources for larger jobs. When projects reach their allocation limit, jobs associated with those projects will run at very low priority, which will ensure that these jobs run only when

Packet Scheduling Mechanism to Improve Quality of Short Flows and Low-Rate Flows

NASA Astrophysics Data System (ADS)

Yokota, Kenji; Asaka, Takuya; Takahashi, Tatsuro

In recent years elephant flows are increasing by expansion of peer-to-peer (P2P) applications on the Internet. As a result, bandwidth is occupied by specific users triggering unfair resource allocation. The main packet-scheduling mechanism currently employed is first-in first-out (FIFO) where the available bandwidth of short flows is limited by elephant flows. Least attained service (LAS), which decides transfer priority of packets by the total amount of transferred data in all flows, was proposed to solve this problem. However, routers with LAS limit flows with large amount of transferred data even if they are low-rate. Therefore, it is necessary to improve the quality of low-rate flows with long holding times such as voice over Internet protocol (VoIP) applications. This paper proposes rate-based priority control (RBPC), which calculates the flow rate and control the priority by using it. Our proposed method can transfer short flows and low-rate flows in advance. Moreover, its fair performance is shown through simulations.

TinyOS-based quality of service management in wireless sensor networks

USGS Publications Warehouse

Peterson, N.; Anusuya-Rangappa, L.; Shirazi, B.A.; Huang, R.; Song, W.-Z.; Miceli, M.; McBride, D.; Hurson, A.; LaHusen, R.

2009-01-01

Previously the cost and extremely limited capabilities of sensors prohibited Quality of Service (QoS) implementations in wireless sensor networks. With advances in technology, sensors are becoming significantly less expensive and the increases in computational and storage capabilities are opening the door for new, sophisticated algorithms to be implemented. Newer sensor network applications require higher data rates with more stringent priority requirements. We introduce a dynamic scheduling algorithm to improve bandwidth for high priority data in sensor networks, called Tiny-DWFQ. Our Tiny-Dynamic Weighted Fair Queuing scheduling algorithm allows for dynamic QoS for prioritized communications by continually adjusting the treatment of communication packages according to their priorities and the current level of network congestion. For performance evaluation, we tested Tiny-DWFQ, Tiny-WFQ (traditional WFQ algorithm implemented in TinyOS), and FIFO queues on an Imote2-based wireless sensor network and report their throughput and packet loss. Our results show that Tiny-DWFQ performs better in all test cases. ?? 2009 IEEE.

Multiplexing technique for computer communications via satellite channels

NASA Technical Reports Server (NTRS)

Binder, R.

1975-01-01

Multiplexing scheme combines technique of dynamic allocation with conventional time-division multiplexing. Scheme is designed to expedite short-duration interactive or priority traffic and to delay large data transfers; as result, each node has effective capacity of almost total channel capacity when other nodes have light traffic loads.

Re-scheduling as a tool for the power management on board a spacecraft

NASA Technical Reports Server (NTRS)

Albasheer, Omar; Momoh, James A.

1995-01-01

The scheduling of events on board a spacecraft is based on forecast energy levels. The real time values of energy may not coincide with the forecast values; consequently, a dynamic revising to the allocation of power is needed. The re-scheduling is also needed for other reasons on board a spacecraft like the addition of new event which must be scheduled, or a failure of an event due to many different contingencies. This need of rescheduling is very important to the survivability of the spacecraft. In this presentation, a re-scheduling tool will be presented as a part of an overall scheme for the power management on board a spacecraft from the allocation of energy point of view. The overall scheme is based on the optimal use of energy available on board a spacecraft using expert systems combined with linear optimization techniques. The system will be able to schedule maximum number of events utilizing most energy available. The outcome is more events scheduled to share the operation cost of that spacecraft. The system will also be able to re-schedule in case of a contingency with minimal time and minimal disturbance of the original schedule. The end product is a fully integrated planning system capable of producing the right decisions in short time with less human error. The overall system will be presented with the re-scheduling algorithm discussed in detail, then the tests and results will be presented for validations.

Multimode resource-constrained multiple project scheduling problem under fuzzy random environment and its application to a large scale hydropower construction project.

PubMed

Xu, Jiuping; Feng, Cuiying

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method.

Multimode Resource-Constrained Multiple Project Scheduling Problem under Fuzzy Random Environment and Its Application to a Large Scale Hydropower Construction Project

PubMed Central

Xu, Jiuping

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method. PMID:24550708

Data-oriented scheduling for PROOF

NASA Astrophysics Data System (ADS)

Xu, Neng; Guan, Wen; Wu, Sau Lan; Ganis, Gerardo

2011-12-01

The Parallel ROOT Facility - PROOF - is a distributed analysis system optimized for I/O intensive analysis tasks of HEP data. With LHC entering the analysis phase, PROOF has become a natural ingredient for computing farms at Tier3 level. These analysis facilities will typically be used by a few tenths of users, and can also be federated into a sort of analysis cloud corresponding to the Virtual Organization of the experiment. Proper scheduling is required to guarantee fair resource usage, to enforce priority policies and to optimize the throughput. In this paper we discuss an advanced priority system that we are developing for PROOF. The system has been designed to automatically adapt to unknown length of the tasks, to take into account the data location and availability (including distribution across geographically separated sites), and the {group, user} default priorities. In this system, every element - user, group, dataset, job slot and storage - gets its priority and those priorities are dynamically linked with each other. In order to tune the interplay between the various components, we have designed and started implementing a simulation application that can model various type and size of PROOF clusters. In this application a monitoring package records all the changes of them so that we can easily understand and tune the performance. We will discuss the status of our simulation and show examples of the results we are expecting from it.

Bandwidth reduction for video-on-demand broadcasting using secondary content insertion

NASA Astrophysics Data System (ADS)

Golynski, Alexander; Lopez-Ortiz, Alejandro; Poirier, Guillaume; Quimper, Claude-Guy

2005-01-01

An optimal broadcasting scheme under the presence of secondary content (i.e. advertisements) is proposed. The proposed scheme works both for movies encoded in a Constant Bit Rate (CBR) or a Variable Bit Rate (VBR) format. It is shown experimentally that secondary content in movies can make Video-on-Demand (VoD) broadcasting systems more efficient. An efficient algorithm is given to compute the optimal broadcasting schedule with secondary content, which in particular significantly improves over the best previously known algorithm for computing the optimal broadcasting schedule without secondary content.

HPV vaccine catch up schedule - an opportunity for chlamydia screening.

PubMed

Grotowski, Miriam; May, Jenny

2008-07-01

The human papillomavirus (HPV) vaccine (Gardasil) catch up schedule in general practice is available until June 2009 to females not in school and under the age of 27 years. A course of three injections is given over 6 months. This provides a unique opportunity for sexual health screening in an age group where chlamydia screening is a priority.

Spatial analysis of fuel treatment options for chaparral on the Angeles national forest

Treesearch

G. Jones; J. Chew; R. Silverstein; C. Stalling; J. Sullivan; J. Troutwine; D. Weise; D. Garwood

2008-01-01

Spatial fuel treatment schedules were developed for the chaparral vegetation type on the Angeles National Forest using the Multi-resource Analysis and Geographic Information System (MAGIS). Schedules varied by the priority given to various wildland urban interface areas and the general forest, as well as by the number of acres treated per decade. The effectiveness of...

How Should School Districts Shape Teacher Salary Schedules? Linking School Performance to Pay Structure in Traditional Compensation Schemes

ERIC Educational Resources Information Center

Grissom, Jason A.; Strunk, Katharine O.

2012-01-01

This study examines the relative distribution of salary schedule returns to experience for beginning and veteran teachers. We argue that districts are likely to benefit from structuring salary schedules with greater experience returns early in the teaching career. To test this hypothesis, we match salary data to school-level student performance…

78 FR 41132 - Sunshine Act Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-09

... amendments to eliminate the prohibition against general solicitation and general advertising in certain... times, changes in Commission priorities require alterations in the scheduling of meeting items. For...

Priority and Negotiation Based Dynamic Spectrum Allocation Scheme for Multiple Radio Access Network Operators

NASA Astrophysics Data System (ADS)

Kim, Hoon; Hyon, Taein; Lee, Yeonwoo

Most of previous works have presented the dynamic spectrum allocation (DSA) gain achieved by utilizing the time or regional variations in traffic demand between multi-network operators (NOs). In this paper, we introduce the functionalities required for the entities related with the spectrum sharing and allocation and propose a spectrum allocation algorithm while considering the long-term priority between NOs, the priority between multiple class services, and the urgent bandwidth request. To take into account the priorities among the NOs and the priorities of multiple class services, a spectrum sharing metric (SSM) is proposed, while a negotiation procedure is proposed to treat the urgent bandwidth request.

Neotropical migratory landbird species and their habitats of special concern within the Southeast Region

Treesearch

William C. Hunter; David N. Pashley; Ronald E. F. Escano

1993-01-01

The Southeast Management Working Group for Partners in Flight initiated a prioritization scheme in April 1991 to help guide regional and local conservation efforts for Neotropical migratory landbirds. Preliminary breeding season priorities have been established in each of 24 physiographic areas for species and habitats, with some non-breeding season priorities set as...

Configuration-Control Scheme Copes With Singularities

NASA Technical Reports Server (NTRS)

Seraji, Homayoun; Colbaugh, Richard D.

1993-01-01

Improved configuration-control scheme for robotic manipulator having redundant degrees of freedom suppresses large joint velocities near singularities, at expense of small trajectory errors. Provides means to enforce order of priority of tasks assigned to robot. Basic concept of configuration control of redundant robot described in "Increasing The Dexterity Of Redundant Robots" (NPO-17801).

The Partners in Flight species prioritization scheme

Treesearch

William C. Hunter; Michael F. Carter; David N. Pashley; Keith Barker

1993-01-01

The prioritization scheme identifies those birds at any locality on several geographic scales most in need of conservation action. Further, it suggests some of those actions that ought to be taken. Ranking criteria used to set priorities for Neotropical migratory landbirds measure characteristics of species that make them vulnerable to local and global extinction....

Optimization of multi-objective integrated process planning and scheduling problem using a priority based optimization algorithm

NASA Astrophysics Data System (ADS)

Ausaf, Muhammad Farhan; Gao, Liang; Li, Xinyu

2015-12-01

For increasing the overall performance of modern manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling (IPPS) problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS (MOIPPS) problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatching rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.

Integrating Economic Costs and Biological Traits into Global Conservation Priorities for Carnivores

PubMed Central

Loyola, Rafael Dias; Oliveira-Santos, Luiz Gustavo Rodrigues; Almeida-Neto, Mário; Nogueira, Denise Martins; Kubota, Umberto; Diniz-Filho, José Alexandre Felizola; Lewinsohn, Thomas Michael

2009-01-01

Background Prioritization schemes usually highlight species-rich areas, where many species are at imminent risk of extinction. To be ecologically relevant these schemes should also include species biological traits into area-setting methods. Furthermore, in a world of limited funds for conservation, conservation action is constrained by land acquisition costs. Hence, including economic costs into conservation priorities can substantially improve their conservation cost-effectiveness. Methodology/Principal Findings We examined four global conservation scenarios for carnivores based on the joint mapping of economic costs and species biological traits. These scenarios identify the most cost-effective priority sets of ecoregions, indicating best investment opportunities for safeguarding every carnivore species, and also establish priority sets that can maximize species representation in areas harboring highly vulnerable species. We compared these results with a scenario that minimizes the total number of ecoregions required for conserving all species, irrespective of other factors. We found that cost-effective conservation investments should focus on 41 ecoregions highlighted in the scenario that consider simultaneously both ecoregion vulnerability and economic costs of land acquisition. Ecoregions included in priority sets under these criteria should yield best returns of investments since they harbor species with high extinction risk and have lower mean land cost. Conclusions/Significance Our study highlights ecoregions of particular importance for the conservation of the world's carnivores defining global conservation priorities in analyses that encompass socioeconomic and life-history factors. We consider the identification of a comprehensive priority-set of areas as a first step towards an in-situ biodiversity maintenance strategy. PMID:19710911

47 CFR 76.95 - Exceptions.

Code of Federal Regulations, 2012 CFR

2012-10-01

... CABLE TELEVISION SERVICE Network Non-duplication Protection, Syndicated Exclusivity and Sports Blackout... priority station for one hour following the scheduled time of completion of the broadcast of a live sports...

47 CFR 76.95 - Exceptions.

Code of Federal Regulations, 2013 CFR

2013-10-01

... CABLE TELEVISION SERVICE Network Non-duplication Protection, Syndicated Exclusivity and Sports Blackout... priority station for one hour following the scheduled time of completion of the broadcast of a live sports...

47 CFR 76.95 - Exceptions.

Code of Federal Regulations, 2014 CFR

2014-10-01

... CABLE TELEVISION SERVICE Network Non-duplication Protection, Syndicated Exclusivity and Sports Blackout... priority station for one hour following the scheduled time of completion of the broadcast of a live sports...

47 CFR 76.95 - Exceptions.

Code of Federal Regulations, 2011 CFR

2011-10-01

... CABLE TELEVISION SERVICE Network Non-duplication Protection, Syndicated Exclusivity and Sports Blackout... priority station for one hour following the scheduled time of completion of the broadcast of a live sports...

47 CFR 76.95 - Exceptions.

Code of Federal Regulations, 2010 CFR

2010-10-01

... CABLE TELEVISION SERVICE Network Non-duplication Protection, Syndicated Exclusivity and Sports Blackout... priority station for one hour following the scheduled time of completion of the broadcast of a live sports...

76 FR 60500 - Advisory Committee on Immunization Practices (ACIP)

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-29

... schedule; human papillomavirus vaccine; hepatitis B vaccine; meningococcal vaccines; influenza; 13-valent... subject to change as priorities dictate. Contact Person for More Information: Stephanie B. Thomas...

Uplink Packet-Data Scheduling in DS-CDMA Systems

NASA Astrophysics Data System (ADS)

Choi, Young Woo; Kim, Seong-Lyun

In this letter, we consider the uplink packet scheduling for non-real-time data users in a DS-CDMA system. As an effort to jointly optimize throughput and fairness, we formulate a time-span minimization problem incorporating the time-multiplexing of different simultaneous transmission schemes. Based on simple rules, we propose efficient scheduling algorithms and compare them with the optimal solution obtained by linear programming.

Dynamic Sensor Networks

DTIC Science & Technology

2004-03-01

turned off. SLEEP Set the timer for 30 seconds before scheduled transmit time, then sleep the processor. WAKE When timer trips, power up the processor...slots where none of its neighbors are schedule to transmit. This allows the sensor nodes to perform a simple power man- agement scheme that puts the...routing This simple case study highlights the following crucial observation: optimal traffic scheduling in energy constrained networks requires future

CQPSO scheduling algorithm for heterogeneous multi-core DAG task model

NASA Astrophysics Data System (ADS)

Zhai, Wenzheng; Hu, Yue-Li; Ran, Feng

2017-07-01

Efficient task scheduling is critical to achieve high performance in a heterogeneous multi-core computing environment. The paper focuses on the heterogeneous multi-core directed acyclic graph (DAG) task model and proposes a novel task scheduling method based on an improved chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm. A task priority scheduling list was built. A processor with minimum cumulative earliest finish time (EFT) was acted as the object of the first task assignment. The task precedence relationships were satisfied and the total execution time of all tasks was minimized. The experimental results show that the proposed algorithm has the advantage of optimization abilities, simple and feasible, fast convergence, and can be applied to the task scheduling optimization for other heterogeneous and distributed environment.

Linux Kernel Co-Scheduling For Bulk Synchronous Parallel Applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, Terry R

2011-01-01

This paper describes a kernel scheduling algorithm that is based on co-scheduling principles and that is intended for parallel applications running on 1000 cores or more where inter-node scalability is key. Experimental results for a Linux implementation on a Cray XT5 machine are presented.1 The results indicate that Linux is a suitable operating system for this new scheduling scheme, and that this design provides a dramatic improvement in scaling performance for synchronizing collective operations at scale.

Efficient Trajectory Options Allocation for the Collaborative Trajectory Options Program

NASA Technical Reports Server (NTRS)

Rodionova, Olga; Arneson, Heather; Sridhar, Banavar; Evans, Antony

2017-01-01

The Collaborative Trajectory Options Program (CTOP) is a Traffic Management Initiative (TMI) intended to control the air traffic flow rates at multiple specified Flow Constrained Areas (FCAs), where demand exceeds capacity. CTOP allows flight operators to submit the desired Trajectory Options Set (TOS) for each affected flight with associated Relative Trajectory Cost (RTC) for each option. CTOP then creates a feasible schedule that complies with capacity constraints by assigning affected flights with routes and departure delays in such a way as to minimize the total cost while maintaining equity across flight operators. The current version of CTOP implements a Ration-by-Schedule (RBS) scheme, which assigns the best available options to flights based on a First-Scheduled-First-Served heuristic. In the present study, an alternative flight scheduling approach is developed based on linear optimization. Results suggest that such an approach can significantly reduce flight delays, in the deterministic case, while maintaining equity as defined using a Max-Min fairness scheme.

76 FR 42143 - Sunshine Act Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-18

..., 2011: Adjudicatory Matters. At times, changes in Commission priorities require alterations in the scheduling of meeting items. For further information and to ascertain what, if any, matters have been added...

Dawn Usage, Scheduling, and Governance Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Louis, S

2009-11-02

This document describes Dawn use, scheduling, and governance concerns. Users started running full-machine science runs in early April 2009 during the initial open shakedown period. Scheduling Dawn while in the Open Computing Facility (OCF) was controlled and coordinated via phone calls, emails, and a small number of controlled banks. With Dawn moving to the Secure Computing Facility (SCF) in fall of 2009, a more detailed scheduling and governance model is required. The three major objectives are: (1) Ensure Dawn resources are allocated on a program priority-driven basis; (2) Utilize Dawn resources on the job mixes for which they were intended;more » and (3) Minimize idle cycles through use of partitions, banks and proper job mix. The SCF workload for Dawn will be inherently different than Purple or BG/L, and therefore needs a different approach. Dawn's primary function is to permit adequate access for tri-lab code development in preparation for Sequoia, and in particular for weapons multi-physics codes in support of UQ. A second purpose is to provide time allocations for large-scale science runs and for UQ suite calculations to advance SSP program priorities. This proposed governance model will be the basis for initial time allocation of Dawn computing resources for the science and UQ workloads that merit priority on this class of resource, either because they cannot be reasonably attempted on any other resources due to size of problem, or because of the unavailability of sizable allocations on other ASC capability or capacity platforms. This proposed model intends to make the most effective use of Dawn as possible, but without being overly constrained by more formal proposal processes such as those now used for Purple CCCs.« less

Improved NSGA model for multi objective operation scheduling and its evaluation

NASA Astrophysics Data System (ADS)

Li, Weining; Wang, Fuyu

2017-09-01

Reasonable operation can increase the income of the hospital and improve the patient’s satisfactory level. In this paper, by using multi object operation scheduling method with improved NSGA algorithm, it shortens the operation time, reduces the operation costand lowers the operation risk, the multi-objective optimization model is established for flexible operation scheduling, through the MATLAB simulation method, the Pareto solution is obtained, the standardization of data processing. The optimal scheduling scheme is selected by using entropy weight -Topsis combination method. The results show that the algorithm is feasible to solve the multi-objective operation scheduling problem, and provide a reference for hospital operation scheduling.

Effects of partitioning and scheduling sparse matrix factorization on communication and load balance

NASA Technical Reports Server (NTRS)

Venugopal, Sesh; Naik, Vijay K.

1991-01-01

A block based, automatic partitioning and scheduling methodology is presented for sparse matrix factorization on distributed memory systems. Using experimental results, this technique is analyzed for communication and load imbalance overhead. To study the performance effects, these overheads were compared with those obtained from a straightforward 'wrap mapped' column assignment scheme. All experimental results were obtained using test sparse matrices from the Harwell-Boeing data set. The results show that there is a communication and load balance tradeoff. The block based method results in lower communication cost whereas the wrap mapped scheme gives better load balance.

Scheduling Results for the THEMIS Observation Scheduling Tool

NASA Technical Reports Server (NTRS)

Mclaren, David; Rabideau, Gregg; Chien, Steve; Knight, Russell; Anwar, Sadaat; Mehall, Greg; Christensen, Philip

2011-01-01

We describe a scheduling system intended to assist in the development of instrument data acquisitions for the THEMIS instrument, onboard the Mars Odyssey spacecraft, and compare results from multiple scheduling algorithms. This tool creates observations of both (a) targeted geographical regions of interest and (b) general mapping observations, while respecting spacecraft constraints such as data volume, observation timing, visibility, lighting, season, and science priorities. This tool therefore must address both geometric and state/timing/resource constraints. We describe a tool that maps geometric polygon overlap constraints to set covering constraints using a grid-based approach. These set covering constraints are then incorporated into a greedy optimization scheduling algorithm incorporating operations constraints to generate feasible schedules. The resultant tool generates schedules of hundreds of observations per week out of potential thousands of observations. This tool is currently under evaluation by the THEMIS observation planning team at Arizona State University.

Scheduling Real-Time Mixed-Criticality Jobs

NASA Astrophysics Data System (ADS)

Baruah, Sanjoy K.; Bonifaci, Vincenzo; D'Angelo, Gianlorenzo; Li, Haohan; Marchetti-Spaccamela, Alberto; Megow, Nicole; Stougie, Leen

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors are tight for these two techniques.

PS-CARA: Context-Aware Resource Allocation Scheme for Mobile Public Safety Networks.

PubMed

Kaleem, Zeeshan; Khaliq, Muhammad Zubair; Khan, Ajmal; Ahmad, Ishtiaq; Duong, Trung Q

2018-05-08

The fifth-generation (5G) communications systems are expecting to support users with diverse quality-of-service (QoS) requirements. Beside these requirements, the task with utmost importance is to support the emergency communication services during natural or man-made disasters. Most of the conventional base stations are not properly functional during a disaster situation, so deployment of emergency base stations such as mobile personal cell (mPC) is crucial. An mPC having moving capability can move in the disaster area to provide emergency communication services. However, mPC deployment causes severe co-channel interference to the users in its vicinity. The problem in the existing resource allocation schemes is its support for static environment, that does not fit well for mPC. So, a resource allocation scheme for mPC users is desired that can dynamically allocate resources based on users’ location and its connection establishment priority. In this paper, we propose a public safety users priority-based context-aware resource allocation (PS-CARA) scheme for users sum-rate maximization in disaster environment. Simulations results demonstrate that the proposed PS-CARA scheme can increase the user average and edge rate around 10.3% and 32.8% , respectively because of context information availability and by prioritizing the public safety users. The simulation results ensure that call blocking probability is also reduced considerably under the PS-CARA scheme.

PS-CARA: Context-Aware Resource Allocation Scheme for Mobile Public Safety Networks

PubMed Central

Khaliq, Muhammad Zubair; Khan, Ajmal; Ahmad, Ishtiaq

2018-01-01

The fifth-generation (5G) communications systems are expecting to support users with diverse quality-of-service (QoS) requirements. Beside these requirements, the task with utmost importance is to support the emergency communication services during natural or man-made disasters. Most of the conventional base stations are not properly functional during a disaster situation, so deployment of emergency base stations such as mobile personal cell (mPC) is crucial. An mPC having moving capability can move in the disaster area to provide emergency communication services. However, mPC deployment causes severe co-channel interference to the users in its vicinity. The problem in the existing resource allocation schemes is its support for static environment, that does not fit well for mPC. So, a resource allocation scheme for mPC users is desired that can dynamically allocate resources based on users’ location and its connection establishment priority. In this paper, we propose a public safety users priority-based context-aware resource allocation (PS-CARA) scheme for users sum-rate maximization in disaster environment. Simulations results demonstrate that the proposed PS-CARA scheme can increase the user average and edge rate around 10.3% and 32.8% , respectively because of context information availability and by prioritizing the public safety users. The simulation results ensure that call blocking probability is also reduced considerably under the PS-CARA scheme. PMID:29738499

Improved Space Surveillance Network (SSN) Scheduling using Artificial Intelligence Techniques

NASA Astrophysics Data System (ADS)

Stottler, D.

There are close to 20,000 cataloged manmade objects in space, the large majority of which are not active, functioning satellites. These are tracked by phased array and mechanical radars and ground and space-based optical telescopes, collectively known as the Space Surveillance Network (SSN). A better SSN schedule of observations could, using exactly the same legacy sensor resources, improve space catalog accuracy through more complementary tracking, provide better responsiveness to real-time changes, better track small debris in low earth orbit (LEO) through efficient use of applicable sensors, efficiently track deep space (DS) frequent revisit objects, handle increased numbers of objects and new types of sensors, and take advantage of future improved communication and control to globally optimize the SSN schedule. We have developed a scheduling algorithm that takes as input the space catalog and the associated covariance matrices and produces a globally optimized schedule for each sensor site as to what objects to observe and when. This algorithm is able to schedule more observations with the same sensor resources and have those observations be more complementary, in terms of the precision with which each orbit metric is known, to produce a satellite observation schedule that, when executed, minimizes the covariances across the entire space object catalog. If used operationally, the results would be significantly increased accuracy of the space catalog with fewer lost objects with the same set of sensor resources. This approach inherently can also trade-off fewer high priority tasks against more lower-priority tasks, when there is benefit in doing so. Currently the project has completed a prototyping and feasibility study, using open source data on the SSN's sensors, that showed significant reduction in orbit metric covariances. The algorithm techniques and results will be discussed along with future directions for the research.

77 FR 39749 - Sunshine Act Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-05

... advertising in securities offerings conducted pursuant to Rule 506 of Regulation D under the Securities Act... Startups Act. At times, changes in Commission priorities require alterations in the scheduling of meeting...

OGUPSA sensor scheduling architecture and algorithm

NASA Astrophysics Data System (ADS)

Zhang, Zhixiong; Hintz, Kenneth J.

1996-06-01

This paper introduces a new architecture for a sensor measurement scheduler as well as a dynamic sensor scheduling algorithm called the on-line, greedy, urgency-driven, preemptive scheduling algorithm (OGUPSA). OGUPSA incorporates a preemptive mechanism which uses three policies, (1) most-urgent-first (MUF), (2) earliest- completed-first (ECF), and (3) least-versatile-first (LVF). The three policies are used successively to dynamically allocate and schedule and distribute a set of arriving tasks among a set of sensors. OGUPSA also can detect the failure of a task to meet a deadline as well as generate an optimal schedule in the sense of minimum makespan for a group of tasks with the same priorities. A side benefit is OGUPSA's ability to improve dynamic load balance among all sensors while being a polynomial time algorithm. Results of a simulation are presented for a simple sensor system.

Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

PubMed Central

Loganathan, Shyamala; Mukherjee, Saswati

2015-01-01

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

Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter.

PubMed

Loganathan, Shyamala; Mukherjee, Saswati

2015-01-01

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

Priority setting for government investment in forestry conservation schemes-an example from New Zealand

Treesearch

Colin L. O' Loughlin

1991-01-01

In New Zealand responsibility for funding flood protection and erosion prevention and control projects rests largely with local regional authorities. However, in 1988 Central Government decided to provide direct funding for a major forestry conservation scheme in the erosion-susceptible East Coast region. Government's investment decision was influenced by a number...

Routing and Scheduling Algorithms for WirelessHART Networks: A Survey

PubMed Central

Nobre, Marcelo; Silva, Ivanovitch; Guedes, Luiz Affonso

2015-01-01

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

A Multi-layer Dynamic Model for Coordination Based Group Decision Making in Water Resource Allocation and Scheduling

NASA Astrophysics Data System (ADS)

Huang, Wei; Zhang, Xingnan; Li, Chenming; Wang, Jianying

Management of group decision-making is an important issue in water source management development. In order to overcome the defects in lacking of effective communication and cooperation in the existing decision-making models, this paper proposes a multi-layer dynamic model for coordination in water resource allocation and scheduling based group decision making. By introducing the scheme-recognized cooperative satisfaction index and scheme-adjusted rationality index, the proposed model can solve the problem of poor convergence of multi-round decision-making process in water resource allocation and scheduling. Furthermore, the problem about coordination of limited resources-based group decision-making process can be solved based on the effectiveness of distance-based group of conflict resolution. The simulation results show that the proposed model has better convergence than the existing models.

JPRS Report, Near East & South Asia, India

DTIC Science & Technology

1991-09-04

effectively utilized. The national Scheduled Castes and Scheduled Tribes High priority will, therefore, be accorded to education. Finance and Development ...the Government’s reaction. Whatever is there was a sharp reduction in our foreign exchange banned or is obstructive is a negative development ...Unless I distribution system will be increased by 85 paise per kg find substantial improvement in tax compliance in the to Rs 6. 10 per kg with effect

Radio Resource Allocation on Complex 4G Wireless Cellular Networks

NASA Astrophysics Data System (ADS)

Psannis, Kostas E.

2015-09-01

In this article we consider the heuristic algorithm which improves step by step wireless data delivery over LTE cellular networks by using the total transmit power with the constraint on users’ data rates, and the total throughput with the constraints on the total transmit power as well as users’ data rates, which are jointly integrated into a hybrid-layer design framework to perform radio resource allocation for multiple users, and to effectively decide the optimal system parameter such as modulation and coding scheme (MCS) in order to adapt to the varying channel quality. We propose new heuristic algorithm which balances the accessible data rate, the initial data rates of each user allocated by LTE scheduler, the priority indicator which signals delay- throughput- packet loss awareness of the user, and the buffer fullness by achieving maximization of radio resource allocation for multiple users. It is noted that the overall performance is improved with the increase in the number of users, due to multiuser diversity. Experimental results illustrate and validate the accuracy of the proposed methodology.

Two-stage collaborative global optimization design model of the CHPG microgrid

NASA Astrophysics Data System (ADS)

Liao, Qingfen; Xu, Yeyan; Tang, Fei; Peng, Sicheng; Yang, Zheng

2017-06-01

With the continuous developing of technology and reducing of investment costs, renewable energy proportion in the power grid is becoming higher and higher because of the clean and environmental characteristics, which may need more larger-capacity energy storage devices, increasing the cost. A two-stage collaborative global optimization design model of the combined-heat-power-and-gas (abbreviated as CHPG) microgrid is proposed in this paper, to minimize the cost by using virtual storage without extending the existing storage system. P2G technology is used as virtual multi-energy storage in CHPG, which can coordinate the operation of electric energy network and natural gas network at the same time. Demand response is also one kind of good virtual storage, including economic guide for the DGs and heat pumps in demand side and priority scheduling of controllable loads. Two kinds of storage will coordinate to smooth the high-frequency fluctuations and low-frequency fluctuations of renewable energy respectively, and achieve a lower-cost operation scheme simultaneously. Finally, the feasibility and superiority of proposed design model is proved in a simulation of a CHPG microgrid.

An Adaptive Priority Tuning System for Optimized Local CPU Scheduling using BOINC Clients

NASA Astrophysics Data System (ADS)

Mnaouer, Adel B.; Ragoonath, Colin

2010-11-01

Volunteer Computing (VC) is a Distributed Computing model which utilizes idle CPU cycles from computing resources donated by volunteers who are connected through the Internet to form a very large-scale, loosely coupled High Performance Computing environment. Distributed Volunteer Computing environments such as the BOINC framework is concerned mainly with the efficient scheduling of the available resources to the applications which require them. The BOINC framework thus contains a number of scheduling policies/algorithms both on the server-side and on the client which work together to maximize the available resources and to provide a degree of QoS in an environment which is highly volatile. This paper focuses on the BOINC client and introduces an adaptive priority tuning client side middleware application which improves the execution times of Work Units (WUs) while maintaining an acceptable Maximum Response Time (MRT) for the end user. We have conducted extensive experimentation of the proposed system and the results show clear speedup of BOINC applications using our optimized middleware as opposed to running using the original BOINC client.

Secret sharing based on quantum Fourier transform

NASA Astrophysics Data System (ADS)

Yang, Wei; Huang, Liusheng; Shi, Runhua; He, Libao

2013-07-01

Secret sharing plays a fundamental role in both secure multi-party computation and modern cryptography. We present a new quantum secret sharing scheme based on quantum Fourier transform. This scheme enjoys the property that each share of a secret is disguised with true randomness, rather than classical pseudorandomness. Moreover, under the only assumption that a top priority for all participants (secret sharers and recovers) is to obtain the right result, our scheme is able to achieve provable security against a computationally unbounded attacker.

A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy

PubMed Central

Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

2013-01-01

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments. PMID:23690742

A dynamic scheduling method of Earth-observing satellites by employing rolling horizon strategy.

PubMed

Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

2013-01-01

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments.

Architectural impact of FDDI network on scheduling hard real-time traffic

NASA Technical Reports Server (NTRS)

Agrawal, Gopal; Chen, Baio; Zhao, Wei; Davari, Sadegh

1991-01-01

The architectural impact on guaranteeing synchronous message deadlines in FDDI (Fiber Distributed Data Interface) token ring networks is examined. The FDDI network does not have facility to support (global) priority arbitration which is a useful facility for scheduling hard real time activities. As a result, it was found that the worst case utilization of synchronous traffic in an FDDI network can be far less than that in a centralized single processor system. Nevertheless, it is proposed and analyzed that a scheduling method can guarantee deadlines of synchronous messages having traffic utilization up to 33 pct., the highest to date.

Linux Kernel Co-Scheduling and Bulk Synchronous Parallelism

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, Terry R

2012-01-01

This paper describes a kernel scheduling algorithm that is based on coscheduling principles and that is intended for parallel applications running on 1000 cores or more. Experimental results for a Linux implementation on a Cray XT5 machine are presented. The results indicate that Linux is a suitable operating system for this new scheduling scheme, and that this design provides a dramatic improvement in scaling performance for synchronizing collective operations at scale.

A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling.

PubMed

Hajri, S; Liouane, N; Hammadi, S; Borne, P

2000-01-01

Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.

Protocol, Engineering Research Center, University of California, Santa Barbara

DTIC Science & Technology

2005-12-01

minimizing the energy consumption in idle periods. We have designed an asynchronous wakeup schedule based on the theory of block designs. The idea is...performance of ad hoc networks through innovative packet scheduling (Baker). "* Developed a number of novel schemes to ensure loop freedom in on demand routing...network nodes to schedule their transmissions to avoid collisions (Garcia-Luna-Aceves). "* Designed and analyzed the Hybrid Activation Multiple Access (HAMA

Control Channel Vulnerability Analysis of the Institute of Electrical and Electronics Engineers 802.16m-2011 and 802.16- 2009 Standards

DTIC Science & Technology

2012-09-01

scheduler to adapt its uplink and downlink assignments to channel conditions. Sleep mode is used by the MS to minimize power drain and radio...is addressed in one resource unit, while for multi-user (MU) schemes , multiple users can be scheduled in one resource unit. Open-loop techniques...17  7.  Mobility and Power Management ......................................... 18  8.  Scheduling Services

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

NASA Technical Reports Server (NTRS)

Globus, Al; Crawford, James; Lohn, Jason; Pryor, Anna

2003-01-01

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks

PubMed Central

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-01-01

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network. PMID:27754405

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks.

PubMed

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-10-14

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network.

VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans

NASA Astrophysics Data System (ADS)

Wang, Song; Gupta, Chetan; Mehta, Abhay

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

A Survey on Urban Traffic Management System Using Wireless Sensor Networks.

PubMed

Nellore, Kapileswar; Hancke, Gerhard P

2016-01-27

Nowadays, the number of vehicles has increased exponentially, but the bedrock capacities of roads and transportation systems have not developed in an equivalent way to efficiently cope with the number of vehicles traveling on them. Due to this, road jamming and traffic correlated pollution have increased with the associated adverse societal and financial effect on different markets worldwide. A static control system may block emergency vehicles due to traffic jams. Wireless Sensor networks (WSNs) have gained increasing attention in traffic detection and avoiding road congestion. WSNs are very trendy due to their faster transfer of information, easy installation, less maintenance, compactness and for being less expensive compared to other network options. There has been significant research on Traffic Management Systems using WSNs to avoid congestion, ensure priority for emergency vehicles and cut the Average Waiting Time (AWT) of vehicles at intersections. In recent decades, researchers have started to monitor real-time traffic using WSNs, RFIDs, ZigBee, VANETs, Bluetooth devices, cameras and infrared signals. This paper presents a survey of current urban traffic management schemes for priority-based signalling, and reducing congestion and the AWT of vehicles. The main objective of this survey is to provide a taxonomy of different traffic management schemes used for avoiding congestion. Existing urban traffic management schemes for the avoidance of congestion and providing priority to emergency vehicles are considered and set the foundation for further research.

A Survey on Urban Traffic Management System Using Wireless Sensor Networks

PubMed Central

Nellore, Kapileswar; Hancke, Gerhard P.

2016-01-01

Nowadays, the number of vehicles has increased exponentially, but the bedrock capacities of roads and transportation systems have not developed in an equivalent way to efficiently cope with the number of vehicles traveling on them. Due to this, road jamming and traffic correlated pollution have increased with the associated adverse societal and financial effect on different markets worldwide. A static control system may block emergency vehicles due to traffic jams. Wireless Sensor networks (WSNs) have gained increasing attention in traffic detection and avoiding road congestion. WSNs are very trendy due to their faster transfer of information, easy installation, less maintenance, compactness and for being less expensive compared to other network options. There has been significant research on Traffic Management Systems using WSNs to avoid congestion, ensure priority for emergency vehicles and cut the Average Waiting Time (AWT) of vehicles at intersections. In recent decades, researchers have started to monitor real-time traffic using WSNs, RFIDs, ZigBee, VANETs, Bluetooth devices, cameras and infrared signals. This paper presents a survey of current urban traffic management schemes for priority-based signalling, and reducing congestion and the AWT of vehicles. The main objective of this survey is to provide a taxonomy of different traffic management schemes used for avoiding congestion. Existing urban traffic management schemes for the avoidance of congestion and providing priority to emergency vehicles are considered and set the foundation for further research. PMID:26828489

A Time Tree Medium Access Control for Energy Efficiency and Collision Avoidance in Wireless Sensor Networks

PubMed Central

Lee, Kilhung

2010-01-01

This paper presents a medium access control and scheduling scheme for wireless sensor networks. It uses time trees for sending data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, time trees are built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time tree is a data gathering tree where the base station is the root and each sensor node is either a relaying or a leaf node of the tree. Each tree operates in a different time schedule with possibly different activation rates. Through the simulation, the proposed scheme that uses time trees shows better characteristics toward burst traffic than the previous energy and data arrival rate scheme. PMID:22319270

[Immunisation schedule of the Spanish Association of Paediatrics: 2016 recommendations].

PubMed

Moreno-Pérez, D; Álvarez García, F J; Arístegui Fernández, J; Cilleruelo Ortega, M J; Corretger Rauet, J M; García Sánchez, N; Hernández Merino, A; Hernández-Sampelayo Matos, T; Merino Moína, M; Ortigosa del Castillo, L; Ruiz-Contreras, J

2016-01-01

The Advisory Committee on Vaccines of the Spanish Association of Paediatrics (CAV-AEP) annually publishes the immunisation schedule which, in our opinion, estimates optimal for children resident in Spain, considering available evidence on current vaccines. We acknowledge the effort of the Ministry of Health during the last year in order to optimize the funded unified Spanish vaccination schedule, with the recent inclusion of pneumococcal and varicella vaccination in early infancy. Regarding the funded vaccines included in the official unified immunization schedule, taking into account available data, CAV-AEP recommends 2+1 strategy (2, 4 and 12 months) with hexavalent (DTPa-IPV-Hib-HB) vaccines and 13-valent pneumococcal conjugate vaccine. Administration of Tdap and poliomyelitis booster dose at the age of 6 is recommended, as well as Tdap vaccine for adolescents and pregnant women, between 27-36 weeks gestation. The two-dose scheme should be used for MMR (12 months and 2-4 years) and varicella (15 months and 2-4 years). Coverage of human papillomavirus vaccination in girls aged 11-12 with a two dose scheme (0, 6 months) should be improved. Information for male adolescents about potential beneficial effects of this immunisation should be provided as well. Regarding recommended unfunded immunisations, CAV-AEP recommends the administration of meningococcal B vaccine, due to the current availability in Spanish communitary pharmacies, with a 3+1 scheme (3, 5, 7 and 13-15 months). CAV-AEP requests the incorporation of this vaccine in the funded unified schedule. Vaccination against rotavirus is recommended in all infants. Annual influenza immunisation and vaccination against hepatitis A are indicated in population groups considered at risk. Copyright © 2015 Asociación Española de Pediatría. Published by Elsevier España, S.L.U. All rights reserved.

Prioritized LT Codes

NASA Technical Reports Server (NTRS)

Woo, Simon S.; Cheng, Michael K.

2011-01-01

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Enhanced round robin CPU scheduling with burst time based time quantum

NASA Astrophysics Data System (ADS)

Indusree, J. R.; Prabadevi, B.

2017-11-01

Process scheduling is a very important functionality of Operating system. The main-known process-scheduling algorithms are First Come First Serve (FCFS) algorithm, Round Robin (RR) algorithm, Priority scheduling algorithm and Shortest Job First (SJF) algorithm. Compared to its peers, Round Robin (RR) algorithm has the advantage that it gives fair share of CPU to the processes which are already in the ready-queue. The effectiveness of the RR algorithm greatly depends on chosen time quantum value. Through this research paper, we are proposing an enhanced algorithm called Enhanced Round Robin with Burst-time based Time Quantum (ERRBTQ) process scheduling algorithm which calculates time quantum as per the burst-time of processes already in ready queue. The experimental results and analysis of ERRBTQ algorithm clearly indicates the improved performance when compared with conventional RR and its variants.

Setting conservation priorities.

PubMed

Wilson, Kerrie A; Carwardine, Josie; Possingham, Hugh P

2009-04-01

A generic framework for setting conservation priorities based on the principles of classic decision theory is provided. This framework encapsulates the key elements of any problem, including the objective, the constraints, and knowledge of the system. Within the context of this framework the broad array of approaches for setting conservation priorities are reviewed. While some approaches prioritize assets or locations for conservation investment, it is concluded here that prioritization is incomplete without consideration of the conservation actions required to conserve the assets at particular locations. The challenges associated with prioritizing investments through time in the face of threats (and also spatially and temporally heterogeneous costs) can be aided by proper problem definition. Using the authors' general framework for setting conservation priorities, multiple criteria can be rationally integrated and where, how, and when to invest conservation resources can be scheduled. Trade-offs are unavoidable in priority setting when there are multiple considerations, and budgets are almost always finite. The authors discuss how trade-offs, risks, uncertainty, feedbacks, and learning can be explicitly evaluated within their generic framework for setting conservation priorities. Finally, they suggest ways that current priority-setting approaches may be improved.

Capacity allocation mechanism based on differentiated QoS in 60 GHz radio-over-fiber local access network

NASA Astrophysics Data System (ADS)

Kou, Yanbin; Liu, Siming; Zhang, Weiheng; Shen, Guansheng; Tian, Huiping

2017-03-01

We present a dynamic capacity allocation mechanism based on the Quality of Service (QoS) for different mobile users (MU) in 60 GHz radio-over-fiber (RoF) local access networks. The proposed mechanism is capable for collecting the request information of MUs to build a full list of MU capacity demands and service types at the Central Office (CO). A hybrid algorithm is introduced to implement the capacity allocation which can satisfy the requirements of different MUs at different network traffic loads. Compared with the weight dynamic frames assignment (WDFA) scheme, the Hybrid scheme can keep high priority MUs in low delay and maintain the packet loss rate less than 1% simultaneously. At the same time, low priority MUs have a relatively better performance.

MPEG-compliant joint source/channel coding using discrete cosine transform and substream scheduling for visual communication over packet networks

NASA Astrophysics Data System (ADS)

Kim, Seong-Whan; Suthaharan, Shan; Lee, Heung-Kyu; Rao, K. R.

2001-01-01

Quality of Service (QoS)-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channel coding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, first, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Second, we designed a classification scheme to partition the packet stream into multiple substreams which have their own QoS requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other two popular techniques by simulation and real video experiments on the TCP/IP environment.

Path scheduling for multiple mobile actors in wireless sensor network

NASA Astrophysics Data System (ADS)

Trapasiya, Samir D.; Soni, Himanshu B.

2017-05-01

In wireless sensor network (WSN), energy is the main constraint. In this work we have addressed this issue for single as well as multiple mobile sensor actor network. In this work, we have proposed Rendezvous Point Selection Scheme (RPSS) in which Rendezvous Nodes are selected by set covering problem approach and from that, Rendezvous Points are selected in a way to reduce the tour length. The mobile actors tour is scheduled to pass through those Rendezvous Points as per Travelling Salesman Problem (TSP). We have also proposed novel rendezvous node rotation scheme for fair utilisation of all the nodes. We have compared RPSS with Stationery Actor scheme as well as RD-VT, RD-VT-SMT and WRP-SMT for performance metrics like energy consumption, network lifetime, route length and found the better outcome in all the cases for single actor. We have also applied RPSS for multiple mobile actor case like Multi-Actor Single Depot (MASD) termination and Multi-Actor Multiple Depot (MAMD) termination and observed by extensive simulation that MAMD saves the network energy in optimised way and enhance network lifetime compared to all other schemes.

Impact of insects on multiple-use values of north-central forests: an experimental rating scheme.

Treesearch

Norton D. Addy; Harold O. Batzer; William J. Mattson; William E. Miller

1971-01-01

Ranking or assigning priorities to problems is an essential step in research problem selection. Up to now, no rigorous basis for ranking forest insects has been available. We evaluate and rank forest insects with a systematic numerical scheme that considers insect impact on the multiple-use values of timber, wildlife, recreation, and water. The result is a better...

A Fair Contention Access Scheme for Low-Priority Traffic in Wireless Body Area Networks

PubMed Central

Sajeel, Muhammad; Bashir, Faisal; Asfand-e-yar, Muhammad; Tauqir, Muhammad

2017-01-01

Recently, wireless body area networks (WBANs) have attracted significant consideration in ubiquitous healthcare. A number of medium access control (MAC) protocols, primarily derived from the superframe structure of the IEEE 802.15.4, have been proposed in literature. These MAC protocols aim to provide quality of service (QoS) by prioritizing different traffic types in WBANs. A contention access period (CAP)with high contention in priority-based MAC protocols can result in higher number of collisions and retransmissions. During CAP, traffic classes with higher priority are dominant over low-priority traffic; this has led to starvation of low-priority traffic, thus adversely affecting WBAN throughput, delay, and energy consumption. Hence, this paper proposes a traffic-adaptive priority-based superframe structure that is able to reduce contention in the CAP period, and provides a fair chance for low-priority traffic. Simulation results in ns-3 demonstrate that the proposed MAC protocol, called traffic- adaptive priority-based MAC (TAP-MAC), achieves low energy consumption, high throughput, and low latency compared to the IEEE 802.15.4 standard, and the most recent priority-based MAC protocol, called priority-based MAC protocol (PA-MAC). PMID:28832495

Doing more with less - The new way of exploring the solar system

NASA Technical Reports Server (NTRS)

Ridenoure, Rex

1992-01-01

Exploration of the solar system is considered in the light of existing economic factors and scientific priorities, and a general blueprint for an exploration strategy is set forth. Attention is given to mission costs, typical schedules, and the scientific findings of typical projects which create the need for collaboration and diversification in mission development. The combined technologies and cooperative efforts of several small organizations can lead to missions with short schedules and low costs.

Doing more with less - The new way of exploring the solar system

NASA Astrophysics Data System (ADS)

Ridenoure, Rex

1992-08-01

Exploration of the solar system is considered in the light of existing economic factors and scientific priorities, and a general blueprint for an exploration strategy is set forth. Attention is given to mission costs, typical schedules, and the scientific findings of typical projects which create the need for collaboration and diversification in mission development. The combined technologies and cooperative efforts of several small organizations can lead to missions with short schedules and low costs.

Managing Contention and Timing Constraints in a Real-Time Database System

DTIC Science & Technology

1995-01-01

In order to realize many of these goals, StarBase is constructed on top of RT-Mach, a real - time operating system developed at Carnegie Mellon...University [ll]. StarBase differs from previous RT-DBMS work [l, 2, 31 in that a) it relies on a real - time operating system which provides priority...CPU and resource scheduling pro- vided by tlhe underlying real - time operating system . Issues of data contention are dealt with by use of a priority

Ada Quality and Style: Guidelines for Professional Programmers, Version 02.01.01

DTIC Science & Technology

1992-12-01

47, 78, 79 predicate queue , entry not prioritized, 95 as function name, 22 for boolean object, 21 R preemptive scheduling. 118 race condition. 49...when lower priority tasks are given service while higher priority tasks remain blocked. In the above example, this occurred because entry queues are...from an entry queue 100 Ada QUALITY AND STYLE due to execution of an abort statement as well as expiration of a timed entry call. The use of this

Regional scale prioritisation for key ecosystem services, renewable energy production and urban development.

PubMed

Casalegno, Stefano; Bennie, Jonathan J; Inger, Richard; Gaston, Kevin J

2014-01-01

Although the importance of addressing ecosystem service benefits in regional land use planning and decision-making is evident, substantial practical challenges remain. In particular, methods to identify priority areas for the provision of key ecosystem services and other environmental services (benefits from the environment not directly linked to the function of ecosystems) need to be developed. Priority areas are locations which provide disproportionally high benefits from one or more service. Here we map a set of ecosystem and environmental services and delineate priority areas according to different scenarios. Each scenario is produced by a set of weightings allocated to different services and corresponds to different landscape management strategies which decision makers could undertake. Using the county of Cornwall, U.K., as a case study, we processed gridded maps of key ecosystem services and environmental services, including renewable energy production and urban development. We explored their spatial distribution patterns and their spatial covariance and spatial stationarity within the region. Finally we applied a complementarity-based priority ranking algorithm (zonation) using different weighting schemes. Our conclusions are that (i) there are two main patterns of service distribution in this region, clustered services (including agriculture, carbon stocks, urban development and plant production) and dispersed services (including cultural services, energy production and floods mitigation); (ii) more than half of the services are spatially correlated and there is high non-stationarity in the spatial covariance between services; and (iii) it is important to consider both ecosystem services and other environmental services in identifying priority areas. Different weighting schemes provoke drastic changes in the delineation of priority areas and therefore decision making processes need to carefully consider the relative values attributed to different services.

Regional Scale Prioritisation for Key Ecosystem Services, Renewable Energy Production and Urban Development

PubMed Central

Casalegno, Stefano; Bennie, Jonathan J.; Inger, Richard; Gaston, Kevin J.

2014-01-01

Although the importance of addressing ecosystem service benefits in regional land use planning and decision-making is evident, substantial practical challenges remain. In particular, methods to identify priority areas for the provision of key ecosystem services and other environmental services (benefits from the environment not directly linked to the function of ecosystems) need to be developed. Priority areas are locations which provide disproportionally high benefits from one or more service. Here we map a set of ecosystem and environmental services and delineate priority areas according to different scenarios. Each scenario is produced by a set of weightings allocated to different services and corresponds to different landscape management strategies which decision makers could undertake. Using the county of Cornwall, U.K., as a case study, we processed gridded maps of key ecosystem services and environmental services, including renewable energy production and urban development. We explored their spatial distribution patterns and their spatial covariance and spatial stationarity within the region. Finally we applied a complementarity-based priority ranking algorithm (zonation) using different weighting schemes. Our conclusions are that (i) there are two main patterns of service distribution in this region, clustered services (including agriculture, carbon stocks, urban development and plant production) and dispersed services (including cultural services, energy production and floods mitigation); (ii) more than half of the services are spatially correlated and there is high non-stationarity in the spatial covariance between services; and (iii) it is important to consider both ecosystem services and other environmental services in identifying priority areas. Different weighting schemes provoke drastic changes in the delineation of priority areas and therefore decision making processes need to carefully consider the relative values attributed to different services. PMID:25250775

Short-term scheduling of an open-pit mine with multiple objectives

NASA Astrophysics Data System (ADS)

Blom, Michelle; Pearce, Adrian R.; Stuckey, Peter J.

2017-05-01

This article presents a novel algorithm for the generation of multiple short-term production schedules for an open-pit mine, in which several objectives, of varying priority, characterize the quality of each solution. A short-term schedule selects regions of a mine site, known as 'blocks', to be extracted in each week of a planning horizon (typically spanning 13 weeks). Existing tools for constructing these schedules use greedy heuristics, with little optimization. To construct a single schedule in which infrastructure is sufficiently utilized, with production grades consistently close to a desired target, a planner must often run these heuristics many times, adjusting parameters after each iteration. A planner's intuition and experience can evaluate the relative quality and mineability of different schedules in a way that is difficult to automate. Of interest to a short-term planner is the generation of multiple schedules, extracting available ore and waste in varying sequences, which can then be manually compared. This article presents a tool in which multiple, diverse, short-term schedules are constructed, meeting a range of common objectives without the need for iterative parameter adjustment.

On-board closed-loop congestion control for satellite based packet switching networks

NASA Technical Reports Server (NTRS)

Chu, Pong P.; Ivancic, William D.; Kim, Heechul

1993-01-01

NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time.

78 FR 79027 - Product Change-Priority Mail Express Negotiated Service Agreement

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-27

...The Postal Service gives notice of filing a request with the Postal Regulatory Commission to add a domestic shipping services contract to the list of Negotiated Service Agreements in the Mail Classification Schedule's Competitive Products List.

78 FR 79027 - Product Change-Priority Mail Negotiated Service Agreement

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-27

...The Postal Service gives notice of filing a request with the Postal Regulatory Commission to add a domestic shipping services contract to the list of Negotiated Service Agreements in the Mail Classification Schedule's Competitive Products List.

Gaining and sustaining schistosomiasis control: study protocol and baseline data prior to different treatment strategies in five African countries.

PubMed

Ezeamama, Amara E; He, Chun-La; Shen, Ye; Yin, Xiao-Ping; Binder, Sue C; Campbell, Carl H; Rathbun, Stephen; Whalen, Christopher C; N'Goran, Eliézer K; Utzinger, Jürg; Olsen, Annette; Magnussen, Pascal; Kinung'hi, Safari; Fenwick, Alan; Phillips, Anna; Ferro, Josefo; Karanja, Diana M S; Mwinzi, Pauline N M; Montgomery, Susan; Secor, W Evan; Hamidou, Amina; Garba, Amadou; King, Charles H; Colley, Daniel G

2016-05-26

The Schistosomiasis Consortium for Operational Research and Evaluation (SCORE) was established in 2008 to answer strategic questions about schistosomiasis control. For programme managers, a high-priority question is: what are the most cost-effective strategies for delivering preventive chemotherapy (PCT) with praziquantel (PZQ)? This paper describes the process SCORE used to transform this question into a harmonized research protocol, the study design for answering this question, the village eligibility assessments and data resulting from the first year of the study. Beginning in 2009, SCORE held a series of meetings to specify empirical questions and design studies related to different schedules of PCT for schistosomiasis control in communities with high (gaining control studies) and moderate (sustaining control studies) prevalence of Schistosoma infection among school-aged children. Seven studies are currently being implemented in five African countries. During the first year, villages were screened for eligibility, and data were collected on prevalence and intensity of infection prior to randomisation and the implementation of different schemes of PZQ intervention strategies. These studies of different treatment schedules with PZQ will provide the most comprehensive data thus far on the optimal frequency and continuity of PCT for schistosomiasis infection and morbidity control. We expect that the study outcomes will provide data for decision-making for country programme managers and a rich resource of information to the schistosomiasis research community. The trials are registered at International Standard Randomised Controlled Trial registry (identifiers: ISRCTN99401114 , ISRCTN14849830 , ISRCTN16755535 , ISRCTN14117624 , ISRCTN95819193 and ISRCTN32045736 ).

A New UK 2006 National Kidney Allocation Scheme for deceased heart-beating donor kidneys.

PubMed

Johnson, Rachel J; Fuggle, Susan V; Mumford, Lisa; Bradley, J Andrew; Forsythe, John L R; Rudge, Chris J

2010-02-27

In 2004, it was agreed that a new allocation scheme for kidneys from deceased heart-beating donors was required in the United Kingdom to address observed inequities in access to transplant. The 2006 National Kidney Allocation Scheme (2006 NKAS) was developed to meet agreed objectives and preparatory work included a review of the criteria for human leukocyte antigen (HLA) matching and simulation evidence about the effectiveness of alternative schemes. ALGORITHM FOR 2006 NKAS: The 2006 NKAS gives absolute priority to all 000 HLA-A, -B, -DR-mismatched patients and well-matched pediatric patients (<18 years), and then a points score defines priorities for allocation with waiting time being most influential. Points for age and HLA mismatch are linked in a novel approach to ensure well-matched transplants for younger patients while recognizing that HLA matching is less important for older patients as retransplantation is less likely to be required. To improve equity for difficult to match patients, rare HLA specificities were defaulted to more common, related specificities. IMPACT OF 2006 NKAS: After 3 years, the scheme is already making good progress in achieving its objectives, with overall results similar to those observed in the simulations. There has been a significant benefit for patients waiting more than 5 years for transplant. A number of other advantages of the scheme are also apparent with equity of access improving in many respects, including the achievement of equity of access to transplant for HLA-DR homozygous patients, but geographical inequity of access will take a number of years to address fully.

The Determinants of School District Salary Incentives: An Empirical Analysis of, Where and Why

ERIC Educational Resources Information Center

Martin, Stephanie M.

2010-01-01

Most public school districts in the United States use a salary schedule to determine compensation for teachers within the district. However, some school districts have implemented incentive pay schemes that allow flexibility at the school or even individual teacher level. These compensation schemes in some ways may more closely approximate a…

Geographic Information Systems: A Primer

DTIC Science & Technology

1990-10-01

AVAILABILITY OF REPORT Approved for public release; distribution 2b DECLASSjFICATION/ DOWNGRADING SCHEDULE unlimited. 4 PERFORMING ORGANIZATION REPORT...utilizing sophisticated integrated databases (usually vector-based), avoid the indirect value coding scheme by recognizing names or direct magnitudes...intricate involvement required by the operator in order to establish a functional coding scheme . A simple raster system, in which cell values indicate

Objectively Optimized Observation Direction System Providing Situational Awareness for a Sensor Web

NASA Astrophysics Data System (ADS)

Aulov, O.; Lary, D. J.

2010-12-01

There is great utility in having a flexible and automated objective observation direction system for the decadal survey missions and beyond. Such a system allows us to optimize the observations made by suite of sensors to address specific goals from long term monitoring to rapid response. We have developed such a prototype using a network of communicating software elements to control a heterogeneous network of sensor systems, which can have multiple modes and flexible viewing geometries. Our system makes sensor systems intelligent and situationally aware. Together they form a sensor web of multiple sensors working together and capable of automated target selection, i.e. the sensors “know” where they are, what they are able to observe, what targets and with what priorities they should observe. This system is implemented in three components. The first component is a Sensor Web simulator. The Sensor Web simulator describes the capabilities and locations of each sensor as a function of time, whether they are orbital, sub-orbital, or ground based. The simulator has been implemented using AGIs Satellite Tool Kit (STK). STK makes it easy to analyze and visualize optimal solutions for complex space scenarios, and perform complex analysis of land, sea, air, space assets, and shares results in one integrated solution. The second component is target scheduler that was implemented with STK Scheduler. STK Scheduler is powered by a scheduling engine that finds better solutions in a shorter amount of time than traditional heuristic algorithms. The global search algorithm within this engine is based on neural network technology that is capable of finding solutions to larger and more complex problems and maximizing the value of limited resources. The third component is a modeling and data assimilation system. It provides situational awareness by supplying the time evolution of uncertainty and information content metrics that are used to tell us what we need to observe and the priority we should give to the observations. A prototype of this component was implemented with AutoChem. AutoChem is NASA release software constituting an automatic code generation, symbolic differentiator, analysis, documentation, and web site creation tool for atmospheric chemical modeling and data assimilation. Its model is explicit and uses an adaptive time-step, error monitoring time integration scheme for stiff systems of equations. AutoChem was the first model to ever have the facility to perform 4D-Var data assimilation and Kalman filter. The project developed a control system with three main accomplishments. First, fully multivariate observational and theoretical information with associated uncertainties was combined using a full Kalman filter data assimilation system. Second, an optimal distribution of the computations and of data queries was achieved by utilizing high performance computers/load balancing and a set of automatically mirrored databases. Third, inter-instrument bias correction was performed using machine learning. The PI for this project was Dr. David Lary of the UMBC Joint Center for Earth Systems Technology at NASA/Goddard Space Flight Center.

SPANR planning and scheduling

NASA Astrophysics Data System (ADS)

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

2001-07-01

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

Compilation time analysis to minimize run-time overhead in preemptive scheduling on multiprocessors

NASA Astrophysics Data System (ADS)

Wauters, Piet; Lauwereins, Rudy; Peperstraete, J.

1994-10-01

This paper describes a scheduling method for hard real-time Digital Signal Processing (DSP) applications, implemented on a multi-processor. Due to the very high operating frequencies of DSP applications (typically hundreds of kHz) runtime overhead should be kept as small as possible. Because static scheduling introduces very little run-time overhead it is used as much as possible. Dynamic pre-emption of tasks is allowed if and only if it leads to better performance in spite of the extra run-time overhead. We essentially combine static scheduling with dynamic pre-emption using static priorities. Since we are dealing with hard real-time applications we must be able to guarantee at compile-time that all timing requirements will be satisfied at run-time. We will show that our method performs at least as good as any static scheduling method. It also reduces the total amount of dynamic pre-emptions compared with run time methods like deadline monotonic scheduling.

Proceedings of the IFIP WG 11.3 Working Conference on Database Security (6th) Held in Vancouver, British Columbia on 19-22 August 1992.

DTIC Science & Technology

1992-01-01

multiversioning scheme for this purpose was presented in [9]. The scheme guarantees that high level methods would read down object states at lower levels that...order given by fork-stamp, and terminated writing versions with timestamp WStamp. Such a history is needed to implement the multiversioning scheme...recovery protocol for multiversion schedulers and show that this protocol is both correct and secure. The behavior of the recovery protocol depends

Fairness of QoS supporting in optical burst switching

NASA Astrophysics Data System (ADS)

Xuan, Xuelei; Liu, Hua; Chen, Chunfeng; Zhang, Zhizhong

2004-04-01

In this paper we investigate the fairness problem of offset-time-based quality of service (QoS) scheme proposed by Qiao and Dixit in optical burst switching (OBS) networks. In the proposed schemes, QoS relies on the fact that the requests for reservation further into the future, but for practical, benchmark offset-time of data bursts at the intermediate nodes is not equal to each other. Here, a new offset-time-based QoS scheme is introduced, where data bursts are classified according to their offset-time and isolated in the wavelength domain or time domain to achieve the parallel reservation. Through simulation, it is found that this scheme achieves fairness among data bursts with different priority.

Parallelization of implicit finite difference schemes in computational fluid dynamics

NASA Technical Reports Server (NTRS)

Decker, Naomi H.; Naik, Vijay K.; Nicoules, Michel

1990-01-01

Implicit finite difference schemes are often the preferred numerical schemes in computational fluid dynamics, requiring less stringent stability bounds than the explicit schemes. Each iteration in an implicit scheme involves global data dependencies in the form of second and higher order recurrences. Efficient parallel implementations of such iterative methods are considerably more difficult and non-intuitive. The parallelization of the implicit schemes that are used for solving the Euler and the thin layer Navier-Stokes equations and that require inversions of large linear systems in the form of block tri-diagonal and/or block penta-diagonal matrices is discussed. Three-dimensional cases are emphasized and schemes that minimize the total execution time are presented. Partitioning and scheduling schemes for alleviating the effects of the global data dependencies are described. An analysis of the communication and the computation aspects of these methods is presented. The effect of the boundary conditions on the parallel schemes is also discussed.

Autonomous power expert system

NASA Technical Reports Server (NTRS)

Ringer, Mark J.; Quinn, Todd M.

1990-01-01

The goal of the Autonomous Power System (APS) program is to develop and apply intelligent problem solving and control technologies to the Space Station Freedom Electrical Power Systems (SSF/EPS). The objectives of the program are to establish artificial intelligence/expert system technology paths, to create knowledge based tools with advanced human-operator interfaces, and to integrate and interface knowledge-based and conventional control schemes. This program is being developed at the NASA-Lewis. The APS Brassboard represents a subset of a 20 KHz Space Station Power Management And Distribution (PMAD) testbed. A distributed control scheme is used to manage multiple levels of computers and switchgear. The brassboard is comprised of a set of intelligent switchgear used to effectively switch power from the sources to the loads. The Autonomous Power Expert System (APEX) portion of the APS program integrates a knowledge based fault diagnostic system, a power resource scheduler, and an interface to the APS Brassboard. The system includes knowledge bases for system diagnostics, fault detection and isolation, and recommended actions. The scheduler autonomously assigns start times to the attached loads based on temporal and power constraints. The scheduler is able to work in a near real time environment for both scheduling and dynamic replanning.

Autonomous power expert system

NASA Technical Reports Server (NTRS)

Ringer, Mark J.; Quinn, Todd M.

1990-01-01

The goal of the Autonomous Power System (APS) program is to develop and apply intelligent problem solving and control technologies to the Space Station Freedom Electrical Power Systems (SSF/EPS). The objectives of the program are to establish artificial intelligence/expert system technology paths, to create knowledge based tools with advanced human-operator interfaces, and to integrate and interface knowledge-based and conventional control schemes. This program is being developed at the NASA-Lewis. The APS Brassboard represents a subset of a 20 KHz Space Station Power Management And Distribution (PMAD) testbed. A distributed control scheme is used to manage multiple levels of computers and switchgear. The brassboard is comprised of a set of intelligent switchgear used to effectively switch power from the sources to the loads. The Autonomous Power Expert System (APEX) portion of the APS program integrates a knowledge based fault diagnostic system, a power resource scheduler, and an interface to the APS Brassboard. The system includes knowledge bases for system diagnostics, fault detection and isolation, and recommended actions. The scheduler autonomously assigns start times to the attached loads based on temporal and power constraints. The scheduler is able to work in a near real time environment for both scheduling an dynamic replanning.

Student Services for a New Breed

ERIC Educational Resources Information Center

Simmons, Howard L.; Kochey, Kenneth C.

1975-01-01

Today's student needs services sensitive to his priorities of work and economic security. Suggested services include: transportation services, food services, financial aid for basic physical needs, flexible scheduling, facilities for "lifetime" sports activities, counselors located at community centers, cooperative arrangements with local cultural…

Problem area descriptions : motor vehicle crashes - data analysis and IVI program analysis

DOT National Transportation Integrated Search

In general, the IVI program focuses on the more significant safety problem categories as : indicated by statistical analyses of crash data. However, other factors were considered in setting : program priorities and schedules. For some problem areas, ...

48 CFR 42.302 - Contract administration functions.

Code of Federal Regulations, 2014 CFR

2014-10-01

...) Perform preaward surveys (see Subpart 9.1). (33) Advise and assist contractors regarding their priorities... with contractual terms for schedule, cost, and technical performance in the areas of design... efforts and management systems that relate to design, development, production, engineering changes...

48 CFR 42.302 - Contract administration functions.

Code of Federal Regulations, 2013 CFR

2013-10-01

...) Perform preaward surveys (see Subpart 9.1). (33) Advise and assist contractors regarding their priorities... with contractual terms for schedule, cost, and technical performance in the areas of design... efforts and management systems that relate to design, development, production, engineering changes...

48 CFR 42.302 - Contract administration functions.

Code of Federal Regulations, 2012 CFR

2012-10-01

...) Perform preaward surveys (see Subpart 9.1). (33) Advise and assist contractors regarding their priorities... with contractual terms for schedule, cost, and technical performance in the areas of design... efforts and management systems that relate to design, development, production, engineering changes...

48 CFR 42.302 - Contract administration functions.

Code of Federal Regulations, 2011 CFR

2011-10-01

...) Perform preaward surveys (see Subpart 9.1). (33) Advise and assist contractors regarding their priorities... with contractual terms for schedule, cost, and technical performance in the areas of design... efforts and management systems that relate to design, development, production, engineering changes...

A Mixed Integer Linear Program for Airport Departure Scheduling

NASA Technical Reports Server (NTRS)

Gupta, Gautam; Jung, Yoon Chul

2009-01-01

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

Cloud computing task scheduling strategy based on improved differential evolution algorithm

NASA Astrophysics Data System (ADS)

Ge, Junwei; He, Qian; Fang, Yiqiu

2017-04-01

In order to optimize the cloud computing task scheduling scheme, an improved differential evolution algorithm for cloud computing task scheduling is proposed. Firstly, the cloud computing task scheduling model, according to the model of the fitness function, and then used improved optimization calculation of the fitness function of the evolutionary algorithm, according to the evolution of generation of dynamic selection strategy through dynamic mutation strategy to ensure the global and local search ability. The performance test experiment was carried out in the CloudSim simulation platform, the experimental results show that the improved differential evolution algorithm can reduce the cloud computing task execution time and user cost saving, good implementation of the optimal scheduling of cloud computing tasks.

Secure Multiuser Communications in Wireless Sensor Networks with TAS and Cooperative Jamming

PubMed Central

Yang, Maoqiang; Zhang, Bangning; Huang, Yuzhen; Yang, Nan; Guo, Daoxing; Gao, Bin

2016-01-01

In this paper, we investigate the secure transmission in wireless sensor networks (WSNs) consisting of one multiple-antenna base station (BS), multiple single-antenna legitimate users, one single-antenna eavesdropper and one multiple-antenna cooperative jammer. In an effort to reduce the scheduling complexity and extend the battery lifetime of the sensor nodes, the switch-and-stay combining (SSC) scheduling scheme is exploited over the sensor nodes. Meanwhile, transmit antenna selection (TAS) is employed at the BS and cooperative jamming (CJ) is adopted at the jammer node, aiming at achieving a satisfactory secrecy performance. Moreover, depending on whether the jammer node has the global channel state information (CSI) of both the legitimate channel and the eavesdropper’s channel, it explores a zero-forcing beamforming (ZFB) scheme or a null-space artificial noise (NAN) scheme to confound the eavesdropper while avoiding the interference to the legitimate user. Building on this, we propose two novel hybrid secure transmission schemes, termed TAS-SSC-ZFB and TAS-SSC-NAN, for WSNs. We then derive the exact closed-form expressions for the secrecy outage probability and the effective secrecy throughput of both schemes to characterize the secrecy performance. Using these closed-form expressions, we further determine the optimal switching threshold and obtain the optimal power allocation factor between the BS and jammer node for both schemes to minimize the secrecy outage probability, while the optimal secrecy rate is decided to maximize the effective secrecy throughput for both schemes. Numerical results are provided to verify the theoretical analysis and illustrate the impact of key system parameters on the secrecy performance. PMID:27845753

Individual differences in strategic flight management and scheduling

NASA Technical Reports Server (NTRS)

Wickens, Christopher D.; Raby, Mireille

1991-01-01

A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.

Teachers' Unions and Compensation: The Impact of Collective Bargaining on Salary Schedules and Performance Pay Schemes

ERIC Educational Resources Information Center

West, Kristine Lamm; Mykerezi, Elton

2011-01-01

This study examines the impact that collective bargaining has on multiple dimensions of teacher compensation, including average and starting salaries, early and late returns to experience, returns to graduate degrees, and the incidence of different pay for performance schemes. Using data from the School and Staffing Survey (SASS) and a more recent…

Priority rating : stormwater outfall prioritization scheme

DOT National Transportation Integrated Search

1996-10-01

The prioritization system, which compares the impacts of one outfall to another : and makes a determination of their overall impacts, was developed in the : Prioritization Method for Retrofitting Highways with Stormwater BMPs, prepared : by the Water...

Multichannel-Sensing Scheduling and Transmission-Energy Optimizing in Cognitive Radio Networks with Energy Harvesting.

PubMed

Hoan, Tran-Nhut-Khai; Hiep, Vu-Van; Koo, In-Soo

2016-03-31

This paper considers cognitive radio networks (CRNs) utilizing multiple time-slotted primary channels in which cognitive users (CUs) are powered by energy harvesters. The CUs are under the consideration that hardware constraints on radio devices only allow them to sense and transmit on one channel at a time. For a scenario where the arrival of harvested energy packets and the battery capacity are finite, we propose a scheme to optimize (i) the channel-sensing schedule (consisting of finding the optimal action (silent or active) and sensing order of channels) and (ii) the optimal transmission energy set corresponding to the channels in the sensing order for the operation of the CU in order to maximize the expected throughput of the CRN over multiple time slots. Frequency-switching delay, energy-switching cost, correlation in spectrum occupancy across time and frequency and errors in spectrum sensing are also considered in this work. The performance of the proposed scheme is evaluated via simulation. The simulation results show that the throughput of the proposed scheme is greatly improved, in comparison to related schemes in the literature. The collision ratio on the primary channels is also investigated.

Scheduling Projects with Multiskill Learning Effect

PubMed Central

2014-01-01

We investigate the project scheduling problem with multiskill learning effect. A new model is proposed to deal with the problem, where both autonomous and induced learning are considered. In order to obtain the optimal solution, a genetic algorithm with specific encoding and decoding schemes is introduced. A numerical example is used to illustrate the proposed model. The computational results show that the learning effect cannot be neglected in project scheduling. By means of determining the level of induced learning, the project manager can balance the project makespan with total cost. PMID:24683355

Approximation algorithms for scheduling unrelated parallel machines with release dates

NASA Astrophysics Data System (ADS)

Avdeenko, T. V.; Mesentsev, Y. A.; Estraykh, I. V.

2017-01-01

In this paper we propose approaches to optimal scheduling of unrelated parallel machines with release dates. One approach is based on the scheme of dynamic programming modified with adaptive narrowing of search domain ensuring its computational effectiveness. We discussed complexity of the exact schedules synthesis and compared it with approximate, close to optimal, solutions. Also we explain how the algorithm works for the example of two unrelated parallel machines and five jobs with release dates. Performance results that show the efficiency of the proposed approach have been given.

Scheduling projects with multiskill learning effect.

PubMed

Zha, Hong; Zhang, Lianying

2014-01-01

We investigate the project scheduling problem with multiskill learning effect. A new model is proposed to deal with the problem, where both autonomous and induced learning are considered. In order to obtain the optimal solution, a genetic algorithm with specific encoding and decoding schemes is introduced. A numerical example is used to illustrate the proposed model. The computational results show that the learning effect cannot be neglected in project scheduling. By means of determining the level of induced learning, the project manager can balance the project makespan with total cost.

Ready to Renovate

ERIC Educational Resources Information Center

Kennedy, Mike

2008-01-01

Schools and universities should have a thorough plan that sets priorities for the most pressing facility renovations. With remedial programs, enrichment offerings, recreational activities and extended-year schedules, many school facilities are no longer dormant in the summer months. The increased year-round use of education facilities benefits…

ARS irrigation research priorities and projects-An update

USDA-ARS?s Scientific Manuscript database

The USDA Agricultural Research Service focuses on six areas of research that are crucial to safe and effective use of all water resources for agricultural production: 1) Irrigation Scheduling Technologies for Water Productivity; 2) Water Productivity (WP) at Multiple Scales; 3) Irrigation Applicatio...

A new intuitionistic fuzzy rule-based decision-making system for an operating system process scheduler.

PubMed

Butt, Muhammad Arif; Akram, Muhammad

2016-01-01

We present a new intuitionistic fuzzy rule-based decision-making system based on intuitionistic fuzzy sets for a process scheduler of a batch operating system. Our proposed intuitionistic fuzzy scheduling algorithm, inputs the nice value and burst time of all available processes in the ready queue, intuitionistically fuzzify the input values, triggers appropriate rules of our intuitionistic fuzzy inference engine and finally calculates the dynamic priority (dp) of all the processes in the ready queue. Once the dp of every process is calculated the ready queue is sorted in decreasing order of dp of every process. The process with maximum dp value is sent to the central processing unit for execution. Finally, we show complete working of our algorithm on two different data sets and give comparisons with some standard non-preemptive process schedulers.

Employment of Direct Fire Systems during Offensive Operations

DTIC Science & Technology

1990-06-01

problems, this criteria suffers from a lack of offensive direct fire planning as part 115 of the scheme of maneuver. Limited TTP discussion in the...these specific occurrences. Doctrine writers could develop TTP to do so. This problem could involve unit training practices. If units differentiate ...10 0 0 0 5 PURPOSE) 4. - IDENTIFIES DIRECT FIRE I 76 15 20 130 21 15 115 R&S PRIORITY (PIR/IR) 5. - IDENTIFIES ENGAGEMENT 1 5 10 0 25 16 0 0 PRIORITY

Priority in Process Algebras

NASA Technical Reports Server (NTRS)

Cleaveland, Rance; Luettgen, Gerald; Natarajan, V.

1999-01-01

This paper surveys the semantic ramifications of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. These enriched formalisms allow one to model system features such as interrupts, prioritized choice, or real-time behavior. Approaches to priority in process algebras can be classified according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global pre-emption and static priorities and led to formalisms for modeling interrupts and aspects of real-time, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of pre-emption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the efficient encoding of real-time semantics. Technically, this paper studies the different models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local pre- emption. In each case the operational semantics of CCS is modified appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for different process-algebraic settings are discussed.

Five Strategies of Successful Part-Time Work.

ERIC Educational Resources Information Center

Corwin, Vivien; Lawrence, Thomas B.; Frost, Peter J.

2001-01-01

Identifies commonalities in the approaches of successful part-time professionals. Discusses five strategies for success: (1) communicating work-life priorities and schedules to the organization; (2) making the business case for part-time arrangements; (3) establishing time management routines; (4) cultivating advocates in senior management; and…

End-to-End QoS for Differentiated Services and ATM Internetworking

NASA Technical Reports Server (NTRS)

Su, Hongjun; Atiquzzaman, Mohammed

2001-01-01

The Internet was initially design for non real-time data communications and hence does not provide any Quality of Service (QoS). The next generation Internet will be characterized by high speed and QoS guarantee. The aim of this paper is to develop a prioritized early packet discard (PEPD) scheme for ATM switches to provide service differentiation and QoS guarantee to end applications running over next generation Internet. The proposed PEPD scheme differs from previous schemes by taking into account the priority of packets generated from different application. We develop a Markov chain model for the proposed scheme and verify the model with simulation. Numerical results show that the results from the model and computer simulation are in close agreement. Our PEPD scheme provides service differentiation to the end-to-end applications.

Future Research Priorities for Morbidity Control of Lymphedema.

PubMed

Narahari, S R; Aggithaya, Madhur Guruprasad; Moffatt, Christine; Ryan, T J; Keeley, Vaughan; Vijaya, B; Rajendran, P; Karalam, S B; Rajagopala, S; Kumar, N K; Bose, K S; Sushma, K V

2017-01-01

Innovation in the treatment of lower extremity lymphedema has received low priority from the governments and pharmaceutical industry. Advancing lymphedema is irreversible and initiates fibrosis in the dermis, reactive changes in the epidermis and subcutis. Most medical treatments offered for lymphedema are either too demanding with a less than satisfactory response or patients have low concordance due to complex schedules. A priority setting partnership (PSP) was established to decide on the future priorities in lymphedema research. A table of abstracts following a literature search was published in workshop website. Stake holders were requested to upload their priorities. Their questions were listed, randomized, and sent to lymphologists for ranking. High ranked ten research priorities, obtained through median score, were presented in final prioritization work shop attended by invited stake holders. A free medical camp was organized during workshop to understand patients' priorities. One hundred research priorities were selected from priorities uploaded to website. Ten priorities were short listed through a peer review process involving 12 lymphologists, for final discussion. They were related to simplification of integrative treatment for lymphedema, cellular changes in lymphedema and mechanisms of its reversal, eliminating bacterial entry lesions to reduce cellulitis episodes, exploring evidence for therapies in traditional medicine, improving patient concordance to compression therapy, epidemiology of lymphatic filariasis (LF), and economic benefit of integrative treatments of lymphedema. A robust research priority setting process, organized as described in James Lind Alliance guidebook, identified seven priority areas to achieve effective morbidity control of lymphedema including LF. All stake holders including Department of Health Research, Government of India, participated in the PSP.

Future Research Priorities for Morbidity Control of Lymphedema

PubMed Central

Narahari, S R; Aggithaya, Madhur Guruprasad; Moffatt, Christine; Ryan, T J; Keeley, Vaughan; Vijaya, B; Rajendran, P; Karalam, S B; Rajagopala, S; Kumar, N K; Bose, K S; Sushma, K V

2017-01-01

Background: Innovation in the treatment of lower extremity lymphedema has received low priority from the governments and pharmaceutical industry. Advancing lymphedema is irreversible and initiates fibrosis in the dermis, reactive changes in the epidermis and subcutis. Most medical treatments offered for lymphedema are either too demanding with a less than satisfactory response or patients have low concordance due to complex schedules. A priority setting partnership (PSP) was established to decide on the future priorities in lymphedema research. Methods: A table of abstracts following a literature search was published in workshop website. Stake holders were requested to upload their priorities. Their questions were listed, randomized, and sent to lymphologists for ranking. High ranked ten research priorities, obtained through median score, were presented in final prioritization work shop attended by invited stake holders. A free medical camp was organized during workshop to understand patients’ priorities. Results: One hundred research priorities were selected from priorities uploaded to website. Ten priorities were short listed through a peer review process involving 12 lymphologists, for final discussion. They were related to simplification of integrative treatment for lymphedema, cellular changes in lymphedema and mechanisms of its reversal, eliminating bacterial entry lesions to reduce cellulitis episodes, exploring evidence for therapies in traditional medicine, improving patient concordance to compression therapy, epidemiology of lymphatic filariasis (LF), and economic benefit of integrative treatments of lymphedema. Conclusion: A robust research priority setting process, organized as described in James Lind Alliance guidebook, identified seven priority areas to achieve effective morbidity control of lymphedema including LF. All stake holders including Department of Health Research, Government of India, participated in the PSP. PMID:28216723

Effect of Uncertainty on Deterministic Runway Scheduling

NASA Technical Reports Server (NTRS)

Gupta, Gautam; Malik, Waqar; Jung, Yoon C.

2012-01-01

Active runway scheduling involves scheduling departures for takeoffs and arrivals for runway crossing subject to numerous constraints. This paper evaluates the effect of uncertainty on a deterministic runway scheduler. The evaluation is done against a first-come- first-serve scheme. In particular, the sequence from a deterministic scheduler is frozen and the times adjusted to satisfy all separation criteria; this approach is tested against FCFS. The comparison is done for both system performance (throughput and system delay) and predictability, and varying levels of congestion are considered. The modeling of uncertainty is done in two ways: as equal uncertainty in availability at the runway as for all aircraft, and as increasing uncertainty for later aircraft. Results indicate that the deterministic approach consistently performs better than first-come-first-serve in both system performance and predictability.

Automatic Scheduling and Planning (ASAP) in future ground control systems

NASA Technical Reports Server (NTRS)

Matlin, Sam

1988-01-01

This report describes two complementary approaches to the problem of space mission planning and scheduling. The first is an Expert System or Knowledge-Based System for automatically resolving most of the activity conflicts in a candidate plan. The second is an Interactive Graphics Decision Aid to assist the operator in manually resolving the residual conflicts which are beyond the scope of the Expert System. The two system designs are consistent with future ground control station activity requirements, support activity timing constraints, resource limits and activity priority guidelines.

Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates

NASA Astrophysics Data System (ADS)

Bai, Danyu

2015-08-01

This paper discusses the flow shop scheduling problem to minimise the total quadratic completion time (TQCT) with release dates in offline and online environments. For this NP-hard problem, the investigation is focused on the performance of two online algorithms based on the Shortest Processing Time among Available jobs rule. Theoretical results indicate the asymptotic optimality of the algorithms as the problem scale is sufficiently large. To further enhance the quality of the original solutions, the improvement scheme is provided for these algorithms. A new lower bound with performance guarantee is provided, and computational experiments show the effectiveness of these heuristics. Moreover, several results of the single-machine TQCT problem with release dates are also obtained for the deduction of the main theorem.

[Immunisation schedule of the Spanish Association of Paediatrics: 2017 recommendations].

PubMed

Moreno-Pérez, David; Álvarez García, Francisco José; Arístegui Fernández, Javier; Cilleruelo Ortega, María José; Corretger Rauet, José María; García Sánchez, Nuria; Hernández Merino, Ángel; Hernández-Sampelayo Matos, Teresa; Merino Moína, Manuel; Ortigosa Del Castillo, Luis; Ruiz-Contreras, Jesús

2017-02-01

The Advisory Committee on Vaccines of the Spanish Association of Paediatrics (CAV- AEP) annually publishes the immunisation schedule which, in our opinion, is considered optimal for children resident in Spain, taking into account the evidence available on current vaccines. Pneumococcal and varicella immunisation in early childhood is already included in all funded vaccines present in the regional immunisation programmes. Furthermore, this committee establishes recommendations on vaccines not included in official calendars (non-funded immunisations), such as rotavirus, meningococcal B, and meningococcal ACWY. As regards funded immunisations, 2+1 strategy (2, 4, 11-12 months) with hexavalent (DTaP-IPV-Hib-HB) and 13-valent pneumococcal vaccines is recommended. Administration of the 6-year booster dose with DTaP is recommended, as well as a poliomyelitis dose for children who had received the 2+1 scheme, with the Tdap vaccine for adolescents and pregnant women between 27 and 32 weeks gestation. The two-dose scheme should be used for MMR (12 months and 2-4 years) and varicella (15 months and 2-4 years). Coverage of human papillomavirus vaccination in girls aged 12 with a two-dose scheme (0, 6 months) should be improved. Information and recommendations for male adolescents about potential beneficial effects of the tetravalent HPV vaccine should also be provided. ACWY meningococcal vaccine is the optimal choice in adolescents. For recommended unfunded immunisations, the CAV-AEP recommends the administration of meningococcal B vaccine, due to the current availability in Spanish community pharmacies, with a 3+1 scheme. CAV-AEP requests the incorporation of this vaccine in the funded unified schedule. Vaccination against rotavirus is recommended in all infants. Copyright © 2016 Asociación Española de Pediatría. Publicado por Elsevier España, S.L.U. All rights reserved.

Autonomous Hybrid Priority Queueing for Scheduling Residential Energy Demands

NASA Astrophysics Data System (ADS)

Kalimullah, I. Q.; Shamroukh, M.; Sahar, N.; Shetty, S.

2017-05-01

The advent of smart grid technologies has opened up opportunities to manage the energy consumption of the users within a residential smart grid system. Demand response management is particularly being employed to reduce the overall load on an electricity network which could in turn reduce outages and electricity costs. The objective of this paper is to develop an intelligible scheduler to optimize the energy available to a micro grid through hybrid queueing algorithm centered around the consumers’ energy demands. This is achieved by shifting certain schedulable load appliances to light load hours. Various factors such as the type of demand, grid load, consumers’ energy usage patterns and preferences are considered while formulating the logical constraints required for the algorithm. The algorithm thus obtained is then implemented in MATLAB workspace to simulate its execution by an Energy Consumption Scheduler (ECS) found within smart meters, which automatically finds the optimal energy consumption schedule tailor made to fit each consumer within the micro grid network.

Meta-RaPS Algorithm for the Aerial Refueling Scheduling Problem

NASA Technical Reports Server (NTRS)

Kaplan, Sezgin; Arin, Arif; Rabadi, Ghaith

2011-01-01

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on multiple tankers (machines). ARSP assumes that jobs have different release times and due dates, The total weighted tardiness is used to evaluate schedule's quality. Therefore, ARSP can be modeled as a parallel machine scheduling with release limes and due dates to minimize the total weighted tardiness. Since ARSP is NP-hard, it will be more appropriate to develop a pproimate or heuristic algorithm to obtain solutions in reasonable computation limes. In this paper, Meta-Raps-ATC algorithm is implemented to create high quality solutions. Meta-RaPS (Meta-heuristic for Randomized Priority Search) is a recent and promising meta heuristic that is applied by introducing randomness to a construction heuristic. The Apparent Tardiness Rule (ATC), which is a good rule for scheduling problems with tardiness objective, is used to construct initial solutions which are improved by an exchanging operation. Results are presented for generated instances.

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors.

PubMed

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-07-08

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction.

TRADOC Library and Information Network (TRALINET)

DTIC Science & Technology

1979-03-01

by the Library of Congress, Dewey materials that have beer photographically reduced Decimal , or any other classification scheme adopted in size for...sites at Forts Hood, TX; Gordon, GA; Monroe, VA; Knox, KY, and Leavenworth, KS. DTIC, formally Defense Documentation Center ( DDC ), serves as the primary...locally expanded subject schedules, whether schedules aic for Dewey , Library of Congress, etc., particularly in the are& of Military Arts and Sciences. 1 4

A Study on Real-Time Scheduling Methods in Holonic Manufacturing Systems

NASA Astrophysics Data System (ADS)

Iwamura, Koji; Taimizu, Yoshitaka; Sugimura, Nobuhiro

Recently, new architectures of manufacturing systems have been proposed to realize flexible control structures of the manufacturing systems, which can cope with the dynamic changes in the volume and the variety of the products and also the unforeseen disruptions, such as failures of manufacturing resources and interruptions by high priority jobs. They are so called as the autonomous distributed manufacturing system, the biological manufacturing system and the holonic manufacturing system. Rule-based scheduling methods were proposed and applied to the real-time production scheduling problems of the HMS (Holonic Manufacturing System) in the previous report. However, there are still remaining problems from the viewpoint of the optimization of the whole production schedules. New procedures are proposed, in the present paper, to select the production schedules, aimed at generating effective production schedules in real-time. The proposed methods enable the individual holons to select suitable machining operations to be carried out in the next time period. Coordination process among the holons is also proposed to carry out the coordination based on the effectiveness values of the individual holons.

U. S. fusion programs: Struggling to stay in the game

DOE Office of Scientific and Technical Information (OSTI.GOV)

Crawford, M.

Funding for the US fusion energy program has suffered and will probably continue to suffer major cuts. A committee hand-picked by Energy Secretary James Watkins urged the Department of Energy to mount an aggressive program to develop fusion power, but congress cut funding from $323 million in 1990 to $275 million in 1991. This portends dire conditions for fusion research and development. Projects to receive top priority are concerned with the tokamaks and to keep the next big machine, the Burning Plasma Experiment, scheduled for beginning of construction in 1993 on schedule. Secretary Watkins is said to want to keepmore » the International Thermonuclear Energy Reactor (ITER) on schedule. ITER would follow the Burning Plasma Experiment.« less

Surveying School Facilities Needs.

ERIC Educational Resources Information Center

Weichel, Harry J.; Dennell, James

1990-01-01

Ralston (Nebraska) Public School District's communitywide survey helped set school facilities priorities while keeping the district's finite resources firmly in mind. With an outline of maintenance costs for the next 10 years, the district can develop a strategic construction schedule. The board also has the option of financing projects through a…

Positive Change through a Credential Process

ERIC Educational Resources Information Center

Williams, Tinnycua

2018-01-01

Studies have demonstrated the significance of afterschool staff development and have attempted to show the impacts of staff training on program quality and youth outcomes. Professional development, though necessary, wasn't always a priority for the author, especially if training hours conflicted with the author's afterschool program schedule.…

Austin Community College Comprehensive Master Plan, 2000-2001.

ERIC Educational Resources Information Center

Austin Community Coll., TX.

This document describes Austin Community College's (Texas) educational academic plans, facilities plans, and financial implementation plans for 2000-2001. Plan goals and priorities include: (1) enhancing scheduling efficiency while responding to unmet student demand and community needs, and increasing enrollments by 3-5%; (2) opening two…

The role of support staff in promoting the social inclusion of persons with an intellectual disability.

PubMed

McConkey, R; Collins, S

2010-08-01

Past studies have found that people supported in more individualised housing options tend to have levels of community participation and wider social networks than those in other accommodation options. Yet, the contribution of support staff in facilitating social inclusion has received relatively scant attention. In all 245 staff working in either supported living schemes, or shared residential and group homes, or in day centres completed a written questionnaire in which they rated in terms of priority to their job, 16 tasks that were supportive of social inclusion and a further 16 tasks that related to the care of the person they supported. In addition staff identified those tasks that they considered were not appropriate to their job. Across all three service settings, staff rated more care tasks as having higher priority than they did the social inclusion tasks. However, staff in supported living schemes rated more social inclusion tasks as having high priority than did staff in the other two service settings. Equally the staff who were most inclined to rate social inclusion tasks as not being applicable to their job were those working day centres; female rather than male staff, those in front-line staff rather than senior staff, and those in part-time or relief positions rather than full-time posts. However, within each service settings, there were wide variations in how staff rated the social inclusion tasks. Staff working in more individualised support arrangements tend to give greater priority to promoting social inclusion although this can vary widely both across and within staff teams. Nonetheless, staff gave greater priority to care tasks especially in congregated service settings. Service managers may need to give more emphasis to social inclusion tasks and provide the leadership, training and resources to facilitate support staff to re-assess their priorities.

LPV Controller Interpolation for Improved Gain-Scheduling Control Performance

NASA Technical Reports Server (NTRS)

Wu, Fen; Kim, SungWan

2002-01-01

In this paper, a new gain-scheduling control design approach is proposed by combining LPV (linear parameter-varying) control theory with interpolation techniques. The improvement of gain-scheduled controllers can be achieved from local synthesis of Lyapunov functions and continuous construction of a global Lyapunov function by interpolation. It has been shown that this combined LPV control design scheme is capable of improving closed-loop performance derived from local performance improvement. The gain of the LPV controller will also change continuously across parameter space. The advantages of the newly proposed LPV control is demonstrated through a detailed AMB controller design example.

Scheduling for energy and reliability management on multiprocessor real-time systems

NASA Astrophysics Data System (ADS)

Qi, Xuan

Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.

A multipopulation PSO based memetic algorithm for permutation flow shop scheduling.

PubMed

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

Optimal Scheduling Method of Controllable Loads in DC Smart Apartment Building

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Toward an Autonomous Telescope Network: the TBT Scheduler

NASA Astrophysics Data System (ADS)

Racero, E.; Ibarra, A.; Ocaña, F.; de Lis, S. B.; Ponz, J. D.; Castillo, M.; Sánchez-Portal, M.

2015-09-01

Within the ESA SSA program, it is foreseen to deploy several robotic telescopes to provide surveillance and tracking services for hazardous objects. The TBT project will procure a validation platform for an autonomous optical observing system in a realistic scenario, consisting of two telescopes located in Spain and Australia, to collect representative test data for precursor SSA services. In this context, the planning and scheduling of the night consists of two software modules, the TBT Scheduler, that will allow the manual and autonomous planning of the night, and the control of the real-time response of the system, done by the RTS2 internal scheduler. The TBT Scheduler allocates tasks for both telescopes without human intervention. Every night it takes all the inputs needed and prepares the schedule following some predefined rules. The main purpose of the scheduler is the distribution of the time for follow-up of recently discovered targets and surveys. The TBT Scheduler considers the overall performance of the system, and combine follow-up with a priori survey strategies for both kind of objects. The strategy is defined according to the expected combined performance for both systems the upcoming night (weather, sky brightness, object accessibility and priority). Therefore, TBT Scheduler defines the global approach for the network and relies on the RTS2 internal scheduler for the final detailed distribution of tasks at each sensor.

Studies on Experimental Ontology and Knowledge Service Development in Bio-Environmental Engineering

NASA Astrophysics Data System (ADS)

Zhang, Yunliang

2018-01-01

The existing domain-related ontology and information service patterns are analyzed, and the main problems faced by the experimental scheme knowledge service were clarified. The ontology framework model for knowledge service of Bio-environmental Engineering was proposed from the aspects of experimental materials, experimental conditions and experimental instruments, and this ontology will be combined with existing knowledge organization systems to organize scientific and technological literatures, data and experimental schemes. With the similarity and priority calculation, it can improve the related domain research.

Report of the Terrestrial Bodies Science Working Group. Volume 3: Venus

NASA Technical Reports Server (NTRS)

Kaula, W. M.; Malin, M. C.; Masursky, H.; Pettengill, G.; Prinn, R.; Young, R. E.

1977-01-01

The science objectives of Pioneer Venus and future investigations of the planet are discussed. Concepts and payloads for proposed missions and the supporting research and technology required to obtain the desired measurements from space and Earth-based observations are examined, as well as mission priorities and schedules.

A Novel IEEE 802.15.4e DSME MAC for Wireless Sensor Networks

PubMed Central

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-01-01

IEEE 802.15.4e standard proposes Deterministic and Synchronous Multichannel Extension (DSME) mode for wireless sensor networks (WSNs) to support industrial, commercial and health care applications. In this paper, a new channel access scheme and beacon scheduling schemes are designed for the IEEE 802.15.4e enabled WSNs in star topology to reduce the network discovery time and energy consumption. In addition, a new dynamic guaranteed retransmission slot allocation scheme is designed for devices with the failure Guaranteed Time Slot (GTS) transmission to reduce the retransmission delay. To evaluate our schemes, analytical models are designed to analyze the performance of WSNs in terms of reliability, delay, throughput and energy consumption. Our schemes are validated with simulation and analytical results and are observed that simulation results well match with the analytical one. The evaluated results of our designed schemes can improve the reliability, throughput, delay, and energy consumptions significantly. PMID:28275216

A Novel IEEE 802.15.4e DSME MAC for Wireless Sensor Networks.

PubMed

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-01-16

IEEE 802.15.4e standard proposes Deterministic and Synchronous Multichannel Extension (DSME) mode for wireless sensor networks (WSNs) to support industrial, commercial and health care applications. In this paper, a new channel access scheme and beacon scheduling schemes are designed for the IEEE 802.15.4e enabled WSNs in star topology to reduce the network discovery time and energy consumption. In addition, a new dynamic guaranteed retransmission slot allocation scheme is designed for devices with the failure Guaranteed Time Slot (GTS) transmission to reduce the retransmission delay. To evaluate our schemes, analytical models are designed to analyze the performance of WSNs in terms of reliability, delay, throughput and energy consumption. Our schemes are validated with simulation and analytical results and are observed that simulation results well match with the analytical one. The evaluated results of our designed schemes can improve the reliability, throughput, delay, and energy consumptions significantly.

Beyond clinical priority: what matters when making operational decisions about emergency surgical queues?

PubMed

Fitzgerald, Anneke; Wu, Yong

2017-08-01

Objective This paper describes the perceptions of operating theatre staff in Australia and The Netherlands regarding the influence of logistical or operational reasons that may affect the scheduling of unplanned surgical cases. It is proposed that logistical or operational issues can influence the priority determination of queue position of surgical cases on the emergency waiting list. Methods A questionnaire was developed and conducted in 15 hospitals across The Netherlands and Australia, targeting anaesthetists, managers, nurses and surgeons. Statistical analyses revolved around these four professional groups. Six hypotheses were then developed and tested based on the responses collected from the participants. Results There were significant differences in perceptions of logistics delay factors across different professional groups when patients were waiting for unplanned surgery. There were also significant differences among different groups when setting logistical priority factors for planning and scheduling unplanned cases. The hypotheses tests confirm these differences, and the findings concur with the paradigmatic differences mentioned in the literature. These paradigmatic differences among the four professional groups may explain some of the tensions encountered when making decisions about scheduling emergency surgical queues, and therefore should be taken into consideration for management of operating theatres. Conclusions Queue positions of patients waiting for unplanned surgery, or emergency surgery, are determined by medical clinicians according to clinicians' indication of clinical priority. However, operating theatre managers are important in facilitating smooth operations when planning for emergency surgeries. It is necessary for surgeons to understand the logistical challenges faced by managers when requesting logistical priorities for their operations. What is known about the topic? Tensions exist about the efficient use of operating theatres and negotiating individual surgeon's demands, especially between surgeons and managers, because in many countries surgeons only work in the hospital and not for the hospital. What does this paper add? The present study examined the logistical effects on functionality and purports the notion that, while recognising the importance of clinical precedence, logistical factors influence queue order to ensure efficient use of operating theatre resources. What are the implications for practitioners? The results indicate that there are differences in the perceptions of healthcare professionals regarding the sequencing of emergency patients. These differences may lead to conflicts in the decision making process about triaging emergency or unplanned surgical cases. A clear understanding of the different perceptions of different functional groups may help address the conflicts that often arise in practice.

SciBox, an end-to-end automated science planning and commanding system

NASA Astrophysics Data System (ADS)

Choo, Teck H.; Murchie, Scott L.; Bedini, Peter D.; Steele, R. Josh; Skura, Joseph P.; Nguyen, Lillian; Nair, Hari; Lucks, Michael; Berman, Alice F.; McGovern, James A.; Turner, F. Scott

2014-01-01

SciBox is a new technology for planning and commanding science operations for Earth-orbital and planetary space missions. It has been incrementally developed since 2001 and demonstrated on several spaceflight projects. The technology has matured to the point that it is now being used to plan and command all orbital science operations for the MErcury Surface, Space ENvironment, GEochemistry, and Ranging (MESSENGER) mission to Mercury. SciBox encompasses the derivation of observing sequences from science objectives, the scheduling of those sequences, the generation of spacecraft and instrument commands, and the validation of those commands prior to uploading to the spacecraft. Although the process is automated, science and observing requirements are incorporated at each step by a series of rules and parameters to optimize observing opportunities, which are tested and validated through simulation and review. Except for limited special operations and tests, there is no manual scheduling of observations or construction of command sequences. SciBox reduces the lead time for operations planning by shortening the time-consuming coordination process, reduces cost by automating the labor-intensive processes of human-in-the-loop adjudication of observing priorities, reduces operations risk by systematically checking constraints, and maximizes science return by fully evaluating the trade space of observing opportunities to meet MESSENGER science priorities within spacecraft recorder, downlink, scheduling, and orbital-geometry constraints.

ARPANET Routing Algorithm Improvements. Volume 1

DTIC Science & Technology

1980-08-01

the currently active PROCESS (at the head of the scheduling list). TIME returns the time. PASSIVATE puts the CURRENT PROCESS to sleep , and wakes uD...Ccntract. Network buffer managemenL issues are discussed and a new buffer managemet scheme for f the ARPANET is designed. Logical addressing is discussed...and a design is given for a logical addressing scheme suitable for ARPANET or DIN II. The applicability of ARPANET Routing to DIN II is evaluaced. The

On Several Fundamental Problems of Optimization, Estimation, and Scheduling in Wireless Communications

NASA Astrophysics Data System (ADS)

Gao, Qian

For both the conventional radio frequency and the comparably recent optical wireless communication systems, extensive effort from the academia had been made in improving the network spectrum efficiency and/or reducing the error rate. To achieve these goals, many fundamental challenges such as power efficient constellation design, nonlinear distortion mitigation, channel training design, network scheduling and etc. need to be properly addressed. In this dissertation, novel schemes are proposed accordingly to deal with specific problems falling in category of these challenges. Rigorous proofs and analyses are provided for each of our work to make a fair comparison with the corresponding peer works to clearly demonstrate the advantages. The first part of this dissertation considers a multi-carrier optical wireless system employing intensity modulation (IM) and direct detection (DD). A block-wise constellation design is presented, which treats the DC-bias that conventionally used solely for biasing purpose as an information basis. Our scheme, we term it MSM-JDCM, takes advantage of the compactness of sphere packing in a higher dimensional space, and in turn power efficient constellations are obtained by solving an advanced convex optimization problem. Besides the significant power gains, the MSM-JDCM has many other merits such as being capable of mitigating nonlinear distortion by including a peak-to-power ratio (PAPR) constraint, minimizing inter-symbol-interference (ISI) caused by frequency-selective fading with a novel precoder designed and embedded, and further reducing the bit-error-rate (BER) by combining with an optimized labeling scheme. The second part addresses several optimization problems in a multi-color visible light communication system, including power efficient constellation design, joint pre-equalizer and constellation design, and modeling of different structured channels with cross-talks. Our novel constellation design scheme, termed CSK-Advanced, is compared with the conventional decoupled system with the same spectrum efficiency to demonstrate the power efficiency. Crucial lighting requirements are included as optimization constraints. To control non-linear distortion, the optical peak-to-average-power ratio (PAPR) of LEDs can be individually constrained. With a SVD-based pre-equalizer designed and employed, our scheme can achieve lower BER than counterparts applying zero-forcing (ZF) or linear minimum-mean-squared-error (LMMSE) based post-equalizers. Besides, a binary switching algorithm (BSA) is applied to improve BER performance. The third part looks into a problem of two-phase channel estimation in a relayed wireless network. The channel estimates in every phase are obtained by the linear minimum mean squared error (LMMSE) method. Inaccurate estimate of the relay to destination (RtD) channel in phase 1 could affect estimate of the source to relay (StR) channel in phase 2, which is made erroneous. We first derive a close-form expression for the averaged Bayesian mean-square estimation error (ABMSE) for both phase estimates in terms of the length of source and relay training slots, based on which an iterative searching algorithm is then proposed that optimally allocates training slots to the two phases such that estimation errors are balanced. Analysis shows how the ABMSE of the StD channel estimation varies with the lengths of relay training and source training slots, the relay amplification gain, and the channel prior information respectively. The last part deals with a transmission scheduling problem in a uplink multiple-input-multiple-output (MIMO) wireless network. Code division multiple access (CDMA) is assumed as a multiple access scheme and pseudo-random codes are employed for different users. We consider a heavy traffic scenario, in which each user always has packets to transmit in the scheduled time slots. If the relay is scheduled for transmission together with users, then it operates in a full-duplex mode, where the packets previously collected from users are transmitted to the destination while new packets are being collected from users. A novel expression of throughput is first derived and then used to develop a scheduling algorithm to maximize the throughput. Our full-duplex scheduling is compared with a half-duplex scheduling, random access, and time division multiple access (TDMA), and simulation results illustrate its superiority. Throughput gains due to employment of both MIMO and CDMA are observed.

Health Care Coverage Decision Making in Low- and Middle-Income Countries: Experiences from 25 Coverage Schemes.

PubMed

Gutierrez, Hialy; Shewade, Ashwini; Dai, Minghan; Mendoza-Arana, Pedro; Gómez-Dantés, Octavio; Jain, Nishant; Khonelidze, Irma; Nabyonga-Orem, Juliet; Saleh, Karima; Teerawattananon, Yot; Nishtar, Sania; Hornberger, John

2015-08-01

Lessons learned by countries that have successfully implemented coverage schemes for health services may be valuable for other countries, especially low- and middle-income countries (LMICs), which likewise are seeking to provide/expand coverage. The research team surveyed experts in population health management from LMICs for information on characteristics of health care coverage schemes and factors that influenced decision-making processes. The level of coverage provided by the different schemes varied. Nearly all the health care coverage schemes involved various representatives and stakeholders in their decision-making processes. Maternal and child health, cardiovascular diseases, cancer, and HIV were among the highest priorities guiding coverage development decisions. Evidence used to inform coverage decisions included medical literature, regional and global epidemiology, and coverage policies of other coverage schemes. Funding was the most commonly reported reason for restricting coverage. This exploratory study provides an overview of health care coverage schemes from participating LMICs and contributes to the scarce evidence base on coverage decision making. Sharing knowledge and experiences among LMICs can support efforts to establish systems for accessible, affordable, and equitable health care.

Bus accident analysis of routes with/without bus priority.

PubMed

Goh, Kelvin Chun Keong; Currie, Graham; Sarvi, Majid; Logan, David

2014-04-01

This paper summarises findings on road safety performance and bus-involved accidents in Melbourne along roads where bus priority measures had been applied. Results from an empirical analysis of the accident types revealed significant reduction in the proportion of accidents involving buses hitting stationary objects and vehicles, which suggests the effect of bus priority in addressing manoeuvrability issues for buses. A mixed-effects negative binomial (MENB) regression and back-propagation neural network (BPNN) modelling of bus accidents considering wider influences on accident rates at a route section level also revealed significant safety benefits when bus priority is provided. Sensitivity analyses done on the BPNN model showed general agreement in the predicted accident frequency between both models. The slightly better performance recorded by the MENB model results suggests merits in adopting a mixed effects modelling approach for accident count prediction in practice given its capability to account for unobserved location and time-specific factors. A major implication of this research is that bus priority in Melbourne's context acts to improve road safety and should be a major consideration for road management agencies when implementing bus priority and road schemes. Copyright © 2013 Elsevier Ltd. All rights reserved.

Particle swarm optimization based space debris surveillance network scheduling

NASA Astrophysics Data System (ADS)

Jiang, Hai; Liu, Jing; Cheng, Hao-Wen; Zhang, Yao

2017-02-01

The increasing number of space debris has created an orbital debris environment that poses increasing impact risks to existing space systems and human space flights. For the safety of in-orbit spacecrafts, we should optimally schedule surveillance tasks for the existing facilities to allocate resources in a manner that most significantly improves the ability to predict and detect events involving affected spacecrafts. This paper analyzes two criteria that mainly affect the performance of a scheduling scheme and introduces an artificial intelligence algorithm into the scheduling of tasks of the space debris surveillance network. A new scheduling algorithm based on the particle swarm optimization algorithm is proposed, which can be implemented in two different ways: individual optimization and joint optimization. Numerical experiments with multiple facilities and objects are conducted based on the proposed algorithm, and simulation results have demonstrated the effectiveness of the proposed algorithm.

Request-Driven Schedule Automation for the Deep Space Network

NASA Technical Reports Server (NTRS)

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

2010-01-01

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

Intelligent Transportation Systems/Commercial Vehicle Operations Project Plan For Commercial Vehicle Information Systems And Networks Electronic Data Interchange Standards Development And Deployment

DOT National Transportation Integrated Search

1996-12-02

THE PURPOSE OF THIS DOCUMENT IS TO PROVIDE INFORMATION ON THE PLANNING FOR THE DEVELOPMENT AND DEPLOYMENT OF EDI STANDARDS FOR COMMERCIAL VEHICLE INFORMATION SYSTEMS AND NETWORKS (CVISN). THE STATUS, PRIORITIES, AND SCHEDULES FOR THIS EFFORT ARE CONT...

Never Been KIST: Tor’s Congestion Management Blossoms with Kernel-Informed Socket Transport

DTIC Science & Technology

2014-08-01

when compared to vanilla Tor. Outline of Major Contributions: We outline our major contributions as follows: – in Section 3 we discuss improvements to...experiments. We tested vanilla Tor us- ing the default CircuitPriorityHalflife of 30, the global scheduling part of KIST (without enforcing the write limits

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors

PubMed Central

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-01-01

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction. PMID:27399722

Real-time design with peer tasks

NASA Technical Reports Server (NTRS)

Goforth, Andre; Howes, Norman R.; Wood, Jonathan D.; Barnes, Michael J.

1995-01-01

We introduce a real-time design methodology for large scale, distributed, parallel architecture, real-time systems (LDPARTS), as an alternative to those methods using rate or dead-line monotonic analysis. In our method the fundamental units of prioritization, work items, are domain specific objects with timing requirements (deadlines) found in user's specification. A work item consists of a collection of tasks of equal priority. Current scheduling theories are applied with artifact deadlines introduced by the designer whereas our method schedules work items to meet user's specification deadlines (sometimes called end-to-end deadlines). Our method supports these scheduling properties. Work item scheduling is based on domain specific importance instead of task level urgency and still meets as many user specification deadlines as can be met by scheduling tasks with respect to urgency. Second, the minimum (closest) on-line deadline that can be guaranteed for a work item of highest importance, scheduled at run time, is approximately the inverse of the throughput, measured in work items per second. Third, throughput is not degraded during overload and instead of resorting to task shedding during overload, the designer can specify which work items to shed. We prove these properties in a mathematical model.

Chip-set for quality of service support in passive optical networks

NASA Astrophysics Data System (ADS)

Ringoot, Edwin; Hoebeke, Rudy; Slabbinck, B. Hans; Verhaert, Michel

1998-10-01

In this paper the design of a chip-set for QoS provisioning in ATM-based Passive Optical Networks is discussed. The implementation of a general-purpose switch chip on the Optical Network Unit is presented, with focus on the design of the cell scheduling and buffer management logic. The cell scheduling logic supports `colored' grants, priority jumping and weighted round-robin scheduling. The switch chip offers powerful buffer management capabilities enabling the efficient support of GFR and UBR services. Multicast forwarding is also supported. In addition, the architecture of a MAC controller chip developed for a SuperPON access network is introduced. In particular, the permit scheduling logic and its implementation on the Optical Line Termination will be discussed. The chip-set enables the efficient support of services with different service requirements on the SuperPON. The permit scheduling logic built into the MAC controller chip in combination with the cell scheduling and buffer management capabilities of the switch chip can be used by network operators to offer guaranteed service performance to delay sensitive services, and to efficiently and fairly distribute any spare capacity to delay insensitive services.

Design of an All-Optical Network Based on LCoS Technologies

NASA Astrophysics Data System (ADS)

Cheng, Yuh-Jiuh; Shiau, Yhi

2016-06-01

In this paper, an all-optical network composed of the ROADMs (reconfigurable optical add-drop multiplexer), L2/L3 optical packet switches, and the fiber optical cross-connection for fiber scheduling and measurement based on LCoS (liquid crystal on silicon) technologies is proposed. The L2/L3 optical packet switches are designed with optical output buffers. Only the header of optical packets is converted to electronic signals to control the wavelength of input ports and the packet payloads can be transparently destined to their output ports. An optical output buffer is designed to queue the packets when more than one incoming packet should reach to the same destination output port. For preserving service-packet sequencing and fairness of routing sequence, a priority scheme and a round-robin algorithm are adopted at the optical output buffer. The wavelength of input ports is designed for routing incoming packets using LCoS technologies. Finally, the proposed OFS (optical flow switch) with input buffers can quickly transfer the big data to the output ports and the main purpose of the OFS is to reduce the number of wavelength reflections. The all-optical content delivery network is comprised of the OFSs for a large amount of audio and video data transmissions in the future.

Multi-time Scale Joint Scheduling Method Considering the Grid of Renewable Energy

NASA Astrophysics Data System (ADS)

Zhijun, E.; Wang, Weichen; Cao, Jin; Wang, Xin; Kong, Xiangyu; Quan, Shuping

2018-01-01

Renewable new energy power generation prediction error like wind and light, brings difficulties to dispatch the power system. In this paper, a multi-time scale robust scheduling method is set to solve this problem. It reduces the impact of clean energy prediction bias to the power grid by using multi-time scale (day-ahead, intraday, real time) and coordinating the dispatching power output of various power supplies such as hydropower, thermal power, wind power, gas power and. The method adopts the robust scheduling method to ensure the robustness of the scheduling scheme. By calculating the cost of the abandon wind and the load, it transforms the robustness into the risk cost and optimizes the optimal uncertainty set for the smallest integrative costs. The validity of the method is verified by simulation.

On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Watson, Jean-Paul

2005-06-01

In this paper, we analyze the relationship between pool maintenance schemes, long-term memory mechanisms, and search space structure, with the goal of placing metaheuristic design on a more concrete foundation.

A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

PubMed Central

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP. PMID:24453841

Incorporating Active Runway Crossings in Airport Departure Scheduling

NASA Technical Reports Server (NTRS)

Gupta, Gautam; Malik, Waqar; Jung, Yoon C.

2010-01-01

A mixed integer linear program is presented for deterministically scheduling departure and ar rival aircraft at airport runways. This method addresses different schemes of managing the departure queuing area by treating it as first-in-first-out queues or as a simple par king area where any available aircraft can take-off ir respective of its relative sequence with others. In addition, this method explicitly considers separation criteria between successive aircraft and also incorporates an optional prioritization scheme using time windows. Multiple objectives pertaining to throughput and system delay are used independently. Results indicate improvement over a basic first-come-first-serve rule in both system delay and throughput. Minimizing system delay results in small deviations from optimal throughput, whereas minimizing throughput results in large deviations in system delay. Enhancements for computational efficiency are also presented in the form of reformulating certain constraints and defining additional inequalities for better bounds.

A cognitive gateway-based spectrum sharing method in downlink round robin scheduling of LTE system

NASA Astrophysics Data System (ADS)

Deng, Hongyu; Wu, Cheng; Wang, Yiming

2017-07-01

A key technique of LTE is how to allocate efficiently the resource of radio spectrum. Traditional Round Robin (RR) scheduling scheme may lead to too many resource residues when allocating resources. When the number of users in the current transmission time interval (TTI) is not the greatest common divisor of resource block groups (RBGs), and such a phenomenon lasts for a long time, the spectrum utilization would be greatly decreased. In this paper, a novel spectrum allocation scheme of cognitive gateway (CG) was proposed, in which the LTE spectrum utilization and CG’s throughput were greatly increased by allocating idle resource blocks in the shared TTI in LTE system to CG. Our simulation results show that the spectrum resource sharing method can improve LTE spectral utilization and increase the CG’s throughput as well as network use time.

A hierarchically distributed architecture for fault isolation expert systems on the space station

NASA Technical Reports Server (NTRS)

Miksell, Steve; Coffer, Sue

1987-01-01

The Space Station Axiomatic Fault Isolating Expert Systems (SAFTIES) system deals with the hierarchical distribution of control and knowledge among independent expert systems doing fault isolation and scheduling of Space Station subsystems. On its lower level, fault isolation is performed on individual subsystems. These fault isolation expert systems contain knowledge about the performance requirements of their particular subsystem and corrective procedures which may be involved in repsonse to certain performance errors. They can control the functions of equipment in their system and coordinate system task schedules. On a higher level, the Executive contains knowledge of all resources, task schedules for all systems, and the relative priority of all resources and tasks. The executive can override any subsystem task schedule in order to resolve use conflicts or resolve errors that require resources from multiple subsystems. Interprocessor communication is implemented using the SAFTIES Communications Interface (SCI). The SCI is an application layer protocol which supports the SAFTIES distributed multi-level architecture.

A Clonal Selection Algorithm for Minimizing Distance Travel and Back Tracking of Automatic Guided Vehicles in Flexible Manufacturing System

NASA Astrophysics Data System (ADS)

Chawla, Viveak Kumar; Chanda, Arindam Kumar; Angra, Surjit

2018-03-01

The flexible manufacturing system (FMS) constitute of several programmable production work centers, material handling systems (MHSs), assembly stations and automatic storage and retrieval systems. In FMS, the automatic guided vehicles (AGVs) play a vital role in material handling operations and enhance the performance of the FMS in its overall operations. To achieve low makespan and high throughput yield in the FMS operations, it is highly imperative to integrate the production work centers schedules with the AGVs schedules. The Production schedule for work centers is generated by application of the Giffler and Thompson algorithm under four kind of priority hybrid dispatching rules. Then the clonal selection algorithm (CSA) is applied for the simultaneous scheduling to reduce backtracking as well as distance travel of AGVs within the FMS facility. The proposed procedure is computationally tested on the benchmark FMS configuration from the literature and findings from the investigations clearly indicates that the CSA yields best results in comparison of other applied methods from the literature.

Non-standard radiotherapy fractionations delay the time to malignant transformation of low-grade gliomas.

PubMed

Henares-Molina, Araceli; Benzekry, Sebastien; Lara, Pedro C; García-Rojo, Marcial; Pérez-García, Víctor M; Martínez-González, Alicia

2017-01-01

Grade II gliomas are slowly growing primary brain tumors that affect mostly young patients. Cytotoxic therapies (radiotherapy and/or chemotherapy) are used initially only for patients having a bad prognosis. These therapies are planned following the "maximum dose in minimum time" principle, i. e. the same schedule used for high-grade brain tumors in spite of their very different behavior. These tumors transform after a variable time into high-grade gliomas, which significantly decreases the patient's life expectancy. In this paper we study mathematical models describing the growth of grade II gliomas in response to radiotherapy. We find that protracted metronomic fractionations, i.e. therapeutical schedules enlarging the time interval between low-dose radiotherapy fractions, may lead to a better tumor control without an increase in toxicity. Other non-standard fractionations such as protracted or hypoprotracted schemes may also be beneficial. The potential survival improvement depends on the tumor's proliferation rate and can be even of the order of years. A conservative metronomic scheme, still being a suboptimal treatment, delays the time to malignant progression by at least one year when compared to the standard scheme.

Commercial Impact and Optimum Capacity Determination of Pumped Storage Hydro Plant for a Practical Power System

NASA Astrophysics Data System (ADS)

Latha, P. G.; Anand, S. R.; Imthias, Ahamed T. P.; Sreejith, P. S., Dr.

2013-06-01

This paper attempts to study the commercial impact of pumped storage hydro plant on the operation of a stressed power system. The paper further attempts to compute the optimum capacity of the pumped storage scheme that can be provided on commercial basis for a practical power system. Unlike the analysis of commercial aspects of pumped storage scheme attempted in several papers, this paper is presented from the point of view of power system management of a practical system considering the impact of the scheme on the economic operation of the system. A realistic case study is presented as the many factors that influence the pumped storage operation vary widely from one system to another. The suitability of pumped storage for the particular generation mix of a system is well explored in the paper. To substantiate the economic impact of pumped storage on the system, the problem is formulated as a short-term hydrothermal scheduling problem involving power purchase which optimizes the quantum of power to be scheduled and the duration of operation. The optimization model is formulated using an algebraic modeling language, AMPL, which is then solved using the advanced MILP solver CPLEX.

Online stochastic optimization of radiotherapy patient scheduling.

PubMed

Legrain, Antoine; Fortin, Marie-Andrée; Lahrichi, Nadia; Rousseau, Louis-Martin

2015-06-01

The effective management of a cancer treatment facility for radiation therapy depends mainly on optimizing the use of the linear accelerators. In this project, we schedule patients on these machines taking into account their priority for treatment, the maximum waiting time before the first treatment, and the treatment duration. We collaborate with the Centre Intégré de Cancérologie de Laval to determine the best scheduling policy. Furthermore, we integrate the uncertainty related to the arrival of patients at the center. We develop a hybrid method combining stochastic optimization and online optimization to better meet the needs of central planning. We use information on the future arrivals of patients to provide an accurate picture of the expected utilization of resources. Results based on real data show that our method outperforms the policies typically used in treatment centers.

Advanced Technology System Scheduling Governance Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ang, Jim; Carnes, Brian; Hoang, Thuc

In the fall of 2005, the Advanced Simulation and Computing (ASC) Program appointed a team to formulate a governance model for allocating resources and scheduling the stockpile stewardship workload on ASC capability systems. This update to the original document takes into account the new technical challenges and roles for advanced technology (AT) systems and the new ASC Program workload categories that must be supported. The goal of this updated model is to effectively allocate and schedule AT computing resources among all three National Nuclear Security Administration (NNSA) laboratories for weapons deliverables that merit priority on this class of resource. Themore » process outlined below describes how proposed work can be evaluated and approved for resource allocations while preserving high effective utilization of the systems. This approach will provide the broadest possible benefit to the Stockpile Stewardship Program (SSP).« less

Enumeration and extension of non-equivalent deterministic update schedules in Boolean networks.

PubMed

Palma, Eduardo; Salinas, Lilian; Aracena, Julio

2016-03-01

Boolean networks (BNs) are commonly used to model genetic regulatory networks (GRNs). Due to the sensibility of the dynamical behavior to changes in the updating scheme (order in which the nodes of a network update their state values), it is increasingly common to use different updating rules in the modeling of GRNs to better capture an observed biological phenomenon and thus to obtain more realistic models.In Aracena et al. equivalence classes of deterministic update schedules in BNs, that yield exactly the same dynamical behavior of the network, were defined according to a certain label function on the arcs of the interaction digraph defined for each scheme. Thus, the interaction digraph so labeled (update digraphs) encode the non-equivalent schemes. We address the problem of enumerating all non-equivalent deterministic update schedules of a given BN. First, we show that it is an intractable problem in general. To solve it, we first construct an algorithm that determines the set of update digraphs of a BN. For that, we use divide and conquer methodology based on the structural characteristics of the interaction digraph. Next, for each update digraph we determine a scheme associated. This algorithm also works in the case where there is a partial knowledge about the relative order of the updating of the states of the nodes. We exhibit some examples of how the algorithm works on some GRNs published in the literature. An executable file of the UpdateLabel algorithm made in Java and the files with the outputs of the algorithms used with the GRNs are available at: www.inf.udec.cl/ ∼lilian/UDE/ CONTACT: lilisalinas@udec.cl Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Update schemes of multi-velocity floor field cellular automaton for pedestrian dynamics

NASA Astrophysics Data System (ADS)

Luo, Lin; Fu, Zhijian; Cheng, Han; Yang, Lizhong

2018-02-01

Modeling pedestrian movement is an interesting problem both in statistical physics and in computational physics. Update schemes of cellular automaton (CA) models for pedestrian dynamics govern the schedule of pedestrian movement. Usually, different update schemes make the models behave in different ways, which should be carefully recalibrated. Thus, in this paper, we investigated the influence of four different update schemes, namely parallel/synchronous scheme, random scheme, order-sequential scheme and shuffled scheme, on pedestrian dynamics. The multi-velocity floor field cellular automaton (FFCA) considering the changes of pedestrians' moving properties along walking paths and heterogeneity of pedestrians' walking abilities was used. As for parallel scheme only, the collisions detection and resolution should be considered, resulting in a great difference from any other update schemes. For pedestrian evacuation, the evacuation time is enlarged, and the difference in pedestrians' walking abilities is better reflected, under parallel scheme. In face of a bottleneck, for example a exit, using a parallel scheme leads to a longer congestion period and a more dispersive density distribution. The exit flow and the space-time distribution of density and velocity have significant discrepancies under four different update schemes when we simulate pedestrian flow with high desired velocity. Update schemes may have no influence on pedestrians in simulation to create tendency to follow others, but sequential and shuffled update scheme may enhance the effect of pedestrians' familiarity with environments.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks.

PubMed

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-05

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

PubMed Central

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-01

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR. PMID:26742046

A real-time programming system.

PubMed

Townsend, H R

1979-03-01

The paper describes a Basic Operating and Scheduling System (BOSS) designed for a small computer. User programs are organised as self-contained modular 'processes' and the way in which the scheduler divides the time of the computer equally between them, while arranging for any process which has to respond to an interrupt from a peripheral device to be given the necessary priority, is described in detail. Next the procedures provided by the operating system to organise communication between processes are described, and how they are used to construct dynamically self-modifying real-time systems. Finally, the general philosophy of BOSS and applications to a multi-processor assembly are discussed.

Guiding New Product Idea Generation

ERIC Educational Resources Information Center

Park, Y.

2003-01-01

The creation of innovative ideas is the initial step in entrepreneurial practice and venture management. As the management of technology is now on the priority agenda of higher education institutions, there is a need to develop pedagogic schemes for idea generation. Despite its importance, the idea generation process is hard to systematize or to…

78 FR 75629 - Self-Regulatory Organizations; Miami International Securities Exchange LLC; Notice of Filing and...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-12

... Effectiveness of a Proposed Rule Change To Amend the MIAX Fee Schedule December 6, 2013. Pursuant to the... Priority Customer Rebate Program (the ``Program'') to (i) lower the volume thresholds of the four highest... thresholds in a month as described below. The volume thresholds are calculated based on the customer average...

78 FR 76339 - Self-Regulatory Organizations; International Securities Exchange, LLC; Notice of Filing and...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-17

... November 1, 2013 the Exchange further amended its Schedule of Fees to increase its Market Maker Plus rebate... Maker Plus and are affiliated with an Electronic Access Member that executes a total affiliated Priority Customer ADV of 200,000 contracts in a calendar month.\\4\\ When introducing this new Market Maker Plus...

KSC-02pd1894

NASA Image and Video Library

2002-12-09

KENNEDY SPACE CENTER, FLA. -- Space Shuttle Columbia sits on Launch Pad 39A, atop the Mobile Launcher Platform. The STS-107 research mission comprises experiments ranging from material sciences to life sciences, plus the Fast Reaction Experiments Enabling Science, Technology, Applications and Research (FREESTAR) that incorporates eight high priority secondary attached shuttle experiments. Mission STS-107 is scheduled to launch Jan. 16, 2003.

Temporal Traffic Dynamics Improve the Connectivity of Ad Hoc Cognitive Radio Networks

DTIC Science & Technology

2014-02-12

more packets to send, and are (re)born when they do. We could also consider this from a duty-cycling perspective: Nodes sleep and wake up...transmitting and receiving activities in the primary network in an intricate way, we obtain the MMD by considering a flooding scheme that tries every...consider the delay caused by scheduling, contention, or queuing. It can be shown that this flooding scheme gives us the MMD. We stress that flooding is used

Reliable gain-scheduled control of discrete-time systems and its application to CSTR model

NASA Astrophysics Data System (ADS)

Sakthivel, R.; Selvi, S.; Mathiyalagan, K.; Shi, Y.

2016-10-01

This paper is focused on reliable gain-scheduled controller design for a class of discrete-time systems with randomly occurring nonlinearities and actuator fault. Further, the nonlinearity in the system model is assumed to occur randomly according to a Bernoulli distribution with measurable time-varying probability in real time. The main purpose of this paper is to design a gain-scheduled controller by implementing a probability-dependent Lyapunov function and linear matrix inequality (LMI) approach such that the closed-loop discrete-time system is stochastically stable for all admissible randomly occurring nonlinearities. The existence conditions for the reliable controller is formulated in terms of LMI constraints. Finally, the proposed reliable gain-scheduled control scheme is applied on continuously stirred tank reactor model to demonstrate the effectiveness and applicability of the proposed design technique.

Dynamic Bandwidth Allocation with Effective Utilization of Polling Interval over WDM/TDM PON

NASA Astrophysics Data System (ADS)

Ni, Cuiping; Gan, Chaoqin; Gao, Ziyue

2014-12-01

WDM/TDM (wavelength-division multiplexing/time-division multiplexing) PON (passive optical network) appears to be an attractive solution for the next generation optical access networks. Dynamic bandwidth allocation (DBA) plays a crucial role in efficiently and fairly allocating the bandwidth among all users in WDM/TDM PON. In this paper, two dynamic bandwidth allocation schemes (DBA1 and DBA2) are proposed to eliminate the idle time of polling cycles (i.e. polling interval), improve bandwidth utilization and make full use of bandwidth resources. The two DBA schemes adjust the time slot of sending request information and make fair scheduling among users to achieve the effective utilization of polling interval in WDM/TDM PON. The simulation and theoretical analyses verify that the proposed schemes outperform the conventional DBA scheme. We also make comparisons between the two schemes in terms of bandwidth utilization and average packet delay to further demonstrate the effectiveness of the scheme of DBA2.

U.S. Geological Survey Library classification system

USGS Publications Warehouse

Sasscer, R. Scott

2000-01-01

The U.S. Geological Survey Library classification system has been designed for earth science libraries. It is a tool for assigning call numbers to earth science and allied pure science materials in order to collect these materials into related subject groups on the library shelves and arrange them alphabetically by author and title. The classification can be used as a retrieval system to access materials through the subject and geographic numbers.The classification scheme has been developed over the years since 1904 to meet the ever-changing needs of increased specialization and the development of new areas of research in the earth sciences. The system contains seven schedules: Subject scheduleGeological survey schedule Earth science periodical scheduleGovernment document periodical scheduleGeneral science periodical schedule Earth science map schedule Geographic schedule Introduction provides detailed instructions on the construction of call numbers for works falling into the framework of the classification schedules.The tables following the introduction can be quickly accessed through the use of the newly expanded subject index.The purpose of this publication is to provide the earth science community with a classification and retrieval system for earth science materials, to offer sufficient explanation of its structure and use, and to enable library staff and clientele to classify or access research materials in a library collection.

Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm

PubMed Central

Abdulhamid, Shafi’i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

2016-01-01

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques. PMID:27384239

Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm.

PubMed

Abdulhamid, Shafi'i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

2016-01-01

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Polychronopoulos, Constantine D.

1986-08-01

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

Experimental realization of a CMOS-compatible optical directed priority encoder using cascaded micro-ring resonators

NASA Astrophysics Data System (ADS)

Xiao, Huifu; Li, Dezhao; Liu, Zilong; Han, Xu; Chen, Wenping; Zhao, Ting; Tian, Yonghui; Yang, Jianhong

2018-03-01

In this paper, we propose and experimentally demonstrate an integrated optical device that can implement the logical function of priority encoding from a 4-bit electrical signal to a 2-bit optical signal. For the proof of concept, the thermo-optic modulation scheme is adopted to tune each micro-ring resonator (MRR). A monochromatic light with the working wavelength is coupled into the input port of the device through a lensed fiber, and the four input electrical logic signals regarded as pending encode signals are applied to the micro-heaters above four MRRs to control the working states of the optical switches. The encoding results are directed to the output ports in the form of light. At last, the logical function of priority encoding with an operation speed of 10 Kbps is demonstrated successfully.

Farmer Attitudes and Livestock Disease: Exploring Citizenship Behaviour and Peer Monitoring across Two BVD Control Schemes in the UK.

PubMed

Heffernan, Claire; Azbel-Jackson, Lena; Brownlie, Joe; Gunn, George

2016-01-01

The eradication of BVD in the UK is technically possible but appears to be socially untenable. The following study explored farmer attitudes to BVD control schemes in relation to advice networks and information sharing, shared aims and goals, motivation and benefits of membership, notions of BVD as a priority disease and attitudes toward regulation. Two concepts from the organisational management literature framed the study: citizenship behaviour where actions of individuals support the collective good (but are not explicitly recognised as such) and peer to peer monitoring (where individuals evaluate other's behaviour). Farmers from two BVD control schemes in the UK participated in the study: Orkney Livestock Association BVD Eradication Scheme and Norfolk and Suffolk Cattle Breeders Association BVD Eradication Scheme. In total 162 farmers participated in the research (109 in-scheme and 53 out of scheme). The findings revealed that group helping and information sharing among scheme members was low with a positive BVD status subject to social censure. Peer monitoring in the form of gossip with regard to the animal health status of other farms was high. Interestingly, farmers across both schemes supported greater regulation with regard to animal health, largely due to the mistrust of fellow farmers following voluntary disease control measures. While group cohesiveness varied across the two schemes, without continued financial inducements, longer-term sustainability is questionable.

Algorithm of composing the schedule of construction and installation works

NASA Astrophysics Data System (ADS)

Nehaj, Rustam; Molotkov, Georgij; Rudchenko, Ivan; Grinev, Anatolij; Sekisov, Aleksandr

2017-10-01

An algorithm for scheduling works is developed, in which the priority of the work corresponds to the total weight of the subordinate works, the vertices of the graph, and it is proved that for graphs of the tree type the algorithm is optimal. An algorithm is synthesized to reduce the search for solutions when drawing up schedules of construction and installation works, allocating a subset with the optimal solution of the problem of the minimum power, which is determined by the structure of its initial data and numerical values. An algorithm for scheduling construction and installation work is developed, taking into account the schedule for the movement of brigades, which is characterized by the possibility to efficiently calculate the values of minimizing the time of work performance by the parameters of organizational and technological reliability through the use of the branch and boundary method. The program of the computational algorithm was compiled in the MatLAB-2008 program. For the initial data of the matrix, random numbers were taken, uniformly distributed in the range from 1 to 100. It takes 0.5; 2.5; 7.5; 27 minutes to solve the problem. Thus, the proposed method for estimating the lower boundary of the solution is sufficiently accurate and allows efficient solution of the minimax task of scheduling construction and installation works.

Sequence and batch language programs and alarm-related ``C`` programs for the 242-A MCS. Revision 2

DOE Office of Scientific and Technical Information (OSTI.GOV)

Berger, J.F.

1995-03-01

A Distributive Process Control system was purchased by Project B-534, ``242-A Evaporator/Crystallizer Upgrades``. This control system, called the Monitor and Control System (MCS), was installed in the 242-A Evaporator located in the 200 East Area. The purpose of the MCS is to monitor and control the Evaporator and monitor a number of alarms and other signals from various Tank Farm facilities. Applications software for the MCS was developed by the Waste Treatment Systems Engineering (WTSE) group of Westinghouse. The standard displays and alarm scheme provide for control and monitoring, but do not directly indicate the signal location or depict themore » overall process. To do this, WTSE developed a second alarm scheme which uses special programs, annunciator keys, and process graphics. The special programs are written in two languages; Sequence and Batch Language (SABL), and ``C`` language. The WTSE-developed alarm scheme works as described below: SABL relates signals and alarms to the annunciator keys, called SKID keys. When an alarm occurs, a SABL program causes a SKID key to flash, and if the alarm is of yellow or white priority then a ``C`` program turns on an audible horn (the D/3 system uses a different audible horn for the red priority alarms). The horn and flashing key draws the attention of the operator.« less

Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems

PubMed Central

Xia, Feng; Ma, Longhua; Peng, Chen; Sun, Youxian; Dong, Jinxiang

2008-01-01

There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS) scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting cross-layer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An event-driven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN. PMID:27879934

Time Triggered Ethernet System Testing Means and Method

NASA Technical Reports Server (NTRS)

Smithgall, William Todd (Inventor); Hall, Brendan (Inventor); Varadarajan, Srivatsan (Inventor)

2014-01-01

Methods and apparatus are provided for evaluating the performance of a Time Triggered Ethernet (TTE) system employing Time Triggered (TT) communication. A real TTE system under test (SUT) having real input elements communicating using TT messages with output elements via one or more first TTE switches during a first time interval schedule established for the SUT. A simulation system is also provided having input simulators that communicate using TT messages via one or more second TTE switches with the same output elements during a second time interval schedule established for the simulation system. The first and second time interval schedules are off-set slightly so that messages from the input simulators, when present, arrive at the output elements prior to messages from the analogous real inputs, thereby having priority over messages from the real inputs and causing the system to operate based on the simulated inputs when present.

School Buildings in Greece: The Bioclimatic Challenge and a Photovoltaic Pilot Project

ERIC Educational Resources Information Center

Patargias, Panagiotis A.; Angela, Kalianou; Galanis, George; Vassilopoulou, Marina; Drosou, Maria; Protogeropoulos, Christos

2007-01-01

Greece's School Buildings Organisation (SBO) is developing bioclimatic pilot schemes which are yielding positive results. Bioclimatic action has been one of the principal priorities of Greek school infrastructure planning since 2004. Among the activities undertaken by SBO to use renewable energy sources in school buildings is a pilot project to…

Motion control of nonlinear gantry crane system via priority-based fitness scheme in firefly algorithm

NASA Astrophysics Data System (ADS)

Jaafar, Hazriq Izzuan; Latif, Norfaneysa Abd; Kassim, Anuar Mohamed; Abidin, Amar Faiz Zainal; Hussien, Sharifah Yuslinda Syed; Aras, Mohd Shahrieel Mohd

2015-05-01

Advanced manufacturing technology made Gantry Crane System (GCS) is one of the suitable heavy machinery transporters and frequently employed in handling with huge materials. The interconnection of trolley movement and payload oscillation has a technical impact which needs to be considered. Once the trolley moves to the desired position with high speed, this will induce undesirable's payload oscillation. This frequent unavoidable load swing causes an efficiency drop, load damages and even accidents. In this paper, a new control strategy of Firefly Algorithm (FA) will be developed to obtain five optimal controller parameters (PID and PD) via Priority-based Fitness Scheme (PFS). Combinations of these five parameters are utilized for controlling trolley movement and minimizing the angle of payload oscillation. This PFS is prioritized based on steady-state error (SSE), overshoot (OS) and settling time (Ts) according to the needs and circumstances. Lagrange equation will be chosen for modeling and simulation will be conducted by using related software. Simulation results show that the proposed control strategy is efficient to control the trolley movement to the desired position and minimize the angle of payload oscillation.

Science-based Region-of-Interest Image Compression

NASA Technical Reports Server (NTRS)

Wagstaff, K. L.; Castano, R.; Dolinar, S.; Klimesh, M.; Mukai, R.

2004-01-01

As the number of currently active space missions increases, so does competition for Deep Space Network (DSN) resources. Even given unbounded DSN time, power and weight constraints onboard the spacecraft limit the maximum possible data transmission rate. These factors highlight a critical need for very effective data compression schemes. Images tend to be the most bandwidth-intensive data, so image compression methods are particularly valuable. In this paper, we describe a method for prioritizing regions in an image based on their scientific value. Using a wavelet compression method that can incorporate priority information, we ensure that the highest priority regions are transmitted with the highest fidelity.

KSC-02pd0978

NASA Image and Video Library

2002-06-14

KENNEDY SPACE CENTER, FLA. - -- Columbia's payload bay doors are ready to be closed for mission STS-107. Installed inside are the Hitchhiker Bridge, a carrier for the Fast Reaction Experiments Enabling Science, Technology, Applications and Research (FREESTAR) that incorporates eight high priority secondary attached shuttle experiments, plus the SHI Research Double Module (SHI/RDM), also known as SPACEHAB. STS-107 is scheduled for launch July 19, 2001

Top Information Need Priorities of Older Adults Newly Diagnosed With Active Myeloma.

PubMed

Tariman, Joseph D; Doorenbos, Ardith; Schepp, Karen G; Singhal, Seema; Berry, Donna L

2015-01-01

Prioritizing patients' information needs maximizes efficiency. This study examined the information sources and priorities in a sample of older adults newly diagnosed with symptomatic myeloma requiring immediate therapy. An association analysis of whether information needs were influenced by sociodemographic variables such as age, gender, education, marital status, and income was also conducted. The Information Needs Questionnaire (INQ) and an investigator-developed interview schedule were administered to 20 older adults diagnosed with symptomatic myeloma during a 30- to 45-minute semistructured interview. We found that older adults newly diagnosed with symptomatic myeloma have different priorities of information needs when compared with younger patients diagnosed with various types of cancer. The top three priorities related to treatment, prognosis, and self-care. Sociodemographic variables did not influence the priorities of information needs among older adults with symptomatic myeloma. The Internet, physicians, family, and friends were among the top sources of information. Advanced practitioners in oncology should support and identify interventions that can enhance patients' learning process from these sources. Well poised to assist patients in searching credible and reliable Internet sources, advanced practitioners in oncology can provide patient education about different treatments and the impact of such treatments on prognosis (e.g., overall survival and likelihood of cure).

SOFIA's Choice: Automating the Scheduling of Airborne Observations

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Norvig, Peter (Technical Monitor)

1999-01-01

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.

Scheduling Randomly-Deployed Heterogeneous Video Sensor Nodes for Reduced Intrusion Detection Time

NASA Astrophysics Data System (ADS)

Pham, Congduc

This paper proposes to use video sensor nodes to provide an efficient intrusion detection system. We use a scheduling mechanism that takes into account the criticality of the surveillance application and present a performance study of various cover set construction strategies that take into account cameras with heterogeneous angle of view and those with very small angle of view. We show by simulation how a dynamic criticality management scheme can provide fast event detection for mission-critical surveillance applications by increasing the network lifetime and providing low stealth time of intrusions.

Efficient operation scheduling for adsorption chillers using predictive optimization-based control methods

NASA Astrophysics Data System (ADS)

Bürger, Adrian; Sawant, Parantapa; Bohlayer, Markus; Altmann-Dieses, Angelika; Braun, Marco; Diehl, Moritz

2017-10-01

Within this work, the benefits of using predictive control methods for the operation of Adsorption Cooling Machines (ACMs) are shown on a simulation study. Since the internal control decisions of series-manufactured ACMs often cannot be influenced, the work focuses on optimized scheduling of an ACM considering its internal functioning as well as forecasts for load and driving energy occurrence. For illustration, an assumed solar thermal climate system is introduced and a system model suitable for use within gradient-based optimization methods is developed. The results of a system simulation using a conventional scheme for ACM scheduling are compared to the results of a predictive, optimization-based scheduling approach for the same exemplary scenario of load and driving energy occurrence. The benefits of the latter approach are shown and future actions for application of these methods for system control are addressed.

A hybrid dynamic harmony search algorithm for identical parallel machines scheduling

NASA Astrophysics Data System (ADS)

Chen, Jing; Pan, Quan-Ke; Wang, Ling; Li, Jun-Qing

2012-02-01

In this article, a dynamic harmony search (DHS) algorithm is proposed for the identical parallel machines scheduling problem with the objective to minimize makespan. First, an encoding scheme based on a list scheduling rule is developed to convert the continuous harmony vectors to discrete job assignments. Second, the whole harmony memory (HM) is divided into multiple small-sized sub-HMs, and each sub-HM performs evolution independently and exchanges information with others periodically by using a regrouping schedule. Third, a novel improvisation process is applied to generate a new harmony by making use of the information of harmony vectors in each sub-HM. Moreover, a local search strategy is presented and incorporated into the DHS algorithm to find promising solutions. Simulation results show that the hybrid DHS (DHS_LS) is very competitive in comparison to its competitors in terms of mean performance and average computational time.

[Immunisation schedule of the Spanish Association of Paediatrics: 2018 recommendations].

PubMed

Moreno-Pérez, David; Álvarez García, Francisco José; Álvarez Aldeán, Javier; Cilleruelo Ortega, María José; Garcés Sánchez, María; García Sánchez, Nuria; Hernández Merino, Ángel; Méndez Hernández, María; Merino Moína, Manuel; Montesdeoca Melián, Abián; Ruiz-Contreras, Jesús

2018-01-01

The Advisory Committee on Vaccines of the Spanish Association of Paediatrics annually publishes the immunisation schedule considered optimal for children resident in Spain, according to available evidence on current vaccines. Regarding funded immunisations, 2+1 strategy (2, 4, 11-12 months) with hexavalent (DTPa-IPV-Hib-HB) and 13-valent pneumococcal vaccines are recommended. Administration of the 6-year booster dose with DTPa is recommended, and a poliomyelitis dose for children who had received the 2+1 scheme, as well as Tdap vaccine for adolescents and pregnant women in every pregnancy between 27 and 32 weeks' gestation. The two-dose scheme should be used for MMR (12 months and 2-4 years) and varicella (15 months and 2-4 years). MMRV vaccine could be applied as the second dose if available. Coverage of human papillomavirus vaccination in girls aged 12 with a two dose scheme (0, 6 months) should be improved. Information and recommendation for male adolescents about potential beneficial effects of this immunisation should be provided as well. The new 9 genotypes vaccine is now available, expanding the coverage for both gender. Regarding non-funded immunisations, Committee on Vaccines of the Spanish Association of Paediatrics recommends meningococcal B vaccination, with a 3+1 schedule, and requests to be included in the National Immunisation Program. Tetravalent meningococcal vaccine (MenACWY) is recommended to adolescents (14-18 years) who are going to live in countries with systematic vaccination against ACWY serogroups, and people >6 weeks of age with risk factors or travellers to countries with very high incidence. Vaccination against rotavirus is recommended in all infants. Copyright © 2017 Asociación Española de Pediatría. Publicado por Elsevier España, S.L.U. All rights reserved.

Runway Scheduling for Charlotte Douglas International Airport

NASA Technical Reports Server (NTRS)

Malik, Waqar A.; Lee, Hanbong; Jung, Yoon C.

2016-01-01

This paper describes the runway scheduler that was used in the 2014 SARDA human-in-the-loop simulations for CLT. The algorithm considers multiple runways and computes optimal runway times for departures and arrivals. In this paper, we plan to run additional simulation on the standalone MRS algorithm and compare the performance of the algorithm against a FCFS heuristic where aircraft avail of runway slots based on a priority given by their positions in the FCFS sequence. Several traffic scenarios corresponding to current day traffic level and demand profile will be generated. We also plan to examine the effect of increase in traffic level (1.2x and 1.5x) and observe trends in algorithm performance.

Scheduling periodic jobs that allow imprecise results

NASA Technical Reports Server (NTRS)

Chung, Jen-Yao; Liu, Jane W. S.; Lin, Kwei-Jay

1990-01-01

The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result. Applications are classified as type N and type C, according to undesirable effects of errors. The two workload models characterize the two types of applications. The optional parts of the tasks in an N job need not ever be completed. The resulting quality of each type-N job is measured in terms of the average error in the results over several consecutive periods. A class of preemptive, priority-driven algorithms that leads to feasible schedules with small average error is described and evaluated.

[Degree of sedation. Incidence of vomiting and time of postoperative sleep with 3 different oral administration schedules of hydroxyzine chlorhydrate and chloral hydrate].

PubMed

Díaz-Barriga, M G; Jackson-Herrerías, G

1990-01-01

In this paper a comparison of sedation effectiveness, vomiting incidence and postoperative sleeping time with three sedation schemes: Chloral hydrate exclusively, hidroxicine chlorhydrate the night before and 15 minutes before chloral hydrate administration and hidroxicine chlorhydrate 15 minutes before chloral hydrate. We find that there is no significant differences between these three sedation schemes in sedation, degree of postoperative sleeping time and vomiting incidence, therefore we can expect an effective sedation degree using any of these sedation methods.

Ephedrine QoS: An Antidote to Slow, Congested, Bufferless NoCs

PubMed Central

Fang, Juan; Yao, Zhicheng; Sui, Xiufeng; Bao, Yungang

2014-01-01

Datacenters consolidate diverse applications to improve utilization. However when multiple applications are colocated on such platforms, contention for shared resources like networks-on-chip (NoCs) can degrade the performance of latency-critical online services (high-priority applications). Recently proposed bufferless NoCs (Nychis et al.) have the advantages of requiring less area and power, but they pose challenges in quality-of-service (QoS) support, which usually relies on buffer-based virtual channels (VCs). We propose QBLESS, a QoS-aware bufferless NoC scheme for datacenters. QBLESS consists of two components: a routing mechanism (QBLESS-R) that can substantially reduce flit deflection for high-priority applications and a congestion-control mechanism (QBLESS-CC) that guarantees performance for high-priority applications and improves overall system throughput. We use trace-driven simulation to model a 64-core system, finding that, when compared to BLESS, a previous state-of-the-art bufferless NoC design, QBLESS, improves performance of high-priority applications by an average of 33.2% and reduces network-hops by an average of 42.8%. PMID:25250386

Torque blending and wheel slip control in EVs with in-wheel motors

NASA Astrophysics Data System (ADS)

de Castro, Ricardo; Araújo, Rui E.; Tanelli, Mara; Savaresi, Sergio M.; Freitas, Diamantino

2012-01-01

Among the many opportunities offered by electric vehicles (EVs), the design of power trains based on in-wheel electric motors represents, from the vehicle dynamics point of view, a very attractive prospect, mainly due to the torque-vectoring capabilities. However, this distributed propulsion also poses some practical challenges, owing to the constraints arising from motor installation in a confined space, to the increased unsprung mass weight and to the integration of the electric motor with the friction brakes. This last issue is the main theme of this work, which, in particular, focuses on the design of the anti-lock braking system (ABS). The proposed structure for the ABS is composed of a tyre slip controller, a wheel torque allocator and a braking supervisor. To address the slip regulation problem, an adaptive controller is devised, offering robustness to uncertainties in the tyre-road friction and featuring a gain-scheduling mechanism based on the vehicle velocity. Further, an optimisation framework is employed in the torque allocator to determine the optimal split between electric and friction brake torque based on energy performance metrics, actuator constraints and different actuators bandwidth. Finally, based on the EV working condition, the priorities of this allocation scheme are adapted by the braking supervisor unit. Simulation results obtained with the CarSim vehicle model, demonstrate the effectiveness of the overall approach.

Integrated optical 3D digital imaging based on DSP scheme

NASA Astrophysics Data System (ADS)

Wang, Xiaodong; Peng, Xiang; Gao, Bruce Z.

2008-03-01

We present a scheme of integrated optical 3-D digital imaging (IO3DI) based on digital signal processor (DSP), which can acquire range images independently without PC support. This scheme is based on a parallel hardware structure with aid of DSP and field programmable gate array (FPGA) to realize 3-D imaging. In this integrated scheme of 3-D imaging, the phase measurement profilometry is adopted. To realize the pipeline processing of the fringe projection, image acquisition and fringe pattern analysis, we present a multi-threads application program that is developed under the environment of DSP/BIOS RTOS (real-time operating system). Since RTOS provides a preemptive kernel and powerful configuration tool, with which we are able to achieve a real-time scheduling and synchronization. To accelerate automatic fringe analysis and phase unwrapping, we make use of the technique of software optimization. The proposed scheme can reach a performance of 39.5 f/s (frames per second), so it may well fit into real-time fringe-pattern analysis and can implement fast 3-D imaging. Experiment results are also presented to show the validity of proposed scheme.

Decentralized Real-Time Scheduling

DTIC Science & Technology

1990-08-01

must provide several alternative resource management policies, including FIFO and deadline queueing for shared resources that are not available. 5...When demand exceeds the supply of shared resources (even within a single switch), some calls cannot be completed. In that case, a call’s priority...associated chiefly with the need to manage resources in a timely and decentralized fashion. The Alpha programming model permits the convenient expression of

KSC-02pd1880

NASA Image and Video Library

2002-12-09

KENNEDY SPACE CENTER, FLA. - Space Shuttle Columbia is poised to begin rollout from the Vehicle Assembly Building to Launch Pad 39A. The STS-107 research mission comprises experiments ranging from material sciences to life sciences (many rats), plus the Fast Reaction Experiments Enabling Science, Technology, Applications and Research (FREESTAR) that incorporates eight high priority secondary attached shuttle experiments. Mission STS-107 is scheduled to launch Jan. 16, 2003.

[Vaccination schedule of the Spanish association of paediatrics: recommendations 2010].

PubMed

Marès Bermúdez, J; van Esso Arbolave, D; Arístegui Fernández, J; Ruiz Contreras, J; González Hachero, J; Merino Moína, M; Barrio Corrales, F; Alvarez García, F J; Cilleruelo Ortega, M J; Ortigosa Del Castillo, L; Moreno Pérez, D

2010-06-01

The Vaccine Advisory Committee of the Spanish Association of Paediatrics updates annually, the immunization schedule, taking into account epidemiological data, as well as evidence of the effectiveness and efficiency of vaccines. This vaccination schedule includes grades of recommendation. The committee has graded as universal vaccines those that all children should receive, as recommended those with a profile of universal vaccination in childhood and which are desirable that all children receive, but that can be prioritized based on resources for its public funding and for risk groups those targeting groups of people in situations of epidemiological risk. The Committee considers as a priority to achieve a common immunization schedule. The Committee reaffirms the recommendation to include pneumococcal vaccination in the routine vaccination schedule. Vaccination against varicella in the second year of life is an effective strategy and therefore a desirable goal. Vaccination against rotavirus is recommended for all infants given the morbidity and high burden on the health care system. The Committee adheres to the recommendations of the Interterritorial Council of the National Health Care System in reference to routine vaccination against HPV for all girls aged 11 to 14 years and stresses the need to vaccinate against influenza and hepatitis A all patients with risk factors for these diseases. Finally, it stresses the need to update incomplete immunization schedules using accelerated immunization schedules. Copyright 2010 Asociación Española de Pediatría. Published by Elsevier Espana. All rights reserved.

The TJO-OAdM Robotic Observatory: the scheduler

NASA Astrophysics Data System (ADS)

Colomé, Josep; Casteels, Kevin; Ribas, Ignasi; Francisco, Xavier

2010-07-01

The Joan Oró Telescope at the Montsec Astronomical Observatory (TJO - OAdM) is a small-class observatory working under completely unattended control, due to the isolation of the site. Robotic operation is mandatory for its routine use. The level of robotization of an observatory is given by its reliability in responding to environment changes and by the required human interaction due to possible alarms. These two points establish a level of human attendance to ensure low risk at any time. But there is another key point when deciding how the system performs as a robot: the capability to adapt the scheduled observation to actual conditions. The scheduler represents a fundamental element to fully achieve an intelligent response at any time. Its main task is the mid- and short-term time optimization and it has a direct effect on the scientific return achieved by the observatory. We present a description of the scheduler developed for the TJO - OAdM, which is separated in two parts. Firstly, a pre-scheduler that makes a temporary selection of objects from the available projects according to their possibility of observation. This process is carried out before the beginning of the night following different selection criteria. Secondly, a dynamic scheduler that is executed any time a target observation is complete and a new one must be scheduled. The latter enables the selection of the best target in real time according to actual environment conditions and the set of priorities.

Verifying Safety Messages Using Relative-Time and Zone Priority in Vehicular Ad Hoc Networks.

PubMed

Banani, Sam; Gordon, Steven; Thiemjarus, Surapa; Kittipiyakul, Somsak

2018-04-13

In high-density road networks, with each vehicle broadcasting multiple messages per second, the arrival rate of safety messages can easily exceed the rate at which digital signatures can be verified. Since not all messages can be verified, algorithms for selecting which messages to verify are required to ensure that each vehicle receives appropriate awareness about neighbouring vehicles. This paper presents a novel scheme to select important safety messages for verification in vehicular ad hoc networks (VANETs). The proposed scheme uses location and direction of the sender, as well as proximity and relative-time between vehicles, to reduce the number of irrelevant messages verified (i.e., messages from vehicles that are unlikely to cause an accident). Compared with other existing schemes, the analysis results show that the proposed scheme can verify messages from nearby vehicles with lower inter-message delay and reduced packet loss and thus provides high level of awareness of the nearby vehicles.

Reconciling global mammal prioritization schemes into a strategy.

PubMed

Rondinini, Carlo; Boitani, Luigi; Rodrigues, Ana S L; Brooks, Thomas M; Pressey, Robert L; Visconti, Piero; Baillie, Jonathan E M; Baisero, Daniele; Cabeza, Mar; Crooks, Kevin R; Di Marco, Moreno; Redford, Kent H; Andelman, Sandy A; Hoffmann, Michael; Maiorano, Luigi; Stuart, Simon N; Wilson, Kerrie A

2011-09-27

The huge conservation interest that mammals attract and the large datasets that have been collected on them have propelled a diversity of global mammal prioritization schemes, but no comprehensive global mammal conservation strategy. We highlight some of the potential discrepancies between the schemes presented in this theme issue, including: conservation of species or areas, reactive and proactive conservation approaches, conservation knowledge and action, levels of aggregation of indicators of trend and scale issues. We propose that recently collected global mammal data and many of the mammal prioritization schemes now available could be incorporated into a comprehensive global strategy for the conservation of mammals. The task of developing such a strategy should be coordinated by a super-partes, authoritative institution (e.g. the International Union for Conservation of Nature, IUCN). The strategy would facilitate funding agencies, conservation organizations and national institutions to rapidly identify a number of short-term and long-term global conservation priorities, and act complementarily to achieve them.

Verifying Safety Messages Using Relative-Time and Zone Priority in Vehicular Ad Hoc Networks

PubMed Central

Banani, Sam; Thiemjarus, Surapa; Kittipiyakul, Somsak

2018-01-01

In high-density road networks, with each vehicle broadcasting multiple messages per second, the arrival rate of safety messages can easily exceed the rate at which digital signatures can be verified. Since not all messages can be verified, algorithms for selecting which messages to verify are required to ensure that each vehicle receives appropriate awareness about neighbouring vehicles. This paper presents a novel scheme to select important safety messages for verification in vehicular ad hoc networks (VANETs). The proposed scheme uses location and direction of the sender, as well as proximity and relative-time between vehicles, to reduce the number of irrelevant messages verified (i.e., messages from vehicles that are unlikely to cause an accident). Compared with other existing schemes, the analysis results show that the proposed scheme can verify messages from nearby vehicles with lower inter-message delay and reduced packet loss and thus provides high level of awareness of the nearby vehicles. PMID:29652840

Optimal Resource Allocation for NOMA-TDMA Scheme with α-Fairness in Industrial Internet of Things.

PubMed

Sun, Yanjing; Guo, Yiyu; Li, Song; Wu, Dapeng; Wang, Bin

2018-05-15

In this paper, a joint non-orthogonal multiple access and time division multiple access (NOMA-TDMA) scheme is proposed in Industrial Internet of Things (IIoT), which allowed multiple sensors to transmit in the same time-frequency resource block using NOMA. The user scheduling, time slot allocation, and power control are jointly optimized in order to maximize the system α -fair utility under transmit power constraint and minimum rate constraint. The optimization problem is nonconvex because of the fractional objective function and the nonconvex constraints. To deal with the original problem, we firstly convert the objective function in the optimization problem into a difference of two convex functions (D.C.) form, and then propose a NOMA-TDMA-DC algorithm to exploit the global optimum. Numerical results show that the NOMA-TDMA scheme significantly outperforms the traditional orthogonal multiple access scheme in terms of both spectral efficiency and user fairness.

Hard real-time beam scheduler enables adaptive images in multi-probe systems

NASA Astrophysics Data System (ADS)

Tobias, Richard J.

2014-03-01

Real-time embedded-system concepts were adapted to allow an imaging system to responsively control the firing of multiple probes. Large-volume, operator-independent (LVOI) imaging would increase the diagnostic utility of ultrasound. An obstacle to this innovation is the inability of current systems to drive multiple transducers dynamically. Commercial systems schedule scanning with static lists of beams to be fired and processed; here we allow an imager to adapt to changing beam schedule demands, as an intelligent response to incoming image data. An example of scheduling changes is demonstrated with a flexible duplex mode two-transducer application mimicking LVOI imaging. Embedded-system concepts allow an imager to responsively control the firing of multiple probes. Operating systems use powerful dynamic scheduling algorithms, such as fixed priority preemptive scheduling. Even real-time operating systems lack the timing constraints required for ultrasound. Particularly for Doppler modes, events must be scheduled with sub-nanosecond precision, and acquired data is useless without this requirement. A successful scheduler needs unique characteristics. To get close to what would be needed in LVOI imaging, we show two transducers scanning different parts of a subjects leg. When one transducer notices flow in a region where their scans overlap, the system reschedules the other transducer to start flow mode and alter its beams to get a view of the observed vessel and produce a flow measurement. The second transducer does this in a focused region only. This demonstrates key attributes of a successful LVOI system, such as robustness against obstructions and adaptive self-correction.

Surgery scheduling optimization considering real life constraints and comprehensive operation cost of operating room.

PubMed

Xiang, Wei; Li, Chong

2015-01-01

Operating Room (OR) is the core sector in hospital expenditure, the operation management of which involves a complete three-stage surgery flow, multiple resources, prioritization of the various surgeries, and several real-life OR constraints. As such reasonable surgery scheduling is crucial to OR management. To optimize OR management and reduce operation cost, a short-term surgery scheduling problem is proposed and defined based on the survey of the OR operation in a typical hospital in China. The comprehensive operation cost is clearly defined considering both under-utilization and overutilization. A nested Ant Colony Optimization (nested-ACO) incorporated with several real-life OR constraints is proposed to solve such a combinatorial optimization problem. The 10-day manual surgery schedules from a hospital in China are compared with the optimized schedules solved by the nested-ACO. Comparison results show the advantage using the nested-ACO in several measurements: OR-related time, nurse-related time, variation in resources' working time, and the end time. The nested-ACO considering real-life operation constraints such as the difference between first and following case, surgeries priority, and fixed nurses in pre/post-operative stage is proposed to solve the surgery scheduling optimization problem. The results clearly show the benefit of using the nested-ACO in enhancing the OR management efficiency and minimizing the comprehensive overall operation cost.

Remote Energy Monitoring System via Cellular Network

NASA Astrophysics Data System (ADS)

Yunoki, Shoji; Tamaki, Satoshi; Takada, May; Iwaki, Takashi

Recently, improvement on power saving and cost efficiency by monitoring the operation status of various facilities over the network has gained attention. Wireless network, especially cellular network, has advantage in mobility, coverage, and scalability. On the other hand, it has disadvantage of low reliability, due to rapid changes in the available bandwidth. We propose a transmission control scheme based on data priority and instantaneous available bandwidth to realize a highly reliable remote monitoring system via cellular network. We have developed our proposed monitoring system and evaluated the effectiveness of our scheme, and proved it reduces the maximum transmission delay of sensor status to 1/10 compared to best effort transmission.

White Paper on studying the safety of the childhood immunization schedule in the Vaccine Safety Datalink.

PubMed

Glanz, Jason M; Newcomer, Sophia R; Jackson, Michael L; Omer, Saad B; Bednarczyk, Robert A; Shoup, Jo Ann; DeStefano, Frank; Daley, Matthew F

2016-02-15

While the large majority of parents in the U.S. vaccinate their children according to the recommended immunization schedule, some parents have refused or delayed vaccinating, often citing safety concerns. In response to public concern, the U.S. Institute of Medicine (IOM) evaluated existing research regarding the safety of the recommended immunization schedule. The IOM concluded that although available evidence strongly supported the safety of the currently recommended schedule as a whole, additional observational research was warranted to compare health outcomes between fully vaccinated children and those on a delayed or alternative schedule. In addition, the IOM identified the Vaccine Safety Datalink (VSD) as an important resource for conducting this research. Guided by the IOM findings, the Centers for Disease Control and Prevention (CDC) commissioned a White Paper to assess how the VSD could be used to study the safety of the childhood immunization schedule. Guided by subject matter expert engagement, the resulting White Paper outlines a 4 stage approach for identifying exposure groups of undervaccinated children, presents a list of health outcomes of highest priority to examine in this context, and describes various study designs and statistical methods that could be used to analyze the safety of the schedule. While it appears feasible to study the safety of the recommended immunization schedule in settings such as the VSD, these studies will be inherently complex, and as with all observational studies, will need to carefully address issues of confounding and bias. In light of these considerations, decisions about conducting studies of the safety of the schedule will also need to assess epidemiological evidence of potential adverse events that could be related to the schedule, the biological plausibility of an association between an adverse event and the schedule, and public concern about the safety of the schedule. Copyright © 2015 Elsevier Ltd. All rights reserved.

Pilot Interactions in an Over-Constrained Conflict Scenario as Studied in a Piloted Simulation of Autonomous Aircraft Operations

NASA Technical Reports Server (NTRS)

Wing, David J.; Barhydt, Richard; Barmore, Bryan; Krishnamurthy, Karthik

2003-01-01

Feasibility and safety of autonomous aircraft operations were studied in a multi-piloted simulation of overconstrained traffic conflicts to determine the need for, and utility of, priority flight rules to maintain safety in this extraordinary and potentially hazardous situation. An overconstrained traffic conflict is one in which the separation assurance objective is incompatible with other objectives. In addition, a proposed scheme for implementing priority flight rules by staggering the alerting time between the two aircraft in conflict was tested for effectiveness. The feasibility study was conducted through a simulation in the Air Traffic Operations Laboratory at the NASA Langley Research Center. This research activity is a continuation of the Distributed Air-Ground Traffic Management feasibility analysis reported in the 4th USA/Europe Air Traffic Management R&D Seminar in December 2001 (paper #48). The over-constrained conflict scenario studied here consisted of two piloted aircraft that were assigned an identical en-route waypoint arrival time and altitude crossing restriction. The simulation results indicated that the pilots safely resolved the conflict without the need for a priority flight rule system. Occurrences of unnecessary maneuvering near the common waypoint were traced to false conflict alerts, generated as the result of including waypoint constraint information in the broadcast data link message issued from each aircraft. This result suggests that, in the conservative interests of safety, broadcast intent information should be based on the commanded trajectory and not on the Flight Management System flight plan, to which the aircraft may not actually adhere. The use of priority flight rules had no effect on the percentage of the aircraft population meeting completely predictable which aircraft in a given pair would meet the constraints and which aircraft would make the first maneuver to yield right-of-way. Therefore, the proposed scheme for implementing priority flight rules through staggering the alerting time between the two aircraft was completely effective. The data and observations from this experiment, together with results from the previously reported study, support the feasibility of autonomous aircraft operations.

Estimates of the absolute error and a scheme for an approximate solution to scheduling problems

NASA Astrophysics Data System (ADS)

Lazarev, A. A.

2009-02-01

An approach is proposed for estimating absolute errors and finding approximate solutions to classical NP-hard scheduling problems of minimizing the maximum lateness for one or many machines and makespan is minimized. The concept of a metric (distance) between instances of the problem is introduced. The idea behind the approach is, given the problem instance, to construct another instance for which an optimal or approximate solution can be found at the minimum distance from the initial instance in the metric introduced. Instead of solving the original problem (instance), a set of approximating polynomially/pseudopolynomially solvable problems (instances) are considered, an instance at the minimum distance from the given one is chosen, and the resulting schedule is then applied to the original instance.

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

PubMed

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

2014-01-01

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

Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

PubMed Central

2014-01-01

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

Scheduled Relaxation Jacobi method: Improvements and applications

NASA Astrophysics Data System (ADS)

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

2016-09-01

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

A DAG Scheduling Scheme on Heterogeneous Computing Systems Using Tuple-Based Chemical Reaction Optimization

PubMed Central

Jiang, Yuyi; Shao, Zhiqing; Guo, Yi

2014-01-01

A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution is considered to be NP-complete. This paper proposed a tuple molecular structure-based chemical reaction optimization (TMSCRO) method for DAG scheduling on heterogeneous computing systems, based on a very recently proposed metaheuristic method, chemical reaction optimization (CRO). Comparing with other CRO-based algorithms for DAG scheduling, the design of tuple reaction molecular structure and four elementary reaction operators of TMSCRO is more reasonable. TMSCRO also applies the concept of constrained critical paths (CCPs), constrained-critical-path directed acyclic graph (CCPDAG) and super molecule for accelerating convergence. In this paper, we have also conducted simulation experiments to verify the effectiveness and efficiency of TMSCRO upon a large set of randomly generated graphs and the graphs for real world problems. PMID:25143977

A DAG scheduling scheme on heterogeneous computing systems using tuple-based chemical reaction optimization.

PubMed

Jiang, Yuyi; Shao, Zhiqing; Guo, Yi

2014-01-01

A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution is considered to be NP-complete. This paper proposed a tuple molecular structure-based chemical reaction optimization (TMSCRO) method for DAG scheduling on heterogeneous computing systems, based on a very recently proposed metaheuristic method, chemical reaction optimization (CRO). Comparing with other CRO-based algorithms for DAG scheduling, the design of tuple reaction molecular structure and four elementary reaction operators of TMSCRO is more reasonable. TMSCRO also applies the concept of constrained critical paths (CCPs), constrained-critical-path directed acyclic graph (CCPDAG) and super molecule for accelerating convergence. In this paper, we have also conducted simulation experiments to verify the effectiveness and efficiency of TMSCRO upon a large set of randomly generated graphs and the graphs for real world problems.

Resource planning and scheduling of payload for satellite with particle swarm optimization

NASA Astrophysics Data System (ADS)

Li, Jian; Wang, Cheng

2007-11-01

The resource planning and scheduling technology of payload is a key technology to realize an automated control for earth observing satellite with limited resources on satellite, which is implemented to arrange the works states of various payloads to carry out missions by optimizing the scheme of the resources. The scheduling task is a difficult constraint optimization problem with various and mutative requests and constraints. Based on the analysis of the satellite's functions and the payload's resource constraints, a proactive planning and scheduling strategy based on the availability of consumable and replenishable resources in time-order is introduced along with dividing the planning and scheduling period to several pieces. A particle swarm optimization algorithm is proposed to address the problem with an adaptive mutation operator selection, where the swarm is divided into groups with different probabilities to employ various mutation operators viz., differential evolution, Gaussian and random mutation operators. The probabilities are adjusted adaptively by comparing the effectiveness of the groups to select a proper operator. The simulation results have shown the feasibility and effectiveness of the method.

Asymptotic analysis of SPTA-based algorithms for no-wait flow shop scheduling problem with release dates.

PubMed

Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

2014-01-01

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms.

Design and scheduling for periodic concurrent error detection and recovery in processor arrays

NASA Technical Reports Server (NTRS)

Wang, Yi-Min; Chung, Pi-Yu; Fuchs, W. Kent

1992-01-01

Periodic application of time-redundant error checking provides the trade-off between error detection latency and performance degradation. The goal is to achieve high error coverage while satisfying performance requirements. We derive the optimal scheduling of checking patterns in order to uniformly distribute the available checking capability and maximize the error coverage. Synchronous buffering designs using data forwarding and dynamic reconfiguration are described. Efficient single-cycle diagnosis is implemented by error pattern analysis and direct-mapped recovery cache. A rollback recovery scheme using start-up control for local recovery is also presented.

Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates

PubMed Central

Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

2014-01-01

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms. PMID:24764774

Real-time control systems: feedback, scheduling and robustness

NASA Astrophysics Data System (ADS)

Simon, Daniel; Seuret, Alexandre; Sename, Olivier

2017-08-01

The efficient control of real-time distributed systems, where continuous components are governed through digital devices and communication networks, needs a careful examination of the constraints arising from the different involved domains inside co-design approaches. Thanks to the robustness of feedback control, both new control methodologies and slackened real-time scheduling schemes are proposed beyond the frontiers between these traditionally separated fields. A methodology to design robust aperiodic controllers is provided, where the sampling interval is considered as a control variable of the system. Promising experimental results are provided to show the feasibility and robustness of the approach.

Approximate Synchrony: An Abstraction for Distributed Almost Synchronous Systems

DTIC Science & Technology

2015-05-29

finding bugs. Verification of the TSCH Protocol. Time Synchronized Channel Hopping (TSCH) is a Medium Access Control scheme that enables low power...allotted by the schedule and remain in sleep mode otherwise. In the ab- sence of precise time-synchronization, the time-slots across nodes would not be

Curriculum Study Report, June 1992.

ERIC Educational Resources Information Center

Cohen, Arthur M.

In 1992, the Center for the Study of Community Colleges (CSCC) in California examined the liberal arts curriculum in community colleges nationwide through a random sampling of 164 community colleges. Using spring 1991 catalogs and class schedules, course sections in the liberal arts were counted and tallied according to a coding scheme developed…

A lock-free priority queue design based on multi-dimensional linked lists

DOE PAGES

Dechev, Damian; Zhang, Deli

2015-04-03

The throughput of concurrent priority queues is pivotal to multiprocessor applications such as discrete event simulation, best-first search and task scheduling. Existing lock-free priority queues are mostly based on skiplists, which probabilistically create shortcuts in an ordered list for fast insertion of elements. The use of skiplists eliminates the need of global rebalancing in balanced search trees and ensures logarithmic sequential search time on average, but the worst-case performance is linear with respect to the input size. In this paper, we propose a quiescently consistent lock-free priority queue based on a multi-dimensional list that guarantees worst-case search time of O(logN)more » for key universe of size N. The novel multi-dimensional list (MDList) is composed of nodes that contain multiple links to child nodes arranged by their dimensionality. The insertion operation works by first injectively mapping the scalar key to a high-dimensional vector, then uniquely locating the target position by using the vector as coordinates. Nodes in MDList are ordered by their coordinate prefixes and the ordering property of the data structure is readily maintained during insertion without rebalancing nor randomization. Furthermore, in our experimental evaluation using a micro-benchmark, our priority queue achieves an average of 50% speedup over the state of the art approaches under high concurrency.« less

A lock-free priority queue design based on multi-dimensional linked lists

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dechev, Damian; Zhang, Deli

The throughput of concurrent priority queues is pivotal to multiprocessor applications such as discrete event simulation, best-first search and task scheduling. Existing lock-free priority queues are mostly based on skiplists, which probabilistically create shortcuts in an ordered list for fast insertion of elements. The use of skiplists eliminates the need of global rebalancing in balanced search trees and ensures logarithmic sequential search time on average, but the worst-case performance is linear with respect to the input size. In this paper, we propose a quiescently consistent lock-free priority queue based on a multi-dimensional list that guarantees worst-case search time of O(logN)more » for key universe of size N. The novel multi-dimensional list (MDList) is composed of nodes that contain multiple links to child nodes arranged by their dimensionality. The insertion operation works by first injectively mapping the scalar key to a high-dimensional vector, then uniquely locating the target position by using the vector as coordinates. Nodes in MDList are ordered by their coordinate prefixes and the ordering property of the data structure is readily maintained during insertion without rebalancing nor randomization. Furthermore, in our experimental evaluation using a micro-benchmark, our priority queue achieves an average of 50% speedup over the state of the art approaches under high concurrency.« less

Advanced turboprop testbed systems study. Volume 1: Testbed program objectives and priorities, drive system and aircraft design studies, evaluation and recommendations and wind tunnel test plans

NASA Technical Reports Server (NTRS)

Bradley, E. S.; Little, B. H.; Warnock, W.; Jenness, C. M.; Wilson, J. M.; Powell, C. W.; Shoaf, L.

1982-01-01

The establishment of propfan technology readiness was determined and candidate drive systems for propfan application were identified. Candidate testbed aircraft were investigated for testbed aircraft suitability and four aircraft selected as possible propfan testbed vehicles. An evaluation of the four candidates was performed and the Boeing KC-135A and the Gulfstream American Gulfstream II recommended as the most suitable aircraft for test application. Conceptual designs of the two recommended aircraft were performed and cost and schedule data for the entire testbed program were generated. The program total cost was estimated and a wind tunnel program cost and schedule is generated in support of the testbed program.

Aerial Refueling Process Rescheduling Under Job Related Disruptions

NASA Technical Reports Server (NTRS)

Kaplan, Sezgin; Rabadi, Ghaith

2011-01-01

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on the multiple tankers (machines) to minimize the total weighted tardiness. ARSP assumes that the jobs have different release times and due dates. The ARSP is dynamic environment and unexpected events may occur. In this paper, rescheduling in the aerial refueling process with a time set of jobs will be studied to deal with job related disruptions such as the arrival of new jobs, the departure of an existing job, high deviations in the release times and changes in job priorities. In order to keep the stability and to avoid excessive computation, partial schedule repair algorithm is developed and its preliminary results are presented.

Threats from urban expansion, agricultural transformation and forest loss on global conservation priority areas.

PubMed

Veach, Victoria; Moilanen, Atte; Di Minin, Enrico

2017-01-01

Including threats in spatial conservation prioritization helps identify areas for conservation actions where biodiversity is at imminent risk of extinction. At the global level, an important limitation when identifying spatial priorities for conservation actions is the lack of information on the spatial distribution of threats. Here, we identify spatial conservation priorities under three prominent threats to biodiversity (residential and commercial development, agricultural expansion, and forest loss), which are primary drivers of habitat loss and threaten the persistence of the highest number of species in the International Union for the Conservation of Nature (IUCN) Red List, and for which spatial data is available. We first explore how global priority areas for the conservation of vertebrate (mammals, birds, and amphibians) species coded in the Red List as vulnerable to each threat differ spatially. We then identify spatial conservation priorities for all species vulnerable to all threats. Finally, we identify the potentially most threatened areas by overlapping the identified priority areas for conservation with maps for each threat. We repeat the same with four other well-known global conservation priority area schemes, namely Key Biodiversity Areas, Biodiversity Hotspots, the global Protected Area Network, and Wilderness Areas. We find that residential and commercial development directly threatens only about 4% of the global top 17% priority areas for species vulnerable under this threat. However, 50% of the high priority areas for species vulnerable to forest loss overlap with areas that have already experienced some forest loss. Agricultural expansion overlapped with ~20% of high priority areas. Biodiversity Hotspots had the greatest proportion of their total area under direct threat from all threats, while expansion of low intensity agriculture was found to pose an imminent threat to Wilderness Areas under future agricultural expansion. Our results identify areas where limited resources should be allocated to mitigate risks to vertebrate species from habitat loss.

Threats from urban expansion, agricultural transformation and forest loss on global conservation priority areas

PubMed Central

Moilanen, Atte; Di Minin, Enrico

2017-01-01

Including threats in spatial conservation prioritization helps identify areas for conservation actions where biodiversity is at imminent risk of extinction. At the global level, an important limitation when identifying spatial priorities for conservation actions is the lack of information on the spatial distribution of threats. Here, we identify spatial conservation priorities under three prominent threats to biodiversity (residential and commercial development, agricultural expansion, and forest loss), which are primary drivers of habitat loss and threaten the persistence of the highest number of species in the International Union for the Conservation of Nature (IUCN) Red List, and for which spatial data is available. We first explore how global priority areas for the conservation of vertebrate (mammals, birds, and amphibians) species coded in the Red List as vulnerable to each threat differ spatially. We then identify spatial conservation priorities for all species vulnerable to all threats. Finally, we identify the potentially most threatened areas by overlapping the identified priority areas for conservation with maps for each threat. We repeat the same with four other well-known global conservation priority area schemes, namely Key Biodiversity Areas, Biodiversity Hotspots, the global Protected Area Network, and Wilderness Areas. We find that residential and commercial development directly threatens only about 4% of the global top 17% priority areas for species vulnerable under this threat. However, 50% of the high priority areas for species vulnerable to forest loss overlap with areas that have already experienced some forest loss. Agricultural expansion overlapped with ~20% of high priority areas. Biodiversity Hotspots had the greatest proportion of their total area under direct threat from all threats, while expansion of low intensity agriculture was found to pose an imminent threat to Wilderness Areas under future agricultural expansion. Our results identify areas where limited resources should be allocated to mitigate risks to vertebrate species from habitat loss. PMID:29182662

Solute concentration at a well in non-Gaussian aquifers under constant and time-varying pumping schedule

NASA Astrophysics Data System (ADS)

Libera, Arianna; de Barros, Felipe P. J.; Riva, Monica; Guadagnini, Alberto

2017-10-01

Our study is keyed to the analysis of the interplay between engineering factors (i.e., transient pumping rates versus less realistic but commonly analyzed uniform extraction rates) and the heterogeneous structure of the aquifer (as expressed by the probability distribution characterizing transmissivity) on contaminant transport. We explore the joint influence of diverse (a) groundwater pumping schedules (constant and variable in time) and (b) representations of the stochastic heterogeneous transmissivity (T) field on temporal histories of solute concentrations observed at an extraction well. The stochastic nature of T is rendered by modeling its natural logarithm, Y = ln T, through a typical Gaussian representation and the recently introduced Generalized sub-Gaussian (GSG) model. The latter has the unique property to embed scale-dependent non-Gaussian features of the main statistics of Y and its (spatial) increments, which have been documented in a variety of studies. We rely on numerical Monte Carlo simulations and compute the temporal evolution at the well of low order moments of the solute concentration (C), as well as statistics of the peak concentration (Cp), identified as the environmental performance metric of interest in this study. We show that the pumping schedule strongly affects the pattern of the temporal evolution of the first two statistical moments of C, regardless the nature (Gaussian or non-Gaussian) of the underlying Y field, whereas the latter quantitatively influences their magnitude. Our results show that uncertainty associated with C and Cp estimates is larger when operating under a transient extraction scheme than under the action of a uniform withdrawal schedule. The probability density function (PDF) of Cp displays a long positive tail in the presence of time-varying pumping schedule. All these aspects are magnified in the presence of non-Gaussian Y fields. Additionally, the PDF of Cp displays a bimodal shape for all types of pumping schemes analyzed, independent of the type of heterogeneity considered.

No Project Exists In A Vacuum: Organizational Effects In Enterprise Information System Development

DTIC Science & Technology

2014-06-01

development projects may take too much time, or even fail, if [senior management] commitment is erratic” ( Newman & Sabherwal, 1996, p. 24) and...commitment is clearly important to the success of IS development projects” ( Newman & Sabherwal, 1996, p. 23). Not only should decision makers establish...another example, functionality in the parent program could be curtailed due to funding priorities, affecting schedule and functionality in

CINRG: Infrastructure for Clinical Trials in Duchenne Dystrophy

DTIC Science & Technology

2013-09-01

research centers sharing a common goal of improving the quality of life of neuromuscular disease patients by cooperative planning , implementation, analysis...discrepancies were noted surrounding the regulatory binder, consent process and data records. The site personnel have a scheduled plan with the CINRG CC...missing long term follow-up visits). The project manager also reviewed the study records to date while onsite. A high priority plan was developed with the

KSC-02pd1890

NASA Image and Video Library

2002-12-09

KENNEDY SPACE CENTER, FLA. -- Space Shuttle Columbia, atop the Mobile Launcher Platform, approaches the top of Launch Pad 39A where it will undergo preparations for launch. The STS-107 research mission comprises experiments ranging from material sciences to life sciences, plus the Fast Reaction Experiments Enabling Science, Technology, Applications and Research (FREESTAR) that incorporates eight high priority secondary attached shuttle experiments. Mission STS-107 is scheduled to launch Jan. 16, 2003.

Skyline Wide Educational Plan (SWEP) Product Evaluation Report: Educational Goals for the Future (1980's). SWEP Evaluation Report No. 2.

ERIC Educational Resources Information Center

Burns, Robert J.

The major purpose of this evaluation report is to scrutinize the Skyline Wide Educational Plan (SWEP) research methods and analytical schemes and to communicate the project's constituency priorities relative to the educational programs and processes of the future. A Delphi technique was used as the primary mechanism for gathering and scrutinizing…

In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection

NASA Astrophysics Data System (ADS)

Albano, Michele; Gao, Jie

In a sensor network of n nodes in which k of them have sensed interesting data, we perform in-network erasure coding such that each node stores a linear combination of all the network data with random coefficients. This scheme greatly improves data resilience to node failures: as long as there are k nodes that survive an attack, all the data produced in the sensor network can be recovered with high probability. The in-network coding storage scheme also improves data collection rate by mobile mules and allows for easy scheduling of data mules.

Active Control of Wind-Tunnel Model Aeroelastic Response Using Neural Networks

NASA Technical Reports Server (NTRS)

Scott, Robert C.

2000-01-01

NASA Langley Research Center, Hampton, VA 23681 Under a joint research and development effort conducted by the National Aeronautics and Space Administration and The Boeing Company (formerly McDonnell Douglas) three neural-network based control systems were developed and tested. The control systems were experimentally evaluated using a transonic wind-tunnel model in the Langley Transonic Dynamics Tunnel. One system used a neural network to schedule flutter suppression control laws, another employed a neural network in a predictive control scheme, and the third employed a neural network in an inverse model control scheme. All three of these control schemes successfully suppressed flutter to or near the limits of the testing apparatus, and represent the first experimental applications of neural networks to flutter suppression. This paper will summarize the findings of this project.

Planning for rover opportunistic science

NASA Technical Reports Server (NTRS)

Gaines, Daniel M.; Estlin, Tara; Forest, Fisher; Chouinard, Caroline; Castano, Rebecca; Anderson, Robert C.

2004-01-01

The Mars Exploration Rover Spirit recently set a record for the furthest distance traveled in a single sol on Mars. Future planetary exploration missions are expected to use even longer drives to position rovers in areas of high scientific interest. This increase provides the potential for a large rise in the number of new science collection opportunities as the rover traverses the Martian surface. In this paper, we describe the OASIS system, which provides autonomous capabilities for dynamically identifying and pursuing these science opportunities during longrange traverses. OASIS uses machine learning and planning and scheduling techniques to address this goal. Machine learning techniques are applied to analyze data as it is collected and quickly determine new science gods and priorities on these goals. Planning and scheduling techniques are used to alter the behavior of the rover so that new science measurements can be performed while still obeying resource and other mission constraints. We will introduce OASIS and describe how planning and scheduling algorithms support opportunistic science.

Adaptive Data Gathering in Mobile Sensor Networks Using Speedy Mobile Elements

PubMed Central

Lai, Yongxuan; Xie, Jinshan; Lin, Ziyu; Wang, Tian; Liao, Minghong

2015-01-01

Data gathering is a key operator for applications in wireless sensor networks; yet it is also a challenging problem in mobile sensor networks when considering that all nodes are mobile and the communications among them are opportunistic. This paper proposes an efficient data gathering scheme called ADG that adopts speedy mobile elements as the mobile data collector and takes advantage of the movement patterns of the network. ADG first extracts the network meta-data at initial epochs, and calculates a set of proxy nodes based on the meta-data. Data gathering is then mapped into the Proxy node Time Slot Allocation (PTSA) problem that schedules the time slots and orders, according to which the data collector could gather the maximal amount of data within a limited period. Finally, the collector follows the schedule and picks up the sensed data from the proxy nodes through one hop of message transmissions. ADG learns the period when nodes are relatively stationary, so that the collector is able to pick up the data from them during the limited data gathering period. Moreover, proxy nodes and data gathering points could also be timely updated so that the collector could adapt to the change of node movements. Extensive experimental results show that the proposed scheme outperforms other data gathering schemes on the cost of message transmissions and the data gathering rate, especially under the constraint of limited data gathering period. PMID:26389903

Method for providing real-time control of a gaseous propellant rocket propulsion system

NASA Technical Reports Server (NTRS)

Morris, Brian G. (Inventor)

1991-01-01

The new and improved methods and apparatus disclosed provide effective real-time management of a spacecraft rocket engine powered by gaseous propellants. Real-time measurements representative of the engine performance are compared with predetermined standards to selectively control the supply of propellants to the engine for optimizing its performance as well as efficiently managing the consumption of propellants. A priority system is provided for achieving effective real-time management of the propulsion system by first regulating the propellants to keep the engine operating at an efficient level and thereafter regulating the consumption ratio of the propellants. A lower priority level is provided to balance the consumption of the propellants so significant quantities of unexpended propellants will not be left over at the end of the scheduled mission of the engine.

A novel downlink scheduling strategy for traffic communication system based on TD-LTE technology.

PubMed

Chen, Ting; Zhao, Xiangmo; Gao, Tao; Zhang, Licheng

2016-01-01

There are many existing classical scheduling algorithms which can obtain better system throughput and user equality, however, they are not designed for traffic transportation environment, which cannot consider whether the transmission performance of various information flows could meet comprehensive requirements of traffic safety and delay tolerance. This paper proposes a novel downlink scheduling strategy for traffic communication system based on TD-LTE technology, which can perform two classification mappings for various information flows in the eNodeB: firstly, associate every information flow packet with traffic safety importance weight according to its relevance to the traffic safety; secondly, associate every traffic information flow with service type importance weight according to its quality of service (QoS) requirements. Once the connection is established, at every scheduling moment, scheduler would decide the scheduling order of all buffers' head of line packets periodically according to the instant value of scheduling importance weight function, which calculated by the proposed algorithm. From different scenario simulations, it can be verified that the proposed algorithm can provide superior differentiated transmission service and reliable QoS guarantee to information flows with different traffic safety levels and service types, which is more suitable for traffic transportation environment compared with the existing popularity PF algorithm. With the limited wireless resource, information flow closed related to traffic safety will always obtain priority scheduling right timely, which can help the passengers' journey more safe. Moreover, the proposed algorithm cannot only obtain good flow throughput and user fairness which are almost equal to those of the PF algorithm without significant differences, but also provide better realtime transmission guarantee to realtime information flow.

The potential of financial incentives to enhance householders' kerbside recycling behaviour.

PubMed

Shaw, P J; Maynard, S J

2008-01-01

Although the successful enhancement of householders' participation in kerbside recycling schemes is essential for household waste recycling schemes to reach their desired levels of achievement, our understanding of householders' responses to the various incentives available to waste managers is incomplete. In particular, whether and how the recycling behaviour of householders may be favourably altered through imposition of financial penalties or rewards is not fully understood. Surveys of householders' attitudes in the London Borough of Havering, served by a kerbside co-mingled survival bag recycling scheme, showed they might be better encouraged to recycle more through improvements to structural and promotional aspects of the recycling scheme than through imposition of financial incentives. If financial incentives were to be imposed to enhance kerbside recycling, householders preferred: (1) rewards to penalties, and (2) community-based rewards and local taxation rebates to other or individual rewards. Given the attitudes of householders and the resources that would be needed to monitor their recycling behaviour as a basis for delivering financial incentives, it is suggested that the priority for enhancing recycling should be to make appropriate improvements in the infrastructure and support of the kerbside scheme and service.

Game Schedules and Rate of Concussions in the National Football League.

PubMed

Teramoto, Masaru; Cushman, Daniel M; Cross, Chad L; Curtiss, Heather M; Willick, Stuart E

2017-11-01

Concussion prevention in the National Football League (NFL) is an important priority for player safety. The NFL now has modified game schedules, and one concern is that unconventional game schedules, such as a shortened rest period due to playing on a Thursday rather than during the weekend, may lead to an increased risk of injuries. Unconventional game schedules in the NFL are associated with an increased rate of concussion. Descriptive epidemiological study. This study analyzed concussions and game schedules over the NFL regular seasons from 2012 to 2015 (4 years). Documented numbers of concussions, identified by use of the online database PBS Frontline Concussion Watch, were summarized by regular-season weeks. Association of days of rest and game location (home, away, or overseas) with the rate of concussion was examined by use of the χ 2 test. Logistic regression analysis was performed to examine the relationships of days of rest and home/away games to the risk of repeated concussions, with adjustment for player position. A total of 582 concussions were analyzed in this study. A significantly greater number of concussions occurred in the second half of the season ( P < .01). No significant association was found between the rate of concussion and the days of rest, game location, or timing of the bye week by the team or the opponent ( P > .05). Game schedules were not significantly associated with the occurrence of repeat concussions ( P > .05). Unconventional game schedules in the NFL, including playing on Thursday and playing overseas, do not seem to put players at increased risk of concussions.

Network coding based joint signaling and dynamic bandwidth allocation scheme for inter optical network unit communication in passive optical networks

NASA Astrophysics Data System (ADS)

Wei, Pei; Gu, Rentao; Ji, Yuefeng

2014-06-01

As an innovative and promising technology, network coding has been introduced to passive optical networks (PON) in recent years to support inter optical network unit (ONU) communication, yet the signaling process and dynamic bandwidth allocation (DBA) in PON with network coding (NC-PON) still need further study. Thus, we propose a joint signaling and DBA scheme for efficiently supporting differentiated services of inter ONU communication in NC-PON. In the proposed joint scheme, the signaling process lays the foundation to fulfill network coding in PON, and it can not only avoid the potential threat to downstream security in previous schemes but also be suitable for the proposed hybrid dynamic bandwidth allocation (HDBA) scheme. In HDBA, a DBA cycle is divided into two sub-cycles for applying different coding, scheduling and bandwidth allocation strategies to differentiated classes of services. Besides, as network traffic load varies, the entire upstream transmission window for all REPORT messages slides accordingly, leaving the transmission time of one or two sub-cycles to overlap with the bandwidth allocation calculation time at the optical line terminal (the OLT), so that the upstream idle time can be efficiently eliminated. Performance evaluation results validate that compared with the existing two DBA algorithms deployed in NC-PON, HDBA demonstrates the best quality of service (QoS) support in terms of delay for all classes of services, especially guarantees the end-to-end delay bound of high class services. Specifically, HDBA can eliminate queuing delay and scheduling delay of high class services, reduce those of lower class services by at least 20%, and reduce the average end-to-end delay of all services over 50%. Moreover, HDBA also achieves the maximum delay fairness between coded and uncoded lower class services, and medium delay fairness for high class services.

Medical-Grade Channel Access and Admission Control in 802.11e EDCA for Healthcare Applications

PubMed Central

Son, Sunghwa; Park, Kyung-Joon; Park, Eun-Chan

2016-01-01

In this paper, we deal with the problem of assuring medical-grade quality of service (QoS) for real-time medical applications in wireless healthcare systems based on IEEE 802.11e. Firstly, we show that the differentiated channel access of IEEE 802.11e cannot effectively assure medical-grade QoS because of priority inversion. To resolve this problem, we propose an efficient channel access algorithm. The proposed algorithm adjusts arbitrary inter-frame space (AIFS) in the IEEE 802.11e protocol depending on the QoS measurement of medical traffic, to provide differentiated near-absolute priority for medical traffic. In addition, based on rigorous capacity analysis, we propose an admission control scheme that can avoid performance degradation due to network overload. Via extensive simulations, we show that the proposed mechanism strictly assures the medical-grade QoS and improves the throughput of low-priority traffic by more than several times compared to the conventional IEEE 802.11e. PMID:27490666

[Challenges and countermeasures of forestry schistosomiasis control programs in ecological priority of Yangtze River economic belt development].

PubMed

Ning, Su; Yong-Jie, Xu

2016-12-13

Relevant projects carried out within the Yangtze River economic belt on the impact of schistosomiasis epidemic and transmission are important issues for "ecological priority" in the process of implementing the strategy. The key problems of schistosomiasis epidemic risk, epidemic happening repeatedly, difficulty of rehabilitating Oncomelania hupensis snail control and schistosomiasis prevention forest, lag of evaluation system and platform construction, lack of basic research, et al. were analyzed in the Yangtze River economic belt taking "ecological priority" as the basis in this paper. Then corresponding countermeasures to these challenges were put forward so as to provide the reference for the national forestry schistosomiasis control programs, which include: execution of the comprehensive prevention and control strategy, scheming of the new round of forestry schistosomiasis control programs, strengthening schistosomiasis prevention and control, promoting productivity in existing forestry to consolidate and improve the achievements of previous forestry schistosomiasis control programs, and promoting the intensity of technological innovation to improve the technological level of forestry schistosomiasis control programs.

Channel access schemes and fiber optic configurations for integrated-services local area networks

NASA Astrophysics Data System (ADS)

Nassehi, M. Mehdi

1987-03-01

Local Area Networks are in common use for data communications and have enjoyed great success. Recently, there is a growing interest in using a single network to support many applications in addition to traditional data traffic. These additional applications introduce new requirements in terms of volume of traffic and real-time delivery of data which are not met by existing networks. To satisfy these requirements, a high-bandwidth tranmission medium, such as fiber optics, and a distributed channel access scheme for the efficient sharing of the bandwidth among the various applications are needed. As far as the throughput-delay requirements of the various application are concerned, a network structure along with a distributed channel access are proposed which incorporate appropriate scheduling policies for the transmission of outstanding messages on the network. A dynamic scheduling policy was devised which outperforms all existing policies in terms of minimizing the expected cost per message. A broadcast mechanism was devised for the efficient dissemination of all relevant information. Fiber optic technology is considered for the high-bandwidth transmisison medium.

A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem.

PubMed

Amirghasemi, Mehrdad; Zamani, Reza

2014-01-01

This paper presents an effective procedure for solving the job shop problem. Synergistically combining small and large neighborhood schemes, the procedure consists of four components, namely (i) a construction method for generating semi-active schedules by a forward-backward mechanism, (ii) a local search for manipulating a small neighborhood structure guided by a tabu list, (iii) a feedback-based mechanism for perturbing the solutions generated, and (iv) a very large-neighborhood local search guided by a forward-backward shifting bottleneck method. The combination of shifting bottleneck mechanism and tabu list is used as a means of the manipulation of neighborhood structures, and the perturbation mechanism employed diversifies the search. A feedback mechanism, called repeat-check, detects consequent repeats and ignites a perturbation when the total number of consecutive repeats for two identical makespan values reaches a given threshold. The results of extensive computational experiments on the benchmark instances indicate that the combination of these four components is synergetic, in the sense that they collectively make the procedure fast and robust.

Channel access schemes and fiber optic configurations for integrated-services local area networks. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Nassehi, M. Mehdi

1987-01-01

Local Area Networks are in common use for data communications and have enjoyed great success. Recently, there is a growing interest in using a single network to support many applications in addition to traditional data traffic. These additional applications introduce new requirements in terms of volume of traffic and real-time delivery of data which are not met by existing networks. To satisfy these requirements, a high-bandwidth tranmission medium, such as fiber optics, and a distributed channel access scheme for the efficient sharing of the bandwidth among the various applications are needed. As far as the throughput-delay requirements of the various application are concerned, a network structure along with a distributed channel access are proposed which incorporate appropriate scheduling policies for the transmission of outstanding messages on the network. A dynamic scheduling policy was devised which outperforms all existing policies in terms of minimizing the expected cost per message. A broadcast mechanism was devised for the efficient dissemination of all relevant information. Fiber optic technology is considered for the high-bandwidth transmisison medium.

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Arampatzis, Giorgos, E-mail: garab@math.uoc.gr; Katsoulakis, Markos A., E-mail: markos@math.umass.edu; Plechac, Petr, E-mail: plechac@math.udel.edu

2012-10-01

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decompositionmore » corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.« less

Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

Analysis of Lean Initiatives in the Production of Naval Aviators

DTIC Science & Technology

2012-09-01

originated in the 1950s with an engineer named Eji Toyoda, and a production genius Taiichi Ohno at Toyota in Japan. Toyoda and Ohno are credited with...to flow wastes must be eliminated. Taiichi Ohno, the designer of the Toyota Production System, was obsessed with making materials flow and to...pooling between phases or blocks.  Producing quality defects . Delays (waiting).–Varying scheduling priorities for students during different blocks of

KSC-02pd1885

NASA Image and Video Library

2002-12-09

KENNEDY SPACE CENTER, FLA. -- Space Shuttle Columbia rolls towards Launch Pad 39A, sitting atop the Mobile Launcher Platform, which in turn is carried by the crawler-transporter underneath. The STS-107 research mission comprises experiments ranging from material sciences to life sciences (many rats), plus the Fast Reaction Experiments Enabling Science, Technology, Applications and Research (FREESTAR) that incorporates eight high priority secondary attached shuttle experiments. Mission STS-107 is scheduled to launch Jan. 16, 2003.

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai

2014-08-01

This article investigates the open-shop scheduling problem with the optimal criterion of minimising the sum of quadratic completion times. For this NP-hard problem, the asymptotic optimality of the shortest processing time block (SPTB) heuristic is proven in the sense of limit. Moreover, three different improvements, namely, the job-insert scheme, tabu search and genetic algorithm, are introduced to enhance the quality of the original solution generated by the SPTB heuristic. At the end of the article, a series of numerical experiments demonstrate the convergence of the heuristic, the performance of the improvements and the effectiveness of the quadratic objective.

General Direction of the National Center for Environmental Research and Training (Cenica)

Treesearch

A. P. Martínez Bolívar; J. Zaragoza Ávila; O. Fentanes Arriaga; S. Hernández Millán; V. J. Gutiérrez Avedoy

2006-01-01

The National Atmospheric Monitoring Program (Programa Nacional de Monitoreo Atmosférico - PNMA) is the answer to one of the main priorities of Mexico’s Ministry of the Environment and Natural Resources (SEMARNAT) for its linkage to other sectors of the administration. Under a transversal scheme, this program proposes to create links with the various municipalities and...

A Tree Based Self-routing Scheme for Mobility Support in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Kim, Young-Duk; Yang, Yeon-Mo; Kang, Won-Seok; Kim, Jin-Wook; An, Jinung

Recently, WSNs (Wireless Sensor Networks) with mobile robot is a growing technology that offer efficient communication services for anytime and anywhere applications. However, the tiny sensor node has very limited network resources due to its low battery power, low data rate, node mobility, and channel interference constraint between neighbors. Thus, in this paper, we proposed a tree based self-routing protocol for autonomous mobile robots based on beacon mode and implemented in real test-bed environments. The proposed scheme offers beacon based real-time scheduling for reliable association process between parent and child nodes. In addition, it supports smooth handover procedure by reducing flooding overhead of control packets. Throughout the performance evaluation by using a real test-bed system and simulation, we illustrate that our proposed scheme demonstrates promising performance for wireless sensor networks with mobile robots.

Comparing the Performance of Two Dynamic Load Distribution Methods

NASA Technical Reports Server (NTRS)

Kale, L. V.

1987-01-01

Parallel processing of symbolic computations on a message-passing multi-processor presents one challenge: To effectively utilize the available processors, the load must be distributed uniformly to all the processors. However, the structure of these computations cannot be predicted in advance. go, static scheduling methods are not applicable. In this paper, we compare the performance of two dynamic, distributed load balancing methods with extensive simulation studies. The two schemes are: the Contracting Within a Neighborhood (CWN) scheme proposed by us, and the Gradient Model proposed by Lin and Keller. We conclude that although simpler, the CWN is significantly more effective at distributing the work than the Gradient model.

Linear triangular optimization technique and pricing scheme in residential energy management systems

NASA Astrophysics Data System (ADS)

Anees, Amir; Hussain, Iqtadar; AlKhaldi, Ali Hussain; Aslam, Muhammad

2018-06-01

This paper presents a new linear optimization algorithm for power scheduling of electric appliances. The proposed system is applied in a smart home community, in which community controller acts as a virtual distribution company for the end consumers. We also present a pricing scheme between community controller and its residential users based on real-time pricing and likely block rates. The results of the proposed optimization algorithm demonstrate that by applying the anticipated technique, not only end users can minimise the consumption cost, but it can also reduce the power peak to an average ratio which will be beneficial for the utilities as well.

Experimental demonstration of bandwidth on demand (BoD) provisioning based on time scheduling in software-defined multi-domain optical networks

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Li, Yajie; Wang, Xinbo; Chen, Bowen; Zhang, Jie

2016-09-01

A hierarchical software-defined networking (SDN) control architecture is designed for multi-domain optical networks with the Open Daylight (ODL) controller. The OpenFlow-based Control Virtual Network Interface (CVNI) protocol is deployed between the network orchestrator and the domain controllers. Then, a dynamic bandwidth on demand (BoD) provisioning solution is proposed based on time scheduling in software-defined multi-domain optical networks (SD-MDON). Shared Risk Link Groups (SRLG)-disjoint routing schemes are adopted to separate each tenant for reliability. The SD-MDON testbed is built based on the proposed hierarchical control architecture. Then the proposed time scheduling-based BoD (Ts-BoD) solution is experimentally demonstrated on the testbed. The performance of the Ts-BoD solution is evaluated with respect to blocking probability, resource utilization, and lightpath setup latency.

Resilient filtering for time-varying stochastic coupling networks under the event-triggering scheduling

NASA Astrophysics Data System (ADS)

Wang, Fan; Liang, Jinling; Dobaie, Abdullah M.

2018-07-01

The resilient filtering problem is considered for a class of time-varying networks with stochastic coupling strengths. An event-triggered strategy is adopted to save the network resources by scheduling the signal transmission from the sensors to the filters based on certain prescribed rules. Moreover, the filter parameters to be designed are subject to gain perturbations. The primary aim of the addressed problem is to determine a resilient filter that ensures an acceptable filtering performance for the considered network with event-triggering scheduling. To handle such an issue, an upper bound on the estimation error variance is established for each node according to the stochastic analysis. Subsequently, the resilient filter is designed by locally minimizing the derived upper bound at each iteration. Moreover, rigorous analysis shows the monotonicity of the minimal upper bound regarding the triggering threshold. Finally, a simulation example is presented to show effectiveness of the established filter scheme.

17 CFR 240.13d-1 - Filing of Schedules 13D and 13G.

Code of Federal Regulations, 2011 CFR

2011-04-01

... regulatory scheme applicable to the equivalent U.S. institution; and (K) A group, provided that all the... influencing the control of the issuer, nor in connection with or as a participant in any transaction having... or control person, provided the aggregate amount held directly by the parent or control person, and...

17 CFR 240.13d-1 - Filing of Schedules 13D and 13G.

Code of Federal Regulations, 2010 CFR

2010-04-01

... regulatory scheme applicable to the equivalent U.S. institution; and (K) A group, provided that all the... control of the issuer, nor in connection with or as a participant in any transaction having such purpose... or control person, provided the aggregate amount held directly by the parent or control person, and...

The Relationship of Compensation to Job Attraction and Performance in Public Schools

ERIC Educational Resources Information Center

Rose, Richard

2012-01-01

The need for more effective schools and the centrality of the teacher's role in any substantive school improvement plans are well known. Educators, political factions, and policymakers are engaged in a lively debate as to whether performance pay schemes or more substantial increments across the salary schedule are more likely to motivate teachers…

How Home Health Nurses Plan Their Work Schedules: A Qualitative Descriptive Study.

PubMed

Irani, Elliane; Hirschman, Karen B; Cacchione, Pamela Z; Bowles, Kathryn H

2018-06-12

To describe how home health nurses plan their daily work schedules and what challenges they face during the planning process. Home health nurses are viewed as independent providers and value the nature of their work because of the flexibility and autonomy they hold in developing their work schedules. However, there is limited empirical evidence about how home health nurses plan their work schedules, including the factors they consider during the process and the challenges they face within the dynamic home health setting. Qualitative descriptive design. Semi-structured interviews were conducted with 20 registered nurses who had greater than 2 years of experience in home health and were employed by one of the three participating home health agencies in the mid-Atlantic region of the United States. Data were analyzed using conventional content analysis. Four themes emerged about planning work schedules and daily itineraries: identifying patient needs to prioritize visits accordingly, partnering with patients to accommodate their preferences, coordinating visit timing with other providers to avoid overwhelming patients, and working within agency standards to meet productivity requirements. Scheduling challenges included readjusting the schedule based on patient needs and staffing availability, anticipating longer visits, and maintaining continuity of care with patients. Home health nurses make autonomous decisions regarding their work schedules while considering specific patient and agency factors, and overcome challenges related to the unpredictable nature of providing care in a home health setting. Future research is needed to further explore nurse productivity in home health and improve home health work environments. Home health nurses plan their work schedules to provide high quality care that is patient-centered and timely. The findings also highlight organizational priorities to facilitate continuity of care and support nurses while alleviating the burnout associated with high productivity requirements. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

Advanced spacecraft fire safety: Proposed projects and program plan

NASA Technical Reports Server (NTRS)

Youngblood, Wallace W.; Vedha-Nayagam, M.

1989-01-01

A detailed review identifies spacecraft fire safety issues and the efforts for their resolution, particularly for the threats posed by the increased on-orbit duration, size, and complexity of the Space Station Freedom. Suggestions provided by a survey of Wyle consultants and outside fire safety experts were combined into 30 research and engineering projects. The projects were then prioritized with respect to urgency to meet Freedom design goals, status of enabling technology, cost, and so on, to yield 14 highest priority projects, described in terms of background, work breakdown structure, and schedule. These highest priority projects can be grouped into the thematic areas of fire detection, fire extinguishment, risk assessment, toxicology and human effects, and ground based testing. Recommendations for overall program management stress the need for NASA Headquarters and field center coordination, with information exchange through spacecraft fire safety oversight committees.

Multicriteria decision analysis for including health interventions in the universal health coverage benefit package in Thailand.

PubMed

Youngkong, Sitaporn; Baltussen, Rob; Tantivess, Sripen; Mohara, Adun; Teerawattananon, Yot

2012-01-01

Considering rising health expenditure on the one hand and increasing public expectations on the other hand, there is a need for explicit health care rationing to secure public acceptance of coverage decisions of health interventions. The National Health Security Office, the institute managing the Universal Coverage Scheme in Thailand, recently called for more rational, transparent, and fair decisions on the public reimbursement of health interventions. This article describes the application of multicriteria decision analysis (MCDA) to guide the coverage decisions on including health interventions in the Universal Coverage Scheme health benefit package in the period 2009-2010. We described the MCDA priority-setting process through participatory observation and evaluated the rational, transparency, and fairness of the priority-setting process against the accountability for reasonableness framework. The MCDA was applied in four steps: 1) 17 interventions were nominated for assessment; 2) nine interventions were selected for further quantitative assessment on the basis of the following criteria: size of population affected by disease, severity of disease, effectiveness of health intervention, variation in practice, economic impact on household expenditure, and equity and social implications; 3) these interventions were then assessed in terms of cost-effectiveness and budget impact; and 4) decision makers qualitatively appraised, deliberated, and reached consensus on which interventions should be adopted in the package. This project was carried out in a real-world context and has considerably contributed to the rational, transparent, and fair priority-setting process through the application of MCDA. Although the present project has applied MCDA in the Thai context, MCDA is adaptable to other settings. Copyright © 2012 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by Elsevier Inc. All rights reserved.

StarBase: A Firm Real-Time Database Manager for Time-Critical Applications

DTIC Science & Technology

1995-01-01

Mellon University [IO]. StarBase differs from previous RT-DBMS work [l, 2, 31 in that a) it relies on a real - time operating system which provides...simulation studies, StarBase uses a real - time operating system to provide basic real-time functionality and deals with issues beyond transaction...re- source scheduling provided by the underlying real - time operating system . Issues of data contention are dealt with by use of a priority

Temporal Proof Methodologies for Real-Time Systems,

DTIC Science & Technology

1990-09-01

real time systems that communicate either through shared variables or by message passing and real time issues such as time-outs, process priorities (interrupts) and process scheduling. The authors exhibit two styles for the specification of real - time systems . While the first approach uses bounded versions of temporal operators the second approach allows explicit references to time through a special clock variable. Corresponding to two styles of specification the authors present and compare two fundamentally different proof

Phoenix, a High-Performance UNIX with an Emphasis on Dynamic Modification, Real-Time Response and Survivability

DTIC Science & Technology

1990-01-12

Communications COM-28, (April 1980 ) 425-432. [6] Munch-Anderson, B. and T.U. Zahle, Scheduling According to Job Priority With Prevention of Deadlock and...Interconnection, IEEE Transactions on Communications COM-28, (April 1980 ) 425-432. (4] Cook, R.P., StarMod, A Language for Distributed Programming...Research Triangle Park, NC 27709-2211 Attention: Dr. David W. Hislop * Electronics Division 51 Dr. David W. Hislop Electronics Division U. S. Army Research

European Software Engineering Process Group Conference (2nd Annual), EUROPEAN SEPG󈨥. Delegate Material, Tutorials

DTIC Science & Technology

1997-06-17

There is Good and Bad News With CMMs8 *bad news: process improvement takes time *good news: the first benefit Is better schedule management With PSP s...e g similar supp v EURO not sudden death toolset for assessment and v EURO => Business benefits detailed analysis) . EURO could collapse (low risk...from SPI live on even after year 2000. Priority BENEFITS Actions * Improved management and application development processes * Strengthened Change

Progress on plutonium stabilization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hurt, D.

1996-05-01

The Defense Nuclear Facilities Safety Board has safety oversight responsibility for most of the facilities where unstable forms of plutonium are being processed and packaged for interim storage. The Board has issued recommendations on plutonium stabilization and has has a considerable influence on DOE`s stabilization schedules and priorities. The Board has not made any recommendations on long-term plutonium disposition, although it may get more involved in the future if DOE develops plans to use defense nuclear facilities for disposition activities.

Testing and Validation of Timing Properties for High Speed Digital Cameras - A Best Practices Guide

DTIC Science & Technology

2016-07-27

a five year plan to begin replacing its inventory of antiquated film and video systems with more modern and capable digital systems. As evidenced in...installation, testing, and documentation of DITCS. If shop support can be accelerated due to shifting mission priorities, this schedule can likely...assistance from the machine shop , welding shop , paint shop , and carpenter shop . Testing the DITCS system will require a KTM with digital cameras and

Advancing the LSST Operations Simulator

NASA Astrophysics Data System (ADS)

Saha, Abhijit; Ridgway, S. T.; Cook, K. H.; Delgado, F.; Chandrasekharan, S.; Petry, C. E.; Operations Simulator Group

2013-01-01

The Operations Simulator for the Large Synoptic Survey Telescope (LSST; http://lsst.org) allows the planning of LSST observations that obey explicit science driven observing specifications, patterns, schema, and priorities, while optimizing against the constraints placed by design-specific opto-mechanical system performance of the telescope facility, site specific conditions (including weather and seeing), as well as additional scheduled and unscheduled downtime. A simulation run records the characteristics of all observations (e.g., epoch, sky position, seeing, sky brightness) in a MySQL database, which can be queried for any desired purpose. Derivative information digests of the observing history database are made with an analysis package called Simulation Survey Tools for Analysis and Reporting (SSTAR). Merit functions and metrics have been designed to examine how suitable a specific simulation run is for several different science applications. This poster reports recent work which has focussed on an architectural restructuring of the code that will allow us to a) use "look-ahead" strategies that avoid cadence sequences that cannot be completed due to observing constraints; and b) examine alternate optimization strategies, so that the most efficient scheduling algorithm(s) can be identified and used: even few-percent efficiency gains will create substantive scientific opportunity. The enhanced simulator will be used to assess the feasibility of desired observing cadences, study the impact of changing science program priorities, and assist with performance margin investigations of the LSST system.

Demographic and Socioeconomic Factors Influencing Public Attitudes Toward a Presumed Consent System for Organ Donation Without and With a Priority Allocation Scheme.

PubMed

Tumin, Makmor; Tafran, Khaled; Mutalib, Muzalwana Abdul Talib Abdul; Satar, NurulHuda Mohd; Said, Saad Mohd; Adnan, Wan Ahmad Hafiz Wan Md; Lu, Yong Sook

2015-10-01

The influence of demographic and socioeconomic factors on the public's attitude towards a presumed consent system (PCS) of organ donation was estimated in 2 scenarios: without and with a priority allocation scheme (PAS). Self-administered questionnaires were completed by 775 respondents. Using multiple logistic regressions, respondents' objections to donating organs in both scenarios were estimated. In total, 63.9% of respondents would object to donating under a PCS, whereas 54.6% would object under a PCS with a PAS. Respondents with pretertiary education were more likely to object than were respondents with tertiary education, in both the first (adjusted odds ratio [AOR] = 1.615) and second (AOR = 1.728) scenarios. Young respondents were less likely to object than were middle-aged respondents, in both the first (AOR = 0.648) and second (AOR = 0.572) scenarios. Respondents with mid-ranged personal monthly income were more likely to object than were respondents with low income, in both the first (AOR = 1.994) and second (AOR = 1.519) scenarios. It does not seem that Malaysia is ready to implement a PCS. The educational level, age, and income of the broader public should be considered if a PCS, without or with a PAS, is planned for implementation in Malaysia.

The global distribution of tetrapods reveals a need for targeted reptile conservation.

PubMed

Roll, Uri; Feldman, Anat; Novosolov, Maria; Allison, Allen; Bauer, Aaron M; Bernard, Rodolphe; Böhm, Monika; Castro-Herrera, Fernando; Chirio, Laurent; Collen, Ben; Colli, Guarino R; Dabool, Lital; Das, Indraneil; Doan, Tiffany M; Grismer, Lee L; Hoogmoed, Marinus; Itescu, Yuval; Kraus, Fred; LeBreton, Matthew; Lewin, Amir; Martins, Marcio; Maza, Erez; Meirte, Danny; Nagy, Zoltán T; de C Nogueira, Cristiano; Pauwels, Olivier S G; Pincheira-Donoso, Daniel; Powney, Gary D; Sindaco, Roberto; Tallowin, Oliver J S; Torres-Carvajal, Omar; Trape, Jean-François; Vidan, Enav; Uetz, Peter; Wagner, Philipp; Wang, Yuezhao; Orme, C David L; Grenyer, Richard; Meiri, Shai

2017-11-01

The distributions of amphibians, birds and mammals have underpinned global and local conservation priorities, and have been fundamental to our understanding of the determinants of global biodiversity. In contrast, the global distributions of reptiles, representing a third of terrestrial vertebrate diversity, have been unavailable. This prevented the incorporation of reptiles into conservation planning and biased our understanding of the underlying processes governing global vertebrate biodiversity. Here, we present and analyse the global distribution of 10,064 reptile species (99% of extant terrestrial species). We show that richness patterns of the other three tetrapod classes are good spatial surrogates for species richness of all reptiles combined and of snakes, but characterize diversity patterns of lizards and turtles poorly. Hotspots of total and endemic lizard richness overlap very little with those of other taxa. Moreover, existing protected areas, sites of biodiversity significance and global conservation schemes represent birds and mammals better than reptiles. We show that additional conservation actions are needed to effectively protect reptiles, particularly lizards and turtles. Adding reptile knowledge to a global complementarity conservation priority scheme identifies many locations that consequently become important. Notably, investing resources in some of the world's arid, grassland and savannah habitats might be necessary to represent all terrestrial vertebrates efficiently.

Improved configuration control for redundant robots

NASA Technical Reports Server (NTRS)

Seraji, H.; Colbaugh, R.

1990-01-01

This article presents a singularity-robust task-prioritized reformulation of the configuration control scheme for redundant robot manipulators. This reformulation suppresses large joint velocities near singularities, at the expense of small task trajectory errors. This is achieved by optimally reducing the joint velocities to induce minimal errors in the task performance by modifying the task trajectories. Furthermore, the same framework provides a means for assignment of priorities between the basic task of end-effector motion and the user-defined additional task for utilizing redundancy. This allows automatic relaxation of the additional task constraints in favor of the desired end-effector motion, when both cannot be achieved exactly. The improved configuration control scheme is illustrated for a variety of additional tasks, and extensive simulation results are presented.

Antenna Allocation in MIMO Radar with Widely Separated Antennas for Multi-Target Detection

PubMed Central

Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong

2014-01-01

In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes. PMID:25350505

Antenna allocation in MIMO radar with widely separated antennas for multi-target detection.

PubMed

Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong

2014-10-27

In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes.

Modulation of neural activity by reward in medial intraparietal cortex is sensitive to temporal sequence of reward

PubMed Central

Rajalingham, Rishi; Stacey, Richard Greg; Tsoulfas, Georgios

2014-01-01

To restore movements to paralyzed patients, neural prosthetic systems must accurately decode patients' intentions from neural signals. Despite significant advancements, current systems are unable to restore complex movements. Decoding reward-related signals from the medial intraparietal area (MIP) could enhance prosthetic performance. However, the dynamics of reward sensitivity in MIP is not known. Furthermore, reward-related modulation in premotor areas has been attributed to behavioral confounds. Here we investigated the stability of reward encoding in MIP by assessing the effect of reward history on reward sensitivity. We recorded from neurons in MIP while monkeys performed a delayed-reach task under two reward schedules. In the variable schedule, an equal number of small- and large-rewards trials were randomly interleaved. In the constant schedule, one reward size was delivered for a block of trials. The memory period firing rate of most neurons in response to identical rewards varied according to schedule. Using systems identification tools, we attributed the schedule sensitivity to the dependence of neural activity on the history of reward. We did not find schedule-dependent behavioral changes, suggesting that reward modulates neural activity in MIP. Neural discrimination between rewards was less in the variable than in the constant schedule, degrading our ability to decode reach target and reward simultaneously. The effect of schedule was mitigated by adding Haar wavelet coefficients to the decoding model. This raises the possibility of multiple encoding schemes at different timescales and reinforces the potential utility of reward information for prosthetic performance. PMID:25008408

Modulation of neural activity by reward in medial intraparietal cortex is sensitive to temporal sequence of reward.

PubMed

Rajalingham, Rishi; Stacey, Richard Greg; Tsoulfas, Georgios; Musallam, Sam

2014-10-01

To restore movements to paralyzed patients, neural prosthetic systems must accurately decode patients' intentions from neural signals. Despite significant advancements, current systems are unable to restore complex movements. Decoding reward-related signals from the medial intraparietal area (MIP) could enhance prosthetic performance. However, the dynamics of reward sensitivity in MIP is not known. Furthermore, reward-related modulation in premotor areas has been attributed to behavioral confounds. Here we investigated the stability of reward encoding in MIP by assessing the effect of reward history on reward sensitivity. We recorded from neurons in MIP while monkeys performed a delayed-reach task under two reward schedules. In the variable schedule, an equal number of small- and large-rewards trials were randomly interleaved. In the constant schedule, one reward size was delivered for a block of trials. The memory period firing rate of most neurons in response to identical rewards varied according to schedule. Using systems identification tools, we attributed the schedule sensitivity to the dependence of neural activity on the history of reward. We did not find schedule-dependent behavioral changes, suggesting that reward modulates neural activity in MIP. Neural discrimination between rewards was less in the variable than in the constant schedule, degrading our ability to decode reach target and reward simultaneously. The effect of schedule was mitigated by adding Haar wavelet coefficients to the decoding model. This raises the possibility of multiple encoding schemes at different timescales and reinforces the potential utility of reward information for prosthetic performance. Copyright © 2014 the American Physiological Society.

Atomic Interferometric Gravitational-Wave Space Observatory (AIGSO)

NASA Astrophysics Data System (ADS)

Gao, Dong-Feng; Wang, Jin; Zhan, Ming-Sheng

2018-01-01

We propose a space-borne gravitational-wave detection scheme, called atom interferometric gravitational-wave space observatory (AIGSO). It is motivated by the progress in the atomic matter-wave interferometry, which solely utilizes the standing light waves to split, deflect and recombine the atomic beam. Our scheme consists of three drag-free satellites orbiting the Earth. The phase shift of AIGSO is dominated by the Sagnac effect of gravitational-waves, which is proportional to the area enclosed by the atom interferometer, the frequency and amplitude of gravitational-waves. The scheme has a strain sensitivity < {10}-20/\\sqrt{{Hz}} in the 100 mHz-10 Hz frequency range, which fills in the detection gap between space-based and ground-based laser interferometric detectors. Thus, our proposed AIGSO can be a good complementary detection scheme to the space-borne laser interferometric schemes, such as LISA. Considering the current status of relevant technology readiness, we expect our AIGSO to be a promising candidate for the future space-based gravitational-wave detection plan. Supported by the National Key Research Program of China under Grant No. 2016YFA0302002, the National Science Foundation of China under Grant Nos. 11227803 and 91536221, and the Strategic Priority Research Program of the Chinese Academy of Sciences under Grant No. XDB21010100

Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind

NASA Astrophysics Data System (ADS)

Buchner, Johannes

2011-12-01

Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a NP-hard problem). This is about to become an issue in Radio astronomy as observatories consisting of hundreds to thousands of telescopes are planned and operated. The Square Kilometre Array (SKA), which Australia and New Zealand bid to host, is aiming for scales where current approaches -- in construction, operation but also scheduling -- are insufficent. Although manual scheduling is common today, the problem is becoming complicated by the demand for (1) independent sub-arrays doing simultaneous observations, which requires the scheduler to plan parallel observations and (2) dynamic re-scheduling on changed conditions. Both of these requirements apply to the SKA, especially in the construction phase. We review the scheduling approaches taken in the astronomy literature, as well as investigate techniques from human schedulers and today's observatories. The scheduling problem is specified in general for scientific observations and in particular on radio telescope arrays. Also taken into account is the fact that the observatory may be oversubscribed, requiring the scheduling problem to be integrated with a planning process. We solve this long-term scheduling problem using a time-based encoding that works in the very general case of observation scheduling. This research then compares algorithms from various approaches, including fast heuristics from CPU scheduling, Linear Integer Programming and Genetic algorithms, Branch-and-Bound enumeration schemes. Measures include not only goodness of the solution, but also scalability and re-scheduling capabilities. In conclusion, we have identified a fast and good scheduling approach that allows (re-)scheduling difficult and changing problems by combining heuristics with a Genetic algorithm using block-wise mutation operations. We are able to explain and eradicate two problems in the literature: The inability of a GA to properly improve schedules and the generation of schedules with frequent interruptions. Finally, we demonstrate the scheduling framework for several operating telescopes: (1) Dynamic re-scheduling with the AUT Warkworth 12m telescope, (2) Scheduling for the Australian Mopra 22m telescope and scheduling for the Allen Telescope Array. Furthermore, we discuss the applicability of the presented scheduling framework to the Atacama Large Millimeter/submillimeter Array (ALMA, in construction) and the SKA. In particular, during the development phase of the SKA, this dynamic, scalable scheduling framework can accommodate changing conditions.

Fast packet switching algorithms for dynamic resource control over ATM networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsang, R.P.; Keattihananant, P.; Chang, T.

1996-12-01

Real-time continuous media traffic, such as digital video and audio, is expected to comprise a large percentage of the network load on future high speed packet switch networks such as ATM. A major feature which distinguishes high speed networks from traditional slower speed networks is the large amount of data the network must process very quickly. For efficient network usage, traffic control mechanisms are essential. Currently, most mechanisms for traffic control (such as flow control) have centered on the support of Available Bit Rate (ABR), i.e., non real-time, traffic. With regard to ATM, for ABR traffic, two major types ofmore » schemes which have been proposed are rate- control and credit-control schemes. Neither of these schemes are directly applicable to Real-time Variable Bit Rate (VBR) traffic such as continuous media traffic. Traffic control for continuous media traffic is an inherently difficult problem due to the time- sensitive nature of the traffic and its unpredictable burstiness. In this study, we present a scheme which controls traffic by dynamically allocating/de- allocating resources among competing VCs based upon their real-time requirements. This scheme incorporates a form of rate- control, real-time burst-level scheduling and link-link flow control. We show analytically potential performance improvements of our rate- control scheme and present a scheme for buffer dimensioning. We also present simulation results of our schemes and discuss the tradeoffs inherent in maintaining high network utilization and statistically guaranteeing many users` Quality of Service.« less

A FairShare Scheduling Service for OpenNebula

NASA Astrophysics Data System (ADS)

Bagnasco, S.; Vallero, S.; Zaccolo, V.

2017-10-01

In the ideal limit of infinite resources, multi-tenant applications are able to scale in/out on a Cloud driven only by their functional requirements. While a large Public Cloud may be a reasonable approximation of this condition, small scientific computing centres usually work in a saturated regime. In this case, an advanced resource allocation policy is needed in order to optimize the use of the data centre. The general topic of advanced resource scheduling is addressed by several components of the EU-funded INDIGO-DataCloud project. In this contribution, we describe the FairShare Scheduler Service (FaSS) for OpenNebula (ONE). The service must satisfy resource requests according to an algorithm which prioritizes tasks according to an initial weight and to the historical resource usage of the project. The software was designed to be less intrusive as possible in the ONE code. We keep the original ONE scheduler implementation to match requests to available resources, but the queue of pending jobs to be processed is the one ordered according to priorities as delivered by the FaSS. The FaSS implementation is still being finalized and in this contribution we describe the functional and design requirements the module should satisfy, as well as its high-level architecture.

A novel LTE scheduling algorithm for green technology in smart grid.

PubMed

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

PubMed Central

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703

Model Checking Real Time Java Using Java PathFinder

NASA Technical Reports Server (NTRS)

Lindstrom, Gary; Mehlitz, Peter C.; Visser, Willem

2005-01-01

The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real time threads; user defined schedulers; asynchronous events, handlers, and control transfers; a priority inheritance based default scheduler; non-heap memory areas such as immortal and scoped, and non-heap real time threads whose execution is not impeded by garbage collection. The Robust Software Systems group at NASA Ames Research Center has JAVA PATHFINDER (JPF) under development, a Java model checker. JPF at its core is a state exploring JVM which can examine alternative paths in a Java program (e.g., via backtracking) by trying all nondeterministic choices, including thread scheduling order. This paper describes our implementation of an RTSJ profile (subset) in JPF, including requirements, design decisions, and current implementation status. Two examples are analyzed: jobs on a multiprogramming operating system, and a complex resource contention example involving autonomous vehicles crossing an intersection. The utility of JPF in finding logic and timing errors is illustrated, and the remaining challenges in supporting all of RTSJ are assessed.

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

HEP - A semaphore-synchronized multiprocessor with central control. [Heterogeneous Element Processor

NASA Technical Reports Server (NTRS)

Gilliland, M. C.; Smith, B. J.; Calvert, W.

1976-01-01

The paper describes the design concept of the Heterogeneous Element Processor (HEP), a system tailored to the special needs of scientific simulation. In order to achieve high-speed computation required by simulation, HEP features a hierarchy of processes executing in parallel on a number of processors, with synchronization being largely accomplished by hardware. A full-empty-reserve scheme of synchronization is realized by zero-one-valued hardware semaphores. A typical system has, besides the control computer and the scheduler, an algebraic module, a memory module, a first-in first-out (FIFO) module, an integrator module, and an I/O module. The architecture of the scheduler and the algebraic module is examined in detail.

A scalable delivery framework and a pricing model for streaming media with advertisements

NASA Astrophysics Data System (ADS)

Al-Hadrusi, Musab; Sarhan, Nabil J.

2008-01-01

This paper presents a delivery framework for streaming media with advertisements and an associated pricing model. The delivery model combines the benefits of periodic broadcasting and stream merging. The advertisements' revenues are used to subsidize the price of the media content. The pricing is determined based on the total ads' viewing time. Moreover, this paper presents an efficient ad allocation scheme and three modified scheduling policies that are well suited to the proposed delivery framework. Furthermore, we study the effectiveness of the delivery framework and various scheduling polices through extensive simulation in terms of numerous metrics, including customer defection probability, average number of ads viewed per client, price, arrival rate, profit, and revenue.

Master-slave control scheme in electric vehicle smart charging infrastructure.

PubMed

Chung, Ching-Yen; Chynoweth, Joshua; Chu, Chi-Cheng; Gadh, Rajit

2014-01-01

WINSmartEV is a software based plug-in electric vehicle (PEV) monitoring, control, and management system. It not only incorporates intelligence at every level so that charge scheduling can avoid grid bottlenecks, but it also multiplies the number of PEVs that can be plugged into a single circuit. This paper proposes, designs, and executes many upgrades to WINSmartEV. These upgrades include new hardware that makes the level 1 and level 2 chargers faster, more robust, and more scalable. It includes algorithms that provide a more optimal charge scheduling for the level 2 (EVSE) and an enhanced vehicle monitoring/identification module (VMM) system that can automatically identify PEVs and authorize charging.

Master-Slave Control Scheme in Electric Vehicle Smart Charging Infrastructure

PubMed Central

Chung, Ching-Yen; Chynoweth, Joshua; Chu, Chi-Cheng; Gadh, Rajit

2014-01-01

WINSmartEV is a software based plug-in electric vehicle (PEV) monitoring, control, and management system. It not only incorporates intelligence at every level so that charge scheduling can avoid grid bottlenecks, but it also multiplies the number of PEVs that can be plugged into a single circuit. This paper proposes, designs, and executes many upgrades to WINSmartEV. These upgrades include new hardware that makes the level 1 and level 2 chargers faster, more robust, and more scalable. It includes algorithms that provide a more optimal charge scheduling for the level 2 (EVSE) and an enhanced vehicle monitoring/identification module (VMM) system that can automatically identify PEVs and authorize charging. PMID:24982956

On optimal scheduling and air traffic control in the near terminal area. M.S. Thesis

NASA Technical Reports Server (NTRS)

Sarris, A. H.

1971-01-01

A scheme is proposed for automated air traffic control of landing aircraft in the vicinity of the airport. Each aircraft is put under the control of an airport-based computer as soon as it enters the near-terminal area (NTA). Scheduling is done immediately thereafter. The aircraft is given a flight plan which, if followed precisely, will lead it to the runway at a prespecified time. The geometry of the airspace in the NTA is chosen so that delays are executed far from the outer marker, and violations of minimum altitude and lateral separations are avoided. Finally, a solution to the velocity mix problem is proposed.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Boman, Erik G.

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-performancemore » computing to obtain better data locality and thus reduce run times.« less

Energy-efficient orthogonal frequency division multiplexing-based passive optical network based on adaptive sleep-mode control and dynamic bandwidth allocation

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Xiao, Nengwu; Chen, Chen; Yuan, Weicheng; Qiu, Kun

2016-02-01

We propose an energy-efficient orthogonal frequency division multiplexing-based passive optical network (OFDM-PON) using adaptive sleep-mode control and dynamic bandwidth allocation. In this scheme, a bidirectional-centralized algorithm named the receiver and transmitter accurate sleep control and dynamic bandwidth allocation (RTASC-DBA), which has an overall bandwidth scheduling policy, is employed to enhance the energy efficiency of the OFDM-PON. The RTASC-DBA algorithm is used in an optical line terminal (OLT) to control the sleep mode of an optical network unit (ONU) sleep and guarantee the quality of service of different services of the OFDM-PON. The obtained results show that, by using the proposed scheme, the average power consumption of the ONU is reduced by ˜40% when the normalized ONU load is less than 80%, compared with the average power consumption without using the proposed scheme.

Enabling Autonomous Rover Science through Dynamic Planning and Scheduling

NASA Technical Reports Server (NTRS)

Estlin, Tara A.; Gaines, Daniel; Chouinard, Caroline; Fisher, Forest; Castano, Rebecca; Judd, Michele; Nesnas, Issa

2005-01-01

This paper describes how dynamic planning and scheduling techniques can be used onboard a rover to autonomously adjust rover activities in support of science goals. These goals could be identified by scientists on the ground or could be identified by onboard data-analysis software. Several different types of dynamic decisions are described, including the handling of opportunistic science goals identified during rover traverses, preserving high priority science targets when resources, such as power, are unexpectedly over-subscribed, and dynamically adding additional, ground-specified science targets when rover actions are executed more quickly than expected. After describing our specific system approach, we discuss some of the particular challenges we have examined to support autonomous rover decision-making. These include interaction with rover navigation and path-planning software and handling large amounts of uncertainty in state and resource estimations.

[Wetlands of priority restoration in Northeast China based on spatial analysis].

PubMed

Dong, Zhang-Yu; Liu, Dian-Wei; Wang, Zong-Ming; Ren, Chun-Ying; Tang, Xu-Guang; Jia, Ming-Ming; Wang, Yan

2013-01-01

By using GIS/RS technology, and from the aspects of landscape structure, river- and road densities, wetness index, geomorphology, and cultivated land productivity, a spatial analysis was made on the potentiality of wetland restoration in Northeast China, with the regions of priority and secondary priority restoration wetlands determined. Then, by using the coordinated development index of crop production and wetland as well as the landscape indices, the wetland restoration effect was verified. In Northeast China, the wetland area of priority restoration was 1.78 x 10(6) hm2, among which, farmland and grassland were the main types for restoration, accounting for 96.7% of the total, and mainly located in the Sanjiang Plain in the northeastern part and the Songnen Plain in the central part of Northeast China. The wetland area of secondary priority restoration was 1.03 x 10(6) hm2. After the restoration of the wetlands, the wetland area in Northeast China would be increased by 37.4%, compared with the present wetland area, and the value of the coordinated development index of crop production and wetland would increase from 0.539 before restoration to 0.733 after restoration. The landscape pattern would be more benefit to the performance of the ecological functions of the wetlands. This study revealed that the restoration scheme of the wetlands in Northeast China based on spatial analysis was practicable, which could provide data support for the implement of wetland restoration and the improvement of ecological environment in Northeast China.

An Improved Call Admission Control Mechanism with Prioritized Handoff Queuing Scheme for BWA Networks

NASA Astrophysics Data System (ADS)

Chowdhury, Prasun; Saha Misra, Iti

2014-10-01

Nowadays, due to increased demand for using the Broadband Wireless Access (BWA) networks in a satisfactory manner a promised Quality of Service (QoS) is required to manage the seamless transmission of the heterogeneous handoff calls. To this end, this paper proposes an improved Call Admission Control (CAC) mechanism with prioritized handoff queuing scheme that aims to reduce dropping probability of handoff calls. Handoff calls are queued when no bandwidth is available even after the allowable bandwidth degradation of the ongoing calls and get admitted into the network when an ongoing call is terminated with a higher priority than the newly originated call. An analytical Markov model for the proposed CAC mechanism is developed to analyze various performance parameters. Analytical results show that our proposed CAC with handoff queuing scheme prioritizes the handoff calls effectively and reduces dropping probability of the system by 78.57% for real-time traffic without degrading the number of failed new call attempts. This results in the increased bandwidth utilization of the network.

Private governance, public purpose? Assessing transparency and accountability in self-regulation of food advertising to children.

PubMed

Reeve, Belinda

2013-06-01

Reducing non-core food advertising to children is an important priority in strategies to address childhood obesity. Public health researchers argue for government intervention on the basis that food industry self-regulation is ineffective; however, the industry contends that the existing voluntary scheme adequately addresses community concerns. This paper examines the operation of two self-regulatory initiatives governing food advertising to children in Australia, in order to determine whether these regulatory processes foster transparent and accountable self-regulation. The paper concludes that while both codes appear to establish transparency and accountability mechanisms, they do not provide for meaningful stakeholder participation in the self-regulatory scheme. Accordingly, food industry self-regulation is unlikely to reflect public health concerns or to be perceived as a legitimate form of governance by external stakeholders. If industry regulation is to remain a feasible alternative to statutory regulation, there is a strong argument for strengthening government oversight and implementing a co-regulatory scheme.

Electronic medical record integration with a database for adult congenital heart disease: Early experience and progress in automating multicenter data collection.

PubMed

Broberg, Craig S; Mitchell, Julie; Rehel, Silven; Grant, Andrew; Gianola, Ann; Beninato, Peter; Winter, Christiane; Verstappen, Amy; Valente, Anne Marie; Weiss, Joseph; Zaidi, Ali; Earing, Michael G; Cook, Stephen; Daniels, Curt; Webb, Gary; Khairy, Paul; Marelli, Ariane; Gurvitz, Michelle Z; Sahn, David J

2015-10-01

The adoption of electronic health records (EHR) has created an opportunity for multicenter data collection, yet the feasibility and reliability of this methodology is unknown. The aim of this study was to integrate EHR data into a homogeneous central repository specifically addressing the field of adult congenital heart disease (ACHD). Target data variables were proposed and prioritized by consensus of investigators at five target ACHD programs. Database analysts determined which variables were available within their institutions' EHR and stratified their accessibility, and results were compared between centers. Data for patients seen in a single calendar year were extracted to a uniform database and subsequently consolidated. From 415 proposed target variables, only 28 were available in discrete formats at all centers. For variables of highest priority, 16/28 (57%) were available at all four sites, but only 11% for those of high priority. Integration was neither simple nor straightforward. Coding schemes in use for congenital heart diagnoses varied and would require additional user input for accurate mapping. There was considerable variability in procedure reporting formats and medication schemes, often with center-specific modifications. Despite the challenges, the final acquisition included limited data on 2161 patients, and allowed for population analysis of race/ethnicity, defect complexity, and body morphometrics. Large-scale multicenter automated data acquisition from EHRs is feasible yet challenging. Obstacles stem from variability in data formats, coding schemes, and adoption of non-standard lists within each EHR. The success of large-scale multicenter ACHD research will require institution-specific data integration efforts. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Fan/Ram Duct Program

DTIC Science & Technology

1973-10-01

turbofan engine shutoff scheme, the ram duct flow conditions, and the Ian duct shutoff vane area transi- tion schedule. This loss will be...airflow. The performance of the turbofan is neglected until the main engine burner is ignited. At that time it is assumed that the turbo - fan...B. Transient Operation . . .. TRANSIENT TRANSITION TEST CASES A. Turbofan to Ramjet B. Ramjet to Turbo fan CONCLUSIONS AND RECOMMENDATIONS

SuperMemo; XIA LI BA REN (Macintosh Version 1.0).

ERIC Educational Resources Information Center

Wharton, Charlotte; Bourgerie, Dana S.

1994-01-01

Describes "SuperMemo," a memorization tool that uses an automated flashcard scheme that can include sound and graphics in the database of study items. Based on the learner's performance, "SuperMemo" schedules items to appear for review. Xia Li Ba Ren ("common person" in Chinese) is the name of a Chinese word processor that runs with a standard…

Ultrafast superpixel segmentation of large 3D medical datasets

NASA Astrophysics Data System (ADS)

Leblond, Antoine; Kauffmann, Claude

2016-03-01

Even with recent hardware improvements, superpixel segmentation of large 3D medical images at interactive speed (<500 ms) remains a challenge. We will describe methods to achieve such performances using a GPU based hybrid framework implementing wavefront propagation and cellular automata resolution. Tasks will be scheduled in blocks (work units) using a wavefront propagation strategy, therefore allowing sparse scheduling. Because work units has been designed as spatially cohesive, the fast Thread Group Shared Memory can be used and reused through a Gauss-Seidel like acceleration. The work unit partitioning scheme will however vary on odd- and even-numbered iterations to reduce convergence barriers. Synchronization will be ensured by an 8-step 3D variant of the traditional Red Black Ordering scheme. An attack model and early termination will also be described and implemented as additional acceleration techniques. Using our hybrid framework and typical operating parameters, we were able to compute the superpixels of a high-resolution 512x512x512 aortic angioCT scan in 283 ms using a AMD R9 290X GPU. We achieved a 22.3X speed-up factor compared to the published reference GPU implementation.

Performance evaluation of time-aware enhanced software defined networking (TeSDN) for elastic data center optical interconnection.

PubMed

Yang, Hui; Zhang, Jie; Zhao, Yongli; Ji, Yuefeng; Li, Hui; Lin, Yi; Li, Gang; Han, Jianrui; Lee, Young; Ma, Teng

2014-07-28

Data center interconnection with elastic optical networks is a promising scenario to meet the high burstiness and high-bandwidth requirements of data center services. We previously implemented enhanced software defined networking over elastic optical network for data center application [Opt. Express 21, 26990 (2013)]. On the basis of it, this study extends to consider the time-aware data center service scheduling with elastic service time and service bandwidth according to the various time sensitivity requirements. A novel time-aware enhanced software defined networking (TeSDN) architecture for elastic data center optical interconnection has been proposed in this paper, by introducing a time-aware resources scheduling (TaRS) scheme. The TeSDN can accommodate the data center services with required QoS considering the time dimensionality, and enhance cross stratum optimization of application and elastic optical network stratums resources based on spectrum elasticity, application elasticity and time elasticity. The overall feasibility and efficiency of the proposed architecture is experimentally verified on our OpenFlow-based testbed. The performance of TaRS scheme under heavy traffic load scenario is also quantitatively evaluated based on TeSDN architecture in terms of blocking probability and resource occupation rate.

Evidence gaps in advanced cancer care: community-based clinicians' perspectives and priorities for CER.

PubMed

Lowry, Sarah J; Loggers, Elizabeth T; Bowles, Erin J A; Wagner, Edward H

2012-05-01

Although much effort has focused on identifying national comparative effectiveness research (CER) priorities, little is known about the CER priorities of community-based practitioners treating patients with advanced cancer. CER priorities of managed care-based clinicians may be valuable as reflections of both payer and provider research interests. We conducted mixed methods interviews with 10 clinicians (5 oncologists and 5 pharmacists) at 5 health plans within the Health Maintenance Organization Cancer Research Network. We asked, "What evidence do you most wish you had when treating patients with advanced cancer" and questioned participants on their impressions and knowledge of CER and pragmatic clinical trials (PCTs). We conducted qualitative analyses to identify themes across interviews. Ninety percent of participants had heard of CER, 20% had heard of PCTs, and all rated CER/PCTs as highly relevant to patient and health plan decision making. Each participant offered between 3 and 10 research priorities. Half (49%) involved head-to-head treatment comparisons; another 20% involved comparing different schedules or dosing regimens of the same treatment. The majority included alternative outcomes to survival (eg, toxicity, quality of life, noninferiority). Participants cited several limitations to existing evidence, including lack of generalizability, funding biases, and rapid development of new treatments. Head-to-head treatment comparisons remain a major evidence need among community- based oncology clinicians, and CER/PCTs are highly valued methods to address the limitations of traditional randomized trials, answer questions of cost-effectiveness or noninferiority, and inform data-driven dialogue and decision making by all stakeholders.

Factors that influence the efficiency of beef and dairy cattle recording system in Kenya: A SWOT-AHP analysis.

PubMed

Wasike, Chrilukovian B; Magothe, Thomas M; Kahi, Alexander K; Peters, Kurt J

2011-01-01

Animal recording in Kenya is characterised by erratic producer participation and high drop-out rates from the national recording scheme. This study evaluates factors influencing efficiency of beef and dairy cattle recording system. Factors influencing efficiency of animal identification and registration, pedigree and performance recording, and genetic evaluation and information utilisation were generated using qualitative and participatory methods. Pairwise comparison of factors was done by strengths, weaknesses, opportunities and threats-analytical hierarchical process analysis and priority scores to determine their relative importance to the system calculated using Eigenvalue method. For identification and registration, and evaluation and information utilisation, external factors had high priority scores. For pedigree and performance recording, threats and weaknesses had the highest priority scores. Strengths factors could not sustain the required efficiency of the system. Weaknesses of the system predisposed it to threats. Available opportunities could be explored as interventions to restore efficiency in the system. Defensive strategies such as reorienting the system to offer utility benefits to recording, forming symbiotic and binding collaboration between recording organisations and NARS, and development of institutions to support recording were feasible.

An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm

PubMed Central

Lu, Guangquan; Xiong, Ying; Wang, Yunpeng

2016-01-01

The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration. PMID:27768732

The DEEP-South: Scheduling and Data Reduction Software System

NASA Astrophysics Data System (ADS)

Yim, Hong-Suh; Kim, Myung-Jin; Bae, Youngho; Moon, Hong-Kyu; Choi, Young-Jun; Roh, Dong-Goo; the DEEP-South Team

2015-08-01

The DEep Ecliptic Patrol of the Southern sky (DEEP-South), started in October 2012, is currently in test runs with the first Korea Microlensing Telescope Network (KMTNet) 1.6 m wide-field telescope located at CTIO in Chile. While the primary objective for the DEEP-South is physical characterization of small bodies in the Solar System, it is expected to discover a large number of such bodies, many of them previously unknown.An automatic observation planning and data reduction software subsystem called "The DEEP-South Scheduling and Data reduction System" (the DEEP-South SDS) is currently being designed and implemented for observation planning, data reduction and analysis of huge amount of data with minimum human interaction. The DEEP-South SDS consists of three software subsystems: the DEEP-South Scheduling System (DSS), the Local Data Reduction System (LDR), and the Main Data Reduction System (MDR). The DSS manages observation targets, makes decision on target priority and observation methods, schedules nightly observations, and archive data using the Database Management System (DBMS). The LDR is designed to detect moving objects from CCD images, while the MDR conducts photometry and reconstructs lightcurves. Based on analysis made at the LDR and the MDR, the DSS schedules follow-up observation to be conducted at other KMTNet stations. In the end of 2015, we expect the DEEP-South SDS to achieve a stable operation. We also have a plan to improve the SDS to accomplish finely tuned observation strategy and more efficient data reduction in 2016.

Design and evaluation of a theory-based, culturally relevant outreach model for breast and cervical cancer screening for Latina immigrants.

PubMed

White, Kari; Garces, Isabel C; Bandura, Lisa; McGuire, Allison A; Scarinci, Isabel C

2012-01-01

Breast and cervical cancer are common among Latinas, but screening rates among foreign-born Latinas are relatively low. In this article we describe the design and implementation of a theory-based (PEN-3) outreach program to promote breast and cervical cancer screening to Latina immigrants, and evaluate the program's effectiveness. We used data from self-administered questionnaires completed at six annual outreach events to examine the sociodemographic characteristics of attendees and evaluate whether the program reached the priority population - foreign-born Latina immigrants with limited access to health care and screening services. To evaluate the program's effectiveness in connecting women to screening, we examined the proportion and characteristics of women who scheduled and attended Pap smear and mammography appointments. Among the 782 Latinas who attended the outreach program, 60% and 83% had not had a Pap smear or mammogram, respectively, in at least a year. Overall, 80% scheduled a Pap smear and 78% scheduled a mammogram. Women without insurance, who did not know where to get screening and had not been screened in the last year were more likely to schedule appointments (P < .05). Among women who scheduled appointments, 65% attended their Pap smear and 79% attended the mammogram. We did not identify significant differences in sociodemographic characteristics associated with appointment attendance. Using a theoretical approach to outreach design and implementation, it is possible to reach a substantial number of Latina immigrants and connect them to cancer screening services.

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

PubMed

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

2016-08-01

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

Adaptive Subframe Partitioning and Efficient Packet Scheduling in OFDMA Cellular System with Fixed Decode-and-Forward Relays

NASA Astrophysics Data System (ADS)

Wang, Liping; Ji, Yusheng; Liu, Fuqiang

The integration of multihop relays with orthogonal frequency-division multiple access (OFDMA) cellular infrastructures can meet the growing demands for better coverage and higher throughput. Resource allocation in the OFDMA two-hop relay system is more complex than that in the conventional single-hop OFDMA system. With time division between transmissions from the base station (BS) and those from relay stations (RSs), fixed partitioning of the BS subframe and RS subframes can not adapt to various traffic demands. Moreover, single-hop scheduling algorithms can not be used directly in the two-hop system. Therefore, we propose a semi-distributed algorithm called ASP to adjust the length of every subframe adaptively, and suggest two ways to extend single-hop scheduling algorithms into multihop scenarios: link-based and end-to-end approaches. Simulation results indicate that the ASP algorithm increases system utilization and fairness. The max carrier-to-interference ratio (Max C/I) and proportional fairness (PF) scheduling algorithms extended using the end-to-end approach obtain higher throughput than those using the link-based approach, but at the expense of more overhead for information exchange between the BS and RSs. The resource allocation scheme using ASP and end-to-end PF scheduling achieves a tradeoff between system throughput maximization and fairness.

Minimizing metastatic risk in radiotherapy fractionation schedules

NASA Astrophysics Data System (ADS)

Badri, Hamidreza; Ramakrishnan, Jagdish; Leder, Kevin

2015-11-01

Metastasis is the process by which cells from a primary tumor disperse and form new tumors at distant anatomical locations. The treatment and prevention of metastatic cancer remains an extremely challenging problem. This work introduces a novel biologically motivated objective function to the radiation optimization community that takes into account metastatic risk instead of the status of the primary tumor. In this work, we consider the problem of developing fractionated irradiation schedules that minimize production of metastatic cancer cells while keeping normal tissue damage below an acceptable level. A dynamic programming framework is utilized to determine the optimal fractionation scheme. We evaluated our approach on a breast cancer case using the heart and the lung as organs-at-risk (OAR). For small tumor α /β values, hypo-fractionated schedules were optimal, which is consistent with standard models. However, for relatively larger α /β values, we found the type of schedule depended on various parameters such as the time when metastatic risk was evaluated, the α /β values of the OARs, and the normal tissue sparing factors. Interestingly, in contrast to standard models, hypo-fractionated and semi-hypo-fractionated schedules (large initial doses with doses tapering off with time) were suggested even with large tumor α/β values. Numerical results indicate the potential for significant reduction in metastatic risk.

STS-107 Columbia rollout to Launch Pad 39A

NASA Technical Reports Server (NTRS)

2002-01-01

KENNEDY SPACE CENTER, FLA. -- Space Shuttle Columbia, framed by trees near the Banana River, rolls towards Launch Pad 39A, sitting atop the Mobile Launcher Platform, which in turn is carried by the crawler-transporter underneath. The STS-107 research mission comprises experiments ranging from material sciences to life sciences (many rats), plus the Fast Reaction Experiments Enabling Science, Technology, Applications and Research (FREESTAR) that incorporates eight high priority secondary attached shuttle experiments. Mission STS-107 is scheduled to launch Jan. 16, 2003.

Launch team training system

NASA Technical Reports Server (NTRS)

Webb, J. T.

1988-01-01

A new approach to the training, certification, recertification, and proficiency maintenance of the Shuttle launch team is proposed. Previous training approaches are first reviewed. Short term program goals include expanding current training methods, improving the existing simulation capability, and scheduling training exercises with the same priority as hardware tests. Long-term goals include developing user requirements which would take advantage of state-of-the-art tools and techniques. Training requirements for the different groups of people to be trained are identified, and future goals are outlined.

Using Animated Computer Simulation to Determine the Optimal Resource Support for the Endodontic Specialty Practice at Fort Lewis.

DTIC Science & Technology

1998-03-01

Series Pt Endo Tx 114 Time Series Pt Perio Ex 114 None Pt Perio Tx 114 None Pt Perio Sx 114 None Pt Perio Pot 114 None Pt Exam 114 None Pt Other...prevention, diagnosis, and treatment of diseases and injuries that affect the dental pulp, tooth root, and periapical tissue" (Jablonski, 1982...Time Priority Scheduled Disable Logic Entrance 1 480 99 Yes No wait 180 * Entities * Name Speed (fpm) Stats Pt Endo Ex 114 Time

KSC-02pd1198

NASA Image and Video Library

2002-08-19

KENNEDY SPACE CENTER, FLA. -- Only the nose and tail of Columbia are visible as it sits inside an protective tent used to keep out moisture. The orbiter is next scheduled to fly on mission STS-107 no earlier than Nov. 29. STS-107 is a research mission. The payload includes the Hitchhiker Bridge, a carrier for the Fast Reaction Experiments Enabling Science, Technology, Applications and Research (FREESTAR) that incorporates eight high priority secondary attached shuttle experiments, plus the SHI Research Double Module (SHI/RDM), also known as SPACEHAB.

Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

NASA Technical Reports Server (NTRS)

Short, Nick, Jr.; Bedet, Jean-Jacques; Bodden, Lee; Boddy, Mark; White, Jim; Beane, John

1994-01-01

The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications scheduling.

QoS-Oriented High Dynamic Resource Allocation in Vehicular Communication Networks

PubMed Central

2014-01-01

Vehicular ad hoc networks (VANETs) are emerging as new research area and attracting an increasing attention from both industry and research communities. In this context, a dynamic resource allocation policy that maximizes the use of available resources and meets the quality of service (QoS) requirement of constraining applications is proposed. It is a combination of a fair packet scheduling policy and a new adaptive QoS oriented call admission control (CAC) scheme based on the vehicle density variation. This scheme decides whether the connection request is to be admitted into the system, while providing fair access and guaranteeing the desired throughput. The proposed algorithm showed good performance in testing in real world environment. PMID:24616639

Interval Analysis Approach to Prototype the Robust Control of the Laboratory Overhead Crane

NASA Astrophysics Data System (ADS)

Smoczek, J.; Szpytko, J.; Hyla, P.

2014-07-01

The paper describes the software-hardware equipment and control-measurement solutions elaborated to prototype the laboratory scaled overhead crane control system. The novelty approach to crane dynamic system modelling and fuzzy robust control scheme design is presented. The iterative procedure for designing a fuzzy scheduling control scheme is developed based on the interval analysis of discrete-time closed-loop system characteristic polynomial coefficients in the presence of rope length and mass of a payload variation to select the minimum set of operating points corresponding to the midpoints of membership functions at which the linear controllers are determined through desired poles assignment. The experimental results obtained on the laboratory stand are presented.

Design Process Improvement for Electric CAR Harness

NASA Astrophysics Data System (ADS)

Sawatdee, Thiwarat; Chutima, Parames

2017-06-01

In an automobile parts design company, the customer satisfaction is one of the most important factors for product design. Therefore, the company employs all means to focus its product design process based on the various requirements of customers resulting in high number of design changes. The objective of this research is to improve the design process of the electric car harness that effects the production scheduling by using Fault Tree Analysis (FTA) and Failure Mode and Effect Analysis (FMEA) as the main tools. FTA is employed for root cause analysis and FMEA is used to ranking a High Risk Priority Number (RPN) which is shows the priority of factors in the electric car harness that have high impact to the design of the electric car harness. After the implementation, the improvements are realized significantly since the number of design change is reduced from 0.26% to 0.08%.

The no-show rate in a high-risk obstetric clinic.

PubMed

Campbell, J D; Chez, R A; Queen, T; Barcelo, A; Patron, E

2000-10-01

We wished to determine the reasons for an average missed appointment rate of 28% in a high-risk pregnancy clinic. Only 41% of the 261 women in the study group could be reached by telephone. The reasons included not having a phone, the phone had been disconnected, incorrect phone number on the chart, the patient had moved, and the patient did not respond to the answering machine message. The reasons for missing the appointment included lack of transportation, scheduling problems, overslept or forgot, presence of a sick child or relative, and lack of child care. The response of patients to assessing prenatal care may reflect their priority of medical care relative to other priorities associated with day-to-day existence. There may be a baseline missed appointment rate for prenatal care in lower socioeconomic populations of women. The commitment of personnel time and energy to attempt to modify the no-show rate should be reexamined.

Priority-based methods for reducing the impact of packet loss on HEVC encoded video streams

NASA Astrophysics Data System (ADS)

Nightingale, James; Wang, Qi; Grecos, Christos

2013-02-01

The rapid growth in the use of video streaming over IP networks has outstripped the rate at which new network infrastructure has been deployed. These bandwidth-hungry applications now comprise a significant part of all Internet traffic and present major challenges for network service providers. The situation is more acute in mobile networks where the available bandwidth is often limited. Work towards the standardisation of High Efficiency Video Coding (HEVC), the next generation video coding scheme, is currently on track for completion in 2013. HEVC offers the prospect of a 50% improvement in compression over the current H.264 Advanced Video Coding standard (H.264/AVC) for the same quality. However, there has been very little published research on HEVC streaming or the challenges of delivering HEVC streams in resource-constrained network environments. In this paper we consider the problem of adapting an HEVC encoded video stream to meet the bandwidth limitation in a mobile networks environment. Video sequences were encoded using the Test Model under Consideration (TMuC HM6) for HEVC. Network abstraction layers (NAL) units were packetized, on a one NAL unit per RTP packet basis, and transmitted over a realistic hybrid wired/wireless testbed configured with dynamically changing network path conditions and multiple independent network paths from the streamer to the client. Two different schemes for the prioritisation of RTP packets, based on the NAL units they contain, have been implemented and empirically compared using a range of video sequences, encoder configurations, bandwidths and network topologies. In the first prioritisation method the importance of an RTP packet was determined by the type of picture and the temporal switching point information carried in the NAL unit header. Packets containing parameter set NAL units and video coding layer (VCL) NAL units of the instantaneous decoder refresh (IDR) and the clean random access (CRA) pictures were given the highest priority followed by NAL units containing pictures used as reference pictures from which others can be predicted. The second method assigned a priority to each NAL unit based on the rate-distortion cost of the VCL coding units contained in the NAL unit. The sum of the rate-distortion costs of each coding unit contained in a NAL unit was used as the priority weighting. The preliminary results of extensive experiments have shown that all three schemes offered an improvement in PSNR, when comparing original and decoded received streams, over uncontrolled packet loss. Using the first method consistently delivered a significant average improvement of 0.97dB over the uncontrolled scenario while the second method provided a measurable, but less consistent, improvement across the range of testing conditions and encoder configurations.

In the linear quadratic model, the Poisson approximation and the Zaider-Minerbo formula agree on the ranking of tumor control probabilities, up to a critical cell birth rate.

PubMed

Ballhausen, Hendrik; Belka, Claus

2017-03-01

To provide a rule for the agreement or disagreement of the Poisson approximation (PA) and the Zaider-Minerbo formula (ZM) on the ranking of treatment alternatives in terms of tumor control probability (TCP) in the linear quadratic model. A general criterion involving a critical cell birth rate was formally derived. For demonstration, the criterion was applied to a distinct radiobiological model of fast growing head and neck tumors and a respective range of 22 conventional and nonconventional head and neck schedules. There is a critical cell birth rate b crit below which PA and ZM agree on which one out of two alternative treatment schemes with single-cell survival curves S'(t) and S''(t) offers better TCP: [Formula: see text] For cell birth rates b above this critical cell birth rate, PA and ZM disagree if and only if b >b crit > 0. In case of the exemplary head and neck schedules, out of 231 possible combinations, only 16 or 7% were found where PA and ZM disagreed. In all 231 cases the prediction of the criterion was numerically confirmed, and cell birth rates at crossovers between schedules matched the calculated critical cell birth rates. TCP estimated by PA and ZM almost never numerically coincide. Still, in many cases both formulas at least agree about which one out of two alternative fractionation schemes offers better TCP. In case of fast growing tumors featuring a high cell birth rate, however, ZM may suggest a re-evaluation of treatment options.

The midwives service scheme: a qualitative comparison of contextual determinants of the performance of two states in central Nigeria.

PubMed

Okpani, Arnold I; Abimbola, Seye

2016-01-01

The federal government of Nigeria started the Midwives Service Scheme in 2009 to address the scarcity of skilled health workers in rural communities by temporarily redistributing midwives from urban to rural communities. The scheme was designed as a collaboration among federal, state and local governments. Six years on, this study examines the contextual factors that account for the differences in performance of the scheme in Benue and Kogi, two contiguous states in central Nigeria. We obtained qualitative data through 14 in-depth interviews and 2 focus group discussions: 14 government officials at the federal, state and local government levels were interviewed to explore their perceptions on the design, implementation and sustainability of the Midwives Service Scheme. In addition, mothers in rural communities participated in 2 focus group discussions (one in each state) to elicit their views on Midwives Service Scheme services. The qualitative data were analysed for themes. The inability of the federal government to substantially influence the health care agenda of sub-national governments was a significant impediment to the achievement of the objectives of the Midwives Service Scheme. Participants identified differences in government prioritisation of primary health care between Benue and Kogi as relevant to maternal and child health outcomes in those states: Kogi was far more supportive of the Midwives Service Scheme and primary health care more broadly. High user fees in Benue was a significant barrier to the uptake of available maternal and child health services. Differential levels of political support and prioritisation, alongside financial barriers, contribute substantially to the uptake of maternal and child health services. For collaborative health sector strategies to gain sufficient traction, where federating units determine their health care priorities, they must be accompanied by strong and enforceable commitment by sub-national governments.

Efficient priority queueing routing strategy on networks of mobile agents

NASA Astrophysics Data System (ADS)

Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

2018-03-01

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

Evaluation of different infant vaccination schedules incorporating pneumococcal vaccination (The Vietnam Pneumococcal Project): protocol of a randomised controlled trial

PubMed Central

Temple, Beth; Toan, Nguyen Trong; Uyen, Doan Y; Balloch, Anne; Bright, Kathryn; Cheung, Yin Bun; Licciardi, Paul; Nguyen, Cattram Duong; Phuong, Nguyen Thi Minh; Satzke, Catherine; Smith-Vaughan, Heidi; Vu, Thi Que Huong; Huu, Tran Ngoc; Mulholland, Edward Kim

2018-01-01

Introduction WHO recommends the use of pneumococcal conjugate vaccine (PCV) as a priority. However, there are many countries yet to introduce PCV, especially in Asia. This trial aims to evaluate different PCV schedules and to provide a head-to-head comparison of PCV10 and PCV13 in order to generate evidence to assist with decisions regarding PCV introduction. Schedules will be compared in relation to their immunogenicity and impact on nasopharyngeal carriage of Streptococcus pneumoniae and Haemophilus influenzae. Methods and analysis This randomised, single-blind controlled trial involves 1200 infants recruited at 2 months of age to one of six infant PCV schedules: PCV10 in a 3+1, 3+0, 2+1 or two-dose schedule; PCV13 in a 2+1 schedule; and controls that receive two doses of PCV10 and 18 and 24 months. An additional control group of 200 children is recruited at 18 months that receive one dose of PCV10 at 24 months. All participants are followed up until 24 months of age. The primary outcome is the post-primary series immunogenicity, expressed as the proportions of participants with serotype-specific antibody levels ≥0.35 µg/mL for each serotype in PCV10. Ethics and dissemination Ethical approval has been obtained from the Human Research Ethics Committee of the Northern Territory Department of Health and Menzies School of Health Research (EC00153) and the Vietnam Ministry of Health Ethics Committee. The results, interpretation and conclusions will be presented to parents and guardians, at national and international conferences, and published in peer-reviewed open access journals. Trial registration number NCT01953510; Pre-results. PMID:29884695

The LSST operations simulator

NASA Astrophysics Data System (ADS)

Delgado, Francisco; Saha, Abhijit; Chandrasekharan, Srinivasan; Cook, Kem; Petry, Catherine; Ridgway, Stephen

2014-08-01

The Operations Simulator for the Large Synoptic Survey Telescope (LSST; http://www.lsst.org) allows the planning of LSST observations that obey explicit science driven observing specifications, patterns, schema, and priorities, while optimizing against the constraints placed by design-specific opto-mechanical system performance of the telescope facility, site specific conditions as well as additional scheduled and unscheduled downtime. It has a detailed model to simulate the external conditions with real weather history data from the site, a fully parameterized kinematic model for the internal conditions of the telescope, camera and dome, and serves as a prototype for an automatic scheduler for the real time survey operations with LSST. The Simulator is a critical tool that has been key since very early in the project, to help validate the design parameters of the observatory against the science requirements and the goals from specific science programs. A simulation run records the characteristics of all observations (e.g., epoch, sky position, seeing, sky brightness) in a MySQL database, which can be queried for any desired purpose. Derivative information digests of the observing history are made with an analysis package called Simulation Survey Tools for Analysis and Reporting (SSTAR). Merit functions and metrics have been designed to examine how suitable a specific simulation run is for several different science applications. Software to efficiently compare the efficacy of different survey strategies for a wide variety of science applications using such a growing set of metrics is under development. A recent restructuring of the code allows us to a) use "look-ahead" strategies that avoid cadence sequences that cannot be completed due to observing constraints; and b) examine alternate optimization strategies, so that the most efficient scheduling algorithm(s) can be identified and used: even few-percent efficiency gains will create substantive scientific opportunity. The enhanced simulator is being used to assess the feasibility of desired observing cadences, study the impact of changing science program priorities and assist with performance margin investigations of the LSST system.

The effects of sample scheduling and sample numbers on estimates of the annual fluxes of suspended sediment in fluvial systems

USGS Publications Warehouse

Horowitz, Arthur J.; Clarke, Robin T.; Merten, Gustavo Henrique

2015-01-01

Since the 1970s, there has been both continuing and growing interest in developing accurate estimates of the annual fluvial transport (fluxes and loads) of suspended sediment and sediment-associated chemical constituents. This study provides an evaluation of the effects of manual sample numbers (from 4 to 12 year−1) and sample scheduling (random-based, calendar-based and hydrology-based) on the precision, bias and accuracy of annual suspended sediment flux estimates. The evaluation is based on data from selected US Geological Survey daily suspended sediment stations in the USA and covers basins ranging in area from just over 900 km2 to nearly 2 million km2 and annual suspended sediment fluxes ranging from about 4 Kt year−1 to about 200 Mt year−1. The results appear to indicate that there is a scale effect for random-based and calendar-based sampling schemes, with larger sample numbers required as basin size decreases. All the sampling schemes evaluated display some level of positive (overestimates) or negative (underestimates) bias. The study further indicates that hydrology-based sampling schemes are likely to generate the most accurate annual suspended sediment flux estimates with the fewest number of samples, regardless of basin size. This type of scheme seems most appropriate when the determination of suspended sediment concentrations, sediment-associated chemical concentrations, annual suspended sediment and annual suspended sediment-associated chemical fluxes only represent a few of the parameters of interest in multidisciplinary, multiparameter monitoring programmes. The results are just as applicable to the calibration of autosamplers/suspended sediment surrogates currently used to measure/estimate suspended sediment concentrations and ultimately, annual suspended sediment fluxes, because manual samples are required to adjust the sample data/measurements generated by these techniques so that they provide depth-integrated and cross-sectionally representative data. 

Schedule-Dependent Antiangiogenic and Cytotoxic Effects of Chemotherapy on Vascular Endothelial and Retinoblastoma Cells.

PubMed

Winter, Ursula; Mena, Hebe A; Negrotto, Soledad; Arana, Eloisa; Pascual-Pasto, Guillem; Laurent, Viviana; Suñol, Mariona; Chantada, Guillermo L; Carcaboso, Angel M; Schaiquevich, Paula

2016-01-01

Current treatment of retinoblastoma involves using the maximum dose of chemotherapy that induces tumor control and is tolerated by patients. The impact of dose and schedule on the cytotoxicity of chemotherapy has not been studied. Our aim was to gain insight into the cytotoxic and antiangiogenic effect of the treatment scheme of chemotherapy used in retinoblastoma by means of different in vitro models and to evaluate potential effects on multi-drug resistance proteins. Two commercial and two patient-derived retinoblastoma cell types and two human vascular endothelial cell types were exposed to increasing concentrations of melphalan or topotecan in a conventional (single exposure) or metronomic (7-day continuous exposure) treatment scheme. The concentration of chemotherapy causing a 50% decrease in cell proliferation (IC50) was determined by MTT and induction of apoptosis was evaluated by flow cytometry. Expression of ABCB1, ABCG2 and ABCC1 after conventional or metronomic treatments was assessed by RT-qPCR. We also evaluated the in vivo response to conventional (0.6 mg/kg once a week for 2 weeks) and metronomic (5 days a week for 2 weeks) topotecan in a retinoblastoma xenograft model. Melphalan and topotecan were cytotoxic to both retinoblastoma and endothelial cells after conventional and metronomic treatments. A significant decrease in the IC50 (median, 13-fold; range: 3-23) was observed following metronomic chemotherapy treatment in retinoblastoma and endothelial cell types compared to conventional treatment (p<0.05). Metronomic topotecan or melphalan significantly inhibited in vitro tube formation in HUVEC and EPC compared to vehicle-treated cells (p<0.05). Both treatment schemes induced apoptosis and/or necrosis in all cell models. No significant difference was observed in the expression of ABCB1, ABCC1 or ABCG2 when comparing cells treated with melphalan or topotecan between treatment schedules at the IC50 or with control cells (p>0.05). In mice, continuous topotecan lead to significantly lower tumor volumes compared to conventional treatment after 14 days of treatment (p<0.05). Continuous exposure to melphalan or topotecan increased the chemosensitivity of retinoblastoma and endothelial cells to both chemotherapy agents with lower IC50 values compared to short-term treatment. These findings were validated in an in vivo model. None of the dosing modalities induced multidrug resistance mechanisms while apoptosis was the mechanism of cell death after both treatment schedules. Metronomic chemotherapy may be a valid option for retinoblastoma treatment allowing reductions of the daily dose.

Optimal scheduling of micro grids based on single objective programming

NASA Astrophysics Data System (ADS)

Chen, Yue

2018-04-01

Faced with the growing demand for electricity and the shortage of fossil fuels, how to optimally optimize the micro-grid has become an important research topic to maximize the economic, technological and environmental benefits of the micro-grid. This paper considers the role of the battery and the micro-grid and power grid to allow the exchange of power not exceeding 150kW preconditions, the main study of the economy to load for the goal is to minimize the electricity cost (abandonment of wind), to establish an optimization model, and to solve the problem by genetic algorithm. The optimal scheduling scheme is obtained and the utilization of renewable energy and the impact of the battery involved in regulation are analyzed.

Three hybridization models based on local search scheme for job shop scheduling problem

NASA Astrophysics Data System (ADS)

Balbi Fraga, Tatiana

2015-05-01

This work presents three different hybridization models based on the general schema of Local Search Heuristics, named Hybrid Successive Application, Hybrid Neighborhood, and Hybrid Improved Neighborhood. Despite similar approaches might have already been presented in the literature in other contexts, in this work these models are applied to analyzes the solution of the job shop scheduling problem, with the heuristics Taboo Search and Particle Swarm Optimization. Besides, we investigate some aspects that must be considered in order to achieve better solutions than those obtained by the original heuristics. The results demonstrate that the algorithms derived from these three hybrid models are more robust than the original algorithms and able to get better results than those found by the single Taboo Search.

State health insurance and out-of-pocket health expenditures in Andhra Pradesh, India.

PubMed

Fan, Victoria Y; Karan, Anup; Mahal, Ajay

2012-09-01

In 2007 the state of Andhra Pradesh in southern India began rolling out Aarogyasri health insurance to reduce catastrophic health expenditures in households 'below the poverty line'. We exploit variation in program roll-out over time and districts to evaluate the impacts of the scheme using difference-in-differences. Our results suggest that within the first nine months of implementation Phase I of Aarogyasri significantly reduced out-of-pocket inpatient expenditures and, to a lesser extent, outpatient expenditures. These results are robust to checks using quantile regression and matching methods. No clear effects on catastrophic health expenditures or medical impoverishment are seen. Aarogyasri is not benefiting scheduled caste and scheduled tribe households as much as the rest of the population.

A novel dynamic wavelength bandwidth allocation scheme over OFDMA PONs

NASA Astrophysics Data System (ADS)

Yan, Bo; Guo, Wei; Jin, Yaohui; Hu, Weisheng

2011-12-01

With rapid growth of Internet applications, supporting differentiated service and enlarging system capacity have been new tasks for next generation access system. In recent years, research in OFDMA Passive Optical Networks (PON) has experienced extraordinary development as for its large capacity and flexibility in scheduling. Although much work has been done to solve hardware layer obstacles for OFDMA PON, scheduling algorithm on OFDMA PON system is still under primary discussion. In order to support QoS service on OFDMA PON system, a novel dynamic wavelength bandwidth allocation (DWBA) algorithm is proposed in this paper. Per-stream QoS service is supported in this algorithm. Through simulation, we proved our bandwidth allocation algorithm performs better in bandwidth utilization and differentiate service support.

Job Superscheduler Architecture and Performance in Computational Grid Environments

NASA Technical Reports Server (NTRS)

Shan, Hongzhang; Oliker, Leonid; Biswas, Rupak

2003-01-01

Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major technical hurdles, including distributed resource management and effective job scheduling, stand in the way of realizing these gains. In this paper, we propose a novel grid superscheduler architecture and three distributed job migration algorithms. We also model the critical interaction between the superscheduler and autonomous local schedulers. Extensive performance comparisons with ideal, central, and local schemes using real workloads from leading computational centers are conducted in a simulation environment. Additionally, synthetic workloads are used to perform a detailed sensitivity analysis of our superscheduler. Several key metrics demonstrate that substantial performance gains can be achieved via smart superscheduling in distributed computational grids.

Research on logistics scheduling based on PSO

NASA Astrophysics Data System (ADS)

Bao, Huifang; Zhou, Linli; Liu, Lei

2017-08-01

With the rapid development of e-commerce based on the network, the logistics distribution support of e-commerce is becoming more and more obvious. The optimization of vehicle distribution routing can improve the economic benefit and realize the scientific of logistics [1]. Therefore, the study of logistics distribution vehicle routing optimization problem is not only of great theoretical significance, but also of considerable value of value. Particle swarm optimization algorithm is a kind of evolutionary algorithm, which is based on the random solution and the optimal solution by iteration, and the quality of the solution is evaluated through fitness. In order to obtain a more ideal logistics scheduling scheme, this paper proposes a logistics model based on particle swarm optimization algorithm.

Web Site Development Support

NASA Technical Reports Server (NTRS)

Abdul, Hameed

2016-01-01

This summer I assisted the RPT Program Office in developing a design plan to update their existing website to current NASA web standards. The finished website is intended for the general public, specifically potential customers interested in learning about NASA's chemical rocket test facility capabilities and test assignment process. The goal of the website is to give the public insight about the purpose and function of the RPT Program. Working on this project gave me the opportunity to learn skills necessary for effective project management. The RPT Program Office manages numerous facilities so they are required to travel often to other sites for meetings throughout the year. Maneuvering around the travel schedule of the office and the workload priority of the IT Department proved to be quite the challenge. I overcame the travel schedule of the office by frequently communicating and checking in with my mentor via email and telephone.

Satellite-instrument system engineering best practices and lessons

NASA Astrophysics Data System (ADS)

Schueler, Carl F.

2009-08-01

This paper focuses on system engineering development issues driving satellite remote sensing instrumentation cost and schedule. A key best practice is early assessment of mission and instrumentation requirements priorities driving performance trades among major instrumentation measurements: Radiometry, spatial field of view and image quality, and spectral performance. Key lessons include attention to technology availability and applicability to prioritized requirements, care in applying heritage, approaching fixed-price and cost-plus contracts with appropriate attention to risk, and assessing design options with attention to customer preference as well as design performance, and development cost and schedule. A key element of success either in contract competition or execution is team experience. Perhaps the most crucial aspect of success, however, is thorough requirements analysis and flowdown to specifications driving design performance with sufficient parameter margin to allow for mistakes or oversights - the province of system engineering from design inception to development, test and delivery.

An applied study using systems engineering methods to prioritize green systems options

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Sonya M; Macdonald, John M

2009-01-01

For many years, there have been questions about the effectiveness of applying different green solutions. If you're building a home and wish to use green technologies, where do you start? While all technologies sound promising, which will perform the best over time? All this has to be considered within the cost and schedule of the project. The amount of information available on the topic can be overwhelming. We seek to examine if Systems Engineering methods can be used to help people choose and prioritize technologies that fit within their project and budget. Several methods are used to gain perspective intomore » how to select the green technologies, such as the Analytic Hierarchy Process (AHP) and Kepner-Tregoe. In our study, subjects applied these methods to analyze cost, schedule, and trade-offs. Results will document whether the experimental approach is applicable to defining system priorities for green technologies.« less

Optimal scheduling and its Lyapunov stability for advanced load-following energy plants with CO 2 capture

DOE PAGES

Bankole, Temitayo; Jones, Dustin; Bhattacharyya, Debangsu; ...

2017-11-03

In this study, a two-level control methodology consisting of an upper-level scheduler and a lower-level supervisory controller is proposed for an advanced load-following energy plant with CO 2 capture. With the use of an economic objective function that considers fluctuation in electricity demand and price at the upper level, optimal scheduling of energy plant electricity production and carbon capture with respect to several carbon tax scenarios is implemented. The optimal operational profiles are then passed down to corresponding lower-level supervisory controllers designed using a methodological approach that balances control complexity with performance. Finally, it is shown how optimal carbon capturemore » and electricity production rate profiles for an energy plant such as the integrated gasification combined cycle (IGCC) plant are affected by electricity demand and price fluctuations under different carbon tax scenarios. As a result, the paper also presents a Lyapunov stability analysis of the proposed scheme.« less

Optimal scheduling and its Lyapunov stability for advanced load-following energy plants with CO 2 capture

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bankole, Temitayo; Jones, Dustin; Bhattacharyya, Debangsu

In this study, a two-level control methodology consisting of an upper-level scheduler and a lower-level supervisory controller is proposed for an advanced load-following energy plant with CO 2 capture. With the use of an economic objective function that considers fluctuation in electricity demand and price at the upper level, optimal scheduling of energy plant electricity production and carbon capture with respect to several carbon tax scenarios is implemented. The optimal operational profiles are then passed down to corresponding lower-level supervisory controllers designed using a methodological approach that balances control complexity with performance. Finally, it is shown how optimal carbon capturemore » and electricity production rate profiles for an energy plant such as the integrated gasification combined cycle (IGCC) plant are affected by electricity demand and price fluctuations under different carbon tax scenarios. As a result, the paper also presents a Lyapunov stability analysis of the proposed scheme.« less

Cross-Layer Design for Video Transmission over Wireless Rician Slow-Fading Channels Using an Adaptive Multiresolution Modulation and Coding Scheme

NASA Astrophysics Data System (ADS)

Pei, Yong; Modestino, James W.

2007-12-01

We describe a multilayered video transport scheme for wireless channels capable of adapting to channel conditions in order to maximize end-to-end quality of service (QoS). This scheme combines a scalable H.263+ video source coder with unequal error protection (UEP) across layers. The UEP is achieved by employing different channel codes together with a multiresolution modulation approach to transport the different priority layers. Adaptivity to channel conditions is provided through a joint source-channel coding (JSCC) approach which attempts to jointly optimize the source and channel coding rates together with the modulation parameters to obtain the maximum achievable end-to-end QoS for the prevailing channel conditions. In this work, we model the wireless links as slow-fading Rician channel where the channel conditions can be described in terms of the channel signal-to-noise ratio (SNR) and the ratio of specular-to-diffuse energy[InlineEquation not available: see fulltext.]. The multiresolution modulation/coding scheme consists of binary rate-compatible punctured convolutional (RCPC) codes used together with nonuniform phase-shift keyed (PSK) signaling constellations. Results indicate that this adaptive JSCC scheme employing scalable video encoding together with a multiresolution modulation/coding approach leads to significant improvements in delivered video quality for specified channel conditions. In particular, the approach results in considerably improved graceful degradation properties for decreasing channel SNR.

Managing distributed software development in the Virtual Astronomical Observatory

NASA Astrophysics Data System (ADS)

Evans, Janet D.; Plante, Raymond L.; Boneventura, Nina; Busko, Ivo; Cresitello-Dittmar, Mark; D'Abrusco, Raffaele; Doe, Stephen; Ebert, Rick; Laurino, Omar; Pevunova, Olga; Refsdal, Brian; Thomas, Brian

2012-09-01

The U.S. Virtual Astronomical Observatory (VAO) is a product-driven organization that provides new scientific research capabilities to the astronomical community. Software development for the VAO follows a lightweight framework that guides development of science applications and infrastructure. Challenges to be overcome include distributed development teams, part-time efforts, and highly constrained schedules. We describe the process we followed to conquer these challenges while developing Iris, the VAO application for analysis of 1-D astronomical spectral energy distributions (SEDs). Iris was successfully built and released in less than a year with a team distributed across four institutions. The project followed existing International Virtual Observatory Alliance inter-operability standards for spectral data and contributed a SED library as a by-product of the project. We emphasize lessons learned that will be folded into future development efforts. In our experience, a well-defined process that provides guidelines to ensure the project is cohesive and stays on track is key to success. Internal product deliveries with a planned test and feedback loop are critical. Release candidates are measured against use cases established early in the process, and provide the opportunity to assess priorities and make course corrections during development. Also key is the participation of a stakeholder such as a lead scientist who manages the technical questions, advises on priorities, and is actively involved as a lead tester. Finally, frequent scheduled communications (for example a bi-weekly tele-conference) assure issues are resolved quickly and the team is working toward a common vision.

Multiobjective optimisation design for enterprise system operation in the case of scheduling problem with deteriorating jobs

NASA Astrophysics Data System (ADS)

Wang, Hongfeng; Fu, Yaping; Huang, Min; Wang, Junwei

2016-03-01

The operation process design is one of the key issues in the manufacturing and service sectors. As a typical operation process, the scheduling with consideration of the deteriorating effect has been widely studied; however, the current literature only studied single function requirement and rarely considered the multiple function requirements which are critical for a real-world scheduling process. In this article, two function requirements are involved in the design of a scheduling process with consideration of the deteriorating effect and then formulated into two objectives of a mathematical programming model. A novel multiobjective evolutionary algorithm is proposed to solve this model with combination of three strategies, i.e. a multiple population scheme, a rule-based local search method and an elitist preserve strategy. To validate the proposed model and algorithm, a series of randomly-generated instances are tested and the experimental results indicate that the model is effective and the proposed algorithm can achieve the satisfactory performance which outperforms the other state-of-the-art multiobjective evolutionary algorithms, such as nondominated sorting genetic algorithm II and multiobjective evolutionary algorithm based on decomposition, on all the test instances.

Parallel processing of real-time dynamic systems simulation on OSCAR (Optimally SCheduled Advanced multiprocessoR)

NASA Technical Reports Server (NTRS)

Kasahara, Hironori; Honda, Hiroki; Narita, Seinosuke

1989-01-01

Parallel processing of real-time dynamic systems simulation on a multiprocessor system named OSCAR is presented. In the simulation of dynamic systems, generally, the same calculation are repeated every time step. However, we cannot apply to Do-all or the Do-across techniques for parallel processing of the simulation since there exist data dependencies from the end of an iteration to the beginning of the next iteration and furthermore data-input and data-output are required every sampling time period. Therefore, parallelism inside the calculation required for a single time step, or a large basic block which consists of arithmetic assignment statements, must be used. In the proposed method, near fine grain tasks, each of which consists of one or more floating point operations, are generated to extract the parallelism from the calculation and assigned to processors by using optimal static scheduling at compile time in order to reduce large run time overhead caused by the use of near fine grain tasks. The practicality of the scheme is demonstrated on OSCAR (Optimally SCheduled Advanced multiprocessoR) which has been developed to extract advantageous features of static scheduling algorithms to the maximum extent.

Dypas: A dynamic payload scheduler for shuttle missions

NASA Technical Reports Server (NTRS)

Davis, Stephen

1988-01-01

Decision and analysis systems have had broad and very practical application areas in the human decision making process. These software systems range from the help sections in simple accounting packages, to the more complex computer configuration programs. Dypas is a decision and analysis system that aids prelaunch shutlle scheduling, and has added functionality to aid the rescheduling done in flight. Dypas is written in Common Lisp on a Symbolics Lisp machine. Dypas differs from other scheduling programs in that it can draw its knowledge from different rule bases and apply them to different rule interpretation schemes. The system has been coded with Flavors, an object oriented extension to Common Lisp on the Symbolics hardware. This allows implementation of objects (experiments) to better match the problem definition, and allows a more coherent solution space to be developed. Dypas was originally developed to test a programmer's aptitude toward Common Lisp and the Symbolics software environment. Since then the system has grown into a large software effort with several programmers and researchers thrown into the effort. Dypas is currently using two expert systems and three inferencing procedures to generate a many object schedule. The paper will review the abilities of Dypas and comment on its functionality.

Sensor Based Framework for Secure Multimedia Communication in VANET

PubMed Central

Rahim, Aneel; Khan, Zeeshan Shafi; Bin Muhaya, Fahad T.; Sher, Muhammad; Kim, Tai-Hoon

2010-01-01

Secure multimedia communication enhances the safety of passengers by providing visual pictures of accidents and danger situations. In this paper we proposed a framework for secure multimedia communication in Vehicular Ad-Hoc Networks (VANETs). Our proposed framework is mainly divided into four components: redundant information, priority assignment, malicious data verification and malicious node verification. The proposed scheme jhas been validated with the help of the NS-2 network simulator and the Evalvid tool. PMID:22163462

Demographic and Socioeconomic Factors Influencing Public Attitudes Toward a Presumed Consent System for Organ Donation Without and With a Priority Allocation Scheme

PubMed Central

Tumin, Makmor; Tafran, Khaled; Mutalib, Muzalwana Abdul Talib @ Abdul; Satar, NurulHuda Mohd; Said, Saad Mohd; Adnan, Wan Ahmad Hafiz Wan Md; Lu, Yong Sook

2015-01-01

Abstract The influence of demographic and socioeconomic factors on the public's attitude towards a presumed consent system (PCS) of organ donation was estimated in 2 scenarios: without and with a priority allocation scheme (PAS). Self-administered questionnaires were completed by 775 respondents. Using multiple logistic regressions, respondents’ objections to donating organs in both scenarios were estimated. In total, 63.9% of respondents would object to donating under a PCS, whereas 54.6% would object under a PCS with a PAS. Respondents with pretertiary education were more likely to object than were respondents with tertiary education, in both the first (adjusted odds ratio [AOR] = 1.615) and second (AOR = 1.728) scenarios. Young respondents were less likely to object than were middle-aged respondents, in both the first (AOR = 0.648) and second (AOR = 0.572) scenarios. Respondents with mid-ranged personal monthly income were more likely to object than were respondents with low income, in both the first (AOR = 1.994) and second (AOR = 1.519) scenarios. It does not seem that Malaysia is ready to implement a PCS. The educational level, age, and income of the broader public should be considered if a PCS, without or with a PAS, is planned for implementation in Malaysia. PMID:26496282

Time cycle analysis and simulation of material flow in MOX process layout

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chakraborty, S.; Saraswat, A.; Danny, K.M.

The (U,Pu)O{sub 2} MOX fuel is the driver fuel for the upcoming PFBR (Prototype Fast Breeder Reactor). The fuel has around 30% PuO{sub 2}. The presence of high percentages of reprocessed PuO{sub 2} necessitates the design of optimized fuel fabrication process line which will address both production need as well as meet regulatory norms regarding radiological safety criteria. The powder pellet route has highly unbalanced time cycle. This difficulty can be overcome by optimizing process layout in terms of equipment redundancy and scheduling of input powder batches. Different schemes are tested before implementing in the process line with the helpmore » of a software. This software simulates the material movement through the optimized process layout. The different material processing schemes have been devised and validity of the schemes are tested with the software. Schemes in which production batches are meeting at any glove box location are considered invalid. A valid scheme ensures adequate spacing between the production batches and at the same time it meets the production target. This software can be further improved by accurately calculating material movement time through glove box train. One important factor is considering material handling time with automation systems in place.« less

Use of health information technology by children's hospitals in the United States.

PubMed

Menachemi, Nir; Brooks, Robert G; Schwalenstocker, Ellen; Simpson, Lisa

2009-01-01

The purpose of this study was to examine the adoption of health information technology by children's hospitals and to document barriers and priorities as they relate to health information technology adoption. Primary data of interest were obtained through the use of a survey instrument distributed to the chief information officers of 199 children's hospitals in the United States. Data were collected on current and future use of a variety of clinical health information technology and telemedicine applications, organizational priorities, barriers to use of health information technology, and hospital and chief information officer characteristics. Among the 109 responding hospitals (55%), common clinical applications included clinical scheduling (86.2%), transcription (85.3%), and pharmacy (81.9%) and laboratory (80.7%) information. Electronic health records (48.6%), computerized order entry (40.4%), and clinical decision support systems (35.8%) were less common. The most common barriers to health information technology adoption were vendors' inability to deliver products or services to satisfaction (85.4%), lack of staffing resources (82.3%), and difficulty in achieving end-user acceptance (80.2%). The most frequent priority for hospitals was to implement technology to reduce medical errors or to promote safety (72.5%). This first national look at health information technology use by children's hospitals demonstrates the progress in health information technology adoption, current barriers, and priorities for these institutions. In addition, the findings can serve as important benchmarks for future study in this area.

Clinical risk analysis with failure mode and effect analysis (FMEA) model in a dialysis unit.

PubMed

Bonfant, Giovanna; Belfanti, Pietro; Paternoster, Giuseppe; Gabrielli, Danila; Gaiter, Alberto M; Manes, Massimo; Molino, Andrea; Pellu, Valentina; Ponzetti, Clemente; Farina, Massimo; Nebiolo, Pier E

2010-01-01

The aim of clinical risk management is to improve the quality of care provided by health care organizations and to assure patients' safety. Failure mode and effect analysis (FMEA) is a tool employed for clinical risk reduction. We applied FMEA to chronic hemodialysis outpatients. FMEA steps: (i) process study: we recorded phases and activities. (ii) Hazard analysis: we listed activity-related failure modes and their effects; described control measures; assigned severity, occurrence and detection scores for each failure mode and calculated the risk priority numbers (RPNs) by multiplying the 3 scores. Total RPN is calculated by adding single failure mode RPN. (iii) Planning: we performed a RPNs prioritization on a priority matrix taking into account the 3 scores, and we analyzed failure modes causes, made recommendations and planned new control measures. (iv) Monitoring: after failure mode elimination or reduction, we compared the resulting RPN with the previous one. Our failure modes with the highest RPN came from communication and organization problems. Two tools have been created to ameliorate information flow: "dialysis agenda" software and nursing datasheets. We scheduled nephrological examinations, and we changed both medical and nursing organization. Total RPN value decreased from 892 to 815 (8.6%) after reorganization. Employing FMEA, we worked on a few critical activities, and we reduced patients' clinical risk. A priority matrix also takes into account the weight of the control measures: we believe this evaluation is quick, because of simple priority selection, and that it decreases action times.

Utilizing Novel Non-traditional Sensor Tasking Approaches to Enhance the Space Situational Awareness Picture Maintained by the Space Surveillance Network

NASA Astrophysics Data System (ADS)

Herz, A.; Herz, E.; Center, K.; George, P.; Axelrad, P.; Mutschler, S.; Jones, B.

2016-09-01

The Space Surveillance Network (SSN) is tasked with the increasingly difficult mission of detecting, tracking, cataloging and identifying artificial objects orbiting the Earth, including active and inactive satellites, spent rocket bodies, and fragmented debris. Much of the architecture and operations of the SSN are limited and outdated. Efforts are underway to modernize some elements of the systems. Even so, the ability to maintain the best current Space Situational Awareness (SSA) picture and identify emerging events in a timely fashion could be significantly improved by leveraging non-traditional sensor sites. Orbit Logic, the University of Colorado and the University of Texas at Austin are developing an innovative architecture and operations concept to coordinate the tasking and observation information processing of non - traditional assets based on information-theoretic approaches. These confirmed tasking schedules and the resulting data can then be used to "inform" the SSN tasking process. The 'Heimdall Web' system is comprised of core tasking optimization components and accompanying Web interfaces within a secure, split architecture that will for the first time allow non-traditional sensors to support SSA and improve SSN tasking. Heimdall Web application components appropriately score/prioritize space catalog objects based on covariance, priority, observability, expected information gain, and probability of detect - then coordinate an efficient sensor observation schedule for non-SSN sensors contributing to the overall SSA picture maintained by the Joint Space Operations Center (JSpOC). The Heimdall Web Ops concept supports sensor participation levels of "Scheduled", "Tasked" and "Contributing". Scheduled and Tasked sensors are provided optimized observation schedules or object tracking lists from central algorithms, while Contributing sensors review and select from a list of "desired track objects". All sensors are "Web Enabled" for tasking and feedback, supplying observation schedules, confirmed observations and related data back to Heimdall Web to complete the feedback loop for the next scheduling iteration.

Design and evaluation of a theory-based, culturally relevant outreach model for breast and cervical cancer screening for Latina immigrants

PubMed Central

White, Kari; Garces, Isabel C.; Bandura, Lisa; McGuire, Allison A.; Scarinci, Isabel C.

2013-01-01

Objectives Breast and cervical cancer are common among Latinas, but screening rates among foreign-born Latinas are relatively low. In this article we describe the design and implementation of a theory-based (PEN-3) outreach program to promote breast and cervical cancer screening to Latina immigrants, and evaluate the program’s effectiveness. Methods We used data from self-administered questionnaires completed at six annual outreach events to examine the sociodemographic characteristics of attendees and evaluate whether the program reached the priority population – foreign-born Latina immigrants with limited access to health care and screening services. To evaluate the program’s effectiveness in connecting women to screening, we examined the proportion and characteristics of women who scheduled and attended Pap smear and mammography appointments. Results Among the 782 Latinas who attended the outreach program, 60% and 83% had not had a Pap smear or mammogram, respectively, in at least a year. Overall, 80% scheduled a Pap smear and 78% scheduled a mammogram. Women without insurance, who did not know where to get screening and had not been screened in the last year were more likely to schedule appointments (p < 0.05). Among women who scheduled appointments, 65% attended their Pap smear and 79% attended the mammogram. We did not identify significant differences in sociodemographic characteristics associated with appointment attendance. Conclusions Using a theoretical approach to outreach design and implementation, it is possible to reach a substantial number of Latina immigrants and connect them to cancer screening services. PMID:22870569

Integrated management of thesis using clustering method

NASA Astrophysics Data System (ADS)

Astuti, Indah Fitri; Cahyadi, Dedy

2017-02-01

Thesis is one of major requirements for student in pursuing their bachelor degree. In fact, finishing the thesis involves a long process including consultation, writing manuscript, conducting the chosen method, seminar scheduling, searching for references, and appraisal process by the board of mentors and examiners. Unfortunately, most of students find it hard to match all the lecturers' free time to sit together in a seminar room in order to examine the thesis. Therefore, seminar scheduling process should be on the top of priority to be solved. Manual mechanism for this task no longer fulfills the need. People in campus including students, staffs, and lecturers demand a system in which all the stakeholders can interact each other and manage the thesis process without conflicting their timetable. A branch of computer science named Management Information System (MIS) could be a breakthrough in dealing with thesis management. This research conduct a method called clustering to distinguish certain categories using mathematics formulas. A system then be developed along with the method to create a well-managed tool in providing some main facilities such as seminar scheduling, consultation and review process, thesis approval, assessment process, and also a reliable database of thesis. The database plays an important role in present and future purposes.

Study on optimization of the short-term operation of cascade hydropower stations by considering output error

NASA Astrophysics Data System (ADS)

Wang, Liping; Wang, Boquan; Zhang, Pu; Liu, Minghao; Li, Chuangang

2017-06-01

The study of reservoir deterministic optimal operation can improve the utilization rate of water resource and help the hydropower stations develop more reasonable power generation schedules. However, imprecise forecasting inflow may lead to output error and hinder implementation of power generation schedules. In this paper, output error generated by the uncertainty of the forecasting inflow was regarded as a variable to develop a short-term reservoir optimal operation model for reducing operation risk. To accomplish this, the concept of Value at Risk (VaR) was first applied to present the maximum possible loss of power generation schedules, and then an extreme value theory-genetic algorithm (EVT-GA) was proposed to solve the model. The cascade reservoirs of Yalong River Basin in China were selected as a case study to verify the model, according to the results, different assurance rates of schedules can be derived by the model which can present more flexible options for decision makers, and the highest assurance rate can reach 99%, which is much higher than that without considering output error, 48%. In addition, the model can greatly improve the power generation compared with the original reservoir operation scheme under the same confidence level and risk attitude. Therefore, the model proposed in this paper can significantly improve the effectiveness of power generation schedules and provide a more scientific reference for decision makers.

Supporting local diversity of habitats and species on farmland: a comparison of three wildlife-friendly schemes.

PubMed

Hardman, Chloe J; Harrison, Dominic P G; Shaw, Pete J; Nevard, Tim D; Hughes, Brin; Potts, Simon G; Norris, Ken

2016-02-01

Restoration and maintenance of habitat diversity have been suggested as conservation priorities in farmed landscapes, but how this should be achieved and at what scale are unclear. This study makes a novel comparison of the effectiveness of three wildlife-friendly farming schemes for supporting local habitat diversity and species richness on 12 farms in England.The schemes were: (i) Conservation Grade (Conservation Grade: a prescriptive, non-organic, biodiversity-focused scheme), (ii) organic agriculture and (iii) a baseline of Entry Level Stewardship (Entry Level Stewardship: a flexible widespread government scheme). Conservation Grade farms supported a quarter higher habitat diversity at the 100-m radius scale compared to Entry Level Stewardship farms. Conservation Grade and organic farms both supported a fifth higher habitat diversity at the 250-m radius scale compared to Entry Level Stewardship farms. Habitat diversity at the 100-m and 250-m scales significantly predicted species richness of butterflies and plants. Habitat diversity at the 100-m scale also significantly predicted species richness of birds in winter and solitary bees. There were no significant relationships between habitat diversity and species richness for bumblebees or birds in summer.Butterfly species richness was significantly higher on organic farms (50% higher) and marginally higher on Conservation Grade farms (20% higher), compared with farms in Entry Level Stewardship. Organic farms supported significantly more plant species than Entry Level Stewardship farms (70% higher) but Conservation Grade farms did not (10% higher). There were no significant differences between the three schemes for species richness of bumblebees, solitary bees or birds. Policy implications . The wildlife-friendly farming schemes which included compulsory changes in management, Conservation Grade and organic, were more effective at increasing local habitat diversity and species richness compared with the less prescriptive Entry Level Stewardship scheme. We recommend that wildlife-friendly farming schemes should aim to enhance and maintain high local habitat diversity, through mechanisms such as option packages, where farmers are required to deliver a combination of several habitats.

A multi-mode operation control strategy for flexible microgrid based on sliding-mode direct voltage and hierarchical controls.

PubMed

Zhang, Qinjin; Liu, Yancheng; Zhao, Youtao; Wang, Ning

2016-03-01

Multi-mode operation and transient stability are two problems that significantly affect flexible microgrid (MG). This paper proposes a multi-mode operation control strategy for flexible MG based on a three-layer hierarchical structure. The proposed structure is composed of autonomous, cooperative, and scheduling controllers. Autonomous controller is utilized to control the performance of the single micro-source inverter. An adaptive sliding-mode direct voltage loop and an improved droop power loop based on virtual negative impedance are presented respectively to enhance the system disturbance-rejection performance and the power sharing accuracy. Cooperative controller, which is composed of secondary voltage/frequency control and phase synchronization control, is designed to eliminate the voltage/frequency deviations produced by the autonomous controller and prepare for grid connection. Scheduling controller manages the power flow between the MG and the grid. The MG with the improved hierarchical control scheme can achieve seamless transitions from islanded to grid-connected mode and have a good transient performance. In addition the presented work can also optimize the power quality issues and improve the load power sharing accuracy between parallel VSIs. Finally, the transient performance and effectiveness of the proposed control scheme are evaluated by theoretical analysis and simulation results. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Pathgroups, a dynamic data structure for genome reconstruction problems.

PubMed

Zheng, Chunfang

2010-07-01

Ancestral gene order reconstruction problems, including the median problem, quartet construction, small phylogeny, guided genome halving and genome aliquoting, are NP hard. Available heuristics dedicated to each of these problems are computationally costly for even small instances. We present a data structure enabling rapid heuristic solution to all these ancestral genome reconstruction problems. A generic greedy algorithm with look-ahead based on an automatically generated priority system suffices for all the problems using this data structure. The efficiency of the algorithm is due to fast updating of the structure during run time and to the simplicity of the priority scheme. We illustrate with the first rapid algorithm for quartet construction and apply this to a set of yeast genomes to corroborate a recent gene sequence-based phylogeny. http://albuquerque.bioinformatics.uottawa.ca/pathgroup/Quartet.html chunfang313@gmail.com Supplementary data are available at Bioinformatics online.

A QoS Aware Resource Allocation Strategy for 3D A/V Streaming in OFDMA Based Wireless Systems

PubMed Central

Chung, Young-uk; Choi, Yong-Hoon; Park, Suwon; Lee, Hyukjoon

2014-01-01

Three-dimensional (3D) video is expected to be a “killer app” for OFDMA-based broadband wireless systems. The main limitation of 3D video streaming over a wireless system is the shortage of radio resources due to the large size of the 3D traffic. This paper presents a novel resource allocation strategy to address this problem. In the paper, the video-plus-depth 3D traffic type is considered. The proposed resource allocation strategy focuses on the relationship between 2D video and the depth map, handling them with different priorities. It is formulated as an optimization problem and is solved using a suboptimal heuristic algorithm. Numerical results show that the proposed scheme provides a better quality of service compared to conventional schemes. PMID:25250377

Shared-resource computing for small research labs.

PubMed

Ackerman, M J

1982-04-01

A real time laboratory computer network is described. This network is composed of four real-time laboratory minicomputers located in each of four division laboratories and a larger minicomputer in a centrally located computer room. Off the shelf hardware and software were used with no customization. The network is configured for resource sharing using DECnet communications software and the RSX-11-M multi-user real-time operating system. The cost effectiveness of the shared resource network and multiple real-time processing using priority scheduling is discussed. Examples of utilization within a medical research department are given.

Molecular Foundry Workshop draws overflow crowd to BerkeleyLab

DOE Office of Scientific and Technical Information (OSTI.GOV)

Robinson, Art

2002-11-27

Nanoscale science and technology is now one of the top research priorities in the United States. With this background, it is no surprise that an overflow crowd or more than 350 registrants filled two auditoriums to hear about and contribute ideas for the new Molecular Foundry during a two-day workshop at the Lawrence Berkeley National Laboratory (Berkeley Lab). Scheduled to open for business at Berkeley Labin early 2006, the Molecular Foundry is one of three Nanoscale Science Research Centers (NSRCs) put forward for funding by the DOE's Office of Basic Energy Sciences (BES).

Ketamine - A Multifaceted Drug.

PubMed

Meng, Lingzhong; Li, Jian; Lu, Yi; Sun, Dajin; Tao, Yuan-Xiang; Liu, Renyu; Luo, Jin Jun

There is a petition for tight control of ketamine from the Chinese government to classify ketamine as a Schedule I drug, which is defined as a drug with no currently accepted medical use but a high potential for abuse. However, ketamine has unique properties that can benefit different patient populations. Scholars from the Translational Perioperative and Pain Medicine and the International Chinese Academy of Anesthesiology WeChat groups had an interactive discussion on ketamine, including its current medical applications, future research priorities, and benefits versus risks. The discussion is summarized in this manuscript with some minor edits.

A Comparison of Six Repair Scheduling Policies for the P3 Aircraft.

DTIC Science & Technology

1988-03-01

each type component i: RHO(i) = LAMBDA(i) / SRATE(i) LINEUPti) - RHO(i) x COUNT(i) Step 14c: Sort components by LINEUP (i), reorder position in line in...favor of the largest LINEUP (i). Return to step 7. Dynamic 3 Model Modifications: Step 14a: Count the number of operating parts of each component i...STOCK(i)). Step 14b: Assign a priority to each component type based on the count of current stock in step 14a: LINEUP (i) < LINEUP (J) iff STOCK(i

Dynamic Multiple-Threshold Call Admission Control Based on Optimized Genetic Algorithm in Wireless/Mobile Networks

NASA Astrophysics Data System (ADS)

Wang, Shengling; Cui, Yong; Koodli, Rajeev; Hou, Yibin; Huang, Zhangqin

Due to the dynamics of topology and resources, Call Admission Control (CAC) plays a significant role for increasing resource utilization ratio and guaranteeing users' QoS requirements in wireless/mobile networks. In this paper, a dynamic multi-threshold CAC scheme is proposed to serve multi-class service in a wireless/mobile network. The thresholds are renewed at the beginning of each time interval to react to the changing mobility rate and network load. To find suitable thresholds, a reward-penalty model is designed, which provides different priorities between different service classes and call types through different reward/penalty policies according to network load and average call arrival rate. To speed up the running time of CAC, an Optimized Genetic Algorithm (OGA) is presented, whose components such as encoding, population initialization, fitness function and mutation etc., are all optimized in terms of the traits of the CAC problem. The simulation demonstrates that the proposed CAC scheme outperforms the similar schemes, which means the optimization is realized. Finally, the simulation shows the efficiency of OGA.

Towards a true aerosol-and-cloud retrieval scheme

NASA Astrophysics Data System (ADS)

Thomas, Gareth; Poulsen, Caroline; Povey, Adam; McGarragh, Greg; Jerg, Matthias; Siddans, Richard; Grainger, Don

2014-05-01

The Optimal Retrieval of Aerosol and Cloud (ORAC) - formally the Oxford-RAL Aerosol and Cloud retrieval - offers a framework that can provide consistent and well characterised properties of both aerosols and clouds from a range of imaging satellite instruments. Several practical issues stand in the way of achieving the potential of this combined scheme however; in particular the sometimes conflicting priorities and requirements of aerosol and cloud retrieval problems, and the question of the unambiguous identification of aerosol and cloud pixels. This presentation will present recent developments made to the ORAC scheme for both aerosol and cloud, and detail how these are being integrated into a single retrieval framework. The implementation of a probabilistic method for pixel identification will also be presented, for both cloud detection and aerosol/cloud type selection. The method is based on Bayesian methods applied the optimal estimation retrieval output of ORAC and is particularly aimed at providing additional information in the so-called "twilight zone", where pixels can't be unambiguously identified as either aerosol or cloud and traditional cloud or aerosol products do not provide results.

Figure-ground segregation modulates apparent motion.

PubMed

Ramachandran, V S; Anstis, S

1986-01-01

We explored the relationship between figure-ground segmentation and apparent motion. Results suggest that: static elements in the surround can eliminate apparent motion of a cluster of dots in the centre, but only if the cluster and surround have similar "grain" or texture; outlines that define occluding surfaces are taken into account by the motion mechanism; the brain uses a hierarchy of precedence rules in attributing motion to different segments of the visual scene. Being designated as "figure" confers a high rank in this scheme of priorities.

A multi-group and preemptable scheduling of cloud resource based on HTCondor

NASA Astrophysics Data System (ADS)

Jiang, Xiaowei; Zou, Jiaheng; Cheng, Yaodong; Shi, Jingyan

2017-10-01

Due to the features of virtual machine-flexibility, easy controlling and various system environments, more and more fields utilize the virtualization technology to construct the distributed system with the virtual resources, also including high energy physics. This paper introduce a method used in high energy physics that supports multiple resource group and preemptable cloud resource scheduling, combining virtual machine with HTCondor (a batch system). It makes resource controlling more flexible and more efficient and makes resource scheduling independent of job scheduling. Firstly, the resources belong to different experiment-groups, and the type of user-groups mapping to resource-groups(same as experiment-group) is one-to-one or many-to-one. In order to make the confused group simply to be managed, we designed the permission controlling component to ensure that the different resource-groups can get the suitable jobs. Secondly, for the purpose of elastically allocating resources for suitable resource-group, it is necessary to schedule resources like scheduling jobs. So this paper designs the cloud resource scheduling to maintain a resource queue and allocate an appropriate amount of virtual resources to the request resource-group. Thirdly, in some kind of situations, because of the resource occupied for a long time, resources need to be preempted. This paper adds the preemption function for the resource scheduling that implement resource preemption based on the group priority. Additionally, the way to preempting is soft that when virtual resources are preempted, jobs will not be killed but also be held and rematched later. It is implemented with the help of HTCondor, storing the held job information in scheduler, releasing the job to idle status and doing second matcher. In IHEP (institute of high energy physics), we have built a batch system based on HTCondor with a virtual resources pool based on Openstack. And this paper will show some cases of experiment JUNO and LHAASO. The result indicates that multi-group and preemptable resource scheduling is efficient to support multi-group and soft preemption. Additionally, the permission controlling component has been used in the local computing cluster, supporting for experiment JUNO, CMS and LHAASO, and the scale will be expanded to more experiments at the first half year, including DYW, BES and so on. Its evidence that the permission controlling is efficient.

An approach to multivariable control of manipulators

NASA Technical Reports Server (NTRS)

Seraji, H.

1987-01-01

The paper presents simple schemes for multivariable control of multiple-joint robot manipulators in joint and Cartesian coordinates. The joint control scheme consists of two independent multivariable feedforward and feedback controllers. The feedforward controller is the minimal inverse of the linearized model of robot dynamics and contains only proportional-double-derivative (PD2) terms - implying feedforward from the desired position, velocity and acceleration. This controller ensures that the manipulator joint angles track any reference trajectories. The feedback controller is of proportional-integral-derivative (PID) type and is designed to achieve pole placement. This controller reduces any initial tracking error to zero as desired and also ensures that robust steady-state tracking of step-plus-exponential trajectories is achieved by the joint angles. Simple and explicit expressions of computation of the feedforward and feedback gains are obtained based on the linearized model of robot dynamics. This leads to computationally efficient schemes for either on-line gain computation or off-line gain scheduling to account for variations in the linearized robot model due to changes in the operating point. The joint control scheme is extended to direct control of the end-effector motion in Cartesian space. Simulation results are given for illustration.