Angebote zu "Traffic" (11 Treffer)

Kategorien

Shops

Gerlough, Daniel L.: Use of Poisson Distributio...
14,39 € *
ggf. zzgl. Versand

Erscheinungsdatum: 07.10.2018, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: Use of Poisson Distribution in Highway Traffic, Titelzusatz: The Probability Theory Applied to Distribution of Vehicles on Two-Lane Highways (Classic Reprint), Autor: Gerlough, Daniel L., Verlag: Forgotten Books, Sprache: Englisch, Schlagworte: MATHEMATICS // Probability & Statistics // General, Rubrik: Mathematik // Wahrscheinlichkeitstheorie, Seiten: 82, Informationen: 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam, Gewicht: 123 gr, Verkäufer: averdo

Anbieter: averdo
Stand: 04.04.2020
Zum Angebot
Performance Evaluation of Internet Router and S...
49,90 € *
ggf. zzgl. Versand

Seminal studies on the network traffic, revealed the certain statistical property (self-similar nature) of network traffic, and how they degrades the network performance. Markovian models are well recognized as the appropriate self-similar traffic models. Markovian arrival process (MAP) has been proposed to emulate self similarity over the desired time-scales. Markov modulated Poisson process (MMPP) a particular case of MMPP emulating self-similar traffc over different time scale is fitted by several authors using second order statistics. The two state Circulant Markov modulated Poisson process which is restricted version of two state MMPP. The CMMPP emulating self-similar traffic is fitted by equating the variance. The mean waiting time and packet loss behavior are calculated by using the models of CMMPP/M/1 CMMPP/M/1/K queuing systems wherein service time is taken to be deterministic exponential distributions. It is clear from the numerical results the time scale do have collision on delay packet loss probability. Loss probability of packets increases if H and Traffic intensity is increase. This type of analysis is useful in dimensioning the router.

Anbieter: Dodax
Stand: 04.04.2020
Zum Angebot
Child Injury
79,00 € *
ggf. zzgl. Versand

Worldwide, injuries are the leading cause of mortality and morbidity in children. However in many parts of the world, especially developing countries, there are scarce data to guide the development of effective interventions and policies to prevent the occurrence of injury in children. To investigate the epidemiology of injury in Palestinian school- children, data on injury mortality and morbidity were analyzed using Poisson and logistic regressions. Firearm missiles, road traffic crashes, falls and drowning were the leading causes of injury mortality in the Palestinian children. Being a boy, being a child at younger age, riding a bike, reporting of health problems by the children and involving in risky taking behaviours were factors that found to be associated with the occurrence of serious injury.

Anbieter: Dodax
Stand: 04.04.2020
Zum Angebot
On Some Aspects of Single Server Queues
49,00 € *
ggf. zzgl. Versand

This study was concerned with some aspects of single server queues where customers arrive singly to receive some kind of service from a server. We discussed in detail the queueing models for different specifications of arrival and service pattern. The emphasis was given on distribution of queue size, waiting time, sojourn time and busy period.A particular queueing model has also been considered in chapter four. In production process, sometimes it is costly to keep the machine on when there are no jobs to be processed. It has been suggested that it could be reasonable to set up a threshold number of jobs after which the machine may be switched on. We also collected primary data from the out door unit of Urology department of Bangabandhu Sheikh Mujib Medical University Hospital to get an idea about the queueing pattern formed there and found that the arrival pattern of patients followed Poisson distribution, interarrival time followed exponential distribution and the service time distribution was also exponential. Some important characteristics of queue such as traffic intensity, expected value of queue length, waiting time, sojourn time, busy period etc. were also computed.

Anbieter: Dodax
Stand: 04.04.2020
Zum Angebot
A STATISTICAL ANALYSIS OF ROAD TRAFFIC ACCIDENT...
68,00 € *
ggf. zzgl. Versand

In the developing world, road traffic accidents are a major cause of death and injury. A statistical analysis was conducted of road accidents and casualties in Bangladesh. This was undertaken in order to assist the policy-makers to take appropriate steps to reduce the road accidents and casualties. Data from Bangladesh government publications were explored, analysed and statistically modelled. An exploration was undertaken using average rates. In addition, annual time series data were investigated using trend lines. ANOVA was conducted using the rates applying mainly non-parametric tests. Finally, modelling of two/ three-way data was conducted using the frequencies applying Poisson regression models. The most significant findings from this research were that pedestrians were highly vulnerable. Cities have higher accident rates than non-cities. National highways are the main venues of accidents. Heavy vehicles as bus and truck are predominantly involved. Implications from this research have been considered and suitable recommendations have been made. This book is of interest to transport planners, civil engineers and those undertaking transport researches in the developing world.

Anbieter: Dodax
Stand: 04.04.2020
Zum Angebot
Utilization
49,00 € *
ggf. zzgl. Versand

High Quality Content by WIKIPEDIA articles! Utilization is a statistical concept (Queueing Theory) as well as a primary business measure for the rental industry.In queueing theory, utilization is the proportion of the system's resources which is used by the traffic which arrives at it. It should be strictly less than one for the system to function well. It is usually represented by the symbol . If rho geq 1 then the queue will continue to grow as time goes on. In the simplest case of an M/M/1 queue (Poisson arrivals and a single Poisson server) then it is given by the mean arrival rate over the mean service rate, that is, rho=frac{lambda}{mu} where is the mean arrival rate and is the mean service rate.

Anbieter: Dodax
Stand: 04.04.2020
Zum Angebot
Probably Not
147,00 CHF *
ggf. zzgl. Versand

An engaging, entertaining, and informative introduction to probability and prediction in our everyday lives Although Probably Not deals with probability and statistics, it is not heavily mathematical and is not filled with complex derivations, proofs, and theoretical problem sets. This book unveils the world of statistics through questions such as what is known based upon the information at hand and what can be expected to happen. While learning essential concepts including 'the confidence factor' and 'random walks,' readers will be entertained and intrigued as they move from chapter to chapter. Moreover, the author provides a foundation of basic principles to guide decision making in almost all facets of life including playing games, developing winning business strategies, and managing personal finances. Much of the book is organized around easy-to-follow examples that address common, everyday issues such as: * How travel time is affected by congestion, driving speed, and traffic lights * Why different gambling casino strategies ultimately offer players no advantage * How to estimate how many different birds of one species are seen on a walk through the woods Seemingly random events-coin flip games, the Central Limit Theorem, binomial distributions and Poisson distributions, Parrando's Paradox, and Benford's Law-are addressed and treated through key concepts and methods in probability. In addition, fun-to-solve problems including 'the shared birthday' and 'the prize behind door number one, two, or three' are found throughout the book, which allow readers to test and practice their new probability skills. Requiring little background knowledge of mathematics, readers will gain a greater understanding of the many daily activities and events that involve random processes and statistics. Combining the mathematics of probability with real-world examples, Probably Not is an ideal reference for practitioners and students who would like to learn more about the role of probability and statistics in everyday decision making.

Anbieter: Orell Fuessli CH
Stand: 04.04.2020
Zum Angebot
Applied Probability- Computer Science: The Inte...
82,99 € *
ggf. zzgl. Versand

Major Speakers.- Networks of Quasi-Reversible Nodes.- Simulation Output Analysis for General State Space Markov Chains.- Models and Problems of Dynamic Memory Allocation.- Probabilistic Analysis of Algorithms.- Point Process Method in Queueing Theory.- Error Minimization in Decomposable Stochastic Models.- Computational Methods for Product Form Queueing Networks: Extended Abstract.- Networks of Queues, I.- Closed Multichain Product Form Queueing Networks with Large Population Sizes.- The Significance of the Decomposition and the Arrival Theorems for the Evaluation of Closed Queueing Networks.- On Computing the Stationary Probability Vector of a Network of Two Coxian Servers.- Performance and Reliability.- Fitting of Software Error and Reliability Models to Field Failure Data.- Performance Evaluation of Voice/Data Queueing Systems.- Probabilistic Aspects of Simulation.- On a Spectral Approach to Simulation Run Length Control.- Generation of Some First-Order Autoregressive Markovian Sequences of Positive Random Variables with Given Marginal Distributions.- Testing for Initialization Bias in the Mean of a Simulation Output Series: Extended Abstract.- Queueing Models in Performance Analysis, I.- Response Time Analysis for Pipelining Jobs in a Tree Network of Processors.- Mean Delays of Individual Streams into a Queue: The ?GII/M/1 Queue.- Probabilistic Models in Performance Analysis of Computer Systems and Communication Networks.- Analysis and Design of Processor Schedules for Real Time Applications.- Modeling Real DASD Configurations.- Bottleneck Determination in Networks of Queues.- Probabilistic Analysis of Algorithms.- On the Average Difference Between the Solutions to Linear and Integer Knapsack Problems.- Volume II Probabilistic Analysis of Databases.- A Log Log N Search Algorithm for Nonuniform Distributions: Extended Abstract.- A Multivariate Statistical Model for Data Base Performance Evaluation.- The Use of Sample Paths in Performance Analysis.- Sample-Path Analysis of Queues.- Computational Methods for Single-Server and Multi-Server Queues With Markovian Input and General Service Times.- The Time for a Round-Trip in a Cycle of Exponential Queues: Extended Abstract.- Computational Aspects of Applied Probability.- Waiting Time Distribution Response to Traffic Surges Via the Laguerre Transform.- Some Computational Aspects of Queueing Network Models.- Algorithmic Analysis of a Dynamic Priority Queue.- Steady-State Algorithmic Analysis of M/M/C Two-Priority Queues with Heterogeneous Rates.- Performance Models of Components of Computer Systems.- Exploiting Seek Overlap.- Analysis of a Scan Service Policy in a Gated Loop System.- Linear Probing and Related Problems.- Comparisons of Service Disciplines in a Queueing System With Delay Dependent Customer Behaviour.- Probabilistic Scheduling.- On the Optimal Order of Stations in Tandem Queues.- Scheduling Stochastic Jobs on Parallel Machines to Minimize Makespan or Flowtime.- An Adaptive-Priority Queue.- Markov Chain Models in Performance Analysis.- The Length of Path for Finite Markov Chains and its Application to Modelling Program Behaviour and Interleaved Memory Systems.- Networks of Queues, II.- The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks.- Stationary Probabilities for Networks of Queues.- A Class of Closed Markovian Queueing Networks: Integral Representations, Asymptotic Expansions, Generalizations: Extended Abstract.- Queueing Models in Performance Analysis, II.- File Placement Using Predictive Queuing Models.- Networks of Work-Conserving Normal Queues.- Product Form Solution for Queueing Networks with Poisson Arrivals and General Service Time Distributions With Finite Means: Extended Abstract.

Anbieter: Thalia AT
Stand: 04.04.2020
Zum Angebot
The M/M/8Service System with Ranked Servers in ...
103,99 € *
ggf. zzgl. Versand

We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant.

Anbieter: Thalia AT
Stand: 04.04.2020
Zum Angebot