On buffer overflow duration in a finite-capacity queueing system with multiple vacation policy

NASA Astrophysics Data System (ADS)

Kempa, Wojciech M.

2017-12-01

A finite-buffer queueing system with Poisson arrivals and generally distributed processing times, operating under multiple vacation policy, is considered. Each time when the system becomes empty, the service station takes successive independent and identically distributed vacation periods, until, at the completion epoch of one of them, at least one job waiting for service is detected in the buffer. Applying analytical approach based on the idea of embedded Markov chain, integral equations and linear algebra, the compact-form representation for the cumulative distribution function (CDF for short) of the first buffer overflow duration is found. Hence, the formula for the CDF of next such periods is obtained. Moreover, probability distributions of the number of job losses in successive buffer overflow periods are found. The considered queueing system can be efficienly applied in modelling energy saving mechanisms in wireless network communication.

Using Markov Decision Processes with Heterogeneous Queueing Systems to Examine Military MEDEVAC Dispatching Policies

DTIC Science & Technology

2017-03-23

Air Force Institute of Technology AFIT Scholar Theses and Dissertations 3-23-2017 Using Markov Decision Processes with Heterogeneous Queueing Systems... TECHNOLOGY Wright-Patterson Air Force Base, Ohio DISTRIBUTION STATEMENT A APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. The views expressed in...POLICIES THESIS Presented to the Faculty Department of Operational Sciences Graduate School of Engineering and Management Air Force Institute of Technology

Improving queuing service at McDonald's

NASA Astrophysics Data System (ADS)

Koh, Hock Lye; Teh, Su Yean; Wong, Chin Keat; Lim, Hooi Kie; Migin, Melissa W.

2014-07-01

Fast food restaurants are popular among price-sensitive youths and working adults who value the conducive environment and convenient services. McDonald's chains of restaurants promote their sales during lunch hours by offering package meals which are perceived to be inexpensive. These promotional lunch meals attract good response, resulting in occasional long queues and inconvenient waiting times. A study is conducted to monitor the distribution of waiting time, queue length, customer arrival and departure patterns at a McDonald's restaurant located in Kuala Lumpur. A customer survey is conducted to gauge customers' satisfaction regarding waiting time and queue length. An android app named Que is developed to perform onsite queuing analysis and report key performance indices. The queuing theory in Que is based upon the concept of Poisson distribution. In this paper, Que is utilized to perform queuing analysis at this McDonald's restaurant with the aim of improving customer service, with particular reference to reducing queuing time and shortening queue length. Some results will be presented.

Convergence of a Queueing System in Heavy Traffic with General Abandonment Distributions

DTIC Science & Technology

2010-10-08

3 in Reiman [27]. We circumvent the use of Reiman’s “Snap-shot Principle” and a comparison result with a non-abandoning queue used in Reed and Ward...4):2606–2650, 2005. 37 [5] R. Atar, A. Mandelbaum, and M. I. Reiman . Scheduling a multi class queue with many exponential servers: asymptotic... Reiman Designing a call center with impatient cus- tomers. Manufacturing and Service Oper. Management, 4(1A):208–227, 2002. [15] J. M. George and J. M

TIME SHARING WITH AN EXPLICIT PRIORITY QUEUING DISCIPLINE.

DTIC Science & Technology

exponentially distributed service times and an ordered priority queue. Each new arrival buys a position in this queue by offering a non-negative bribe to the...parameters is investigated through numerical examples. Finally, to maximize the expected revenue per unit time accruing from bribes , an optimization

How to report and monitor the performance of waiting list management.

PubMed

Torkki, Markus; Linna, Miika; Seitsalo, Seppo; Paavolainen, Pekka

2002-01-01

Potential problems concerning waiting list management are often monitored using mean waiting times based on empirical samples. However, the appropriateness of mean waiting time as an indicator of access can be questioned if a waiting list is not managed well, e.g., if the queue discipline is violated. This study was performed to find out about the queue discipline in waiting lists for elective surgery to reveal potential discrepancies in waiting list management. There were 1,774 waiting list patients for hallux valgus or varicose vein surgery or sterilization. The waiting time distributions of patients receiving surgery and of patients still waiting for an operation are presented in column charts. The charts are compared with two model charts. One model chart presents a high queue discipline (first in-first out) and another a poor queue discipline (random) queue. There were significant differences in waiting list management across hospitals and patient categories. Examples of a poor queue discipline were found in queues for hallux valgus and varicose vein operations. A routine waiting list reporting should be used to guarantee the quality of waiting list management and to pinpoint potential problems in access. It is important to monitor not only the number of patients in the waiting list but also the queue discipline and the balance between demand and supply of surgical services. The purpose for this type of reporting is to ensure that the priority setting made at health policy level also works in practise.

Evaluation of concurrent priority queue algorithms. Technical report

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

Huang, Q.

1991-02-01

The priority queue is a fundamental data structure that is used in a large variety of parallel algorithms, such as multiprocessor scheduling and parallel best-first search of state-space graphs. This thesis addresses the design and experimental evaluation of two novel concurrent priority queues: a parallel Fibonacci heap and a concurrent priority pool, and compares them with the concurrent binary heap. The parallel Fibonacci heap is based on the sequential Fibonacci heap, which is theoretically the most efficient data structure for sequential priority queues. This scheme not only preserves the efficient operation time bounds of its sequential counterpart, but also hasmore » very low contention by distributing locks over the entire data structure. The experimental results show its linearly scalable throughput and speedup up to as many processors as tested (currently 18). A concurrent access scheme for a doubly linked list is described as part of the implementation of the parallel Fibonacci heap. The concurrent priority pool is based on the concurrent B-tree and the concurrent pool. The concurrent priority pool has the highest throughput among the priority queues studied. Like the parallel Fibonacci heap, the concurrent priority pool scales linearly up to as many processors as tested. The priority queues are evaluated in terms of throughput and speedup. Some applications of concurrent priority queues such as the vertex cover problem and the single source shortest path problem are tested.« less

The Supermarket Model with Bounded Queue Lengths in Equilibrium

NASA Astrophysics Data System (ADS)

Brightwell, Graham; Fairthorne, Marianne; Luczak, Malwina J.

2018-04-01

In the supermarket model, there are n queues, each with a single server. Customers arrive in a Poisson process with arrival rate λ n , where λ = λ (n) \\in (0,1) . Upon arrival, a customer selects d=d(n) servers uniformly at random, and joins the queue of a least-loaded server amongst those chosen. Service times are independent exponentially distributed random variables with mean 1. In this paper, we analyse the behaviour of the supermarket model in the regime where λ (n) = 1 - n^{-α } and d(n) = \\lfloor n^β \\rfloor , where α and β are fixed numbers in (0, 1]. For suitable pairs (α , β ) , our results imply that, in equilibrium, with probability tending to 1 as n → ∞, the proportion of queues with length equal to k = \\lceil α /β \\rceil is at least 1-2n^{-α + (k-1)β } , and there are no longer queues. We further show that the process is rapidly mixing when started in a good state, and give bounds on the speed of mixing for more general initial conditions.

Content Dynamics Over the Network Cloud

DTIC Science & Technology

2015-11-04

Ferragut, “Trading Off Efficiency and Reciprocity in Wireless Peer- To-Peer File Sharing”, WiOpt 2015, Mumbai , India, May 2015. 11. A. Ferragut, F...inspired by queueing theory”, RSRG Seminar, Caltech, March 2015. q) Presentation of paper [10] by the PI at WiOpt, Mumbai , India, May 2015...2015, Mumbai , India, May 2015. 11. A. Ferragut, F. Paganini, "Queueing analysis of peer-to-peer swarms: stationary distributions and their scaling

Improving Aircraft Refueling Procedures at Naval Air Station Oceana

DTIC Science & Technology

2012-06-01

Station (NAS) Oceana, VA, using aircraft waiting time for fuel as a measure of performance. We develop a computer-assisted discrete-event simulation to...Station (NAS) Oceana, VA, using aircraft waiting time for fuel as a measure of performance. We develop a computer-assisted discrete-event simulation...server queue, with general interarrival and service time distributions gpm Gallons per minute JDK Java development kit M/M/1 Single-server queue

A comparison of queueing, cluster and distributed computing systems

NASA Technical Reports Server (NTRS)

Kaplan, Joseph A.; Nelson, Michael L.

1993-01-01

Using workstation clusters for distributed computing has become popular with the proliferation of inexpensive, powerful workstations. Workstation clusters offer both a cost effective alternative to batch processing and an easy entry into parallel computing. However, a number of workstations on a network does not constitute a cluster. Cluster management software is necessary to harness the collective computing power. A variety of cluster management and queuing systems are compared: Distributed Queueing Systems (DQS), Condor, Load Leveler, Load Balancer, Load Sharing Facility (LSF - formerly Utopia), Distributed Job Manager (DJM), Computing in Distributed Networked Environments (CODINE), and NQS/Exec. The systems differ in their design philosophy and implementation. Based on published reports on the different systems and conversations with the system's developers and vendors, a comparison of the systems are made on the integral issues of clustered computing.

Five easy equations for patient flow through an emergency department.

PubMed

Madsen, Thomas Lill; Kofoed-Enevoldsen, Allan

2011-10-01

Queue models are effective tools for framing management decisions and Danish hospitals could benefit from awareness of such models. Currently, as emergency departments (ED) are under reorganization, we deem it timely to empirically investigate the applicability of the standard "M/M/1" queue model in order to document its relevance. We compared actual versus theoretical distributions of hourly patient flow from 27,000 patient cases seen at Frederiksberg Hospital's ED. Formulating equations for arrivals and capacity, we wrote and tested a five equation simulation model. The Poisson distribution fitted arrivals with an hour-of-the-day specific parameter. Treatment times exceeding 15 minutes were well-described by an exponential distribution. The ED can be modelled as a black box with an hourly capacity that can be estimated either as admissions per hour when the ED operates full hilt Poisson distribution or from the linear dependency of waiting times on queue number. The results show that our ED capacity is surprisingly constant despite variations in staffing. These findings led to the formulation of a model giving a compact framework for assessing the behaviour of the ED under different assumptions about opening hours, capacity and workload. The M/M/1 almost perfectly fits our. Thus modeling and simulations have contributed to the management process. not relevant. not relevant.

Dynamic resource allocation scheme for distributed heterogeneous computer systems

NASA Technical Reports Server (NTRS)

Liu, Howard T. (Inventor); Silvester, John A. (Inventor)

1991-01-01

This invention relates to a resource allocation in computer systems, and more particularly, to a method and associated apparatus for shortening response time and improving efficiency of a heterogeneous distributed networked computer system by reallocating the jobs queued up for busy nodes to idle, or less-busy nodes. In accordance with the algorithm (SIDA for short), the load-sharing is initiated by the server device in a manner such that extra overhead in not imposed on the system during heavily-loaded conditions. The algorithm employed in the present invention uses a dual-mode, server-initiated approach. Jobs are transferred from heavily burdened nodes (i.e., over a high threshold limit) to low burdened nodes at the initiation of the receiving node when: (1) a job finishes at a node which is burdened below a pre-established threshold level, or (2) a node is idle for a period of time as established by a wakeup timer at the node. The invention uses a combination of the local queue length and the local service rate ratio at each node as the workload indicator.

Empirical synchronized flow in oversaturated city traffic.

PubMed

Kerner, Boris S; Hemmerle, Peter; Koller, Micha; Hermanns, Gerhard; Klenov, Sergey L; Rehborn, Hubert; Schreckenberg, Michael

2014-09-01

Based on a study of anonymized GPS probe vehicle traces measured by personal navigation devices in vehicles randomly distributed in city traffic, empirical synchronized flow in oversaturated city traffic has been revealed. It turns out that real oversaturated city traffic resulting from speed breakdown in a city in most cases can be considered random spatiotemporal alternations between sequences of moving queues and synchronized flow patterns in which the moving queues do not occur.

A queueing theory description of fat-tailed price returns in imperfect financial markets

NASA Astrophysics Data System (ADS)

Lamba, H.

2010-09-01

In a financial market, for agents with long investment horizons or at times of severe market stress, it is often changes in the asset price that act as the trigger for transactions or shifts in investment position. This suggests the use of price thresholds to simulate agent behavior over much longer timescales than are currently used in models of order-books. We show that many phenomena, routinely ignored in efficient market theory, can be systematically introduced into an otherwise efficient market, resulting in models that robustly replicate the most important stylized facts. We then demonstrate a close link between such threshold models and queueing theory, with large price changes corresponding to the busy periods of a single-server queue. The distribution of the busy periods is known to have excess kurtosis and non-exponential decay under various assumptions on the queue parameters. Such an approach may prove useful in the development of mathematical models for rapid deleveraging and panics in financial markets, and the stress-testing of financial institutions.

Queue theory for triangular and weibull arrival distribution models (case study of Banyumanik toll)

NASA Astrophysics Data System (ADS)

Sugito; Rahmawati, Rita; Kusuma Wardhani, Jenesia

2018-05-01

Queuing is one of the most common phenomena in daily life. Queued also happens on highway during busy time. The Electronic Toll Collection (ETC) was the new system of the Banyumanik toll gate which operates in 2014. Before ETC, Banyumanik toll gate users got regular service (regular toll gate) by paying in cash only. The ETC benefits more than regular service, but automatic toll gate (ETC) users are still few compared to regular toll gate users. To know the effectiveness of substance service, this paper used analysis of queuing system. The research was conducted at Toll Gate Banyumanik with the implementation time on 26-28 December 2016 for Ungaran-Semarang direction, and 29-31 December 2016 for Semarang- Ungaran direction. In one day, observation was done for 11 hours. That was at 07.00 a.m. until 06.00 p.m. There are 4 models of queues at Banyumanik toll gate. Here the four models will be used on the number of arrival and service time. Based on the simulation with Arena, the result showed that queue model regular toll gate in Ugaran-Semarang direction is (Tria/G/3):(GD/∞/∞) and the queue model for automatic toll gate is (G/G/3):(GD/∞/∞). While the queue model for the direction of Semarang-Ungaran regular toll gate is (G/G/3):(GD/∞/∞) and the queue model of automatic toll gate is (Weib/G/3):(GD/∞/∞).

Proposal for optimal placement platform of bikes using queueing networks.

PubMed

Mizuno, Shinya; Iwamoto, Shogo; Seki, Mutsumi; Yamaki, Naokazu

2016-01-01

In recent social experiments, rental motorbikes and rental bicycles have been arranged at nodes, and environments where users can ride these bikes have been improved. When people borrow bikes, they return them to nearby nodes. Some experiments have been conducted using the models of Hamachari of Yokohama, the Niigata Rental Cycle, and Bicing. However, from these experiments, the effectiveness of distributing bikes was unclear, and many models were discontinued midway. Thus, we need to consider whether these models are effectively designed to represent the distribution system. Therefore, we construct a model to arrange the nodes for distributing bikes using a queueing network. To adopt realistic values for our model, we use the Google Maps application program interface. Thus, we can easily obtain values of distance and transit time between nodes in various places in the world. Moreover, we apply the distribution of a population to a gravity model and we compute the effective transition probability for this queueing network. If the arrangement of the nodes and number of bikes at each node is known, we can precisely design the system. We illustrate our system using convenience stores as nodes and optimize the node configuration. As a result, we can optimize simultaneously the number of nodes, node places, and number of bikes for each node, and we can construct a base for a rental cycle business to use our system.

Delay decomposition at a single server queue with constant service time and multiple inputs

NASA Technical Reports Server (NTRS)

Ziegler, C.; Schilling, D. L.

1978-01-01

Two network consisting of single server queues, each with a constant service time, are considered. The external inputs to each network are assumed to follow some general probability distribution. Several interesting equivalencies that exist between the two networks considered are derived. This leads to the introduction of an important concept in delay decomposition. It is shown that the waiting time experienced by a customer can be decomposed into two basic components called self-delay and interference delay.

Efficient Distribution of Triggered Synchronous Block Diagrams

DTIC Science & Technology

2011-10-21

corresponding FFP processes, from P to P ′. The sizes of the queues are as in [23]. In particular, if M is not Moore, a queue of size 1 suffices; ifM is Moore...computer systems. Real-Time Systems, 14(3):219–250, 1998. [23] S . Tripakis, C. Pinello, A . Benveniste, A . Sangiovanni-Vincent, P. Caspi, and M . Di...of connections: a data connection connects some output port of a block M to some input port of another block M ′; a trigger connection connects some

An application of queueing theory to the design of channel requirements for special purpose communications satellites. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Hein, G. F.

1974-01-01

Special purpose satellites are very cost sensitive to the number of broadcast channels, usually will have Poisson arrivals, fairly low utilization (less than 35%), and a very high availability requirement. To solve the problem of determining the effects of limiting C the number of channels, the Poisson arrival, infinite server queueing model will be modified to describe the many server case. The model is predicated on the reproductive property of the Poisson distribution.

Pathogen transfer through environment-host contact: an agent-based queueing theoretic framework.

PubMed

Chen, Shi; Lenhart, Suzanne; Day, Judy D; Lee, Chihoon; Dulin, Michael; Lanzas, Cristina

2017-11-02

Queueing theory studies the properties of waiting queues and has been applied to investigate direct host-to-host transmitted disease dynamics, but its potential in modelling environmentally transmitted pathogens has not been fully explored. In this study, we provide a flexible and customizable queueing theory modelling framework with three major subroutines to study the in-hospital contact processes between environments and hosts and potential nosocomial pathogen transfer, where environments are servers and hosts are customers. Two types of servers with different parameters but the same utilization are investigated. We consider various forms of transfer functions that map contact duration to the amount of pathogen transfer based on existing literature. We propose a case study of simulated in-hospital contact processes and apply stochastic queues to analyse the amount of pathogen transfer under different transfer functions, and assume that pathogen amount decreases during the inter-arrival time. Different host behaviour (feedback and non-feedback) as well as initial pathogen distribution (whether in environment and/or in hosts) are also considered and simulated. We assess pathogen transfer and circulation under these various conditions and highlight the importance of the nonlinear interactions among contact processes, transfer functions and pathogen demography during the contact process. Our modelling framework can be readily extended to more complicated queueing networks to simulate more realistic situations by adjusting parameters such as the number and type of servers and customers, and adding extra subroutines. © The authors 2017. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Stochastic Routing and Scheduling Policies for Energy Harvesting Communication Networks

NASA Astrophysics Data System (ADS)

Calvo-Fullana, Miguel; Anton-Haro, Carles; Matamoros, Javier; Ribeiro, Alejandro

2018-07-01

In this paper, we study the joint routing-scheduling problem in energy harvesting communication networks. Our policies, which are based on stochastic subgradient methods on the dual domain, act as an energy harvesting variant of the stochastic family of backpresure algorithms. Specifically, we propose two policies: (i) the Stochastic Backpressure with Energy Harvesting (SBP-EH), in which a node's routing-scheduling decisions are determined by the difference between the Lagrange multipliers associated to their queue stability constraints and their neighbors'; and (ii) the Stochastic Soft Backpressure with Energy Harvesting (SSBP-EH), an improved algorithm where the routing-scheduling decision is of a probabilistic nature. For both policies, we show that given sustainable data and energy arrival rates, the stability of the data queues over all network nodes is guaranteed. Numerical results corroborate the stability guarantees and illustrate the minimal gap in performance that our policies offer with respect to classical ones which work with an unlimited energy supply.

Concurrent array-based queue

DOEpatents

Heidelberger, Philip; Steinmacher-Burow, Burkhard

2015-01-06

According to one embodiment, a method for implementing an array-based queue in memory of a memory system that includes a controller includes configuring, in the memory, metadata of the array-based queue. The configuring comprises defining, in metadata, an array start location in the memory for the array-based queue, defining, in the metadata, an array size for the array-based queue, defining, in the metadata, a queue top for the array-based queue and defining, in the metadata, a queue bottom for the array-based queue. The method also includes the controller serving a request for an operation on the queue, the request providing the location in the memory of the metadata of the queue.

System and method for implementing periodic early discard in on-chip buffer memories of network elements

DOEpatents

Francini, Andrea

2013-05-14

An advance is made over the prior art in accordance with the principles of the present invention that is directed to a new approach for a system and method for a buffer management scheme called Periodic Early Discard (PED). The invention builds on the observation that, in presence of TCP traffic, the length of a queue can be stabilized by selection of an appropriate frequency for packet dropping. For any combination of number of TCP connections and distribution of the respective RTT values, there exists an ideal packet drop frequency that prevents the queue from over-flowing or under-flowing. While the value of the ideal packet drop frequency may quickly change over time and is sensitive to the series of TCP connections affected by past packet losses, and most of all is impossible to compute inline, it is possible to approximate it with a margin of error that allows keeping the queue occupancy within a pre-defined range for extended periods of time. The PED scheme aims at tracking the (unknown) ideal packet drop frequency, adjusting the approximated value based on the evolution of the queue occupancy, with corrections of the approximated packet drop frequency that occur at a timescale that is comparable to the aggregate time constant of the set of TCP connections that traverse the queue.

ON CONTINUOUS-REVIEW (S-1,S) INVENTORY POLICIES WITH STATE-DEPENDENT LEADTIMES,

DTIC Science & Technology

INVENTORY CONTROL, *REPLACEMENT THEORY), MATHEMATICAL MODELS, LEAD TIME , MANAGEMENT ENGINEERING, DISTRIBUTION FUNCTIONS, PROBABILITY, QUEUEING THEORY, COSTS, OPTIMIZATION, STATISTICAL PROCESSES, DIFFERENCE EQUATIONS

Markovian Queues with Arrival Dependence

DTIC Science & Technology

1976-03-01

adding together the three balance equations for P 2o’ ^21’ "^22 as ^°ll°ws ’ 1 20 2 21 <W P21= XP10 + *2P22 H- ( ^ l^ 2 )p22 = Xp11 "lP20 +UlP21 +V22...REPORT DOCUMENTATION PAGE READ INSTRUCTIONSBEFORE COMPLETING FORM 1 REPORT NUMBER 2 . GOVT ACCESSION NO. 3. RECIPIENT’S CATALOG NUMBER 4. TITLE (and...ADDITIONAL FACTS CONCERNING THE TRANSIENT DISTRIBUTION OF WAITING TIMES FOR ARRIVING CUSTOMERS 2 ? IV. THE TWO CHANNEL SERVER QUEUE WITH SINGLE

Delay decomposition at a single server queue with constant service time and multiple inputs. [Waiting time on computer network

NASA Technical Reports Server (NTRS)

Ziegler, C.; Schilling, D. L.

1977-01-01

Two networks consisting of single server queues, each with a constant service time, are considered. The external inputs to each network are assumed to follow some general probability distribution. Several interesting equivalencies that exist between the two networks considered are derived. This leads to the introduction of an important concept in delay decomposition. It is shown that the waiting time experienced by a customer can be decomposed into two basic components called self delay and interference delay.

Emergency response to an anthrax attack

PubMed Central

Wein, Lawrence M.; Craft, David L.; Kaplan, Edward H.

2003-01-01

We developed a mathematical model to compare various emergency responses in the event of an airborne anthrax attack. The system consists of an atmospheric dispersion model, an age-dependent dose–response model, a disease progression model, and a set of spatially distributed two-stage queueing systems consisting of antibiotic distribution and hospital care. Our results underscore the need for the extremely aggressive and timely use of oral antibiotics by all asymptomatics in the exposure region, distributed either preattack or by nonprofessionals postattack, and the creation of surge capacity for supportive hospital care via expanded training of nonemergency care workers at the local level and the use of federal and military resources and nationwide medical volunteers. The use of prioritization (based on disease stage and/or age) at both queues, and the development and deployment of modestly rapid and sensitive biosensors, while helpful, produce only second-order improvements. PMID:12651951

Simplified Distributed Computing

NASA Astrophysics Data System (ADS)

Li, G. G.

2006-05-01

The distributed computing runs from high performance parallel computing, GRID computing, to an environment where idle CPU cycles and storage space of numerous networked systems are harnessed to work together through the Internet. In this work we focus on building an easy and affordable solution for computationally intensive problems in scientific applications based on existing technology and hardware resources. This system consists of a series of controllers. When a job request is detected by a monitor or initialized by an end user, the job manager launches the specific job handler for this job. The job handler pre-processes the job, partitions the job into relative independent tasks, and distributes the tasks into the processing queue. The task handler picks up the related tasks, processes the tasks, and puts the results back into the processing queue. The job handler also monitors and examines the tasks and the results, and assembles the task results into the overall solution for the job request when all tasks are finished for each job. A resource manager configures and monitors all participating notes. A distributed agent is deployed on all participating notes to manage the software download and report the status. The processing queue is the key to the success of this distributed system. We use BEA's Weblogic JMS queue in our implementation. It guarantees the message delivery and has the message priority and re-try features so that the tasks never get lost. The entire system is built on the J2EE technology and it can be deployed on heterogeneous platforms. It can handle algorithms and applications developed in any languages on any platforms. J2EE adaptors are provided to manage and communicate the existing applications to the system so that the applications and algorithms running on Unix, Linux and Windows can all work together. This system is easy and fast to develop based on the industry's well-adopted technology. It is highly scalable and heterogeneous. It is an open system and any number and type of machines can join the system to provide the computational power. This asynchronous message-based system can achieve second of response time. For efficiency, communications between distributed tasks are often done at the start and end of the tasks but intermediate status of the tasks can also be provided.

Efficient accesses of data structures using processing near memory

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

Jayasena, Nuwan S.; Zhang, Dong Ping; Diez, Paula Aguilera

Systems, apparatuses, and methods for implementing efficient queues and other data structures. A queue may be shared among multiple processors and/or threads without using explicit software atomic instructions to coordinate access to the queue. System software may allocate an atomic queue and corresponding queue metadata in system memory and return, to the requesting thread, a handle referencing the queue metadata. Any number of threads may utilize the handle for accessing the atomic queue. The logic for ensuring the atomicity of accesses to the atomic queue may reside in a management unit in the memory controller coupled to the memory wheremore » the atomic queue is allocated.« less

Preventing messaging queue deadlocks in a DMA environment

DOEpatents

Blocksome, Michael A; Chen, Dong; Gooding, Thomas; Heidelberger, Philip; Parker, Jeff

2014-01-14

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate and interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

Message passing with queues and channels

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

Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer

In an embodiment, a reception thread receives a source node identifier, a type, and a data pointer from an application and, in response, creates a receive request. If the source node identifier specifies a source node, the reception thread adds the receive request to a fast-post queue. If a message received from a network does not match a receive request on a posted queue, a polling thread adds a receive request that represents the message to an unexpected queue. If the fast-post queue contains the receive request, the polling thread removes the receive request from the fast-post queue. If themore » receive request that was removed from the fast-post queue does not match the receive request on the unexpected queue, the polling thread adds the receive request that was removed from the fast-post queue to the posted queue. The reception thread and the polling thread execute asynchronously from each other.« less

Increasing available FIFO space to prevent messaging queue deadlocks in a DMA environment

DOEpatents

Blocksome, Michael A [Rochester, MN; Chen, Dong [Croton On Hudson, NY; Gooding, Thomas [Rochester, MN; Heidelberger, Philip [Cortlandt Manor, NY; Parker, Jeff [Rochester, MN

2012-02-07

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate an interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

Efficient partitioning and assignment on programs for multiprocessor execution

NASA Technical Reports Server (NTRS)

Standley, Hilda M.

1993-01-01

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Performance Evaluation of a M/Geo[xy]/1 Queue with varying probabilities of success which Treats Two Like Jobs As a Single Entity

NASA Astrophysics Data System (ADS)

Gowrishankar, Lavanya; Bhaskar, Vidhyacharan; Sundarammal, K.

2018-04-01

The developed model comprises of a single server capable of handling two different job types X and Y type job. Job Y takes more time for execution than job X. The objective is to construct a single server which would replace the standard M/M/2 queuing model The method used to find the relative measures involves the cost equation. The properties of the service distribution are discussed in detail. The maximum likelihood estimates for the parameters are obtained. The results are analytically derived for the M/Geo[xy]/1 model. A comparison is done between the model proposed and the standard M/M/2 queue. From the numerical results, it is observed that the waiting time in queue increases as the number of cycles is increased but however it is more economical than the M/M/2 model with restriction on the number of time slices.

The Queued Service Observing Project at CFHT

NASA Astrophysics Data System (ADS)

Martin, Pierre; Savalle, Renaud; Vermeulen, Tom; Shapiro, Joshua N.

2002-12-01

In order to maximize the scientific productivity of the CFH12K mosaic wide-field imager (and soon MegaCam), the Queued Service Observing (QSO) mode was implemented at the Canada-France-Hawaii Telescope at the beginning of 2001. The QSO system consists of an ensemble of software components allowing for the submission of programs, the preparation of queues, and finally the execution and evaluation of observations. The QSO project is part of a broader system known as the New Observing Process (NOP). This system includes data acquisition, data reduction and analysis through a pipeline named Elixir, and a data archiving and distribution component (DADS). In this paper, we review several technical and operational aspects of the QSO project. In particular, we present our strategy, technical architecture, program submission system, and the tools developed for the preparation and execution of the queues. Our successful experience of over 150 nights of QSO operations is also discussed along with the future plans for queue observing with MegaCam and other instruments at CFHT.

Empirical analysis and modeling of manual turnpike tollbooths in China

NASA Astrophysics Data System (ADS)

Zhang, Hao

2017-03-01

To deal with low-level of service satisfaction at tollbooths of many turnpikes in China, we conduct an empirical study and use a queueing model to investigate performance measures. In this paper, we collect archived data from six tollbooths of a turnpike in China. Empirical analysis on vehicle's time-dependent arrival process and collector's time-dependent service time is conducted. It shows that the vehicle arrival process follows a non-homogeneous Poisson process while the collector service time follows a log-normal distribution. Further, we model the process of collecting tolls at tollbooths with MAP / PH / 1 / FCFS queue for mathematical tractability and present some numerical examples.

Do case-generic measures of queue performance for bypass surgery accurately reflect the waiting-list experiences of those most urgent?

PubMed

Burstein, Jason; Lee, Douglas S; Alter, David A

2006-02-01

Queue performance is typically assessed using generic measures, which capture the queue in aggregate. The objective of this study was to examine whether case-generic measures of queue performance appropriately reflected the waiting-list experiences of those patients with greatest disease severity. We examined the queue for isolated coronary artery bypass grafting (CABG) in Ontario between April 1993 and March 2000 using data obtained from the Cardiac Care Network. Our primary measure of queue performance was the proportion of patients who received their bypass surgery within their recommended maximum waiting times (%RMWTs) in any given month. We compared case-generic measures of queue performance to case-specific measures of queue performance stratified by urgency level. The queue was largely comprised of elective cases ranging from 73% (1993) to 57%(1999). Urgent patients comprised the minority of the queue ranging from 14% (1993) to 20% (1999). Case-generic month-to-month variations in the percentage of cases completed within RMWTs (an aggregated waiting list measure encompassing the characteristics of all patients in the queue) closely resembled the experiences of elective patients (R2 = 0.81), but conversely, bore little relationship to the waiting-list experiences of those most urgent (R2 = 0.15). Case-generic measures of queue performance for bypass surgery in Ontario were not reflective of the waiting-list experiences of those most urgent. Our results reinforce the concept that urgency-specific waiting list monitoring systems are required to best evaluate and appropriately respond to fluctuations in queue performance.

Why Are Drugs So Hard to Quit?

MedlinePlus

... Loading... Close Yeah, keep it Undo Close This video is unavailable. Watch Queue Queue Watch Queue Queue ... in Share More Report Need to report the video? Sign in to report inappropriate content. Sign in ...

A Low-Power Instruction Issue Queue for Microprocessors

NASA Astrophysics Data System (ADS)

Watanabe, Shingo; Chiyonobu, Akihiro; Sato, Toshinori

Instruction issue queue is a key component which extracts instruction level parallelism (ILP) in modern out-of-order microprocessors. In order to exploit ILP for improving processor performance, instruction queue size should be increased. However, it is difficult to increase the size, since instruction queue is implemented by a content addressable memory (CAM) whose power and delay are much large. This paper introduces a low power and scalable instruction queue that replaces the CAM with a RAM. In this queue, instructions are explicitly woken up. Evaluation results show that the proposed instruction queue decreases processor performance by only 1.9% on average. Furthermore, the total energy consumption is reduced by 54% on average.

Online matching with queueing dynamics.

DOT National Transportation Integrated Search

2016-12-01

We consider a variant of the multiarmed bandit problem where jobs queue for service, and service rates of different servers may be unknown. We study algorithms that minimize queue-regret: the (expected) difference between the queue-lengths obtained b...

Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing.

PubMed

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-26

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λ b / λ u bits/s/Hz, where λ b and λ u are the densities of base stations and mobile users, respectively.

Capacity-Delay Trade-Off in Collaborative Hybrid Ad-Hoc Networks with Coverage Sensing

PubMed Central

Chen, Lingyu; Luo, Wenbin; Liu, Chen; Hong, Xuemin; Shi, Jianghong

2017-01-01

The integration of ad hoc device-to-device (D2D) communications and open-access small cells can result in a networking paradigm called hybrid the ad hoc network, which is particularly promising in delivering delay-tolerant data. The capacity-delay performance of hybrid ad hoc networks has been studied extensively under a popular framework called scaling law analysis. These studies, however, do not take into account aspects of interference accumulation and queueing delay and, therefore, may lead to over-optimistic results. Moreover, focusing on the average measures, existing works fail to give finer-grained insights into the distribution of delays. This paper proposes an alternative analytical framework based on queueing theoretic models and physical interference models. We apply this framework to study the capacity-delay performance of a collaborative cellular D2D network with coverage sensing and two-hop relay. The new framework allows us to fully characterize the delay distribution in the transform domain and pinpoint the impacts of coverage sensing, user and base station densities, transmit power, user mobility and packet size on the capacity-delay trade-off. We show that under the condition of queueing equilibrium, the maximum throughput capacity per device saturates to an upper bound of 0.7239 λb/λu bits/s/Hz, where λb and λu are the densities of base stations and mobile users, respectively. PMID:28134769

Priority queues with bursty arrivals of incoming tasks

NASA Astrophysics Data System (ADS)

Masuda, N.; Kim, J. S.; Kahng, B.

2009-03-01

Recently increased accessibility of large-scale digital records enables one to monitor human activities such as the interevent time distributions between two consecutive visits to a web portal by a single user, two consecutive emails sent out by a user, two consecutive library loans made by a single individual, etc. Interestingly, those distributions exhibit a universal behavior, D(τ)˜τ-δ , where τ is the interevent time, and δ≃1 or 3/2 . The universal behaviors have been modeled via the waiting-time distribution of a task in the queue operating based on priority; the waiting time follows a power-law distribution Pw(τ)˜τ-α with either α=1 or 3/2 depending on the detail of queuing dynamics. In these models, the number of incoming tasks in a unit time interval has been assumed to follow a Poisson-type distribution. For an email system, however, the number of emails delivered to a mail box in a unit time we measured follows a power-law distribution with general exponent γ . For this case, we obtain analytically the exponent α , which is not necessarily 1 or 3/2 and takes nonuniversal values depending on γ . We develop the generating function formalism to obtain the exponent α , which is distinct from the continuous time approximation used in the previous studies.

Field test implementation of queue control : final report.

DOT National Transportation Integrated Search

2011-12-01

A major challenge for implementing queue control has been to accurately estimate on-ramp queue lengths, particularly during saturated onramp : conditions, when the vehicle queue extends around or beyond the ramp entrance. The main outcome of the rese...

Queues with Choice via Delay Differential Equations

NASA Astrophysics Data System (ADS)

Pender, Jamol; Rand, Richard H.; Wesson, Elizabeth

Delay or queue length information has the potential to influence the decision of a customer to join a queue. Thus, it is imperative for managers of queueing systems to understand how the information that they provide will affect the performance of the system. To this end, we construct and analyze two two-dimensional deterministic fluid models that incorporate customer choice behavior based on delayed queue length information. In the first fluid model, customers join each queue according to a Multinomial Logit Model, however, the queue length information the customer receives is delayed by a constant Δ. We show that the delay can cause oscillations or asynchronous behavior in the model based on the value of Δ. In the second model, customers receive information about the queue length through a moving average of the queue length. Although it has been shown empirically that giving patients moving average information causes oscillations and asynchronous behavior to occur in U.S. hospitals, we analytically and mathematically show for the first time that the moving average fluid model can exhibit oscillations and determine their dependence on the moving average window. Thus, our analysis provides new insight on how operators of service systems should report queue length information to customers and how delayed information can produce unwanted system dynamics.

NQS - NETWORK QUEUING SYSTEM, VERSION 2.0 (UNIX VERSION)

NASA Technical Reports Server (NTRS)

Walter, H.

1994-01-01

The Network Queuing System, NQS, is a versatile batch and device queuing facility for a single Unix computer or a group of networked computers. With the Unix operating system as a common interface, the user can invoke the NQS collection of user-space programs to move batch and device jobs freely around the different computer hardware tied into the network. NQS provides facilities for remote queuing, request routing, remote status, queue status controls, batch request resource quota limits, and remote output return. This program was developed as part of an effort aimed at tying together diverse UNIX based machines into NASA's Numerical Aerodynamic Simulator Processing System Network. This revision of NQS allows for creating, deleting, adding and setting of complexes that aid in limiting the number of requests to be handled at one time. It also has improved device-oriented queues along with some revision of the displays. NQS was designed to meet the following goals: 1) Provide for the full support of both batch and device requests. 2) Support all of the resource quotas enforceable by the underlying UNIX kernel implementation that are relevant to any particular batch request and its corresponding batch queue. 3) Support remote queuing and routing of batch and device requests throughout the NQS network. 4) Support queue access restrictions through user and group access lists for all queues. 5) Enable networked output return of both output and error files to possibly remote machines. 6) Allow mapping of accounts across machine boundaries. 7) Provide friendly configuration and modification mechanisms for each installation. 8) Support status operations across the network, without requiring a user to log in on remote target machines. 9) Provide for file staging or copying of files for movement to the actual execution machine. To support batch and device requests, NQS v.2 implements three queue types--batch, device and pipe. Batch queues hold and prioritize batch requests; device queues hold and prioritize device requests; pipe queues transport both batch and device requests to other batch, device, or pipe queues at local or remote machines. Unique to batch queues are resource quota limits that restrict the amounts of different resources that a batch request can consume during execution. Unique to each device queue is a set of one or more devices, such as a line printer, to which requests can be sent for execution. Pipe queues have associated destinations to which they route and deliver requests. If the proper destination machine is down or unreachable, pipe queues are able to requeue the request and deliver it later when the destination is available. All NQS network conversations are performed using the Berkeley socket mechanism as ported into the respective vendor kernels. NQS is written in C language. The generic UNIX version (ARC-13179) has been successfully implemented on a variety of UNIX platforms, including Sun3 and Sun4 series computers, SGI IRIS computers running IRIX 3.3, DEC computers running ULTRIX 4.1, AMDAHL computers running UTS 1.3 and 2.1, platforms running BSD 4.3 UNIX. The IBM RS/6000 AIX version (COS-10042) is a vendor port. NQS 2.0 will also communicate with the Cray Research, Inc. and Convex, Inc. versions of NQS. The standard distribution medium for either machine version of NQS 2.0 is a 60Mb, QIC-24, .25 inch streaming magnetic tape cartridge in UNIX tar format. Upon request the generic UNIX version (ARC-13179) can be provided in UNIX tar format on alternate media. Please contact COSMIC to discuss the availability and cost of media to meet your specific needs. An electronic copy of the NQS 2.0 documentation is included on the program media. NQS 2.0 was released in 1991. The IBM RS/6000 port of NQS was developed in 1992. IRIX is a trademark of Silicon Graphics Inc. IRIS is a registered trademark of Silicon Graphics Inc. UNIX is a registered trademark of UNIX System Laboratories Inc. Sun3 and Sun4 are trademarks of Sun Microsystems Inc. DEC and ULTRIX are trademarks of Digital Equipment Corporation.

Control of Entry to a Queueing System

DTIC Science & Technology

1979-11-01

being devoted to the use of queueing theory to control ard optimize the o~peration i f a system. Here, queueing analyses are used to design a system...operpting costs below somae upper bound while maximizing throughput of the queue. This more recent approach of designing or controlling a queueing system...ports designated as high density traffic airports, the Federal Aviation Administration (FAA) limits the number of instrument flight r’ule (IFR

Peregrine Queue Changes | High-Performance Computing | NREL

Science.gov Websites

that the best path is to disable the large queue and move the nodes from the "large" queue to jobs that request a large number of nodes. The large queue was disabled during the October System time

The network queueing system

NASA Technical Reports Server (NTRS)

Kingsbury, Brent K.

1986-01-01

Described is the implementation of a networked, UNIX based queueing system developed on contract for NASA. The system discussed supports both batch and device requests, and provides the facilities of remote queueing, request routing, remote status, queue access controls, batch request resource quota limits, and remote output return.

An analytical study of various telecomminication networks using markov models

NASA Astrophysics Data System (ADS)

Ramakrishnan, M.; Jayamani, E.; Ezhumalai, P.

2015-04-01

The main aim of this paper is to examine issues relating to the performance of various Telecommunication networks, and applied queuing theory for better design and improved efficiency. Firstly, giving an analytical study of queues deals with quantifying the phenomenon of waiting lines using representative measures of performances, such as average queue length (on average number of customers in the queue), average waiting time in queue (on average time to wait) and average facility utilization (proportion of time the service facility is in use). In the second, using Matlab simulator, summarizes the finding of the investigations, from which and where we obtain results and describing methodology for a) compare the waiting time and average number of messages in the queue in M/M/1 and M/M/2 queues b) Compare the performance of M/M/1 and M/D/1 queues and study the effect of increasing the number of servers on the blocking probability M/M/k/k queue model.

The N-policy for an unreliable server with delaying repair and two phases of service

NASA Astrophysics Data System (ADS)

Choudhury, Gautam; Ke, Jau-Chuan; Tadj, Lotfi

2009-09-01

This paper deals with an MX/G/1 with an additional second phase of optional service and unreliable server, which consist of a breakdown period and a delay period under N-policy. While the server is working with any phase of service, it may break down at any instant and the service channel will fail for a short interval of time. Further concept of the delay time is also introduced. If no customer arrives during the breakdown period, the server becomes idle in the system until the queue size builds up to a threshold value . As soon as the queue size becomes at least N, the server immediately begins to serve the first phase of regular service to all the waiting customers. After the completion of which, only some of them receive the second phase of the optional service. We derive the queue size distribution at a random epoch and departure epoch as well as various system performance measures. Finally we derive a simple procedure to obtain optimal stationary policy under a suitable linear cost structure.

Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives

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

Chen, Dong; Gara, Alana; Heidelberger, Philip

Implementation primitives for concurrent array-based stacks, queues, double-ended queues (deques) and wrapped deques are provided. In one aspect, each element of the stack, queue, deque or wrapped deque data structure has its own ticket lock, allowing multiple threads to concurrently use multiple elements of the data structure and thus achieving high performance. In another aspect, new synchronization primitives FetchAndIncrementBounded (Counter, Bound) and FetchAndDecrementBounded (Counter, Bound) are implemented. These primitives can be implemented in hardware and thus promise a very fast throughput for queues, stacks and double-ended queues.

Telemetry Standards, RCC Standard 106-17. Chapter 24. Message Formats

DTIC Science & Technology

2017-07-01

strength indicator TCP Transmission Control Protocol TE Traffic Engineering TAI International Atomic Time TLV Type-Length-Value TmNS Telemetry...to a specific radio link. TE Queue Status Report 10 This TLV is used by a radio to report Traffic Engineering (TE) queue levels for each of the 8...24.3.2.6 Traffic Engineering Queue Status Report TLV The TE Queue Status Report TLV shall be used to report the queue levels of the eight

Modelling healthcare systems with phase-type distributions.

PubMed

Fackrell, Mark

2009-03-01

Phase-type distributions constitute a very versatile class of distributions. They have been used in a wide range of stochastic modelling applications in areas as diverse as telecommunications, finance, biostatistics, queueing theory, drug kinetics, and survival analysis. Their use in modelling systems in the healthcare industry, however, has so far been limited. In this paper we introduce phase-type distributions, give a survey of where they have been used in the healthcare industry, and propose some ideas on how they could be further utilized.

Message passing with queues and channels

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

Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer

In an embodiment, a send thread receives an identifier that identifies a destination node and a pointer to data. The send thread creates a first send request in response to the receipt of the identifier and the data pointer. The send thread selects a selected channel from among a plurality of channels. The selected channel comprises a selected hand-off queue and an identification of a selected message unit. Each of the channels identifies a different message unit. The selected hand-off queue is randomly accessible. If the selected hand-off queue contains an available entry, the send thread adds the first sendmore » request to the selected hand-off queue. If the selected hand-off queue does not contain an available entry, the send thread removes a second send request from the selected hand-off queue and sends the second send request to the selected message unit.« less

Analysis of bulk arrival queueing system with batch size dependent service and working vacation

NASA Astrophysics Data System (ADS)

Niranjan, S. P.; Indhira, K.; Chandrasekaran, V. M.

2018-04-01

This paper concentrates on single server bulk arrival queue system with batch size dependent service and working vacation. The server provides service in two service modes depending upon the queue length. The server provides single service if the queue length is at least `a'. On the other hand the server provides fixed batch service if the queue length is at least `k' (k > a). Batch service is provided with some fixed batch size `k'. After completion of service if the queue length is less than `a' then the server leaves for working vacation. During working vacation customers are served with lower service rate than the regular service rate. Service during working vacation also contains two service modes. For the proposed model probability generating function of the queue length at an arbitrary time will be obtained by using supplementary variable technique. Some performance measures will also be presented with suitable numerical illustrations.

Waiting to see the doctor. The impact of organizational structure on medical practice.

PubMed

Wolinsky, F D; Marder, W D

1983-05-01

In this article it is assessed whether or not the scheduling and office visit queues a patient faces depend upon the organizational structure of the physician's practice (i.e., does the physician practice in the fee-for-service system or in a health maintenance organization [HMO], and if in an HMO, in what type of an HMO). Data pooled from two national studies (N = 2448) reveal two major findings. First, although scheduling queues may be predicted from the organizational structure of physicians' practices and other factors, office queues appear to be more of a random phenomenon. Second, a distinct pattern emerges among the effects of the organizational structure of physicians' practices on patient queues, including 1) physicians in solo practice offer their patients the shortest queues, 2) physicians in group model HMOs maximize scheduling queues but minimize waiting room queues, 3) patient queues for physicians practicing in IPAs are no different from those of their counterparts in group-practice fee-for-service settings, and 4) patient queues for salaried physicians practicing in a predominantly salaried environment are among the longest. The implications of these findings are discussed with special reference to extent and future studies of the effects of organizational structure on medical practice.

Network resiliency through memory health monitoring and proactive management

DOEpatents

Andrade Costa, Carlos H.; Cher, Chen-Yong; Park, Yoonho; Rosenburg, Bryan S.; Ryu, Kyung D.

2017-11-21

A method for managing a network queue memory includes receiving sensor information about the network queue memory, predicting a memory failure in the network queue memory based on the sensor information, and outputting a notification through a plurality of nodes forming a network and using the network queue memory, the notification configuring communications between the nodes.

Medical ethics and new public management in Sweden.

PubMed

Hansson, Sven Ove

2014-07-01

In order to shorten queues to healthcare, the Swedish government has introduced a yearly "queue billion" that is paid out to the county councils in proportion to how successful they are in reducing queues. However, only the queues for first visits are covered. Evidence has accumulated that queues for return visits have become longer. This affects the chronically and severely ill. Swedish physicians, and the Swedish Medical Association, have strongly criticized the queue billion and have claimed that it conflicts with medical ethics. Instead they demand that their professional judgments on priority setting and medical urgency be respected. This discussion provides an interesting illustration of some of the limitations of new public management and also more generally of the complicated relationships between medical ethics and public policy.

Priority Queues for Computer Simulations

NASA Technical Reports Server (NTRS)

Steinman, Jeffrey S. (Inventor)

1998-01-01

The present invention is embodied in new priority queue data structures for event list management of computer simulations, and includes a new priority queue data structure and an improved event horizon applied to priority queue data structures. ne new priority queue data structure is a Qheap and is made out of linked lists for robust, fast, reliable, and stable event list management and uses a temporary unsorted list to store all items until one of the items is needed. Then the list is sorted, next, the highest priority item is removed, and then the rest of the list is inserted in the Qheap. Also, an event horizon is applied to binary tree and splay tree priority queue data structures to form the improved event horizon for event management.

General bulk service queueing system with N-policy, multiplevacations, setup time and server breakdown without interruption

NASA Astrophysics Data System (ADS)

Sasikala, S.; Indhira, K.; Chandrasekaran, V. M.

2017-11-01

In this paper, we have considered an MX / (a,b) / 1 queueing system with server breakdown without interruption, multiple vacations, setup times and N-policy. After a batch of service, if the size of the queue is ξ (< a), then the server immediately takes a vacation. Upon returns from a vacation, if the queue is less than N, then the server takes another vacation. This process continues until the server finds atleast N customers in the queue. After a vacation, if the server finds at least N customers waiting for service, then the server needs a setup time to start the service. After a batch of service, if the amount of waiting customers in the queue is ξ (≥ a) then the server serves a batch of min(ξ,b) customers, where b ≥ a. We derived the probability generating function of queue length at arbitrary time epoch. Further, we obtained some important performance measures.

Time Is Not on Our Side: How Radiology Practices Should Manage Customer Queues.

PubMed

Loving, Vilert A; Ellis, Richard L; Rippee, Robert; Steele, Joseph R; Schomer, Donald F; Shoemaker, Stowe

2017-11-01

As health care shifts toward patient-centered care, wait times have received increasing scrutiny as an important metric for patient satisfaction. Long queues form when radiology practices inefficiently service their customers, leading to customer dissatisfaction and a lower perception of value. This article describes a four-step framework for radiology practices to resolve problematic queues: (1) analyze factors contributing to queue formation; (2) improve processes to reduce service times; (3) reduce variability; (4) address the psychology of queues. Copyright © 2017 American College of Radiology. Published by Elsevier Inc. All rights reserved.

Improved work zone design guidelines and enhanced model of travel delays in work zones : Phase I, portability and scalability of interarrival and service time probability distribution functions for different locations in Ohio and the establishment of impr

DOT National Transportation Integrated Search

2006-01-01

The project focuses on two major issues - the improvement of current work zone design practices and an analysis of : vehicle interarrival time (IAT) and speed distributions for the development of a digital computer simulation model for : queues and t...

Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa.

PubMed

Sokhela, Dudu G; Makhanya, Nonhlanhla J; Sibiya, Nokuthula M; Nokes, Kathleen M

2013-07-05

Comprehensive Primary Health Care (PHC), based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans. Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients' experiences led to satisfaction or dissatisfaction with the Fast Queue service. A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed. Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources. Effective health communication strategies contribute to positive experiences by health care users and these can be effected by: (1) involvement of health care providers in planning the construction of health facilities to give input about patient flow, infection prevention and control and provision of privacy, (2) effective complaints mechanisms for users to ensure that complaints are followed up and (3)encouraging users to arrive at the facility throughout the day, rather than the present practice where all users arrive at the clinic early in the morning.

Marine Vessel Traffic System

DTIC Science & Technology

2001-06-19

Queue Get Put The MutexQ module provides primitive queue operations which synchronize access to the queues and ensure queue structure integrity...interface provides for synchronous data rates ranging from 64 Kbps to 1.536 Mbps, while an RS-232 interface accommodates asynchronous data up to...interface VME Communications processor 57 and 8-channel serial I/O board. This board set provides a 68040 processor and 8-channels of synchronous

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.

Apparatus and method for managing digital resources by passing digital resource tokens between queues

DOEpatents

Crawford, H.J.; Lindenstruth, V.

1999-06-29

A method of managing digital resources of a digital system includes the step of reserving token values for certain digital resources in the digital system. A selected token value in a free-buffer-queue is then matched to an incoming digital resource request. The selected token value is then moved to a valid-request-queue. The selected token is subsequently removed from the valid-request-queue to allow a digital agent in the digital system to process the incoming digital resource request associated with the selected token. Thereafter, the selected token is returned to the free-buffer-queue. 6 figs.

Apparatus and method for managing digital resources by passing digital resource tokens between queues

DOEpatents

Crawford, Henry J.; Lindenstruth, Volker

1999-01-01

A method of managing digital resources of a digital system includes the step of reserving token values for certain digital resources in the digital system. A selected token value in a free-buffer-queue is then matched to an incoming digital resource request. The selected token value is then moved to a valid-request-queue. The selected token is subsequently removed from the valid-request-queue to allow a digital agent in the digital system to process the incoming digital resource request associated with the selected token. Thereafter, the selected token is returned to the free-buffer-queue.

The position profiles of order cancellations in an emerging stock market

NASA Astrophysics Data System (ADS)

Gu, Gao-Feng; Xiong, Xiong; Ren, Fei; Zhou, Wei-Xing; Zhang, Wei

2013-04-01

Order submission and cancellation are two constituent actions of stock trading behaviors in order-driven markets. Order submission dynamics has been extensively studied for different markets, while order cancellation dynamics is less understood. There are two positions associated with a cancellation, that is, the price level in the limit-order book (LOB) and the position in the queue at each price level. We study the profiles of these two order cancellation positions through rebuilding the limit-order book using the order flow data of 23 liquid stocks traded on the Shenzhen Stock Exchange in the year 2003. We find that the profiles of relative price levels where cancellations occur obey a log-normal distribution. After normalizing the relative price level by removing the factor of order numbers stored at the price level, we find that the profiles exhibit a power-law scaling behavior on the right tails for both buy and sell orders. When focusing on the order cancellation positions in the queue at each price level, we find that the profiles increase rapidly in the front of the queue, and then fluctuate around a constant value till the end of the queue. These profiles are similar for different stocks. In addition, the profiles of cancellation positions can be fitted by an exponent function for both buy and sell orders. These two kinds of cancellation profiles seem universal for different stocks investigated and exhibit minor asymmetry between buy and sell orders. Our empirical findings shed new light on the order cancellation dynamics and pose constraints on the construction of order-driven stock market models.

A novel fair active queue management algorithm based on traffic delay jitter

NASA Astrophysics Data System (ADS)

Wang, Xue-Shun; Yu, Shao-Hua; Dai, Jin-You; Luo, Ting

2009-11-01

In order to guarantee the quantity of data traffic delivered in the network, congestion control strategy is adopted. According to the study of many active queue management (AQM) algorithms, this paper proposes a novel active queue management algorithm named JFED. JFED can stabilize queue length at a desirable level by adjusting output traffic rate and adopting a reasonable calculation of packet drop probability based on buffer queue length and traffic jitter; and it support burst packet traffic through the packet delay jitter, so that it can traffic flow medium data. JFED impose effective punishment upon non-responsible flow with a full stateless method. To verify the performance of JFED, it is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that the proposed JFED algorithm outperforms RED and CHOKe in stabilizing instantaneous queue length and in fairness. It is also shown that JFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

Evaluation of roadway sites for queue management.

DOT National Transportation Integrated Search

1991-01-01

This study addresses the problem of queueing on highway facilities, wherein a large number of computerized methods for the analysis of different queueing situations are available. A three-tier classification system of the methodologies was used with ...

Throughput-optimal scheduling for broadcast channels

NASA Astrophysics Data System (ADS)

Eryilmaz, Atilla; Srikant, Rayadurgam; Perkins, James R.

2001-07-01

In this paper, we consider a degraded Gaussian broadcast channel, where the transmitter maintains separate queues for each receiver. We present throughput optimal policies that stabilize the queues without knowing the statistics of the arrival processes to these queues.

Nonfixed Retirement Age for University Professors: Modeling Its Effects on New Faculty Hires.

PubMed

Larson, Richard C; Diaz, Mauricio Gomez

2012-03-01

We model the set of tenure-track faculty members at a university as a queue, where "customers" in queue are faculty members in active careers. Arrivals to the queue are usually young, untenured assistant professors, and departures from the queue are primarily those who do not pass a promotion or tenure hurdle and those who retire. There are other less-often-used ways to enter and leave the queue. Our focus is on system effects of the elimination of mandatory retirement age. In particular, we are concerned with estimating the number of assistant professor slots that annually are no longer available because of the elimination of mandatory retirement. We start with steady-state assumptions that require use of Little's Law of Queueing, and we progress to a transient model using system dynamics. We apply these simple models using available data from our home university, the Massachusetts Institute of Technology.

Nonfixed Retirement Age for University Professors: Modeling Its Effects on New Faculty Hires

PubMed Central

Larson, Richard C.; Diaz, Mauricio Gomez

2013-01-01

We model the set of tenure-track faculty members at a university as a queue, where “customers” in queue are faculty members in active careers. Arrivals to the queue are usually young, untenured assistant professors, and departures from the queue are primarily those who do not pass a promotion or tenure hurdle and those who retire. There are other less-often-used ways to enter and leave the queue. Our focus is on system effects of the elimination of mandatory retirement age. In particular, we are concerned with estimating the number of assistant professor slots that annually are no longer available because of the elimination of mandatory retirement. We start with steady-state assumptions that require use of Little’s Law of Queueing, and we progress to a transient model using system dynamics. We apply these simple models using available data from our home university, the Massachusetts Institute of Technology. PMID:23936582

Best-First Heuristic Search for Multicore Machines

DTIC Science & Technology

2010-01-01

Otto, 1998) to implement an asynchronous version of PRA* that they call Hash Distributed A* ( HDA *). HDA * distributes nodes using a hash function in...nodes which are being communicated between peers are in transit. In contact with the authors of HDA *, we have created an implementation of HDA * for...Also, our implementation of HDA * allows us to make a fair comparison between algorithms by sharing common data structures such as priority queues and

Evaluation of DOTD's Existing Queue Estimation Procedures : Research Project Capsule

DOT National Transportation Integrated Search

2017-10-01

The primary objective of this study is to evaluate the effectiveness of DOTDs queue estimation procedures by comparing results with those obtained directly from site observations through video camera footage or other means. Actual queue start time...

Computing moving and intermittent queue propagation in highway work zones.

DOT National Transportation Integrated Search

2012-07-01

Drivers may experience intermittent congestion and moving queue conditions in work zones due to several reasons such as presence of lane closure, roadway geometric changes, higher demand, lower speed, and reduced capacity. The congestion and queue ha...

An Adaptive Property-Aware HW/SW Framework for DDDAS

DTIC Science & Technology

2014-10-21

sleep queue stores sleeping tasks until their activation time. The task with the earliest activation time is at the front of the sleep queue. At the...queue) or activation time ( sleep queue). Chetan et al. / Procedia Computer Science 00 (2012) 1–9 4 Figure 2: A high level architecture diagram of the...conservative will be the WCET estimation. Vestal et al. suggested the use of Audesly’s prioirity assignment scheme [6] and period transformation technique

A dynamic routing strategy with limited buffer on scale-free network

NASA Astrophysics Data System (ADS)

Wang, Yufei; Liu, Feng

2016-04-01

In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

NASA Astrophysics Data System (ADS)

Chakravarthy, Srinivas R.; Rumyantsev, Alexander

2018-03-01

Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop grids is the level of redundancy (replication) for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.

The evaluation of a formalized queue management system for coronary angiography waiting lists.

PubMed

Alter, D A; Newman, Alice M; Cohen, Eric A; Sykora, Kathy; Tu, Jack V

2005-11-01

Lengthy waiting lists for coronary angiography have been described in many health care systems worldwide. The extent to which formal queue management systems may improve the prioritization and survival of patients in the angiography queue is unknown. To prospectively evaluate the performance of a formal queue management system for patients awaiting coronary angiography in Ontario. The coronary angiography urgency scale, a formal queue management system developed in 1993 using a modified Delphi panel, allocates recommended maximum waiting times (RMWTs) in accordance with clinical necessity. By using a provincial clinical registry, 35,617 consecutive patients referred into the coronary angiography queue between April 1, 2001, and March 31, 2002, were prospectively tracked. Cox proportional hazards models were used to examined mortality risk across urgency after adjusting for additional clinical and comorbid factors. Good agreement was determined in urgency ratings between scores from the coronary angiography urgency scale and implicit physician judgement, which was obtained independently at the time of the index referral (weighted kappa = 0.49). The overall mortality in the queue was 0.3% (0.47%, 0.26% and 0.13% for urgent, semiurgent and elective patients, respectively). Urgency, as specified by the coronary angiography urgency scale, was the strongest predictor of death in the queue (P<0.001). However, when patients were censored according to their RMWTs, mortality was similar across different levels of urgency. Consequently, up to 18.5 deaths per 10,000 patients could have potentially been averted had patients been triaged and undergone coronary angiography within the RMWT as specified by the coronary angiography urgency scale. The incorporation of the coronary angiography urgency scale as a formal queue management system may decrease mortality in the coronary angiography queue. The authors recommend its implementation in health care systems where patients experience excessive waiting time delays for coronary angiography.

Reducing a congestion with introduce the greedy algorithm on traffic light control

NASA Astrophysics Data System (ADS)

Catur Siswipraptini, Puji; Hendro Martono, Wisnu; Hartanti, Dian

2018-03-01

The density of vehicles causes congestion seen at every junction in the city of jakarta due to the static or manual traffic timing lamp system consequently the length of the queue at the junction is uncertain. The research has been aimed at designing a sensor based traffic system based on the queue length detection of the vehicle to optimize the duration of the green light. In detecting the length of the queue of vehicles using infrared sensor assistance placed in each intersection path, then apply Greedy algorithm to help accelerate the movement of green light duration for the path that requires, while to apply the traffic lights regulation program based on greedy algorithm which is then stored on microcontroller with Arduino Mega 2560 type. Where a developed system implements the greedy algorithm with the help of the infrared sensor it will extend the duration of the green light on the long vehicle queue and accelerate the duration of the green light at the intersection that has the queue not too dense. Furthermore, the design is made to form an artificial form of the actual situation of the scale model or simple simulator (next we just called as scale model of simulator) of the intersection then tested. Sensors used are infrared sensors, where the placement of sensors in each intersection on the scale model is placed within 10 cm of each sensor and serves as a queue detector. From the results of the test process on the scale model with a longer queue obtained longer green light time so it will fix the problem of long queue of vehicles. Using greedy algorithms can add long green lights for 2 seconds on tracks that have long queues at least three sensor levels and accelerate time at other intersections that have longer queue sensor levels less than level three.

B-1B Avionics/Automatic Test Equipment: Maintenance Queueing Analysis.

DTIC Science & Technology

1983-12-01

analysis (which is logistics terminology for an avionics/ATE queueing analysis). To allow each vendor the opportunity to perform such an analysis...for system performance measures may be found for the queueing system in Figure 7. This is due to the preemptive blocking caused by ATE failures. The...D-R14l1i75 B-iB AVIONICS/AUTOMPTIC TEST EQUIPMENT: MRINTENRNCE 1/2 QUEUEING RNRLYSIS(U) RIP FORCE INST OF TECH HRIGHT-PRTTERSON RFB OH SCHOOL OF

On-Line Scheduling of Parallel Machines

DTIC Science & Technology

1990-11-01

machine without losing any work; this is referred to as the preemptive model. In contrast to the nonpreemptive model which we have considered in this paper...that there exists no schedule of length d. The 2-relaxed decision procedure is as follows. Put each job into the queue of the slowest machine Mk such...in their queues . If a machine’s queue is empty it takes jobs to process from the queue of the first machine that is slower than it and that has a

Methods and tools for profiling and control of distributed systems

NASA Astrophysics Data System (ADS)

Sukharev, R.; Lukyanchikov, O.; Nikulchev, E.; Biryukov, D.; Ryadchikov, I.

2018-02-01

This article is devoted to the topic of profiling and control of distributed systems. Distributed systems have a complex architecture, applications are distributed among various computing nodes, and many network operations are performed. Therefore, today it is important to develop methods and tools for profiling distributed systems. The article analyzes and standardizes methods for profiling distributed systems that focus on simulation to conduct experiments and build a graph model of the system. The theory of queueing networks is used for simulation modeling of distributed systems, receiving and processing user requests. To automate the above method of profiling distributed systems the software application was developed with a modular structure and similar to a SCADA-system.

The Sojourn Time in a Three Node, Acyclic, Jackson Queueing Network.

DTIC Science & Technology

1982-01-27

Effect of Intermediate Storage on Production Lines with Dependent Machines, Robert D. Foley and Petcharat Chansaenwilai 8015 Some Conditions for the...Queues, Robert D. Foley 8105 Reversibility of Production Lines with Dependent Machines, Petcharat Chansaenwilai 1 8106 Queues with Delayed Feedback, Robert

Request queues for interactive clients in a shared file system of a parallel computing system

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

Bent, John M.; Faibish, Sorin

Interactive requests are processed from users of log-in nodes. A metadata server node is provided for use in a file system shared by one or more interactive nodes and one or more batch nodes. The interactive nodes comprise interactive clients to execute interactive tasks and the batch nodes execute batch jobs for one or more batch clients. The metadata server node comprises a virtual machine monitor; an interactive client proxy to store metadata requests from the interactive clients in an interactive client queue; a batch client proxy to store metadata requests from the batch clients in a batch client queue;more » and a metadata server to store the metadata requests from the interactive client queue and the batch client queue in a metadata queue based on an allocation of resources by the virtual machine monitor. The metadata requests can be prioritized, for example, based on one or more of a predefined policy and predefined rules.« less

Method and apparatus for efficiently tracking queue entries relative to a timestamp

DOEpatents

Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Ohmacht, Martin; Salapura, Velentina; Vranas, Pavlos

2014-06-17

An apparatus and method for tracking coherence event signals transmitted in a multiprocessor system. The apparatus comprises a coherence logic unit, each unit having a plurality of queue structures with each queue structure associated with a respective sender of event signals transmitted in the system. A timing circuit associated with a queue structure controls enqueuing and dequeuing of received coherence event signals, and, a counter tracks a number of coherence event signals remaining enqueued in the queue structure and dequeued since receipt of a timestamp signal. A counter mechanism generates an output signal indicating that all of the coherence event signals present in the queue structure at the time of receipt of the timestamp signal have been dequeued. In one embodiment, the timestamp signal is asserted at the start of a memory synchronization operation and, the output signal indicates that all coherence events present when the timestamp signal was asserted have completed. This signal can then be used as part of the completion condition for the memory synchronization operation.

Interference Drop Scheme: Enhancing QoS Provision in Multi-Hop Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Luo, Chang-Yi; Komuro, Nobuyoshi; Takahashi, Kiyoshi; Kasai, Hiroyuki; Ueda, Hiromi; Tsuboi, Toshinori

Ad hoc networking uses wireless technologies to construct networks with no physical infrastructure and so are expected to provide instant networking in areas such as disaster recovery sites and inter-vehicle communication. Unlike conventional wired networks services, services in ad hoc networks are easily disrupted by the frequent changes in traffic and topology. Therefore, solutions to assure the Quality of Services (QoS) in ad hoc networks are different from the conventional ones used in wired networks. In this paper, we propose a new queue management scheme, Interference Drop Scheme (IDS) for ad hoc networks. In the conventional queue management approaches such as FIFO (First-in First-out) and RED (Random Early Detection), a queue is usually managed by a queue length limit. FIFO discards packets according to the queue limit, and RED discards packets in an early and random fashion. IDS, on the other hand, manages the queue according to wireless interference time, which increases as the number of contentions in the MAC layer increases. When there are many MAC contentions, IDS discards TCP data packets. By observing the interference time and discarding TCP data packets, our simulation results show that IDS improves TCP performance and reduces QoS violations in UDP in ad hoc networks with chain, grid, and random topologies. Our simulation results also demonstrate that wireless interference time is a better metric than queue length limit for queue management in multi-hop ad hoc networks.

Queues and Reference Service: Some Implications for Staffing

ERIC Educational Resources Information Center

Regazzi, John J.; Hersberger, Rodney M.

1978-01-01

This study at an academic library used a simulation technique (1) to analyze the extent to which queues develop at a reference desk during peak periods, (2) to propose alternative staffing models to reduce queues, and (3) to examine the cost effectiveness of the alternatives. (Author/JAB)

41 CFR 105-60.402-2 - Response to initial requests.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Management Regulations System (Continued) GENERAL SERVICES ADMINISTRATION Regional Offices-General Services... denial. (e) GSA may, at its discretion, establish three processing queues based on whether any requests... each queue, responses will be prepared on a “first in, first out” basis. One queue will be made up of...

Performance characteristics of a batch service queueing system with functioning server failure and multiple vacations

NASA Astrophysics Data System (ADS)

Niranjan, S. P.; Chandrasekaran, V. M.; Indhira, K.

2018-04-01

This paper examines bulk arrival and batch service queueing system with functioning server failure and multiple vacations. Customers are arriving into the system in bulk according to Poisson process with rate λ. Arriving customers are served in batches with minimum of ‘a’ and maximum of ‘b’ number of customers according to general bulk service rule. In the service completion epoch if the queue length is less than ‘a’ then the server leaves for vacation (secondary job) of random length. After a vacation completion, if the queue length is still less than ‘a’ then the server leaves for another vacation. The server keeps on going vacation until the queue length reaches the value ‘a’. The server is not stable at all the times. Sometimes it may fails during functioning of customers. Though the server fails service process will not be interrupted.It will be continued for the current batch of customers with lower service rate than the regular service rate. The server will be repaired after the service completion with lower service rate. The probability generating function of the queue size at an arbitrary time epoch will be obtained for the modelled queueing system by using supplementary variable technique. Moreover various performance characteristics will also be derived with suitable numerical illustrations.

Distributed Sensor Networks

DTIC Science & Technology

1979-09-30

University, Pittsburgh, Pennsylvania (1976). 14. R. L. Kirby, "ULISP for PDP-11s with Memory Management ," Report MCS-76-23763, University of Maryland...teletVpe or 9 raphIc S output. The recor iuL, po , uitist il so mon itot its owvn ( Onmand queue and a( knowlede commands Sent to It hN the UsCtr interfa I...kernel. By a net- work kernel we mean a multicomputer distributed operating system kernel that includes proces- sor schedulers, "core" memory managers , and

The Software Distribution for Gemini Observatory's Science Operations Group

NASA Astrophysics Data System (ADS)

Hoenig, M. D.; Clarke, M.; Pohlen, M.; Hirst, P.

2014-05-01

Gemini Observatory consists of two telescopes in different hemispheres. It also operates mostly on a queue observing model, meaning observations are performed by staff working shifts as opposed to PIs. For these two reasons alone, maintaining and distributing a diverse software suite is not a trivial matter. We present a way to make the appropriate tools available to staff at Gemini North and South, whether they are working on the summit or from our base facility offices in Hilo, Hawai'i and La Serena, Chile.

Transient probabilities for queues with applications to hospital waiting list management.

PubMed

Joy, Mark; Jones, Simon

2005-08-01

In this paper we study queuing systems within the NHS. Recently imposed government performance targets lead NHS executives to investigate and instigate alternative management strategies, thereby imposing structural changes on the queues. Under such circumstances, it is most unlikely that such systems are in equilibrium. It is crucial, in our opinion, to recognise this state of affairs in order to make a balanced assessment of the role of queue management in the modern NHS. From a mathematical perspective it should be emphasised that measures of the state of a queue based upon the assumption of statistical equilibrium (a pervasive methodology in the study of queues) are simply wrong in the above scenario. To base strategic decisions around such ideas is therefore highly questionable and it is one of the purposes of this paper to offer alternatives: we present some (recent) research whose results generate performance measures and measures of risk, for example, of waiting-times growing unacceptably large; we emphasise that these results concern the transient behaviour of the queueing model-there is no asssumption of statistical equilibrium. We also demonstrate that our results are computationally tractable.

Single stage queueing/manufacturing system model that involves emission variable

NASA Astrophysics Data System (ADS)

Murdapa, P. S.; Pujawan, I. N.; Karningsih, P. D.; Nasution, A. H.

2018-04-01

Queueing is commonly occured at every industry. The basic model of queueing theory gives a foundation for modeling a manufacturing system. Nowadays, carbon emission is an important and inevitable issue due to its huge impact to our environment. However, existing model of queuing applied for analysis of single stage manufacturing system has not taken Carbon emissions into consideration. If it is applied to manufacturing context, it may lead to improper decisisions. By taking into account of emission variables into queuing models, not only the model become more comprehensive but also it creates awareness on the issue to many parties that involves in the system. This paper discusses the single stage M/M/1 queueing model that involves emission variable. Hopefully it could be a starting point for the next more complex models. It has a main objective for determining how carbon emissions could fit into the basic queueing theory. It turned out that the involvement of emission variables into the model has modified the traditional model of a single stage queue to a calculation model of production lot quantity allowed per period.

Numbers or apologies? Customer reactions to telephone waiting time fillers.

PubMed

Munichor, Nira; Rafaeli, Anat

2007-03-01

The authors examined the effect of time perception and sense of progress in telephone queues on caller reactions to 3 telephone waiting time fillers: music, apologies, and information about location in the queue. In Study 1, conducted on 123 real calls, call abandonment was lowest, and call evaluations were most positive with information about location in the queue as the time filler. In Study 2, conducted with 83 participants who experienced a simulated telephone wait experience, sense of progress in the queue rather than perceived waiting time mediated the relationship between telephone waiting time filler and caller reactions. The findings provide insight for the management and design of telephone queues, as well as theoretical insight into critical cognitive processes that underlie telephone waiting, opening up an important new research agenda. (c) 2007 APA, all rights reserved.

Store operation with conditional push of a tag value to a queue

DOEpatents

Heidelberger, Philip; Steinmacher-Burow, Burkhard

2015-07-28

According to one embodiment, a method for a store operation with a conditional push of a tag value to a queue is provided. The method includes configuring a queue that is accessible by an application, setting a value at an address in a memory device including a memory and a controller, receiving a request for an operation using the value at the address and performing the operation. The method also includes the controller writing a result of the operation to the address, thus changing the value at the address, the controller determining if the result of the operation meets a condition and the controller pushing a tag value to the queue based on the condition being met, where the tag value in the queue indicates to the application that the condition is met.

Tables of Queue Size and Waiting Time Distributions for M/M/c, M/D/c, and D/M/c Queueing Systems.

DTIC Science & Technology

1980-03-01

1091.0se-G. 4.11,61148 III- U .3 3"’s .2% .... 1.. 00-. :=1 2"’ all, I w 󈧕". 1 6.11:,""o 209.4 s. of 0 ::::v Iso ".. ...... t. 1.0 it oj .1. .11211111-41...72204011-06 A.0. " : " : 3:: 2;.1000561-02 .1.26 It G. 10 02 .40.. 1 a 2, ISO taOj *::% 9,110- 1 20 1. 11-.; 0-04161. 1. 1, 11" I-SP It-01 0.1.1002 21...0. 󈧄 .4 . . ISO 91-0) In* 66: : 0 14.12 b"ll: 00- 0.1.91ij 1 0 1 1: ?1 1, -"i’ll-02 10 1 1112 .2.0 1 0.99-8 1299-05 0. 9VOSIS 1 2. -. 2 .10 . - 0

77 FR 15095 - Combined Notice of Filings #1

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-14

.... 3250; Queue No. W2-091 to be effective 2/14/2012. Filed Date: 3/7/12. Accession Number: 20120307-5041.... Description: Original Service Agreement No. 3249; Queue No. W2-088 effective 2/14/2012 [initial submission description misidentified as No. 3250; Queue No. W2-091. Filed Date: 3/7/12. Accession Number: 20120307-5051...

Queue observing at the Observatoire du Mont-Mégantic 1.6-m telescope

NASA Astrophysics Data System (ADS)

Artigau, Étienne; Lamontagne, Robert; Doyon, René; Malo, Lison

2010-07-01

Queue planning of observation and service observing are generally seen as specific to large, world-class, astronomical observatories that draw proposal from a large community. One of the common grievance, justified or not, against queue planning and service observing is the fear of training a generation of astronomers without hands-on observing experience. At the Observatoire du Mont-Mégantic (OMM) 1.6-m telescope, we are developing a student-run service observing program. Queue planning and service observing are used as training tools to expose students to a variety of scientific project and instruments beyond what they would normally use for their own research project. The queue mode at the OMM specifically targets relatively shallow observations that can be completed in less than a few hours and are too short to justify a multi-night classical observing run.

Study on queueing behavior in pedestrian evacuation by extended cellular automata model

NASA Astrophysics Data System (ADS)

Hu, Jun; You, Lei; Zhang, Hong; Wei, Juan; Guo, Yangyong

2018-01-01

This paper proposes a pedestrian evacuation model for effective simulation of evacuation efficiency based on extended cellular automata. In the model, pedestrians' momentary transition probability to a target position is defined in terms of the floor field and queueing time, and the critical time is defined as the waiting time threshold in a queue. Queueing time and critical time are derived using Fractal Brownian Motion through analysis of pedestrian arrival characteristics. Simulations using the platform and actual evacuations were conducted to study the relationships among system evacuation time, average system velocity, pedestrian density, flow rate, and critical time. The results demonstrate that at low pedestrian density, evacuation efficiency can be improved through adoption of the shortest route strategy, and critical time has an inverse relationship with average system velocity. Conversely, at higher pedestrian densities, it is better to adopt the shortest queueing time strategy, and critical time is inversely related to flow rate.

A robust and high-performance queue management controller for large round trip time networks

NASA Astrophysics Data System (ADS)

Khoshnevisan, Ladan; Salmasi, Farzad R.

2016-05-01

Congestion management for transmission control protocol is of utmost importance to prevent packet loss within a network. This necessitates strategies for active queue management. The most applied active queue management strategies have their inherent disadvantages which lead to suboptimal performance and even instability in the case of large round trip time and/or external disturbance. This paper presents an internal model control robust queue management scheme with two degrees of freedom in order to restrict the undesired effects of large and small round trip time and parameter variations in the queue management. Conventional approaches such as proportional integral and random early detection procedures lead to unstable behaviour due to large delay. Moreover, internal model control-Smith scheme suffers from large oscillations due to the large round trip time. On the other hand, other schemes such as internal model control-proportional integral and derivative show excessive sluggish performance for small round trip time values. To overcome these shortcomings, we introduce a system entailing two individual controllers for queue management and disturbance rejection, simultaneously. Simulation results based on Matlab/Simulink and also Network Simulator 2 (NS2) demonstrate the effectiveness of the procedure and verify the analytical approach.

The congestion control algorithm based on queue management of each node in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

2016-12-01

This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

Propagation speed of a starting wave in a queue of pedestrians.

PubMed

Tomoeda, Akiyasu; Yanagisawa, Daichi; Imamura, Takashi; Nishinari, Katsuhiro

2012-09-01

The propagation speed of a starting wave, which is a wave of people's successive reactions in the relaxation process of a queue, has an essential role for pedestrians and vehicles to achieve smooth movement. For example, a queue of vehicles with appropriate headway (or density) alleviates traffic jams since the delay of reaction to start is minimized. In this paper, we have investigated the fundamental relation between the propagation speed of a starting wave and the initial density by both our mathematical model built on the stochastic cellular automata and experimental measurements. Analysis of our mathematical model implies that the relation is characterized by the power law αρ-β (β≠1), and the experimental results verify this feature. Moreover, when the starting wave is characterized by the power law (β>1), we have revealed the existence of optimal density, where the required time, i.e., the sum of the waiting time until the starting wave reaches the last pedestrian in a queue and his/her travel time to pass the head position of the initial queue, is minimized. This optimal density inevitably plays a significant role in achieving a smooth movement of crowds and vehicles in a queue.

A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles

DTIC Science & Technology

2013-09-01

Autonomous Vehicles Joseph DiVita, PhD Robert L. Morris Maria Olinda Rodas SSC Pacific Approved...298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18 09–2013 Final A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles Joseph...Mission Area: Command and Control, Queueing Model; Supervisory Control; Unmanned Autonomous Vehicles M. O. Rodas U U U U 38 (619)

Research on a Queue Scheduling Algorithm in Wireless Communications Network

NASA Astrophysics Data System (ADS)

Yang, Wenchuan; Hu, Yuanmei; Zhou, Qiancai

This paper proposes a protocol QS-CT, Queue Scheduling Mechanism based on Multiple Access in Ad hoc net work, which adds queue scheduling mechanism to RTS-CTS-DATA using multiple access protocol. By endowing different queues different scheduling mechanisms, it makes networks access to the channel much more fairly and effectively, and greatly enhances the performance. In order to observe the final performance of the network with QS-CT protocol, we simulate it and compare it with MACA/C-T without QS-CT protocol. Contrast to MACA/C-T, the simulation result shows that QS-CT has greatly improved the throughput, delay, rate of packets' loss and other key indicators.

Parallel integer sorting with medium and fine-scale parallelism

NASA Technical Reports Server (NTRS)

Dagum, Leonardo

1993-01-01

Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.

Optimal Service Capacities in a Competitive Multiple-Server Queueing Environment

NASA Astrophysics Data System (ADS)

Ching, Wai-Ki; Choi, Sin-Man; Huang, Min

The study of economic behavior of service providers in a competition environment is an important and interesting research issue. A two-server queueing model has been proposed in Kalai et al. [11] for this purpose. Their model aims at studying the role and impact of service capacity in capturing larger market share so as to maximize the long-run expected profit. They formulate the problem as a two-person strategic game and analyze the equilibrium solutions. The main aim of this paper is to extend the results of the two-server queueing model in [11] to the case of multiple servers. We will only focus on the case when the queueing system is stable.

Predicting clinical image delivery time by monitoring PACS queue behavior.

PubMed

King, Nelson E; Documet, Jorge; Liu, Brent

2006-01-01

The expectation of rapid image retrieval from PACS users contributes to increased information technology (IT) infrastructure investments to increase performance as well as continuing demands upon PACS administrators to respond to "slow" system performance. The ability to provide predicted delivery times to a PACS user may curb user expectations for "fastest" response especially during peak hours. This, in turn, could result in a PACS infrastructure tailored to more realistic performance demands. A PACS with a stand-alone architecture under peak load typically holds study requests in a queue until the DICOM C-Move command can take place. We investigate the contents of a stand-alone architecture PACS RetrieveSend queue and identified parameters and behaviors that enable a more accurate prediction of delivery time. A prediction algorithm for studies delayed in a stand-alone PACS queue can be extendible to other potential bottlenecks such as long-term storage archives. Implications of a queue monitor in other PACS architectures are also discussed.

British Columbia sends patients to Seattle for coronary artery surgery. Bypassing the queue in Canada.

PubMed

Katz, S J; Mizgala, H F; Welch, H G

1991-08-28

Concern about waiting lists for elective procedures has become a highly visible challenge to the universal health insurance program in Canada. In response to lengthening queues for patients waiting for cardiac surgery, British Columbia made contracts with four Seattle hospitals to send a total of 200 patients for coronary artery bypass surgery. This article examines the cause of the queue for cardiac surgery in British Columbia and the events that led to outside contracting. Global hospital budgets and restrictions on capital expansion have limited hospital capacity for cardiac surgery. This constrained supply, combined with periodic shortages in critical care nurses and cardiac perfusion technologists, has resulted in a rapid increase in the waiting list. Reducing wide variations in the lengths of queues for individual surgeons may afford an opportunity to reduce long waits. While the patient queue for cardiac surgery has sparked a public debate about budget limits and health care needs, its clinical impact remains uncertain.

Social stability and helping in small animal societies

PubMed Central

Field, Jeremy; Cant, Michael A.

2009-01-01

In primitively eusocial societies, all individuals can potentially reproduce independently. The key fact that we focus on in this paper is that individuals in such societies instead often queue to inherit breeding positions. Queuing leads to systematic differences in expected future fitness. We first discuss the implications this has for variation in behaviour. For example, because helpers nearer to the front of the queue have more to lose, they should work less hard to rear the dominant's offspring. However, higher rankers may be more aggressive than low rankers, even if they risk injury in the process, if aggression functions to maintain or enhance queue position. Second, we discuss how queuing rules may be enforced through hidden threats that rarely have to be carried out. In fishes, rule breakers face the threat of eviction from the group. In contrast, subordinate paper wasps are not injured or evicted during escalated challenges against the dominant, perhaps because they are more valuable to the dominant. We discuss evidence that paper-wasp dominants avoid escalated conflicts by ceding reproduction to subordinates. Queuing rules appear usually to be enforced by individuals adjacent in the queue rather than by dominants. Further manipulative studies are required to reveal mechanisms underlying queue stability and to elucidate what determines queue position in the first place. PMID:19805426

BioQueue: a novel pipeline framework to accelerate bioinformatics analysis.

PubMed

Yao, Li; Wang, Heming; Song, Yuanyuan; Sui, Guangchao

2017-10-15

With the rapid development of Next-Generation Sequencing, a large amount of data is now available for bioinformatics research. Meanwhile, the presence of many pipeline frameworks makes it possible to analyse these data. However, these tools concentrate mainly on their syntax and design paradigms, and dispatch jobs based on users' experience about the resources needed by the execution of a certain step in a protocol. As a result, it is difficult for these tools to maximize the potential of computing resources, and avoid errors caused by overload, such as memory overflow. Here, we have developed BioQueue, a web-based framework that contains a checkpoint before each step to automatically estimate the system resources (CPU, memory and disk) needed by the step and then dispatch jobs accordingly. BioQueue possesses a shell command-like syntax instead of implementing a new script language, which means most biologists without computer programming background can access the efficient queue system with ease. BioQueue is freely available at https://github.com/liyao001/BioQueue. The extensive documentation can be found at http://bioqueue.readthedocs.io. li_yao@outlook.com or gcsui@nefu.edu.cn. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Queues on a Dynamically Evolving Graph

NASA Astrophysics Data System (ADS)

Mandjes, Michel; Starreveld, Nicos J.; Bekker, René

2018-04-01

This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in parallel. The links that connect the queues have the special feature that they are unreliable, in the sense that their status alternates between `up' and `down'. If a link between two nodes is down, with a fixed probability each of the clients attempting to use that link is lost; otherwise the client remains at the origin node and reattempts using the link (and jumps to the destination node when it finds the link restored). For these networks we present the following results: (a) a system of coupled partial differential equations that describes the joint probability generating function corresponding to the queues' time-dependent behavior (and a system of ordinary differential equations for its stationary counterpart), (b) an algorithm to evaluate the (time-dependent and stationary) moments, and procedures to compute user-perceived performance measures which facilitate the quantification of the impact of the links' outages, (c) a diffusion limit for the joint queue length process. We include explicit results for a series relevant special cases, such as tandem networks and symmetric fully connected networks.

Application of Queueing Theory to the Analysis of Changes in Outpatients' Waiting Times in Hospitals Introducing EMR

PubMed Central

Cho, Kyoung Won; Kim, Seong Min; Chae, Young Moon

2017-01-01

Objectives This research used queueing theory to analyze changes in outpatients' waiting times before and after the introduction of Electronic Medical Record (EMR) systems. Methods We focused on the exact drawing of two fundamental parameters for queueing analysis, arrival rate (λ) and service rate (µ), from digital data to apply queueing theory to the analysis of outpatients' waiting times. We used outpatients' reception times and consultation finish times to calculate the arrival and service rates, respectively. Results Using queueing theory, we could calculate waiting time excluding distorted values from the digital data and distortion factors, such as arrival before the hospital open time, which occurs frequently in the initial stage of a queueing system. We analyzed changes in outpatients' waiting times before and after the introduction of EMR using the methodology proposed in this paper, and found that the outpatients' waiting time decreases after the introduction of EMR. More specifically, the outpatients' waiting times in the target public hospitals have decreased by rates in the range between 44% and 78%. Conclusions It is possible to analyze waiting times while minimizing input errors and limitations influencing consultation procedures if we use digital data and apply the queueing theory. Our results verify that the introduction of EMR contributes to the improvement of patient services by decreasing outpatients' waiting time, or by increasing efficiency. It is also expected that our methodology or its expansion could contribute to the improvement of hospital service by assisting the identification and resolution of bottlenecks in the outpatient consultation process. PMID:28261529

Application of Queueing Theory to the Analysis of Changes in Outpatients' Waiting Times in Hospitals Introducing EMR.

PubMed

Cho, Kyoung Won; Kim, Seong Min; Chae, Young Moon; Song, Yong Uk

2017-01-01

This research used queueing theory to analyze changes in outpatients' waiting times before and after the introduction of Electronic Medical Record (EMR) systems. We focused on the exact drawing of two fundamental parameters for queueing analysis, arrival rate (λ) and service rate (µ), from digital data to apply queueing theory to the analysis of outpatients' waiting times. We used outpatients' reception times and consultation finish times to calculate the arrival and service rates, respectively. Using queueing theory, we could calculate waiting time excluding distorted values from the digital data and distortion factors, such as arrival before the hospital open time, which occurs frequently in the initial stage of a queueing system. We analyzed changes in outpatients' waiting times before and after the introduction of EMR using the methodology proposed in this paper, and found that the outpatients' waiting time decreases after the introduction of EMR. More specifically, the outpatients' waiting times in the target public hospitals have decreased by rates in the range between 44% and 78%. It is possible to analyze waiting times while minimizing input errors and limitations influencing consultation procedures if we use digital data and apply the queueing theory. Our results verify that the introduction of EMR contributes to the improvement of patient services by decreasing outpatients' waiting time, or by increasing efficiency. It is also expected that our methodology or its expansion could contribute to the improvement of hospital service by assisting the identification and resolution of bottlenecks in the outpatient consultation process.

Waiting for coronary angiography: is there a clinically ordered queue?

PubMed

Hemingway, H; Crook, A M; Feder, G; Dawson, J R; Timmis, A

2000-03-18

Among over 3000 patients undergoing coronary angiography in the absence of a formal queue-management system, we found that a-priori urgency scores were strongly associated with waiting times, prevalence of coronary-artery disease, rate of revascularisation, and mortality. These data challenge the widely held assumption that such waiting lists are not clinically ordered; however, the wide variation in waiting times within urgency categories suggests the need for further improvements in clinical queueing.

Cost Comparison of B-1B Non-Mission-Capable Drivers Using Finite Source Queueing with Spares

DTIC Science & Technology

2012-09-06

COMPARISON OF B-1B NON-MISSION-CAPABLE DRIVERS USING FINITE SOURCE QUEUEING WITH SPARES GRADUATE RESEARCH PAPER Presented to the Faculty...step into the lineup making large-number approximations unusable. Instead, a finite source queueing model including spares is incorporated...were reported as flying time accrued since last occurrence. Service time was given in both start-stop format and MX man-hours utilized. Service time was

Multifractal Internet Traffic Model and Active Queue Management

DTIC Science & Technology

2003-01-01

dropped by the Adaptive RED , ssthresh decreases from 64KB to 4KB and the new con- gestion window cwnd is decreased from 8KB to 1KB (Tahoe). The situation...method to predict the queuing behavior of FIFO and RED queues. In order to satisfy a given delay and jitter requirement for real time connections, and to...5.2 Vulnerability of Adaptive RED to Web-mice . . . . . . . . . . . . . 103 5.3 A Parallel Virtual Queues Structure

An agent-based model for queue formation of powered two-wheelers in heterogeneous traffic

NASA Astrophysics Data System (ADS)

Lee, Tzu-Chang; Wong, K. I.

2016-11-01

This paper presents an agent-based model (ABM) for simulating the queue formation of powered two-wheelers (PTWs) in heterogeneous traffic at a signalized intersection. The main novelty is that the proposed interaction rule describing the position choice behavior of PTWs when queuing in heterogeneous traffic can capture the stochastic nature of the decision making process. The interaction rule is formulated as a multinomial logit model, which is calibrated by using a microscopic traffic trajectory dataset obtained from video footage. The ABM is validated against the survey data for the vehicular trajectory patterns, queuing patterns, queue lengths, and discharge rates. The results demonstrate that the proposed model is capable of replicating the observed queue formation process for heterogeneous traffic.

Infinite capacity multi-server queue with second optional service channel

NASA Astrophysics Data System (ADS)

Ke, Jau-Chuan; Wu, Chia-Huang; Pearn, Wen Lea

2013-02-01

This paper deals with an infinite-capacity multi-server queueing system with a second optional service (SOS) channel. The inter-arrival times of arriving customers, the service times of the first essential service (FES) and the SOS channel are all exponentially distributed. A customer may leave the system after the FES channel with probability (1-θ), or at the completion of the FES may immediately require a SOS with probability θ (0 <= θ <= 1). The formulae for computing the rate matrix and stationary probabilities are derived by means of a matrix analytical approach. A cost model is developed to determine the optimal values of the number of servers and the two service rates, simultaneously, at the minimal total expected cost per unit time. Quasi-Newton method are employed to deal with the optimization problem. Under optimal operating conditions, numerical results are provided in which several system performance measures are calculated based on assumed numerical values of the system parameters.

The relationship between (stigmatizing) views and lay public preferences regarding tuberculosis treatment in the Eastern Cape, South Africa.

PubMed

Cramm, Jane M; Nieboer, Anna P

2011-01-14

Tuberculosis (TB) and human immune virus/acquired immune deficiency syndrome (HIV/AIDS) stigmas affect public attitudes toward TB treatment and policy. This study examined 'stigmatizing' ideas and the view that 'TB patients should line-up in the chronic illness queue' in relation to preferences and attitudes toward TB treatment. Data were gathered through a survey administered to respondents from 1,020 households in Grahamstown. The survey measured stigmatization surrounding TB and HIV/AIDS, and determined perceptions of respondents whether TB patients should queue with other chronically ill patients. Respondents selected support and treatment options they felt would benefit TB patients. Statistical analysis identified the prevalence of TB and HIV/AIDS stigmas. Logistic regression analyses explored associations between stigmatizing ideas, views regarding TB patients in the chronic illness queue, and attitudes toward support and treatment. Respondents with TB stigmatizing ideas held positive attitudes toward volunteer support, special TB queues, and treatment at clinics; they held negative attitudes toward temporary disability grants, provision of information at work or school, and treatment at the TB hospital. Respondents who felt it beneficial for TB patients to queue with other chronically ill patients conversely held positive attitudes toward provision of porridge and disability grants, and treatment at the TB hospital; they held negative attitudes toward volunteer support, special TB queues, information provision at work or school, and treatment at clinics. These results showed that two varying views related to visibility factors that expose patients to stigmatization (one characterized by TB stigma, the other by the view that TB patients should queue with other chronically ill patients) are associated with opposing attitudes and preferences towards TB treatment. These opposing attitudes complicate treatment outcomes, and suggest that complex behaviors must be taken into account when designing health policy.

Queueing analysis of a canonical model of real-time multiprocessors

NASA Technical Reports Server (NTRS)

Krishna, C. M.; Shin, K. G.

1983-01-01

A logical classification of multiprocessor structures from the point of view of control applications is presented. A computation of the response time distribution for a canonical model of a real time multiprocessor is presented. The multiprocessor is approximated by a blocking model. Two separate models are derived: one created from the system's point of view, and the other from the point of view of an incoming task.

Parallel and Distributed Computing Combinatorial Algorithms

DTIC Science & Technology

1993-10-01

Discrete Math , 1991. In press. [551 L. Finkelstein, D. Kleitman, and T. Leighton. Applying the classification theorem for finite simple groups to minimize...Mathematics (in press). [741 L. Heath, T. Leighton, and A. Rosenberg. Comparing queue and stack layouts. SIAM J Discrete Math , 5(3):398-412, August 1992...line can meet only a few. DIMA CS Series in Discrete Math and Theoretical Computer Science, 9, 1993. Publications, Presentations and Theses Supported

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

PubMed

Li, Lian-Hui; Mo, Rong

2015-01-01

The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC) is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS) improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop

PubMed Central

Li, Lian-hui; Mo, Rong

2015-01-01

The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC) is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS) improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility. PMID:26414758

Combining multi-layered bitmap files using network specific hardware

DOEpatents

DuBois, David H [Los Alamos, NM; DuBois, Andrew J [Santa Fe, NM; Davenport, Carolyn Connor [Los Alamos, NM

2012-02-28

Images and video can be produced by compositing or alpha blending a group of image layers or video layers. Increasing resolution or the number of layers results in increased computational demands. As such, the available computational resources limit the images and videos that can be produced. A computational architecture in which the image layers are packetized and streamed through processors can be easily scaled so to handle many image layers and high resolutions. The image layers are packetized to produce packet streams. The packets in the streams are received, placed in queues, and processed. For alpha blending, ingress queues receive the packetized image layers which are then z sorted and sent to egress queues. The egress queue packets are alpha blended to produce an output image or video.

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

Steady-State Algorithmic Analysis M/M/c Two-Priority Queues with Heterogeneous Rates.

DTIC Science & Technology

1981-04-21

ALGORITHMIC ANALYSIS OF M/M/c TWO-PRIORITY QUEUES WITH HETEROGENEOUS RATES by Douglas R. Miller An algorithm for steady-state analysis of M/M/c nonpreemptive ...practical algorithm for systems involving more than two priority classes. The preemptive case is simpler than the nonpreemptive case; an algorithm for it...priority nonpreemptive queueing system with arrival rates 1 and X2 and service rates V and p42 * The state space can be described as follows. Let xi,j,k be

A Cellular Neural Networks Based DiffServ Switch for Satellite Communication Systems

NASA Astrophysics Data System (ADS)

Tarchi, Daniele; Fantacci, Romano; Gubellini, Roberto; Pecorella, Tommaso

2003-07-01

Recent developments of Internet services and advanced compression methods has revived interest on IP based multimedia satellite communication systems. However a main problem arising here is to guarantee specific Quality of Service (QoS) constraints in order to have good performance for each traffic class.Among various QoS approach used in Internet, recently the DiffServ technique has became the most promising so- lution, mainly for its simplicity with respect to different alternatives. Moreover, in satellite communication systems, DiffServ policy computational capabilities are placed at the edge points (end-to-end philosophy); this is very important for a network constituted by one satellite link because it allows to reduce the implementation complexity of the satellite on-board equipments.The satellite switch under consideration makes use of the Multiple Input Queuing approach. Packets arrived at a switch input are stored in a shared buffer but they are logically ordered in individual queues, one for each possible output link. According to the DiffServ policy, within a same logical queue, packets are reordered in individual sub-queues according to the priority. A suitable implementation of the DiffServ policy based on a Cellular Neural Network (CNN) is proposed in the paper in order to achieve QoS requirements.The CNNs are a set of linear and nonlinear circuits connected among them that allow parallel and asynchronous computation. CNNs are a class of neural networks similar to Hopfield Neural Networks (HNN), but more flexible and suitable for solving the output contention problem, inherent of switching systems, for VLSI implementation.In this paper a CNN has been designed in order to maximize a cost functional, related to the on-board switch through- put and QoS constraints. The initial state for each neural cell is obtained looking at the presence of at least one packet from a certain input logical queue to a specific output line. The input value for each neural cell is a function of priority and length of each input logical queue. The versatility of neural network make feasible to take the best decision for the packet to be delivered to each output satellite beam, in order to meet specific QoS constraints. Numerical results for CNN approach highlights that Neural network convergence within a time slot is guaranteed, and an optimal, or at least near-optimal, solution in terms of cost function is achieved.The proposed system is based on the IETF (Internet Engineering Task Force) recommendations; this means that traffic entering the switching fabric could be marked as Expedited Forward (EF) or Assured Forward (AF), otherwise handled as Best Effort (BE). Two Assured Forward classes with different emission priority have been implemented, taking into account time spent inside the logical queue and its length. Expedited Forward traffic is typical of services to be delivered with the maximum priority, as streaming or interactive services. The packets, belonging to services that need a certain level of priority with low packet loss, are marked as Assured Forward. Best Effort traffic is related to e-mail or file transfer, or other that have not particular QoS requirements. The CNN used to solve conflict situations act as an arbiter for all the output links. Differently from other Multiple Input Queuing approach, where one arbiter for each output line is present, in proposed approach there exist only one arbiter that make the best decision. The selected rule has been defined in order to give priority to packets, according to opportunely defined functionals characteristic of each traffic class, under the constraint that no more than one packet can be delivered to the same output line. The functionals depend on queue length and time spent inside the queue by front packet.The performance of the proposed DiffServ switch has been derived in terms of delay and jitter; buffer occupancy has been analyzed for different configuration, such as a unique common buffer, one buffer for each input line, one buffer for each input line and each priority class.The obtained results highlight an high flexibility of satellite switch with CNN, taking into account that functional used to calculate priority of each queue could be easily changed, without any complexity gain nor change in CNN structure, in order to consider different traffic characteristic. Numerical results show that proposed algorithm outperform the switches based on Multiple Input Queuing, that use strictly priority methods, in terms of delay and jitter. Different buffer size have been also considered in order to analyze packet loss for CNN switch algorithm, comparing different configuration described above.The good behavior of the proposed DiffServ switch has been verified in the case of traffic with pareto distribution for packet length and a geometrical distribution for packet interarrival time, highlighting good performance in terms of delay and jitter. Numerical results also demonstrate the stability of this method for heavy load traffic; in particular maximum permitted load is higher for higher priority classes.

An experimental paradigm for team decision processes

NASA Technical Reports Server (NTRS)

Serfaty, D.; Kleinman, D. L.

1986-01-01

The study of distributed information processing and decision making is presently hampered by two factors: (1) The inherent complexity of the mathematical formulation of decentralized problems has prevented the development of models that could be used to predict performance in a distributed environment; and (2) The lack of comprehensive scientific empirical data on human team decision making has hindered the development of significant descriptive models. As a part of a comprehensive effort to find a new framework for multihuman decision making problems, a novel experimental research paradigm was developed involving human terms in decision making tasks. Attempts to construct parts of an integrated model with ideas from queueing networks, team theory, distributed estimation and decentralized resource management are described.

Design and analysis of a model predictive controller for active queue management.

PubMed

Wang, Ping; Chen, Hong; Yang, Xiaoping; Ma, Yan

2012-01-01

Model predictive (MP) control as a novel active queue management (AQM) algorithm in dynamic computer networks is proposed. According to the predicted future queue length in the data buffer, early packets at the router are dropped reasonably by the MPAQM controller so that the queue length reaches the desired value with minimal tracking error. The drop probability is obtained by optimizing the network performance. Further, randomized algorithms are applied to analyze the robustness of MPAQM successfully, and also to provide the stability domain of systems with uncertain network parameters. The performances of MPAQM are evaluated through a series of simulations in NS2. The simulation results show that the MPAQM algorithm outperforms RED, PI, and REM algorithms in terms of stability, disturbance rejection, and robustness. Copyright © 2011 ISA. Published by Elsevier Ltd. All rights reserved.

Queueing for healthcare.

PubMed

Palvannan, R Kannapiran; Teow, Kiok Liang

2012-04-01

Patient queues are prevalent in healthcare and wait time is one measure of access to care. We illustrate Queueing Theory-an analytical tool that has provided many insights to service providers when designing new service systems and managing existing ones. This established theory helps us to quantify the appropriate service capacity to meet the patient demand, balancing system utilization and the patient's wait time. It considers four key factors that affect the patient's wait time: average patient demand, average service rate and the variation in both. We illustrate four basic insights that will be useful for managers and doctors who manage healthcare delivery systems, at hospital or department level. Two examples from local hospitals are shown where we have used queueing models to estimate the service capacity and analyze the impact of capacity configurations, while considering the inherent variation in healthcare.

Ordering of guarded and unguarded stores for no-sync I/O

DOEpatents

Gara, Alan; Ohmacht, Martin

2013-06-25

A parallel computing system processes at least one store instruction. A first processor core issues a store instruction. A first queue, associated with the first processor core, stores the store instruction. A second queue, associated with a first local cache memory device of the first processor core, stores the store instruction. The first processor core updates first data in the first local cache memory device according to the store instruction. The third queue, associated with at least one shared cache memory device, stores the store instruction. The first processor core invalidates second data, associated with the store instruction, in the at least one shared cache memory. The first processor core invalidates third data, associated with the store instruction, in other local cache memory devices of other processor cores. The first processor core flushing only the first queue.

Delay in polling systems in heavy traffic

NASA Astrophysics Data System (ADS)

van der Mei, Robert D.

1998-10-01

We study the delay in asymmetric cyclic polling systems with general mixtures of gated and exhaustive service, with generally distributed service times and switch-over times, in heavy traffic. We obtain closed-form expressions for all moments of the delay incurred at each of the queues. The expressions are strikingly simple and can even be expressed as finite products of known factors. The results provide new insights into the heavy-traffic behavior of polling systems.

A Model of the Base Civil Engineering Work Request/Work Order Processing System.

DTIC Science & Technology

1979-09-01

changes to the work order processing system. This research identifies the variables that significantly affect the accomplishment time and proposes a... order processing system and its behavior with respect to work order processing time. A conceptual model was developed to describe the work request...work order processing system as a stochastic queueing system in which the processing times and the various distributions are treated as random variables

A Critique of the DoD Materiel Distribution Study,

DTIC Science & Technology

1979-03-01

are generated on order cycle times by their components: communication times, depot order processing times, depot capacity delay times, and transit...exceeded, the order was placed in one of three priority queues. The order processing time was determined by priority group by depot. A 20-point probability...time was defined to be the sum of communication, depot order processing , depot capacity delay, and transit times. As has been argued, the first three of

Fokker-Planck description for the queue dynamics of large tick stocks.

PubMed

Garèche, A; Disdier, G; Kockelkoren, J; Bouchaud, J-P

2013-09-01

Motivated by empirical data, we develop a statistical description of the queue dynamics for large tick assets based on a two-dimensional Fokker-Planck (diffusion) equation. Our description explicitly includes state dependence, i.e., the fact that the drift and diffusion depend on the volume present on both sides of the spread. "Jump" events, corresponding to sudden changes of the best limit price, must also be included as birth-death terms in the Fokker-Planck equation. All quantities involved in the equation can be calibrated using high-frequency data on the best quotes. One of our central findings is that the dynamical process is approximately scale invariant, i.e., the only relevant variable is the ratio of the current volume in the queue to its average value. While the latter shows intraday seasonalities and strong variability across stocks and time periods, the dynamics of the rescaled volumes is universal. In terms of rescaled volumes, we found that the drift has a complex two-dimensional structure, which is a sum of a gradient contribution and a rotational contribution, both stable across stocks and time. This drift term is entirely responsible for the dynamical correlations between the ask queue and the bid queue.

Fokker-Planck description for the queue dynamics of large tick stocks

NASA Astrophysics Data System (ADS)

Garèche, A.; Disdier, G.; Kockelkoren, J.; Bouchaud, J.-P.

2013-09-01

Motivated by empirical data, we develop a statistical description of the queue dynamics for large tick assets based on a two-dimensional Fokker-Planck (diffusion) equation. Our description explicitly includes state dependence, i.e., the fact that the drift and diffusion depend on the volume present on both sides of the spread. “Jump” events, corresponding to sudden changes of the best limit price, must also be included as birth-death terms in the Fokker-Planck equation. All quantities involved in the equation can be calibrated using high-frequency data on the best quotes. One of our central findings is that the dynamical process is approximately scale invariant, i.e., the only relevant variable is the ratio of the current volume in the queue to its average value. While the latter shows intraday seasonalities and strong variability across stocks and time periods, the dynamics of the rescaled volumes is universal. In terms of rescaled volumes, we found that the drift has a complex two-dimensional structure, which is a sum of a gradient contribution and a rotational contribution, both stable across stocks and time. This drift term is entirely responsible for the dynamical correlations between the ask queue and the bid queue.

Dynamic properties of chasers in a moving queue based on a delayed chasing model

NASA Astrophysics Data System (ADS)

Ning, Guo; Jian-Xun, Ding; Xiang, Ling; Qin, Shi; Reinhart, Kühne

2016-05-01

A delayed chasing model is proposed to simulate the chase behavior in the queue, where each member regards the closest one ahead as the target, and the leader is attracted to a target point with slight fluctuation. When the initial distances between neighbors possess an identical low value, the fluctuating target of the leader can cause an amplified disturbance in the queue. After a long period of time, the queue recovers the stable state from the disturbance, forming a straight-line-like pattern again, but distances between neighbors grow. Whether the queue can keep stable or not depends on initial distance, desired velocity, and relaxation time. Furthermore, we carry out convergence analysis to explain the divergence transformation behavior and confirm the convergence conditions, which is in approximate agreement with simulations. Project supported by the National Natural Science Foundation of China (Grant Nos. 71071044, 71001001, 71201041, and 11247291), the Doctoral Program of the Ministry of Education of China (Grant Nos. 20110111120023 and 20120111120022), the Postdoctoral Fund Project of China (Grant No. 2013M530295), the National Basic Research Program of China (Grant No. 2012CB725404), and 1000 Plan for Foreign Talent, China (Grant No. WQ20123400070).

A kinematic wave model in Lagrangian coordinates incorporating capacity drop: Application to homogeneous road stretches and discontinuities

NASA Astrophysics Data System (ADS)

Yuan, Kai; Knoop, Victor L.; Hoogendoorn, Serge P.

2017-01-01

On freeways, congestion always leads to capacity drop. This means the queue discharge rate is lower than the pre-queue capacity. Our recent research findings indicate that the queue discharge rate increases with the speed in congestion, that is the capacity drop is strongly correlated with the congestion state. Incorporating this varying capacity drop into a kinematic wave model is essential for assessing consequences of control strategies. However, to the best of authors' knowledge, no such a model exists. This paper fills the research gap by presenting a Lagrangian kinematic wave model. "Lagrangian" denotes that the new model is solved in Lagrangian coordinates. The new model can give capacity drops accompanying both of stop-and-go waves (on homogeneous freeway section) and standing queues (at nodes) in a network. The new model can be applied in a network operation. In this Lagrangian kinematic wave model, the queue discharge rate (or the capacity drop) is a function of vehicular speed in traffic jams. Four case studies on links as well as at lane-drop and on-ramp nodes show that the Lagrangian kinematic wave model can give capacity drops well, consistent with empirical observations.

CPAP Tips

MedlinePlus

... starting stop Loading... Watch Queue Queue __count__/__total__ YouTube Premium Loading... Get YouTube without the ads. Working... No thanks 3-months ... use your CPAP device. Category Education License Standard YouTube License Show more Show less Comments are disabled ...

A Queue Simulation Tool for a High Performance Scientific Computing Center

NASA Technical Reports Server (NTRS)

Spear, Carrie; McGalliard, James

2007-01-01

The NASA Center for Computational Sciences (NCCS) at the Goddard Space Flight Center provides high performance highly parallel processors, mass storage, and supporting infrastructure to a community of computational Earth and space scientists. Long running (days) and highly parallel (hundreds of CPUs) jobs are common in the workload. NCCS management structures batch queues and allocates resources to optimize system use and prioritize workloads. NCCS technical staff use a locally developed discrete event simulation tool to model the impacts of evolving workloads, potential system upgrades, alternative queue structures and resource allocation policies.

Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic,

DTIC Science & Technology

1987-03-01

optimal and ’nearly optimal’ control problems for the open queueing networks in heavy traffic of the type dealt with in the fundamental papers of Reiman ...then the covariance is precisely that obtained by Reiman [1] (with a different notation used there). It is evident from (4.4) and the cited...wU’ ’U, d A K . " -50- References [1] M.I. Reiman , "Open queueing networks in heavy traffic", Math. of Operations Research, 9, 1984, p. 441-458. [2] J

Development of traffic control and queue management procedures for oversaturated arterials

DOT National Transportation Integrated Search

1997-01-01

The formulation and solution of a new algorithm for queue management and coordination of traffic signals along oversaturated arterials are presented. Existing traffic-control and signal-coordination algorithms deal only with undersaturated steady-sta...

Report on dynamic speed harmonization and queue warning algorithm design.

DOT National Transportation Integrated Search

2014-02-01

This report provides a detailed description of the algorithms that will be used to generate harmonized recommended speeds and queue warning information in the proposed Intelligent Network Flow Optimization (INFLO) prototype. This document describes t...

Estimating the waiting time of multi-priority emergency patients with downstream blocking.

PubMed

Lin, Di; Patrick, Jonathan; Labeau, Fabrice

2014-03-01

To characterize the coupling effect between patient flow to access the emergency department (ED) and that to access the inpatient unit (IU), we develop a model with two connected queues: one upstream queue for the patient flow to access the ED and one downstream queue for the patient flow to access the IU. Building on this patient flow model, we employ queueing theory to estimate the average waiting time across patients. Using priority specific wait time targets, we further estimate the necessary number of ED and IU resources. Finally, we investigate how an alternative way of accessing ED (Fast Track) impacts the average waiting time of patients as well as the necessary number of ED/IU resources. This model as well as the analysis on patient flow can help the designer or manager of a hospital make decisions on the allocation of ED/IU resources in a hospital.

Paying for Express Checkout: Competition and Price Discrimination in Multi-Server Queuing Systems

PubMed Central

Deck, Cary; Kimbrough, Erik O.; Mongrain, Steeve

2014-01-01

We model competition between two firms selling identical goods to customers who arrive in the market stochastically. Shoppers choose where to purchase based upon both price and the time cost associated with waiting for service. One seller provides two separate queues, each with its own server, while the other seller has a single queue and server. We explore the market impact of the multi-server seller engaging in waiting cost-based-price discrimination by charging a premium for express checkout. Specifically, we analyze this situation computationally and through the use of controlled laboratory experiments. We find that this form of price discrimination is harmful to sellers and beneficial to consumers. When the two-queue seller offers express checkout for impatient customers, the single queue seller focuses on the patient shoppers thereby driving down prices and profits while increasing consumer surplus. PMID:24667809

Job Scheduling Under the Portable Batch System

NASA Technical Reports Server (NTRS)

Henderson, Robert L.; Woodrow, Thomas S. (Technical Monitor)

1995-01-01

The typical batch queuing system schedules jobs for execution by a set of queue controls. The controls determine from which queues jobs may be selected. Within the queue, jobs are ordered first-in, first-run. This limits the set of scheduling policies available to a site. The Portable Batch System removes this limitation by providing an external scheduling module. This separate program has full knowledge of the available queued jobs, running jobs, and system resource usage. Sites are able to implement any policy expressible in one of several procedural language. Policies may range from "bet fit" to "fair share" to purely political. Scheduling decisions can be made over the full set of jobs regardless of queue or order. The scheduling policy can be changed to fit a wide variety of computing environments and scheduling goals. This is demonstrated by the use of PBS on an IBM SP-2 system at NASA Ames.

Synchronized flow in oversaturated city traffic.

PubMed

Kerner, Boris S; Klenov, Sergey L; Hermanns, Gerhard; Hemmerle, Peter; Rehborn, Hubert; Schreckenberg, Michael

2013-11-01

Based on numerical simulations with a stochastic three-phase traffic flow model, we reveal that moving queues (moving jams) in oversaturated city traffic dissolve at some distance upstream of the traffic signal while transforming into synchronized flow. It is found that, as in highway traffic [Kerner, Phys. Rev. E 85, 036110 (2012)], such a jam-absorption effect in city traffic is explained by a strong driver's speed adaptation: Time headways (space gaps) between vehicles increase upstream of a moving queue (moving jam), resulting in moving queue dissolution. It turns out that at given traffic signal parameters, the stronger the speed adaptation effect, the shorter the mean distance between the signal location and the road location at which moving queues dissolve fully and oversaturated traffic consists of synchronized flow only. A comparison of the synchronized flow in city traffic found in this Brief Report with synchronized flow in highway traffic is made.

On the optimal use of a slow server in two-stage queueing systems

NASA Astrophysics Data System (ADS)

Papachristos, Ioannis; Pandelis, Dimitrios G.

2017-07-01

We consider two-stage tandem queueing systems with a dedicated server in each queue and a slower flexible server that can attend both queues. We assume Poisson arrivals and exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming that two servers cannot collaborate to work on the same job and preemptions are not allowed. We formulate the problem as a Markov decision process and derive properties of the optimal allocation for the dedicated (fast) servers. Specifically, we show that the one downstream should not idle, and the same is true for the one upstream when holding costs are larger there. The optimal allocation of the slow server is investigated through extensive numerical experiments that lead to conjectures on the structure of the optimal policy.

Paying for express checkout: competition and price discrimination in multi-server queuing systems.

PubMed

Deck, Cary; Kimbrough, Erik O; Mongrain, Steeve

2014-01-01

We model competition between two firms selling identical goods to customers who arrive in the market stochastically. Shoppers choose where to purchase based upon both price and the time cost associated with waiting for service. One seller provides two separate queues, each with its own server, while the other seller has a single queue and server. We explore the market impact of the multi-server seller engaging in waiting cost-based-price discrimination by charging a premium for express checkout. Specifically, we analyze this situation computationally and through the use of controlled laboratory experiments. We find that this form of price discrimination is harmful to sellers and beneficial to consumers. When the two-queue seller offers express checkout for impatient customers, the single queue seller focuses on the patient shoppers thereby driving down prices and profits while increasing consumer surplus.

Parallel discrete-event simulation of FCFS stochastic queueing networks

NASA Technical Reports Server (NTRS)

Nicol, David M.

1988-01-01

Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

Synchronized flow in oversaturated city traffic

NASA Astrophysics Data System (ADS)

Kerner, Boris S.; Klenov, Sergey L.; Hermanns, Gerhard; Hemmerle, Peter; Rehborn, Hubert; Schreckenberg, Michael

2013-11-01

Based on numerical simulations with a stochastic three-phase traffic flow model, we reveal that moving queues (moving jams) in oversaturated city traffic dissolve at some distance upstream of the traffic signal while transforming into synchronized flow. It is found that, as in highway traffic [Kerner, Phys. Rev. EPLEEE81539-375510.1103/PhysRevE.85.036110 85, 036110 (2012)], such a jam-absorption effect in city traffic is explained by a strong driver's speed adaptation: Time headways (space gaps) between vehicles increase upstream of a moving queue (moving jam), resulting in moving queue dissolution. It turns out that at given traffic signal parameters, the stronger the speed adaptation effect, the shorter the mean distance between the signal location and the road location at which moving queues dissolve fully and oversaturated traffic consists of synchronized flow only. A comparison of the synchronized flow in city traffic found in this Brief Report with synchronized flow in highway traffic is made.

Improvements in multimedia data buffering using master/slave architecture

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

Sheikh, S.; Ganesan, R.

1996-12-31

Advances in the networking technology and multimedia technology has necessitated a need for multimedia servers to be robust and reliable. Existing solutions have direct limitations such as I/O bottleneck and reliability of data retrieval. The system can store the stream of incoming data if enough buffer space is available or the mass storage is clearing the buffer data faster than queue input. A single buffer queue is not sufficient to handle the large frames. Queue sizes are normally several megabytes in length and thus in turn will introduce a state of overflow. The system should also keep track of themore » rewind, fast forwarding, and pause requests, otherwise queue management will become intricate. In this paper, we present a master/slave (server that is designated to monitor the workflow of the complete system. This server holds every other information of slaves by maintaining a dynamic table. It also controls the workload on each of the systems by redistributing request to others or handles the request by itself) approach which will overcome the limitations of today`s storage and also satisfy tomorrow`s storage needs. This approach will maintain the system reliability and yield faster response by using more storage units in parallel. A network of master/slave can handle many requests and synchronize them at all times. Using dedicated CPU and a common pool of queues we explain how queues can be controlled and buffer overflow can be avoided. We propose a layered approach to the buffering problem and provide a read-ahead solution to ensure continuous storage and retrieval of multimedia data.« less

A novel strategy for load balancing of distributed medical applications.

PubMed

Logeswaran, Rajasvaran; Chen, Li-Choo

2012-04-01

Current trends in medicine, specifically in the electronic handling of medical applications, ranging from digital imaging, paperless hospital administration and electronic medical records, telemedicine, to computer-aided diagnosis, creates a burden on the network. Distributed Service Architectures, such as Intelligent Network (IN), Telecommunication Information Networking Architecture (TINA) and Open Service Access (OSA), are able to meet this new challenge. Distribution enables computational tasks to be spread among multiple processors; hence, performance is an important issue. This paper proposes a novel approach in load balancing, the Random Sender Initiated Algorithm, for distribution of tasks among several nodes sharing the same computational object (CO) instances in Distributed Service Architectures. Simulations illustrate that the proposed algorithm produces better network performance than the benchmark load balancing algorithms-the Random Node Selection Algorithm and the Shortest Queue Algorithm, especially under medium and heavily loaded conditions.

An application of queuing theory to waterfowl migration

USGS Publications Warehouse

Sojda, Richard S.; Cornely, John E.; Fredrickson, Leigh H.; Rizzoli, A.E.; Jakeman, A.J.

2002-01-01

There has always been great interest in the migration of waterfowl and other birds. We have applied queuing theory to modelling waterfowl migration, beginning with a prototype system for the Rocky Mountain Population of trumpeter swans (Cygnus buccinator) in Western North America. The queuing model can be classified as a D/BB/28 system, and we describe the input sources, service mechanism, and network configuration of queues and servers. The intrinsic nature of queuing theory is to represent the spatial and temporal characteristics of entities and how they move, are placed in queues, and are serviced. The service mechanism in our system is an algorithm representing how swans move through the flyway based on seasonal life cycle events. The system uses an observed number of swans at each of 27 areas for a breeding season as input and simulates their distribution through four seasonal steps. The result is a simulated distribution of birds for the subsequent year's breeding season. The model was built as a multiagent system with one agent handling movement algorithms, with one facilitating user interface, and with one to seven agents representing specific geographic areas for which swan management interventions can be implemented. The many parallels in queuing model servers and service mechanisms with waterfowl management areas and annual life cycle events made the transfer of the theory to practical application straightforward.

Modeling Human Supervisory Control in Heterogeneous Unmanned Vehicle Systems

DTIC Science & Technology

2009-02-01

events through a queue, nominally due to another queue having reached its capacity limitation (Balsamo, Persone, & Onvural, 2001; Onvural, 1990; Perros ...Communication and Coordination, Athens, Greece. Perros , H. G. (1984). Queuing Networks with Blocking: A Bibliography. ACM Sigmetrics, Performance Evaluation

Vehicular headways on signalized intersections: theory, models, and reality

NASA Astrophysics Data System (ADS)

Krbálek, Milan; Šleis, Jiří

2015-01-01

We discuss statistical properties of vehicular headways measured on signalized crossroads. On the basis of mathematical approaches, we formulate theoretical and empirically inspired criteria for the acceptability of theoretical headway distributions. Sequentially, the multifarious families of statistical distributions (commonly used to fit real-road headway statistics) are confronted with these criteria, and with original empirical time clearances gauged among neighboring vehicles leaving signal-controlled crossroads after a green signal appears. Using three different numerical schemes, we demonstrate that an arrangement of vehicles on an intersection is a consequence of the general stochastic nature of queueing systems, rather than a consequence of traffic rules, driver estimation processes, or decision-making procedures.

A new traffic control design method for large networks with signalized intersections

NASA Technical Reports Server (NTRS)

Leininger, G. G.; Colony, D. C.; Seldner, K.

1979-01-01

The paper presents a traffic control design technique for application to large traffic networks with signalized intersections. It is shown that the design method adopts a macroscopic viewpoint to establish a new traffic modelling procedure in which vehicle platoons are subdivided into main stream queues and turning queues. Optimization of the signal splits minimizes queue lengths in the steady state condition and improves traffic flow conditions, from the viewpoint of the traveling public. Finally, an application of the design method to a traffic network with thirty-three signalized intersections is used to demonstrate the effectiveness of the proposed technique.

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

NASA Technical Reports Server (NTRS)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.

Folding Proteins at 500 ns/hour with Work Queue.

PubMed

Abdul-Wahid, Badi'; Yu, Li; Rajan, Dinesh; Feng, Haoyun; Darve, Eric; Thain, Douglas; Izaguirre, Jesús A

2012-10-01

Molecular modeling is a field that traditionally has large computational costs. Until recently, most simulation techniques relied on long trajectories, which inherently have poor scalability. A new class of methods is proposed that requires only a large number of short calculations, and for which minimal communication between computer nodes is required. We considered one of the more accurate variants called Accelerated Weighted Ensemble Dynamics (AWE) and for which distributed computing can be made efficient. We implemented AWE using the Work Queue framework for task management and applied it to an all atom protein model (Fip35 WW domain). We can run with excellent scalability by simultaneously utilizing heterogeneous resources from multiple computing platforms such as clouds (Amazon EC2, Microsoft Azure), dedicated clusters, grids, on multiple architectures (CPU/GPU, 32/64bit), and in a dynamic environment in which processes are regularly added or removed from the pool. This has allowed us to achieve an aggregate sampling rate of over 500 ns/hour. As a comparison, a single process typically achieves 0.1 ns/hour.

Folding Proteins at 500 ns/hour with Work Queue

PubMed Central

Abdul-Wahid, Badi’; Yu, Li; Rajan, Dinesh; Feng, Haoyun; Darve, Eric; Thain, Douglas; Izaguirre, Jesús A.

2014-01-01

Molecular modeling is a field that traditionally has large computational costs. Until recently, most simulation techniques relied on long trajectories, which inherently have poor scalability. A new class of methods is proposed that requires only a large number of short calculations, and for which minimal communication between computer nodes is required. We considered one of the more accurate variants called Accelerated Weighted Ensemble Dynamics (AWE) and for which distributed computing can be made efficient. We implemented AWE using the Work Queue framework for task management and applied it to an all atom protein model (Fip35 WW domain). We can run with excellent scalability by simultaneously utilizing heterogeneous resources from multiple computing platforms such as clouds (Amazon EC2, Microsoft Azure), dedicated clusters, grids, on multiple architectures (CPU/GPU, 32/64bit), and in a dynamic environment in which processes are regularly added or removed from the pool. This has allowed us to achieve an aggregate sampling rate of over 500 ns/hour. As a comparison, a single process typically achieves 0.1 ns/hour. PMID:25540799

Optimal control of M/M/1 two-phase queueing system with state-dependent arrival rate, server breakdowns, delayed repair, and N-policy

NASA Astrophysics Data System (ADS)

Rao, Hanumantha; Kumar, Vasanta; Srinivasa Rao, T.; Srinivasa Kumar, B.

2018-04-01

In this paper, we examine a two-stage queueing system where the arrivals are Poisson with rate depends on the condition of the server to be specific: vacation, pre-service, operational or breakdown state. The service station is liable to breakdowns and deferral in repair because of non-accessibility of the repair facility. The service is in two basic stages, the first being bulk service to every one of the customers holding up on the line and the second stage is individual to each of them. The server works under N-policy. The server needs preliminary time (startup time) to begin batch service after a vacation period. Startup times, uninterrupted service times, the length of each vacation period, delay times and service times follows an exponential distribution. The closed form of expressions for the mean system size at different conditions of the server is determined. Numerical investigations are directed to concentrate the impact of the system parameters on the ideal limit N and the minimum base expected unit cost.

Technical report on prototype intelligent network flow optimization (INFLO) dynamic speed harmonization and queue warning.

DOT National Transportation Integrated Search

2015-06-01

This Technical Report on Prototype Intelligent Network Flow Optimization (INFLO) Dynamic Speed Harmonization and Queue Warning is the final report for the project. It describes the prototyping, acceptance testing and small-scale demonstration of the ...

Research into Queueing Network Theory.

DTIC Science & Technology

1977-09-01

and Zeigler, B. (1975) "Equilibrium properties of arbitrarily interconnected queueing netowrks ," Tech. Report 75-4, Computer and Communication...Associate. The project was extremely fortunate to secure the services of Dr. Wendel. Dr. Wendel was a project member for one month in the summer of

Identifying effects and applications of fixed and variable speed limits.

DOT National Transportation Integrated Search

2016-08-01

In Indiana, distracted driving and unexpected queues have led to an increase in the amount of back-of-queue crashes, particularly on approach to : work zones. This report presents new strategies for the assessment of both transportation safety and tr...

Real-time prediction of queues at signalized intersections to support eco-driving applications.

DOT National Transportation Integrated Search

2014-10-01

The overall objective of this research is to develop models for predicting queue lengths at signalized intersections based on : the data from probe vehicles. The time and space coordinates of the probe vehicles going through signalized intersections ...

Impacts assessment of dynamic speed harmonization with queue warning : task 3, impacts assessment report.

DOT National Transportation Integrated Search

2015-06-01

This report assesses the impacts of a prototype of Dynamic Speed Harmonization (SPD-HARM) with Queue Warning (Q-WARN), which are two component applications of the Intelligent Network Flow Optimization (INFLO) bundle. The assessment is based on an ext...

Exclusive queueing model including the choice of service windows

NASA Astrophysics Data System (ADS)

Tanaka, Masahiro; Yanagisawa, Daichi; Nishinari, Katsuhiro

2018-01-01

In a queueing system involving multiple service windows, choice behavior is a significant concern. This paper incorporates the choice of service windows into a queueing model with a floor represented by discrete cells. We contrived a logit-based choice algorithm for agents considering the numbers of agents and the distances to all service windows. Simulations were conducted with various parameters of agent choice preference for these two elements and for different floor configurations, including the floor length and the number of service windows. We investigated the model from the viewpoint of transit times and entrance block rates. The influences of the parameters on these factors were surveyed in detail and we determined that there are optimum floor lengths that minimize the transit times. In addition, we observed that the transit times were determined almost entirely by the entrance block rates. The results of the presented model are relevant to understanding queueing systems including the choice of service windows and can be employed to optimize facility design and floor management.

An energy-efficient MAC protocol using dynamic queue management for delay-tolerant mobile sensor networks.

PubMed

Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

2011-01-01

Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

An Energy-Efficient MAC Protocol Using Dynamic Queue Management for Delay-Tolerant Mobile Sensor Networks

PubMed Central

Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

2011-01-01

Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay. PMID:22319385

Reducing queues: demand and capacity variations.

PubMed

Eriksson, Henrik; Bergbrant, Ing-Marie; Berrum, Ingela; Mörck, Boel

2011-01-01

The aim of this paper is to investigate how waiting lists or queues could be reduced without adding more resources; and to describe what factors sustain reduced waiting-times. Cases were selected according to successful and sustained queue reduction. The approach in this study is action research. Accessibility improved as out-patient waiting lists for two clinics were reduced. The main success was working towards matching demand and capacity. It has been possible to sustain the improvements. Results should be viewed cautiously. Transferring and generalizing outcomes from this study is for readers to consider. However, accessible healthcare may be possible by paying more attention to existing solutions. The study indicates that queue reduction activities should include acquiring knowledge about theories and methods to improve accessibility, finding ways to monitor varying demand and capacity, and to improve patient processing by reducing variations. Accessibility is considered an important dimension when measuring service quality. However, there are few articles on how clinic staff sustain reduces waiting lists. This paper contributes accessible knowledge to the field.

Rationale choosing interval of a piecewise-constant approximation of input rate of non-stationary queue system

NASA Astrophysics Data System (ADS)

Korelin, Ivan A.; Porshnev, Sergey V.

2018-01-01

The paper demonstrates the possibility of calculating the characteristics of the flow of visitors to objects carrying out mass events passing through checkpoints. The mathematical model is based on the non-stationary queuing system (NQS) where dependence of requests input rate from time is described by the function. This function was chosen in such way that its properties were similar to the real dependencies of speed of visitors arrival on football matches to the stadium. A piecewise-constant approximation of the function is used when statistical modeling of NQS performing. Authors calculated the dependencies of the queue length and waiting time for visitors to service (time in queue) on time for different laws. Time required to service the entire queue and the number of visitors entering the stadium at the beginning of the match were calculated too. We found the dependence for macroscopic quantitative characteristics of NQS from the number of averaging sections of the input rate.

Queue and stack sorting algorithm optimization and performance analysis

NASA Astrophysics Data System (ADS)

Qian, Mingzhu; Wang, Xiaobao

2018-04-01

Sorting algorithm is one of the basic operation of a variety of software development, in data structures course specializes in all kinds of sort algorithm. The performance of the sorting algorithm is directly related to the efficiency of the software. A lot of excellent scientific research queue is constantly optimizing algorithm, algorithm efficiency better as far as possible, the author here further research queue combined with stacks of sorting algorithms, the algorithm is mainly used for alternating operation queue and stack storage properties, Thus avoiding the need for a large number of exchange or mobile operations in the traditional sort. Before the existing basis to continue research, improvement and optimization, the focus on the optimization of the time complexity of the proposed optimization and improvement, The experimental results show that the improved effectively, at the same time and the time complexity and space complexity of the algorithm, the stability study corresponding research. The improvement and optimization algorithm, improves the practicability.

Accelerating list management for MPI.

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

Hemmert, K. Scott; Rodrigues, Arun F.; Underwood, Keith Douglas

2005-07-01

The latency and throughput of MPI messages are critically important to a range of parallel scientific applications. In many modern networks, both of these performance characteristics are largely driven by the performance of a processor on the network interface. Because of the semantics of MPI, this embedded processor is forced to traverse a linked list of posted receives each time a message is received. As this list grows long, the latency of message reception grows and the throughput of MPI messages decreases. This paper presents a novel hardware feature to handle list management functions on a network interface. By movingmore » functions such as list insertion, list traversal, and list deletion to the hardware unit, latencies are decreased by up to 20% in the zero length queue case with dramatic improvements in the presence of long queues. Similarly, the throughput is increased by up to 10% in the zero length queue case and by nearly 100% in the presence queues of 30 messages.« less

Characteristics of the Unexpected Message Queue of MPI applications

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

Keller, Rainer; Graham, Richard L

2010-01-01

High Performance Computing systems are used on a regular basis to run a myriad of application codes, yet a surprising dearth of information exists with respect to communications characteristics. Even less information is available on the low-level communication libraries, such as the length of MPI Unexpected Message Queues (UMQs) and the length of time such messages spend in these queues. Such information is vital to developing appropriate strategies for handling such data at the library and system level. In this paper we present data on the communication characteristics of three applications GTC, LSMS, and S3D. We present data on themore » size of their UMQ, the time spend searching the UMQ and the length of time such messages spend in these queues. We find that for the particular inputs used, these applications have widely varying characteristics with regard to UMQ length and show patterns for specific applications which persist over various scales.« less

Fast simulation of packet loss rates in a shared buffer communications switch

NASA Technical Reports Server (NTRS)

Chang, Cheng-Shang; Heidelberger, Philip; Shahabuddin, Perwez

1993-01-01

This paper describes an efficient technique for estimating, via simulation, the probability of buffer overflows in a queueing model that arises in the analysis of ATM (Asynchronous Transfer Mode) communication switches. There are multiple streams of (autocorrelated) traffic feeding the switch that has a buffer of finite capacity. Each stream is designated as either being of high or low priority. When the queue length reaches a certain threshold, only high priority packets are admitted to the switch's buffer. The problem is to estimate the loss rate of high priority packets. An asymptotically optimal importance sampling approach is developed for this rare event simulation problem. In this approach, the importance sampling is done in two distinct phases. In the first phase, an importance sampling change of measure is used to bring the queue length up to the threshold at which low priority packets get rejected. In the second phase, a different importance sampling change of measure is used to move the queue length from the threshold to the buffer capacity.

Application of queuing theory to patient satisfaction at a tertiary hospital in Nigeria

PubMed Central

Ameh, Nkeiruka; Sabo, B.; Oyefabi, M. O.

2013-01-01

Background: Queuing theory is the mathematical approach to the analysis of waiting lines in any setting where arrival rate of subjects is faster than the system can handle. It is applicable to healthcare settings where the systems have excess capacity to accommodate random variations. Materials and Methods: A cross-sectional descriptive survey was done. Questionnaires were administered to patients who attended the general outpatient department. Observations were also made on the queuing model and the service discipline at the clinic. Questions were meant to obtain demographic characteristics and the time spent on the queue by patients before being seen by a doctor, time spent with the doctor, their views about the time spent on the queue and useful suggestions on how to reduce the time spent on the queue. A total of 210 patients were surveyed. Results: Majority of the patients (164, 78.1%) spent 2 h or less on the queue before being seen by a doctor and less than 1 h to see the doctor. Majority of the patients (144, 68.5%) were satisfied with the time they spent on the queue before being seen by a doctor. Useful suggestions proffered by the patients to decrease the time spent on the queue before seeing a doctor at the clinic included: that more doctors be employed (46, 21.9%), that doctors should come to work on time (25, 11.9%), that first-come-first served be observed strictly (32, 15.2%) and others suggested that the records staff should desist from collecting bribes from patients in order to place their cards before others. The queuing method employed at the clinic is the multiple single channel type and the service discipline is priority service. The patients who spent less time on the queue (<1 h) before seeing the doctor were more satisfied than those who spent more time (P < 0.05). Conclusion: The study has revealed that majority of the patients were satisfied with the practice at the general outpatient department. However, there is a need to employ measures to respond to the suggestions given by the patients who are the beneficiaries of the hospital services. PMID:23661902

Operator-Geometric Stationary Distributions for Markov Chains, with Application to Queueing Models.

DTIC Science & Technology

1980-12-01

2.22) with equality. The quantity R-1 is the natural analogue of the Perron - Frobenius eigenvalue for finite matrices, with Q the corresponding...ensure that S is irreducible, using Perron - Frobenius theory: see [8], pp. 187-188. I- -14 - §3 Neuts’ "mean-drift" condition In Theorems 2 and 3 of [8...where E is finite, \\ is guaranteed to exist from Perron - Frobenius theory, and the proof that (3.1) is equivalent to the existence of a stationary

Design and Analysis of Scheduling Policies for Real-Time Computer Systems

DTIC Science & Technology

1992-01-01

C. M. Krishna, "The Impact of Workload on the Reliability of Real-Time Processor Triads," to appear in Micro . Rel. [17] J.F. Kurose, "Performance... Processor Triads", to appear in Micro . Rel. "* J.F. Kurose. "Performance Analysis of Minimum Laxity Scheduling in Discrete Time Queue- ing Systems", to...exponentially distributed service times and deadlines. A similar model was developed for the ED policy for a single processor system under identical

Performance Evaluation of Distributed Systems with Unbalanced Flows: An Analysis of the INFOPLEX Data Storage Hierarchy.

DTIC Science & Technology

1984-07-01

34. - . . ’-... " " " ". ’ UNCLASSIFIED SECURITY CLASSIFICATION OF T0IS PAGE (lhen Det £ntered) REPORT DOCUMENTATION PAGE READ INSTRUCTIONS...RUMERODF PAGES 267 14 MONITORING AGENCY NAME & ADDRESS(II dillerent from Controllind Office) IS. SECURITY CLASS. (o this report) UNCLASSIFIED ISa...lower storage level. This is the basis for the mapping of the PIL3 read operation and workloads into a queueing netowrk model. S PAGE 135 REFERENCE

An Application of the H-Function to Curve-Fitting and Density Estimation.

DTIC Science & Technology

1983-12-01

equations into a model that is linear in its coefficients. Nonlinear least squares estimation is a relatively new area developed to accomodate models which...to converge on a solution (10:9-10). For the simple linear model and when general assump- tions are made, the Gauss-Markov theorem states that the...distribution. For example, if the analyst wants to model the time between arrivals to a queue for a computer simulation, he infers the true probability

Multi-Resource Fair Queueing for Packet Processing

DTIC Science & Technology

2012-06-19

Huawei , Intel, MarkLogic, Microsoft, NetApp, Oracle, Quanta, Splunk, VMware and by DARPA (contract #FA8650-11-C-7136). Multi-Resource Fair Queueing for...Google PhD Fellowship, gifts from Amazon Web Services, Google, SAP, Blue Goji, Cisco, Cloud- era, Ericsson, General Electric, Hewlett Packard, Huawei

32 CFR 299.5 - Procedures.

Code of Federal Regulations, 2011 CFR

2011-07-01

... PROGRAM NATIONAL SECURITY AGENCY/CENTRAL SECURITY SERVICE (NSA/CSS) FREEDOM OF INFORMATION ACT PROGRAM.../CSS by other government agencies shall be placed in the processing queue according to the date the... placed in the queue according to the date of the requester's letter. (d) The FOIA office shall maintain...

Specification and Verification of Communication Protocols in AFFIRM Using State Transition Models.

DTIC Science & Technology

1981-03-01

NewQueueOfftcket; theorem Pendnglnvariant, Remove(Pending(s)) = NewQueueOfPacket; Since the implementation is in keeping with the specification, its salp ...another communication line. The communication lines are unreliable; messages traveling in either direction can be lost, reordered, corrupted, or

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.

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

Moving toward queue operations at the Large Binocular Telescope Observatory

NASA Astrophysics Data System (ADS)

Edwards, Michelle L.; Summers, Doug; Astier, Joseph; Suarez Sola, Igor; Veillet, Christian; Power, Jennifer; Cardwell, Andrew; Walsh, Shane

2016-07-01

The Large Binocular Telescope Observatory (LBTO), a joint scientific venture between the Instituto Nazionale di Astrofisica (INAF), LBT Beteiligungsgesellschaft (LBTB), University of Arizona, Ohio State University (OSU), and the Research Corporation, is one of the newest additions to the world's collection of large optical/infrared ground-based telescopes. With its unique, twin 8.4m mirror design providing a 22.8 meter interferometric baseline and the collecting area of an 11.8m telescope, LBT has a window of opportunity to exploit its singular status as the "first" of the next generation of Extremely Large Telescopes (ELTs). Prompted by urgency to maximize scientific output during this favorable interval, LBTO recently re-evaluated its operations model and developed a new strategy that augments classical observing with queue. Aided by trained observatory staff, queue mode will allow for flexible, multi-instrument observing responsive to site conditions. Our plan is to implement a staged rollout that will provide many of the benefits of queue observing sooner rather than later - with more bells and whistles coming in future stages. In this paper, we outline LBTO's new scientific model, focusing specifically on our "lean" resourcing and development, reuse and adaptation of existing software, challenges presented from our one-of-a-kind binocular operations, and lessons learned. We also outline further stages of development and our ultimate goals for queue.

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

Modeling Precheck Parallel Screening Process in the Face of Strategic Applicants with Incomplete Information and Screening Errors.

PubMed

Song, Cen; Zhuang, Jun

2018-01-01

In security check systems, tighter screening processes increase the security level, but also cause more congestion, which could cause longer wait times. Having to deal with more congestion in lines could also cause issues for the screeners. The Transportation Security Administration (TSA) Precheck Program was introduced to create fast lanes in airports with the goal of expediting passengers who the TSA does not deem to be threats. In this lane, the TSA allows passengers to enjoy fewer restrictions in order to speed up the screening time. Motivated by the TSA Precheck Program, we study parallel queueing imperfect screening systems, where the potential normal and adversary participants/applicants decide whether to apply to the Precheck Program or not. The approved participants would be assigned to a faster screening channel based on a screening policy determined by an approver, who balances the concerns of safety of the passengers and congestion of the lines. There exist three types of optimal normal applicant's application strategy, which depend on whether the marginal payoff is negative or positive, or whether the marginal benefit equals the marginal cost. An adversary applicant would not apply when the screening policy is sufficiently large or the number of utilized benefits is sufficiently small. The basic model is extended by considering (1) applicants' parameters to follow different distributions and (2) applicants to have risk levels, where the approver determines the threshold value needed to qualify for Precheck. This article integrates game theory and queueing theory to study the optimal screening policy and provides some insights to imperfect parallel queueing screening systems. © 2017 Society for Risk Analysis.

Impacts Assessment of Dynamic Speed Harmonization with Queue Warning : Task 3, Impacts Assessment Report. [supporting datasets

DOT National Transportation Integrated Search

2015-05-31

The datasets in the .pdf and .zip attached to this record are in support of Intelligent Transportation Systems Joint Program Office (ITS JPO) report FHWA-JPO-15-222, "Impacts Assessment of Dynamic Speed Harmonization with Queue Warning : Task 3, Impa...

Routing in Networks with Random Topologies

NASA Technical Reports Server (NTRS)

Bambos, Nicholas

1997-01-01

We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

LiveWire interactive boundary extraction algorithm based on Haar wavelet transform and control point set direction search

NASA Astrophysics Data System (ADS)

Cheng, Jun; Zhang, Jun; Tian, Jinwen

2015-12-01

Based on deep analysis of the LiveWire interactive boundary extraction algorithm, a new algorithm focusing on improving the speed of LiveWire algorithm is proposed in this paper. Firstly, the Haar wavelet transform is carried on the input image, and the boundary is extracted on the low resolution image obtained by the wavelet transform of the input image. Secondly, calculating LiveWire shortest path is based on the control point set direction search by utilizing the spatial relationship between the two control points users provide in real time. Thirdly, the search order of the adjacent points of the starting node is set in advance. An ordinary queue instead of a priority queue is taken as the storage pool of the points when optimizing their shortest path value, thus reducing the complexity of the algorithm from O[n2] to O[n]. Finally, A region iterative backward projection method based on neighborhood pixel polling has been used to convert dual-pixel boundary of the reconstructed image to single-pixel boundary after Haar wavelet inverse transform. The algorithm proposed in this paper combines the advantage of the Haar wavelet transform and the advantage of the optimal path searching method based on control point set direction search. The former has fast speed of image decomposition and reconstruction and is more consistent with the texture features of the image and the latter can reduce the time complexity of the original algorithm. So that the algorithm can improve the speed in interactive boundary extraction as well as reflect the boundary information of the image more comprehensively. All methods mentioned above have a big role in improving the execution efficiency and the robustness of the algorithm.

The effect of model uncertainty on some optimal routing problems

NASA Technical Reports Server (NTRS)

Mohanty, Bibhu; Cassandras, Christos G.

1991-01-01

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Job Queues, Certification Status, and the Education Labor Market

ERIC Educational Resources Information Center

Evans, Lorraine

2011-01-01

This research explores the interaction between training programs and certification status in one education labor market to examine the micro-level interactions that shape the recruitment process. Using job queue theory, it is found that the information available to novice teachers operates to stratify and shape their worksite choices in addition…

Generic Fortran Containers (GFC)

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

Liakh, Dmitry

2016-09-01

The Fortran language does not provide a standard library that implements generic containers, like linked lists, trees, dictionaries, etc. The GFC software provides an implementation of generic Fortran containers natively written in Fortran 2003/2008 language. The following containers are either already implemented or planned: Stack (done), Linked list (done), Tree (done), Dictionary (done), Queue (planned), Priority queue (planned).

Announcements | High-Performance Computing | NREL

Science.gov Websites

12th from 12 - 3 PM. Continue reading Data Transfer Queue March 08, 2018 A new queue "data , scratch) and MSS. Continue reading Purge-Alert January 11, 2018 We now have a notification method that . Continue reading Please Move Inactive Files Off the /projects File System January 11, 2018 The /projects

Active Methodologies in a Queueing Systems Course for Telecommunication Engineering Studies

ERIC Educational Resources Information Center

Garcia, J.; Hernandez, A.

2010-01-01

This paper presents the results of a one-year experiment in incorporating active methodologies in a Queueing Systems course as part of the Telecommunication Engineering degree at the University of Zaragoza, Spain, during the period of adaptation to the European Higher Education Area. A problem-based learning methodology has been introduced, and…

Techniques for Increasing the Efficiency of Automation Systems in School Library Media Centers.

ERIC Educational Resources Information Center

Caffarella, Edward P.

1996-01-01

Discusses methods of managing queues (waiting lines) to optimize the use of student computer stations in school library media centers and to make searches more efficient and effective. The three major factors in queue management are arrival interval of the patrons, service time, and number of stations. (Author/LRW)

Performance modeling of automated manufacturing systems

NASA Astrophysics Data System (ADS)

Viswanadham, N.; Narahari, Y.

A unified and systematic treatment is presented of modeling methodologies and analysis techniques for performance evaluation of automated manufacturing systems. The book is the first treatment of the mathematical modeling of manufacturing systems. Automated manufacturing systems are surveyed and three principal analytical modeling paradigms are discussed: Markov chains, queues and queueing networks, and Petri nets.

Military Standard Common APSE (Ada Programming Support Environment) Interface Set (CAIS).

DTIC Science & Technology

1985-01-01

QUEUEASE. LAST-KEY (QUEENAME) . LASTREI.TIONI(QUEUE-NAME). FILE-NODE. PORN . ATTRIBUTTES. ACCESSCONTROL. LEVEL); CLOSE (QUEUE BASE); CLOSE(FILE NODE...PROPOSED XIIT-STD-C.4 31 J NNUAfY logs procedure zTERT (ITERATOR: out NODE ITERATON; MAMIE: NAME STRING.KIND: NODE KID : KEY : RELATIONSHIP KEY PA1TTE1 :R

78 FR 20164 - Self-Regulatory Organizations; NYSE Arca, Inc.; Response to Comments Submitted After the Issuance...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-03

... data, views, and arguments concerning the Approval Order, including whether Amendment No. 1 to the... commenter discussed the existing unloading queues for metals, including copper, at LME warehouses.\\18\\ The commenter asserted that queues to unload copper from LME warehouses appear to be lengthening because owners...

Entrainment of a Bacterial Synthetic Gene Oscillator through Proteolytic Queueing.

PubMed

Butzin, Nicholas C; Hochendoner, Philip; Ogle, Curtis T; Mather, William H

2017-03-17

Internal chemical oscillators (chemical clocks) direct the behavior of numerous biological systems, and maintenance of a given period and phase among many such oscillators may be important for their proper function. However, both environmental variability and fundamental molecular noise can cause biochemical oscillators to lose coherence. One solution to maintaining coherence is entrainment, where an external signal provides a cue that resets the phase of the oscillators. In this work, we study the entrainment of gene networks by a queueing interaction established by competition between proteins for a common proteolytic pathway. Principles of queueing entrainment are investigated for an established synthetic oscillator in Escherichia coli. We first explore this theoretically using a standard chemical reaction network model and a map-based model, both of which suggest that queueing entrainment can be achieved through pulsatile production of an additional protein competing for a common degradation pathway with the oscillator proteins. We then use a combination of microfluidics and fluorescence microscopy to verify that pulse trains modulating the production rate of a fluorescent protein targeted to the same protease (ClpXP) as the synthetic oscillator can entrain the oscillator.

Exploiting geo-distributed clouds for a e-health monitoring system with minimum service delay and privacy preservation.

PubMed

Shen, Qinghua; Liang, Xiaohui; Shen, Xuemin; Lin, Xiaodong; Luo, Henry Y

2014-03-01

In this paper, we propose an e-health monitoring system with minimum service delay and privacy preservation by exploiting geo-distributed clouds. In the system, the resource allocation scheme enables the distributed cloud servers to cooperatively assign the servers to the requested users under the load balance condition. Thus, the service delay for users is minimized. In addition, a traffic-shaping algorithm is proposed. The traffic-shaping algorithm converts the user health data traffic to the nonhealth data traffic such that the capability of traffic analysis attacks is largely reduced. Through the numerical analysis, we show the efficiency of the proposed traffic-shaping algorithm in terms of service delay and privacy preservation. Furthermore, through the simulations, we demonstrate that the proposed resource allocation scheme significantly reduces the service delay compared to two other alternatives using jointly the short queue and distributed control law.

Process modeling of emergency department patient flow: effect of patient length of stay on ED diversion.

PubMed

Kolker, Alexander

2008-10-01

A discreet event simulation methodology has been used to establish a quantitative relationship between Emergency Department (ED) performance characteristics, such as percent of time on ambulance diversion and the number of patients in queue in the waiting room, and the upper limits of patient length of stay (LOS). A simulation process model of ED patient flow has been developed that took into account a significant difference between LOS distributions of patients discharged home and patients admitted into the hospital. Using simulation model it has been identified that ED diversion could be negligible (less than approximately 0.5%) if patients discharged home stay in ED not more than 5 h, and patients admitted into the hospital stay in ED not more than 6 h Using full factorial design of experiments with two factors and the model's predicted percent diversion as a response function, other combinations of LOS upper limits have been determined that would result in low ED percent diversion as well. It has also been determined that if the number of patients exceeds 11 in queue in ED waiting room then the diversion percent is rapidly increasing.

Distributed Continuous Event-Based Data Acquisition Using the IEEE 1588 Synchronization and FlexRIO FPGA

NASA Astrophysics Data System (ADS)

Taliercio, C.; Luchetta, A.; Manduchi, G.; Rigoni, A.

2017-07-01

High-speed event driven acquisition is normally performed by analog-to-digital converter (ADC) boards with a given number of pretrigger sample and posttrigger sample that are recorded upon the occurrence of a hardware trigger. A direct physical connection is, therefore, required between the source of event (trigger) and the ADC, because any other software-based communication method would introduce a delay in triggering that would turn out to be not acceptable in many cases. This paper proposes a solution for the relaxation of the event communication time that can be, in this case, carried out by software messaging (e.g., via an LAN), provided that the system components are synchronized in time using the IEEE 1588 synchronization mechanism. The information about the exact event occurrence time is contained in the software packet that is sent to communicate the event and is used by the ADC FPGA to identify the exact sample in the ADC sample queue. The length of the ADC sample queue will depend on the maximum delay in software event message communication time. A prototype implementation using a National FlexRIO FPGA board connected with an ADC device is presented as the proof of concept.

File Transfers from Peregrine to the Mass Storage System - Gyrfalcon |

Science.gov Websites

login node or data-transfer queue node. Below is an example to access data-tranfer queue Interactively number of container files using the tar command. For example, $ cd /scratch//directory1 tar files. The rsync command is convenient for handling a large number of files. For example, make

An Empirical Study of the Career Paths of Senior Educational Administrators in Manitoba, Canada: Implications for Career Development

ERIC Educational Resources Information Center

Wallin, Dawn C.

2012-01-01

This paper conceptualizes queue theory (Tallerico & Blount, 2004) to discuss a mixed-methods study that determined the career patterns of senior educational administrators in public school divisions in Manitoba, Canada, compared by position, context and sex. Findings indicate that queue theory has merit for describing the career paths of…

Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-based Active Queue Management

DTIC Science & Technology

2007-06-01

behavior is growing in the Internet. These non-responsive sources can monopolize network bandwidth and starve the “congestion friendly” flows. Without...unnecessarily complex because most of the flows in the Internet are short flows usually termed as “web mice ” [7]. Moreover, having a separate queue for each

Self-organization of critical behavior in controlled general queueing models

NASA Astrophysics Data System (ADS)

Blanchard, Ph.; Hongler, M.-O.

2004-03-01

We consider general queueing models of the (G/G/1) type with service times controlled by the busy period. For feedback control mechanisms driving the system to very high traffic load, it is shown the busy period probability density exhibits a generic - {3}/{2} power law which is a typical mean field behavior of SOC models.

Nursing home queues and home health users.

PubMed

Swan, J H; Benjamin, A E

1993-01-01

Home health market growth suggests the need for models explaining home health utilization. We have previously explained state-level Medicare home health visits with reference to nursing home markets. Here we introduce a model whereby state-level Medicare home health use is a function of nursing home queues and other demand and supply factors. Medicare home health users per state population is negatively related to nursing home bed stock, positively to Medicaid eligibility levels and to Medicaid nursing home recipients per population, as well as to various other demand and supply measures. This explanation of home health users explains previously-reported findings for home health visits. The findings support the argument that home health use is explained by factors affecting lengths of nursing home queues.

Improved diagonal queue medical image steganography using Chaos theory, LFSR, and Rabin cryptosystem.

PubMed

Jain, Mamta; Kumar, Anil; Choudhary, Rishabh Charan

2017-06-01

In this article, we have proposed an improved diagonal queue medical image steganography for patient secret medical data transmission using chaotic standard map, linear feedback shift register, and Rabin cryptosystem, for improvement of previous technique (Jain and Lenka in Springer Brain Inform 3:39-51, 2016). The proposed algorithm comprises four stages, generation of pseudo-random sequences (pseudo-random sequences are generated by linear feedback shift register and standard chaotic map), permutation and XORing using pseudo-random sequences, encryption using Rabin cryptosystem, and steganography using the improved diagonal queues. Security analysis has been carried out. Performance analysis is observed using MSE, PSNR, maximum embedding capacity, as well as by histogram analysis between various Brain disease stego and cover images.

Lightweight active router-queue management for multimedia networking

NASA Astrophysics Data System (ADS)

Parris, Mark; Jeffay, Kevin; Smith, F. D.

1998-12-01

The Internet research community is promoting active queue management in routers as a proactive means of addressing congestion in the Internet. Active queue management mechanisms such as Random Early Detection (RED) work well for TCP flows but can fail in the presence of unresponsive UDP flows. Recent proposals extend RED to strongly favor TCP and TCP-like flows and to actively penalize `misbehaving' flows. This is problematic for multimedia flows that, although potentially well-behaved, do not, or can not, satisfy the definition of a TCP-like flow. In this paper we investigate an extension to RED active queue management called Class-Based Thresholds (CBT). The goal of CBT is to reduce congestion in routers and to protect TCP from all UDP flows while also ensuring acceptable throughput and latency for well-behaved UDP flows. CBT attempts to realize a `better than best effort' service for well-behaved multimedia flows that is comparable to that achieved by a packet or link scheduling discipline, however, CBT does this by queue management rather than by scheduling. We present results of experiments comparing our mechanisms to plain RED and to FRED, a variant of RED designed to ensure fair allocation of bandwidth amongst flows. We also compare CBT to a packet scheduling scheme. The experiments show that CBT (1) realizes protection for TCP, and (2) provides throughput and end-to-end latency for tagged UDP flows, that is better than that under FRED and RED and comparable to that achieved by packet scheduling. Moreover CBT is a lighter-weight mechanism than FRED in terms of its state requirements and implementation complexity.

Solving the negative impact of congestion in the postanesthesia care unit: a cost of opportunity analysis.

PubMed

Ruiz-Patiño, Alejandro; Acosta-Ospina, Laura Elena; Rueda, Juan-David

2017-04-01

Congestion in the postanesthesia care unit (PACU) leads to the formation of waiting queues for patients being transferred after surgery, negatively affecting hospital resources. As patients recover in the operating room, incoming surgeries are delayed. The purpose of this study was to establish the impact of this phenomenon in multiple settings. An operational mathematical study based on the queuing theory was performed. Average queue length, average queue waiting time, and daily queue waiting time were evaluated. Calculations were based on the mean patient daily flow, PACU length of stay, occupation, and current number of beds. Data was prospectively collected during a period of 2 months, and the entry and exit time was recorded for each patient taken to the PACU. Data was imputed in a computational model made with MS Excel. To account for data uncertainty, deterministic and probabilistic sensitivity analyses for all dependent variables were performed. With a mean patient daily flow of 40.3 and an average PACU length of stay of 4 hours, average total lost surgical opportunity time was estimated at 2.36 hours (95% CI: 0.36-4.74 hours). Cost of opportunity was calculated at $1592 per lost hour. Sensitivity analysis showed that an increase of two beds is required to solve the queue formation. When congestion has a negative impact on cost of opportunity in the surgical setting, queuing analysis grants definitive actions to solve the problem, improving quality of service and resource utilization. Copyright © 2016 Elsevier Inc. All rights reserved.

Intel Parallel Studio on the Peregrine System | High-Performance Computing

Science.gov Websites

given below: #!/bin/bash --login #PBS -N #PBS -q #PBS -l nodes=<N> ;:ppn=<n> #PBS -l walltime=00:30:00 #PBS -A # set your tmpdir, and don't collect MPI communication data: #!/bin/bash --login #PBS -N #PBS -q #PBS -l

A queueing network model to analyze the impact of parallelization of care on patient cycle time.

PubMed

Jiang, Lixiang; Giachetti, Ronald E

2008-09-01

The total time a patient spends in an outpatient facility, called the patient cycle time, is a major contributor to overall patient satisfaction. A frequently recommended strategy to reduce the total time is to perform some activities in parallel thereby shortening patient cycle time. To analyze patient cycle time this paper extends and improves upon existing multi-class open queueing network model (MOQN) so that the patient flow in an urgent care center can be modeled. Results of the model are analyzed using data from an urgent care center contemplating greater parallelization of patient care activities. The results indicate that parallelization can reduce the cycle time for those patient classes which require more than one diagnostic and/ or treatment intervention. However, for many patient classes there would be little if any improvement, indicating the importance of tools to analyze business process reengineering rules. The paper makes contributions by implementing an approximation for fork/join queues in the network and by improving the approximation for multiple server queues in both low traffic and high traffic conditions. We demonstrate the accuracy of the MOQN results through comparisons to simulation results.

Queueing models for token and slotted ring networks. Thesis

NASA Technical Reports Server (NTRS)

Peden, Jeffery H.

1990-01-01

Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

LLNL Genomic Assessment: Viral and Bacterial Sequencing Needs for TMTI, Tier 1 Report

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

Slezak, T; Borucki, M; Lenhoff, R

2009-09-29

The Lawrence Livermore National Lab Bioinformatics group has recently taken on a role in DTRA's Transformation Medical Technologies Initiative (TMTI). The high-level goal of TMTI is to accelerate the development of broad-spectrum countermeasures. To achieve those goals, TMTI has a near term need to obtain more sequence information across a large range of pathogens, near neighbors, and across a broad geographical and host range. Our role in this project is to research available sequence data for the organisms of interest and identify critical microbial sequence and knowledge gaps that need to be filled to meet TMTI objectives. This effort includes:more » (1) assessing current genomic sequence for each agent including phylogenetic and geographical diversity, host range, date of isolation range, virulence, sequence availability of key near neighbors, and other characteristics; (2) identifying Subject Matter Experts (SME's) and potential holders of isolate collections, contacting appropriate SME's with known expertise and isolate collections to obtain information on isolate availability and specific recommendations; (3) identifying sequence as well as knowledge gaps (eg virulence, host range, and antibiotic resistance determinants); (4) providing specific recommendations as to the most valuable strains to be placed on the DTRA sequencing queue. We acknowledge that criteria for prioritization of isolates for sequencing falls into two categories aligning with priority queues 1 and 2 as described in the summary. (Priority queue 0 relates to DTRA operational isolates whose availability is not predictable in advance.) 1. Selection of isolates that appear to have likelihood to provide information on virulence and antibiotic resistance. This will include sequence of known virulent strains. Particularly valuable would be virulent strains that have genetically similar yet avirulent, or non human transmissible, counterparts that can be used for comparison to help identify key virulence or host range genes. This approach will provide information that can be used by structural biologists to help develop therapeutics and vaccines. We have pointed out such high priority strains of which we are aware, and note that if any such isolates should be discovered, they will rise to the top priority. We anticipate difficulty locating samples with unusual resistance phenotypes, in particular. Sequencing strategies for isolates in queue 1 should aim for as complete finishing status as possible, since high-quality initial annotation (gene-calling) will be necessary for the follow-on protein structure analyses contributing to countermeasure development. Queue 2 for sequencing determination will be more dynamic than queue 1, and samples will be added to it as they become available to the TMTI program. 2. Selection of isolates that will provide broader information about diversity and phylogenetics and aid in specific detection as well as forensics. This approach focuses on sequencing of isolates that will provide better resolution of variants that are (or were) circulating in nature. The finishing strategy for queue 2 does not require complete closing with annotation. This queue is more static, as there is considerable phylogenetic data, and in this report we have sought to reveal gaps and make suggestions to fill them given existing sequence data and strain information. In this report we identify current sequencing gaps in both priority queue categories. Note that this is most applicable to the bacterial pathogens, as most viruses are by default in queue 1. The Phase I focus of this project is on viral hemorrhagic fever viruses and Category A bacterial agents as defined to us by TMTI. We have carried out individual analyses on each species of interest, and these are included as chapters in this report. Viruses and bacteria are biologically very distinct from each other and require different methods of analysis and criteria for sequencing prioritization. Therefore, we will describe our methods, analyses and conclusions separately for each category.« less

Effective ergodicity breaking in an exclusion process with varying system length

NASA Astrophysics Data System (ADS)

Schultens, Christoph; Schadschneider, Andreas; Arita, Chikashi

2015-09-01

Stochastic processes of interacting particles in systems with varying length are relevant e.g. for several biological applications. We try to explore what kind of new physical effects one can expect in such systems. As an example, we extend the exclusive queueing process that can be viewed as a one-dimensional exclusion process with varying length, by introducing Langmuir kinetics. This process can be interpreted as an effective model for a queue that interacts with other queues by allowing incoming and leaving of customers in the bulk. We find surprising indications for breaking of ergodicity in a certain parameter regime, where the asymptotic growth behavior depends on the initial length. We show that a random walk with site-dependent hopping probabilities exhibits qualitatively the same behavior.

Queues and care: how medical residents organize their work in a busy clinic.

PubMed

Finlay, W; Mutran, E J; Zeitler, R R; Randall, C S

1990-09-01

How do medical residents organize their work in settings where queue demands are heavy and resources are limited? Under such conditions, a queue theory would predict the delivery of care that is indifferent to clients' needs or that gets rid of clients as quickly as possible. In an exploratory case study of medical residents in a Veterans Administration outpatient clinic, we found instead that the medical residents' work was characterized by a high level of professional commitment: they provided thorough medical examinations and attempted to expedite patient care in other ways. We attribute the residents' professional ethos to opportunities provided in the VA hospital to learn the craft of routine medicine and to be directly responsible for patient care; such opportunities were not available in other settings.

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.

Apparatus and method for fusion of compute and switching functions of exascale system into a single component by using configurable network-on-chip fabric with distributed dual mode input-output ports and programmable network interfaces

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

Khare, Surhud; Somasekhar, Dinesh; More, Ankit

Described is an apparatus which comprises: a Network-On-Chip fabric using crossbar switches, having distributed ingress and egress ports; and a dual-mode network interface coupled to at least one crossbar switch, the dual-mode network interface is to include: a dual-mode circuitry; a controller operable to: configure the dual-mode circuitry to transmit and receive differential signals via the egress and ingress ports, respectively, and configure the dual-mode circuitry to transmit and receive signal-ended signals via the egress and ingress ports, respectively.

Comparison of a Visual and Head Tactile Display for Soldier Navigation

DTIC Science & Technology

2013-12-01

environments for nuclear power plant operators, air traffic controllers, and pilots are information intensive. These environments usually involve the indirect...queue, correcting aircraft conflicts, giving instruction, clearance and advice to pilots , and assigning aircrafts to other work queues and airports...these dynamic, complex, and multitask environments (1) collect and integrate a plethora of visual information into decisions that are critical for

A queueing model of pilot decision making in a multi-task flight management situation

NASA Technical Reports Server (NTRS)

Walden, R. S.; Rouse, W. B.

1977-01-01

Allocation of decision making responsibility between pilot and computer is considered and a flight management task, designed for the study of pilot-computer interaction, is discussed. A queueing theory model of pilot decision making in this multi-task, control and monitoring situation is presented. An experimental investigation of pilot decision making and the resulting model parameters are discussed.

Optimizing Crisis Action Planning in the Noncombatant Evacuation Operation Setting

DTIC Science & Technology

2010-06-01

Federal Regulations, the DoS has a firm rule to not enter into preemptive contracts for any logistical resources (e.g., transportation, food, water...bottlenecks, flow limiters, and options to quicken queues ; and identifying resources and transportation mediums that display the most sensitivity to...policy changes. These objectives were addressed by exploring topics in NEOs, evacuation planning, queueing systems, and modeling techniques and

Data Interconnection Exploration

NASA Technical Reports Server (NTRS)

Iniguez, Alfredo Bravo

2011-01-01

This project involves innovating the way the Quality Assurance organization at the Jet Propulsion Laboratory (JPL) tracks the receiving inspection of JPL Critical Items (JCI) procured from suppliers. The Quality Assurance organization uses a Microsoft Access based front-end to enter items into an inspection queue. The current design has grown to be much more than was expected when the inspection queue system was created in 2007. The goal is to migrate to a web based solution that will allow the handling of more data, multiple input interfaces, and customizable display options. This has been achieved by implementing a divided tables scheme, the use of ColdFusion programming language, and the usage of Web 2.0 technologies such as AJAX and jQuery. These updates will allow for future expansion as well as the standardization of inspection queues for the Quality Assurance organization. When engineers and scientists order flight hardware, they cannot use it straight away. After a spacecraft or a satellite has been launched, it will be impossible to repair; therefore, the parts used must be inspected to make sure they are operating correctly and within the required specifications. The task of inspecting these JPL Critical Items (JCI) falls on the Quality Assurance organization. One of the tools the receiving inspection group uses is a database to maintain a queue of inspections that need to be done and of inspections that have been completed. The current Access interface has worked well but increased amounts of data, multiple input interfaces, and changes to how data is handled have made it necessary to seek a new way of organizing items for inspection. In addition, the different inspection groups have recently been merged and each has different ways of keeping track of inspection information. The ultimate goal is for the new group to have one shared inspection queue and website. To achieve this goal, I have been working with Ian Luczon of Procurement Quality Assurance and 3 Myers Hawkins, another intern, to not only create the new queue for receiving inspection but also a central web portal for the newly combined inspection group.

Queue position in the endoscopic schedule impacts effectiveness of colonoscopy.

PubMed

Lee, Alexander; Iskander, John M; Gupta, Nitin; Borg, Brian B; Zuckerman, Gary; Banerjee, Bhaskar; Gyawali, C Prakash

2011-08-01

Endoscopist fatigue potentially impacts colonoscopy. Fatigue is difficult to quantitate, but polyp detection rates between non-fatigued and fatigued time periods could represent a surrogate marker. We assessed whether timing variables impacted polyp detection rates at a busy tertiary care endoscopy suite. Consecutive patients undergoing colonoscopy were retrospectively identified. Indications, clinical demographics, pre-procedural, and procedural variables were extracted from chart review; colonoscopy findings were determined from the procedure reports. Three separate timing variables were assessed as surrogate markers for endoscopist fatigue: morning vs. afternoon procedures, start times throughout the day, and queue position, a unique variable that takes into account the number of procedures performed before the colonoscopy of interest. Univariate and multivariate analyses were performed to determine whether timing variables and other clinical, pre-procedural, and procedural variables predicted polyp detection. During the 4-month study period, 1,083 outpatient colonoscopy procedures (57.5±0.5 years, 59.5% female) were identified, performed by 28 endoscopists (mean 38.7 procedures/endoscopist), with a mean polyp detection rate of 0.851/colonoscopy. At least, one adenoma was detected in 297 procedures (27.4%). A 12.4% reduction in mean detected polyps was detected between morning and afternoon procedures (0.90±0.06 vs. 0.76±0.06, P=0.15). Using start time on a continuous scale, however, each elapsed hour in the day was associated with a 4.6% reduction in polyp detection (P=0.005). When queue position was assessed, a 5.4% reduction in polyp detection was noted with each increase in queue position (P=0.016). These results remained significant when controlled for each individual endoscopist. Polyp detection rates decline as time passes during an endoscopist's schedule, potentially from endoscopist fatigue. Queue position may be a novel surrogate measure for operator fatigue.

Applying a foil queue micro-electrode in micro-EDM to fabricate a 3D micro-structure

NASA Astrophysics Data System (ADS)

Xu, Bin; Guo, Kang; Wu, Xiao-yu; Lei, Jian-guo; Liang, Xiong; Guo, Deng-ji; Ma, Jiang; Cheng, Rong

2018-05-01

Applying a 3D micro-electrode in a micro electrical discharge machining (micro-EDM) can fabricate a 3D micro-structure with an up and down reciprocating method. However, this processing method has some shortcomings, such as a low success rate and a complex process for fabrication of 3D micro-electrodes. By focusing on these shortcomings, this paper proposed a novel 3D micro-EDM process based on the foil queue micro-electrode. Firstly, a 3D micro-electrode was discretized into several foil micro-electrodes and these foil micro-electrodes constituted a foil queue micro-electrode. Then, based on the planned process path, foil micro-electrodes were applied in micro-EDM sequentially and the micro-EDM results of each foil micro-electrode were able to superimpose the 3D micro-structure. However, the step effect will occur on the 3D micro-structure surface, which has an adverse effect on the 3D micro-structure. To tackle this problem, this paper proposes to reduce this adverse effect by rounded corner wear at the end of the foil micro-electrode and studies the impact of machining parameters on rounded corner wear and the step effect on the micro-structure surface. Finally, using a wire cutting voltage of 80 V, a current of 0.5 A and a pulse width modulation ratio of 1:4, the foil queue micro-electrode was fabricated by wire electrical discharge machining. Also, using a pulse width of 100 ns, a pulse interval of 200 ns, a voltage of 100 V and workpiece material of 304# stainless steel, the foil queue micro-electrode was applied in micro-EDM for processing of a 3D micro-structure with hemispherical features, which verified the feasibility of this process.

An architecture for real-time vision processing

NASA Technical Reports Server (NTRS)

Chien, Chiun-Hong

1994-01-01

To study the feasibility of developing an architecture for real time vision processing, a task queue server and parallel algorithms for two vision operations were designed and implemented on an i860-based Mercury Computing System 860VS array processor. The proposed architecture treats each vision function as a task or set of tasks which may be recursively divided into subtasks and processed by multiple processors coordinated by a task queue server accessible by all processors. Each idle processor subsequently fetches a task and associated data from the task queue server for processing and posts the result to shared memory for later use. Load balancing can be carried out within the processing system without the requirement for a centralized controller. The author concludes that real time vision processing cannot be achieved without both sequential and parallel vision algorithms and a good parallel vision architecture.

Multi-protocol header generation system

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

Roberts, David A.; Ignatowski, Michael; Jayasena, Nuwan

A communication device includes a data source that generates data for transmission over a bus, and a data encoder that receives and encodes outgoing data. An encoder system receives outgoing data from a data source and stores the outgoing data in a first queue. An encoder encodes outgoing data with a header type that is based upon a header type indication from a controller and stores the encoded data that may be a packet or a data word with at least one layered header in a second queue for transmission. The device is configured to receive at a payload extractor,more » a packet protocol change command from the controller and to remove the encoded data and to re-encode the data to create a re-encoded data packet and placing the re-encoded data packet in the second queue for transmission.« less

Capacity-constrained traffic assignment in networks with residual queues

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

Lam, W.H.K.; Zhang, Y.

2000-04-01

This paper proposes a capacity-constrained traffic assignment model for strategic transport planning in which the steady-state user equilibrium principle is extended for road networks with residual queues. Therefore, the road-exit capacity and the queuing effects can be incorporated into the strategic transport model for traffic forecasting. The proposed model is applicable to the congested network particularly when the traffic demands exceeds the capacity of the network during the peak period. An efficient solution method is proposed for solving the steady-state traffic assignment problem with residual queues. Then a simple numerical example is employed to demonstrate the application of the proposedmore » model and solution method, while an example of a medium-sized arterial highway network in Sioux Falls, South Dakota, is used to test the applicability of the proposed solution to real problems.« less

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.

Schedulers with load-store queue awareness

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

Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.

2017-02-07

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

Schedulers with load-store queue awareness

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

Chen, Tong; Eichenberger, Alexandre E.; Jacob, Arpith C.

2017-01-24

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

Generalized Monitoring Facility. Users Manual.

DTIC Science & Technology

1982-05-01

based monitor. The RMC will sample system queues and tables on a 30-second time interval. The data captured from these queues and cells are written...period, only the final change will be reported. The following communication region cells are constantly monitored for changes, since a processor...is reported as zeros in WW6.4. When GMC terminates, it writes a record containing information read from communication region cells and information

Predictive functional control for active queue management in congested TCP/IP networks.

PubMed

Bigdeli, N; Haeri, M

2009-01-01

Predictive functional control (PFC) as a new active queue management (AQM) method in dynamic TCP networks supporting explicit congestion notification (ECN) is proposed. The ability of the controller in handling system delay along with its simplicity and low computational load makes PFC a privileged AQM method in the high speed networks. Besides, considering the disturbance term (which represents model/process mismatches, external disturbances, and existing noise) in the control formulation adds some level of robustness into the PFC-AQM controller. This is an important and desired property in the control of dynamically-varying computer networks. In this paper, the controller is designed based on a small signal linearized fluid-flow model of the TCP/AQM networks. Then, closed-loop transfer function representation of the system is derived to analyze the robustness with respect to the network and controller parameters. The analytical as well as the packet-level ns-2 simulation results show the out-performance of the developed controller for both queue regulation and resource utilization. Fast response, low queue fluctuations (and consequently low delay jitter), high link utilization, good disturbance rejection, scalability, and low packet marking probability are other features of the developed method with respect to other well-known AQM methods such as RED, PI, and REM which are also simulated for comparison.

Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

PubMed

Ayub, Qaisar; Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

2018-01-01

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments

PubMed Central

Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

2018-01-01

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio. PMID:29438438

A robust fractional-order PID controller design based on active queue management for TCP network

NASA Astrophysics Data System (ADS)

Hamidian, Hamideh; Beheshti, Mohammad T. H.

2018-01-01

In this paper, a robust fractional-order controller is designed to control the congestion in transmission control protocol (TCP) networks with time-varying parameters. Fractional controllers can increase the stability and robustness. Regardless of advantages of fractional controllers, they are still not common in congestion control in TCP networks. The network parameters are time-varying, so the robust stability is important in congestion controller design. Therefore, we focused on the robust controller design. The fractional PID controller is developed based on active queue management (AQM). D-partition technique is used. The most important property of designed controller is the robustness to the time-varying parameters of the TCP network. The vertex quasi-polynomials of the closed-loop characteristic equation are obtained, and the stability boundaries are calculated for each vertex quasi-polynomial. The intersection of all stability regions is insensitive to network parameter variations, and results in robust stability of TCP/AQM system. NS-2 simulations show that the proposed algorithm provides a stable queue length. Moreover, simulations show smaller oscillations of the queue length and less packet drop probability for FPID compared to PI and PID controllers. We can conclude from NS-2 simulations that the average packet loss probability variations are negligible when the network parameters change.

A Simulation Study of Paced TCP

NASA Technical Reports Server (NTRS)

Kulik, Joanna; Coulter, Robert; Rockwell, Dennis; Partridge, Craig

2000-01-01

In this paper, we study the performance of paced TCP, a modified version of TCP designed especially for high delay- bandwidth networks. In typical networks, TCP optimizes its send-rate by transmitting increasingly large bursts, or windows, of packets, one burst per round-trip time, until it reaches a maximum window-size, which corresponds to the full capacity of the network. In a network with a high delay-bandwidth product, however, Transmission Control Protocol's (TCPs) maximum window-size may be larger than the queue size of the intermediate routers, and routers will begin to drop packets as soon as the windows become too large for the router queues. The TCP sender then concludes that the bottleneck capacity of the network has been reached, and it limits its send-rate accordingly. Partridge proposed paced TCP as a means of solving the problem of queueing bottlenecks. A sender using paced TCP would release packets in multiple, small bursts during a round-trip time in which ordinary TCP would release a single, large burst of packets. This approach allows the sender to increase its send-rate to the maximum window size without encountering queueing bottlenecks. This paper describes the performance of paced TCP in a simulated network and discusses implementation details that can affect the performance of paced TCP.

DTS: The NOAO Data Transport System

NASA Astrophysics Data System (ADS)

Fitzpatrick, M.; Semple, T.

2014-05-01

The NOAO Data Transport System (DTS) provides high-throughput, reliable, data transfer between telescopes, pipelines and archive centers located in the Northern and Southern hemispheres. It is a distributed application using XML-RPC for command and control, and either parallel-TCP or UDT protocols for bulk data transport. The system is data-agnostic, allowing arbitrary files or directories to be moved using the same infrastructure. Data paths are configurable in the system by connecting nodes as the source or destination of data in a queue. Each leg of a data path may be configured independently based on the network environment between the sites. A queueing model is currently implemented to manage the automatic movement of data, a streaming model is planned to support arbitrarily large transfers (e.g. as in a disk recovery scenario) or to provide a 'pass-thru' interface to minize overheads. A web-based monitor allows anyone to get a graphical overview of the DTS system as it runs, operators will be able to control individual nodes in the system. Through careful tuning of the network paths DTS is able to achieve in excess of 80-percent of the nominal wire speed using only commodity networks, making it ideal for long-haul transport of large volumes of data.

Invisible engineering of holographic illusion

NASA Astrophysics Data System (ADS)

Richardson, Martin J.

1993-03-01

Recent developments in production techniques of pulsed holograms and holographic stereograms have ameliorated to provide high quality three dimensional illusions that echo the apparently innate need of society to replicate itself through artificial means. A commercial platform has been found for these archetypical illusions through the mass production and distribution of embossed stereograms that depict popular celebrities from the music industry. As pulse recordings of the rich and famous become better known, and as former presidents queue to join the holographic hall of fame, the author asks `is it documentation or entertainment that is shaping the future of holography?'

QoS support over ultrafast TDM optical networks

NASA Astrophysics Data System (ADS)

Narvaez, Paolo; Siu, Kai-Yeung; Finn, Steven G.

1999-08-01

HLAN is a promising architecture to realize Tb/s access networks based on ultra-fast optical TDM technologies. This paper presents new research results on efficient algorithms for the support of quality of service over the HLAN network architecture. In particular, we propose a new scheduling algorithm that emulates fair queuing in a distributed manner for bandwidth allocation purpose. The proposed scheduler collects information on the queue of each host on the network and then instructs each host how much data to send. Our new scheduling algorithm ensures full bandwidth utilization, while guaranteeing fairness among all hosts.

AMS Prototyping Activities

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2008-01-01

This slide presentation reviews the activity around the Asynchronous Message Service (AMS) prototype. An AMS reference implementation has been available since late 2005. It is aimed at supporting message exchange both in on-board environments and over space links. The implementation incoroporates all mandatory elements of the draft recommendation from July 2007: (1) MAMS, AMS, and RAMS protocols. (2) Failover, heartbeats, resync. (3) "Hooks" for security, but no cipher suites included in the distribution. The performance is reviewed, and a Benchmark latency test over VxWorks Message Queues is shown as histograms of a count vs microseconds per 1000-byte message

Low-traffic limit and first-passage times for a simple model of the continuous double auction

NASA Astrophysics Data System (ADS)

Scalas, Enrico; Rapallo, Fabio; Radivojević, Tijana

2017-11-01

We consider a simplified model of the continuous double auction where prices are integers varying from 1 to N with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is equivalent to two M / M / 1 queues. We study the behavior of the auction in the low-traffic limit where limit orders are immediately matched by market orders. In this limit, the distribution of prices can be computed exactly and gives a reasonable approximation of the price distribution when the ratio between the rate of order arrivals and the rate of order executions is below 1 / 2. This is further confirmed by the analysis of the first-passage time in 1 or N.

Evaluation of public health interventions for Anthrax: a report to the secretary's council on Public Health Preparedness.

PubMed

Wein, Lawrence M; Craft, David L

2005-01-01

To aid in understanding how best to respond to a bioterror anthrax attack, we analyze a system of differential equations that includes a disease progression model, a set of spatially distributed queues for distributing antibiotics, and vaccination (pre-event and/or post-event). We derive approximate expressions for the number of casualties as a function of key parameters and management levers, including the time at which the attack is detected, the number of days to distribute antibiotics, the adherence to prophylactic antibiotics, and the fraction of the population that is preimmunized. We compare a variety of public health intervention policies in the event of a hypothetical anthrax attack in a large metropolitan area. Modeling assumptions were decided by the Anthrax Modeling Working Group of the Secretary's Council on Public Health Preparedness. Our results highlight the primary importance of rapid antibiotic distribution and lead us to argue for ensuring post-attack surge capacity to rapidly produce enough anthrax vaccine for an additional 100 million people.

46 CFR 120.324 - Dual voltage generators.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 4 2010-10-01 2010-10-01 false Dual voltage generators. 120.324 Section 120.324... INSTALLATION Power Sources and Distribution Systems § 120.324 Dual voltage generators. (a) A dual voltage generator installed on a vessel shall be of the grounded type, where: (1) The neutral of a dual voltage...

46 CFR 129.326 - Dual-voltage generators.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 4 2010-10-01 2010-10-01 false Dual-voltage generators. 129.326 Section 129.326... INSTALLATIONS Power Sources and Distribution Systems § 129.326 Dual-voltage generators. If a dual-voltage generator is installed on an OSV— (a) The neutral of the dual-voltage system must be solidly grounded at the...

Sample Batch Scripts for Running Jobs on the Peregrine System |

Science.gov Websites

script for a serial job in the debug queue #!/bin/bash #PBS -lnodes=1:ppn=1,walltime=500 #PBS -N test1 limit #PBS -l nodes=1 # one node #PBS -N test1 # Name of job #PBS -A CSC001 # project handle cd #PBS -q short # short queue #PBS -l nodes=4:ppn=24 # Number of nodes, put 24 processes on each #PBS -N

Analysis on preemptive priority retrial queue with two types of customers, balking, optional re-service, single vacation and service interruption

NASA Astrophysics Data System (ADS)

Yuvarani, S.; Saravanarajan, M. C.

2017-11-01

This paper concerned with performance analysis of single server preemptive priority retrial queue with a single vacation where two types of customers are considered and they are called priority customers and ordinary customers. The ordinary customers arrive in batch into the system. The priority customers do not form any queue. After the completion of regular service, the customers may demand re-service for the previous service without joining the orbit or may leave the system. As soon as the system is empty, the server goes for vacation and the regular busy server can be subjected to breakdown. By using the supplementary variable technique, we obtain the steady-state probability generating functions for the system/orbit size. Some important system performance measures and the stochastic decomposition are discussed. Finally, numerical examples are presented to visualize the effect of parameters on system performance measures.

Kin competition within groups: the offspring depreciation hypothesis.

PubMed Central

Ridley, J; Sutherland, W J

2002-01-01

Where relatives compete for the same resources (kin competition) and each obtains an equal share, this can favour the evolution of elevated dispersal rates, such that most resource competition is among non-relatives. We show that this effect evaporates as among-sibling dominance increases to the point where the allocation of resources is maximally unequal. We restore a kin-competition effect on emigration rates from dominance-ranked family groups by showing that where siblings form queues to inherit the breeding positions, the length of the queue affects the fitness of all individuals by depreciating the rank of subsequent offspring. Incorporating this 'offspring depreciation' effect decreases optimal queue lengths, increases dispersal rates and explains the otherwise paradoxical use of sinks by cooperatively breeding birds in stable environments. The offspring depreciation effect also favours the evolution of small, but consistent, clutch sizes and high reproductive skew, but constrains the evolution of alloparenting. PMID:12573070

Counter design influences the privacy of patients in health care.

PubMed

Mobach, Mark P

2009-03-01

A re-furnishing of counter areas in primary health care was used to assess patient privacy and its influences on the nature of conversations in a controlled experiment. Patients in two community-based pharmacies in the Netherlands were assigned to enclosed counters and a queue at distance, or to counters that exposed patients mutually and a closer queue. Patients assigned to counters with reduced sight were more satisfied with the privacy than patients at visually exposed counters. However, in comparison with visually exposed pharmacy counters, conversations of patients at enclosed counters could still be overheard and did not have different conversations to other patients. Architectural design of health-care institutions has potential to positively influence perceived patient privacy in areas in where multiple patient-staff communications routinely occur and where patient privacy is an important issue, but enclosed counters with a queue at distance do not prevent incidental disclosure of individually identifiable health information.

Managing patients' wait time in specialist out-patient clinic using real-time data from existing queue management and ADT systems.

PubMed

Ju, John Chen; Gan, Soon Ann; Tan Siew Wee, Justine; Huang Yuchi, Peter; Mei Mei, Chan; Wong Mei Mei, Sharon; Fong, Kam Weng

2013-01-01

In major cancer centers, heavy patients load and multiple registration stations could cause significant wait time, and can be result in patient complains. Real-time patient journey data and visual display are useful tools in hospital patient queue management. This paper demonstrates how we capture patient queue data without deploying any tracing devices; and how to convert data into useful patient journey information to understand where interventions are likely to be most effective. During our system development, remarkable effort has been spent on resolving data discrepancy and balancing between accuracy and system performances. A web-based dashboard to display real-time information and a framework for data analysis were also developed to facilitate our clinics' operation. Result shows our system could eliminate more than 95% of data capturing errors and has improved patient wait time data accuracy since it was deployed.

Kin competition within groups: the offspring depreciation hypothesis.

PubMed

Ridley, J; Sutherland, W J

2002-12-22

Where relatives compete for the same resources (kin competition) and each obtains an equal share, this can favour the evolution of elevated dispersal rates, such that most resource competition is among non-relatives. We show that this effect evaporates as among-sibling dominance increases to the point where the allocation of resources is maximally unequal. We restore a kin-competition effect on emigration rates from dominance-ranked family groups by showing that where siblings form queues to inherit the breeding positions, the length of the queue affects the fitness of all individuals by depreciating the rank of subsequent offspring. Incorporating this 'offspring depreciation' effect decreases optimal queue lengths, increases dispersal rates and explains the otherwise paradoxical use of sinks by cooperatively breeding birds in stable environments. The offspring depreciation effect also favours the evolution of small, but consistent, clutch sizes and high reproductive skew, but constrains the evolution of alloparenting.

The queueing perspective of asynchronous network coding in two-way relay network

NASA Astrophysics Data System (ADS)

Liang, Yaping; Chang, Qing; Li, Xianxu

2018-04-01

Asynchronous network coding (NC) has potential to improve the wireless network performance compared with a routing or the synchronous network coding. Recent researches concentrate on the optimization between throughput/energy consuming and delay with a couple of independent input flow. However, the implementation of NC requires a thorough investigation of its impact on relevant queueing systems where few work focuses on. Moreover, few works study the probability density function (pdf) in network coding scenario. In this paper, the scenario with two independent Poisson input flows and one output flow is considered. The asynchronous NC-based strategy is that a new arrival evicts a head packet holding in its queue when waiting for another packet from the other flow to encode. The pdf for the output flow which contains both coded and uncoded packets is derived. Besides, the statistic characteristics of this strategy are analyzed. These results are verified by numerical simulations.

Conservative parallel simulation of priority class queueing networks

NASA Technical Reports Server (NTRS)

Nicol, David

1992-01-01

A conservative synchronization protocol is described for the parallel simulation of queueing networks having C job priority classes, where a job's class is fixed. This problem has long vexed designers of conservative synchronization protocols because of its seemingly poor ability to compute lookahead: the time of the next departure. For, a job in service having low priority can be preempted at any time by an arrival having higher priority and an arbitrarily small service time. The solution is to skew the event generation activity so that the events for higher priority jobs are generated farther ahead in simulated time than lower priority jobs. Thus, when a lower priority job enters service for the first time, all the higher priority jobs that may preempt it are already known and the job's departure time can be exactly predicted. Finally, the protocol was analyzed and it was demonstrated that good performance can be expected on the simulation of large queueing networks.

Conservative parallel simulation of priority class queueing networks

NASA Technical Reports Server (NTRS)

Nicol, David M.

1990-01-01

A conservative synchronization protocol is described for the parallel simulation of queueing networks having C job priority classes, where a job's class is fixed. This problem has long vexed designers of conservative synchronization protocols because of its seemingly poor ability to compute lookahead: the time of the next departure. For, a job in service having low priority can be preempted at any time by an arrival having higher priority and an arbitrarily small service time. The solution is to skew the event generation activity so that the events for higher priority jobs are generated farther ahead in simulated time than lower priority jobs. Thus, when a lower priority job enters service for the first time, all the higher priority jobs that may preempt it are already known and the job's departure time can be exactly predicted. Finally, the protocol was analyzed and it was demonstrated that good performance can be expected on the simulation of large queueing networks.

Measurement of myocardial blood flow by cardiovascular magnetic resonance perfusion: comparison of distributed parameter and Fermi models with single and dual bolus.

PubMed

Papanastasiou, Giorgos; Williams, Michelle C; Kershaw, Lucy E; Dweck, Marc R; Alam, Shirjel; Mirsadraee, Saeed; Connell, Martin; Gray, Calum; MacGillivray, Tom; Newby, David E; Semple, Scott Ik

2015-02-17

Mathematical modeling of cardiovascular magnetic resonance perfusion data allows absolute quantification of myocardial blood flow. Saturation of left ventricle signal during standard contrast administration can compromise the input function used when applying these models. This saturation effect is evident during application of standard Fermi models in single bolus perfusion data. Dual bolus injection protocols have been suggested to eliminate saturation but are much less practical in the clinical setting. The distributed parameter model can also be used for absolute quantification but has not been applied in patients with coronary artery disease. We assessed whether distributed parameter modeling might be less dependent on arterial input function saturation than Fermi modeling in healthy volunteers. We validated the accuracy of each model in detecting reduced myocardial blood flow in stenotic vessels versus gold-standard invasive methods. Eight healthy subjects were scanned using a dual bolus cardiac perfusion protocol at 3T. We performed both single and dual bolus analysis of these data using the distributed parameter and Fermi models. For the dual bolus analysis, a scaled pre-bolus arterial input function was used. In single bolus analysis, the arterial input function was extracted from the main bolus. We also performed analysis using both models of single bolus data obtained from five patients with coronary artery disease and findings were compared against independent invasive coronary angiography and fractional flow reserve. Statistical significance was defined as two-sided P value < 0.05. Fermi models overestimated myocardial blood flow in healthy volunteers due to arterial input function saturation in single bolus analysis compared to dual bolus analysis (P < 0.05). No difference was observed in these volunteers when applying distributed parameter-myocardial blood flow between single and dual bolus analysis. In patients, distributed parameter modeling was able to detect reduced myocardial blood flow at stress (<2.5 mL/min/mL of tissue) in all 12 stenotic vessels compared to only 9 for Fermi modeling. Comparison of single bolus versus dual bolus values suggests that distributed parameter modeling is less dependent on arterial input function saturation than Fermi modeling. Distributed parameter modeling showed excellent accuracy in detecting reduced myocardial blood flow in all stenotic vessels.

46 CFR 129.326 - Dual-voltage generators.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 4 2013-10-01 2013-10-01 false Dual-voltage generators. 129.326 Section 129.326 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OFFSHORE SUPPLY VESSELS ELECTRICAL INSTALLATIONS Power Sources and Distribution Systems § 129.326 Dual-voltage generators. If a dual-voltage...

46 CFR 129.326 - Dual-voltage generators.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 4 2012-10-01 2012-10-01 false Dual-voltage generators. 129.326 Section 129.326 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OFFSHORE SUPPLY VESSELS ELECTRICAL INSTALLATIONS Power Sources and Distribution Systems § 129.326 Dual-voltage generators. If a dual-voltage...

46 CFR 129.326 - Dual-voltage generators.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 4 2014-10-01 2014-10-01 false Dual-voltage generators. 129.326 Section 129.326 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OFFSHORE SUPPLY VESSELS ELECTRICAL INSTALLATIONS Power Sources and Distribution Systems § 129.326 Dual-voltage generators. If a dual-voltage...

46 CFR 129.326 - Dual-voltage generators.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 4 2011-10-01 2011-10-01 false Dual-voltage generators. 129.326 Section 129.326 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) OFFSHORE SUPPLY VESSELS ELECTRICAL INSTALLATIONS Power Sources and Distribution Systems § 129.326 Dual-voltage generators. If a dual-voltage...

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

Sadayappan, Ponnuswamy

Exascale computing systems will provide a thousand-fold increase in parallelism and a proportional increase in failure rate relative to today's machines. Systems software for exascale machines must provide the infrastructure to support existing applications while simultaneously enabling efficient execution of new programming models that naturally express dynamic, adaptive, irregular computation; coupled simulations; and massive data analysis in a highly unreliable hardware environment with billions of threads of execution. We propose a new approach to the data and work distribution model provided by system software based on the unifying formalism of an abstract file system. The proposed hierarchical data model providesmore » simple, familiar visibility and access to data structures through the file system hierarchy, while providing fault tolerance through selective redundancy. The hierarchical task model features work queues whose form and organization are represented as file system objects. Data and work are both first class entities. By exposing the relationships between data and work to the runtime system, information is available to optimize execution time and provide fault tolerance. The data distribution scheme provides replication (where desirable and possible) for fault tolerance and efficiency, and it is hierarchical to make it possible to take advantage of locality. The user, tools, and applications, including legacy applications, can interface with the data, work queues, and one another through the abstract file model. This runtime environment will provide multiple interfaces to support traditional Message Passing Interface applications, languages developed under DARPA's High Productivity Computing Systems program, as well as other, experimental programming models. We will validate our runtime system with pilot codes on existing platforms and will use simulation to validate for exascale-class platforms. In this final report, we summarize research results from the work done at the Ohio State University towards the larger goals of the project listed above.« less

Enhancement of the static extinction ratio by using a dual-section distributed feedback laser integrated with an electro-absorption modulator

NASA Astrophysics Data System (ADS)

Cho, Chun-Hyung; Kim, Jongseong; Sung, Hyuk-Kee

2016-09-01

We report on the enhancement of the static extinction ratio by using a dual-section distributed feedback laser diode integrated with an electro-absorption modulator. A directly- modulated dual-section laser can provide improved modulation performance under a low bias level ( i.e., below the threshold level) compared with a standard directly-modulated laser. By combining the extinction ratio from a dual-section laser with that from an electro-absorption modulator section, a total extinction ratio of 49.6. dB are successfully achieved.

State dependent arrival in bulk retrial queueing system with immediate Bernoulli feedback, multiple vacations and threshold

NASA Astrophysics Data System (ADS)

Niranjan, S. P.; Chandrasekaran, V. M.; Indhira, K.

2017-11-01

The objective of this paper is to analyse state dependent arrival in bulk retrial queueing system with immediate Bernoulli feedback, multiple vacations, threshold and constant retrial policy. Primary customers are arriving into the system in bulk with different arrival rates λ a and λ b . If arriving customers find the server is busy then the entire batch will join to orbit. Customer from orbit request service one by one with constant retrial rate γ. On the other hand if an arrival of customers finds the server is idle then customers will be served in batches according to general bulk service rule. After service completion, customers may request service again with probability δ as feedback or leave from the system with probability 1 - δ. In the service completion epoch, if the orbit size is zero then the server leaves for multiple vacations. The server continues the vacation until the orbit size reaches the value ‘N’ (N > b). At the vacation completion, if the orbit size is ‘N’ then the server becomes ready to provide service for customers from the main pool or from the orbit. For the designed queueing model, probability generating function of the queue size at an arbitrary time will be obtained by using supplementary variable technique. Various performance measures will be derived with suitable numerical illustrations.

Proteolytic crosstalk in multi-protease networks

NASA Astrophysics Data System (ADS)

Ogle, Curtis T.; Mather, William H.

2016-04-01

Processive proteases, such as ClpXP in E. coli, are conserved enzyme assemblies that can recognize and rapidly degrade proteins. These proteases are used for a number of purposes, including degrading mistranslated proteins and controlling cellular stress response. However, proteolytic machinery within the cell is limited in capacity and can lead to a bottleneck in protein degradation, whereby many proteins compete (‘queue’) for proteolytic resources. Previous work has demonstrated that such queueing can lead to pronounced statistical relationships between different protein counts when proteins compete for a single common protease. However, real cells contain many different proteases, e.g. ClpXP, ClpAP, and Lon in E. coli, and it is not clear how competition between proteins for multiple classes of protease would influence the dynamics of cellular networks. In the present work, we theoretically demonstrate that a multi-protease proteolytic bottleneck can substantially couple the dynamics for both simple and complex (oscillatory) networks, even between substrates with substantially different affinities for protease. For these networks, queueing often leads to strong positive correlations between protein counts, and these correlations are strongest near the queueing theoretic point of balance. Furthermore, we find that the qualitative behavior of these networks depends on the relative size of the absolute affinity of substrate to protease compared to the cross affinity of substrate to protease, leading in certain regimes to priority queue statistics.

46 CFR 183.324 - Dual voltage generators.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 7 2010-10-01 2010-10-01 false Dual voltage generators. 183.324 Section 183.324... TONS) ELECTRICAL INSTALLATION Power Sources and Distribution Systems § 183.324 Dual voltage generators. (a) A dual voltage generator installed on a vessel shall be of the grounded type, where: (1) The...

Marionette

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

Sullivan, M.; Anderson, D.P.

1988-01-01

Marionette is a system for distributed parallel programming in an environment of networked heterogeneous computer systems. It is based on a master/slave model. The master process can invoke worker operations (asynchronous remote procedure calls to single slaves) and context operations (updates to the state of all slaves). The master and slaves also interact through shared data structures that can be modified only by the master. The master and slave processes are programmed in a sequential language. The Marionette runtime system manages slave process creation, propagates shared data structures to slaves as needed, queues and dispatches worker and context operations, andmore » manages recovery from slave processor failures. The Marionette system also includes tools for automated compilation of program binaries for multiple architectures, and for distributing binaries to remote fuel systems. A UNIX-based implementation of Marionette is described.« less

C3 EVAL Model Development and Test. Volume 2. Programmers Manual.

DTIC Science & Technology

1985-10-01

requests for CAS (message types 2900, 3000, 3400) and has a non- 61 - ~~.t -o-5. Sd% NODE MESSAGE DEST DEST PLINK LINKI ALT1 LINK2 ALT2 . LINKP • LINKA1...LINKA2 LINKn ALTi PLINK LINKI LINK2 LINKn ALT2 PLINK LINKI LINK2 * LINKn Figure 13: PARAMETERS IN COMMUNICATIONS ALLOCATION null pointer to its...SUBROUTINE HOLDQ1 (IPASS) * MOVE PRIORITY MESSAGES FROM HOLD QUEUE TO ALTERNATE * COMMUNICATIONS LINKI SEND QUEUE * CALLS - SNAP, FIND

Ada Quality and Style: Guidelines for Professional Programmers

DTIC Science & Technology

1991-01-01

occured because entry queues are serviced in FIFO order, not by priority. There is another situation referred to as a race condition. A program like the...the value of ’COUNT. A task can be removed from an entry queue due to execution of an abort statement as well as expiration of a timed entry call. The...is not defined by the language and may vary from time sliced to preemptive priority. Some implementations (e.g., VAX Ada) provide several choices

Specifications of a Simulation Model for a Local Area Network Design in Support of Stock Point Logistics Integrated Communications Environment (SPLICE).

DTIC Science & Technology

1982-10-01

class queueing system with a preemptive -resume priority service discipline, as depicted in Figure 4.2. Concerning a SPLICLAN configuration a node can...processor can be modeled as a single resource, multi-class queueing system with a preemptive -resume priority structure as the one given in Figure 4.2. An...LOCAL AREA NETWORK DESIGN IN SUPPORT OF STOCK POINT LOGISTICS INTEGRATED COMMUNICATIONS ENVIRONMENT (SPLICE) by Ioannis Th. Mastrocostopoulos October

Ammunition Resupply Model. Volume II. Programmers Manual.

DTIC Science & Technology

1980-03-01

pointer tables. If the placement is successful the flag ( ICHECK ) is set equal to 1. COMMON BLOCKS: EVENTS CALLS: NONE IS CALLED BY: SCHED CALLING PARAMETERS...decimal portion of the event time multiplied by 3600. ICHECK - 0 if no room on the file, I if there is room on the file. LOCAL ARRAYS: JFORE (1024...8217EVT, ITH, I-IS, !CHECK) C PUTEVT PLACES AN EVENT RECORD IN -THE QUEUE IN CHRONOLOGICAL C ORDER A,1D UPDATES THE QUEUE DIRECTORY. ICHECK FLAG SET C IF

Queueing Network Models for Parallel Processing of Task Systems: an Operational Approach

NASA Technical Reports Server (NTRS)

Mak, Victor W. K.

1986-01-01

Computer performance modeling of possibly complex computations running on highly concurrent systems is considered. Earlier works in this area either dealt with a very simple program structure or resulted in methods with exponential complexity. An efficient procedure is developed to compute the performance measures for series-parallel-reducible task systems using queueing network models. The procedure is based on the concept of hierarchical decomposition and a new operational approach. Numerical results for three test cases are presented and compared to those of simulations.

A Perspective on Multiaccess Channels

DTIC Science & Technology

1984-09-01

packets that arrived between T and T+ are transmitted. The parameter v is determined by all each transmitter based on the history of the feedback up to time...t. The transmitters also calculate T based on the feedback history . It is helpful to view the packet arrivals in ETt) as being in a distributed queue...Cambridge, MA. 4T TO. JC-N~g 4f aAviE. I -w l 2.1 WPr IfCI’YIL 2. ICA 6-- e NO.Yt4 Z/ ’) eqp~ ~ 46 5AZw’ I.q e L 1!x;Y :r/; YFv (1.~i 21 V4 Gf~~ .. 2 15 5.5

A study of topologies and protocols for fiber optic local area network

NASA Technical Reports Server (NTRS)

Yeh, C.; Gerla, M.; Rodrigues, P.

1985-01-01

The emergence of new applications requiring high data traffic necessitates the development of high speed local area networks. Optical fiber is selected as the transmission medium due to its inherent advantages over other possible media and the dual optical bus architecture is shown to be the most suitable topology. Asynchronous access protocols, including token, random, hybrid random/token, and virtual token schemes, are developed and analyzed. Exact expressions for insertion delay and utilization at light and heavy load are derived, and intermediate load behavior is investigated by simulation. A new tokenless adaptive scheme whose control depends only on the detection of activity on the channel is shown to outperform round-robin schemes under uneven loads and multipacket traffic and to perform optimally at light load. An approximate solution to the queueing delay for an oscillating polling scheme under chaining is obtained and results are compared with simulation. Solutions to the problem of building systems with a large number of stations are presented, including maximization of the number of optical couplers, and the use of passive star/bus topologies, bridges and gateways.

Distributed dual-parameter optical fiber sensor based on cascaded microfiber Fabry-Pérot interferometers

NASA Astrophysics Data System (ADS)

Xiang, Yang; Luo, Yiyang; Zhang, Wei; Liu, Deming; Sun, Qizhen

2017-04-01

We propose and demonstrate a distributed fiber sensor based on cascaded microfiber Fabry-Perot interferometers (MFPI) for simultaneous refractive index (SRI) and temperature measurement. By employing MFPI which is fabricated by taper-drawing the center of a uniform fiber Bragg grating (FBG) on standard fiber into a section of microfiber, dual parameters including SRI and temperature can be detected through demodulating the reflection spectrum of the MFPI. Further, wavelength-division-multiplexing (WDM) is applied to realize distributed dual-parameter fiber sensor by using cascaded MFPIs with different Bragg wavelengths. A prototype sensor system with 5 cascaded MFPIs is constructed to experimentally demonstrate the sensing performance.

Power Allocation Based on Data Classification in Wireless Sensor Networks

PubMed Central

Wang, Houlian; Zhou, Gongbo

2017-01-01

Limited node energy in wireless sensor networks is a crucial factor which affects the monitoring of equipment operation and working conditions in coal mines. In addition, due to heterogeneous nodes and different data acquisition rates, the number of arriving packets in a queue network can differ, which may lead to some queue lengths reaching the maximum value earlier compared with others. In order to tackle these two problems, an optimal power allocation strategy based on classified data is proposed in this paper. Arriving data is classified into dissimilar classes depending on the number of arriving packets. The problem is formulated as a Lyapunov drift optimization with the objective of minimizing the weight sum of average power consumption and average data class. As a result, a suboptimal distributed algorithm without any knowledge of system statistics is presented. The simulations, conducted in the perfect channel state information (CSI) case and the imperfect CSI case, reveal that the utility can be pushed arbitrarily close to optimal by increasing the parameter V, but with a corresponding growth in the average delay, and that other tunable parameters W and the classification method in the interior of utility function can trade power optimality for increased average data class. The above results show that data in a high class has priorities to be processed than data in a low class, and energy consumption can be minimized in this resource allocation strategy. PMID:28498346

Diversity of free-living amoebae in a dual distribution (potable and recycled) water system

EPA Science Inventory

Free-living amoebae are known to facilitate the growth of water associated pathogens. This study, for the first time, explored the diversity of free-living amoebae in a dual distribution (potable and recycled) water system in Rouse Hill NSW, Australia. Water and biofilm samples w...

Managing variation in demand: lessons from the UK National Health Service.

PubMed

Walley, Paul; Silvester, Kate; Steyn, Richard

2006-01-01

Managers within the U.S. healthcare system are becoming more aware of the impact of variation in demand on healthcare processes. The UK National Health Service provides a prime example of a system that has experienced the consequences when the issue is not dealt with satisfactorily, having suffered from excessive queues for a prolonged period. These delays are mostly caused by a lack of attention to variation and inappropriate responses to the queues, rather than a capacity shortage. A number of collaborative programs recently have come to grips with many of the causes of the queues in both elective care and emergency care. Although there are still areas that need large-scale improvement, good progress has been made, especially within emergency care. The authors of this article have acted as technical advisors to a number of these improvement programs and have been able to document many of the practices that have helped to reduce or eliminate unnecessary queues and delays across the 200 sites in England that have 24-hour emergency care facilities. Local program managers at these sites continuously reported progress for a period of 18 months. A number of important lessons for both the design and control of healthcare processes have emerged from the collaborative work. These lessons focus on understanding and measurement of demand, capacity planning, reduction of introduced variation, segmentation and streaming of work, process design, capacity yield management, and measurement of variation.

Random early detection for congestion avoidance in wired networks: a discretized pursuit learning-automata-like solution.

PubMed

Misra, Sudip; Oommen, B John; Yanamandra, Sreekeerthy; Obaidat, Mohammad S

2010-02-01

In this paper, we present a learning-automata-like The reason why the mechanism is not a pure LA, but rather why it yet mimics one, will be clarified in the body of this paper. (LAL) mechanism for congestion avoidance in wired networks. Our algorithm, named as LAL Random Early Detection (LALRED), is founded on the principles of the operations of existing RED congestion-avoidance mechanisms, augmented with a LAL philosophy. The primary objective of LALRED is to optimize the value of the average size of the queue used for congestion avoidance and to consequently reduce the total loss of packets at the queue. We attempt to achieve this by stationing a LAL algorithm at the gateways and by discretizing the probabilities of the corresponding actions of the congestion-avoidance algorithm. At every time instant, the LAL scheme, in turn, chooses the action that possesses the maximal ratio between the number of times the chosen action is rewarded and the number of times that it has been chosen. In LALRED, we simultaneously increase the likelihood of the scheme converging to the action, which minimizes the number of packet drops at the gateway. Our approach helps to improve the performance of congestion avoidance by adaptively minimizing the queue-loss rate and the average queue size. Simulation results obtained using NS2 establish the improved performance of LALRED over the traditional RED methods which were chosen as the benchmarks for performance comparison purposes.

Load sharing in distributed real-time systems with state-change broadcasts

NASA Technical Reports Server (NTRS)

Shin, Kang G.; Chang, Yi-Chieh

1989-01-01

A decentralized dynamic load-sharing (LS) method based on state-change broadcasts is proposed for a distributed real-time system. Whenever the state of a node changes from underloaded to fully loaded and vice versa, the node broadcasts this change to a set of nodes, called a buddy set, in the system. The performance of the method is evaluated with both analytic modeling and simulation. It is modeled first by an embedded Markov chain for which numerical solutions are derived. The model solutions are then used to calculate the distribution of queue lengths at the nodes and the probability of meeting task deadlines. The analytical results show that buddy sets of 10 nodes outperform those of less than 10 nodes, and the incremental benefit gained from increasing the buddy set size beyond 15 nodes is insignificant. These and other analytical results are verified by simulation. The proposed LS method is shown to meet task deadlines with a very high probability.

Approaches in highly parameterized inversion - GENIE, a general model-independent TCP/IP run manager

USGS Publications Warehouse

Muffels, Christopher T.; Schreuder, Willem A.; Doherty, John E.; Karanovic, Marinko; Tonkin, Matthew J.; Hunt, Randall J.; Welter, David E.

2012-01-01

GENIE is a model-independent suite of programs that can be used to generally distribute, manage, and execute multiple model runs via the TCP/IP infrastructure. The suite consists of a file distribution interface, a run manage, a run executer, and a routine that can be compiled as part of a program and used to exchange model runs with the run manager. Because communication is via a standard protocol (TCP/IP), any computer connected to the Internet can serve in any of the capacities offered by this suite. Model independence is consistent with the existing template and instruction file protocols of the widely used PEST parameter estimation program. This report describes (1) the problem addressed; (2) the approach used by GENIE to queue, distribute, and retrieve model runs; and (3) user instructions, classes, and functions developed. It also includes (4) an example to illustrate the linking of GENIE with Parallel PEST using the interface routine.

Function, Type, and Distribution of Teacher Questions in Dual-Language Preschool Read Alouds

ERIC Educational Resources Information Center

Gort, Mileidis; Pontier, Ryan W.; Sembiante, Sabrina F.

2012-01-01

This exploratory study investigated the nature and distribution of dual-language preschool teachers' questions across parallel Spanish- and English-medium read-aloud activities. The notions of comprehensible input (Krashen, 1985) and language output (Swain, 1985), along with a reciprocal interaction model of teaching (Cummins, 2000), guided our…

Area-Efficient VLSI Computation.

DTIC Science & Technology

1981-10-01

to the bus of a computer system. 5 Table 1-2: Definition of the three- sorter . 7 Figure 1-3: A real-time systolic priority queue. 7 Figure 1-4: The...ca.pable of sorting three elements. The iree- sorter has three inputs X, Y, and Z and prduccs tlicc oitputs X’. Y’, and Z’ which are the miniumn, median. Mnd...in Section L4. Figure 1-3 shows how three- sorters are interconnected to make a systolic priority queue. In the figure, the outputs from the top. middle

Where does the waiting list begin? A short review of the dynamics and organization of modern waiting lists.

PubMed

Rotstein, Dalia L; Alter, David A

2006-06-01

Waiting for medical care is the by-product of system rationing, where demand exceeds supply. In this short report we expand on the conventional concept of the queue, by focusing on the regulation of demand and by incorporating a funnel and spout analogy. Real-world examples are used to illustrate the infancy of funnel or demand-side reform initiatives targeting the queue, and the suggestion is made that policy needs to address the concept of 'waiting' much earlier in the treatment cycle.

Integration of Openstack cloud resources in BES III computing cluster

NASA Astrophysics Data System (ADS)

Li, Haibo; Cheng, Yaodong; Huang, Qiulan; Cheng, Zhenjing; Shi, Jingyan

2017-10-01

Cloud computing provides a new technical means for data processing of high energy physics experiment. However, the resource of each queue is fixed and the usage of the resource is static in traditional job management system. In order to make it simple and transparent for physicist to use, we developed a virtual cluster system (vpmanager) to integrate IHEPCloud and different batch systems such as Torque and HTCondor. Vpmanager provides dynamic virtual machines scheduling according to the job queue. The BES III use case results show that resource efficiency is greatly improved.

Regenerative Simulation of Response Times in Networks of Queues.

DTIC Science & Technology

1979-11-01

i jobs at center 1. Nov consider the network of queues in Figure 2.2, formulated (Lewis and Shedler ( 1971 )) as a model of system overhead in...7.2 leading to point estimates and confidence intervals for the quantity r(f) are that the pairs of random variables {( V(fHk) : kall (9.2.3) are...189 Next we show that P’=P. Since P ’m"CIP for all i, we can use the Skorohod representation theorem (see Skorohod (1956) or Billingsley ( 1971 )) to

Channel Allocation in Wireless Integrated Services Networks for Low-Bit-Rate Applications.

DTIC Science & Technology

1998-06-01

server remains idle until the beginning of the next slot, even if cells arrive in the meanwhile.7 The server is assumed to be non - preemptive , i.e., it...If the ToE of the cell is smaller than 1/C^(the service time): i) Discard the cell. 2. Sort the remaining cells in the queue in a non -decreasing...126 Next, the cell-loss-probability ratios (CLPR) of non -empty sources (i.e., having at least one cell in the queue ) defined as ratios between the

DSN command system Mark III-78. [data processing

NASA Technical Reports Server (NTRS)

Stinnett, W. G.

1978-01-01

The Deep Space Network command Mark III-78 data processing system includes a capability for a store-and-forward handling method. The functions of (1) storing the command files at a Deep Space station; (2) attaching the files to a queue; and (3) radiating the commands to the spacecraft are straightforward. However, the total data processing capability is a result of assuming worst case, failure-recovery, or nonnominal operating conditions. Optional data processing functions include: file erase, clearing the queue, suspend radiation, command abort, resume command radiation, and close window time override.

46 CFR 183.324 - Dual voltage generators.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 7 2013-10-01 2013-10-01 false Dual voltage generators. 183.324 Section 183.324 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) SMALL PASSENGER VESSELS (UNDER 100 GROSS TONS) ELECTRICAL INSTALLATION Power Sources and Distribution Systems § 183.324 Dual voltage generators...

46 CFR 183.324 - Dual voltage generators.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 7 2011-10-01 2011-10-01 false Dual voltage generators. 183.324 Section 183.324 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) SMALL PASSENGER VESSELS (UNDER 100 GROSS TONS) ELECTRICAL INSTALLATION Power Sources and Distribution Systems § 183.324 Dual voltage generators...

46 CFR 183.324 - Dual voltage generators.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 7 2014-10-01 2014-10-01 false Dual voltage generators. 183.324 Section 183.324 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) SMALL PASSENGER VESSELS (UNDER 100 GROSS TONS) ELECTRICAL INSTALLATION Power Sources and Distribution Systems § 183.324 Dual voltage generators...

46 CFR 183.324 - Dual voltage generators.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 7 2012-10-01 2012-10-01 false Dual voltage generators. 183.324 Section 183.324 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) SMALL PASSENGER VESSELS (UNDER 100 GROSS TONS) ELECTRICAL INSTALLATION Power Sources and Distribution Systems § 183.324 Dual voltage generators...

Virtual Queue in a Centralized Database Environment

NASA Astrophysics Data System (ADS)

Kar, Amitava; Pal, Dibyendu Kumar

2010-10-01

Today is the era of the Internet. Every matter whether it be a gather of knowledge or planning a holiday or booking of ticket etc everything can be obtained from the internet. This paper intends to calculate the different queuing measures when some booking or purchase is done through the internet subject to the limitations in the number of tickets or seats. It involves a lot of database activities like read and write. This paper takes care of the time involved in the requests of a service, taken as arrival and the time involved in providing the required information, taken as service and thereby tries to calculate the distribution of arrival and service and the various measures of the queuing. This paper considers the database as centralized database for the sake of simplicity as the alternating concept of distributed database would rather complicate the calculation.

Spatial Distribution of Iron Within the Normal Human Liver Using Dual-Source Dual-Energy CT Imaging.

PubMed

Abadia, Andres F; Grant, Katharine L; Carey, Kathleen E; Bolch, Wesley E; Morin, Richard L

2017-11-01

Explore the potential of dual-source dual-energy (DSDE) computed tomography (CT) to retrospectively analyze the uniformity of iron distribution and establish iron concentration ranges and distribution patterns found in healthy livers. Ten mixtures consisting of an iron nitrate solution and deionized water were prepared in test tubes and scanned using a DSDE 128-slice CT system. Iron images were derived from a 3-material decomposition algorithm (optimized for the quantification of iron). A conversion factor (mg Fe/mL per Hounsfield unit) was calculated from this phantom study as the quotient of known tube concentrations and their corresponding CT values. Retrospective analysis was performed of patients who had undergone DSDE imaging for renal stones. Thirty-seven patients with normal liver function were randomly selected (mean age, 52.5 years). The examinations were processed for iron concentration. Multiple regions of interest were analyzed, and iron concentration (mg Fe/mL) and distribution was reported. The mean conversion factor obtained from the phantom study was 0.15 mg Fe/mL per Hounsfield unit. Whole-liver mean iron concentrations yielded a range of 0.0 to 2.91 mg Fe/mL, with 94.6% (35/37) of the patients exhibiting mean concentrations below 1.0 mg Fe/mL. The most important finding was that iron concentration was not uniform and patients exhibited regionally high concentrations (36/37). These regions of higher concentration were observed to be dominant in the middle-to-upper part of the liver (75%), medially (72.2%), and anteriorly (83.3%). Dual-source dual-energy CT can be used to assess the uniformity of iron distribution in healthy subjects. Applying similar techniques to unhealthy livers, future research may focus on the impact of hepatic iron content and distribution for noninvasive assessment in diseased subjects.

Scheduling and control strategies for the departure problem in air traffic control

NASA Astrophysics Data System (ADS)

Bolender, Michael Alan

Two problems relating to the departure problem in air traffic control automation are examined. The first problem that is addressed is the scheduling of aircraft for departure. The departure operations at a major US hub airport are analyzed, and a discrete event simulation of the departure operations is constructed. Specifically, the case where there is a single departure runway is considered. The runway is fed by two queues of aircraft. Each queue, in turn, is fed by a single taxiway. Two salient areas regarding scheduling are addressed. The first is the construction of optimal departure sequences for the aircraft that are queued. Several greedy search algorithms are designed to minimize the total time to depart a set of queued aircraft. Each algorithm has a different set of heuristic rules to resolve situations within the search space whenever two branches of the search tree with equal edge costs are encountered. These algorithms are then compared and contrasted with a genetic search algorithm in order to assess the performance of the heuristics. This is done in the context of a static departure problem where the length of the departure queue is fixed. A greedy algorithm which deepens the search whenever two branches of the search tree with non-unique costs are encountered is shown to outperform the other heuristic algorithms. This search strategy is then implemented in the discrete event simulation. A baseline performance level is established, and a sensitivity analysis is performed by implementing changes in traffic mix, routing, and miles-in-trail restrictions for comparison. It is concluded that to minimize the average time spent in the queue for different traffic conditions, a queue assignment algorithm is needed to maintain an even balance of aircraft in the queues. A necessary consideration is to base queue assignment upon traffic management restrictions such as miles-in-trail constraints. The second problem addresses the technical challenges associated with merging departure aircraft onto their filed routes in a congested airspace environment. Conflicts between departures and en route aircraft within the Center airspace are analyzed. Speed control, holding the aircraft; at an intermediate altitude, re-routing, and vectoring are posed as possible deconfliction maneuvers. A cost assessment of these merge strategies, which are based upon 4D fight management and conflict detection and resolution principles, is given. Several merge conflicts are studied and a cost for each resolution is computed. It is shown that vectoring tends to be the most expensive resolution technique. Altitude hold is simple, costs less than vectoring, but may require a long time for the aircraft to achieve separation. Re-routing is the simplest, and provides the most cost benefit since the aircraft flies a shorter distance than if it had followed its filed route. Speed control is shown to be ineffective as a means of increasing separation, but is effective for maintaining separation between aircraft. In addition, the affects of uncertainties on the cost are assessed. The analysis shows that cost is invariant with the decision time.

Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks.

PubMed

Li, Xujing; Liu, Anfeng; Xie, Mande; Xiong, Neal N; Zeng, Zhiwen; Cai, Zhiping

2018-04-16

The quality of service (QoS) regarding delay, lifetime and reliability is the key to the application of wireless sensor networks (WSNs). Data aggregation is a method to effectively reduce the data transmission volume and improve the lifetime of a network. In the previous study, a common strategy required that data wait in the queue. When the length of the queue is greater than or equal to the predetermined aggregation threshold ( N t ) or the waiting time is equal to the aggregation timer ( T t ), data are forwarded at the expense of an increase in the delay. The primary contributions of the proposed Adaptive Aggregation Routing (AAR) scheme are the following: (a) the senders select the forwarding node dynamically according to the length of the data queue, which effectively reduces the delay. In the AAR scheme, the senders send data to the nodes with a long data queue. The advantages are that first, the nodes with a long data queue need a small amount of data to perform aggregation; therefore, the transmitted data can be fully utilized to make these nodes aggregate. Second, this scheme balances the aggregating and data sending load; thus, the lifetime increases. (b) An improved AAR scheme is proposed to improve the QoS. The aggregation deadline ( T t ) and the aggregation threshold ( N t ) are dynamically changed in the network. In WSNs, nodes far from the sink have residual energy because these nodes transmit less data than the other nodes. In the improved AAR scheme, the nodes far from the sink have a small value of T t and N t to reduce delay, and the nodes near the sink are set to a large value of T t and N t to reduce energy consumption. Thus, the end to end delay is reduced, a longer lifetime is achieved, and the residual energy is fully used. Simulation results demonstrate that compared with the previous scheme, the performance of the AAR scheme is improved. This scheme reduces the delay by 14.91%, improves the lifetime by 30.91%, and increases energy efficiency by 76.40%.

Effect of the time of day and queue position in the endoscopic schedule on the performance characteristics of endoscopic ultrasound-guided fine-needle aspiration for diagnosing pancreatic malignancies

PubMed Central

Korenblit, Jason; Tholey, Danielle M.; Tolin, Joanna; Loren, David; Kowalski, Thomas; Adler, Douglas G.; Davolos, Julie; Siddiqui, Ali A.

2016-01-01

Background and Objectives: Recent reports have indicated that the time of day may impact the detection rate of abnormal cytology on gynecologic cytology samples. The aim of this study was to determine if procedure time or queue position affected the performance characteristics of endoscopic ultrasound-guided fine-needle aspiration (EUS-FNA) for diagnosing solid pancreatic malignancies. Patients and Methods: We conducted a retrospective study evaluating patients with solid pancreatic lesions in whom EUS-FNA was performed. Three timing variables were evaluated as surrogate markers for endoscopist fatigue: Procedure start times, morning versus afternoon procedures, and endoscopy queue position. Statistical analyses were performed to determine whether the timing variables predicted performance characteristics of EUS-FNA. Results: We identified 609 patients (mean age: 65.8 years, 52.1% males) with solid pancreatic lesions who underwent EUS-FNA. The sensitivity of EUS-FNA was 100% for procedures that started at 7 AM while cases that started at 4 PM had a sensitivity of 81%. Using start time on a continuous scale, each elapsed hour was associated with a 1.9% decrease in EUS-FNA sensitivity (P = 0.003). Similarly, a 10% reduction in EUS-FNA sensitivity was detected between morning and afternoon procedures (92% vs. 82% respectively, P = 0.0006). A linear regression comparing the procedure start time and diagnostic accuracy revealed a decrease of approximately 1.7% in procedure accuracy for every hour later a procedure was started. A 16% reduction in EUS-FNA accuracy was detected between morning and afternoon procedures (100% vs. 84% respectively, P = 0.0009). When the queue position was assessed, a 2.4% reduction in accuracy was noted for each increase in the queue position (P = 0.013). Conclusion: Sensitivity and diagnostic accuracy of EUS-FNA for solid pancreatic lesions decline with progressively later EUS starting times and increasing numbers of procedures before a given EUS, potentially from endoscopist fatigue and cytotechnologist fatigue. PMID:27080605

Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks

PubMed Central

Li, Xujing; Xie, Mande; Zeng, Zhiwen; Cai, Zhiping

2018-01-01

The quality of service (QoS) regarding delay, lifetime and reliability is the key to the application of wireless sensor networks (WSNs). Data aggregation is a method to effectively reduce the data transmission volume and improve the lifetime of a network. In the previous study, a common strategy required that data wait in the queue. When the length of the queue is greater than or equal to the predetermined aggregation threshold (Nt) or the waiting time is equal to the aggregation timer (Tt), data are forwarded at the expense of an increase in the delay. The primary contributions of the proposed Adaptive Aggregation Routing (AAR) scheme are the following: (a) the senders select the forwarding node dynamically according to the length of the data queue, which effectively reduces the delay. In the AAR scheme, the senders send data to the nodes with a long data queue. The advantages are that first, the nodes with a long data queue need a small amount of data to perform aggregation; therefore, the transmitted data can be fully utilized to make these nodes aggregate. Second, this scheme balances the aggregating and data sending load; thus, the lifetime increases. (b) An improved AAR scheme is proposed to improve the QoS. The aggregation deadline (Tt) and the aggregation threshold (Nt) are dynamically changed in the network. In WSNs, nodes far from the sink have residual energy because these nodes transmit less data than the other nodes. In the improved AAR scheme, the nodes far from the sink have a small value of Tt and Nt to reduce delay, and the nodes near the sink are set to a large value of Tt and Nt to reduce energy consumption. Thus, the end to end delay is reduced, a longer lifetime is achieved, and the residual energy is fully used. Simulation results demonstrate that compared with the previous scheme, the performance of the AAR scheme is improved. This scheme reduces the delay by 14.91%, improves the lifetime by 30.91%, and increases energy efficiency by 76.40%. PMID:29659535

Continuous-wave dual-wavelength operation of a distributed feedback laser diode with an external cavity using a volume Bragg grating

NASA Astrophysics Data System (ADS)

Zheng, Yujin; Sekine, Takashi; Kurita, Takashi; Kato, Yoshinori; Kawashima, Toshiyuki

2018-03-01

We demonstrate continuous-wave dual-wavelength operation of a broad-area distributed feedback (DFB) laser diode with a single external-cavity configuration. This high-power DFB laser has a narrow bandwidth (<0.29 nm) and was used as a single-wavelength source. A volume Bragg grating was used as an output coupler for the external-cavity DFB laser to output another stable wavelength beam with a narrow bandwidth of 0.27 nm. A frequency difference for dual-wavelength operation of 0.88 THz was achieved and an output power of up to 415 mW was obtained. The external-cavity DFB laser showed a stable dual-wavelength operation over the practical current and temperature ranges.

Do as I say, not as I do: a survey of public impressions of queue-jumping and preferential access.

PubMed

Friedman, Steven Marc; Schofield, Lee; Tirkos, Sam

2007-10-01

The Canada Health Act legislates that Canadian citizens have access to healthcare that is publicly administered, universal, comprehensive, portable, and accessible (i.e. unimpeded by financial, clinical, or social factors). We surveyed public impressions and practices regarding preferential access to healthcare and queue jumping. Households were randomly selected from the Toronto telephone directory. English speakers aged 18 years or older were solicited for a standardized telephone survey. Statistical analysis was performed using SPSS and SAS. Fifteen percent (n=101) of 668 solicited were surveyed. Ninety-five percent advocated equal access based on need. Support for queue jumping in the emergency department (ED) was strong for cases of emergency, severe pain, and pediatrics, equivocal for police, and minimal for the homeless, doctors, hospital administrators, and government officials. To improve a position on a waiting list, approximately half surveyed would call a friend who is a doctor, works for a doctor, or is a hospital administrator. Sixteen percent reported having done this. The likelihoods of offering material inducement for preferential access were 30 and 51% for low and high-impact medical scenarios, respectively. The likelihoods of offering nonmaterial inducement were 56 and 71%, respectively. Responses were not associated with sex, occupation, or education. Respondents expressed support for equal access based on need. Policy and scenario-type questions elicited different responses. Expressed beliefs may vary from personal practice. Clearly defined and enforced policies at the hospital and provincial level might enhance principles of fairness in the ED queue.

Triage for coronary artery bypass graft surgery in Canada: do patients agree on who should come first?

PubMed

Shufelt, Katy; Chong, Alice; Alter, David A

2007-07-25

The extent to which clinical and non-clinical factors impact on the waiting-list prioritization preferences of patients in the queue is unknown. Using a series of hypothetical scenarios, the objective of this study was to examine the extent to which clinical and non-clinical factors impacted on how patients would prioritize others relative to themselves in the coronary artery bypass surgical queue. Ninety-one consecutive eligible patients awaiting coronary artery bypass grafting surgery at Sunnybrook Health Sciences Centre (median waiting-time duration prior to survey of 8 weeks) were given a self-administered survey consisting of nine scenarios in which clinical and non-clinical characteristic profiles of hypothetical patients (also awaiting coronary artery bypass surgery) were varied. For each scenario, patients were asked where in the queue such hypothetical patients should be placed relative to themselves. The eligible response rate was 65% (59/91). Most respondents put themselves marginally ahead of a hypothetical patient with identical clinical and non-clinical characteristics as themselves. There was a strong tendency for respondents to place patients of higher clinical acuity ahead of themselves in the queue (P < 0.0001). Social independence among young individuals was a positively valued attribute (P < 0.0001), but neither age per se nor financial status, directly impacted on patients waiting-list priority preferences. While patient perceptions generally reaffirmed a bypass surgical triage process based on principals of equity and clinical acuity, the valuation of social independence may justify further debate with regard to the inclusion of non-clinical factors in waiting-list prioritization management systems in Canada, as elsewhere.

Rapid 3D Reconstruction for Image Sequence Acquired from UAV Camera

PubMed Central

Qu, Yufu; Huang, Jianyu; Zhang, Xuan

2018-01-01

In order to reconstruct three-dimensional (3D) structures from an image sequence captured by unmanned aerial vehicles’ camera (UAVs) and improve the processing speed, we propose a rapid 3D reconstruction method that is based on an image queue, considering the continuity and relevance of UAV camera images. The proposed approach first compresses the feature points of each image into three principal component points by using the principal component analysis method. In order to select the key images suitable for 3D reconstruction, the principal component points are used to estimate the interrelationships between images. Second, these key images are inserted into a fixed-length image queue. The positions and orientations of the images are calculated, and the 3D coordinates of the feature points are estimated using weighted bundle adjustment. With this structural information, the depth maps of these images can be calculated. Next, we update the image queue by deleting some of the old images and inserting some new images into the queue, and a structural calculation of all the images can be performed by repeating the previous steps. Finally, a dense 3D point cloud can be obtained using the depth–map fusion method. The experimental results indicate that when the texture of the images is complex and the number of images exceeds 100, the proposed method can improve the calculation speed by more than a factor of four with almost no loss of precision. Furthermore, as the number of images increases, the improvement in the calculation speed will become more noticeable. PMID:29342908

Rapid 3D Reconstruction for Image Sequence Acquired from UAV Camera.

PubMed

Qu, Yufu; Huang, Jianyu; Zhang, Xuan

2018-01-14

In order to reconstruct three-dimensional (3D) structures from an image sequence captured by unmanned aerial vehicles' camera (UAVs) and improve the processing speed, we propose a rapid 3D reconstruction method that is based on an image queue, considering the continuity and relevance of UAV camera images. The proposed approach first compresses the feature points of each image into three principal component points by using the principal component analysis method. In order to select the key images suitable for 3D reconstruction, the principal component points are used to estimate the interrelationships between images. Second, these key images are inserted into a fixed-length image queue. The positions and orientations of the images are calculated, and the 3D coordinates of the feature points are estimated using weighted bundle adjustment. With this structural information, the depth maps of these images can be calculated. Next, we update the image queue by deleting some of the old images and inserting some new images into the queue, and a structural calculation of all the images can be performed by repeating the previous steps. Finally, a dense 3D point cloud can be obtained using the depth-map fusion method. The experimental results indicate that when the texture of the images is complex and the number of images exceeds 100, the proposed method can improve the calculation speed by more than a factor of four with almost no loss of precision. Furthermore, as the number of images increases, the improvement in the calculation speed will become more noticeable.

Improving Block-level Efficiency with scsi-mq

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

Caldwell, Blake A

2015-01-01

Current generation solid-state storage devices are exposing a new bottlenecks in the SCSI and block layers of the Linux kernel, where IO throughput is limited by lock contention, inefficient interrupt handling, and poor memory locality. To address these limitations, the Linux kernel block layer underwent a major rewrite with the blk-mq project to move from a single request queue to a multi-queue model. The Linux SCSI subsystem rework to make use of this new model, known as scsi-mq, has been merged into the Linux kernel and work is underway for dm-multipath support in the upcoming Linux 4.0 kernel. These piecesmore » were necessary to make use of the multi-queue block layer in a Lustre parallel filesystem with high availability requirements. We undertook adding support of the 3.18 kernel to Lustre with scsi-mq and dm-multipath patches to evaluate the potential of these efficiency improvements. In this paper we evaluate the block-level performance of scsi-mq with backing storage hardware representative of a HPC-targerted Lustre filesystem. Our findings show that SCSI write request latency is reduced by as much as 13.6%. Additionally, when profiling the CPU usage of our prototype Lustre filesystem, we found that CPU idle time increased by a factor of 7 with Linux 3.18 and blk-mq as compared to a standard 2.6.32 Linux kernel. Our findings demonstrate increased efficiency of the multi-queue block layer even with disk-based caching storage arrays used in existing parallel filesystems.« less

Cost Optimal Elastic Auto-Scaling in Cloud Infrastructure

NASA Astrophysics Data System (ADS)

Mukhopadhyay, S.; Sidhanta, S.; Ganguly, S.; Nemani, R. R.

2014-12-01

Today, elastic scaling is critical part of leveraging cloud. Elastic scaling refers to adding resources only when it is needed and deleting resources when not in use. Elastic scaling ensures compute/server resources are not over provisioned. Today, Amazon and Windows Azure are the only two platform provider that allow auto-scaling of cloud resources where servers are automatically added and deleted. However, these solution falls short of following key features: A) Requires explicit policy definition such server load and therefore lacks any predictive intelligence to make optimal decision; B) Does not decide on the right size of resource and thereby does not result in cost optimal resource pool. In a typical cloud deployment model, we consider two types of application scenario: A. Batch processing jobs → Hadoop/Big Data case B. Transactional applications → Any application that process continuous transactions (Requests/response) In reference of classical queuing model, we are trying to model a scenario where servers have a price and capacity (size) and system can add delete servers to maintain a certain queue length. Classical queueing models applies to scenario where number of servers are constant. So we cannot apply stationary system analysis in this case. We investigate the following questions 1. Can we define Job queue and use the metric to define such a queue to predict the resource requirement in a quasi-stationary way? Can we map that into an optimal sizing problem? 2. Do we need to get into a level of load (CPU/Data) on server level to characterize the size requirement? How do we learn that based on Job type?

Event-Driven Messaging for Offline Data Quality Monitoring at ATLAS

NASA Astrophysics Data System (ADS)

Onyisi, Peter

2015-12-01

During LHC Run 1, the information flow through the offline data quality monitoring in ATLAS relied heavily on chains of processes polling each other's outputs for handshaking purposes. This resulted in a fragile architecture with many possible points of failure and an inability to monitor the overall state of the distributed system. We report on the status of a project undertaken during the LHC shutdown to replace the ad hoc synchronization methods with a uniform message queue system. This enables the use of standard protocols to connect processes on multiple hosts; reliable transmission of messages between possibly unreliable programs; easy monitoring of the information flow; and the removal of inefficient polling-based communication.

A Three-Level Analysis of Collaborative Learning in Dual-Interaction Spaces

ERIC Educational Resources Information Center

Lonchamp, Jacques

2009-01-01

CSCL systems which follow the dual-interaction spaces paradigm support the synchronous construction and discussion of shared artifacts by distributed or colocated small groups of learners. The most recent generic dual-interaction space environments, either model based or component based, can be deeply customized by teachers for supporting…

Tutorial in medical decision modeling incorporating waiting lines and queues using discrete event simulation.

PubMed

Jahn, Beate; Theurl, Engelbert; Siebert, Uwe; Pfeiffer, Karl-Peter

2010-01-01

In most decision-analytic models in health care, it is assumed that there is treatment without delay and availability of all required resources. Therefore, waiting times caused by limited resources and their impact on treatment effects and costs often remain unconsidered. Queuing theory enables mathematical analysis and the derivation of several performance measures of queuing systems. Nevertheless, an analytical approach with closed formulas is not always possible. Therefore, simulation techniques are used to evaluate systems that include queuing or waiting, for example, discrete event simulation. To include queuing in decision-analytic models requires a basic knowledge of queuing theory and of the underlying interrelationships. This tutorial introduces queuing theory. Analysts and decision-makers get an understanding of queue characteristics, modeling features, and its strength. Conceptual issues are covered, but the emphasis is on practical issues like modeling the arrival of patients. The treatment of coronary artery disease with percutaneous coronary intervention including stent placement serves as an illustrative queuing example. Discrete event simulation is applied to explicitly model resource capacities, to incorporate waiting lines and queues in the decision-analytic modeling example.

Oracle Applications Patch Administration Tool (PAT) Beta Version

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

2002-01-04

PAT is a Patch Administration Tool that provides analysis, tracking, and management of Oracle Application patches. This includes capabilities as outlined below: Patch Analysis & Management Tool Outline of capabilities: Administration Patch Data Maintenance -- track Oracle Application patches applied to what database instance & machine Patch Analysis capture text files (readme.txt and driver files) form comparison detail report comparison detail PL/SQL package comparison detail SQL scripts detail JSP module comparison detail Parse and load the current applptch.txt (10.7) or load patch data from Oracle Application database patch tables (11i) Display Analysis -- Compare patch to be applied with currentmore » Oracle Application installed Appl_top code versions Patch Detail Module comparison detail Analyze and display one Oracle Application module patch. Patch Management -- automatic queue and execution of patches Administration Parameter maintenance -- setting for directory structure of Oracle Application appl_top Validation data maintenance -- machine names and instances to patch Operation Patch Data Maintenance Schedule a patch (queue for later execution) Run a patch (queue for immediate execution) Review the patch logs Patch Management Reports« less

Management of demand in the NHS, including the effects of queues and pensioners.

PubMed

Groocock, J

1999-01-01

Discusses the methods used in the NHS to bring demand into balance with supply. People with minor illnesses try self-treatments and alternative medicine. Systematic programs to identify ill people are applied to only a few illnesses. Waiting lists for elective surgery cause some richer people to take their demand to private hospitals. An analysis of such waiting lists shows that, other than this, queues are not a method of rationing but are just the effect of bad management of the actual methods, which are then discussed. The same methods are used to ration access to specialist physicians. Providing extra resources would eliminate queues only if another condition was satisfied. It is argued that providing fully adequate medical care for patients of working age, although expensive, might produce a net economic gain, whereas all care for pensioners, including medical care, gives a net economic loss. Therefore it may not be sensible for people to have inadequate medical care for the first 65 years of their lives just because it is economically impracticable for them to have fully adequate medical care when they are pensioners.

Queueing-Based Synchronization and Entrainment for Synthetic Gene Oscillators

NASA Astrophysics Data System (ADS)

Mather, William; Butzin, Nicholas; Hochendoner, Philip; Ogle, Curtis

Synthetic gene oscillators have been a major focus of synthetic biology research since the beginning of the field 15 years ago. They have proven to be useful both for biotechnological applications as well as a testing ground to significantly develop our understanding of the design principles behind synthetic and native gene oscillators. In particular, the principles governing synchronization and entrainment of biological oscillators have been explored using a synthetic biology approach. Our work combines experimental and theoretical approaches to specifically investigate how a bottleneck for protein degradation, which is present in most if not all existing synthetic oscillators, can be leveraged to robustly synchronize and entrain biological oscillators. We use both the terminology and mathematical tools of queueing theory to intuitively explain the role of this bottleneck in both synchronization and entrainment, which extends prior work demonstrating the usefulness of queueing theory in synthetic and native gene circuits. We conclude with an investigation of how synchronization and entrainment may be sensitive to the presence of multiple proteolytic pathways in a cell that couple weakly through crosstalk. This work was supported by NSF Grant #1330180.

A microprocessor based high speed packet switch for satellite communications

NASA Technical Reports Server (NTRS)

Arozullah, M.; Crist, S. C.

1980-01-01

The architectures of a single processor, a three processor, and a multiple processor system are described. The hardware circuits, and software routines required for implementing the three and multiple processor designs are presented. A bit-slice microprocessor was designed and microprogrammed. Maximum throughput was calculated for all three designs. Queue theoretic models for these three designs were developed and utilized to obtain analytical expressions for the average waiting times, overall average response times and average queue sizes. From these expressions, graphs were obtained showing the effect on the system performance of a number of design parameters.

Heterogeneously integrated III-V/silicon dual-mode distributed feedback laser array for terahertz generation.

PubMed

Shao, Haifeng; Keyvaninia, Shahram; Vanwolleghem, Mathias; Ducournau, Guillaume; Jiang, Xiaoqing; Morthier, Geert; Lampin, Jean-Francois; Roelkens, Gunther

2014-11-15

We demonstrate an integrated distributed feedback (DFB) laser array as a dual-wavelength source for narrowband terahertz (THz) generation. The laser array is composed of four heterogeneously integrated III-V-on-silicon DFB lasers with different lengths enabling dual-mode lasing tolerant to process variations, bias fluctuations, and ambient temperature variations. By optical heterodyning the two modes emitted by the dual-wavelength DFB laser in the laser array using a THz photomixer composed of an uni-traveling carrier photodiode (UTC-PD), a narrow and stable carrier signal with a frequency of 0.357 THz is generated. The central operating frequency and the emitted terahertz wave linewidth are analyzed, along with their dependency on the bias current applied to the laser diode and ambient temperature.

Cross Validation of Rain Drop Size Distribution between GPM and Ground Based Polarmetric radar

NASA Astrophysics Data System (ADS)

Chandra, C. V.; Biswas, S.; Le, M.; Chen, H.

2017-12-01

Dual-frequency precipitation radar (DPR) on board the Global Precipitation Measurement (GPM) core satellite has reflectivity measurements at two independent frequencies, Ku- and Ka- band. Dual-frequency retrieval algorithms have been developed traditionally through forward, backward, and recursive approaches. However, these algorithms suffer from "dual-value" problem when they retrieve medium volume diameter from dual-frequency ratio (DFR) in rain region. To this end, a hybrid method has been proposed to perform raindrop size distribution (DSD) retrieval for GPM using a linear constraint of DSD along rain profile to avoid "dual-value" problem (Le and Chandrasekar, 2015). In the current GPM level 2 algorithm (Iguchi et al. 2017- Algorithm Theoretical Basis Document) the Solver module retrieves a vertical profile of drop size distributionn from dual-frequency observations and path integrated attenuations. The algorithm details can be found in Seto et al. (2013) . On the other hand, ground based polarimetric radars have been used for a long time to estimate drop size distributions (e.g., Gorgucci et al. 2002 ). In addition, coincident GPM and ground based observations have been cross validated using careful overpass analysis. In this paper, we perform cross validation on raindrop size distribution retrieval from three sources, namely the hybrid method, the standard products from the solver module and DSD retrievals from ground polarimetric radars. The results are presented from two NEXRAD radars located in Dallas -Fort Worth, Texas (i.e., KFWS radar) and Melbourne, Florida (i.e., KMLB radar). The results demonstrate the ability of DPR observations to produce DSD estimates, which can be used subsequently to generate global DSD maps. References: Seto, S., T. Iguchi, T. Oki, 2013: The basic performance of a precipitation retrieval algorithm for the Global Precipitation Measurement mission's single/dual-frequency radar measurements. IEEE Transactions on Geoscience and Remote Sensing, 51(12), 5239-5251. Gorgucci, E., Chandrasekar, V., Bringi, V. N., and Scarchilli, G.: Estimation of Raindrop Size Distribution Parameters from Polarimetric Radar Measurements, J. Atmos. Sci., 59, 2373-2384, doi:10.1175/1520-0469(2002)0592.0.CO;2, 2002.

Dual-resolution dose assessments for proton beamlet using MCNPX 2.6.0

NASA Astrophysics Data System (ADS)

Chao, T. C.; Wei, S. C.; Wu, S. W.; Tung, C. J.; Tu, S. J.; Cheng, H. W.; Lee, C. C.

2015-11-01

The purpose of this study is to access proton dose distribution in dual resolution phantoms using MCNPX 2.6.0. The dual resolution phantom uses higher resolution in Bragg peak, area near large dose gradient, or heterogeneous interface and lower resolution in the rest. MCNPX 2.6.0 was installed in Ubuntu 10.04 with MPI for parallel computing. FMesh1 tallies were utilized to record the energy deposition which is a special designed tally for voxel phantoms that converts dose deposition from fluence. 60 and 120 MeV narrow proton beam were incident into Coarse, Dual and Fine resolution phantoms with pure water, water-bone-water and water-air-water setups. The doses in coarse resolution phantoms are underestimated owing to partial volume effect. The dose distributions in dual or high resolution phantoms agreed well with each other and dual resolution phantoms were at least 10 times more efficient than fine resolution one. Because the secondary particle range is much longer in air than in water, the dose of low density region may be under-estimated if the resolution or calculation grid is not small enough.

A Web-based Distributed Voluntary Computing Platform for Large Scale Hydrological Computations

NASA Astrophysics Data System (ADS)

Demir, I.; Agliamzanov, R.

2014-12-01

Distributed volunteer computing can enable researchers and scientist to form large parallel computing environments to utilize the computing power of the millions of computers on the Internet, and use them towards running large scale environmental simulations and models to serve the common good of local communities and the world. Recent developments in web technologies and standards allow client-side scripting languages to run at speeds close to native application, and utilize the power of Graphics Processing Units (GPU). Using a client-side scripting language like JavaScript, we have developed an open distributed computing framework that makes it easy for researchers to write their own hydrologic models, and run them on volunteer computers. Users will easily enable their websites for visitors to volunteer sharing their computer resources to contribute running advanced hydrological models and simulations. Using a web-based system allows users to start volunteering their computational resources within seconds without installing any software. The framework distributes the model simulation to thousands of nodes in small spatial and computational sizes. A relational database system is utilized for managing data connections and queue management for the distributed computing nodes. In this paper, we present a web-based distributed volunteer computing platform to enable large scale hydrological simulations and model runs in an open and integrated environment.

Lunar and Artificial Satellite Laser Ranging: The Use of Queue Scheduling and Worth Functions to Maximize Scientific Results

NASA Astrophysics Data System (ADS)

Shelus, P. J.; Ricklefs, R. L.; Wiant, J. R.; Ries, J. G.

2003-08-01

The lunar and artificial satellite laser ranging network, part of the International Laser Ranging Service, monitors a large number of targets. Many scientific disciplines are investigated using these data. These include the realization and maintenance of the International Terrestrial Reference Frame; the 3-dimensional deformation of the solid Earth; Earth orientation; variations in the topography and volume of the liquid Earth, including ocean circulation, mean sea level, ice sheet thickness, and wave heights; tidally generated variations in atmospheric mass distribution; calibration of microwave tracking techniques; picosecond global time transfer; determination of the dynamic equinox, the obliquity of the ecliptic, the precession constant and theories of nutation; gravitational and general relativistic studies, including Einstein's Equivalence Principle, the Robertson-Walker b parameter and time rate of change of the gravitational constant; lunar physics, including the dissipation of rotational energy, shape of the core-mantle boundary (Love Number k2), and free librations and their stimulating mechanisms; Solar System ties to the International Celestial Reference Frame. With shrinking resources, we must not only assess specific data requirements for each target, but also maximize the efficiency of the observing network. Several factors must be considered. First, not only does a result depend critically upon the quality and quantity of the data, it also depends upon the data distribution. Second, as technology improves, the cost of obtaining data can increase. Both require that scientific endeavor pay close attention to the manner in which the data is gathered. We examine the evolution of the laser network, using data analysis requirements and efficient network scheduling to maximize the scientific return. This requires an understanding of the observing equipment, as well as the scientific principles being studied. Queue scheduling and worth functions become important. This work is funded by: NSF AST-0204127, NASA NAG5-10195, NAS5-01096, NAG5-11464.

Dynamic measurement of fluorescent proteins spectral distribution on virus infected cells

NASA Astrophysics Data System (ADS)

Lee, Ja-Yun; Wu, Ming-Xiu; Kao, Chia-Yun; Wu, Tzong-Yuan; Hsu, I.-Jen

2006-09-01

We constructed a dynamic spectroscopy system that can simultaneously measure the intensity and spectral distributions of samples with multi-fluorophores in a single scan. The system was used to monitor the fluorescence distribution of cells infected by the virus, which is constructed by a recombinant baculoviruses, vAcD-Rhir-E, containing the red and green fluorescent protein gene that can simultaneously produce dual fluorescence in recombinant virus-infected Spodoptera frugiperda 21 cells (Sf21) under the control of a polyhedrin promoter. The system was composed of an excitation light source, a scanning system and a spectrometer. We also developed an algorithm and fitting process to analyze the pattern of fluorescence distribution of the dual fluorescence produced in the recombinant virus-infected cells. All the algorithm and calculation are automatically processed in a visualized scanning program and can monitor the specific region of sample by calculating its intensity distribution. The spectral measurement of each pixel was performed at millisecond range and the two dimensional distribution of full spectrum was recorded within several seconds. We have constructed a dynamic spectroscopy system to monitor the process of virus-infection of cells. The distributions of the dual fluorescence were simultaneously measured at micrometer resolution.

Modeling and control of fuel distribution in a dual-fuel internal combustion engine leveraging late intake valve closings

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

Kassa, Mateos; Hall, Carrie; Ickes, Andrew

Advanced internal combustion engines, although generally more efficient than conventional combustion engines, often encounter limitations in multi-cylinder applications due to variations in the combustion process encountered across cylinders and between cycles. This study leverages experimental data from an inline 6-cylinder heavy-duty dual fuel engine equipped with exhaust gas recirculation (EGR), a variable geometry turbocharger, and a fully-flexible variable intake valve actuation system to study cylinder-to-cylinder variations in power production and the underlying uneven fuel distribution that causes these variations. The engine is operated with late intake valve closure timings in a dual-fuel combustion mode in which a high reactivity fuelmore » is directly injected into the cylinders and a low reactivity fuel is port injected into the cylinders. Both dual fuel implementation and late intake valve closing (IVC) timings have been shown to improve thermal efficiency. However, experimental data from this study reveal that when late IVC timings are used on a multi-cylinder dual fuel engine a significant variation in IMEP across cylinders results and as such, leads to efficiency losses. The difference in IMEP between the different cylinders ranges from 9% at an IVC of 570°ATDC to 38% at an IVC of 610°ATDC and indicates an increasingly uneven fuel distribution. These experimental observations along with engine simulation models developed using GT-Power have been used to better understand the distribution of the port injected fuel across cylinders under various operating conditions on such dual fuel engines. This study revealed that the fuel distribution across cylinders in this dual fuel application is significantly affected by changes in the effective compression ratio as determined by the intake valve close timing as well as the design of the intake system (specifically the length of the intake runners). Late intake valve closures allow a portion of the trapped air and port injected fuel to flow back out of the cylinders into the intake manifold. The fuel that is pushed back in the intake manifold is then unevenly redistributed across the cylinders largely due to the dominating direction of the flow in the intake manifold. The effects of IVC as well as the impact of intake runner length on fuel distribution were quantitatively analyzed and a model was developed that can be used to accurately predict the fuel distribution of the port injected fuel at different operating conditions with an average estimation error of 1.5% in cylinder-specific fuel flow.« less

Triage for coronary artery bypass graft surgery in Canada: Do patients agree on who should come first?

PubMed Central

Shufelt, Katy; Chong, Alice; Alter, David A

2007-01-01

Background The extent to which clinical and non-clinical factors impact on the waiting-list prioritization preferences of patients in the queue is unknown. Using a series of hypothetical scenarios, the objective of this study was to examine the extent to which clinical and non-clinical factors impacted on how patients would prioritize others relative to themselves in the coronary artery bypass surgical queue. Methods Ninety-one consecutive eligible patients awaiting coronary artery bypass grafting surgery at Sunnybrook Health Sciences Centre (median waiting-time duration prior to survey of 8 weeks) were given a self-administered survey consisting of nine scenarios in which clinical and non-clinical characteristic profiles of hypothetical patients (also awaiting coronary artery bypass surgery) were varied. For each scenario, patients were asked where in the queue such hypothetical patients should be placed relative to themselves. Results The eligible response rate was 65% (59/91). Most respondents put themselves marginally ahead of a hypothetical patient with identical clinical and non-clinical characteristics as themselves. There was a strong tendency for respondents to place patients of higher clinical acuity ahead of themselves in the queue (P < 0.0001). Social independence among young individuals was a positively valued attribute (P < 0.0001), but neither age per se nor financial status, directly impacted on patients waiting-list priority preferences. Conclusion While patient perceptions generally reaffirmed a bypass surgical triage process based on principals of equity and clinical acuity, the valuation of social independence may justify further debate with regard to the inclusion of non-clinical factors in waiting-list prioritization management systems in Canada, as elsewhere. PMID:17651503

A generic method for evaluating crowding in the emergency department.

PubMed

Eiset, Andreas Halgreen; Erlandsen, Mogens; Møllekær, Anders Brøns; Mackenhauer, Julie; Kirkegaard, Hans

2016-06-14

Crowding in the emergency department (ED) has been studied intensively using complicated non-generic methods that may prove difficult to implement in a clinical setting. This study sought to develop a generic method to describe and analyse crowding from measurements readily available in the ED and to test the developed method empirically in a clinical setting. We conceptualised a model with ED patient flow divided into separate queues identified by timestamps for predetermined events. With temporal resolution of 30 min, queue lengths were computed as Q(t + 1) = Q(t) + A(t) - D(t), with A(t) = number of arrivals, D(t) = number of departures and t = time interval. Maximum queue lengths for each shift of each day were found and risks of crowding computed. All tests were performed using non-parametric methods. The method was applied in the ED of Aarhus University Hospital, Denmark utilising an open cohort design with prospectively collected data from a one-year observation period. By employing the timestamps already assigned to the patients while in the ED, a generic queuing model can be computed from which crowding can be described and analysed in detail. Depending on availability of data, the model can be extended to include several queues increasing the level of information. When applying the method empirically, 41,693 patients were included. The studied ED had a high risk of bed occupancy rising above 100 % during day and evening shift, especially on weekdays. Further, a 'carry over' effect was shown between shifts and days. The presented method offers an easy and generic way to get detailed insight into the dynamics of crowding in an ED.

Rapid production of optimal-quality reduced-resolution representations of very large databases

DOEpatents

Sigeti, David E.; Duchaineau, Mark; Miller, Mark C.; Wolinsky, Murray; Aldrich, Charles; Mineev-Weinstein, Mark B.

2001-01-01

View space representation data is produced in real time from a world space database representing terrain features. The world space database is first preprocessed. A database is formed having one element for each spatial region corresponding to a finest selected level of detail. A multiresolution database is then formed by merging elements and a strict error metric is computed for each element at each level of detail that is independent of parameters defining the view space. The multiresolution database and associated strict error metrics are then processed in real time for real time frame representations. View parameters for a view volume comprising a view location and field of view are selected. The error metric with the view parameters is converted to a view-dependent error metric. Elements with the coarsest resolution are chosen for an initial representation. Data set first elements from the initial representation data set are selected that are at least partially within the view volume. The first elements are placed in a split queue ordered by the value of the view-dependent error metric. If the number of first elements in the queue meets or exceeds a predetermined number of elements or whether the largest error metric is less than or equal to a selected upper error metric bound, the element at the head of the queue is force split and the resulting elements are inserted into the queue. Force splitting is continued until the determination is positive to form a first multiresolution set of elements. The first multiresolution set of elements is then outputted as reduced resolution view space data representing the terrain features.

Performance evaluation of Platform Data ManagementSystem under various degrees of protocol implementation

NASA Technical Reports Server (NTRS)

Arozullah, Mohammed

1991-01-01

The Platform Data Management System (DMS) collects Housekeeping (H/K), Payload (P/L) Engineering, and Payload Science data from various subsystems and payloads on the platform for transmission to the ground through the downlink via TDRSS. The DMS also distributes command data received from the ground to various subsystems and payloads. In addition, DMS distributes timing and safemode data. The function of collection and distribution of various types of data is performed by the Command and Data Handling (C&DH) subsystem of DMS. The C&DH subsystem uses for this purpose a number of data buses namely, Housekeeping, Payload Engineering, Payload Science, and Time and Safemode buses. Out of these buses, the H/K, P/L Engineering, and P/L Science buses are planned to be implemented by using MIL-STD 1553 bus. Most of the period covered was spent in developing a queue theoretic model of the 1553 Bus as used in the DMS. The aim is to use this model to test the performance and suitability of the 1553 Bus to the DMS under a number of alternative design scenarios.

78 FR 23335 - Energy Conservation Program: Energy Conservation Standards for Distribution Transformers

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-18

... Basic Impulse Level 4. Dual/Multiple-Voltage Primary Windings 5. Dual/Multiple-Voltage Secondary Windings 6. Loading B. Technological Feasibility 1. General 2. Maximum Technologically Feasible Levels C...

Performance of a distributed simultaneous strain and temperature sensor based on a Fabry-Perot laser diode and a dual-stage FBG optical demultiplexer.

PubMed

Kim, Suhwan; Kwon, Hyungwoo; Yang, Injae; Lee, Seungho; Kim, Jeehyun; Kang, Shinwon

2013-11-12

A simultaneous strain and temperature measurement method using a Fabry-Perot laser diode (FP-LD) and a dual-stage fiber Bragg grating (FBG) optical demultiplexer was applied to a distributed sensor system based on Brillouin optical time domain reflectometry (BOTDR). By using a Kalman filter, we improved the performance of the FP-LD based OTDR, and decreased the noise using the dual-stage FBG optical demultiplexer. Applying the two developed components to the BOTDR system and using a temperature compensating algorithm, we successfully demonstrated the simultaneous measurement of strain and temperature distributions under various experimental conditions. The observed errors in the temperature and strain measured using the developed sensing system were 0.6 °C and 50 με, and the spatial resolution was 1 m, respectively.

Method, apparatus and system for managing queue operations of a test bench environment

DOEpatents

Ostler, Farrell Lynn

2016-07-19

Techniques and mechanisms for performing dequeue operations for agents of a test bench environment. In an embodiment, a first group of agents are each allocated a respective ripe reservation and a second set of agents are each allocated a respective unripe reservation. Over time, queue management logic allocates respective reservations to agents and variously changes one or more such reservations from unripe to ripe. In another embodiment, an order of servicing agents allocated unripe reservations is based on relative priorities of the unripe reservations with respect to one another. An order of servicing agents allocated ripe reservations is on a first come, first served basis.

The willingness to pay for wait reduction: the disutility of queues for cataract surgery in Canada, Denmark, and Spain.

PubMed

Bishai, D M; Lang, H C

2000-03-01

We estimate demand curves for a one month reduction in waiting time for cataract surgery based on survey data collected in 1992 in Manitoba, Barcelona, and Denmark. Patients answered, "Would you be willing to pay [Bid, B] to reduce your waiting time for cataract surgery to less than one month?" Controlling for SES and visual status, Barcelonan patients have greater WTP for shortened waiting time than the Danes and Manitobans. We estimate the value (in 1992 $) of lost consumer surplus due to the cataract surgery queue at $128 per patient in Manitoba, $160 in Denmark, and $243 in Barcelona.

Event management for large scale event-driven digital hardware spiking neural networks.

PubMed

Caron, Louis-Charles; D'Haene, Michiel; Mailhot, Frédéric; Schrauwen, Benjamin; Rouat, Jean

2013-09-01

The interest in brain-like computation has led to the design of a plethora of innovative neuromorphic systems. Individually, spiking neural networks (SNNs), event-driven simulation and digital hardware neuromorphic systems get a lot of attention. Despite the popularity of event-driven SNNs in software, very few digital hardware architectures are found. This is because existing hardware solutions for event management scale badly with the number of events. This paper introduces the structured heap queue, a pipelined digital hardware data structure, and demonstrates its suitability for event management. The structured heap queue scales gracefully with the number of events, allowing the efficient implementation of large scale digital hardware event-driven SNNs. The scaling is linear for memory, logarithmic for logic resources and constant for processing time. The use of the structured heap queue is demonstrated on a field-programmable gate array (FPGA) with an image segmentation experiment and a SNN of 65,536 neurons and 513,184 synapses. Events can be processed at the rate of 1 every 7 clock cycles and a 406×158 pixel image is segmented in 200 ms. Copyright © 2013 Elsevier Ltd. All rights reserved.

Markovian queue optimisation analysis with an unreliable server subject to working breakdowns and impatient customers

NASA Astrophysics Data System (ADS)

Liou, Cheng-Dar

2015-09-01

This study investigates an infinite capacity Markovian queue with a single unreliable service station, in which the customers may balk (do not enter) and renege (leave the queue after entering). The unreliable service station can be working breakdowns even if no customers are in the system. The matrix-analytic method is used to compute the steady-state probabilities for the number of customers, rate matrix and stability condition in the system. The single-objective model for cost and bi-objective model for cost and expected waiting time are derived in the system to fit in with practical applications. The particle swarm optimisation algorithm is implemented to find the optimal combinations of parameters in the pursuit of minimum cost. Two different approaches are used to identify the Pareto optimal set and compared: the epsilon-constraint method and non-dominate sorting genetic algorithm. Compared results allow using the traditional optimisation approach epsilon-constraint method, which is computationally faster and permits a direct sensitivity analysis of the solution under constraint or parameter perturbation. The Pareto front and non-dominated solutions set are obtained and illustrated. The decision makers can use these to improve their decision-making quality.

Excitable toxin-antitoxin modules coordinated through intracellular bottlenecks

NASA Astrophysics Data System (ADS)

Mather, William

Chronic infections and pathogenic biofilms present a serious threat to the health of humans by decreasing life expectancy and quality. The resilience of these microbial communities has been attributed to the spontaneous formation of persister cells, which constitute a small fraction of the population capable of surviving a wide range of environmental stressors. Gating of bacterial persistence has recently been linked to toxin-antitoxin (TA) modules, which are operons with an evolutionarily conserved motif that includes a toxin that halts cell growth and a corresponding antitoxin that neutralizes the toxin. While many such modules have been identified and studied in a wide range of organisms, little consideration of the interactions between multiple modules within a single host has been made. Moreover, the multitude of different antitoxin species are degraded by a relatively small number of proteolytic pathways, strongly suggesting competition between antitoxins for degradation machinery, i.e. queueing coupling. Here we present a theoretical understanding of the dynamics of multiple TA modules that are coupled through either proteolytic queueing, a toxic effect on cell growth rate, or both. We conclude that indirect queueing coordination between multiple TA modules may be central to controlling bacterial persistence. NSF Award Number MCB-1330180.

The cloud paradigm applied to e-Health.

PubMed

Vilaplana, Jordi; Solsona, Francesc; Abella; Filgueira, Rosa; Rius, Josep

2013-03-14

Cloud computing is a new paradigm that is changing how enterprises, institutions and people understand, perceive and use current software systems. With this paradigm, the organizations have no need to maintain their own servers, nor host their own software. Instead, everything is moved to the cloud and provided on demand, saving energy, physical space and technical staff. Cloud-based system architectures provide many advantages in terms of scalability, maintainability and massive data processing. We present the design of an e-health cloud system, modelled by an M/M/m queue with QoS capabilities, i.e. maximum waiting time of requests. Detailed results for the model formed by a Jackson network of two M/M/m queues from the queueing theory perspective are presented. These results show a significant performance improvement when the number of servers increases. Platform scalability becomes a critical issue since we aim to provide the system with high Quality of Service (QoS). In this paper we define an architecture capable of adapting itself to different diseases and growing numbers of patients. This platform could be applied to the medical field to greatly enhance the results of those therapies that have an important psychological component, such as addictions and chronic diseases.

14 CFR 23.511 - Ground load; unsymmetrical loads on multiple-wheel units.

Code of Federal Regulations, 2010 CFR

2010-01-01

..., DEPARTMENT OF TRANSPORTATION AIRCRAFT AIRWORTHINESS STANDARDS: NORMAL, UTILITY, ACROBATIC, AND COMMUTER... distribution, to the dual wheels and tires in each dual wheel landing gear unit. (c) Deflated tire loads. For...

Cool & Dry: Dual-Path Approach for a Florida School.

ERIC Educational Resources Information Center

Khattar, Mukesh; Shirey, Don, III; Raustad, Richard

2003-01-01

Describes how the Brevard County School District in Florida teamed with companies EPRI and Florida Power and Light to implement a dual-path, low temperature air-distribution system used in conjunction with thermal energy storage. (EV)

Comparison of Traditional and Open-Access Appointment Scheduling for Exponentially Distributed Service Time.

PubMed

Yan, Chongjun; Tang, Jiafu; Jiang, Bowen; Fung, Richard Y K

2015-01-01

This paper compares the performance measures of traditional appointment scheduling (AS) with those of an open-access appointment scheduling (OA-AS) system with exponentially distributed service time. A queueing model is formulated for the traditional AS system with no-show probability. The OA-AS models assume that all patients who call before the session begins will show up for the appointment on time. Two types of OA-AS systems are considered: with a same-session policy and with a same-or-next-session policy. Numerical results indicate that the superiority of OA-AS systems is not as obvious as those under deterministic scenarios. The same-session system has a threshold of relative waiting cost, after which the traditional system always has higher total costs, and the same-or-next-session system is always preferable, except when the no-show probability or the weight of patients' waiting is low. It is concluded that open-access policies can be viewed as alternative approaches to mitigate the negative effects of no-show patients.

Communication library for run-time visualization of distributed, asynchronous data

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

Rowlan, J.; Wightman, B.T.

1994-04-01

In this paper we present a method for collecting and visualizing data generated by a parallel computational simulation during run time. Data distributed across multiple processes is sent across parallel communication lines to a remote workstation, which sorts and queues the data for visualization. We have implemented our method in a set of tools called PORTAL (for Parallel aRchitecture data-TrAnsfer Library). The tools comprise generic routines for sending data from a parallel program (callable from either C or FORTRAN), a semi-parallel communication scheme currently built upon Unix Sockets, and a real-time connection to the scientific visualization program AVS. Our methodmore » is most valuable when used to examine large datasets that can be efficiently generated and do not need to be stored on disk. The PORTAL source libraries, detailed documentation, and a working example can be obtained by anonymous ftp from info.mcs.anl.gov from the file portal.tar.Z from the directory pub/portal.« less

Monolithic dual-mode distributed feedback semiconductor laser for tunable continuous-wave terahertz generation.

PubMed

Kim, Namje; Shin, Jaeheon; Sim, Eundeok; Lee, Chul Wook; Yee, Dae-Su; Jeon, Min Yong; Jang, Yudong; Park, Kyung Hyun

2009-08-03

We report on a monolithic dual-mode semiconductor laser operating in the 1550-nm range as a compact optical beat source for tunable continuous-wave (CW) terahertz (THz) generation. It consists of two distributed feedback (DFB) laser sections and one phase section between them. Each wavelength of the two modes can be independently tuned by adjusting currents in micro-heaters which are fabricated on the top of the each DFB section. The continuous tuning of the CW THz emission from Fe(+)-implanted InGaAs photomixers is successfully demonstrated using our dual-mode laser as the excitation source. The CW THz frequency is continuously tuned from 0.17 to 0.49 THz.

Engine performance analysis and optimization of a dual-mode scramjet with varied inlet conditions

NASA Astrophysics Data System (ADS)

Tian, Lu; Chen, Li-Hong; Chen, Qiang; Zhong, Feng-Quan; Chang, Xin-Yu

2016-02-01

A dual-mode scramjet can operate in a wide range of flight conditions. Higher thrust can be generated by adopting suitable combustion modes. Based on the net thrust, an analysis and preliminary optimal design of a kerosene-fueled parameterized dual-mode scramjet at a crucial flight Mach number of 6 were investigated by using a modified quasi-one-dimensional method and simulated annealing strategy. Engine structure and heat release distributions, affecting the engine thrust, were chosen as analytical parameters for varied inlet conditions (isolator entrance Mach number: 1.5-3.5). Results show that different optimal heat release distributions and structural conditions can be obtained at five different inlet conditions. The highest net thrust of the parameterized dual-mode engine can be achieved by a subsonic combustion mode at an isolator entrance Mach number of 2.5. Additionally, the effects of heat release and scramjet structure on net thrust have been discussed. The present results and the developed analytical method can provide guidance for the design and optimization of high-performance dual-mode scramjets.

Ultrasound waiting lists: rational queue or extended capacity?

PubMed

Brasted, Christopher

2008-06-01

The features and issues regarding clinical waiting lists in general and general ultrasound waiting lists in particular are reviewed, and operational aspects of providing a general ultrasound service are also discussed. A case study is presented describing a service improvement intervention in a UK NHS hospital's ultrasound department, from which arises requirements for a predictive planning model for an ultrasound waiting list. In the course of this, it becomes apparent that a booking system is a more appropriate way of describing the waiting list than a conventional queue. Distinctive features are identified from the literature and the case study as the basis for a predictive model, and a discrete event simulation model is presented which incorporates the distinctive features.

Energy-saving EPON Bandwidth Allocation Algorithm Supporting ONU's Sleep Mode

NASA Astrophysics Data System (ADS)

Zhang, Yinfa; Ren, Shuai; Liao, Xiaomin; Fang, Yuanyuan

2014-09-01

A new bandwidth allocation algorithm was presented by combining merits of the IPACT algorithm and the cyclic DBA algorithm based on the DBA algorithm for ONU's sleep mode. Simulation results indicate that compared with the normal mode ONU, the ONU's sleep mode can save about 74% of energy. The new algorithm has a smaller average packet delay and queue length in the upstream direction. While in the downstream direction, the average packet delay of the new algorithm is less than polling cycle Tcycle and the average queue length is less than the product of Tcycle and the maximum link rate. The new algorithm achieves a better compromise between energy-saving and ensuring quality of service.

Modeling and simulation of queuing system for customer service improvement: A case study

NASA Astrophysics Data System (ADS)

Xian, Tan Chai; Hong, Chai Weng; Hawari, Nurul Nazihah

2016-10-01

This study aims to develop a queuing model at UniMall by using discrete event simulation approach in analyzing the service performance that affects customer satisfaction. The performance measures that considered in this model are such as the average time in system, the total number of student served, the number of student in waiting queue, the waiting time in queue as well as the maximum length of buffer. ARENA simulation software is used to develop a simulation model and the output is analyzed. Based on the analysis of output, it is recommended that management of UniMall consider introducing shifts and adding another payment counter in the morning.

Dual use of distributed remote sensing satellites

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

Canavan, G.H.

1992-12-02

Satellites can serve both defense and the environment, simultaneously monitoring preparations for aggression, the environment, pollution, and natural disasters. These applications have been discussed extensively in international meetings, which have produced specific projects for cooperation and growing acceptance of dual-use concepts.

Dual use of distributed remote sensing satellites

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

Canavan, G.H.

1993-03-01

Satellites can serve both defense and the environment, simultaneously monitoring preparations for aggression, the environment, pollution, and natural disasters. These applications have been discussed extensively in international meetings, which have produced specific projects for cooperation and growing acceptance of dual-use concepts.

Dual use of distributed remote sensing satellites

NASA Astrophysics Data System (ADS)

Canavan, G. H.

1992-12-01

Satellites can serve both defense and the environment, simultaneously monitoring preparations for aggression, the environment, pollution, and natural disasters. These applications have been discussed extensively in international meetings, which have produced specific projects for cooperation and growing acceptance of dual-use concepts.

Chimpanzee females queue but males compete for social status

PubMed Central

Foerster, Steffen; Franz, Mathias; Murray, Carson M.; Gilby, Ian C.; Feldblum, Joseph T.; Walker, Kara K.; Pusey, Anne E.

2016-01-01

Dominance hierarchies are widespread in animal social groups and often have measureable effects on individual health and reproductive success. Dominance ranks are not static individual attributes, however, but instead are influenced by two independent processes: 1) changes in hierarchy membership and 2) successful challenges of higher-ranking individuals. Understanding which of these processes dominates the dynamics of rank trajectories can provide insights into fitness benefits of within-sex competition. This question has yet to be examined systematically in a wide range of taxa due to the scarcity of long-term data and a lack of appropriate methodologies for distinguishing between alternative causes of rank changes over time. Here, we expand on recent work and develop a new likelihood-based Elo rating method that facilitates the systematic assessment of rank dynamics in animal social groups, even when interaction data are sparse. We apply this method to characterize long-term rank trajectories in wild eastern chimpanzees (Pan troglodytes schweinfurthii) and find remarkable sex differences in rank dynamics, indicating that females queue for social status while males actively challenge each other to rise in rank. Further, our results suggest that natal females obtain a head start in the rank queue if they avoid dispersal, with potential fitness benefits. PMID:27739527

The cloud paradigm applied to e-Health

PubMed Central

2013-01-01

Background Cloud computing is a new paradigm that is changing how enterprises, institutions and people understand, perceive and use current software systems. With this paradigm, the organizations have no need to maintain their own servers, nor host their own software. Instead, everything is moved to the cloud and provided on demand, saving energy, physical space and technical staff. Cloud-based system architectures provide many advantages in terms of scalability, maintainability and massive data processing. Methods We present the design of an e-health cloud system, modelled by an M/M/m queue with QoS capabilities, i.e. maximum waiting time of requests. Results Detailed results for the model formed by a Jackson network of two M/M/m queues from the queueing theory perspective are presented. These results show a significant performance improvement when the number of servers increases. Conclusions Platform scalability becomes a critical issue since we aim to provide the system with high Quality of Service (QoS). In this paper we define an architecture capable of adapting itself to different diseases and growing numbers of patients. This platform could be applied to the medical field to greatly enhance the results of those therapies that have an important psychological component, such as addictions and chronic diseases. PMID:23496912

Concreteness effects in semantic processing: ERP evidence supporting dual-coding theory.

PubMed

Kounios, J; Holcomb, P J

1994-07-01

Dual-coding theory argues that processing advantages for concrete over abstract (verbal) stimuli result from the operation of 2 systems (i.e., imaginal and verbal) for concrete stimuli, rather than just 1 (for abstract stimuli). These verbal and imaginal systems have been linked with the left and right hemispheres of the brain, respectively. Context-availability theory argues that concreteness effects result from processing differences in a single system. The merits of these theories were investigated by examining the topographic distribution of event-related brain potentials in 2 experiments (lexical decision and concrete-abstract classification). The results were most consistent with dual-coding theory. In particular, different scalp distributions of an N400-like negativity were elicited by concrete and abstract words.

Channel characteristics and coordination in three-echelon dual-channel supply chain

NASA Astrophysics Data System (ADS)

Saha, Subrata

2016-02-01

We explore the impact of channel structure on the manufacturer, the distributer, the retailer and the entire supply chain by considering three different channel structures in radiance of with and without coordination. These structures include a traditional retail channel and two manufacturer direct channels with and without consistent pricing. By comparing the performance of the manufacturer, the distributer and the retailer, and the entire supply chain in three different supply chain structures, it is established analytically that, under some conditions, a dual channel can outperform a single retail channel; as a consequence, a coordination mechanism is developed that not only coordinates the dual channel but also outperforms the non-cooperative single retail channel. All the analytical results are further analysed through numerical examples.

The Instant Glidein; A generic approach for the late binding of jobs to various resource types

NASA Astrophysics Data System (ADS)

Field, Laurence; Steers, Iain

2017-10-01

High-throughput computing requires resources to be allocated so that jobs can be run. In a highly distributed environment that may be comprised of multiple levels of queueing, it may not be certain where, what and when jobs will run. It is therefore desirable to first acquire the resource before assigning it a job. This late binding approach has been implemented in resources managed by batch systems using the pilot jobs paradigm, with the HTCondor glidein being a reference implementation. For resources that are managed by other means such as the IaaS, alternative approaches for late binding may be required. This contribution describes one such approach, the instant glidein, as a generic method for implementing late binding to various resource types.

A development of logistics management models for the Space Transportation System

NASA Technical Reports Server (NTRS)

Carrillo, M. J.; Jacobsen, S. E.; Abell, J. B.; Lippiatt, T. F.

1983-01-01

A new analytic queueing approach was described which relates stockage levels, repair level decisions, and the project network schedule of prelaunch operations directly to the probability distribution of the space transportation system launch delay. Finite source population and limited repair capability were additional factors included in this logistics management model developed specifically for STS maintenance requirements. Data presently available to support logistics decisions were based on a comparability study of heavy aircraft components. A two-phase program is recommended by which NASA would implement an integrated data collection system, assemble logistics data from previous STS flights, revise extant logistics planning and resource requirement parameters using Bayes-Lin techniques, and adjust for uncertainty surrounding logistics systems performance parameters. The implementation of these recommendations can be expected to deliver more cost-effective logistics support.

QoS mapping algorithm for ETE QoS provisioning

NASA Astrophysics Data System (ADS)

Wu, Jian J.; Foster, Gerry

2002-08-01

End-to-End (ETE) Quality of Service (QoS) is critical for next generation wireless multimedia communication systems. To meet the ETE QoS requirements, Universal Mobile Telecommunication System (UMTS) requires not only meeting the 3GPP QoS requirements [1-2] but also mapping external network QoS classes to UMTS QoS classes. There are four Quality of Services (QoS) classes in UMTS; they are Conversational, Streaming, Interactive and Background. There are eight QoS classes for LAN in IEEE 802.1 (one reserved). ATM has four QoS categories. They are Constant Bit Rate (CBR) - highest priority, short queue for strict Cell Delay Variation (CDV), Variable Bit Rate (VBR) - second highest priority, short queues for real time, longer queues for non-real time, Guaranteed Frame Rate (GFR)/ Unspecified Bit Rate (UBR) with Minimum Desired Cell Rate (MDCR) - intermediate priority, dependent on service provider UBR/ Available Bit Rate (ABR) - lowest priority, long queues, large delay variation. DiffServ (DS) has six-bit DS codepoint (DSCP) available to determine the datagram's priority relative to other datagrams and therefore, up to 64 QoS classes are available from the IPv4 and IPv6 DSCP. Different organisations have tried to solve the QoS issues from their own perspective. However, none of them has a full picture for end-to-end QoS classes and how to map them among all QoS classes. Therefore, a universal QoS needs to be created and a new set of QoS classes to enable end-to-end (ETE) QoS provisioning is required. In this paper, a new set of ETE QoS classes is proposed and a mappings algorithm for different QoS classes that are proposed by different organisations is given. With our proposal, ETE QoS mapping and control can be implemented.

Simple Queueing Model Applied to the City of Portland

NASA Astrophysics Data System (ADS)

Simon, Patrice M.; Esser, Jörg; Nagel, Kai

We use a simple traffic micro-simulation model based on queueing dynamics as introduced by Gawron [IJMPC, 9(3):393, 1998] in order to simulate traffic in Portland/Oregon. Links have a flow capacity, that is, they do not release more vehicles per second than is possible according to their capacity. This leads to queue built-up if demand exceeds capacity. Links also have a storage capacity, which means that once a link is full, vehicles that want to enter the link need to wait. This leads to queue spill-back through the network. The model is compatible with route-plan-based approaches such as TRANSIMS, where each vehicle attempts to follow its pre-computed path. Yet, both the data requirements and the computational requirements are considerably lower than for the full TRANSIMS microsimulation. Indeed, the model uses standard emme/2 network data, and runs about eight times faster than real time with more than 100 000 vehicles simultaneously in the simulation on a single Pentium-type CPU. We derive the model's fundamental diagrams and explain it. The simulation is used to simulate traffic on the emme/2 network of the Portland (Oregon) metropolitan region (20 000 links). Demand is generated by a simplified home-to-work destination assignment which generates about half a million trips for the morning peak. Route assignment is done by iterative feedback between micro-simulation and router. An iterative solution of the route assignment for the above problem can be achieved within about half a day of computing time on a desktop workstation. We compare results with field data and with results of traditional assignment runs by the Portland Metropolitan Planning Organization. Thus, with a model such as this one, it is possible to use a dynamic, activities-based approach to transportation simulation (such as in TRANSIMS) with affordable data and hardware. This should enable systematic research about the coupling of demand generation, route assignment, and micro-simulation output.

IDCDACS: IDC's Distributed Application Control System

NASA Astrophysics Data System (ADS)

Ertl, Martin; Boresch, Alexander; Kianička, Ján; Sudakov, Alexander; Tomuta, Elena

2015-04-01

The Preparatory Commission for the CTBTO is an international organization based in Vienna, Austria. Its mission is to establish a global verification regime to monitor compliance with the Comprehensive Nuclear-Test-Ban Treaty (CTBT), which bans all nuclear explosions. For this purpose time series data from a global network of seismic, hydro-acoustic and infrasound (SHI) sensors are transmitted to the International Data Centre (IDC) in Vienna in near-real-time, where it is processed to locate events that may be nuclear explosions. We newly designed the distributed application control system that glues together the various components of the automatic waveform data processing system at the IDC (IDCDACS). Our highly-scalable solution preserves the existing architecture of the IDC processing system that proved successful over many years of operational use, but replaces proprietary components with open-source solutions and custom developed software. Existing code was refactored and extended to obtain a reusable software framework that is flexibly adaptable to different types of processing workflows. Automatic data processing is organized in series of self-contained processing steps, each series being referred to as a processing pipeline. Pipelines process data by time intervals, i.e. the time-series data received from monitoring stations is organized in segments based on the time when the data was recorded. So-called data monitor applications queue the data for processing in each pipeline based on specific conditions, e.g. data availability, elapsed time or completion states of preceding processing pipelines. IDCDACS consists of a configurable number of distributed monitoring and controlling processes, a message broker and a relational database. All processes communicate through message queues hosted on the message broker. Persistent state information is stored in the database. A configurable processing controller instantiates and monitors all data processing applications. Due to decoupling by message queues the system is highly versatile and failure tolerant. The implementation utilizes the RabbitMQ open-source messaging platform that is based upon the Advanced Message Queuing Protocol (AMQP), an on-the-wire protocol (like HTML) and open industry standard. IDCDACS uses high availability capabilities provided by RabbitMQ and is equipped with failure recovery features to survive network and server outages. It is implemented in C and Python and is operated in a Linux environment at the IDC. Although IDCDACS was specifically designed for the existing IDC processing system its architecture is generic and reusable for different automatic processing workflows, e.g. similar to those described in (Olivieri et al. 2012, Kværna et al. 2012). Major advantages are its independence of the specific data processing applications used and the possibility to reconfigure IDCDACS for different types of processing, data and trigger logic. A possible future development would be to use the IDCDACS framework for different scientific domains, e.g. for processing of Earth observation satellite data extending the one-dimensional time-series intervals to spatio-temporal data cubes. REFERENCES Olivieri M., J. Clinton (2012) An almost fair comparison between Earthworm and SeisComp3, Seismological Research Letters, 83(4), 720-727. Kværna, T., S. J. Gibbons, D. B. Harris, D. A. Dodge (2012) Adapting pipeline architectures to track developing aftershock sequences and recurrent explosions, Proceedings of the 2012 Monitoring Research Review: Ground-Based Nuclear Explosion Monitoring Technologies, 776-785.

Using queuing theory and simulation model to optimize hospital pharmacy performance.

PubMed

Bahadori, Mohammadkarim; Mohammadnejhad, Seyed Mohsen; Ravangard, Ramin; Teymourzadeh, Ehsan

2014-03-01

Hospital pharmacy is responsible for controlling and monitoring the medication use process and ensures the timely access to safe, effective and economical use of drugs and medicines for patients and hospital staff. This study aimed to optimize the management of studied outpatient pharmacy by developing suitable queuing theory and simulation technique. A descriptive-analytical study conducted in a military hospital in Iran, Tehran in 2013. A sample of 220 patients referred to the outpatient pharmacy of the hospital in two shifts, morning and evening, was selected to collect the necessary data to determine the arrival rate, service rate, and other data needed to calculate the patients flow and queuing network performance variables. After the initial analysis of collected data using the software SPSS 18, the pharmacy queuing network performance indicators were calculated for both shifts. Then, based on collected data and to provide appropriate solutions, the queuing system of current situation for both shifts was modeled and simulated using the software ARENA 12 and 4 scenarios were explored. Results showed that the queue characteristics of the studied pharmacy during the situation analysis were very undesirable in both morning and evening shifts. The average numbers of patients in the pharmacy were 19.21 and 14.66 in the morning and evening, respectively. The average times spent in the system by clients were 39 minutes in the morning and 35 minutes in the evening. The system utilization in the morning and evening were, respectively, 25% and 21%. The simulation results showed that reducing the staff in the morning from 2 to 1 in the receiving prescriptions stage didn't change the queue performance indicators. Increasing one staff in filling prescription drugs could cause a decrease of 10 persons in the average queue length and 18 minutes and 14 seconds in the average waiting time. On the other hand, simulation results showed that in the evening, decreasing the staff from 2 to 1 in the delivery of prescription drugs, changed the queue performance indicators very little. Increasing a staff to fill prescription drugs could cause a decrease of 5 persons in the average queue length and 8 minutes and 44 seconds in the average waiting time. The patients' waiting times and the number of patients waiting to receive services in both shifts could be reduced by using multitasking persons and reallocating them to the time-consuming stage of filling prescriptions, using queuing theory and simulation techniques.

Using Queuing Theory and Simulation Model to Optimize Hospital Pharmacy Performance

PubMed Central

Bahadori, Mohammadkarim; Mohammadnejhad, Seyed Mohsen; Ravangard, Ramin; Teymourzadeh, Ehsan

2014-01-01

Background: Hospital pharmacy is responsible for controlling and monitoring the medication use process and ensures the timely access to safe, effective and economical use of drugs and medicines for patients and hospital staff. Objectives: This study aimed to optimize the management of studied outpatient pharmacy by developing suitable queuing theory and simulation technique. Patients and Methods: A descriptive-analytical study conducted in a military hospital in Iran, Tehran in 2013. A sample of 220 patients referred to the outpatient pharmacy of the hospital in two shifts, morning and evening, was selected to collect the necessary data to determine the arrival rate, service rate, and other data needed to calculate the patients flow and queuing network performance variables. After the initial analysis of collected data using the software SPSS 18, the pharmacy queuing network performance indicators were calculated for both shifts. Then, based on collected data and to provide appropriate solutions, the queuing system of current situation for both shifts was modeled and simulated using the software ARENA 12 and 4 scenarios were explored. Results: Results showed that the queue characteristics of the studied pharmacy during the situation analysis were very undesirable in both morning and evening shifts. The average numbers of patients in the pharmacy were 19.21 and 14.66 in the morning and evening, respectively. The average times spent in the system by clients were 39 minutes in the morning and 35 minutes in the evening. The system utilization in the morning and evening were, respectively, 25% and 21%. The simulation results showed that reducing the staff in the morning from 2 to 1 in the receiving prescriptions stage didn't change the queue performance indicators. Increasing one staff in filling prescription drugs could cause a decrease of 10 persons in the average queue length and 18 minutes and 14 seconds in the average waiting time. On the other hand, simulation results showed that in the evening, decreasing the staff from 2 to 1 in the delivery of prescription drugs, changed the queue performance indicators very little. Increasing a staff to fill prescription drugs could cause a decrease of 5 persons in the average queue length and 8 minutes and 44 seconds in the average waiting time. Conclusions: The patients' waiting times and the number of patients waiting to receive services in both shifts could be reduced by using multitasking persons and reallocating them to the time-consuming stage of filling prescriptions, using queuing theory and simulation techniques. PMID:24829791

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.

Augmented l1 and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm. Revision 1

DTIC Science & Technology

2012-10-17

nonzero and sampled from the standard Gaussian distribution (for Figure 2) or the Bernoulli distribution (for Figure 3). Both tests had the same sensing...dual variable y(k) Figure 3: Convergence of primal and dual variables of three algorithms on Bernoulli sparse x0 was the slowest. Besides the obvious...slower convergence than the final stage. Comparing the results of two tests, the convergence was faster on the Bernoulli sparse signal than the

JobCenter: an open source, cross-platform, and distributed job queue management system optimized for scalability and versatility.

PubMed

Jaschob, Daniel; Riffle, Michael

2012-07-30

Laboratories engaged in computational biology or bioinformatics frequently need to run lengthy, multistep, and user-driven computational jobs. Each job can tie up a computer for a few minutes to several days, and many laboratories lack the expertise or resources to build and maintain a dedicated computer cluster. JobCenter is a client-server application and framework for job management and distributed job execution. The client and server components are both written in Java and are cross-platform and relatively easy to install. All communication with the server is client-driven, which allows worker nodes to run anywhere (even behind external firewalls or "in the cloud") and provides inherent load balancing. Adding a worker node to the worker pool is as simple as dropping the JobCenter client files onto any computer and performing basic configuration, which provides tremendous ease-of-use, flexibility, and limitless horizontal scalability. Each worker installation may be independently configured, including the types of jobs it is able to run. Executed jobs may be written in any language and may include multistep workflows. JobCenter is a versatile and scalable distributed job management system that allows laboratories to very efficiently distribute all computational work among available resources. JobCenter is freely available at http://code.google.com/p/jobcenter/.

Use of Dual-wavelength Radar for Snow Parameter Estimates

NASA Technical Reports Server (NTRS)

Liao, Liang; Meneghini, Robert; Iguchi, Toshio; Detwiler, Andrew

2005-01-01

Use of dual-wavelength radar, with properly chosen wavelengths, will significantly lessen the ambiguities in the retrieval of microphysical properties of hydrometeors. In this paper, a dual-wavelength algorithm is described to estimate the characteristic parameters of the snow size distributions. An analysis of the computational results, made at X and Ka bands (T-39 airborne radar) and at S and X bands (CP-2 ground-based radar), indicates that valid estimates of the median volume diameter of snow particles, D(sub 0), should be possible if one of the two wavelengths of the radar operates in the non-Rayleigh scattering region. However, the accuracy may be affected to some extent if the shape factors of the Gamma function used for describing the particle distribution are chosen far from the true values or if cloud water attenuation is significant. To examine the validity and accuracy of the dual-wavelength radar algorithms, the algorithms are applied to the data taken from the Convective and Precipitation-Electrification Experiment (CaPE) in 1991, in which the dual-wavelength airborne radar was coordinated with in situ aircraft particle observations and ground-based radar measurements. Having carefully co-registered the data obtained from the different platforms, the airborne radar-derived size distributions are then compared with the in-situ measurements and ground-based radar. Good agreement is found for these comparisons despite the uncertainties resulting from mismatches of the sample volumes among the different sensors as well as spatial and temporal offsets.

Modeling logistic performance in quantitative microbial risk assessment.

PubMed

Rijgersberg, Hajo; Tromp, Seth; Jacxsens, Liesbeth; Uyttendaele, Mieke

2010-01-01

In quantitative microbial risk assessment (QMRA), food safety in the food chain is modeled and simulated. In general, prevalences, concentrations, and numbers of microorganisms in media are investigated in the different steps from farm to fork. The underlying rates and conditions (such as storage times, temperatures, gas conditions, and their distributions) are determined. However, the logistic chain with its queues (storages, shelves) and mechanisms for ordering products is usually not taken into account. As a consequence, storage times-mutually dependent in successive steps in the chain-cannot be described adequately. This may have a great impact on the tails of risk distributions. Because food safety risks are generally very small, it is crucial to model the tails of (underlying) distributions as accurately as possible. Logistic performance can be modeled by describing the underlying planning and scheduling mechanisms in discrete-event modeling. This is common practice in operations research, specifically in supply chain management. In this article, we present the application of discrete-event modeling in the context of a QMRA for Listeria monocytogenes in fresh-cut iceberg lettuce. We show the potential value of discrete-event modeling in QMRA by calculating logistic interventions (modifications in the logistic chain) and determining their significance with respect to food safety.

The design and implementation of multi-source application middleware based on service bus

NASA Astrophysics Data System (ADS)

Li, Yichun; Jiang, Ningkang

2017-06-01

With the rapid development of the Internet of Things(IoT), the real-time monitoring data are increasing with different types and large amounts. Aiming at taking full advantages of the data, we designed and implemented an application middleware, which not only supports the three-layer architecture of IoT information system but also enables the flexible configuration of multiple resources access and other accessional modules. The middleware platform shows the characteristics of lightness, security, AoP (aspect-oriented programming), distribution and real-time, which can let application developers construct the information processing systems on related areas in a short period. It focuses not limited to these functions: pre-processing of data format, the definition of data entity, the callings and handlings of distributed service and massive data process. The result of experiment shows that the performance of middleware is more excellent than some message queue construction to some degree and its throughput grows better as the number of distributed nodes increases while the code is not complex. Currently, the middleware is applied to the system of Shanghai Pudong environmental protection agency and achieved a great success.

Bistability in dual-frequency nematic liquid crystals

NASA Astrophysics Data System (ADS)

Palto, S. P.; Barnik, M. I.

2007-03-01

Different modes of bistable switching in liquid crystals with frequency inversion of the dielectric anisotropy sign are discussed. The study is performed by numerical simulation and experimentally. It is shown that dual frequency driving can be effectively used to control switching between topologically equivalent and non-equivalent director field distributions. The experimental results on temperature performance of the dual-frequency switching and possible driving methods for energy consumption and expanding the temperature range are presented.

Exploring the evolution of London's street network in the information space: A dual approach

NASA Astrophysics Data System (ADS)

Masucci, A. Paolo; Stanilov, Kiril; Batty, Michael

2014-01-01

We study the growth of London's street network in its dual representation, as the city has evolved over the past 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the planar graph and represents a transportation unit in the so-called information space, i.e., the space where information is handled in order to navigate through the city. First, we discuss a novel hybrid technique to extract dual graphs from planar graphs, called the hierarchical intersection continuity negotiation principle. Then we show that the growth of the network can be analytically described by logistic laws and that the topological properties of the network are governed by robust log-normal distributions characterizing the network's connectivity and small-world properties that are consistent over time. Moreover, we find that the double-Pareto-like distributions for the connectivity emerge for major roads and can be modeled via a stochastic content-based network model using simple space-filling principles.

A Closed Network Queue Model of Underground Coal Mining Production, Failure, and Repair

NASA Technical Reports Server (NTRS)

Lohman, G. M.

1978-01-01

Underground coal mining system production, failures, and repair cycles were mathematically modeled as a closed network of two queues in series. The model was designed to better understand the technological constraints on availability of current underground mining systems, and to develop guidelines for estimating the availability of advanced mining systems and their associated needs for spares as well as production and maintenance personnel. It was found that: mine performance is theoretically limited by the maintainability ratio, significant gains in availability appear possible by means of small improvements in the time between failures the number of crews and sections should be properly balanced for any given maintainability ratio, and main haulage systems closest to the mine mouth require the most attention to reliability.

Physics of traffic gridlock in a city.

PubMed

Kerner, Boris S

2011-10-01

Based on simulations of stochastic three-phase and two-phase traffic flow models, we reveal that at a signalized city intersection under small link inflow rates at which a vehicle queue developed during the red phase of the light signal dissolves fully during the green phase, i.e., no traffic gridlock should be expected, nevertheless, spontaneous traffic breakdown with subsequent city gridlock occurs with some probability after a random time delay. In most cases, this traffic breakdown is initiated by a phase transition from free flow to a synchronized flow occurring upstream of the queue at the light signal. The probability of traffic breakdown at the light signal is an increasing function of the link inflow rate and duration of the red phase of the light signal.

Time studies in A&E departments--a useful tool for management.

PubMed

Aharonson-Daniel, L; Fung, H; Hedley, A J

1996-01-01

A time and motion study was conducted in an accident and emergency (A&E) department in a Hong Kong Government hospital in order to suggest solutions for severe queuing problems found in A&E. The study provided useful information about the patterns of arrival and service; the throughput; and the factors that influence the length of the queue at the A&E department. Plans for building a computerized simulation model were dropped as new intelligence generated by the study enabled problem solving using simple statistical analysis and common sense. Demonstrates some potential benefits for management in applying operations research methods in busy clinical working environments. The implementation of the recommendations made by this study successfully eliminated queues in A&E.

Using simulation in out-patient queues: a case study.

PubMed

Huarng, F; Lee, M H

1996-01-01

Overwork and overcrowding in some periods was an important issue for the out-patient department of a local hospital in Chia-Yi in Taiwan. The hospital administrators wanted to manage the patient flow effectively. Describes a study which focused on the utilization of doctors and staff in the out-patient department, the time spent in the hospital by an out-patient, and the length of the out-patient queue. Explains how a computer simulation model was developed to study how changes in the appointment system, staffing policies and service units would affect the observed bottleneck. The results show that the waiting time was greatly reduced and the workload of the doctor was also reduced to a reasonable rate in the overwork and overcrowding periods.

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

Attinella, John E.; Davis, Kristan D.; Musselman, Roy G.

Methods, apparatuses, and computer program products for servicing a globally broadcast interrupt signal in a multi-threaded computer comprising a plurality of processor threads. Embodiments include an interrupt controller indicating in a plurality of local interrupt status locations that a globally broadcast interrupt signal has been received by the interrupt controller. Embodiments also include a thread determining that a local interrupt status location corresponding to the thread indicates that the globally broadcast interrupt signal has been received by the interrupt controller. Embodiments also include the thread processing one or more entries in a global interrupt status bit queue based on whethermore » global interrupt status bits associated with the globally broadcast interrupt signal are locked. Each entry in the global interrupt status bit queue corresponds to a queued global interrupt.« less

Stresses and satisfactions of the two-pharmacist relationship.

PubMed

Stanton, A L; Berger, B A

1987-12-01

Potential advantages and disadvantages of dual-career relationships are identified, and strategies for addressing common issues encountered by dual-career couples are presented. With regard to career issues, clarification of expectations and discussion between partners regarding career commitment, job selection and mobility, and maintenance of professional identity is emphasized. Benefits of dual-career relationships include shared occupational interests, financial rewards, and respect for each partner's professional expertise. Strategies for managing domestic responsibilities include modifying standards, setting priorities, and distributing tasks evenly among family members. Pharmacist couples who are parents have chosen several routes in managing child-care issues, including postponing childbearing until each adult's career is established, decreasing one partner's career involvement, and hiring community or in-home caretakers. Sharing equally in child care can help prevent an excessive workload for one parent. Progressive family-oriented employment practices may also aid dual-career couples with children. Striking a balance between career and family is identified as perhaps the most challenging task facing the dual-career couple; time distribution must be adjusted according to the couple's priorities. Identifying realistic priorities, negotiating honestly regarding attainment of mutual and individual goals, and maintaining flexibility are key in achieving success in the professional and private lives of two-pharmacist couples.

A fragmentation model of earthquake-like behavior in internet access activity

NASA Astrophysics Data System (ADS)

Paguirigan, Antonino A.; Angco, Marc Jordan G.; Bantang, Johnrob Y.

We present a fragmentation model that generates almost any inverse power-law size distribution, including dual-scaled versions, consistent with the underlying dynamics of systems with earthquake-like behavior. We apply the model to explain the dual-scaled power-law statistics observed in an Internet access dataset that covers more than 32 million requests. The non-Poissonian statistics of the requested data sizes m and the amount of time τ needed for complete processing are consistent with the Gutenberg-Richter-law. Inter-event times δt between subsequent requests are also shown to exhibit power-law distributions consistent with the generalized Omori law. Thus, the dataset is similar to the earthquake data except that two power-law regimes are observed. Using the proposed model, we are able to identify underlying dynamics responsible in generating the observed dual power-law distributions. The model is universal enough for its applicability to any physical and human dynamics that is limited by finite resources such as space, energy, time or opportunity.

Modeling the energy performance of event-driven wireless sensor network by using static sink and mobile sink.

PubMed

Chen, Jiehui; Salim, Mariam B; Matsumoto, Mitsuji

2010-01-01

Wireless Sensor Networks (WSNs) designed for mission-critical applications suffer from limited sensing capacities, particularly fast energy depletion. Regarding this, mobile sinks can be used to balance the energy consumption in WSNs, but the frequent location updates of the mobile sinks can lead to data collisions and rapid energy consumption for some specific sensors. This paper explores an optimal barrier coverage based sensor deployment for event driven WSNs where a dual-sink model was designed to evaluate the energy performance of not only static sensors, but Static Sink (SS) and Mobile Sinks (MSs) simultaneously, based on parameters such as sensor transmission range r and the velocity of the mobile sink v, etc. Moreover, a MS mobility model was developed to enable SS and MSs to effectively collaborate, while achieving spatiotemporal energy performance efficiency by using the knowledge of the cumulative density function (cdf), Poisson process and M/G/1 queue. The simulation results verified that the improved energy performance of the whole network was demonstrated clearly and our eDSA algorithm is more efficient than the static-sink model, reducing energy consumption approximately in half. Moreover, we demonstrate that our results are robust to realistic sensing models and also validate the correctness of our results through extensive simulations.

Modeling the Energy Performance of Event-Driven Wireless Sensor Network by Using Static Sink and Mobile Sink

PubMed Central

Chen, Jiehui; Salim, Mariam B.; Matsumoto, Mitsuji

2010-01-01

Wireless Sensor Networks (WSNs) designed for mission-critical applications suffer from limited sensing capacities, particularly fast energy depletion. Regarding this, mobile sinks can be used to balance the energy consumption in WSNs, but the frequent location updates of the mobile sinks can lead to data collisions and rapid energy consumption for some specific sensors. This paper explores an optimal barrier coverage based sensor deployment for event driven WSNs where a dual-sink model was designed to evaluate the energy performance of not only static sensors, but Static Sink (SS) and Mobile Sinks (MSs) simultaneously, based on parameters such as sensor transmission range r and the velocity of the mobile sink v, etc. Moreover, a MS mobility model was developed to enable SS and MSs to effectively collaborate, while achieving spatiotemporal energy performance efficiency by using the knowledge of the cumulative density function (cdf), Poisson process and M/G/1 queue. The simulation results verified that the improved energy performance of the whole network was demonstrated clearly and our eDSA algorithm is more efficient than the static-sink model, reducing energy consumption approximately in half. Moreover, we demonstrate that our results are robust to realistic sensing models and also validate the correctness of our results through extensive simulations. PMID:22163503

Dual-Targeting of AR and Akt Pathways by Berberine in Castration-Resistant Prostate Cancer

DTIC Science & Technology

2016-10-01

Award Number: W81XWH-12-1-0275 TITLE: Dual-Targeting of AR and Akt Pathways by Berberine in Castration-Resistant Prostate Cancer PRINCIPAL...Public Release; Distribution Unlimited The views, opinions and/or findings contained in this report are those of the author(s) and should not be...TITLE AND SUBTITLE 5a. CONTRACT NUMBER Dual-Targeting of AR and Akt Pathways by Berberine in Castration- Resistant Prostate Cancer 5b. GRANT NUMBER

Dual Water Systems: Characterization and Performance for Distribution of Reclaimed Water (WaterRF Report 4333)

EPA Science Inventory

The research tasks included: an inventory of cases where dual systems have been implemented; formulation of a protocol to identify claimed benefits, costs, and risks; collection of data (quantitative and anecdotal) to assess performance; display of data in the form of performance...

System complexity as a measure of safe capacity for the emergency department.

PubMed

France, Daniel J; Levin, Scott

2006-11-01

System complexity is introduced as a new measure of system state for the emergency department (ED). In its original form, the measure quantifies the uncertainty of demands on system resources. For application in the ED, the measure is being modified to quantify both workload and uncertainty to produce a single integrated measure of system state. Complexity is quantified using an information-theoretic or entropic approach developed in manufacturing and operations research. In its original form, complexity is calculated on the basis of four system parameters: 1) the number of resources (clinicians and processing entities such as radiology and laboratory systems), 2) the number of possible work states for each resource, 3) the probability that a resource is in a particular work state, and 4) the probability of queue changes (i.e., where a queue is defined by the number of patients or patient orders being managed by a resource) during a specified time period. An example is presented to demonstrate how complexity is calculated and interpreted for a simple system composed of three resources (i.e., emergency physicians) managing varying patient loads. The example shows that variation in physician work states and patient queues produces different scores of complexity for each physician. It also illustrates how complexity and workload differ. System complexity is a viable and technically feasible measurement for monitoring and managing surge capacity in the ED.

ATLAS user analysis on private cloud resources at GoeGrid

NASA Astrophysics Data System (ADS)

Glaser, F.; Nadal Serrano, J.; Grabowski, J.; Quadt, A.

2015-12-01

User analysis job demands can exceed available computing resources, especially before major conferences. ATLAS physics results can potentially be slowed down due to the lack of resources. For these reasons, cloud research and development activities are now included in the skeleton of the ATLAS computing model, which has been extended by using resources from commercial and private cloud providers to satisfy the demands. However, most of these activities are focused on Monte-Carlo production jobs, extending the resources at Tier-2. To evaluate the suitability of the cloud-computing model for user analysis jobs, we developed a framework to launch an ATLAS user analysis cluster in a cloud infrastructure on demand and evaluated two solutions. The first solution is entirely integrated in the Grid infrastructure by using the same mechanism, which is already in use at Tier-2: A designated Panda-Queue is monitored and additional worker nodes are launched in a cloud environment and assigned to a corresponding HTCondor queue according to the demand. Thereby, the use of cloud resources is completely transparent to the user. However, using this approach, submitted user analysis jobs can still suffer from a certain delay introduced by waiting time in the queue and the deployed infrastructure lacks customizability. Therefore, our second solution offers the possibility to easily deploy a totally private, customizable analysis cluster on private cloud resources belonging to the university.

Dual fiber microprobe for mapping elemental distributions in biological cells

DOEpatents

Martin, Rodger C [Powell, TN; Martin, Madhavi Z [Powell, TN

2007-07-31

Laser-induced breakdown spectroscopy (LIBS) is applied on a microscale for in situ elemental analysis and spatial mapping in biological cells. A high power laser beam is focused onto a cell surface using a dual branching optical fiber probe for optical excitation of the cell constituents. Dual spectrometers and ICCD detectors capture the emission spectra from the excited cell(s). Repeated probing or repositioning of the laser beam with respect to the cell can provide 2-D or 3-D mapping of the cell.

Distributed Optimal Consensus Over Resource Allocation Network and Its Application to Dynamical Economic Dispatch.

PubMed

Li, Chaojie; Yu, Xinghuo; Huang, Tingwen; He, Xing; Chaojie Li; Xinghuo Yu; Tingwen Huang; Xing He; Li, Chaojie; Huang, Tingwen; He, Xing; Yu, Xinghuo

2018-06-01

The resource allocation problem is studied and reformulated by a distributed interior point method via a -logarithmic barrier. By the facilitation of the graph Laplacian, a fully distributed continuous-time multiagent system is developed for solving the problem. Specifically, to avoid high singularity of the -logarithmic barrier at boundary, an adaptive parameter switching strategy is introduced into this dynamical multiagent system. The convergence rate of the distributed algorithm is obtained. Moreover, a novel distributed primal-dual dynamical multiagent system is designed in a smart grid scenario to seek the saddle point of dynamical economic dispatch, which coincides with the optimal solution. The dual decomposition technique is applied to transform the optimization problem into easily solvable resource allocation subproblems with local inequality constraints. The good performance of the new dynamical systems is, respectively, verified by a numerical example and the IEEE six-bus test system-based simulations.

VME rollback hardware for time warp multiprocessor systems

NASA Technical Reports Server (NTRS)

Robb, Michael J.; Buzzell, Calvin A.

1992-01-01

The purpose of the research effort is to develop and demonstrate innovative hardware to implement specific rollback and timing functions required for efficient queue management and precision timekeeping in multiprocessor discrete event simulations. The previously completed phase 1 effort demonstrated the technical feasibility of building hardware modules which eliminate the state saving overhead of the Time Warp paradigm used in distributed simulations on multiprocessor systems. The current phase 2 effort will build multiple pre-production rollback hardware modules integrated with a network of Sun workstations, and the integrated system will be tested by executing a Time Warp simulation. The rollback hardware will be designed to interface with the greatest number of multiprocessor systems possible. The authors believe that the rollback hardware will provide for significant speedup of large scale discrete event simulation problems and allow multiprocessors using Time Warp to dramatically increase performance.

Stochastic Stability in Internet Router Congestion Games

NASA Astrophysics Data System (ADS)

Chung, Christine; Pyrga, Evangelia

Congestion control at bottleneck routers on the internet is a long standing problem. Many policies have been proposed for effective ways to drop packets from the queues of these routers so that network endpoints will be inclined to share router capacity fairly and minimize the overflow of packets trying to enter the queues. We study just how effective some of these queuing policies are when each network endpoint is a self-interested player with no information about the other players’ actions or preferences. By employing the adaptive learning model of evolutionary game theory, we study policies such as Droptail, RED, and the greedy-flow-punishing policy proposed by Gao et al. [10] to find the stochastically stable states: the states of the system that will be reached in the long run.

Initial Data Analysis Results for ATD-2 ISAS HITL Simulation

NASA Technical Reports Server (NTRS)

Lee, Hanbong

2017-01-01

To evaluate the operational procedures and information requirements for the core functional capabilities of the ATD-2 project, such as tactical surface metering tool, APREQ-CFR procedure, and data element exchanges between ramp and tower, human-in-the-loop (HITL) simulations were performed in March, 2017. This presentation shows the initial data analysis results from the HITL simulations. With respect to the different runway configurations and metering values in tactical surface scheduler, various airport performance metrics were analyzed and compared. These metrics include gate holding time, taxi-out in time, runway throughput, queue size and wait time in queue, and TMI flight compliance. In addition to the metering value, other factors affecting the airport performance in the HITL simulation, including run duration, runway changes, and TMI constraints, are also discussed.

Modeling and Control of Airport Queueing Dynamics under Severe Flow Restrictions

NASA Technical Reports Server (NTRS)

Carr, Francis; Evans, Antony; Clarke, John-Paul; Deron, Eric

2003-01-01

Based on field observations and interviews with controllers at BOS and EWR, we identify the closure of local departure fixes as the most severe class of airport departure restrictions. A set of simple queueing dynamics and traffic rules are developed to model departure traffic under such restrictions. The validity of the proposed model is tested via Monte Carlo simulation against 10 hours of actual operations data collected during a case-study at EWR on June 29,2000. In general, the model successfully reproduces the aggregate departure congestion. An analysis of the average error over 40 simulation runs indicates that flow-rate restrictions also significantly impact departure traffic; work is underway to capture these effects. Several applications and what-if scenarios are discussed for future evaluation using the calibrated model.

Stochastic queueing-theory approach to human dynamics

NASA Astrophysics Data System (ADS)

Walraevens, Joris; Demoor, Thomas; Maertens, Tom; Bruneel, Herwig

2012-02-01

Recently, numerous studies have shown that human dynamics cannot be described accurately by exponential laws. For instance, Barabási [Nature (London)NATUAS0028-083610.1038/nature03459 435, 207 (2005)] demonstrates that waiting times of tasks to be performed by a human are more suitably modeled by power laws. He presumes that these power laws are caused by a priority selection mechanism among the tasks. Priority models are well-developed in queueing theory (e.g., for telecommunication applications), and this paper demonstrates the (quasi-)immediate applicability of such a stochastic priority model to human dynamics. By calculating generating functions and by studying them in their dominant singularity, we prove that nonexponential tails result naturally. Contrary to popular belief, however, these are not necessarily triggered by the priority selection mechanism.

Analysis of the packet formation process in packet-switched networks

NASA Astrophysics Data System (ADS)

Meditch, J. S.

Two new queueing system models for the packet formation process in packet-switched telecommunication networks are developed, and their applications in process stability, performance analysis, and optimization studies are illustrated. The first, an M/M/1 queueing system characterization of the process, is a highly aggregated model which is useful for preliminary studies. The second, a marked extension of an earlier M/G/1 model, permits one to investigate stability, performance characteristics, and design of the packet formation process in terms of the details of processor architecture, and hardware and software implementations with processor structure and as many parameters as desired as variables. The two new models together with the earlier M/G/1 characterization span the spectrum of modeling complexity for the packet formation process from basic to advanced.

Servicing a globally broadcast interrupt signal in a multi-threaded computer

DOEpatents

Attinella, John E.; Davis, Kristan D.; Musselman, Roy G.; Satterfield, David L.

2015-12-29

Methods, apparatuses, and computer program products for servicing a globally broadcast interrupt signal in a multi-threaded computer comprising a plurality of processor threads. Embodiments include an interrupt controller indicating in a plurality of local interrupt status locations that a globally broadcast interrupt signal has been received by the interrupt controller. Embodiments also include a thread determining that a local interrupt status location corresponding to the thread indicates that the globally broadcast interrupt signal has been received by the interrupt controller. Embodiments also include the thread processing one or more entries in a global interrupt status bit queue based on whether global interrupt status bits associated with the globally broadcast interrupt signal are locked. Each entry in the global interrupt status bit queue corresponds to a queued global interrupt.

An Implementation of Wireless Body Area Networks for Improving Priority Data Transmission Delay.

PubMed

Gündoğdu, Köksal; Çalhan, Ali

2016-03-01

The rapid growth of wireless sensor networks has enabled the human health monitoring of patients using body sensor nodes that gather and evaluate human body parameters and movements. This study describes both simulation model and implementation of a new traffic sensitive wireless body area network by using non-preemptive priority queue discipline. A wireless body area network implementation employing TDMA is designed with three different priorities of data traffics. Besides, a coordinator node having the non-preemptive priority queue is performed in this study. We have also developed, modeled and simulated example network scenarios by using the Riverbed Modeler simulation software with the purpose of verifying the implementation results. The simulation results obtained under various network load conditions are consistent with the implementation results.

Design and development of cell queuing, processing, and scheduling modules for the iPOINT input-buffered ATM testbed

NASA Astrophysics Data System (ADS)

Duan, Haoran

1997-12-01

This dissertation presents the concepts, principles, performance, and implementation of input queuing and cell-scheduling modules for the Illinois Pulsar-based Optical INTerconnect (iPOINT) input-buffered Asynchronous Transfer Mode (ATM) testbed. Input queuing (IQ) ATM switches are well suited to meet the requirements of current and future ultra-broadband ATM networks. The IQ structure imposes minimum memory bandwidth requirements for cell buffering, tolerates bursty traffic, and utilizes memory efficiently for multicast traffic. The lack of efficient cell queuing and scheduling solutions has been a major barrier to build high-performance, scalable IQ-based ATM switches. This dissertation proposes a new Three-Dimensional Queue (3DQ) and a novel Matrix Unit Cell Scheduler (MUCS) to remove this barrier. 3DQ uses a linked-list architecture based on Synchronous Random Access Memory (SRAM) to combine the individual advantages of per-virtual-circuit (per-VC) queuing, priority queuing, and N-destination queuing. It avoids Head of Line (HOL) blocking and provides per-VC Quality of Service (QoS) enforcement mechanisms. Computer simulation results verify the QoS capabilities of 3DQ. For multicast traffic, 3DQ provides efficient usage of cell buffering memory by storing multicast cells only once. Further, the multicast mechanism of 3DQ prevents a congested destination port from blocking other less- loaded ports. The 3DQ principle has been prototyped in the Illinois Input Queue (iiQueue) module. Using Field Programmable Gate Array (FPGA) devices, SRAM modules, and integrated on a Printed Circuit Board (PCB), iiQueue can process incoming traffic at 800 Mb/s. Using faster circuit technology, the same design is expected to operate at the OC-48 rate (2.5 Gb/s). MUCS resolves the output contention by evaluating the weight index of each candidate and selecting the heaviest. It achieves near-optimal scheduling and has a very short response time. The algorithm originates from a heuristic strategy that leads to 'socially optimal' solutions, yielding a maximum number of contention-free cells being scheduled. A novel mixed digital-analog circuit has been designed to implement the MUCS core functionality. The MUCS circuit maps the cell scheduling computation to the capacitor charging and discharging procedures that are conducted fully in parallel. The design has a uniform circuit structure, low interconnect counts, and low chip I/O counts. Using 2 μm CMOS technology, the design operates on a 100 MHz clock and finds a near-optimal solution within a linear processing time. The circuit has been verified at the transistor level by HSPICE simulation. During this research, a five-port IQ-based optoelectronic iPOINT ATM switch has been developed and demonstrated. It has been fully functional with an aggregate throughput of 800 Mb/s. The second-generation IQ-based switch is currently under development. Equipped with iiQueue modules and MUCS module, the new switch system will deliver a multi-gigabit aggregate throughput, eliminate HOL blocking, provide per-VC QoS, and achieve near-100% link bandwidth utilization. Complete documentation of input modules and trunk module for the existing testbed, and complete documentation of 3DQ, iiQueue, and MUCS for the second-generation testbed are given in this dissertation.

Running ATLAS workloads within massively parallel distributed applications using Athena Multi-Process framework (AthenaMP)

NASA Astrophysics Data System (ADS)

Calafiura, Paolo; Leggett, Charles; Seuster, Rolf; Tsulaia, Vakhtang; Van Gemmeren, Peter

2015-12-01

AthenaMP is a multi-process version of the ATLAS reconstruction, simulation and data analysis framework Athena. By leveraging Linux fork and copy-on-write mechanisms, it allows for sharing of memory pages between event processors running on the same compute node with little to no change in the application code. Originally targeted to optimize the memory footprint of reconstruction jobs, AthenaMP has demonstrated that it can reduce the memory usage of certain configurations of ATLAS production jobs by a factor of 2. AthenaMP has also evolved to become the parallel event-processing core of the recently developed ATLAS infrastructure for fine-grained event processing (Event Service) which allows the running of AthenaMP inside massively parallel distributed applications on hundreds of compute nodes simultaneously. We present the architecture of AthenaMP, various strategies implemented by AthenaMP for scheduling workload to worker processes (for example: Shared Event Queue and Shared Distributor of Event Tokens) and the usage of AthenaMP in the diversity of ATLAS event processing workloads on various computing resources: Grid, opportunistic resources and HPC.

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

Stewart, J; Lindsay, P; University of Toronto, Toronto

Purpose: Recent progress in small animal radiotherapy systems has provided the foundation for delivering the heterogeneous, millimeter scale dose distributions demanded by preclinical radiobiology investigations. Despite advances in preclinical dose planning, delivery of highly heterogeneous dose distributions is constrained by the fixed collimation systems and large x-ray focal spot common in small animal radiotherapy systems. This work proposes a dual focal spot dose optimization and delivery method with a large x-ray focal spot used to deliver homogeneous dose regions and a small focal spot to paint spatially heterogeneous dose regions. Methods: Two-dimensional dose kernels were measured for a 1 mmmore » circular collimator with radiochromic film at 10 mm depth in a solid water phantom for the small and large x-ray focal spots on a recently developed small animal microirradiator. These kernels were used in an optimization framework which segmented a desired dose distribution into low- and high-spatial frequency regions for delivery by the large and small focal spot, respectively. For each region, the method determined an optimal set of stage positions and beam-on times. The method was demonstrated by optimizing a bullseye pattern consisting of 0.75 mm radius circular target and 0.5 and 1.0 mm wide rings alternating between 0 and 2 Gy. Results: Compared to a large focal spot technique, the dual focal spot technique improved the optimized dose distribution: 69.2% of the optimized dose was within 0.5 Gy of the intended dose for the large focal spot, compared to 80.6% for the dual focal spot method. The dual focal spot design required 14.0 minutes of optimization, and will require 178.3 minutes for automated delivery. Conclusion: The dual focal spot optimization and delivery framework is a novel option for delivering conformal and heterogeneous dose distributions at the preclinical level and provides a new experimental option for unique radiobiological investigations. Funding Support: this work is supported by funding the National Sciences and Engineering Research Council of Canada, and a Mitacs-accelerate fellowship. Conflict of Interest: Dr. Lindsay and Dr. Jaffray are listed as inventors of the small animal microirradiator described herein. This system has been licensed for commercial development.« less

Utilizing the Vertical Variability of Precipitation to Improve Radar QPE

NASA Technical Reports Server (NTRS)

Gatlin, Patrick N.; Petersen, Walter A.

2016-01-01

Characteristics of the melting layer and raindrop size distribution can be exploited to further improve radar quantitative precipitation estimation (QPE). Using dual-polarimetric radar and disdrometers, we found that the characteristic size of raindrops reaching the ground in stratiform precipitation often varies linearly with the depth of the melting layer. As a result, a radar rainfall estimator was formulated using D(sub m) that can be employed by polarimetric as well as dual-frequency radars (e.g., space-based radars such as the GPM DPR), to lower the bias and uncertainty of conventional single radar parameter rainfall estimates by as much as 20%. Polarimetric radar also suffers from issues associated with sampling the vertical distribution of precipitation. Hence, we characterized the vertical profile of polarimetric parameters (VP3)-a radar manifestation of the evolving size and shape of hydrometeors as they fall to the ground-on dual-polarimetric rainfall estimation. The VP3 revealed that the profile of ZDR in stratiform rainfall can bias dual-polarimetric rainfall estimators by as much as 50%, even after correction for the vertical profile of reflectivity (VPR). The VP3 correction technique that we developed can improve operational dual-polarimetric rainfall estimates by 13% beyond that offered by a VPR correction alone.

Dual-energy computed tomography of the head: a phantom study assessing axial dose distribution, eye lens dose, and image noise level

NASA Astrophysics Data System (ADS)

Matsubara, Kosuke; Kawashima, Hiroki; Hamaguchi, Takashi; Takata, Tadanori; Kobayashi, Masanao; Ichikawa, Katsuhiro; Koshida, Kichiro

2016-03-01

The aim of this study was to propose a calibration method for small dosimeters to measure absorbed doses during dual- source dual-energy computed tomography (DECT) and to compare the axial dose distribution, eye lens dose, and image noise level between DE and standard, single-energy (SE) head CT angiography. Three DE (100/Sn140 kVp 80/Sn140 kVp, and 140/80 kVp) and one SE (120 kVp) acquisitions were performed using a second-generation dual-source CT device and a female head phantom, with an equivalent volumetric CT dose index. The axial absorbed dose distribution at the orbital level and the absorbed doses for the eye lens were measured using radiophotoluminescent glass dosimeters. CT attenuation numbers were obtained in the DE composite images and the SE images of the phantom at the orbital level. The doses absorbed at the orbital level and in the eye lens were lower and standard deviations for the CT attenuation numbers were slightly higher in the DE acquisitions than those in the SE acquisition. The anterior surface dose was especially higher in the SE acquisition than that in the DE acquisitions. Thus, DE head CT angiography can be performed with a radiation dose lower than that required for a standard SE head CT angiography, with a slight increase in the image noise level. The 100/Sn140 kVp acquisition revealed the most balanced axial dose distribution. In addition, our proposed method was effective for calibrating small dosimeters to measure absorbed doses in DECT.

A new approach for shaping of dual-reflector antennas

NASA Technical Reports Server (NTRS)

Lee, Teh-Hong; Burnside, W. D.; Rudduck, Roger C.

1987-01-01

The shaping of 2-D dual-reflector antenna systems to generate a prescribed distribution with uniform phase at the aperture of the second reflector is examined. This method is based on the geometrical nature of Cassegrain and Gregorian dual-reflector antennas. The method of syntheses satisfies the principles of geometrical optics which are the foundations of dual-reflector designs. Instead of setting up differential equations or heuristically designing the subreflector, a set of algebraic equations is formulated and solved numerically to obtain the desired surfaces. The caustics of the reflected rays from the subreflector can be obtained and examined. Several examples of 2-D dual-reflector shaping are shown to validate the study. Geometrical optics and physical optics are used to calculate the scattered fields from the reflectors.

From ornament to armament or loss of function? Breeding plumage acquisition in a genetically monogamous bird.

PubMed

Fan, Marie; Teunissen, Niki; Hall, Michelle L; Hidalgo Aranzamendi, Nataly; Kingma, Sjouke A; Roast, Michael; Delhey, Kaspar; Peters, Anne

2018-06-25

The evolution of conspicuous male traits is thought to be driven by female mate choice or male-male competition. These two mechanisms are often viewed as distinct processes, with most studies focusing on female choice. However, both mechanisms of sexual selection can act simultaneously on the same trait (i.e., dual function) and/or interact in a synergistic or conflicting way. Dual-function traits are commonly assumed to originate through male-male competition before being used in female choice; yet, most studies focusing on such traits could not determine the direction of change, lacking phylogenetic information. We investigated the role of conspicuous male seasonal plumage in male-male competitive interactions in the purple-crowned fairy-wren Malurus coronatus, a cooperatively breeding bird. Male breeding plumage in most Malurus species is selected by female choice through extra-pair mate choice, but unlike its congeners, M. coronatus is genetically monogamous, and females do not seem to choose males based on breeding plumage acquisition. Our study shows that, within groups, subordinate males that were older, and therefore higher-ranked in the queue for breeder position inheritance, produced a more complete breeding plumage. In line with this, subordinate males that were older and/or displayed a more complete breeding plumage were more successful in competitively acquiring a breeder position. A role as a signal of competitive ability was experimentally confirmed by presenting models of males: in breeding colours, these received more aggression from resident breeder males than in nonbreeding colours, but elicited limited response from females, consistent with competitors in breeding plumage being perceived as a bigger threat to the breeder male. The role of the conspicuous breeding plumage in mediating male-male interactions might account for its presence in this genetically monogamous species. As phylogenetic reconstructions suggest a past female choice function in M. coronatus, this could represent a sexual trait that shifted functions, or a dual-function trait that lost one function. These evolutionary scenarios imply that intra- and intersexual functions of ornaments may be gained or lost independently and offer new perspectives in understanding the complex dynamics of sexual selection. © 2018 The Authors. Journal of Animal Ecology © 2018 British Ecological Society.

Modeling left turn queue lengths.

DOT National Transportation Integrated Search

2011-01-01

This guidebook provides methodologies and procedures for using incident data collected at Texas transportation management centers (TMCs) to perform two types of analysis - evaluation/planning analysis and predictive analysis. For the evaluation/plann...

Experimental observation of spatially resolved photo-luminescence intensity distribution in dual mode upconverting nanorod bundles

PubMed Central

Kumar, Pawan; Singh, Satbir; Singh, V. N.; Singh, Nidhi; Gupta, R. K.; Gupta, Bipin Kumar

2017-01-01

A novel method for demonstration of photoluminescence intensity distribution in upconverting nanorod bundles using confocal microscopy is reported. Herein, a strategy for the synthesis of highly luminescent dual mode upconverting/downshift Y1.94O3:Ho3+0.02/Yb3+0.04 nanorod bundles by a facile hydrothermal route has been introduced. These luminescent nanorod bundles exhibit strong green emission at 549 nm upon excitations at 449 nm and 980 nm with quantum efficiencies of ~6.3% and ~1.1%, respectively. The TEM/HRTEM results confirm that these bundles are composed of several individual nanorods with diameter of ~100 nm and length in the range of 1–3 μm. Furthermore, two dimensional spatially resolved photoluminescence intensity distribution study has been carried out using confocal photoluminescence microscope throughout the nanorod bundles. This study provides a new direction for the potential use of such emerging dual mode nanorod bundles as photon sources for next generation flat panel optical display devices, bio-medical applications, luminescent security ink and enhanced energy harvesting in photovoltaic applications. PMID:28211891

Musical expertise has minimal impact on dual task performance.

PubMed

Cocchini, Gianna; Filardi, Maria Serena; Crhonkova, Marcela; Halpern, Andrea R

2017-05-01

Studies investigating effect of practice on dual task performance have yielded conflicting findings, thus supporting different theoretical accounts about the organisation of attentional resources when tasks are performed simultaneously. Because practice has been proven to reduce the demand of attention for the trained task, the impact of long-lasting training on one task is an ideal way to better understand the mechanisms underlying dual task decline in performance. Our study compared performance during dual task execution in expert musicians compared to controls with little if any musical experience. Participants performed a music recognition task and a visuo-spatial task separately (single task) or simultaneously (dual task). Both groups showed a significant but similar performance decline during dual tasks. In addition, the two groups showed a similar decline of dual task performance during encoding and retrieval of the musical information, mainly attributed to a decline in sensitivity. Our results suggest that attention during dual tasks is similarly distributed by expert and non-experts. These findings are in line with previous studies showing a lack of sensitivity to difficulty and lack of practice effect during dual tasks, supporting the idea that different tasks may rely on different and not-sharable attentional resources.

JobCenter: an open source, cross-platform, and distributed job queue management system optimized for scalability and versatility

PubMed Central

2012-01-01

Background Laboratories engaged in computational biology or bioinformatics frequently need to run lengthy, multistep, and user-driven computational jobs. Each job can tie up a computer for a few minutes to several days, and many laboratories lack the expertise or resources to build and maintain a dedicated computer cluster. Results JobCenter is a client–server application and framework for job management and distributed job execution. The client and server components are both written in Java and are cross-platform and relatively easy to install. All communication with the server is client-driven, which allows worker nodes to run anywhere (even behind external firewalls or “in the cloud”) and provides inherent load balancing. Adding a worker node to the worker pool is as simple as dropping the JobCenter client files onto any computer and performing basic configuration, which provides tremendous ease-of-use, flexibility, and limitless horizontal scalability. Each worker installation may be independently configured, including the types of jobs it is able to run. Executed jobs may be written in any language and may include multistep workflows. Conclusions JobCenter is a versatile and scalable distributed job management system that allows laboratories to very efficiently distribute all computational work among available resources. JobCenter is freely available at http://code.google.com/p/jobcenter/. PMID:22846423

Synthesis and synchrotron characterisation of novel dual-template of hydroxyapatite scaffolds with controlled size porous distribution

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

Lima, Thiago A. R. M.; Ilavsky, Jan; Hammons, Joshua

Hydroxyapatite (HAP) scaffolds with a hierarchical porous architecture were prepared by a new dual-template (corn starch and cetyltrimethylammonium bromide (CTAB) surfactant) used to cast HAP nanoparticles and development scaffolds with size hierarchical porous distribution. The Powder X-Ray diffraction (XRD) results showed that only the HAP crystalline phase is present in the samples after calcination; the Scanning Electron Microscopy (SEM) combined with Small Angle (SAXS) and Ultra-Small Angle X-ray Scattering (USAXS) techniques showed that the porous arrangement is promoted by needle-like HAP nanoparticles, and that the pore size distributions depend on the drip-order of the calcium and the phosphate solutions duringmore » the template preparation stage.« less

Photonic generation of stable microwave signals from a dual-wavelength Al2O3:Yb3+ distributed-feedback waveguide laser.

PubMed

Bernhardi, E H; Khan, M R H; Roeloffzen, C G H; van Wolferen, H A G M; Wörhoff, K; de Ridder, R M; Pollnau, M

2012-01-15

We report the fabrication and characterization of a dual-wavelength distributed-feedback channel waveguide laser in ytterbium-doped aluminum oxide. Operation of the device is based on the optical resonances that are induced by two local phase shifts in the distributed-feedback structure. A stable microwave signal at ~15 GHz with a -3 dB width of 9 kHz was subsequently created via the heterodyne photodetection of the two laser wavelengths. The long-term frequency stability of the microwave signal produced by the free-running laser is better than ±2.5 MHz, while the power of the microwave signal is stable within ±0.35 dB.

Contact problem on indentation of an elastic half-plane with an inhomogeneous coating by a flat punch in the presence of tangential stresses on a surface

NASA Astrophysics Data System (ADS)

Volkov, Sergei S.; Vasiliev, Andrey S.; Aizikovich, Sergei M.; Sadyrin, Evgeniy V.

2018-05-01

Indentation of an elastic half-space with functionally graded coating by a rigid flat punch is studied. The half-plane is additionally subjected to distributed tangential stresses. Tangential stresses are represented in a form of Fourier series. The problem is reduced to the solution of two dual integral equations over even and odd functions describing distribution of unknown normal contact stresses. The solutions of these dual integral equations are constructed by the bilateral asymptotic method. Approximated analytical expressions for contact normal stresses are provided.

In Vivo MR Imaging of Dual MRI Reporter Genes and Deltex-1 Gene-modified Human Mesenchymal Stem Cells in the Treatment of Closed Penile Fracture.

PubMed

Guo, Ruomi; Li, Qingling; Yang, Fei; Hu, Xiaojun; Jiao, Ju; Guo, Yu; Wang, Jin; Zhang, Yong

2018-06-01

The purpose of this study was to investigate the feasibility of dual magnetic resonance imaging (MRI) reporter genes, including ferritin heavy subunit (Fth) and transferrin receptor (TfR), which provide sufficient MRI contrast for in vivo MRI tracking, and the Deltex-1 (DTX1) gene, which promotes human mesenchymal stem cell (hMSC) differentiation to smooth muscle cells (SMCs), to treat closed penile fracture (CPF). Multi-gene co-expressing hMSCs were generated. The expression of mRNA and proteins was assessed, and the original biological properties of hMSCs were determined and compared. The intracellular uptake of iron was evaluated, and the ability to differentiate into SMCs was detected. Fifty rabbits with CPF were randomly transplanted with PBS, hMSCs, Fth-TfR-hMSCs, DTX1-hMSCs, and Fth-TfR-DTX1-hMSCs. In vivo MRI was performed to detect the distribution and migration of the grafted cells and healing progress of CPF, and the results were correlated with histology. The mRNA and proteins of the multi-gene were highly expressed. The transgenes could not influence the original biological properties of hMSCs. The dual MRI reporter genes increased the iron accumulation capacity, and the DTX1 gene promoted hMSC differentiation into SMCs. The distribution and migration of the dual MRI reporter gene-modified hMSCs, and the healing state of CPF could be obviously detected by MRI and confirmed by histology. The dual MRI reporter genes could provide sufficient MRI contrast, and the distribution and migration of MSCs could be detected in vivo. The DTX1 gene can promote MSC differentiation into SMCs for the treatment of CPF and effectively inhibit granulation tissue formation.

Dual-isotope PET using positron-gamma emitters.

PubMed

Andreyev, A; Celler, A

2011-07-21

Positron emission tomography (PET) is widely recognized as a highly effective functional imaging modality. Unfortunately, standard PET cannot be used for dual-isotope imaging (which would allow for simultaneous investigation of two different biological processes), because positron-electron annihilation products from different tracers are indistinguishable in terms of energy. Methods that have been proposed for dual-isotope PET rely on differences in half-lives of the participating isotopes; these approaches, however, require making assumptions concerning kinetic behavior of the tracers and may not lead to optimal results. In this paper we propose a novel approach for dual-isotope PET and investigate its performance using GATE simulations. Our method requires one of the two radioactive isotopes to be a pure positron emitter and the second isotope to emit an additional high-energy gamma in a cascade simultaneously with positron emission. Detection of this auxiliary prompt gamma in coincidence with the annihilation event allows us to identify the corresponding 511 keV photon pair as originating from the same isotope. Two list-mode datasets are created: a primary dataset that contains all detected 511 keV photon pairs from both isotopes, and a second, tagged (much smaller) dataset that contains only those PET events for which a coincident prompt gamma has also been detected. An image reconstructed from the tagged dataset reflects the distribution of the second positron-gamma radiotracer and serves as a prior for the reconstruction of the primary dataset. Our preliminary simulation study with partially overlapping (18)F/(22)Na and (18)F/(60)Cu radiotracer distributions showed that in these two cases the dual-isotope PET method allowed for separation of the two activity distributions and recovered total activities with relative errors of about 5%.

Space Station power distribution and control

NASA Technical Reports Server (NTRS)

Willis, A. H.

1986-01-01

A general description of the Space Station is given with the basic requirements of the power distribution and controls system presented. The dual bus and branch circuit concepts are discussed and a computer control method presented.

Computational strategies for three-dimensional flow simulations on distributed computer systems

NASA Technical Reports Server (NTRS)

Sankar, Lakshmi N.; Weed, Richard A.

1995-01-01

This research effort is directed towards an examination of issues involved in porting large computational fluid dynamics codes in use within the industry to a distributed computing environment. This effort addresses strategies for implementing the distributed computing in a device independent fashion and load balancing. A flow solver called TEAM presently in use at Lockheed Aeronautical Systems Company was acquired to start this effort. The following tasks were completed: (1) The TEAM code was ported to a number of distributed computing platforms including a cluster of HP workstations located in the School of Aerospace Engineering at Georgia Tech; a cluster of DEC Alpha Workstations in the Graphics visualization lab located at Georgia Tech; a cluster of SGI workstations located at NASA Ames Research Center; and an IBM SP-2 system located at NASA ARC. (2) A number of communication strategies were implemented. Specifically, the manager-worker strategy and the worker-worker strategy were tested. (3) A variety of load balancing strategies were investigated. Specifically, the static load balancing, task queue balancing and the Crutchfield algorithm were coded and evaluated. (4) The classical explicit Runge-Kutta scheme in the TEAM solver was replaced with an LU implicit scheme. And (5) the implicit TEAM-PVM solver was extensively validated through studies of unsteady transonic flow over an F-5 wing, undergoing combined bending and torsional motion. These investigations are documented in extensive detail in the dissertation, 'Computational Strategies for Three-Dimensional Flow Simulations on Distributed Computing Systems', enclosed as an appendix.

Computational strategies for three-dimensional flow simulations on distributed computer systems

NASA Astrophysics Data System (ADS)

Sankar, Lakshmi N.; Weed, Richard A.

1995-08-01

This research effort is directed towards an examination of issues involved in porting large computational fluid dynamics codes in use within the industry to a distributed computing environment. This effort addresses strategies for implementing the distributed computing in a device independent fashion and load balancing. A flow solver called TEAM presently in use at Lockheed Aeronautical Systems Company was acquired to start this effort. The following tasks were completed: (1) The TEAM code was ported to a number of distributed computing platforms including a cluster of HP workstations located in the School of Aerospace Engineering at Georgia Tech; a cluster of DEC Alpha Workstations in the Graphics visualization lab located at Georgia Tech; a cluster of SGI workstations located at NASA Ames Research Center; and an IBM SP-2 system located at NASA ARC. (2) A number of communication strategies were implemented. Specifically, the manager-worker strategy and the worker-worker strategy were tested. (3) A variety of load balancing strategies were investigated. Specifically, the static load balancing, task queue balancing and the Crutchfield algorithm were coded and evaluated. (4) The classical explicit Runge-Kutta scheme in the TEAM solver was replaced with an LU implicit scheme. And (5) the implicit TEAM-PVM solver was extensively validated through studies of unsteady transonic flow over an F-5 wing, undergoing combined bending and torsional motion. These investigations are documented in extensive detail in the dissertation, 'Computational Strategies for Three-Dimensional Flow Simulations on Distributed Computing Systems', enclosed as an appendix.

14 CFR 23.511 - Ground load; unsymmetrical loads on multiple-wheel units.

Code of Federal Regulations, 2011 CFR

2011-01-01

... CATEGORY AIRPLANES Structure Ground Loads § 23.511 Ground load; unsymmetrical loads on multiple-wheel units... coefficient of friction of 0.8 applied to the main gear and its supporting structure. (b) Unequal tire loads... distribution, to the dual wheels and tires in each dual wheel landing gear unit. (c) Deflated tire loads. For...

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.

Surface recombination velocity imaging of wet-cleaned silicon wafers using quantitative heterodyne lock-in carrierography

NASA Astrophysics Data System (ADS)

Sun, Qiming; Melnikov, Alexander; Mandelis, Andreas; Pagliaro, Robert H.

2018-01-01

InGaAs-camera based heterodyne lock-in carrierography (HeLIC) is developed for surface recombination velocity (SRV) imaging characterization of bare (oxide-free) hydrogen passivated Si wafer surfaces. Samples prepared using four different hydrofluoric special-solution etching conditions were tested, and a quantitative assessment of their surface quality vs. queue-time after the hydrogen passivation process was made. The data acquisition time for an SRV image was about 3 min. A "round-trip" frequency-scan mode was introduced to minimize the effects of signal transients on data self-consistency. Simultaneous best fitting of HeLIC amplitude-frequency dependencies at various queue-times was used to guarantee the reliability of resolving surface and bulk carrier recombination/transport properties. The dynamic range of the measured SRV values was established from 0.1 to 100 m/s.

Performance Analysis of Power Saving Class of Type 1 with Both Downlink and Uplink Traffics in IEEE 802.16e

NASA Astrophysics Data System (ADS)

Baek, Sangkyu; Choi, Bong Dae

We investigate power consumption of a mobile station with the power saving class of type 1 in the IEEE 802.16e. We deal with stochastic behavior of mobile station during not only sleep mode period but also awake mode period with both downlink and uplink traffics. Our methods for investigating the power saving class of type 1 are to construct the embedded Markov chain and the semi-Markov chain generated by the embedded Markov chain. To see the effect of the sleep mode, we obtain the average power consumption of a mobile station and the mean queueing delay of a message. Numerical results show that the larger size of the sleep window makes the power consumption of a mobile station smaller and the queueing delay of a downlink message longer.

Anomalous Growth of Aging Populations

NASA Astrophysics Data System (ADS)

Grebenkov, Denis S.

2016-04-01

We consider a discrete-time population dynamics with age-dependent structure. At every time step, one of the alive individuals from the population is chosen randomly and removed with probability q_k depending on its age, whereas a new individual of age 1 is born with probability r. The model can also describe a single queue in which the service order is random while the service efficiency depends on a customer's "age" in the queue. We propose a mean field approximation to investigate the long-time asymptotic behavior of the mean population size. The age dependence is shown to lead to anomalous power-law growth of the population at the critical regime. The scaling exponent is determined by the asymptotic behavior of the probabilities q_k at large k. The mean field approximation is validated by Monte Carlo simulations.

Load-sensitive dynamic workflow re-orchestration and optimisation for faster patient healthcare.

PubMed

Meli, Christopher L; Khalil, Ibrahim; Tari, Zahir

2014-01-01

Hospital waiting times are considerably long, with no signs of reducing any-time soon. A number of factors including population growth, the ageing population and a lack of new infrastructure are expected to further exacerbate waiting times in the near future. In this work, we show how healthcare services can be modelled as queueing nodes, together with healthcare service workflows, such that these workflows can be optimised during execution in order to reduce patient waiting times. Services such as X-ray, computer tomography, and magnetic resonance imaging often form queues, thus, by taking into account the waiting times of each service, the workflow can be re-orchestrated and optimised. Experimental results indicate average waiting time reductions are achievable by optimising workflows using dynamic re-orchestration. Crown Copyright © 2013. Published by Elsevier Ireland Ltd. All rights reserved.

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.

Queueing theoretic analysis of labor and delivery : Understanding management styles and C-section rates.

PubMed

Gombolay, Matthew; Golen, Toni; Shah, Neel; Shah, Julie

2017-09-04

Childbirth is a complex clinical service requiring the coordinated support of highly trained healthcare professionals as well as management of a finite set of critical resources (such as staff and beds) to provide safe care. The mode of delivery (vaginal delivery or cesarean section) has a significant effect on labor and delivery resource needs. Further, resource management decisions may impact the amount of time a physician or nurse is able to spend with any given patient. In this work, we employ queueing theory to model one year of transactional patient information at a tertiary care center in Boston, Massachusetts. First, we observe that the M/G/∞ model effectively predicts patient flow in an obstetrics department. This model captures the dynamics of labor and delivery where patients arrive randomly during the day, the duration of their stay is based on their individual acuity, and their labor progresses at some rate irrespective of whether they are given a bed. Second, using our queueing theoretic model, we show that reducing the rate of cesarean section - a current quality improvement goal in American obstetrics - may have important consequences with regard to the resource needs of a hospital. We also estimate the potential financial impact of these resource needs from the hospital perspective. Third, we report that application of our model to an analysis of potential patient coverage strategies supports the adoption of team-based care, in which attending physicians share responsibilities for patients.

Scheduling Algorithms for Maximizing Throughput with Zero-Forcing Beamforming in a MIMO Wireless System

NASA Astrophysics Data System (ADS)

Foronda, Augusto; Ohta, Chikara; Tamaki, Hisashi

Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.

Opendf - An Implementation of the Dual Fermion Method for Strongly Correlated Systems

NASA Astrophysics Data System (ADS)

Antipov, Andrey E.; LeBlanc, James P. F.; Gull, Emanuel

The dual fermion method is a multiscale approach for solving lattice problems of interacting strongly correlated systems. In this paper, we present the opendfcode, an open-source implementation of the dual fermion method applicable to fermionic single- orbital lattice models in dimensions D = 1, 2, 3 and 4. The method is built on a dynamical mean field starting point, which neglects all local correlations, and perturbatively adds spatial correlations. Our code is distributed as an open-source package under the GNU public license version 2.

Design of Distributed Engine Control Systems for Stability Under Communication Packet Dropouts

DTIC Science & Technology

2009-08-01

remarks. II. Distributed Engine Control Systems A. FADEC based on Distributed Engine Control Architecture (DEC) In Distributed Engine...Control, the functions of Full Authority Digital Engine Control ( FADEC ) are distributed at the component level. Each sensor/actuator is to be replaced...diagnostics and health management functionality. Dual channel digital serial communication network is used to connect these smart modules with FADEC . Fig

Data-Driven Human Rights: Using Dual Loyalty Trainings to Promote the Care of Vulnerable Patients in Jail.

PubMed

Glowa-Kollisch, Sarah; Graves, Jasmine; Dickey, Nathaniel; MacDonald, Ross; Rosner, Zachary; Waters, Anthony; Venters, Homer

2015-06-11

Dual loyalty is an omnipresent feature of correctional health. As part of a human rights quality improvement committee, and utilizing the unique advantage of a fully integrated electronic health record system, we undertook an assessment of dual loyalty in the New York City jail system. The evaluation revealed significant concerns about the extent to which the mental health service is involved in assessments that are part of the punishment process of the security apparatus. As a result, dual loyalty training was developed and delivered to all types of health staff in the jail system via anonymous survey. Six clinical scenarios were presented in this training and staff members were asked to indicate whether they had encountered similar circumstances and how they would respond. Staff responses to the survey raised concerns about the frequency with which they are pressured or asked to put aside their primary goal of patient care for the interests of the security mission. The online training and follow-up small group sessions have revealed widespread support for more training on dual loyalty. Copyright 2015 Glowa-Kollisch et al. This is an open access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0/), which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original author and source are credited.

A Management Information System Model for Program Management. Ph.D. Thesis - Oklahoma State Univ.; [Computerized Systems Analysis

NASA Technical Reports Server (NTRS)

Shipman, D. L.

1972-01-01

The development of a model to simulate the information system of a program management type of organization is reported. The model statistically determines the following parameters: type of messages, destinations, delivery durations, type processing, processing durations, communication channels, outgoing messages, and priorites. The total management information system of the program management organization is considered, including formal and informal information flows and both facilities and equipment. The model is written in General Purpose System Simulation 2 computer programming language for use on the Univac 1108, Executive 8 computer. The model is simulated on a daily basis and collects queue and resource utilization statistics for each decision point. The statistics are then used by management to evaluate proposed resource allocations, to evaluate proposed changes to the system, and to identify potential problem areas. The model employs both empirical and theoretical distributions which are adjusted to simulate the information flow being studied.

PhamDB: a web-based application for building Phamerator databases.

PubMed

Lamine, James G; DeJong, Randall J; Nelesen, Serita M

2016-07-01

PhamDB is a web application which creates databases of bacteriophage genes, grouped by gene similarity. It is backwards compatible with the existing Phamerator desktop software while providing an improved database creation workflow. Key features include a graphical user interface, validation of uploaded GenBank files, and abilities to import phages from existing databases, modify existing databases and queue multiple jobs. Source code and installation instructions for Linux, Windows and Mac OSX are freely available at https://github.com/jglamine/phage PhamDB is also distributed as a docker image which can be managed via Kitematic. This docker image contains the application and all third party software dependencies as a pre-configured system, and is freely available via the installation instructions provided. snelesen@calvin.edu. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Running Jobs on the Peregrine System | High-Performance Computing | NREL

Science.gov Websites

on the Peregrine high-performance computing (HPC) system. Running Different Types of Jobs Batch jobs scheduling policies - queue names, limits, etc. Requesting different node types Sample batch scripts

32 CFR 701.9 - Referrals.

Code of Federal Regulations, 2010 CFR

2010-07-01

... DoD/DON FOIA referral policy is based upon the concept of the originator of a record making a release... referred request shall place it in the appropriate processing queue based on the date it was initially...

Optimal Resource Allocation in Library Systems

ERIC Educational Resources Information Center

Rouse, William B.

1975-01-01

Queueing theory is used to model processes as either waiting or balking processes. The optimal allocation of resources to these processes is defined as that which maximizes the expected value of the decision-maker's utility function. (Author)

Traffic signal coordination and queue management in oversaturated intersection.

DOT National Transportation Integrated Search

2011-03-18

Traffic signal timing optimization when done properly, could significantly improve network : performance by reducing delay, increasing network throughput, reducing number of stops, or : increasing average speed in the network. The optimization can be...

Traffic signal coordination and queue management in oversaturated intersections.

DOT National Transportation Integrated Search

2011-03-18

Traffic signal timing optimization when done properly, could significantly improve network performance by reducing delay, increasing network throughput, reducing number of stops, or increasing average speed in the network. The optimization can become...

Left-Turn Bays

DOT National Transportation Integrated Search

1996-05-01

The topic of left-turn bays (left-turn lanes) involves the following three issues: 1.) Warrants; 2.) Bay Length and 3.) Design Details. This discussion paper deals with warrants and bay length -- including queue storage at signalized and unsignalized...

Design of a dual linear polarization antenna using split ring resonators at X-band

NASA Astrophysics Data System (ADS)

Ahmed, Sadiq; Chandra, Madhukar

2017-11-01

Dual linear polarization microstrip antenna configurations are very suitable for high-performance satellites, wireless communication and radar applications. This paper presents a new method to improve the co-cross polarization discrimination (XPD) for dual linear polarized microstrip antennas at 10 GHz. For this, three various configurations of a dual linear polarization antenna utilizing metamaterial unit cells are shown. In the first layout, the microstrip patch antenna is loaded with two pairs of spiral ring resonators, in the second model, a split ring resonator is placed between two microstrip feed lines, and in the third design, a complementary split ring resonators are etched in the ground plane. This work has two primary goals: the first is related to the addition of metamaterial unit cells to the antenna structure which permits compensation for an asymmetric current distribution flow on the microstrip antenna and thus yields a symmetrical current distribution on it. This compensation leads to an important enhancement in the XPD in comparison to a conventional dual linear polarized microstrip patch antenna. The simulation reveals an improvement of 7.9, 8.8, and 4 dB in the E and H planes for the three designs, respectively, in the XPD as compared to the conventional dual linear polarized patch antenna. The second objective of this paper is to present the characteristics and performances of the designs of the spiral ring resonator (S-RR), split ring resonator (SRR), and complementary split ring resonator (CSRR) metamaterial unit cells. The simulations are evaluated using the commercial full-wave simulator, Ansoft High-Frequency Structure Simulator (HFSS).

A numerical study on dual-phase-lag model of bio-heat transfer during hyperthermia treatment.

PubMed

Kumar, P; Kumar, Dinesh; Rai, K N

2015-01-01

The success of hyperthermia in the treatment of cancer depends on the precise prediction and control of temperature. It was absolutely a necessity for hyperthermia treatment planning to understand the temperature distribution within living biological tissues. In this paper, dual-phase-lag model of bio-heat transfer has been studied using Gaussian distribution source term under most generalized boundary condition during hyperthermia treatment. An approximate analytical solution of the present problem has been done by Finite element wavelet Galerkin method which uses Legendre wavelet as a basis function. Multi-resolution analysis of Legendre wavelet in the present case localizes small scale variations of solution and fast switching of functional bases. The whole analysis is presented in dimensionless form. The dual-phase-lag model of bio-heat transfer has compared with Pennes and Thermal wave model of bio-heat transfer and it has been found that large differences in the temperature at the hyperthermia position and time to achieve the hyperthermia temperature exist, when we increase the value of τT. Particular cases when surface subjected to boundary condition of 1st, 2nd and 3rd kind are discussed in detail. The use of dual-phase-lag model of bio-heat transfer and finite element wavelet Galerkin method as a solution method helps in precise prediction of temperature. Gaussian distribution source term helps in control of temperature during hyperthermia treatment. So, it makes this study more useful for clinical applications. Copyright © 2015 Elsevier Ltd. All rights reserved.

Coordinated Translanguaging Pedagogy as Distributed Cognition: A Case Study of Two Dual Language Bilingual Education Preschool Coteachers' Languaging Practices during Shared Book Readings

ERIC Educational Resources Information Center

Pontier, Ryan; Gort, Mileidis

2016-01-01

This study examined how a pair of Spanish/English dual language bilingual education (DLBE) preschool teachers enacted their bilingualism while working cohesively and simultaneously toward common instructional goals. We drew on classroom video data, field notes, and other relevant artifacts collected weekly during shared readings of English- and…

Frequency stability of a dual wavelength quantum cascade laser.

PubMed

Sergachev, Ilia; Maulini, Richard; Gresch, Tobias; Blaser, Stéphane; Bismuto, Alfredo; Müller, Antoine; Bidaux, Yves; Südmeyer, Thomas; Schilt, Stéphane

2017-05-15

We characterized the dual wavelength operation of a distributed Bragg reflector (DBR) quantum cascade laser (QCL) operating at 4.5 μm using two independent optical frequency discriminators. The QCL emits up to 150 mW fairly evenly distributed between two adjacent Fabry-Perot modes separated by ≈11.6 GHz. We show a strong correlation between the instantaneous optical frequencies of the two lasing modes, characterized by a Pearson correlation coefficient of 0.96. As a result, we stabilized one laser mode of the QCL to a N 2 O transition using a side-of-fringe locking technique, reducing its linewidth by a factor 6.2, from 406 kHz in free-running operation down to 65 kHz (at 1-ms observation time), and observed a simultaneous reduction of the frequency fluctuations of the second mode by a similar amount, resulting in a linewidth narrowing by a factor 5.4, from 380 kHz to 70 kHz. This proof-of-principle demonstration was performed with a standard DBR QCL that was not deliberately designed for dual-mode operation. These promising results open the door to the fabrication of more flexible dual-mode QCLs with the use of specifically designed gratings in the future.

System design document for the INFLO prototype.

DOT National Transportation Integrated Search

2014-03-01

This report documents the high level System Design Document (SDD) for the prototype development and demonstration of the Intelligent Network Flow Optimization (INFLO) application bundle, with a focus on the Speed Harmonization (SPD-HARM) and Queue Wa...

Functional Intersection Area -- Oregon Department of Transportation

DOT National Transportation Integrated Search

1996-01-01

This discussion paper addresses the concepts involved in defining the functional area of an intersection. The elements which comprise the upstream functional area are identified; dimensions of the upstream area exclusive of queue storage, are given f...

Determining queue and congestion in highway work zone bottlenecks.

DOT National Transportation Integrated Search

2011-03-11

Construction zones, though required for infrastructure maintenance, have become congestion choke points on most highway systems in the US. The congestion may create potentially unsafe driving conditions for approaching motorists that do not expect qu...

Determining Queue and Congestion in Highway Work Zone Bottlenecks

DOT National Transportation Integrated Search

2011-03-11

Construction zones, though required for infrastructure maintenance, have become congestion choke points on most highway systems in the US. The congestion may create potentially unsafe driving conditions for approaching motorists that do not expect qu...

L'astronomie dans le monde

NASA Astrophysics Data System (ADS)

Manfroid, J.

2016-06-01

Chocs d’amas - Amas de galaxies - Halos sur Pluton - Makémaké - Comète sans queue – Titan – Planètes Kepler - Transit de Mercure - Quatre lasers au-dessus de Paranal – NGC 1332 - Eau sur Mars

A method of operation scheduling based on video transcoding for cluster equipment

NASA Astrophysics Data System (ADS)

Zhou, Haojie; Yan, Chun

2018-04-01

Because of the cluster technology in real-time video transcoding device, the application of facing the massive growth in the number of video assignments and resolution and bit rate of diversity, task scheduling algorithm, and analyze the current mainstream of cluster for real-time video transcoding equipment characteristics of the cluster, combination with the characteristics of the cluster equipment task delay scheduling algorithm is proposed. This algorithm enables the cluster to get better performance in the generation of the job queue and the lower part of the job queue when receiving the operation instruction. In the end, a small real-time video transcode cluster is constructed to analyze the calculation ability, running time, resource occupation and other aspects of various algorithms in operation scheduling. The experimental results show that compared with traditional clustering task scheduling algorithm, task delay scheduling algorithm has more flexible and efficient characteristics.

Effect of information, uncertainty and parameter variability on profits in a queue with various pricing strategies

NASA Astrophysics Data System (ADS)

Sun, Wei; Li, Shiyong

2014-08-01

This paper presents an unobservable single-server queueing system with three types of uncertainty, where the service rate, or waiting cost or service quality is random variable that may obtain n(n > 2) values. The information about the realised values of parameters is only known to the server. We are concerned about the server's behaviour: revealing or concealing the information to customers. The n-value assumption and the server's behaviour enable us to consider various pricing strategies. In this paper, we analyse the effect of information and uncertainty on profits and make comparisons between the profits under different pricing strategies. Moreover, as for parameter variability reflected by the number of each parameter's possible choices n, we observe the effect of variable n on all types of profits and find that revealing the parameter information can much more benefit the server with the increase of n.

Remote Observing and Automatic FTP on Kitt Peak

NASA Astrophysics Data System (ADS)

Seaman, Rob; Bohannan, Bruce

As part of KPNO's Internet-based observing services we experimented with the publically available audio, video and whiteboard MBONE clients (vat, nv, wb and others) in both point-to-point and multicast modes. While bandwidth is always a constraint on the Internet, it is less of a constraint to operations than many might think. These experiments were part of two new Internet-based observing services offered to KPNO observers beginning with the Fall 1995 semester: a remote observing station and an automatic FTP data queue. The remote observing station seeks to duplicate the KPNO IRAF/ICE observing environment on a workstation at the observer's home institution. The automatic FTP queue is intended to support those observing programs that require quick transport of data back to the home institution, for instance, for near real time reductions to aid in observing tactics. We also discuss the early operational results of these services.

Consultation sequencing of a hospital with multiple service points using genetic programming

NASA Astrophysics Data System (ADS)

Morikawa, Katsumi; Takahashi, Katsuhiko; Nagasawa, Keisuke

2018-07-01

A hospital with one consultation room operated by a physician and several examination rooms is investigated. Scheduled patients and walk-ins arrive at the hospital, each patient goes to the consultation room first, and some of them visit other service points before consulting the physician again. The objective function consists of the sum of three weighted average waiting times. The problem of sequencing patients for consultation is focused. To alleviate the stress of waiting, the consultation sequence is displayed. A dispatching rule is used to decide the sequence, and best rules are explored by genetic programming (GP). The simulation experiments indicate that the rules produced by GP can be reduced to simple permutations of queues, and the best permutation depends on the weight used in the objective function. This implies that a balanced allocation of waiting times can be achieved by ordering the priority among three queues.

Territory inheritance in clownfish.

PubMed Central

Buston, Peter M

2004-01-01

Animal societies composed of breeders and non-breeders present a challenge to evolutionary theory because it is not immediately apparent how natural selection can preserve the genes that underlie non-breeding strategies. The clownfish Amphiprion percula forms groups composed of a breeding pair and 0-4 non-breeders. Non-breeders gain neither present direct, nor present indirect benefits from the association. To determine whether non-breeders obtain future direct benefits, I investigated the pattern of territory inheritance. I show that non-breeders stand to inherit the territory within which they reside. Moreover, they form a perfect queue for breeding positions; a queue from which nobody disperses and within which nobody contests. I suggest that queuing might be favoured by selection because it confers a higher probability of attaining breeding status than either dispersing or contesting. This study illustrates that, within animal societies, individuals may tolerate non-breeding positions solely because of their potential to realize benefits in the future. PMID:15252999

VSHC -- VAXstation VWS hardcopy

NASA Astrophysics Data System (ADS)

Huckle, H. E.; Clayton, C. A.

VSHC works when a detached process is run at boot time which runs a .EXE file that creates a permanent mailbox and redefines UISPRINT_DESTINATION to that mailbox. The program then goes into an infinite loop which includes a read to that mailbox. When a hardcopy is initiated, sixel graphics commands are sent to UISPRINT_DESTINATION and thus go to the mailbox. The program then reads those graphics commands from the mailbox and interprets them into equivalent Canon commands, using a `State Machine' technique to determine how far it's got, i.e. is it a start of a plot, end of plot, middle of plot, next plot etc. It spools the file of Canon graphics commands thus created (in VSHC_SCRATCH:), to a queue pointed at by the logical name VSHC_QUEUE. UISPRINT_DESTINATION can be mysteriously reset to its default value of CSA0: and so every few minutes an AST timeout occurs to reset UISPRINT_DESTINATION.

Is follow-up capacity the current NHS bottleneck?

PubMed

Allder, Steven; Walley, Paul; Silvester, Kate

2011-02-01

Capacity and demand theory suggests that the presence of a queue is not necessarily an indication of a shortage of capacity in a system. It is much more likely that either there is a demand and capacity variation that creates queues or there is a delay designed into the system. A shortage of capacity is only really indicated where a backlog is not stable and continues to grow. In this article, data are taken from one NHS trust that provides evidence for a continually growing backlog for follow-up outpatient services. It is believed that these data are representative of most locations within the NHS in England and therefore suggest an immediate shortage in effective follow-up capacity. To avoid compromise to patient care, the problem will have to be addressed before the situation becomes unmanageable. The paper highlights options to reduce or deflect demand or to increase effective capacity.

Territory inheritance in clownfish.

PubMed

Buston, Peter M

2004-05-07

Animal societies composed of breeders and non-breeders present a challenge to evolutionary theory because it is not immediately apparent how natural selection can preserve the genes that underlie non-breeding strategies. The clownfish Amphiprion percula forms groups composed of a breeding pair and 0-4 non-breeders. Non-breeders gain neither present direct, nor present indirect benefits from the association. To determine whether non-breeders obtain future direct benefits, I investigated the pattern of territory inheritance. I show that non-breeders stand to inherit the territory within which they reside. Moreover, they form a perfect queue for breeding positions; a queue from which nobody disperses and within which nobody contests. I suggest that queuing might be favoured by selection because it confers a higher probability of attaining breeding status than either dispersing or contesting. This study illustrates that, within animal societies, individuals may tolerate non-breeding positions solely because of their potential to realize benefits in the future.

Replenishing data descriptors in a DMA injection FIFO buffer

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Cernohous, Bob R [Rochester, MN; Heidelberger, Philip [Cortlandt Manor, NY; Kumar, Sameer [White Plains, NY; Parker, Jeffrey J [Rochester, MN

2011-10-11

Methods, apparatus, and products are disclosed for replenishing data descriptors in a Direct Memory Access (`DMA`) injection first-in-first-out (`FIFO`) buffer that include: determining, by a messaging module on an origin compute node, whether a number of data descriptors in a DMA injection FIFO buffer exceeds a predetermined threshold, each data descriptor specifying an application message for transmission to a target compute node; queuing, by the messaging module, a plurality of new data descriptors in a pending descriptor queue if the number of the data descriptors in the DMA injection FIFO buffer exceeds the predetermined threshold; establishing, by the messaging module, interrupt criteria that specify when to replenish the injection FIFO buffer with the plurality of new data descriptors in the pending descriptor queue; and injecting, by the messaging module, the plurality of new data descriptors into the injection FIFO buffer in dependence upon the interrupt criteria.

FIELD COMPARISONS OF DUAL SMPS-APS SYSTEMS TO MEASURE INDOOR-OUTDOOR PARTICLE SIZE DISTRIBUTIONS

EPA Science Inventory

Simultaneous measurements of particle size distributions across multiple locations can provide critical information to accurately assess human exposure to particles. These data are very useful to describe indoor-outdoor particle relationships, outdoor particle penetration thro...

The productivity and cost-efficiency of models for involving nurse practitioners in primary care: a perspective from queueing analysis.

PubMed

Liu, Nan; D'Aunno, Thomas

2012-04-01

To develop simple stylized models for evaluating the productivity and cost-efficiencies of different practice models to involve nurse practitioners (NPs) in primary care, and in particular to generate insights on what affects the performance of these models and how. The productivity of a practice model is defined as the maximum number of patients that can be accounted for by the model under a given timeliness-to-care requirement; cost-efficiency is measured by the corresponding annual cost per patient in that model. Appropriate queueing analysis is conducted to generate formulas and values for these two performance measures. Model parameters for the analysis are extracted from the previous literature and survey reports. Sensitivity analysis is conducted to investigate the model performance under different scenarios and to verify the robustness of findings. Employing an NP, whose salary is usually lower than a primary care physician, may not be cost-efficient, in particular when the NP's capacity is underutilized. Besides provider service rates, workload allocation among providers is one of the most important determinants for the cost-efficiency of a practice model involving NPs. Capacity pooling among providers could be a helpful strategy to improve efficiency in care delivery. The productivity and cost-efficiency of a practice model depend heavily on how providers organize their work and a variety of other factors related to the practice environment. Queueing theory provides useful tools to take into account these factors in making strategic decisions on staffing and panel size selection for a practice model. © Health Research and Educational Trust.

Just-in-time connectivity for large spiking networks.

PubMed

Lytton, William W; Omurtag, Ahmet; Neymotin, Samuel A; Hines, Michael L

2008-11-01

The scale of large neuronal network simulations is memory limited due to the need to store connectivity information: connectivity storage grows as the square of neuron number up to anatomically relevant limits. Using the NEURON simulator as a discrete-event simulator (no integration), we explored the consequences of avoiding the space costs of connectivity through regenerating connectivity parameters when needed: just in time after a presynaptic cell fires. We explored various strategies for automated generation of one or more of the basic static connectivity parameters: delays, postsynaptic cell identities, and weights, as well as run-time connectivity state: the event queue. Comparison of the JitCon implementation to NEURON's standard NetCon connectivity method showed substantial space savings, with associated run-time penalty. Although JitCon saved space by eliminating connectivity parameters, larger simulations were still memory limited due to growth of the synaptic event queue. We therefore designed a JitEvent algorithm that added items to the queue only when required: instead of alerting multiple postsynaptic cells, a spiking presynaptic cell posted a callback event at the shortest synaptic delay time. At the time of the callback, this same presynaptic cell directly notified the first postsynaptic cell and generated another self-callback for the next delay time. The JitEvent implementation yielded substantial additional time and space savings. We conclude that just-in-time strategies are necessary for very large network simulations but that a variety of alternative strategies should be considered whose optimality will depend on the characteristics of the simulation to be run.

Just in time connectivity for large spiking networks

PubMed Central

Lytton, William W.; Omurtag, Ahmet; Neymotin, Samuel A; Hines, Michael L

2008-01-01

The scale of large neuronal network simulations is memory-limited due to the need to store connectivity information: connectivity storage grows as the square of neuron number up to anatomically-relevant limits. Using the NEURON simulator as a discrete-event simulator (no integration), we explored the consequences of avoiding the space costs of connectivity through regenerating connectivity parameters when needed – just-in-time after a presynaptic cell fires. We explored various strategies for automated generation of one or more of the basic static connectivity parameters: delays, postsynaptic cell identities and weights, as well as run-time connectivity state: the event queue. Comparison of the JitCon implementation to NEURON’s standard NetCon connectivity method showed substantial space savings, with associated run-time penalty. Although JitCon saved space by eliminating connectivity parameters, larger simulations were still memory-limited due to growth of the synaptic event queue. We therefore designed a JitEvent algorithm that only added items to the queue when required: instead of alerting multiple postsynaptic cells, a spiking presynaptic cell posted a callback event at the shortest synaptic delay time. At the time of the callback, this same presynaptic cell directly notified the first postsynaptic cell and generated another self-callback for the next delay time. The JitEvent implementation yielded substantial additional time and space savings. We conclude that just-in-time strategies are necessary for very large network simulations but that a variety of alternative strategies should be considered whose optimality will depend on the characteristics of the simulation to be run. PMID:18533821

Reproductive queue without overt conflict in the primitively eusocial wasp Ropalidia marginata

PubMed Central

Bang, Alok; Gadagkar, Raghavendra

2012-01-01

Colonies of the primitively eusocial wasp Ropalidia marginata consist of a single egg layer (queen) and a number of non–egg-laying workers. Although the queen is a docile individual, not at the top of the behavioral dominance hierarchy of the colony, she maintains complete reproductive monopoly. If the queen is lost or removed, one and only one of the workers [potential queen (PQ)] becomes hyperaggressive and will become the next queen of the colony. The PQ is almost never challenged because she first becomes hyperaggressive and then gradually loses her aggression, develops her ovaries, and starts laying eggs. Although we are unable to identify the PQ when the queen is present, she appears to be a “cryptic heir designate.” Here, we show that there is not just one heir designate but a long reproductive queue and that PQs take over the role of egg-laying, successively, without overt conflict, as the queen or previous PQs are removed. The dominance rank of an individual is not a significant predictor of its position in the succession hierarchy. The age of an individual is a significant predictor, but it is not a perfect predictor because PQs often bypass older individuals to become successors. We suggest that such a predesignated reproductive queue that is implemented without overt conflict is adaptive in the tropics, where conspecific usurpers from outside the colony, which can take advantage of the anarchy prevailing in a queenless colony and invade it, are likely to be present throughout the year. PMID:22908278

Multiport Multiplex Program

DTIC Science & Technology

1975-02-01

UNCLASSIFIED AD NUMBER LIMITATION CHANGES TO: FROM: AUTHORITY THIS PAGE IS UNCLASSIFIED ADB013811 Approved for public release; distribution is...of Changing Sampling Frequency and Bits/Sample 13 Image Coding Methods 63 Basic Dual-Mode Coder Code Assignment 73 Oversampled Dual...results from the threshold at which a 1 bit will oe trans- mitted. The threshold corresponds to a finite change on the gray scale or resolution of the

Work distributions of one-dimensional fermions and bosons with dual contact interactions

NASA Astrophysics Data System (ADS)

Wang, Bin; Zhang, Jingning; Quan, H. T.

2018-05-01

We extend the well-known static duality [M. Girardeau, J. Math. Phys. 1, 516 (1960), 10.1063/1.1703687; T. Cheon and T. Shigehara, Phys. Rev. Lett. 82, 2536 (1999), 10.1103/PhysRevLett.82.2536] between one-dimensional (1D) bosons and 1D fermions to the dynamical version. By utilizing this dynamical duality, we find the duality of nonequilibrium work distributions between interacting 1D bosonic (Lieb-Liniger model) and 1D fermionic (Cheon-Shigehara model) systems with dual contact interactions. As a special case, the work distribution of the Tonks-Girardeau gas is identical to that of 1D noninteracting fermionic system even though their momentum distributions are significantly different. In the classical limit, the work distributions of Lieb-Liniger models (Cheon-Shigehara models) with arbitrary coupling strength converge to that of the 1D noninteracting distinguishable particles, although their elementary excitations (quasiparticles) obey different statistics, e.g., the Bose-Einstein, the Fermi-Dirac, and the fractional statistics. We also present numerical results of the work distributions of Lieb-Liniger model with various coupling strengths, which demonstrate the convergence of work distributions in the classical limit.

Particle swarm optimization algorithm for optimizing assignment of blood in blood banking system.

PubMed

Olusanya, Micheal O; Arasomwan, Martins A; Adewumi, Aderemi O

2015-01-01

This paper reports the performance of particle swarm optimization (PSO) for the assignment of blood to meet patients' blood transfusion requests for blood transfusion. While the drive for blood donation lingers, there is need for effective and efficient management of available blood in blood banking systems. Moreover, inherent danger of transfusing wrong blood types to patients, unnecessary importation of blood units from external sources, and wastage of blood products due to nonusage necessitate the development of mathematical models and techniques for effective handling of blood distribution among available blood types in order to minimize wastages and importation from external sources. This gives rise to the blood assignment problem (BAP) introduced recently in literature. We propose a queue and multiple knapsack models with PSO-based solution to address this challenge. Simulation is based on sets of randomly generated data that mimic real-world population distribution of blood types. Results obtained show the efficiency of the proposed algorithm for BAP with no blood units wasted and very low importation, where necessary, from outside the blood bank. The result therefore can serve as a benchmark and basis for decision support tools for real-life deployment.

32 CFR 1800.33 - Allocation of resources; agreed extensions of time.

Code of Federal Regulations, 2010 CFR

2010-07-01

... strictly “first-in, first-out” basis and utilizing two or more processing queues to ensure that smaller as... Coordinator is responsible for management of the NACIC-wide program defined by this part and for establishing...

32 CFR 1801.33 - Allocation of resources; agreed extensions of time.

Code of Federal Regulations, 2010 CFR

2010-07-01

...” basis and utilizing two or more processing queues to ensure that smaller as well as larger (i.e... management of the NACIC-wide program defined by this part and for establishing priorities for cases...

MODEL FOR INSTANTANEOUS RESIDENTIAL WATER DEMANDS

EPA Science Inventory

Residential wateer use is visualized as a customer-server interaction often encountered in queueing theory. Individual customers are assumed to arrive according to a nonhomogeneous Poisson process, then engage water servers for random lengths of time. Busy servers are assumed t...

Work zone lane closure analysis model.

DOT National Transportation Integrated Search

2009-10-01

At the Alabama Department of Transportation (ALDOT), the tool used by traffic engineers to predict whether a queue will form at a freeway work zone is the Excel-based "Lane Rental Model" developed at the Oklahoma Department of Transportation (OkDOT) ...

Clinic flow for STI, HIV, and TB patients in an urban infectious disease clinic offering point-of-care testing services in Durban, South Africa.

PubMed

Stime, Katrina J; Garrett, Nigel; Sookrajh, Yukteshwar; Dorward, Jienchi; Dlamini, Ntuthu; Olowolagba, Ayo; Sharma, Monisha; Barnabas, Ruanne V; Drain, Paul K

2018-05-11

Many clinics in Southern Africa have long waiting times. The implementation of point-of-care (POC) tests to accelerate diagnosis and improve clinical management in resource-limited settings may improve or worsen clinic flow and waiting times. The objective of this study was to describe clinic flow with special emphasis on the impact of POC testing at a large urban public healthcare clinic in Durban, South Africa. We used time and motion methods to directly observe patients and practitioners. We created patient flow maps and recorded individual patient waiting and consultation times for patients seeking STI, TB, or HIV care. We conducted semi-structured interviews with 20 clinic staff to ascertain staff opinions on clinic flow and POC test implementation. Among 121 observed patients, the total number of queues ranged from 4 to 7 and total visit times ranged from 0:14 (hours:minutes) to 7:38. Patients waited a mean of 2:05 for standard-of-care STI management, and approximately 4:56 for STI POC diagnostic testing. Stable HIV patients who collected antiretroviral therapy refills waited a mean of 2:42 in the standard queue and 2:26 in the fast-track queue. A rapid TB test on a small sample of patients with the Xpert MTB/RIF assay and treatment initiation took a mean of 6:56, and 40% of patients presenting with TB-related symptoms were asked to return for an additional clinic visit to obtain test results. For all groups, the mean clinical assessment time with a nurse or physician was 7 to 9 min, which accounted for 2 to 6% of total visit time. Staff identified poor clinic flow and personnel shortages as areas of concern that may pose challenges to expanding POC tests in the current clinic environment. This busy urban clinic had multiple patient queues, long clinical visits, and short clinical encounters. Although POC testing ensured patients received a diagnosis sooner, it more than doubled the time STI patients spent at the clinic and did not result in same-day diagnosis for all patients screened for TB. Further research on implementing POC testing efficiently into care pathways is required to make these promising assays a success.

The Joint Distribution Process Analysis Center (JDPAC): Background and Current Capability

DTIC Science & Technology

2007-06-12

Systems Integration and Data Management JDDE Analysis/Global Distribution Performance Assessment Futures/Transformation Analysis Balancing Operational Art ... Science JDPAC “101” USTRANSCOM Future Operations Center SDDC – TEA Army SES (Dual Hat) • Transportability Engineering • Other Title 10

Glioma targeting and blood-brain barrier penetration by dual-targeting doxorubincin liposomes.

PubMed

Gao, Jian-Qing; Lv, Qing; Li, Li-Ming; Tang, Xin-Jiang; Li, Fan-Zhu; Hu, Yu-Lan; Han, Min

2013-07-01

Effective chemotherapy for glioblastoma requires a carrier that can penetrate the blood-brain barrier (BBB) and subsequently target the glioma cells. Dual-targeting doxorubincin (Dox) liposomes were produced by conjugating liposomes with both folate (F) and transferrin (Tf), which were proven effective in penetrating the BBB and targeting tumors, respectively. The liposome was characterized by particle size, Dox entrapment efficiency, and in vitro release profile. Drug accumulation in cells, P-glycoprotein (P-gp) expression, and drug transport across the BBB in the dual-targeting liposome group were examined by using bEnd3 BBB models. In vivo studies demonstrated that the dual-targeting Dox liposomes could transport across the BBB and mainly distribute in the brain glioma. The anti-tumor effect of the dual-targeting liposome was also demonstrated by the increased survival time, decreased tumor volume, and results of both hematoxylin-eosin staining and terminal deoxynucleotidyl transferase dUTP nick end labeling analysis. The dual-targeting Dox liposome could improve the therapeutic efficacy of brain glioma and were less toxic than the Dox solution, showing a dual-targeting effect. These results indicate that this dual-targeting liposome can be used as a potential carrier for glioma chemotherapy. Copyright © 2013 Elsevier Ltd. All rights reserved.

Gadolinium embedded iron oxide nanoclusters as T1-T2 dual-modal MRI-visible vectors for safe and efficient siRNA delivery

NASA Astrophysics Data System (ADS)

Wang, Xiaoyong; Zhou, Zijian; Wang, Zhiyong; Xue, Yunxin; Zeng, Yun; Gao, Jinhao; Zhu, Lei; Zhang, Xianzhong; Liu, Gang; Chen, Xiaoyuan

2013-08-01

This report illustrates a new strategy of designing a T1-T2 dual-modal magnetic resonance imaging (MRI)-visible vector for siRNA delivery and MRI. Hydrophobic gadolinium embedded iron oxide (GdIO) nanocrystals are self-assembled into nanoclusters in the water phase with the help of stearic acid modified low molecular weight polyethylenimine (stPEI). The resulting water-dispersible GdIO-stPEI nanoclusters possess good stability, monodispersity with narrow size distribution and competitive T1-T2 dual-modal MR imaging properties. The nanocomposite system is capable of binding and delivering siRNA for knockdown of a gene of interest while maintaining its magnetic properties and biocompatibility. This new gadolinium embedded iron oxide nanocluster provides an important platform for safe and efficient gene delivery with non-invasive T1-T2 dual-modal MRI monitoring capability.This report illustrates a new strategy of designing a T1-T2 dual-modal magnetic resonance imaging (MRI)-visible vector for siRNA delivery and MRI. Hydrophobic gadolinium embedded iron oxide (GdIO) nanocrystals are self-assembled into nanoclusters in the water phase with the help of stearic acid modified low molecular weight polyethylenimine (stPEI). The resulting water-dispersible GdIO-stPEI nanoclusters possess good stability, monodispersity with narrow size distribution and competitive T1-T2 dual-modal MR imaging properties. The nanocomposite system is capable of binding and delivering siRNA for knockdown of a gene of interest while maintaining its magnetic properties and biocompatibility. This new gadolinium embedded iron oxide nanocluster provides an important platform for safe and efficient gene delivery with non-invasive T1-T2 dual-modal MRI monitoring capability. Electronic supplementary information (ESI) available. See DOI: 10.1039/c3nr02797j

In the queue for total joint replacement: patients' perspectives on waiting times. Ontario Hip and Knee Replacement Project Team.

PubMed

Llewellyn-Thomas, H A; Arshinoff, R; Bell, M; Williams, J I; Naylor, C D

1998-02-01

We assessed patients on the waiting lists of a purposive sample of orthopaedic surgeons in Ontario, Canada, to determine patients' attitudes towards time waiting for hip or knee replacement. We focused on 148 patients who did not have a definite operative date, obtaining complete information on 124 (84%). Symptom severity was assessed with the Western Ontario/McMaster Osteoarthritis Index and a disease-specific standard gamble was used to elicit patients' overall utility for their arthritic state. Next, in a trade-off task, patients considered a hypothetical choice between a 1-month wait for a surgeon who could provide a 2% risk of post-operative mortality, or a 6-month wait for joint replacement with a 1% risk of post-operative mortality. Waiting times were then shifted systematically until the patient abandoned his/her initial choice, generating a conditional maximal acceptable wait time. Patients were divided in their attitudes, with 57% initially choosing a 6-month wait with a 1% mortality risk. The overall distribution of conditional maximum acceptable wait time scores ranged from 1 to 26 months, with a median of 7 months. Utility values were independently but weakly associated with patients' tolerance of waiting times (adjusted R-square = 0.059, P = 0.004). After splitting the sample along the median into subgroups with a relatively 'low' and 'high' tolerance for waiting, the subgroup with the apparently lower tolerance for waiting reported lower utility scores (z = 2.951; P = 0.004) and shorter times since their surgeon first advised them of the need for surgery (z = 3.014; P = 0.003). These results suggest that, in the establishment and monitoring of a queue management system for quality-of-life-enhancing surgery, patients' own perceptions of their overall symptomatic burden and ability to tolerate delayed relief should be considered along with information derived from clinical judgements and pre-weighted health status instruments.

Using Queuing Theory and Simulation Modelling to Reduce Waiting Times in An Iranian Emergency Department

PubMed Central

Haghighinejad, Hourvash Akbari; Kharazmi, Erfan; Hatam, Nahid; Yousefi, Sedigheh; Hesami, Seyed Ali; Danaei, Mina; Askarian, Mehrdad

2016-01-01

Background: Hospital emergencies have an essential role in health care systems. In the last decade, developed countries have paid great attention to overcrowding crisis in emergency departments. Simulation analysis of complex models for which conditions will change over time is much more effective than analytical solutions and emergency department (ED) is one of the most complex models for analysis. This study aimed to determine the number of patients who are waiting and waiting time in emergency department services in an Iranian hospital ED and to propose scenarios to reduce its queue and waiting time. Methods: This is a cross-sectional study in which simulation software (Arena, version 14) was used. The input information was extracted from the hospital database as well as through sampling. The objective was to evaluate the response variables of waiting time, number waiting and utilization of each server and test the three scenarios to improve them. Results: Running the models for 30 days revealed that a total of 4088 patients left the ED after being served and 1238 patients waited in the queue for admission in the ED bed area at end of the run (actually these patients received services out of their defined capacity). The first scenario result in the number of beds had to be increased from 81 to179 in order that the number waiting of the “bed area” server become almost zero. The second scenario which attempted to limit hospitalization time in the ED bed area to the third quartile of the serving time distribution could decrease the number waiting to 586 patients. Conclusion: Doubling the bed capacity in the emergency department and consequently other resources and capacity appropriately can solve the problem. This includes bed capacity requirement for both critically ill and less critically ill patients. Classification of ED internal sections based on severity of illness instead of medical specialty is another solution. PMID:26793727

Ion Dynamics in a Single and Dual Radio Frequency Sheath Measured by Laser-Induced Fluorescence

NASA Astrophysics Data System (ADS)

Moore, Nathaniel Breckenridge

Ion dynamics are investigated in a single and dual radio frequency sheath as a function of radius above a 30 cm diameter biased silicon wafer for the first time in an industrial inductively coupled (440 kHz, 500 W) plasma etch tool. Ion velocity distribution (IVD) function measurements in the argon plasma are taken using laser induced fluorescence (LIF). Planar sheets of laser light enter the chamber both parallel and perpendicular to the surface of the wafer in order to measure both parallel and perpendicular IVDs at thousands of spatial positions. A fast (30 ns exposure) CCD camera measures the resulting fluorescence with a spatial resolution of 0.4 mm. The dual-frequency bias on the wafer is comprised of a 2 MHz low frequency (LF) bias and a 19 MHz high frequency (HF) bias. The laser is phase locked to the LF bias and IVD measurements are taken at several different LF phases. Ion energy distribution (IED) function measurements and calculated moments are compared for several cases. For the LF case (no HF), the IEDs were found to be highly phase dependent and were varied radially up to 10%. Calculated mean velocity vectors showed large impact angles near the surface of the wafer with the largest angles observed near the wafer edge. The LF experimental results are compared with simulations designed specifically for this particular plasma tool and showed good qualitative agreement. For the dual frequency case, IEDs were measured at two disparate phases of the phase-locked LF bias. IEDs were found to be multi-peaked and were well-approximated by a sum of Maxwellian distributions. The calculated fluxes in the dual frequency case were found to be substantially more radially uniform than the single frequency bias case. For industrial applications, this radially uniform ion flux is evidently a trade off with the undesirable multi-peaked structure in the IEDs.

Impact of Martensite Spatial Distribution on Quasi-Static and Dynamic Deformation Behavior of Dual-Phase Steel

NASA Astrophysics Data System (ADS)

Singh, Manpreet; Das, Anindya; Venugopalan, T.; Mukherjee, Krishnendu; Walunj, Mahesh; Nanda, Tarun; Kumar, B. Ravi

2017-12-01

The effects of microstructure parameters of dual-phase steels on tensile high strain dynamic deformation characteristic were examined in this study. Cold-rolled steel sheets were annealed using three different annealing process parameters to obtain three different dual-phase microstructures of varied ferrite and martensite phase fraction. The volume fraction of martensite obtained in two of the steels was near identical ( 19 pct) with a subtle difference in its spatial distribution. In the first microstructure variant, martensite was mostly found to be situated at ferrite grain boundaries and in the second variant, in addition to at grain boundaries, in-grain martensite was also observed. The third microstructure was very different from the above two with respect to martensite volume fraction ( 67 pct) and its morphology. In this case, martensite packets were surrounded by a three-dimensional ferrite network giving an appearance of core and shell type microstructure. All the three steels were tensile deformed at strain rates ranging from 2.7 × 10-4 (quasi-static) to 650 s-1 (dynamic range). Field-emission scanning electron microscope was used to characterize the starting as well as post-tensile deformed microstructures. Dual-phase steel consisting of small martensite volume fraction ( 19 pct), irrespective of its spatial distribution, demonstrated high strain rate sensitivity and on the other hand, steel with large martensite volume fraction ( 67 pct) displayed a very little strain rate sensitivity. Interestingly, total elongation was found to increase with increasing strain rate in the dynamic regime for steel with core-shell type of microstructure containing large martensite volume fraction. The observed enhancement in plasticity in dynamic regime was attributed to adiabatic heating of specimen. To understand the evolving damage mechanism, the fracture surface and the vicinity of fracture ends were studied in all the three dual-phase steels.

Impact of Martensite Spatial Distribution on Quasi-Static and Dynamic Deformation Behavior of Dual-Phase Steel

NASA Astrophysics Data System (ADS)

Singh, Manpreet; Das, Anindya; Venugopalan, T.; Mukherjee, Krishnendu; Walunj, Mahesh; Nanda, Tarun; Kumar, B. Ravi

2018-02-01

The effects of microstructure parameters of dual-phase steels on tensile high strain dynamic deformation characteristic were examined in this study. Cold-rolled steel sheets were annealed using three different annealing process parameters to obtain three different dual-phase microstructures of varied ferrite and martensite phase fraction. The volume fraction of martensite obtained in two of the steels was near identical ( 19 pct) with a subtle difference in its spatial distribution. In the first microstructure variant, martensite was mostly found to be situated at ferrite grain boundaries and in the second variant, in addition to at grain boundaries, in-grain martensite was also observed. The third microstructure was very different from the above two with respect to martensite volume fraction ( 67 pct) and its morphology. In this case, martensite packets were surrounded by a three-dimensional ferrite network giving an appearance of core and shell type microstructure. All the three steels were tensile deformed at strain rates ranging from 2.7 × 10-4 (quasi-static) to 650 s-1 (dynamic range). Field-emission scanning electron microscope was used to characterize the starting as well as post-tensile deformed microstructures. Dual-phase steel consisting of small martensite volume fraction ( 19 pct), irrespective of its spatial distribution, demonstrated high strain rate sensitivity and on the other hand, steel with large martensite volume fraction ( 67 pct) displayed a very little strain rate sensitivity. Interestingly, total elongation was found to increase with increasing strain rate in the dynamic regime for steel with core-shell type of microstructure containing large martensite volume fraction. The observed enhancement in plasticity in dynamic regime was attributed to adiabatic heating of specimen. To understand the evolving damage mechanism, the fracture surface and the vicinity of fracture ends were studied in all the three dual-phase steels.

Factors influencing the perception of medical staff and outpatients of dual practice in Shanghai, People's Republic of China.

PubMed

Chen, Haiping; Li, Meina; Dai, Zhixin; Deng, Qiangyu; Zhang, Lulu

2016-01-01

Dual practice is defined as a physician's performance of medical activities in different health care institutions (two or more) simultaneously. This study aimed to examine the perception and acceptance of medical staff and outpatients of dual practice and explore the possible factors affecting people's perception. A cross-sectional study was conducted in 13 public hospitals in Shanghai. Participants included medical staff and outpatients. We distributed 1,000 questionnaires to each participant group, and the response rates were 66.7% and 69.4%, respectively. Statistical differences in variables were tested, and multinomial logistic regression methods were employed for statistical analysis. The study included two parts: medical staff survey and outpatient survey. The results of medical staff survey showed that 63.0% of the respondents supported dual practice. Medical staff who belonged to the surgical department or held positive belief of dual practice were more willing to participate in dual practice. Moreover, the publicity activities of dual practice and hospitals' human resource management system were important factors affecting the willingness of the medical staff. The results of outpatient survey showed that 44.5% of respondents believed that dual practice could reduce difficulty in consulting a doctor. Regarding the perceived benefits of dual practice, the proportion of outpatients who believed that dual practice could meet the demand for health convenience, minor illness, and chronic disease were 45.4%, 42.4%, and 53.7%, respectively. Additionally, demographic characteristics significantly influenced the perception of outpatients. This study confirmed that both medical staff and outpatients generally held positive attitudes toward dual practice. Medical staff who belonged to the surgical department or held positive belief of dual practice were more willing to participate in dual practice. Moreover, the existence of publicity activities and more flexible management system of hospitals' human resource would promote physicians' willingness to participate in dual practice. In addition, perception of outpatients of dual practice was affected by demographic characteristics.

Factors influencing the perception of medical staff and outpatients of dual practice in Shanghai, People’s Republic of China

PubMed Central

Chen, Haiping; Li, Meina; Dai, Zhixin; Deng, Qiangyu; Zhang, Lulu

2016-01-01

Objective Dual practice is defined as a physician’s performance of medical activities in different health care institutions (two or more) simultaneously. This study aimed to examine the perception and acceptance of medical staff and outpatients of dual practice and explore the possible factors affecting people’s perception. Methods A cross-sectional study was conducted in 13 public hospitals in Shanghai. Participants included medical staff and outpatients. We distributed 1,000 questionnaires to each participant group, and the response rates were 66.7% and 69.4%, respectively. Statistical differences in variables were tested, and multinomial logistic regression methods were employed for statistical analysis. Results The study included two parts: medical staff survey and outpatient survey. The results of medical staff survey showed that 63.0% of the respondents supported dual practice. Medical staff who belonged to the surgical department or held positive belief of dual practice were more willing to participate in dual practice. Moreover, the publicity activities of dual practice and hospitals’ human resource management system were important factors affecting the willingness of the medical staff. The results of outpatient survey showed that 44.5% of respondents believed that dual practice could reduce difficulty in consulting a doctor. Regarding the perceived benefits of dual practice, the proportion of outpatients who believed that dual practice could meet the demand for health convenience, minor illness, and chronic disease were 45.4%, 42.4%, and 53.7%, respectively. Additionally, demographic characteristics significantly influenced the perception of outpatients. Conclusion This study confirmed that both medical staff and outpatients generally held positive attitudes toward dual practice. Medical staff who belonged to the surgical department or held positive belief of dual practice were more willing to participate in dual practice. Moreover, the existence of publicity activities and more flexible management system of hospitals’ human resource would promote physicians’ willingness to participate in dual practice. In addition, perception of outpatients of dual practice was affected by demographic characteristics. PMID:27621600

Interrogation of weak Bragg grating sensors based on dual-wavelength differential detection.

PubMed

Cheng, Rui; Xia, Li

2016-11-15

It is shown that for weak Bragg gratings the logarithmic ratio of reflected intensities at any two wavelengths within the spectrum follows a linear relationship with the Bragg wavelength shift, with a slope proportional to their wavelength spacing. This finding is exploited to develop a flexible, efficient, and cheap interrogation solution of weak fiber Bragg grating (FBGs), especially ultra-short FBGs, in distributed sensing based on dual-wavelength differential detection. The concept is experimentally studied in both single and distributed sensing systems with ultra-short FBG sensors. The work may form the basis of new and promising FBG interrogation techniques based on detecting discrete rather than continuous spectra.

Performance analysis of dual-hop optical wireless communication systems over k-distribution turbulence channel with pointing error

NASA Astrophysics Data System (ADS)

Mishra, Neha; Sriram Kumar, D.; Jha, Pranav Kumar

2017-06-01

In this paper, we investigate the performance of the dual-hop free space optical (FSO) communication systems under the effect of strong atmospheric turbulence together with misalignment effects (pointing error). We consider a relay assisted link using decode and forward (DF) relaying protocol between source and destination with the assumption that Channel State Information is available at both transmitting and receiving terminals. The atmospheric turbulence channels are modeled by k-distribution with pointing error impairment. The exact closed form expression is derived for outage probability and bit error rate and illustrated through numerical plots. Further BER results are compared for the different modulation schemes.

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

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

Dall-Anese, Emiliano; Zhou, Xinyang; Liu, Zhiyuan

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together withmore » pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Three-Dimensional Spatial Distribution of Synapses in the Neocortex: A Dual-Beam Electron Microscopy Study

PubMed Central

Merchán-Pérez, Angel; Rodríguez, José-Rodrigo; González, Santiago; Robles, Víctor; DeFelipe, Javier; Larrañaga, Pedro; Bielza, Concha

2014-01-01

In the cerebral cortex, most synapses are found in the neuropil, but relatively little is known about their 3-dimensional organization. Using an automated dual-beam electron microscope that combines focused ion beam milling and scanning electron microscopy, we have been able to obtain 10 three-dimensional samples with an average volume of 180 µm3 from the neuropil of layer III of the young rat somatosensory cortex (hindlimb representation). We have used specific software tools to fully reconstruct 1695 synaptic junctions present in these samples and to accurately quantify the number of synapses per unit volume. These tools also allowed us to determine synapse position and to analyze their spatial distribution using spatial statistical methods. Our results indicate that the distribution of synaptic junctions in the neuropil is nearly random, only constrained by the fact that synapses cannot overlap in space. A theoretical model based on random sequential absorption, which closely reproduces the actual distribution of synapses, is also presented. PMID:23365213

Three-dimensional spatial distribution of synapses in the neocortex: a dual-beam electron microscopy study.

PubMed

Merchán-Pérez, Angel; Rodríguez, José-Rodrigo; González, Santiago; Robles, Víctor; Defelipe, Javier; Larrañaga, Pedro; Bielza, Concha

2014-06-01

In the cerebral cortex, most synapses are found in the neuropil, but relatively little is known about their 3-dimensional organization. Using an automated dual-beam electron microscope that combines focused ion beam milling and scanning electron microscopy, we have been able to obtain 10 three-dimensional samples with an average volume of 180 µm(3) from the neuropil of layer III of the young rat somatosensory cortex (hindlimb representation). We have used specific software tools to fully reconstruct 1695 synaptic junctions present in these samples and to accurately quantify the number of synapses per unit volume. These tools also allowed us to determine synapse position and to analyze their spatial distribution using spatial statistical methods. Our results indicate that the distribution of synaptic junctions in the neuropil is nearly random, only constrained by the fact that synapses cannot overlap in space. A theoretical model based on random sequential absorption, which closely reproduces the actual distribution of synapses, is also presented.

[Organization of patient intake at private dental institutions].

PubMed

Miniaev, V A; Vishniakov, N I; Mchedlidze, T Sh; Kuraskua, A A; Stozharov, V V

1998-01-01

Scientifically-based organization of consultations and treatment of patients at dental institutions is proposed, based on the balance between the time spent by patients in the queue and the equipment downtime. The proposed organization will decrease the total duration of treatment.

Planning for active traffic management in Virginia : international best practices and implementation strategies.

DOT National Transportation Integrated Search

2012-10-01

Active Traffic Management (ATM) applications, such as variable speed limits, queue warning systems, and dynamic : ramp metering, have been shown to offer mobility and safety benefits. Yet because they differ from conventional capacity : investments i...

Systems Operation Studies for Automated Guideway Transit Systems : Detailed Station Model Functional Specifications

DOT National Transportation Integrated Search

1981-07-01

The Detailed Station Model (DSM) is a discrete event model representing the interrelated queueing processes associated with vehicle and passenger activities in an AGT station. The DSM will provide operational and performance measures of alternative s...

Discovering Patterns in Interarrival Data

ERIC Educational Resources Information Center

Johnson, Roger W.

2017-01-01

It is suggested that students collect interarrival data for customers arriving at a queue. Two common features will often occur across these various datasets. Some data collection hints, some problems for students to pursue and a few pointers to the literature are given.

Queuing Theory and Reference Transactions.

ERIC Educational Resources Information Center

Terbille, Charles

1995-01-01

Examines the implications of applying the queuing theory to three different reference situations: (1) random patron arrivals; (2) random durations of transactions; and (3) use of two librarians. Tables and figures represent results from spreadsheet calculations of queues for each reference situation. (JMV)

78 FR 795 - Self-Regulatory Organizations; The Depository Trust Company; Notice of Filing of Proposed Rule...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-04

... the effect the transaction would have on such Participant's account, and determines whether any... the net debit balance to exceed the net debit cap is placed on a pending (recycling) queue until the...

Message passing with parallel queue traversal

DOEpatents

Underwood, Keith D [Albuquerque, NM; Brightwell, Ronald B [Albuquerque, NM; Hemmert, K Scott [Albuquerque, NM

2012-05-01

In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.