OSLG: A new granting scheme in WDM Ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Razmkhah, Ali; Rahbar, Akbar Ghaffarpour

2011-12-01

Several granting schemes have been proposed to grant transmission window and dynamic bandwidth allocation (DBA) in passive optical networks (PON). Generally, granting schemes suffer from bandwidth wastage of granted windows. Here, we propose a new granting scheme for WDM Ethernet PONs, called optical network unit (ONU) Side Limited Granting (OSLG) that conserves upstream bandwidth, thus resulting in decreasing queuing delay and packet drop ratio. In OSLG instead of optical line terminal (OLT), each ONU determines its transmission window. Two OSLG algorithms are proposed in this paper: the OSLG_GA algorithm that determines the size of its transmission window in such a way that the bandwidth wastage problem is relieved, and the OSLG_SC algorithm that saves unused bandwidth for more bandwidth utilization later on. The OSLG can be used as granting scheme of any DBA to provide better performance in the terms of packet drop ratio and queuing delay. Our performance evaluations show the effectiveness of OSLG in reducing packet drop ratio and queuing delay under different DBA techniques.

Proportional-integral and proportional-integral-derivative-based cyclic sleep controllers with anti-windup technique for energy-efficient and delay-aware passive optical networks

NASA Astrophysics Data System (ADS)

Kikuchi, Takahiro; Kubo, Ryogo

2016-08-01

In energy-efficient passive optical network (PON) systems, the increase in the queuing delays caused by the power-saving mechanism of optical network units (ONUs) is an important issue. Some researchers have proposed quality-of-service (QoS)-aware ONU cyclic sleep controllers in PON systems. We have proposed proportional (P) and proportional-derivative (PD)-based controllers to maintain the average queuing delay at a constant level regardless of the amount of downstream traffic. However, sufficient performance has not been obtained because of the sleep period limitation. In this paper, proportional-integral (PI) and proportional-integral-derivative (PID)-based controllers considering the sleep period limitation, i.e., using an anti-windup (AW) technique, are proposed to improve both the QoS and power-saving performance. Simulations confirm that the proposed controllers provide better performance than conventional controllers in terms of the average downstream queuing delay and the time occupancy of ONU active periods.

Discrete Event Simulation Models for CT Examination Queuing in West China Hospital.

PubMed

Luo, Li; Liu, Hangjiang; Liao, Huchang; Tang, Shijun; Shi, Yingkang; Guo, Huili

2016-01-01

In CT examination, the emergency patients (EPs) have highest priorities in the queuing system and thus the general patients (GPs) have to wait for a long time. This leads to a low degree of satisfaction of the whole patients. The aim of this study is to improve the patients' satisfaction by designing new queuing strategies for CT examination. We divide the EPs into urgent type and emergency type and then design two queuing strategies: one is that the urgent patients (UPs) wedge into the GPs' queue with fixed interval (fixed priority model) and the other is that the patients have dynamic priorities for queuing (dynamic priority model). Based on the data from Radiology Information Database (RID) of West China Hospital (WCH), we develop some discrete event simulation models for CT examination according to the designed strategies. We compare the performance of different strategies on the basis of the simulation results. The strategy that patients have dynamic priorities for queuing makes the waiting time of GPs decrease by 13 minutes and the degree of satisfaction increase by 40.6%. We design a more reasonable CT examination queuing strategy to decrease patients' waiting time and increase their satisfaction degrees.

Discrete Event Simulation Models for CT Examination Queuing in West China Hospital

PubMed Central

Luo, Li; Tang, Shijun; Shi, Yingkang; Guo, Huili

2016-01-01

In CT examination, the emergency patients (EPs) have highest priorities in the queuing system and thus the general patients (GPs) have to wait for a long time. This leads to a low degree of satisfaction of the whole patients. The aim of this study is to improve the patients' satisfaction by designing new queuing strategies for CT examination. We divide the EPs into urgent type and emergency type and then design two queuing strategies: one is that the urgent patients (UPs) wedge into the GPs' queue with fixed interval (fixed priority model) and the other is that the patients have dynamic priorities for queuing (dynamic priority model). Based on the data from Radiology Information Database (RID) of West China Hospital (WCH), we develop some discrete event simulation models for CT examination according to the designed strategies. We compare the performance of different strategies on the basis of the simulation results. The strategy that patients have dynamic priorities for queuing makes the waiting time of GPs decrease by 13 minutes and the degree of satisfaction increase by 40.6%. We design a more reasonable CT examination queuing strategy to decrease patients' waiting time and increase their satisfaction degrees. PMID:27547237

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

PubMed

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

2014-03-01

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

Using Queuing Theory and Simulation Model to Optimize Hospital Pharmacy Performance

PubMed Central

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

2014-01-01

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

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

NASA Technical Reports Server (NTRS)

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.

Queuing Time Prediction Using WiFi Positioning Data in an Indoor Scenario.

PubMed

Shu, Hua; Song, Ci; Pei, Tao; Xu, Lianming; Ou, Yang; Zhang, Libin; Li, Tao

2016-11-22

Queuing is common in urban public places. Automatically monitoring and predicting queuing time can not only help individuals to reduce their wait time and alleviate anxiety but also help managers to allocate resources more efficiently and enhance their ability to address emergencies. This paper proposes a novel method to estimate and predict queuing time in indoor environments based on WiFi positioning data. First, we use a series of parameters to identify the trajectories that can be used as representatives of queuing time. Next, we divide the day into equal time slices and estimate individuals' average queuing time during specific time slices. Finally, we build a nonstandard autoregressive (NAR) model trained using the previous day's WiFi estimation results and actual queuing time to predict the queuing time in the upcoming time slice. A case study comparing two other time series analysis models shows that the NAR model has better precision. Random topological errors caused by the drift phenomenon of WiFi positioning technology (locations determined by a WiFi positioning system may drift accidently) and systematic topological errors caused by the positioning system are the main factors that affect the estimation precision. Therefore, we optimize the deployment strategy during the positioning system deployment phase and propose a drift ratio parameter pertaining to the trajectory screening phase to alleviate the impact of topological errors and improve estimates. The WiFi positioning data from an eight-day case study conducted at the T3-C entrance of Beijing Capital International Airport show that the mean absolute estimation error is 147 s, which is approximately 26.92% of the actual queuing time. For predictions using the NAR model, the proportion is approximately 27.49%. The theoretical predictions and the empirical case study indicate that the NAR model is an effective method to estimate and predict queuing time in indoor public areas.

Queuing Time Prediction Using WiFi Positioning Data in an Indoor Scenario

PubMed Central

Shu, Hua; Song, Ci; Pei, Tao; Xu, Lianming; Ou, Yang; Zhang, Libin; Li, Tao

2016-01-01

Queuing is common in urban public places. Automatically monitoring and predicting queuing time can not only help individuals to reduce their wait time and alleviate anxiety but also help managers to allocate resources more efficiently and enhance their ability to address emergencies. This paper proposes a novel method to estimate and predict queuing time in indoor environments based on WiFi positioning data. First, we use a series of parameters to identify the trajectories that can be used as representatives of queuing time. Next, we divide the day into equal time slices and estimate individuals’ average queuing time during specific time slices. Finally, we build a nonstandard autoregressive (NAR) model trained using the previous day’s WiFi estimation results and actual queuing time to predict the queuing time in the upcoming time slice. A case study comparing two other time series analysis models shows that the NAR model has better precision. Random topological errors caused by the drift phenomenon of WiFi positioning technology (locations determined by a WiFi positioning system may drift accidently) and systematic topological errors caused by the positioning system are the main factors that affect the estimation precision. Therefore, we optimize the deployment strategy during the positioning system deployment phase and propose a drift ratio parameter pertaining to the trajectory screening phase to alleviate the impact of topological errors and improve estimates. The WiFi positioning data from an eight-day case study conducted at the T3-C entrance of Beijing Capital International Airport show that the mean absolute estimation error is 147 s, which is approximately 26.92% of the actual queuing time. For predictions using the NAR model, the proportion is approximately 27.49%. The theoretical predictions and the empirical case study indicate that the NAR model is an effective method to estimate and predict queuing time in indoor public areas. PMID:27879663

Performance Modeling of Network-Attached Storage Device Based Hierarchical Mass Storage Systems

NASA Technical Reports Server (NTRS)

Menasce, Daniel A.; Pentakalos, Odysseas I.

1995-01-01

Network attached storage devices improve I/O performance by separating control and data paths and eliminating host intervention during the data transfer phase. Devices are attached to both a high speed network for data transfer and to a slower network for control messages. Hierarchical mass storage systems use disks to cache the most recently used files and a combination of robotic and manually mounted tapes to store the bulk of the files in the file system. This paper shows how queuing network models can be used to assess the performance of hierarchical mass storage systems that use network attached storage devices as opposed to host attached storage devices. Simulation was used to validate the model. The analytic model presented here can be used, among other things, to evaluate the protocols involved in 1/0 over network attached devices.

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

PubMed

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 Relief Demands in an Emergency Supply Chain System under Large-Scale Disasters Based on a Queuing Network

PubMed Central

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

Capacity-constrained traffic assignment in networks with residual queues

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

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

2000-04-01

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

A queuing model for road traffic simulation

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

Guerrouahane, N.; Aissani, D.; Bouallouche-Medjkoune, L.

We present in this article a stochastic queuing model for the raod traffic. The model is based on the M/G/c/c state dependent queuing model, and is inspired from the deterministic Godunov scheme for the road traffic simulation. We first propose a variant of M/G/c/c state dependent model that works with density-flow fundamental diagrams rather than density-speed relationships. We then extend this model in order to consider upstream traffic demand as well as downstream traffic supply. Finally, we show how to model a whole raod by concatenating raod sections as in the deterministic Godunov scheme.

Modeling and measurement of fault-tolerant multiprocessors

NASA Technical Reports Server (NTRS)

Shin, K. G.; Woodbury, M. H.; Lee, Y. H.

1985-01-01

The workload effects on computer performance are addressed first for a highly reliable unibus multiprocessor used in real-time control. As an approach to studing these effects, a modified Stochastic Petri Net (SPN) is used to describe the synchronous operation of the multiprocessor system. From this model the vital components affecting performance can be determined. However, because of the complexity in solving the modified SPN, a simpler model, i.e., a closed priority queuing network, is constructed that represents the same critical aspects. The use of this model for a specific application requires the partitioning of the workload into job classes. It is shown that the steady state solution of the queuing model directly produces useful results. The use of this model in evaluating an existing system, the Fault Tolerant Multiprocessor (FTMP) at the NASA AIRLAB, is outlined with some experimental results. Also addressed is the technique of measuring fault latency, an important microscopic system parameter. Most related works have assumed no or a negligible fault latency and then performed approximate analyses. To eliminate this deficiency, a new methodology for indirectly measuring fault latency is presented.

Airport Facility Queuing Model Validation

DOT National Transportation Integrated Search

1977-05-01

Criteria are presented for selection of analytic models to represent waiting times due to queuing processes. An existing computer model by M.F. Neuts which assumes general nonparametric distributions of arrivals per unit time and service times for a ...

A dynamical framework for integrated corridor management.

DOT National Transportation Integrated Search

2016-01-11

We develop analysis and control synthesis tools for dynamic traffic flow over networks. Our analysis : relies on exploiting monotonicity properties of the dynamics, and on adapting relevant tools from : stochastic queuing networks. We develop proport...

Human Factors of Queuing: A Library Circulation Model.

ERIC Educational Resources Information Center

Mansfield, Jerry W.

1981-01-01

Classical queuing theories and their accompanying service facilities totally disregard the human factors in the name of efficiency. As library managers we need to be more responsive to human needs in the design of service points and make every effort to minimize queuing and queue frustration. Five references are listed. (Author/RAA)

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

PubMed

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

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

PubMed Central

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

Optimization of airport security process

NASA Astrophysics Data System (ADS)

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.

A queuing-theory-based interval-fuzzy robust two-stage programming model for environmental management under uncertainty

NASA Astrophysics Data System (ADS)

Sun, Y.; Li, Y. P.; Huang, G. H.

2012-06-01

In this study, a queuing-theory-based interval-fuzzy robust two-stage programming (QB-IRTP) model is developed through introducing queuing theory into an interval-fuzzy robust two-stage (IRTP) optimization framework. The developed QB-IRTP model can not only address highly uncertain information for the lower and upper bounds of interval parameters but also be used for analysing a variety of policy scenarios that are associated with different levels of economic penalties when the promised targets are violated. Moreover, it can reflect uncertainties in queuing theory problems. The developed method has been applied to a case of long-term municipal solid waste (MSW) management planning. Interval solutions associated with different waste-generation rates, different waiting costs and different arriving rates have been obtained. They can be used for generating decision alternatives and thus help managers to identify desired MSW management policies under various economic objectives and system reliability constraints.

Capacity utilization study for aviation security cargo inspection queuing system

NASA Astrophysics Data System (ADS)

Allgood, Glenn O.; Olama, Mohammed M.; Lake, Joe E.; Brumback, Daryl

2010-04-01

In this paper, we conduct performance evaluation study for an aviation security cargo inspection queuing system for material flow and accountability. The queuing model employed in our study is based on discrete-event simulation and processes various types of cargo simultaneously. Onsite measurements are collected in an airport facility to validate the queuing model. The overall performance of the aviation security cargo inspection system is computed, analyzed, and optimized for the different system dynamics. Various performance measures are considered such as system capacity, residual capacity, throughput, capacity utilization, subscribed capacity utilization, resources capacity utilization, subscribed resources capacity utilization, and number of cargo pieces (or pallets) in the different queues. These metrics are performance indicators of the system's ability to service current needs and response capacity to additional requests. We studied and analyzed different scenarios by changing various model parameters such as number of pieces per pallet, number of TSA inspectors and ATS personnel, number of forklifts, number of explosives trace detection (ETD) and explosives detection system (EDS) inspection machines, inspection modality distribution, alarm rate, and cargo closeout time. The increased physical understanding resulting from execution of the queuing model utilizing these vetted performance measures should reduce the overall cost and shipping delays associated with new inspection requirements.

Improving hospital bed occupancy and resource utilization through queuing modeling and evolutionary computation.

PubMed

Belciug, Smaranda; Gorunescu, Florin

2015-02-01

Scarce healthcare resources require carefully made policies ensuring optimal bed allocation, quality healthcare service, and adequate financial support. This paper proposes a complex analysis of the resource allocation in a hospital department by integrating in the same framework a queuing system, a compartmental model, and an evolutionary-based optimization. The queuing system shapes the flow of patients through the hospital, the compartmental model offers a feasible structure of the hospital department in accordance to the queuing characteristics, and the evolutionary paradigm provides the means to optimize the bed-occupancy management and the resource utilization using a genetic algorithm approach. The paper also focuses on a "What-if analysis" providing a flexible tool to explore the effects on the outcomes of the queuing system and resource utilization through systematic changes in the input parameters. The methodology was illustrated using a simulation based on real data collected from a geriatric department of a hospital from London, UK. In addition, the paper explores the possibility of adapting the methodology to different medical departments (surgery, stroke, and mental illness). Moreover, the paper also focuses on the practical use of the model from the healthcare point of view, by presenting a simulated application. Copyright © 2014 Elsevier Inc. All rights reserved.

Capacity Utilization Study for Aviation Security Cargo Inspection Queuing System

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

Allgood, Glenn O; Olama, Mohammed M; Lake, Joe E

In this paper, we conduct performance evaluation study for an aviation security cargo inspection queuing system for material flow and accountability. The queuing model employed in our study is based on discrete-event simulation and processes various types of cargo simultaneously. Onsite measurements are collected in an airport facility to validate the queuing model. The overall performance of the aviation security cargo inspection system is computed, analyzed, and optimized for the different system dynamics. Various performance measures are considered such as system capacity, residual capacity, throughput, capacity utilization, subscribed capacity utilization, resources capacity utilization, subscribed resources capacity utilization, and number ofmore » cargo pieces (or pallets) in the different queues. These metrics are performance indicators of the system s ability to service current needs and response capacity to additional requests. We studied and analyzed different scenarios by changing various model parameters such as number of pieces per pallet, number of TSA inspectors and ATS personnel, number of forklifts, number of explosives trace detection (ETD) and explosives detection system (EDS) inspection machines, inspection modality distribution, alarm rate, and cargo closeout time. The increased physical understanding resulting from execution of the queuing model utilizing these vetted performance measures should reduce the overall cost and shipping delays associated with new inspection requirements.« less

Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

NASA Astrophysics Data System (ADS)

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.

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

PubMed

Zonderland, Maartje E; Boer, Fredrik; Boucherie, Richard J; de Roode, Annemiek; van Kleef, Jack W

2009-11-01

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 employees combined with mathematical techniques to support the decision-making process resulted in a successful intervention. The setting is the preanesthesia evaluation clinic (PAC) of a university hospital, where patients consult several medical professionals, either by walk-in or appointment. Queuing theory was used to model the initial set-up of the clinic, and later to model possible alternative designs. With the queuing model, possible improvements in efficiency could be investigated. Inputs to the model were patient arrival rates and expected service times with clinic employees, collected from the clinic's logging system and by observation. The performance measures calculated with the model were patient length of stay and employee utilization rate. Supported by the model outcomes, a working group consisting of representatives of all clinic employees decided whether the initial design should be maintained or an intervention was needed. The queuing model predicted that 3 of the proposed alternatives would result in better performance. Key points in the intervention were the rescheduling of appointments and the reallocation of tasks. The intervention resulted in a shortening of the time the anesthesiologist needed to decide upon approving the patient for surgery. Patient arrivals increased sharply over 1 yr by more than 16%; however, patient length of stay at the clinic remained essentially unchanged. If the initial set-up of the clinic would have been maintained, the patient length of stay would have increased dramatically. Queuing theory provides robust methods to evaluate alternative designs for the organization of PACs. In this article, we show that queuing modeling is an adequate approach for redesigning processes in PACs.

Developing a cross-docking network design model under uncertain environment

NASA Astrophysics Data System (ADS)

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.

Cell transmission model of dynamic assignment for urban rail transit networks.

PubMed

Xu, Guangming; Zhao, Shuo; Shi, Feng; Zhang, Feilian

2017-01-01

For urban rail transit network, the space-time flow distribution can play an important role in evaluating and optimizing the space-time resource allocation. For obtaining the space-time flow distribution without the restriction of schedules, a dynamic assignment problem is proposed based on the concept of continuous transmission. To solve the dynamic assignment problem, the cell transmission model is built for urban rail transit networks. The priority principle, queuing process, capacity constraints and congestion effects are considered in the cell transmission mechanism. Then an efficient method is designed to solve the shortest path for an urban rail network, which decreases the computing cost for solving the cell transmission model. The instantaneous dynamic user optimal state can be reached with the method of successive average. Many evaluation indexes of passenger flow can be generated, to provide effective support for the optimization of train schedules and the capacity evaluation for urban rail transit network. Finally, the model and its potential application are demonstrated via two numerical experiments using a small-scale network and the Beijing Metro network.

Application of queuing model in Dubai's busiest megaplex

NASA Astrophysics Data System (ADS)

Bhagchandani, Maneesha; Bajpai, Priti

2013-09-01

This paper provides a study and analysis of the extremely busy booking counters at the Megaplex in Dubai using the queuing model and simulation. Dubai is an emirate in UAE with a multicultural population. Majority of the population in Dubai is foreign born. Cinema is one of the major forms of entertainment. There are more than 13 megaplexes each with a number of screens ranging from 3 to 22. They screen movies in English, Arabic, Hindi and other languages. It has been observed that during the weekends megaplexes attract a large number of crowd resulting in long queues at the booking counters. One of the busiest megaplex was selected for the study. Queuing theory satisfies the model when tested in real time situation. The concepts of arrival rate, service rate, utilization rate, waiting time in the system, average number of people in the queue, using Little's Theorem and M/M/s queuing model along with simulation software have been used to suggest an empirical solution. The aim of the paper is twofold-To assess the present situation at the Megaplex and give recommendations to optimize the use of booking counters.

A hybrid genetic algorithm-queuing multi-compartment model for optimizing inpatient bed occupancy and associated costs.

PubMed

Belciug, Smaranda; Gorunescu, Florin

2016-03-01

Explore how efficient intelligent decision support systems, both easily understandable and straightforwardly implemented, can help modern hospital managers to optimize both bed occupancy and utilization costs. This paper proposes a hybrid genetic algorithm-queuing multi-compartment model for the patient flow in hospitals. A finite capacity queuing model with phase-type service distribution is combined with a compartmental model, and an associated cost model is set up. An evolutionary-based approach is used for enhancing the ability to optimize both bed management and associated costs. In addition, a "What-if analysis" shows how changing the model parameters could improve performance while controlling costs. The study uses bed-occupancy data collected at the Department of Geriatric Medicine - St. George's Hospital, London, period 1969-1984, and January 2000. The hybrid model revealed that a bed-occupancy exceeding 91%, implying a patient rejection rate around 1.1%, can be carried out with 159 beds plus 8 unstaffed beds. The same holding and penalty costs, but significantly different bed allocations (156 vs. 184 staffed beds, and 8 vs. 9 unstaffed beds, respectively) will result in significantly different costs (£755 vs. £1172). Moreover, once the arrival rate exceeds 7 patient/day, the costs associated to the finite capacity system become significantly smaller than those associated to an Erlang B queuing model (£134 vs. £947). Encoding the whole information provided by both the queuing system and the cost model through chromosomes, the genetic algorithm represents an efficient tool in optimizing the bed allocation and associated costs. The methodology can be extended to different medical departments with minor modifications in structure and parameterization. Copyright © 2016 Elsevier B.V. All rights reserved.

Scalability Analysis and Use of Compression at the Goddard DAAC and End-to-End MODIS Transfers

NASA Technical Reports Server (NTRS)

Menasce, Daniel A.

1998-01-01

The goal of this task is to analyze the performance of single and multiple FTP transfer between SCF's and the Goddard DAAC. We developed an analytic model to compute the performance of FTP sessions as a function of various key parameters, implemented the model as a program called FTP Analyzer, and carried out validations with real data obtained by running single and multiple FTP transfer between GSFC and the Miami SCF. The input parameters to the model include the mix to FTP sessions (scenario), and for each FTP session, the file size. The network parameters include the round trip time, packet loss rate, the limiting bandwidth of the network connecting the SCF to a DAAC, TCP's basic timeout, TCP's Maximum Segment Size, and TCP's Maximum Receiver's Window Size. The modeling approach used consisted of modeling TCP's overall throughput, computing TCP's delay per FTP transfer, and then solving a queuing network model that includes the FTP clients and servers.

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

NASA Astrophysics Data System (ADS)

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.

A Method of Predicting Queuing at Library Online PCs

ERIC Educational Resources Information Center

Beranek, Lea G.

2006-01-01

On-campus networked personal computer (PC) usage at La Trobe University Library was surveyed during September 2005. The survey's objectives were to confirm peak usage times, to measure some of the relevant parameters of online PC usage, and to determine the effect that 24 new networked PCs had on service quality. The survey found that clients…

AIS ASM Operational Integration Plan

DTIC Science & Technology

2013-08-01

al. | Public August 2013 This page intentionally left blank. AIS ASM Operational Integration Plan v ...that supply AIS Routers as part of their AIS shoreside network software : Kongsberg C-Scope, Gatehouse AIS, Transas AIS Network, and CNS DataSwitch...commercial systems would be suitable for the current USCG traffic conditions. The ASM Manager is software that adds the required queuing and

Queuing Models of Tertiary Storage

NASA Technical Reports Server (NTRS)

Johnson, Theodore

1996-01-01

Large scale scientific projects generate and use large amounts of data. For example, the NASA Earth Observation System Data and Information System (EOSDIS) project is expected to archive one petabyte per year of raw satellite data. This data is made automatically available for processing into higher level data products and for dissemination to the scientific community. Such large volumes of data can only be stored in robotic storage libraries (RSL's) for near-line access. A characteristic of RSL's is the use of a robot arm that transfers media between a storage rack and the read/write drives, thus multiplying the capacity of the system. The performance of the RSL's can be a critical limiting factor for the performance of the archive system. However, the many interacting components of an RSL make a performance analysis difficult. In addition, different RSL components can have widely varying performance characteristics. This paper describes our work to develop performance models of an RSL in isolation. Next we show how the RSL model can be incorporated into a queuing network model. We use the models to make some example performance studies of archive systems. The models described in this paper, developed for the NASA EODIS project, are implemented in C with a well defined interface. The source code, accompanying documentation, and also sample JAVA applets are available at: http://www.cis.ufl.edu/ted/

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

NASA Technical Reports Server (NTRS)

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.

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

NASA Astrophysics Data System (ADS)

Yaghoubi, Saeed; Noori, Siamak; Mazdeh, Mohammad Mahdavi

2013-06-01

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.

Integrating LMINET with TAAM and SIMMOD: A Feasibility Study

NASA Technical Reports Server (NTRS)

Long, Dou; Stouffer-Coston, Virginia; Kostiuk, Peter; Kula, Richard; Yackovetsky, Robert (Technical Monitor)

2001-01-01

LMINET is a queuing network air traffic simulation model implemented at 64 large airports and the entire National Airspace System in the United States. TAAM and SIMMOD are two widely used air traffic event-driven simulation models mostly for airports. Based on our proposed Progressive Augmented window approach, TAAM and SIMMOD are integrated with LMINET though flight schedules. In the integration, the flight schedules are modified through the flight delays reported by the other models. The benefit to the local simulation study is to let TAAM or SIMMOD take the modified schedule from LMINET, which takes into account of the air traffic congestion and flight delays at the national network level. We demonstrate the value of the integrated models by the case studies at Chicago O'Hare International Airport and Washington Dulles International Airport. Details of the integration are reported and future work for a full-blown integration is identified.

Storage assignment optimization in a multi-tier shuttle warehousing system

NASA Astrophysics Data System (ADS)

Wang, Yanyan; Mou, Shandong; Wu, Yaohua

2016-03-01

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP), which has been widely applied in the conventional automated storage and retrieval system(AS/RS). However, the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems(MSWS) because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP. In this study, a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period (SWP) and lift idle period (LIP) during transaction cycle time. A mean arrival time difference matrix for pairwise stock keeping units(SKUs) is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation. The decomposition method is applied to analyze the interactions among outbound task time, SWP, and LIP. The ant colony clustering algorithm is designed to determine storage partitions using clustering items. In addition, goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane. This combination is derived based on the analysis results of the queuing network model and on three basic principles. The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry. The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

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

PubMed Central

Wei, Zhongcheng; Sun, Yongmei; Ji, Yuefeng

2017-01-01

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. PMID:28098818

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

PubMed

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.

MODELING AND PERFORMANCE EVALUATION FOR AVIATION SECURITY CARGO INSPECTION QUEUING SYSTEM

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

Allgood, Glenn O; Olama, Mohammed M; Rose, Terri A

Beginning in 2010, the U.S. will require that all cargo loaded in passenger aircraft be inspected. This will require more efficient processing of cargo and will have a significant impact on the inspection protocols and business practices of government agencies and the airlines. In this paper, we conduct performance evaluation study for an aviation security cargo inspection queuing system for material flow and accountability. The overall performance of the aviation security cargo inspection system is computed, analyzed, and optimized for the different system dynamics. Various performance measures are considered such as system capacity, residual capacity, and throughput. These metrics aremore » performance indicators of the system s ability to service current needs and response capacity to additional requests. The increased physical understanding resulting from execution of the queuing model utilizing these vetted performance measures will reduce the overall cost and shipping delays associated with the new inspection requirements.« less

Taxes and Bribes in Uganda.

PubMed

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.

Taxes and Bribes in Uganda

PubMed Central

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

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

PubMed

Kunkel, Susanne; Schenck, Wolfram

2017-01-01

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.

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

PubMed Central

Kunkel, Susanne; Schenck, Wolfram

2017-01-01

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. PMID:28701946

Bandwidth Allocation to Interactive Users in DBS-Based Hybrid Internet

DTIC Science & Technology

1998-01-01

policies 12 3.1 Framework for queuing analysis: ON/OFF source traffic model . 13 3.2 Service quality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14...minimizing the queuing delay. In consequence, we were interested in ob- taining improvements in the service quality , as perceived by the users. A...the service quality as per- ceived by users. The merit of this approach, first introduced in [8], is the ability to capture the characteristics of the

Aviation security cargo inspection queuing simulation model for material flow and accountability

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

Olama, Mohammed M; Allgood, Glenn O; Rose, Terri A

Beginning in 2010, the U.S. will require that all cargo loaded in passenger aircraft be inspected. This will require more efficient processing of cargo and will have a significant impact on the inspection protocols and business practices of government agencies and the airlines. In this paper, we develop an aviation security cargo inspection queuing simulation model for material flow and accountability that will allow cargo managers to conduct impact studies of current and proposed business practices as they relate to inspection procedures, material flow, and accountability.

QoS support over ultrafast TDM optical networks

NASA Astrophysics Data System (ADS)

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

1999-08-01

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

Stochastic Stability in Internet Router Congestion Games

NASA Astrophysics Data System (ADS)

Chung, Christine; Pyrga, Evangelia

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

Nested Fork-Join Queuing Networks and Their Application to Mobility Airfield Operations Analysis.

DTIC Science & Technology

1997-03-01

shortest queue length. Setia , Squillante, and Tripathi [109] extend Makowski and Nelson’s work by performing a quantitative assessment of a range of...Markov chains." Numerical Solution of Markov Chains, edited by W. J. Stewart, 63- 88. Basel: Marcel Dekker, 1991. [109] Setia , S. K., and others

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

DTIC Science & Technology

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

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

NASA Technical Reports Server (NTRS)

Walter, H.

1994-01-01

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

Video transmission on ATM networks. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

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.

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

NASA Astrophysics Data System (ADS)

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

2016-10-01

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

Application of queuing theory in inventory systems with substitution flexibility

NASA Astrophysics Data System (ADS)

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.

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

DTIC Science & Technology

2014-02-12

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

Exploring Issues of Quality of Service in a Next Generation Internet Testbed: A Case Study Using PathMaster

PubMed Central

Shifman, Mark A.; Sayward, Frederick G.; Mattie, Mark E.; Miller, Perry L.

2002-01-01

This case study describes a project that explores issues of quality of service (QoS) relevant to the next-generation Internet (NGI), using the PathMaster application in a testbed environment. PathMaster is a prototype computer system that analyzes digitized cell images from cytology specimens and compares those images against an image database, returning a ranked set of “similar” cell images from the database. To perform NGI testbed evaluations, we used a cluster of nine parallel computation workstations configured as three subclusters using Cisco routers. This architecture provides a local “simulated Internet” in which we explored the following QoS strategies: (1) first-in-first-out queuing, (2) priority queuing, (3) weighted fair queuing, (4) weighted random early detection, and (5) traffic shaping. The study describes the results of using these strategies with a distributed version of the PathMaster system in the presence of different amounts of competing network traffic and discusses certain of the issues that arise. The goal of the study is to help introduce NGI QoS issues to the Medical Informatics community and to use the PathMaster NGI testbed to illustrate concretely certain of the QoS issues that arise. PMID:12223501

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

NASA Astrophysics Data System (ADS)

Goncalves, Bruno; Perra, Nicola; Vespignani, Alessandro

2012-02-01

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.

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

PubMed

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.

Priority Queuing Models for Hospital Intensive Care Units and Impacts to Severe Case Patients

PubMed Central

Hagen, Matthew S.; Jopling, Jeffrey K; Buchman, Timothy G; Lee, Eva K.

2013-01-01

This paper examines several different queuing models for intensive care units (ICU) and the effects on wait times, utilization, return rates, mortalities, and number of patients served. Five separate intensive care units at an urban hospital are analyzed and distributions are fitted for arrivals and service durations. A system-based simulation model is built to capture all possible cases of patient flow after ICU admission. These include mortalities and returns before and after hospital exits. Patients are grouped into 9 different classes that are categorized by severity and length of stay (LOS). Each queuing model varies by the policies that are permitted and by the order the patients are admitted. The first set of models does not prioritize patients, but examines the advantages of smoothing the operating schedule for elective surgeries. The second set analyzes the differences between prioritizing admissions by expected LOS or patient severity. The last set permits early ICU discharges and conservative and aggressive bumping policies are contrasted. It was found that prioritizing patients by severity considerably reduced delays for critical cases, but also increased the average waiting time for all patients. Aggressive bumping significantly raised the return and mortality rates, but more conservative methods balance quality and efficiency with lowered wait times without serious consequences. PMID:24551379

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

NASA Astrophysics Data System (ADS)

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

2016-11-01

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

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

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

Shorgin, Sergey Ya.; Pechinkin, Alexander V.; Samouylov, Konstantin E.

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. Formore » 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.« less

An analytical study of various telecomminication networks using markov models

NASA Astrophysics Data System (ADS)

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

2015-04-01

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

Modeling Users' Activity on Twitter Networks: Validation of Dunbar's Number

PubMed Central

Gonçalves, Bruno; Perra, Nicola; Vespignani, Alessandro

2011-01-01

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. PMID:21826200

Optimization of airport security lanes

NASA Astrophysics Data System (ADS)

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.

Universal model for collective access patterns in the Internet traffic dynamics: A superstatistical approach

NASA Astrophysics Data System (ADS)

Tamazian, A.; Nguyen, V. D.; Markelov, O. A.; Bogachev, M. I.

2016-07-01

We suggest a universal phenomenological description for the collective access patterns in the Internet traffic dynamics both at local and wide area network levels that takes into account erratic fluctuations imposed by cooperative user behaviour. Our description is based on the superstatistical approach and leads to the q-exponential inter-session time and session size distributions that are also in perfect agreement with empirical observations. The validity of the proposed description is confirmed explicitly by the analysis of complete 10-day traffic traces from the WIDE backbone link and from the local campus area network downlink from the Internet Service Provider. Remarkably, the same functional forms have been observed in the historic access patterns from single WWW servers. The suggested approach effectively accounts for the complex interplay of both “calm” and “bursty” user access patterns within a single-model setting. It also provides average sojourn time estimates with reasonable accuracy, as indicated by the queuing system performance simulation, this way largely overcoming the failure of Poisson modelling of the Internet traffic dynamics.

An Integrated Model of Patient and Staff Satisfaction Using Queuing Theory

PubMed Central

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. PMID:27170899

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

Sugito; Rahmawati, Rita; Kusuma Wardhani, Jenesia

2018-05-01

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

Performance Evaluation Model for Application Layer Firewalls.

PubMed

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.

Efficient priority queueing routing strategy on networks of mobile agents

NASA Astrophysics Data System (ADS)

Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

2018-03-01

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

Density profiles of the exclusive queuing process

NASA Astrophysics Data System (ADS)

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.

Exploitation of Existing Voice Over Internet Protocol Technology for Department of the Navy Application

DTIC Science & Technology

2002-09-01

Protocol LAN Local Area Network LDAP Lightweight Directory Access Protocol LLQ Low Latency Queuing MAC Media Access Control MarCorSysCom Marine...Description Protocol SIP Session Initiation Protocol SMTP Simple Mail Transfer Protocol SPAWAR Space and Naval Warfare Systems Center SS7 ...PSTN infrastructure previously required to carry the conversation. The cost of accessing the PSTN is thereby eliminated. In cases where Internet

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

NASA Astrophysics Data System (ADS)

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)

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

NASA Technical Reports Server (NTRS)

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, such as during real time transmissions, the SLE implementation cannot support high data rate communication.

Gateway-Assisted Retransmission for Lightweight and Reliable IoT Communications.

PubMed

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.

Gateway-Assisted Retransmission for Lightweight and Reliable IoT Communications

PubMed Central

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

2016-01-01

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. PMID:27669243

Improving queuing service at McDonald's

NASA Astrophysics Data System (ADS)

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

2014-07-01

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

A Network Flow Approach to the Initial Skills Training Scheduling Problem

DTIC Science & Technology

2007-12-01

include (but are not limited to) queuing theory, stochastic analysis and simulation. After the demand schedule has been estimated, it can be ...software package has already been purchased and is in use by AFPC, AFPC has requested that the new algorithm be programmed in this language as well ...the discussed outputs from those schedules. Required Inputs A single input file details the students to be scheduled as well as the courses

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

Code of Federal Regulations, 2011 CFR

2011-04-01

... 23 Highways 1 2011-04-01 2011-04-01 false Can other sources of funds be used to finance a queued project in advance of receipt of IRRBP funds? 661.43 Section 661.43 Highways FEDERAL HIGHWAY... PROGRAM § 661.43 Can other sources of funds be used to finance a queued project in advance of receipt of...

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

Code of Federal Regulations, 2013 CFR

2013-04-01

... 23 Highways 1 2013-04-01 2013-04-01 false Can other sources of funds be used to finance a queued project in advance of receipt of IRRBP funds? 661.43 Section 661.43 Highways FEDERAL HIGHWAY... PROGRAM § 661.43 Can other sources of funds be used to finance a queued project in advance of receipt of...

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

Code of Federal Regulations, 2014 CFR

2014-04-01

... 23 Highways 1 2014-04-01 2014-04-01 false Can other sources of funds be used to finance a queued project in advance of receipt of IRRBP funds? 661.43 Section 661.43 Highways FEDERAL HIGHWAY... PROGRAM § 661.43 Can other sources of funds be used to finance a queued project in advance of receipt of...

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

Code of Federal Regulations, 2012 CFR

2012-04-01

... 23 Highways 1 2012-04-01 2012-04-01 false Can other sources of funds be used to finance a queued project in advance of receipt of IRRBP funds? 661.43 Section 661.43 Highways FEDERAL HIGHWAY... PROGRAM § 661.43 Can other sources of funds be used to finance a queued project in advance of receipt of...

Decentralized Hypothesis Testing in Energy Harvesting Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

Duan, Haoran

1997-12-01

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

Single stage queueing/manufacturing system model that involves emission variable

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Exact subthreshold integration with continuous spike times in discrete-time neural network simulations.

PubMed

Morrison, Abigail; Straube, Sirko; Plesser, Hans Ekkehard; Diesmann, Markus

2007-01-01

Very large networks of spiking neurons can be simulated efficiently in parallel under the constraint that spike times are bound to an equidistant time grid. Within this scheme, the subthreshold dynamics of a wide class of integrate-and-fire-type neuron models can be integrated exactly from one grid point to the next. However, the loss in accuracy caused by restricting spike times to the grid can have undesirable consequences, which has led to interest in interpolating spike times between the grid points to retrieve an adequate representation of network dynamics. We demonstrate that the exact integration scheme can be combined naturally with off-grid spike events found by interpolation. We show that by exploiting the existence of a minimal synaptic propagation delay, the need for a central event queue is removed, so that the precision of event-driven simulation on the level of single neurons is combined with the efficiency of time-driven global scheduling. Further, for neuron models with linear subthreshold dynamics, even local event queuing can be avoided, resulting in much greater efficiency on the single-neuron level. These ideas are exemplified by two implementations of a widely used neuron model. We present a measure for the efficiency of network simulations in terms of their integration error and show that for a wide range of input spike rates, the novel techniques we present are both more accurate and faster than standard techniques.

IBM NJE protocol emulator for VAX/VMS

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

Engert, D.E.

1981-01-01

Communications software has been written at Argonne National Laboratory to enable a VAX/VMS system to participate as an end-node in a standard IBM network by emulating the Network Job Entry (NJE) protocol. NJE is actually a collection of programs that support job networking for the operating systems used on most large IBM-compatible computers (e.g., VM/370, MVS with JES2 or JES3, SVS, MVT with ASP or HASP). Files received by the VAX can be printed or saved in user-selected disk files. Files sent to the network can be routed to any node in the network for printing, punching, or job submission,more » as well as to a VM/370 user's virtual reader. Files sent from the VAX are queued and transmitted asynchronously to allow users to perform other work while files are awaiting transmission. No changes are required to the IBM software.« less

Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations

NASA Astrophysics Data System (ADS)

Tadić, Bosiljka; Thurner, Stefan; Rodgers, G. J.

2004-03-01

We study the microscopic time fluctuations of traffic load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates R the traffic is stationary and the load time series exhibits antipersistence due to the regulatory role of the superstructure associated with two hub nodes in the network. We discuss how the superstructure affects the functioning of the network at high traffic density and at the jamming threshold. The degree of correlations systematically decreases with increasing traffic density and eventually disappears when approaching a jamming density Rc. Already before jamming we observe qualitative changes in the global network-load distributions and the particle queuing times. These changes are related to the occurrence of temporary crises in which the network-load increases dramatically, and then slowly falls back to a value characterizing free flow.

Berkeley lab checkpoint/restart (BLCR) for Linux clusters

DOE PAGES

Hargrove, Paul H.; Duell, Jason C.

2006-09-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 instancemore » 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. © 2006 IOP Publishing Ltd.« less

Teaching Mathematical Modelling: Demonstrating Enrichment and Elaboration

ERIC Educational Resources Information Center

Warwick, Jon

2015-01-01

This paper uses a series of models to illustrate one of the fundamental processes of model building--that of enrichment and elaboration. The paper describes how a problem context is given which allows a series of models to be developed from a simple initial model using a queuing theory framework. The process encourages students to think about the…

Principles of Queued Service Observing at CFHT

NASA Astrophysics Data System (ADS)

Manset, Nadine; Burdullis, T.; Devost, D.

2011-03-01

CFHT started to use Queued Service Observing in 2001, and is now operating in that mode over 95% of the time. Ten years later, the observations are now carried out by Remote Observers who are not present at the telescope (see the companion presentation "Remote Queued Service Observing at CFHT"). The next phase at CFHT will likley involve assisted or autonomous service observing (see the presentation "Artificial Intelligence in Autonomous Telescopes"), which would not be possible without first having a Queued observations system already in place. The advantages and disadvantages of QSO at CFHT will be reviewed. The principles of QSO at CFHT, which allow CFHT to complete 90-100% of the top 30-40% programs and often up to 80% of other accepted programs, will be presented, along with the strategic use of overfill programs, the method of agency balance, and the suite of planning, scheduling, analysis and data quality assessment tools available to Queue Coordinators and Remote Observers.

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

PubMed

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.

Queuing Theory and Reference Transactions.

ERIC Educational Resources Information Center

Terbille, Charles

1995-01-01

Examines the implications of applying the queuing theory to three different reference situations: (1) random patron arrivals; (2) random durations of transactions; and (3) use of two librarians. Tables and figures represent results from spreadsheet calculations of queues for each reference situation. (JMV)

Fleet Sizing of Automated Material Handling Using Simulation Approach

NASA Astrophysics Data System (ADS)

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

NJE; VAX-VMS IBM NJE network protocol emulator. [DEC VAX11/780; VAX-11 FORTRAN 77 (99%) and MACRO-11 (1%)

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

Engert, D.E.; Raffenetti, C.

NJE is communications software developed to enable a VAX VMS system to participate as an end-node in a standard IBM network by emulating the Network Job Entry (NJE) protocol. NJE supports job networking for the operating systems used on most large IBM-compatible computers (e.g., VM/370, MVS with JES2 or JES3, SVS, MVT with ASP or HASP). Files received by the VAX can be printed or saved in user-selected disk files. Files sent to the network can be routed to any network node for printing, punching, or job submission, or to a VM/370 user's virtual reader. Files sent from the VAXmore » are queued and transmitted asynchronously. No changes are required to the IBM software.DEC VAX11/780; VAX-11 FORTRAN 77 (99%) and MACRO-11 (1%); VMS 2.5; VAX11/780 with DUP-11 UNIBUS interface and 9600 baud synchronous modem..« less

TinyOS-based quality of service management in wireless sensor networks

USGS Publications Warehouse

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

2009-01-01

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

Optimizing a Drone Network to Deliver Automated External Defibrillators.

PubMed

Boutilier, Justin J; Brooks, Steven C; Janmohamed, Alyf; Byers, Adam; Buick, Jason E; Zhan, Cathy; Schoellig, Angela P; Cheskes, Sheldon; Morrison, Laurie J; Chan, Timothy C Y

2017-06-20

Public access defibrillation programs can improve survival after out-of-hospital cardiac arrest, but automated external defibrillators (AEDs) are rarely available for bystander use at the scene. Drones are an emerging technology that can deliver an AED to the scene of an out-of-hospital cardiac arrest for bystander use. We hypothesize that a drone network designed with the aid of a mathematical model combining both optimization and queuing can reduce the time to AED arrival. We applied our model to 53 702 out-of-hospital cardiac arrests that occurred in the 8 regions of the Toronto Regional RescuNET between January 1, 2006, and December 31, 2014. Our primary analysis quantified the drone network size required to deliver an AED 1, 2, or 3 minutes faster than historical median 911 response times for each region independently. A secondary analysis quantified the reduction in drone resources required if RescuNET was treated as a large coordinated region. The region-specific analysis determined that 81 bases and 100 drones would be required to deliver an AED ahead of median 911 response times by 3 minutes. In the most urban region, the 90th percentile of the AED arrival time was reduced by 6 minutes and 43 seconds relative to historical 911 response times in the region. In the most rural region, the 90th percentile was reduced by 10 minutes and 34 seconds. A single coordinated drone network across all regions required 39.5% fewer bases and 30.0% fewer drones to achieve similar AED delivery times. An optimized drone network designed with the aid of a novel mathematical model can substantially reduce the AED delivery time to an out-of-hospital cardiac arrest event. © 2017 American Heart Association, Inc.

Modeling bursts and heavy tails in human dynamics

NASA Astrophysics Data System (ADS)

Vázquez, Alexei; Oliveira, João Gama; Dezsö, Zoltán; Goh, Kwang-Il; Kondor, Imre; Barabási, Albert-László

2006-03-01

The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behavior into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. Here we provide direct evidence that for five human activity patterns, such as email and letter based communications, web browsing, library visits and stock trading, the timing of individual human actions follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. We show that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experiencing very long waiting times. In contrast, priority blind execution is well approximated by uniform interevent statistics. We discuss two queuing models that capture human activity. The first model assumes that there are no limitations on the number of tasks an individual can hadle at any time, predicting that the waiting time of the individual tasks follow a heavy tailed distribution P(τw)˜τw-α with α=3/2 . The second model imposes limitations on the queue length, resulting in a heavy tailed waiting time distribution characterized by α=1 . We provide empirical evidence supporting the relevance of these two models to human activity patterns, showing that while emails, web browsing and library visitation display α=1 , the surface mail based communication belongs to the α=3/2 universality class. Finally, we discuss possible extension of the proposed queuing models and outline some future challenges in exploring the statistical mechanics of human dynamics.

Modeling bursts and heavy tails in human dynamics.

PubMed

Vázquez, Alexei; Oliveira, João Gama; Dezsö, Zoltán; Goh, Kwang-Il; Kondor, Imre; Barabási, Albert-László

2006-03-01

The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behavior into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. Here we provide direct evidence that for five human activity patterns, such as email and letter based communications, web browsing, library visits and stock trading, the timing of individual human actions follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. We show that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experiencing very long waiting times. In contrast, priority blind execution is well approximated by uniform interevent statistics. We discuss two queuing models that capture human activity. The first model assumes that there are no limitations on the number of tasks an individual can handle at any time, predicting that the waiting time of the individual tasks follow a heavy tailed distribution P(tau(w)) approximately tau(w)(-alpha) with alpha=3/2. The second model imposes limitations on the queue length, resulting in a heavy tailed waiting time distribution characterized by alpha=1. We provide empirical evidence supporting the relevance of these two models to human activity patterns, showing that while emails, web browsing and library visitation display alpha=1, the surface mail based communication belongs to the alpha=3/2 universality class. Finally, we discuss possible extension of the proposed queuing models and outline some future challenges in exploring the statistical mechanics of human dynamics.

Modelling Pedestrian Travel Time and the Design of Facilities: A Queuing Approach

PubMed Central

Rahman, Khalidur; Abdul Ghani, Noraida; Abdulbasah Kamil, Anton; Mustafa, Adli; Kabir Chowdhury, Md. Ahmed

2013-01-01

Pedestrian movements are the consequence of several complex and stochastic facts. The modelling of pedestrian movements and the ability to predict the travel time are useful for evaluating the performance of a pedestrian facility. However, only a few studies can be found that incorporate the design of the facility, local pedestrian body dimensions, the delay experienced by the pedestrians, and level of service to the pedestrian movements. In this paper, a queuing based analytical model is developed as a function of relevant determinants and functional factors to predict the travel time on pedestrian facilities. The model can be used to assess the overall serving rate or performance of a facility layout and correlate it to the level of service that is possible to provide the pedestrians. It has also the ability to provide a clear suggestion on the designing and sizing of pedestrian facilities. The model is empirically validated and is found to be a robust tool to understand how well a particular walking facility makes possible comfort and convenient pedestrian movements. The sensitivity analysis is also performed to see the impact of some crucial parameters of the developed model on the performance of pedestrian facilities. PMID:23691055

Optimizing the admission time of outbound trucks entering a cross-dock with uniform arrival time by considering a queuing model

NASA Astrophysics Data System (ADS)

Motaghedi-Larijani, Arash; Aminnayeri, Majid

2017-03-01

Cross-docking is a supply-chain strategy that can reduce transportation and inventory costs. This study is motivated by a fruit and vegetable distribution centre in Tehran, which has cross-docks and a limited time to admit outbound trucks. In this article, outbound trucks are assumed to arrive at the cross-dock with a single outbound door with a uniform distribution (0,L). The total number of assigned trucks is constant and the loading time is fixed. A queuing model is modified for this situation and the expected waiting time of each customer is calculated. Then, a curve for the waiting time is calculated. Finally, the length of window time L is optimized to minimize the total cost, which includes the waiting time of the trucks and the admission cost of the cross-dock. Some illustrative examples of cross-docking are presented and solved using the proposed method.

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

PubMed

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.

Wake Vortex Advisory System (WakeVAS) Evaluation of Impacts on the National Airspace System

NASA Technical Reports Server (NTRS)

Smith, Jeremy C.; Dollyhigh, Samuel M.

2005-01-01

This report is one of a series that describes an ongoing effort in high-fidelity modeling/simulation, evaluation and analysis of the benefits and performance metrics of the Wake Vortex Advisory System (WakeVAS) Concept of Operations being developed as part of the Virtual Airspace Modeling and Simulation (VAMS) project. A previous study, determined the overall increases in runway arrival rates that could be achieved at 12 selected airports due to WakeVAS reduced aircraft spacing under Instrument Meteorological Conditions. This study builds on the previous work to evaluate the NAS wide impacts of equipping various numbers of airports with WakeVAS. A queuing network model of the National Airspace System, built by the Logistics Management Institute, Mclean, VA, for NASA (LMINET) was used to estimate the reduction in delay that could be achieved by using WakeVAS under non-visual meteorological conditions for the projected air traffic demand in 2010. The results from LMINET were used to estimate the total annual delay reduction that could be achieved and from this, an estimate of the air carrier variable operating cost saving was made.

Network Configuration Analysis for Formation Flying Satellites

NASA Technical Reports Server (NTRS)

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.

Emergence of bursts and communities in evolving weighted networks.

PubMed

Jo, Hang-Hyun; Pan, Raj Kumar; Kaski, Kimmo

2011-01-01

Understanding the patterns of human dynamics and social interaction and the way they lead to the formation of an organized and functional society are important issues especially for techno-social development. Addressing these issues of social networks has recently become possible through large scale data analysis of mobile phone call records, which has revealed the existence of modular or community structure with many links between nodes of the same community and relatively few links between nodes of different communities. The weights of links, e.g., the number of calls between two users, and the network topology are found correlated such that intra-community links are stronger compared to the weak inter-community links. This feature is known as Granovetter's "The strength of weak ties" hypothesis. In addition to this inhomogeneous community structure, the temporal patterns of human dynamics turn out to be inhomogeneous or bursty, characterized by the heavy tailed distribution of time interval between two consecutive events, i.e., inter-event time. In this paper, we study how the community structure and the bursty dynamics emerge together in a simple evolving weighted network model. The principal mechanisms behind these patterns are social interaction by cyclic closure, i.e., links to friends of friends and the focal closure, links to individuals sharing similar attributes or interests, and human dynamics by task handling process. These three mechanisms have been implemented as a network model with local attachment, global attachment, and priority-based queuing processes. By comprehensive numerical simulations we show that the interplay of these mechanisms leads to the emergence of heavy tailed inter-event time distribution and the evolution of Granovetter-type community structure. Moreover, the numerical results are found to be in qualitative agreement with empirical analysis results from mobile phone call dataset.

Implementation of the Automated Numerical Model Performance Metrics System

DTIC Science & Technology

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

Modeling the effect of bus stops on capacity of curb lane

NASA Astrophysics Data System (ADS)

Luo, Qingyu; Zheng, Tianyao; Wu, Wenjing; Jia, Hongfei; Li, Jin

With the increase of buses and bus lines, a negative effect on road section capacity is made by the prolonged delay and queuing time at bus stops. However, existing methods of measuring the negative effect pay little attention to different bus stop types in the curb lanes. This paper uses Gap theory and Queuing theory to build models for effect-time and potential capacity in different conditions, including curbside bus stops, bus bays with overflow and bus bays without overflow. In order to make the effect-time models accurate and reliable, two types of probabilities are introduced. One is the probability that the dwell time is less than the headway of curb lane at curbside bus stops; the other is the overflow probability at bus bays. Based on the fundamental road capacity model and effect-time models, potential capacity models of curb lane are designed. The new models are calibrated by the survey data from Changchun City, and verified by the simulation software of VISSIM. Furthermore, with different arrival rates of vehicles, the setting conditions of bus stops are researched. Results show that the potential capacity models have high precision. They can offer a reference for recognizing the effect of bus stops on the capacity of curb lane, which can provide a basis for planning, design and management of urban roads and bus stops.

A comparison of queueing, cluster and distributed computing systems

NASA Technical Reports Server (NTRS)

Kaplan, Joseph A.; Nelson, Michael L.

1993-01-01

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

Achieving fast and stable failure detection in WDM Networks

NASA Astrophysics Data System (ADS)

Gao, Donghui; Zhou, Zhiyu; Zhang, Hanyi

2005-02-01

In dynamic networks, the failure detection time takes a major part of the convergence time, which is an important network performance index. To detect a node or link failure in the network, traditional protocols, like Hello protocol in OSPF or RSVP, exchanges keep-alive messages between neighboring nodes to keep track of the link/node state. But by default settings, it can get a minimum detection time in the measure of dozens of seconds, which can not meet the demands of fast network convergence and failure recovery. When configuring the related parameters to reduce the detection time, there will be notable instability problems. In this paper, we analyzed the problem and designed a new failure detection algorithm to reduce the network overhead of detection signaling. Through our experiment we found it is effective to enhance the stability by implicitly acknowledge other signaling messages as keep-alive messages. We conducted our proposal and the previous approaches on the ASON test-bed. The experimental results show that our algorithm gives better performances than previous schemes in about an order magnitude reduction of both false failure alarms and queuing delay to other messages, especially under light traffic load.

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

NASA Technical Reports Server (NTRS)

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.

Optimising resource management in neurorehabilitation.

PubMed

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.

Quantifying Cyber-Resilience Against Resource-Exhaustion Attacks

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

Fink, Glenn A.; Griswold, Richard L.; Beech, Zachary W.

2014-07-11

Resilience in the information sciences is notoriously difficult to define much less to measure. But in mechanical engi- neering, the resilience of a substance is mathematically defined as the area under the stress vs. strain curve. We took inspiration from mechanics in an attempt to define resilience precisely for information systems. We first examine the meaning of resilience in language and engineering terms and then translate these definitions to information sciences. Then we tested our definitions of resilience for a very simple problem in networked queuing systems. We discuss lessons learned and make recommendations for using this approach in futuremore » work.« less

Quality of service routing in wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Sane, Sachin J.; Patcha, Animesh; Mishra, Amitabh

2003-08-01

An efficient routing protocol is essential to guarantee application level quality of service running on wireless ad hoc networks. In this paper we propose a novel routing algorithm that computes a path between a source and a destination by considering several important constraints such as path-life, availability of sufficient energy as well as buffer space in each of the nodes on the path between the source and destination. The algorithm chooses the best path from among the multiples paths that it computes between two endpoints. We consider the use of control packets that run at a priority higher than the data packets in determining the multiple paths. The paper also examines the impact of different schedulers such as weighted fair queuing, and weighted random early detection among others in preserving the QoS level guarantees. Our extensive simulation results indicate that the algorithm improves the overall lifetime of a network, reduces the number of dropped packets, and decreases the end-to-end delay for real-time voice application.

Networks for Autonomous Formation Flying Satellite Systems

NASA Technical Reports Server (NTRS)

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.

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

Code of Federal Regulations, 2010 CFR

2010-04-01

... 23 Highways 1 2010-04-01 2010-04-01 false Can other sources of funds be used to finance a queued project in advance of receipt of IRRBP funds? 661.43 Section 661.43 Highways FEDERAL HIGHWAY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION ENGINEERING AND TRAFFIC OPERATIONS INDIAN RESERVATION ROAD BRIDGE PROGRAM § 661.43 Can other sources of funds be...

Development and Analysis of Models for Handling the Refrigerated Containerized Cargoes

NASA Astrophysics Data System (ADS)

Nyrkov, A.; Pavlova, L.; Nikiforov, V.; Sokolov, S.; Budnik, V.

2017-07-01

This paper considers the open multi-channel queuing system, which receives irregular homogeneous or heterogeneous applications with an unlimited flow of standby time. The system is regarded as an example of a container terminal, having conditionally functional sections with a certain duty cycle, which receives an irregular, non-uniform flow of vessels with the resultant intensity.

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

PubMed Central

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

2013-01-01

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

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

ERIC Educational Resources Information Center

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…

Artificial intelligence based decision support for trumpeter swan management

USGS Publications Warehouse

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-2000. Applying the Matched Pairs Multivariate Permutation Test as a statistical tool was a new approach for comparing flyway distributions of waterfowl over time that seemed to work well. Based on this approach, the empirical evidence that I gathered led me to conclude that the base queuing model does accurately simulate swan distributions in the flyway. The system was insensitive to almost all model parameters tested. That remains perplexing, but might result from the base queuing model, itself, being particularly effective at representing the actual ecological diversity in the world of Rocky Mountain trumpeter swans, both spatial and temporally.

NAS Requirements Checklist for Job Queuing/Scheduling Software

NASA Technical Reports Server (NTRS)

Jones, James Patton

1996-01-01

The increasing reliability of parallel systems and clusters of computers has resulted in these systems becoming more attractive for true production workloads. Today, the primary obstacle to production use of clusters of computers is the lack of a functional and robust Job Management System for parallel applications. This document provides a checklist of NAS requirements for job queuing and scheduling in order to make most efficient use of parallel systems and clusters for parallel applications. Future requirements are also identified to assist software vendors with design planning.

Analysis and Modeling of Ground Operations at Hub Airports

NASA Technical Reports Server (NTRS)

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.

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

PubMed

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.

System model the processing of heterogeneous sensory information in robotized complex

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Mapping edge-based traffic measurements onto the internal links in MPLS network

NASA Astrophysics Data System (ADS)

Zhao, Guofeng; Tang, Hong; Zhang, Yi

2004-09-01

Applying multi-protocol label switching techniques to IP-based backbone for traffic engineering goals has shown advantageous. Obtaining a volume of load on each internal link of the network is crucial for traffic engineering applying. Though collecting can be available for each link, such as applying traditional SNMP scheme, the approach may cause heavy processing load and sharply degrade the throughput of the core routers. Then monitoring merely at the edge of the network and mapping the measurements onto the core provides a good alternative way. In this paper, we explore a scheme for traffic mapping with edge-based measurements in MPLS network. It is supposed that the volume of traffic on each internal link over the domain would be mapped onto by measurements available only at ingress nodes. We apply path-based measurements at ingress nodes without enabling measurements in the core of the network. We propose a method that can infer a path from the ingress to the egress node using label distribution protocol without collecting routing data from core routers. Based on flow theory and queuing theory, we prove that our approach is effective and present the algorithm for traffic mapping. We also show performance simulation results that indicate potential of our approach.

The Efficiency of Increasing the Capacity of Physiotherapy Screening Clinics or Traditional Medical Services to Address Unmet Demand in Orthopaedic Outpatients: A Practical Application of Discrete Event Simulation with Dynamic Queuing.

PubMed

Standfield, L; Comans, T; Raymer, M; O'Leary, S; Moretto, N; Scuffham, P

2016-08-01

Hospital outpatient orthopaedic services traditionally rely on medical specialists to assess all new patients to determine appropriate care. This has resulted in significant delays in service provision. In response, Orthopaedic Physiotherapy Screening Clinics and Multidisciplinary Services (OPSC) have been introduced to assess and co-ordinate care for semi- and non-urgent patients. To compare the efficiency of delivering increased semi- and non-urgent orthopaedic outpatient services through: (1) additional OPSC services; (2) additional traditional orthopaedic medical services with added surgical resources (TOMS + Surg); or (3) additional TOMS without added surgical resources (TOMS - Surg). A cost-utility analysis using discrete event simulation (DES) with dynamic queuing (DQ) was used to predict the cost effectiveness, throughput, queuing times, and resource utilisation, associated with introducing additional OPSC or TOMS ± Surg versus usual care. The introduction of additional OPSC or TOMS (±surgery) would be considered cost effective in Australia. However, OPSC was the most cost-effective option. Increasing the capacity of current OPSC services is an efficient way to improve patient throughput and waiting times without exceeding current surgical resources. An OPSC capacity increase of ~100 patients per month appears cost effective (A$8546 per quality-adjusted life-year) and results in a high level of OPSC utilisation (98 %). Increasing OPSC capacity to manage semi- and non-urgent patients would be cost effective, improve throughput, and reduce waiting times without exceeding current surgical resources. Unlike Markov cohort modelling, microsimulation, or DES without DQ, employing DES-DQ in situations where capacity constraints predominate provides valuable additional information beyond cost effectiveness to guide resource allocation decisions.

Research the simulation model of the passenger travel behavior in urban rail platform

NASA Astrophysics Data System (ADS)

Wang, Yujia; Yin, Xiangyong

2017-05-01

Based on the results of the research on the platform of the Beijing Chegongzhuang subway station in the line 2, the passenger travel behavior in urban rail platform is divided into 4 parts, which are the enter passenger walking, the passenger waiting distribution and queuing up before the door, passenger boarding and alighting and the alighting passengers walking, according to the social force model, simulation model was built based on Matlab software. Combined with the actual data of subway the Chegongzhuang subway station in the line 2, the simulation results show that the social force model is effective.

Data flow manager for DART

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

Berg, D.; Black, D.; Slimmer, D.

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.

Data flow manager for DART

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

Berg, D.; Black, D.; Slimmer, D.

1994-12-31

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.

Improving outpatient phlebotomy service efficiency and patient experience using discrete-event simulation.

PubMed

Yip, Kenneth; Pang, Suk-King; Chan, Kui-Tim; Chan, Chi-Kuen; Lee, Tsz-Leung

2016-08-08

Purpose - The purpose of this paper is to present a simulation modeling application to reconfigure the outpatient phlebotomy service of an acute regional and teaching hospital in Hong Kong, with an aim to improve service efficiency, shorten patient queuing time and enhance workforce utilization. Design/methodology/approach - The system was modeled as an inhomogeneous Poisson process and a discrete-event simulation model was developed to simulate the current setting, and to evaluate how various performance metrics would change if switched from a decentralized to a centralized model. Variations were then made to the model to test different workforce arrangements for the centralized service, so that managers could decide on the service's final configuration via an evidence-based and data-driven approach. Findings - This paper provides empirical insights about the relationship between staffing arrangement and system performance via a detailed scenario analysis. One particular staffing scenario was chosen by manages as it was considered to strike the best balance between performance and workforce scheduled. The resulting centralized phlebotomy service was successfully commissioned. Practical implications - This paper demonstrates how analytics could be used for operational planning at the hospital level. The authors show that a transparent and evidence-based scenario analysis, made available through analytics and simulation, greatly facilitates management and clinical stakeholders to arrive at the ideal service configuration. Originality/value - The authors provide a robust method in evaluating the relationship between workforce investment, queuing reduction and workforce utilization, which is crucial for managers when deciding the delivery model for any outpatient-related service.

GPS Monitoring of Surface Change During and Following the Fortuitous Occurrence of the M(sub w) = 7.3 Landers Earthquake in our Network

NASA Technical Reports Server (NTRS)

Miller, M. Meghan

1998-01-01

Accomplishments: (1) Continues GPS monitoring of surface change during and following the fortuitous occurrence of the M(sub w) = 7.3 Landers earthquake in our network, in order to characterize earthquake dynamics and accelerated activity of related faults as far as 100's of kilometers along strike. (2) Integrates the geodetic constraints into consistent kinematic descriptions of the deformation field that can in turn be used to characterize the processes that drive geodynamics, including seismic cycle dynamics. In 1991, we installed and occupied a high precision GPS geodetic network to measure transform-related deformation that is partitioned from the Pacific - North America plate boundary northeastward through the Mojave Desert, via the Eastern California shear zone to the Walker Lane. The onset of the M(sub w) = 7.3 June 28, 1992, Landers, California, earthquake sequence within this network poses unique opportunities for continued monitoring of regional surface deformation related to the culmination of a major seismic cycle, characterization of the dynamic behavior of continental lithosphere during the seismic sequence, and post-seismic transient deformation. During the last year, we have reprocessed all three previous epochs for which JPL fiducial free point positioning products available and are queued for the remaining needed products, completed two field campaigns monitoring approx. 20 sites (October 1995 and September 1996), begun modeling by development of a finite element mesh based on network station locations, and developed manuscripts dealing with both the Landers-related transient deformation at the latitude of Lone Pine and the velocity field of the whole experiment. We are currently deploying a 1997 observation campaign (June 1997). We use GPS geodetic studies to characterize deformation in the Mojave Desert region and related structural domains to the north, and geophysical modeling of lithospheric behavior. The modeling is constrained by our existing and continued GPS measurements, which will provide much needed data on far-field strain accumulation across the region and on the deformational response of continental lithosphere during and following a large earthquake, forming the basis for kinematic and dynamic modeling of secular and seismic-cycle deformation. GPS geodesy affords both regional coverage and high precision that uniquely bear on these problems.

Estimating the Effects of the Terminal Area Productivity Program

NASA Technical Reports Server (NTRS)

Lee, David A.; Kostiuk, Peter F.; Hemm, Robert V., Jr.; Wingrove, Earl R., III; Shapiro, Gerald

1997-01-01

The report describes methods and results of an analysis of the technical and economic benefits of the systems to be developed in the NASA Terminal Area Productivity (TAP) program. A runway capacity model using parameters that reflect the potential impact of the TAP technologies is described. The runway capacity model feeds airport specific models which are also described. The capacity estimates are used with a queuing model to calculate aircraft delays, and TAP benefits are determined by calculating the savings due to reduced delays. The report includes benefit estimates for Boston Logan and Detroit Wayne County airports. An appendix includes a description and listing of the runway capacity model.

Multifractal Internet Traffic Model and Active Queue Management

DTIC Science & Technology

2003-01-01

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

Influence of road network and population demand assumptions in evacuation modeling for distant tsunamis

USGS Publications Warehouse

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.

Interest-Driven Model for Human Dynamics

NASA Astrophysics Data System (ADS)

Shang, Ming-Sheng; Chen, Guan-Xiong; Dai, Shuang-Xing; Wang, Bing-Hong; Zhou, Tao

2010-04-01

Empirical observations indicate that the interevent time distribution of human actions exhibits heavy-tailed features. The queuing model based on task priorities is to some extent successful in explaining the origin of such heavy tails, however, it cannot explain all the temporal statistics of human behavior especially for the daily entertainments. We propose an interest-driven model, which can reproduce the power-law distribution of interevent time. The exponent can be analytically obtained and is in good accordance with the simulations. This model well explains the observed relationship between activities and power-law exponents, as reported recently for web-based behavior and the instant message communications.

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

NASA Astrophysics Data System (ADS)

Mukherjee, Satyam; Whalen, Ryan

2018-01-01

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.

Spontaneous symmetry breaking in a two-lane model for bidirectional overtaking traffic

NASA Astrophysics Data System (ADS)

Appert-Rolland, C.; Hilhorst, H. J.; Schehr, G.

2010-08-01

Firstly, we consider a unidirectional flux \\bar {\\omega } of vehicles, each of which is characterized by its 'natural' velocity v drawn from a distribution P(v). The traffic flow is modeled as a collection of straight 'world lines' in the time-space plane, with overtaking events represented by a fixed queuing time τ imposed on the overtaking vehicle. This geometrical model exhibits platoon formation and allows, among many other things, for the calculation of the effective average velocity w\\equiv \\phi (v) of a vehicle of natural velocity v. Secondly, we extend the model to two opposite lanes, A and B. We argue that the queuing time τ in one lane is determined by the traffic density in the opposite lane. On the basis of reasonable additional assumptions we establish a set of equations that couple the two lanes and can be solved numerically. It appears that above a critical value \\bar {\\omega }_{\\mathrm {c}} of the control parameter \\bar {\\omega } the symmetry between the lanes is spontaneously broken: there is a slow lane where long platoons form behind the slowest vehicles, and a fast lane where overtaking is easy due to the wide spacing between the platoons in the opposite direction. A variant of the model is studied in which the spatial vehicle density \\bar {\\rho } rather than the flux \\bar {\\omega } is the control parameter. Unequal fluxes \\bar {\\omega }_{\\mathrm {A}} and \\bar {\\omega }_{\\mathrm {B}} in the two lanes are also considered. The symmetry breaking phenomenon exhibited by this model, even though no doubt hard to observe in pure form in real-life traffic, nevertheless indicates a tendency of such traffic.

Models, solution, methods and their applicability of dynamic location problems (DLPs) (a gap analysis for further research)

NASA Astrophysics Data System (ADS)

Seyedhosseini, Seyed Mohammad; Makui, Ahmad; Shahanaghi, Kamran; Torkestani, Sara Sadat

2016-09-01

Determining the best location to be profitable for the facility's lifetime is the important decision of public and private firms, so this is why discussion about dynamic location problems (DLPs) is a critical significance. This paper presented a comprehensive review from 1968 up to most recent on published researches about DLPs and classified them into two parts. First, mathematical models developed based on different characteristics: type of parameters (deterministic, probabilistic or stochastic), number and type of objective function, numbers of commodity and modes, relocation time, number of relocation and relocating facilities, time horizon, budget and capacity constraints and their applicability. In second part, It have been also presented solution algorithms, main specification, applications and some real-world case studies of DLPs. At the ends, we concluded that in the current literature of DLPs, distribution systems and production-distribution systems with simple assumption of the tackle to the complexity of these models studied more than any other fields, as well as the concept of variety of services (hierarchical network), reliability, sustainability, relief management, waiting time for services (queuing theory) and risk of facility disruption need for further investigation. All of the available categories based on different criteria, solution methods and applicability of them, gaps and analysis which have been done in this paper suggest the ways for future research.

Modeling and Preliminary Simulation Studies for Packet-Based Precedence and Preemption for FCS Communications

DTIC Science & Technology

2006-09-27

Information Sciences Department, JHU/Applied Physics Laboratory, 12000 Johns Hopkins Road., Laurel, Maryland. 22104 ( PHB ) to meet the QoS requirements of...applications, e.g., (Keshav, 1997). However, to date, no work ex- ists to design and investigate PHB algorithms which simultaneously deliver QoS to...techniques to handle P&P requirements and rely upon standard, well studied QoS PHB , e.g., Weighted Round Robin, Class-Based Fair Queuing, etc., for han

Applying generalized stochastic Petri nets to manufacturing systems containing nonexponential transition functions

NASA Technical Reports Server (NTRS)

Watson, James F., III; Desrochers, Alan A.

1991-01-01

Generalized stochastic Petri nets (GSPNs) are applied to flexible manufacturing systems (FMSs). Throughput subnets and s-transitions are presented. Two FMS examples containing nonexponential distributions which were analyzed in previous papers by queuing theory and probability theory, respectively, are treated using GSPNs developed using throughput subnets and s-transitions. The GSPN results agree with the previous results, and developing and analyzing the GSPN models are straightforward and relatively easy compared to other methodologies.

Data management system performance modeling

NASA Technical Reports Server (NTRS)

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.

The study on the Layout of the Charging Station in Chengdu

NASA Astrophysics Data System (ADS)

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.

The evaluation model of the design of toll

NASA Astrophysics Data System (ADS)

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.

Social stability and helping in small animal societies

PubMed Central

Field, Jeremy; Cant, Michael A.

2009-01-01

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

An investigation of the impact of prolonged waiting times on blood donors in Ireland.

PubMed

McKeever, T; Sweeney, M R; Staines, A

2006-02-01

The aim of this study was to investigate the impact of prolonged queuing times on blood donors, by measuring their satisfaction levels, and positive and negative affects. As donation times have increased over the past number of years within the Irish Blood Transfusion Service, this is an important issue to examine in a climate where voluntary donors are becoming scarce and demands on people's time are increasing. Eighty-five blood donors were sampled from one urban and one rural blood donor clinic. The respondents conducted a questionnaire by means of face-to-face interview, while waiting in the clinic. The questionnaire contained the Positive and Negative Affect Scale (PANAS), and a waiting satisfaction scale. Both actual and perceived waiting times of the donors were noted. Waiting time was found to be negatively related to satisfaction. Inexperienced donors expressed higher levels of negative affect than experienced donors. Urban donors were significantly more satisfied than rural donors. There was a significant difference in perceived waiting time between lone donors and those queuing in a group, with those waiting alone perceiving their wait as shorter. While all respondents stated that they intended to donate again, over one-third stated that prolonged waiting times would be their most likely deterrent. However, only 15% stated that long queuing times might actually prevent them from donating in the future, and almost all respondents said that they would recommend donation to a friend, despite long queuing times. Although our results show that the respondents were not satisfied with current waiting times, it did not seem to affect their future intentions to donate. These findings provide some optimism for the future of blood donation in Ireland, as they suggest a strong sense of commitment to donation within the population sampled. Future research could explore the application of 'the service industry' approach to waiting times to blood donation clinics.

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

NASA Astrophysics Data System (ADS)

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.

Analysis and Simulation of Traffic Control for Resource Management in DVB-Based Broadband Satellite Access Networks

NASA Astrophysics Data System (ADS)

Impemba, Ernesto; Inzerilli, Tiziano

2003-07-01

Integration of satellite access networks with the Internet is seen as a strategic goal to achieve in order to provide ubiquitous broadband access to Internet services in Next Generation Networks (NGNs). One of the main interworking aspects which has been most studied is an efficient management of satellite resources, i.e. bandwidth and buffer space, in order to satisfy most demanding application requirements as to delay control and bandwidth assurance. In this context, resource management in DVB-S/DVB-RCS satellite technologies, emerging technologies for broadband satellite access and transport of IP applications, is a research issue largely investigated as a means to provide efficient bi-directional communications across satellites. This is in particular one of the principal goals of the SATIP6 project, sponsored within the 5th EU Research Programme Framework, i.e. IST. In this paper we present a possible approach to efficiently exploit bandwidth, the most critical resource in a broadband satellite access network, while pursuing satisfaction of delay and bandwidth requirements for applications with guaranteed QoS through a traffic control architecture to be implemented in ground terminals. Performance of this approach is assessed in terms of efficient exploitation of the uplink bandwidth and differentiation and minimization of queuing delays for most demanding applications over a time-varying capacity. Opnet simulations is used as analysis tool.

Real-time learning of predictive recognition categories that chunk sequences of items stored in working memory

PubMed Central

Kazerounian, Sohrob; Grossberg, Stephen

2014-01-01

How are sequences of events that are temporarily stored in a cognitive working memory unitized, or chunked, through learning? Such sequential learning is needed by the brain in order to enable language, spatial understanding, and motor skills to develop. In particular, how does the brain learn categories, or list chunks, that become selectively tuned to different temporal sequences of items in lists of variable length as they are stored in working memory, and how does this learning process occur in real time? The present article introduces a neural model that simulates learning of such list chunks. In this model, sequences of items are temporarily stored in an Item-and-Order, or competitive queuing, working memory before learning categorizes them using a categorization network, called a Masking Field, which is a self-similar, multiple-scale, recurrent on-center off-surround network that can weigh the evidence for variable-length sequences of items as they are stored in the working memory through time. A Masking Field hereby activates the learned list chunks that represent the most predictive item groupings at any time, while suppressing less predictive chunks. In a network with a given number of input items, all possible ordered sets of these item sequences, up to a fixed length, can be learned with unsupervised or supervised learning. The self-similar multiple-scale properties of Masking Fields interacting with an Item-and-Order working memory provide a natural explanation of George Miller's Magical Number Seven and Nelson Cowan's Magical Number Four. The article explains why linguistic, spatial, and action event sequences may all be stored by Item-and-Order working memories that obey similar design principles, and thus how the current results may apply across modalities. Item-and-Order properties may readily be extended to Item-Order-Rank working memories in which the same item can be stored in multiple list positions, or ranks, as in the list ABADBD. Comparisons with other models, including TRACE, MERGE, and TISK, are made. PMID:25339918

Evaluation of Job Queuing/Scheduling Software: Phase I Report

NASA Technical Reports Server (NTRS)

Jones, James Patton

1996-01-01

The recent proliferation of high performance work stations and the increased reliability of parallel systems have illustrated the need for robust job management systems to support parallel applications. To address this issue, the national Aerodynamic Simulation (NAS) supercomputer facility compiled a requirements checklist for job queuing/scheduling software. Next, NAS began an evaluation of the leading job management system (JMS) software packages against the checklist. This report describes the three-phase evaluation process, and presents the results of Phase 1: Capabilities versus Requirements. We show that JMS support for running parallel applications on clusters of workstations and parallel systems is still insufficient, even in the leading JMS's. However, by ranking each JMS evaluated against the requirements, we provide data that will be useful to other sites in selecting a JMS.

Optimizing Resource Utilization in Grid Batch Systems

NASA Astrophysics Data System (ADS)

Gellrich, Andreas

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

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

NASA Astrophysics Data System (ADS)

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.

Optimizing Endoscope Reprocessing Resources Via Process Flow Queuing Analysis.

PubMed

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.

Las Cumbres Observatory Global Telescope Network: Keeping Education in the Dark

NASA Astrophysics Data System (ADS)

Ross, Rachel J.

2007-12-01

Las Cumbres Observatory Global Telescope Network is a non-profit organization that is building a completely robotic network of telescopes for education (24 x 0.4m, clusters of 4) and science (18 x 1.0m, clusters of 3 and 2 x 2.0 meters) which will be longitudinally spaced so there will always be at least one cluster in the dark. The network will be completely accessible online with observations being completed in either real-time or queued-based modes. The network will also have the ability to complete very long observations of all kinds of variable objects and include a rapid response system will allow the telescopes to quickly slew to unexpected phenomena and provide around-the-clock monitoring. Students will be able to do research projects using and collecting data from both the long observations (e.g. extrasolar planet follow-up, variable star light curves, etc.) and the quick response (e.g. supernovae, GRBs, etc.), as well as use their own ideas to create personalized projects. Also available online will be a huge archive of data and the ability to use online software to process it. A large library of activities and resources will be available for all age groups and levels of science. LCOGTN will work cooperatively with international organizations to bring a vast amount of knowledge and experience together to create a world class program. Through these collaborations, pilots have already been started in a few European countries, as well as trial programs involving schools partnered between the USA and UK. LCOGTN's education network will provide an avenue for educators and learners to use cutting edge technology to do real science. All you need is a broadband internet connection, computer, and lots of enthusiasm and imagination.

Modeling surgical tool selection patterns as a "traveling salesman problem" for optimizing a modular surgical tool system.

PubMed

Nelson, Carl A; Miller, David J; Oleynikov, Dmitry

2008-01-01

As modular systems come into the forefront of robotic telesurgery, streamlining the process of selecting surgical tools becomes an important consideration. This paper presents a method for optimal queuing of tools in modular surgical tool systems, based on patterns in tool-use sequences, in order to minimize time spent changing tools. The solution approach is to model the set of tools as a graph, with tool-change frequency expressed as edge weights in the graph, and to solve the Traveling Salesman Problem for the graph. In a set of simulations, this method has shown superior performance at optimizing tool arrangements for streamlining surgical procedures.

A Modern Operating System for Near-real-time Environmental Observatories

NASA Astrophysics Data System (ADS)

Orcutt, John; Vernon, Frank

2014-05-01

The NSF Ocean Observatory Initiative (OOI) provided an opportunity for expanding the capabilities for managing open, near-real-time (latencies of seconds) data from ocean observatories. The sensors deployed in this system largely return data from seafloor, cabled fiber optic cables as well as satellite telemetry. Bandwidth demands range from high-definition movies to the transmission of data via Iridium satellite. The extended Internet also provides an opportunity to not only return data, but to also control the sensors and platforms that comprise the observatory. The data themselves are openly available to any users. In order to provide heightened network security and overall reliability, the connections to and from the sensors/platforms are managed without Layer 3 of the Internet, but instead rely upon message passing using an open protocol termed Advanced Queuing Messaging Protocol (AMQP). The highest bandwidths in the system are in the Regional Scale Network (RSN) off Oregon and Washington and on the continent with highly reliable network connections between observatory components at 10 Gbps. The maintenance of metadata and life cycle histories of sensors and platforms is critical for providing data provenance over the years. The integrated cyberinfrastructure is best thought of as an operating system for the observatory - like the data, the software is also open and can be readily applied to new observatories, for example, in the rapidly evolving Arctic.

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

NASA Astrophysics Data System (ADS)

Wei, Pei; Gu, Rentao; Ji, Yuefeng

2014-06-01

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

Pricing and location decisions in multi-objective facility location problem with M/M/m/k queuing systems

NASA Astrophysics Data System (ADS)

Tavakkoli-Moghaddam, Reza; Vazifeh-Noshafagh, Samira; Taleizadeh, Ata Allah; Hajipour, Vahid; Mahmoudi, Amin

2017-01-01

This article presents a new multi-objective model for a facility location problem with congestion and pricing policies. This model considers situations in which immobile service facilities are congested by a stochastic demand following M/M/m/k queues. The presented model belongs to the class of mixed-integer nonlinear programming models and NP-hard problems. To solve such a hard model, a new multi-objective optimization algorithm based on a vibration theory, namely multi-objective vibration damping optimization (MOVDO), is developed. In order to tune the algorithms parameters, the Taguchi approach using a response metric is implemented. The computational results are compared with those of the non-dominated ranking genetic algorithm and non-dominated sorting genetic algorithm. The outputs demonstrate the robustness of the proposed MOVDO in large-sized problems.

Exploring the "what if?" in geology through a RESTful open-source framework for cloud-based simulation and analysis

NASA Astrophysics Data System (ADS)

Klump, Jens; Robertson, Jess

2016-04-01

The spatial and temporal extent of geological phenomena makes experiments in geology difficult to conduct, if not entirely impossible and collection of data is laborious and expensive - so expensive that most of the time we cannot test a hypothesis. The aim, in many cases, is to gather enough data to build a predictive geological model. Even in a mine, where data are abundant, a model remains incomplete because the information at the level of a blasting block is two orders of magnitude larger than the sample from a drill core, and we have to take measurement errors into account. So, what confidence can we have in a model based on sparse data, uncertainties and measurement error? Our framework consist of two layers: (a) a ground-truth layer that contains geological models, which can be statistically based on historical operations data, and (b) a network of RESTful synthetic sensor microservices which can query the ground-truth for underlying properties and produce a simulated measurement to a control layer, which could be a database or LIMS, a machine learner or a companies' existing data infrastructure. Ground truth data are generated by an implicit geological model which serves as a host for nested models of geological processes as smaller scales. Our two layers are implemented using Flask and Gunicorn, which are open source Python web application framework and server, the PyData stack (numpy, scipy etc) and Rabbit MQ (an open-source queuing library). Sensor data is encoded using a JSON-LD version of the SensorML and Observations and Measurements standards. Containerisation of the synthetic sensors using Docker and CoreOS allows rapid and scalable deployment of large numbers of sensors, as well as sensor discovery to form a self-organized dynamic network of sensors. Real-time simulation of data sources can be used to investigate crucial questions such as the potential information gain from future sensing capabilities, or from new sampling strategies, or the combination of both, and it enables us to test many "what if?" questions, both in geology and in data engineering. What would we be able to see if we could obtain data at higher resolution? How would real-time data analysis change sampling strategies? Does our data infrastructure handle many new real-time data streams? What feature engineering can be deducted for machine learning approaches? By providing a 'data sandbox' able to scale to realistic geological scenarios we hope to start answering some of these questions. Faults happen in real world networks. Future work will investigate the effect of failure on dynamic sensor networks and the impact on the predictive capability of machine learning algorithms.

Optimisation of a honeybee-colony's energetics via social learning based on queuing delays

NASA Astrophysics Data System (ADS)

Thenius, Ronald; Schmickl, Thomas; Crailsheim, Karl

2008-06-01

Natural selection shaped the foraging-related processes of honeybees in such a way that a colony can react to changing environmental conditions optimally. To investigate this complex dynamic social system, we developed a multi-agent model of the nectar flow inside and outside of a honeybee colony. In a honeybee colony, a temporal caste collects nectar in the environment. These foragers bring their harvest into the colony, where they unload their nectar loads to one or more storer bees. Our model predicts that a cohort of foragers, collecting nectar from a single nectar source, is able to detect changes in quality in other food sources they have never visited, via the nectar processing system of the colony. We identified two novel pathways of forager-to-forager communication. Foragers can gain information about changes in the nectar flow in the environment via changes in their mean waiting time for unloadings and the number of experienced multiple unloadings. This way two distinct groups of foragers that forage on different nectar sources and that never communicate directly can share information via a third cohort of worker bees. We show that this noisy and loosely knotted social network allows a colony to perform collective information processing, so that a single forager has all necessary information available to be able to 'tune' its social behaviour, like dancing or dance-following. This way the net nectar gain of the colony is increased.

The Northwest Indiana Robotic Telescope

NASA Astrophysics Data System (ADS)

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.

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

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

Berry, M.; Samsa, M.; Walsh, D.

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 ofmore » ill persons seeking treatment, and queuing and delays within the mass treatment system--all metrics by which the plan can be judged.« less

Analysis and improvement measures of flight delay in China

NASA Astrophysics Data System (ADS)

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.

Data-driven traffic impact assessment tool for work zones.

DOT National Transportation Integrated Search

2017-03-01

Traditionally, traffic impacts of work zones have been assessed using planning software such as Quick Zone, custom spreadsheets, and others. These software programs generate delay, queuing, and other mobility measures but are difficult to validate du...

Traffic flow characteristic and capacity in intelligent work zones.

DOT National Transportation Integrated Search

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

Job Scheduling Under the Portable Batch System

NASA Technical Reports Server (NTRS)

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

1995-01-01

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

Virtual Queue in a Centralized Database Environment

NASA Astrophysics Data System (ADS)

Kar, Amitava; Pal, Dibyendu Kumar

2010-10-01

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

Second Evaluation of Job Queuing/Scheduling Software. Phase 1

NASA Technical Reports Server (NTRS)

Jones, James Patton; Brickell, Cristy; Chancellor, Marisa (Technical Monitor)

1997-01-01

The recent proliferation of high performance workstations and the increased reliability of parallel systems have illustrated the need for robust job management systems to support parallel applications. To address this issue, NAS compiled a requirements checklist for job queuing/scheduling software. Next, NAS evaluated the leading job management system (JMS) software packages against the checklist. A year has now elapsed since the first comparison was published, and NAS has repeated the evaluation. This report describes this second evaluation, and presents the results of Phase 1: Capabilities versus Requirements. We show that JMS support for running parallel applications on clusters of workstations and parallel systems is still lacking, however, definite progress has been made by the vendors to correct the deficiencies. This report is supplemented by a WWW interface to the data collected, to aid other sites in extracting the evaluation information on specific requirements of interest.

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

PubMed

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.

Developing a new stochastic competitive model regarding inventory and price

NASA Astrophysics Data System (ADS)

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.

A Cellular Neural Networks Based DiffServ Switch for Satellite Communication Systems

NASA Astrophysics Data System (ADS)

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

2003-07-01

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

A Seed-Based Plant Propagation Algorithm: The Feeding Station Model

PubMed Central

Salhi, Abdellah

2015-01-01

The seasonal production of fruit and seeds is akin to opening a feeding station, such as a restaurant. Agents coming to feed on the fruit are like customers attending the restaurant; they arrive at a certain rate and get served at a certain rate following some appropriate processes. The same applies to birds and animals visiting and feeding on ripe fruit produced by plants such as the strawberry plant. This phenomenon underpins the seed dispersion of the plants. Modelling it as a queuing process results in a seed-based search/optimisation algorithm. This variant of the Plant Propagation Algorithm is described, analysed, tested on nontrivial problems, and compared with well established algorithms. The results are included. PMID:25821858

Advance traffic control warning systems for maintenance operations : final report.

DOT National Transportation Integrated Search

1976-07-01

The report discusses the effect of certain variables defined by sign size, height of installation and legend on the driver responses as measured by speed, conflict and queuing parameters. Effects of electronically actuated, directional flashing signs...

Real-Time Operating System/360

NASA Technical Reports Server (NTRS)

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.

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

NASA Astrophysics Data System (ADS)

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

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

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

NASA Astrophysics Data System (ADS)

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.

Numerically exact full counting statistics of the nonequilibrium Anderson impurity model

NASA Astrophysics Data System (ADS)

Ridley, Michael; Singh, Viveka N.; Gull, Emanuel; Cohen, Guy

2018-03-01

The time-dependent full counting statistics of charge transport through an interacting quantum junction is evaluated from its generating function, controllably computed with the inchworm Monte Carlo method. Exact noninteracting results are reproduced; then, we continue to explore the effect of electron-electron interactions on the time-dependent charge cumulants, first-passage time distributions, and n -electron transfer distributions. We observe a crossover in the noise from Coulomb blockade to Kondo-dominated physics as the temperature is decreased. In addition, we uncover long-tailed spin distributions in the Kondo regime and analyze queuing behavior caused by correlations between single-electron transfer events.

SNR-based queue observations at CFHT

NASA Astrophysics Data System (ADS)

Devost, Daniel; Moutou, Claire; Manset, Nadine; Mahoney, Billy; Burdullis, Todd; Cuillandre, Jean-Charles; Racine, René

2016-07-01

In an effort to optimize the night time utilizing the exquisite weather on Maunakea, CFHT has equipped its dome with vents and is now moving its Queued Scheduled Observing (QSO)1 based operations toward Signal to Noise Ratio (SNR) observing. In this new mode, individual exposure times for a science program are estimated using a model that uses measurements of the weather conditions as input and the science program is considered completed when the depth required by the scientific requirements are reached. These changes allow CFHT to make better use of the excellent seeing conditions provided by Maunakea, allowing us to complete programs in a shorter time than allocated to the science programs.

Numerically exact full counting statistics of the nonequilibrium Anderson impurity model

DOE PAGES

Ridley, Michael; Singh, Viveka N.; Gull, Emanuel; ...

2018-03-06

The time-dependent full counting statistics of charge transport through an interacting quantum junction is evaluated from its generating function, controllably computed with the inchworm Monte Carlo method. Exact noninteracting results are reproduced; then, we continue to explore the effect of electron-electron interactions on the time-dependent charge cumulants, first-passage time distributions, and n-electron transfer distributions. We observe a crossover in the noise from Coulomb blockade to Kondo-dominated physics as the temperature is decreased. In addition, we uncover long-tailed spin distributions in the Kondo regime and analyze queuing behavior caused by correlations between single-electron transfer events

Numerically exact full counting statistics of the nonequilibrium Anderson impurity model

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

Ridley, Michael; Singh, Viveka N.; Gull, Emanuel

The time-dependent full counting statistics of charge transport through an interacting quantum junction is evaluated from its generating function, controllably computed with the inchworm Monte Carlo method. Exact noninteracting results are reproduced; then, we continue to explore the effect of electron-electron interactions on the time-dependent charge cumulants, first-passage time distributions, and n-electron transfer distributions. We observe a crossover in the noise from Coulomb blockade to Kondo-dominated physics as the temperature is decreased. In addition, we uncover long-tailed spin distributions in the Kondo regime and analyze queuing behavior caused by correlations between single-electron transfer events

Performance modeling for large database systems

NASA Astrophysics Data System (ADS)

Schaar, Stephen; Hum, Frank; Romano, Joe

1997-02-01

One of the unique approaches Science Applications International Corporation took to meet performance requirements was to start the modeling effort during the proposal phase of the Interstate Identification Index/Federal Bureau of Investigations (III/FBI) project. The III/FBI Performance Model uses analytical modeling techniques to represent the III/FBI system. Inputs to the model include workloads for each transaction type, record size for each record type, number of records for each file, hardware envelope characteristics, engineering margins and estimates for software instructions, memory, and I/O for each transaction type. The model uses queuing theory to calculate the average transaction queue length. The model calculates a response time and the resources needed for each transaction type. Outputs of the model include the total resources needed for the system, a hardware configuration, and projected inherent and operational availability. The III/FBI Performance Model is used to evaluate what-if scenarios and allows a rapid response to engineering change proposals and technical enhancements.

A queueing theory based model for business continuity in hospitals.

PubMed

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.

L&D Manual Turn Lane Storage Validation/Update : Executive Summary Report

DOT National Transportation Integrated Search

2012-08-01

The formation of queues on a highway facility is a sign of the presence of operationally : inefficient sections of the facility. Queuing occurs at intersections in large part due to overflow : or inadequacy of turn bays, inadequate capacity, or poor ...

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

NASA Astrophysics Data System (ADS)

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.

L&D Manual Turn Lane Storage Validation/Update

DOT National Transportation Integrated Search

2012-08-01

Queuing occurs at intersections mostly due to overflow or inadequacy of turn bays. The ODOT L&D : Manual Volume 1 has storage requirements for both signalized and unsignalized intersections. Figures : 401-9E and 401-10E of the L&D Manual provide the ...

Spectrally queued feature selection for robotic visual odometery

NASA Astrophysics Data System (ADS)

Pirozzo, David M.; Frederick, Philip A.; Hunt, Shawn; Theisen, Bernard; Del Rose, Mike

2011-01-01

Over the last two decades, research in Unmanned Vehicles (UV) has rapidly progressed and become more influenced by the field of biological sciences. Researchers have been investigating mechanical aspects of varying species to improve UV air and ground intrinsic mobility, they have been exploring the computational aspects of the brain for the development of pattern recognition and decision algorithms and they have been exploring perception capabilities of numerous animals and insects. This paper describes a 3 month exploratory applied research effort performed at the US ARMY Research, Development and Engineering Command's (RDECOM) Tank Automotive Research, Development and Engineering Center (TARDEC) in the area of biologically inspired spectrally augmented feature selection for robotic visual odometry. The motivation for this applied research was to develop a feasibility analysis on multi-spectrally queued feature selection, with improved temporal stability, for the purposes of visual odometry. The intended application is future semi-autonomous Unmanned Ground Vehicle (UGV) control as the richness of data sets required to enable human like behavior in these systems has yet to be defined.

The Queued Service Observing Project at CFHT

NASA Astrophysics Data System (ADS)

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

2002-12-01

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

Real-Time Multimission Event Notification System for Mars Relay

NASA Technical Reports Server (NTRS)

Wallick, Michael N.; Allard, Daniel A.; Gladden, Roy E.; Wang, Paul; Hy, Franklin H.

2013-01-01

As the Mars Relay Network is in constant flux (missions and teams going through their daily workflow), it is imperative that users are aware of such state changes. For example, a change by an orbiter team can affect operations on a lander team. This software provides an ambient view of the real-time status of the Mars network. The Mars Relay Operations Service (MaROS) comprises a number of tools to coordinate, plan, and visualize various aspects of the Mars Relay Network. As part of MaROS, a feature set was developed that operates on several levels of the software architecture. These levels include a Web-based user interface, a back-end "ReSTlet" built in Java, and databases that store the data as it is received from the network. The result is a real-time event notification and management system, so mission teams can track and act upon events on a moment-by-moment basis. This software retrieves events from MaROS and displays them to the end user. Updates happen in real time, i.e., messages are pushed to the user while logged into the system, and queued when the user is not online for later viewing. The software does not do away with the email notifications, but augments them with in-line notifications. Further, this software expands the events that can generate a notification, and allows user-generated notifications. Existing software sends a smaller subset of mission-generated notifications via email. A common complaint of users was that the system-generated e-mails often "get lost" with other e-mail that comes in. This software allows for an expanded set (including user-generated) of notifications displayed in-line of the program. By separating notifications, this can improve a user's workflow.

TIME SHARING WITH AN EXPLICIT PRIORITY QUEUING DISCIPLINE.

DTIC Science & Technology

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

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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

2017-04-01

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

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

NASA Astrophysics Data System (ADS)

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 0<α≤1 over a time scale of years. We present a simple model for this persistence phenomenon, framed within the standard priority queuing theory, of a target task which has the lowest priority compared to all other tasks that flow on the computer of an individual. We identify a “time deficit” control parameter β and a bifurcation to a regime where there is a nonzero probability for the target task to never be completed. The distribution of waiting time T until the completion of the target task has the power law tail ˜1/t1/2 , resulting from a first-passage solution of an equivalent Wiener process. Taking into account a diversity of time deficit parameters in a population of individuals, the power law tail is changed into 1/tα , with αɛ(0.5,∞) , including the well-known case 1/t . We also study the effect of “procrastination,” 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.

Data Services in Support of High Performance Computing-Based Distributed Hydrologic Models

NASA Astrophysics Data System (ADS)

Tarboton, D. G.; Horsburgh, J. S.; Dash, P. K.; Gichamo, T.; Yildirim, A. A.; Jones, N.

2014-12-01

We have developed web-based data services to support the application of hydrologic models on High Performance Computing (HPC) systems. The purposes of these services are to provide hydrologic researchers, modelers, water managers, and users access to HPC resources without requiring them to become HPC experts and understanding the intrinsic complexities of the data services, so as to reduce the amount of time and effort spent in finding and organizing the data required to execute hydrologic models and data preprocessing tools on HPC systems. These services address some of the data challenges faced by hydrologic models that strive to take advantage of HPC. Needed data is often not in the form needed by such models, requiring researchers to spend time and effort on data preparation and preprocessing that inhibits or limits the application of these models. Another limitation is the difficult to use batch job control and queuing systems used by HPC systems. We have developed a REST-based gateway application programming interface (API) for authenticated access to HPC systems that abstracts away many of the details that are barriers to HPC use and enhances accessibility from desktop programming and scripting languages such as Python and R. We have used this gateway API to establish software services that support the delineation of watersheds to define a modeling domain, then extract terrain and land use information to automatically configure the inputs required for hydrologic models. These services support the Terrain Analysis Using Digital Elevation Model (TauDEM) tools for watershed delineation and generation of hydrology-based terrain information such as wetness index and stream networks. These services also support the derivation of inputs for the Utah Energy Balance snowmelt model used to address questions such as how climate, land cover and land use change may affect snowmelt inputs to runoff generation. To enhance access to the time varying climate data used to drive hydrologic models, we have developed services to downscale and re-grid nationally available climate analysis data from systems such as NLDAS and MERRA. These cases serve as examples for how this approach can be extended to other models to enhance the use of HPC for hydrologic modeling.

Integrating Reservations and Queuing in Remote Laboratory Scheduling

ERIC Educational Resources Information Center

Lowe, D.

2013-01-01

Remote laboratories (RLs) have become increasingly seen as a useful tool in supporting flexible shared access to scarce laboratory resources. An important element in supporting shared access is coordinating the scheduling of the laboratory usage. Optimized scheduling can significantly decrease access waiting times and improve the utilization level…

Targeting LSD1 Epigenetic Signature in Castration-Recurrent Prostate Cancer

DTIC Science & Technology

2014-10-01

Sequencing libraries have been prepared and samples are currently queued at the Genomic Core facility at Roswell Park and results will be available...results to various meetings and seminars at Roswell Park, allowing me to get useful feedback from both clinicians and researchers. Furthermore, a brief

Minimizing the Delay at Traffic Lights

ERIC Educational Resources Information Center

Van Hecke, Tanja

2009-01-01

Vehicles holding at traffic lights is a typical queuing problem. At crossings the vehicles experience delay in both directions. Longer periods with green lights in one direction are disadvantageous for the vehicles coming from the other direction. The total delay for getting through the traffic point is what counts. This article presents an…

Phenomena of drag reduction on saltating sediment in shallow, supercritical flows

USDA-ARS?s Scientific Manuscript database

ABSTRACT: When a group of objects move through a fluid, it often exhibits coordinated behavior in which bodies in the wake of a leader generally experience reduced drag. Locomotion provides well known examples including the maneuvering and clustering of racing automobiles and bicyclists and queuing...

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

STochastic Analysis of Technical Systems (STATS): A model for evaluating combined effects of multiple uncertainties

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

Kranz, L.; VanKuiken, J.C.; Gillette, J.L.

1989-12-01

The STATS model, now modified to run on microcomputers, uses user- defined component uncertainties to calculate composite uncertainty distributions for systems or technologies. The program can be used to investigate uncertainties for a single technology on to compare two technologies. Although the term technology'' is used throughout the program screens, the program can accommodate very broad problem definitions. For example, electrical demand uncertainties, health risks associated with toxic material exposures, or traffic queuing delay times can be estimated. The terminology adopted in this version of STATS reflects the purpose of the earlier version, which was to aid in comparing advancedmore » electrical generating technologies. A comparison of two clean coal technologies in two power plants is given as a case study illustration. 7 refs., 35 figs., 7 tabs.« less

A Conceptual Framework for Improving Critical Care Patient Flow and Bed Use.

PubMed

Mathews, Kusum S; Long, Elisa F

2015-06-01

High demand for intensive care unit (ICU) services and limited bed availability have prompted hospitals to address capacity planning challenges. Simulation modeling can examine ICU bed assignment policies, accounting for patient acuity, to reduce ICU admission delays. To provide a framework for data-driven modeling of ICU patient flow, identify key measurable outcomes, and present illustrative analysis demonstrating the impact of various bed allocation scenarios on outcomes. A description of key inputs for constructing a queuing model was outlined, and an illustrative simulation model was developed to reflect current triage protocol within the medical ICU and step-down unit (SDU) at a single tertiary-care hospital. Patient acuity, arrival rate, and unit length of stay, consisting of a "service time" and "time to transfer," were estimated from 12 months of retrospective data (n = 2,710 adult patients) for 36 ICU and 15 SDU staffed beds. Patient priority was based on acuity and whether the patient originated in the emergency department. The model simulated the following hypothetical scenarios: (1) varied ICU/SDU sizes, (2) reserved ICU beds as a triage strategy, (3) lower targets for time to transfer out of the ICU, and (4) ICU expansion by up to four beds. Outcomes included ICU admission wait times and unit occupancy. With current bed allocation, simulated wait time averaged 1.13 (SD, 1.39) hours. Reallocating all SDU beds as ICU decreased overall wait times by 7.2% to 1.06 (SD, 1.39) hours and increased bed occupancy from 80 to 84%. Reserving the last available bed for acute patients reduced wait times for acute patients from 0.84 (SD, 1.12) to 0.31 (SD, 0.30) hours, but tripled subacute patients' wait times from 1.39 (SD, 1.81) to 4.27 (SD, 5.44) hours. Setting transfer times to wards for all ICU/SDU patients to 1 hour decreased wait times for incoming ICU patients, comparable to building one to two additional ICU beds. Hospital queuing and simulation modeling with empiric data inputs can evaluate how changes in ICU bed assignment could impact unit occupancy levels and patient wait times. Trade-offs associated with dedicating resources for acute patients versus expanding capacity for all patients can be examined.

Data Collection, Access and Presentation Technologies in the National Ecological Observatory (NEON) Design (Invited)

NASA Astrophysics Data System (ADS)

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.

An analytic performance model of disk arrays and its application

NASA Technical Reports Server (NTRS)

Lee, Edward K.; Katz, Randy H.

1991-01-01

As disk arrays become widely used, tools for understanding and analyzing their performance become increasingly important. In particular, performance models can be invaluable in both configuring and designing disk arrays. Accurate analytic performance models are desirable over other types of models because they can be quickly evaluated, are applicable under a wide range of system and workload parameters, and can be manipulated by a range of mathematical techniques. Unfortunately, analytical performance models of disk arrays are difficult to formulate due to the presence of queuing and fork-join synchronization; a disk array request is broken up into independent disk requests which must all complete to satisfy the original request. We develop, validate, and apply an analytic performance model for disk arrays. We derive simple equations for approximating their utilization, response time, and throughput. We then validate the analytic model via simulation and investigate the accuracy of each approximation used in deriving the analytical model. Finally, we apply the analytical model to derive an equation for the optimal unit of data striping in disk arrays.

Dynamic resource allocation scheme for distributed heterogeneous computer systems

NASA Technical Reports Server (NTRS)

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

1991-01-01

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

Service Management Database for DSN Equipment

NASA Technical Reports Server (NTRS)

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

2009-01-01

This data- and event-driven persistent storage system leverages the use of commercial software provided by Oracle for portability, ease of maintenance, scalability, and ease of integration with embedded, client-server, and multi-tiered applications. In this role, the Service Management Database (SMDB) is a key component of the overall end-to-end process involved in the scheduling, preparation, and configuration of the Deep Space Network (DSN) equipment needed to perform the various telecommunication services the DSN provides to its customers worldwide. SMDB makes efficient use of triggers, stored procedures, queuing functions, e-mail capabilities, data management, and Java integration features provided by the Oracle relational database management system. SMDB uses a third normal form schema design that allows for simple data maintenance procedures and thin layers of integration with client applications. The software provides an integrated event logging system with ability to publish events to a JMS messaging system for synchronous and asynchronous delivery to subscribed applications. It provides a structured classification of events and application-level messages stored in database tables that are accessible by monitoring applications for real-time monitoring or for troubleshooting and analysis over historical archives.

Evolving Requirements for Magnetic Tape Data Storage Systems

NASA Technical Reports Server (NTRS)

Gniewek, John J.

1996-01-01

Magnetic tape data storage systems have evolved in an environment where the major applications have been back-up/restore, disaster recovery, and long term archive. Coincident with the rapidly improving price-performance of disk storage systems, the prime requirements for tape storage systems have remained: (1) low cost per MB, (2) a data rate balanced to the remaining system components. Little emphasis was given to configuring the technology components to optimize retrieval of the stored data. Emerging new applications such as network attached high speed memory (HSM), and digital libraries, place additional emphasis and requirements on the retrieval of the stored data. It is therefore desirable to consider the system to be defined both by STorage And Retrieval System (STARS) requirements. It is possible to provide comparative performance analysis of different STARS by incorporating parameters related to (1) device characteristics, and (2) application characteristics in combination with queuing theory analysis. Results of these analyses are presented here in the form of response time as a function of system configuration for two different types of devices and for a variety of applications.

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

Federal Register 2010, 2011, 2012, 2013, 2014

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

Design of object-oriented distributed simulation classes

NASA Technical Reports Server (NTRS)

Schoeffler, James D. (Principal Investigator)

1995-01-01

Distributed simulation of aircraft engines as part of a computer aided design package is being developed by NASA Lewis Research Center for the aircraft industry. The project is called NPSS, an acronym for 'Numerical Propulsion Simulation System'. NPSS is a flexible object-oriented simulation of aircraft engines requiring high computing speed. It is desirable to run the simulation on a distributed computer system with multiple processors executing portions of the simulation in parallel. The purpose of this research was to investigate object-oriented structures such that individual objects could be distributed. The set of classes used in the simulation must be designed to facilitate parallel computation. Since the portions of the simulation carried out in parallel are not independent of one another, there is the need for communication among the parallel executing processors which in turn implies need for their synchronization. Communication and synchronization can lead to decreased throughput as parallel processors wait for data or synchronization signals from other processors. As a result of this research, the following have been accomplished. The design and implementation of a set of simulation classes which result in a distributed simulation control program have been completed. The design is based upon MIT 'Actor' model of a concurrent object and uses 'connectors' to structure dynamic connections between simulation components. Connectors may be dynamically created according to the distribution of objects among machines at execution time without any programming changes. Measurements of the basic performance have been carried out with the result that communication overhead of the distributed design is swamped by the computation time of modules unless modules have very short execution times per iteration or time step. An analytical performance model based upon queuing network theory has been designed and implemented. Its application to realistic configurations has not been carried out.

Design of Object-Oriented Distributed Simulation Classes

NASA Technical Reports Server (NTRS)

Schoeffler, James D.

1995-01-01

Distributed simulation of aircraft engines as part of a computer aided design package being developed by NASA Lewis Research Center for the aircraft industry. The project is called NPSS, an acronym for "Numerical Propulsion Simulation System". NPSS is a flexible object-oriented simulation of aircraft engines requiring high computing speed. It is desirable to run the simulation on a distributed computer system with multiple processors executing portions of the simulation in parallel. The purpose of this research was to investigate object-oriented structures such that individual objects could be distributed. The set of classes used in the simulation must be designed to facilitate parallel computation. Since the portions of the simulation carried out in parallel are not independent of one another, there is the need for communication among the parallel executing processors which in turn implies need for their synchronization. Communication and synchronization can lead to decreased throughput as parallel processors wait for data or synchronization signals from other processors. As a result of this research, the following have been accomplished. The design and implementation of a set of simulation classes which result in a distributed simulation control program have been completed. The design is based upon MIT "Actor" model of a concurrent object and uses "connectors" to structure dynamic connections between simulation components. Connectors may be dynamically created according to the distribution of objects among machines at execution time without any programming changes. Measurements of the basic performance have been carried out with the result that communication overhead of the distributed design is swamped by the computation time of modules unless modules have very short execution times per iteration or time step. An analytical performance model based upon queuing network theory has been designed and implemented. Its application to realistic configurations has not been carried out.

Prior Individual Training and Self-Organized Queuing during Group Emergency Escape of Mice from Water Pool

PubMed Central

Saloma, Caesar; Perez, Gay Jane; Gavile, Catherine Ann; Ick-Joson, Jacqueline Judith; Palmes-Saloma, Cynthia

2015-01-01

We study the impact of prior individual training during group emergency evacuation using mice that escape from an enclosed water pool to a dry platform via any of two possible exits. Experimenting with mice avoids serious ethical and legal issues that arise when dealing with unwitting human participants while minimizing concerns regarding the reliability of results obtained from simulated experiments using ‘actors’. First, mice were trained separately and their individual escape times measured over several trials. Mice learned quickly to swim towards an exit–they achieved their fastest escape times within the first four trials. The trained mice were then placed together in the pool and allowed to escape. No two mice were permitted in the pool beforehand and only one could pass through an exit opening at any given time. At first trial, groups of trained mice escaped seven and five times faster than their corresponding control groups of untrained mice at pool occupancy rate ρ of 11.9% and 4%, respectively. Faster evacuation happened because trained mice: (a) had better recognition of the available pool space and took shorter escape routes to an exit, (b) were less likely to form arches that blocked an exit opening, and (c) utilized the two exits efficiently without preference. Trained groups achieved continuous egress without an apparent leader-coordinator (self-organized queuing)—a collective behavior not experienced during individual training. Queuing was unobserved in untrained groups where mice were prone to wall seeking, aimless swimming and/or blind copying that produced circuitous escape routes, biased exit use and clogging. The experiments also reveal that faster and less costly group training at ρ = 4%, yielded an average individual escape time that is comparable with individualized training. However, group training in a more crowded pool (ρ = 11.9%) produced a longer average individual escape time. PMID:25693170

Fairness in the coronary angiography queue.

PubMed

Alter, D A; Basinski, A S; Cohen, E A; Naylor, C D

1999-10-05

Since waiting lists for coronary angiography are generally managed without explicit queuing criteria, patients may not receive priority on the basis of clinical acuity. The objective of this study was to examine clinical and nonclinical determinants of the length of time patients wait for coronary angiography. In this single-centre prospective cohort study conducted in the autumn of 1997, 357 consecutive patients were followed from initial triage until a coronary angiography was performed or an adverse cardiac event occurred. The referring physicians' hospital affiliation (physicians at Sunnybrook & Women's College Health Sciences Centre, those who practice at another centre but perform angiography at Sunnybrook and those with no previous association with Sunnybrook) was used to compare processes of care. A clinical urgency rating scale was used to assign a recommended maximum waiting time (RMWT) to each patient retrospectively, but this was not used in the queuing process. RMWTs and actual waiting times for patients in the 3 referral groups were compared; the influence clinical and nonclinical variables had on the actual length of time patients waited for coronary angiography was assessed; and possible predictors of adverse events were examined. Of 357 patients referred to Sunnybrook, 22 (6.2%) experienced adverse events while in the queue. Among those who remained, 308 (91.9%) were in need of coronary angiography; 201 (60.0%) of those patients received one within the RMWT. The length of time to angiography was influenced by clinical characteristics similar to those specified on the urgency rating scale, leading to a moderate agreement between actual waiting times and RMWTs (kappa = 0.53). However, physician affiliation was a highly significant (p < 0.001) and independent predictor of waiting time. Whereas 45.6% of the variation in waiting time was explained by all clinical factors combined, 9.3% of the variation was explained by physician affiliation alone. Informal queuing practices for coronary angiography do reflect clinical acuity, but they are also influenced by nonclinical factors, such as the nature of the physicians' association with the catheterization facility.

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

PubMed

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

1996-01-01

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

Routine activities and emotion in the life of dairy cows: Integrating body language into an affective state framework

PubMed Central

de Oliveira, Daiana

2018-01-01

We assessed dairy cows’ body postures while they were performing different stationary activities in a loose housing system and then used the variation within and between individuals to identify potential connections between specific postures and the valence and arousal dimensions of emotion. We observed 72 individuals within a single milking herd focusing on their ear, neck and tail positions while they were: feeding from individual roughage bins, being brushed by a mechanical rotating brush and queuing to enter a single automatic milking system. Cows showed different ear, neck and tail postures depending on the situation. When combined, their body posture during feeding was ears back up and neck down, with tail wags directed towards the body, during queuing their ears were mainly axial and forward, their neck below the horizontal and the tail hanging stationary, and during brushing their ears were backwards and asymmetric, the neck horizontal and the tail wagging vigorously. We then placed these findings about cow body posture during routine activities into an arousal/valence framework used in animal emotion research (dimensional model of core affect). In this way we generate a priori predictions of how the positions of the ears, neck and tail of cows may change in other situations, previously demonstrated to vary in valence and arousal. We propose that this new methodology, with its different steps of integration, could contribute to the identification and validation of behavioural (postural) indicators of how positively or negatively cows experience other activities, or situations, and how calm or aroused they are. Although developed here on dairy cattle, by focusing on relevant postures, this approach could be easily adapted to other species. PMID:29718937

Studies of the limit order book around large price changes

NASA Astrophysics Data System (ADS)

Tóth, B.; Kertész, J.; Farmer, J. D.

2009-10-01

We study the dynamics of the limit order book of liquid stocks after experiencing large intra-day price changes. In the data we find large variations in several microscopical measures, e.g., the volatility the bid-ask spread, the bid-ask imbalance, the number of queuing limit orders, the activity (number and volume) of limit orders placed and canceled, etc. The relaxation of the quantities is generally very slow that can be described by a power law of exponent ≈ 0.4. We introduce a numerical model in order to understand the empirical results better. We find that with a zero intelligence deposition model of the order flow the empirical results can be reproduced qualitatively. This suggests that the slow relaxations might not be results of agents' strategic behaviour. Studying the difference between the exponents found empirically and numerically helps us to better identify the role of strategic behaviour in the phenomena. in here

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

NASA Astrophysics Data System (ADS)

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 Survey of Telephone Inquiries: Case Study and Operational Impact in an Academic Library Reference Department.

ERIC Educational Resources Information Center

Allen, Frank R.; Smith, Rita H.

1993-01-01

Describes a survey that was conducted at the University of Tennessee at Knoxville library to count and categorize the types of questions coming into the reference department from telephone calls. Informational and directional calls are examined, implications for staffing are considered, and queuing theory is applied. (seven references) (LRW)

'people queued for hours to see him'.

PubMed

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.

Low latency adaptive streaming of HD H.264 video over 802.11 wireless networks with cross-layer feedback

NASA Astrophysics Data System (ADS)

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.

Beam queuing for aeronautical free space optical networks

NASA Astrophysics Data System (ADS)

Karras, Kimon; Marinos, Dimitris; Kouros, Pavlos

2010-08-01

Free space optical technologies are currently only very marginally used in aviation, particularly for communication purposes. Most applications occur in a military environment, with civilian aviation remaining oblivious to its advantages. One of these is high-bandwidth communication between the various actors available in an aeronautical network. Considerable research is underway in order to resolve a multitude of issues like reliable reception and transmission of the optical signal and the construction of high performance, small and lightweight terminals for the optical transceiver. The slow Pointing, Acquisition and Tracking of the latter represents a significant issue, which detracts from their usability in such an environment. Since an aircraft may carry only a limited number of such terminals on board, the delay of a terminal in reacquiring a target (which is in the order of several seconds) constitutes a significant hurdle in achieving satisfactory connectivity. This paper proposes an optimization technique, in which packet are reordered dynamically before transmission in the sender node in order to minimize terminal movement and thus avoid the time-consuming PAT process. Several parameters are considered such as QoS of the packets, minimization of the number of movements of the terminal and of the distance it must traverse when it reacquires a target. The algorithm was tested by integrating it into a custom built, discrete event SystemC simulator. The results verify that incorporating into such a system yields tangible benefits in terms of the practical throughput achieved by the system through the minimization of idle time, while moving.

Affirmative Action Case Queued Up for Airing at High Court

ERIC Educational Resources Information Center

Walsh, Mark

2012-01-01

The future of affirmative action in education--not just for colleges but potentially for K-12 schools as well--may be on the line when the U.S. Supreme Court takes up a race-conscious admissions plan from the University of Texas next month. That seems apparent to the scores of education groups that have lined up behind the university with…

Occupational Feminization and Pay: Assessing Causal Dynamics Using 1950-2000 U.S. Census Data

ERIC Educational Resources Information Center

Levanon, Asaf; England, Paula; Allison, Paul

2009-01-01

Occupations with a greater share of females pay less than those with a lower share, controlling for education and skill. This association is explained by two dominant views: devaluation and queuing. The former views the pay offered in an occupation to affect its female proportion, due to employers' preference for men--a gendered labor queue. The…

Role of optimization in the human dynamics of task execution

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Optical burst switching for the next generation Optical Internet

NASA Astrophysics Data System (ADS)

Yoo, Myungsik

2000-11-01

In recent years, Internet Protocol (IP) over Wavelength Division Multiplexing (WDM) networks for the next generation Internet (or the so-called Optical Internet) have received enormous attention. There are two main drivers for an Optical Internet. One is the explosion of Internet traffic, which seems to keep growing exponentially. The other driver is the rapid advance in the WDM optical networking technology. In this study, key issues in the optical (WDM) layer will be investigated. As a novel switching paradigm for Optical Internet, Optical Burst Switching (OBS) is discussed. By leveraging the attractive properties of optical communications and at the same time, taking into account its limitations, OBS can combine the best of optical circuit-switching and packet/cell switching. The general concept of JET-based OBS protocol is described, including offset time and delayed reservation. In the next generation Optical Internet, one must address how to support Quality of Service (QoS) at the WDM layer since current IP provides only best effort services. The offset-time- based QoS scheme is proposed as a way of supporting QoS at the WDM layer. Unlike existing QoS schemes, offset- time-based QoS scheme does not mandate the use of buffer to differentiate services. For the bufferless WDM switch, the performance of offset- time-based QoS scheme is evaluated in term of blocking probability. In addition, the extra offset time required for class isolation is quantified and the theoretical bounds on blocking probability are analyzed. The offset-time-based scheme is applied to WDM switch with limited fiber delay line (FDL) buffer. We evaluate the effect of having a FDL buffer on the QoS performance of the offset-time-based scheme in terms of the loss probability and queuing delay of bursts. Finally, in order to dimension the network resources in Optical Internet backbone networks, the performance of the offset-time-based QoS scheme is evaluated for the multi-hop case. In particular, we consider very high performance Backbone Network Service (vBNS) backbone network. Various policies such as drop, retransmission, deflection routing and buffering are considered for performance evaluation. The performance results obtained under these policies are compared to decide the most efficient policy for the WDM backbone network.

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

NASA Astrophysics Data System (ADS)

Korelin, Ivan A.; Porshnev, Sergey V.

2018-01-01

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

Influence of Weather on the Predicted Moisture Content of Field Chopped EnergySorghum and Switchgrass

DOE PAGES

Popp, Michael P.; Searcy, Stephen S.; Sokhansanj, Shahab; ...

2015-03-25

To determine the effects of weather on harvested moisture content (MC) of switchgrass (Panicum virgatum) and energy sorghum (Sorghum bicolor), tracking of harvest progress on individual fields in the Integrated Biomass Supply and Logistics (IBSAL) model was modified to allow: i) rewetting of swathed material in the drying formulae; and ii) field queuing rules based on equipment availability and weather. Estimated crop yield and initial MC by harvest date, as observed in field trials, along with the modeling of different delays between mowing and harvest allowed estimation of harvested MC, annual tonnage processed and associated processing cost differences by cropmore » and location over 10 years. Extending the hours of annual equipment use had minor implications on cost of production. Energy sorghum proved difficult to dry in the field. Its higher yield, leading to shorter supply distance to the plant, may justify harvesting of energy sorghum early in the season with drier weather. Lastly, later harvest for lower-yielding switchgrass offers MC advantages.« less

Influence of Weather on the Predicted Moisture Content of Field Chopped EnergySorghum and Switchgrass

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

Popp, Michael P.; Searcy, Stephen S.; Sokhansanj, Shahab

To determine the effects of weather on harvested moisture content (MC) of switchgrass (Panicum virgatum) and energy sorghum (Sorghum bicolor), tracking of harvest progress on individual fields in the Integrated Biomass Supply and Logistics (IBSAL) model was modified to allow: i) rewetting of swathed material in the drying formulae; and ii) field queuing rules based on equipment availability and weather. Estimated crop yield and initial MC by harvest date, as observed in field trials, along with the modeling of different delays between mowing and harvest allowed estimation of harvested MC, annual tonnage processed and associated processing cost differences by cropmore » and location over 10 years. Extending the hours of annual equipment use had minor implications on cost of production. Energy sorghum proved difficult to dry in the field. Its higher yield, leading to shorter supply distance to the plant, may justify harvesting of energy sorghum early in the season with drier weather. Lastly, later harvest for lower-yielding switchgrass offers MC advantages.« less

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

NASA Technical Reports Server (NTRS)

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.

Computer models of social processes: the case of migration.

PubMed

Beshers, J M

1967-06-01

The demographic model is a program for representing births, deaths, migration, and social mobility as social processes in a non-stationary stochastic process (Markovian). Transition probabilities for each age group are stored and then retrieved at the next appearance of that age cohort. In this way new transition probabilities can be calculated as a function of the old transition probabilities and of two successive distribution vectors.Transition probabilities can be calculated to represent effects of the whole age-by-state distribution at any given time period, too. Such effects as saturation or queuing may be represented by a market mechanism; for example, migration between metropolitan areas can be represented as depending upon job supplies and labor markets. Within metropolitan areas, migration can be represented as invasion and succession processes with tipping points (acceleration curves), and the market device has been extended to represent this phenomenon.Thus, the demographic model makes possible the representation of alternative classes of models of demographic processes. With each class of model one can deduce implied time series (varying parame-terswithin the class) and the output of the several classes can be compared to each other and to outside criteria, such as empirical time series.

Reinventing Emergency Department Flow via Healthcare Delivery Science.

PubMed

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.

Wilber 3: A Python-Django Web Application For Acquiring Large-scale Event-oriented Seismic Data

NASA Astrophysics Data System (ADS)

Newman, R. L.; Clark, A.; Trabant, C. M.; Karstens, R.; Hutko, A. R.; Casey, R. E.; Ahern, T. K.

2013-12-01

Since 2001, the IRIS Data Management Center (DMC) WILBER II system has provided a convenient web-based interface for locating seismic data related to a particular event, and requesting a subset of that data for download. Since its launch, both the scale of available data and the technology of web-based applications have developed significantly. Wilber 3 is a ground-up redesign that leverages a number of public and open-source projects to provide an event-oriented data request interface with a high level of interactivity and scalability for multiple data types. Wilber 3 uses the IRIS/Federation of Digital Seismic Networks (FDSN) web services for event data, metadata, and time-series data. Combining a carefully optimized Google Map with the highly scalable SlickGrid data API, the Wilber 3 client-side interface can load tens of thousands of events or networks/stations in a single request, and provide instantly responsive browsing, sorting, and filtering of event and meta data in the web browser, without further reliance on the data service. The server-side of Wilber 3 is a Python-Django application, one of over a dozen developed in the last year at IRIS, whose common framework, components, and administrative overhead represent a massive savings in developer resources. Requests for assembled datasets, which may include thousands of data channels and gigabytes of data, are queued and executed using the Celery distributed Python task scheduler, giving Wilber 3 the ability to operate in parallel across a large number of nodes.

Use of an administrative data set to determine optimal scheduling of an alcohol intervention worker.

PubMed

Peterson, Timothy A; Desmond, Jeffrey S; Cunningham, Rebecca

2012-06-01

Brief alcohol interventions are efficacious in reducing alcohol-related consequences among emergency department (ED) patients. Use of non-clinical staff may increase alcohol screening and intervention; however, optimal scheduling of an alcohol intervention worker (AIW) is unknown. Determine optimal scheduling of an AIW based on peak discharge time of alcohol-related ED visits. Discharge times for consecutive patients with an alcohol-related diagnosis were abstracted from an urban ED's administrative data set from September 2005 through August 2007. Queuing theory was used to identify optimal scheduling. Data for weekends and weekdays were analyzed separately. Stationary independent period-by-period analysis was performed for hourly periods. An M/M/s queuing model, for Markovian inter-arrival time/Markovian service time/and potentially more than one server, was developed for each hour assuming: 1) a single unlimited queue; 2) 75% of patients waited no longer than 30 min for intervention; 3) AIW spent an average 20 min/patient. Estimated average utilization/hour was calculated; if utilization/hour exceeded 25%, AIW staff was considered necessary. There were 2282 patient visits (mean age 38 years, range 11-84 years). Weekdays accounted for 45% of visits; weekends 55%. On weekdays, one AIW from 6:00 a.m.-9:00 a.m. (max utilization 42%/hour) would accommodate 28% of weekday alcohol-related patients. On weekends, 5:00 a.m.-11:00 a.m. (max utilization 50%), one AIW would cover 54% of all weekend alcohol-related visits. During other hours the utilization rate falls below 25%/hour. Evaluating 2 years of discharge data revealed that 30 h of dedicated AIW time--18 weekend hours (5:00 a.m.-11:00 a.m.), 12 weekday hours (6:00 a.m.-9:00 a.m.)--would allow maximal patient alcohol screening and intervention with minimal additional burden to clinical staff. Copyright © 2012 Elsevier Inc. All rights reserved.

Stochastic switching in biology: from genotype to phenotype

NASA Astrophysics Data System (ADS)

Bressloff, Paul C.

2017-03-01

There has been a resurgence of interest in non-equilibrium stochastic processes in recent years, driven in part by the observation that the number of molecules (genes, mRNA, proteins) involved in gene expression are often of order 1-1000. This means that deterministic mass-action kinetics tends to break down, and one needs to take into account the discrete, stochastic nature of biochemical reactions. One of the major consequences of molecular noise is the occurrence of stochastic biological switching at both the genotypic and phenotypic levels. For example, individual gene regulatory networks can switch between graded and binary responses, exhibit translational/transcriptional bursting, and support metastability (noise-induced switching between states that are stable in the deterministic limit). If random switching persists at the phenotypic level then this can confer certain advantages to cell populations growing in a changing environment, as exemplified by bacterial persistence in response to antibiotics. Gene expression at the single-cell level can also be regulated by changes in cell density at the population level, a process known as quorum sensing. In contrast to noise-driven phenotypic switching, the switching mechanism in quorum sensing is stimulus-driven and thus noise tends to have a detrimental effect. A common approach to modeling stochastic gene expression is to assume a large but finite system and to approximate the discrete processes by continuous processes using a system-size expansion. However, there is a growing need to have some familiarity with the theory of stochastic processes that goes beyond the standard topics of chemical master equations, the system-size expansion, Langevin equations and the Fokker-Planck equation. Examples include stochastic hybrid systems (piecewise deterministic Markov processes), large deviations and the Wentzel-Kramers-Brillouin (WKB) method, adiabatic reductions, and queuing/renewal theory. The major aim of this review is to provide a self-contained survey of these mathematical methods, mainly within the context of biological switching processes at both the genotypic and phenotypic levels. However, applications to other examples of biological switching are also discussed, including stochastic ion channels, diffusion in randomly switching environments, bacterial chemotaxis, and stochastic neural networks.

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

NASA Technical Reports Server (NTRS)

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

1993-01-01

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

Spectrally Queued Feature Selection for Robotic Visual Odometery

DTIC Science & Technology

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

Gene regulatory network inference from multifactorial perturbation data using both regression and correlation analyses.

PubMed

Xiong, Jie; Zhou, Tong

2012-01-01

An important problem in systems biology is to reconstruct gene regulatory networks (GRNs) from experimental data and other a priori information. The DREAM project offers some types of experimental data, such as knockout data, knockdown data, time series data, etc. Among them, multifactorial perturbation data are easier and less expensive to obtain than other types of experimental data and are thus more common in practice. In this article, a new algorithm is presented for the inference of GRNs using the DREAM4 multifactorial perturbation data. The GRN inference problem among [Formula: see text] genes is decomposed into [Formula: see text] different regression problems. In each of the regression problems, the expression level of a target gene is predicted solely from the expression level of a potential regulation gene. For different potential regulation genes, different weights for a specific target gene are constructed by using the sum of squared residuals and the Pearson correlation coefficient. Then these weights are normalized to reflect effort differences of regulating distinct genes. By appropriately choosing the parameters of the power law, we constructe a 0-1 integer programming problem. By solving this problem, direct regulation genes for an arbitrary gene can be estimated. And, the normalized weight of a gene is modified, on the basis of the estimation results about the existence of direct regulations to it. These normalized and modified weights are used in queuing the possibility of the existence of a corresponding direct regulation. Computation results with the DREAM4 In Silico Size 100 Multifactorial subchallenge show that estimation performances of the suggested algorithm can even outperform the best team. Using the real data provided by the DREAM5 Network Inference Challenge, estimation performances can be ranked third. Furthermore, the high precision of the obtained most reliable predictions shows the suggested algorithm may be helpful in guiding biological experiment designs.

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

PubMed Central

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

2014-01-01

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

Toward Implementing Patient Flow in a Cancer Treatment Center to Reduce Patient Waiting Time and Improve Efficiency.

PubMed

Suss, Samuel; Bhuiyan, Nadia; Demirli, Kudret; Batist, Gerald

2017-06-01

Outpatient cancer treatment centers can be considered as complex systems in which several types of medical professionals and administrative staff must coordinate their work to achieve the overall goals of providing quality patient care within budgetary constraints. In this article, we use analytical methods that have been successfully employed for other complex systems to show how a clinic can simultaneously reduce patient waiting times and non-value added staff work in a process that has a series of steps, more than one of which involves a scarce resource. The article describes the system model and the key elements in the operation that lead to staff rework and patient queuing. We propose solutions to the problems and provide a framework to evaluate clinic performance. At the time of this report, the proposals are in the process of implementation at a cancer treatment clinic in a major metropolitan hospital in Montreal, Canada.

The fully actuated traffic control problem solved by global optimization and complementarity

NASA Astrophysics Data System (ADS)

Ribeiro, Isabel M.; de Lurdes de Oliveira Simões, Maria

2016-02-01

Global optimization and complementarity are used to determine the signal timing for fully actuated traffic control, regarding effective green and red times on each cycle. The average values of these parameters can be used to estimate the control delay of vehicles. In this article, a two-phase queuing system for a signalized intersection is outlined, based on the principle of minimization of the total waiting time for the vehicles. The underlying model results in a linear program with linear complementarity constraints, solved by a sequential complementarity algorithm. Departure rates of vehicles during green and yellow periods were treated as deterministic, while arrival rates of vehicles were assumed to follow a Poisson distribution. Several traffic scenarios were created and solved. The numerical results reveal that it is possible to use global optimization and complementarity over a reasonable number of cycles and determine with efficiency effective green and red times for a signalized intersection.

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

PubMed

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

2014-01-01

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

AmeriFlux Data Processing: Integrating automated and manual data management across software technologies and an international network to generate timely data products

NASA Astrophysics Data System (ADS)

Christianson, D. S.; Beekwilder, N.; Chan, S.; Cheah, Y. W.; Chu, H.; Dengel, S.; O'Brien, F.; Pastorello, G.; Sandesh, M.; Torn, M. S.; Agarwal, D.

2017-12-01

AmeriFlux is a network of scientists who independently collect eddy covariance and related environmental observations at over 250 locations across the Americas. As part of the AmeriFlux Management Project, the AmeriFlux Data Team manages standardization, collection, quality assurance / quality control (QA/QC), and distribution of data submitted by network members. To generate data products that are timely, QA/QC'd, and repeatable, and have traceable provenance, we developed a semi-automated data processing pipeline. The new pipeline consists of semi-automated format and data QA/QC checks. Results are communicated via on-line reports as well as an issue-tracking system. Data processing time has been reduced from 2-3 days to a few hours of manual review time, resulting in faster data availability from the time of data submission. The pipeline is scalable to the network level and has the following key features. (1) On-line results of the format QA/QC checks are available immediately for data provider review. This enables data providers to correct and resubmit data quickly. (2) The format QA/QC assessment includes an automated attempt to fix minor format errors. Data submissions that are formatted in the new AmeriFlux FP-In standard can be queued for the data QA/QC assessment, often with minimal delay. (3) Automated data QA/QC checks identify and communicate potentially erroneous data via online, graphical quick views that highlight observations with unexpected values, incorrect units, time drifts, invalid multivariate correlations, and/or radiation shadows. (4) Progress through the pipeline is integrated with an issue-tracking system that facilitates communications between data providers and the data processing team in an organized and searchable fashion. Through development of these and other features of the pipeline, we present solutions to challenges that include optimizing automated with manual processing, bridging legacy data management infrastructure with various software tools, and working across interdisciplinary and international science cultures. Additionally, we discuss results from community member feedback that helped refine QA/QC communications for efficient data submission and revision.

Revisiting Street Intersections Using Slot-Based Systems.

PubMed

Tachet, Remi; Santi, Paolo; Sobolevsky, Stanislav; Reyes-Castro, Luis Ignacio; Frazzoli, Emilio; Helbing, Dirk; Ratti, Carlo

2016-01-01

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.

Radio and Optical Telescopes for School Students and Professional Astronomers

NASA Astrophysics Data System (ADS)

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!

Research Activities of the Northwest Laboratory for Integrated Systems

DTIC Science & Technology

1987-04-06

table, and composite table (to assist evaluation of objects) are each built. The parse tree is also checked to make sure there are no meaningless...Stan- ford) as well as the Apollo DN series. All of these implementations require eight bit planes for effective use of color. Also supported are AED...time of intersection had not yet passed the queuing of the segment was delayed until that time. This algorithm had the effect of preserving the slope of

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

Chertkov, Michael; Turitsyn, Konstantin; Sulc, Petr

The anticipated increase in the number of plug-in electric vehicles (EV) will put additional strain on electrical distribution circuits. Many control schemes have been proposed to control EV charging. Here, we develop control algorithms based on randomized EV charging start times and simple one-way broadcast communication allowing for a time delay between communication events. Using arguments from queuing theory and statistical analysis, we seek to maximize the utilization of excess distribution circuit capacity while keeping the probability of a circuit overload negligible.

Supply chain management and economic valuation of real options in the natural gas and liquefied natural gas industry

NASA Astrophysics Data System (ADS)

Wang, Mulan Xiaofeng

My dissertation concentrates on several aspects of supply chain management and economic valuation of real options in the natural gas and liquefied natural gas (LNG) industry, including gas pipeline transportations, ocean LNG shipping logistics, and downstream storage. Chapter 1 briefly introduces the natural gas and LNG industries, and the topics studied in this thesis. Chapter 2 studies how to value U.S. natural gas pipeline network transport contracts as real options. It is common for natural gas shippers to value and manage contracts by simple adaptations of financial spread option formulas that do not fully account for the implications of the capacity limits and the network structure that distinguish these contracts. In contrast, we show that these operational features can be fully captured and integrated with financial considerations in a fairly easy and managerially significant manner by a model that combines linear programming and simulation. We derive pathwise estimators for the so called deltas and structurally characterize them. We interpret them in a novel fashion as discounted expectations, under a specific weighing distribution, of the amounts of natural gas to be procured/marketed when optimally using pipeline capacity. Based on the actual prices of traded natural gas futures and basis swaps, we show that an enhanced version of the common approach employed in practice can significantly underestimate the true value of natural gas pipeline network capacity. Our model also exhibits promising financial (delta) hedging performance. Thus, this model emerges as an easy to use and useful tool that natural gas shippers can employ to support their valuation and delta hedging decisions concerning natural gas pipeline network transport capacity contracts. Moreover, the insights that follow from our data analysis have broader significance and implications in terms of the management of real options beyond our specific application. Motivated by current developments in the LNG industry, Chapter 3 studies the operations of LNG supply chains facing both supply and price risk. To model the supply uncertainty, we employ a closed-queuing-network (CQN) model to represent upstream LNG production and shipping, via special oceans-going tankers, to a downstream re-gasification facility in the U.S, which sells natural gas into the wholesale spot market. The CQN shipping model analytically generates the unloaded amount probability distribution. Price uncertainty is captured by the spot price, which experiences both volatility and significant seasonality, i.e., higher prices in winter. We use a trinomial lattice to model the price uncertainty, and calibrate to the extended forward curves. Taking the outputs from the CQN model and the spot price model as stochastic inputs, we formulate a real option inventory-release model to study the benefit of optimally managing a downstream LNG storage facility. This allows characterization of the structure of the optimal inventory management policy. An interesting finding is that when it is optimal to sell, it is not necessarily optimal to sell the entire available inventory. The model can be used by LNG players to value and manage the real option to store LNG at a re-gasification facility, and is easy to be implemented. For example, this model is particularly useful to value leasing contracts for portions of the facility capacity. Real data is used to assess the value of the real option to store LNG at the downstream re-gasification facility, and, contrary to what has been claimed by some practitioners, we find that it has significant value (several million dollars). Chapter 4 studies the importance of modeling the shipping variability when valuing and managing a downstream LNG storage facility. The shipping model presented in Chapter 3 uses a "rolling forward" method to generate the independent and identically distributed (i.i.d.) unloaded amount in each decision period. We study the merit of the i.i.d. assumption by using simulation and developing an upper bound. We show that the model, which uses the i.i.d. unloaded amount, provides a good estimation of the storage value, and yields a near optimal inventory control policy. We also test the performance of a model that uses constant throughput to determine the inventory release policy. This model performs worse than the model of Chapter 3 for storage valuation purposes, but can be used to suggest the optimal inventory control policy, especially when the ratio of flow rate to storage size is high, i.e., storage is scarce. Chapter 5 summarizes the contributions of this thesis.

A new task scheduling algorithm based on value and time for cloud platform

NASA Astrophysics Data System (ADS)

Kuang, Ling; Zhang, Lichen

2017-08-01

Tasks scheduling, a key part of increasing resource utilization and enhancing system performance, is a never outdated problem especially in cloud platforms. Based on the value density algorithm of the real-time task scheduling system and the character of the distributed system, the paper present a new task scheduling algorithm by further studying the cloud technology and the real-time system: Least Level Value Density First (LLVDF). The algorithm not only introduces some attributes of time and value for tasks, it also can describe weighting relationships between these properties mathematically. As this feature of the algorithm, it can gain some advantages to distinguish between different tasks more dynamically and more reasonably. When the scheme was used in the priority calculation of the dynamic task scheduling on cloud platform, relying on its advantage, it can schedule and distinguish tasks with large amounts and many kinds more efficiently. The paper designs some experiments, some distributed server simulation models based on M/M/C model of queuing theory and negative arrivals, to compare the algorithm against traditional algorithm to observe and show its characters and advantages.

Leveraging human decision making through the optimal management of centralized resources

NASA Astrophysics Data System (ADS)

Hyden, Paul; McGrath, Richard G.

2016-05-01

Combining results from mixed integer optimization, stochastic modeling and queuing theory, we will advance the interdisciplinary problem of efficiently and effectively allocating centrally managed resources. Academia currently fails to address this, as the esoteric demands of each of these large research areas limits work across traditional boundaries. The commercial space does not currently address these challenges due to the absence of a profit metric. By constructing algorithms that explicitly use inputs across boundaries, we are able to incorporate the advantages of using human decision makers. Key improvements in the underlying algorithms are made possible by aligning decision maker goals with the feedback loops introduced between the core optimization step and the modeling of the overall stochastic process of supply and demand. A key observation is that human decision-makers must be explicitly included in the analysis for these approaches to be ultimately successful. Transformative access gives warfighters and mission owners greater understanding of global needs and allows for relationships to guide optimal resource allocation decisions. Mastery of demand processes and optimization bottlenecks reveals long term maximum marginal utility gaps in capabilities.

Understanding the heavy-tailed dynamics in human behavior

NASA Astrophysics Data System (ADS)

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.

Homology Model of the GABAA Receptor Examined Using Brownian Dynamics

PubMed Central

O'Mara, Megan; Cromer, Brett; Parker, Michael; Chung, Shin-Ho

2005-01-01

We have developed a homology model of the GABAA receptor, using the subunit combination of α1β2γ2, the most prevalent type in the mammalian brain. The model is produced in two parts: the membrane-embedded channel domain and the extracellular N-terminal domain. The pentameric transmembrane domain model is built by modeling each subunit by homology with the equivalent subunit of the heteropentameric acetylcholine receptor transmembrane domain. This segment is then joined with the extracellular domain built by homology with the acetylcholine binding protein. The all-atom model forms a wide extracellular vestibule that is connected to an oval chamber near the external surface of the membrane. A narrow, cylindrical transmembrane channel links the outer segment of the pore to a shallow intracellular vestibule. The physiological properties of the model so constructed are examined using electrostatic calculations and Brownian dynamics simulations. A deep energy well of ∼80 kT accommodates three Cl− ions in the narrow transmembrane channel and seven Cl− ions in the external vestibule. Inward permeation takes place when one of the ions queued in the external vestibule enters the narrow segment and ejects the innermost ion. The model, when incorporated into Brownian dynamics, reproduces key experimental features, such as the single-channel current-voltage-concentration profiles. Finally, we simulate the γ2 K289M epilepsy inducing mutation and examine Cl− ion permeation through the mutant receptor. PMID:15749776

Modeling service time reliability in urban ferry system

NASA Astrophysics Data System (ADS)

Chen, Yifan; Luo, Sida; Zhang, Mengke; Shen, Hanxia; Xin, Feifei; Luo, Yujie

2017-09-01

The urban ferry system can carry a large number of travelers, which may alleviate the pressure on road traffic. As an indicator of its service quality, service time reliability (STR) plays an essential part in attracting travelers to the ferry system. A wide array of studies have been conducted to analyze the STR of land transportation. However, the STR of ferry systems has received little attention in the transportation literature. In this study, a model was established to obtain the STR in urban ferry systems. First, the probability density function (PDF) of the service time provided by ferry systems was constructed. Considering the deficiency of the queuing theory, this PDF was determined by Bayes’ theorem. Then, to validate the function, the results of the proposed model were compared with those of the Monte Carlo simulation. With the PDF, the reliability could be determined mathematically by integration. Results showed how the factors including the frequency, capacity, time schedule and ferry waiting time affected the STR under different degrees of congestion in ferry systems. Based on these results, some strategies for improving the STR were proposed. These findings are of great significance to increasing the share of ferries among various urban transport modes.

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

NASA Astrophysics Data System (ADS)

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.

Using queuing models to aid design and guide research effort for multimodality buried target detection systems

NASA Astrophysics Data System (ADS)

Malof, Jordan M.; Collins, Leslie M.

2016-05-01

Many remote sensing modalities have been developed for buried target detection (BTD), each one offering relative advantages over the others. There has been interest in combining several modalities into a single BTD system that benefits from the advantages of each constituent sensor. Recently an approach was developed, called multi-state management (MSM), that aims to achieve this goal by separating BTD system operation into discrete states, each with different sensor activity and system velocity. Additionally, a modeling approach, called Q-MSM, was developed to quickly analyze multi-modality BTD systems operating with MSM. This work extends previous work by demonstrating how Q-MSM modeling can be used to design BTD systems operating with MSM, and to guide research to yield the most performance benefits. In this work an MSM system is considered that combines a forward-looking infrared (FLIR) camera and a ground penetrating radar (GPR). Experiments are conducted using a dataset of real, field-collected, data which demonstrates how the Q-MSM model can be used to evaluate performance benefits of altering, or improving via research investment, various characteristics of the GPR and FLIR systems. Q-MSM permits fast analysis that can determine where system improvements will have the greatest impact, and can therefore help guide BTD research.

Models of emergency departments for reducing patient waiting times.

PubMed

Laskowski, Marek; McLeod, Robert D; Friesen, Marcia R; Podaima, Blake W; Alfa, Attahiru S

2009-07-02

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.

Models of Emergency Departments for Reducing Patient Waiting Times

PubMed Central

Laskowski, Marek; McLeod, Robert D.; Friesen, Marcia R.; Podaima, Blake W.; Alfa, Attahiru S.

2009-01-01

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. PMID:19572015

Framework based on stochastic L-Systems for modeling IP traffic with multifractal behavior

NASA Astrophysics Data System (ADS)

Salvador, Paulo S.; Nogueira, Antonio; Valadas, Rui

2003-08-01

In a previous work we have introduced a multifractal traffic model based on so-called stochastic L-Systems, which were introduced by biologist A. Lindenmayer as a method to model plant growth. L-Systems are string rewriting techniques, characterized by an alphabet, an axiom (initial string) and a set of production rules. In this paper, we propose a novel traffic model, and an associated parameter fitting procedure, which describes jointly the packet arrival and the packet size processes. The packet arrival process is modeled through a L-System, where the alphabet elements are packet arrival rates. The packet size process is modeled through a set of discrete distributions (of packet sizes), one for each arrival rate. In this way the model is able to capture correlations between arrivals and sizes. We applied the model to measured traffic data: the well-known pOct Bellcore, a trace of aggregate WAN traffic and two traces of specific applications (Kazaa and Operation Flashing Point). We assess the multifractality of these traces using Linear Multiscale Diagrams. The suitability of the traffic model is evaluated by comparing the empirical and fitted probability mass and autocovariance functions; we also compare the packet loss ratio and average packet delay obtained with the measured traces and with traces generated from the fitted model. Our results show that our L-System based traffic model can achieve very good fitting performance in terms of first and second order statistics and queuing behavior.

VizieR Online Data Catalog: UBVR photometry of the T Tauri binary DQ Tau (Tofflemire+, 2017)

NASA Astrophysics Data System (ADS)

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

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

PubMed

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.

Perturbation analysis of queueing systems with a time-varying arrival rate

NASA Technical Reports Server (NTRS)

Cassandras, Christos G.; Pan, Jie

1991-01-01

The authors consider an M/G/1 queuing with a time-varying arrival rate. The objective is to obtain infinitesimal perturbation analysis (IPA) gradient estimates for various performance measures of interest with respect to certain system parameters. In particular, the authors consider the mean system time over n arrivals and an arrival rate alternating between two values. By choosing a convenient sample path representation of this system, they derive an unbiased IPA gradient estimator which, however, is not consistent, and investigate the nature of this problem.

A novel approach to multihazard modeling and simulation.

PubMed

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.

How cognitive heuristics can explain social interactions in spatial movement.

PubMed

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

How cognitive heuristics can explain social interactions in spatial movement

PubMed Central

Köster, Gerta

2016-01-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. PMID:27581483

Queuing theory models used for port equipment sizing

NASA Astrophysics Data System (ADS)

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.

Flexible server-side processing of climate archives

NASA Astrophysics Data System (ADS)

Juckes, Martin; Stephens, Ag; Damasio da Costa, Eduardo

2014-05-01

The flexibility and interoperability of OGC Web Processing Services are combined with an extensive range of data processing operations supported by the Climate Data Operators (CDO) library to facilitate processing of the CMIP5 climate data archive. The challenges posed by this peta-scale archive allow us to test and develop systems which will help us to deal with approaching exa-scale challenges. The CEDA WPS package allows users to manipulate data in the archive and export the results without first downloading the data -- in some cases this can drastically reduce the data volumes which need to be transferred and greatly reduce the time needed for the scientists to get their results. Reductions in data transfer are achieved at the expense of an additional computational load imposed on the archive (or near-archive) infrastructure. This is managed with a load balancing system. Short jobs may be run in near real-time, longer jobs will be queued. When jobs are queued the user is provided with a web dashboard displaying job status. A clean split between the data manipulation software and the request management software is achieved by exploiting the extensive CDO library. This library has a long history of development to support the needs of the climate science community. Use of the library ensures that operations run on data by the system can be reproduced by users using the same operators installed on their own computers. Examples using the system deployed for the CMIP5 archive will be shown and issues which need to be addressed as archive volumes expand into the exa-scale will be discussed.

Flexible server-side processing of climate archives

NASA Astrophysics Data System (ADS)

Juckes, M. N.; Stephens, A.; da Costa, E. D.

2013-12-01

The flexibility and interoperability of OGC Web Processing Services are combined with an extensive range of data processing operations supported by the Climate Data Operators (CDO) library to facilitate processing of the CMIP5 climate data archive. The challenges posed by this peta-scale archive allow us to test and develop systems which will help us to deal with approaching exa-scale challenges. The CEDA WPS package allows users to manipulate data in the archive and export the results without first downloading the data -- in some cases this can drastically reduce the data volumes which need to be transferred and greatly reduce the time needed for the scientists to get their results. Reductions in data transfer are achieved at the expense of an additional computational load imposed on the archive (or near-archive) infrastructure. This is managed with a load balancing system. Short jobs may be run in near real-time, longer jobs will be queued. When jobs are queued the user is provided with a web dashboard displaying job status. A clean split between the data manipulation software and the request management software is achieved by exploiting the extensive CDO library. This library has a long history of development to support the needs of the climate science community. Use of the library ensures that operations run on data by the system can be reproduced by users using the same operators installed on their own computers. Examples using the system deployed for the CMIP5 archive will be shown and issues which need to be addressed as archive volumes expand into the exa-scale will be discussed.

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

PubMed

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.

Neural representations and mechanisms for the performance of simple speech sequences

PubMed Central

Bohland, Jason W.; Bullock, Daniel; Guenther, Frank H.

2010-01-01

Speakers plan the phonological content of their utterances prior to their release as speech motor acts. Using a finite alphabet of learned phonemes and a relatively small number of syllable structures, speakers are able to rapidly plan and produce arbitrary syllable sequences that fall within the rules of their language. The class of computational models of sequence planning and performance termed competitive queuing (CQ) models have followed Lashley (1951) in assuming that inherently parallel neural representations underlie serial action, and this idea is increasingly supported by experimental evidence. In this paper we develop a neural model that extends the existing DIVA model of speech production in two complementary ways. The new model includes paired structure and content subsystems (cf. MacNeilage, 1998) that provide parallel representations of a forthcoming speech plan, as well as mechanisms for interfacing these phonological planning representations with learned sensorimotor programs to enable stepping through multi-syllabic speech plans. On the basis of previous reports, the model’s components are hypothesized to be localized to specific cortical and subcortical structures, including the left inferior frontal sulcus, the medial premotor cortex, the basal ganglia and thalamus. The new model, called GODIVA (Gradient Order DIVA), thus fills a void in current speech research by providing formal mechanistic hypotheses about both phonological and phonetic processes that are grounded by neuroanatomy and physiology. This framework also generates predictions that can be tested in future neuroimaging and clinical case studies. PMID:19583476

Action and perception in literacy: A common-code for spelling and reading.

PubMed

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

Mirror system activity for action and language is embedded in the integration of dorsal and ventral pathways.

PubMed

Arbib, Michael A

2010-01-01

We develop the view that the involvement of mirror neurons in embodied experience grounds brain structures that underlie language, but that many other brain regions are involved. We stress the cooperation between the dorsal and ventral streams in praxis and language. Both have perceptual and motor schemas but the perceptual schemas in the dorsal path are affordances linked to specific motor schemas for detailed motor control, whereas the ventral path supports planning and decision making. This frames the hypothesis that the mirror system for words evolved from the mirror system for actions to support words-as-phonological-actions, with semantics provided by the linkage to neural systems supporting perceptual and motor schemas. We stress the importance of computational models which can be linked to the parametric analysis of data and conceptual analysis of these models to support new patterns of understanding of the data. In the domain of praxis, we assess the FARS model of the canonical system for grasping, the MNS models for the mirror system for grasping, and the Augmented Competitive Queuing model that extends the control of action to the opportunistic scheduling of action sequences and also offers a new hypothesis on the role of mirror neurons in self action. Turning to language, we use Construction Grammar as our linguistic framework to get beyond single words to phrases and sentences, and initiate analysis of what brain functions must complement mirror systems to support this functionality. 2009 Elsevier Inc. All rights reserved.

Autonomous Satellite Operations Via Secure Virtual Mission Operations Center

NASA Technical Reports Server (NTRS)

Miller, Eric; Paulsen, Phillip E.; Pasciuto, Michael

2011-01-01

The science community is interested in improving their ability to respond to rapidly evolving, transient phenomena via autonomous rapid reconfiguration, which derives from the ability to assemble separate but collaborating sensors and data forecasting systems to meet a broad range of research and application needs. Current satellite systems typically require human intervention to respond to triggers from dissimilar sensor systems. Additionally, satellite ground services often need to be coordinated days or weeks in advance. Finally, the boundaries between the various sensor systems that make up such a Sensor Web are defined by such things as link delay and connectivity, data and error rate asymmetry, data reliability, quality of service provisions, and trust, complicating autonomous operations. Over the past ten years, researchers from the NASA Glenn Research Center (GRC), General Dynamics, Surrey Satellite Technology Limited (SSTL), Cisco, Universal Space Networks (USN), the U.S. Geological Survey (USGS), the Naval Research Laboratory, the DoD Operationally Responsive Space (ORS) Office, and others have worked collaboratively to develop a virtual mission operations capability. Called VMOC (Virtual Mission Operations Center), this new capability allows cross-system queuing of dissimilar mission unique systems through the use of a common security scheme and published application programming interfaces (APIs). Collaborative VMOC demonstrations over the last several years have supported the standardization of spacecraft to ground interfaces needed to reduce costs, maximize space effects to the user, and allow the generation of new tactics, techniques and procedures that lead to responsive space employment.

A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.

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

Mayo, Jackson R.; Kegelmeyer, W. Philip, Jr.; Wong, Matthew H.

The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in jobmore » queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.« less

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

PubMed

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.

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

PubMed

Joy, Mark; Jones, Simon

2005-08-01

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

The origin of bursts and heavy tails in human dynamics.

PubMed

Barabási, Albert-László

2005-05-12

The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behaviour into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. In contrast, there is increasing evidence that the timing of many human activities, ranging from communication to entertainment and work patterns, follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. Here I show that the bursty nature of human behaviour is a consequence of a decision-based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, with most tasks being rapidly executed, whereas a few experience very long waiting times. In contrast, random or priority blind execution is well approximated by uniform inter-event statistics. These finding have important implications, ranging from resource management to service allocation, in both communications and retail.

An efficiency improvement in warehouse operation using simulation analysis

NASA Astrophysics Data System (ADS)

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.

Estimation of number of fatalities caused by toxic gases due to fire in road tunnels.

PubMed

Qu, Xiaobo; Meng, Qiang; Liu, Zhiyuan

2013-01-01

The quantitative risk assessment (QRA) is one of the explicit requirements under the European Union (EU) Directive (2004/54/EC). As part of this, it is essential to be able to estimate the number of fatalities in different accident scenarios. In this paper, a tangible methodology is developed to estimate the number of fatalities caused by toxic gases due to fire in road tunnels by incorporating traffic flow and the spread of fire in tunnels. First, a deterministic queuing model is proposed to calculate the number of people at risk, by taking into account tunnel geometry, traffic flow patterns, and incident response plans for road tunnels. Second, the Fire Dynamics Simulator (FDS) is used to obtain the temperature and concentrations of CO, CO(2), and O(2). By taking advantage of the additivity of the fractional effective dose (FED) method, fatality rates for different locations in given time periods can be estimated. An illustrative case study is carried out to demonstrate the applicability of the proposed methodology. Copyright © 2012 Elsevier Ltd. All rights reserved.

A decentralized software bus based on IP multicas ting

NASA Technical Reports Server (NTRS)

Callahan, John R.; Montgomery, Todd

1995-01-01

We describe decentralized reconfigurable implementation of a conference management system based on the low-level Internet Protocol (IP) multicasting protocol. IP multicasting allows low-cost, world-wide, two-way transmission of data between large numbers of conferencing participants through the Multicasting Backbone (MBone). Each conference is structured as a software bus -- a messaging system that provides a run-time interconnection model that acts as a separate agent (i.e., the bus) for routing, queuing, and delivering messages between distributed programs. Unlike the client-server interconnection model, the software bus model provides a level of indirection that enhances the flexibility and reconfigurability of a distributed system. Current software bus implementations like POLYLITH, however, rely on a centralized bus process and point-to-point protocols (i.e., TCP/IP) to route, queue, and deliver messages. We implement a software bus called the MULTIBUS that relies on a separate process only for routing and uses a reliable IP multicasting protocol for delivery of messages. The use of multicasting means that interconnections are independent of IP machine addresses. This approach allows reconfiguration of bus participants during system execution without notifying other participants of new IP addresses. The use of IP multicasting also permits an economy of scale in the number of participants. We describe the MULITIBUS protocol elements and show how our implementation performs better than centralized bus implementations.

Applying Bayesian hierarchical models to examine motorcycle crashes at signalized intersections.

PubMed

Haque, Md Mazharul; Chin, Hoong Chor; Huang, Helai

2010-01-01

Motorcycles are overrepresented in road traffic crashes and particularly vulnerable at signalized intersections. The objective of this study is to identify causal factors affecting the motorcycle crashes at both four-legged and T signalized intersections. Treating the data in time-series cross-section panels, this study explores different Hierarchical Poisson models and found that the model allowing autoregressive lag-1 dependence specification in the error term is the most suitable. Results show that the number of lanes at the four-legged signalized intersections significantly increases motorcycle crashes largely because of the higher exposure resulting from higher motorcycle accumulation at the stop line. Furthermore, the presence of a wide median and an uncontrolled left-turn lane at major roadways of four-legged intersections exacerbate this potential hazard. For T signalized intersections, the presence of exclusive right-turn lane at both major and minor roadways and an uncontrolled left-turn lane at major roadways increases motorcycle crashes. Motorcycle crashes increase on high-speed roadways because they are more vulnerable and less likely to react in time during conflicts. The presence of red light cameras reduces motorcycle crashes significantly for both four-legged and T intersections. With the red light camera, motorcycles are less exposed to conflicts because it is observed that they are more disciplined in queuing at the stop line and less likely to jump start at the start of green.

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

PubMed

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.

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

PubMed Central

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

Priority queues with bursty arrivals of incoming tasks

NASA Astrophysics Data System (ADS)

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

2009-03-01

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

A stochastic multi-scale method for turbulent premixed combustion

NASA Astrophysics Data System (ADS)

Cha, Chong M.

2002-11-01

The stochastic chemistry algorithm of Bunker et al. and Gillespie is used to perform the chemical reactions in a transported probability density function (PDF) modeling approach of turbulent combustion. Recently, Kraft & Wagner have demonstrated a 100-fold gain in computational speed (for a 100 species mechanism) using the stochastic approach over the conventional, direct integration method of solving for the chemistry. Here, the stochastic chemistry algorithm is applied to develop a new transported PDF model of turbulent premixed combustion. The methodology relies on representing the relevant spatially dependent physical processes as queuing events. The canonical problem of a one-dimensional premixed flame is used for validation. For the laminar case, molecular diffusion is described by a random walk. For the turbulent case, one of two different material transport submodels can provide the necessary closure: Taylor dispersion or Kerstein's one-dimensional turbulence approach. The former exploits ``eddy diffusivity'' and hence would be much more computationally tractable for practical applications. Various validation studies are performed. Results from the Monte Carlo simulations compare well to asymptotic solutions of laminar premixed flames, both with and without high activation temperatures. The correct scaling of the turbulent burning velocity is predicted in both Damköhler's small- and large-scale turbulence limits. The effect of applying the eddy diffusivity concept in the various regimes is discussed.

Outpatient Waiting Time in Health Services and Teaching Hospitals: A Case Study in Iran

PubMed Central

Mohebbifar, Rafat; Hasanpoor, Edris; Mohseni, Mohammad; Sokhanvar, Mobin; Khosravizadeh, Omid; Isfahani, Haleh Mousavi

2014-01-01

Background: One of the most important indexes of the health care quality is patient’s satisfaction and it takes place only when there is a process based on management. One of these processes in the health care organizations is the appropriate management of the waiting time process. The aim of this study is the systematic analyzing of the outpatient waiting time. Methods: This descriptive cross sectional study conducted in 2011 is an applicable study performed in the educational and health care hospitals of one of the medical universities located in the north west of Iran. Since the distributions of outpatients in all the months were equal, sampling stage was used. 160 outpatients were studied and the data was analyzed by using SPSS software. Results: Results of the study showed that the waiting time for the outpatients of ophthalmology clinic with an average of 245 minutes for each patient allocated the maximum time among the other clinics for itself. Orthopedic clinic had the minimal waiting time including an average of 77 minutes per patient. The total average waiting time for each patient in the educational hospitals under this study was about 161 minutes. Conclusion: by applying some models, we can reduce the waiting time especially in the realm of time and space before the admission to the examination room. Utilizing the models including the one before admission, electronic visit systems via internet, a process model, six sigma model, queuing theory model and FIFO model, are the components of the intervention that reduces the outpatient waiting time. PMID:24373277

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

PubMed

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

Architectural design and simulation of a virtual memory

NASA Technical Reports Server (NTRS)

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.

Proceedings of the Conference on the Design of Experiments in Army Research Development and Testing (27th) Held at The McKimmon Center for Continuing Education, North Carolina State University, Raleigh, North Carolina on 21-23 October 1981

DTIC Science & Technology

1982-06-01

of states and a class of cascade processes. Proc. Cambridge Phil . Soc. 47, 77-85. Foster, F. G. (1952). On Markov chains with an enumerable infinity of...states. Proc. Cambridge Phil . Soc. 48, 587-591. Foster, F. G. (1953). On the stochastic matrices associated with certain queuing processes. Ann. Math...Frawley (1973), Li and Schucany (1975), Schucany and Beckett (1976), and Hollander and Sethurann (1978). The Schucany-Frawley-Li test is based on the

News from the CFHT/ESPaDOnS spectropolarimeter

NASA Astrophysics Data System (ADS)

Moutou, C.; Malo, L.; Manset, N.; Selliez-Vandernotte, L.; Desrochers, M.-E.

2015-12-01

The ESPaDOnS spectropolarimeter has been in use on the Canada-France-Hawaii Telescope (CFHT) since 2004, for studying stars, galactic objects and planets. ESPaDOnS is used in queued service observing mode since 2008, which allows an optimization of the science outcome. In this article, we summarize the new functionalities and analyses made on ESPaDOnS operations and data for the present and future users. These modifications include: signal-to-noise ratio based observing, radial velocity nightly drifts, the OPERA pipeline under development, the measurement of H2O content in the Maunakea sky, and the use of ESPaDOnS with the neighbour telescope Gemini.

Introduction

NASA Astrophysics Data System (ADS)

de Laat, Cees; Develder, Chris; Jukan, Admela; Mambretti, Joe

This topic is devoted to communication issues in scalable compute and storage systems, such as parallel computers, networks of workstations, and clusters. All aspects of communication in modern systems were solicited, including advances in the design, implementation, and evaluation of interconnection networks, network interfaces, system and storage area networks, on-chip interconnects, communication protocols, routing and communication algorithms, and communication aspects of parallel and distributed algorithms. In total 15 papers were submitted to this topic of which we selected the 7 strongest papers. We grouped the papers in two sessions of 3 papers each and one paper was selected for the best paper session. We noted a number of papers dealing with changing topologies, stability and forwarding convergence in source routing based cluster interconnect network architectures. We grouped these for the first session. The authors of the paper titled: “Implementing a Change Assimilation Mechanism for Source Routing Interconnects” propose a mechanism that can obtain the new topology, and compute and distribute a new set of fabric paths to the source routed network end points to minimize the impact on the forwarding service. The article entitled “Dependability Analysis of a Fault-tolerant Network Reconfiguration Strateg” reports on a case study analyzing the effects of network size, mean time to node failure, mean time to node repair, mean time to network repair and coverage of the failure when using a 2D mesh network with a fault-tolerant mechanism (similar to the one used in the BlueGene/L system), that is able to remove rows and/or columns in the presence of failures. The last paper in this session: “RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration” presents a new dynamic reconfiguration method, that ensures deadlock-freedom during the reconfiguration without causing performance degradation such as increased latency or decreased throughput. The second session groups 3 papers presenting methods, protocols and architectures that enhance capacities in the Networks. The paper titled: “NIC-assisted Cache-Efficient Receive Stack for Message Passing over Ethernet” presents the addition of multiqueue support in the Open-MX receive stack so that all incoming packets for the same process are treated on the same core. It then introduces the idea of binding the target end process near its dedicated receive queue. In general this multiqueue receive stack performs better than the original single queue stack, especially on large communication patterns where multiple processes are involved and manual binding is difficult. The authors of: “A Multipath Fault-Tolerant Routing Method for High-Speed Interconnection Networks” focus on the problem of fault tolerance for high-speed interconnection networks by designing a fault tolerant routing method. The goal was to solve a certain number of link and node failures, considering its impact, and occurrence probability. Their experiments show that their method allows applications to successfully finalize their execution in the presence of several faults, with an average performance value of 97% with respect to the fault-free scenarios. The paper: “Hardware implementation study of the Self-Clocked Fair Queuing Credit Aware (SCFQ-CA) and Deficit Round Robin Credit Aware (DRR-CA) scheduling algorithms” proposes specific implementations of the two schedulers taking into account the characteristics of current high-performance networks. A comparison is presented on the complexity of these two algorithms in terms of silicon area and computation delay. Finally we selected one paper for the special paper session: “A Case Study of Communication Optimizations on 3D Mesh Interconnects”. In this paper the authors present topology aware mapping as a technique to optimize communication on 3-dimensional mesh interconnects and hence improve performance. Results are presented for OpenAtom on up to 16,384 processors of Blue Gene/L, 8,192 processors of Blue Gene/P and 2,048 processors of Cray XT3.

Technical support for digital systems technology development. Task order 1: ISP contention analysis and control

NASA Technical Reports Server (NTRS)

Stehle, Roy H.; Ogier, Richard G.

1993-01-01

Alternatives for realizing a packet-based network switch for use on a frequency division multiple access/time division multiplexed (FDMA/TDM) geostationary communication satellite were investigated. Each of the eight downlink beams supports eight directed dwells. The design needed to accommodate multicast packets with very low probability of loss due to contention. Three switch architectures were designed and analyzed. An output-queued, shared bus system yielded a functionally simple system, utilizing a first-in, first-out (FIFO) memory per downlink dwell, but at the expense of a large total memory requirement. A shared memory architecture offered the most efficiency in memory requirements, requiring about half the memory of the shared bus design. The processing requirement for the shared-memory system adds system complexity that may offset the benefits of the smaller memory. An alternative design using a shared memory buffer per downlink beam decreases circuit complexity through a distributed design, and requires at most 1000 packets of memory more than the completely shared memory design. Modifications to the basic packet switch designs were proposed to accommodate circuit-switched traffic, which must be served on a periodic basis with minimal delay. Methods for dynamically controlling the downlink dwell lengths were developed and analyzed. These methods adapt quickly to changing traffic demands, and do not add significant complexity or cost to the satellite and ground station designs. Methods for reducing the memory requirement by not requiring the satellite to store full packets were also proposed and analyzed. In addition, optimal packet and dwell lengths were computed as functions of memory size for the three switch architectures.

Performance evaluation of air quality models for predicting PM10 and PM2.5 concentrations at urban traffic intersection during winter period.

PubMed

Gokhale, Sharad; Raokhande, Namita

2008-05-01

There are several models that can be used to evaluate roadside air quality. The comparison of the operational performance of different models pertinent to local conditions is desirable so that the model that performs best can be identified. Three air quality models, namely the 'modified General Finite Line Source Model' (M-GFLSM) of particulates, the 'California Line Source' (CALINE3) model, and the 'California Line Source for Queuing & Hot Spot Calculations' (CAL3QHC) model have been identified for evaluating the air quality at one of the busiest traffic intersections in the city of Guwahati. These models have been evaluated statistically with the vehicle-derived airborne particulate mass emissions in two sizes, i.e. PM10 and PM2.5, the prevailing meteorology and the temporal distribution of the measured daily average PM10 and PM2.5 concentrations in wintertime. The study has shown that the CAL3QHC model would make better predictions compared to other models for varied meteorology and traffic conditions. The detailed study reveals that the agreements between the measured and the modeled PM10 and PM2.5 concentrations have been reasonably good for CALINE3 and CAL3QHC models. Further detailed analysis shows that the CAL3QHC model performed well compared to the CALINE3. The monthly performance measures have also led to the similar results. These two models have also outperformed for a class of wind speed velocities except for low winds (<1 m s(-1)), for which, the M-GFLSM model has shown the tendency of better performance for PM10. Nevertheless, the CAL3QHC model has outperformed for both the particulate sizes and for all the wind classes, which therefore can be optional for air quality assessment at urban traffic intersections.

Extending the mirror neuron system model, II: what did I just do? A new role for mirror neurons.

PubMed

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.

SLURM: Simple Linux Utility for Resource Management

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

Jette, M; Dunlap, C; Garlick, J

2002-04-24

Simple Linux Utility for Resource Management (SLURM) is an open source, fault-tolerant, and highly scalable cluster management and job scheduling system for Linux clusters of thousands of nodes. Components include machine status, partition management, job management, and scheduling modules. The design also includes a scalable, general-purpose communication infrastructure. Development will take place in four phases: Phase I results in a solid infrastructure; Phase II produces a functional but limited interactive job initiation capability without use of the interconnect/switch; Phase III provides switch support and documentation; Phase IV provides job status, fault-tolerance, and job queuing and control through Livermore's Distributed Productionmore » Control System (DPCS), a meta-batch and resource management system.« less

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

NASA Technical Reports Server (NTRS)

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.

An empirical comparison of Markov cohort modeling and discrete event simulation in a capacity-constrained health care setting.

PubMed

Standfield, L B; Comans, T A; Scuffham, P A

2017-01-01

To empirically compare Markov cohort modeling (MM) and discrete event simulation (DES) with and without dynamic queuing (DQ) for cost-effectiveness (CE) analysis of a novel method of health services delivery where capacity constraints predominate. A common data-set comparing usual orthopedic care (UC) to an orthopedic physiotherapy screening clinic and multidisciplinary treatment service (OPSC) was used to develop a MM and a DES without (DES-no-DQ) and with DQ (DES-DQ). Model results were then compared in detail. The MM predicted an incremental CE ratio (ICER) of $495 per additional quality-adjusted life-year (QALY) for OPSC over UC. The DES-no-DQ showed OPSC dominating UC; the DES-DQ generated an ICER of $2342 per QALY. The MM and DES-no-DQ ICER estimates differed due to the MM having implicit delays built into its structure as a result of having fixed cycle lengths, which are not a feature of DES. The non-DQ models assume that queues are at a steady state. Conversely, queues in the DES-DQ develop flexibly with supply and demand for resources, in this case, leading to different estimates of resource use and CE. The choice of MM or DES (with or without DQ) would not alter the reimbursement of OPSC as it was highly cost-effective compared to UC in all analyses. However, the modeling method may influence decisions where ICERs are closer to the CE acceptability threshold, or where capacity constraints and DQ are important features of the system. In these cases, DES-DQ would be the preferred modeling technique to avoid incorrect resource allocation decisions.

SciDAC-Data, A Project to Enabling Data Driven Modeling of Exascale Computing

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

Mubarak, M.; Ding, P.; Aliaga, L.

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 aremore » 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.« less

Cost Optimal Elastic Auto-Scaling in Cloud Infrastructure

NASA Astrophysics Data System (ADS)

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

2014-12-01

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

Advanced access: reducing waiting and delays in primary care.

PubMed

Murray, Mark; Berwick, Donald M

2003-02-26

Delay of care is a persistent and undesirable feature of current health care systems. Although delay seems to be inevitable and linked to resource limitations, it often is neither. Rather, it is usually the result of unplanned, irrational scheduling and resource allocation. Application of queuing theory and principles of industrial engineering, adapted appropriately to clinical settings, can reduce delay substantially, even in small practices, without requiring additional resources. One model, sometimes referred to as advanced access, has increasingly been shown to reduce waiting times in primary care. The core principle of advanced access is that patients calling to schedule a physician visit are offered an appointment the same day. Advanced access is not sustainable if patient demand for appointments is permanently greater than physician capacity to offer appointments. Six elements of advanced access are important in its application balancing supply and demand, reducing backlog, reducing the variety of appointment types, developing contingency plans for unusual circumstances, working to adjust demand profiles, and increasing the availability of bottleneck resources. Although these principles are powerful, they are counter to deeply held beliefs and established practices in health care organizations. Adopting these principles requires strong leadership investment and support.

Control of transcription elongation by GreA determines rate of gene expression in Streptococcus pneumoniae.

PubMed

Yuzenkova, Yulia; Gamba, Pamela; Herber, Martijn; Attaiech, Laetitia; Shafeeq, Sulman; Kuipers, Oscar P; Klumpp, Stefan; Zenkin, Nikolay; Veening, Jan-Willem

2014-01-01

Transcription by RNA polymerase may be interrupted by pauses caused by backtracking or misincorporation that can be resolved by the conserved bacterial Gre-factors. However, the consequences of such pausing in the living cell remain obscure. Here, we developed molecular biology and transcriptome sequencing tools in the human pathogen Streptococcus pneumoniae and provide evidence that transcription elongation is rate-limiting on highly expressed genes. Our results suggest that transcription elongation may be a highly regulated step of gene expression in S. pneumoniae. Regulation is accomplished via long-living elongation pauses and their resolution by elongation factor GreA. Interestingly, mathematical modeling indicates that long-living pauses cause queuing of RNA polymerases, which results in 'transcription traffic jams' on the gene and thus blocks its expression. Together, our results suggest that long-living pauses and RNA polymerase queues caused by them are a major problem on highly expressed genes and are detrimental for cell viability. The major and possibly sole function of GreA in S. pneumoniae is to prevent formation of backtracked elongation complexes. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

A web-based appointment system to reduce waiting for outpatients: a retrospective study.

PubMed

Cao, Wenjun; Wan, Yi; Tu, Haibo; Shang, Fujun; Liu, Danhong; Tan, Zhijun; Sun, Caihong; Ye, Qing; Xu, Yongyong

2011-11-22

Long waiting times for registration to see a doctor is problematic in China, especially in tertiary hospitals. To address this issue, a web-based appointment system was developed for the Xijing hospital. The aim of this study was to investigate the efficacy of the web-based appointment system in the registration service for outpatients. Data from the web-based appointment system in Xijing hospital from January to December 2010 were collected using a stratified random sampling method, from which participants were randomly selected for a telephone interview asking for detailed information on using the system. Patients who registered through registration windows were randomly selected as a comparison group, and completed a questionnaire on-site. A total of 5641 patients using the online booking service were available for data analysis. Of them, 500 were randomly selected, and 369 (73.8%) completed a telephone interview. Of the 500 patients using the usual queuing method who were randomly selected for inclusion in the study, responses were obtained from 463, a response rate of 92.6%. Between the two registration methods, there were significant differences in age, degree of satisfaction, and total waiting time (P<0.001). However, gender, urban residence, and valid waiting time showed no significant differences (P>0.05). Being ignorant of online registration, not trusting the internet, and a lack of ability to use a computer were three main reasons given for not using the web-based appointment system. The overall proportion of non-attendance was 14.4% for those using the web-based appointment system, and the non-attendance rate was significantly different among different hospital departments, day of the week, and time of the day (P<0.001). Compared to the usual queuing method, the web-based appointment system could significantly increase patient's satisfaction with registration and reduce total waiting time effectively. However, further improvements are needed for broad use of the system.

Incorporating topography in a cellular automata model to simulate residents evacuation in a mountain area in China

NASA Astrophysics Data System (ADS)

Wang, Li; Liu, Mao; Meng, Bo

2013-02-01

In China, both the mountainous areas and the number of people who live in mountain areas occupy a significant proportion. When production accidents or natural disasters happen, the residents in mountain areas should be evacuated and the evacuation is of obvious importance to public safety. But it is a pity that there are few studies on safety evacuation in rough terrain. The particularity of the complex terrain in mountain areas, however, makes it difficult to study pedestrian evacuation. In this paper, a three-dimensional surface cellular automata model is proposed to numerically simulate the real time dynamic evacuation of residents. The model takes into account topographic characteristics (the slope gradient) of the environment and the biomechanics characteristics (weight and leg extensor power) of the residents to calculate the walking speed. This paper only focuses on the influence of topography and the physiological parameters are defined as constants according to a statistical report. Velocity varies with the topography. In order to simulate the behavior of a crowd with varying movement velocities, and a numerical algorithm is used to determine the time step of iteration. By doing so, a numerical simulation can be conducted in a 3D surface CA model. Moreover, considering residents evacuation around a gas well in a mountain area as a case, a visualization system for a three-dimensional simulation of pedestrian evacuation is developed. In the simulation process, population behaviors of congestion, queuing and collision avoidance can be observed. The simulation results are explained reasonably. Therefore, the model presented in this paper can realize a 3D dynamic simulation of pedestrian evacuation vividly in complex terrain and predict the evacuation procedure and evacuation time required, which can supply some valuable information for emergency management.

Hospital bed occupancy: more than queuing for a bed.

PubMed

Keegan, Andrew D

2010-09-06

Timely access to safe hospital care remains a major concern. Target bed-occupancy rates have been proposed as a measure of the ability of a hospital to function safely and effectively. High bed-occupancy rates have been shown to be associated with greater risks of hospital-associated infection and access block and to have a negative impact on staff health. Clinical observational data have suggested that bed occupancies above 85% could adversely affect safe, effective hospital function. Using this figure, at least initially, would be of value in the planning and operational management of public hospital beds in Australia. There is an urgent need to develop meaningful outcome measures of patient care that could replace the process measures currently in use.

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

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

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

LiFi based automated shopping assistance application in IoT

NASA Astrophysics Data System (ADS)

Akter, Sharmin; Funke Olanrewaju, Rashidah, Dr; Islam, Thouhedul; Salma

2018-05-01

Urban people minimize shopping time in daily life due to time constrain. From that point of view, the concept of supermarket is being popular while consumers can buy different items from same place. However, customer spends hours and hours to find desired items in a large supermarket. In addition, it’s also required to be queued during payment at counter that is also time consuming. As a result, a customer has to spend 2-3 hours for shopping in a large superstore. This paper proposes an Internet of Things and Li-Fi based automated application for smart phone and web to find items easily during shopping that can save consumer’s time as well as reduce man power in supermarket.

ROME (Request Object Management Environment)

NASA Astrophysics Data System (ADS)

Kong, M.; Good, J. C.; Berriman, G. B.

2005-12-01

Most current astronomical archive services are based on an HTML/ CGI architecture where users submit HTML forms via a browser and CGI programs operating under a web server process the requests. Most services return an HTML result page with URL links to the result files or, for longer jobs, return a message indicating that email will be sent when the job is done. This paradigm has a few serious shortcomings. First, it is all too common for something to go wrong and for the user to never hear about the job again. Second, for long and complicated jobs there is often important intermediate information that would allow the user to adjust the processing. Finally, unless some sort of custom queueing mechanism is used, background jobs are started immediately upon receiving the CGI request. When there are many such requests the server machine can easily be overloaded and either slow to a crawl or crash. Request Object Management Environment (ROME) is a collection of middleware components being developed under the National Virtual Observatory Project to provide mechanism for managing long jobs such as computationally intensive statistical analysis requests or the generation of large scale mosaic images. Written as EJB objects within the open-source JBoss applications server, ROME receives processing requests via a servelet interface, stores them in a DBMS using JDBC, distributes the processing (via queuing mechanisms) across multiple machines and environments (including Grid resources), manages realtime messages from the processing modules, and ensures proper user notification. The request processing modules are identical in structure to standard CGI-programs -- though they can optionally implement status messaging -- and can be written in any language. ROME will persist these jobs across failures of processing modules, network outages, and even downtime of ROME and the DBMS, restarting them as necessary.

Wide-area littoral discreet observation: success at the tactical edge

NASA Astrophysics Data System (ADS)

Toth, Susan; Hughes, William; Ladas, Andrew

2012-06-01

In June 2011, the United States Army Research Laboratory (ARL) participated in Empire Challenge 2011 (EC-11). EC-11 was United States Joint Forces Command's (USJFCOM) annual live, joint and coalition intelligence, surveillance and reconnaissance (ISR) interoperability demonstration under the sponsorship of the Under Secretary of Defense for Intelligence (USD/I). EC-11 consisted of a series of ISR interoperability events, using a combination of modeling & simulation, laboratory and live-fly events. Wide-area Littoral Discreet Observation (WALDO) was ARL's maritime/littoral capability. WALDO met a USD(I) directive that EC-11 have a maritime component and WALDO was the primary player in the maritime scenario conducted at Camp Lejeune, North Carolina. The WALDO effort demonstrated the utility of a networked layered sensor array deployed in a maritime littoral environment, focusing on maritime surveillance targeting counter-drug, counter-piracy and suspect activity in a littoral or riverine environment. In addition to an embedded analytical capability, the sensor array and control infrastructure consisted of the Oriole acoustic sensor, iScout unattended ground sensor (UGS), OmniSense UGS, the Compact Radar and the Universal Distributed Management System (UDMS), which included the Proxy Skyraider, an optionally manned aircraft mounting both wide and narrow FOV EO/IR imaging sensors. The capability seeded a littoral area with riverine and unattended sensors in order to demonstrate the utility of a Wide Area Sensor (WAS) capability in a littoral environment focused on maritime surveillance activities. The sensors provided a cue for WAS placement/orbit. A narrow field of view sensor would be used to focus on more discreet activities within the WAS footprint. Additionally, the capability experimented with novel WAS orbits to determine if there are more optimal orbits for WAS collection in a littoral environment. The demonstration objectives for WALDO at EC-11 were: * Demonstrate a networked, layered, multi-modal sensor array deployed in a maritime littoral environment, focusing on maritime surveillance targeting counter-drug, counter-piracy and suspect activity * Assess the utility of a Wide Area Surveillance (WAS) sensor in a littoral environment focused on maritime surveillance activities * Demonstrate the effectiveness of using UGS sensors to cue WAS sensor tasking * Employ a narrow field of view full motion video (FMV) sensor package that is collocated with the WAS to conduct more discrete observation of potential items of interest when queued by near-real-time data from UGS or observers * Couple the ARL Oriole sensor with other modality UGS networks in a ground layer ISR capability, and incorporate data collected from aerial sensors with a GEOINT base layer to form a fused product * Swarm multiple aerial or naval platforms to prosecute single or multiple targets * Track fast moving surface vessels in littoral areas * Disseminate time sensitive, high value data to the users at the tactical edge In short we sought to answer the following question: how do you layer, control and display disparate sensors and sensor modalities in such a way as to facilitate appropriate sensor cross-cue, data integration, and analyst control to effectively monitor activity in a littoral (or novel) environment?

Scidac-Data: Enabling Data Driven Modeling of Exascale Computing

DOE PAGES

Mubarak, Misbah; Ding, Pengfei; Aliaga, Leo; ...

2017-11-23

Here, 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 (HEP) data. The project analyzes the analysis patterns and data organization that have been used by NOvA, MicroBooNE, MINERvA, CDF, D0, 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 simulationsmore » 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 present the use of a subset of the SciDAC-Data distributions, acquired from analysis of approximately 71,000 HEP workflows run on the Fermilab data center and corresponding to over 9 million individual analysis jobs, as the input to detailed queuing simulations that model the expected data consumption and caching behaviors of the work running in high performance computing (HPC) and high throughput computing (HTC) environments. In particular we describe how the Sequential Access via Metadata (SAM) data-handling system in combination with the dCache/Enstore-based data archive facilities has been used to develop radically different models for analyzing the HEP data. We also show how the simulations may be used to assess the impact of design choices in archive facilities.« less

Scidac-Data: Enabling Data Driven Modeling of Exascale Computing

NASA Astrophysics Data System (ADS)

Mubarak, Misbah; Ding, Pengfei; Aliaga, Leo; Tsaris, Aristeidis; Norman, Andrew; Lyon, Adam; Ross, Robert

2017-10-01

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 (HEP) data. The project analyzes the analysis patterns and data organization that have been used by NOvA, MicroBooNE, MINERvA, CDF, D0, 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 present the use of a subset of the SciDAC-Data distributions, acquired from analysis of approximately 71,000 HEP workflows run on the Fermilab data center and corresponding to over 9 million individual analysis jobs, as the input to detailed queuing simulations that model the expected data consumption and caching behaviors of the work running in high performance computing (HPC) and high throughput computing (HTC) environments. In particular we describe how the Sequential Access via Metadata (SAM) data-handling system in combination with the dCache/Enstore-based data archive facilities has been used to develop radically different models for analyzing the HEP data. We also show how the simulations may be used to assess the impact of design choices in archive facilities.

Underworld - Bringing a Research Code to the Classroom

NASA Astrophysics Data System (ADS)

Moresi, L. N.; Mansour, J.; Giordani, J.; Farrington, R.; Kaluza, O.; Quenette, S.; Woodcock, R.; Squire, G.

2017-12-01

While there are many reasons to celebrate the passing of punch card programming and flickering green screens,the loss of the sense of wonder at the very existence of computers and the calculations they make possible shouldnot be numbered among them. Computers have become so familiar that students are often unaware that formal and careful design of algorithms andtheir implementations remains a valuable and important skill that has to be learned and practiced to achieveexpertise and genuine understanding. In teaching geodynamics and geophysics at undergraduate level, we aimed to be able to bring our researchtools into the classroom - even when those tools are advanced, parallel research codes that we typically deploy on hundredsor thousands of processors, and we wanted to teach not just the physical concepts that are modelled by these codes but asense of familiarity with computational modelling and the ability to discriminate a reliable model from a poor one. The underworld code (www.underworldcode.org) was developed for modelling plate-scale fluid mechanics and studyingproblems in lithosphere dynamics. Though specialised for this task, underworld has a straightforwardpython user interface that allows it to run within the environment of jupyter notebooks on a laptop (at modest resolution, of course).The python interface was developed for adaptability in addressing new research problems, but also lends itself to integration intoa python-driven learning environment. To manage the heavy demands of installing and running underworld in a teaching laboratory, we have developed a workflow in whichwe install docker containers in the cloud which support a number of students to run their own environment independently. We share ourexperience blending notebooks and static webpages into a single web environment, and we explain how we designed our graphics andanalysis tools to allow notebook "scripts" to be queued and run on a supercomputer.

Scidac-Data: Enabling Data Driven Modeling of Exascale Computing

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

Mubarak, Misbah; Ding, Pengfei; Aliaga, Leo

Here, 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 (HEP) data. The project analyzes the analysis patterns and data organization that have been used by NOvA, MicroBooNE, MINERvA, CDF, D0, 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 simulationsmore » 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 present the use of a subset of the SciDAC-Data distributions, acquired from analysis of approximately 71,000 HEP workflows run on the Fermilab data center and corresponding to over 9 million individual analysis jobs, as the input to detailed queuing simulations that model the expected data consumption and caching behaviors of the work running in high performance computing (HPC) and high throughput computing (HTC) environments. In particular we describe how the Sequential Access via Metadata (SAM) data-handling system in combination with the dCache/Enstore-based data archive facilities has been used to develop radically different models for analyzing the HEP data. We also show how the simulations may be used to assess the impact of design choices in archive facilities.« less

Patient Safety Walkaround: a communication tool for the reallocation of health service resources

PubMed Central

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

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

NASA Astrophysics Data System (ADS)

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 <10 cm range accuracy through foliage in real-time. The 3D imaging flash ladar is designed for a STUAS with a complete system SWAP estimate of <9 kg, <0.2 m3 and <350 W power. The 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.

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

PubMed

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.

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

DOE PAGES

Ren, Lantian; Cafferty, Kara; Roni, Mohammad; ...

2015-06-11

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,more » 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.« less

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

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

Ren, Lantian; Cafferty, Kara; Roni, Mohammad

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,more » 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.« less

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

DOEpatents

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

2015-12-29

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

Impact analysis of two kinds of failure strategies in Beijing road transportation network

NASA Astrophysics Data System (ADS)

Zhang, Zundong; Xu, Xiaoyang; Zhang, Zhaoran; Zhou, Huijuan

The Beijing road transportation network (BRTN), as a large-scale technological network, exhibits very complex and complicate features during daily periods. And it has been widely highlighted that how statistical characteristics (i.e. average path length and global network efficiency) change while the network evolves. In this paper, by using different modeling concepts, three kinds of network models of BRTN namely the abstract network model, the static network model with road mileage as weights and the dynamic network model with travel time as weights — are constructed, respectively, according to the topological data and the real detected flow data. The degree distribution of the three kinds of network models are analyzed, which proves that the urban road infrastructure network and the dynamic network behavior like scale-free networks. By analyzing and comparing the important statistical characteristics of three models under random attacks and intentional attacks, it shows that the urban road infrastructure network and the dynamic network of BRTN are both robust and vulnerable.

A Complex Network Approach to Distributional Semantic Models

PubMed Central

Utsumi, Akira

2015-01-01

A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models. PMID:26295940

Parallelization of a spatial random field characterization process using the Method of Anchored Distributions and the HTCondor high throughput computing system

NASA Astrophysics Data System (ADS)

Osorio-Murillo, C. A.; Over, M. W.; Frystacky, H.; Ames, D. P.; Rubin, Y.

2013-12-01

A new software application called MAD# has been coupled with the HTCondor high throughput computing system to aid scientists and educators with the characterization of spatial random fields and enable understanding the spatial distribution of parameters used in hydrogeologic and related modeling. MAD# is an open source desktop software application used to characterize spatial random fields using direct and indirect information through Bayesian inverse modeling technique called the Method of Anchored Distributions (MAD). MAD relates indirect information with a target spatial random field via a forward simulation model. MAD# executes inverse process running the forward model multiple times to transfer information from indirect information to the target variable. MAD# uses two parallelization profiles according to computational resources available: one computer with multiple cores and multiple computers - multiple cores through HTCondor. HTCondor is a system that manages a cluster of desktop computers for submits serial or parallel jobs using scheduling policies, resources monitoring, job queuing mechanism. This poster will show how MAD# reduces the time execution of the characterization of random fields using these two parallel approaches in different case studies. A test of the approach was conducted using 1D problem with 400 cells to characterize saturated conductivity, residual water content, and shape parameters of the Mualem-van Genuchten model in four materials via the HYDRUS model. The number of simulations evaluated in the inversion was 10 million. Using the one computer approach (eight cores) were evaluated 100,000 simulations in 12 hours (10 million - 1200 hours approximately). In the evaluation on HTCondor, 32 desktop computers (132 cores) were used, with a processing time of 60 hours non-continuous in five days. HTCondor reduced the processing time for uncertainty characterization by a factor of 20 (1200 hours reduced to 60 hours.)

A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models

PubMed Central

Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry

2015-01-01

We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701

Modeling the Citation Network by Network Cosmology

PubMed Central

Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing

2015-01-01

Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well. PMID:25807397

Modeling the citation network by network cosmology.

PubMed

Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing

2015-01-01

Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.

Engineering technology for networks

NASA Technical Reports Server (NTRS)

Paul, Arthur S.; Benjamin, Norman

1991-01-01

Space Network (SN) modeling and evaluation are presented. The following tasks are included: Network Modeling (developing measures and metrics for SN, modeling of the Network Control Center (NCC), using knowledge acquired from the NCC to model the SNC, and modeling the SN); and Space Network Resource scheduling.

A generic method for evaluating crowding in the emergency department.

PubMed

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

2016-06-14

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

Measurements of ultrafine particles and other vehicular pollutants inside school buses in South Texas

NASA Astrophysics Data System (ADS)

Zhang, Qunfang; Zhu, Yifang

2010-01-01

Increasing evidence has demonstrated toxic effects of vehicular emitted ultrafine particles (UFPs, diameter < 100 nm), with the highest human exposure usually occurring on and near roadways. Children are particularly at risk due to immature respiratory systems and faster breathing rates. In this study, children's exposure to in-cabin air 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.

A random spatial network model based on elementary postulates

USGS Publications Warehouse

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

Classification of complex networks based on similarity of topological network features

NASA Astrophysics Data System (ADS)

Attar, Niousha; Aliakbary, Sadegh

2017-09-01

Over the past few decades, networks have been widely used to model real-world phenomena. Real-world networks exhibit nontrivial topological characteristics and therefore, many network models are proposed in the literature for generating graphs that are similar to real networks. Network models reproduce nontrivial properties such as long-tail degree distributions or high clustering coefficients. In this context, we encounter the problem of selecting the network model that best fits a given real-world network. The need for a model selection method reveals the network classification problem, in which a target-network is classified into one of the candidate network models. In this paper, we propose a novel network classification method which is independent of the network size and employs an alignment-free metric of network comparison. The proposed method is based on supervised machine learning algorithms and utilizes the topological similarities of networks for the classification task. The experiments show that the proposed method outperforms state-of-the-art methods with respect to classification accuracy, time efficiency, and robustness to noise.

COSMOS: Python library for massively parallel workflows

PubMed Central

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

2014-01-01

Summary: 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. Availability and implementation: 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. Contact: dpwall@stanford.edu or peter_tonellato@hms.harvard.edu. Supplementary information: Supplementary data are available at Bioinformatics online. PMID:24982428

COSMOS: Python library for massively parallel workflows.

PubMed

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.

Power law signature of media exposure in human response waiting time distributions

NASA Astrophysics Data System (ADS)

Crane, Riley; Schweitzer, Frank; Sornette, Didier

2010-05-01

We study the humanitarian response to the destruction brought by the tsunami generated by the Sumatra earthquake of December 26, 2004, as measured by donations, and find that it decays in time as a power law ˜1/tα with α=2.5±0.1 . This behavior is suggested to be the rare outcome of a priority queuing process in which individuals execute tasks at a rate slightly faster than the rate at which new tasks arise. We believe this to be an empirical evidence documenting the recently predicted [G. Grinstein and R. Linsker, Phys. Rev. E 77, 012101 (2008)] regime, and provide additional independent evidence that suggests that this “highly attentive regime” arises as a result of the intense focus placed on this donation “task” by the media.

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed Central

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 was 450 herds per day, it was decided whether herds appointed for surveillance would be surveyed on the current day or added to the queue. The model was run with a basic scenario representing the EU and Danish regulations, which includes a 3 km protection and 10 km surveillance zone around detected herds. In alternative scenarios, the protection zone was enlarged to 5 km, the surveillance zone was enlarged to 15 or 20 km, or a combined enlargement of the protection and surveillance zones was modelled. Sensitivity analysis included changing surveillance capacity to 200, 350 or 600 herds per day, frequency of repeated visits for herds in overlapping surveillance zones from every 14 days to every 7, 21 and 30 days, and the size of the zones combined with a surveillance capacity increased to 600 herds per day. The results showed that the default surveillance capacity is sufficient to survey herds on time. Extra 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 of affected herds, it resulted frequently in larger economic losses. PMID:25014351

A simple model clarifies the complicated relationships of complex networks

PubMed Central

Zheng, Bojin; Wu, Hongrun; Kuang, Li; Qin, Jun; Du, Wenhua; Wang, Jianmin; Li, Deyi

2014-01-01

Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it is widely believed that these traits origin from different causes. However, we find that a simple model based on optimisation can produce many traits, including scale-free, small-world, ultra small-world, Delta-distribution, compact, fractal, regular and random networks. Moreover, by revising the proposed model, the community-structure networks are generated. By this model and the revised versions, the complicated relationships of complex networks are illustrated. The model brings a new universal perspective to the understanding of complex networks and provide a universal method to model complex networks from the viewpoint of optimisation. PMID:25160506

Random graph models of social networks.

PubMed

Newman, M E J; Watts, D J; Strogatz, S H

2002-02-19

We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

Studies on the population dynamics of a rumor-spreading model in online social networks

NASA Astrophysics Data System (ADS)

Dong, Suyalatu; Fan, Feng-Hua; Huang, Yong-Chang

2018-02-01

This paper sets up a rumor spreading model in online social networks based on the European fox rabies SIR model. The model considers the impact of changing number of online social network users, combines the transmission dynamics to set up a population dynamics of rumor spreading model in online social networks. Simulation is carried out on online social network, and results show that the new rumor spreading model is in accordance with the real propagation characteristics in online social networks.

Network structure exploration in networks with node attributes

NASA Astrophysics Data System (ADS)

Chen, Yi; Wang, Xiaolong; Bu, Junzhao; Tang, Buzhou; Xiang, Xin

2016-05-01

Complex networks provide a powerful way to represent complex systems and have been widely studied during the past several years. One of the most important tasks of network analysis is to detect structures (also called structural regularities) embedded in networks by determining group number and group partition. Most of network structure exploration models only consider network links. However, in real world networks, nodes may have attributes that are useful for network structure exploration. In this paper, we propose a novel Bayesian nonparametric (BNP) model to explore structural regularities in networks with node attributes, called Bayesian nonparametric attribute (BNPA) model. This model does not only take full advantage of both links between nodes and node attributes for group partition via shared hidden variables, but also determine group number automatically via the Bayesian nonparametric theory. Experiments conducted on a number of real and synthetic networks show that our BNPA model is able to automatically explore structural regularities in networks with node attributes and is competitive with other state-of-the-art models.

Precise Network Modeling of Systems Genetics Data Using the Bayesian Network Webserver.

PubMed

Ziebarth, Jesse D; Cui, Yan

2017-01-01

The Bayesian Network Webserver (BNW, http://compbio.uthsc.edu/BNW ) is an integrated platform for Bayesian network modeling of biological datasets. It provides a web-based network modeling environment that seamlessly integrates advanced algorithms for probabilistic causal modeling and reasoning with Bayesian networks. BNW is designed for precise modeling of relatively small networks that contain less than 20 nodes. The structure learning algorithms used by BNW guarantee the discovery of the best (most probable) network structure given the data. To facilitate network modeling across multiple biological levels, BNW provides a very flexible interface that allows users to assign network nodes into different tiers and define the relationships between and within the tiers. This function is particularly useful for modeling systems genetics datasets that often consist of multiscalar heterogeneous genotype-to-phenotype data. BNW enables users to, within seconds or minutes, go from having a simply formatted input file containing a dataset to using a network model to make predictions about the interactions between variables and the potential effects of experimental interventions. In this chapter, we will introduce the functions of BNW and show how to model systems genetics datasets with BNW.

Human Behavior Modeling in Network Science

DTIC Science & Technology

2010-03-01

in Network Science bringing three distinct research areas together, communication networks, information networks, and social /cognitive networks. The...researchers. A critical part of the social /cognitive network effort is the modeling of human behavior. The modeling efforts range from organizational...behavior to social cognitive trust to explore and refine the theoretical and applied network relationships between and among the human

Generative model selection using a scalable and size-independent complex network classifier

NASA Astrophysics Data System (ADS)

Motallebi, Sadegh; Aliakbary, Sadegh; Habibi, Jafar

2013-12-01

Real networks exhibit nontrivial topological features, such as heavy-tailed degree distribution, high clustering, and small-worldness. Researchers have developed several generative models for synthesizing artificial networks that are structurally similar to real networks. An important research problem is to identify the generative model that best fits to a target network. In this paper, we investigate this problem and our goal is to select the model that is able to generate graphs similar to a given network instance. By the means of generating synthetic networks with seven outstanding generative models, we have utilized machine learning methods to develop a decision tree for model selection. Our proposed method, which is named "Generative Model Selection for Complex Networks," outperforms existing methods with respect to accuracy, scalability, and size-independence.

Network traffic behaviour near phase transition point

NASA Astrophysics Data System (ADS)

Lawniczak, A. T.; Tang, X.

2006-03-01

We explore packet traffic dynamics in a data network model near phase transition point from free flow to congestion. The model of data network is an abstraction of the Network Layer of the OSI (Open Systems Interconnect) Reference Model of packet switching networks. The Network Layer is responsible for routing packets across the network from their sources to their destinations and for control of congestion in data networks. Using the model we investigate spatio-temporal packets traffic dynamics near the phase transition point for various network connection topologies, and static and adaptive routing algorithms. We present selected simulation results and analyze them.

A general stochastic model for studying time evolution of transition networks

NASA Astrophysics Data System (ADS)

Zhan, Choujun; Tse, Chi K.; Small, Michael

2016-12-01

We consider a class of complex networks whose nodes assume one of several possible states at any time and may change their states from time to time. Such networks represent practical networks of rumor spreading, disease spreading, language evolution, and so on. Here, we derive a model describing the dynamics of this kind of network and a simulation algorithm for studying the network evolutionary behavior. This model, derived at a microscopic level, can reveal the transition dynamics of every node. A numerical simulation is taken as an ;experiment; or ;realization; of the model. We use this model to study the disease propagation dynamics in four different prototypical networks, namely, the regular nearest-neighbor (RN) network, the classical Erdös-Renyí (ER) random graph, the Watts-Strogátz small-world (SW) network, and the Barabási-Albert (BA) scalefree network. We find that the disease propagation dynamics in these four networks generally have different properties but they do share some common features. Furthermore, we utilize the transition network model to predict user growth in the Facebook network. Simulation shows that our model agrees with the historical data. The study can provide a useful tool for a more thorough understanding of the dynamics networks.

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher

2005-01-01

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

Inferring general relations between network characteristics from specific network ensembles.

PubMed

Cardanobile, Stefano; Pernice, Volker; Deger, Moritz; Rotter, Stefan

2012-01-01

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.

Vulnerability of complex networks

NASA Astrophysics Data System (ADS)

Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco

2011-01-01

We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős-Rényi (ER) random networks, Barabási-Albert (BA) model of scale-free networks, Watts-Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.

Representing Micro-Macro Linkages by Actor-Based Dynamic Network Models

PubMed Central

Snijders, Tom A.B.; Steglich, Christian E.G.

2014-01-01

Stochastic actor-based models for network dynamics have the primary aim of statistical inference about processes of network change, but may be regarded as a kind of agent-based models. Similar to many other agent-based models, they are based on local rules for actor behavior. Different from many other agent-based models, by including elements of generalized linear statistical models they aim to be realistic detailed representations of network dynamics in empirical data sets. Statistical parallels to micro-macro considerations can be found in the estimation of parameters determining local actor behavior from empirical data, and the assessment of goodness of fit from the correspondence with network-level descriptives. This article studies several network-level consequences of dynamic actor-based models applied to represent cross-sectional network data. Two examples illustrate how network-level characteristics can be obtained as emergent features implied by micro-specifications of actor-based models. PMID:25960578

Capacity of Heterogeneous Mobile Wireless Networks with D-Delay Transmission Strategy.

PubMed

Wu, Feng; Zhu, Jiang; Xi, Zhipeng; Gao, Kai

2016-03-25

This paper investigates the capacity problem of heterogeneous wireless networks in mobility scenarios. A heterogeneous network model which consists of n normal nodes and m helping nodes is proposed. Moreover, we propose a D-delay transmission strategy to ensure that every packet can be delivered to its destination nodes with limited delay. Different from most existing network schemes, our network model has a novel two-tier architecture. The existence of helping nodes greatly improves the network capacity. Four types of mobile networks are studied in this paper: i.i.d. fast mobility model and slow mobility model in two-dimensional space, i.i.d. fast mobility model and slow mobility model in three-dimensional space. Using the virtual channel model, we present an intuitive analysis of the capacity of two-dimensional mobile networks and three-dimensional mobile networks, respectively. Given a delay constraint D, we derive the asymptotic expressions for the capacity of the four types of mobile networks. Furthermore, the impact of D and m to the capacity of the whole network is analyzed. Our findings provide great guidance for the future design of the next generation of networks.

Modeling online social signed networks

NASA Astrophysics Data System (ADS)

Li, Le; Gu, Ke; Zeng, An; Fan, Ying; Di, Zengru

2018-04-01

People's online rating behavior can be modeled by user-object bipartite networks directly. However, few works have been devoted to reveal the hidden relations between users, especially from the perspective of signed networks. We analyze the signed monopartite networks projected by the signed user-object bipartite networks, finding that the networks are highly clustered with obvious community structure. Interestingly, the positive clustering coefficient is remarkably higher than the negative clustering coefficient. Then, a Signed Growing Network model (SGN) based on local preferential attachment is proposed to generate a user's signed network that has community structure and high positive clustering coefficient. Other structural properties of the modeled networks are also found to be similar to the empirical networks.

Reliable Communication Models in Interdependent Critical Infrastructure Networks

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

Lee, Sangkeun; Chinthavali, Supriya; Shankar, Mallikarjun

Modern critical infrastructure networks are becoming increasingly interdependent where the failures in one network may cascade to other dependent networks, causing severe widespread national-scale failures. A number of previous efforts have been made to analyze the resiliency and robustness of interdependent networks based on different models. However, communication network, which plays an important role in today's infrastructures to detect and handle failures, has attracted little attention in the interdependency studies, and no previous models have captured enough practical features in the critical infrastructure networks. In this paper, we study the interdependencies between communication network and other kinds of critical infrastructuremore » networks with an aim to identify vulnerable components and design resilient communication networks. We propose several interdependency models that systematically capture various features and dynamics of failures spreading in critical infrastructure networks. We also discuss several research challenges in building reliable communication solutions to handle failures in these models.« less

Generative model selection using a scalable and size-independent complex network classifier

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

Motallebi, Sadegh, E-mail: motallebi@ce.sharif.edu; Aliakbary, Sadegh, E-mail: aliakbary@ce.sharif.edu; Habibi, Jafar, E-mail: jhabibi@sharif.edu

2013-12-15

Real networks exhibit nontrivial topological features, such as heavy-tailed degree distribution, high clustering, and small-worldness. Researchers have developed several generative models for synthesizing artificial networks that are structurally similar to real networks. An important research problem is to identify the generative model that best fits to a target network. In this paper, we investigate this problem and our goal is to select the model that is able to generate graphs similar to a given network instance. By the means of generating synthetic networks with seven outstanding generative models, we have utilized machine learning methods to develop a decision tree formore » model selection. Our proposed method, which is named “Generative Model Selection for Complex Networks,” outperforms existing methods with respect to accuracy, scalability, and size-independence.« less

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

NASA Astrophysics Data System (ADS)

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.

Dense power-law networks and simplicial complexes

NASA Astrophysics Data System (ADS)

Courtney, Owen T.; Bianconi, Ginestra

2018-05-01

There is increasing evidence that dense networks occur in on-line social networks, recommendation networks and in the brain. In addition to being dense, these networks are often also scale-free, i.e., their degree distributions follow P (k ) ∝k-γ with γ ∈(1 ,2 ] . Models of growing networks have been successfully employed to produce scale-free networks using preferential attachment, however these models can only produce sparse networks as the numbers of links and nodes being added at each time step is constant. Here we present a modeling framework which produces networks that are both dense and scale-free. The mechanism by which the networks grow in this model is based on the Pitman-Yor process. Variations on the model are able to produce undirected scale-free networks with exponent γ =2 or directed networks with power-law out-degree distribution with tunable exponent γ ∈(1 ,2 ) . We also extend the model to that of directed two-dimensional simplicial complexes. Simplicial complexes are generalization of networks that can encode the many body interactions between the parts of a complex system and as such are becoming increasingly popular to characterize different data sets ranging from social interacting systems to the brain. Our model produces dense directed simplicial complexes with power-law distribution of the generalized out-degrees of the nodes.

Generative models for network neuroscience: prospects and promise

PubMed Central

Betzel, Richard F.

2017-01-01

Network neuroscience is the emerging discipline concerned with investigating the complex patterns of interconnections found in neural systems, and identifying principles with which to understand them. Within this discipline, one particularly powerful approach is network generative modelling, in which wiring rules are algorithmically implemented to produce synthetic network architectures with the same properties as observed in empirical network data. Successful models can highlight the principles by which a network is organized and potentially uncover the mechanisms by which it grows and develops. Here, we review the prospects and promise of generative models for network neuroscience. We begin with a primer on network generative models, with a discussion of compressibility and predictability, and utility in intuiting mechanisms, followed by a short history on their use in network science, broadly. We then discuss generative models in practice and application, paying particular attention to the critical need for cross-validation. Next, we review generative models of biological neural networks, both at the cellular and large-scale level, and across a variety of species including Caenorhabditis elegans, Drosophila, mouse, rat, cat, macaque and human. We offer a careful treatment of a few relevant distinctions, including differences between generative models and null models, sufficiency and redundancy, inferring and claiming mechanism, and functional and structural connectivity. We close with a discussion of future directions, outlining exciting frontiers both in empirical data collection efforts as well as in method and theory development that, together, further the utility of the generative network modelling approach for network neuroscience. PMID:29187640

Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks

PubMed Central

Lähdesmäki, Harri; Hautaniemi, Sampsa; Shmulevich, Ilya; Yli-Harja, Olli

2006-01-01

A significant amount of attention has recently been focused on modeling of gene regulatory networks. Two frequently used large-scale modeling frameworks are Bayesian networks (BNs) and Boolean networks, the latter one being a special case of its recent stochastic extension, probabilistic Boolean networks (PBNs). PBN is a promising model class that generalizes the standard rule-based interactions of Boolean networks into the stochastic setting. Dynamic Bayesian networks (DBNs) is a general and versatile model class that is able to represent complex temporal stochastic processes and has also been proposed as a model for gene regulatory systems. In this paper, we concentrate on these two model classes and demonstrate that PBNs and a certain subclass of DBNs can represent the same joint probability distribution over their common variables. The major benefit of introducing the relationships between the models is that it opens up the possibility of applying the standard tools of DBNs to PBNs and vice versa. Hence, the standard learning tools of DBNs can be applied in the context of PBNs, and the inference methods give a natural way of handling the missing values in PBNs which are often present in gene expression measurements. Conversely, the tools for controlling the stationary behavior of the networks, tools for projecting networks onto sub-networks, and efficient learning schemes can be used for DBNs. In other words, the introduced relationships between the models extend the collection of analysis tools for both model classes. PMID:17415411

The effect of a loss of model structural detail due to network skeletonization on contamination warning system design: case studies.

PubMed

Davis, Michael J; Janke, Robert

2018-01-04

The effect of limitations in the structural detail available in a network model on contamination warning system (CWS) design was examined in case studies using the original and skeletonized network models for two water distribution systems (WDSs). The skeletonized models were used as proxies for incomplete network models. CWS designs were developed by optimizing sensor placements for worst-case and mean-case contamination events. Designs developed using the skeletonized network models were transplanted into the original network model for evaluation. CWS performance was defined as the number of people who ingest more than some quantity of a contaminant in tap water before the CWS detects the presence of contamination. Lack of structural detail in a network model can result in CWS designs that (1) provide considerably less protection against worst-case contamination events than that obtained when a more complete network model is available and (2) yield substantial underestimates of the consequences associated with a contamination event. Nevertheless, CWSs developed using skeletonized network models can provide useful reductions in consequences for contaminants whose effects are not localized near the injection location. Mean-case designs can yield worst-case performances similar to those for worst-case designs when there is uncertainty in the network model. Improvements in network models for WDSs have the potential to yield significant improvements in CWS designs as well as more realistic evaluations of those designs. Although such improvements would be expected to yield improved CWS performance, the expected improvements in CWS performance have not been quantified previously. The results presented here should be useful to those responsible for the design or implementation of CWSs, particularly managers and engineers in water utilities, and encourage the development of improved network models.

The effect of a loss of model structural detail due to network skeletonization on contamination warning system design: case studies

NASA Astrophysics Data System (ADS)

Davis, Michael J.; Janke, Robert

2018-05-01

The effect of limitations in the structural detail available in a network model on contamination warning system (CWS) design was examined in case studies using the original and skeletonized network models for two water distribution systems (WDSs). The skeletonized models were used as proxies for incomplete network models. CWS designs were developed by optimizing sensor placements for worst-case and mean-case contamination events. Designs developed using the skeletonized network models were transplanted into the original network model for evaluation. CWS performance was defined as the number of people who ingest more than some quantity of a contaminant in tap water before the CWS detects the presence of contamination. Lack of structural detail in a network model can result in CWS designs that (1) provide considerably less protection against worst-case contamination events than that obtained when a more complete network model is available and (2) yield substantial underestimates of the consequences associated with a contamination event. Nevertheless, CWSs developed using skeletonized network models can provide useful reductions in consequences for contaminants whose effects are not localized near the injection location. Mean-case designs can yield worst-case performances similar to those for worst-case designs when there is uncertainty in the network model. Improvements in network models for WDSs have the potential to yield significant improvements in CWS designs as well as more realistic evaluations of those designs. Although such improvements would be expected to yield improved CWS performance, the expected improvements in CWS performance have not been quantified previously. The results presented here should be useful to those responsible for the design or implementation of CWSs, particularly managers and engineers in water utilities, and encourage the development of improved network models.

QSAR modelling using combined simple competitive learning networks and RBF neural networks.

PubMed

Sheikhpour, R; Sarram, M A; Rezaeian, M; Sheikhpour, E

2018-04-01

The aim of this study was to propose a QSAR modelling approach based on the combination of simple competitive learning (SCL) networks with radial basis function (RBF) neural networks for predicting the biological activity of chemical compounds. The proposed QSAR method consisted of two phases. In the first phase, an SCL network was applied to determine the centres of an RBF neural network. In the second phase, the RBF neural network was used to predict the biological activity of various phenols and Rho kinase (ROCK) inhibitors. The predictive ability of the proposed QSAR models was evaluated and compared with other QSAR models using external validation. The results of this study showed that the proposed QSAR modelling approach leads to better performances than other models in predicting the biological activity of chemical compounds. This indicated the efficiency of simple competitive learning networks in determining the centres of RBF neural networks.

Spatiotemporal Bayesian networks for malaria prediction.

PubMed

Haddawy, Peter; Hasan, A H M Imrul; Kasantikul, Rangwan; Lawpoolsri, Saranath; Sa-Angchai, Patiwat; Kaewkungwal, Jaranit; Singhasivanon, Pratap

2018-01-01

Targeted intervention and resource allocation are essential for effective malaria control, particularly in remote areas, with predictive models providing important information for decision making. While a diversity of modeling technique have been used to create predictive models of malaria, no work has made use of Bayesian networks. Bayes nets are attractive due to their ability to represent uncertainty, model time lagged and nonlinear relations, and provide explanations. This paper explores the use of Bayesian networks to model malaria, demonstrating the approach by creating village level models with weekly temporal resolution for Tha Song Yang district in northern Thailand. The networks are learned using data on cases and environmental covariates. Three types of networks are explored: networks for numeric prediction, networks for outbreak prediction, and networks that incorporate spatial autocorrelation. Evaluation of the numeric prediction network shows that the Bayes net has prediction accuracy in terms of mean absolute error of about 1.4 cases for 1 week prediction and 1.7 cases for 6 week prediction. The network for outbreak prediction has an ROC AUC above 0.9 for all prediction horizons. Comparison of prediction accuracy of both Bayes nets against several traditional modeling approaches shows the Bayes nets to outperform the other models for longer time horizon prediction of high incidence transmission. To model spread of malaria over space, we elaborate the models with links between the village networks. This results in some very large models which would be far too laborious to build by hand. So we represent the models as collections of probability logic rules and automatically generate the networks. Evaluation of the models shows that the autocorrelation links significantly improve prediction accuracy for some villages in regions of high incidence. We conclude that spatiotemporal Bayesian networks are a highly promising modeling alternative for prediction of malaria and other vector-borne diseases. Copyright © 2017 Elsevier B.V. All rights reserved.

Networks for image acquisition, processing and display

NASA Technical Reports Server (NTRS)

Ahumada, Albert J., Jr.

1990-01-01

The human visual system comprises layers of networks which sample, process, and code images. Understanding these networks is a valuable means of understanding human vision and of designing autonomous vision systems based on network processing. Ames Research Center has an ongoing program to develop computational models of such networks. The models predict human performance in detection of targets and in discrimination of displayed information. In addition, the models are artificial vision systems sharing properties with biological vision that has been tuned by evolution for high performance. Properties include variable density sampling, noise immunity, multi-resolution coding, and fault-tolerance. The research stresses analysis of noise in visual networks, including sampling, photon, and processing unit noises. Specific accomplishments include: models of sampling array growth with variable density and irregularity comparable to that of the retinal cone mosaic; noise models of networks with signal-dependent and independent noise; models of network connection development for preserving spatial registration and interpolation; multi-resolution encoding models based on hexagonal arrays (HOP transform); and mathematical procedures for simplifying analysis of large networks.

Structure-preserving model reduction of large-scale logistics networks. Applications for supply chains

NASA Astrophysics Data System (ADS)

Scholz-Reiter, B.; Wirth, F.; Dashkovskiy, S.; Makuschewitz, T.; Schönlein, M.; Kosmykov, M.

2011-12-01

We investigate the problem of model reduction with a view to large-scale logistics networks, specifically supply chains. Such networks are modeled by means of graphs, which describe the structure of material flow. An aim of the proposed model reduction procedure is to preserve important features within the network. As a new methodology we introduce the LogRank as a measure for the importance of locations, which is based on the structure of the flows within the network. We argue that these properties reflect relative importance of locations. Based on the LogRank we identify subgraphs of the network that can be neglected or aggregated. The effect of this is discussed for a few motifs. Using this approach we present a meta algorithm for structure-preserving model reduction that can be adapted to different mathematical modeling frameworks. The capabilities of the approach are demonstrated with a test case, where a logistics network is modeled as a Jackson network, i.e., a particular type of queueing network.

A new method for constructing networks from binary data

NASA Astrophysics Data System (ADS)

van Borkulo, Claudia D.; Borsboom, Denny; Epskamp, Sacha; Blanken, Tessa F.; Boschloo, Lynn; Schoevers, Robert A.; Waldorp, Lourens J.

2014-08-01

Network analysis is entering fields where network structures are unknown, such as psychology and the educational sciences. A crucial step in the application of network models lies in the assessment of network structure. Current methods either have serious drawbacks or are only suitable for Gaussian data. In the present paper, we present a method for assessing network structures from binary data. Although models for binary data are infamous for their computational intractability, we present a computationally efficient model for estimating network structures. The approach, which is based on Ising models as used in physics, combines logistic regression with model selection based on a Goodness-of-Fit measure to identify relevant relationships between variables that define connections in a network. A validation study shows that this method succeeds in revealing the most relevant features of a network for realistic sample sizes. We apply our proposed method to estimate the network of depression and anxiety symptoms from symptom scores of 1108 subjects. Possible extensions of the model are discussed.

Modeling Aircraft Wing Loads from Flight Data Using Neural Networks

NASA Technical Reports Server (NTRS)

Allen, Michael J.; Dibley, Ryan P.

2003-01-01

Neural networks were used to model wing bending-moment loads, torsion loads, and control surface hinge-moments of the Active Aeroelastic Wing (AAW) aircraft. Accurate loads models are required for the development of control laws designed to increase roll performance through wing twist while not exceeding load limits. Inputs to the model include aircraft rates, accelerations, and control surface positions. Neural networks were chosen to model aircraft loads because they can account for uncharacterized nonlinear effects while retaining the capability to generalize. The accuracy of the neural network models was improved by first developing linear loads models to use as starting points for network training. Neural networks were then trained with flight data for rolls, loaded reversals, wind-up-turns, and individual control surface doublets for load excitation. Generalization was improved by using gain weighting and early stopping. Results are presented for neural network loads models of four wing loads and four control surface hinge moments at Mach 0.90 and an altitude of 15,000 ft. An average model prediction error reduction of 18.6 percent was calculated for the neural network models when compared to the linear models. This paper documents the input data conditioning, input parameter selection, structure, training, and validation of the neural network models.

Polynomial algebra of discrete models in systems biology.

PubMed

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

Small-time Scale Network Traffic Prediction Based on Complex-valued Neural Network

NASA Astrophysics Data System (ADS)

Yang, Bin

2017-07-01

Accurate models play an important role in capturing the significant characteristics of the network traffic, analyzing the network dynamic, and improving the forecasting accuracy for system dynamics. In this study, complex-valued neural network (CVNN) model is proposed to further improve the accuracy of small-time scale network traffic forecasting. Artificial bee colony (ABC) algorithm is proposed to optimize the complex-valued and real-valued parameters of CVNN model. Small-scale traffic measurements data namely the TCP traffic data is used to test the performance of CVNN model. Experimental results reveal that CVNN model forecasts the small-time scale network traffic measurement data very accurately

Toward a model of school inspections in a polycentric system.

PubMed

Janssens, Frans J G; Ehren, Melanie C M

2016-06-01

Many education systems are developing towards more lateral structures where schools collaborate in networks to improve and provide (inclusive) education. These structures call for bottom-up models of network evaluation and accountability instead of the current hierarchical arrangements where single schools are evaluated by a central agency. This paper builds on available research about network effectiveness to present evolving models of network evaluation. Network effectiveness can be defined as the achievement of positive network level outcomes that cannot be attained by individual organizational participants acting alone. Models of network evaluation need to take into account the relations between network members, the structure of the network, its processes and its internal mechanism to enforce norms in order to understand the achievement and outcomes of the network and how these may evolve over time. A range of suitable evaluation models are presented in this paper, as well as a tentative school inspection framework which is inspired by these models. The final section will present examples from Inspectorates of Education in Northern Ireland and Scotland who have developed newer inspection models to evaluate the effectiveness of a range of different networks. Copyright © 2016 Elsevier Ltd. All rights reserved.

Modeling the resilience of critical infrastructure: the role of network dependencies.

PubMed

Guidotti, Roberto; Chmielewski, Hana; Unnikrishnan, Vipin; Gardoni, Paolo; McAllister, Therese; van de Lindt, John

2016-01-01

Water and wastewater network, electric power network, transportation network, communication network, and information technology network are among the critical infrastructure in our communities; their disruption during and after hazard events greatly affects communities' well-being, economic security, social welfare, and public health. In addition, a disruption in one network may cause disruption to other networks and lead to their reduced functionality. This paper presents a unified theoretical methodology for the modeling of dependent/interdependent infrastructure networks and incorporates it in a six-step probabilistic procedure to assess their resilience. Both the methodology and the procedure are general, can be applied to any infrastructure network and hazard, and can model different types of dependencies between networks. As an illustration, the paper models the direct effects of seismic events on the functionality of a potable water distribution network and the cascading effects of the damage of the electric power network (EPN) on the potable water distribution network (WN). The results quantify the loss of functionality and delay in the recovery process due to dependency of the WN on the EPN. The results show the importance of capturing the dependency between networks in modeling the resilience of critical infrastructure.

Modeling the resilience of critical infrastructure: the role of network dependencies

PubMed Central

Guidotti, Roberto; Chmielewski, Hana; Unnikrishnan, Vipin; Gardoni, Paolo; McAllister, Therese; van de Lindt, John

2017-01-01

Water and wastewater network, electric power network, transportation network, communication network, and information technology network are among the critical infrastructure in our communities; their disruption during and after hazard events greatly affects communities’ well-being, economic security, social welfare, and public health. In addition, a disruption in one network may cause disruption to other networks and lead to their reduced functionality. This paper presents a unified theoretical methodology for the modeling of dependent/interdependent infrastructure networks and incorporates it in a six-step probabilistic procedure to assess their resilience. Both the methodology and the procedure are general, can be applied to any infrastructure network and hazard, and can model different types of dependencies between networks. As an illustration, the paper models the direct effects of seismic events on the functionality of a potable water distribution network and the cascading effects of the damage of the electric power network (EPN) on the potable water distribution network (WN). The results quantify the loss of functionality and delay in the recovery process due to dependency of the WN on the EPN. The results show the importance of capturing the dependency between networks in modeling the resilience of critical infrastructure. PMID:28825037

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

PubMed Central

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

2016-01-01

Background: Hospital emergencies have an essential role in health care systems. In the last decade, developed countries have paid great attention to overcrowding crisis in emergency departments. Simulation analysis of complex models for which conditions will change over time is much more effective than analytical solutions and emergency department (ED) is one of the most complex models for analysis. This study aimed to determine the number of patients who are waiting and waiting time in emergency department services in an Iranian hospital ED and to propose scenarios to reduce its queue and waiting time. Methods: This is a cross-sectional study in which simulation software (Arena, version 14) was used. The input information was extracted from the hospital database as well as through sampling. The objective was to evaluate the response variables of waiting time, number waiting and utilization of each server and test the three scenarios to improve them. Results: Running the models for 30 days revealed that a total of 4088 patients left the ED after being served and 1238 patients waited in the queue for admission in the ED bed area at end of the run (actually these patients received services out of their defined capacity). The first scenario result in the number of beds had to be increased from 81 to179 in order that the number waiting of the “bed area” server become almost zero. The second scenario which attempted to limit hospitalization time in the ED bed area to the third quartile of the serving time distribution could decrease the number waiting to 586 patients. Conclusion: Doubling the bed capacity in the emergency department and consequently other resources and capacity appropriately can solve the problem. This includes bed capacity requirement for both critically ill and less critically ill patients. Classification of ED internal sections based on severity of illness instead of medical specialty is another solution. PMID:26793727

Towards a unified theory of neocortex: laminar cortical circuits for vision and cognition.

PubMed

Grossberg, Stephen

2007-01-01

A key goal of computational neuroscience is to link brain mechanisms to behavioral functions. The present article describes recent progress towards explaining how laminar neocortical circuits give rise to biological intelligence. These circuits embody two new and revolutionary computational paradigms: Complementary Computing and Laminar Computing. Circuit properties include a novel synthesis of feedforward and feedback processing, of digital and analog processing, and of preattentive and attentive processing. This synthesis clarifies the appeal of Bayesian approaches but has a far greater predictive range that naturally extends to self-organizing processes. Examples from vision and cognition are summarized. A LAMINART architecture unifies properties of visual development, learning, perceptual grouping, attention, and 3D vision. A key modeling theme is that the mechanisms which enable development and learning to occur in a stable way imply properties of adult behavior. It is noted how higher-order attentional constraints can influence multiple cortical regions, and how spatial and object attention work together to learn view-invariant object categories. In particular, a form-fitting spatial attentional shroud can allow an emerging view-invariant object category to remain active while multiple view categories are associated with it during sequences of saccadic eye movements. Finally, the chapter summarizes recent work on the LIST PARSE model of cognitive information processing by the laminar circuits of prefrontal cortex. LIST PARSE models the short-term storage of event sequences in working memory, their unitization through learning into sequence, or list, chunks, and their read-out in planned sequential performance that is under volitional control. LIST PARSE provides a laminar embodiment of Item and Order working memories, also called Competitive Queuing models, that have been supported by both psychophysical and neurobiological data. These examples show how variations of a common laminar cortical design can embody properties of visual and cognitive intelligence that seem, at least on the surface, to be mechanistically unrelated.

Turing instability in reaction-diffusion models on complex networks

NASA Astrophysics Data System (ADS)

Ide, Yusuke; Izuhara, Hirofumi; Machida, Takuya

2016-09-01

In this paper, the Turing instability in reaction-diffusion models defined on complex networks is studied. Here, we focus on three types of models which generate complex networks, i.e. the Erdős-Rényi, the Watts-Strogatz, and the threshold network models. From analysis of the Laplacian matrices of graphs generated by these models, we numerically reveal that stable and unstable regions of a homogeneous steady state on the parameter space of two diffusion coefficients completely differ, depending on the network architecture. In addition, we theoretically discuss the stable and unstable regions in the cases of regular enhanced ring lattices which include regular circles, and networks generated by the threshold network model when the number of vertices is large enough.

Incorporating Active Runway Crossings in Airport Departure Scheduling

NASA Technical Reports Server (NTRS)

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

2010-01-01

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

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

NASA Astrophysics Data System (ADS)

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.

A Computer Graphics Human Figure Application Of Biostereometrics

NASA Astrophysics Data System (ADS)

Fetter, William A.

1980-07-01

A study of improved computer graphic representation of the human figure is being conducted under a National Science Foundation grant. Special emphasis is given biostereometrics as a primary data base from which applications requiring a variety of levels of detail may be prepared. For example, a human figure represented by a single point can be very useful in overview plots of a population. A crude ten point figure can be adequate for queuing theory studies and simulated movement of groups. A one hundred point figure can usefully be animated to achieve different overall body activities including male and female figures. A one thousand point figure si-milarly animated, begins to be useful in anthropometrics and kinesiology gross body movements. Extrapolations of this order-of-magnitude approach ultimately should achieve very complex data bases and a program which automatically selects the correct level of detail for the task at hand. See Summary Figure 1.

Human dynamics revealed through Web analytics

NASA Astrophysics Data System (ADS)

Gonçalves, Bruno; Ramasco, José J.

2008-08-01

The increasing ubiquity of Internet access and the frequency with which people interact with it raise the possibility of using the Web to better observe, understand, and monitor several aspects of human social behavior. Web sites with large numbers of frequently returning users are ideal for this task. If these sites belong to companies or universities, their usage patterns can furnish information about the working habits of entire populations. In this work, we analyze the properly anonymized logs detailing the access history to Emory University’s Web site. Emory is a medium-sized university located in Atlanta, Georgia. We find interesting structure in the activity patterns of the domain and study in a systematic way the main forces behind the dynamics of the traffic. In particular, we find that linear preferential linking, priority-based queuing, and the decay of interest for the contents of the pages are the essential ingredients to understand the way users navigate the Web.

Kinefold web server for RNA/DNA folding path and structure prediction including pseudoknots and knots

PubMed Central

Xayaphoummine, A.; Bucher, T.; Isambert, H.

2005-01-01

The Kinefold web server provides a web interface for stochastic folding simulations of nucleic acids on second to minute molecular time scales. Renaturation or co-transcriptional folding paths are simulated at the level of helix formation and dissociation in agreement with the seminal experimental results. Pseudoknots and topologically ‘entangled’ helices (i.e. knots) are efficiently predicted taking into account simple geometrical and topological constraints. To encourage interactivity, simulations launched as immediate jobs are automatically stopped after a few seconds and return adapted recommendations. Users can then choose to continue incomplete simulations using the batch queuing system or go back and modify suggested options in their initial query. Detailed output provide (i) a series of low free energy structures, (ii) an online animated folding path and (iii) a programmable trajectory plot focusing on a few helices of interest to each user. The service can be accessed at . PMID:15980546

Territory inheritance in clownfish.

PubMed Central

Buston, Peter M

2004-01-01

Animal societies composed of breeders and non-breeders present a challenge to evolutionary theory because it is not immediately apparent how natural selection can preserve the genes that underlie non-breeding strategies. The clownfish Amphiprion percula forms groups composed of a breeding pair and 0-4 non-breeders. Non-breeders gain neither present direct, nor present indirect benefits from the association. To determine whether non-breeders obtain future direct benefits, I investigated the pattern of territory inheritance. I show that non-breeders stand to inherit the territory within which they reside. Moreover, they form a perfect queue for breeding positions; a queue from which nobody disperses and within which nobody contests. I suggest that queuing might be favoured by selection because it confers a higher probability of attaining breeding status than either dispersing or contesting. This study illustrates that, within animal societies, individuals may tolerate non-breeding positions solely because of their potential to realize benefits in the future. PMID:15252999

Territory inheritance in clownfish.

PubMed

Buston, Peter M

2004-05-07

Animal societies composed of breeders and non-breeders present a challenge to evolutionary theory because it is not immediately apparent how natural selection can preserve the genes that underlie non-breeding strategies. The clownfish Amphiprion percula forms groups composed of a breeding pair and 0-4 non-breeders. Non-breeders gain neither present direct, nor present indirect benefits from the association. To determine whether non-breeders obtain future direct benefits, I investigated the pattern of territory inheritance. I show that non-breeders stand to inherit the territory within which they reside. Moreover, they form a perfect queue for breeding positions; a queue from which nobody disperses and within which nobody contests. I suggest that queuing might be favoured by selection because it confers a higher probability of attaining breeding status than either dispersing or contesting. This study illustrates that, within animal societies, individuals may tolerate non-breeding positions solely because of their potential to realize benefits in the future.

Factors influencing experience in crowds - The participant perspective.

PubMed

Filingeri, Victoria; Eason, Ken; Waterson, Patrick; Haslam, Roger

2017-03-01

Humans encounter crowd situations on a daily basis, resulting in both negative and positive experiences. Understanding how to optimise the participant experience of crowds is important. In the study presented in this paper, 5 focus groups were conducted (35 participants, age range: 21-71 years) and 55 crowd situations observed (e.g. transport hubs, sport events, retail situations). Influences on participant experience in crowds identified by the focus groups and observations included: physical design of crowd space and facilities (layout, queuing strategies), crowd movement (monitoring capacity, pedestrian flow), communication and information (signage, wayfinding), comfort and welfare (provision of facilities, environmental comfort), and public order. It was found that important aspects affecting participant experience are often not considered systematically in the planning of events or crowd situations. The findings point to human factors aspects of crowds being overlooked, with the experiences of participants often poor. Copyright © 2016. Published by Elsevier Ltd.

Optimizing raid performance with cache

NASA Technical Reports Server (NTRS)

Bouzari, Alex

1994-01-01

We live in a world of increasingly complex applications and operating systems. Information is increasing at a mind-boggling rate. The consolidation of text, voice, and imaging represents an even greater challenge for our information systems. Which forced us to address three important questions: Where do we store all this information? How do we access it? And, how do we protect it against the threat of loss or damage? Introduced in the 1980s, RAID (Redundant Arrays of Independent Disks) represents a cost-effective solution to the needs of the information age. While fulfilling expectations for high storage, and reliability, RAID is sometimes subject to criticisms in the area of performance. However, there are design elements that can significantly enhance performance. They can be subdivided into two areas: (1) RAID levels or basic architecture. And, (2) enhancement schemes such as intelligent caching, support of tagged command queuing, and use of SCSI-2 Fast and Wide features.

Replenishing data descriptors in a DMA injection FIFO buffer

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Cernohous, Bob R [Rochester, MN; Heidelberger, Philip [Cortlandt Manor, NY; Kumar, Sameer [White Plains, NY; Parker, Jeffrey J [Rochester, MN

2011-10-11

Methods, apparatus, and products are disclosed for replenishing data descriptors in a Direct Memory Access (`DMA`) injection first-in-first-out (`FIFO`) buffer that include: determining, by a messaging module on an origin compute node, whether a number of data descriptors in a DMA injection FIFO buffer exceeds a predetermined threshold, each data descriptor specifying an application message for transmission to a target compute node; queuing, by the messaging module, a plurality of new data descriptors in a pending descriptor queue if the number of the data descriptors in the DMA injection FIFO buffer exceeds the predetermined threshold; establishing, by the messaging module, interrupt criteria that specify when to replenish the injection FIFO buffer with the plurality of new data descriptors in the pending descriptor queue; and injecting, by the messaging module, the plurality of new data descriptors into the injection FIFO buffer in dependence upon the interrupt criteria.

An adaptable neural-network model for recursive nonlinear traffic prediction and modeling of MPEG video sources.

PubMed

Doulamis, A D; Doulamis, N D; Kollias, S D

2003-01-01

Multimedia services and especially digital video is expected to be the major traffic component transmitted over communication networks [such as internet protocol (IP)-based networks]. For this reason, traffic characterization and modeling of such services are required for an efficient network operation. The generated models can be used as traffic rate predictors, during the network operation phase (online traffic modeling), or as video generators for estimating the network resources, during the network design phase (offline traffic modeling). In this paper, an adaptable neural-network architecture is proposed covering both cases. The scheme is based on an efficient recursive weight estimation algorithm, which adapts the network response to current conditions. In particular, the algorithm updates the network weights so that 1) the network output, after the adaptation, is approximately equal to current bit rates (current traffic statistics) and 2) a minimal degradation over the obtained network knowledge is provided. It can be shown that the proposed adaptable neural-network architecture simulates a recursive nonlinear autoregressive model (RNAR) similar to the notation used in the linear case. The algorithm presents low computational complexity and high efficiency in tracking traffic rates in contrast to conventional retraining schemes. Furthermore, for the problem of offline traffic modeling, a novel correlation mechanism is proposed for capturing the burstness of the actual MPEG video traffic. The performance of the model is evaluated using several real-life MPEG coded video sources of long duration and compared with other linear/nonlinear techniques used for both cases. The results indicate that the proposed adaptable neural-network architecture presents better performance than other examined techniques.

Investigation of membrane mechanics using spring networks: application to red-blood-cell modelling.

PubMed

Chen, Mingzhu; Boyle, Fergal J

2014-10-01

In recent years a number of red-blood-cell (RBC) models have been proposed using spring networks to represent the RBC membrane. Some results predicted by these models agree well with experimental measurements. However, the suitability of these membrane models has been questioned. The RBC membrane, like a continuum membrane, is mechanically isotropic throughout its surface, but the mechanical properties of a spring network vary on the network surface and change with deformation. In this work spring-network mechanics are investigated in large deformation for the first time via an assessment of the effect of network parameters, i.e. network mesh, spring type and surface constraint. It is found that a spring network is conditionally equivalent to a continuum membrane. In addition, spring networks are employed for RBC modelling to replicate the optical tweezers test. It is found that a spring network is sufficient for modelling the RBC membrane but strain-hardening springs are required. Moreover, the deformation profile of a spring network is presented for the first time via the degree of shear. It is found that spring-network deformation approaches continuous as the mesh density increases. Copyright © 2014 Elsevier B.V. All rights reserved.

A comprehensive probabilistic analysis model of oil pipelines network based on Bayesian network

NASA Astrophysics Data System (ADS)

Zhang, C.; Qin, T. X.; Jiang, B.; Huang, C.

2018-02-01

Oil pipelines network is one of the most important facilities of energy transportation. But oil pipelines network accident may result in serious disasters. Some analysis models for these accidents have been established mainly based on three methods, including event-tree, accident simulation and Bayesian network. Among these methods, Bayesian network is suitable for probabilistic analysis. But not all the important influencing factors are considered and the deployment rule of the factors has not been established. This paper proposed a probabilistic analysis model of oil pipelines network based on Bayesian network. Most of the important influencing factors, including the key environment condition and emergency response are considered in this model. Moreover, the paper also introduces a deployment rule for these factors. The model can be used in probabilistic analysis and sensitive analysis of oil pipelines network accident.

Equity venture capital platform model based on complex network

NASA Astrophysics Data System (ADS)

Guo, Dongwei; Zhang, Lanshu; Liu, Miao

2018-05-01

This paper uses the small-world network and the random-network to simulate the relationship among the investors, construct the network model of the equity venture capital platform to explore the impact of the fraud rate and the bankruptcy rate on the robustness of the network model while observing the impact of the average path length and the average agglomeration coefficient of the investor relationship network on the income of the network model. The study found that the fraud rate and bankruptcy rate exceeded a certain threshold will lead to network collapse; The bankruptcy rate has a great influence on the income of the platform; The risk premium exists, and the average return is better under a certain range of bankruptcy risk; The structure of the investor relationship network has no effect on the income of the investment model.

Modeling geomagnetic induced currents in Australian power networks

NASA Astrophysics Data System (ADS)

Marshall, R. A.; Kelly, A.; Van Der Walt, T.; Honecker, A.; Ong, C.; Mikkelsen, D.; Spierings, A.; Ivanovich, G.; Yoshikawa, A.

2017-07-01

Geomagnetic induced currents (GICs) have been considered an issue for high-latitude power networks for some decades. More recently, GICs have been observed and studied in power networks located in lower latitude regions. This paper presents the results of a model aimed at predicting and understanding the impact of geomagnetic storms on power networks in Australia, with particular focus on the Queensland and Tasmanian networks. The model incorporates a "geoelectric field" determined using a plane wave magnetic field incident on a uniform conducting Earth, and the network model developed by Lehtinen and Pirjola (1985). Model results for two intense geomagnetic storms of solar cycle 24 are compared with transformer neutral monitors at three locations within the Queensland network and one location within the Tasmanian network. The model is then used to assess the impacts of the superintense geomagnetic storm of 29-31 October 2003 on the flow of GICs within these networks. The model results show good correlation with the observations with coefficients ranging from 0.73 to 0.96 across the observing sites. For Queensland, modeled GIC magnitudes during the superstorm of 29-31 October 2003 exceed 40 A with the larger GICs occurring in the south-east section of the network. Modeled GICs in Tasmania for the same storm do not exceed 30 A. The larger distance spans and general east-west alignment of the southern section of the Queensland network, in conjunction with some relatively low branch resistance values, result in larger modeled GICs despite Queensland being a lower latitude network than Tasmania.

Directly executable formal models of middleware for MANET and Cloud Networking and Computing

NASA Astrophysics Data System (ADS)

Pashchenko, D. V.; Sadeq Jaafar, Mustafa; Zinkin, S. A.; Trokoz, D. A.; Pashchenko, T. U.; Sinev, M. P.

2016-04-01

The article considers some “directly executable” formal models that are suitable for the specification of computing and networking in the cloud environment and other networks which are similar to wireless networks MANET. These models can be easily programmed and implemented on computer networks.

A study of the security technology and a new security model for WiFi network

NASA Astrophysics Data System (ADS)

Huang, Jing

2013-07-01

The WiFi network is one of the most rapidly developing wireless communication networks, which makes wireless office and wireless life possible and greatly expands the application form and scope of the internet. At the same time, the WiFi network security has received wide attention, and this is also the key factor of WiFi network development. This paper makes a systematic introduction to the WiFi network and WiFi network security problems, and the WiFi network security technology are reviewed and compared. In order to solve the security problems in WiFi network, this paper presents a new WiFi network security model and the key exchange algorithm. Experiments are performed to test the performance of the model, the results show that the new security model can withstand external network attack and ensure stable and safe operation of WiFi network.

Deterministic ripple-spreading model for complex networks.

PubMed

Hu, Xiao-Bing; Wang, Ming; Leeson, Mark S; Hines, Evor L; Di Paolo, Ezequiel

2011-04-01

This paper proposes a deterministic complex network model, which is inspired by the natural ripple-spreading phenomenon. The motivations and main advantages of the model are the following: (i) The establishment of many real-world networks is a dynamic process, where it is often observed that the influence of a few local events spreads out through nodes, and then largely determines the final network topology. Obviously, this dynamic process involves many spatial and temporal factors. By simulating the natural ripple-spreading process, this paper reports a very natural way to set up a spatial and temporal model for such complex networks. (ii) Existing relevant network models are all stochastic models, i.e., with a given input, they cannot output a unique topology. Differently, the proposed ripple-spreading model can uniquely determine the final network topology, and at the same time, the stochastic feature of complex networks is captured by randomly initializing ripple-spreading related parameters. (iii) The proposed model can use an easily manageable number of ripple-spreading related parameters to precisely describe a network topology, which is more memory efficient when compared with traditional adjacency matrix or similar memory-expensive data structures. (iv) The ripple-spreading model has a very good potential for both extensions and applications.

Resolving Structural Variability in Network Models and the Brain

PubMed Central

Klimm, Florian; Bassett, Danielle S.; Carlson, Jean M.; Mucha, Peter J.

2014-01-01

Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known in general about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar graph metrics, but presented here in a more complete statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus specifically on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling—in addition to several summary statistics, including the mean clustering coefficient, the shortest path-length, and the network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be physically embedded in anatomical brain regions tend to produce distributions that are most similar to the corresponding measurements for the brain. We also find that network models hardcoded to display one network property (e.g., assortativity) do not in general simultaneously display a second (e.g., hierarchy). This relative independence of network properties suggests that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful starting point for the statistical inference of brain network structure from neuroimaging data. PMID:24675546

A Novel BA Complex Network Model on Color Template Matching

PubMed Central

Han, Risheng; Yue, Guangxue; Ding, Hui

2014-01-01

A novel BA complex network model of color space is proposed based on two fundamental rules of BA scale-free network model: growth and preferential attachment. The scale-free characteristic of color space is discovered by analyzing evolving process of template's color distribution. And then the template's BA complex network model can be used to select important color pixels which have much larger effects than other color pixels in matching process. The proposed BA complex network model of color space can be easily integrated into many traditional template matching algorithms, such as SSD based matching and SAD based matching. Experiments show the performance of color template matching results can be improved based on the proposed algorithm. To the best of our knowledge, this is the first study about how to model the color space of images using a proper complex network model and apply the complex network model to template matching. PMID:25243235

A novel BA complex network model on color template matching.

PubMed

Han, Risheng; Shen, Shigen; Yue, Guangxue; Ding, Hui

2014-01-01

A novel BA complex network model of color space is proposed based on two fundamental rules of BA scale-free network model: growth and preferential attachment. The scale-free characteristic of color space is discovered by analyzing evolving process of template's color distribution. And then the template's BA complex network model can be used to select important color pixels which have much larger effects than other color pixels in matching process. The proposed BA complex network model of color space can be easily integrated into many traditional template matching algorithms, such as SSD based matching and SAD based matching. Experiments show the performance of color template matching results can be improved based on the proposed algorithm. To the best of our knowledge, this is the first study about how to model the color space of images using a proper complex network model and apply the complex network model to template matching.

Modeling and Performance Simulation of the Mass Storage Network Environment

NASA Technical Reports Server (NTRS)

Kim, Chan M.; Sang, Janche

2000-01-01

This paper describes the application of modeling and simulation in evaluating and predicting the performance of the mass storage network environment. Network traffic is generated to mimic the realistic pattern of file transfer, electronic mail, and web browsing. The behavior and performance of the mass storage network and a typical client-server Local Area Network (LAN) are investigated by modeling and simulation. Performance characteristics in throughput and delay demonstrate the important role of modeling and simulation in network engineering and capacity planning.

A local structure model for network analysis

DOE PAGES

Casleton, Emily; Nordman, Daniel; Kaiser, Mark

2017-04-01

The statistical analysis of networks is a popular research topic with ever widening applications. Exponential random graph models (ERGMs), which specify a model through interpretable, global network features, are common for this purpose. In this study we introduce a new class of models for network analysis, called local structure graph models (LSGMs). In contrast to an ERGM, a LSGM specifies a network model through local features and allows for an interpretable and controllable local dependence structure. In particular, LSGMs are formulated by a set of full conditional distributions for each network edge, e.g., the probability of edge presence/absence, depending onmore » neighborhoods of other edges. Additional model features are introduced to aid in specification and to help alleviate a common issue (occurring also with ERGMs) of model degeneracy. Finally, the proposed models are demonstrated on a network of tornadoes in Arkansas where a LSGM is shown to perform significantly better than a model without local dependence.« less

A local structure model for network analysis

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

Casleton, Emily; Nordman, Daniel; Kaiser, Mark

The statistical analysis of networks is a popular research topic with ever widening applications. Exponential random graph models (ERGMs), which specify a model through interpretable, global network features, are common for this purpose. In this study we introduce a new class of models for network analysis, called local structure graph models (LSGMs). In contrast to an ERGM, a LSGM specifies a network model through local features and allows for an interpretable and controllable local dependence structure. In particular, LSGMs are formulated by a set of full conditional distributions for each network edge, e.g., the probability of edge presence/absence, depending onmore » neighborhoods of other edges. Additional model features are introduced to aid in specification and to help alleviate a common issue (occurring also with ERGMs) of model degeneracy. Finally, the proposed models are demonstrated on a network of tornadoes in Arkansas where a LSGM is shown to perform significantly better than a model without local dependence.« less

Coevolutionary, coexisting learning and teaching agents model for prisoner’s dilemma games enhancing cooperation with assortative heterogeneous networks

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2013-07-01

Unlike other natural network systems, assortativity can be observed in most human social networks, although it has been reported that a social dilemma situation represented by the prisoner’s dilemma favors dissortativity to enhance cooperation. We established a new coevolutionary model for both agents’ strategy and network topology, where teaching and learning agents coexist. Remarkably, this model enables agents’ enhancing cooperation more than a learners-only model on a time-frozen scale-free network and produces an underlying assortative network with a fair degree of power-law distribution. The model may imply how and why assortative networks are adaptive in human society.

Use of model calibration to achieve high accuracy in analysis of computer networks

DOEpatents

Frogner, Bjorn; Guarro, Sergio; Scharf, Guy

2004-05-11

A system and method are provided for creating a network performance prediction model, and calibrating the prediction model, through application of network load statistical analyses. The method includes characterizing the measured load on the network, which may include background load data obtained over time, and may further include directed load data representative of a transaction-level event. Probabilistic representations of load data are derived to characterize the statistical persistence of the network performance variability and to determine delays throughout the network. The probabilistic representations are applied to the network performance prediction model to adapt the model for accurate prediction of network performance. Certain embodiments of the method and system may be used for analysis of the performance of a distributed application characterized as data packet streams.

Switching performance of OBS network model under prefetched real traffic

NASA Astrophysics Data System (ADS)

Huang, Zhenhua; Xu, Du; Lei, Wen

2005-11-01

Optical Burst Switching (OBS) [1] is now widely considered as an efficient switching technique in building the next generation optical Internet .So it's very important to precisely evaluate the performance of the OBS network model. The performance of the OBS network model is variable in different condition, but the most important thing is that how it works under real traffic load. In the traditional simulation models, uniform traffics are usually generated by simulation software to imitate the data source of the edge node in the OBS network model, and through which the performance of the OBS network is evaluated. Unfortunately, without being simulated by real traffic, the traditional simulation models have several problems and their results are doubtable. To deal with this problem, we present a new simulation model for analysis and performance evaluation of the OBS network, which uses prefetched IP traffic to be data source of the OBS network model. The prefetched IP traffic can be considered as real IP source of the OBS edge node and the OBS network model has the same clock rate with a real OBS system. So it's easy to conclude that this model is closer to the real OBS system than the traditional ones. The simulation results also indicate that this model is more accurate to evaluate the performance of the OBS network system and the results of this model are closer to the actual situation.

Measuring, Understanding, and Responding to Covert Social Networks: Passive and Active Tomography

DTIC Science & Technology

2017-11-11

practical algorithms for sociologically principled detection of small sub- networks. To detect “foreground” networks, we need two competing models...understanding of how to model “background” network clutter, leading to principled approaches to “foreground” sub-network detection. Before the MURI...no frameworks existed for network detection theory or goodness-of-fit, nor were models and algorithms coupled to sound sociological principles

A biologically inspired network design model.

PubMed

Zhang, Xiaoge; Adamatzky, Andrew; Chan, Felix T S; Deng, Yong; Yang, Hai; Yang, Xin-She; Tsompanas, Michail-Antisthenis I; Sirakoulis, Georgios Ch; Mahadevan, Sankaran

2015-06-04

A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould, and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach.

A Biologically Inspired Network Design Model

PubMed Central

Zhang, Xiaoge; Adamatzky, Andrew; Chan, Felix T.S.; Deng, Yong; Yang, Hai; Yang, Xin-She; Tsompanas, Michail-Antisthenis I.; Sirakoulis, Georgios Ch.; Mahadevan, Sankaran

2015-01-01

A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould, and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach. PMID:26041508

Creating, documenting and sharing network models.

PubMed

Crook, Sharon M; Bednar, James A; Berger, Sandra; Cannon, Robert; Davison, Andrew P; Djurfeldt, Mikael; Eppler, Jochen; Kriener, Birgit; Furber, Steve; Graham, Bruce; Plesser, Hans E; Schwabe, Lars; Smith, Leslie; Steuber, Volker; van Albada, Sacha

2012-01-01

As computational neuroscience matures, many simulation environments are available that are useful for neuronal network modeling. However, methods for successfully documenting models for publication and for exchanging models and model components among these projects are still under development. Here we briefly review existing software and applications for network model creation, documentation and exchange. Then we discuss a few of the larger issues facing the field of computational neuroscience regarding network modeling and suggest solutions to some of these problems, concentrating in particular on standardized network model terminology, notation, and descriptions and explicit documentation of model scaling. We hope this will enable and encourage computational neuroscientists to share their models more systematically in the future.

Model of community emergence in weighted social networks

NASA Astrophysics Data System (ADS)

Kumpula, J. M.; Onnela, J.-P.; Saramäki, J.; Kertész, J.; Kaski, K.

2009-04-01

Over the years network theory has proven to be rapidly expanding methodology to investigate various complex systems and it has turned out to give quite unparalleled insight to their structure, function, and response through data analysis, modeling, and simulation. For social systems in particular the network approach has empirically revealed a modular structure due to interplay between the network topology and link weights between network nodes or individuals. This inspired us to develop a simple network model that could catch some salient features of mesoscopic community and macroscopic topology formation during network evolution. Our model is based on two fundamental mechanisms of network sociology for individuals to find new friends, namely cyclic closure and focal closure, which are mimicked by local search-link-reinforcement and random global attachment mechanisms, respectively. In addition we included to the model a node deletion mechanism by removing all its links simultaneously, which corresponds for an individual to depart from the network. Here we describe in detail the implementation of our model algorithm, which was found to be computationally efficient and produce many empirically observed features of large-scale social networks. Thus this model opens a new perspective for studying such collective social phenomena as spreading, structure formation, and evolutionary processes.

A Feasibility Study of Synthesizing Subsurfaces Modeled with Computational Neural Networks

NASA Technical Reports Server (NTRS)

Wang, John T.; Housner, Jerrold M.; Szewczyk, Z. Peter

1998-01-01

This paper investigates the feasibility of synthesizing substructures modeled with computational neural networks. Substructures are modeled individually with computational neural networks and the response of the assembled structure is predicted by synthesizing the neural networks. A superposition approach is applied to synthesize models for statically determinate substructures while an interface displacement collocation approach is used to synthesize statically indeterminate substructure models. Beam and plate substructures along with components of a complicated Next Generation Space Telescope (NGST) model are used in this feasibility study. In this paper, the limitations and difficulties of synthesizing substructures modeled with neural networks are also discussed.

A study of structural properties of gene network graphs for mathematical modeling of integrated mosaic gene networks.

PubMed

Petrovskaya, Olga V; Petrovskiy, Evgeny D; Lavrik, Inna N; Ivanisenko, Vladimir A

2017-04-01

Gene network modeling is one of the widely used approaches in systems biology. It allows for the study of complex genetic systems function, including so-called mosaic gene networks, which consist of functionally interacting subnetworks. We conducted a study of a mosaic gene networks modeling method based on integration of models of gene subnetworks by linear control functionals. An automatic modeling of 10,000 synthetic mosaic gene regulatory networks was carried out using computer experiments on gene knockdowns/knockouts. Structural analysis of graphs of generated mosaic gene regulatory networks has revealed that the most important factor for building accurate integrated mathematical models, among those analyzed in the study, is data on expression of genes corresponding to the vertices with high properties of centrality.

Bayesian Network Webserver: a comprehensive tool for biological network modeling.

PubMed

Ziebarth, Jesse D; Bhattacharya, Anindya; Cui, Yan

2013-11-01

The Bayesian Network Webserver (BNW) is a platform for comprehensive network modeling of systems genetics and other biological datasets. It allows users to quickly and seamlessly upload a dataset, learn the structure of the network model that best explains the data and use the model to understand relationships between network variables. Many datasets, including those used to create genetic network models, contain both discrete (e.g. genotype) and continuous (e.g. gene expression traits) variables, and BNW allows for modeling hybrid datasets. Users of BNW can incorporate prior knowledge during structure learning through an easy-to-use structural constraint interface. After structure learning, users are immediately presented with an interactive network model, which can be used to make testable hypotheses about network relationships. BNW, including a downloadable structure learning package, is available at http://compbio.uthsc.edu/BNW. (The BNW interface for adding structural constraints uses HTML5 features that are not supported by current version of Internet Explorer. We suggest using other browsers (e.g. Google Chrome or Mozilla Firefox) when accessing BNW). ycui2@uthsc.edu. Supplementary data are available at Bioinformatics online.

Robust network data envelopment analysis approach to evaluate the efficiency of regional electricity power networks under uncertainty.

PubMed

Fathollah Bayati, Mohsen; Sadjadi, Seyed Jafar

2017-01-01

In this paper, new Network Data Envelopment Analysis (NDEA) models are developed to evaluate the efficiency of regional electricity power networks. The primary objective of this paper is to consider perturbation in data and develop new NDEA models based on the adaptation of robust optimization methodology. Furthermore, in this paper, the efficiency of the entire networks of electricity power, involving generation, transmission and distribution stages is measured. While DEA has been widely used to evaluate the efficiency of the components of electricity power networks during the past two decades, there is no study to evaluate the efficiency of the electricity power networks as a whole. The proposed models are applied to evaluate the efficiency of 16 regional electricity power networks in Iran and the effect of data uncertainty is also investigated. The results are compared with the traditional network DEA and parametric SFA methods. Validity and verification of the proposed models are also investigated. The preliminary results indicate that the proposed models were more reliable than the traditional Network DEA model.

Robust network data envelopment analysis approach to evaluate the efficiency of regional electricity power networks under uncertainty

PubMed Central

Sadjadi, Seyed Jafar

2017-01-01

In this paper, new Network Data Envelopment Analysis (NDEA) models are developed to evaluate the efficiency of regional electricity power networks. The primary objective of this paper is to consider perturbation in data and develop new NDEA models based on the adaptation of robust optimization methodology. Furthermore, in this paper, the efficiency of the entire networks of electricity power, involving generation, transmission and distribution stages is measured. While DEA has been widely used to evaluate the efficiency of the components of electricity power networks during the past two decades, there is no study to evaluate the efficiency of the electricity power networks as a whole. The proposed models are applied to evaluate the efficiency of 16 regional electricity power networks in Iran and the effect of data uncertainty is also investigated. The results are compared with the traditional network DEA and parametric SFA methods. Validity and verification of the proposed models are also investigated. The preliminary results indicate that the proposed models were more reliable than the traditional Network DEA model. PMID:28953900

Models and algorithm of optimization launch and deployment of virtual network functions in the virtual data center

NASA Astrophysics Data System (ADS)

Bolodurina, I. P.; Parfenov, D. I.

2017-10-01

The goal of our investigation is optimization of network work in virtual data center. The advantage of modern infrastructure virtualization lies in the possibility to use software-defined networks. However, the existing optimization of algorithmic solutions does not take into account specific features working with multiple classes of virtual network functions. The current paper describes models characterizing the basic structures of object of virtual data center. They including: a level distribution model of software-defined infrastructure virtual data center, a generalized model of a virtual network function, a neural network model of the identification of virtual network functions. We also developed an efficient algorithm for the optimization technology of containerization of virtual network functions in virtual data center. We propose an efficient algorithm for placing virtual network functions. In our investigation we also generalize the well renowned heuristic and deterministic algorithms of Karmakar-Karp.

A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks

NASA Astrophysics Data System (ADS)

Yasami, Yasser; Safaei, Farshad

2018-02-01

The traditional complex network theory is particularly focused on network models in which all network constituents are dealt with equivalently, while fail to consider the supplementary information related to the dynamic properties of the network interactions. This is a main constraint leading to incorrect descriptions of some real-world phenomena or incomplete capturing the details of certain real-life problems. To cope with the problem, this paper addresses the multilayer aspects of dynamic complex networks by analyzing the properties of intrinsically multilayered co-authorship networks, DBLP and Astro Physics, and presenting a novel multilayer model of dynamic complex networks. The model examines the layers evolution (layers birth/death process and lifetime) throughout the network evolution. Particularly, this paper models the evolution of each node's membership in different layers by an Infinite Factorial Hidden Markov Model considering feature cascade, and thereby formulates the link generation process for intra-layer and inter-layer links. Although adjacency matrixes are useful to describe the traditional single-layer networks, such a representation is not sufficient to describe and analyze the multilayer dynamic networks. This paper also extends a generalized mathematical infrastructure to address the problems issued by multilayer complex networks. The model inference is performed using some Markov Chain Monte Carlo sampling strategies, given synthetic and real complex networks data. Experimental results indicate a tremendous improvement in the performance of the proposed multilayer model in terms of sensitivity, specificity, positive and negative predictive values, positive and negative likelihood ratios, F1-score, Matthews correlation coefficient, and accuracy for two important applications of missing link prediction and future link forecasting. The experimental results also indicate the strong predictivepower of the proposed model for the application of cascade prediction in terms of accuracy.

Can longitudinal generalized estimating equation models distinguish network influence and homophily? An agent-based modeling approach to measurement characteristics.

PubMed

Sauser Zachrison, Kori; Iwashyna, Theodore J; Gebremariam, Achamyeleh; Hutchins, Meghan; Lee, Joyce M

2016-12-28

Connected individuals (or nodes) in a network are more likely to be similar than two randomly selected nodes due to homophily and/or network influence. Distinguishing between these two influences is an important goal in network analysis, and generalized estimating equation (GEE) analyses of longitudinal dyadic network data are an attractive approach. It is not known to what extent such regressions can accurately extract underlying data generating processes. Therefore our primary objective is to determine to what extent, and under what conditions, does the GEE-approach recreate the actual dynamics in an agent-based model. We generated simulated cohorts with pre-specified network characteristics and attachments in both static and dynamic networks, and we varied the presence of homophily and network influence. We then used statistical regression and examined the GEE model performance in each cohort to determine whether the model was able to detect the presence of homophily and network influence. In cohorts with both static and dynamic networks, we find that the GEE models have excellent sensitivity and reasonable specificity for determining the presence or absence of network influence, but little ability to distinguish whether or not homophily is present. The GEE models are a valuable tool to examine for the presence of network influence in longitudinal data, but are quite limited with respect to homophily.

Trainable Gene Regulation Networks with Applications to Drosophila Pattern Formation

NASA Technical Reports Server (NTRS)

Mjolsness, Eric

2000-01-01

This chapter will very briefly introduce and review some computational experiments in using trainable gene regulation network models to simulate and understand selected episodes in the development of the fruit fly, Drosophila melanogaster. For details the reader is referred to the papers introduced below. It will then introduce a new gene regulation network model which can describe promoter-level substructure in gene regulation. As described in chapter 2, gene regulation may be thought of as a combination of cis-acting regulation by the extended promoter of a gene (including all regulatory sequences) by way of the transcription complex, and of trans-acting regulation by the transcription factor products of other genes. If we simplify the cis-action by using a phenomenological model which can be tuned to data, such as a unit or other small portion of an artificial neural network, then the full transacting interaction between multiple genes during development can be modelled as a larger network which can again be tuned or trained to data. The larger network will in general need to have recurrent (feedback) connections since at least some real gene regulation networks do. This is the basic modeling approach taken, which describes how a set of recurrent neural networks can be used as a modeling language for multiple developmental processes including gene regulation within a single cell, cell-cell communication, and cell division. Such network models have been called "gene circuits", "gene regulation networks", or "genetic regulatory networks", sometimes without distinguishing the models from the actual modeled systems.

Gossip spread in social network Models

NASA Astrophysics Data System (ADS)

Johansson, Tobias

2017-04-01

Gossip almost inevitably arises in real social networks. In this article we investigate the relationship between the number of friends of a person and limits on how far gossip about that person can spread in the network. How far gossip travels in a network depends on two sets of factors: (a) factors determining gossip transmission from one person to the next and (b) factors determining network topology. For a simple model where gossip is spread among people who know the victim it is known that a standard scale-free network model produces a non-monotonic relationship between number of friends and expected relative spread of gossip, a pattern that is also observed in real networks (Lind et al., 2007). Here, we study gossip spread in two social network models (Toivonen et al., 2006; Vázquez, 2003) by exploring the parameter space of both models and fitting them to a real Facebook data set. Both models can produce the non-monotonic relationship of real networks more accurately than a standard scale-free model while also exhibiting more realistic variability in gossip spread. Of the two models, the one given in Vázquez (2003) best captures both the expected values and variability of gossip spread.

Thinking outside the channel: Modeling nitrogen cycling in networked river ecosystems

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

Helton, Ashley; Poole, Geoffrey C.; Meyer, Judy

2011-01-01

Agricultural and urban development alters nitrogen and other biogeochemical cycles in rivers worldwide. Because such biogeochemical processes cannot be measured empirically across whole river networks, simulation models are critical tools for understanding river-network biogeochemistry. However, limitations inherent in current models restrict our ability to simulate biogeochemical dynamics among diverse river networks. We illustrate these limitations using a river-network model to scale up in situ measures of nitrogen cycling in eight catchments spanning various geophysical and land-use conditions. Our model results provide evidence that catchment characteristics typically excluded from models may control river-network biogeochemistry. Based on our findings, we identify importantmore » components of a revised strategy for simulating biogeochemical dynamics in river networks, including approaches to modeling terrestrial-aquatic linkages, hydrologic exchanges between the channel, floodplain/riparian complex, and subsurface waters, and interactions between coupled biogeochemical cycles.« less

Revisiting node-based SIR models in complex networks with degree correlations

NASA Astrophysics Data System (ADS)

Wang, Yi; Cao, Jinde; Alofi, Abdulaziz; AL-Mazrooei, Abdullah; Elaiw, Ahmed

2015-11-01

In this paper, we consider two growing networks which will lead to the degree-degree correlations between two nearest neighbors in the network. When the network grows to some certain size, we introduce an SIR-like disease such as pandemic influenza H1N1/09 to the population. Due to its rapid spread, the population size changes slowly, and thus the disease spreads on correlated networks with approximately fixed size. To predict the disease evolution on correlated networks, we first review two node-based SIR models incorporating degree correlations and an edge-based SIR model without considering degree correlation, and then compare the predictions of these models with stochastic SIR simulations, respectively. We find that the edge-based model, even without considering degree correlations, agrees much better than the node-based models incorporating degree correlations with stochastic SIR simulations in many respects. Moreover, simulation results show that for networks with positive correlation, the edge-based model provides a better upper bound of the cumulative incidence than the node-based SIR models, whereas for networks with negative correlation, it provides a lower bound of the cumulative incidence.

GraphCrunch 2: Software tool for network modeling, alignment and clustering.

PubMed

Kuchaiev, Oleksii; Stevanović, Aleksandar; Hayes, Wayne; Pržulj, Nataša

2011-01-19

Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI) data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL") for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other existing tool. Finally, GraphCruch 2 implements an algorithm for clustering nodes within a network based solely on their topological similarities. Using GraphCrunch 2, we demonstrate that eukaryotic and viral PPI networks may belong to different graph model families and show that topology-based clustering can reveal important functional similarities between proteins within yeast and human PPI networks. GraphCrunch 2 is a software tool that implements the latest research on biological network analysis. It parallelizes computationally intensive tasks to fully utilize the potential of modern multi-core CPUs. It is open-source and freely available for research use. It runs under the Windows and Linux platforms.

Evolutionary model selection and parameter estimation for protein-protein interaction network based on differential evolution algorithm

PubMed Central

Huang, Lei; Liao, Li; Wu, Cathy H.

2016-01-01

Revealing the underlying evolutionary mechanism plays an important role in understanding protein interaction networks in the cell. While many evolutionary models have been proposed, the problem about applying these models to real network data, especially for differentiating which model can better describe evolutionary process for the observed network urgently remains as a challenge. The traditional way is to use a model with presumed parameters to generate a network, and then evaluate the fitness by summary statistics, which however cannot capture the complete network structures information and estimate parameter distribution. In this work we developed a novel method based on Approximate Bayesian Computation and modified Differential Evolution (ABC-DEP) that is capable of conducting model selection and parameter estimation simultaneously and detecting the underlying evolutionary mechanisms more accurately. We tested our method for its power in differentiating models and estimating parameters on the simulated data and found significant improvement in performance benchmark, as compared with a previous method. We further applied our method to real data of protein interaction networks in human and yeast. Our results show Duplication Attachment model as the predominant evolutionary mechanism for human PPI networks and Scale-Free model as the predominant mechanism for yeast PPI networks. PMID:26357273

A last updating evolution model for online social networks

NASA Astrophysics Data System (ADS)

Bu, Zhan; Xia, Zhengyou; Wang, Jiandong; Zhang, Chengcui

2013-05-01

As information technology has advanced, people are turning to electronic media more frequently for communication, and social relationships are increasingly found on online channels. However, there is very limited knowledge about the actual evolution of the online social networks. In this paper, we propose and study a novel evolution network model with the new concept of “last updating time”, which exists in many real-life online social networks. The last updating evolution network model can maintain the robustness of scale-free networks and can improve the network reliance against intentional attacks. What is more, we also found that it has the “small-world effect”, which is the inherent property of most social networks. Simulation experiment based on this model show that the results and the real-life data are consistent, which means that our model is valid.

Temporal efficiency evaluation and small-worldness characterization in temporal networks

PubMed Central

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-01-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks. PMID:27682314

Temporal efficiency evaluation and small-worldness characterization in temporal networks

NASA Astrophysics Data System (ADS)

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-09-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks.

Evolving Scale-Free Networks by Poisson Process: Modeling and Degree Distribution.

PubMed

Feng, Minyu; Qu, Hong; Yi, Zhang; Xie, Xiurui; Kurths, Jurgen

2016-05-01

Since the great mathematician Leonhard Euler initiated the study of graph theory, the network has been one of the most significant research subject in multidisciplinary. In recent years, the proposition of the small-world and scale-free properties of complex networks in statistical physics made the network science intriguing again for many researchers. One of the challenges of the network science is to propose rational models for complex networks. In this paper, in order to reveal the influence of the vertex generating mechanism of complex networks, we propose three novel models based on the homogeneous Poisson, nonhomogeneous Poisson and birth death process, respectively, which can be regarded as typical scale-free networks and utilized to simulate practical networks. The degree distribution and exponent are analyzed and explained in mathematics by different approaches. In the simulation, we display the modeling process, the degree distribution of empirical data by statistical methods, and reliability of proposed networks, results show our models follow the features of typical complex networks. Finally, some future challenges for complex systems are discussed.

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long

2012-03-01

A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

SEIR Model of Rumor Spreading in Online Social Network with Varying Total Population Size

NASA Astrophysics Data System (ADS)

Dong, Suyalatu; Deng, Yan-Bin; Huang, Yong-Chang

2017-10-01

Based on the infectious disease model with disease latency, this paper proposes a new model for the rumor spreading process in online social network. In this paper what we establish an SEIR rumor spreading model to describe the online social network with varying total number of users and user deactivation rate. We calculate the exact equilibrium points and reproduction number for this model. Furthermore, we perform the rumor spreading process in the online social network with increasing population size based on the original real world Facebook network. The simulation results indicate that the SEIR model of rumor spreading in online social network with changing total number of users can accurately reveal the inherent characteristics of rumor spreading process in online social network. Supported by National Natural Science Foundation of China under Grant Nos. 11275017 and 11173028

Neural network modelling of the influence of channelopathies on reflex visual attention.

PubMed

Gravier, Alexandre; Quek, Chai; Duch, Włodzisław; Wahab, Abdul; Gravier-Rymaszewska, Joanna

2016-02-01

This paper introduces a model of Emergent Visual Attention in presence of calcium channelopathy (EVAC). By modelling channelopathy, EVAC constitutes an effort towards identifying the possible causes of autism. The network structure embodies the dual pathways model of cortical processing of visual input, with reflex attention as an emergent property of neural interactions. EVAC extends existing work by introducing attention shift in a larger-scale network and applying a phenomenological model of channelopathy. In presence of a distractor, the channelopathic network's rate of failure to shift attention is lower than the control network's, but overall, the control network exhibits a lower classification error rate. The simulation results also show differences in task-relative reaction times between control and channelopathic networks. The attention shift timings inferred from the model are consistent with studies of attention shift in autistic children.

[Study on the automatic parameters identification of water pipe network model].

PubMed

Jia, Hai-Feng; Zhao, Qi-Feng

2010-01-01

Based on the problems analysis on development and application of water pipe network model, the model parameters automatic identification is regarded as a kernel bottleneck of model's application in water supply enterprise. The methodology of water pipe network model parameters automatic identification based on GIS and SCADA database is proposed. Then the kernel algorithm of model parameters automatic identification is studied, RSA (Regionalized Sensitivity Analysis) is used for automatic recognition of sensitive parameters, and MCS (Monte-Carlo Sampling) is used for automatic identification of parameters, the detail technical route based on RSA and MCS is presented. The module of water pipe network model parameters automatic identification is developed. At last, selected a typical water pipe network as a case, the case study on water pipe network model parameters automatic identification is conducted and the satisfied results are achieved.

Towards Reproducible Descriptions of Neuronal Network Models

PubMed Central

Nordlie, Eilen; Gewaltig, Marc-Oliver; Plesser, Hans Ekkehard

2009-01-01

Progress in science depends on the effective exchange of ideas among scientists. New ideas can be assessed and criticized in a meaningful manner only if they are formulated precisely. This applies to simulation studies as well as to experiments and theories. But after more than 50 years of neuronal network simulations, we still lack a clear and common understanding of the role of computational models in neuroscience as well as established practices for describing network models in publications. This hinders the critical evaluation of network models as well as their re-use. We analyze here 14 research papers proposing neuronal network models of different complexity and find widely varying approaches to model descriptions, with regard to both the means of description and the ordering and placement of material. We further observe great variation in the graphical representation of networks and the notation used in equations. Based on our observations, we propose a good model description practice, composed of guidelines for the organization of publications, a checklist for model descriptions, templates for tables presenting model structure, and guidelines for diagrams of networks. The main purpose of this good practice is to trigger a debate about the communication of neuronal network models in a manner comprehensible to humans, as opposed to machine-readable model description languages. We believe that the good model description practice proposed here, together with a number of other recent initiatives on data-, model-, and software-sharing, may lead to a deeper and more fruitful exchange of ideas among computational neuroscientists in years to come. We further hope that work on standardized ways of describing—and thinking about—complex neuronal networks will lead the scientific community to a clearer understanding of high-level concepts in network dynamics, and will thus lead to deeper insights into the function of the brain. PMID:19662159

Application of Petri net theory for modelling and validation of the sucrose breakdown pathway in the potato tuber.

PubMed

Koch, Ina; Junker, Björn H; Heiner, Monika

2005-04-01

Because of the complexity of metabolic networks and their regulation, formal modelling is a useful method to improve the understanding of these systems. An essential step in network modelling is to validate the network model. Petri net theory provides algorithms and methods, which can be applied directly to metabolic network modelling and analysis in order to validate the model. The metabolism between sucrose and starch in the potato tuber is of great research interest. Even if the metabolism is one of the best studied in sink organs, it is not yet fully understood. We provide an approach for model validation of metabolic networks using Petri net theory, which we demonstrate for the sucrose breakdown pathway in the potato tuber. We start with hierarchical modelling of the metabolic network as a Petri net and continue with the analysis of qualitative properties of the network. The results characterize the net structure and give insights into the complex net behaviour.

Prediction of relative and absolute permeabilities for gas and water from soil water retention curves using a pore-scale network model

NASA Astrophysics Data System (ADS)

Fischer, Ulrich; Celia, Michael A.

1999-04-01

Functional relationships for unsaturated flow in soils, including those between capillary pressure, saturation, and relative permeabilities, are often described using analytical models based on the bundle-of-tubes concept. These models are often limited by, for example, inherent difficulties in prediction of absolute permeabilities, and in incorporation of a discontinuous nonwetting phase. To overcome these difficulties, an alternative approach may be formulated using pore-scale network models. In this approach, the pore space of the network model is adjusted to match retention data, and absolute and relative permeabilities are then calculated. A new approach that allows more general assignments of pore sizes within the network model provides for greater flexibility to match measured data. This additional flexibility is especially important for simultaneous modeling of main imbibition and drainage branches. Through comparisons between the network model results, analytical model results, and measured data for a variety of both undisturbed and repacked soils, the network model is seen to match capillary pressure-saturation data nearly as well as the analytical model, to predict water phase relative permeabilities equally well, and to predict gas phase relative permeabilities significantly better than the analytical model. The network model also provides very good estimates for intrinsic permeability and thus for absolute permeabilities. Both the network model and the analytical model lost accuracy in predicting relative water permeabilities for soils characterized by a van Genuchten exponent n≲3. Overall, the computational results indicate that reliable predictions of both relative and absolute permeabilities are obtained with the network model when the model matches the capillary pressure-saturation data well. The results also indicate that measured imbibition data are crucial to good predictions of the complete hysteresis loop.

Trust recovery model of Ad Hoc network based on identity authentication scheme

NASA Astrophysics Data System (ADS)

Liu, Jie; Huan, Shuiyuan

2017-05-01

Mobile Ad Hoc network trust model is widely used to solve mobile Ad Hoc network security issues. Aiming at the problem of reducing the network availability caused by the processing of malicious nodes and selfish nodes in mobile Ad Hoc network routing based on trust model, an authentication mechanism based on identity authentication mobile Ad Hoc network is proposed, which uses identity authentication to identify malicious nodes, And trust the recovery of selfish nodes in order to achieve the purpose of reducing network congestion and improving network quality. The simulation results show that the implementation of the mechanism can effectively improve the network availability and security.

Network model of bilateral power markets based on complex networks

NASA Astrophysics Data System (ADS)

Wu, Yang; Liu, Junyong; Li, Furong; Yan, Zhanxin; Zhang, Li

2014-06-01

The bilateral power transaction (BPT) mode becomes a typical market organization with the restructuring of electric power industry, the proper model which could capture its characteristics is in urgent need. However, the model is lacking because of this market organization's complexity. As a promising approach to modeling complex systems, complex networks could provide a sound theoretical framework for developing proper simulation model. In this paper, a complex network model of the BPT market is proposed. In this model, price advantage mechanism is a precondition. Unlike other general commodity transactions, both of the financial layer and the physical layer are considered in the model. Through simulation analysis, the feasibility and validity of the model are verified. At same time, some typical statistical features of BPT network are identified. Namely, the degree distribution follows the power law, the clustering coefficient is low and the average path length is a bit long. Moreover, the topological stability of the BPT network is tested. The results show that the network displays a topological robustness to random market member's failures while it is fragile against deliberate attacks, and the network could resist cascading failure to some extent. These features are helpful for making decisions and risk management in BPT markets.

Modeling and control of magnetorheological fluid dampers using neural networks

NASA Astrophysics Data System (ADS)

Wang, D. H.; Liao, W. H.

2005-02-01

Due to the inherent nonlinear nature of magnetorheological (MR) fluid dampers, one of the challenging aspects for utilizing these devices to achieve high system performance is the development of accurate models and control algorithms that can take advantage of their unique characteristics. In this paper, the direct identification and inverse dynamic modeling for MR fluid dampers using feedforward and recurrent neural networks are studied. The trained direct identification neural network model can be used to predict the damping force of the MR fluid damper on line, on the basis of the dynamic responses across the MR fluid damper and the command voltage, and the inverse dynamic neural network model can be used to generate the command voltage according to the desired damping force through supervised learning. The architectures and the learning methods of the dynamic neural network models and inverse neural network models for MR fluid dampers are presented, and some simulation results are discussed. Finally, the trained neural network models are applied to predict and control the damping force of the MR fluid damper. Moreover, validation methods for the neural network models developed are proposed and used to evaluate their performance. Validation results with different data sets indicate that the proposed direct identification dynamic model using the recurrent neural network can be used to predict the damping force accurately and the inverse identification dynamic model using the recurrent neural network can act as a damper controller to generate the command voltage when the MR fluid damper is used in a semi-active mode.

Earth-Mars Telecommunications and Information Management System (TIMS): Antenna Visibility Determination, Network Simulation, and Management Models

NASA Technical Reports Server (NTRS)

Odubiyi, Jide; Kocur, David; Pino, Nino; Chu, Don

1996-01-01

This report presents the results of our research on Earth-Mars Telecommunications and Information Management System (TIMS) network modeling and unattended network operations. The primary focus of our research is to investigate the feasibility of the TIMS architecture, which links the Earth-based Mars Operations Control Center, Science Data Processing Facility, Mars Network Management Center, and the Deep Space Network of antennae to the relay satellites and other communication network elements based in the Mars region. The investigation was enhanced by developing Build 3 of the TIMS network modeling and simulation model. The results of several 'what-if' scenarios are reported along with reports on upgraded antenna visibility determination software and unattended network management prototype.

Network structure, topology, and dynamics in generalized models of synchronization

NASA Astrophysics Data System (ADS)

Lerman, Kristina; Ghosh, Rumi

2012-08-01

Network structure is a product of both its topology and interactions between its nodes. We explore this claim using the paradigm of distributed synchronization in a network of coupled oscillators. As the network evolves to a global steady state, nodes synchronize in stages, revealing the network's underlying community structure. Traditional models of synchronization assume that interactions between nodes are mediated by a conservative process similar to diffusion. However, social and biological processes are often nonconservative. We propose a model of synchronization in a network of oscillators coupled via nonconservative processes. We study the dynamics of synchronization of a synthetic and real-world networks and show that the traditional and nonconservative models of synchronization reveal different structures within the same network.

Wayfinding in Social Networks

NASA Astrophysics Data System (ADS)

Liben-Nowell, David

With the recent explosion of popularity of commercial social-networking sites like Facebook and MySpace, the size of social networks that can be studied scientifically has passed from the scale traditionally studied by sociologists and anthropologists to the scale of networks more typically studied by computer scientists. In this chapter, I will highlight a recent line of computational research into the modeling and analysis of the small-world phenomenon - the observation that typical pairs of people in a social network are connected by very short chains of intermediate friends - and the ability of members of a large social network to collectively find efficient routes to reach individuals in the network. I will survey several recent mathematical models of social networks that account for these phenomena, with an emphasis on both the provable properties of these social-network models and the empirical validation of the models against real large-scale social-network data.

Automatic decomposition of kinetic models of signaling networks minimizing the retroactivity among modules.

PubMed

Saez-Rodriguez, Julio; Gayer, Stefan; Ginkel, Martin; Gilles, Ernst Dieter

2008-08-15

The modularity of biochemical networks in general, and signaling networks in particular, has been extensively studied over the past few years. It has been proposed to be a useful property to analyze signaling networks: by decomposing the network into subsystems, more manageable units are obtained that are easier to analyze. While many powerful algorithms are available to identify modules in protein interaction networks, less attention has been paid to signaling networks de.ned as chemical systems. Such a decomposition would be very useful as most quantitative models are de.ned using the latter, more detailed formalism. Here, we introduce a novel method to decompose biochemical networks into modules so that the bidirectional (retroactive) couplings among the modules are minimized. Our approach adapts a method to detect community structures, and applies it to the so-called retroactivity matrix that characterizes the couplings of the network. Only the structure of the network, e.g. in SBML format, is required. Furthermore, the modularized models can be loaded into ProMoT, a modeling tool which supports modular modeling. This allows visualization of the models, exploiting their modularity and easy generation of models of one or several modules for further analysis. The method is applied to several relevant cases, including an entangled model of the EGF-induced MAPK cascade and a comprehensive model of EGF signaling, demonstrating its ability to uncover meaningful modules. Our approach can thus help to analyze large networks, especially when little a priori knowledge on the structure of the network is available. The decomposition algorithms implemented in MATLAB (Mathworks, Inc.) are freely available upon request. ProMoT is freely available at http://www.mpi-magdeburg.mpg.de/projects/promot. Supplementary data are available at Bioinformatics online.

Development of a pore network simulation model to study nonaqueous phase liquid dissolution

USGS Publications Warehouse

Dillard, Leslie A.; Blunt, Martin J.

2000-01-01

A pore network simulation model was developed to investigate the fundamental physics of nonequilibrium nonaqueous phase liquid (NAPL) dissolution. The network model is a lattice of cubic chambers and rectangular tubes that represent pore bodies and pore throats, respectively. Experimental data obtained by Powers [1992] were used to develop and validate the model. To ensure the network model was representative of a real porous medium, the pore size distribution of the network was calibrated by matching simulated and experimental drainage and imbibition capillary pressure‐saturation curves. The predicted network residual styrene blob‐size distribution was nearly identical to the observed distribution. The network model reproduced the observed hydraulic conductivity and produced relative permeability curves that were representative of a poorly consolidated sand. Aqueous‐phase transport was represented by applying the equation for solute flux to the network tubes and solving for solute concentrations in the network chambers. Complete mixing was found to be an appropriate approximation for calculation of chamber concentrations. Mass transfer from NAPL blobs was represented using a corner diffusion model. Predicted results of solute concentration versus Peclet number and of modified Sherwood number versus Peclet number for the network model compare favorably with experimental data for the case in which NAPL blob dissolution was negligible. Predicted results of normalized effluent concentration versus pore volume for the network were similar to the experimental data for the case in which NAPL blob dissolution occurred with time.

A subjective supply-demand model: the maximum Boltzmann/Shannon entropy solution

NASA Astrophysics Data System (ADS)

Piotrowski, Edward W.; Sładkowski, Jan

2009-03-01

The present authors have put forward a projective geometry model of rational trading. The expected (mean) value of the time that is necessary to strike a deal and the profit strongly depend on the strategies adopted. A frequent trader often prefers maximal profit intensity to the maximization of profit resulting from a separate transaction because the gross profit/income is the adopted/recommended benchmark. To investigate activities that have different periods of duration we define, following the queuing theory, the profit intensity as a measure of this economic category. The profit intensity in repeated trading has a unique property of attaining its maximum at a fixed point regardless of the shape of demand curves for a wide class of probability distributions of random reverse transactions (i.e. closing of the position). These conclusions remain valid for an analogous model based on supply analysis. This type of market game is often considered in research aiming at finding an algorithm that maximizes profit of a trader who negotiates prices with the Rest of the World (a collective opponent), possessing a definite and objective supply profile. Such idealization neglects the sometimes important influence of an individual trader on the demand/supply profile of the Rest of the World and in extreme cases questions the very idea of demand/supply profile. Therefore we put forward a trading model in which the demand/supply profile of the Rest of the World induces the (rational) trader to (subjectively) presume that he/she lacks (almost) all knowledge concerning the market but his/her average frequency of trade. This point of view introduces maximum entropy principles into the model and broadens the range of economic phenomena that can be perceived as a sort of thermodynamical system. As a consequence, the profit intensity has a fixed point with an astonishing connection with Fibonacci classical works and looking for the quickest algorithm for obtaining the extremum of a convex function: the profit intensity reaches its maximum when the probability of transaction is given by the golden ratio rule (\\sqrt {5}-1)/{2} . This condition sets a sharp criterion of validity of the model and can be tested with real market data.

Empirical evaluation of decision support systems: Needs, definitions, potential methods, and an example pertaining to waterfowl management

USGS Publications Warehouse

Sojda, R.S.

2007-01-01

Decision support systems are often not empirically evaluated, especially the underlying modelling components. This can be attributed to such systems necessarily being designed to handle complex and poorly structured problems and decision making. Nonetheless, evaluation is critical and should be focused on empirical testing whenever possible. Verification and validation, in combination, comprise such evaluation. Verification is ensuring that the system is internally complete, coherent, and logical from a modelling and programming perspective. Validation is examining whether the system is realistic and useful to the user or decision maker, and should answer the question: “Was the system successful at addressing its intended purpose?” A rich literature exists on verification and validation of expert systems and other artificial intelligence methods; however, no single evaluation methodology has emerged as preeminent. At least five approaches to validation are feasible. First, under some conditions, decision support system performance can be tested against a preselected gold standard. Second, real-time and historic data sets can be used for comparison with simulated output. Third, panels of experts can be judiciously used, but often are not an option in some ecological domains. Fourth, sensitivity analysis of system outputs in relation to inputs can be informative. Fifth, when validation of a complete system is impossible, examining major components can be substituted, recognizing the potential pitfalls. I provide an example of evaluation of a decision support system for trumpeter swan (Cygnus buccinator) management that I developed using interacting intelligent agents, expert systems, and a queuing system. Predicted swan distributions over a 13-year period were assessed against observed numbers. Population survey numbers and banding (ringing) studies may provide long term data useful in empirical evaluation of decision support.

On-demand Simulation of Atmospheric Transport Processes on the AlpEnDAC Cloud

NASA Astrophysics Data System (ADS)

Hachinger, S.; Harsch, C.; Meyer-Arnek, J.; Frank, A.; Heller, H.; Giemsa, E.

2016-12-01

The "Alpine Environmental Data Analysis Centre" (AlpEnDAC) develops a data-analysis platform for high-altitude research facilities within the "Virtual Alpine Observatory" project (VAO). This platform, with its web portal, will support use cases going much beyond data management: On user request, the data are augmented with "on-demand" simulation results, such as air-parcel trajectories for tracing down the source of pollutants when they appear in high concentration. The respective back-end mechanism uses the Compute Cloud of the Leibniz Supercomputing Centre (LRZ) to transparently calculate results requested by the user, as far as they have not yet been stored in AlpEnDAC. The queuing-system operation model common in supercomputing is replaced by a model in which Virtual Machines (VMs) on the cloud are automatically created/destroyed, providing the necessary computing power immediately on demand. From a security point of view, this allows to perform simulations in a sandbox defined by the VM configuration, without direct access to a computing cluster. Within few minutes, the user receives conveniently visualized results. The AlpEnDAC infrastructure is distributed among two participating institutes [front-end at German Aerospace Centre (DLR), simulation back-end at LRZ], requiring an efficient mechanism for synchronization of measured and augmented data. We discuss our iRODS-based solution for these data-management tasks as well as the general AlpEnDAC framework. Our cloud-based offerings aim at making scientific computing for our users much more convenient and flexible than it has been, and to allow scientists without a broad background in scientific computing to benefit from complex numerical simulations.

Deep hierarchical attention network for video description

NASA Astrophysics Data System (ADS)

Li, Shuohao; Tang, Min; Zhang, Jun

2018-03-01

Pairing video to natural language description remains a challenge in computer vision and machine translation. Inspired by image description, which uses an encoder-decoder model for reducing visual scene into a single sentence, we propose a deep hierarchical attention network for video description. The proposed model uses convolutional neural network (CNN) and bidirectional LSTM network as encoders while a hierarchical attention network is used as the decoder. Compared to encoder-decoder models used in video description, the bidirectional LSTM network can capture the temporal structure among video frames. Moreover, the hierarchical attention network has an advantage over single-layer attention network on global context modeling. To make a fair comparison with other methods, we evaluate the proposed architecture with different types of CNN structures and decoders. Experimental results on the standard datasets show that our model has a more superior performance than the state-of-the-art techniques.

Modeling fluctuations in default-mode brain network using a spiking neural network.

PubMed

Yamanishi, Teruya; Liu, Jian-Qin; Nishimura, Haruhiko

2012-08-01

Recently, numerous attempts have been made to understand the dynamic behavior of complex brain systems using neural network models. The fluctuations in blood-oxygen-level-dependent (BOLD) brain signals at less than 0.1 Hz have been observed by functional magnetic resonance imaging (fMRI) for subjects in a resting state. This phenomenon is referred to as a "default-mode brain network." In this study, we model the default-mode brain network by functionally connecting neural communities composed of spiking neurons in a complex network. Through computational simulations of the model, including transmission delays and complex connectivity, the network dynamics of the neural system and its behavior are discussed. The results show that the power spectrum of the modeled fluctuations in the neuron firing patterns is consistent with the default-mode brain network's BOLD signals when transmission delays, a characteristic property of the brain, have finite values in a given range.

Graph modeling systems and methods

DOEpatents

Neergaard, Mike

2015-10-13

An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.

Epidemic spreading on complex networks with community structures

PubMed Central

Stegehuis, Clara; van der Hofstad, Remco; van Leeuwaarden, Johan S. H.

2016-01-01

Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both enforce as well as inhibit diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities. PMID:27440176

Unified Approach to Modeling and Simulation of Space Communication Networks and Systems

NASA Technical Reports Server (NTRS)

Barritt, Brian; Bhasin, Kul; Eddy, Wesley; Matthews, Seth

2010-01-01

Network simulator software tools are often used to model the behaviors and interactions of applications, protocols, packets, and data links in terrestrial communication networks. Other software tools that model the physics, orbital dynamics, and RF characteristics of space systems have matured to allow for rapid, detailed analysis of space communication links. However, the absence of a unified toolset that integrates the two modeling approaches has encumbered the systems engineers tasked with the design, architecture, and analysis of complex space communication networks and systems. This paper presents the unified approach and describes the motivation, challenges, and our solution - the customization of the network simulator to integrate with astronautical analysis software tools for high-fidelity end-to-end simulation. Keywords space; communication; systems; networking; simulation; modeling; QualNet; STK; integration; space networks

Assessing the Increase in Specific Surface Area for Electrospun Fibrous Network due to Pore Induction.

PubMed

Katsogiannis, Konstantinos Alexandros G; Vladisavljević, Goran T; Georgiadou, Stella; Rahmani, Ramin

2016-10-26

The effect of pore induction on increasing electrospun fibrous network specific surface area was investigated in this study. Theoretical models based on the available surface area of the fibrous network and exclusion of the surface area lost due to fiber-to-fiber contacts were developed. The models for calculation of the excluded area are based on Hertzian, Derjaguin-Muller-Toporov (DMT), and Johnson-Kendall-Roberts (JKR) contact models. Overall, the theoretical models correlated the network specific surface area to the material properties including density, surface tension, Young's modulus, Poisson's ratio, as well as network physical properties, such as density and geometrical characteristics including fiber radius, fiber aspect ratio and network thickness. Pore induction proved to increase the network specific surface area up to 52%, compared to the maximum surface area that could be achieved by nonporous fiber network with the same physical properties and geometrical characteristics. The model based on Johnson-Kendall-Roberts contact model describes accurately the fiber-to-fiber contact area under the experimental conditions used for pore generation. The experimental results and the theoretical model based on Johnson-Kendall-Roberts contact model show that the increase in network surface area due to pore induction can reach to up to 58%.

Learning Data Set Influence on Identification Accuracy of Gas Turbine Neural Network Model

NASA Astrophysics Data System (ADS)

Kuznetsov, A. V.; Makaryants, G. M.

2018-01-01

There are many gas turbine engine identification researches via dynamic neural network models. It should minimize errors between model and real object during identification process. Questions about training data set processing of neural networks are usually missed. This article presents a study about influence of data set type on gas turbine neural network model accuracy. The identification object is thermodynamic model of micro gas turbine engine. The thermodynamic model input signal is the fuel consumption and output signal is the engine rotor rotation frequency. Four types input signals was used for creating training and testing data sets of dynamic neural network models - step, fast, slow and mixed. Four dynamic neural networks were created based on these types of training data sets. Each neural network was tested via four types test data sets. In the result 16 transition processes from four neural networks and four test data sets from analogous solving results of thermodynamic model were compared. The errors comparison was made between all neural network errors in each test data set. In the comparison result it was shown error value ranges of each test data set. It is shown that error values ranges is small therefore the influence of data set types on identification accuracy is low.

Using RDF to Model the Structure and Process of Systems

NASA Astrophysics Data System (ADS)

Rodriguez, Marko A.; Watkins, Jennifer H.; Bollen, Johan; Gershenson, Carlos

Many systems can be described in terms of networks of discrete elements and their various relationships to one another. A semantic network, or multi-relational network, is a directed labeled graph consisting of a heterogeneous set of entities connected by a heterogeneous set of relationships. Semantic networks serve as a promising general-purpose modeling substrate for complex systems. Various standardized formats and tools are now available to support practical, large-scale semantic network models. First, the Resource Description Framework (RDF) offers a standardized semantic network data model that can be further formalized by ontology modeling languages such as RDF Schema (RDFS) and the Web Ontology Language (OWL). Second, the recent introduction of highly performant triple-stores (i.e. semantic network databases) allows semantic network models on the order of 109 edges to be efficiently stored and manipulated. RDF and its related technologies are currently used extensively in the domains of computer science, digital library science, and the biological sciences. This article will provide an introduction to RDF/RDFS/OWL and an examination of its suitability to model discrete element complex systems.

Golden Ratio Genetic Algorithm Based Approach for Modelling and Analysis of the Capacity Expansion of Urban Road Traffic Network

PubMed Central

Zhang, Lun; Zhang, Meng; Yang, Wenchen; Dong, Decun

2015-01-01

This paper presents the modelling and analysis of the capacity expansion of urban road traffic network (ICURTN). Thebilevel programming model is first employed to model the ICURTN, in which the utility of the entire network is maximized with the optimal utility of travelers' route choice. Then, an improved hybrid genetic algorithm integrated with golden ratio (HGAGR) is developed to enhance the local search of simple genetic algorithms, and the proposed capacity expansion model is solved by the combination of the HGAGR and the Frank-Wolfe algorithm. Taking the traditional one-way network and bidirectional network as the study case, three numerical calculations are conducted to validate the presented model and algorithm, and the primary influencing factors on extended capacity model are analyzed. The calculation results indicate that capacity expansion of road network is an effective measure to enlarge the capacity of urban road network, especially on the condition of limited construction budget; the average computation time of the HGAGR is 122 seconds, which meets the real-time demand in the evaluation of the road network capacity. PMID:25802512

A Risk Stratification Model for Lung Cancer Based on Gene Coexpression Network and Deep Learning

PubMed Central

2018-01-01

Risk stratification model for lung cancer with gene expression profile is of great interest. Instead of previous models based on individual prognostic genes, we aimed to develop a novel system-level risk stratification model for lung adenocarcinoma based on gene coexpression network. Using multiple microarray, gene coexpression network analysis was performed to identify survival-related networks. A deep learning based risk stratification model was constructed with representative genes of these networks. The model was validated in two test sets. Survival analysis was performed using the output of the model to evaluate whether it could predict patients' survival independent of clinicopathological variables. Five networks were significantly associated with patients' survival. Considering prognostic significance and representativeness, genes of the two survival-related networks were selected for input of the model. The output of the model was significantly associated with patients' survival in two test sets and training set (p < 0.00001, p < 0.0001 and p = 0.02 for training and test sets 1 and 2, resp.). In multivariate analyses, the model was associated with patients' prognosis independent of other clinicopathological features. Our study presents a new perspective on incorporating gene coexpression networks into the gene expression signature and clinical application of deep learning in genomic data science for prognosis prediction. PMID:29581968

Semi-Automated Curation Allows Causal Network Model Building for the Quantification of Age-Dependent Plaque Progression in ApoE-/- Mouse.

PubMed

Szostak, Justyna; Martin, Florian; Talikka, Marja; Peitsch, Manuel C; Hoeng, Julia

2016-01-01

The cellular and molecular mechanisms behind the process of atherosclerotic plaque destabilization are complex, and molecular data from aortic plaques are difficult to interpret. Biological network models may overcome these difficulties and precisely quantify the molecular mechanisms impacted during disease progression. The atherosclerosis plaque destabilization biological network model was constructed with the semiautomated curation pipeline, BELIEF. Cellular and molecular mechanisms promoting plaque destabilization or rupture were captured in the network model. Public transcriptomic data sets were used to demonstrate the specificity of the network model and to capture the different mechanisms that were impacted in ApoE -/- mouse aorta at 6 and 32 weeks. We concluded that network models combined with the network perturbation amplitude algorithm provide a sensitive, quantitative method to follow disease progression at the molecular level. This approach can be used to investigate and quantify molecular mechanisms during plaque progression.

Mixture models with entropy regularization for community detection in networks

NASA Astrophysics Data System (ADS)

Chang, Zhenhai; Yin, Xianjun; Jia, Caiyan; Wang, Xiaoyang

2018-04-01

Community detection is a key exploratory tool in network analysis and has received much attention in recent years. NMM (Newman's mixture model) is one of the best models for exploring a range of network structures including community structure, bipartite and core-periphery structures, etc. However, NMM needs to know the number of communities in advance. Therefore, in this study, we have proposed an entropy regularized mixture model (called EMM), which is capable of inferring the number of communities and identifying network structure contained in a network, simultaneously. In the model, by minimizing the entropy of mixing coefficients of NMM using EM (expectation-maximization) solution, the small clusters contained little information can be discarded step by step. The empirical study on both synthetic networks and real networks has shown that the proposed model EMM is superior to the state-of-the-art methods.

Network bandwidth utilization forecast model on high bandwidth networks

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

Yoo, Wuchert; Sim, Alex

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology,more » our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.« less

Network Bandwidth Utilization Forecast Model on High Bandwidth Network

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

Yoo, Wucherl; Sim, Alex

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology,more » our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.« less

Bifurcations of large networks of two-dimensional integrate and fire neurons.

PubMed

Nicola, Wilten; Campbell, Sue Ann

2013-08-01

Recently, a class of two-dimensional integrate and fire models has been used to faithfully model spiking neurons. This class includes the Izhikevich model, the adaptive exponential integrate and fire model, and the quartic integrate and fire model. The bifurcation types for the individual neurons have been thoroughly analyzed by Touboul (SIAM J Appl Math 68(4):1045-1079, 2008). However, when the models are coupled together to form networks, the networks can display bifurcations that an uncoupled oscillator cannot. For example, the networks can transition from firing with a constant rate to burst firing. This paper introduces a technique to reduce a full network of this class of neurons to a mean field model, in the form of a system of switching ordinary differential equations. The reduction uses population density methods and a quasi-steady state approximation to arrive at the mean field system. Reduced models are derived for networks with different topologies and different model neurons with biologically derived parameters. The mean field equations are able to qualitatively and quantitatively describe the bifurcations that the full networks display. Extensions and higher order approximations are discussed.

Predicting Employee Turnover from Communication Networks.

ERIC Educational Resources Information Center

Feeley, Thomas H.; Barnett, George A.

1997-01-01

Investigates three social network models of employee turnover: a structural equivalence model, a social influence model, and an erosion model. Administers a communication network questionnaire to all 170 employees of an organization. Finds support for all three models of turnover, with the erosion model explaining more of the variance than do the…

Social network models predict movement and connectivity in ecological landscapes

USGS Publications Warehouse

Fletcher, R.J.; Acevedo, M.A.; Reichert, Brian E.; Pias, Kyle E.; Kitchens, W.M.

2011-01-01

Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.

Estimating standard errors in feature network models.

PubMed

Frank, Laurence E; Heiser, Willem J

2007-05-01

Feature network models are graphical structures that represent proximity data in a discrete space while using the same formalism that is the basis of least squares methods employed in multidimensional scaling. Existing methods to derive a network model from empirical data only give the best-fitting network and yield no standard errors for the parameter estimates. The additivity properties of networks make it possible to consider the model as a univariate (multiple) linear regression problem with positivity restrictions on the parameters. In the present study, both theoretical and empirical standard errors are obtained for the constrained regression parameters of a network model with known features. The performance of both types of standard error is evaluated using Monte Carlo techniques.

A growth model for directed complex networks with power-law shape in the out-degree distribution

PubMed Central

Esquivel-Gómez, J.; Stevens-Navarro, E.; Pineda-Rico, U.; Acosta-Elias, J.

2015-01-01

Many growth models have been published to model the behavior of real complex networks. These models are able to reproduce several of the topological properties of such networks. However, in most of these growth models, the number of outgoing links (i.e., out-degree) of nodes added to the network is constant, that is all nodes in the network are born with the same number of outgoing links. In other models, the resultant out-degree distribution decays as a poisson or an exponential distribution. However, it has been found that in real complex networks, the out-degree distribution decays as a power-law. In order to obtain out-degree distribution with power-law behavior some models have been proposed. This work introduces a new model that allows to obtain out-degree distributions that decay as a power-law with an exponent in the range from 0 to 1. PMID:25567141

Software-Enabled Distributed Network Governance: The PopMedNet Experience.

PubMed

Davies, Melanie; Erickson, Kyle; Wyner, Zachary; Malenfant, Jessica; Rosen, Rob; Brown, Jeffrey

2016-01-01

The expanded availability of electronic health information has led to increased interest in distributed health data research networks. The distributed research network model leaves data with and under the control of the data holder. Data holders, network coordinating centers, and researchers have distinct needs and challenges within this model. The concerns of network stakeholders are addressed in the design and governance models of the PopMedNet software platform. PopMedNet features include distributed querying, customizable workflows, and auditing and search capabilities. Its flexible role-based access control system enables the enforcement of varying governance policies. Four case studies describe how PopMedNet is used to enforce network governance models. Trust is an essential component of a distributed research network and must be built before data partners may be willing to participate further. The complexity of the PopMedNet system must be managed as networks grow and new data, analytic methods, and querying approaches are developed. The PopMedNet software platform supports a variety of network structures, governance models, and research activities through customizable features designed to meet the needs of network stakeholders.

Weighted Networks at the Polish Market

NASA Astrophysics Data System (ADS)

Chmiel, A. M.; Sienkiewicz, J.; Suchecki, K.; Hołyst, J. A.

During the last few years various models of networks [1,2] have become a powerful tool for analysis of complex systems in such distant fields as Internet [3], biology [4], social groups [5], ecology [6] and public transport [7]. Modeling behavior of economical agents is a challenging issue that has also been studied from a network point of view. The examples of such studies are models of financial networks [8], supply chains [9, 10], production networks [11], investment networks [12] or collective bank bankrupcies [13, 14]. Relations between different companies have been already analyzed using several methods: as networks of shareholders [15], networks of correlations between stock prices [16] or networks of board directors [17]. In several cases scaling laws for network characteristics have been observed.

NetFlow Dynamics

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

Corbet Jr., Thomas F; Beyeler, Walter E; Vanwestrienen, Dirk

NetFlow Dynamics is a web-accessible analysis environment for simulating dynamic flows of materials on model networks. Performing a simulation requires both the NetFlow Dynamics application and a network model which is a description of the structure of the nodes and edges of a network including the flow capacity of each edge and the storage capacity of each node, and the sources and sinks of the material flowing on the network. NetFlow Dynamics consists of databases for storing network models, algorithms to calculate flows on networks, and a GIS-based graphical interface for performing simulations and viewing simulation results. Simulated flows aremore » dynamic in the sense that flows on each edge of the network and inventories at each node change with time and can be out of equilibrium with boundary conditions. Any number of network models could be simulated using Net Flow Dynamics. To date, the models simulated have been models of petroleum infrastructure. The main model has been the National Transportation Fuels Model (NTFM), a network of U.S. oil fields, transmission pipelines, rail lines, refineries, tank farms, and distribution terminals. NetFlow Dynamics supports two different flow algorithms, the Gradient Flow algorithm and the Inventory Control algorithm, that were developed specifically for the NetFlow Dynamics application. The intent is to add additional algorithms in the future as needed. The ability to select from multiple algorithms is desirable because a single algorithm never covers all analysis needs. The current algorithms use a demand-driven capacity-constrained formulation which means that the algorithms strive to use all available capacity and stored inventory to meet desired flows to sinks, subject to the capacity constraints of each network component. The current flow algorithms are best suited for problems in which a material flows on a capacity-constrained network representing a supply chain in which the material supplied can be stored at each node of the network. In the petroleum models, the flowing materials are crude oil and refined products that can be stored at tank farms, refineries, or terminals (i.e. the nodes of the network). Examples of other network models that could be simulated are currency flowing in a financial network, agricultural products moving to market, or natural gas flowing on a pipeline network.« less

3-way Networks: Application of Hypergraphs for Modelling Increased Complexity in Comparative Genomics

DOE PAGES

Weighill, Deborah A.; Jacobson, Daniel A.

2015-03-27

Herein we present and develop the theory of 3-way networks, a type of hypergraph in which each edge models relationships between triplets of objects as opposed to pairs of objects as done by standard network models. We explore approaches of how to prune these 3-way networks, illustrate their utility in comparative genomics and demonstrate how they find relationships which would be missed by standard 2-way network models using a phylogenomic dataset of 211 bacterial genomes.

Modeling of Relation between Transaction Network and Production Activity for Firms

NASA Astrophysics Data System (ADS)

Iino, T.; Iyetomi, H.

Bak et al. [Ricerche Economiche 47 (1993), 3] proposed a self-organizing model for production activity of interacting firms to illustrate how large fluctuations can be triggered by small independent shocks in aggregate economy. This paper develops the original transaction model based on a regular network with layered order flow to accommodate more realistic networks. Simulations in the generalized model so obtained are then carried out for various networks to examine the influence caused by change of the network structure.

3-way Networks: Application of Hypergraphs for Modelling Increased Complexity in Comparative Genomics

PubMed Central

Weighill, Deborah A; Jacobson, Daniel A

2015-01-01

We present and develop the theory of 3-way networks, a type of hypergraph in which each edge models relationships between triplets of objects as opposed to pairs of objects as done by standard network models. We explore approaches of how to prune these 3-way networks, illustrate their utility in comparative genomics and demonstrate how they find relationships which would be missed by standard 2-way network models using a phylogenomic dataset of 211 bacterial genomes. PMID:25815802

Tensor Basis Neural Network v. 1.0 (beta)

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

Ling, Julia; Templeton, Jeremy

This software package can be used to build, train, and test a neural network machine learning model. The neural network architecture is specifically designed to embed tensor invariance properties by enforcing that the model predictions sit on an invariant tensor basis. This neural network architecture can be used in developing constitutive models for applications such as turbulence modeling, materials science, and electromagnetism.

An approximation method for improving dynamic network model fitting.

PubMed

Carnegie, Nicole Bohme; Krivitsky, Pavel N; Hunter, David R; Goodreau, Steven M

There has been a great deal of interest recently in the modeling and simulation of dynamic networks, i.e., networks that change over time. One promising model is the separable temporal exponential-family random graph model (ERGM) of Krivitsky and Handcock, which treats the formation and dissolution of ties in parallel at each time step as independent ERGMs. However, the computational cost of fitting these models can be substantial, particularly for large, sparse networks. Fitting cross-sectional models for observations of a network at a single point in time, while still a non-negligible computational burden, is much easier. This paper examines model fitting when the available data consist of independent measures of cross-sectional network structure and the duration of relationships under the assumption of stationarity. We introduce a simple approximation to the dynamic parameters for sparse networks with relationships of moderate or long duration and show that the approximation method works best in precisely those cases where parameter estimation is most likely to fail-networks with very little change at each time step. We consider a variety of cases: Bernoulli formation and dissolution of ties, independent-tie formation and Bernoulli dissolution, independent-tie formation and dissolution, and dependent-tie formation models.

Hidden Markov models and neural networks for fault detection in dynamic systems

NASA Technical Reports Server (NTRS)

Smyth, Padhraic

1994-01-01

Neural networks plus hidden Markov models (HMM) can provide excellent detection and false alarm rate performance in fault detection applications, as shown in this viewgraph presentation. Modified models allow for novelty detection. Key contributions of neural network models are: (1) excellent nonparametric discrimination capability; (2) a good estimator of posterior state probabilities, even in high dimensions, and thus can be embedded within overall probabilistic model (HMM); and (3) simple to implement compared to other nonparametric models. Neural network/HMM monitoring model is currently being integrated with the new Deep Space Network (DSN) antenna controller software and will be on-line monitoring a new DSN 34-m antenna (DSS-24) by July, 1994.

Dragon pulse information management system (DPIMS): A unique model-based approach to implementing domain agnostic system of systems and behaviors

NASA Astrophysics Data System (ADS)

Anderson, Thomas S.

2016-05-01

The Global Information Network Architecture is an information technology based on Vector Relational Data Modeling, a unique computational paradigm, DoD network certified by USARMY as the Dragon Pulse Informa- tion Management System. This network available modeling environment for modeling models, where models are configured using domain relevant semantics and use network available systems, sensors, databases and services as loosely coupled component objects and are executable applications. Solutions are based on mission tactics, techniques, and procedures and subject matter input. Three recent ARMY use cases are discussed a) ISR SoS. b) Modeling and simulation behavior validation. c) Networked digital library with behaviors.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

PubMed

Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

2014-06-26

A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra

PubMed Central

2014-01-01

Background A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. Results This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. Conclusions The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem. PMID:24965213

Applications of flow-networks to opinion-dynamics

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Kurths, Jürgen

2015-04-01

Networks were successfully applied to describe complex systems, such as brain, climate, processes in society. Recently a socio-physical problem of opinion-dynamics was studied using network techniques. We present the toy-model of opinion-formation based on the physical model of advection-diffusion. We consider spreading of the opinion on the fixed subject, assuming that opinion on society is binary: if person has opinion then the state of the node in the society-network equals 1, if the person doesn't have opinion state of the node equals 0. Opinion can be spread from one person to another if they know each other, or in the network-terminology, if the nodes are connected. We include into the system governed by advection-diffusion equation the external field to model such effects as for instance influence from media. The assumptions for our model can be formulated as the following: 1.the node-states are influenced by the network structure in such a way, that opinion can be spread only between adjacent nodes (the advective term of the opinion-dynamics), 2.the network evolution can have two scenarios: -network topology is not changing with time; -additional links can appear or disappear each time-step with fixed probability which requires adaptive networks properties. Considering these assumptions for our system we obtain the system of equations describing our model-dynamics which corresponds well to other socio-physics models, for instance, the model of the social cohesion and the famous voter-model. We investigate the behavior of the suggested model studying "waiting time" of the system, time to get to the stable state, stability of the model regimes for different values of model parameters and network topology.

A fault-tolerant small world topology control model in ad hoc networks for search and rescue

NASA Astrophysics Data System (ADS)

Tan, Mian; Fang, Ling; Wu, Yue; Zhang, Bo; Chang, Bowen; Holme, Petter; Zhao, Jing

2018-02-01

Due to their self-organized, multi-hop and distributed characteristics, ad hoc networks are useful in search and rescue. Topology control models need to be designed for energy-efficient, robust and fast communication in ad hoc networks. This paper proposes a topology control model which specializes for search and rescue-Compensation Small World-Repeated Game (CSWRG)-which integrates mobility models, constructing small world networks and a game-theoretic approach to the allocation of resources. Simulation results show that our mobility models can enhance the communication performance of the constructed small-world networks. Our strategy, based on repeated game, can suppress selfish behavior and compensate agents that encounter selfish or faulty neighbors. This model could be useful for the design of ad hoc communication networks.

Model Diagnostics for Bayesian Networks

ERIC Educational Resources Information Center

Sinharay, Sandip

2006-01-01

Bayesian networks are frequently used in educational assessments primarily for learning about students' knowledge and skills. There is a lack of works on assessing fit of Bayesian networks. This article employs the posterior predictive model checking method, a popular Bayesian model checking tool, to assess fit of simple Bayesian networks. A…

Elastic Network Models For Biomolecular Dynamics: Theory and Application to Membrane Proteins and Viruses

NASA Astrophysics Data System (ADS)

Lezon, Timothy R.; Shrivastava, Indira H.; Yang, Zheng; Bahar, Ivet

The following sections are included: * Introduction * Theory and Assumptions * Statistical mechanical foundations * Anisotropic network models * Gaussian network model * Rigid block models * Treatment of perturbations * Langevin dynamics * Applications * Membrane proteins * Viruses * Conclusion * References

Non-consensus Opinion Models on Complex Networks

NASA Astrophysics Data System (ADS)

Li, Qian; Braunstein, Lidia A.; Wang, Huijuan; Shao, Jia; Stanley, H. Eugene; Havlin, Shlomo

2013-04-01

Social dynamic opinion models have been widely studied to understand how interactions among individuals cause opinions to evolve. Most opinion models that utilize spin interaction models usually produce a consensus steady state in which only one opinion exists. Because in reality different opinions usually coexist, we focus on non-consensus opinion models in which above a certain threshold two opinions coexist in a stable relationship. We revisit and extend the non-consensus opinion (NCO) model introduced by Shao et al. (Phys. Rev. Lett. 103:01870, 2009). The NCO model in random networks displays a second order phase transition that belongs to regular mean field percolation and is characterized by the appearance (above a certain threshold) of a large spanning cluster of the minority opinion. We generalize the NCO model by adding a weight factor W to each individual's original opinion when determining their future opinion (NCO W model). We find that as W increases the minority opinion holders tend to form stable clusters with a smaller initial minority fraction than in the NCO model. We also revisit another non-consensus opinion model based on the NCO model, the inflexible contrarian opinion (ICO) model (Li et al. in Phys. Rev. E 84:066101, 2011), which introduces inflexible contrarians to model the competition between two opinions in a steady state. Inflexible contrarians are individuals that never change their original opinion but may influence the opinions of others. To place the inflexible contrarians in the ICO model we use two different strategies, random placement and one in which high-degree nodes are targeted. The inflexible contrarians effectively decrease the size of the largest rival-opinion cluster in both strategies, but the effect is more pronounced under the targeted method. All of the above models have previously been explored in terms of a single network, but human communities are usually interconnected, not isolated. Because opinions propagate not only within single networks but also between networks, and because the rules of opinion formation within a network may differ from those between networks, we study here the opinion dynamics in coupled networks. Each network represents a social group or community and the interdependent links joining individuals from different networks may be social ties that are unusually strong, e.g., married couples. We apply the non-consensus opinion (NCO) rule on each individual network and the global majority rule on interdependent pairs such that two interdependent agents with different opinions will, due to the influence of mass media, follow the majority opinion of the entire population. The opinion interactions within each network and the interdependent links across networks interlace periodically until a steady state is reached. We find that the interdependent links effectively force the system from a second order phase transition, which is characteristic of the NCO model on a single network, to a hybrid phase transition, i.e., a mix of second-order and abrupt jump-like transitions that ultimately becomes, as we increase the percentage of interdependent agents, a pure abrupt transition. We conclude that for the NCO model on coupled networks, interactions through interdependent links could push the non-consensus opinion model to a consensus opinion model, which mimics the reality that increased mass communication causes people to hold opinions that are increasingly similar. We also find that the effect of interdependent links is more pronounced in interdependent scale free networks than in interdependent Erdős Rényi networks.

Optimized planning methodologies of ASON implementation

NASA Astrophysics Data System (ADS)

Zhou, Michael M.; Tamil, Lakshman S.

2005-02-01

Advanced network planning concerns effective network-resource allocation for dynamic and open business environment. Planning methodologies of ASON implementation based on qualitative analysis and mathematical modeling are presented in this paper. The methodology includes method of rationalizing technology and architecture, building network and nodal models, and developing dynamic programming for multi-period deployment. The multi-layered nodal architecture proposed here can accommodate various nodal configurations for a multi-plane optical network and the network modeling presented here computes the required network elements for optimizing resource allocation.

Social inheritance can explain the structure of animal social networks

PubMed Central

Ilany, Amiyaal; Akçay, Erol

2016-01-01

The social network structure of animal populations has major implications for survival, reproductive success, sexual selection and pathogen transmission of individuals. But as of yet, no general theory of social network structure exists that can explain the diversity of social networks observed in nature, and serve as a null model for detecting species and population-specific factors. Here we propose a simple and generally applicable model of social network structure. We consider the emergence of network structure as a result of social inheritance, in which newborns are likely to bond with maternal contacts, and via forming bonds randomly. We compare model output with data from several species, showing that it can generate networks with properties such as those observed in real social systems. Our model demonstrates that important observed properties of social networks, including heritability of network position or assortative associations, can be understood as consequences of social inheritance. PMID:27352101

Dynamic Modeling of Systemic Risk in Financial Networks

NASA Astrophysics Data System (ADS)

Avakian, Adam

Modern financial networks are complicated structures that can contain multiple types of nodes and connections between those nodes. Banks, governments and even individual people weave into an intricate network of debt, risk correlations and many other forms of interconnectedness. We explore multiple types of financial network models with a focus on understanding the dynamics and causes of cascading failures in such systems. In particular, we apply real-world data from multiple sources to these models to better understand real-world financial networks. We use the results of the Federal Reserve "Banking Organization Systemic Risk Report" (FR Y-15), which surveys the largest US banks on their level of interconnectedness, to find relationships between various measures of network connectivity and systemic risk in the US financial sector. This network model is then stress-tested under a number of scenarios to determine systemic risks inherent in the various network structures. We also use detailed historical balance sheet data from the Venezuelan banking system to build a bipartite network model and find relationships between the changing network structure over time and the response of the system to various shocks. We find that the relationship between interconnectedness and systemic risk is highly dependent on the system and model but that it is always a significant one. These models are useful tools that add value to regulators in creating new measurements of systemic risk in financial networks. These models could be used as macroprudential tools for monitoring the health of the entire banking system as a whole rather than only of individual banks.

Attack Vulnerability of Network Controllability

PubMed Central

2016-01-01

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability. PMID:27588941

Attack Vulnerability of Network Controllability.

PubMed

Lu, Zhe-Ming; Li, Xin-Feng

2016-01-01

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability.

Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution.

PubMed

Francis, Andrew; Moulton, Vincent

2018-06-07

Phylogenetic networks are an extension of phylogenetic trees which are used to represent evolutionary histories in which reticulation events (such as recombination and hybridization) have occurred. A central question for such networks is that of identifiability, which essentially asks under what circumstances can we reliably identify the phylogenetic network that gave rise to the observed data? Recently, identifiability results have appeared for networks relative to a model of sequence evolution that generalizes the standard Markov models used for phylogenetic trees. However, these results are quite limited in terms of the complexity of the networks that are considered. In this paper, by introducing an alternative probabilistic model for evolution along a network that is based on some ground-breaking work by Thatte for pedigrees, we are able to obtain an identifiability result for a much larger class of phylogenetic networks (essentially the class of so-called tree-child networks). To prove our main theorem, we derive some new results for identifying tree-child networks combinatorially, and then adapt some techniques developed by Thatte for pedigrees to show that our combinatorial results imply identifiability in the probabilistic setting. We hope that the introduction of our new model for networks could lead to new approaches to reliably construct phylogenetic networks. Copyright © 2018 Elsevier Ltd. All rights reserved.