A tutorial on queuing and trunking with applications to communications

CERN Document Server

Tranter, William H

2012-01-01

The motivation for developing this synthesis lecture was to provide a tutorial on queuing and trunking, with extensions to networks of queues, suitable for supplementing courses in communications, stochastic processes, and networking. An essential component of this lecture is MATLAB-based demonstrations and exercises, which can be easily modified to enable the student to observe and evaluate the impact of changing parameters, arrival and departure statistics, queuing disciplines, the number of servers, and other important aspects of the underlying system model. Much of the work in this lecture

Analysis for a queuing model of FACOM 230-75 system

International Nuclear Information System (INIS)

Ishiguro, Misako

1976-09-01

An open batch multi-job-processing for F230-75 System is analyzed by a M/M/n queuing model. In the model, jobs are considered to be processed with n independent machines whose mean processing rate is μ(n), where n is the actual multiplicity which varies from 0 to a designated multiplicity N. The μ(n) is separately calculated from another queuing models of the executing stage in which multiplicity is held to n. Numerical comparisons of processing time, turnaround time, throughput, etc. are shown in the figures to the variation of job multiplicities. (auth.)

INCREASE OF QUEUING SYSTEM EFFECTIVENESS OF TRADING ENTERPRISE BY MEANS OF NUMERICAL STATISTICAL SIMULATION

Directory of Open Access Journals (Sweden)

Knyazheva Yu. V.

2014-06-01

Full Text Available The market economy causes need of development of the economic analysis first of all at microlevel, that is at the level of the separate enterprises as the enterprises are basis for market economy. Therefore improvement of the queuing system trading enterprise is an important economic problem. Analytical solutions of problems of the mass servicing are in described the theory, don’t correspond to real operating conditions of the queuing systems. Therefore in this article optimization of customer service process and improvement of settlement and cash service system trading enterprise are made by means of numerical statistical simulation of the queuing system trading enterprise. The article describe integrated statistical numerical simulation model of queuing systems trading enterprise working in nonstationary conditions with reference to different distribution laws of customers input stream. This model takes account of various behavior customers output stream, includes checkout service model which takes account of cashier rate of working, also this model includes staff motivation model, profit earning and profit optimization models that take into account possible revenue and costs. The created statistical numerical simulation model of queuing systems trading enterprise, at its realization in the suitable software environment, allows to perform optimization of the most important parameters of system. And when developing the convenient user interface, this model can be a component of support decision-making system for rationalization of organizational structure and for management optimization by trading enterprise.

Density profiles of the exclusive queuing process

Science.gov (United States)

Arita, Chikashi; Schadschneider, Andreas

2012-12-01

The exclusive queuing process (EQP) incorporates the exclusion principle into classic queuing models. It is characterized by, in addition to the entrance probability α and exit probability β, a third parameter: the hopping probability p. The EQP can be interpreted as an exclusion process of variable system length. Its phase diagram in the parameter space (α,β) is divided into a convergent phase and a divergent phase by a critical line which consists of a curved part and a straight part. Here we extend previous studies of this phase diagram. We identify subphases in the divergent phase, which can be distinguished by means of the shape of the density profile, and determine the velocity of the system length growth. This is done for EQPs with different update rules (parallel, backward sequential and continuous time). We also investigate the dynamics of the system length and the number of customers on the critical line. They are diffusive or subdiffusive with non-universal exponents that also depend on the update rules.

A CATASTROPHIC-CUM-RESTORATIVE QUEUING SYSTEM WITH CORRELATED BATCH ARRIVALS AND VARIABLE CAPACITY

Directory of Open Access Journals (Sweden)

Rakesh Kumar

2008-07-01

Full Text Available In this paper, we study a catastrophic-cum-restorative queuing system with correlated batch arrivals and service in batches of variable sizes. We perform the transient analysis of the queuing model. We obtain the Laplace Transform of the probability generating function of system size. Finally, some particular cases of the model have been derived and discussed. Keywords: Queue length, Catastrophes, Correlated batch arrivals, Broadband services, Variable service capacity, and Restoration.

Efficient round-robin multicast scheduling for input-queued switches

DEFF Research Database (Denmark)

Rasmussen, Anders; Yu, Hao; Ruepp, Sarah Renée

2014-01-01

The input-queued (IQ) switch architecture is favoured for designing multicast high-speed switches because of its scalability and low implementation complexity. However, using the first-in-first-out (FIFO) queueing discipline at each input of the switch may cause the head-of-line (HOL) blocking...... problem. Using a separate queue for each output port at an input to reduce the HOL blocking, that is, the virtual output queuing discipline, increases the implementation complexity, which limits the scalability. Given the increasing link speed and network capacity, a low-complexity yet efficient multicast...... by means of queue look-ahead. Simulation results demonstrate that this FIFO-based IQ multicast architecture is able to achieve significant improvements in terms of multicast latency requirements by searching through a small number of cells beyond the HOL cells in the input queues. Furthermore, hardware...

Assessing the Queuing Process Using Data Envelopment Analysis: an Application in Health Centres.

Science.gov (United States)

Safdar, Komal A; Emrouznejad, Ali; Dey, Prasanta K

2016-01-01

Queuing is one of the very important criteria for assessing the performance and efficiency of any service industry, including healthcare. Data Envelopment Analysis (DEA) is one of the most widely-used techniques for performance measurement in healthcare. However, no queue management application has been reported in the health-related DEA literature. Most of the studies regarding patient flow systems had the objective of improving an already existing Appointment System. The current study presents a novel application of DEA for assessing the queuing process at an Outpatients' department of a large public hospital in a developing country where appointment systems do not exist. The main aim of the current study is to demonstrate the usefulness of DEA modelling in the evaluation of a queue system. The patient flow pathway considered for this study consists of two stages; consultation with a doctor and pharmacy. The DEA results indicated that waiting times and other related queuing variables included need considerable minimisation at both stages.

Dynamic queuing transmission model for dynamic network loading

DEFF Research Database (Denmark)

Raovic, Nevena; Nielsen, Otto Anker; Prato, Carlo Giacomo

2017-01-01

and allowing for the representation of multiple vehicle classes, queue spillbacks and shock waves. The model assumes that a link is split into a moving part plus a queuing part, and p that traffic dynamics are given by a triangular fundamental diagram. A case-study is investigated and the DQTM is compared...

Metastability of Queuing Networks with Mobile Servers

Science.gov (United States)

Baccelli, F.; Rybko, A.; Shlosman, S.; Vladimirov, A.

2018-04-01

We study symmetric queuing networks with moving servers and FIFO service discipline. The mean-field limit dynamics demonstrates unexpected behavior which we attribute to the metastability phenomenon. Large enough finite symmetric networks on regular graphs are proved to be transient for arbitrarily small inflow rates. However, the limiting non-linear Markov process possesses at least two stationary solutions. The proof of transience is based on martingale techniques.

TWO-LEVEL HIERARCHICAL COORDINATION QUEUING METHOD FOR TELECOMMUNICATION NETWORK NODES

Directory of Open Access Journals (Sweden)

M. V. Semenyaka

2014-07-01

Full Text Available The paper presents hierarchical coordination queuing method. Within the proposed method a queuing problem has been reduced to optimization problem solving that was presented as two-level hierarchical structure. The required distribution of flows and bandwidth allocation was calculated at the first level independently for each macro-queue; at the second level solutions obtained on lower level for each queue were coordinated in order to prevent probable network link overload. The method of goal coordination has been determined for multilevel structure managing, which makes it possible to define the order for consideration of queue cooperation restrictions and calculation tasks distribution between levels of hierarchy. Decisions coordination was performed by the method of Lagrange multipliers. The study of method convergence has been carried out by analytical modeling.

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

Science.gov (United States)

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

A Geo-Aware Taxi Carrying Management System by Using Location Based Services and Zone Queuing Techniques on Internet of Things

Directory of Open Access Journals (Sweden)

Chyi-Ren Dow

2016-01-01

Full Text Available Taxi plays a crucial role in the transportation system because of the characteristic that can be hailed conveniently. Most of the taxi drivers obtain passengers by hunting on the road or waiting in a fixed taxi queuing point; however these methods have poor performance, high vacancy rate, and several critical problems such as air pollution and foul up traffic. This study proposed a taxi carrying management system by using location based services and zone queuing techniques on Internet of things. The proposed system allows drivers to both hunt on the road and wait in a queuing zone. A queuing table is used in the control center and neighbor tables are used in RSUs for zone queuing establishment. Joining and leaving mechanisms are developed for zone queuing management. To enhance service efficiency and quality, we present a scheme to prevent the ping-pong effect which is based on the location based services, a hunting rate calculation scheme, and a path planning service for taxi drivers according to the history carrying record. PRISM is used to simulate the proposed system, and the results indicated that our scheme outperforms the waiting and hunting models in terms of number of customers, vacancy rate, and profit.

Study on combat effectiveness of air defense missile weapon system based on queuing theory

Science.gov (United States)

Zhao, Z. Q.; Hao, J. X.; Li, L. J.

2017-01-01

Queuing Theory is a method to analyze the combat effectiveness of air defense missile weapon system. The model of service probability based on the queuing theory was constructed, and applied to analyzing the combat effectiveness of "Sidewinder" and "Tor-M1" air defense missile weapon system. Finally aimed at different targets densities, the combat effectiveness of different combat units of two types' defense missile weapon system is calculated. This method can be used to analyze the usefulness of air defense missile weapon system.

Using Queuing Theory and Simulation Model to Optimize Hospital Pharmacy Performance

Science.gov (United States)

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

User Utility Oriented Queuing Model for Resource Allocation in Cloud Environment

Directory of Open Access Journals (Sweden)

Zhe Zhang

2015-01-01

Full Text Available Resource allocation is one of the most important research topics in servers. In the cloud environment, there are massive hardware resources of different kinds, and many kinds of services are usually run on virtual machines of the cloud server. In addition, cloud environment is commercialized, and economical factor should also be considered. In order to deal with commercialization and virtualization of cloud environment, we proposed a user utility oriented queuing model for task scheduling. Firstly, we modeled task scheduling in cloud environment as an M/M/1 queuing system. Secondly, we classified the utility into time utility and cost utility and built a linear programming model to maximize total utility for both of them. Finally, we proposed a utility oriented algorithm to maximize the total utility. Massive experiments validate the effectiveness of our proposed model.

Mathematical methods in the theory of queuing

CERN Document Server

Khinchin, A Y; Quenouille, M H

2013-01-01

Written by a prominent Russian mathematician, this concise monograph examines aspects of queuing theory as an application of probability. The three-part treatment begins with a study of the stream of incoming demands (or ""calls,"" in the author's terminology). Subsequent sections explore systems with losses and systems allowing delay. Prerequisites include a familiarity with the theory of probability and mathematical analysis. A. Y. Khinchin made significant contributions to probability theory, statistical physics, and several other fields. His elegant, groundbreaking work will prove of subs

Application of queuing theory to patient satisfaction at a tertiary ...

African Journals Online (AJOL)

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

Application of queuing theory to a fast food outfit: a study of blue meadows restaurant

Directory of Open Access Journals (Sweden)

Seigha Gumus

2017-06-01

Full Text Available The study evaluated the queuing system in Blue Meadows restaurant with a view to determining its operating characteristics and to improve customers’ satisfaction during waiting time using the lens of queuing theory. Data was obtained from a fast food restaurant in the University of Benin. The data collected was tested to show if it follows a Poisson and exponential distribution of arrival and service rate using chi square goodness of fit. A 95% confidence interval level was used to show the range of customers that come into the system at an hour time frame and the range of customers served at an hour time frame. Using the M/M/s model, the arrival rate, service rate, utilization rate, waiting time in the queue and the probability of customers likely balking from the restaurant was derived. The arrival rate (λ at Blue Meadows restaurant was about 40 customers per hour, while the service rate was about 22 customers per hour per server. The number of servers present in the system was two. The average number of customers in the system in an hour window was 40 customers with a utilization rate of 0.909. The paper concludes with a discussion on the benefits of performing queuing analysis to a restaurant.

Preventing Out-of-Sequence for Multicast Input-Queued Space-Memory-Memory Clos-Network

DEFF Research Database (Denmark)

Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

2011-01-01

This paper proposes an out-of-sequence (OOS) preventative cell dispatching algorithm, the multicast flow-based round robin (MFRR), for multicast input-queued space-memory-memory (IQ-SMM) Clos-network architecture. Independently treating each incoming cell, such as the desynchronized static round...

RENEWAL PROCESS IN QUEUING PROBLEM AND REPLACEMENT OF MACHINE

OpenAIRE

Hala Abbas Laz*, Mohamed Gomma Elnour

2016-01-01

The paper is studying the renewal process. There are many fields in which it’s used for example: the renewable energy (solar energy, wind energy), maintenance and replacement decision models, queuing system and other field in electronics. In this study our objective is to find the probability density function related to a renewal at a given time. Also to drive the renewal equation, how to find the current lifetime and residual life time. We obtain that as expected value of a renewal process w...

An enhanced model for minimizing fuel consumption under block-queuing in a drive-through service system

Energy Technology Data Exchange (ETDEWEB)

Reilly, C.H.; Berglin, J. [University of Central Florida, Orlando, FL (United States). Dept. of Industrial Engineering and Management Systems

2004-05-01

We present a new model for determining the optimal block-size under block-queuing in a simple, single-channel queue at a drive-through service facility. With block-queuing, a queue is partitioned into an active section and a passive section, where drivers are asked to turn off their engines until the active section clears. Our model prescribes a block-size, i.e., a maximum number of vehicles in the active section, which minimizes the expected amount of fuel consumed in the queue. It can assess the effects of the traffic intensity, the service-time variance, and the proportion of compliant drivers in the passive section on the optimal block- size and on fuel consumption in the queue. (author)

Analisa Perbandingan Quality of Service Voice Over IP dengan Pengujian Codec Menggunakan Algoritma Low Latency Queuing

Directory of Open Access Journals (Sweden)

Darmawan Darmawan

2017-09-01

Full Text Available Voice over IP (VoIP adalah solusi komunikasi suara yang murah karena menggunakan jaringan IP dibanding penggunaan telephone analog yang banyak memakan biaya. Dalam penerapannya, VoIP mengalami permasalahan karena menggunakan teknologi packet switching yang mana penggunaannya bersamaan dengan paket data sehingga timbul delay, jitter, dan packet loss.  Pada penelitian ini, algoritma Low Latency Queuing (LLQ diterapkan pada router cisco. Algoritma LLQ merupakan gabungan dari algoritma Priority Queuing (PQ dan Class Based Weight Fair Queuing (CBWFQ sehingga dapat memprioritaskan paket suara disamping paket data. Algoritma LLQ ini diujikan menggunakan codec GSM FR, G722, dan G711 A-law. Hasil pengujian didapatkan nilai parameter yang tidak jauh berbeda dan memenuhi standar ITU-T.G1010. Nilai delay rata - rata terendah yaitu ketika menggunakan codec G722 sebesar 20,019 ms tetapi G722 memiliki rata - rata jitter yang terbesar yaitu 0,986 ms.  Codec dengan jitter rata – rata terkecil adalah G711 A-law sebesar 0,838 ms. Packet loss untuk semua codec yang diujikan adalah 0%.  Throughput pada paket data terbesar saat menggunakan codec GSM FR yaitu 18,139 kbps. Codec yang direkomendasikan adalah G711 A-law karena lebih stabil dari segi jitter dan codec GSM FR cocok diimplementasikan pada jaringan yang memiliki bandwitdh kecil.

Out-of-Sequence Prevention for Multicast Input-Queuing Space-Memory-Memory Clos-Network

DEFF Research Database (Denmark)

Yu, Hao; Ruepp, Sarah; Berger, Michael Stübert

2011-01-01

This paper proposes two cell dispatching algorithms for the input-queuing space-memory-memory (IQ-SMM) Closnetwork to reduce out-of-sequence (OOS) for multicast traffic. The frequent connection pattern change of DSRR results in a severe OOS problem. Based on the principle of DSRR, MFDSRR is able ...

T-Cell Activation: A Queuing Theory Analysis at Low Agonist Density

OpenAIRE

Wedagedera, J. R.; Burroughs, N. J.

2006-01-01

We analyze a simple linear triggering model of the T-cell receptor (TCR) within the framework of queuing theory, in which TCRs enter the queue upon full activation and exit by downregulation. We fit our model to four experimentally characterized threshold activation criteria and analyze their specificity and sensitivity: the initial calcium spike, cytotoxicity, immunological synapse formation, and cytokine secretion. Specificity characteristics improve as the time window for detection increas...

23 CFR 661.43 - Can other sources of funds be used to finance a queued project in advance of receipt of IRRBP funds?

Science.gov (United States)

2010-04-01

... PROGRAM § 661.43 Can other sources of funds be used to finance a queued project in advance of receipt of... project that has been approved for funding and placed on the queue and then be reimbursed when IRRBP funds... 23 Highways 1 2010-04-01 2010-04-01 false Can other sources of funds be used to finance a queued...

Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

Science.gov (United States)

Satrya, Gandeva B.; Brotoharsono, Tri

2013-03-01

The increase of user mobility and the need for data access anytime also increases the interest in broadband wireless access (BWA). The best available quality of experience for mobile data service users are assured for IEEE 802.16e based users. The main problem of assuring a high QOS value is how to allocate available resources among users in order to meet the QOS requirement for criteria such as delay, throughput, packet loss and fairness. There is no specific standard scheduling mechanism stated by IEEE standards, which leaves it for implementer differentiation. There are five QOS service classes defined by IEEE 802.16: Unsolicited Grant Scheme (UGS), Extended Real Time Polling Service (ertPS), Real Time Polling Service (rtPS), Non Real Time Polling Service (nrtPS) and Best Effort Service (BE). Each class has different QOS parameter requirements for throughput and delay/jitter constraints. This paper proposes Modified Weighted Fair Queuing (MWFQ) scheduling scenario which was based on Weighted Round Robin (WRR) and Weighted Fair Queuing (WFQ). The performance of MWFQ was assessed by using above five QoS criteria. The simulation shows that using the concept of total packet size calculation improves the network's performance.

Queuing theory and telecommunications networks and applications

CERN Document Server

Giambene, Giovanni

2014-01-01

This book provides a basic description of current networking technologies and protocols as well as important tools for network performance analysis based on queuing theory. The second edition adds selected contents in the first part of the book for what concerns: (i) the token bucket regulator and traffic shaping issues; (ii) the TCP protocol congestion control that has a significant part in current networking; (iii) basic satellite networking issues; (iv) adding details on QoS support in IP networks. The book is organized so that networking technologies and protocols (Part I) are first and are then followed by theory and exercises with applications to the different technologies and protocols (Part II). This book is intended as a textbook for master level courses in networking and telecommunications sectors.

Improved Road-Network-Flow Control Strategy Based on Macroscopic Fundamental Diagrams and Queuing Length in Connected-Vehicle Network

Directory of Open Access Journals (Sweden)

Xiaohui Lin

2017-01-01

Full Text Available Connected-vehicles network provides opportunities and conditions for improving traffic signal control, and macroscopic fundamental diagrams (MFD can control the road network at the macrolevel effectively. This paper integrated proposed real-time access to the number of mobile vehicles and the maximum road queuing length in the Connected-vehicles network. Moreover, when implementing a simple control strategy to limit the boundary flow of a road network based on MFD, we determined whether the maximum queuing length of each boundary section exceeds the road-safety queuing length in real-time calculations and timely adjusted the road-network influx rate to avoid the overflow phenomenon in the boundary section. We established a road-network microtraffic simulation model in VISSIM software taking a district as the experimental area, determined MFD of the region based on the number of mobile vehicles, and weighted traffic volume of the road network. When the road network was tending to saturate, we implemented a simple control strategy and our algorithm limits the boundary flow. Finally, we compared the traffic signal control indicators with three strategies: (1 no control strategy, (2 boundary control, and (3 boundary control with limiting queue strategy. The results show that our proposed algorithm is better than the other two.

Out-of-Sequence Preventative Cell Dispatching for Multicast Input-Queued Space-Memory-Memory Clos-Network

DEFF Research Database (Denmark)

Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

2011-01-01

This paper proposes two out-of-sequence (OOS) preventative cell dispatching algorithms for the multicast input-queued space-memory-memory (IQ-SMM) Clos-network switch architecture, i.e. the multicast flow-based DSRR (MF-DSRR) and the multicast flow-based round-robin (MFRR). Treating each cell...

MODELING QUEUING SYSTEM OF INTERACTION BETWEEN TERMINAL DEVICES AND SERVICES PROVIDERS IN THE BANK

Directory of Open Access Journals (Sweden)

Ivan A. Mnatsakanyan

2014-01-01

Full Text Available The article focuses on the development of mathematical models and tools to optimize the system of queuing at the bank. The article discusses the mathematical aspects that will achieve redistribution of transaction flow, reduce the time of the request in the queue, increase the bank’s profit and gain competitive advantage.

Threshold-based queuing system for performance analysis of cloud computing system with dynamic scaling

Energy Technology Data Exchange (ETDEWEB)

Shorgin, Sergey Ya.; Pechinkin, Alexander V. [Institute of Informatics Problems, Russian Academy of Sciences (Russian Federation); Samouylov, Konstantin E.; Gaidamaka, Yuliya V.; Gudkova, Irina A.; Sopin, Eduard S. [Telecommunication Systems Department, Peoples’ Friendship University of Russia (Russian Federation)

2015-03-10

Cloud computing is promising technology to manage and improve utilization of computing center resources to deliver various computing and IT services. For the purpose of energy saving there is no need to unnecessarily operate many servers under light loads, and they are switched off. On the other hand, some servers should be switched on in heavy load cases to prevent very long delays. Thus, waiting times and system operating cost can be maintained on acceptable level by dynamically adding or removing servers. One more fact that should be taken into account is significant server setup costs and activation times. For better energy efficiency, cloud computing system should not react on instantaneous increase or instantaneous decrease of load. That is the main motivation for using queuing systems with hysteresis for cloud computing system modelling. In the paper, we provide a model of cloud computing system in terms of multiple server threshold-based infinite capacity queuing system with hysteresis and noninstantanuous server activation. For proposed model, we develop a method for computing steady-state probabilities that allow to estimate a number of performance measures.

Threshold-based queuing system for performance analysis of cloud computing system with dynamic scaling

International Nuclear Information System (INIS)

Shorgin, Sergey Ya.; Pechinkin, Alexander V.; Samouylov, Konstantin E.; Gaidamaka, Yuliya V.; Gudkova, Irina A.; Sopin, Eduard S.

2015-01-01

Cloud computing is promising technology to manage and improve utilization of computing center resources to deliver various computing and IT services. For the purpose of energy saving there is no need to unnecessarily operate many servers under light loads, and they are switched off. On the other hand, some servers should be switched on in heavy load cases to prevent very long delays. Thus, waiting times and system operating cost can be maintained on acceptable level by dynamically adding or removing servers. One more fact that should be taken into account is significant server setup costs and activation times. For better energy efficiency, cloud computing system should not react on instantaneous increase or instantaneous decrease of load. That is the main motivation for using queuing systems with hysteresis for cloud computing system modelling. In the paper, we provide a model of cloud computing system in terms of multiple server threshold-based infinite capacity queuing system with hysteresis and noninstantanuous server activation. For proposed model, we develop a method for computing steady-state probabilities that allow to estimate a number of performance measures

APPLICATION OF THE SINGLE SERVER QUEUING SYSTEM ANALYSIS IN WOOD PRODUCTS INDUSTRY

Directory of Open Access Journals (Sweden)

Arif GÜRAY

2001-01-01

Full Text Available The aim of this study, simulated of the single server queuing system(CNC at the door-joinery facilities. We simulated the system both by hand and computer programming with SIMAN languages. From the obtained results, we aimed to provide some suggestions to the manager. Because, the ending of the study, simulation showed the real system in some hypothesis. As a result of simulated system will have long queues in future time.

Price and Service Discrimination in Queuing Systems: Incentive Compatibility of Gc\\mu Scheduling

OpenAIRE

Jan A. Van Mieghem

2000-01-01

This article studies the optimal prices and service quality grades that a queuing system---the "firm"---provides to heterogeneous, utility-maximizing customers who measure quality by their experienced delay distributions. Results are threefold: First, delay cost curves are introduced that allow for a flexible description of a customer's quality sensitivity. Second, a comprehensive executable approach is proposed that analytically specifies scheduling, delay distributions and prices for arbitr...

Application of queuing theory in banking services

Directory of Open Access Journals (Sweden)

Vitor Costa de Lima

2016-03-01

Full Text Available Bearing in mind the intense competition in the current economy and the increasing necessity of having more customers and keeping them loyal, this paper aims to apply the well known Queuing Theory in a bank agency to identify improvement opportunities in customer waiting time, from the assumption that the analyzed lines follow the Poisson’s distribution. This assumption results from the comparison between such distribution to the customers' arrival data in all analyzed lines. It was also found that there are queues with seasonality in demand, while others showed a regular demand. From the study performed, improvements in the management of this bank agency may be made, for example, the reallocation of staff in certain periods for functions with higher demand. It was concluded, therefore, that the application of the theory is feasible and can help to increase the competitive advantages of the agency.

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

Science.gov (United States)

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

Application of queuing theory in inventory systems with substitution flexibility

Science.gov (United States)

Seyedhoseini, S. M.; Rashid, Reza; Kamalpour, Iman; Zangeneh, Erfan

2015-03-01

Considering the competition in today's business environment, tactical planning of a supply chain becomes more complex than before. In many multi-product inventory systems, substitution flexibility can improve profits. This paper aims to prepare a comprehensive substitution inventory model, where an inventory system with two substitute products with ignorable lead time has been considered, and effects of simultaneous ordering have been examined. In this paper, demands of customers for both of the products have been regarded as stochastic parameters, and queuing theory has been used to construct a mathematical model. The model has been coded by C++, and it has been analyzed due to a real example, where the results indicate efficiency of proposed model.

Priority Queuing on the Docket: Universality of Judicial Dispute Resolution Timing

Directory of Open Access Journals (Sweden)

Satyam Mukherjee

2018-01-01

Full Text Available This paper analyzes court priority queuing behavior by examining the time lapse between when a case enters a court's docket and when it is ultimately disposed of. Using data from the Supreme courts of the United States, Massachusetts, and Canada we show that each court's docket features a slow decay with a decreasing tail. This demonstrates that, in each of the courts examined, the vast majority of cases are resolved relatively quickly, while there remains a small number of outlier cases that take an extremely long time to resolve. We discuss the implications for this on legal systems, the study of the law, and future research.

Integration of look-ahead multicast and unicast scheduling for input-queued cell switches

DEFF Research Database (Denmark)

Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

2012-01-01

This paper presents an integration of multicast and unicast traffic scheduling algorithms for input-queued cell switches. The multi-level round-robin multicast scheduling (ML-RRMS) algorithm with the look-ahead (LA) mechanism provides a highly scalable architecture and is able to reduce the head...... module that filters out the conflicting requests to ensure fairness. Simulation results show that comparing with the scheme using WBA for the multicast scheduling, the scheme proposed in this paper reduces the HOL blocking problem for multicast traffic and provides a significant improvement in terms...

Pseudo Last Useful Instant Queuing Strategy for Handovers in Low Earth Orbit Mobile Satellite Networks

OpenAIRE

W. Kiamouche; M. Benslama

2008-01-01

This paper presents an alternative strategy of queuing handover called Pseudo Last Useful Instant PLUI scheme for Low Earth Orbit Mobile Satellite Systems LEO MSSs. The PLUI scheme uses the same approach as the Last Useful Instant LUI scheme previously proposed in literature, with less complex implementation. Simulation tests were carried out using Dynamic Channel Allocation DCA in order to evaluate the performance of this scheme and also an analytical approach has been p...

A Discrete Event Simulation Model for Evaluating the Performances of an M/G/C/C State Dependent Queuing System

Science.gov (United States)

Khalid, Ruzelan; M. Nawawi, Mohd Kamal; Kawsar, Luthful A.; Ghani, Noraida A.; Kamil, Anton A.; Mustafa, Adli

2013-01-01

M/G/C/C state dependent queuing networks consider service rates as a function of the number of residing entities (e.g., pedestrians, vehicles, and products). However, modeling such dynamic rates is not supported in modern Discrete Simulation System (DES) software. We designed an approach to cater this limitation and used it to construct the M/G/C/C state-dependent queuing model in Arena software. Using the model, we have evaluated and analyzed the impacts of various arrival rates to the throughput, the blocking probability, the expected service time and the expected number of entities in a complex network topology. Results indicated that there is a range of arrival rates for each network where the simulation results fluctuate drastically across replications and this causes the simulation results and analytical results exhibit discrepancies. Detail results that show how tally the simulation results and the analytical results in both abstract and graphical forms and some scientific justifications for these have been documented and discussed. PMID:23560037

Queued Service Observing (QSO) at CFHT II. Queue Preparation and Observation Tools

Science.gov (United States)

Vermeulen, T.; Savalle, R.; Martin, P.; Shapiro, J.

In order to maximize the scientific productivity of the CFH12K mosaic wide-field imager, a Queued Service Observing (QSO) mode of operations was implemented at CFHT . To support this new operational model, a two-tiered system consisting of a Swing-based Java client and a relational database was developed. The various software components were designed to handle selection, scheduling, execution, and validation of programs submitted by the investigators through the CFHT Phase 2 Tool (PH2). This paper will discuss the technical architecture, the reasons behind our choice of technology, and our experience implementing this system during the first two semesters of Queue observing.

A soft computing-based approach to optimise queuing-inventory control problem

Science.gov (United States)

Alaghebandha, Mohammad; Hajipour, Vahid

2015-04-01

In this paper, a multi-product continuous review inventory control problem within batch arrival queuing approach (MQr/M/1) is developed to find the optimal quantities of maximum inventory. The objective function is to minimise summation of ordering, holding and shortage costs under warehouse space, service level and expected lost-sales shortage cost constraints from retailer and warehouse viewpoints. Since the proposed model is Non-deterministic Polynomial-time hard, an efficient imperialist competitive algorithm (ICA) is proposed to solve the model. To justify proposed ICA, both ganetic algorithm and simulated annealing algorithm are utilised. In order to determine the best value of algorithm parameters that result in a better solution, a fine-tuning procedure is executed. Finally, the performance of the proposed ICA is analysed using some numerical illustrations.

Sick of queuing? The Registration Service has the answer

CERN Multimedia

Antonella Del Rosso

2015-01-01

At the beginning of the year, CERN's Registration Service, in its fully renovated premises, launched a new initiative to save you time and to optimise the work of its staff.   One free-to-download application, two ticket printers and three screens: behind this simple-looking system sits an ingenious process (see the slideshow) that will enable you to avoid long waiting times at CERN's Registration Service. The Service delivers some 22 000 badges each year, reaching a peak of 700 per week, and is therefore one of the few places at CERN where queuing is the norm.  But that could all change thanks to Qminder, an app that allows users to monitor the waiting times in Building 55 from their smartphones. From today, you can take a virtual ticket using your device and see how long you will have to wait before your case is handled by the next available member of staff.  “The system can also provide statistics on waiting times in the various registration service...

Non-Stationary Single-Channel Queuing System Features Research in Context of Number of Served Queries

Directory of Open Access Journals (Sweden)

Porshnev Sergey

2017-01-01

Full Text Available This work devoted to researching of mathematical model of non-stationary queuing system (NQS. Arrival rate in studied NQS λ(t is similar to rate which observed in practice in a real access control system of objects of mass events. Dependence of number of serviced requests from time was calculated. It is proven that the ratio value of served requests at the beginning of event to all served requests described by a deterministic function, depending on the average service rate μ¯$\\bar \\mu $ and the maximum value of the arrival rate function λ(t.

A message-queuing framework for STAR's online monitoring and metadata collection

International Nuclear Information System (INIS)

Arkhipkin, D; Lauret, J; Betts, W

2011-01-01

We report our experience on migrating STARs Online Services (Run Control System, Data Acquisition System, Slow Control System and Subsystem Monitoring) from direct read/write database accesses to a modern non-blocking message-oriented infrastructure. Based on the Advanced Messaging Queuing Protocol (AMQP) and standards, this novel approach does not specify the message data structure, allowing great flexibility in its use. After careful consideration, we chose Google Protocol Buffers as our primary (de)serialization format for structured data exchange. This migration allows us to reduce the overall system complexity and greatly improve the reliability of the metadata collection and the performance of our online services in general. We will present this new framework through its software architecture overview, providing details about our staged and non-disruptive migration process as well as details of the implementation of pluggable components to provide future improvements without compromising stability and availability of services.

A queuing application to the radiology service at Hotel Dieu de France hospital (Lebanon)

International Nuclear Information System (INIS)

Shaib, Ali Hani

1995-08-01

Engineering management is becoming a vital element for the success of any service or industry. Managerial tools are being used to enhance the quality of a service or an industry and decrease its cost. Hospital services all over the world are making use of the tools in order to provide better and cheaper health care. In Lebanon, most services, including hospitals, are poorly taking advantage of the available managerial tools. this research will provide an example of applying queuing theory to the radiology service at a hospital. Supported by data from a field study, it will provide a model to predict the behavior of the service and suggest strategies that can enhance the service and increase profit. (author)

An Integrated Model of Patient and Staff Satisfaction Using Queuing Theory.

Science.gov (United States)

Komashie, Alexander; Mousavi, Ali; Clarkson, P John; Young, Terry

2015-01-01

This paper investigates the connection between patient satisfaction, waiting time, staff satisfaction, and service time. It uses a variety of models to enable improvement against experiential and operational health service goals. Patient satisfaction levels are estimated using a model based on waiting (waiting times). Staff satisfaction levels are estimated using a model based on the time spent with patients (service time). An integrated model of patient and staff satisfaction, the effective satisfaction level model, is then proposed (using queuing theory). This links patient satisfaction, waiting time, staff satisfaction, and service time, connecting two important concepts, namely, experience and efficiency in care delivery and leading to a more holistic approach in designing and managing health services. The proposed model will enable healthcare systems analysts to objectively and directly relate elements of service quality to capacity planning. Moreover, as an instrument used jointly by healthcare commissioners and providers, it affords the prospect of better resource allocation.

Implementacija metode automatizovanih nezavisnih ponavljanja u simulaciji sistema masovnog opsluživanja / Implementation of automated independent replications in the simulation of queuing systems

Directory of Open Access Journals (Sweden)

Nebojša V. Nikolić

2010-10-01

Full Text Available U radu je opisana osnovna ideja metode pod nazivom 'Automatizovano ponavljanje nezavisnih simulacionih eksperimenata sa prikupljanjem statistike slučajnih procesa'. Data je matematička osnova metode i prikazane su preporuke za implementaciju metode u formu algoritma za računarski program. Pregledno su istaknuta potrebna ekspertska znanja za uspešan razvoj konceptualnih i simulacionih modela. Metoda je testirana u istraživanju sistema masovnog opsluživanja. / This paper presents a basic idea of the method entitled 'Automated Independent Replications with Gathering Statistics of Stochastic Processes'. The mathematical foundation of the method is offered, as well as some recommendations for practical implementation of the met hod in the form of a computer program algorithm. A set of different expert knowledge needed for a successful development of conceptual and simulation models is pointed out in a separate review. The method has been tested in the modeling and simulation of queuing systems. Multidisciplinary character of simulation modeling This paper presents a basic idea of the method entitled 'Automated Independent Replications with Gathering Statistics of Stochastic Processes'. A clear review of expert knowledge needed for successful development of a conceptual model as well as a simulation one is offered. Simulation modeling of systems and processes in any military branch assumes a multidisciplinary approach. This is not a consequence of a free choice, but of needs and problems which arise in a research process and which require synchronized use of knowledge from different areas and scientific disciplines. In studies of queuing systems, these disciplines are: queuing theory, probability theory, mathematical statistics, stochastic processes, mathematical analyses, Monte Carlo simulation modeling, computer programming, knowledge about a real system under study, etc. Specific features of real queuing systems Consistency, fidelity or

Ship Lock as General Queuing System with Batch Arrivals and Batch Service

Directory of Open Access Journals (Sweden)

Zoran Radmilović

2007-11-01

Full Text Available The real lock operations with ships and barge convoys areconsidered dependent on the transport technologies applied, ormore precisely, the kinds of ships/convoys requiring thelockage. The fleet can be divided as follows: (1 groups of singleships, (2 pushed and pulled tows of barges and (3 differentcombinations of previous systems (1 and (2. The groups ofships and tows passing through the lock have extremely stochasticcharacteristics thus forming various arrivals and setvicetime patterns. It means that uniform navigation or strongscheduling between locks and lock operations are not possibleeven though highly sophisticated equipment is at disposal.Therefore, in this paper an analytical method was developedusing bulk queuing systems for the analysis and planning oflock requirements supporting it with numerical example. Thedeveloped methodology can be applied to determine the meanqueue length of ships - convoys at lock anchorage, withoutblocking behaviour between upstream and downstream navigationfor single-lane traffic.

QUEUING ANALYSIS OF CAR SERVICING CUSTOMERS USED SINGLE CHANNEL MODEL AND KENDALL'S NOTATION IN PT. ARMADA MOBIL PURWOKERTO

Directory of Open Access Journals (Sweden)

Tugiyono

2013-04-01

Full Text Available This study aims to identify the customer’s problem queue, specify the model queue, the arrival and customer service frequency distributions at PT. Armada Mobil Purwokerto. Methods of the research conducted by observing and measuring directly the research object, the data from the study was calculated according to the theory of queues. The result appropriate to single channel queuing model Poisson distribution of the arrivals, exponential distribution of the time service. The characteristized of Kendall’s notation is M/M/3/3/571.

Modeling and Analysis of Queuing Systems in Banks A case study of Ghana Commercial Bank Ltd. Kumasi Main Branch

Directory of Open Access Journals (Sweden)

Wallace Agyei

2015-07-01

Full Text Available Abstract Queues are common sight of many banks in Ghana. The obvious implication of customers waiting in long and winding queues could result to prolonged discomfort and economic cost to them however increasing the service rate will require additional number of tellers which implies extra cost to management. This study therefore attempts to find the trade-off between minimizing the total economic cost waiting cost and service cost and the provision of a satisfactory and reasonably shortest possible time of service to customers in order to assist management of the bank in deciding the optimal number of tellers needed. Data for this study was collected at the Ghana Commercial Bank Ltd Kumasi Main Branch for one month through observations interviews and by administering of questionnaire and was formulated as multi-server single line queuing model. The data was analyzed using TORA optimization Software as well as using descriptive method of analysis. The performance measures of different queuing systems were evaluated and analyzed. The results of the analysis showed using a five teller system was better than a four or a six-teller system in terms of average waiting time and thetotal economic cost hence the study recommends that the management should adopt a five teller model to reduce total economic costs and increase customer satisfaction.

Green supply chain management using the queuing theory to handle congestion and reduce energy consumption and emissions from supply chain transportation fleet

International Nuclear Information System (INIS)

Aziziankohan, A.; Jolai, F.; Khalilzadeh, M.; Soltani, R.; Tavakkoli-Moghaddam, R.

2017-01-01

Purpose: Nowadays, governments and people pay more attention to use green products due to environmental pollution, irreplaceable energy and shortage of resources. Green products are resulted from the application of green supply chain management strategies to the organizations' performance strategies, so that we can reduce environmental pollutants and wastes and take a step towards saving energy with limited resources. Methodology: In this paper, the effect of reducing energy consumption in green supply chain is examined by using queuing theory and transportation models. Data was generated and solved by a commercial optimization epackage. Findings: The findings indicate that suitable assignment of existing transportation fleet with specified capacity, and using queueing theory in a closed-loop network to reduce the queue length and handle congestion, can cause a reduction in energy consumption by optimizing transportation and waiting times in a green supply chain. Originality/value: Adopting investment strategy in improving the environmental performance of the supply chain, will yield in many advantages and benefits. This article investigates the effect of queuing theory on reducing waiting time, optimizing energy consumption in green supply chain, and consequently decreasing pollution.

Green supply chain management using the queuing theory to handle congestion and reduce energy consumption and emissions from supply chain transportation fleet

Directory of Open Access Journals (Sweden)

Arvin Aziziankohan

2017-05-01

Full Text Available Purpose: Nowadays, governments and people pay more attention to use green products due to environmental pollution, irreplaceable energy and shortage of resources. Green products are resulted from the application of green supply chain management strategies to the organizations' performance strategies, so that we can reduce environmental pollutants and wastes and take a step towards saving energy with limited resources. Methodology:  In this paper, the effect of reducing energy consumption in green supply chain is examined by using queuing theory and transportation models. Data was generated and solved by a commercial optimization epackage. Findings:  The findings indicate that suitable assignment of existing transportation fleet with specified capacity, and using queueing theory in a closed-loop network to reduce the queue length and handle congestion, can cause a reduction in energy consumption by optimizing transportation and waiting times in a green supply chain. Originality/value: Adopting investment strategy in improving the environmental performance of the supply chain, will yield in many advantages and benefits. This article investigates the effect of queuing theory on reducing waiting time, optimizing energy consumption in green supply chain, and consequently decreasing pollution.

Green supply chain management using the queuing theory to handle congestion and reduce energy consumption and emissions from supply chain transportation fleet

Energy Technology Data Exchange (ETDEWEB)

Aziziankohan, A.; Jolai, F.; Khalilzadeh, M.; Soltani, R.; Tavakkoli-Moghaddam, R.

2017-07-01

Purpose: Nowadays, governments and people pay more attention to use green products due to environmental pollution, irreplaceable energy and shortage of resources. Green products are resulted from the application of green supply chain management strategies to the organizations' performance strategies, so that we can reduce environmental pollutants and wastes and take a step towards saving energy with limited resources. Methodology: In this paper, the effect of reducing energy consumption in green supply chain is examined by using queuing theory and transportation models. Data was generated and solved by a commercial optimization epackage. Findings: The findings indicate that suitable assignment of existing transportation fleet with specified capacity, and using queueing theory in a closed-loop network to reduce the queue length and handle congestion, can cause a reduction in energy consumption by optimizing transportation and waiting times in a green supply chain. Originality/value: Adopting investment strategy in improving the environmental performance of the supply chain, will yield in many advantages and benefits. This article investigates the effect of queuing theory on reducing waiting time, optimizing energy consumption in green supply chain, and consequently decreasing pollution.

Optimal Allocation of Changing Station for Electric Vehicle Based on Queuing Theory

Directory of Open Access Journals (Sweden)

Yagang Zhang

2016-11-01

Full Text Available Electric vehicle as the main development direction of the future automotive industry, has gained attention worldwide. The rationality of the planning and construction of the power station, as the foundation of energy supply, is an important premise for the development of electric vehicles. In full consideration of the electric demand and electricity consumption, this paper proposes a new construction mode in which charging station and centralized charging station are appropriately combined and presents a location optimization model. Not only can this model be applied to determine the appropriate location for the power station, but it can use the queuing theory to determine the optimal number of power equipment, with which we can achieve the minimum costs. Finally, taking a certain city as an example, the optimum plan for power station is calculated by using this model, which provides an important reference for the study of electric vehicle infrastructure planning.

Modeling panel detection frequencies by queuing system theory: an application in gas chromatography olfactometry.

Science.gov (United States)

Bult, Johannes H F; van Putten, Bram; Schifferstein, Hendrik N J; Roozen, Jacques P; Voragen, Alphons G J; Kroeze, Jan H A

2004-10-01

In continuous vigilance tasks, the number of coincident panel responses to stimuli provides an index of stimulus detectability. To determine whether this number is due to chance, panel noise levels have been approximated by the maximum coincidence level obtained in stimulus-free conditions. This study proposes an alternative method by which to assess noise levels, derived from queuing system theory (QST). Instead of critical coincidence levels, QST modeling estimates the duration of coinciding responses in the absence of stimuli. The proposed method has the advantage over previous approaches that it yields more reliable noise estimates and allows for statistical testing. The method was applied in an olfactory detection experiment using 16 panelists in stimulus-present and stimulus-free conditions. We propose that QST may be used as an alternative to signal detection theory for analyzing data from continuous vigilance tasks.

A Survey of Wireless Fair Queuing Algorithms with Location-Dependent Channel Errors

Directory of Open Access Journals (Sweden)

Anca VARGATU

2011-01-01

Full Text Available The rapid development of wireless networks has brought more and more attention to topics related to fair allocation of resources, creation of suitable algorithms, taking into account the special characteristics of wireless environment and insurance fair access to the transmission channel, with delay bound and throughput guaranteed. Fair allocation of resources in wireless networks requires significant challenges, because of errors that occur only in these networks, such as location-dependent and bursty channel errors. In wireless networks, frequently happens, because interference of radio waves, that a user experiencing bad radio conditions during a period of time, not to receive resources in that period. This paper analyzes some resource allocation algorithms for wireless networks with location dependent errors, specifying the base idea for each algorithm and the way how it works. The analyzed fair queuing algorithms differ by the way they treat the following aspects: how to select the flows which should receive additional services, how to allocate these resources, which is the proportion received by error free flows and how the flows affected by errors are compensated.

Importance Sampling for a Markov Modulated Queuing Network with Customer Impatience until the End of Service

Directory of Open Access Journals (Sweden)

Ebrahim MAHDIPOUR

2009-01-01

Full Text Available For more than two decades, there has been a growing of interest in fast simulation techniques for estimating probabilities of rare events in queuing networks. Importance sampling is a variance reduction method for simulating rare events. The present paper carries out strict deadlines to the paper by Dupuis et al for a two node tandem network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We derive a closed form solution for the probability of missing deadlines. Then we have employed the results to an importance sampling technique to estimate the probability of total population overflow which is a rare event. We have also shown that the probability of this rare event may be affected by various deadline values.

Optimizing Endoscope Reprocessing Resources Via Process Flow Queuing Analysis.

Science.gov (United States)

Seelen, Mark T; Friend, Tynan H; Levine, Wilton C

2018-05-04

The Massachusetts General Hospital (MGH) is merging its older endoscope processing facilities into a single new facility that will enable high-level disinfection of endoscopes for both the ORs and Endoscopy Suite, leveraging economies of scale for improved patient care and optimal use of resources. Finalized resource planning was necessary for the merging of facilities to optimize staffing and make final equipment selections to support the nearly 33,000 annual endoscopy cases. To accomplish this, we employed operations management methodologies, analyzing the physical process flow of scopes throughout the existing Endoscopy Suite and ORs and mapping the future state capacity of the new reprocessing facility. Further, our analysis required the incorporation of historical case and reprocessing volumes in a multi-server queuing model to identify any potential wait times as a result of the new reprocessing cycle. We also performed sensitivity analysis to understand the impact of future case volume growth. We found that our future-state reprocessing facility, given planned capital expenditures for automated endoscope reprocessors (AERs) and pre-processing sinks, could easily accommodate current scope volume well within the necessary pre-cleaning-to-sink reprocessing time limit recommended by manufacturers. Further, in its current planned state, our model suggested that the future endoscope reprocessing suite at MGH could support an increase in volume of at least 90% over the next several years. Our work suggests that with simple mathematical analysis of historic case data, significant changes to a complex perioperative environment can be made with ease while keeping patient safety as the top priority.

Enhanced first-in-first-out-based round-robin multicast scheduling algorithm for input-queued switches

DEFF Research Database (Denmark)

Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

2011-01-01

This study focuses on the multicast scheduling for M × N input-queued switches. An enhanced first-in-first-out -based round-robin multicast scheduling algorithm is proposed with a function of searching deeper into queues to reduce the head-of-line (HOL) blocking problem and thereby the multicast...... out on the decision matrix to reduce the number of transmission for each cell. To reduce the HOL blocking problem, a complement matrix is constructed based on the traffic matrix and the decision matrix, and a process of searching deeper into the queues is carried out to find cells that can be sent...... to the idle outputs. Simulation results show that the proposed function of searching deeper into the queues can alleviate the HOL blocking and as a result reduce the multicast latency significantly. Under both balanced and unbalanced multicast traffic, the proposed algorithm is able to maintain a stable...

Modeling Relief Demands in an Emergency Supply Chain System under Large-Scale Disasters Based on a Queuing Network

Science.gov (United States)

He, Xinhua

2014-01-01

This paper presents a multiple-rescue model for an emergency supply chain system under uncertainties in large-scale affected area of disasters. The proposed methodology takes into consideration that the rescue demands caused by a large-scale disaster are scattered in several locations; the servers are arranged in multiple echelons (resource depots, distribution centers, and rescue center sites) located in different places but are coordinated within one emergency supply chain system; depending on the types of rescue demands, one or more distinct servers dispatch emergency resources in different vehicle routes, and emergency rescue services queue in multiple rescue-demand locations. This emergency system is modeled as a minimal queuing response time model of location and allocation. A solution to this complex mathematical problem is developed based on genetic algorithm. Finally, a case study of an emergency supply chain system operating in Shanghai is discussed. The results demonstrate the robustness and applicability of the proposed model. PMID:24688367

Modeling Relief Demands in an Emergency Supply Chain System under Large-Scale Disasters Based on a Queuing Network

Directory of Open Access Journals (Sweden)

Xinhua He

2014-01-01

Full Text Available This paper presents a multiple-rescue model for an emergency supply chain system under uncertainties in large-scale affected area of disasters. The proposed methodology takes into consideration that the rescue demands caused by a large-scale disaster are scattered in several locations; the servers are arranged in multiple echelons (resource depots, distribution centers, and rescue center sites located in different places but are coordinated within one emergency supply chain system; depending on the types of rescue demands, one or more distinct servers dispatch emergency resources in different vehicle routes, and emergency rescue services queue in multiple rescue-demand locations. This emergency system is modeled as a minimal queuing response time model of location and allocation. A solution to this complex mathematical problem is developed based on genetic algorithm. Finally, a case study of an emergency supply chain system operating in Shanghai is discussed. The results demonstrate the robustness and applicability of the proposed model.

Modeling relief demands in an emergency supply chain system under large-scale disasters based on a queuing network.

Science.gov (United States)

He, Xinhua; Hu, Wenfa

2014-01-01

This paper presents a multiple-rescue model for an emergency supply chain system under uncertainties in large-scale affected area of disasters. The proposed methodology takes into consideration that the rescue demands caused by a large-scale disaster are scattered in several locations; the servers are arranged in multiple echelons (resource depots, distribution centers, and rescue center sites) located in different places but are coordinated within one emergency supply chain system; depending on the types of rescue demands, one or more distinct servers dispatch emergency resources in different vehicle routes, and emergency rescue services queue in multiple rescue-demand locations. This emergency system is modeled as a minimal queuing response time model of location and allocation. A solution to this complex mathematical problem is developed based on genetic algorithm. Finally, a case study of an emergency supply chain system operating in Shanghai is discussed. The results demonstrate the robustness and applicability of the proposed model.

Modeling work of the dispatching service of high-rise building as queuing system

Science.gov (United States)

Dement'eva, Marina; Dement'eva, Anastasiya

2018-03-01

The article presents the results of calculating the performance indicators of the dispatcher service of a high-rise building as a queuing system with an unlimited queue. The calculation was carried out for three models: with a single control room and brigade of service, with a single control room and a specialized service, with several dispatch centers and specialized services. The aim of the work was to investigate the influence of the structural scheme of the organization of the dispatcher service of a high-rise building on the amount of operating costs and the time of processing and fulfilling applications. The problems of high-rise construction and their impact on the complication of exploitation are analyzed. The composition of exploitation activities of high-rise buildings is analyzed. The relevance of the study is justified by the need to review the role of dispatch services in the structure of management of the quality of buildings. Dispatching service from the lower level of management of individual engineering systems becomes the main link in the centralized automated management of the exploitation of high-rise buildings. With the transition to market relations, the criterion of profitability at the organization of the dispatching service becomes one of the main parameters of the effectiveness of its work. A mathematical model for assessing the efficiency of the dispatching service on a set of quality of service indicators is proposed. The structure of operating costs is presented. The algorithm of decision-making is given when choosing the optimal structural scheme of the dispatching service of a high-rise building.

A Dynamic Spectrum Allocation Algorithm for a Maritime Cognitive Radio Communication System Based on a Queuing Model

Directory of Open Access Journals (Sweden)

Jingbo Zhang

2017-09-01

Full Text Available With the rapid development of maritime digital communication, the demand for spectrum resources is increasing, and building a maritime cognitive radio communication system is an effective solution. In this paper, the problem of how to effectively allocate the spectrum for secondary users (SUs with different priorities in a maritime cognitive radio communication system is studied. According to the characteristics of a maritime cognitive radio and existing research about cognitive radio systems, this paper establishes a centralized maritime cognitive radio communication model and creates a simplified queuing model with two queues for the communication model. In the view of the behaviors of SUs and primary users (PUs, we propose a dynamic spectrum allocation (DSA algorithm based on the system status, and analyze it with a two-dimensional Markov chain. Simulation results show that, when different types of SUs have similar arrival rates, the algorithm can vary the priority factor according to the change of users’ status in the system, so as to adjust the channel allocation, decreasing system congestion. The improvement of the algorithm is about 7–26%, and the specific improvement is negatively correlated with the SU arrival rate.

A note on the optimal pricing strategy in the discrete-time Geo/Geo/1 queuing system with sojourn time-dependent reward

Directory of Open Access Journals (Sweden)

Doo Ho Lee

Full Text Available This work studies the optimal pricing strategy in a discrete-time Geo/Geo/1 queuing system under the sojourn time-dependent reward. We consider two types of pricing schemes. The first one is called the ex-post payment scheme where the server charges a price that is proportional to the time a customer spends in the system, and the second one is called ex-ante payment scheme where the server charges a flat price for all services. In each pricing scheme, a departing customer receives the reward that is inversely proportional to his/her sojourn time. The server should make the optimal pricing decisions in order to maximize its expected profits per time unit in each pricing scheme. This work also investigates customer's equilibrium joining or balking behavior under server's optimal pricing strategy. Numerical experiments are also conducted to validate our analysis. Keywords: Optimal pricing, Equilibrium behavior, Geo/Geo/1 queue, Sojourn time-dependent reward

Experimental Energy Consumption of Frame Slotted ALOHA and Distributed Queuing for Data Collection Scenarios

Directory of Open Access Journals (Sweden)

Pere Tuset-Peiro

2014-07-01

Full Text Available Data collection is a key scenario for the Internet of Things because it enables gathering sensor data from distributed nodes that use low-power and long-range wireless technologies to communicate in a single-hop approach. In this kind of scenario, the network is composed of one coordinator that covers a particular area and a large number of nodes, typically hundreds or thousands, that transmit data to the coordinator upon request. Considering this scenario, in this paper we experimentally validate the energy consumption of two Medium Access Control (MAC protocols, Frame Slotted ALOHA (FSA and Distributed Queuing (DQ. We model both protocols as a state machine and conduct experiments to measure the average energy consumption in each state and the average number of times that a node has to be in each state in order to transmit a data packet to the coordinator. The results show that FSA is more energy efficient than DQ if the number of nodes is known a priori because the number of slots per frame can be adjusted accordingly. However, in such scenarios the number of nodes cannot be easily anticipated, leading to additional packet collisions and a higher energy consumption due to retransmissions. Contrarily, DQ does not require to know the number of nodes in advance because it is able to efficiently construct an ad hoc network schedule for each collection round. This kind of a schedule ensures that there are no packet collisions during data transmission, thus leading to an energy consumption reduction above 10% compared to FSA.

Experimental energy consumption of Frame Slotted ALOHA and Distributed Queuing for data collection scenarios.

Science.gov (United States)

Tuset-Peiro, Pere; Vazquez-Gallego, Francisco; Alonso-Zarate, Jesus; Alonso, Luis; Vilajosana, Xavier

2014-07-24

Data collection is a key scenario for the Internet of Things because it enables gathering sensor data from distributed nodes that use low-power and long-range wireless technologies to communicate in a single-hop approach. In this kind of scenario, the network is composed of one coordinator that covers a particular area and a large number of nodes, typically hundreds or thousands, that transmit data to the coordinator upon request. Considering this scenario, in this paper we experimentally validate the energy consumption of two Medium Access Control (MAC) protocols, Frame Slotted ALOHA (FSA) and Distributed Queuing (DQ). We model both protocols as a state machine and conduct experiments to measure the average energy consumption in each state and the average number of times that a node has to be in each state in order to transmit a data packet to the coordinator. The results show that FSA is more energy efficient than DQ if the number of nodes is known a priori because the number of slots per frame can be adjusted accordingly. However, in such scenarios the number of nodes cannot be easily anticipated, leading to additional packet collisions and a higher energy consumption due to retransmissions. Contrarily, DQ does not require to know the number of nodes in advance because it is able to efficiently construct an ad hoc network schedule for each collection round. This kind of a schedule ensures that there are no packet collisions during data transmission, thus leading to an energy consumption reduction above 10% compared to FSA.

On a Batch Arrival Queuing System Equipped with a Stand-by Server during Vacation Periods or the Repairs Times of the Main Server

Directory of Open Access Journals (Sweden)

Rehab F. Khalaf

2011-01-01

Full Text Available We study a queuing system which is equipped with a stand-by server in addition to the main server. The stand-by server provides service to customers only during the period of absence of the main server when either the main server is on a vacation or it is in the state of repairs due to a sudden failure from time to time. The service times, vacation times, and repair times are assumed to follow general arbitrary distributions while the stand-by service times follow exponential distribution. Supplementary variables technique has been used to obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue while the MathCad software has been used to illustrate the numerical results in this work.

A framework for evaluating the performance of automated teller machine in banking industries: A queuing model-cum-TOPSIS approach

Directory of Open Access Journals (Sweden)

Christopher Osita Anyaeche

2018-04-01

Full Text Available The improvement in the provision of banking services to customers enhances bank’s performance (profitability and productivity and the amounts of dividend declared to shareholders as well as bank’s competitiveness. One means of fast tracking the service time for bank customers is through the use of self-servicing machines, such as automated teller machine (ATM. Total service cost, expected waiting time in queue, ATM utilization and percentage of customer loss are some of the performance indices that are used to evaluate the service rendered by a bank’s ATM. This study proposes a framework for evaluating the performance of ATM by integrating queuing model and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS methodology. Applicability of the framework was tested using practical data obtained from four banks in Nigeria. It was observed that the average ATM usage in the study area was less than 50%. The TOPSIS results identified Bank A as the best ranked bank. In addition, the results obtained revealed that banks with two ATM were ranked higher than banks with more than two ATM

Analysis of the algorithms for congestion management in computer networks

Directory of Open Access Journals (Sweden)

S. Szilágyi

2013-06-01

Full Text Available This paper presents one of the features of DS (Differentiated Services architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the outgoing interface is busy with sending another packet. Our main goal is to compare the performance of the following queuing mechanisms: FIFO (First- In First-Out, CQ (Custom Queuing, PQ (Priority Queuing, WFQ (Weighted Fair Queuing, CBWFQ (Class Based Weighted Fair Queuing and LLQ (Low Latency Queuing.

ANALISIS SISTEM ANTRIAN PADA LOKET PEMBAYARAN PT. PLN (PERSERO AREA BALI SELATAN RAYON KUTA

Directory of Open Access Journals (Sweden)

NGURAH GDE PRABA MARTHA

2012-09-01

Full Text Available The purpose of the analysis of queuing systems is to find out the model and the performance of queuing system was run. The research was conducted at PT. PLN (Persero South Bali Area Rayon Kuta and the issue raised is about the analysis of queuing systems at the payment counter. Model queue is determined based on the Kendall notation and performance of queuing systems can be determined by calculating the utilization factor. At payment counter, the queuing model used is a model (M/G/4:(GD/?/?. The performance of queuing system at payment counter of PT. PLN (Persero South Bali Area Rayon Kuta is less effective because each servers was busy on average only between 30% – 50% of working hours so that more time unemployed servers.

Energy-Efficiency Analysis of a Distributed Queuing Medium Access Control Protocol for Biomedical Wireless Sensor Networks in Saturation Conditions

Directory of Open Access Journals (Sweden)

Christos Verikoukis

2011-01-01

Full Text Available The aging population and the high quality of life expectations in our society lead to the need of more efficient and affordable healthcare solutions. For this reason, this paper aims for the optimization of Medium Access Control (MAC protocols for biomedical wireless sensor networks or wireless Body Sensor Networks (BSNs. The hereby presented schemes always have in mind the efficient management of channel resources and the overall minimization of sensors’ energy consumption in order to prolong sensors’ battery life. The fact that the IEEE 802.15.4 MAC does not fully satisfy BSN requirements highlights the need for the design of new scalable MAC solutions, which guarantee low-power consumption to the maximum number of body sensors in high density areas (i.e., in saturation conditions. In order to emphasize IEEE 802.15.4 MAC limitations, this article presents a detailed overview of this de facto standard for Wireless Sensor Networks (WSNs, which serves as a link for the introduction and initial description of our here proposed Distributed Queuing (DQ MAC protocol for BSN scenarios. Within this framework, an extensive DQ MAC energy-consumption analysis in saturation conditions is presented to be able to evaluate its performance in relation to IEEE 802.5.4 MAC in highly dense BSNs. The obtained results show that the proposed scheme outperforms IEEE 802.15.4 MAC in average energy consumption per information bit, thus providing a better overall performance that scales appropriately to BSNs under high traffic conditions. These benefits are obtained by eliminating back-off periods and collisions in data packet transmissions, while minimizing the control overhead.

Odbavování zákazníků v provozovně Mc Donald pomocí modelů hromadné obsluhy

OpenAIRE

Kánová, Eliška

2011-01-01

The aim of this research is to evaluate the queuing system in a McDonald's restaurant in Mlada Boleslav and to try it to optimize with queuing models, system STORM and module STOCHASTIKA. In the theoretical part, there are characterized queuing models, their classification and analysis. There are described two specific systems here -- a simple exponential model and exponential model with parallel operation, there are also outlined software systems for the optimization. There are described bas...

Cost Reduction of Taxi Enterprises at the Expense of Automobile Fleet Optimization

Directory of Open Access Journals (Sweden)

Novytskyi А.V.

2016-05-01

Full Text Available Results of taxi service operation using techniques of queuing system theory have been demonstrated. It has been shown that probability of service denial is the key quality criterion of transport services for taxi services. It is expedient to use total expenditures of queuing system as target function to estimate the efficiency of taxi service. It has been determined that application of queuing theory techniques makes it possible to identify optimum value of the number of operating motor vehicles for specific environment. The value is optimum according to minimum-cost criterion.

Proposition of delay model for signalized intersections with queueing theory analytical models usage

Directory of Open Access Journals (Sweden)

Grzegorz SIERPIŃSKI

2007-01-01

Full Text Available Time delay on intersections is a very important transport problem. Thearticle includes a proposition of time delay model. Variance of service times is considered by used average waiting time in queue for queuing system with compressed queuing processes usage as a part of proposed time delays model.

The dynamics of urban traffic congestion and the price of parking

DEFF Research Database (Denmark)

Fosgerau, Mogens; de Palma, André

2013-01-01

We consider commuting in a congested urban area. While an efficient time-varying toll may eliminate queuing, a toll may not be politically feasible. We study the benefit of a substitute: a parking fee at the workplace. An optimal time-varying parking fee is charged at zero rate when there is queu...

Einstein Critical-Slowing-Down is Siegel CyberWar Denial-of-Access Queuing/Pinning/ Jamming/Aikido Via Siegel DIGIT-Physics BEC ``Intersection''-BECOME-UNION Barabasi Network/GRAPH-Physics BEC: Strutt/Rayleigh-Siegel Percolation GLOBALITY-to-LOCALITY Phase-Transition Critical-Phenomenon

Science.gov (United States)

Buick, Otto; Falcon, Pat; Alexander, G.; Siegel, Edward Carl-Ludwig

2013-03-01

Einstein[Dover(03)] critical-slowing-down(CSD)[Pais, Subtle in The Lord; Life & Sci. of Albert Einstein(81)] is Siegel CyberWar denial-of-access(DOA) operations-research queuing theory/pinning/jamming/.../Read [Aikido, Aikibojitsu & Natural-Law(90)]/Aikido(!!!) phase-transition critical-phenomenon via Siegel DIGIT-Physics (Newcomb[Am.J.Math. 4,39(1881)]-{Planck[(1901)]-Einstein[(1905)])-Poincare[Calcul Probabilités(12)-p.313]-Weyl [Goett.Nachr.(14); Math.Ann.77,313 (16)]-{Bose[(24)-Einstein[(25)]-Fermi[(27)]-Dirac[(1927)]}-``Benford''[Proc.Am.Phil.Soc. 78,4,551 (38)]-Kac[Maths.Stat.-Reasoning(55)]-Raimi[Sci.Am. 221,109 (69)...]-Jech[preprint, PSU(95)]-Hill[Proc.AMS 123,3,887(95)]-Browne[NYT(8/98)]-Antonoff-Smith-Siegel[AMS Joint-Mtg.,S.-D.(02)] algebraic-inversion to yield ONLY BOSE-EINSTEIN QUANTUM-statistics (BEQS) with ZERO-digit Bose-Einstein CONDENSATION(BEC) ``INTERSECTION''-BECOME-UNION to Barabasi[PRL 876,5632(01); Rev.Mod.Phys.74,47(02)...] Network /Net/GRAPH(!!!)-physics BEC: Strutt/Rayleigh(1881)-Polya(21)-``Anderson''(58)-Siegel[J.Non-crystalline-Sol.40,453(80)

Investigations on the discrete Gi(G)1 queue with and without loss

International Nuclear Information System (INIS)

Gergely, T.; Toeroek, T.L.

1975-12-01

A comprehensive discussion of the method for investigating queuing systems characterized by random variables of integer values is given. Specially the discrete GI(G)1 queuing systems are considered. The first part of the paper takes a short summary on the theory of discrete stochastic processes. In the second part the properties of the fundamental characteristics of the queuing system as the busy period, the waiting time and the output processes are discussed. In the last section some remarks are added to show the direction of further investigations. To demonstrated the simplicity of the relations verified in the paper some computed examples are presented in the appendix. The computations were performed with a mini-computer of 8K words memory. (Sz.Z.)

Optimization of airport security process

Science.gov (United States)

Wei, Jianan

2017-05-01

In order to facilitate passenger travel, on the basis of ensuring public safety, the airport security process and scheduling to optimize. The stochastic Petri net is used to simulate the single channel security process, draw the reachable graph, construct the homogeneous Markov chain to realize the performance analysis of the security process network, and find the bottleneck to limit the passenger throughput. Curve changes in the flow of passengers to open a security channel for the initial state. When the passenger arrives at a rate that exceeds the processing capacity of the security channel, it is queued. The passenger reaches the acceptable threshold of the queuing time as the time to open or close the next channel, simulate the number of dynamic security channel scheduling to reduce the passenger queuing time.

Synchronous and Asynchronous ATM Multiplexor Properties Comparsion

OpenAIRE

Jan Zabka

2006-01-01

The article is aimed to ATM multiplexor computer model utilisation. Based on simulation runs we try to review aspects of use a synchronous and asynchronous ATM multiplexors. ATM multiplexor is the input queuing model with three inputs. Synchronous multiplexor works without an input priority. Multiplexor inputs are served periodically. Asynchronous multiplexor model supports several queuing and priority mechanisms. CLR and CTD are basic performance parameters. Input cell flows are genera...

An M/M/c/K State-Dependent Model for Pedestrian Flow Control and Design of Facilities.

Directory of Open Access Journals (Sweden)

Khalidur Rahman

Full Text Available Pedestrian overflow causes queuing delay and in turn, is controlled by the capacity of a facility. Flow control or blocking control takes action to avoid queues from building up to extreme values. Thus, in this paper, the problem of pedestrian flow control in open outdoor walking facilities in equilibrium condition is investigated using M/M/c/K queuing models. State dependent service rate based on speed and density relationship is utilized. The effective rate of the Poisson arrival process to the facility is determined so as there is no overflow of pedestrians. In addition, the use of the state dependent queuing models to the design of the facilities and the effect of pedestrian personal capacity on the design and the traffic congestion are discussed. The study does not validate the sustainability of adaptation of Western design codes for the pedestrian facilities in the countries like Bangladesh.

Delay-aware adaptive sleep mechanism for green wireless-optical broadband access networks

Science.gov (United States)

Wang, Ruyan; Liang, Alei; Wu, Dapeng; Wu, Dalei

2017-07-01

Wireless-Optical Broadband Access Network (WOBAN) is capacity-high, reliable, flexible, and ubiquitous, as it takes full advantage of the merits from both optical communication and wireless communication technologies. Similar to other access networks, the high energy consumption poses a great challenge for building up WOBANs. To shot this problem, we can make some load-light Optical Network Units (ONUs) sleep to reduce the energy consumption. Such operation, however, causes the increased packet delay. Jointly considering the energy consumption and transmission delay, we propose a delay-aware adaptive sleep mechanism. Specifically, we develop a new analytical method to evaluate the transmission delay and queuing delay over the optical part, instead of adopting M/M/1 queuing model. Meanwhile, we also analyze the access delay and queuing delay of the wireless part. Based on such developed delay models, we mathematically derive ONU's optimal sleep time. In addition, we provide numerous simulation results to show the effectiveness of the proposed mechanism.

Multi-Flow Carrier Aggregation in Heterogeneous Networks: Cross-Layer Performance Analysis

KAUST Repository

Alorainy, Abdulaziz

2017-02-09

Multi-flow carrier aggregation (CA) has recently been considered to meet the increasing demand for high data rates. In this paper, we investigate the cross-layer performance of multi-flow CA for macro user equipments (MUEs) in the expanded range (ER) of small cells. We develop a fork/join (F/J) queuing analytical model that takes into account the time varying channels, the channel scheduling algorithm, partial CQI feedback and the number of component carriers deployed at each tier. Our model also accounts for stochastic packet arrivals and the packet scheduling mechanism. The analytical model developed in this paper can be used to gauge various packet-level performance parameters e.g., packet loss probability (PLP) and queuing delay. For the queuing delay, our model takes out-of-sequence packet delivery into consideration. The developed model can also be used to find the amount of CQI feedback and the packet scheduling of a particular MUE in order to offload as much traffic as possible from the macrocells to the small cells while maintaining the MUE\\'s quality of service (QoS) requirements.

Queuing systems on a circle

NARCIS (Netherlands)

Kroese, Dirk; Schmidt, Volker

1993-01-01

Consider a ring on which customers arrive according to a Poisson process. Arriving customers drop somewhere on the circle and wait there for a server who travels on the ring. Whenever this server encounters a customer, he stops and serves the customer according to an arbitrary service time

Performance Analysis of a Cluster-Based MAC Protocol for Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jesús Alonso-Zárate

2010-01-01

Full Text Available An analytical model to evaluate the non-saturated performance of the Distributed Queuing Medium Access Control Protocol for Ad Hoc Networks (DQMANs in single-hop networks is presented in this paper. DQMAN is comprised of a spontaneous, temporary, and dynamic clustering mechanism integrated with a near-optimum distributed queuing Medium Access Control (MAC protocol. Clustering is executed in a distributed manner using a mechanism inspired by the Distributed Coordination Function (DCF of the IEEE 802.11. Once a station seizes the channel, it becomes the temporary clusterhead of a spontaneous cluster and it coordinates the peer-to-peer communications between the clustermembers. Within each cluster, a near-optimum distributed queuing MAC protocol is executed. The theoretical performance analysis of DQMAN in single-hop networks under non-saturation conditions is presented in this paper. The approach integrates the analysis of the clustering mechanism into the MAC layer model. Up to the knowledge of the authors, this approach is novel in the literature. In addition, the performance of an ad hoc network using DQMAN is compared to that obtained when using the DCF of the IEEE 802.11, as a benchmark reference.

Applied probability and stochastic processes. 2. ed.

Energy Technology Data Exchange (ETDEWEB)

Feldman, Richard M. [Texas A and M Univ., College Station, TX (United States). Industrial and Systems Engineering Dept.; Valdez-Flores, Ciriaco [Sielken and Associates Consulting, Inc., Bryan, TX (United States)

2010-07-01

This book presents applied probability and stochastic processes in an elementary but mathematically precise manner, with numerous examples and exercises to illustrate the range of engineering and science applications of the concepts. The book is designed to give the reader an intuitive understanding of probabilistic reasoning, in addition to an understanding of mathematical concepts and principles. The initial chapters present a summary of probability and statistics and then Poisson processes, Markov chains, Markov processes and queuing processes are introduced. Advanced topics include simulation, inventory theory, replacement theory, Markov decision theory, and the use of matrix geometric procedures in the analysis of queues. Included in the second edition are appendices at the end of several chapters giving suggestions for the use of Excel in solving the problems of the chapter. Also new in this edition are an introductory chapter on statistics and a chapter on Poisson processes that includes some techniques used in risk assessment. The old chapter on queues has been expanded and broken into two new chapters: one for simple queuing processes and one for queuing networks. Support is provided through the web site http://apsp.tamu.edu where students will have the answers to odd numbered problems and instructors will have access to full solutions and Excel files for homework. (orig.)

76 FR 19519 - Intent To Prepare an Environmental Impact Statement for the Downtown San Francisco Ferry Terminal...

Science.gov (United States)

2011-04-07

... alleviates congestion over the Bay Bridge and through the Bay Area Rapid Transit (BART) Transbay Tube... pedestrian promenades, and separation of ferry patron queuing from other pedestrian and vehicular movements...

Analysis and Behaviour Understanding of a Production System

Directory of Open Access Journals (Sweden)

Olga Ioana Amariei

2009-10-01

Full Text Available In production systems modelling usually acts to system simulation by discrete events. The present paper exemplifies this, using the Queuing System Simulation module of the WinQSB software

Measurement-Based Hybrid Fluid-Flow Models for Fast Multi-Scale Simulation and Control

National Research Council Canada - National Science Library

Sohraby, Khosrow

2004-01-01

.... We point out that traditional queuing models are intractable or provide poor fit to real-life networks, while discrete-event simulation at the packet level can consume prohibitive amounts of CPU times...

Author Details

African Journals Online (AJOL)

Journal Home > Advanced Search > Author Details ... Design and Implementation of an M/M/1 Queuing Model Algorithm and its Applicability in ... Vehicle Identification Technology to Intercept Small Arms and Ammunition on Nigeria Roads

Improving Customer Service at the Agricultural Development Banks ...

African Journals Online (AJOL)

Improving Customer Service at the Agricultural Development Banks in Ghana: An Application of the Queuing Theory. ... African Journal of Management Research. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue ...

Estimating the Reliability of the Elements of Cloud Services

Directory of Open Access Journals (Sweden)

Iuliia V. Ignatova

2017-01-01

Full Text Available Cloud technologies are a very considerable area that influence IT infrastructure, network services and applications. Research has highlighted difficulties in the functioning of cloud infrastructure. For instance, if a server is subjected to malicious attacks or a force majeure causes a failure in the cloud's service, it is required to determine the time that it takes the system to return to being fully functional after the crash. This will determine the technological and financial risks faced by the owner and end users of cloud services. Therefore, to solve the problem of determining the expected time before service is resumed after a failure, we propose to apply Markovian queuing systems, specifically a model of a multi-channel queuing system with Poisson input flow and denial-of-service (breakdown. (original abstract

Traffic flow characteristic and capacity in intelligent work zones.

Science.gov (United States)

2009-10-15

Intellgent transportation system (ITS) technologies are utilized to manage traffic flow and safety in : highway work zones. Traffic management plans for work zones require queuing analyses to determine : the anticipated traffic backups, but the predi...

Real-Time Network Management

National Research Council Canada - National Science Library

Riolo, Joseph

1998-01-01

.... According to our Phase I research, it is possible to collect data on the network and morph it into queuing models to produce information about the network and physical layers of nodes on a network...

System design document for the INFLO prototype.

Science.gov (United States)

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

Nigerian journal of technology

African Journals Online (AJOL)

student1

2013-07-02

Jul 2, 2013 ... APPLICATION OF QUEUING THEORY TO PETROL STATIONS IN ... respectively while the average departure rate of customers per hour were obtained as 86.2,. 89, 89.7, 91.7 .... Green [13], who discussed the relationship.

Some highlights on the work in probability theory in India during ...

Indian Academy of Sciences (India)

processes, growth of cancer cells, queuing theory ... context are: • J Medhi ... person dynamic game, the role of the Skorohod ... Neumann and oblique derivative boundary value ... belief is wrong. ... work has been done under the leadership of.

Design of an IPTV Multicast System for Internet Backbone Networks

Directory of Open Access Journals (Sweden)

T. H. Szymanski

2010-01-01

Full Text Available The design of an IPTV multicast system for the Internet backbone network is presented and explored through extensive simulations. In the proposed system, a resource reservation algorithm such as RSVP, IntServ, or DiffServ is used to reserve resources (i.e., bandwidth and buffer space in each router in an IP multicast tree. Each router uses an Input-Queued, Output-Queued, or Crosspoint-Queued switch architecture with unity speedup. A recently proposed Recursive Fair Stochastic Matrix Decomposition algorithm used to compute near-perfect transmission schedules for each IP router. The IPTV traffic is shaped at the sources using Application-Specific Token Bucker Traffic Shapers, to limit the burstiness of incoming network traffic. The IPTV traffic is shaped at the destinations using Application-Specific Playback Queues, to remove residual network jitter and reconstruct the original bursty IPTV video streams at each destination. All IPTV traffic flows are regenerated at the destinations with essentially zero delay jitter and essentially-perfect QoS. The destination nodes deliver the IPTV streams to the ultimate end users using the same IPTV multicast system over a regional Metropolitan Area Network. It is shown that all IPTV traffic is delivered with essentially-perfect end-to-end QoS, with deterministic bounds on the maximum delay and jitter on each video frame. Detailed simulations of an IPTV distribution system, multicasting several hundred high-definition IPTV video streams over several essentially saturated IP backbone networks are presented.

THE WORK SIMULATION OF FLOW RATE FOR CARRIAGES' REPAIR AS A MULTIPHASE, MULTIPLEX AND MULTIDISCIPLINARY SYSTEM OF MASS SERVICE

Directory of Open Access Journals (Sweden)

V. V. Myamlin

2011-04-01

Full Text Available The algorithm of computer simulation of the flexible flow for repair of cars as a multiphase polychannel manyobject queuing system is presented. The basic operators of the model are given and their work is described.

Atomic routing in a deterministic queuing model

Directory of Open Access Journals (Sweden)

T.L. Werth

2014-03-01

We also consider the makespan objective (arrival time of the last user and show that optimal solutions and Nash equilibria in these games, where every user selfishly tries to minimize her travel time, can be found efficiently.

'people queued for hours to see him'.

Science.gov (United States)

Carlisle, Daloni

2012-05-30

I met Khalil Dale (pictured) in 1995 when writing about the International Committee of the Red Cross (ICRC) campaign to end the use of landmines. I spent a week alongside him, reporting on his work for the ICRC in northern Afghanistan. Khalil was a gentle, quiet man who left a big impression on everyone who met him.

the z-transform applied to a birth-death process having varying birth

African Journals Online (AJOL)

DEPT OF AGRICULTURAL ENGINEERING

model can be used to study practical queuing and birth-death systems where the arrival, birth, ser- vice and death rates ... for systems operating in fading environments (Hueda and ... mobile computing (Lee et al., 1999) and the transmission ...

Modelo hipercubo integrado a um algoritmo genético para análise de sistemas médicos emergenciais em rodovias The hypercube queuing model integrated to a genetic algorithm to analyze emergency medical systems on highways

Directory of Open Access Journals (Sweden)

Ana Paula Iannoni

2006-04-01

Full Text Available O modelo hipercubo, conhecido na literatura de problemas de localização de sistemas servidor para cliente, é um modelo baseado em teoria de filas espacialmente distribuídas e aproximações Markovianas. O modelo pode ser modificado para analisar os sistemas de atendimentos emergenciais (SAEs em rodovias, considerando as particularidades da política de despacho destes sistemas. Neste estudo, combinou-se o modelo hipercubo com um algoritmo genético para otimizar a configuração e operação de SAEs em rodovias. A abordagem é efetiva para apoiar decisões relacionadas ao planejamento e operação destes sistemas, por exemplo, em determinar o tamanho ideal para as áreas de cobertura de cada ambulância, de forma a minimizar o tempo médio de resposta aos usuários e o desbalanceamento das cargas de trabalho das ambulâncias. Os resultados computacionais desta abordagem foram analisados utilizando dados reais do sistema Anjos do Asfalto (rodovia Presidente Dutra.The hypercube model, well-known in the literature on problems of server-to-customer localization systems, is based on the spatially distributed queuing theory and Markovian analysis approximations. The model can be modified to analyze Emergency Medical Systems (EMSs on highways, considering the particularities of these systems' dispatching policies. In this study, we combine the hypercube model with a genetic algorithm to optimize the configuration and operation of EMSs on highways. This approach is effective to support planning and operation decisions, such as determining the ideal size of the area each ambulance should cover to minimize not only the average time of response to the user but also ambulance workload imbalances, as well as generating a Pareto efficient boundary between these measures. The computational results of this approach were analyzed using real data Anjos do Asfalto EMS (which covers the Presidente Dutra highway.

Real-Time Operating System/360

Science.gov (United States)

Hoffman, R. L.; Kopp, R. S.; Mueller, H. H.; Pollan, W. D.; Van Sant, B. W.; Weiler, P. W.

1969-01-01

RTOS has a cost savings advantage for real-time applications, such as those with random inputs requiring a flexible data routing facility, display systems simplified by a device independent interface language, and complex applications needing added storage protection and data queuing.

Multi-Flow Carrier Aggregation in Heterogeneous Networks: Cross-Layer Performance Analysis

KAUST Repository

Alorainy, Abdulaziz; Hossain, Md. Jahangir; Alouini, Mohamed-Slim

2017-01-01

) of small cells. We develop a fork/join (F/J) queuing analytical model that takes into account the time varying channels, the channel scheduling algorithm, partial CQI feedback and the number of component carriers deployed at each tier. Our model also

Concave switching in single-hop and multihop networks

NARCIS (Netherlands)

Walton, N.

2015-01-01

Switched queueing networks model wireless networks, input-queued switches, and numerous other networked communications systems. We consider an (\\(\\alpha ,g\\))-switch policy; these policies provide a generalization of the MaxWeight policies of Tassiulas and Ephremides (IEEE Trans Autom Control

Reconfigurable layout problem

NARCIS (Netherlands)

Meng, G.; Heragu, S.S.; Heragu, S.S.; Zijm, Willem H.M.

2004-01-01

This paper addresses the reconfigurable layout problem, which differs from traditional, robust and dynamic layout problems mainly in two aspects: first, it assumes that production data are available only for the current and upcoming production period. Second, it considers queuing performance

Publications | Page 268 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Is the developing world healthier, wealthier, better fed. ... Thirty-one countries from war-torn Afghanistan to Yemen are queued for membership ... Just say the words and a stereotype comes to mind — a system of education that is “second best.

Modeling and performance analysis of cooperative communications in cognitive radio networks

KAUST Repository

Khabazian, Mehdi; Aissa, Sonia

2011-01-01

as well as to relay the primary's traffic in a cooperative fashion. Taking a queuing theory approach, we find the probability generating functions of the numbers of packets in the queues of the primary and secondary users. Subsequently, we determine a

Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems

DEFF Research Database (Denmark)

Pop, Paul; Eles, Petru; Peng, Zebo

2004-01-01

We present an approach to partitioning and mapping for multi-cluster embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. We have proposed a schedulability analysis for such systems, including a worst-case queuing delay analysis for the gateways...

A Center of Excellence in the Mathematical Sciences - at Cornell University

Science.gov (United States)

1992-03-01

S.L. PHOENIX 62 PAGES 87. GROEBNER BASES: THE ANCIENT SECRET MYSTIC POWER OF THE ALGU COMPUBRAICUS ,A REVELATION WHOSE SIMPLICITY WILL MAKE LADIES...Equations, October 1988; Groebner Basis, October 1988; Theoretical Aspects of Multiphase Flow, October 1988; Mathematical Theory of Queuing Systems

Optimization of airport security lanes

Science.gov (United States)

Chen, Lin

2018-05-01

Current airport security management system is widely implemented all around the world to ensure the safety of passengers, but it might not be an optimum one. This paper aims to seek a better security system, which can maximize security while minimize inconvenience to passengers. Firstly, we apply Petri net model to analyze the steps where the main bottlenecks lie. Based on average tokens and time transition, the most time-consuming steps of security process can be found, including inspection of passengers' identification and documents, preparing belongings to be scanned and the process for retrieving belongings back. Then, we develop a queuing model to figure out factors affecting those time-consuming steps. As for future improvement, the effective measures which can be taken include transferring current system as single-queuing and multi-served, intelligently predicting the number of security checkpoints supposed to be opened, building up green biological convenient lanes. Furthermore, to test the theoretical results, we apply some data to stimulate the model. And the stimulation results are consistent with what we have got through modeling. Finally, we apply our queuing model to a multi-cultural background. The result suggests that by quantifying and modifying the variance in wait time, the model can be applied to individuals with various habits customs and habits. Generally speaking, our paper considers multiple affecting factors, employs several models and does plenty of calculations, which is practical and reliable for handling in reality. In addition, with more precise data available, we can further test and improve our models.

MODEL OF FUNCTIONING OF TELECOMMUNICATION EQUIPMENT FOR SOFTWARE-CONFIGURATED NETWORKS

Directory of Open Access Journals (Sweden)

Konstantin E. Samouylov

2018-03-01

Full Text Available A mathematical model of the functioning of the switch of a software defined networks is constructed in the form of a queuing network consisting of two queuing systems: the first simulates an input data buffer and a device for reading information from the header of the packet; the second is a table for addressing the switch of a software defined networks. The receipt of data in software defined networks has a probabilistic character in their deterministic processing in communication channels and switching nodes. Therefore, this mathematical model of the functioning of the switch of a software defined networks was built on the basis of queuing systems and networks. The stream of requests flowing into the network was divided into two Poisson streams of various types of applications, the first of which corresponded to the packets that came to the control port of the switch (from the controller, and the second flow to the remaining packets arriving on the switch. The flow corresponding to the packets arriving at the switch from the controller has a relative priority over the flow from the remaining arriving packets As a result, formulas were obtained for calculating the performance indicators of this telecommunications equipment such as average waiting queues for priority and non-priority applications, the probability of loss of applications for each phase of the switch. Based on the received quality of service indicators for this telecommunications equipment, it is possible to assess the stability of switches in software defined networks for various information impacts.

Study of a New Quick-Charging Strategy for Electric Vehicles in Highway Charging Stations

Directory of Open Access Journals (Sweden)

Lixing Chen

2016-09-01

Full Text Available To solve the problem, because of which conventional quick-charging strategies (CQCS cannot meet the requirements of quick-charging for multiple types of electric vehicles (EV on highways where vehicle inflow is excessive, this paper proposed a new quick-charging strategy (NQCS for EVs: on the premise of not affecting those EVs being charged, the remaining power of the quick-charging pile with multiple power output interfaces is used to provide a synchronous charging service for EVs waiting in the queue. To verify the effectiveness of this strategy, a power distribution model of charging pile and a queuing model of charging station (CS were constructed. In addition, based on an actual highway service area where vehicle inflow is excessive during the simulation period (0:00–24:00, charging situations of CQCS and NQCS were respectively simulated in a charging station (CS, with different number of chargers, by basic queuing algorithm and an improved queuing algorithm. The simulation results showed that when the relative EV inflow is excessive, compared to CQCS, NQCS not only can reduce user waiting time, charging time, and stay time, but also can improve the utilisation rate of charging infrastructure and service capacity of CS and reduce the queue length of CS. At the same time, NQCS can reduce the impact on the power grid. In addition, in NQCS, the on-demand power distribution method is more efficient than the average power distribution method. Therefore, NQCS is more suitable for quick-charging for multiple types of EVs on highways where vehicle inflow is excessive.

ANALYSING SURFACE MOVEMENT DELAYS IN AN AIRPORT

Directory of Open Access Journals (Sweden)

Volodymyr Kharchenko

2014-07-01

Full Text Available Queuing effect can be in the different components of ground operations. Causes of surface – movement delays are long taxi – in and taxi – out operations during departure and arrival of aircraft. Surface movement delays in an airport are analyzed

The relationship between social factors and the poverty experienced ...

African Journals Online (AJOL)

Based on these findings the study recommended that policies aimed towards increasing access of households to educational facilities and provision of better family planning should be given adequate attention. Keywords: Markov games; Queuing; Virtual reality strategies; nash equilibrium, MSC CLASSIFICATION: 91A43 ...

End-to-end Configuration of Wireless Realtime Communication over Heterogeneous Protocols

DEFF Research Database (Denmark)

Malinowsky, B.; Grønbæk, Jesper; Schwefel, Hans-Peter

2015-01-01

This paper describes a wireless real-time communication system design using two Time Division Multiple Access (TDMA) protocols. Messages are subject to prioritization and queuing. For this interoperation scenario, we show a method for end-to-end configuration of protocols and queue sizes. Such co...

Performance Evaluation of a Mobile Wireless Computational Grid ...

African Journals Online (AJOL)

This work developed and simulated a mathematical model for a mobile wireless computational Grid architecture using networks of queuing theory. This was in order to evaluate the performance of theload-balancing three tier hierarchical configuration. The throughput and resource utilizationmetrics were measured and the ...

Cross-training workers in dual resource constrained systems with heterogeneous processing times

NARCIS (Netherlands)

Bokhorst, J. A. C.; Gaalman, G. J. C.

2009-01-01

In this paper, we explore the effect of cross-training workers in Dual Resource Constrained (DRC) systems with machines having different mean processing times. By means of queuing and simulation analysis, we show that the detrimental effects of pooling (cross-training) previously found in single

On a generic class of Lévy-driven vacation models

NARCIS (Netherlands)

Boxma, O.; Kella, O.; Mandjes, M.

2010-01-01

This article analyzes a generic class of queuing systems with server vacation. The special feature of the models considered is that the duration of the vacations explicitly depends on the buffer content evolution during the previous active period (i.e., the time elapsed since the previous vacation).

African Journal of Management Research - Vol 21, No 1 (2013)

African Journals Online (AJOL)

Improving Customer Service at the Agricultural Development Banks in Ghana: An Application of the Queuing Theory · EMAIL FULL TEXT EMAIL FULL TEXT DOWNLOAD FULL TEXT DOWNLOAD FULL ... The Politics of Appraisal - Does Upward Feedback Offer an Objective View? An Empirical Study · EMAIL FULL TEXT ...

Markov queue game with virtual reality strategies | Nwobi-Okoye ...

African Journals Online (AJOL)

A non cooperative markov game with several unique characteristics was introduced. Some of these characteristics include: the existence of a single phase multi server queuing model and markovian transition matrix/matrices for each game, introduction of virtual situations (virtual reality) or dummies to improve the chances ...

Publications | Page 268 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

“It's my job as a journalist to broadcast the story of Afghanistan to the world. ... the words and a stereotype comes to mind — a system of education that is “second best. ... Thirty-one countries from war-torn Afghanistan to Yemen are queued for ...

An exact analysis of the multi-class M/M/k priority queue with partial blocking

NARCIS (Netherlands)

Sleptchenko, Andrei; van Harten, Aart; van der Heijden, Matthijs C.

2003-01-01

We consider a multi‐server queuing model with two priority classes that consist of multiple customer types. The customers belonging to one priority class customers are lost if they cannot be served immediately upon arrival. Each customer type has its own Poisson arrival and exponential service rate.

Work-related symptoms and checkstand configuration: an experimental study.

Science.gov (United States)

Harber, P; Bloswick, D; Luo, J; Beck, J; Greer, D; Peña, L F

1993-07-01

Supermarket checkers are known to be at risk of upper-extremity cumulative trauma disorders. Forty-two experienced checkers checked a standard "market basket" of items on an experimental checkstand. The counter height could be adjusted (high = 35.5, low = 31.5 inches), and the pre-scan queuing area length (between conveyor belt and laser scanner) could be set to "near" or "far" lengths. Each subject scanned under the high-near, high-far, low-near, and low-far conditions in random order. Seven ordinal symptom scales were used to describe comfort. Analysis showed that both counter height and queuing length had significant effects on symptoms. Furthermore, the height of the subject affected the degree and direction of the impact of the checkstand configuration differences. The study suggests that optimization of design may be experimentally evaluated, that modification of postural as well as frequency loading may be beneficial, and that adjustability for the individual may be advisable.

A finite capacity queue with Markovian arrivals and two servers with group services

Directory of Open Access Journals (Sweden)

S. Chakravarthy

1994-01-01

Full Text Available In this paper we consider a finite capacity queuing system in which arrivals are governed by a Markovian arrival process. The system is attended by two exponential servers, who offer services in groups of varying sizes. The service rates may depend on the number of customers in service. Using Markov theory, we study this finite capacity queuing model in detail by obtaining numerically stable expressions for (a the steady-state queue length densities at arrivals and at arbitrary time points; (b the Laplace-Stieltjes transform of the stationary waiting time distribution of an admitted customer at points of arrivals. The stationary waiting time distribution is shown to be of phase type when the interarrival times are of phase type. Efficient algorithmic procedures for computing the steady-state queue length densities and other system performance measures are discussed. A conjecture on the nature of the mean waiting time is proposed. Some illustrative numerical examples are presented.

Elements of queueing theory palm martingale calculus and stochastic recurrences

CERN Document Server

Baccelli, François

2003-01-01

The Palm theory and the Loynes theory of stationary systems are the two pillars of the modern approach to queuing. This book, presenting the mathematical foundations of the theory of stationary queuing systems, contains a thorough treatment of both of these. This approach helps to clarify the picture, in that it separates the task of obtaining the key system formulas from that of proving convergence to a stationary state and computing its law. The theory is constantly illustrated by classical results and models: Pollaczek-Khintchin and Tacacs formulas, Jackson and Gordon-Newell networks, multiserver queues, blocking queues, loss systems etc., but it also contains recent and significant examples, where the tools developed turn out to be indispensable. Several other mathematical tools which are useful within this approach are also presented, such as the martingale calculus for point processes, or stochastic ordering for stationary recurrences. This thoroughly revised second edition contains substantial addition...

Ethernet Networks for Real-Time Use in the ATLAS Experiment

CERN Document Server

Meirosu, C; Martin, B

2005-01-01

Ethernet became today's de-facto standard technology for local area networks. Defined by the IEEE 802.3 and 802.1 working groups, the Ethernet standards cover technologies deployed at the first two layers of the OSI protocol stack. The architecture of modern Ethernet networks is based on switches. The switches are devices usually built using a store-and-forward concept. At the highest level, they can be seen as a collection of queues and mathematically modelled by means of queuing theory. However, the traffic profiles on modern Ethernet networks are rather different from those assumed in classical queuing theory. The standard recommendations for evaluating the performance of network devices define the values that should be measured but do not specify a way of reconciling these values with the internal architecture of the switches. The introduction of the 10 Gigabit Ethernet standard provided a direct gateway from the LAN to the WAN by the means of the WAN PHY. Certain aspects related to the actual use of WAN ...

A worldwide flock of Condors : load sharing among workstation clusters

NARCIS (Netherlands)

Epema, D.H.J.; Livny, M.; Dantzig, van R.; Evers, X.; Pruyne, J.

1996-01-01

Condor is a distributed batch system for sharing the workload of compute-intensive jobs in a pool of unix workstations connected by a network. In such a Condor pool, idle machines are spotted by Condor and allocated to queued jobs, thus putting otherwise unutilized capacity to efficient use. When

Implementation of the Automated Numerical Model Performance Metrics System

Science.gov (United States)

2011-09-26

question. As of this writing, the DSRC IBM AIX machines DaVinci and Pascal, and the Cray XT Einstein all use the PBS batch queuing system for...3.3). 12 Appendix A – General Automation System This system provides general purpose tools and a general way to automatically run

76 FR 45705 - Approval and Promulgation of Air Quality Implementation Plans; Pennsylvania; Diesel-Powered Motor...

Science.gov (United States)

2011-08-01

... following methods: A. http://www.regulations.gov . Follow the on-line instructions for submitting comments... the equipment is in good working order, if necessary as part of the inspection; (6) idling of a... off school property during queuing for the sequential discharge or pickup of students where the...

International Journal of Science and Technology (STECH) Bahir Dar ...

African Journals Online (AJOL)

Nneka Umera-Okeke

In this paper, analysis of single queue, multi-server with limited system capacity under first come first served discipline was carried out using iterative method. The arrivals of customers and service times of customers are assumed poisson and exponential distributions respectively. This queuing model is an extension of ...

The supremuim of a negative drift random walk with dependent heavy-tailed steps

NARCIS (Netherlands)

Mikosch, T; Smorodnitsky, G

Many important probabilistic models in queuing theory, insurance and finance deal with partial sums of a negative mean stationary process (a negative drift random walk), and the law of the supremum of such a process is used to calculate, depending on the context, the ruin probability, the steady

Education as a signal of trainability: results from a vignette study with Italian employers

NARCIS (Netherlands)

Di Stasio, V.

2014-01-01

Drawing on queuing theory, this study explores the relationship between education and labour market entry from the perspective of employers. On the basis of vignette study, we simulated a hiring process with a sample of recruiters and human resource managers. We analysed the role of education in the

Autocorrelation in queuing network-type production systems - revisited

DEFF Research Database (Denmark)

Nielsen, Erland Hejn

2007-01-01

, either production managers are missing important aspects in production planning, or the 'realistic' autocorrelation patterns inherent in actual production setups are not like those considered in the literature. In this paper, relevant and 'realistic' types of autocorrelation schemes are characterised...

Autocorrelation in queuing network type production systems - revisited

DEFF Research Database (Denmark)

Nielsen, Erland Hejn

-production systems (Takahashi and Nakamura, 1998) establishes that autocorrelation plays definitely a non-negligible role in relation to the dimensioning as well as functioning of Kanban-controlled production flow lines . This must logically either imply that production managers are missing an important aspect...... in their production planning reasoning, or that the 'realistic' autocorrelation patterns , inherent in actual production setups , are not like those so far considered in the literature. In this paper, an attempt to characterise relevant and 'realistic' types of autocorrelation schemes as well as their levels...

Spectrally Queued Feature Selection for Robotic Visual Odometery

Science.gov (United States)

2010-11-23

in these systems has yet to be defined. 1. INTRODUCTION 1.1 Uses of Autonomous Vehicles Autonomous vehicles have a wide range of possible...applications. In military situations, autonomous vehicles are valued for their ability to keep Soldiers far away from danger. A robot can inspect and disarm...just a glimpse of what engineers are hoping for in the future. 1.2 Biological Influence Autonomous vehicles are becoming more of a possibility in

Queuing theory models used for port equipment sizing

Science.gov (United States)

Dragu, V.; Dinu, O.; Ruscă, A.; Burciu, Ş.; Roman, E. A.

2017-08-01

The significant growth of volumes and distances on road transportation led to the necessity of finding solutions to increase water transportation market share together with the handling and transfer technologies within its terminals. It is widely known that the biggest times are consumed within the transport terminals (loading/unloading/transfer) and so the necessity of constantly developing handling techniques and technologies in concordance with the goods flows size so that the total waiting time of ships within ports is reduced. Port development should be achieved by harmonizing the contradictory interests of port administration and users. Port administrators aim profit increase opposite to users that want savings by increasing consumers’ surplus. The difficulty consists in the fact that the transport demand - supply equilibrium must be realised at costs and goods quantities transiting the port in order to satisfy the interests of both parties involved. This paper presents a port equipment sizing model by using queueing theory so that the sum of costs for ships waiting operations and equipment usage would be minimum. Ship operation within the port is assimilated to a mass service waiting system in which parameters are later used to determine the main costs for ships and port equipment.

Reducing external speedup requirements for input-queued crossbars

DEFF Research Database (Denmark)

Berger, Michael Stubert

2005-01-01

performance degradation. This implies, that the required bandwidth between port card and switch card is 2 times the actual port speed, adding to cost and complexity. To reduce this bandwidth, a modified architecture is proposed that introduces a small amount of input and output memory on the switch card chip...

78 FR 9963 - Self-Regulatory Organizations; Financial Industry Regulatory Authority, Inc.; Notice of Filing of...

Science.gov (United States)

2013-02-12

... guidance for situations where delays could result from queuing of data into the FINRA Facilities (given.... \\18\\ This is supported by a review of member trade reporting statistics. As previously noted, during..., 100 F Street, NE., Washington, DC 20549-1090. All submissions should refer to File No. SR-FINRA-2013...

and Correlated Error-Regressor

African Journals Online (AJOL)

Nekky Umera

in queuing theory and econometrics, where the usual assumption of independent error terms may not be plausible in most cases. Also, when using time-series data on a number of micro-economic units, such as households and service oriented channels, where the stochastic disturbance terms in part reflect variables which ...

Analysis and implementation of packet preemption for Time Sensitive Networks

DEFF Research Database (Denmark)

Zhou, Zifan; Yan, Ying; Ruepp, Sarah Renée

2017-01-01

level simulation in Riverbed Modeler. The simulation is complemented by numerical analysis which provides the average queuing delay for both types of traffic (preemptable and express). Furthermore, the paper describes an approach to implement the packet preemption solution on an FPGA in VHDL, which...... illustrates the complexity of hardware implementation....

Empirical Analysis of Priority on a FCFS Queue Discipline In ...

African Journals Online (AJOL)

Queues are virtually unavoidable phenomenon in Nigerian banking system. While banks stride to meet customers services' satisfaction, customers who do not go immediately into service must wait in line (if any). The queuing discipline in banks has been first-come-first-served (FCFS). What happen to the waiting time ...

Large deviations for Gaussian queues modelling communication networks

CERN Document Server

Mandjes, Michel

2007-01-01

Michel Mandjes, Centre for Mathematics and Computer Science (CWI) Amsterdam, The Netherlands, and Professor, Faculty of Engineering, University of Twente. At CWI Mandjes is a senior researcher and Director of the Advanced Communications Network group.  He has published for 60 papers on queuing theory, networks, scheduling, and pricing of networks.

Capacitated two-echelon inventory models for repairable item systems

NARCIS (Netherlands)

Avsar, Z.M.; Zijm, Willem H.M.; Gershwin, S.B.; Dallery, Y.; Papadopoulos, C.; Smith, J.M.

2002-01-01

In this paper, we consider two-echelon maintenance systems with repair facilities both at a number of local service centers (called bases) and at a central location. Each repair facility may be considered to be a job shop and is modeled as a (limited capacity) open queuing network, while any

Internet access and usage by staff and students: a case study of ...

African Journals Online (AJOL)

This study focused on Internet access and usage by staff and students in the University of Jos Main Library. It investigated monthly number of users that queued to access Internet monthly and the number of users who actually had access to use the Internet between January – December 2006. Other things investigated ...

Estimating Performance of Single Bus, Shared Memory Multiprocessors

Science.gov (United States)

1987-05-01

Chandy78] K.M. Chandy, C.M. Sauer, "Approximate methods for analyzing queuing network models of computing systems," Computing Surveys, vol10 , no 3...Denning78] P. Denning, J. Buzen, "The operational analysis of queueing network models", Computing Sur- veys, vol10 , no 3, September 1978, pp 225-261

A model to create an efficient and equitable admission policy for patients arriving to the cardiothoracic ICU.

Science.gov (United States)

Yang, Muer; Fry, Michael J; Raikhelkar, Jayashree; Chin, Cynthia; Anyanwu, Anelechi; Brand, Jordan; Scurlock, Corey

2013-02-01

To develop queuing and simulation-based models to understand the relationship between ICU bed availability and operating room schedule to maximize the use of critical care resources and minimize case cancellation while providing equity to patients and surgeons. Retrospective analysis of 6-month unit admission data from a cohort of cardiothoracic surgical patients, to create queuing and simulation-based models of ICU bed flow. Three different admission policies (current admission policy, shortest-processing-time policy, and a dynamic policy) were then analyzed using simulation models, representing 10 yr worth of potential admissions. Important output data consisted of the "average waiting time," a proxy for unit efficiency, and the "maximum waiting time," a surrogate for patient equity. A cardiothoracic surgical ICU in a tertiary center in New York, NY. Six hundred thirty consecutive cardiothoracic surgical patients admitted to the cardiothoracic surgical ICU. None. Although the shortest-processing-time admission policy performs best in terms of unit efficiency (0.4612 days), it did so at expense of patient equity prolonging surgical waiting time by as much as 21 days. The current policy gives the greatest equity but causes inefficiency in unit bed-flow (0.5033 days). The dynamic policy performs at a level (0.4997 days) 8.3% below that of the shortest-processing-time in average waiting time; however, it balances this with greater patient equity (maximum waiting time could be shortened by 4 days compared to the current policy). Queuing theory and computer simulation can be used to model case flow through a cardiothoracic operating room and ICU. A dynamic admission policy that looks at current waiting time and expected ICU length of stay allows for increased equity between patients with only minimum losses of efficiency. This dynamic admission policy would seem to be a superior in maximizing case-flow. These results may be generalized to other surgical ICUs.

Finding External Indicators of Load on a Web Server via Analysis of Black-Box Performance Measurements

Science.gov (United States)

Chiarini, Marc A.

2010-01-01

Traditional methods for system performance analysis have long relied on a mix of queuing theory, detailed system knowledge, intuition, and trial-and-error. These approaches often require construction of incomplete gray-box models that can be costly to build and difficult to scale or generalize. In this thesis, we present a black-box analysis…

Status of the French photovoltaic fleet on the 30 September 2011; Etat des lieux du parc photovoltaique francais au 30 septembre 2011

Energy Technology Data Exchange (ETDEWEB)

NONE

2012-01-15

This publication first present some key data regarding photovoltaic energy production in France (connected and to be connected), and then presents the photovoltaic fleet (geographical distribution, installed power in metropolitan France, Corsica and ultramarine territories). It gives an overview of the evolution of connection request and queuing management in France and at the regional level

Surprise as a design strategy

NARCIS (Netherlands)

Ludden, G.D.S.; Schifferstein, H.N.J.; Hekkert, P.P.M.

2008-01-01

Imagine yourself queuing for the cashier’s desk in a supermarket. Naturally, you have picked the wrong line, the one that does not seem to move at all. Soon, you get tired of waiting. Now, how would you feel if the cashier suddenly started to sing? Many of us would be surprised and, regardless of

Status of the French photovoltaic fleet on the 30 September 2011

International Nuclear Information System (INIS)

2012-01-01

This publication first present some key data regarding photovoltaic energy production in France (connected and to be connected), and then presents the photovoltaic fleet (geographical distribution, installed power in metropolitan France, Corsica and ultramarine territories). It gives an overview of the evolution of connection request and queuing management in France and at the regional level

A Lévy input fluid queue with input and workload regulation

NARCIS (Netherlands)

Palmowski, Z.B.; Vlasiou, M.; Zwart, B.

2011-01-01

We consider a queuing model with the workload evolving between consecutive i.i.d. exponential timers $\\{e_q^{(i)}\\}_{i=1,2,\\ldots}$ according to a spectrally positive Lévy process $Y_i(t)$ that is reflected at zero, and where the environment $i$ equals 0 or 1. When the exponential clock $e_q^{(i)}$

Berkeley lab checkpoint/restart (BLCR) for Linux clusters

International Nuclear Information System (INIS)

Hargrove, Paul H; Duell, Jason C

2006-01-01

This article describes the motivation, design and implementation of Berkeley Lab Checkpoint/Restart (BLCR), a system-level checkpoint/restart implementation for Linux clusters that targets the space of typical High Performance Computing applications, including MPI. Application-level solutions, including both checkpointing and fault-tolerant algorithms, are recognized as more time and space efficient than system-level checkpoints, which cannot make use of any application-specific knowledge. However, system-level checkpointing allows for preemption, making it suitable for responding to ''fault precursors'' (for instance, elevated error rates from ECC memory or network CRCs, or elevated temperature from sensors). Preemption can also increase the efficiency of batch scheduling; for instance reducing idle cycles (by allowing for shutdown without any queue draining period or reallocation of resources to eliminate idle nodes when better fitting jobs are queued), and reducing the average queued time (by limiting large jobs to running during off-peak hours, without the need to limit the length of such jobs). Each of these potential uses makes BLCR a valuable tool for efficient resource management in Linux clusters

Waiting as Part of the Fun: Interactive Gaming in Theme Park Queues

NARCIS (Netherlands)

Heger, Chris; Offermans, S.A.M.; Frens, J.W.; Wouters, I.H.C.; Kimman, F.P.F.; Tieben, R.; Offermans, S.A.M.; Nagtzaam, H.A.H.

2009-01-01

People visiting theme parks intend to have a day of fun. Yet a larger part of the time is spent queuing for rides rather than in the actual rides, which does not contribute to the intended fun experience. Current efforts therefore either make the queue as bearable as possible or try to get rid of it

A Busy period analysis of the level dependent PH/PH/1/K queue

NARCIS (Netherlands)

Al Hanbali, Ahmad

2011-01-01

In this paper, we study the transient behavior of a level dependent single server queuing system with a waiting room of finite size during the busy period. The focus is on the level dependent PH/PH/1/K queue. We derive in closed form the joint transform of the length of the busy period, the number

The Dynamic Multi-objective Multi-vehicle Covering Tour Problem

Science.gov (United States)

2013-06-01

144 [38] Coello, Carlos A. Coello, Gary B Lamont, and David A Van Veldhuizen . Evolutionary Algorithms for Solving Multi-Objective Problems. Springer...Traveling Repairperson Problem (DTRP) Policies Proposed by Bertsimas and Van Ryzin. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.3...queuing theory perspective. Table 3.2: DTRP Policies Proposed by Bertsimas and Van Ryzin. Name Description First Come First Serve (FCFS) vehicles

modelling of queuing process at airport check-in system

African Journals Online (AJOL)

HOD

Key words: Airport check-in system, discrete time events, analytical models, simulation model, SimEvents toolbox. 1. ..... [6] Gross, D. and Harris, C. M. Fundamentals of. Queueing ... [11] Manataki I. E. and Zogra os K. G. “A Generic. System ...

UPnP QoS and queuing in home networks

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Wessing, Henrik; Dittmann, Lars

2010-01-01

The QoS provisioning in home networks is being more often considered for future use cases, where mulitple high bandwidth flows are accomodated in the home environment. This paper investigates chosen characteristics of one of the home network control and management protocol suites, namely UPn......P. Using network modeling tools, we evaluate UPnP QoS architecture and its resource management influence on the end-to-end packet delay characteristics for different scheduling approaches....

METHODOLOGY AND ALGORITHM OF OPTIMIZATION OF THE NEED OF SETTLEMENTS FOR TECHNICAL INSPECTION LINES FOR VEHICLES

Directory of Open Access Journals (Sweden)

Maslennikov Valeriy Aleksandrovich

2016-06-01

Full Text Available The current methods of predicting the demand of the community for the lines of technical inspection of vehicles do not fully take into account the probabilistic and statistical nature of the complaints of car owners. This results in significant mistakes in the determination of the number of such lines, accompanied by insufficient rhythm of their operation. The design errors related to the complexity of accurate account for calendar fluctuations of the number of appeals can be partially or completely eliminated by using mathematical apparatus of the queuing theory. In this case, the complex technical system is considered as an open multi-channel queuing system with limited queue length. The received flows and serviced requests are considered to be the simplest. From a practical point of view, the replacement of one type of computational model by the other allows ensuring a more sustainable mode of calculating operations using the computer. The paper also provides a calculation expression for defining the lower and upper confidence limits of the dispersion of the average values of the number of arrivals of vehicles at the technical inspection that allows setting the interval of uncertainty for searching the optimal solution.

A Study on Coexistence Capability Evaluations of the Enhanced Channel Hopping Mechanism in WBANs

Directory of Open Access Journals (Sweden)

Zhongcheng Wei

2017-01-01

Full Text Available As an important coexistence technology, channel hopping can reduce the interference among Wireless Body Area Networks (WBANs. However, it simultaneously brings some issues, such as energy waste, long latency and communication interruptions, etc. In this paper, we propose an enhanced channel hopping mechanism that allows multiple WBANs coexisted in the same channel. In order to evaluate the coexistence performance, some critical metrics are designed to reflect the possibility of channel conflict. Furthermore, by taking the queuing and non-queuing behaviors into consideration, we present a set of analysis approaches to evaluate the coexistence capability. On the one hand, we present both service-dependent and service-independent analysis models to estimate the number of coexisting WBANs. On the other hand, based on the uniform distribution assumption and the additive property of Possion-stream, we put forward two approximate methods to compute the number of occupied channels. Extensive simulation results demonstrate that our estimation approaches can provide an effective solution for coexistence capability estimation. Moreover, the enhanced channel hopping mechanism can significantly improve the coexistence capability and support a larger arrival rate of WBANs.

Cross Layer Analysis of P2MP Hybrid FSO/RF Network

KAUST Repository

Rakia, Tamer

2017-02-22

This paper presents and analyzes a point-tomultipoint (P2MP) network that uses a number of freespace optical (FSO) links for data transmission from the central node to the different remote nodes of the network. A common backup radio frequency (RF) link can be used by the central node for data transmission to any remote node in case any one of the FSO links fails. Each remote node is assigned a transmit buffer at the central node. Considering the transmission link from the central node to a tagged remote node, we study various performance metrics. Specifically,we study the throughput from the central node to the tagged node, the average transmit buffer size, the symbol queuing delay in the transmit buffer, the efficiency of the queuing system, the symbol loss probability, and the RF link utilization. Numerical examples are presented to compare the performance of the proposed P2MP hybrid FSO/RF network with that of a P2MP FSO-only network and show that the P2MP hybrid FSO/RF network achieves considerable performance improvement over the P2MP FSO-only network.

Assessing Port Governance, Devolution and Terminal Performance in Nigeria

Directory of Open Access Journals (Sweden)

D. E. Onwuegbuchunam

2018-02-01

Full Text Available Concerns about performance and efficiency in port terminals led many national governments to embark on port reforms. The Federal government of Nigeria, for example, adopted the Landlord port model which brought about concessioning of port terminals to private operators. Despite high investments in terminal facilities by the private terminal operators, there are still complaints about level of service offered to port users. This paper applied key performance indicator metrics and parameters of queuing model in assessing performance of Nigeria’s concessioned port terminals. Data for the study were obtained from terminal level records of cargo and ship handling activities for years 2000 to 2015. Major findings indicate that cargo and vessel throughputs improved after the reforms in the six ports examined. However, much variability was observed in trends in ships’ turnround times across all ports after the concession policy implementation. Additional results from the queuing model analysis suggest that the high ships turnround times observed in some ports are associated to delays in ship operation at the berths. The paper recommends that policy interventions be focused on ship operations at the berths as a step in improving service level in the port terminals.

Letter to the Editor: Electric Vehicle Demand Model for Load Flow Studies

DEFF Research Database (Denmark)

Garcia-Valle, Rodrigo; Vlachogiannis, Ioannis (John)

2009-01-01

This paper introduces specific and simple model for electric vehicles suitable for load flow studies. The electric vehicles demand system is modelled as PQ bus with stochastic characteristics based on the concept of queuing theory. All appropriate variables of stochastic PQ buses are given...... with closed formulae as a function of charging time. Specific manufacturer model of electric vehicles is used as study case....

On optimal control of a sweeping process coupled with an ordinary differential equation

Czech Academy of Sciences Publication Activity Database

Adam, Lukáš; Outrata, Jiří

2014-01-01

Roč. 19, č. 9 (2014), s. 2709-2738 ISSN 1531-3492 R&D Projects: GA ČR(CZ) GAP201/12/0671 Grant - others:GA MŠk(CZ) SVV-2013-267315 Institutional support: RVO:67985556 Keywords : optimal control * variational inequality * variational analysis * coderivative * solution map * queuing theory Subject RIV: BA - General Mathematics Impact factor: 0.768, year: 2014 http://library.utia.cas.cz/separaty/2014/MTR/adam-0434417.pdf

Request Stream Control for the Access to Broadband Multimedia Educational Resources in the Distance Learning System

Directory of Open Access Journals (Sweden)

Irina Pavlovna Bolodurina

2013-10-01

Full Text Available This article presents a model of queuing system for broadband multimedia educational resources, as well as a model of access to a hybrid cloud system storage. These models are used to enhance the efficiency of computing resources in a distance learning system. An additional OpenStack control module has been developed to achieve the distribution of request streams and balance the load between cloud nodes.

A Market-Clearing Role for Inefficiency on a Limit Order Book

OpenAIRE

Jeremy Large

2006-01-01

Using a stochastic sequential game in ergodic equilibrium, this paper models limit order book trading dynamics. It deduces investor surplus and some agents' strategies from depth's stationarity, while bypassing altogether agents' intricate forecasting problems. Market inefficiency adjusts to induce equal supply and demand for liquidity over time. Consequently, at a given bid-ask spread surplus per investor is invariant to faster, more regular or more sophisticated trading, or modified queuing...

Developing and Validating Practical Eye Metrics for the Sense-Assess-Augment Framework

Science.gov (United States)

2015-09-29

fit, mathematical calculations, classification , and saccade queuing. The Signal Filtering of the raw EOG data stream is necessary to improve the...the eye if the participant slouches, changes seating position, or turns their head. Conversely, the EOG signals needed for blink and saccade detection... EOG signal to reach its maximum distance from the origin, the blink detection algorithm was monitored. If the blink detector was active, then a

An Information Theoretic Investigation Of Complex Adaptive Supply Networks With Organizational Topologies

Science.gov (United States)

2016-12-22

for the global pattern. A network view has proven useful in modeling a supply - chain for patterns of interaction. Queuing theory can be used to...phenomena. Second, operations management and supply - chain management lack metrics for evolution and dynamism in supply networks. Third, developing...robust theories in the presence of 14 adaptation is a formidable task. Supply - chain management theory can be built by identifying CAS phenomena and

Feature analysis for closed queuing system with non-preemptive priorities

Directory of Open Access Journals (Sweden)

Yu. G. Nesterov

2014-01-01

Full Text Available The object of research in this article is to obtain the analytical expressions for the probability distribution functions (PDF of states of the closed system of mass service (SMS like "model of the repairman" Mr|GIr|1 || Nr in a stationary mode. The SMS has a source of requests of final capacity with exponentially distributed time of residence of different class requests in the source, one queue with discipline of requests service i.e. the non-preemptive priorities, one serving device (SD and arbitrary PDF of a residence time of each class requests.The method includes the following steps.The first step, while servicing the non-uniform population of requests, distinguishes a sequence of time points, so-called points of regeneration in which a process behaves as Markov's. It is shown that such points are time points to complete a service of requests in SD. Further, for these points an embedded Markov's chain is designed, and the states space of this chain is defined. Analytical expressions to calculate the elements of transition probability matrix in such chain are obtained. These expressions reflect a relationship between these probabilities and the source parameters, the residence time PDF parameters, the number of each class requests, and a discipline of their service. Further, the solution for PDF of this chain states is found.The second step establishes connection between the PDF of SMS states in a stationary mode and the previously received PDF of states of the embedded Markov's chain. Such connection is defined by a system of the equations of global balance for the SMS states in a stationary mode and states of the embedded Markov's chain. The physical sense of such balance is that each of SMS state in a stationary mode is in equilibrium, i.e. the intensities of transitions from the state and in the state are equal. The space of states of initial SMS in a stationary mode is defined. It is shown that in intervals of request service time in SD the process behaves as a process of net reproduction when intensity of death – transition of SMS to "lower" states – is equal to zero. The paper presents the obtained analytical expressions to calculate the stationary PDF of given SMS depending on the PDF of the embedded Markov' chain, the discipline of service, and the PDF of residence times to serve different class requests in SD.The third step provides expressions to calculate the average values of residence and waiting times of each class requests in SMS, as well as expressions to define the SD loading by requests of each class and the general loading of SD. The formulas development is based on conservatism (work preservation, fair for discipline of service with non-preemptive priorities, and also using Little's result and expressions for average number of requests of each class in SMS which, in turn, are defined by the PDF of SMS states in a stationary mode.

Solving Enterprise Applications Performance Puzzles Queuing Models to the Rescue

CERN Document Server

Grinshpan, Leonid

2012-01-01

A groundbreaking scientific approach to solving enterprise applications performance problems Enterprise applications are the information backbone of today's corporations, supporting vital business functions such as operational management, supply chain maintenance, customer relationship administration, business intelligence, accounting, procurement logistics, and more. Acceptable performance of enterprise applications is critical for a company's day-to-day operations as well as for its profitability. Unfortunately, troubleshooting poorly performing enterprise applications has traditionally

A Spatial Queuing-Based Algorithm for Multi-Robot Task Allocation

Directory of Open Access Journals (Sweden)

William Lenagh

2015-08-01

Full Text Available Multi-robot task allocation (MRTA is an important area of research in autonomous multi-robot systems. The main problem in MRTA is to allocate a set of tasks to a set of robots so that the tasks can be completed by the robots while ensuring that a certain metric, such as the time required to complete all tasks, or the distance traveled, or the energy expended by the robots is reduced. We consider a scenario where tasks can appear dynamically and a task needs to be performed by multiple robots to be completed. We propose a new algorithm called SQ-MRTA (Spatial Queueing-MRTA that uses a spatial queue-based model to allocate tasks between robots in a distributed manner. We have implemented the SQ-MRTA algorithm on accurately simulated models of Corobot robots within the Webots simulator for different numbers of robots and tasks and compared its performance with other state-of-the-art MRTA algorithms. Our results show that the SQ-MRTA algorithm is able to scale up with the number of tasks and robots in the environment, and it either outperforms or performs comparably with respect to other distributed MRTA algorithms.

“Bus Lane Within The Area Of Intersection” Method For Buses Priority On The Intersections

Directory of Open Access Journals (Sweden)

Vikovych Ihor

2015-12-01

Full Text Available The primary objective of this article is to formalize the “special bus lanes within the area of intersection” method that allows providing buses with space-time priority at signalized intersections (mostly of the isolated type, including those with no more than two traffic lanes in each direction at the approaches to the intersection. The article establishes the limits for efficient application of this method, and describes the results of a simulation experiment conducted in the VISSIM environment to investigate the functioning of the method on an actual intersection. The most critical phase of implementation of this method is to determine the optimum length of the special bus lane at the approach to the intersection. The optimum length of special bus lanes at the approaches to isolated or coordinated intersections is determined based on the maximum length of queued vehicles which is computed using the simulation models developed in the Objective-C language. The article covers the basic characteristics of those models, their structure and building principles, and also provides the model validation results. Simulation models can be used both for determination of the optimum length of special bus lanes at the approaches to signalized intersections and for analysis of intersection performance based on the maximum length of queued vehicles.

An Optimal Medium Access Control with Partial Observations for Sensor Networks

Directory of Open Access Journals (Sweden)

Servetto Sergio D

2005-01-01

Full Text Available We consider medium access control (MAC in multihop sensor networks, where only partial information about the shared medium is available to the transmitter. We model our setting as a queuing problem in which the service rate of a queue is a function of a partially observed Markov chain representing the available bandwidth, and in which the arrivals are controlled based on the partial observations so as to keep the system in a desirable mildly unstable regime. The optimal controller for this problem satisfies a separation property: we first compute a probability measure on the state space of the chain, namely the information state, then use this measure as the new state on which the control decisions are based. We give a formal description of the system considered and of its dynamics, we formalize and solve an optimal control problem, and we show numerical simulations to illustrate with concrete examples properties of the optimal control law. We show how the ergodic behavior of our queuing model is characterized by an invariant measure over all possible information states, and we construct that measure. Our results can be specifically applied for designing efficient and stable algorithms for medium access control in multiple-accessed systems, in particular for sensor networks.

Dynamic Extensions of Batch Systems with Cloud Resources

International Nuclear Information System (INIS)

Hauth, T; Quast, G; Büge, V; Scheurer, A; Kunze, M; Baun, C

2011-01-01

Compute clusters use Portable Batch Systems (PBS) to distribute workload among individual cluster machines. To extend standard batch systems to Cloud infrastructures, a new service monitors the number of queued jobs and keeps track of the price of available resources. This meta-scheduler dynamically adapts the number of Cloud worker nodes according to the requirement profile. Two different worker node topologies are presented and tested on the Amazon EC2 Cloud service.

Design and simulation of airport congestion control algorithms

OpenAIRE

Simaiakis, Ioannis; Balakrishnan, Hamsa

2014-01-01

This paper proposes a stochastic model of runway departures and a dynamic programming algorithm for their control at congested airports. Using a multi-variable state description that includes the capacity forecast, the runway system is modeled as a semi-Markov process. The paper then introduces a queuing system for modeling the controlled departure process that enables the efficient calculation of optimal pushback policies using decomposition techniques. The developed algorithm is simulated a...

Probability theory

CERN Document Server

Dorogovtsev, A Ya; Skorokhod, A V; Silvestrov, D S; Skorokhod, A V

1997-01-01

This book of problems is intended for students in pure and applied mathematics. There are problems in traditional areas of probability theory and problems in the theory of stochastic processes, which has wide applications in the theory of automatic control, queuing and reliability theories, and in many other modern science and engineering fields. Answers to most of the problems are given, and the book provides hints and solutions for more complicated problems.

Data flow manager for DART

International Nuclear Information System (INIS)

Berg, D.; Black, D.; Slimmer, D.; Engelfried, J.; O'Dell, V.

1994-04-01

The DART Data Flow Manager (dfm) integrates a buffer manager with a requester/provider model for scheduling work on buffers. Buffer lists, representing built events or other data, are queued by service requesters to service providers. Buffers may be either internal (reside on the local node), or external (located elsewhere, e.g., dual ported memory). Internal buffers are managed locally. Wherever possible, dfm moves only addresses of buffers rather than buffers themselves

Experimental evaluation of end-to-end delay in switched Ethernet application in the automotive domain

OpenAIRE

Beretis , Kostas; Symeonidis , Ieroklis

2013-01-01

International audience; This article presents an approach for deriving upper bound for end-to-end delay in a double star switched Ethernet network. Four traffic classes, following a strict priority queuing policy, were considered. The theoretical analysis was based on network calculus. An experimental setup, which accu-rately reflects an automotive communication network, was implemented in or-der to evaluate the theoretical model. The results obtained by the experiments provided valuable feed...

Effect of smoke-free policies on the behaviour of social smokers

OpenAIRE

Philpot, S.; Ryan, S.; Torre, L.; Wilcox, H.; Jalleh, G.; Jamrozik, K.

1999-01-01

OBJECTIVE—To test the hypothesis that proposed amendments to the Occupational Safety and Health Act making all enclosed workplaces in Western Australia smoke free would result in a decrease in cigarette consumption by patrons at nightclubs, pubs, and restaurants without adversely affecting attendance.
DESIGN—Cross sectional structured interview survey.
PARTICIPANTS AND SETTING—Patrons of several inner city pubs and nightclubs in Perth were interviewed while queuing for admission to these venu...

Computer-integrated electric-arc melting process control system

OpenAIRE

Дёмин, Дмитрий Александрович

2014-01-01

Developing common principles of completing melting process automation systems with hardware and creating on their basis rational choices of computer- integrated electricarc melting control systems is an actual task since it allows a comprehensive approach to the issue of modernizing melting sites of workshops. This approach allows to form the computer-integrated electric-arc furnace control system as part of a queuing system “electric-arc furnace - foundry conveyor” and consider, when taking ...

Analysis of a production/inventory system with multiple retailers

OpenAIRE

Noblesse, Ann; Boute, Robert; Lambrecht, Marc; Van Houdt, B.

2014-01-01

We study a production/inventory system with one manufacturing plant and multiple retailers. Production lead times at the plant are stochastic and endogenously determined by the orders placed by the different retailers. Assuming stochastic (phase-type distributed) production and setup times, we make use of matrix analytic techniques to develop a queuing model that is capable to compute the distribution of the time orders spend in the production facility, depending on the retailer’s lot s...

Rationing with baselines

DEFF Research Database (Denmark)

Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Østerdal, Lars Peter Raahave

2013-01-01

We introduce a new operator for general rationing problems in which, besides conflicting claims, individual baselines play an important role in the rationing process. The operator builds onto ideas of composition, which are not only frequent in rationing, but also in related problems...... such as bargaining, choice, and queuing. We characterize the operator and show how it preserves some standard axioms in the literature on rationing. We also relate it to recent contributions in such literature....

Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues

OpenAIRE

Lloret-Batlle, Roger; Jayakrishnan, R.

2018-01-01

This article explores the coalitional stability of a new cooperative control policy for freeways and parallel queuing facilities with multiple servers. Based on predicted future delays per queue or lane, a VOT-heterogeneous population of agents can agree to switch lanes or queues and transfer payments to each other in order to minimize the total cost of the incoming platoon. The strategic interaction is captured by an n-level Stackelberg model with coalitions, while the cooperative structure ...

Impact of mobility on call block, call drops and optimal cell size in small cell networks

OpenAIRE

Ramanath , Sreenath; Voleti , Veeraruna Kavitha; Altman , Eitan

2011-01-01

We consider small cell networks and study the impact of user mobility. Assuming Poisson call arrivals at random positions with random velocities, we discuss the characterization of handovers at the boundaries. We derive explicit expressions for call block and call drop probabilities using tools from spatial queuing theory. We also derive expressions for the average virtual server held up time. These expressions are used to derive optimal cell sizes for various profile of velocities in small c...

Ramp metering with an objective to reduce fuel consumption

OpenAIRE

Vreeswijk, Jacob Dirk; Woldeab, Zeremariam; de Koning, Anne; Bie, Jing

2011-01-01

Ramp meters successfully decrease congestion but leave a burden on the traffic situation at on-ramps. Chaotic queuing leads to many stop-and-go movements and causes inefficiency where fuel consumption is concerned. As part of the eCoMove project, complementary strategies are being designed and evaluated to reduce fuel consumption at metered on-ramps, using vehicle-to-infrastructure communication. This paper presents the design of two strategies, as well as their effect as derived from simulat...

Renewal processes

CERN Document Server

Mitov, Kosto V

2014-01-01

This monograph serves as an introductory text to classical renewal theory and some of its applications for graduate students and researchers in mathematics and probability theory. Renewal processes play an important part in modeling many phenomena in insurance, finance, queuing systems, inventory control and other areas. In this book, an overview of univariate renewal theory is given and renewal processes in the non-lattice and lattice case are discussed. A pre-requisite is a basic knowledge of probability theory.

Competition and Outsourcing with Scale Economies

OpenAIRE

Gérard P. Cachon; Patrick T. Harker

2002-01-01

Scale economies are commonplace in operations, yet because of analytical challenges, relatively little is known about how firms should compete in their presence. This paper presents a model of competition between two firms that face scale economies; (i.e., each firm's cost per unit of demand is decreasing in demand). A general framework is used, which incorporates competition between two service providers with price- and time-sensitive demand (a queuing game), and competition between two reta...

OPTIMISATION OF BUFFER SIZE FOR ENHANCING QOS OF VIDEO TRAFFIC USING CROSS LAYERED HYBRID TRANSPORT LAYER PROTOCOL APPROACH

OpenAIRE

S. Matilda; B. Palaniappan

2011-01-01

Video streaming is gaining importance, with the wide popularity of multimedia rich applications in the Internet. Video streams are delay sensitive and require seamless flow for continuous visualization. Properly designed buffers offer a solution to queuing delay. The diagonally opposite QoS metrics associated with video traffic poses an optimization problem, in the design of buffers. This paper is a continuation of our previous work [1] and deals with the design of buffers. It aims at finding...

System model the processing of heterogeneous sensory information in robotized complex

Science.gov (United States)

Nikolaev, V.; Titov, V.; Syryamkin, V.

2018-05-01

Analyzed the scope and the types of robotic systems consisting of subsystems of the form "a heterogeneous sensors data processing subsystem". On the basis of the Queuing theory model is developed taking into account the unevenness of the intensity of information flow from the sensors to the subsystem of information processing. Analytical solution to assess the relationship of subsystem performance and uneven flows. The research of the obtained solution in the range of parameter values of practical interest.

Design of RFID Cloud Services in a Low Bandwidth Network Environment

Directory of Open Access Journals (Sweden)

John P.T. Mo

2011-02-01

Full Text Available The use of Information and Communication Technologies has significantly improved the efficiency of modern supply chains. Existing IT architecture is too rigid to allow new technologies such as RFID technologies to be implemented. With the aid of virtualisation and integrated with cloud services, infrastructure hardware and network devices can be consolidated into a physical device, reducing the cost of ownership. However, for such cloud services model to work correctly, a high speed network is required between each site and the cloud service provider. This poses huge challenges for real‐time system such as RFID‐enabled supply chains. Since modern supply chains operate on a global platform, it is almost impossible to assure availability of high speed networks across the global supply chain. This paper proposes two solutions to supplement the virtualisation and cloud services model. A sub‐cloud services solution, where each service is distributed across multiple hosts across different countries and regions is proposed to enhance accessibility to higher bandwidth networks. The second solution is the Queued Burst Device Compression system incorporates a compression service that compresses RFID data sets into much smaller packages. This solution is proved to work by a multiple‐in‐single‐out queuing model and is suitable for low bandwidth networks such as GPRS and 3G wireless environmenst.

Time analysis of the containerized cargo flow in the logistic chain using simulation tools: the case of the Port of Seville (Spain)

Energy Technology Data Exchange (ETDEWEB)

Ruiz Aguilar, J.J.; Turias, J.I.; Cerban, M.; Gonzalez, M.J.; Pulido, A.

2016-07-01

The logistic chain that connects the capital of Spain (Madrid) with the Canary Islands has the Port of Seville as the port node. This port node makes possible to switch from one transport mode (railway) to another (maritime) at the container terminal of the port. Some constraints, such as the operational time window that restricts the freight train access into the port in a certain time-slot or the need of the reversal of the train before entering into port, lead to generate important time delays in the intermodal chain. A time analysis of the process is necessary in order to check the critical points. A simulation of the whole process from the goods departing the origin station by train until they leave the port of Seville by ship to the Canary Islands is performed. To this aim, a queuing model network was developed in order to simulate the travel time of the cargo. The database is composed of daily departures of goods train and daily departures of vessels (including times of docking, berthing or load/unload cargo). The final objective of this work is twofold: firstly, to provide a validated model of the containerized cargo flow and secondly, to demonstrate that this kind of queuing models can become a powerful supporting tool in making decisions about future investments. (Author)

Analisa Karakteristik Teori Antrian pada Jaringan IP Multimedia Subsystem (IMS Menggunakan OPNET Modeler 14.5

Directory of Open Access Journals (Sweden)

Eko Fajar Cahyadi

2015-05-01

Full Text Available Perkembangan teknologi telekomunikasi yang semakin pesat, membuat para operator dan vendor telekomunikasi harus dapat menyediakan layanan telekomunikasi yang aman, cepat, dan multi guna, untuk mendorong terciptanya ekosistem layanan telekomunikasi yang beragam bagi para penggunanya. Next Generation Network (NGN merupakan sebuah teknologi masa depan yang mendukung beberapa layanan terintegrasi seperti voice, data, dan multimedia. Hal utama dari konsep NGN adalah konvergensi dan layanan yang berbasis IP sehingga diperlukan sebuah teknologi yang dikenal dengan IP Multimedia Subsystem (IMS. Agar pengiriman data dalam layanan IMS menjadi lebih efektif dan efisien maka diperlukan sebuah teori antrian yang tepat untuk digunakan sebagai pengatur aliran paket data. Penelitian ini melakukan pengamatan terhadap beberapa layanan pada jaringan IMS dengan menggunakan tiga teori antrian yang berbeda yaitu First In First Out (FIFO, Priority Queuing (PQ, dan Weighted-Fair Queuing (WFQ. Pengamatan dilakukan terhadap layanan Video Conference dan VoIP. Dari hasil simulasi dapat diketahui bahwa teori antrian WFQ pada layanan video conference menghasilkan rata-rata delay sebesar 9.22 ms , delay variation sebesar 0.036 ms dan packet loss sebesar 0.88%. Sedangkan untuk layanan VoIP menghasilkan rata-rata delay sebesar 144 ms, delay variation sebesar 0.021 ms, dan packet loss sebesar 0.05% serta menghasilkan rata-rata throughput sebesar 7.052 Mbps, sehingga teori antrian yang tepat digunakan dalam jaringan IMS dalam penelitian ini adalah WFQ.

Marrakesh International Conference on Probability and Statistics

CERN Document Server

Ouassou, Idir; Rachdi, Mustapha

2015-01-01

This volume, which highlights recent advances in statistical methodology and applications, is divided into two main parts. The first part presents theoretical results on estimation techniques in functional statistics, while the second examines three key areas of application: estimation problems in queuing theory, an application in signal processing, and the copula approach to epidemiologic modelling. The book’s peer-reviewed contributions are based on papers originally presented at the Marrakesh International Conference on Probability and Statistics held in December 2013.

Fingerprint start the next generation of payment method : Fingerprint payment: a new mode of mobile payment

OpenAIRE

Wu, Chong

2016-01-01

In the generation of mobile internet, fingerprint payment is one of the most popular topics at the moment. China has a big market and many users are using the mobile payment methods. There are a large number of mobile phones equipped with fingerprint recognition technology. As we know, fingerprint payment brings us more convenience and safety. We do not need to use many bankcards, and fingerprint also eliminates the users from the trouble of queuing to pay. However, users send traditional dig...

Application of Queuing Theory to Petrol Stations in Benin-City Area ...

African Journals Online (AJOL)

This paper reports on a study conducted on five petrol stations in Benin City, namely: Oando petrol station Akpakpava, AP petrol station Ugbowo, Total petrol station Iselu, NNPC petrol station Benin-Auchi Road and NNPC Mega filling station Benin-Sapele Road. The average arrival rate of customers per hour for the five ...

Design and Implementation of an M/M/1 Queuing Model Algorithm ...

African Journals Online (AJOL)

Remote Medical Monitoring is a component of telemedicine capable of monitoring ... model follows a Poisson distribution with parameter (β)t and a probability .... The probability of no(zero) arrival in the .... "A Problem of Standards of Service ".

The study on the Layout of the Charging Station in Chengdu

Science.gov (United States)

Cai, yun; Zhang, wanquan; You, wei; Mao, pan

2018-03-01

In this paper, the comprehensive analysis of the factors affecting the layout of the electric car, considering the principle of layout of the charging station. Using queuing theory in operational research to establish mathematical model and basing on the principle of saving resource and convenient owner to optimize site number. Combining the theory of center to determine the service radius, Using the Gravity method to determine the initial location, Finally using the method of center of gravity to locate the charging station’s location.

ANALYSIS OF MARKOV NETWORK WITH INCOMES, POSITIVE AND NEGATIVE MESSAGES

Directory of Open Access Journals (Sweden)

V. V. Naumenko

2014-01-01

Full Text Available Markov queuing network with income in transient regime is considered. It has positive and negative messages, which can be used in forecasting income of information and telecommunication systems and networks affected by viruses. Investigations are carried out in the cases when incomes from transitions between network states are deterministic functions dependent on states, or they are random variables with given mean values. In the last case it is assumed that all network systems operate in a high load mode. An example is given.

Network performance analysis

CERN Document Server

Bonald, Thomas

2013-01-01

The book presents some key mathematical tools for the performance analysis of communication networks and computer systems.Communication networks and computer systems have become extremely complex. The statistical resource sharing induced by the random behavior of users and the underlying protocols and algorithms may affect Quality of Service.This book introduces the main results of queuing theory that are useful for analyzing the performance of these systems. These mathematical tools are key to the development of robust dimensioning rules and engineering methods. A number of examples i

Schedulability Analysis and Optimization for the Synthesis of Multi-Cluster Distributed Embedded Systems

DEFF Research Database (Denmark)

Pop, Paul; Eles, Petru; Peng, Zebo

2003-01-01

We present an approach to schedulability analysis for the synthesis of multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. We have also proposed a buffer size and worst case queuing delay analysis for the gateways......, responsible for routing inter-cluster traffic. Optimization heuristics for the priority assignment and synthesis of bus access parameters aimed at producing a schedulable system with minimal buffer needs have been proposed. Extensive experiments and a real-life example show the efficiency of our approaches....

Schedulability Analysis and Optimization for the Synthesis of Multi-Cluster Distributed Embedded Systems

DEFF Research Database (Denmark)

Pop, Paul; Eles, Petru; Peng, Zebo

2003-01-01

An approach to schedulability analysis for the synthesis of multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways, is presented. A buffer size and worst case queuing delay analysis for the gateways, responsible for routing...... inter-cluster traffic, is also proposed. Optimisation heuristics for the priority assignment and synthesis of bus access parameters aimed at producing a schedulable system with minimal buffer needs have been proposed. Extensive experiments and a real-life example show the efficiency of the approaches....

Semi-Markov models control of restorable systems with latent failures

CERN Document Server

Obzherin, Yuriy E

2015-01-01

Featuring previously unpublished results, Semi-Markov Models: Control of Restorable Systems with Latent Failures describes valuable methodology which can be used by readers to build mathematical models of a wide class of systems for various applications. In particular, this information can be applied to build models of reliability, queuing systems, and technical control. Beginning with a brief introduction to the area, the book covers semi-Markov models for different control strategies in one-component systems, defining their stationary characteristics of reliability and efficiency, and uti

Artificial intelligence based decision support for trumpeter swan management

Science.gov (United States)

Sojda, Richard S.

2002-01-01

The number of trumpeter swans (Cygnus buccinator) breeding in the Tri-State area where Montana, Idaho, and Wyoming come together has declined to just a few hundred pairs. However, these birds are part of the Rocky Mountain Population which additionally has over 3,500 birds breeding in Alberta, British Columbia, Northwest Territories, and Yukon Territory. To a large degree, these birds seem to have abandoned traditional migratory pathways in the flyway. Waterfowl managers have been interested in decision support tools that would help them explore simulated management scenarios in their quest towards reaching population recovery and the reestablishment of traditional migratory pathways. I have developed a decision support system to assist biologists with such management, especially related to wetland ecology. Decision support systems use a combination of models, analytical techniques, and information retrieval to help develop and evaluate appropriate alternatives. Swan management is a domain that is ecologically complex, and this complexity is compounded by spatial and temporal issues. As such, swan management is an inherently distributed problem. Therefore, the ecological context for modeling swan movements in response to management actions was built as a multiagent system of interacting intelligent agents that implements a queuing model representing swan migration. These agents accessed ecological knowledge about swans, their habitats, and flyway management principles from three independent expert systems. The agents were autonomous, had some sensory capability, and could respond to changing conditions. A key problem when developing ecological decision support systems is empirically determining that the recommendations provided are valid. Because Rocky Mountain trumpeter swans have been surveyed for a long period of time, I was able to compare simulated distributions provided by the system with actual field observations across 20 areas for the period 1988

Optimising resource management in neurorehabilitation.

Science.gov (United States)

Wood, Richard M; Griffiths, Jeff D; Williams, Janet E; Brouwers, Jakko

2014-01-01

To date, little research has been published regarding the effective and efficient management of resources (beds and staff) in neurorehabilitation, despite being an expensive service in limited supply. To demonstrate how mathematical modelling can be used to optimise service delivery, by way of a case study at a major 21 bed neurorehabilitation unit in the UK. An automated computer program for assigning weekly treatment sessions is developed. Queue modelling is used to construct a mathematical model of the hospital in terms of referral submissions to a waiting list, admission and treatment, and ultimately discharge. This is used to analyse the impact of hypothetical strategic decisions on a variety of performance measures and costs. The project culminates in a hybridised model of these two approaches, since a relationship is found between the number of therapy hours received each week (scheduling output) and length of stay (queuing model input). The introduction of the treatment scheduling program has substantially improved timetable quality (meaning a better and fairer service to patients) and has reduced employee time expended in its creation by approximately six hours each week (freeing up time for clinical work). The queuing model has been used to assess the effect of potential strategies, such as increasing the number of beds or employing more therapists. The use of mathematical modelling has not only optimised resources in the short term, but has allowed the optimality of longer term strategic decisions to be assessed.

Impact of Incidents on Traffic Congestion in Dar es Salaam City

Directory of Open Access Journals (Sweden)

David Mfinanga

2013-06-01

Full Text Available Poorly managed traffic incidents have largely contributed to congestion and delay in the city of Dar es Salaam. A thorough understanding of travel delays caused by incidents is therefore essential for effective countermeasures against the increasing congestion. The method used to determine delays in this research is based on the deterministic queuing theory. Information on incidents was obtained from traffic surveys, traffic police and road users. Counting of the number of vehicles passing the incident location was done on incident and incident-free days. The cumulative traffic counts on incident and incident-free days were then calculated and used to plot the queuing diagram used to determine incident induced delay. This method turned out to be a useful tool for estimating incident induced delay in areas with less sophisticated equipment i.e. where there are no sensors, CCTV cameras, etc. The method provided good estimates of incident induced delay which may help planners and transportation officials in better understanding incident related congestion and in selecting more effective countermeasures against incident related traffic congestion in the city. It was found out that the effects of incidents were different for the different zones, types of incidents and the periods the incident occurred. In addition to the incident duration and the number of vehicles affected, the impact of incidents also depended on availability of alternative routes, number of lanes on the road, discipline of the driver in manoeuvring at incident location and traffic control at the scene.

A high performance hierarchical storage management system for the Canadian tier-1 centre at TRIUMF

International Nuclear Information System (INIS)

Deatrich, D C; Liu, S X; Tafirout, R

2010-01-01

We describe in this paper the design and implementation of Tapeguy, a high performance non-proprietary Hierarchical Storage Management (HSM) system which is interfaced to dCache for efficient tertiary storage operations. The system has been successfully implemented at the Canadian Tier-1 Centre at TRIUMF. The ATLAS experiment will collect a large amount of data (approximately 3.5 Petabytes each year). An efficient HSM system will play a crucial role in the success of the ATLAS Computing Model which is driven by intensive large-scale data analysis activities that will be performed on the Worldwide LHC Computing Grid infrastructure continuously. Tapeguy is Perl-based. It controls and manages data and tape libraries. Its architecture is scalable and includes Dataset Writing control, a Read-back Queuing mechanism and I/O tape drive load balancing as well as on-demand allocation of resources. A central MySQL database records metadata information for every file and transaction (for audit and performance evaluation), as well as an inventory of library elements. Tapeguy Dataset Writing was implemented to group files which are close in time and of similar type. Optional dataset path control dynamically allocates tape families and assign tapes to it. Tape flushing is based on various strategies: time, threshold or external callbacks mechanisms. Tapeguy Read-back Queuing reorders all read requests by using an elevator algorithm, avoiding unnecessary tape loading and unloading. Implementation of priorities will guarantee file delivery to all clients in a timely manner.

Averaging principle for second-order approximation of heterogeneous models with homogeneous models.

Science.gov (United States)

Fibich, Gadi; Gavious, Arieh; Solan, Eilon

2012-11-27

Typically, models with a heterogeneous property are considerably harder to analyze than the corresponding homogeneous models, in which the heterogeneous property is replaced by its average value. In this study we show that any outcome of a heterogeneous model that satisfies the two properties of differentiability and symmetry is O(ε(2)) equivalent to the outcome of the corresponding homogeneous model, where ε is the level of heterogeneity. We then use this averaging principle to obtain new results in queuing theory, game theory (auctions), and social networks (marketing).

Decomposability queueing and computer system applications

CERN Document Server

Courtois, P J

1977-01-01

Decomposability: Queueing and Computer System Applications presents a set of powerful methods for systems analysis. This 10-chapter text covers the theory of nearly completely decomposable systems upon which specific analytic methods are based.The first chapters deal with some of the basic elements of a theory of nearly completely decomposable stochastic matrices, including the Simon-Ando theorems and the perturbation theory. The succeeding chapters are devoted to the analysis of stochastic queuing networks that appear as a type of key model. These chapters also discuss congestion problems in

Distributed computing and nuclear reactor analysis

International Nuclear Information System (INIS)

Brown, F.B.; Derstine, K.L.; Blomquist, R.N.

1994-01-01

Large-scale scientific and engineering calculations for nuclear reactor analysis can now be carried out effectively in a distributed computing environment, at costs far lower than for traditional mainframes. The distributed computing environment must include support for traditional system services, such as a queuing system for batch work, reliable filesystem backups, and parallel processing capabilities for large jobs. All ANL computer codes for reactor analysis have been adapted successfully to a distributed system based on workstations and X-terminals. Distributed parallel processing has been demonstrated to be effective for long-running Monte Carlo calculations

Delay Bound: Fractal Traffic Passes through Network Servers

Directory of Open Access Journals (Sweden)

Ming Li

2013-01-01

Full Text Available Delay analysis plays a role in real-time systems in computer communication networks. This paper gives our results in the aspect of delay analysis of fractal traffic passing through servers. There are three contributions presented in this paper. First, we will explain the reasons why conventional theory of queuing systems ceases in the general sense when arrival traffic is fractal. Then, we will propose a concise method of delay computation for hard real-time systems as shown in this paper. Finally, the delay computation of fractal traffic passing through severs is presented.

Averaging principle for second-order approximation of heterogeneous models with homogeneous models

Science.gov (United States)

Fibich, Gadi; Gavious, Arieh; Solan, Eilon

2012-01-01

Typically, models with a heterogeneous property are considerably harder to analyze than the corresponding homogeneous models, in which the heterogeneous property is replaced by its average value. In this study we show that any outcome of a heterogeneous model that satisfies the two properties of differentiability and symmetry is O(ɛ2) equivalent to the outcome of the corresponding homogeneous model, where ɛ is the level of heterogeneity. We then use this averaging principle to obtain new results in queuing theory, game theory (auctions), and social networks (marketing). PMID:23150569

Probabilistic modeling of nodal electric vehicle load due to fast charging stations

DEFF Research Database (Denmark)

Tang, Difei; Wang, Peng; Wu, Qiuwei

2016-01-01

In order to reduce greenhouse gas emission and fossil fuel dependence, Electric Vehicle (EV) has drawn increasing attention due to its zero emission and high efficiency. However, new problems such as range anxiety, long charging duration and high charging power may threaten the safe and efficient...... station into consideration. Fuzzy logic inference system is applied to simulate the charging decision of EV drivers at fast charging station. Due to increasing EV loads in power system, the potential traffic congestion in fast charging stations is modeled and evaluated by queuing theory with spatial...

Computer-communication networks

CERN Document Server

Meditch, James S

1983-01-01

Computer- Communication Networks presents a collection of articles the focus of which is on the field of modeling, analysis, design, and performance optimization. It discusses the problem of modeling the performance of local area networks under file transfer. It addresses the design of multi-hop, mobile-user radio networks. Some of the topics covered in the book are the distributed packet switching queuing network design, some investigations on communication switching techniques in computer networks and the minimum hop flow assignment and routing subject to an average message delay constraint

Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy

DEFF Research Database (Denmark)

Kalør, Anders Ellersgaard; Agurto Agurto, Mauricio Ignacio; Pratas, Nuno

2017-01-01

frame duration, then this may result in additional access latency and limit the energy savings. In this paper we investigate the tradeoff by considering two extreme time-scales for the resource multiplexing: (i) long-term, where the computational resources are adapted over periods much larger than...... the access frame durations; (ii) short-term, where the adaption is below the access frame duration.We develop a general C-RAN queuing model that models the access latency and show, for Poisson arrivals, that long-term multiplexing achieves savings comparable to short-term multiplexing, while offering low...

The Good and the Bad – Bicyclists’ Experiences In Copenhagen

DEFF Research Database (Denmark)

Snizek, Bernhard; Skov-Petersen, Hans; Nielsen, Thomas Alexander Sick

The Good and the Bad – Bicyclists’ Experiences In Copenhagen In order to design livable cities, a strategy of substituting motorized travel modes with non-motorized ones can be a solution to the problems of crowding/queuing and CO2 emissions. Prior to investing into bike infrastructure, knowledge...... as well as sketch the route itself within an interactive, online questionnaire built on Google Maps. Grouped into sub-classes the bikers’ responses were related to urban indicators such as scenic beauty, terrain, relation to other bicyclists, motorists and pedestrians etc. By relating characteristics...

Endogenous scheduling preferences and congestion

DEFF Research Database (Denmark)

Fosgerau, Mogens; Small, Kenneth

2010-01-01

and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

Analysis of information security reliability: A tutorial

International Nuclear Information System (INIS)

Kondakci, Suleyman

2015-01-01

This article presents a concise reliability analysis of network security abstracted from stochastic modeling, reliability, and queuing theories. Network security analysis is composed of threats, their impacts, and recovery of the failed systems. A unique framework with a collection of the key reliability models is presented here to guide the determination of the system reliability based on the strength of malicious acts and performance of the recovery processes. A unique model, called Attack-obstacle model, is also proposed here for analyzing systems with immunity growth features. Most computer science curricula do not contain courses in reliability modeling applicable to different areas of computer engineering. Hence, the topic of reliability analysis is often too diffuse to most computer engineers and researchers dealing with network security. This work is thus aimed at shedding some light on this issue, which can be useful in identifying models, their assumptions and practical parameters for estimating the reliability of threatened systems and for assessing the performance of recovery facilities. It can also be useful for the classification of processes and states regarding the reliability of information systems. Systems with stochastic behaviors undergoing queue operations and random state transitions can also benefit from the approaches presented here. - Highlights: • A concise survey and tutorial in model-based reliability analysis applicable to information security. • A framework of key modeling approaches for assessing reliability of networked systems. • The framework facilitates quantitative risk assessment tasks guided by stochastic modeling and queuing theory. • Evaluation of approaches and models for modeling threats, failures, impacts, and recovery analysis of information systems

Markov modeling and discrete event simulation in health care: a systematic comparison.

Science.gov (United States)

Standfield, Lachlan; Comans, Tracy; Scuffham, Paul

2014-04-01

The aim of this study was to assess if the use of Markov modeling (MM) or discrete event simulation (DES) for cost-effectiveness analysis (CEA) may alter healthcare resource allocation decisions. A systematic literature search and review of empirical and non-empirical studies comparing MM and DES techniques used in the CEA of healthcare technologies was conducted. Twenty-two pertinent publications were identified. Two publications compared MM and DES models empirically, one presented a conceptual DES and MM, two described a DES consensus guideline, and seventeen drew comparisons between MM and DES through the authors' experience. The primary advantages described for DES over MM were the ability to model queuing for limited resources, capture individual patient histories, accommodate complexity and uncertainty, represent time flexibly, model competing risks, and accommodate multiple events simultaneously. The disadvantages of DES over MM were the potential for model overspecification, increased data requirements, specialized expensive software, and increased model development, validation, and computational time. Where individual patient history is an important driver of future events an individual patient simulation technique like DES may be preferred over MM. Where supply shortages, subsequent queuing, and diversion of patients through other pathways in the healthcare system are likely to be drivers of cost-effectiveness, DES modeling methods may provide decision makers with more accurate information on which to base resource allocation decisions. Where these are not major features of the cost-effectiveness question, MM remains an efficient, easily validated, parsimonious, and accurate method of determining the cost-effectiveness of new healthcare interventions.

Evaluating the Effect of Lead Time on Quality Service Delivery in the Banking Industry in Kumasi Metropolis of Ghana

Directory of Open Access Journals (Sweden)

Stephen Okyere

2015-07-01

Full Text Available Customers are becoming more attracted to quality service delivery and are being impatience and unsatisfied when they had to be delayed or wait for longer times before they are served.  Hence, Quality Service Delivery is of utmost importance to every service organisation especially financial industry. Most financial institutions focus attention on product innovation at the expense of lead time management which is a major factor in ensuring service quality and customer satisfaction. Consequently, this research looks at evaluating the effect of lead time on quality service delivery in the Banking Industry in Kumasi Metropolis of Ghana. The study relied on Primary data collected through questionnaires, observation and interview instruments, administered to staff and customers of some selected branches of a commercial bank in the study area. The data was analysed qualitatively. The researchers realised that despite the immense importance of lead time on quality service delivery, little attention is given to the concept. It was revealed that, customers were dissatisfied with the commercial bank’s services as a result of the unnecessary delays and queuing at the bank premises. The long lead time was found to be attributable to plant/system failure, skill gap on the part of employees, ATM underutilization and frequent breakdowns, among others. This has consequently resulted into long lead time, waiting, queuing and unnecessary delay at the banking hall. It is recommended that Tellers should be provided with electronic card readers for verification of customer’s data and processing to be faster.

An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model

Science.gov (United States)

Gawron, C.

An iterative algorithm to determine the dynamic user equilibrium with respect to link costs defined by a traffic simulation model is presented. Each driver's route choice is modeled by a discrete probability distribution which is used to select a route in the simulation. After each simulation run, the probability distribution is adapted to minimize the travel costs. Although the algorithm does not depend on the simulation model, a queuing model is used for performance reasons. The stability of the algorithm is analyzed for a simple example network. As an application example, a dynamic version of Braess's paradox is studied.

A general model for memory interference in a multiprocessor system with memory hierarchy

Science.gov (United States)

Taha, Badie A.; Standley, Hilda M.

1989-01-01

The problem of memory interference in a multiprocessor system with a hierarchy of shared buses and memories is addressed. The behavior of the processors is represented by a sequence of memory requests with each followed by a determined amount of processing time. A statistical queuing network model for determining the extent of memory interference in multiprocessor systems with clusters of memory hierarchies is presented. The performance of the system is measured by the expected number of busy memory clusters. The results of the analytic model are compared with simulation results, and the correlation between them is found to be very high.

State-Space Equations and the First-Phase Algorithm for Signal Control of Single Intersections

Institute of Scientific and Technical Information of China (English)

LI Jinyuan; PAN Xin; WANG Xiqin

2007-01-01

State-space equations were applied to formulate the queuing and delay of traffic at a single intersection in this paper. The signal control of a single intersection was then modeled as a discrete-time optimal control problem, with consideration of the constraints of stream conflicts, saturation flow rate, minimum green time, and maximum green time. The problem cannot be solved directly due to the nonlinear constraints.However, the results of qualitative analysis were used to develop a first-phase signal control algorithm. Simulation results show that the algorithm substantially reduces the total delay compared to fixed-time control.

Taxes and Bribes in Uganda

Science.gov (United States)

Jagger, Pamela; Shively, Gerald

2016-01-01

Using data from 433 firms operating along Uganda’s charcoal and timber supply chains we investigate patterns of bribe payment and tax collection between supply chain actors and government officials responsible for collecting taxes and fees. We examine the factors associated with the presence and magnitude of bribe and tax payments using a series of bivariate probit and Tobit regression models. We find empirical support for a number of hypotheses related to payments, highlighting the role of queuing, capital-at-risk, favouritism, networks, and role in the supply chain. We also find that taxes crowd-in bribery in the charcoal market. PMID:27274568

Analysis and Modeling of Ground Operations at Hub Airports

Science.gov (United States)

Atkins, Stephen (Technical Monitor); Andersson, Kari; Carr, Francis; Feron, Eric; Hall, William D.

2000-01-01

Building simple and accurate models of hub airports can considerably help one understand airport dynamics, and may provide quantitative estimates of operational airport improvements. In this paper, three models are proposed to capture the dynamics of busy hub airport operations. Two simple queuing models are introduced to capture the taxi-out and taxi-in processes. An integer programming model aimed at representing airline decision-making attempts to capture the dynamics of the aircraft turnaround process. These models can be applied for predictive purposes. They may also be used to evaluate control strategies for improving overall airport efficiency.

Taxes and Bribes in Uganda.

Science.gov (United States)

Jagger, Pamela; Shively, Gerald

Using data from 433 firms operating along Uganda's charcoal and timber supply chains we investigate patterns of bribe payment and tax collection between supply chain actors and government officials responsible for collecting taxes and fees. We examine the factors associated with the presence and magnitude of bribe and tax payments using a series of bivariate probit and Tobit regression models. We find empirical support for a number of hypotheses related to payments, highlighting the role of queuing, capital-at-risk, favouritism, networks, and role in the supply chain. We also find that taxes crowd-in bribery in the charcoal market.

ClusterControl: a web interface for distributing and monitoring bioinformatics applications on a Linux cluster.

Science.gov (United States)

Stocker, Gernot; Rieder, Dietmar; Trajanoski, Zlatko

2004-03-22

ClusterControl is a web interface to simplify distributing and monitoring bioinformatics applications on Linux cluster systems. We have developed a modular concept that enables integration of command line oriented program into the application framework of ClusterControl. The systems facilitate integration of different applications accessed through one interface and executed on a distributed cluster system. The package is based on freely available technologies like Apache as web server, PHP as server-side scripting language and OpenPBS as queuing system and is available free of charge for academic and non-profit institutions. http://genome.tugraz.at/Software/ClusterControl

QoS support over ultrafast TDM optical networks

Science.gov (United States)

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.

RabbitMQ essentials

CERN Document Server

Dossot, David

2014-01-01

This book is a quick and concise introduction to RabbitMQ. Follow the unique case study of Clever Coney Media as they progressively discover how to fully utilize RabbitMQ, containing clever examples and detailed explanations.Whether you are someone who develops enterprise messaging products professionally or a hobbyist who is already familiar with open source Message Queuing software and you are looking for a new challenge, then this is the book for you. Although you should be familiar with Java, Ruby, and Python to get the most out of the examples, RabbitMQ Essentials will give you the push y

Performance evaluation of railway blocking system based on markov chain and queuing theory

Science.gov (United States)

Guo, Jin; Chen, Hongxia; Yang, Yang

2005-12-01

Railway blocking system is the system with the high demanding of real-time performance. Firstly, the tasks and the time limits, which had to be handled for the blocking system, were introduced. The FCFS and the Markov chain were used to set the model for it. By analyzing the performance of the system with the FCFS model found out that it was not satisfied to the real-time performance. Secondly, NPPR model to evaluate the software real-time performance of the blocking processor was proposed. By evaluation, analysis and comparison, the results indicate that the NPPR model is prevail over the model of (M/M/1): (N/N/FCFS) in real-time performance. And the priorities of the tasks in the system should be given according to their time limit. With the principle of (M/M/1): (N/N/NPPR), if the priority was given to the tasks properly, the satisfied real-time performance will be gotten. The models were tested in forms software and the satisfied result has been gotten in practice.

A Queuing Model-Based System for Triggering Traffic Flow Management Algorithms, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — Next generation air traffic management systems are expected use multiple software tools and quantitative methods for managing traffic flow in the National Airspace....

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

Science.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Cary Deck

Full Text Available 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.

Redesign of a University Hospital Preanesthesia Evaluation Clinic Using a Queuing Theory Approach

NARCIS (Netherlands)

Zonderland, Maartje Elisabeth; de Boer, F.; Boucherie, Richardus J.; de Roode, A.; van Kleef, J.W.

Background Changes in patient length of stay (the duration of one visit) as a result of the introduction of an electronic patient file system forced an anesthesia department to change their outpatient clinic organization. The aim of this study is to demonstrate how the involvement of essential

Redesign of a university hospital preanesthesia evaluation clinic using a queuing theory approach

NARCIS (Netherlands)

Zonderland, Maartje Elisabeth; Boer, Fredrik; Boucherie, Richardus J.; de Roode, Annemiek; van Kleef, Jack W.

2009-01-01

BACKGROUND: Changes in patient length of stay (the duration of 1 clinic visit) as a result of the introduction of an electronic patient file system forced an anesthesia department to change its outpatient clinic organization. In this study, we sought to demonstrate how the involvement of essential

Analysis and quality of service evaluation of a fast charging station for electric vehicles

International Nuclear Information System (INIS)

Zenginis, Ioannis; Vardakas, John S.; Zorba, Nizar; Verikoukis, Christos V.

2016-01-01

Electrification of transportation is considered as one of the most promising ways to mitigate climate change and reduce national security risks from oil and gasoline imports. Fast charging stations that provide high quality of service will facilitate the wide market penetration of electric vehicles. In this paper, the operation of a fast charging station is analyzed by employing a novel queuing model. The proposed analysis considers that the various electric vehicle models are classified by their battery size, and computes the customers' mean waiting time in the queue by taking into account the available charging spots, as well as the stochastic arrival process and the stochastic recharging needs of the various electric vehicle classes. Furthermore, a charging strategy is proposed according to which the drivers are motivated to limit their energy demands. The implementation of the proposed strategy allows the charging station to serve more customers without any increase in the queue waiting time. The high precision of the present analytical model is confirmed through simulations. Therefore, it may be utilized by existing fast charging station operators that need to provide high quality of service, or by future investors that need to design an efficient installation. - Highlights: • A fast charging station for multiple classes of electric vehicles is presented and analyzed. • A novel multiclass queuing model is presented for the mean queue waiting time derivation. • The system's arrival rate capacity is derived given a maximum tolerable waiting time limit. • A charging strategy is proposed aiming at increasing the system's arrival rate capacity. • The charging station operator's revenue is calculated based on the energy drawn by the electric vehicles.

How to Take HRMS Process Management to the Next Level with Workflow Business Event System

Science.gov (United States)

Rajeshuni, Sarala; Yagubian, Aram; Kunamaneni, Krishna

2006-01-01

Oracle Workflow with the Business Event System offers a complete process management solution for enterprises to manage business processes cost-effectively. Using Workflow event messaging, event subscriptions, AQ Servlet and advanced queuing technologies, this presentation will demonstrate the step-by-step design and implementation of system solutions in order to integrate two dissimilar systems and establish communication remotely. As a case study, the presentation walks you through the process of propagating organization name changes in other applications that originated from the HRMS module without changing applications code. The solution can be applied to your particular business cases for streamlining or modifying business processes across Oracle and non-Oracle applications.

Schedulability-Driven Frame Packing for Multi-Cluster Distributed Embedded Systems

DEFF Research Database (Denmark)

Pop, Paul; Eles, Petru; Peng, Zebo

2003-01-01

We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. In our approach, the application messages are packed into frames such that the application is schedulable. Thus, we have...... also proposed a schedulability analysis for applications consisting of mixed event-triggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Optimization heuristics for frame packing aiming at producing...... a schedulable system have been proposed. Extensive experiments and a real-life example show the efficiency of our frame-packing approach....

Architectural design and simulation of a virtual memory

Science.gov (United States)

Kwok, G.; Chu, Y.

1971-01-01

Virtual memory is an imaginary main memory with a very large capacity which the programmer has at his disposal. It greatly contributes to the solution of the dynamic storage allocation problem. The architectural design of a virtual memory is presented which implements by hardware the idea of queuing and scheduling the page requests to a paging drum in such a way that the access of the paging drum is increased many times. With the design, an increase of up to 16 times in page transfer rate is achievable when the virtual memory is heavily loaded. This in turn makes feasible a great increase in the system throughput.

Exploratory Analysis of a GGSN’s PDP Context Signaling Load

Directory of Open Access Journals (Sweden)

Florian Metzger

2014-01-01

Full Text Available This paper takes an exploratory look on control plane signaling in a mobile cellular core network. In contrast to most contributions in this field, our focus does not lie on the wireless or user-oriented parts of the network, but on signaling in the core network. In an investigation of core network data we take a look at statistics related to GTP tunnels and their signaling. Based on the results thereof we propose a definition of load at the GGSN and create an initial load queuing model. We find signs of user devices putting burden on the core network through their behavior.

Comparing two socially optimal work allocation rules when having a profit optimizing subcontractor with ample capacity

DEFF Research Database (Denmark)

Larsen, Christian

2005-01-01

We study a service system modelled as a single server queuing system where request for service either can be processed at the service system or by a subcontractor. In the former case the customer is incurred waiting costs but the service is free, while in the latter case the customer must pay...... for the service but there is no waiting time, hence no waiting costs. Under the premises that the subcontractor prices his services in order to maximize his profit, we study two work allocation rules, which given the price of subcontractor seek to allocate work such that the costs of the customers are minimized...

Simulation of stevedoring work in the Klaipėda oil terminal

Directory of Open Access Journals (Sweden)

D. Makackas

2002-10-01

Full Text Available The paper presents the approach of developing simulation models of stevedoring work in oil terminal using aggregate approach and simulation system ARENA. Aggregate approach permits to develop formal specification of simulated systems. Aggregate specification of the system is presented as a set of interacting piece-linear aggregates. Controlling sequences are used for formal description of each piece-linear aggregate. Transformation of aggregate formal specification to ARENA system operators permits to develop a simulation model. The developed model permits to evaluate characteristics of the Klaipėda oil terminal which are used both in queuing theory and analysing timing properties of real-time systems.

Data management system performance modeling

Science.gov (United States)

Kiser, Larry M.

1993-01-01

This paper discusses analytical techniques that have been used to gain a better understanding of the Space Station Freedom's (SSF's) Data Management System (DMS). The DMS is a complex, distributed, real-time computer system that has been redesigned numerous times. The implications of these redesigns have not been fully analyzed. This paper discusses the advantages and disadvantages for static analytical techniques such as Rate Monotonic Analysis (RMA) and also provides a rationale for dynamic modeling. Factors such as system architecture, processor utilization, bus architecture, queuing, etc. are well suited for analysis with a dynamic model. The significance of performance measures for a real-time system are discussed.

Production Planning with Load Dependent Lead Times

DEFF Research Database (Denmark)

Pahl, Julia

2005-01-01

Lead times impact the performance of the supply chain significantly. Although there is a large literature concerning queuing models for the analysis of the relationship between capacity utilization and lead times, and there is a substantial literature concerning control and order release policies...... that take lead times into consideration, there have been only few papers describing models at the aggregate planning level that recognize the relationship between the planned utilization of capacity and lead times. In this paper we provide an in-depth discussion of the state-of-the art in this literature......, with particular attention to those models that are appropriate at the aggregate planning level....

Simple Models for Airport Delays During Transition to a Trajectory-Based Air Traffic System

Science.gov (United States)

Brooker, Peter

It is now widely recognised that a paradigm shift in air traffic control concepts is needed. This requires state-of-the-art innovative technologies, making much better use of the information in the air traffic management (ATM) system. These paradigm shifts go under the names of NextGen in the USA and SESAR in Europe, which inter alia will make dramatic changes to the nature of airport operations. A vital part of moving from an existing system to a new paradigm is the operational implications of the transition process. There would be business incentives for early aircraft fitment, it is generally safer to introduce new technologies gradually, and researchers are already proposing potential transition steps to the new system. Simple queuing theory models are used to establish rough quantitative estimates of the impact of the transition to a more efficient time-based navigational and ATM system. Such models are approximate, but they do offer insight into the broad implications of system change and its significant features. 4D-equipped aircraft in essence have a contract with the airport runway and, in return, they would get priority over any other aircraft waiting for use of the runway. The main operational feature examined here is the queuing delays affecting non-4D-equipped arrivals. These get a reasonable service if the proportion of 4D-equipped aircraft is low, but this can deteriorate markedly for high proportions, and be economically unviable. Preventative measures would be to limit the additional growth of 4D-equipped flights and/or to modify their contracts to provide sufficient space for the non-4D-equipped flights to operate without excessive delays. There is a potential for non-Poisson models, for which there is little in the literature, and for more complex models, e.g. grouping a succession of 4D-equipped aircraft as a batch.

Secondary school pupils' food choices around schools in a London borough: Fast food and walls of crisps.

Science.gov (United States)

Caraher, M; Lloyd, S; Mansfield, M; Alp, C; Brewster, Z; Gresham, J

2016-08-01

The objective was to observe and document food behaviours of secondary school pupils from schools in a London borough. The research design combined a number of methods which included geographic information system (GIS) mapping of food outlets around three schools, systemised observations of food purchasing in those outlets before, during and after school, and focus groups conducted with pupils of those schools to gather their views in respect to those food choices. Results are summarised under the five 'A's of Access, Availability, Affordability and Acceptability & Attitudes: Access in that there were concentrations of food outlets around the schools. The majority of pupil food purchases were from newsagents, small local shops and supermarkets of chocolate, crisps (potato chips), fizzy drinks and energy drinks. Availability of fast food and unhealthy options were a feature of the streets surrounding the schools, with 200 m the optimal distance pupils were prepared to walk from and back to school at lunchtime. Affordability was ensured by the use of a consumer mentality and pupils sought out value for money offers; group purchasing of 'two for one' type offers encouraged this trend. Pupils reported healthy items on sale in school as expensive, and also that food was often sold in smaller portion sizes than that available from external food outlets. Acceptability and Attitudes, in that school food was not seen as 'cool', queuing for school food was not acceptable but queuing for food from takeaways was not viewed negatively; for younger pupils energy drinks were 'cool'. In conclusion, pupils recognised that school food was healthier but provided several reasons for not eating in school related to the five 'A's above. Copyright © 2016 Elsevier Ltd. All rights reserved.

Modelos analíticos para avaliação de sistemas flexíveis de manufatura Analytical models to evaluation of flexible manufacturing systems

Directory of Open Access Journals (Sweden)

Carlos Alberto dos Santos Passos

1994-12-01

Full Text Available Nas últimas décadas, a indústria de manufatura tem sido marcada profundamente pela introdução de novas tecnologias, as quais têm modificado os conceitos de produção. Aumento dos índices de produtividade, acompanhado por alta qualidade, são fatores que mostram a importância destas tecnologias na indústria atual. Os sistemas flexíveis da manufatura - FMS - são exemplos destas novas tecnologias. A complexidade destes sistemas cria a necessidade de se ter ferramentas que permitam a avaliação do seu desempenho. Neste artigo são discutidos aspectos relacionados a medidas de desempenho de sistemas FMS, para ajudar a tomada de decisão. Atenção especial é dada à utilização de modelos analíticos, na forma de redes de filas fechadas. Aspectos da implementação de um modelo simples de um FMS, usando modelos de redes de fila, são apresentados e os resultados das medidas de avaliação são discutidos.In the last decades, the manufacturing industry has been a deep transformation due the introduction of new technologies into the production system. Better improvement in the productivity and quality aspect show the importance of these technologies in modern industry. The FMS is a good example of this. The complexity of these systems creates the necessity for tools that permit to evaluate their performance. In this paper, aspects concerned to performance of the FMS systems to help a decision-maker are discussed. Special attention is given to queuing network model to evaluate design and operation of FMS. Aspects concerned to implementation of a simple model of FMS system are discussed and some results of the evaluation performance of the system using a queuing network are presented.

CCSDS Advanced Orbiting Systems Virtual Channel Access Service for QoS MACHETE Model

Science.gov (United States)

Jennings, Esther H.; Segui, John S.

2011-01-01

To support various communications requirements imposed by different missions, interplanetary communication protocols need to be designed, validated, and evaluated carefully. Multimission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in "Simulator of Space Communication Networks" (NPO-41373), NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. By building abstract behavioral models of network protocols, one can validate performance after identifying the appropriate metrics of interest. The innovators have extended the MACHETE model library to include a generic link-layer Virtual Channel (VC) model supporting quality-of-service (QoS) controls based on IP streams. The main purpose of this generic Virtual Channel model addition was to interface fine-grain flow-based QoS (quality of service) between the network and MAC layers of the QualNet simulator, a commercial component of MACHETE. This software model adds the capability of mapping IP streams, based on header fields, to virtual channel numbers, allowing extended QoS handling at link layer. This feature further refines the QoS v existing at the network layer. QoS at the network layer (e.g. diffserv) supports few QoS classes, so data from one class will be aggregated together; differentiating between flows internal to a class/priority is not supported. By adding QoS classification capability between network and MAC layers through VC, one maps multiple VCs onto the same physical link. Users then specify different VC weights, and different queuing and scheduling policies at the link layer. This VC model supports system performance analysis of various virtual channel link-layer QoS queuing schemes independent of the network-layer QoS systems.

Buffer sizing for multi-hop networks

KAUST Repository

Shihada, Basem

2014-01-28

A cumulative buffer may be defined for an interference domain in a wireless mesh network and distributed among nodes in the network to maintain or improve capacity utilization of network resources in the interference domain without increasing packet queuing delay times. When an interference domain having communications links sharing resources in a network is identified, a cumulative buffer size is calculated. The cumulative buffer may be distributed among buffers in each node of the interference domain according to a simple division or according to a cost function taking into account a distance of the communications link from the source and destination. The network may be monitored and the cumulative buffer size recalculated and redistributed when the network conditions change.

NGBAuth - Next Generation Batch Authentication for long running batch jobs.

CERN Document Server

Juto, Zakarias

2015-01-01

This document describes the prototyping of a new solution for the CERN batch authentication of long running jobs. While the job submission requires valid user credentials, these have to be renewed due to long queuing and execution times. Described within is a new system which will guarantee a similar level of security as the old LSFAuth while simplifying the implementation and the overall architecture. The new system is being built on solid, streamlined and tested components (notably OpenSSL) and a priority has been to make it more generic in order to facilitate the evolution of the current system such as for the expected migration from LSF to Condor as backend batch system.

5G Terminals with Multi-Streaming Features for Real-Time Mobile Broadband Applications

Directory of Open Access Journals (Sweden)

T. Shuminoski

2017-06-01

Full Text Available In this paper we present a novel QoS framework on the network layer for 5G terminals with vertical multi-homing and multi-streaming capabilities by using radio networks aggregation. The proposed framework is leading to high performance utility networks with QoS provisioning for real-time multimedia services by achieving low packet delays, stochastic queuing network stability and highest mobile broadband capabilities i.e. bitrates. The proposed QoS algorithm is implemented within the mobile terminals on one side, and in dedicated proxy servers on mobile core network side. It is based on Lyapunov optimization techniques and it is targeted to handle simultaneously multiple multimedia service flows via multiple radio network interfaces in parallel.

The evaluation model of the design of toll

Science.gov (United States)

Feng, Shuting

2018-04-01

In recent years, the dramatic increase in traffic burden has highlighted the necessity of rational allocation of toll plaza. At the same time, the need to consider a lot of factors has enhanced the design requirements. In this background, we carry out research on this subject. We propose a reasonable assumption, and abstract the toll plaza into a model only related to B and L. By using the queuing theory and traffic flow theory, we define the throughput, cost and accident prevent with B and L to acquire the base model. By using the method of linear weighting in economics to calculate this model, the optimal B and L strategies are obtained.

Priority-based queuing and transmission rate management using a fuzzy logic controller in WSNs

Directory of Open Access Journals (Sweden)

Imen Bouazzi

2017-06-01

Full Text Available Wireless sensor networks (WSNs operate under challenging conditions, such as maintaining message latency and the reliability of data transmission and maximizing the battery life of sensor nodes. The aim of this study is to propose a fuzzy logic algorithm for solving these issues, which are difficult to address with traditional techniques. The idea, in this study, is to employ a fuzzy logic scheme to optimize energy consumption and minimize packet drops. We demonstrated how fuzzy logic can be used to tackle this specific communication problem with minimal computational complexity. In this context, the implementation of a fuzzy logic in the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA mechanism is achieved through filling the queue length and the traffic rate at each node. Through simulations, we show that our proposed technique has a better performance in terms of energy consumption compared to the basic implementation of CSMA/CA.

Variation in habitat choice and delayed reproduction: Adaptive queuing strategies or individual quality differences?

NARCIS (Netherlands)

Van de Pol, M.; Pen, I.; Heg, D.; Weissing, F.J.

2007-01-01

In most species, some individuals delay reproduction or occupy inferior breeding positions. The queue hypothesis tries to explain both patterns by proposing that individuals strategically delay breeding (queue) to acquire better breeding or social positions. In 1995, Ens, Weissing, and Drent

Extended Delivery Time Analysis for Cognitive Packet Transmission With Application to Secondary Queuing Analysis

KAUST Repository

Usman, Muneer

2015-05-21

Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave implementation, the secondary transmission may be interrupted by the primary user\\'s transmission. To facilitate the delay analysis of such secondary transmission for fixed-size secondary packets, we study the resulting extended delivery time that includes both transmission time and waiting time. In particular, we derive the exact distribution functions of extended delivery time of secondary transmission for both continuous sensing and periodic sensing cases. Selected numerical and simulation results are presented for illustrating the mathematical formulation. Finally, we consider an M/G/1 queueing set-up at the secondary transmitter and formulate the closed-form expressions for the expected delay with Poisson traffic. The analytical results will greatly facilitate the design of the secondary system for particular target application. © 2015 IEEE.

Effects of diversity and procrastination in priority queuing theory: The different power law regimes

Science.gov (United States)

Saichev, A.; Sornette, D.

2010-01-01

Empirical analyses show that after the update of a browser, or the publication of the vulnerability of a software, or the discovery of a cyber worm, the fraction of computers still using the older browser or software version, or not yet patched, or exhibiting worm activity decays as a power law ˜1/tα with 0procrastination,” defined as the situation in which the target task may be postponed or delayed even after the individual has solved all other pending tasks. This regime provides an explanation for even slower apparent decay and longer persistence.

Modified stretched exponential model of computer system resources management limitations-The case of cache memory

Science.gov (United States)

Strzałka, Dominik; Dymora, Paweł; Mazurek, Mirosław

2018-02-01

In this paper we present some preliminary results in the field of computer systems management with relation to Tsallis thermostatistics and the ubiquitous problem of hardware limited resources. In the case of systems with non-deterministic behaviour, management of their resources is a key point that guarantees theirs acceptable performance and proper working. This is very wide problem that stands for many challenges in financial, transport, water and food, health, etc. areas. We focus on computer systems with attention paid to cache memory and propose to use an analytical model that is able to connect non-extensive entropy formalism, long-range dependencies, management of system resources and queuing theory. Obtained analytical results are related to the practical experiment showing interesting and valuable results.

Modeling of the DZero data acquisition system

Energy Technology Data Exchange (ETDEWEB)

Angstadt, R.; Johnson, M.; Manning, I.L. [Fermi National Accelerator Lab., Batavia, IL (United States); Wightman, J.A. [Texas A and M Univ., College Station, TX (United States). Dept. of Physics]|[Texas Accelerator Center, The Woodlands, TX (United States)

1991-12-01

A queuing theory model was used in the initial design of the D0 data acquisition system. It was mainly used for the front end electronic systems. Since then the model has been extended to include the entire data path for the tracking system. The tracking system generates the most data so we expect this system to determine the overall transfer rate. The model was developed using both analytical and simulation methods for solving a series of single server queues. We describe the model and the methods used to develop it. We also present results from the original models, updated calculations representing the system as built and comparisons with measurements made with the hardware in place for the cosmic ray test run. 3 refs.

Optimization Method of Intersection Signal Coordinated Control Based on Vehicle Actuated Model

Directory of Open Access Journals (Sweden)

Chen Zhao-Meng

2015-01-01

Full Text Available Traditional timing green wave control with predetermined cycle, split, and offset cannot adapt for dynamic real-time traffic flow. This paper proposes a coordinated control method for variable cycle time green wave bandwidth optimization integrated with traffic-actuated control. In the coordinated control, green split is optimized in real time by the measured presence of arriving and/or standing vehicles in each intersection and simultaneously green waves along arterials are guaranteed. Specifically, the dynamic bound of green wave is firstly determined, and then green early-start and green late-start algorithms are presented respectively to accommodate the fluctuations in vehicle arrival rates in each phase. Numerical examples show that the proposed method improves green time, expands green wave bandwidth, and reduces queuing.

Performance Analysis of TDMA Protocol in a Femtocell Network

Directory of Open Access Journals (Sweden)

Wanod Kumar

2014-07-01

Full Text Available In this paper, we evaluate the performance of TDMA (Time Division Multiple Access protocol using queuing theory in a femtocell network. The fair use of wireless channel among the users of network is carried out using TDMA protocol. The arrival of data packets from M communicating nodes becomes multiple Poisson process. The time slots of TDMA protocol represent c servers to communicate data packets coming from communicating nodes to the input of FAP (Femtocell Access Point. The service time of each server (time slot is exponentially distributed. This complete communication scenario using TDMA protocol is modeled using M/M/c queue. The performance of the protocol is evaluated in terms of mean number in system, average system delay and utilization for varying traffic intensity

Transmission Delay Based Control over Networks with Wireless Links

Institute of Scientific and Technical Information of China (English)

无

2002-01-01

To achieve the mobility of computers during communication, the TCP connections between fixed host and mobile host may often traverse wired and wireless networks, and the recovery of losses due to wireless transmission error is much different from congestion control. The paper analyzes the side effect of RTT estimation while making the TCP source to handle congestion and wireless error losses properly. Then present a strategy using information feedback by the last hop acknowledgement and monitoring the queuing level of the wired bottleneck link by calculating the changes in transmission delay along the path. With the identification of the early stage of congestion, it can respond to wired congestion quickly while keeping wireless link more reliable, and make TCP react to the different packets losses more appropriately.

On the description of fault-tolerant systems

International Nuclear Information System (INIS)

Syrbe, M.

1980-01-01

Various demands by increasing complexity and the disposability of new technologies, like the One-chip-microcomputer and fiber optics, lead to control systems, which are built as decentralized distributed multi-microcomputersystems. They realize not only new control functions but they also open possibilities to increase availability by fault-tolerance. The design or the selection and lay-out of such systems require a quantitative description of these systems. This is possible on the bases of the set of hardware and software moduls of the system by the use of queuing models, reliability nets and diagnostic graphs. This is shown by an example of a practically applied Really Distributed Computer Control System (RDC-System). Computer aided methods for these system descriptions are emphasized. (orig.) [de

Australia: a matter of Queues and As

Energy Technology Data Exchange (ETDEWEB)

NONE

2007-05-15

Australia has been very much in the news recently, with ship queues at port terminals and storms hitting the Hunter Valley, flooding coal yards and rail links. In December 2006 a 'capacity balancing system' (CBS) introduced by Port Waratah Coal Services to solve queuing problems in Newcastle ports in mid-2004 was discontinued but then the queues started to grow again. A new CBS was introduced and was beginning to take effect when storms struck New South Wales. Port Dalrymple Coal Services has a queue management system but nevertheless there were 58 ships waiting in Dalrymple Bay and Hay Point in late June. A number of coal terminals are undergoing expansion in an attempt to solve the situation. 4 photos.

EpiPOD : community vaccination and dispensing model user's guide.

Energy Technology Data Exchange (ETDEWEB)

Berry, M.; Samsa, M.; Walsh, D.; Decision and Information Sciences

2009-01-09

EpiPOD is a modeling system that enables local, regional, and county health departments to evaluate and refine their plans for mass distribution of antiviral and antibiotic medications and vaccines. An intuitive interface requires users to input as few or as many plan specifics as are available in order to simulate a mass treatment campaign. Behind the input interface, a system dynamics model simulates pharmaceutical supply logistics, hospital and first-responder personnel treatment, population arrival dynamics and treatment, and disease spread. When the simulation is complete, users have estimates of the number of illnesses in the population at large, the number of ill persons seeking treatment, and queuing and delays within the mass treatment system--all metrics by which the plan can be judged.

Modeling users' activity on twitter networks: validation of Dunbar's number.

Directory of Open Access Journals (Sweden)

Bruno Gonçalves

Full Text Available Microblogging and mobile devices appear to augment human social capabilities, which raises the question whether they remove cognitive or biological constraints on human communication. In this paper we analyze a dataset of Twitter conversations collected across six months involving 1.7 million individuals and test the theoretical cognitive limit on the number of stable social relationships known as Dunbar's number. We find that the data are in agreement with Dunbar's result; users can entertain a maximum of 100-200 stable relationships. Thus, the 'economy of attention' is limited in the online world by cognitive and biological constraints as predicted by Dunbar's theory. We propose a simple model for users' behavior that includes finite priority queuing and time resources that reproduces the observed social behavior.

Bidirectional multi-optical line terminals incorporated converged WSN-PON network using M/M/1 queuing

Science.gov (United States)

Kumar, Love; Sharma, Vishal; Singh, Amarpal

2017-12-01

Wireless Sensor Networks (WSNs) have an assortment of application areas, for instance, civil, military, and video surveillance with restricted power resources and transmission link. To accommodate the massive traffic load in hefty sensor networks is another key issue. Subsequently, there is a necessity to backhaul the sensed information of such networks and prolong the transmission link to access the distinct receivers. Passive Optical Network (PON), a next-generation access technology, comes out as a suitable candidate for the convergence of the sensed data to the core system. The earlier demonstrated work with single-OLT-PON introduces an overloaded buffer akin to video surveillance scenarios. In this paper, to combine the bandwidth potential of PONs with the mobility capability of WSNs, the viability for the convergence of PONs and WSNs incorporating multi-optical line terminals is demonstrated to handle the overloaded OLTs. The existing M/M/1 queue theory with interleaving polling with adaptive cycle time as dynamic bandwidth algorithm is used to shun the probability of packets clash. Further, the proposed multi-sink WSN and multi-OLT PON converged structure is investigated in bidirectional mode analytically and through computer simulations. The observations establish the proposed structure competent to accommodate the colossal data traffic through less time consumption.

Characterizing and Managing Intrusion Detection System (IDS) Alerts with Multi-Server/Multi-Priority Queuing Theory

Science.gov (United States)

2014-12-26

administrators dashboard , so that they can be effectively triaged, analyzed, and used to implement defensive actions to keep the network safe and...For the bank teller, some customers will require straight forward services (a quick deposit or cashing a check) while others will have questions or

Using Queuing Theory and Simulation Modelling to Reduce Waiting Times in An Iranian Emergency Department.

Science.gov (United States)

Haghighinejad, Hourvash Akbari; Kharazmi, Erfan; Hatam, Nahid; Yousefi, Sedigheh; Hesami, Seyed Ali; Danaei, Mina; Askarian, Mehrdad

2016-01-01

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

Using Queuing Theory and Simulation Modelling to Reduce Waiting Times in An Iranian Emergency Department

OpenAIRE

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

Using Queuing Theory and Simulation Modelling to Reduce Waiting Times in An Iranian Emergency Department

Directory of Open Access Journals (Sweden)

Hourvash Akbari Haghighinejad

2016-01-01

Full Text Available 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 numberwaiting 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.

Performance Analysis of Quality-of-Service Controls in a Cell-Cluster-Based Wireless ATM Network

Energy Technology Data Exchange (ETDEWEB)

Cho, Young Jong [Ajou University, Suwon (Korea, Republic of)

1997-04-01

In this paper, an efficient cell-cluster-based call control scheme with guaranteed quality-of-service(QoS) provision ing is presented for next generation wireless ATM networks and its performance is mathematically analyzed using the open queuing network. With the cell-cluster-based call control, at the time a mobile connection is admitted to the network, a virtual cell is constructed by choosing a group of neighboring base stations to which the call may probabilistic ally hand over and by assigning to the call a collection of virtual paths between the base stations. Within a micro cell/pico cell environment, it is seen that the cell-cluster-based call control can support effectively a very high rate of handovers, provides very high system capacity, and guarantees a high degree of frequency reuse over the same geographical region without requiring the intervention of the network call control processor each time a handover occurs. But since mobiles, once admitted, are free to roam within the virtual cell, congestion condition occurs in which the number of calls to be handled by one base station exceeds the cell sites` capacity of radio channel and consequently a predefined QoS provision cannot be guaranteed. So, there must be a call admission control function to limit the number of calls existing in a cell-cluster such that required QoS objectives are met. As call acceptance criteria for constant-bit-rate or realtime variable-bit-rate ATM connections, we define four mobile QoS metrics: new-call blocking probability, wireless channel utilization efficiency, congestion probability and normalized average congestion duration. In addition, for QoS provision ing to available-bit-rate, unspecified-bit-rate or non-realtime variable-bit-rate connections, we further define another QoS metric, the minimum threshold breaking probability. By using the open network queuing model, we derive closed form expressions for the five QoS metrics defined above and show that they can be

The Northwest Indiana Robotic Telescope

Science.gov (United States)

Slavin, Shawn D.; Rengstorf, A. W.; Aros, J. C.; Segally, W. B.

2011-01-01

The Northwest Indiana Robotic (NIRo) Telescope is a remote, automated observing facility recently built by Purdue University Calumet (PUC) at a site in Lowell, IN, approximately 30 miles from the PUC campus. The recently dedicated observatory will be used for broadband and narrowband optical observations by PUC students and faculty, as well as pre-college students through the implementation of standards-based, middle-school modules developed by PUC astronomers and education faculty. The NIRo observatory and its web portal are the central technical elements of a project to improve astronomy education at Purdue Calumet and, more broadly, to improve science education in middle schools of the surrounding region. The NIRo Telescope is a 0.5-meter (20-inch) Ritchey-Chrétien design on a Paramount ME robotic mount, featuring a seven-position filter wheel (UBVRI, Hα, Clear), Peltier (thermoelectrically) cooled CCD camera with 3056 x 3056, square, 12 μm pixels, and off-axis guiding. It provides a coma-free imaging field of 0.5 degrees square, with a plate scale of 0.6 arcseconds per pixel. The observatory has a wireless internet connection, local weather station which publishes data to an internet weather site, and a suite of CCTV security cameras on an IP-based, networked video server. Control of power to every piece of instrumentation is maintained via internet-accessible power distribution units. The telescope can be controlled on-site, or off-site in an attended fashion via an internet connection, but will be used primarily in an unattended mode of automated observation, where queued observations will be scheduled daily from a database of requests. Completed observational data from queued operation will be stored on a campus-based server, which also runs the web portal and observation database. Partial support for this work was provided by the National Science Foundation's Course, Curriculum, and Laboratory Improvement (CCLI) program under Award No. 0736592.

Space Link Extension Protocol Emulation for High-Throughput, High-Latency Network Connections

Science.gov (United States)

Tchorowski, Nicole; Murawski, Robert

2014-01-01

New space missions require higher data rates and new protocols to meet these requirements. These high data rate space communication links push the limitations of not only the space communication links, but of the ground communication networks and protocols which forward user data to remote ground stations (GS) for transmission. The Consultative Committee for Space Data Systems, (CCSDS) Space Link Extension (SLE) standard protocol is one protocol that has been proposed for use by the NASA Space Network (SN) Ground Segment Sustainment (SGSS) program. New protocol implementations must be carefully tested to ensure that they provide the required functionality, especially because of the remote nature of spacecraft. The SLE protocol standard has been tested in the NASA Glenn Research Center's SCENIC Emulation Lab in order to observe its operation under realistic network delay conditions. More specifically, the delay between then NASA Integrated Services Network (NISN) and spacecraft has been emulated. The round trip time (RTT) delay for the continental NISN network has been shown to be up to 120ms; as such the SLE protocol was tested with network delays ranging from 0ms to 200ms. Both a base network condition and an SLE connection were tested with these RTT delays, and the reaction of both network tests to the delay conditions were recorded. Throughput for both of these links was set at 1.2Gbps. The results will show that, in the presence of realistic network delay, the SLE link throughput is significantly reduced while the base network throughput however remained at the 1.2Gbps specification. The decrease in SLE throughput has been attributed to the implementation's use of blocking calls. The decrease in throughput is not acceptable for high data rate links, as the link requires constant data a flow in order for spacecraft and ground radios to stay synchronized, unless significant data is queued a the ground station. In cases where queuing the data is not an option

Cloud-Based SimJavaWeb Software Tool to Learn Simulation

Directory of Open Access Journals (Sweden)

A. Yu. Bykov

2017-01-01

Full Text Available Currently, in simulation there is a trend towards using the distributed software tools, particularly ones, which are using cloud technologies and the Internet. The article considers a simulation educational tool, implemented as a web application using the Java language with special Java class library developed for simulation. It is focused on a discrete event approach to modeling, similarly to the GPSS language, and intended for queuing systems simulation.The structure of the models obtained using this class library is similar to that of the GPSS language models. Also, the simulation language interpreter similar to GPSS is created using this class library, with some differences in the individual statements.Simulation experiments are performed on the server-side, and on client-side you must use a browser with standard functions to enter the source code into HTML-created form. Mobile devices can be used as clients. The source code of a model can be represented both in the Java language using a class library and in the language similar to GPSS.The simulation system implements functions especially for educational process. For example, there is possibility for a student to upload learning materials on the server, send developed software and reports of test control to the teacher via the Internet, and receive a detailed assessment of their results from the teacher. Also detailed results of passed tests in learning modules are entered, and some other functions are implemented in the system.As examples, the article considers models of the m/M/n/0 type queuing system in Java with a class library, and in the language similar to GPSS, shows simulation results, and presents the analytical model and calculations for this system. Analytical calculations proved that the modeling system is useful, as it overlaps simulation results with the acceptable error. Some approaches to the interaction with students through the Internet, used in modeling environment, can

Estudo do processo de dispersão de emissões veiculares em uma microrregião de Belo Horizonte (MG utilizando simulação numérica Study of the dispersion process of vehicular emissions at a specific site in Belo Horizonte (MG, Brazil, using numerical simulation

Directory of Open Access Journals (Sweden)

Fernanda Vasconcelos Fonseca Tavares

2010-12-01

Full Text Available O modelo CAL3QHCR (California Line Source for Queuing & Hot Spot Calculations Refined foi utilizado para avaliar a contribuição das emissões de material particulado (MP10 e MP2,5 de origem veicular na qualidade do ar de uma microrregião do centro de Belo Horizonte (MG. Os resultados de concentração obtidos nas simulações foram comparados com dados experimentais de concentração de MP10 e MP2,5, obtidos a partir da amostragem desses poluentes em uma estação de monitoramento da qualidade do ar localizada na área de estudo. Para todos os cenários, os valores de concentração previstos pelo modelo foram menores do que os observados. Uma análise de sensibilidade revelou que o fator de emissão veicular é o parâmetro que mais influencia os resultados das simulações, indicando a necessidade de realização de um maior número de pesquisas sobre o tema no Brasil.The CAL3QHCR (California Line Source for Queuing & Hot Spot Calculations Refined model was used to assess the contribution of particulate matter (PM10 and PM2.5 from vehicular exhausts to the air quality of a specific site downtown Belo Horizonte (MG, Brazil. Concentration results obtained through simulations were compared to the experimental data of concentrations of PM10 and PM2.5 which consisted of collected samples of these pollutants from a monitoring station for air quality located in the area of the study. For all scenarios, the concentration values predicted by the model were lower than the experimental concentrations. The sensitivity analysis showed that the vehicular emission factor influenced the simulation results more than the other parameters, which points out to the need of more researches in this area in Brazil.

Geometric universality of currents in an open network of interacting particles

International Nuclear Information System (INIS)

Sinitsyn, Nikolai A.; Chernyak, Vladimir Y.; Chertkov, Michael

2010-01-01

We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent on time and instantaneous occupation numbers at the nodes of the graph. We show that under the assumption of the relative rates constancy, the system demonstrates a profound statistical symmetry, resulting in geometric universality of the particle currents statistics. The phenomenon applies broadly to many man-made and natural open stochastic systems, such as queuing of packages over internet, transport of electrons and quasi-particles in mesoscopic systems, and chains of reactions in bio-chemical networks. We illustrate the utility of the general approach using two enabling examples from the two latter disciplines.

I(Re2-WiNoC: Exploring scalable wireless on-chip micronetworks for heterogeneous embedded many-core SoCs

Directory of Open Access Journals (Sweden)

Dan Zhao

2015-02-01

In this work, an irregular and reconfigurable WiNoC platform is proposed to tackle ever increasing complexity, density and heterogeneity challenges. A flexible RF infrastructure is established where RF nodes are properly distributed and IP cores are clustered. Consequently, a performance-cost effective topology is formed. A region-aided routing scheme is further deigned and implemented to realize loop-free, minimum path cost and high scalability for irregular WiNoC infrastructure. To implement the data transmission protocol, the RF microarchitecture of WiNoC is developed where the RF nodes are designed to fulfill the functions of distributed table routing, multi-channel arbitration, virtual output queuing, and distributed flow control. Our simulation studies based on synthetic traffics demonstrate the network efficiency and scalability of WiNoC.

Green Maritime Logistics

DEFF Research Database (Denmark)

Psaraftis, Harilaos N.

2014-01-01

Typical problems in maritime logistics include, among others, optimal ship speed, ship routing and scheduling, fleet deployment, fleet size and mix, weather routing, intermodal network design, modal split, transshipment, queuing at ports, terminal management, berth allocation, and total supply...... chain management. The traditional analysis of these problems has been in terms of cost- benefit and other optimization criteria from the point of view of the logistics provider, carrier, shipper, or other end-user. Such traditional analysis by and large either ignores environmental issues, or considers...... them of secondary importance. Green maritime logistics tries to bring the environmental dimension into the problem, and specifically the dimension of emissions reduction, by analyzing various trade-offs and exploring ‘win-win’ solutions. This talk takes a look at the trade-offs that are at stake...

Gateway-Assisted Retransmission for Lightweight and Reliable IoT Communications.

Science.gov (United States)

Chang, Hui-Ling; Wang, Cheng-Gang; Wu, Mong-Ting; Tsai, Meng-Hsun; Lin, Chia-Ying

2016-09-22

Message Queuing Telemetry Transport for Sensor Networks (MQTT-SN) and Constrained Application Protocol (CoAP) are two protocols supporting publish/subscribe models for IoT devices to publish messages to interested subscribers. Retransmission mechanisms are introduced to compensate for the lack of data reliability. If the device does not receive the acknowledgement (ACK) before retransmission timeout (RTO) expires, the device will retransmit data. Setting an appropriate RTO is important because the delay may be large or retransmission may be too frequent when the RTO is inappropriate. We propose a Gateway-assisted CoAP (GaCoAP) to dynamically compute RTO for devices. Simulation models are proposed to investigate the performance of GaCoAP compared with four other methods. The experiment results show that GaCoAP is more suitable for IoT devices.

Developing a cross-docking network design model under uncertain environment

Science.gov (United States)

Seyedhoseini, S. M.; Rashid, Reza; Teimoury, E.

2015-06-01

Cross-docking is a logistic concept, which plays an important role in supply chain management by decreasing inventory holding, order packing, transportation costs and delivery time. Paying attention to these concerns, and importance of the congestion in cross docks, we present a mixed-integer model to optimize the location and design of cross docks at the same time to minimize the total transportation and operating costs. The model combines queuing theory for design aspects, for that matter, we consider a network of cross docks and customers where two M/M/c queues have been represented to describe operations of indoor trucks and outdoor trucks in each cross dock. To prepare a perfect illustration for performance of the model, a real case also has been examined that indicated effectiveness of the proposed model.

Stochastic Stability in Internet Router Congestion Games

Science.gov (United States)

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.

Order aggressiveness and order book dynamics

DEFF Research Database (Denmark)

Hall, Anthony D.; Hautsch, Nikolaus

2006-01-01

In this paper, we study the determinants of order aggressiveness and traders’ order submission strategy in an open limit order book market. Applying an order classification scheme, we model the most aggressive market orders, limit orders as well as cancellations on both sides of the market...... employing a six-dimensional autoregressive conditional intensity model. Using order book data from the Australian Stock Exchange, we find that market depth, the queued volume, the bid-ask spread, recent volatility, as well as recent changes in both the order flow and the price play an important role...... in explaining the determinants of order aggressiveness. Overall, our empirical results broadly confirm theoretical predictions on limit order book trading. However, we also find evidence for behavior that can be attributed to particular liquidity and volatility effects...

The Elixir System: Data Characterization and Calibration at the Canada-France-Hawaii Telescope

Science.gov (United States)

Magnier, E. A.; Cuillandre, J.-C.

2004-05-01

The Elixir System at the Canada-France-Hawaii Telescope performs data characterization and calibration for all data from the wide-field mosaic imagers CFH12K and MegaPrime. The project has several related goals, including monitoring data quality, providing high-quality master detrend images, determining the photometric and astrometric calibrations, and automatic preprocessing of images for queued service observing (QSO). The Elixir system has been used for all data obtained with CFH12K since the QSO project began in 2001 January. In addition, it has been used to process archival data from the CFH12K and all MegaPrime observations beginning in 2002 December. The Elixir system has been extremely successful in providing well-characterized data to the end observers, who may otherwise be overwhelmed by data-processing concerns.

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

Science.gov (United States)

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.

Analysis and improvement measures of flight delay in China

Science.gov (United States)

Zang, Yuhang

2017-03-01

Firstly, this paper establishes the principal component regression model to analyze the data quantitatively, based on principal component analysis to get the three principal component factors of flight delays. Then the least square method is used to analyze the factors and obtained the regression equation expression by substitution, and then found that the main reason for flight delays is airlines, followed by weather and traffic. Aiming at the above problems, this paper improves the controllable aspects of traffic flow control. For reasons of traffic flow control, an adaptive genetic queuing model is established for the runway terminal area. This paper, establish optimization method that fifteen planes landed simultaneously on the three runway based on Beijing capital international airport, comparing the results with the existing FCFS algorithm, the superiority of the model is proved.

A flexible modelling software for data acquisition

International Nuclear Information System (INIS)

Shu Yantai; Chen Yanhui; Yang Songqi; Liu Genchen

1992-03-01

A flexible modelling software for data acquisition is based on an event-driven simulator. It can be used to simulate a wide variety of systems which can be modelled as open queuing networks. The main feature of the software is its flexibility to evaluate the performance of various data acquisition system, whether pulsed or not. The flexible features of this software as follow: The user can choose the number of processors in the model and the route which every job takes to move the model. the service rate of a processor is automatically adapted. The simulator has a pipe-line mechanism. A job can be divided into several segments and a processor may be used as a compression component etc. Some modelling techniques and applications of this software in plasma physics laboratories are also presented

Gateway-Assisted Retransmission for Lightweight and Reliable IoT Communications

Directory of Open Access Journals (Sweden)

Hui-Ling Chang

2016-09-01

Full Text Available Message Queuing Telemetry Transport for Sensor Networks (MQTT-SN and Constrained Application Protocol (CoAP are two protocols supporting publish/subscribe models for IoT devices to publish messages to interested subscribers. Retransmission mechanisms are introduced to compensate for the lack of data reliability. If the device does not receive the acknowledgement (ACK before retransmission timeout (RTO expires, the device will retransmit data. Setting an appropriate RTO is important because the delay may be large or retransmission may be too frequent when the RTO is inappropriate. We propose a Gateway-assisted CoAP (GaCoAP to dynamically compute RTO for devices. Simulation models are proposed to investigate the performance of GaCoAP compared with four other methods. The experiment results show that GaCoAP is more suitable for IoT devices.

Kontrola tačnosti rezultata u simulacijama Monte Karlo / Accuracy control in Monte Carlo simulations

Directory of Open Access Journals (Sweden)

Nebojša V. Nikolić

2010-04-01

Full Text Available U radu je demonstrirana primena metode automatizovanog ponavljanja nezavisnih simulacionih eksperimenata sa prikupljanjem statistike slučajnih procesa, u dostizanju i kontroli tačnosti simulacionih rezultata u simulaciji sistema masovnog opsluživanja Monte Karlo. Metoda se zasniva na primeni osnovnih stavova i teorema matematičke statistike i teorije verovatnoće. Tačnost simulacionih rezultata dovedena je u direktnu vezu sa brojem ponavljanja simulacionih eksperimenata. / The paper presents an application of the Automated Independent Replication with Gathering Statistics of the Stochastic Processes Method in achieving and controlling the accuracy of simulation results in the Monte Carlo queuing simulations. The method is based on the application of the basic theorems of the theory of probability and mathematical statistics. The accuracy of the simulation results is linked with a number of independent replications of simulation experiments.

Observatory of photovoltaic solar energy in France - 20. edition

International Nuclear Information System (INIS)

2016-12-01

After an overview of important events in the World regarding the development of photovoltaic solar energy in 2016, and predictions regarding new connected installations in 2016, this document present graphs and figures which illustrate the evolution of the photovoltaic fleet in the World, the comparison of production costs of new electric power generation capacities, the evolution of the French photovoltaic power production since 2009, the evolution of the distribution of the French fleet in terms of installation power (from large projects to residential), of connections to the grid, of number of connections and purchase tariffs for the different types of installations (residential, medium roofs, large roofs, very large roofs, very large ground-based or roof-based projects) and for queuing projects, in terms of evolution of purchase tariffs since 2011, and of evolution of impact on the CSPE financing system

Surplus analysis of Sparre Andersen insurance risk processes

CERN Document Server

Willmot, Gordon E

2017-01-01

This carefully written monograph covers the Sparre Andersen process in an actuarial context using the renewal process as the model for claim counts. A unified reference on Sparre Andersen (renewal risk) processes is included, often missing from existing literature. The authors explore recent results and analyse various risk theoretic quantities associated with the event of ruin, including the time of ruin and the deficit of ruin. Particular attention is given to the explicit identification of defective renewal equation components, which are needed to analyse various risk theoretic quantities and are also relevant in other subject areas of applied probability such as dams and storage processes, as well as queuing theory. Aimed at researchers interested in risk/ruin theory and related areas, this work will also appeal to graduate students in classical and modern risk theory and Gerber-Shiu analysis.

Efficient priority queueing routing strategy on networks of mobile agents

Science.gov (United States)

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.

The Sight Distance Issues with Retrofitted Single-Lane HOV Facilities

Directory of Open Access Journals (Sweden)

Zhongren Wang

2013-06-01

Full Text Available It is well-known that obstruction inside a highway horizontal curve will lead to impaired sight distance. Highway alignment design standards in terms of the minimum horizontal curve radius are specified to allow for adequate stopping sight distance at given design speeds. For a single-lane HOV facility, inside curve obstruction may occur no matter when the facility curves to the left (per travel direction or right. A unique situation that calls for special attention is that the adjacent mixed-flow lane traffic, once queued, may become sight obstruction. Calculations indicated that such obstruction may govern the minimum curve radius design as long as the left shoulder is not less than 0.92 m, when the HOV lane is contiguous to the mixed-flow lanes. Such governance may necessitate design speed reduction, horizontal and cross-section design adjustment, or both.

COSMOS: Python library for massively parallel workflows.

Science.gov (United States)

Gafni, Erik; Luquette, Lovelace J; Lancaster, Alex K; Hawkins, Jared B; Jung, Jae-Yoon; Souilmi, Yassine; Wall, Dennis P; Tonellato, Peter J

2014-10-15

Efficient workflows to shepherd clinically generated genomic data through the multiple stages of a next-generation sequencing pipeline are of critical importance in translational biomedical science. Here we present COSMOS, a Python library for workflow management that allows formal description of pipelines and partitioning of jobs. In addition, it includes a user interface for tracking the progress of jobs, abstraction of the queuing system and fine-grained control over the workflow. Workflows can be created on traditional computing clusters as well as cloud-based services. Source code is available for academic non-commercial research purposes. Links to code and documentation are provided at http://lpm.hms.harvard.edu and http://wall-lab.stanford.edu. dpwall@stanford.edu or peter_tonellato@hms.harvard.edu. Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press.

On the Impact of Multi-User Traffic Dynamics on Low Latency Communications

DEFF Research Database (Denmark)

Gerardino, Guillermo Andrés Pocovi; Pedersen, Klaus I.; Alvarez, Beatriz Soret

2016-01-01

In this paper we study the downlink latency performance in a multi-user cellular network. We use a flexible 5G radio frame structure, where the TTI size is configurable on a per-user basis according to their specific service requirements. Results show that at low system loads using a short TTI (e.......g. 0.25 ms) is an attractive solution to achieve low latency communications (LLC). The main benefits come from the low transmission delay required to transmit the payloads. However, as the load increases, longer TTI configurations with lower relative control overhead (and therefore higher spectral...... efficiency) provide better performance as these better cope with the non-negligible queuing delay. The presented results allow to conclude that support for scheduling with different TTI sizes is important for LLC and should be included in the future 5G....

Film traffic queueing model for the DUMC radiology department

International Nuclear Information System (INIS)

Humphrey, L.M.; Ravin, C.E.

1988-01-01

This paper discusses the radiology department traffic model for Duke University Medical Center (DUMC) which simulates the flow of film through the department, and then incorporates the effect of introducing a PACS-type system into present operations. Each Radiology Section is considered separately for queuing of two types of film: old film (from previous exams) and new film (from the present exam). The amount of film in each queue at any time is controlled by controlling hours of operation, service times, delay, and arrival rates. The model also takes into account the use of film in each major radiology area. This gives some idea of the load on a device in that area as well as the amount of storage needed to adequately handle its daily load is local storage at the display device is desired

Developing a new stochastic competitive model regarding inventory and price

Science.gov (United States)

Rashid, Reza; Bozorgi-Amiri, Ali; Seyedhoseini, S. M.

2015-09-01

Within the competition in today's business environment, the design of supply chains becomes more complex than before. This paper deals with the retailer's location problem when customers choose their vendors, and inventory costs have been considered for retailers. In a competitive location problem, price and location of facilities affect demands of customers; consequently, simultaneous optimization of the location and inventory system is needed. To prepare a realistic model, demand and lead time have been assumed as stochastic parameters, and queuing theory has been used to develop a comprehensive mathematical model. Due to complexity of the problem, a branch and bound algorithm has been developed, and its performance has been validated in several numerical examples, which indicated effectiveness of the algorithm. Also, a real case has been prepared to demonstrate performance of the model for real world.

Optimization of an M/M/1/N Feedback Queue with Retention of Reneged Customers

Directory of Open Access Journals (Sweden)

Rakesh Kumar

2014-01-01

Full Text Available Customer impatience has become a threat to the business world. Firms employ various customer retention strategies to retain their impatient (or reneged customers. Customer retention mechanisms may help to retain some or all impatient customers. Further, due to unsatisfactory service, customers may rejoin a queue immediately after departure. Such cases are referred to as feedback customers. Kumar and Sharma take this situation into account and study an M/M/1/N feedback queuing system with retention of reneged customers. They obtain only a steady-state solution for this model. In this paper, we extend the work of Kumar and Sharma by performing an economic analysis of the model. We develop a model for the costs incurred and perform the appropriate optimization. The optimum system capacity and optimum service rate are obtained. (original abstract

Qualitative Description and Quantitative Optimization of Tactical Reconnaissance Agents System Organization

Directory of Open Access Journals (Sweden)

Xiong Li

2012-08-01

Full Text Available In this paper, the problem of qualitative description and quantitative optimization for tactical reconnaissance agents system organization is considered with objective of higher teamwork efficiency and more reasonable task balancing strategies. By analyzing tactical reconnaissance system and its environment, task-(role-entity agent mapping mechanism and agents in system organization, the system framework is qualitatively described. By transforming the system into an interaction task request-service mechanism queuing system, a Markov chain of system state transition is obtained, since its state transition process in interaction is Markov process and accords with real tactical reconnaissance behaviors. By solving the state transition equations, the inherent relationship of tactical reconnaissance agents is found and the optimized system configuration is obtained. The established simulation demonstration system proves that the proposed approach and model are feasible and effective.

Fleet Sizing of Automated Material Handling Using Simulation Approach

Science.gov (United States)

Wibisono, Radinal; Ai, The Jin; Ratna Yuniartha, Deny

2018-03-01

Automated material handling tends to be chosen rather than using human power in material handling activity for production floor in manufacturing company. One critical issue in implementing automated material handling is designing phase to ensure that material handling activity more efficient in term of cost spending. Fleet sizing become one of the topic in designing phase. In this research, simulation approach is being used to solve fleet sizing problem in flow shop production to ensure optimum situation. Optimum situation in this research means minimum flow time and maximum capacity in production floor. Simulation approach is being used because flow shop can be modelled into queuing network and inter-arrival time is not following exponential distribution. Therefore, contribution of this research is solving fleet sizing problem with multi objectives in flow shop production using simulation approach with ARENA Software

Research on the waiting time of passengers and escalator energy consumption at the railway station

Energy Technology Data Exchange (ETDEWEB)

Ma, Wei-wu; Liu, Xiao-yan; Li, Liqing; Shi, Xiangnan; Zhou, Chenn Q. [School of Energy Science and Engineering, Central South University, Changsha 410083 (China)

2009-12-15

Based on the Little Formula and the classical queuing model of multi-channel M vertical stroke D vertical stroke n, the relation of the average queue length, the maximum waiting time and the escalator service intensity were identified and the waiting time simulation model was established. With the passenger delivery data at A railway station in China and the probability distribution model of waiting time, a detailed analysis was made on the escalator allocation, power and energy consumption on holidays, ordinary working days and the largest-passengers-volume days; meanwhile, the fixed and variable energy consumption were compared and studied when the waiting time are 5, 10 and 30 s. The result shows that the waiting time settings affect the allocation and the energy consumption of the escalators and the fixed energy consumption takes 70%. (author)

Sistema de manufatura: otimização de processos em uma unidade fabril de cimento através da teoria das filas

Directory of Open Access Journals (Sweden)

Igor Idalgo Perdoná

2017-01-01

Full Text Available The success of a manufacturing company mainly depends on the agility of their manufacturing system to absorb information, which aims to meet the needs of its users. However, this study aims to carry out an analysis of control, identifying the factors that limit the expedition in a cement factory and through production techniques, align and optimize the process flow at this stage. The Theory of Queues is a very effective technique because it seeks opportunities to improve the restrictions, eliminating bottlenecks and using a suitable transport modeling, reducing the waiting time for charging. As it establishes the study reached the set purposes, realizing control analysis, identifying the factors that limit the shipment in the factory and by the use of the technique, queuing theory, indicate where to be aligned and optimized process flow cement.

Decentralized control of transmission rates in energy-critical wireless networks

KAUST Repository

Xia, Li

2013-06-01

In this paper, we discuss the decentralized optimization of delay and energy consumption in a multi-hop wireless network. The goal is to minimize the energy consumption of energy-critical nodes and the overall packet transmission delay of the network. The transmission rates of energy-critical nodes are adjustable according to the local information of nodes, i.e., the length of packets queued. The multi-hop network is modeled as a queueing network.We prove that the system performance is monotone w.r.t. (with respect to) the transmission rate, thus the “bang-bang” control is an optimal control. We also prove that there exists a threshold type control policy which is optimal. We propose a decentralized algorithm to control transmission rates of these energy-critical nodes. Some simulation experiments are conducted to demonstrate the effectiveness of our approach.

Voice Communications over 802.11 Ad Hoc Networks: Modeling, Optimization and Call Admission Control

Science.gov (United States)

Xu, Changchun; Xu, Yanyi; Liu, Gan; Liu, Kezhong

Supporting quality-of-service (QoS) of multimedia communications over IEEE 802.11 based ad hoc networks is a challenging task. This paper develops a simple 3-D Markov chain model for queuing analysis of IEEE 802.11 MAC layer. The model is applied for performance analysis of voice communications over IEEE 802.11 single-hop ad hoc networks. By using the model, we finish the performance optimization of IEEE MAC layer and obtain the maximum number of voice calls in IEEE 802.11 ad hoc networks as well as the statistical performance bounds. Furthermore, we design a fully distributed call admission control (CAC) algorithm which can provide strict statistical QoS guarantee for voice communications over IEEE 802.11 ad hoc networks. Extensive simulations indicate the accuracy of the analytical model and the CAC scheme.

Impact of clinical surveillance during a foot-and-mouth disease epidemic

DEFF Research Database (Denmark)

Hisham Beshara Halasa, Tariq; Boklund, Anette

duration, number of infected herds and the economic losses from an epidemic. The stochastic spatial simulation model DTU-DADS was enhanced to include simulation of surveillance of herds within the protection and surveillance zones and the model was used to model spread of FMD between herds. A queuing......The objectives of this study were to assess, whether the current surveillance capacity is sufficient to fulfill EU and Danish regulations to control a hypothetical foot-and-mouth disease (FMD) epidemic in Denmark, and whether enlarging the protection and/or surveillance zones could reduce epidemic...... showed that the default surveillance capacity is sufficient to survey herds within one week of the zones establishment, as the regulations demand. Extra resources for surveillance did not reduce the costs of the epidemics, but fewer resources could result in larger epidemics and costs. Furthermore...

The Impact of Resources for Clinical Surveillance on the Control of a Hypothetical Foot-and-Mouth Disease Epidemic in Denmark

DEFF Research Database (Denmark)

Hisham Beshara Halasa, Tariq; Boklund, Anette

2014-01-01

The objectives of this study were to assess whether current surveillance capacity is sufficient to fulfill EU and Danish regulations to control a hypothetical foot-and-mouth disease (FMD) epidemic in Denmark, and whether enlarging the protection and/or surveillance zones could minimize economic...... losses. The stochastic spatial simulation model DTU-DADS was further developed to simulate clinical surveillance of herds within the protection and surveillance zones and used to model spread of FMD between herds. A queuing system was included in the model, and based on daily surveillance capacity, which...... resources for surveillance did not improve the situation, but fewer resources could result in larger epidemics and costs. Enlarging the protection zone was a better strategy than the basic scenario. Despite that enlarging the surveillance zone might result in shorter epidemic duration, and lower number...

Modeling and performance analysis of cooperative communications in cognitive radio networks

KAUST Repository

Khabazian, Mehdi

2011-09-01

In this paper, we study the performance of a network comprised of a primary user and a secondary user with the latter having cognitive radio capabilities. The secondary node uses the empty slots of the primary user to transmit its own traffic as well as to relay the primary\\'s traffic in a cooperative fashion. Taking a queuing theory approach, we find the probability generating functions of the numbers of packets in the queues of the primary and secondary users. Subsequently, we determine a number of performance measures such as the average queues\\' lengths, average packet transmission delays and secondary user\\'s queue surcharge due to cooperation. The numerical results along with the simulations show the importance of controlling the number of primary user packets admitted by the secondary user for cooperation and its impacts on the other performance measures. © 2011 IEEE.

Job-mix modeling and system analysis of an aerospace multiprocessor.

Science.gov (United States)

Mallach, E. G.

1972-01-01

An aerospace guidance computer organization, consisting of multiple processors and memory units attached to a central time-multiplexed data bus, is described. A job mix for this type of computer is obtained by analysis of Apollo mission programs. Multiprocessor performance is then analyzed using: 1) queuing theory, under certain 'limiting case' assumptions; 2) Markov process methods; and 3) system simulation. Results of the analyses indicate: 1) Markov process analysis is a useful and efficient predictor of simulation results; 2) efficient job execution is not seriously impaired even when the system is so overloaded that new jobs are inordinately delayed in starting; 3) job scheduling is significant in determining system performance; and 4) a system having many slow processors may or may not perform better than a system of equal power having few fast processors, but will not perform significantly worse.

Decentralized control of transmission rates in energy-critical wireless networks

KAUST Repository

Xia, Li; Shihada, Basem

2013-01-01

In this paper, we discuss the decentralized optimization of delay and energy consumption in a multi-hop wireless network. The goal is to minimize the energy consumption of energy-critical nodes and the overall packet transmission delay of the network. The transmission rates of energy-critical nodes are adjustable according to the local information of nodes, i.e., the length of packets queued. The multi-hop network is modeled as a queueing network.We prove that the system performance is monotone w.r.t. (with respect to) the transmission rate, thus the “bang-bang” control is an optimal control. We also prove that there exists a threshold type control policy which is optimal. We propose a decentralized algorithm to control transmission rates of these energy-critical nodes. Some simulation experiments are conducted to demonstrate the effectiveness of our approach.

Staffing to Maximize Profit for Call Centers with Impatient and Repeat-Calling Customers

Directory of Open Access Journals (Sweden)

Jun Gong

2015-01-01

Full Text Available Motivated by call center practice, we study the optimal staffing of many-server queues with impatient and repeat-calling customers. A call center is modeled as an M/M/s+M queue, which is developed to a behavioral queuing model in which customers come and go based on their satisfaction with waiting time. We explicitly take into account customer repeat behavior, which implies that satisfied customers might return and have an impact on the arrival rate. Optimality is defined as the number of agents that maximize revenues net of staffing costs, and we account for the characteristic that revenues are a direct function of staffing. Finally, we use numerical experiments to make certain comparisons with traditional models that do not consider customer repeat behavior. Furthermore, we indicate how managers might allocate staffing optimally with various customer behavior mechanisms.

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

Science.gov (United States)

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.

Effective electron-density map improvement and structure validation on a Linux multi-CPU web cluster: The TB Structural Genomics Consortium Bias Removal Web Service.

Science.gov (United States)

Reddy, Vinod; Swanson, Stanley M; Segelke, Brent; Kantardjieff, Katherine A; Sacchettini, James C; Rupp, Bernhard

2003-12-01

Anticipating a continuing increase in the number of structures solved by molecular replacement in high-throughput crystallography and drug-discovery programs, a user-friendly web service for automated molecular replacement, map improvement, bias removal and real-space correlation structure validation has been implemented. The service is based on an efficient bias-removal protocol, Shake&wARP, and implemented using EPMR and the CCP4 suite of programs, combined with various shell scripts and Fortran90 routines. The service returns improved maps, converted data files and real-space correlation and B-factor plots. User data are uploaded through a web interface and the CPU-intensive iteration cycles are executed on a low-cost Linux multi-CPU cluster using the Condor job-queuing package. Examples of map improvement at various resolutions are provided and include model completion and reconstruction of absent parts, sequence correction, and ligand validation in drug-target structures.

Modelling and Simulation of Cooperative Control for Bus Rapid Transit Vehicle Platoon in a Connected Vehicle Environment

Directory of Open Access Journals (Sweden)

Jiahui Liu

2017-02-01

Full Text Available The aim of this paper is to develop a cooperative control model for improving the operational efficiency of Bus Rapid Transit (BRT vehicles. The model takes advantage of the emerging connected vehicle technology. A connected vehicle centre is established to assign a specific reservation time interval and transmit the corresponding dynamic speed guidance to each BRT vehicle. Furthermore, a set of constraints have been set up to avoid bus queuing and waiting phenomena in downstream BRT stations. Therefore, many BRT vehicles are strategically guided to form a platoon, which can pass through an intersection with no impedance. An actual signalized intersection along the Guangzhou BRT corridor is employed to verify and assess the cooperative control model in various traffic conditions. The simulation-based evaluation results demonstrate that the proposed approach can reduce delays, decrease the number of stops, and improve the sustainability of the BRT vehicles.

Capacity gain with an alternative LTE railway communication network

DEFF Research Database (Denmark)

Sniady, Aleksander; Soler, José

2014-01-01

, such as 3GPP Long Term Evolution (LTE). T his paper describe s how to adapt the reversible multi - chain/channel queuing system to model an LTE cell serving ETCS - equipped trains . It is proposed to use the multiple user chains available in the model to represent varying bitrate in LTE radio access network....... Usin g this model , LTE and GSM - R are compare d in terms of capacity on an example at Copenhagen Main Train Station . The purpose of this work is to demonstrate the benefits that railway operators and infrastructure managers can expect from the introduc tion of LTE , as a telecommunication technology...... Control System (ETCS) signaling , the capacity of GSM - R turns out to be insufficient . GSM - R cannot ful fill the railway requirements , in terms of the number of simultaneous ETCS connections . This is why , alternative , more efficient communication technologies should be considered by railways...

A framework for service enterprise workflow simulation with multi-agents cooperation

Science.gov (United States)

Tan, Wenan; Xu, Wei; Yang, Fujun; Xu, Lida; Jiang, Chuanqun

2013-11-01

Process dynamic modelling for service business is the key technique for Service-Oriented information systems and service business management, and the workflow model of business processes is the core part of service systems. Service business workflow simulation is the prevalent approach to be used for analysis of service business process dynamically. Generic method for service business workflow simulation is based on the discrete event queuing theory, which is lack of flexibility and scalability. In this paper, we propose a service workflow-oriented framework for the process simulation of service businesses using multi-agent cooperation to address the above issues. Social rationality of agent is introduced into the proposed framework. Adopting rationality as one social factor for decision-making strategies, a flexible scheduling for activity instances has been implemented. A system prototype has been developed to validate the proposed simulation framework through a business case study.

A queueing theory based model for business continuity in hospitals.

Science.gov (United States)

Miniati, R; Cecconi, G; Dori, F; Frosini, F; Iadanza, E; Biffi Gentili, G; Niccolini, F; Gusinu, R

2013-01-01

Clinical activities can be seen as results of precise and defined events' succession where every single phase is characterized by a waiting time which includes working duration and possible delay. Technology makes part of this process. For a proper business continuity management, planning the minimum number of devices according to the working load only is not enough. A risk analysis on the whole process should be carried out in order to define which interventions and extra purchase have to be made. Markov models and reliability engineering approaches can be used for evaluating the possible interventions and to protect the whole system from technology failures. The following paper reports a case study on the application of the proposed integrated model, including risk analysis approach and queuing theory model, for defining the proper number of device which are essential to guarantee medical activity and comply the business continuity management requirements in hospitals.

Getting the Most from Distributed Resources With an Analytics Platform for ATLAS Computing Services

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00225336; The ATLAS collaboration; Gardner, Robert; Bryant, Lincoln

2016-01-01

To meet a sharply increasing demand for computing resources for LHC Run 2, ATLAS distributed computing systems reach far and wide to gather CPU resources and storage capacity to execute an evolving ecosystem of production and analysis workflow tools. Indeed more than a hundred computing sites from the Worldwide LHC Computing Grid, plus many “opportunistic” facilities at HPC centers, universities, national laboratories, and public clouds, combine to meet these requirements. These resources have characteristics (such as local queuing availability, proximity to data sources and target destinations, network latency and bandwidth capacity, etc.) affecting the overall processing efficiency and throughput. To quantitatively understand and in some instances predict behavior, we have developed a platform to aggregate, index (for user queries), and analyze the more important information streams affecting performance. These data streams come from the ATLAS production system (PanDA), the distributed data management s...

Good-bye Summer Students 2009!

CERN Multimedia

2009-01-01

In its 47th edition, the CERN Summer Student programme has welcomed almost 200 young students from around the world. As it proves to do each year, the programme has provided a unique experience for all participants. CERN Summer Students 2009 in the Microcosm garden.During the summer months between June and August, your normal lunchtime routine is inevitably disrupted by the small stampede of students that leaves the Main Auditorium just around midday and starts queuing in Restaurant 1. When this happens, you can’t help but notice that the CERN Summer Students have arrived! With its rich lecture series, inspirational visits and actual work experience, the Summer Student programme provides a real chance to get acquainted with a career in particle physics, engineering and computation. The programme includes a morning lecture series that covers a large variety of topics, from particle physics to engineering, information technology and ...

On Scalable Deep Learning and Parallelizing Gradient Descent

CERN Document Server

AUTHOR|(CDS)2129036; Möckel, Rico; Baranowski, Zbigniew; Canali, Luca

Speeding up gradient based methods has been a subject of interest over the past years with many practical applications, especially with respect to Deep Learning. Despite the fact that many optimizations have been done on a hardware level, the convergence rate of very large models remains problematic. Therefore, data parallel methods next to mini-batch parallelism have been suggested to further decrease the training time of parameterized models using gradient based methods. Nevertheless, asynchronous optimization was considered too unstable for practical purposes due to a lacking understanding of the underlying mechanisms. Recently, a theoretical contribution has been made which defines asynchronous optimization in terms of (implicit) momentum due to the presence of a queuing model of gradients based on past parameterizations. This thesis mainly builds upon this work to construct a better understanding why asynchronous optimization shows proportionally more divergent behavior when the number of parallel worker...

Analysis of matters associated with the transferring of object-oriented applications to platform .Net using C# programming language

Science.gov (United States)

Sarsimbayeva, S. M.; Kospanova, K. K.

2015-11-01

The article provides the discussion of matters associated with the problems of transferring of object-oriented Windows applications from C++ programming language to .Net platform using C# programming language. C++ has always been considered to be the best language for the software development, but the implicit mistakes that come along with the tool may lead to infinite memory leaks and other errors. The platform .Net and the C#, made by Microsoft, are the solutions to the issues mentioned above. The world economy and production are highly demanding applications developed by C++, but the new language with its stability and transferability to .Net will bring many advantages. An example can be presented using the applications that imitate the work of queuing systems. Authors solved the problem of transferring of an application, imitating seaport works, from C++ to the platform .Net using C# in the scope of Visual Studio.

Buffer-Aided Relaying with Adaptive Link Selection

DEFF Research Database (Denmark)

Zlatanov, Nikola; Schober, Robert; Popovski, Petar

2013-01-01

In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the channel state information of the source-relay and the relay......-destination link a decision is made whether the source or the relay transmits. In order to avoid data loss at the relay, adaptive link selection requires the relay to be equipped with a buffer such that data can be queued until the relay-destination link is selected for transmission. We study both delay......-constrained and delay-unconstrained transmission. For the delay-unconstrained case, we characterize the optimal link selection policy, derive the corresponding throughput, and develop an optimal power allocation scheme. For the delay-constrained case, we propose to starve the buffer of the relay by choosing...

Network Configuration Analysis for Formation Flying Satellites

Science.gov (United States)

Knoblock, Eric J.; Wallett, Thomas M.; Konangi, Vijay K.; Bhasin, Kul B.

2001-01-01

The performance of two networks to support autonomous multi-spacecraft formation flying systems is presented. Both systems are comprised of a ten-satellite formation, with one of the satellites designated as the central or 'mother ship.' All data is routed through the mother ship to the terrestrial network. The first system uses a TCP/EP over ATM protocol architecture within the formation, and the second system uses the IEEE 802.11 protocol architecture within the formation. The simulations consist of file transfers using either the File Transfer Protocol (FTP) or the Simple Automatic File Exchange (SAFE) Protocol. The results compare the IP queuing delay, IP queue size and IP processing delay at the mother ship as well as end-to-end delay for both systems. In all cases, using IEEE 802.11 within the formation yields less delay. Also, the throughput exhibited by SAFE is better than FTP.

Replenishing data descriptors in a DMA injection FIFO buffer

Science.gov (United States)

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.

Cuckoo search and firefly algorithm theory and applications

CERN Document Server

2014-01-01

Nature-inspired algorithms such as cuckoo search and firefly algorithm have become popular and widely used in recent years in many applications. These algorithms are flexible, efficient and easy to implement. New progress has been made in the last few years, and it is timely to summarize the latest developments of cuckoo search and firefly algorithm and their diverse applications. This book will review both theoretical studies and applications with detailed algorithm analysis, implementation and case studies so that readers can benefit most from this book.  Application topics are contributed by many leading experts in the field. Topics include cuckoo search, firefly algorithm, algorithm analysis, feature selection, image processing, travelling salesman problem, neural network, GPU optimization, scheduling, queuing, multi-objective manufacturing optimization, semantic web service, shape optimization, and others.   This book can serve as an ideal reference for both graduates and researchers in computer scienc...

Port performance evaluation tool based on microsimulation model

Directory of Open Access Journals (Sweden)

Tsavalista Burhani Jzolanda

2017-01-01

Full Text Available As port performance is becoming correlative to national competitiveness, the issue of port performance evaluation has significantly raised. Port performances can simply be indicated by port service levels to the ship (e.g., throughput, waiting for berthing etc., as well as the utilization level of equipment and facilities within a certain period. The performances evaluation then can be used as a tool to develop related policies for improving the port’s performance to be more effective and efficient. However, the evaluation is frequently conducted based on deterministic approach, which hardly captures the nature variations of port parameters. Therefore, this paper presents a stochastic microsimulation model for investigating the impacts of port parameter variations to the port performances. The variations are derived from actual data in order to provide more realistic results. The model is further developed using MATLAB and Simulink based on the queuing theory.

Radio Frequency Identification Queuing & Geo-Location (RAQGEO): A spatial solution to inventory management at XYZ Logistics, Inc

Science.gov (United States)

Griffiths, Bradley Joseph

New supply chain management methods using radio frequency identification (RFID) and global positioning system (GPS) technology are quickly being adopted by companies as various inventory management benefits are being realized. For example, companies such as Nippon Yusen Kaisha (NYK) Logistics use the technology coupled with geospatial support systems for distributors to quickly find and manage freight containers. Traditional supply chain management methods require pen-to-paper reporting, searching inventory on foot, and human data entry. Some companies that prioritize supply chain management have not adopted the new technology, because they may feel that their traditional methods save the company expenses. This thesis serves as a pilot study that examines how information technology (IT) utilizing RFID and GPS technology can serve to increase workplace productivity, decrease human labor associated with inventorying, plus be used for spatial analysis by management. This pilot study represents the first attempt to couple RFID technology with Geographic Information Systems (GIS) in supply chain management efforts to analyze and locate mobile assets by exploring costs and benefits of implementation plus how the technology can be employed. This pilot study identified a candidate to implement a new inventory management method as XYZ Logistics, Inc. XYZ Logistics, Inc. is a fictitious company but represents a factual corporation. The name has been changed to provide the company with anonymity and to not disclose confidential business information. XYZ Logistics, Inc., is a nation-wide company that specializes in providing space solutions for customers including portable offices, storage containers, and customizable buildings.

Practical considerations in developing an instrument-maintenance plan--

International Nuclear Information System (INIS)

Guth, M.A.S.

1989-01-01

The author develops a general set of considerations to explain how a consistent, well-organized, prioritized, and adequate time-allowance program plan for routine maintenance can be constructed. The analysis is supplemented with experience from the high flux isotope reactor (HFIR) at US Oak Ridge National Laboratory (ORNL). After the preventive maintenance (PM) problem was defined, the instruments on the schedule were selected based on the manufacturer's design specifications, quality-assurance requirements, prior classifications, experiences with the incidence of breakdowns or calibration, and dependencies among instruments. The effects of repair error in PM should be also studied. The HFIR requires three full-time technicians to perform both PM and unscheduled maintenance. A review is presented of concepts from queuing theory to determine anticipated breakdown patterns. In practice, the pneumatic instruments have a much longer lifetime than the electric/electronic instruments on various reactors at ORNL. Some special considerations and risk aversion in choosing a maintenance schedule

Analysis of computer networks

CERN Document Server

Gebali, Fayez

2015-01-01

This textbook presents the mathematical theory and techniques necessary for analyzing and modeling high-performance global networks, such as the Internet. The three main building blocks of high-performance networks are links, switching equipment connecting the links together, and software employed at the end nodes and intermediate switches. This book provides the basic techniques for modeling and analyzing these last two components. Topics covered include, but are not limited to: Markov chains and queuing analysis, traffic modeling, interconnection networks and switch architectures and buffering strategies.   ·         Provides techniques for modeling and analysis of network software and switching equipment; ·         Discusses design options used to build efficient switching equipment; ·         Includes many worked examples of the application of discrete-time Markov chains to communication systems; ·         Covers the mathematical theory and techniques necessary for ana...

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

MICADO The data import engine of the CERN engineering and equipment data management system

CERN Document Server

Widegren, David; Lyzwa, R; Mallon Amerigo, S; Petit, S; Rousseau, B

2008-01-01

The CERN Engineering and Equipment Data Management System (EDMS) is one of the largest and most complex data management systems of its kind. For the last 10 years, it has received huge quantities of data generated in the different LHC project phases. Capturing all this information would not have been possible without a robust, failsafe, yet flexible and user-friendly data import engine. For this purpose the Micado toolkit was developed at CERN using XML standards, providing multi-level data verifications, an advanced queuing mechanism and batch processing of large amounts of import requests. Whereas Micado originally was developed to facilitate the capturing of LHC manufacturing data, its modular architecture has allowed a cost-effective extension to also cater for the LHC installation and hardware commissioning data import processes. Recently Micado has broadened its scope even further, including also imports of safety inspections, and at the same time the next generation of the tool providing Web Services i...

Uncapacitated facility location problems: contributions

Directory of Open Access Journals (Sweden)

Galvão Roberto Diéguez

2004-01-01

Full Text Available The objective of the present paper is to review my personal contributions in the field of uncapacitated facility location problems. These contributions took place throughout my academic career, from the time I was a Ph.D. student at Imperial College to the present day. They cover approximately 30 years, from 1973 to 2003; they address: algorithms developed for the p-median problem and for a general formulation of uncapacitated location problems; the study of dynamic location models; covering and hierarchical location problems; queuing-based probabilistic location models. The contributions encompass theoretical developments, computational algorithms and practical applications. All work took place in an academic environment, with the invaluable collaboration of colleagues (both in Brazil and abroad and research students at COPPE. Each section in the paper is dedicated to a topic that involves a personal contribution. Every one of them is placed within the context of the existing literature.

ADAPTATION OF JOHNSON SEQUENCING ALGORITHM FOR JOB SCHEDULING TO MINIMISE THE AVERAGE WAITING TIME IN CLOUD COMPUTING ENVIRONMENT

Directory of Open Access Journals (Sweden)

SOUVIK PAL

2016-09-01

Full Text Available Cloud computing is an emerging paradigm of Internet-centric business computing where Cloud Service Providers (CSPs are providing services to the customer according to their needs. The key perception behind cloud computing is on-demand sharing of resources available in the resource pool provided by CSP, which implies new emerging business model. The resources are provisioned when jobs arrive. The job scheduling and minimization of waiting time are the challenging issue in cloud computing. When a large number of jobs are requested, they have to wait for getting allocated to the servers which in turn may increase the queue length and also waiting time. This paper includes system design for implementation which is concerned with Johnson Scheduling Algorithm that provides the optimal sequence. With that sequence, service times can be obtained. The waiting time and queue length can be reduced using queuing model with multi-server and finite capacity which improves the job scheduling model.

Optimizing Resource Utilization in Grid Batch Systems

International Nuclear Information System (INIS)

Gellrich, Andreas

2012-01-01

On Grid sites, the requirements of the computing tasks (jobs) to computing, storage, and network resources differ widely. For instance Monte Carlo production jobs are almost purely CPU-bound, whereas physics analysis jobs demand high data rates. In order to optimize the utilization of the compute node resources, jobs must be distributed intelligently over the nodes. Although the job resource requirements cannot be deduced directly, jobs are mapped to POSIX UID/GID according to the VO, VOMS group and role information contained in the VOMS proxy. The UID/GID then allows to distinguish jobs, if users are using VOMS proxies as planned by the VO management, e.g. ‘role=production’ for Monte Carlo jobs. It is possible to setup and configure batch systems (queuing system and scheduler) at Grid sites based on these considerations although scaling limits were observed with the scheduler MAUI. In tests these limitations could be overcome with a home-made scheduler.

CIME Summer Course on Exploiting Hidden Structure in Matrix Computations : Algorithms and Applications

CERN Document Server

Simoncini, Valeria

2016-01-01

Focusing on special matrices and matrices which are in some sense "near" to structured matrices, this volume covers a broad range of topics of current interest in numerical linear algebra. Exploitation of these less obvious structural properties can be of great importance in the design of efficient numerical methods, for example algorithms for matrices with low-rank block structure, matrices with decay, and structured tensor computations. Applications range from quantum chemistry to queuing theory. Structured matrices arise frequently in applications. Examples include banded and sparse matrices, Toeplitz-type matrices, and matrices with semi-separable or quasi-separable structure, as well as Hamiltonian and symplectic matrices. The associated literature is enormous, and many efficient algorithms have been developed for solving problems involving such matrices. The text arose from a C.I.M.E. course held in Cetraro (Italy) in June 2015 which aimed to present this fast growing field to young researchers, exploit...

An analytical study of various telecomminication networks using Markov models

International Nuclear Information System (INIS)

Ramakrishnan, M; Jayamani, E; Ezhumalai, P

2015-01-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. (paper)

The Application of Waiting Lines System in Improving Customer Service Management: The Examination of Malaysia Fast Food Restaurants Industry

Science.gov (United States)

Ismail, Zurina; Shokor, Shahrul Suhaimi AB

2016-03-01

Rapid life time change of the Malaysian lifestyle had served the overwhelming growth in the service operation industry. On that occasion, this paper will provide the idea to improve the waiting line system (WLS) practices in Malaysia fast food chains. The study will compare the results in between the single server single phase (SSSP) and the single server multi-phase (SSMP) which providing Markovian Queuing (MQ) to be used for analysis. The new system will improve the current WLS, plus intensifying the organization performance. This new WLS were designed and tested in a real case scenario and in order to develop and implemented the new styles, it need to be focusing on the average number of customers (ANC), average number of customer spending time waiting in line (ACS), and the average time customers spend in waiting and being served (ABS). We introduced new WLS design and there will be prompt discussion upon theories of benefits and potential issues that will benefit other researchers.

Multivariate optimization of production systems

International Nuclear Information System (INIS)

Carroll, J.A.; Horne, R.N.

1992-01-01

This paper reports that mathematically, optimization involves finding the extreme values of a function. Given a function of several variables, Z = ∫(rvec x 1 , rvec x 2 ,rvec x 3 ,→x n ), an optimization scheme will find the combination of these variables that produces an extreme value in the function, whether it is a minimum or a maximum value. Many examples of optimization exist. For instance, if a function gives and investor's expected return on the basis of different investments, numerical optimization of the function will determine the mix of investments that will yield the maximum expected return. This is the basis of modern portfolio theory. If a function gives the difference between a set of data and a model of the data, numerical optimization of the function will produce the best fit of the model to the data. This is the basis for nonlinear parameter estimation. Similar examples can be given for network analysis, queuing theory, decision analysis, etc

TinyOS-based quality of service management in wireless sensor networks

Science.gov (United States)

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

2009-01-01

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

Optimization of shovel-truck system for surface mining

Energy Technology Data Exchange (ETDEWEB)

Ercelebi, S.G.; Bascetin, A. [Istanbul Technical University, Istanbul (Turkey). Mining Engineering Department

2009-07-15

In surface mining operations, truck haulage is the largest item in the operating costs, constituting 50 to 60% of the total. In order to reduce this cost, it is necessary to allocate and dispatch the trucks efficiently. This paper describes shovel and truck operation models and optimization approaches for the allocation and dispatching of trucks under various operating conditions. Closed queuing network theory is employed for the allocation of trucks and linear programming for the purpose of truck dispatching to shovels. A case study was applied for the Orhaneli open Pit Coal Mine in Turkey. This approach would provide the capability of estimating system performance measures (mine throughput, mean number of trucks, mean waiting time, etc.) for planning purposes when the truck fleet is composed of identical trucks. A computational study is presented to show how choosing the optimum number of trucks and optimum dispatching policy affect the cost of moving material in a truck-shovel system.

Modelling bursty time series

International Nuclear Information System (INIS)

Vajna, Szabolcs; Kertész, János; Tóth, Bálint

2013-01-01

Many human-related activities show power-law decaying interevent time distribution with exponents usually varying between 1 and 2. We study a simple task-queuing model, which produces bursty time series due to the non-trivial dynamics of the task list. The model is characterized by a priority distribution as an input parameter, which describes the choice procedure from the list. We give exact results on the asymptotic behaviour of the model and we show that the interevent time distribution is power-law decaying for any kind of input distributions that remain normalizable in the infinite list limit, with exponents tunable between 1 and 2. The model satisfies a scaling law between the exponents of interevent time distribution (β) and autocorrelation function (α): α + β = 2. This law is general for renewal processes with power-law decaying interevent time distribution. We conclude that slowly decaying autocorrelation function indicates long-range dependence only if the scaling law is violated. (paper)

THE OPAQUE PORTRAIT OF CORRUPTION ERADICATION

Directory of Open Access Journals (Sweden)

Marwan Mas

2016-11-01

Full Text Available The war against corruption should not only by exposing the various cases of corruption, but the most important thing is to punish the corrupt in an extraordinary way to have a deterrent effect and not replicable by potential criminals that have been queued. Corruption is more structured and systematic, from the center to the regions. In fact, gave birth to a new generation of fat accounts with the discovery of a number of civil servants who are still young. Stop the robbery of money the state cannot just with rhetoric, let alone just a call that seemed hot chicken droppings. Blurred portrait of corruption is characterized by a large number of cases the defendant is acquitted of corruption Anticorruption Court. Similarly, many major cases involving alleged power elite and the ruling political party that is not completed, such as the Bank Century case, the case Hambalang project, as well as allegations of corruption Pensions SEA Games athletes

Variable Speed Limits: Strategies to Improve Safety and Traffic Parameters for a Bottleneck

Directory of Open Access Journals (Sweden)

M. Z. Hasanpour

2017-04-01

Full Text Available The primary purpose of the speed limit system is to enforce reasonable and safe speed. To reduce secondary problems such as accidents and queuing, Variable Speed Limits (VSL has been suggested. In this paper VSL is used to better safety and traffic parameters. Traffic parameters including speed, queue length and stopping time have been pondering. For VLS, an optimization decision tree algorithm with the function of microscopic simulation was used. The results in case of sub saturated, saturated and supersaturated at a bottleneck are examined and compared with the Allaby logic tree. The results show that the proposed decision tree shows an improved performance in terms of safety and comfort along the highway. The VSL pilot project is part of the Road Safety Improvement Program included in Iran’s road safety action plan that is in the research process in the BHRC Research Institute, Road and Housing & Urban Development Research that is planned for next 10-year Transportation safety view Plan.

Social influence, agent heterogeneity and the emergence of the urban informal sector

Science.gov (United States)

García-Díaz, César; Moreno-Monroy, Ana I.

2012-02-01

We develop an agent-based computational model in which the urban informal sector acts as a buffer where rural migrants can earn some income while queuing for higher paying modern-sector jobs. In the model, the informal sector emerges as a result of rural-urban migration decisions of heterogeneous agents subject to social influence in the form of neighboring effects of varying strengths. Besides using a multinomial logit choice model that allows for agent idiosyncrasy, explicit agent heterogeneity is introduced in the form of socio-demographic characteristics preferred by modern-sector employers. We find that different combinations of the strength of social influence and the socio-economic composition of the workforce lead to very different urbanization and urban informal sector shares. In particular, moderate levels of social influence and a large proportion of rural inhabitants with preferred socio-demographic characteristics are conducive to a higher urbanization rate and a larger informal sector.

Wide-area-distributed storage system for a multimedia database

Science.gov (United States)

Ueno, Masahiro; Kinoshita, Shigechika; Kuriki, Makato; Murata, Setsuko; Iwatsu, Shigetaro

1998-12-01

We have developed a wide-area-distribution storage system for multimedia databases, which minimizes the possibility of simultaneous failure of multiple disks in the event of a major disaster. It features a RAID system, whose member disks are spatially distributed over a wide area. Each node has a device, which includes the controller of the RAID and the controller of the member disks controlled by other nodes. The devices in the node are connected to a computer, using fiber optic cables and communicate using fiber-channel technology. Any computer at a node can utilize multiple devices connected by optical fibers as a single 'virtual disk.' The advantage of this system structure is that devices and fiber optic cables are shared by the computers. In this report, we first described our proposed system, and a prototype was used for testing. We then discussed its performance; i.e., how to read and write throughputs are affected by data-access delay, the RAID level, and queuing.

Etude d'architectes de méta-ordonnancement pour le calcul en régime permanent et saturé

CERN Document Server

Caron, E; Tsaregorodtsev, A Yu

2006-01-01

In this paper we present a model and simulator for many clusters of heterogeneous PCs belonging to a local network. These clusters are assumed to be connected to each other through a global network and each cluster is managed via a local scheduler which is shared by many users. We validate our simulator by comparing the experimental and analytical results of a M/M/4 queuing system. These studies indicate that the simulator is consistent. Next, we do the comparison with a real batch system and we obtain an average error of 10.5% for the response time and 12% for the makespan. We conclude that the simulator is realistic and well describes the behaviour of a large-scale system. Thus we can study the scheduling of our system called dirac in a high throughput context. We justify our decentralized, adaptive and opportunistic approach in comparison to a centralized approach in such a context.

Evaluation of Meta scheduler Architectures and Task assignment Policies for High throughput Computing

CERN Document Server

Caron, E; Tsaregorodtsev, A Yu

2006-01-01

In this paper we present a model and simulator for many clusters of heterogeneous PCs belonging to a local network. These clusters are assumed to be connected to each other through a global network and each cluster is managed via a local scheduler which is shared by many users. We validate our simulator by comparing the experimental and analytical results of a M/M/4 queuing system. These studies indicate that the simulator is consistent. Next, we do the comparison with a real batch system and we obtain an average error of 10.5\\% for the response time and 12\\% for the makespan. We conclude that the simulator is realistic and well describes the behaviour of a large-scale system. Thus we can study the scheduling of our system called \\dirac in a high throughput context. We justify our decentralized, adaptive and opportunistic approach in comparison to a centralized approach in such a context.

Business applications of operations research

CERN Document Server

Nag, Bodhibrata

2014-01-01

Operations Research is a bouquet of mathematical techniques which have evolved over the last six decades, to improve the process of business decision making. Operations Research offers tools to optimize and find the best solutions to myriad decisions that managers have to take in their day to day operations or while carrying out strategic planning. Today, with the advent of operations research software, these tools can be applied by managers even without any knowledge of the mathematical techniques that underlie the solution procedures. The book starts with a brief introduction to various tools of operations research, such as linear programming, integer programming, multi-objective programming, queuing theory and network theory together with simple examples in each of the areas. Another introductory chapter on handling the operations research software, along with examples is also provided. The book intends to make the readers aware of the power and potential of operations research in addressing decision makin...

IT Services Availability during the Annual CERN Closure 2006

CERN Document Server

2006-01-01

Most of the physics, technical, administrative and communications services provided by the IT Department, including LCG (EGEE) production services, will remain available during the CERN annual closure (although EDH requests will stay queued). No interruptions are scheduled (beyond PABX maintenance work on 3-5 January 2007) but restoration of services in case of failure cannot be guaranteed. Problems which arise should be addressed within about half a day except around Christmas Eve and Christmas Day (24 and 25 December) and New Year's Eve and New Year's Day (31 December and 1 January). Incidents will be documented at http://cern.ch/ssb. Although the backup service will be operational, backups cannot be guaranteed and file restores will not be possible. Damaged tapes in Castor will not be processed. Please note that the Helpdesk will be closed but an operator service will be maintained throughout and can be reached at extension 75011 or by email to computer.operations@cern.ch where urgent problems may be ad...

IT Services Availability during the 2007 Annual CERN Closure

CERN Multimedia

IT Department

2007-01-01

Most of the physics, technical, administrative and communications services provided by the IT Department - including LCG (EGEE) production services - will remain available during the CERN annual closure (although EDH requests will stay queued). No interruptions are scheduled but in the event of failure, the restoration of services cannot be guaranteed. Problems will be dealt with on a best effort basis only. However, for the following services: Network, Databases, Mail, Web, Windows & Terminal Services, Indico, CDS, Grid (SAM, FTS, VOMS, GridView, Resource Brokers): experts should be reachable to start investigations within about half a day except around Christmas Eve and Christmas Day (24 and 25 December) and New Year’s Eve and New Year’s Day (31 December and 1 January). Incidents will be documented at http://cern.ch/ssb; The backup service: will remain operational, but backups cannot be guaranteed and file restores will not be possible; Castor: damaged tapes wi...

Processing moldable tasks on the grid: Late job binding with lightweight user-level overlay

CERN Document Server

Moscicki, J T; Sloot, P M A; Lamanna, M

2011-01-01

Independent observations and everyday user experience indicate that performance and reliability of large grid infrastructures may suffer from large and unpredictable variations. In this paper we study the impact of the job queuing time on processing of moldable tasks which are commonly found in large-scale production grids. We use the mean value and variance of makespan as the quality of service indicators. We develop a general task processing model to provide a quantitative comparison between two models: early and late job binding in a user-level overlay applied to the EGEE Grid infrastructure. We find that the late-binding model effectively defines a transformation of the distribution of makespan according to the Central Limit Theorem. As demonstrated by Monte Carlo simulations using real job traces, this transformation allows to substantially reduce the mean value and variance of makespan. For certain classes of applications task granularity may be adjusted such that a speedup of an order of magnitude or m...

Interventions on central computing services during the weekend of 21 and 22 August

CERN Multimedia

2004-01-01

As part of the planned upgrade of the computer centre infrastructure to meet the LHC computing needs, approximately 150 servers, hosting in particular the NICE home directories, Mail services and Web services, will need to be physically relocated to another part of the computing hall during the weekend of the 21 and 22 August. On Saturday 21 August, starting from 8:30a.m. interruptions of typically 60 minutes will take place on the following central computing services: NICE and the whole Windows infrastructure, Mail services, file services (including home directories and DFS workspaces), Web services, VPN access, Windows Terminal Services. During any interruption, incoming mail from outside CERN will be queued and delivered as soon as the service is operational again. All Services should be available again on Saturday 21 at 17:30 but a few additional interruptions will be possible after that time and on Sunday 22 August. IT Department

ZeroMQ: Messaging Made Simple

CERN Multimedia

CERN. Geneva

2013-01-01

Since its inception in 2007, ZeroMQ has defined a new product category of thin, fast, open source message transports. This little library has now grown into a large, vibrant community of projects tied together with standard protocols and APIs. Applications, written in any language, talk to each other over TCP, multicast, or inproc transports, using a single socket-based API, and a set of "patterns" (pub-sub, request-reply, dealer-router, pipeline). ZeroMQ handles message framing, batching, and I/O, but ignores aspects like serialization and persistence. By focussing on the essentials, and acting as a toolkit rather than a pre-packaged solution, ZeroMQ turns the complex problem of distributed computing into a relatively simple recipe. About the speaker Pieter Hintjens is a writer, programmer, and public speaker who has spent decades building large software systems, organizations, and businesses. He designed the Advanced Message Queuing Protocol (AMQP) in 2006 for JPMorganChase and left ...

EFFICIENCY OF REDUNDANT QUERY EXECUTION IN MULTI-CHANNEL SERVICE SYSTEMS

Directory of Open Access Journals (Sweden)

V. A. Bogatyrev

2016-03-01

Full Text Available Subject of Research.The paper deals with analysis of the effectiveness of redundant queries based on untrusted computing in computer systems, represented by multi-channel queuing systems with a common queue. The objective of research is the possibility of increasing the efficiency of service requests while performing redundant copies of requests in different devices of a multi-channel system under conditions of calculations unreliability. The redundant service of requests requires the infallibility of its implementation at least in one of the devices.Method. We have considered estimation of the average time spent in the system with and without the use of redundant requests at the presentation of a simple queuing model of the M / M / n type to analyze the effectiveness of redundant service of requests. Presented evaluation of the average waiting time in the redundant queries is the upper one, since it ignores the possibility of reducing the average waiting time as a result of the spread of the probability of time querying at different devices. The integrated efficiency of redundant service of requests is defined based on the multiplicative index that takes into account the infallibility of calculations and the average time allowance with respect to the maximum tolerated delay of service. Evaluation of error-free computing at reserved queries is received at the requirement of faultless execution of at least one copy of the request. Main Results. We have shown that the reservation of requests gives the gain in efficiency of the system at low demand rate (load. We have defined the boundaries of expediency (efficiency for redundant service of requests. We have shown the possibility of the effectiveness increasing of the adaptive changes in the multiplicity of the reservation of requests, depending on the intensity of the flow of requests. We have found out that the choice of service discipline in information service systems is largely determined by

Observatory of photovoltaic solar energy in France. Launching of the 19. edition - Quarterly publication, September 2016

International Nuclear Information System (INIS)

2016-09-01

After a brief and synthetic overview of trends regarding solar photovoltaic energy in France and in the World (evolution of the numbers of connections and installations), this publication proposes graphs which illustrate the evolution of the distribution of new electricity production capacities in France, in Europe and in the USA, the evolution of connected photovoltaic power in the different World regions, a comparison of levelized cost of electricity between the different production sources, the evolution of the share of photovoltaic electricity in raw power consumption, the quarterly evolution of the number and power of connected photovoltaic installations between 2008 and 2016, the quarterly evolution of connections and purchase prices for different power ranges (less than 9 kW, 9-100 kW, 100-250 kW, 250 kW-1 MW, more than 1 MW), the evolution of the number and power of queuing projects, the quarterly evolution of solar photovoltaic electricity purchase prices in France, the evolution of the impact on the CSPE (contribution to the electricity public service)

Multi-Resolution Multimedia QoE Models for IPTV Applications

Directory of Open Access Journals (Sweden)

Prasad Calyam

2012-01-01

Full Text Available Internet television (IPTV is rapidly gaining popularity and is being widely deployed in content delivery networks on the Internet. In order to proactively deliver optimum user quality of experience (QoE for IPTV, service providers need to identify network bottlenecks in real time. In this paper, we develop psycho-acoustic-visual models that can predict user QoE of multimedia applications in real time based on online network status measurements. Our models are neural network based and cater to multi-resolution IPTV applications that include QCIF, QVGA, SD, and HD resolutions encoded using popular audio and video codec combinations. On the network side, our models account for jitter and loss levels, as well as router queuing disciplines: packet-ordered and time-ordered FIFO. We evaluate the performance of our multi-resolution multimedia QoE models in terms of prediction characteristics, accuracy, speed, and consistency. Our evaluation results demonstrate that the models are pertinent for real-time QoE monitoring and resource adaptation in IPTV content delivery networks.

The NEST Dry-Run Mode: Efficient Dynamic Analysis of Neuronal Network Simulation Code

Directory of Open Access Journals (Sweden)

Susanne Kunkel

2017-06-01

Full Text Available NEST is a simulator for spiking neuronal networks that commits to a general purpose approach: It allows for high flexibility in the design of network models, and its applications range from small-scale simulations on laptops to brain-scale simulations on supercomputers. Hence, developers need to test their code for various use cases and ensure that changes to code do not impair scalability. However, running a full set of benchmarks on a supercomputer takes up precious compute-time resources and can entail long queuing times. Here, we present the NEST dry-run mode, which enables comprehensive dynamic code analysis without requiring access to high-performance computing facilities. A dry-run simulation is carried out by a single process, which performs all simulation steps except communication as if it was part of a parallel environment with many processes. We show that measurements of memory usage and runtime of neuronal network simulations closely match the corresponding dry-run data. Furthermore, we demonstrate the successful application of the dry-run mode in the areas of profiling and performance modeling.

Automated acquisition and analysis of small angle X-ray scattering data

International Nuclear Information System (INIS)

Franke, Daniel; Kikhney, Alexey G.; Svergun, Dmitri I.

2012-01-01

Small Angle X-ray Scattering (SAXS) is a powerful tool in the study of biological macromolecules providing information about the shape, conformation, assembly and folding states in solution. Recent advances in robotic fluid handling make it possible to perform automated high throughput experiments including fast screening of solution conditions, measurement of structural responses to ligand binding, changes in temperature or chemical modifications. Here, an approach to full automation of SAXS data acquisition and data analysis is presented, which advances automated experiments to the level of a routine tool suitable for large scale structural studies. The approach links automated sample loading, primary data reduction and further processing, facilitating queuing of multiple samples for subsequent measurement and analysis and providing means of remote experiment control. The system was implemented and comprehensively tested in user operation at the BioSAXS beamlines X33 and P12 of EMBL at the DORIS and PETRA storage rings of DESY, Hamburg, respectively, but is also easily applicable to other SAXS stations due to its modular design.

1-800-CALL-H.E.P. -- Experiences on a voice-over-IP test bed

International Nuclear Information System (INIS)

Matthews, W.

2000-01-01

Highly interactive Internet applications such as Voice-over-IP are extremely sensitive to network performance. Even on high performance research networks, many cases will require the use of differentiated services to achieve high (toll) quality conversations. In this talk the authors will describe a test bed over the Energy Sciences network (ESnet) between Lawrence Berkeley National Laboratory (LBNL), Stanford Linear Accelerator Center (SLAC), Argonne National Laboratory (ANL) and Sandia National Laboratory (Sandia). In particular the characteristics of Voice-over-IP calls between LBNL and SLAC will be reviewed and the effect of low, moderate and high congestion on the link will be quantified. The use of Per Hop Behavior (PHB) in IP headers with Weighted Fair Queuing (WFQ) in routers and the benefit they provide will be explained. A model of flows and performance will be presented and new techniques to predict the quality of calls are under development and will be reviewed. Comparisons with telephone reliability will be discussed and the feasibility of wide spread deployment of VoIP in HEP will be considered

An efficiency improvement in warehouse operation using simulation analysis

Science.gov (United States)

Samattapapong, N.

2017-11-01

In general, industry requires an efficient system for warehouse operation. There are many important factors that must be considered when designing an efficient warehouse system. The most important is an effective warehouse operation system that can help transfer raw material, reduce costs and support transportation. By all these factors, researchers are interested in studying about work systems and warehouse distribution. We start by collecting the important data for storage, such as the information on products, information on size and location, information on data collection and information on production, and all this information to build simulation model in Flexsim® simulation software. The result for simulation analysis found that the conveyor belt was a bottleneck in the warehouse operation. Therefore, many scenarios to improve that problem were generated and testing through simulation analysis process. The result showed that an average queuing time was reduced from 89.8% to 48.7% and the ability in transporting the product increased from 10.2% to 50.9%. Thus, it can be stated that this is the best method for increasing efficiency in the warehouse operation.

Generating a Corpus of Mobile Forensic Images for Masquerading user Experimentation.

Science.gov (United States)

Guido, Mark; Brooks, Marc; Grover, Justin; Katz, Eric; Ondricek, Jared; Rogers, Marcus; Sharpe, Lauren

2016-11-01

The Periodic Mobile Forensics (PMF) system investigates user behavior on mobile devices. It applies forensic techniques to an enterprise mobile infrastructure, utilizing an on-device agent named TractorBeam. The agent collects changed storage locations for later acquisition, reconstruction, and analysis. TractorBeam provides its data to an enterprise infrastructure that consists of a cloud-based queuing service, relational database, and analytical framework for running forensic processes. During a 3-month experiment with Purdue University, TractorBeam was utilized in a simulated operational setting across 34 users to evaluate techniques to identify masquerading users (i.e., users other than the intended device user). The research team surmises that all masqueraders are undesirable to an enterprise, even when a masquerader lacks malicious intent. The PMF system reconstructed 821 forensic images, extracted one million audit events, and accurately detected masqueraders. Evaluation revealed that developed methods reduced storage requirements 50-fold. This paper describes the PMF architecture, performance of TractorBeam throughout the protocol, and results of the masquerading user analysis. © 2016 American Academy of Forensic Sciences.

MOCAT: a metagenomics assembly and gene prediction toolkit.

Science.gov (United States)

Kultima, Jens Roat; Sunagawa, Shinichi; Li, Junhua; Chen, Weineng; Chen, Hua; Mende, Daniel R; Arumugam, Manimozhiyan; Pan, Qi; Liu, Binghang; Qin, Junjie; Wang, Jun; Bork, Peer

2012-01-01

MOCAT is a highly configurable, modular pipeline for fast, standardized processing of single or paired-end sequencing data generated by the Illumina platform. The pipeline uses state-of-the-art programs to quality control, map, and assemble reads from metagenomic samples sequenced at a depth of several billion base pairs, and predict protein-coding genes on assembled metagenomes. Mapping against reference databases allows for read extraction or removal, as well as abundance calculations. Relevant statistics for each processing step can be summarized into multi-sheet Excel documents and queryable SQL databases. MOCAT runs on UNIX machines and integrates seamlessly with the SGE and PBS queuing systems, commonly used to process large datasets. The open source code and modular architecture allow users to modify or exchange the programs that are utilized in the various processing steps. Individual processing steps and parameters were benchmarked and tested on artificial, real, and simulated metagenomes resulting in an improvement of selected quality metrics. MOCAT can be freely downloaded at http://www.bork.embl.de/mocat/.

MOCAT: a metagenomics assembly and gene prediction toolkit.

Directory of Open Access Journals (Sweden)

Jens Roat Kultima

Full Text Available MOCAT is a highly configurable, modular pipeline for fast, standardized processing of single or paired-end sequencing data generated by the Illumina platform. The pipeline uses state-of-the-art programs to quality control, map, and assemble reads from metagenomic samples sequenced at a depth of several billion base pairs, and predict protein-coding genes on assembled metagenomes. Mapping against reference databases allows for read extraction or removal, as well as abundance calculations. Relevant statistics for each processing step can be summarized into multi-sheet Excel documents and queryable SQL databases. MOCAT runs on UNIX machines and integrates seamlessly with the SGE and PBS queuing systems, commonly used to process large datasets. The open source code and modular architecture allow users to modify or exchange the programs that are utilized in the various processing steps. Individual processing steps and parameters were benchmarked and tested on artificial, real, and simulated metagenomes resulting in an improvement of selected quality metrics. MOCAT can be freely downloaded at http://www.bork.embl.de/mocat/.

A framework for improving access and customer service times in health care: application and analysis at the UCLA Medical Center.

Science.gov (United States)

Duda, Catherine; Rajaram, Kumar; Barz, Christiane; Rosenthal, J Thomas

2013-01-01

There has been an increasing emphasis on health care efficiency and costs and on improving quality in health care settings such as hospitals or clinics. However, there has not been sufficient work on methods of improving access and customer service times in health care settings. The study develops a framework for improving access and customer service time for health care settings. In the framework, the operational concept of the bottleneck is synthesized with queuing theory to improve access and reduce customer service times without reduction in clinical quality. The framework is applied at the Ronald Reagan UCLA Medical Center to determine the drivers for access and customer service times and then provides guidelines on how to improve these drivers. Validation using simulation techniques shows significant potential for reducing customer service times and increasing access at this institution. Finally, the study provides several practice implications that could be used to improve access and customer service times without reduction in clinical quality across a range of health care settings from large hospitals to small community clinics.

Role of optimization in the human dynamics of task execution

Science.gov (United States)

Cajueiro, Daniel O.; Maldonado, Wilfredo L.

2008-03-01

In order to explain the empirical evidence that the dynamics of human activity may not be well modeled by Poisson processes, a model based on queuing processes was built in the literature [A. L. Barabasi, Nature (London) 435, 207 (2005)]. The main assumption behind that model is that people execute their tasks based on a protocol that first executes the high priority item. In this context, the purpose of this paper is to analyze the validity of that hypothesis assuming that people are rational agents that make their decisions in order to minimize the cost of keeping nonexecuted tasks on the list. Therefore, we build and analytically solve a dynamic programming model with two priority types of tasks and show that the validity of this hypothesis depends strongly on the structure of the instantaneous costs that a person has to face if a given task is kept on the list for more than one period. Moreover, one interesting finding is that in one of the situations the protocol used to execute the tasks generates complex one-dimensional dynamics.

Concept definition of traffic flow wide-area surveillance

Energy Technology Data Exchange (ETDEWEB)

Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.

1994-07-01

Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret large spatial projections of data originating from multiple sensor suites. The intent of the Wide-Area Surveillance (WAS) Project is to build upon this concept and define the operational specifications and characteristics of a Traffic Flow Wide-Area Surveillance (TFWAS) system in terms of traffic management and control. In doing so, the functional capabilities of a TFWAS will be mapped onto an operational profile that is consistent with the Federal Highway Administration`s Intelligent Vehicle Highway System. This document provides the underlying foundation of this work by offering a concept definition for the TFWAS system. It concentrates on answering the question: ``What is the system?`` In doing so, the report develops a hierarchy of specialized definitions.

Ethical considerations in resource allocation in a cochlear implant program.

Science.gov (United States)

Westerberg, Brian D; Pijl, Sipke; McDonald, Michael

2008-04-01

To review processes of resource allocation and the ethical considerations relevant to the fair allocation of a limited number of cochlear implants to increasing numbers of potential recipients. Review of relevant considerations. Tertiary referral hospital. Editorial discussion of the ethical issues of resource allocation. Heterogeneity of audiometric thresholds, self-reported disability of hearing loss, age of the potential cochlear implant recipient, cost-effectiveness, access to resources, compliance with follow-up, social support available to the recipient, social consequences of hearing impairment, and other recipient-related factors. In a publicly funded health care system, there will always be a need for decision-making processes for allocation of finite fiscal resources. All candidates for cochlear implantation deserve fair consideration. However, they are a heterogeneous group in terms of needs and expected outcomes consisting of traditional and marginal candidates, with a wide range of benefit from acoustic amplification. We argue that implant programs should thoughtfully prioritize treatment on the basis of need and potential benefit. We reject queuing on the basis of "first-come, first-served" or on the basis of perceived social worth.

Implementation of the data acquisition system for the Overlap Modular Track Finder in the CMS experiment

CERN Document Server

Zabolotny, Wojciech; Bunkowski, Karol; Byszuk, Adrian Pawel; Dobosz, Jakub; Doroba, Krzysztof; Pawel Drabik; Gorski, Maciej; Kalinowski, Artur; Kierzkowski, Krzysztof Zdzislaw; Konecki, Marcin Andrzej; Oklinski, Wojciech; Olszewski, Michal; Pozniak, Krzysztof Tadeusz; Zawistowski, Krystian

2017-01-01

The CMS experiment is currently undergoing the upgrade of its trigger, including the Level-1 muon trigger. In the barrel-endcap transition region the Overlap Muon Track Finder (OMTF) combines data from three types of detectors (RPC, DT, and CSC) to find the muon candidates.To monitor the operation of the OMTF, it is important to receive the data which were the basis for the trigger decision. This task must be performed by the Data Acquisition (OMTF DAQ) system.The new MTCA technology applied in the updated trigger allows implementation of the OMTF DAQ together with the OMTF trigger in the MTF7 board. Further concentration of data is performed by standard AMC13 boards.The proposed data concentration methodology assumes parallel filtering and queuing of data arriving from all input links (24 RPC, 30 CSC, and 6 DT). The data are waiting for the trigger decision in the input buffers. The triggered data are then converted into the intermediate 72-bit format and put into the sorter queues. The block responsible for...

Networks for Autonomous Formation Flying Satellite Systems

Science.gov (United States)

Knoblock, Eric J.; Konangi, Vijay K.; Wallett, Thomas M.; Bhasin, Kul B.

2001-01-01

The performance of three communications networks to support autonomous multi-spacecraft formation flying systems is presented. All systems are comprised of a ten-satellite formation arranged in a star topology, with one of the satellites designated as the central or "mother ship." All data is routed through the mother ship to the terrestrial network. The first system uses a TCP/lP over ATM protocol architecture within the formation the second system uses the IEEE 802.11 protocol architecture within the formation and the last system uses both of the previous architectures with a constellation of geosynchronous satellites serving as an intermediate point-of-contact between the formation and the terrestrial network. The simulations consist of file transfers using either the File Transfer Protocol (FTP) or the Simple Automatic File Exchange (SAFE) Protocol. The results compare the IF queuing delay, and IP processing delay at the mother ship as well as application-level round-trip time for both systems, In all cases, using IEEE 802.11 within the formation yields less delay. Also, the throughput exhibited by SAFE is better than FTP.

Latent heat of traffic moving from rest

Science.gov (United States)

Farzad Ahmadi, S.; Berrier, Austin S.; Doty, William M.; Greer, Pat G.; Habibi, Mohammad; Morgan, Hunter A.; Waterman, Josam H. C.; Abaid, Nicole; Boreyko, Jonathan B.

2017-11-01

Contrary to traditional thinking and driver intuition, here we show that there is no benefit to ground vehicles increasing their packing density at stoppages. By systematically controlling the packing density of vehicles queued at a traffic light on a Smart Road, drone footage revealed that the benefit of an initial increase in displacement for close-packed vehicles is completely offset by the lag time inherent to changing back into a ‘liquid phase’ when flow resumes. This lag is analogous to the thermodynamic concept of the latent heat of fusion, as the ‘temperature’ (kinetic energy) of the vehicles cannot increase until the traffic ‘melts’ into the liquid phase. These findings suggest that in situations where gridlock is not an issue, drivers should not decrease their spacing during stoppages in order to lessen the likelihood of collisions with no loss in flow efficiency. In contrast, motion capture experiments of a line of people walking from rest showed higher flow efficiency with increased packing densities, indicating that the importance of latent heat becomes trivial for slower moving systems.

Definition, modeling and simulation of a grid computing system for high throughput computing

CERN Document Server

Caron, E; Tsaregorodtsev, A Yu

2006-01-01

In this paper, we study and compare grid and global computing systems and outline the benefits of having an hybrid system called dirac. To evaluate the dirac scheduling for high throughput computing, a new model is presented and a simulator was developed for many clusters of heterogeneous nodes belonging to a local network. These clusters are assumed to be connected to each other through a global network and each cluster is managed via a local scheduler which is shared by many users. We validate our simulator by comparing the experimental and analytical results of a M/M/4 queuing system. Next, we do the comparison with a real batch system and we obtain an average error of 10.5% for the response time and 12% for the makespan. We conclude that the simulator is realistic and well describes the behaviour of a large-scale system. Thus we can study the scheduling of our system called dirac in a high throughput context. We justify our decentralized, adaptive and oppor! tunistic approach in comparison to a centralize...

Traffic flow model at fixed control signals with discrete service time distribution

Directory of Open Access Journals (Sweden)

Lucky I. Igbinosun

2016-04-01

Full Text Available Most of the models of road traffic flow at fixed-cycle controlled intersection assume stationary distributions and provide steady state results. The assumption that a constant number of vehicles can leave the system during the green phase is unrealistic in real life situations. A discrete time queuing model was developed to describe the operation of traffic flow at a road intersection with fixed-cycle signalized control and to account for the randomness in the number of vehicles that can leave the system. The results show the expected queue size in the system when the traffic is light and for a busy period, respectively. For the light period, when the traffic intensity is less than one, it takes a shorter green cycle time for vehicles to clear up than during high traffic intensity (the road junction is saturated. Increasing the number of cars that can leave the junction at the turn of the green phase reduces the number of cycle times before the queue is cleared.

OPTIMISATION OF BUFFER SIZE FOR ENHANCING QOS OF VIDEO TRAFFIC USING CROSS LAYERED HYBRID TRANSPORT LAYER PROTOCOL APPROACH

Directory of Open Access Journals (Sweden)

S. Matilda

2011-03-01

Full Text Available Video streaming is gaining importance, with the wide popularity of multimedia rich applications in the Internet. Video streams are delay sensitive and require seamless flow for continuous visualization. Properly designed buffers offer a solution to queuing delay. The diagonally opposite QoS metrics associated with video traffic poses an optimization problem, in the design of buffers. This paper is a continuation of our previous work [1] and deals with the design of buffers. It aims at finding the optimum buffer size for enhancing QoS offered to video traffic. Network-centric QoS provisioning approach, along with hybrid transport layer protocol approach is adopted, to arrive at an optimum size which is independent of RTT. In this combinational approach, buffers of routers and end devices are designed to satisfy the various QoS parameters at the transport layer. OPNET Modeler is used to simulate environments for testing the design. Based on the results of simulation it is evident that the hybrid transport layer protocol approach is best suited for transmitting video traffic as it supports the economical design.

Improving Precision and Reducing Runtime of Microscopic Traffic Simulators through Stratified Sampling

Directory of Open Access Journals (Sweden)

Khewal Bhupendra Kesur

2013-01-01

Full Text Available This paper examines the application of Latin Hypercube Sampling (LHS and Antithetic Variables (AVs to reduce the variance of estimated performance measures from microscopic traffic simulators. LHS and AV allow for a more representative coverage of input probability distributions through stratification, reducing the standard error of simulation outputs. Two methods of implementation are examined, one where stratification is applied to headways and routing decisions of individual vehicles and another where vehicle counts and entry times are more evenly sampled. The proposed methods have wider applicability in general queuing systems. LHS is found to outperform AV, and reductions of up to 71% in the standard error of estimates of traffic network performance relative to independent sampling are obtained. LHS allows for a reduction in the execution time of computationally expensive microscopic traffic simulators as fewer simulations are required to achieve a fixed level of precision with reductions of up to 84% in computing time noted on the test cases considered. The benefits of LHS are amplified for more congested networks and as the required level of precision increases.

Feasibility Study of 8-Bit Microcontroller Applications for Ethernet

Directory of Open Access Journals (Sweden)

Lech Gulbinovič

2011-08-01

Full Text Available Feasibility study of 8-bit microcontroller applications for Ethernet is presented. Designed device is based on ATmega32 microcontroller and 10 Mbps Ethernet controller ENC28J60. Device is simulated as mass queuing theoretical model with ticket booking counter. Practical explorations are accomplished and characteristics are determined. Practical results are compared to theoretical ones. Program code and device packet processing speed optimization are discussed. Microcontroller packet processing speed and packet latency depend on packet size. For ICMP protocol packet processing speed varies 1.4–2.1 Mbps, latency – 0.8–8.4 ms. UDP protocol packet processing speed varies 1.3–1.8 Mbps, latency – 1.1–9.6 ms. Packet processing speed depends on compilation settings and program code compression level. Best results are reached on optimization le­vel ‑O3, then speed increased ~3% but program code size increased 68% comparing to –Os optimization level.Article in Lithuanian

Understanding the heavy-tailed dynamics in human behavior

Science.gov (United States)

Ross, Gordon J.; Jones, Tim

2015-06-01

The recent availability of electronic data sets containing large volumes of communication data has made it possible to study human behavior on a larger scale than ever before. From this, it has been discovered that across a diverse range of data sets, the interevent times between consecutive communication events obey heavy-tailed power law dynamics. Explaining this has proved controversial, and two distinct hypotheses have emerged. The first holds that these power laws are fundamental, and arise from the mechanisms such as priority queuing that humans use to schedule tasks. The second holds that they are statistical artifacts which only occur in aggregated data when features such as circadian rhythms and burstiness are ignored. We use a large social media data set to test these hypotheses, and find that although models that incorporate circadian rhythms and burstiness do explain part of the observed heavy tails, there is residual unexplained heavy-tail behavior which suggests a more fundamental cause. Based on this, we develop a quantitative model of human behavior which improves on existing approaches and gives insight into the mechanisms underlying human interactions.

Analyzing and Comparing Biomass Feedstock Supply Systems in China: Corn Stover and Sweet Sorghum Case Studies

Directory of Open Access Journals (Sweden)

Lantian Ren

2015-06-01

Full Text Available This paper analyzes the rural Chinese biomass supply system and models supply chain operations according to U.S. concepts of logistical unit operations: harvest and collection, storage, transportation, preprocessing, and handling and queuing. In this paper, we quantify the logistics cost of corn stover and sweet sorghum in China under different scenarios. We analyze three scenarios of corn stover logistics from northeast China and three scenarios of sweet sorghum stalks logistics from Inner Mongolia in China. The case study estimates that the logistics cost of corn stover and sweet sorghum stalk to be $52.95/dry metric ton and $52.64/dry metric ton, respectively, for the current labor-based biomass logistics system. However, if the feedstock logistics operation is mechanized, the cost of corn stover and sweet sorghum stalk decreases to $36.01/dry metric ton and $35.76/dry metric ton, respectively. The study also includes a sensitivity analysis to identify the cost factors that cause logistics cost variation. Results of the sensitivity analysis show that labor price has the most influence on the logistics cost of corn stover and sweet sorghum stalk, with a variation of $6 to $12/dry metric ton.

Performance Evaluation Model for Application Layer Firewalls.

Science.gov (United States)

Xuan, Shichang; Yang, Wu; Dong, Hui; Zhang, Jiangchuan

2016-01-01

Application layer firewalls protect the trusted area network against information security risks. However, firewall performance may affect user experience. Therefore, performance analysis plays a significant role in the evaluation of application layer firewalls. This paper presents an analytic model of the application layer firewall, based on a system analysis to evaluate the capability of the firewall. In order to enable users to improve the performance of the application layer firewall with limited resources, resource allocation was evaluated to obtain the optimal resource allocation scheme in terms of throughput, delay, and packet loss rate. The proposed model employs the Erlangian queuing model to analyze the performance parameters of the system with regard to the three layers (network, transport, and application layers). Then, the analysis results of all the layers are combined to obtain the overall system performance indicators. A discrete event simulation method was used to evaluate the proposed model. Finally, limited service desk resources were allocated to obtain the values of the performance indicators under different resource allocation scenarios in order to determine the optimal allocation scheme. Under limited resource allocation, this scheme enables users to maximize the performance of the application layer firewall.

Decentralized Hypothesis Testing in Energy Harvesting Wireless Sensor Networks

Science.gov (United States)

Tarighati, Alla; Gross, James; Jalden, Joakim

2017-09-01

We consider the problem of decentralized hypothesis testing in a network of energy harvesting sensors, where sensors make noisy observations of a phenomenon and send quantized information about the phenomenon towards a fusion center. The fusion center makes a decision about the present hypothesis using the aggregate received data during a time interval. We explicitly consider a scenario under which the messages are sent through parallel access channels towards the fusion center. To avoid limited lifetime issues, we assume each sensor is capable of harvesting all the energy it needs for the communication from the environment. Each sensor has an energy buffer (battery) to save its harvested energy for use in other time intervals. Our key contribution is to formulate the problem of decentralized detection in a sensor network with energy harvesting devices. Our analysis is based on a queuing-theoretic model for the battery and we propose a sensor decision design method by considering long term energy management at the sensors. We show how the performance of the system changes for different battery capacities. We then numerically show how our findings can be used in the design of sensor networks with energy harvesting sensors.

Study on the Calculation Models of Bus Delay at Bays Using Queueing Theory and Markov Chain

Directory of Open Access Journals (Sweden)

Feng Sun

2015-01-01

Full Text Available Traffic congestion at bus bays has decreased the service efficiency of public transit seriously in China, so it is crucial to systematically study its theory and methods. However, the existing studies lack theoretical model on computing efficiency. Therefore, the calculation models of bus delay at bays are studied. Firstly, the process that buses are delayed at bays is analyzed, and it was found that the delay can be divided into entering delay and exiting delay. Secondly, the queueing models of bus bays are formed, and the equilibrium distribution functions are proposed by applying the embedded Markov chain to the traditional model of queuing theory in the steady state; then the calculation models of entering delay are derived at bays. Thirdly, the exiting delay is studied by using the queueing theory and the gap acceptance theory. Finally, the proposed models are validated using field-measured data, and then the influencing factors are discussed. With these models the delay is easily assessed knowing the characteristics of the dwell time distribution and traffic volume at the curb lane in different locations and different periods. It can provide basis for the efficiency evaluation of bus bays.

DROP TAIL AND RED QUEUE MANAGEMENT WITH SMALL BUFFERS:STABILITY AND HOPF BIFURCATION

Directory of Open Access Journals (Sweden)

Ganesh Patil

2011-06-01

Full Text Available There are many factors that are important in the design of queue management schemes for routers in the Internet: for example, queuing delay, link utilization, packet loss, energy consumption and the impact of router buffer size. By considering a fluid model for the congestion avoidance phase of Additive Increase Multiplicative Decrease (AIMD TCP, in a small buffer regime, we argue that stability should also be a desirable feature for network performance. The queue management schemes we study are Drop Tail and Random Early Detection (RED. For Drop Tail, the analytical arguments are based on local stability and bifurcation theory. As the buffer size acts as a bifurcation parameter, variations in it can readily lead to the emergence of limit cycles. We then present NS2 simulations to study the effect of changing buffer size on queue dynamics, utilization, window size and packet loss for three different flow scenarios. The simulations corroborate the analysis which highlights that performance is coupled with the notion of stability. Our work suggests that, in a small buffer regime, a simple Drop Tail queue management serves to enhance stability and appears preferable to the much studied RED scheme.

Highball: A high speed, reserved-access, wide area network

Science.gov (United States)

Mills, David L.; Boncelet, Charles G.; Elias, John G.; Schragger, Paul A.; Jackson, Alden W.

1990-01-01

A network architecture called Highball and a preliminary design for a prototype, wide-area data network designed to operate at speeds of 1 Gbps and beyond are described. It is intended for applications requiring high speed burst transmissions where some latency between requesting a transmission and granting the request can be anticipated and tolerated. Examples include real-time video and disk-disk transfers, national filestore access, remote sensing, and similar applications. The network nodes include an intelligent crossbar switch, but have no buffering capabilities; thus, data must be queued at the end nodes. There are no restrictions on the network topology, link speeds, or end-end protocols. The end system, nodes, and links can operate at any speed up to the limits imposed by the physical facilities. An overview of an initial design approach is presented and is intended as a benchmark upon which a detailed design can be developed. It describes the network architecture and proposed access protocols, as well as functional descriptions of the hardware and software components that could be used in a prototype implementation. It concludes with a discussion of additional issues to be resolved in continuing stages of this project.

Automated observatory in Antarctica: real-time data transfer on constrained networks in practice

Science.gov (United States)

Bracke, Stephan; Gonsette, Alexandre; Rasson, Jean; Poncelet, Antoine; Hendrickx, Olivier

2017-08-01

In 2013 a project was started by the geophysical centre in Dourbes to install a fully automated magnetic observatory in Antarctica. This isolated place comes with specific requirements: unmanned station during 6 months, low temperatures with extreme values down to -50 °C, minimum power consumption and satellite bandwidth limited to 56 Kbit s-1. The ultimate aim is to transfer real-time magnetic data every second: vector data from a LEMI-25 vector magnetometer, absolute F measurements from a GEM Systems scalar proton magnetometer and absolute magnetic inclination-declination (DI) measurements (five times a day) with an automated DI-fluxgate magnetometer. Traditional file transfer protocols (for instance File Transfer Protocol (FTP), email, rsync) show severe limitations when it comes to real-time capability. After evaluation of pro and cons of the available real-time Internet of things (IoT) protocols and seismic software solutions, we chose to use Message Queuing Telemetry Transport (MQTT) and receive the 1 s data with a negligible latency cost and no loss of data. Each individual instrument sends the magnetic data immediately after capturing, and the data arrive approximately 300 ms after being sent, which corresponds with the normal satellite latency.

UNC SKYNET adds NRAO 20m Radio Telescope: Dynamic Research and Funding

Science.gov (United States)

Langston, Glen; Hosmer, L.; Heatherly, S.; Towner, A. P.; Reichart, D.; Haipslip, J.

2013-01-01

The University of North Carolina (UNC) and NRAO have teamed up to deliver dynamic, realtime optical and Radio observations of the universe, using the web-based SKYNET queuing system developed at UNC. A 20m telescope is outfitted with cryogenically cooled receivers and a reprogrammable spectrometer. To get started see: http://www.gb.nrao.edu/20m/fantastic/ for connections to the observing system, educational activities and opportunities to purchase observing time. The SKYNET goal is to provide the finest research tools to high schools, colleges and independent researchers. This is accomplished through the capabilities to use existing observing modes and through reprogram the University of California, Berkeley's Field Programmable Gate Array (FPGA) systems for custom digital hardware development. This provides a door for engineering and computer science students to create real-time, high capability data acquisition and processing tools. We will demo the 20m observing system and its capabilities. The NSF funded this construction project with the goal of making the network self funding. We are looking for collaborators with targeted research projects wanting to take advantage of the powerful observing tools.

About influence of input rate random part of nonstationary queue system on statistical estimates of its macroscopic indicators

Science.gov (United States)

Korelin, Ivan A.; Porshnev, Sergey V.

2018-05-01

A model of the non-stationary queuing system (NQS) is described. The input of this model receives a flow of requests with input rate λ = λdet (t) + λrnd (t), where λdet (t) is a deterministic function depending on time; λrnd (t) is a random function. The parameters of functions λdet (t), λrnd (t) were identified on the basis of statistical information on visitor flows collected from various Russian football stadiums. The statistical modeling of NQS is carried out and the average statistical dependences are obtained: the length of the queue of requests waiting for service, the average wait time for the service, the number of visitors entered to the stadium on the time. It is shown that these dependencies can be characterized by the following parameters: the number of visitors who entered at the time of the match; time required to service all incoming visitors; the maximum value; the argument value when the studied dependence reaches its maximum value. The dependences of these parameters on the energy ratio of the deterministic and random component of the input rate are investigated.

The follow-up time issue on small roundabouts

Directory of Open Access Journals (Sweden)

Janusz WOCH

2008-01-01

Full Text Available The follow-up time was investigated. The aim of this analysis was to create a formula that allows the follow-up time calculated using the most important external parameters. The studies were based on empirical data collected at small roundabouts localized on Upper Silesia. The follow-up time is the average time gap between two cars of the minor stream being queued and entered the same major stream gap one behind the other. Follow-up times were measured directly by observing traffic flow. Resulting follow-up times were analyzed to determine their dependence on parameters such as intersection layout, roundabouts diameter and left visibility. These parameters were tested using the conventional calculation method (regression analysis. The dependence of follow-up time was then integrated into the own capacity estimation method for small roundabouts localized on urban areas. One of the biggest advantages this dependence is that capacity and traffic flow on small roundabouts can be determined reliably and appropriately for actual situations. The new follow-up time values for all range of external diameters of small roundabout 26 (22 – 40 m have been presented in this article.

Reinventing Emergency Department Flow via Healthcare Delivery Science.

Science.gov (United States)

DeFlitch, Christopher; Geeting, Glenn; Paz, Harold L

2015-01-01

Healthcare system flow resulting in emergency departments (EDs) crowding is a quality and access problem. This case study examines an overcrowded academic health center ED with increasing patient volumes and limited physical space for expansion. ED capacity and efficiency improved via engineering principles application, addressing patient and staffing flows, and reinventing the delivery model. Using operational data and staff input, patient and staff flow models were created, identifying bottlenecks (points of inefficiency). A new flow model of emergency care delivery, physician-directed queuing, was developed. Expanding upon physicians in triage, providers passively evaluate all patients upon arrival, actively manage patients requiring fewer resources, and direct patients requiring complex resources to further evaluation in ED areas. Sustained over time, ED efficiency improved as measured by near elimination of "left without being seen" patients and waiting times with improvement in door to doctor, patient satisfaction, and total length of stay. All improvements were in the setting on increased patient volume and no increase in physician staffing. Our experience suggests that practical application of healthcare delivery science can be used to improve ED efficiency. © The Author(s) 2015.

Real-Time Data Processing in the muon system of the D0 detector

International Nuclear Information System (INIS)

Neeti Parashar et al.

2001-01-01

This paper presents a real-time application of the 16-bit fixed point Digital Signal Processors (DSPs), in the Muon System of the D0 detector located at the Fermilab Tevatron, presently the world's highest-energy hadron collider. As part of the Upgrade for a run beginning in the year 2000, the system is required to process data at an input event rate of 10 KHz without incurring significant deadtime in readout. The ADSP21csp01 processor has high I/O bandwidth, single cycle instruction execution and fast task switching support to provide efficient multisignal processing. The processor's internal memory consists of 4K words of Program Memory and 4K words of Data Memory. In addition there is an external memory of 32K words for general event buffering and 16K words of Dual port Memory for input data queuing. This DSP fulfills the requirement of the Muon subdetector systems for data readout. All error handling, buffering, formatting and transferring of the data to the various trigger levels of the data acquisition system is done in software. The algorithms developed for the system complete these tasks in about 20 micros per event

Commute Equilibrium for Mixed Networks with Autonomous Vehicles and Traditional Vehicles

Directory of Open Access Journals (Sweden)

Yangbeibei Ji

2017-01-01

Full Text Available Recent development of autonomous vehicle (AV provides new travel opportunities for citizens, and traditional vehicles (TVs will still be used for a long time. Therefore, it is highly possible that both AVs and TVs will be used as travel modes in a city. In a transportation system with both AVs and TVs, the traffic pattern is worthy of studying. This paper investigates user equilibrium traffic pattern based on the traditional bottleneck model considering AVs and TVs. For both TVs and AVs, travel costs include queuing delay and schedule delay. However, they also have different components of travel costs; more specifically, for AVs, passengers have to pay a riding fare, and, for TVs, travelers encounter a walking time cost after parking their cars. For different combinations of travel demands and riding fare of AVs, analytical solutions of three different user equilibrium traffic patterns are obtained. Finally, numerical examples are provided to demonstrate the usefulness of the analytical models. Sensitivity analyses are examined to show the impacts of AV’s time-dependent fee and trip-based fixed fee on the traffic pattern and travel costs.

A Comparative Numerical Study of the Spectral Theory Approach of Nishimura and the Roots Method Based on the Analysis of BDMMAP/G/1 Queue

Directory of Open Access Journals (Sweden)

Arunava Maity

2015-01-01

Full Text Available This paper considers an infinite-buffer queuing system with birth-death modulated Markovian arrival process (BDMMAP with arbitrary service time distribution. BDMMAP is an excellent representation of the arrival process, where the fractal behavior such as burstiness, correlation, and self-similarity is observed, for example, in ethernet LAN traffic systems. This model was first apprised by Nishimura (2003, and to analyze it, he proposed a twofold spectral theory approach. It seems from the investigations that Nishimura’s approach is tedious and difficult to employ for practical purposes. The objective of this paper is to analyze the same model with an alternative methodology proposed by Chaudhry et al. (2013 (to be referred to as CGG method. The CGG method appears to be rather simple, mathematically tractable, and easy to implement as compared to Nishimura’s approach. The Achilles tendon of the CGG method is the roots of the characteristic equation associated with the probability generating function (pgf of the queue length distribution, which absolves any eigenvalue algebra and iterative analysis. Both the methods are presented in stepwise manner for easy accessibility, followed by some illustrative examples in accordance with the context.

AVAILABILITY RESEARCH OF REMOTE DEVICES FOR WIRELESS NETWORKS

Directory of Open Access Journals (Sweden)

N. A. Bazhayev

2016-05-01

Full Text Available We consider the wireless network under attack, aimed at "broadcast storm" initiation, in order to determine the availability of stand-alone units and the ability to carry out their functional tasks under information exposure. We determine a set of conditions for such type of attacks on the part of potential information interloper. The functional analysis of the systems based on wireless technology is made. We examine the remote device of a self-organizing wireless network as a queuing system M/M/1/n. Model dependencies are shown for normal system performance and at information exposure on the part of potential information interloper. Analytical simulation of wireless network functioning is carried out in the normal mode and under the attack aimed at "broadcast storm" initiation. An experiment is described which provides statistical information on operation of network remote devices. We present experiment results on carrying out attack at typical system transferring data by broabcast net scanning package at different noise intensities on the part of information interloper. The proposed model can be used to determine the technical characteristics of wireless ad-hoc network, develop recommendations for node configuration, aimed at countering "broadcast storm".

Performance Evaluation Model for Application Layer Firewalls.

Directory of Open Access Journals (Sweden)

Shichang Xuan

Full Text Available Application layer firewalls protect the trusted area network against information security risks. However, firewall performance may affect user experience. Therefore, performance analysis plays a significant role in the evaluation of application layer firewalls. This paper presents an analytic model of the application layer firewall, based on a system analysis to evaluate the capability of the firewall. In order to enable users to improve the performance of the application layer firewall with limited resources, resource allocation was evaluated to obtain the optimal resource allocation scheme in terms of throughput, delay, and packet loss rate. The proposed model employs the Erlangian queuing model to analyze the performance parameters of the system with regard to the three layers (network, transport, and application layers. Then, the analysis results of all the layers are combined to obtain the overall system performance indicators. A discrete event simulation method was used to evaluate the proposed model. Finally, limited service desk resources were allocated to obtain the values of the performance indicators under different resource allocation scenarios in order to determine the optimal allocation scheme. Under limited resource allocation, this scheme enables users to maximize the performance of the application layer firewall.

Abstract Description of Internet Traffic of Generalized Cauchy Type

Directory of Open Access Journals (Sweden)

Ming Li

2012-01-01

. Therefore, there is a limitation for fGn to accurately model traffic. Recently, the generalized Cauchy (GC process was introduced to model traffic with the flexibility to separately measure the fractal dimension DGC and the Hurst parameter HGC of traffic. However, there is a fundamental problem whether or not there exists the generality that the GC model is more conformable with real traffic than single parameter models, such as fGn, irrelevant of traffic traces used in experimental verification. The solution to that problem remains unknown but is desired for model evaluation in traffic theory or for model selection against specific issues, such as queuing analysis relating to the autocorrelation function (ACF of arrival traffic. The key contribution of this paper is our solution to that fundamental problem (see Theorem 3.17 with the following features in analysis. (i Set-valued analysis of the traffic of the fGn type. (ii Set-valued analysis of the traffic of the GC type. (iii Revealing the generality previously mentioned by comparing metrics of the traffic of the fGn type to that of the GC type.

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

Science.gov (United States)

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.

A spatiotemporal model for the LTE uplink: Spatially interacting tandem queues approach

KAUST Repository

Gharbieh, Mohammad

2017-07-31

With the proliferation of the Internet-of-things (IoT), there is an undeniable consensus that cellular LTE networks will have to support a dramatically larger number of uplink connections. This is true since most of the devices to be added incur machine-type communications which is dominantly upstream. Can current LTE network withstand this challenge? To answer this question, the joint performance of random access process and the uplink data transmission should be investigated. These two problems have been classically treated in the literature in a disjoint fashion. In this paper, they are jointly analyzed as an inseparable couple. To do that, a tandem queuing model is adopted whereby devices are represented as spatially interacting queues. The interaction between queues is governed by the mutual inter-cell and intra-cell interference. To that end, a joint stochastic geometry and queueing theory model is exploited to study this problem and a spatiotemporal analytical model is developed accordingly. Network stability and scalability are two prime performance criteria for performance assessment. In light of these two criteria, the developed model is poised to offer valuable insights into efficient access and resource allocation strategies.

Redesigning fruit and vegetable distribution network in Tehran using a city logistics model

Directory of Open Access Journals (Sweden)

Farshad Saeedi

2019-01-01

Full Text Available Tehran, as one of the most populated capital cities worldwide, is categorized in the group of highly polluted cities in terms of the geographical location as well as increased number of industries, vehicles, domestic fuel consumption, intra-city trips, increased manufacturing units, and in general excessive increase in the consumption of fossil energies. City logistics models can be effectively helpful for solving the complicated problems of this city. In the present study, a queuing theory-based bi-objective mathematical model is presented, which aims to optimize the environmental and economic costs in city logistics operations. It also tries to reduce the response time in the network. The first objective is associated with all beneficiaries and the second one is applicable for perishable and necessary goods. The proposed model makes decisions on urban distribution centers location problem. Subsequently, as a case study, the fruit and vegetable distribution network of Tehran city is investigated and redesigned via the proposed modelling. The results of the implementation of the model through traditional and augmented ε-constraint methods indicate the efficiency of the proposed model in redesigning the given network.

Quantification and location of emergency service mobile units and the failures in electric power distribution networks: application of hypercube model; Quantificacao e locacao de unidades moveis de atendimento de emergencia a interrupcoes em redes de distribuicao de energia eletrica: aplicacao do modelo hipercubo

Energy Technology Data Exchange (ETDEWEB)

Albino, Jean Carlo de Campos

1994-11-01

The basic hypercube queuing model, as well its approximated version, are normally used to analyze public emergency systems`performance. Both models, however, can be used only when the system has no geographical limitation of its Emergency Mobile Units (EMU), i.e, in systems in which the region`s atoms can be attended by any EMU, meaning that each EMU can over the entirety of the analysed region. In systems that does not present this property, one could only use simulation techniques. This paper presents an adaptation of the basic hypercube model that was developed for cases of urban emergency systems in which the EMU`s are not allowed or not worthwhile to cover the entire region. This adapted version is called Limited Hypercube Model (LHM). Modifications have been made in several steps of the basic model, and has brought a new analysis perspective, by amplifying the hypercube`s application universe and allowing mathematical description of some limited systems` specific features. The LHM was applied to analyze an electric energy distribution public service at Florianopolis, and the results are discussed in the paper. (author) 12 refs., 11 figs., 14 tabs.

Streams of events and performance of queuing systems: The basic anatomy of arrival/departure processes, when the focus is set on autocorrelation

DEFF Research Database (Denmark)

Nielsen, Erland Hejn

2004-01-01

significant nature or (2) aggregate system behaviour is in general very different from just the summing-up (even for finite sets of micro-behavioural patterns) and/or (3) it is simply a wrong assumption that in many cases is chosen by mere convention or plain convenience. It is evident that before choosing...... method or some autocorrelation extended descriptive sampling method, can then easily be applied. The results from the Livny, Melamed and Tsiolis (1993) study as well as the results from this work both indicates that system performance measures as for instance average waiting time or average time...

Optimal Planning of Charging for Plug-In Electric Vehicles Focusing on Users’ Benefits

Directory of Open Access Journals (Sweden)

Su Su

2017-07-01

Full Text Available Many electric vehicles’ (EVs charging strategies were proposed to optimize the operations of the power grid, while few focus on users’ benefits from the viewpoint of EV users. However, low participation is always a problem of those strategies since EV users also need a charging strategy to serve their needs and interests. This paper proposes a method focusing on EV users’ benefits that reduce the cost of battery capacity degradation, electricity cost, and waiting time for different situations. A cost model of battery capacity degradation under different state of charge (SOC ranges is developed based on experimental data to estimate the cost of battery degradation. The simulation results show that the appropriate planning of the SOC range reduces 80% of the cost of battery degradation, and the queuing theory also reduces over 60% of the waiting time in the busy situations. Those works can also become a premise of charging management to increase the participation. The proposed strategy focusing on EV users’ benefits would not give negative impacts on the power grid, and the grid load is also optimized by an artificial fish swarm algorithm (AFSA in the solution space of the charging time restricted by EV users’ benefits.

AMPLITUDE AND TIME MEASUREMENT ASIC WITH ANALOG DERANDOMIZATION

International Nuclear Information System (INIS)

O CONNOR, P.; DE GERONIMO, G.; KANDASAMY, A.

2002-01-01

We describe a new ASIC for accurate and efficient processing of high-rate pulse signals from highly segmented detectors. In contrast to conventional approaches, this circuit affords a dramatic reduction in data volume through the use of analog techniques (precision peak detectors and time-to-amplitude converters) together with fast arbitration and sequencing logic to concentrate the data before digitization. In operation the circuit functions like a data-driven analog first-in, first-out (FIFO) memory between the preamplifiers and the ADC. Peak amplitudes of pulses arriving at any one of the 32 inputs are sampled, stored, and queued for readout and digitization through a single output port. Hit timing, pulse risetime, and channel address are also available at the output. Prototype chips have been fabricated in 0.35 micron CMOS and tested. First results indicate proper functionality for pulses down to 30 ns peaking time and input rates up to 1.6 MHz/channel. Amplitude accuracy of the peak detect and hold circuit is 0.3% (absolute). TAC accuracy is within 0.3% of full scale. Power consumption is less than 2 mW/channel. Compared with conventional techniques such as track-and-hold and analog memory, this new ASIC will enable efficient pulse height measurement at 20 to 300 times higher rates

Transit-Based Emergency Evacuation with Transit Signal Priority in Sudden-Onset Disaster

Directory of Open Access Journals (Sweden)

Ciyun Lin

2016-01-01

Full Text Available This study presents methods of transit signal priority without transit-only lanes for a transit-based emergency evacuation in a sudden-onset disaster. Arterial priority signal coordination is optimized when a traffic signal control system provides priority signals for transit vehicles along an evacuation route. Transit signal priority is determined by “transit vehicle arrival time estimation,” “queuing vehicle dissipation time estimation,” “traffic signal status estimation,” “transit signal optimization,” and “arterial traffic signal coordination for transit vehicle in evacuation route.” It takes advantage of the large capacities of transit vehicles, reduces the evacuation time, and evacuates as many evacuees as possible. The proposed methods were tested on a simulation platform with Paramics V6.0. To evaluate and compare the performance of transit signal priority, three scenarios were simulated in the simulator. The results indicate that the methods of this study can reduce the travel times of transit vehicles along an evacuation route by 13% and 10%, improve the standard deviation of travel time by 16% and 46%, and decrease the average person delay at a signalized intersection by 22% and 17% when the traffic flow saturation along an evacuation route is 0.81.0, respectively.

Automated observatory in Antarctica: real-time data transfer on constrained networks in practice

Directory of Open Access Journals (Sweden)

S. Bracke

2017-08-01

Full Text Available In 2013 a project was started by the geophysical centre in Dourbes to install a fully automated magnetic observatory in Antarctica. This isolated place comes with specific requirements: unmanned station during 6 months, low temperatures with extreme values down to −50 °C, minimum power consumption and satellite bandwidth limited to 56 Kbit s−1. The ultimate aim is to transfer real-time magnetic data every second: vector data from a LEMI-25 vector magnetometer, absolute F measurements from a GEM Systems scalar proton magnetometer and absolute magnetic inclination–declination (DI measurements (five times a day with an automated DI-fluxgate magnetometer. Traditional file transfer protocols (for instance File Transfer Protocol (FTP, email, rsync show severe limitations when it comes to real-time capability. After evaluation of pro and cons of the available real-time Internet of things (IoT protocols and seismic software solutions, we chose to use Message Queuing Telemetry Transport (MQTT and receive the 1 s data with a negligible latency cost and no loss of data. Each individual instrument sends the magnetic data immediately after capturing, and the data arrive approximately 300 ms after being sent, which corresponds with the normal satellite latency.

A feedback-retransmission based asynchronous frequency hopping MAC protocol for military aeronautical ad hoc networks

Directory of Open Access Journals (Sweden)

Jinhui TANG

2018-05-01

Full Text Available Attacking time-sensitive targets has rigid demands for the timeliness and reliability of information transmission, while typical Media Access Control (MAC designed for this application works well only in very light-load scenarios; as a consequence, the performances of system throughput and channel utilization are degraded. For this problem, a feedback-retransmission based asynchronous FRequency hopping Media Access (FRMA control protocol is proposed. Burst communication, asynchronous Frequency Hopping (FH, channel coding, and feedback retransmission are utilized in FRMA. With the mechanism of asynchronous FH, immediate packet transmission and multi-packet reception can be realized, and thus the timeliness is improved. Furthermore, reliability can be achieved via channel coding and feedback retransmission. With theories of queuing theory, Markov model, packets collision model, and discrete Laplace transformation, the formulas of packet success probability, system throughput, average packet end-to-end delay, and delay distribution are obtained. The approximation accuracy of theoretical derivation is verified by experimental results. Within a light-load network, the proposed FRMA has the ability of millisecond delay and 99% reliability as well as outperforms the non-feedback-retransmission based asynchronous frequency hopping media access control protocol. Keywords: Ad hoc networks, Aeronautical communications, Frequency hopping, Media Access Control (MAC, Time-sensitive

Video transmission on ATM networks. Ph.D. Thesis

Science.gov (United States)

Chen, Yun-Chung

1993-01-01

The broadband integrated services digital network (B-ISDN) is expected to provide high-speed and flexible multimedia applications. Multimedia includes data, graphics, image, voice, and video. Asynchronous transfer mode (ATM) is the adopted transport techniques for B-ISDN and has the potential for providing a more efficient and integrated environment for multimedia. It is believed that most broadband applications will make heavy use of visual information. The prospect of wide spread use of image and video communication has led to interest in coding algorithms for reducing bandwidth requirements and improving image quality. The major results of a study on the bridging of network transmission performance and video coding are: Using two representative video sequences, several video source models are developed. The fitness of these models are validated through the use of statistical tests and network queuing performance. A dual leaky bucket algorithm is proposed as an effective network policing function. The concept of the dual leaky bucket algorithm can be applied to a prioritized coding approach to achieve transmission efficiency. A mapping of the performance/control parameters at the network level into equivalent parameters at the video coding level is developed. Based on that, a complete set of principles for the design of video codecs for network transmission is proposed.

Definition of an 802.11 Interface Management Process in a Proposed System for Transmission Capacity Enhancement in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Christian Köbel

2015-01-01

Full Text Available 802.11-based wireless mesh networks (WMNs as last mile solutions frequently become bottlenecks in the overall Internet communication structure. The lack of end-to-end capacity on routes also affects vertical traffic coming from or flowing towards external networks, such as the Internet. The presented approach aims to increase the overall network performance by exploiting channel diversity and to additionally favor vertical traffic. To achieve this, first we propose a general system that modifies an existing mesh node architecture, in order to prepare a more efficient resource management and to enhance the restricted transmission capacity in standard WMNs. The parallel use of nonoverlapping channels, based on a multiradio node, marks the starting point. The system treats aspects of channel assignment, traffic analysis, and fast layer 2 forwarding. Then, the impact of a novel Multihop Radio Resource Management process is discussed as a relevant component of this new system architecture. The process combines per-hop priority queuing and load balancing in a novel way. It was designed, developed, and evaluated in the presented paper, resulting in the fact that capacity in WMNs was significantly increased, Quality-of-Service parameters were improved, and more efficient use of multiple radios could be reached. The proposed process was validated using a simulation approach.

Refining Lane-Based Traffic Signal Settings to Satisfy Spatial Lane Length Requirements

Directory of Open Access Journals (Sweden)

Yanping Liu

2017-01-01

Full Text Available In conventional lane-based signal optimization models, lane markings guiding road users in making turns are optimized with traffic signal settings in a unified framework to maximize the overall intersection capacity or minimize the total delay. The spatial queue requirements of road lanes should be considered to avoid overdesigns of green durations. Point queue system adopted in the conventional lane-based framework causes overflow in practice. Based on the optimization results from the original lane-based designs, a refinement is proposed to enhance the lane-based settings to ensure that spatial holding limits of the approaching traffic lanes are not exceeded. A solution heuristic is developed to modify the green start times, green durations, and cycle length by considering the vehicle queuing patterns and physical holding capacities along the approaching traffic lanes. To show the effectiveness of this traffic signal refinement, a case study of one of the busiest and most complicated intersections in Hong Kong is given for demonstration. A site survey was conducted to collect existing traffic demand patterns and existing traffic signal settings in peak periods. Results show that the proposed refinement method is effective to ensure that all vehicle queue lengths satisfy spatial lane capacity limits, including short lanes, for daily operation.

Mathematical Modeling and Analysis Methodology for Opportunistic Routing in Wireless Multihop Networks

Directory of Open Access Journals (Sweden)

Wang Dongyang

2015-01-01

Full Text Available Modeling the forwarding feature and analyzing the performance theoretically for opportunistic routing in wireless multihop network are of great challenge. To address this issue, a generalized geometric distribution (GGD is firstly proposed. Based on the GGD, the forwarding probability between any two forwarding candidates could be calculated and it can be proved that the successful delivery rate after several transmissions of forwarding candidates is irrelevant to the priority rule. Then, a discrete-time queuing model is proposed to analyze mean end-to-end delay (MED of a regular opportunistic routing with the knowledge of the forwarding probability. By deriving the steady-state joint generating function of the queue length distribution, MED for directly connected networks and some special cases of nondirectly connected networks could be ultimately determined. Besides, an approximation approach is proposed to assess MED for the general cases in the nondirectly connected networks. By comparing with a large number of simulation results, the rationality of the analysis is validated. Both the analysis and simulation results show that MED varies with the number of forwarding candidates, especially when it comes to connected networks; MED increases more rapidly than that in nondirectly connected networks with the increase of the number of forwarding candidates.

Revisiting Street Intersections Using Slot-Based Systems.

Directory of Open Access Journals (Sweden)

Remi Tachet

Full Text Available Since their appearance at the end of the 19th century, traffic lights have been the primary mode of granting access to road intersections. Today, this centuries-old technology is challenged by advances in intelligent transportation, which are opening the way to new solutions built upon slot-based systems similar to those commonly used in aerial traffic: what we call Slot-based Intersections (SIs. Despite simulation-based evidence of the potential benefits of SIs, a comprehensive, analytical framework to compare their relative performance with traffic lights is still lacking. Here, we develop such a framework. We approach the problem in a novel way, by generalizing classical queuing theory. Having defined safety conditions, we characterize capacity and delay of SIs. In the 2-road crossing configuration, we provide a capacity-optimal SI management system. For arbitrary intersection configurations, near-optimal solutions are developed. Results theoretically show that transitioning from a traffic light system to SI has the potential of doubling capacity and significantly reducing delays. This suggests a reduction of non-linear dynamics induced by intersection bottlenecks, with positive impact on the road network. Such findings can provide transportation engineers and planners with crucial insights as they prepare to manage the transition towards a more intelligent transportation infrastructure in cities.

Energy Analysis of Contention Tree-Based Access Protocols in Dense Machine-to-Machine Area Networks

Directory of Open Access Journals (Sweden)

Francisco Vázquez-Gallego

2015-01-01

Full Text Available Machine-to-Machine (M2M area networks aim at connecting an M2M gateway with a large number of energy-constrained devices that must operate autonomously for years. Therefore, attaining high energy efficiency is essential in the deployment of M2M networks. In this paper, we consider a dense M2M area network composed of hundreds or thousands of devices that periodically transmit data upon request from a gateway or coordinator. We theoretically analyse the devices’ energy consumption using two Medium Access Control (MAC protocols which are based on a tree-splitting algorithm to resolve collisions among devices: the Contention Tree Algorithm (CTA and the Distributed Queuing (DQ access. We have carried out computer-based simulations to validate the accuracy of the theoretical models and to compare the energy performance using DQ, CTA, and Frame Slotted-ALOHA (FSA in M2M area networks with devices in compliance with the IEEE 802.15.4 physical layer. Results show that the performance of DQ is totally independent of the number of contending devices, and it can reduce the energy consumed per device in more than 35% with respect to CTA and in more than 80% with respect to FSA.

Improving LAN Performance Based on IEEE802.1Q VLAN Switching Techniques

Directory of Open Access Journals (Sweden)

Dhurgham Abdulridha Jawad AL-Khaffaf

2017-11-01

Full Text Available VLAN is a set of users in different isolated logical LANs or broadcasting domains, they are communicated as a same LAN i.e. same broadcasting domain. Ethernet protocol is very popular over networks because it has a simple of implementation and ease of configuration. However, the support of Quality of Service (QoS has become an essential merit of Ethernet network. In this context, the problems of large network and data transport delay have been regained significant importance. Alleviating the end to end delay by using the VLAN technology to enhance the network performance. In this paper, we analyze and evaluate the performance of LAN and VLAN networks in different scenarios. Measuring key performance indicators such as traffic sent, traffic received, average delay and throughput. The simulation was carried out by employing OPNET 17.5 Student Version. Two different scenarios are presented to observe the performance of LAN and VLAN networks. The simulation results illustrated that there is more existing traffic without VLAN technology. Hence, VLANs prohibit the access to the network resources of other departments. Also, VLAN has half average queuing delay compared with no VLAN scenario. Therefore, VLANs can improve bandwidth utilization, power, speed and security.

A distributed approach for optimizing cascaded classifier topologies in real-time stream mining systems.

Science.gov (United States)

Foo, Brian; van der Schaar, Mihaela

2010-11-01

In this paper, we discuss distributed optimization techniques for configuring classifiers in a real-time, informationally-distributed stream mining system. Due to the large volume of streaming data, stream mining systems must often cope with overload, which can lead to poor performance and intolerable processing delay for real-time applications. Furthermore, optimizing over an entire system of classifiers is a difficult task since changing the filtering process at one classifier can impact both the feature values of data arriving at classifiers further downstream and thus, the classification performance achieved by an ensemble of classifiers, as well as the end-to-end processing delay. To address this problem, this paper makes three main contributions: 1) Based on classification and queuing theoretic models, we propose a utility metric that captures both the performance and the delay of a binary filtering classifier system. 2) We introduce a low-complexity framework for estimating the system utility by observing, estimating, and/or exchanging parameters between the inter-related classifiers deployed across the system. 3) We provide distributed algorithms to reconfigure the system, and analyze the algorithms based on their convergence properties, optimality, information exchange overhead, and rate of adaptation to non-stationary data sources. We provide results using different video classifier systems.

Traffic Flow Wide-Area Surveillance system

Energy Technology Data Exchange (ETDEWEB)

Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.; Abston, R.A.

1994-09-01

Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret a large spatial projection of data originating from multiple sensor suites. This concept is the basis for the development of a Traffic Flow Wide-Area Surveillance (TFWAS) system. This paper presents the results of a study by Oak Ridge National Laboratory to define the operational specifications and characteristics, to determine the constraints, and to examine the state of technology of a TFWAS system in terms of traffic management and control. In doing so, the functions and attributes of a TFWAS system are mapped into an operational structure consistent with the Intelligent Vehicle Highway System (IVHS) concept and the existing highway infrastructure. This mapping includes identifying candidate sensor suites and establishing criteria, requirements, and performance measures by which these systems can be graded in their ability and practicality to meet the operational requirements of a TFWAS system. In light of this, issues such as system integration, applicable technologies, impact on traffic management and control, and public acceptance are addressed.

Spectrum Handoffs Based on Preemptive Repeat Priority Queue in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Xiaolong Yang

2016-07-01

Full Text Available Cognitive radio can significantly improve the spectrum efficiency, and spectrum handoff is considered as an important functionality to guarantee the quality of service (QoS of primary users (PUs and the continuity of data transmission of secondary users (SUs. In this paper, we propose an analytical framework based on a preemptive repeat identical (PRI M/G/1 queuing network model to characterize spectrum handoff behaviors with general service time distribution of both primary and secondary connections, multiple interruptions and transmission delay resulting from the appearance of primary connections. Then, we derive the close-expression of the extended data delivery and the system sojourn time in both staying and changing scenarios. In addition, based on analysis of spectrum handoff behaviors resulting from multiple interruptions caused by the appearance of the primary connections, we investigate the traffic-adaptive policy, by which the considered SU will optimally adjust its handoff spectrum policy. Moreover, we investigate the admissible region and provide the reference for designing the admission control rule for the arriving secondary connection requests. Finally, simulation results verify that our proposed analytical framework is reasonable and can provide the reference for executing the optimal spectrum handoff strategy and designing the admission control rule for the SU in cognitive radio networks.

Small SWAP 3D imaging flash ladar for small tactical unmanned air systems

Science.gov (United States)

Bird, Alan; Anderson, Scott A.; Wojcik, Michael; Budge, Scott E.

2015-05-01

The Space Dynamics Laboratory (SDL), working with Naval Research Laboratory (NRL) and industry leaders Advanced Scientific Concepts (ASC) and Hood Technology Corporation, has developed a small SWAP (size, weight, and power) 3D imaging flash ladar (LAser Detection And Ranging) sensor system concept design for small tactical unmanned air systems (STUAS). The design utilizes an ASC 3D flash ladar camera and laser in a Hood Technology gyro-stabilized gimbal system. The design is an autonomous, intelligent, geo-aware sensor system that supplies real-time 3D terrain and target images. Flash ladar and visible camera data are processed at the sensor using a custom digitizer/frame grabber with compression. Mounted in the aft housing are power, controls, processing computers, and GPS/INS. The onboard processor controls pointing and handles image data, detection algorithms and queuing. The small SWAP 3D imaging flash ladar sensor system generates georeferenced terrain and target images with a low probability of false return and system SWAP estimate of system is modeled using LadarSIM, a MATLAB® and Simulink®- based ladar system simulator designed and developed by the Center for Advanced Imaging Ladar (CAIL) at Utah State University. We will present the concept design and modeled performance predictions.

Rationing in health systems: A critical review.

Science.gov (United States)

Keliddar, Iman; Mosadeghrad, Ali Mohammad; Jafari-Sirizi, Mehdi

2017-01-01

Background: It is difficult to provide health care services to all those in need of such services due to limited resources and unlimited demands. Thus, priority setting and rationing have to be applied. This study aimed at critically examining the concept of rationing in health sector and identifying its purposes, influencing factors, mechanisms, and outcomes. Methods: The critical interpretive synthesis methodology was used in this study. PubMed, Cochrane, and Proquest databases were searched using the related key words to find related documents published between 1970 and 2015. In total, 161 published reports were reviewed and included in the study. Thematic content analysis was applied for data analysis. Results: Health services rationing means restricting the access of some people to useful or potentially useful health services due to budgetary limitation. The inherent features of the health market and health services, limited resources, and unlimited needs necessitate health services rationing. Rationing can be applied in 4 levels: health care policy- makers, health care managers, health care providers, and patients. Health care rationing can be accomplished through fixed budget, benefit package, payment mechanisms, queuing, copayments, and deductibles. Conclusion: This paper enriched our understanding of health services rationing and its mechanisms at various levels and contributed to the literature by broadly conceptualizing health services rationing.

The design of traffic signal coordinated control

Science.gov (United States)

Guo, Xueting; Sun, Hongsheng; Wang, Xifu

2017-05-01

Traffic as the tertiary industry is an important pillar industry to support the normal development of the economy. But now China's road traffic development and economic development has shown a great imbalance and fault phenomenon, which greatly inhibited the normal development of China's economy. Now in many large and medium-sized cities in China are implementing green belt construction. The so-called green band is when the road conditions to meet the conditions for the establishment of the green band, the sections of the intersection of several planning to a traffic coordination control system, so that when the driver at a specific speed can be achieved without stopping the continuous Through the intersection. Green belt can effectively reduce the delay and queuing length of vehicle driving, the normal function of urban roads and reduce the economic losses caused by traffic congestion is a great help. In this paper, the theoretical basis of the design of the coordinated control system is described. Secondly, the green time offset is calculated by the analytic method and the green band is established. And then the VISSIM software is used to simulate the traffic system before and after the improvement. Finally, the results of the two simulations are compared.

Service Capacity Reserve under Uncertainty by Hospital’s ER Analogies: A Practical Model for Car Services

Directory of Open Access Journals (Sweden)

Miguel Ángel Pérez Salaverría

2014-01-01

Full Text Available We define a capacity reserve model to dimension passenger car service installations according to the demographic distribution of the area to be serviced by using hospital’s emergency room analogies. Usually, service facilities are designed applying empirical methods, but customers arrive under uncertain conditions not included in the original estimations, and there is a gap between customer’s real demand and the service’s capacity. Our research establishes a valid methodology and covers the absence of recent researches and the lack of statistical techniques implementation, integrating demand uncertainty in a unique model built in stages by implementing ARIMA forecasting, queuing theory, and Monte Carlo simulation to optimize the service capacity and occupancy, minimizing the implicit cost of the capacity that must be reserved to service unexpected customers. Our model has proved to be a useful tool for optimal decision making under uncertainty integrating the prediction of the cost implicit in the reserve capacity to serve unexpected demand and defining a set of new process indicators, such us capacity, occupancy, and cost of capacity reserve never studied before. The new indicators are intended to optimize the service operation. This set of new indicators could be implemented in the information systems used in the passenger car services.

Versatile synchronized real-time MEG hardware controller for large-scale fast data acquisition

Science.gov (United States)

Sun, Limin; Han, Menglai; Pratt, Kevin; Paulson, Douglas; Dinh, Christoph; Esch, Lorenz; Okada, Yoshio; Hämäläinen, Matti

2017-05-01

Versatile controllers for accurate, fast, and real-time synchronized acquisition of large-scale data are useful in many areas of science, engineering, and technology. Here, we describe the development of a controller software based on a technique called queued state machine for controlling the data acquisition (DAQ) hardware, continuously acquiring a large amount of data synchronized across a large number of channels (>400) at a fast rate (up to 20 kHz/channel) in real time, and interfacing with applications for real-time data analysis and display of electrophysiological data. This DAQ controller was developed specifically for a 384-channel pediatric whole-head magnetoencephalography (MEG) system, but its architecture is useful for wide applications. This controller running in a LabVIEW environment interfaces with microprocessors in the MEG sensor electronics to control their real-time operation. It also interfaces with a real-time MEG analysis software via transmission control protocol/internet protocol, to control the synchronous acquisition and transfer of the data in real time from >400 channels to acquisition and analysis workstations. The successful implementation of this controller for an MEG system with a large number of channels demonstrates the feasibility of employing the present architecture in several other applications.

FLOW PATTERNS OF VEHICULAR TRAFFIC ALONG HIGHWAY TOLL PLAZA IN OGUN STATE

Directory of Open Access Journals (Sweden)

Bashiru A. Raji

2009-06-01

Full Text Available Congestion on our highways, freeways and arterials are increasing at an alarming rate. This occurs because there is an increase in vehicular growth without a corresponding increase in road size, and this has made free flow of traffic a preponderant problem in our highways. Toll plaza causes delay on our highways and results are formation of queue. This paper examined how simple queuing model can be used to determine traffic intensity and the flow pattern of car traffic at a toll plaza. The study was carried out with twelve field assistants at Ogere toll plaza in Ogun State. Findings show a significant variation in the degree of hourly traffic intensities at the four pay points for cars at the toll plaza. However, variation in the daily traffic intensities at the four pay points for cars showed no significant variation. The study also revealed that bumps constructed to check vehicles speed, hawker’s trading activities are among other factors that constitute hindrance to free flow of traffic other than service time and inter-arrival time of cars at the toll plaza. It is therefore recommended that appropriate authority should look into these factors and take necessary steps towards ensuring free flow of traffic at the plaza.

How cognitive heuristics can explain social interactions in spatial movement.

Science.gov (United States)

Seitz, Michael J; Bode, Nikolai W F; Köster, Gerta

2016-08-01

The movement of pedestrian crowds is a paradigmatic example of collective motion. The precise nature of individual-level behaviours underlying crowd movements has been subject to a lively debate. Here, we propose that pedestrians follow simple heuristics rooted in cognitive psychology, such as 'stop if another step would lead to a collision' or 'follow the person in front'. In other words, our paradigm explicitly models individual-level behaviour as a series of discrete decisions. We show that our cognitive heuristics produce realistic emergent crowd phenomena, such as lane formation and queuing behaviour. Based on our results, we suggest that pedestrians follow different cognitive heuristics that are selected depending on the context. This differs from the widely used approach of capturing changes in behaviour via model parameters and leads to testable hypotheses on changes in crowd behaviour for different motivation levels. For example, we expect that rushed individuals more often evade to the side and thus display distinct emergent queue formations in front of a bottleneck. Our heuristics can be ranked according to the cognitive effort that is required to follow them. Therefore, our model establishes a direct link between behavioural responses and cognitive effort and thus facilitates a novel perspective on collective behaviour. © 2016 The Author(s).

Tough luck and tough choices: applying luck egalitarianism to oral health.

Science.gov (United States)

Albertsen, Andreas

2015-06-01

Luck egalitarianism is often taken to task for its alleged harsh implications. For example, it may seem to imply a policy of nonassistance toward uninsured reckless drivers who suffer injuries. Luck egalitarians respond to such objections partly by pointing to a number of factors pertaining to the cases being debated, which suggests that their stance is less inattentive to the plight of the victims than it might seem at first. However, the strategy leaves some cases in which the attribution of individual responsibility is appropriate (and so, it seems, is asking people to pick up the tab for their choices). One such case is oral health or significant aspects of this. It is appropriate, the paper argues, to hold people responsible for a number of factors that affect their oral health. A luck egalitarian approach inspired by John Roemer can assess whether people have acted responsibly by comparing their choices to those of their peers. A luck egalitarian approach to oral health would recommend prioritizing scarce resources in a responsibility-weighted queuing system and include copayment and general taxation among its measures of financing. © The Author 2015. Published by Oxford University Press, on behalf of the Journal of Medicine and Philosophy Inc. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

CMS Monte Carlo production in the WLCG computing grid

International Nuclear Information System (INIS)

Hernandez, J M; Kreuzer, P; Hof, C; Khomitch, A; Mohapatra, A; Filippis, N D; Pompili, A; My, S; Abbrescia, M; Maggi, G; Donvito, G; Weirdt, S D; Maes, J; Mulders, P v; Villella, I; Wakefield, S; Guan, W; Fanfani, A; Evans, D; Flossdorf, A

2008-01-01

Monte Carlo production in CMS has received a major boost in performance and scale since the past CHEP06 conference. The production system has been re-engineered in order to incorporate the experience gained in running the previous system and to integrate production with the new CMS event data model, data management system and data processing framework. The system is interfaced to the two major computing Grids used by CMS, the LHC Computing Grid (LCG) and the Open Science Grid (OSG). Operational experience and integration aspects of the new CMS Monte Carlo production system is presented together with an analysis of production statistics. The new system automatically handles job submission, resource monitoring, job queuing, job distribution according to the available resources, data merging, registration of data into the data bookkeeping, data location, data transfer and placement systems. Compared to the previous production system automation, reliability and performance have been considerably improved. A more efficient use of computing resources and a better handling of the inherent Grid unreliability have resulted in an increase of production scale by about an order of magnitude, capable of running in parallel at the order of ten thousand jobs and yielding more than two million events per day

Throughput, latency and cost comparisons of microcontroller-based implementations of wireless sensor network (WSN) in high jump sports

Science.gov (United States)

Ahmad, Afandi; Roslan, Muhammad Faris; Amira, Abbes

2017-09-01

In high jump sports, approach take-off speed and force during the take-off are two (2) main important parts to gain maximum jump. To measure both parameters, wireless sensor network (WSN) that contains microcontroller and sensor are needed to describe the results of speed and force for jumpers. Most of the microcontroller exhibit transmission issues in terms of throughput, latency and cost. Thus, this study presents the comparison of wireless microcontrollers in terms of throughput, latency and cost, and the microcontroller that have best performances and cost will be implemented in high jump wearable device. In the experiments, three (3) parts have been integrated - input, process and output. Force (for ankle) and global positioning system (GPS) sensor (for body waist) acts as an input for data transmission. These data were then being processed by both microcontrollers, ESP8266 and Arduino Yun Mini to transmit the data from sensors to the server (host-PC) via message queuing telemetry transport (MQTT) protocol. The server acts as receiver and the results was calculated from the MQTT log files. At the end, results obtained have shown ESP8266 microcontroller had been chosen since it achieved high throughput, low latency and 11 times cheaper in term of prices compared to Arduino Yun Mini microcontroller.

Cargo container inspection test program at ARPA's Nonintrusive Inspection Technology Testbed

Science.gov (United States)

Volberding, Roy W.; Khan, Siraj M.

1994-10-01

An x-ray-based cargo inspection system test program is being conducted at the Advanced Research Project Agency (ARPA)-sponsored Nonintrusive Inspection Technology Testbed (NITT) located in the Port of Tacoma, Washington. The test program seeks to determine the performance that can be expected from a dual, high-energy x-ray cargo inspection system when inspecting ISO cargo containers. This paper describes an intensive, three-month, system test involving two independent test groups, one representing the criminal smuggling element and the other representing the law enforcement community. The first group, the `Red Team', prepares ISO containers for inspection at an off-site facility. An algorithm randomly selects and indicates the positions and preparation of cargoes within a container. The prepared container is dispatched to the NITT for inspection by the `Blue Team'. After in-gate processing, it is queued for examination. The Blue Team inspects the container and decides whether or not to pass the container. The shipment undergoes out-gate processing and returns to the Red Team. The results of the inspection are recorded for subsequent analysis. The test process, including its governing protocol, the cargoes, container preparation, the examination and results available at the time of submission are presented.

Resource Allocation and Outpatient Appointment Scheduling Using Simulation Optimization

Directory of Open Access Journals (Sweden)

Carrie Ka Yuk Lin

2017-01-01

Full Text Available This paper studies the real-life problems of outpatient clinics having the multiple objectives of minimizing resource overtime, patient waiting time, and waiting area congestion. In the clinic, there are several patient classes, each of which follows different treatment procedure flow paths through a multiphase and multiserver queuing system with scarce staff and limited space. We incorporate the stochastic factors for the probabilities of the patients being diverted into different flow paths, patient punctuality, arrival times, procedure duration, and the number of accompanied visitors. We present a novel two-stage simulation-based heuristic algorithm to assess various tactical and operational decisions for optimizing the multiple objectives. In stage I, we search for a resource allocation plan, and in stage II, we determine a block appointment schedule by patient class and a service discipline for the daily operational level. We also explore the effects of the separate strategies and their integration to identify the best possible combination. The computational experiments are designed on the basis of data from a study of an ophthalmology clinic in a public hospital. Results show that our approach significantly mitigates the undesirable outcomes by integrating the strategies and increasing the resource flexibility at the bottleneck procedures without adding resources.

Traffic flow wide-area surveillance system

Science.gov (United States)

Allgood, Glenn O.; Ferrell, Regina K.; Kercel, Stephen W.; Abston, Ruth A.

1995-01-01

Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret a large spatial projection of data originating from multiple sensor suites. This concept is the basis for the development of a traffic flow wide-area surveillance (TFWAS) system. This paper presents the results of a study by Oak Ridge National Laboratory to define the operational specifications and characteristics, to determine the constraints, and to examine the state of technology of a TFWAS system in terms of traffic management and control. In doing so, the functions and attributes of a TFWAS system are mapped into an operational structure consistent with the Intelligent Vehicle Highway System (IVHS) concept and the existing highway infrastructure. This mapping includes identifying candidate sensor suites and establishing criteria, requirements, and performance measures by which these systems can be graded in their ability and practicality to meet the operational requirements of a TFWAS system. In light of this, issues such as system integration, applicable technologies, impact on traffic management and control, and public acceptance are addressed.

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

Science.gov (United States)

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

A novel client service quality measuring model and an eHealthcare mitigating approach.

Science.gov (United States)

Cheng, L M; Choi, Wai Ping Choi; Wong, Anita Yiu Ming

2016-07-01

Facing population ageing in Hong Kong, the demand of long-term elderly health care services is increasing. The challenge is to support a good quality service under the constraints faced by recent shortage of nursing and care services professionals without redesigning the work flow operated in the existing elderly health care industries. the existing elderly health care industries. The Total QoS measure based on Finite Capacity Queuing Model is a reliable method and an effective measurement for Quality of services. The value is good for measuring the staffing level and offers a measurement for efficiency enhancement when incorporate new technologies like ICT. The implemented system has improved the Quality of Service by more than 14% and the extra released manpower resource will allow clinical care provider to offer further value added services without actually increasing head count. We have developed a novel Quality of Service measurement for Clinical Care services based on multi-queue using finite capacity queue model M/M/c/K/n and the measurement is useful for estimating the shortage of staff resource in a caring institution. It is essential for future integration with the existing widely used assessment model to develop reliable measuring limits which allow an effective measurement of public fund used in health care industries. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Access Control Mechanism for IoT Environments Based on Modelling Communication Procedures as Resources

Directory of Open Access Journals (Sweden)

Luis Cruz-Piris

2018-03-01

Full Text Available Internet growth has generated new types of services where the use of sensors and actuators is especially remarkable. These services compose what is known as the Internet of Things (IoT. One of the biggest current challenges is obtaining a safe and easy access control scheme for the data managed in these services. We propose integrating IoT devices in an access control system designed for Web-based services by modelling certain IoT communication elements as resources. This would allow us to obtain a unified access control scheme between heterogeneous devices (IoT devices, Internet-based services, etc.. To achieve this, we have analysed the most relevant communication protocols for these kinds of environments and then we have proposed a methodology which allows the modelling of communication actions as resources. Then, we can protect these resources using access control mechanisms. The validation of our proposal has been carried out by selecting a communication protocol based on message exchange, specifically Message Queuing Telemetry Transport (MQTT. As an access control scheme, we have selected User-Managed Access (UMA, an existing Open Authorization (OAuth 2.0 profile originally developed for the protection of Internet services. We have performed tests focused on validating the proposed solution in terms of the correctness of the access control system. Finally, we have evaluated the energy consumption overhead when using our proposal.

Improved Cloud resource allocation: how INDIGO-DataCloud is overcoming the current limitations in Cloud schedulers

Science.gov (United States)

Lopez Garcia, Alvaro; Zangrando, Lisa; Sgaravatto, Massimo; Llorens, Vincent; Vallero, Sara; Zaccolo, Valentina; Bagnasco, Stefano; Taneja, Sonia; Dal Pra, Stefano; Salomoni, Davide; Donvito, Giacinto

2017-10-01

Performing efficient resource provisioning is a fundamental aspect for any resource provider. Local Resource Management Systems (LRMS) have been used in data centers for decades in order to obtain the best usage of the resources, providing their fair usage and partitioning for the users. In contrast, current cloud schedulers are normally based on the immediate allocation of resources on a first-come, first-served basis, meaning that a request will fail if there are no resources (e.g. OpenStack) or it will be trivially queued ordered by entry time (e.g. OpenNebula). Moreover, these scheduling strategies are based on a static partitioning of the resources, meaning that existing quotas cannot be exceeded, even if there are idle resources allocated to other projects. This is a consequence of the fact that cloud instances are not associated with a maximum execution time and leads to a situation where the resources are under-utilized. These facts have been identified by the INDIGO-DataCloud project as being too simplistic for accommodating scientific workloads in an efficient way, leading to an underutilization of the resources, a non desirable situation in scientific data centers. In this work, we will present the work done in the scheduling area during the first year of the INDIGO project and the foreseen evolutions.

EFFICIENCY EVALUATION OF ENTERPRISE INFORMATION SYSTEMS WITH NON-UNIFORM LOAD

Directory of Open Access Journals (Sweden)

I. V. Kalinin

2015-09-01

Full Text Available The paper deals with the problem of characteristics evaluation for enterprise information systems at the design stage. In the design of ERP-systems the most interest characteristic is not the average time, but the probability of timely delivery of different type messages (for example, command, service, multimedia, files, etc. from the sender to the recipient. In addition,the possibility of using the priority information management built on the basis of service disciplines of general form with mixed priorities needs to be considered. An open queuing network with non-uniform data flow is used for solution of this problem. The method for calculation of information systems characteristics is proposed based on the decomposition of the network model. The end results obtained with this approach and by means of priority management are approximate because different classes of message streams at the output and input nodes of the computer system differ from the simple ones. However, result errors of the proposed analytical method are in acceptable limits for engineering calculations as it was shown by simulation in a wide range of parameters corresponding to real systems. Obtained results are usable for optimization problem solution of data transmission networks in modern information systems, involving routing algorithm definition and priorities specification for different classes of messages to provide given delivery time.

CONTROLLING TRAFFIC FLOW IN MULTILANE-ISOLATED INTERSECTION USING ANFIS APPROACH TECHNIQUES

Directory of Open Access Journals (Sweden)

G. R. LAI

2015-08-01

Full Text Available Many controllers have applied the Adaptive Neural-Fuzzy Inference System (ANFIS concept for optimizing the controller performance. However, there are less traffic signal controllers developed using the ANFIS concept. ANFIS traffic signal controller with its fuzzy rule base and its ability to learn from a set of sample data could improve the performance of Existing traffic signal controlling system to reduce traffic congestions at most of the busy traffic intersections in city such as Kuala Lumpur, Malaysia. The aim of this research is to develop an ANFIS traffic signals controller for multilane-isolated four approaches intersections in order to ease traffic congestions at traffic intersections. The new concept to generate sample data for ANFIS training is introduced in this research. The sample data is generated based on fuzzy rules and can be analysed using tree diagram. This controller is simulated on multilane-isolated traffic intersection model developed using M/M/1 queuing theory and its performance in terms of average waiting time, queue length and delay time are compared with traditional controllers and fuzzy controller. Simulation result shows that the average waiting time, queue length, and delay time of ANFIS traffic signal controller are the lowest as compared to the other three controllers. In conclusion, the efficiency and performance of ANFIS controller are much better than that of fuzzy and traditional controllers in different traffic volumes.

Earthworks logistics in the high density urban development conditions - case study

Science.gov (United States)

Sobotka, A.; Blajer, M.

2017-10-01

Realisation of the construction projects on highly urbanised areas carries many difficulties and logistic problems. Earthworks conducted in such conditions constitute a good example of how important it is to properly plan the works and use the technical means of the logistics infrastructure. The construction processes on the observed construction site, in combination with their external logistics service are a complex system, difficult for mathematical modelling and achievement of appropriate data for planning the works. The paper shows describe and analysis of earthworks during construction of the Centre of Power Engineering of AGH in Krakow for two stages of a construction project. At the planning stage in the preparatory phase (before realization) and in the implementation phase of construction works (foundation). In the first case, an example of the use of queuing theory for prediction of excavation time under random work conditions of the excavator and the associated trucks is provided. In the second case there is a change of foundation works technology resulting as a consequence of changes in logistics earthworks. Observation of the construction has confirmed that the use of appropriate methods of construction works management, and in this case agile management, the time and cost of the project have not been exceeded. The success of a project depends on the ability of the contractor to react quickly when changes occur in the design, technology, environment, etc.

Access Control Mechanism for IoT Environments Based on Modelling Communication Procedures as Resources.

Science.gov (United States)

Cruz-Piris, Luis; Rivera, Diego; Marsa-Maestre, Ivan; de la Hoz, Enrique; Velasco, Juan R

2018-03-20

Internet growth has generated new types of services where the use of sensors and actuators is especially remarkable. These services compose what is known as the Internet of Things (IoT). One of the biggest current challenges is obtaining a safe and easy access control scheme for the data managed in these services. We propose integrating IoT devices in an access control system designed for Web-based services by modelling certain IoT communication elements as resources. This would allow us to obtain a unified access control scheme between heterogeneous devices (IoT devices, Internet-based services, etc.). To achieve this, we have analysed the most relevant communication protocols for these kinds of environments and then we have proposed a methodology which allows the modelling of communication actions as resources. Then, we can protect these resources using access control mechanisms. The validation of our proposal has been carried out by selecting a communication protocol based on message exchange, specifically Message Queuing Telemetry Transport (MQTT). As an access control scheme, we have selected User-Managed Access (UMA), an existing Open Authorization (OAuth) 2.0 profile originally developed for the protection of Internet services. We have performed tests focused on validating the proposed solution in terms of the correctness of the access control system. Finally, we have evaluated the energy consumption overhead when using our proposal.

Cross-Layer Active Predictive Congestion Control Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Yinfeng Wu

2009-10-01

Full Text Available In wireless sensor networks (WSNs, there are numerous factors that may cause network congestion problems, such as the many-to-one communication modes, mutual interference of wireless links, dynamic changes of network topology and the memory-restrained characteristics of nodes. All these factors result in a network being more vulnerable to congestion. In this paper, a cross-layer active predictive congestion control scheme (CL-APCC for improving the performance of networks is proposed. Queuing theory is applied in the CL-APCC to analyze data flows of a single-node according to its memory status, combined with the analysis of the average occupied memory size of local networks. It also analyzes the current data change trends of local networks to forecast and actively adjust the sending rate of the node in the next period. In order to ensure the fairness and timeliness of the network, the IEEE 802.11 protocol is revised based on waiting time, the number of the node‟s neighbors and the original priority of data packets, which dynamically adjusts the sending priority of the node. The performance of CL-APCC, which is evaluated by extensive simulation experiments. is more efficient in solving the congestion in WSNs. Furthermore, it is clear that the proposed scheme has an outstanding advantage in terms of improving the fairness and lifetime of networks.

Desain Sistem Kontrol Traffic Light Adaptif Pada Persimpangan Empat Berbasis PLC Siemens

Directory of Open Access Journals (Sweden)

Zulfikar

2015-03-01

Full Text Available Nowadays, traffic lights are using a fixed time as on-off light signal controller. However this system has many disadveantages, such as vehicles have to queue long time in certain road section (lane at rush hour. As a consequence, it reguires a traffic light control system that can prioritize a more dense lane. Adaptive traffic light control detects the number of queues of vehicles on the lane. Sensors detect the vehicle queue’s length. There are three sensors that will detect queues’s length of vehicles on each lane. When the queue of vehicles reached the first sensor, the green light will be on longer 5 seconds compare to the normal traffic. When the queue of vehicles reaches the second sensor, the green light provide 10 seconds more compare to the normal traffic and if the queue of vehicles reaches the third sensor, the green light will be longer which is about 20 seconds compare. In this adaptive traffic light control system, there are two jam sensors installed in the middle of the intersection that will turn on all the red lights when there is an unexpected problems happened. This adaptive traffic light control system will provide the longest queuing time 92 seconds, when all sensors on all lanes active and the fastest time is 47 seconds which is the time when the normal system.

Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks

Directory of Open Access Journals (Sweden)

Fapojuwo Abraham O

2007-01-01

Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.

Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks

Directory of Open Access Journals (Sweden)

Abraham O. Fapojuwo

2007-11-01

Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.

Channel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networks

KAUST Repository

Hossain, Md Jahangir

2010-07-01

In our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second user in the transmission opportunistically using hierarchical modulations. As such the frequency of information access of the users increases without any degradation of the system spectral efficiency (SSE) compared to the classical opportunistic scheduling scheme. In this paper, we analyze channel access delay of an incoming packet at the base station (BS) buffer when our proposed TBS and HTS schemes are employed at the BS. Specifically, using a queuing analytic model we derive channel access delay as well as buffer distribution of the packets that wait at BS buffer for down-link (DL) transmission. We compare performance of the TBS and HTS schemes with that of the classical single user opportunistic schemes namely, absolute carrier-to-noise ratio (CNR)-based single user scheduling (ASS) and normalized CNR-based single user scheduling (NSS). For an independent and identically distributed (i.i.d.) fading environment, our proposed scheme can improve packet\\'s access delay performance compared to the ASS. Selected numerical results in an independent but non-identically distributed (i.n.d.) fading environment show that our proposed HTS achieves overall good channel access delay performance. © 2010 IEEE.

VizieR Online Data Catalog: UBVR photometry of the T Tauri binary DQ Tau (Tofflemire+, 2017)

Science.gov (United States)

Tofflemire, B. M.; Mathieu, R. D.; Ardila, D. R.; Akeson, R. L.; Ciardi, D. R.; Johns-Krull, C.; Herczeg, G. J.; Quijano-Vodniza, A.

2017-08-01

The Las Cumbres Observatories Global Telescope (LCOGT) 1m network consists of nine 1m telescopes spread across four international sites: McDonald Observatory (USA), CTIO (Chile), SAAO (South Africa), and Siding Springs Observatory (Australia). Over the 2014-2015 winter observing season, our program requested queued "visits" of DQ Tau 20 times per orbital cycle for 10 continuous orbital periods. Given the orbital period of DQ Tau, the visit cadence corresponded to ~20hr. Each visit consisted of three observations in each of the broadband UBVRIY and narrowband Hα and Hβ filters, requiring ~20 minutes. In this work we present only the UBVR observations, which overlap with our high-cadence observations. Indeed, two eight-night observing runs centered on separate periastron passages of DQ Tau (orbital cycles 3 and 5 in Figure 1) were obtained from the WIYN 0.9m telescope located at the Kitt Peak National Observatory. In addition to our two eight-night observing runs, a synoptic observation program was also in place at the WIYN 0.9m that provided approximately weekly observations of DQ Tau in UBVR during the 2014-B semester. Also, using Apache Point Observatory's ARCSAT 0.5m telescope, we performed observing runs of seven and ten nights centered on two separate periastron passaged of DQ Tau (orbital cycles 2 and 7 in Figure 1). (1 data file).

Cross-layer active predictive congestion control protocol for wireless sensor networks.

Science.gov (United States)

Wan, Jiangwen; Xu, Xiaofeng; Feng, Renjian; Wu, Yinfeng

2009-01-01

In wireless sensor networks (WSNs), there are numerous factors that may cause network congestion problems, such as the many-to-one communication modes, mutual interference of wireless links, dynamic changes of network topology and the memory-restrained characteristics of nodes. All these factors result in a network being more vulnerable to congestion. In this paper, a cross-layer active predictive congestion control scheme (CL-APCC) for improving the performance of networks is proposed. Queuing theory is applied in the CL-APCC to analyze data flows of a single-node according to its memory status, combined with the analysis of the average occupied memory size of local networks. It also analyzes the current data change trends of local networks to forecast and actively adjust the sending rate of the node in the next period. In order to ensure the fairness and timeliness of the network, the IEEE 802.11 protocol is revised based on waiting time, the number of the node's neighbors and the original priority of data packets, which dynamically adjusts the sending priority of the node. The performance of CL-APCC, which is evaluated by extensive simulation experiments. is more efficient in solving the congestion in WSNs. Furthermore, it is clear that the proposed scheme has an outstanding advantage in terms of improving the fairness and lifetime of networks.

Extending the mirror neuron system model, II: what did I just do? A new role for mirror neurons.

Science.gov (United States)

Bonaiuto, James; Arbib, Michael A

2010-04-01

A mirror system is active both when an animal executes a class of actions (self-actions) and when it sees another execute an action of that class. Much attention has been given to the possible roles of mirror systems in responding to the actions of others but there has been little attention paid to their role in self-actions. In the companion article (Bonaiuto et al. Biol Cybern 96:9-38, 2007) we presented MNS2, an extension of the Mirror Neuron System model of the monkey mirror system trained to recognize the external appearance of its own actions as a basis for recognizing the actions of other animals when they perform similar actions. Here we further extend the study of the mirror system by introducing the novel hypotheses that a mirror system may additionally help in monitoring the success of a self-action and may also be activated by recognition of one's own apparent actions as well as efference copy from one's intended actions. The framework for this computational demonstration is a model of action sequencing, called augmented competitive queuing, in which action choice is based on the desirability of executable actions. We show how this "what did I just do?" function of mirror neurons can contribute to the learning of both executability and desirability which in certain cases supports rapid reorganization of motor programs in the face of disruptions.

Radio and Optical Telescopes for School Students and Professional Astronomers

Science.gov (United States)

Hosmer, Laura; Langston, G.; Heatherly, S.; Towner, A. P.; Ford, J.; Simon, R. S.; White, S.; O'Neil, K. L.; Haipslip, J.; Reichart, D.

2013-01-01

The NRAO 20m telescope is now on-line as a part of UNC's Skynet worldwide telescope network. The NRAO is completing integration of radio astronomy tools with the Skynet web interface. We present the web interface and astronomy projects that allow students and astronomers from all over the country to become Radio Astronomers. The 20 meter radio telescope at NRAO in Green Bank, WV is dedicated to public education and also is part of an experiment in public funding for astronomy. The telescope has a fantastic new web-based interface, with priority queuing, accommodating priority for paying customers and enabling free use of otherwise unused time. This revival included many software and hardware improvements including automatic calibration and improved time integration resulting in improved data processing, and a new ultra high resolution spectrometer. This new spectrometer is optimized for very narrow spectral lines, which will allow astronomers to study complex molecules and very cold regions of space in remarkable detail. In accordance with focusing on broader impacts, many public outreach and high school education activities have been completed with many confirmed future activities. The 20 meter is now a fully automated, powerful tool capable of professional grade results available to anyone in the world. Drop by our poster and try out real-time telescope control!

Data Collection, Access and Presentation Technologies in the National Ecological Observatory (NEON) Design (Invited)

Science.gov (United States)

Aulenbach, S. M.; Berukoff, S. J.

2010-12-01

The National Ecological Observatory Network (NEON) will collect data across the United States on the impacts of climate change, land use change and invasive species on ecosystem functions and biodiversity. In-situ sampling and distributed sensor networks, linked by an advanced cyberinfrastructure, will collect site-based data on a variety of organisms, soils, aquatic systems, atmosphere and climate. Targeted airborne remote sensing observations made by NEON as well as geographical data sets and satellite resources produced by Federal agencies will provide data at regional and national scales. The resulting data streams, collected over a 30-year period, will be synthesized into fully traceable information products that are freely and openly accessible to all users. We provide an overview of several collection, access and presentation technologies evaluated for use by observatory systems throughout the data product life cycle. Specifically, we discuss smart phone applications for citizen scientists as well as the use of handheld devices for sample collection and reporting from the field. Protocols for storing, queuing, and retrieving data from observatory sites located throughout the nation are highlighted as are the application of standards throughout the pipelined production of data products. We discuss the automated incorporation of provenance information and digital object identifiers for published data products. The use of widgets and personalized user portals for the discovery and dissemination of NEON data products are also presented.

Access Control Mechanism for IoT Environments Based on Modelling Communication Procedures as Resources

Science.gov (United States)

2018-01-01

Internet growth has generated new types of services where the use of sensors and actuators is especially remarkable. These services compose what is known as the Internet of Things (IoT). One of the biggest current challenges is obtaining a safe and easy access control scheme for the data managed in these services. We propose integrating IoT devices in an access control system designed for Web-based services by modelling certain IoT communication elements as resources. This would allow us to obtain a unified access control scheme between heterogeneous devices (IoT devices, Internet-based services, etc.). To achieve this, we have analysed the most relevant communication protocols for these kinds of environments and then we have proposed a methodology which allows the modelling of communication actions as resources. Then, we can protect these resources using access control mechanisms. The validation of our proposal has been carried out by selecting a communication protocol based on message exchange, specifically Message Queuing Telemetry Transport (MQTT). As an access control scheme, we have selected User-Managed Access (UMA), an existing Open Authorization (OAuth) 2.0 profile originally developed for the protection of Internet services. We have performed tests focused on validating the proposed solution in terms of the correctness of the access control system. Finally, we have evaluated the energy consumption overhead when using our proposal. PMID:29558406

Forecast and evaluation of performance of on-line radiation exposure management system in nuclear power plants

International Nuclear Information System (INIS)

Terano, Takao

1982-01-01

The computer systems used for nuclear power plants require high reliability and fast response for securing plant safety. Therefore, it is desirable to sufficiently scrutinize and investigate every work in advance by making total system if a computer system is to be introduced. In this paper, the on-line radiation management system, which is the main work of management computer system, is considered with a queuing simulation model, from the standpoint how the congestion at a TLD/ID station which manages the entering into and exiting from a controlled area is reduced. This is meaningful because it handles the major works of the system to be employed and predicts its performance considering the elements other than machine specifications, i.e., human behaviour. Seven conditions are assumed for the model in executing the simulation. The results are briefly as follows: (1) Queue at a TLD/ID station scarcely occurs in normal operation if 6 TLD devices are installed, but if any one device fails, waiting time increases twice or more. (2) Congestion may possibly be reduced without decreasing the whole efficiency if an appropriate management is done according to the degree of congestion. (3) If congestion is more serious, the increase of TLD devices may become necessary, but it is also important to execute the management such as reducing the attendant peak, for example, employing staggered office hours. (Wakatsuki, Y.)

Mass serving theory application to the analysis of maintenance system functioning

Directory of Open Access Journals (Sweden)

Veljko Predrag Petrović

2013-06-01

Full Text Available This paper describes models and conditions for the application of the Mass Serving Theory in order to analyze relations between clients demanding the service and channels which provide the service as well as to design technological elements in the optimal regime for the given maintenance system. Based on the actual data collected and the statistical analysis of the expected intensity of combat vehicle arrivals and queuing at service for tehnical maintenance, the mathematical modeling of a real process of queuing was carried out and certain parameters quantified, in terms of determining the weaknesses of the existing models and the corrective actions needed. Introduction While solving many practical problems within the process of maintenance, the technological demands (TD for maintenance appear with the characteristics of stochasticity and stationarity. These properties provide the ability of the Mass Serving Theory (MST to be used, under certain conditions, for the dimensioning of technological elements (TE in the reporting maintenance system.The analysis of the mass serving system (MSS means the analysis of the input stream of clients, time and number of customers in a queue, time of serving and the output stream of clients as well. Mahtemathical models of the mass serving system applicable to maintenance processes There are many mathematical models developed in the MST to analyze the relationship between clients demanding the serving and channels that serve them. In the mathematical models of mass serving, the following parameters are commonly used as inputs: Input stream intensity,Serving intensity of the TE, Number of channels, i.e. TE; as outputs: Serving probability of TD,The average number of TD in a serving queue, and The average time of stay in the TD queue. In practice, during the system sizing, the number of channels is usually required, i.e. TE (n necessary to serve the TD, and in certain situations Input stream intensity and Serving

A Comprehensive Sensitivity Analysis of a Data Center Network with Server Virtualization for Business Continuity

Directory of Open Access Journals (Sweden)

Tuan Anh Nguyen

2015-01-01

Full Text Available Sensitivity assessment of availability for data center networks (DCNs is of paramount importance in design and management of cloud computing based businesses. Previous work has presented a performance modeling and analysis of a fat-tree based DCN using queuing theory. In this paper, we present a comprehensive availability modeling and sensitivity analysis of a DCell-based DCN with server virtualization for business continuity using stochastic reward nets (SRN. We use SRN in modeling to capture complex behaviors and dependencies of the system in detail. The models take into account (i two DCell configurations, respectively, composed of two and three physical hosts in a DCell0 unit, (ii failure modes and corresponding recovery behaviors of hosts, switches, and VMs, and VM live migration mechanism within and between DCell0s, and (iii dependencies between subsystems (e.g., between a host and VMs and between switches and VMs in the same DCell0. The constructed SRN models are analyzed in detail with regard to various metrics of interest to investigate system’s characteristics. A comprehensive sensitivity analysis of system availability is carried out in consideration of the major impacting parameters in order to observe the system’s complicated behaviors and find the bottlenecks of system availability. The analysis results show the availability improvement, capability of fault tolerance, and business continuity of the DCNs complying with DCell network topology. This study provides a basis of designing and management of DCNs for business continuity.

Building a robust distributed system: some lessons from R-GMA

International Nuclear Information System (INIS)

Bhatti, P; Duncan, A; Fisher, S M; Jiang, M; Kuseju, A O; Paventhan, A; Wilson, A J

2008-01-01

R-GMA, as deployed by LCG, is a large distributed system. We are currently addressing some design issues to make it highly reliable, and fault tolerant. In validating the new design, there were two classes of problems to consider: one related to the flow of data and the other to the loss of control messages. R-GMA streams data from one place to another; there is a need to consider the behaviour when data is being inserted more rapidly into the system than taken out and more generally how to deal with bottlenecks. In the original R-GMA design the system tried hard to deliver all control messages; those messages that were not delivered quickly were queued for retry later. Badly configured firewalls, network problems or very slow machines could all lead to long queues of messages; many of the messages on the queue should have been replaced by later ones. In the new design no individual control message is critical; the system just needs to know if each message was received successfully. The system should also avoid single points of failure. However this can require complex code resulting in a system that is actually less reliable. We describe how we have dealt with bottlenecks in the flow of data, loss of control messages and the elimination of single points of failure to produce a robust R-GMA design. The work presented, though in the context of R-GMA, is applicable to any large distributed system

Models of emergency departments for reducing patient waiting times.

Directory of Open Access Journals (Sweden)

Marek Laskowski

Full Text Available In this paper, we apply both agent-based models and queuing models to investigate patient access and patient flow through emergency departments. The objective of this work is to gain insights into the comparative contributions and limitations of these complementary techniques, in their ability to contribute empirical input into healthcare policy and practice guidelines. The models were developed independently, with a view to compare their suitability to emergency department simulation. The current models implement relatively simple general scenarios, and rely on a combination of simulated and real data to simulate patient flow in a single emergency department or in multiple interacting emergency departments. In addition, several concepts from telecommunications engineering are translated into this modeling context. The framework of multiple-priority queue systems and the genetic programming paradigm of evolutionary machine learning are applied as a means of forecasting patient wait times and as a means of evolving healthcare policy, respectively. The models' utility lies in their ability to provide qualitative insights into the relative sensitivities and impacts of model input parameters, to illuminate scenarios worthy of more complex investigation, and to iteratively validate the models as they continue to be refined and extended. The paper discusses future efforts to refine, extend, and validate the models with more data and real data relative to physical (spatial-topographical and social inputs (staffing, patient care models, etc.. Real data obtained through proximity location and tracking system technologies is one example discussed.

Results from an evaluation of tobacco control policies at the 2010 Shanghai World Expo.

Science.gov (United States)

Li, Xiang; Zheng, PinPin; Fu, Hua; Berg, Carla; Kegler, Michelle

2013-09-01

Large-scale international events such as World Expos and Olympic Games have the potential to strengthen smoke-free norms globally. The Shanghai 2010 World Expo was one of the first large-scale events to implement and evaluate the adoption of strict tobacco control policies. To evaluate implementation of tobacco control policies at the 2010 World Expo in Shanghai, China. This mixed methods evaluation was conducted from July to October 2010. Observations were conducted in all 155 pavilions and outdoor queuing areas, all 45 souvenir shops, a random sample of restaurants (51 of 119) and selected outdoor non-smoking areas in all sections of the Expo. In addition, intercept surveys were completed with 3022 visitors over a 4-month period. All pavilions and souvenir shops were smoke-free. Restaurants were smoke-free, with only 0.1% of customers observed smoking. Smoking was more common in outdoor non-smoking areas, but still relatively rare overall with only 4.5% of visitors observed smoking. Tobacco products were not sold or marketed in any public settings except for three pavilions that had special exemptions from the policy. Overall, 80.3% of visitors were aware of the smoke-free policy at the World Expo, 92.5% of visitors supported the policy and 97.1% of visitors were satisfied with the smoke-free environment. Tobacco control policies at the World Expo sites were generally well-enforced and accepted although compliance was not 100%, particularly in outdoor non-smoking areas.

Action and perception in literacy: A common-code for spelling and reading.

Science.gov (United States)

Houghton, George

2018-01-01

There is strong evidence that reading and spelling in alphabetical scripts depend on a shared representation (common-coding). However, computational models usually treat the two skills separately, producing a wide variety of proposals as to how the identity and position of letters is represented. This article treats reading and spelling in terms of the common-coding hypothesis for perception-action coupling. Empirical evidence for common representations in spelling-reading is reviewed. A novel version of the Start-End Competitive Queuing (SE-CQ) spelling model is introduced, and tested against the distribution of positional errors in Letter Position Dysgraphia, data from intralist intrusion errors in spelling to dictation, and dysgraphia because of nonperipheral neglect. It is argued that no other current model is equally capable of explaining this range of data. To pursue the common-coding hypothesis, the representation used in SE-CQ is applied, without modification, to the coding of letter identity and position for reading and lexical access, and a lexical matching rule for the representation is proposed (Start End Position Code model, SE-PC). Simulations show the model's compatibility with benchmark findings from form priming, its ability to account for positional effects in letter identification priming and the positional distribution of perseverative intrusion errors. The model supports the view that spelling and reading use a common orthographic description, providing a well-defined account of the major features of this representation. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

THE CAPACITY AND CIRCULATION OF PASSENGER TERMINAL BUILDING IN REGIONAL AIRPORT (CASE: MINANGKABAU AND ADISUTJIPTO INTERNATIONAL AIRPORTS OF INDONESIA

Directory of Open Access Journals (Sweden)

Amalia Defiani

2013-05-01

Full Text Available The dissertation explains about capacity and flow inside terminal buildings in two regional airports in Indonesia: Minangkabau and Adisutjipto International Airports. Both airports have similar characteristics of passengers’ number and locations as tourism areas. Secondary data in the form of existing terminal layouts and air traffic numbers were gained from both airports authorities in Indonesia. The analysis was carried out using the formulas from Japan International Cooperation Agency – Directorate General of Civil Aviation of Indonesia(JICA-DGCA studies in 1996 for significant areas in the terminal building, Ashford and Wright formula for calculating aircraft movement per hour, Microsoft Excel for calculating the 10-year passenger growth rate, and SPSS for determining the linear equation for domestic departure resulted in the forecasted saturation in the near 2020 for both of airports, especially on passengers’ handling areas such as boarding lounge (for departure and baggage claim area (for arrival. The research resulted in ideas to overcome problems related to the increasing capacity by adding areas (if possible and changing layouts. Some other options such as implementation of more effective signage and the suggestion of centralizing security checking areas also are being brought—though needed further research. There should be an addition of numbers of security check lines, appropriately to the increasing number of passengers. If a single queuing line creates delays, then the need for extra line(s is a necessity Keywords: Airport, Terminal Building, Capacity, Flow, Minangkabau, Adisutjipto

Multiple-task real-time PDP-15 operating system for data acquisition and analysis

International Nuclear Information System (INIS)

Myers, W.R.

1974-01-01

The RAMOS operating system is capable of handling up to 72 simultaneous tasks in an interrupt-driven environment. The minimum viable hardware configuration includes a Digital Equipment Corporation PDP-15 computer with 16384 words of memory, extended arithmetic element, automatic priority interrupt, a 256K-word RS09 DECdisk, two DECtape transports, and an alphanumeric keyboard/typer. The monitor executes major tasks by loading disk-resident modules to memory for execution; modules are written in a format that allows page-relocation by the monitor, and can be loaded into any available page. All requests for monitor service by tasks, including input/output, floating point arithmetic, request for additional memory, task initiation, etc., are implemented by privileged monitor calls (CAL). All IO device handlers are capable of queuing requests for service, allowing several tasks ''simultaneous'' use of all resources. All alphanumeric IO (including the PC05) is completely buffered and handled by a single multiplexing routine. The floating point arithmetic software is re-entrant to all operating modules and includes matrix arithmetic functions. One of the system tasks can be a ''batch'' job, controlled by simulating an alphanumeric command terminal through cooperative functions of the disk handler and alphanumeric device software. An alphanumeric control sequence may be executed, automatically accessing disk-resident tasks in any prescribed order; a library of control sequences is maintained on bulk storage for access by the monitor. (auth)

A novel approach to multihazard modeling and simulation.

Science.gov (United States)

Smith, Silas W; Portelli, Ian; Narzisi, Giuseppe; Nelson, Lewis S; Menges, Fabian; Rekow, E Dianne; Mincer, Joshua S; Mishra, Bhubaneswar; Goldfrank, Lewis R

2009-06-01

To develop and apply a novel modeling approach to support medical and public health disaster planning and response using a sarin release scenario in a metropolitan environment. An agent-based disaster simulation model was developed incorporating the principles of dose response, surge response, and psychosocial characteristics superimposed on topographically accurate geographic information system architecture. The modeling scenarios involved passive and active releases of sarin in multiple transportation hubs in a metropolitan city. Parameters evaluated included emergency medical services, hospital surge capacity (including implementation of disaster plan), and behavioral and psychosocial characteristics of the victims. In passive sarin release scenarios of 5 to 15 L, mortality increased nonlinearly from 0.13% to 8.69%, reaching 55.4% with active dispersion, reflecting higher initial doses. Cumulative mortality rates from releases in 1 to 3 major transportation hubs similarly increased nonlinearly as a function of dose and systemic stress. The increase in mortality rate was most pronounced in the 80% to 100% emergency department occupancy range, analogous to the previously observed queuing phenomenon. Effective implementation of hospital disaster plans decreased mortality and injury severity. Decreasing ambulance response time and increasing available responding units reduced mortality among potentially salvageable patients. Adverse psychosocial characteristics (excess worry and low compliance) increased demands on health care resources. Transfer to alternative urban sites was possible. An agent-based modeling approach provides a mechanism to assess complex individual and systemwide effects in rare events.

Optimizing the night time with dome vents and SNR-QSO at CFHT

Science.gov (United States)

Devost, Daniel; Mahoney, Billy; Moutou, Claire; CFHT QSO Team, CFHT software Group

2017-06-01

Night time is a precious and costly commodity and it is important to get everything we can out of every second of every night of observing. In 2012 the Canada-France-Hawaii Telescope started operating 12 new vent doors installed on the dome over the course of the previous two years. The project was highly successful and seeing measurements show that venting the dome greatly enhances image quality at the focal plane. In order to capitalize on the gains brought by the new vents, the observatory started exploring a new mode of observation called SNR-QSO. This mode consist of a new implementation inside our Queued Service Observation (QSO) system. Exposure times are adjusted for each frame depending on the weather conditions in order to reach a specific depth, Signal to Noise Ratio (SNR) at a certain magnitude. The goal of this new mode is to capitalize on the exquisite seeing provided by Maunakea, complemented by the minimized dome turbulence, to use the least amount of time to reach the depth required by the science programs. Specific implementations were successfully tested on two different instruments, our wide field camera MegaCam and our high resolution spectrograph ESPaDOnS. I will present the methods used for each instrument to achieve SNR observing and the gains produced by these new observing modes in order to reach the scientific goals of accepted programs in a shorter amount of time.

Queue Management Practices of Quick ServiceRestaurants (QSR in Lipa City, Philippines

Directory of Open Access Journals (Sweden)

Leoven A. Austria

2015-12-01

Full Text Available –Problems regarding waiting line in quick service restaurants (QSR has been one of the main concerns of industries and scholars nowadays. It is because people today demand not only for qualityfood but also for speed. Quick service restaurant players explore on the approaches to optimize the efficiency of restaurant management. One important area that defines how well and efficient a fast food restaurant delivers its product and services to customers is its waiting line (queue management practices. The study was conducted at Lipa City, involving five popular quick service restaurants named by the researcher as QSR A, B, C, D, and E. It made used of 363customer respondents proportionally obtained from five restaurants.It intended to assess the extent of implementation of the queue management practices of the restaurants and the level of satisfaction of the customers in such practices in terms of customer arrival, waiting line and service facility. The findings revealed the queuing system used and the waiting line structured utilized by the restaurants. The extent of implementation of the queue management practices in the three areas mentioned of the five QSR’s was presented comparatively. Likewise, the level of customer’s satisfaction on the queue management practices was also determined. Significant difference in the extent of implementation and in the level of customer satisfaction were determined if the respondents were grouped according to restaurant’s profile. Recommendations in the improvement of queue were given based on the findings.

QSpike Tools: a Generic Framework for Parallel Batch Preprocessing of Extracellular Neuronal Signals Recorded by Substrate Microelectrode Arrays

Directory of Open Access Journals (Sweden)

Mufti eMahmud

2014-03-01

Full Text Available Micro-Electrode Arrays (MEAs have emerged as a mature technique to investigate brain (dysfunctions in vivo and in in vitro animal models. Often referred to as smart Petri dishes, MEAs has demonstrated a great potential particularly for medium-throughput studies in vitro, both in academic and pharmaceutical industrial contexts. Enabling rapid comparison of ionic/pharmacological/genetic manipulations with control conditions, MEAs are often employed to screen compounds by monitoring non-invasively the spontaneous and evoked neuronal electrical activity in longitudinal studies, with relatively inexpensive equipment. However, in order to acquire sufficient statistical significance, recordings last up to tens of minutes and generate large amount of raw data (e.g., 60 channels/MEA, 16 bits A/D conversion, 20kHz sampling rate: ~8GB/MEA,h uncompressed. Thus, when the experimental conditions to be tested are numerous, the availability of fast, standardized, and automated signal preprocessing becomes pivotal for any subsequent analysis and data archiving. To this aim, we developed an in-house cloud-computing system, named QSpike Tools, where CPU-intensive operations, required for preprocessing of each recorded channel (e.g., filtering, multi-unit activity detection, spike-sorting, etc., are decomposed and batch-queued to a multi-core architecture or to computer cluster. With the commercial availability of new and inexpensive high-density MEAs, we believe that disseminating QSpike Tools might facilitate its wide adoption and customization, and possibly inspire the creation of community-supported cloud-computing facilities for MEAs users.

Automated Traffic Management System and Method

Science.gov (United States)

Glass, Brian J. (Inventor); Spirkovska, Liljana (Inventor); McDermott, William J. (Inventor); Reisman, Ronald J. (Inventor); Gibson, James (Inventor); Iverson, David L. (Inventor)

2000-01-01

A data management system and method that enables acquisition, integration, and management of real-time data generated at different rates, by multiple heterogeneous incompatible data sources. The system achieves this functionality by using an expert system to fuse data from a variety of airline, airport operations, ramp control, and air traffic control tower sources, to establish and update reference data values for every aircraft surface operation. The system may be configured as a real-time airport surface traffic management system (TMS) that electronically interconnects air traffic control, airline data, and airport operations data to facilitate information sharing and improve taxi queuing. In the TMS operational mode, empirical data shows substantial benefits in ramp operations for airlines, reducing departure taxi times by about one minute per aircraft in operational use, translating as $12 to $15 million per year savings to airlines at the Atlanta, Georgia airport. The data management system and method may also be used for scheduling the movement of multiple vehicles in other applications, such as marine vessels in harbors and ports, trucks or railroad cars in ports or shipping yards, and railroad cars in switching yards. Finally, the data management system and method may be used for managing containers at a shipping dock, stock on a factory floor or in a warehouse, or as a training tool for improving situational awareness of FAA tower controllers, ramp and airport operators, or commercial airline personnel in airfield surface operations.

National Ignition Facility and Managing Location, Component, and State

Energy Technology Data Exchange (ETDEWEB)

Foxworthy, C; Fung, T; Beeler, R; Li, J; Dugorepec, J; Chang, C

2011-07-25

The National Ignition Facility (NIF) at the Lawrence Livermore National Laboratory is a stadium-sized facility that contains a 192-beam, 1.8-Megajoule, 500-Terawatt, ultraviolet laser system coupled with a 10-meter diameter target chamber. There are over 6,200 Line Replaceable Units (LRUs) comprised of more than 104,000 serialized parts that make up the NIF. Each LRU is a modular unit typically composed of a mechanical housing, laser optics (glass, lenses, or mirrors), and utilities. To date, there are more than 120,000 data sets created to characterize the attributes of these parts. Greater than 51,000 Work Permits have been issued to install, maintain, and troubleshoot the components. One integrated system is used to manage these data, and more. The Location Component and State (LoCoS) system is a web application built using Java Enterprise Edition technologies and is accessed by over 1,200 users. It is either directly or indirectly involved with each aspect of NIF work activity, and interfaces with ten external systems including the Integrated Computer Control System (ICCS) and the Laser Performance Operations Model (LPOM). Besides providing business functionality, LoCoS also acts as the NIF enterprise service bus. In this role, numerous integration approaches had to be adopted including: file exchange, database sharing, queuing, and web services in order to accommodate various business, technical, and security requirements. Architecture and implementation decisions are discussed.

Two analytical models for evaluating performance of Gigabit Ethernet Hosts

International Nuclear Information System (INIS)

Salah, K.

2006-01-01

Two analytical models are developed to study the impact of interrupt overhead on operating system performance of network hosts when subjected to Gigabit network traffic. Under heavy network traffic, the system performance will be negatively affected due to interrupt overhead caused by incoming traffic. In particular, excessive latency and significant degradation in system throughput can be experienced. Also user application may livelock as the CPU power is mostly consumed by interrupt handling and protocol processing. In this paper we present and compare two analytical models that capture host behavior and evaluate its performance. The first model is based Markov processes and queuing theory, while the second, which is more accurate but more complex is a pure Markov process. For the most part both models give mathematically-equivalent closed-form solutions for a number of important system performance metrics. These metrics include throughput, latency and stability condition, CPU utilization of interrupt handling and protocol processing and CPU availability for user applications. The analysis yields insight into understanding and predicting the impact of system and network choices on the performance of interrupt-driven systems when subjected to light and heavy network loads. More, importantly, our analytical work can also be valuable in improving host performance. The paper gives guidelines and recommendations to address design and implementation issues. Simulation and reported experimental results show that our analytical models are valid and give a good approximation. (author)

Application of the Linux cluster for exhaustive window haplotype analysis using the FBAT and Unphased programs.

Science.gov (United States)

Mishima, Hiroyuki; Lidral, Andrew C; Ni, Jun

2008-05-28

Genetic association studies have been used to map disease-causing genes. A newly introduced statistical method, called exhaustive haplotype association study, analyzes genetic information consisting of different numbers and combinations of DNA sequence variations along a chromosome. Such studies involve a large number of statistical calculations and subsequently high computing power. It is possible to develop parallel algorithms and codes to perform the calculations on a high performance computing (HPC) system. However, most existing commonly-used statistic packages for genetic studies are non-parallel versions. Alternatively, one may use the cutting-edge technology of grid computing and its packages to conduct non-parallel genetic statistical packages on a centralized HPC system or distributed computing systems. In this paper, we report the utilization of a queuing scheduler built on the Grid Engine and run on a Rocks Linux cluster for our genetic statistical studies. Analysis of both consecutive and combinational window haplotypes was conducted by the FBAT (Laird et al., 2000) and Unphased (Dudbridge, 2003) programs. The dataset consisted of 26 loci from 277 extended families (1484 persons). Using the Rocks Linux cluster with 22 compute-nodes, FBAT jobs performed about 14.4-15.9 times faster, while Unphased jobs performed 1.1-18.6 times faster compared to the accumulated computation duration. Execution of exhaustive haplotype analysis using non-parallel software packages on a Linux-based system is an effective and efficient approach in terms of cost and performance.

QSpike tools: a generic framework for parallel batch preprocessing of extracellular neuronal signals recorded by substrate microelectrode arrays.

Science.gov (United States)

Mahmud, Mufti; Pulizzi, Rocco; Vasilaki, Eleni; Giugliano, Michele

2014-01-01

Micro-Electrode Arrays (MEAs) have emerged as a mature technique to investigate brain (dys)functions in vivo and in in vitro animal models. Often referred to as "smart" Petri dishes, MEAs have demonstrated a great potential particularly for medium-throughput studies in vitro, both in academic and pharmaceutical industrial contexts. Enabling rapid comparison of ionic/pharmacological/genetic manipulations with control conditions, MEAs are employed to screen compounds by monitoring non-invasively the spontaneous and evoked neuronal electrical activity in longitudinal studies, with relatively inexpensive equipment. However, in order to acquire sufficient statistical significance, recordings last up to tens of minutes and generate large amount of raw data (e.g., 60 channels/MEA, 16 bits A/D conversion, 20 kHz sampling rate: approximately 8 GB/MEA,h uncompressed). Thus, when the experimental conditions to be tested are numerous, the availability of fast, standardized, and automated signal preprocessing becomes pivotal for any subsequent analysis and data archiving. To this aim, we developed an in-house cloud-computing system, named QSpike Tools, where CPU-intensive operations, required for preprocessing of each recorded channel (e.g., filtering, multi-unit activity detection, spike-sorting, etc.), are decomposed and batch-queued to a multi-core architecture or to a computers cluster. With the commercial availability of new and inexpensive high-density MEAs, we believe that disseminating QSpike Tools might facilitate its wide adoption and customization, and inspire the creation of community-supported cloud-computing facilities for MEAs users.

National Ignition Facility and Managing Location, Component, and State

International Nuclear Information System (INIS)

Foxworthy, C.; Fung, T.; Beeler, R.; Li, J.; Dugorepec, J.; Chang, C.

2011-01-01

The National Ignition Facility (NIF) at the Lawrence Livermore National Laboratory is a stadium-sized facility that contains a 192-beam, 1.8-Megajoule, 500-Terawatt, ultraviolet laser system coupled with a 10-meter diameter target chamber. There are over 6,200 Line Replaceable Units (LRUs) comprised of more than 104,000 serialized parts that make up the NIF. Each LRU is a modular unit typically composed of a mechanical housing, laser optics (glass, lenses, or mirrors), and utilities. To date, there are more than 120,000 data sets created to characterize the attributes of these parts. Greater than 51,000 Work Permits have been issued to install, maintain, and troubleshoot the components. One integrated system is used to manage these data, and more. The Location Component and State (LoCoS) system is a web application built using Java Enterprise Edition technologies and is accessed by over 1,200 users. It is either directly or indirectly involved with each aspect of NIF work activity, and interfaces with ten external systems including the Integrated Computer Control System (ICCS) and the Laser Performance Operations Model (LPOM). Besides providing business functionality, LoCoS also acts as the NIF enterprise service bus. In this role, numerous integration approaches had to be adopted including: file exchange, database sharing, queuing, and web services in order to accommodate various business, technical, and security requirements. Architecture and implementation decisions are discussed.

Patch dynamics of a foraging assemblage of bees.

Science.gov (United States)

Wright, David Hamilton

1985-03-01

The composition and dynamics of foraging assemblages of bees were examined from the standpoint of species-level arrival and departure processes in patches of flowers. Experiments with bees visiting 4 different species of flowers in subalpine meadows in Colorado gave the following results: 1) In enriched patches the rates of departure of bees were reduced, resulting in increases in both the number of bees per species and the average number of species present. 2) The reduction in bee departure rates from enriched patches was due to mechanical factors-increased flower handling time, and to behavioral factors-an increase in the number of flowers visited per inflorescence and in the number of inflorescences visited per patch. Bees foraging in enriched patches could collect nectar 30-45% faster than those foraging in control patches. 3) The quantitative changes in foraging assemblages due to enrichment, in terms of means and variances of species population sizes, fraction of time a species was present in a patch, and in mean and variance of the number of species present, were in reasonable agreement with predictions drawn from queuing theory and studies in island biogeography. 4) Experiments performed with 2 species of flowers with different corolla tube lengths demonstrated that manipulation of resources of differing availability had unequal effects on particular subsets of the larger foraging community. The arrival-departure process of bees on flowers and the immigration-extinction process of species on islands are contrasted, and the value of the stochastic, species-level approach to community composition is briefly discussed.

Influence of road network and population demand assumptions in evacuation modeling for distant tsunamis

Science.gov (United States)

Henry, Kevin; Wood, Nathan J.; Frazier, Tim G.

2017-01-01

Tsunami evacuation planning in coastal communities is typically focused on local events where at-risk individuals must move on foot in a matter of minutes to safety. Less attention has been placed on distant tsunamis, where evacuations unfold over several hours, are often dominated by vehicle use and are managed by public safety officials. Traditional traffic simulation models focus on estimating clearance times but often overlook the influence of varying population demand, alternative modes, background traffic, shadow evacuation, and traffic management alternatives. These factors are especially important for island communities with limited egress options to safety. We use the coastal community of Balboa Island, California (USA), as a case study to explore the range of potential clearance times prior to wave arrival for a distant tsunami scenario. We use a first-in–first-out queuing simulation environment to estimate variations in clearance times, given varying assumptions of the evacuating population (demand) and the road network over which they evacuate (supply). Results suggest clearance times are less than wave arrival times for a distant tsunami, except when we assume maximum vehicle usage for residents, employees, and tourists for a weekend scenario. A two-lane bridge to the mainland was the primary traffic bottleneck, thereby minimizing the effect of departure times, shadow evacuations, background traffic, boat-based evacuations, and traffic light timing on overall community clearance time. Reducing vehicular demand generally reduced clearance time, whereas improvements to road capacity had mixed results. Finally, failure to recognize non-residential employee and tourist populations in the vehicle demand substantially underestimated clearance time.

A framework of call admission control procedures for integrated services mobile wireless networks

International Nuclear Information System (INIS)

Mahmoud, Ashraf S. Hasan; Al-Qahtani, Salman A.

2007-01-01

This paper presents a general framework for a wide range of call admission control (CAC) algorithms. For several CAC schemes, which are a subset of this general framework, an analytical performance evaluation is presented for a multi-traffic mobile wireless network. These CAC algorithms consider a variety of mechanisms to prioritize traffic in an attempt to support different levels of quality of service (QoS) for different types of calls. These mechanisms include dividing the handoff traffic into more than one class and using guard channels or allowing channel splitting to admit more handoff calls. Other mechanisms aimed at adding priority for handoff calls consider employing queuing of handoff calls or dynamically reducing the number lower priority calls. Furthermore our analysis relaxes the typically used assumptions of equal channel holding time and equal resource usage for voice and data calls. The main contribution of this paper is the development of an analytical model for each of the three CAC algorithms specified in this study. In addition to the call blocking and termination probabilities which are usually cited as the performance metrics, in this work we derive and evaluate other metrics that not have be considered by the previous work such as the average queue length, the average queue residency, and the time-out probability for handoff calls. We also develop a simulation tool to test and verify our results. Finally, we present numerical examples to demonstrate the performance of the proposed CAG algorithms and we show that analytical and simulation results are in total agreement. (author)

Attitudes and opinions of nursing and medical staff regarding the supply and storage of medicinal products before and after the installation of a drawer-based automated stock-control system.

Science.gov (United States)

Ardern-Jones, Joanne; Hughes, Donald K; Rowe, Philip H; Mottram, David R; Green, Christopher F

2009-04-01

This study assessed the attitudes of Emergency Department (ED) staff regarding the introduction of an automated stock-control system. The objectives were to determine attitudes to stock control and replenishment, speed of access to the system, ease of use and the potential for future uses of the system. The study was carried out in the Countess of Chester Hospital NHS Foundation Trust (COCH) ED, which is attended by over 65,000 patients each year. All 68 ED staff were sent pre-piloted, semi-structured questionnaires and reminders, before and after automation of medicines stock control. Pre-implementation, 35 staff (66.1% of respondents) reported that problems occurred with access to medicine storage keys 'very frequently' or 'frequently'. Twenty-eight (52.8%) respondents 'agreed' or 'strongly agreed' that medicines were quickly accessed, which rose to 41 (77%) post-automation (P fluids and refrigerated items. Twenty-seven (51.9%) staff reported access to the system within 1 min and 17 (32.7%) staff reported access within 1-2 min. The majority of staff found the system 'easy' or 'very easy' to use and there was a non-significant relationship between previous use of information technology and acceptance of the system. From a staff satisfaction perspective, automation improved medicines storage, security and stock control, and addressed the problem of searching for keys to storage areas. Concerns over familiarity with computers, queuing, speed of access and an improved audit trail do not appear to have been issues, when compared with the previous manual storage of medicines.

Memory for serial order across domains: An overview of the literature and directions for future research.

Science.gov (United States)

Hurlstone, Mark J; Hitch, Graham J; Baddeley, Alan D

2014-03-01

From vocabulary learning to imitating sequences of motor actions, the ability to plan, represent, and recall a novel sequence of items in the correct order is fundamental for many verbal and nonverbal higher level cognitive activities. Here we review phenomena of serial order documented across the verbal, visual, and spatial short-term memory domains and interpret them with reference to the principles of serial order and ancillary assumptions instantiated in contemporary computational theories of memory for serial order. We propose that functional similarities across domains buttress the notion that verbal, visual, and spatial sequences are planned and controlled by a competitive queuing (CQ) mechanism in which items are simultaneously active in parallel and the strongest item is chosen for output. Within the verbal short-term memory CQ system, evidence suggests that serial order is represented via a primacy gradient, position marking, response suppression, and cumulative matching. Evidence further indicates that output interference operates during recall and that item similarity effects manifest during both serial order encoding and retrieval. By contrast, the principles underlying the representation of serial order in the visual and spatial CQ systems are unclear, largely because the relevant studies have yet to be performed. In the spatial domain, there is some evidence for a primacy gradient and position marking, whereas in the visual domain there is no direct evidence for either of the principles of serial order. We conclude by proposing some directions for future research designed to bridge this and other theoretical gaps in the literature.

Directory of Open Access Journals (Sweden)

Akram Elentably

2017-12-01

Full Text Available Inhabit in ports is original sin associated with delays, queuing and extra time of voyage and inhabit of ships and cargo at the port, which always occur with unpleasant consequences on Logistics and supply chain. These often translates into extra costs, loss of trade and disruption of trade and transport agreements. In a study to identify the consequences of port congestion on Logistics and supply chain operations in some African ports, this paper try to discovering the benefits of new Suez canal and reflection of Africa ports in addition Logistics area examined the common port congestion scenarios, their dimensions and the various factors that trigger inhabit in the ports of Lagos, Durban, Mombasa and the catchment ports focusing with expectation earning resulted by the new Suez canal. This paper typically applied the concept of variations in turn-around time of ships and cargo and the port’s capacity and relative efficiency level in order to identify the active factors that cause port congestion in African ports. The results provided some explanations on the consequences arising from these on notable African logistics and supply chain networks. The findings revealed that the bane of congestion in African ports emanates entirely from either planning, Regulation, capacity, efficiency or a combination of these. In addition therefore recommends that African ports should enhance their regulatory mechanisms, and then to improve capacity and efficiency level in order to shoulder the ever-increasing challenges of port congestion in years ahead with combined and take part of New Suez Canal advantages.

Synchrotron Imaging Computations on the Grid without the Computing Element

International Nuclear Information System (INIS)

Curri, A; Pugliese, R; Borghes, R; Kourousias, G

2011-01-01

Besides the heavy use of the Grid in the Synchrotron Radiation Facility (SRF) Elettra, additional special requirements from the beamlines had to be satisfied through a novel solution that we present in this work. In the traditional Grid Computing paradigm the computations are performed on the Worker Nodes of the grid element known as the Computing Element. A Grid middleware extension that our team has been working on, is that of the Instrument Element. In general it is used to Grid-enable instrumentation; and it can be seen as a neighbouring concept to that of the traditional Control Systems. As a further extension we demonstrate the Instrument Element as the steering mechanism for a series of computations. In our deployment it interfaces a Control System that manages a series of computational demanding Scientific Imaging tasks in an online manner. The instrument control in Elettra is done through a suitable Distributed Control System, a common approach in the SRF community. The applications that we present are for a beamline working in medical imaging. The solution resulted to a substantial improvement of a Computed Tomography workflow. The near-real-time requirements could not have been easily satisfied from our Grid's middleware (gLite) due to the various latencies often occurred during the job submission and queuing phases. Moreover the required deployment of a set of TANGO devices could not have been done in a standard gLite WN. Besides the avoidance of certain core Grid components, the Grid Security infrastructure has been utilised in the final solution.

LWAs computational platform for e-consultation using mobile devices: cases from developing nations.

Science.gov (United States)

Olajubu, Emmanuel Ajayi; Odukoya, Oluwatoyin Helen; Akinboro, Solomon Adegbenro

2014-01-01

Mobile devices have been impacting on human standard of living by providing timely and accurate information anywhere and anytime through wireless media in developing nations. Shortage of experts in medical fields is very obvious throughout the whole world but more pronounced in developing nations. Thus, this study proposes a telemedicine platform for the vulnerable areas of developing nations. The vulnerable area are the interior with little or no medical facilities, hence the dwellers are very susceptible to sicknesses and diseases. The framework uses mobile devices that can run LightWeight Agents (LWAs) to send consultation requests to a remote medical expert in urban city from the vulnerable interiors. The feedback is conveyed to the requester through the same medium. The system architecture which contained AgenRoller, LWAs, The front-end (mobile devices) and back-end (the medical server) is presented. The algorithm for the software component of the architecture (AgenRoller) is also presented. The system is modeled as M/M/1/c queuing system, and simulated using Simevents from MATLAB Simulink environment. The simulation result presented show the average queue length, the number of entities in the queue and the number of entities departure from the system. These together present the rate of information processing in the system. A full scale development of this system with proper implementation will help extend the few medical facilities available in the urban cities in developing nations to the interiors thereby reducing the number of casualties in the vulnerable areas of the developing world especially in Sub Saharan Africa.

Patient Safety Walkaround: a communication tool for the reallocation of health service resources

Science.gov (United States)

Ferorelli, Davide; Zotti, Fiorenza; Tafuri, Silvio; Pezzolla, Angela; Dell’Erba, Alessandro

2016-01-01

Abstract The study aims to evaluate the use of Patient Safety Walkaround (SWR) execution model in an Italian Hospital, through the adoption of parametric indices, survey tools, and process indicators. In the 1st meeting an interview was conducted to verify the knowledge of concepts of clinical risk management (process indicators). One month after, the questions provided by Frankel (survey tool) were administered. Each month after, an SWR has been carried trying to assist the healthcare professionals and collecting suggestions and solutions. Results have been classified according to Vincent model and analyzed to define an action plan. The amount of risk was quantified by the risk priority index (RPI). An organizational deficit concerns the management of the operating theatre. A state of intolerance was noticed of queuing patients for outpatient visits. The lack of scheduling of the operating rooms is often the cause of sudden displacements. A consequence is the conflict between patients and caregivers. Other causes of the increase of waiting times are the presence in the ward of a single trolley for medications and the presence of a single room for admission and preadmission of patients. Patients victims of allergic reactions have attributed such reactions to the presence of other patients in the process of acceptance and collection of medical history. All health professionals have reported the problem of n high number of relatives of the patients in the wards. Our study indicated the consistency of SWR as instrument to improve the quality of the care. PMID:27741109

SciDAC-Data, A Project to Enabling Data Driven Modeling of Exascale Computing

Energy Technology Data Exchange (ETDEWEB)

Mubarak, M.; Ding, P.; Aliaga, L.; Tsaris, A.; Norman, A.; Lyon, A.; Ross, R.

2016-10-10

The SciDAC-Data project is a DOE funded initiative to analyze and exploit two decades of information and analytics that have been collected by the Fermilab Data Center on the organization, movement, and consumption of High Energy Physics data. The project will analyze the analysis patterns and data organization that have been used by the NOvA, MicroBooNE, MINERvA and other experiments, to develop realistic models of HEP analysis workflows and data processing. The SciDAC-Data project aims to provide both realistic input vectors and corresponding output data that can be used to optimize and validate simulations of HEP analysis. These simulations are designed to address questions of data handling, cache optimization and workflow structures that are the prerequisites for modern HEP analysis chains to be mapped and optimized to run on the next generation of leadership class exascale computing facilities. We will address the use of the SciDAC-Data distributions acquired from Fermilab Data Center’s analysis workflows and corresponding to around 71,000 HEP jobs, as the input to detailed queuing simulations that model the expected data consumption and caching behaviors of the work running in HPC environments. In particular we describe in detail how the Sequential Access via Metadata (SAM) data handling system in combination with the dCache/Enstore based data archive facilities have been analyzed to develop the radically different models of the analysis of HEP data. We present how the simulation may be used to analyze the impact of design choices in archive facilities.

Adopting a child with cleft lip and palate: a study of parents' experiences.

Science.gov (United States)

Hansson, Emma; Ostman, Jenny; Becker, Magnus

2013-02-01

Adoption of Chinese children with cleft lip and palate (CLP) has become increasingly more common in Sweden. The aim of this study was to examine parents' experience when adopting a child with CLP. Since 2008, 34 adopted children with CLP have been treated in our department. A questionnaire was sent to 33 of the families and 30 of them answered (91%). The parents had queued from 1 month to 8 years before they were offered a child. Eighteen families reported that they received information on CLP from the adoption agency and 87% contacted the department of plastic surgery for additional information. In 15 cases (45%) previously unknown medical conditions or birth defects other than CLP were discovered in Sweden. Most parents (67%) had been informed before the adoption that their child could be a carrier of resistant bacteria, but not all had received enough information to grasp what it implies to be a carrier. The great majority of the families did not feel that the early hospitalisation for the first operation had a negative impact on the attachment between them and their adopted child. They thought that the aesthetic and functional results of the operations were "better than expected". Seventeen families stated that people react to the cleft and four of them think that the reactions are a problem. Presumptive adoptive parents should be informed that the child might have unsuspected medical conditions, resistant bacteria, what carriage implies, and that needed treatment and long-term results are not predictable.

Measurements of ultrafine particles and other vehicular pollutants inside school buses in South Texas

Science.gov (United States)

Zhang, Qunfang; Zhu, Yifang

2010-01-01

Increasing evidence has demonstrated toxic effects of vehicular emitted ultrafine particles (UFPs, diameter pollutants, especially UFPs, was measured inside four diesel-powered school buses. Two 1990 and two 2006 model year diesel-powered school buses were selected to represent the age extremes of school buses in service. Each bus was driven on two routine bus runs to study school children's exposure under different transportation conditions in South Texas. The number concentration and size distribution of UFPs, total particle number concentration, PM 2.5, PM 10, black carbon (BC), CO, and CO 2 levels were monitored inside the buses. The average total particle number concentrations observed inside the school buses ranged from 7.3 × 10 3 to 3.4 × 10 4 particles cm -3, depending on engine age and window position. When the windows were closed, the in-cabin air pollutants were more likely due to the school buses' self-pollution. The 1990 model year school buses demonstrated much higher air pollutant concentrations than the 2006 model year ones. When the windows were open, the majority of in-cabin air pollutants came from the outside roadway environment with similar pollutant levels observed regardless of engine ages. The highest average UFP concentration was observed at a bus transfer station where approximately 27 idling school buses were queued to load or unload students. Starting-up and idling generated higher air pollutant levels than the driving state. Higher in-cabin air pollutant concentrations were observed when more students were on board.

Implementation and use of a highly available and innovative IaaS solution: the Cloud Area Padovana

Science.gov (United States)

Aiftimiei, C.; Andreetto, P.; Bertocco, S.; Biasotto, M.; Dal Pra, S.; Costa, F.; Crescente, A.; Dorigo, A.; Fantinel, S.; Fanzago, F.; Frizziero, E.; Gulmini, M.; Michelotto, M.; Sgaravatto, M.; Traldi, S.; Venaruzzo, M.; Verlato, M.; Zangrando, L.

2015-12-01

While in the business world the cloud paradigm is typically implemented purchasing resources and services from third party providers (e.g. Amazon), in the scientific environment there's usually the need of on-premises IaaS infrastructures which allow efficient usage of the hardware distributed among (and owned by) different scientific administrative domains. In addition, the requirement of open source adoption has led to the choice of products like OpenStack by many organizations. We describe a use case of the Italian National Institute for Nuclear Physics (INFN) which resulted in the implementation of a unique cloud service, called ’Cloud Area Padovana’, which encompasses resources spread over two different sites: the INFN Legnaro National Laboratories and the INFN Padova division. We describe how this IaaS has been implemented, which technologies have been adopted and how services have been configured in high-availability (HA) mode. We also discuss how identity and authorization management were implemented, adopting a widely accepted standard architecture based on SAML2 and OpenID: by leveraging the versatility of those standards the integration with authentication federations like IDEM was implemented. We also discuss some other innovative developments, such as a pluggable scheduler, implemented as an extension of the native OpenStack scheduler, which allows the allocation of resources according to a fair-share based model and which provides a persistent queuing mechanism for handling user requests that can not be immediately served. Tools, technologies, procedures used to install, configure, monitor, operate this cloud service are also discussed. Finally we present some examples that show how this IaaS infrastructure is being used.

VML 3.0 Reactive Sequencing Objects and Matrix Math Operations for Attitude Profiling

Science.gov (United States)

Grasso, Christopher A.; Riedel, Joseph E.

2012-01-01

VML (Virtual Machine Language) has been used as the sequencing flight software on over a dozen JPL deep-space missions, most recently flying on GRAIL and JUNO. In conjunction with the NASA SBIR entitled "Reactive Rendezvous and Docking Sequencer", VML version 3.0 has been enhanced to include object-oriented element organization, built-in queuing operations, and sophisticated matrix / vector operations. These improvements allow VML scripts to easily perform much of the work that formerly would have required a great deal of expensive flight software development to realize. Autonomous turning and tracking makes considerable use of new VML features. Profiles generated by flight software are managed using object-oriented VML data constructs executed in discrete time by the VML flight software. VML vector and matrix operations provide the ability to calculate and supply quaternions to the attitude controller flight software which produces torque requests. Using VML-based attitude planning components eliminates flight software development effort, and reduces corresponding costs. In addition, the direct management of the quaternions allows turning and tracking to be tied in with sophisticated high-level VML state machines. These state machines provide autonomous management of spacecraft operations during critical tasks like a hypothetic Mars sample return rendezvous and docking. State machines created for autonomous science observations can also use this sort of attitude planning system, allowing heightened autonomy levels to reduce operations costs. VML state machines cannot be considered merely sequences - they are reactive logic constructs capable of autonomous decision making within a well-defined domain. The state machine approach enabled by VML 3.0 is progressing toward flight capability with a wide array of applicable mission activities.

Low latency adaptive streaming of HD H.264 video over 802.11 wireless networks with cross-layer feedback

Science.gov (United States)

Patti, Andrew; Tan, Wai-tian; Shen, Bo

2007-09-01

Streaming video in consumer homes over wireless IEEE 802.11 networks is becoming commonplace. Wireless 802.11 networks pose unique difficulties for streaming high definition (HD), low latency video due to their error-prone physical layer and media access procedures which were not designed for real-time traffic. HD video streaming, even with sophisticated H.264 encoding, is particularly challenging due to the large number of packet fragments per slice. Cross-layer design strategies have been proposed to address the issues of video streaming over 802.11. These designs increase streaming robustness by imposing some degree of monitoring and control over 802.11 parameters from application level, or by making the 802.11 layer media-aware. Important contributions are made, but none of the existing approaches directly take the 802.11 queuing into account. In this paper we take a different approach and propose a cross-layer design allowing direct, expedient control over the wireless packet queue, while obtaining timely feedback on transmission status for each packet in a media flow. This method can be fully implemented on a media sender with no explicit support or changes required to the media client. We assume that due to congestion or deteriorating signal-to-noise levels, the available throughput may drop substantially for extended periods of time, and thus propose video source adaptation methods that allow matching the bit-rate to available throughput. A particular H.264 slice encoding is presented to enable seamless stream switching between streams at multiple bit-rates, and we explore using new computationally efficient transcoding methods when only a high bit-rate stream is available.

Automated X-ray and Optical Analysis of the Virtual Observatory and Grid Computing

Science.gov (United States)

Ptak, A.; Krughoff, S.; Connolly, A.

2011-01-01

We are developing a system to combine the Web Enabled Source Identification with X-Matching (WESIX) web service, which emphasizes source detection on optical images,with the XAssist program that automates the analysis of X-ray data. XAssist is continuously processing archival X-ray data in several pipelines. We have established a workflow in which FITS images and/or (in the case of X ray data) an X-ray field can be input to WESIX. Intelligent services return available data (if requested fields have been processed) or submit job requests to a queue to be performed asynchronously. These services will be available via web services (for non-interactive use by Virtual Observatory portals and applications) and through web applications (written in the Django web application framework). We are adding web services for specific XAssist functionality such as determining .the exposure and limiting flux for a given position on the sky and extracting spectra and images for a given region. We are improving the queuing system in XAssist to allow for "watch lists" to be specified by users, and when X-ray fields in a user's watch list become publicly available they will be automatically added to the queue. XAssist is being expanded to be used as a survey planning 1001 when coupled with simulation software, including functionality for NuStar, eRosita, IXO, and the Wide Field Xray Telescope (WFXT), as part of an end to end simulation/analysis system. We are also investigating the possibility of a dedicated iPhone/iPad app for querying pipeline data, requesting processing, and administrative job control.