AUTOMATIC TRAIN DOOR PORTAL SYSTEM USING REGULATED STRAIGHT MOTION FORMULAS

The train station is an important facility. However, the services provided to train passengers are still not optimal. There are still several weaknesses, including the arrival and departure processes of trains that still rely on telephone communication with other station staff. Notification of train arrival will be sent by telephone by the officer at the previous station to the destination station. On receiving notification of arrival, station staff will close the train portal. This process can have a weakness, and namely, if there is the officers' negligence, it can cause an accident. This is due to the absence of an automatic operating system on the railroad crossing portals. Because the manual system must use human labour or operators to operate and open the railroad crossing portals, so that operator error or failure of manual operation of the portal can increase the likelihood of a train accident occurring at the crossing portal, the above problems can be overcome by implementing an automatic portal closure system. With an automatic portal system, the portal will automatically close if a train passes through the crossing.

Packet-Level Link Capacity Evaluation for IP Networks

In recent times, with many applications, the IP networks have become the most powerful tool for sharing information. Best-effort IP interconnected networks deliver data according to the available resources, without any assurance of throughput, delay bounds, or reliability requirements. As a result, their performance is highly variable and cannot be guaranteed. In IP networks, ensuring proper link capacity at the packet level is a challenging problem. In this article, a method to evaluate the link capacity of IP networks at the packet level based on a single server delay system with state-dependent arrival and departure processes is suggested. The dependence of the traffic being carried on the queue length and on the defined waiting time is shown. Presented graphic dependencies allow for defined quality of service, namely the probability of packet loss and admissible delays, to determine the carried traffic of the links.

A Generalized Erlang-C Model for the Enhanced Living Environment as a Service (ELEaaS)

In this article, a full-access waiting multi-server queue with a statedependent arrival and departure processes is investigated and suggested for use as a generic traffic model of the novel concept of the Enhanced Living Environment as a Service (ELEaaS). The generalized arrival and service flows with nonlinear state dependence intensities are used. The idea is based on the analytical continuation of the Poisson arrival process and Bernoulli service process, and the classic M/M/n queuing system. Birth and death processes and state-dependent rates are applied. The suggested new queuing system is of a M(g)/M(g)/n/k type (in Kendal notation) with a generalized arrival and departure processes M(g). The input and output intensities depend nonlinearly on the system state with defined parameters - the socalled “peaked factors”. The state probabilities of the system are obtained using the general solution of the birth and death processes. The influence of the peaked factors on the queuing behavior is evaluated showing that state-dependent arrival and service rates may change significantly the characteristics of the queuing system. The simplicity and uniformity in representing both peaked and smooth behavior make this queuing model also attractive for future networks’ analysis and synthesis.

Nonparametric Inference for Queueing Networks of GeomX/G/∞ Queues in Discrete Time

We study nonparametric estimation problems for discrete-time stochastic networks of Geom X /G/∞ queues. We assume that we are only able to observe the external arrival and external departure processes at the nodes over a stretch of time. Based on such incomplete information of the system, we aim to construct estimators for the unknown general service time distributions at the nodes without imposing any parametric condition. We propose two different estimation approaches. The first approach is based on the construction of a so-called sequence of differences, and a crucial relation between the expected number of external departures at a node and specific sojourn time distributions in the network. The second approach directly utilizes the structure of the cross-covariance functions between external arrival and departure processes at the nodes. Both methods lead to deconvolution problems which we solve explicitly. A detailed simulation study illustrates the numerical performances of our estimators and shows their advantages and disadvantages.

Nonparametric Inference for Queueing Networks of GeomX/G/∞ Queues in Discrete Time

We study nonparametric estimation problems for discrete-time stochastic networks of GeomX/G/∞ queues. We assume that we are only able to observe the external arrival and external departure processes at the nodes over a stretch of time. Based on such incomplete information of the system, we aim to construct estimators for the unknown general service time distributions at the nodes without imposing any parametric condition. We propose two different estimation approaches. The first approach is based on the construction of a so-called sequence of differences, and a crucial relation between the expected number of external departures at a node and specific sojourn time distributions in the network. The second approach directly utilizes the structure of the cross-covariance functions between external arrival and departure processes at the nodes. Both methods lead to deconvolution problems which we solve explicitly. A detailed simulation study illustrates the numerical performances of our estimators and shows their advantages and disadvantages.

A Review on Intelligent Distribution for Passenger Service Resources in Airport Terminal Building

Terminals are important resources. They serve as a key role in transportation of people and goods in regional, national, and international commerce. Ensuring scheduled flight security and punctual is a basic requirement of civil aviation. In the premise that existing service resources unchanged, intelligent distribution and dispatch for passenger service resources in airport terminal building is an effective way to solve problems of delays for passengers. To study passenger departure processes in airport terminals, improve their operation, efficiencies, reduce delay, and improve service quality, a research on intelligent distribution for passenger service resources is developed using data integration methods, flow prediction method and intelligent simulation optimization algorithm.