Arrival Rate Research Articles

Optimized evaluation of the quality of sensor video internet of things (VIOT) by the integration of big data and artificial intelligence

AbstractThe application of sensor video internet of things technology to large-scale integrated work can significantly improve the working quality of employees. However, the degree of improvement in working quality is still difficult to measure in a systematic, intelligent, stable, and accurate manner. local optimization and adjustment after evaluation are still relatively challenging, To address these issues, the study proposes a method of optimizing the evaluation of sensor video quality through the integration of big data and AI techniques. A large-scale integrated distance education system in the field of education and training with a certain application basis is adopted as a case. Including big data and AI techniques such as integrated intelligent agent modules, recommendation algorithms, and transaction optimization algorithms, a new agent-oriented system design with fast response speed, strong scalability, convenient local optimization, and greater stability is achieved. According to the network topology structure of the distance education system in colleges and universities, this paper uses queuing theory to analyze the system performance of the system. The focus of this paper is the quantitative relationship between system communication intensity ρ, user arrival rate λ, system channel capacity n and system waiting delay, blocking probability, average queue length, system throughput and other important performance indicators. In teaching evaluation, the key factor that affects the quality of classroom teaching, that is, Developing a comprehensive system for evaluating classroom instruction is crucial. By incorporating student feedback, leveraging data mining techniques, and harnessing computer technology, a holistic framework for gathering, analyzing, and generating actionable insights on teaching performance is established. This approach makes the evaluation process more systematic and evidence-based, identifying 12 key elements that influence classroom education standards. In the experimental section, the student assessment data sets I1 and I2 exhibit experimental values (statistics) that significantly exceed the thresholds, with a minimum support of 0.32 and a confidence level of 0.61. Moreover, the Boolean matrix is divided into 90 points. The rule U1Ua ≥ U2 is identified as a subset of {U1U2Ua} within the large item set, signifying a strong association rule. These findings confirm the robustness of the artificial intelligence model proposed in this paper for video quality prediction. The optimized sensor video quality evaluation method not only meets a satisfactory confidence level and matching value but also demonstrates good reliability and relevance in the evaluation criteria.

Energy harvesting using stochastic network calculus for monitoring underwater tunneling applications

Energy harvesting using stochastic network calculus for monitoring underwater tunneling applications

Sustainable Synchronization of Truck Arrival and Yard Crane Scheduling in Container Terminals: An Agent-Based Simulation of Centralized and Decentralized Approaches Considering Carbon Emissions

Background: Container terminal congestion is often measured by the average turnaround time for external trucks. Reducing the average turnaround time can be resolved by controlling the yard crane operation and the arrival times of external trucks (truck appointment system). Because the truck appointment system and yard crane scheduling problem are closely interconnected, this research investigates synchronization between the approaches used in truck appointment systems and yard crane scheduling strategies. Rubber-tired gantry (RTG) operators for yard crane scheduling operations strive to reduce RTG movement time as part of the container retrieval service. However, there is a conflict between individual agent goals. While seeking to minimize truck turnaround time, RTGs may travel long distances, ultimately slowing down the RTG service. Methods: We address a method that balances individual agent goals while also considering the collective objective, thereby minimizing turnaround time. An agent-based simulation is proposed to simulate scenarios for yard crane scheduling strategies and truck appointment system approaches, which are centralized and decentralized. This study explores the combined effects of different yard scheduling strategies and truck appointment procedures on performance indicators. Various configurations of the truck appointment system and yard scheduling strategies are modeled to investigate how those factors affect the average turnaround time, yard crane utilization, and CO2 emissions. Results: At all levels of truck arrival rates, the nearest-truck-first-served (NTFS) scenario tends to provide lower external truck turnaround times than the first-come-first-served (FCFS) and nearest-truck longest-waiting-time first-served (NLFS) scenario. Conclusions: The decentralized truck appointment system (DTAS) generally shows slightly higher efficiency in emission reduction compared with centralized truck appointment system (CTAS), especially at moderate to high truck arrival rates. The decentralized approach of the truck appointment system should be accompanied by the yard scheduling strategy to obtain better performance indicators.

Clipper: Online Joint Client Sampling and Power Allocation for Wireless Federated Learning

Communication overhead is a main bottleneck in federated learning (FL) especially in the wireless environment due to the limited data rate and unstable radio channels. The communication challenge necessitates holistic selection of participating clients that accounts for both the computation needs and communication cost, as well as judicious allocation of the limited transmission resource. Meanwhile, the random unpredictable nature of both the training data samples and the communication channels requires an online optimization approach that adapts to the changing system state over time. In this work, we consider a general framework of online joint client sampling and power allocation for wireless FL under time-varying communication channels. We formulate it as a stochastic network optimization problem that admits a Lyapunov-typed solution approach. This leads to per-training-round subproblems with a special bi-convex structure, which we leverage to propose globally optimal solutions, culminating in a meta algorithm that provides strong performance guarantees. We further study three specific FL problems covering multiple scenarios, namely with IID or non-IID data, whether robustness against data drift is required, and with unbiased or biased client sampling. We derive detailed algorithms for each of these problems. Simulation with standard classification tasks demonstrate that the proposed communication-aware algorithms outperform their counterparts under a wide range of learning and communication scenarios.

Integrating arrival time estimation in truck scheduling: an explorative study in grocery retailing

ABSTRACT This paper studies a new managerial approach that integrates predictive trucks’ estimated time of arrival (ETA) into truck scheduling to deal with the truck arrival time uncertainty. The approach exploits ETA to reschedule trucks by the up-to-date information and aims to minimize the trucks’ waiting time. The approach was applied in a real case. Results quantified the impact of adopting ETA for truck scheduling, also showing how the ETA accuracy and peak truck arrival rate affect the total trucks’ waiting time. The paper enriches both truck scheduling literature, investigating a new managerial approach to deal with truck arrival time uncertainty, which greatly threatens the synchronization of logistics flows, and Industry 4.0 literature, showing how real-time data availability can change traditional decision-making processes. Insights for the approach application are discussed, together with the economic, environmental, and social benefits by supply chain actors (i.e. carriers, warehouse managers, and drivers).

Dynamic Contract Design in the Presence of Double Moral Hazard

We consider a stylized incentive management problem over an infinite time horizon, where the principal hires an agent to provide services to customers. Customers request service in one of two ways: either via an online or a traditional offline channel. The principal does not observe the offline customers’ arrivals, nor does she observe whether the agent exerts (costly) effort that can increase the arrival rate of customers. This creates an opportunity for the agent (i) to divert cash (that is, to under-report the number of offline customers and pocket respective revenues) and also (ii) to shirk (that is, not to exert effort), thus leading to a novel and thus far unexplored double moral hazard problem. To address this problem, we formulate a constrained, continuous-time, stochastic optimal control problem and derive an optimal contract with a simple intuitive structure that includes a payment scheme and a potential termination time of the agent. We enrich the model to allow the principal to either (i) dynamically adjust the prices for the services in both channels or (ii) monitor the agent. Both tools help the principal to alleviate the double moral hazard problem. We derive respective optimal strategies for using those tools that guarantee the highest profits. We show that the worse the agent’s past performance is, the lower the prices should be set and the more the principal should monitor the agent. This paper was accepted by Ilia Tsetlin, behavioral economics and decision analysis. Funding: The work of F. Tian is financially supported by the Hong Kong RGC Funding [RGC General Research Fund 2023/24 17502023], HKU Seed Fund for Basic Research for New Staff (2022), and the HKU Business School Shenzhen Research Institute [SZRI2023-BRF-04]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2022.01169 .

Investigating the average kiloelectron-volt emission of partially observed events in nuclear physics through distance weighted mean based censored control chart.

The average lifespan of particles, a crucial parameter in nuclear physics, is essential for identification purposes. Modern particle detectors excel at recognizing individual radioactive nuclei arrivals and their subsequent decay events. However, challenges arise when matching arrivals with departures, especially when departures are only partially observed. One inefficient approach involves conducting experiments with very low arrival rates to facilitate matching. The kiloelectron-volt E(keV) emission is obtained during this radio active process. This study focuses on the meticulous surveillance of the average keV emission from partially observed events within the domain of nuclear physics. To accomplish this, the methodology employs the statistical approach known as Distance Weighted Mean (DWM), integrated with the application of censored control charts. The utilization of censored control charts allows for the effective management of incomplete data, enabling researchers to make informed decisions despite potential limitations in observation. We propose a DWM based exponentially weighted moving average-cumulative sum (DWM-EC) control chart for monitoring kiloelectron-volt E(keV) data. The proposed charts is developed for Weibull lifetimes under type-I censoring. For the construction of an efficient control charting structure, we employed the conditional median (CM) methods. The goal is to find changes in the mean of Weibull lifetimes with censored data with known and estimated parameter conditions. The performance of the proposed DWM-EC chart is evaluated by the average run length (ARL). Besides a simulation study, a real-life data set on E(keV) related to the alpha decays of 177 Lutetium isotope is also discussed.

Tourism’s Influence on Economic Growth and Environment in Saudi: Present and Future

Reports from the World Tourism Organization indicate that tourism activity has been increasingly booming; this sector is essential for economic growth and may affect the environment. Tourism is one of the key strategic sectors for planned growth in Saudi Arabia’s Vision 2030. This study is designed to evaluate the long-termning association between tourist arrivals, growth domestic product (GDP), and CO2 emissions in the Kingdom of Saudi Arabia (KSA). The data related to these variables were assessed for the period 2010 to 2020. The autoregressive distributed lag (ARDL) bounds results revealed that there are long-established relations between tourist arrivals and growth domestic product and tourist arrivals and CO2 emissions. The dynamic ordinary least squares (DOLS) and fully modified ordinary least squares (FMOLS) model outcomes were compatible with the outcomes of the ARDL model. In reference to the Granger causality test, tourist arrivals cause (affect) the GDP. Such a result confirms the conception that tourism encourages economic growth. No causality runs from tourist arrivals towards CO2 accumulation. This result may reflect the governmental effort to reduce CO2 accumulation and/or to perform tourism activities in a sustainable way. The results predicted that the growth rate of tourist arrivals, GDP, and CO2 accumulation equal 0.0023, 0.048, and 0.0169, respectively, during the forecast period (2021–2030), which appeared to be increasing for tourist arrivals and GDP and decreasing for CO2 accumulation. The study recommended that, to increase economic growth, tourist arrivals should be increased alongside performing tourism activities in a sustainable way. These findings point to the benefits of governance in ensuring effective policies to decarbonize the environment, and policy proposals are put forward accordingly.

A novel method for rapidly simulating X-ray pulsar signals at a spacecraft

This paper addresses the challenges posed by the low photon flux and limited atmospheric penetration capabilities of X-ray pulsar signals, which are further exacerbated by technical, economic, and temporal constraints during in-orbit observations. These challenges result in a lack of continuous and high-fidelity data support for ground-based X-ray pulsar navigation (XPNAV) research and validation. To overcome these obstacles, we propose an innovative method for the efficient and rapid simulation of X-ray pulsar signals as received by spacecraft. Building on the physical process that, although the arrival times of the same pulsar signal differ between the spacecraft and the Solar System Barycenter (SSB), these times can be calibrated to the same phase at the SSB using a timing model, we leverage the relationship between the pulsar signal’s arrival rate at the SSB and its arrival phase. Using the Order Statistical Method (OSM), we directly and effectively generate the arrival phase series of pulsar signals received by the spacecraft, which follow a non-homogeneous Poisson process (NHPP). Subsequently, from these phase series, we derive the arrival time series of spacecraft-received pulsar signals, incorporating multiple physical effects based on a relationship model between arrival time series and phases. This method significantly reduces the required simulation time while maintaining high accuracy, thereby greatly enhancing simulation efficiency. Validation against data from the Rossi X-ray Timing Explorer (RXTE) and the Neutron Star Interior Composition Explorer (NICER) shows that the correlation coefficients between the accumulated profiles of simulated and measured data exceed 0.99. Furthermore, our method reduces the simulation time of high-flux pulsar signals by 25.7%, high spin frequency signals by 40.8%, and long observation duration signals by 25.38% compared to the latest fast simulation techniques, highlighting its advantages in accuracy, speed, and versatility for simulating pulsar signals across varying flux rates, spin frequencies, and observation durations. This approach provides continuous and effective data support for XPNAV research, significantly advancing theoretical and practical developments in the field.

Determining Mean First-Passage Time for Random Walks on Stochastic Uniform Growth Tree Networks

Determining Mean First-Passage Time for Random Walks on Stochastic Uniform Growth Tree Networks

Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels

Two-sample network hypothesis testing is an important inference task with applications across diverse fields such as medicine, neuroscience, and sociology. Many of these testing methodologies operate under the implicit assumption that the vertex correspondence across networks is a priori known. This assumption is often untrue, and the power of the subsequent test can degrade when there are misaligned/label-shuffled vertices across networks. This power loss due to shuffling is theoretically explored in the context of random dot product and stochastic block model networks for a pair of hypothesis tests based on Frobenius norm differences between estimated edge probability matrices or between adjacency matrices. The loss in testing power is further reinforced by numerous simulations and experiments, both in the stochastic block model and in the random dot product graph model, where the power loss across multiple recently proposed tests in the literature is considered. Lastly, the impact that shuffling can have in real-data testing is demonstrated in a pair of examples from neuroscience and from social network analysis.

An Optimal Two-Dimensional Maintenance Policy for Self-Service Systems with Multi-Task Demands and Subject to Competing Sudden and Deterioration-Induced Failures

Self-service systems, such as electric vehicle charging piles (EVCPs), are typically deployed without on-site personnel. While frequent maintenance ensures high service revenue, it also leads to significant maintenance setup costs. Therefore, balancing service revenue and maintenance costs is essential for profit maximization. In this paper, we develop a maintenance policy optimization framework to maximize the profit rate of a fleet of self-service systems. First, we propose a maintenance policy that ensures sufficient functional systems while preventing high corrective maintenance costs. Next, we model the fleet's state transition process and its profit rate by characterizing two unique failure-induced demand-and-system interactions: demand switching and stepwise demand arrival rates, where the demands involve multiple tasks and systems are subject to multiple failure modes with non-constant occurrence rates. We develop a Tabu-search algorithm with random exploration to optimize the maintenance policy. Building on this, we investigate the impacts of key model parameters through a case study of thirteen EVCPs in Hong Kong and draw implications for profit maximization.

To disclose or to conceal? Comparison of different disclosure policies in queues with loss-averse customers

In many service industries, information disclosure about the product can alleviate customers’ loss aversion induced by uncertain product valuation. In this paper, we consider a single-server queueing system in which the manager who privately learns the valuation information discloses the valuation information strategically to loss-averse customers. We investigate the impact of the customers’ loss aversion on the system’s equilibrium arrival rate and the manager’s optimal disclosure policy. We find that loss aversion restrains customers from joining the queue. Surprisingly, we find that there is no one disclosure policy that always prevails over other disclosure policies. Specifically, the full disclosure policy is optimal only when the valuation is large and the degree of loss aversion is moderate. The full non-disclosure policy is optimal when the degree of loss aversion is too large or too small, or the valuation is small. The threshold disclosure policy is optimal when the valuation and the degree of loss aversion are moderate. Furthermore, under the threshold disclosure policy, the increasing degree of loss aversion makes managers be more reluctant to disclose the valuation.

Stochastic network to model the global spreading of respiratory diseases: From SARS-CoV-2 to pathogen X pandemic

Stochastic network to model the global spreading of respiratory diseases: From SARS-CoV-2 to pathogen X pandemic

Predicting Work-in-Process in Semiconductor Packaging Using Neural Networks: Technical Evaluation and Future Applications

This review paper focuses on the application of neural networks in semiconductor packaging, particularly examining how the Back Propagation Neural Network (BPNN) model predicts the work-in-process (WIP) arrival rates at various stages of semiconductor packaging processes. Our study demonstrates that BPNN models effectively forecast WIP quantities at each processing step, aiding production planners in optimizing machine allocation and thus reducing product manufacturing cycles. This paper further explores the potential applications of neural networks in enhancing production efficiency, forecasting capabilities, and process optimization within the semiconductor industry. We discuss the integration of real-time data from manufacturing systems with neural network models to enable more accurate and dynamic production planning. Looking ahead, this paper outlines prospective advancements in neural network applications for semiconductor packaging, emphasizing their role in addressing the challenges of rapidly changing market demands and technological innovations. This review not only underscores the practical implementations of neural networks but also highlights future directions for leveraging these technologies to maintain competitiveness in the fast-evolving semiconductor industry.

Game-based computation offloading and resource allocation in stochastic geometry-modeling vehicular networks

Game-based computation offloading and resource allocation in stochastic geometry-modeling vehicular networks

Utility optimization for computation offloading and splitting in time-varying HAP and LEO satellite integrated MEC networks

To provide ubiquitous and low-latency communication and computation services for remote and disaster areas, high altitude platform (HAP) and low earth orbit (LEO) satellite integrated multi-access edge computing (HLS-MEC) networks have emerged as a promising solution. However, most current studies directly assume that the number of connected satellites is fixed and neglect the modeling of the time-varying multi-satellite computing process. Motivated by this, we establish an M/G/K(t) queuing model to illustrate task computation on satellites. To evaluate the efficiency and quality of computation offloading and splitting, we develop a utility model. This model is defined as a difference between a value function that assesses the trade-offs of task offloading, considering latency reductions and energy savings, and a cost function that quantifies expenses related to latency and energy consumption. After formulating the utility maximization problem, we propose the deep reinforcement learning-based offloading and splitting (DBOS) scheme that can overcome the time-varying uncertainties and high dynamics in the HLS-MEC network. Specifically, the DBOS scheme can learn the best computation offloading and splitting policy to maximize the utility by sensing the number of connected satellites, the distance between the HAP and satellites, the available computing resources, and the task arrival rate. Finally, we evaluate and validate the computational complexity and convergence property of the DBOS scheme. Numerical results show that the DBOS scheme outperforms the other three benchmarks and maximizes the utility under time-varying dynamics.

A Systematic Review of Features Forecasting Patient Arrival Numbers.

Adequate nurse staffing is crucial for quality healthcare, necessitating accurate predictions of patient arrival rates. These forecasts can be determined using supervised machine learning methods. Optimization of machine learning methods is largely about minimizing the prediction error. Existing models primarily utilize data such as historical patient visits, seasonal trends, holidays, and calendars. However, it is unclear what other features reduce the prediction error. Our systematic literature review identifies studies that use supervised machine learning to predict patient arrival numbers using nontemporal features, which are features not based on time or dates. We scrutinized 26 284 studies, eventually focusing on 27 relevant ones. These studies highlight three main feature groups: weather data, internet search and usage data, and data on (social) interaction of groups. Internet data and social interaction data appear particularly promising, with some studies reporting reduced errors by up to 33%. Although weather data are frequently used, its utility is less clear. Other potential data sources, including smartphone and social media data, remain largely unexplored. One reason for this might be potential data privacy challenges. In summary, although patient arrival prediction has become more important in recent years, there are still many questions and opportunities for future research on the features used in this area.

Towards more realistic stochastic modelling of leakage in water distribution systems

ABSTRACT A new stochastic model is developed to predict leak types and sizes in water distribution systems. By linking records of actual failures in water networks with new tools for stochastic modelling, the study provides more accurate estimates of network leakage behaviour. District metered areas (DMAs) have been adopted internationally as best practice for monitoring and controlling leakage, with the infrastructure leakage index (ILI) as the main performance indicator. The leakage exponent (N1), which quantifies the relationship between leakage rate and pressure, is a key parameter in describing DMA leakage behaviour. After analysing thousands of stochastic networks for different combinations of pipe material and ILI, the study found that different pipe materials have distinct leakage exponent distributions. Iron and asbestos cement (AC) pipes display N1 values close to 0.5, polyvinyl chloride (PVC) pipes have the highest N1 values, and polyethylene (PE) lies between PVC and iron/AC. The study further showed that current guidelines linking ILI to N1 for different pipe materials depart substantially from the observed results, indicating that these guidelines may need to be updated. The study provides a tool for more realistic modelling of leakage that offers valuable insights into the behaviour of leakage in different pipe materials.

Exponential stability of stochastic inertial neural networks with generalised piecewise constant argument

This paper investigates the exponential stability of stochastic inertial neural networks (SINNs) with generalised piecewise constant argument. By applying variable substitution, the second-order system is transformed into a first-order system. Subsequently, several sufficient conditions are introduced to ensure the existence of a unique solution. Due to the presence of generalised piecewise constant argument, calculus theory is applied to estimate the dynamic effects of network states in current time and deviation function. The global mean-square exponential stability of SINNs with generalised piecewise constant argument is established using the Lyapunov function method. Finally, two numerical examples are provided to verify the validity of derived theoretical results.