Calculation of queue formation and queue length at airport check-in counters

Constructing the outer crust of the neutron stars requires the knowledge of the Binding Energy (BE) of the atomic nuclei. Although the BE of a lot of the nuclei is experimentally determined and can be obtained from the AME data table, for the others we need to depend on theoretical models. There exist a lot of physical theories to predict the BE, each with its own strengths and weaknesses. In this paper we apply Machine Learning (ML) algorithms on AME2016 data set to predict the Binding Energy of atomic nuclei. The novel feature of our work is that it is model independent. We do not assume or use any nuclear physics model but use only ML algorithms directly on the AME2016 data set. Our results are further refined by using another ML algorithm to train the errors of the first algorithm, and repeating this process iteratively. Our best algorithm gives σrms ∼ 0.58 MeV for Binding Energy on randomized testing sets. This is comparable to all physics models or ML improved physics models studied in literature till date. Using the predictions of our Machine Learning algorithm, we construct the outer crust equation of state (EoS) of a neutron star and show that our model is comparable to existing models. This work also demonstrates the use of various ML algorithms and a detailed analysis on how we arrived at our best algorithm. It will help the physics community in understanding how to choose an ML algorithm which would be suited for their data set. Our algorithms and best fit model is also made publicly available for the use of the community.

Identification of damage in its early stage can have a great contribution in decreasing the maintenance costs and prolonging the life of valuable structures. Although conventional damage detection techniques have a mature background, their widespread application in industrial practice is still missing. In recent years the application of Machine Learning (ML) algorithms have been more and more exploited in structural health monitoring systems (SHM). Because of the superior capabilities of ML approaches in recognizing and classifying available patterns in a dataset, they have demonstrated a significant improvement in traditional damage identification algorithms. This review study focuses on the use of machine learning (ML) approaches in Ultrasonic Guided Wave (UGW)-based SHM, in which a structure is continually monitored using permanent sensors. Accordingly, multiple steps required for performing damage detection through UGWs are stated. Moreover, it is outlined that the employment of ML techniques for UGW-based damage detection can be subtended into two main phases: (1) extracting features from the data set, and reducing the dimension of the data space, (2) processing the patterns for revealing patterns, and classification of instances. With this regard, the most frequent techniques for the realization of those two phases are elaborated. This study shows the great potential of ML algorithms to assist and enhance UGW-based damage detection algorithms.

This paper proposes the Stabilized (DGRED) method for congestion detection at the router buffer. This method aims to stabilize the average queue length between allocated minthre_shold and doublemaxthre_shold positions to increase the network performance. The SDGRED method is simulated and compared with Gentle Random Early Detection (GRED) and Dynamic GRED active queue management methods. This comparison is built on different important measures, such as dropping probability, throughput, average delay, packet loss, and mean queue length for packets. The evaluation aims to identify which method presents better simulation performance measurement results when non-congestion or congestion situations occur at the router buffers in congestion control. The results show that at high packet arrival probability, the proposed algorithm helps provide lesser queue length values, delayed time, and packet loss compared with current methods. Furthermore, SDGRED generates adequate throughput at high packet arrival probability.

We consider the problem of collecting weighted items from a dynamic queue . Before each step, some items at the front of can be deleted and some other items can be added to at any place. An item, once deleted, cannot be re-inserted — in other words, it “expires”. We are allowed to collect one item from per step. Each item can be collected only once. The objective is to maximize the total weight of the collected items. We study the online version of the dynamic queue problem. It is quite easy to see that the greedy algorithm that always collects the maximum-value item is 2-competitive, and that no deterministic online algorithm can be better than 1.618-competitive. We improve both bounds: We give a 1.89-competitive algorithm for general dynamic queues and we show a lower bound of 1.632 on the competitive ratio. We also provide other upper and lower bounds for restricted versions of this problem. The dynamic queue problem is a generalization of the well-studied buffer management problem, and it is an abstraction of the buffer management problem for network links with intermittent access.

The aging and multimorbid population and health personnel shortages pose a substantial burden on primary health care. While predictive machine learning (ML) algorithms have the potential to address these challenges, concerns include transparency and insufficient reporting of model validation and effectiveness of the implementation in the clinical workflow. To systematically identify predictive ML algorithms implemented in primary care from peer-reviewed literature and US Food and Drug Administration (FDA) and Conformité Européene (CE) registration databases and to ascertain the public availability of evidence, including peer-reviewed literature, gray literature, and technical reports across the artificial intelligence (AI) life cycle. PubMed, Embase, Web of Science, Cochrane Library, Emcare, Academic Search Premier, IEEE Xplore, ACM Digital Library, MathSciNet, AAAI.org (Association for the Advancement of Artificial Intelligence), arXiv, Epistemonikos, PsycINFO, and Google Scholar were searched for studies published between January 2000 and July 2023, with search terms that were related to AI, primary care, and implementation. The search extended to CE-marked or FDA-approved predictive ML algorithms obtained from relevant registration databases. Three reviewers gathered subsequent evidence involving strategies such as product searches, exploration of references, manufacturer website visits, and direct inquiries to authors and product owners. The extent to which the evidence for each predictive ML algorithm aligned with the Dutch AI predictive algorithm (AIPA) guideline requirements was assessed per AI life cycle phase, producing evidence availability scores. The systematic search identified 43 predictive ML algorithms, of which 25 were commercially available and CE-marked or FDA-approved. The predictive ML algorithms spanned multiple clinical domains, but most (27 [63%]) focused on cardiovascular diseases and diabetes. Most (35 [81%]) were published within the past 5 years. The availability of evidence varied across different phases of the predictive ML algorithm life cycle, with evidence being reported the least for phase 1 (preparation) and phase 5 (impact assessment) (19% and 30%, respectively). Twelve (28%) predictive ML algorithms achieved approximately half of their maximum individual evidence availability score. Overall, predictive ML algorithms from peer-reviewed literature showed higher evidence availability compared with those from FDA-approved or CE-marked databases (45% vs 29%). The findings indicate an urgent need to improve the availability of evidence regarding the predictive ML algorithms' quality criteria. Adopting the Dutch AIPA guideline could facilitate transparent and consistent reporting of the quality criteria that could foster trust among end users and facilitating large-scale implementation.

Slope stability prediction using integrated metaheuristic and machine learning approaches: A comparative study

Objectives: Language detection is the process of identifying a language associated with a text. The proposed system aims to detect the Dravidian language that is associated with the given text using different machine learning and deep learning algorithms. The paper presents an empirical analysis of the results obtained using the different models. It also aims to evaluate the performance of a language agnostic model for the purpose of language detection. Method: An empirical analysis of Dravidian language identification in social media text using machine learning and deep learning approaches with k-fold cross validation has been implemented. The identification of Dravidian languages, including Tamil, Malayalam, Tamil Code Mix, and Malayalam Code Mix, is performed using both machine learning (ML) and deep learning algorithms. The machine learning algorithms used for language detection are Naive Bayes (NB), Multinomial Logistic Regression (MLR), Support Vector Machine (SVM), and Random Forest (RF). The supervised Deep Learning (DL) models used include BERT, mBERT and language agnostic models. Findings: The language agnostic model outperform all other models considering the task of language detection in Dravidian languages. The results of both the ML and DL models are analyzed empirically with performance measures like accuracy, precision, recall, and f1-score. The accuracy associated with different machine learning algorithms varies from 85% to 89%. It is evident from the experimental result that the deep learning model outperformed with an accuracy of 98%. Novelty: The proposed system emphasizes on the use of the language agnostic model to implement the process of detecting Dravidian languages associated with the given text which provides a promising result of 98% accuracy which is higher than the existing methodologies. Keywords: Language, Machine learning, Deep learning, Transformer model, Encoder, Decoder

It is increasingly clear that machine learning algorithms need to be integrated in an iterative scientific discovery loop, in which data is queried repeatedly by means of inductive queries and where the computer provides guidance to the experiments that are being performed. In this chapter, we summarise several key challenges in achieving this integration of machine learning and data mining algorithms in methods for the discovery of Quantitative Structure Activity Relationships (QSARs). We introduce the concept of a robot scientist, in which all steps of the discovery process are automated; we discuss the representation of molecular data such that knowledge discovery tools can analyse it, and we discuss the adaptation of machine learning and data mining algorithms to guide QSAR experiments.KeywordsInductive Logic ProgrammingData Mining AlgorithmSubgraph IsomorphismOuterplanar GraphGraph MiningThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Several control schemes have been proposed in the past for optimal control of congested intersections but they have not been applied in real life situations partly because of the complex instrumentation required for their application and partly because they do not combine all control objectives at such intersections. Open and closed loop control policies minimizing total intersection delays subject to queue size constraints have also been proposed by the authors. All control policies, however, have the disadvantage that they are based on simple traffic models describing the effective size of the queues rather than the queue lengths. In this paper a new model is presented describing the queue dynamics at signalized intersections as a function of the demands, the intersection characteristics and the control decisions. A control policy combining the results of this model and control principles previously developed by the authors is also proposed.

Differential equation models for Internet congestion control algorithms have been widely used to understand network dynamics and the design of router algorithms. These models use a fluid approximation for user data traffic and describe the dynamics of the router queue and user adaptation through coupled differential equations. The interaction between the routers and flows occurs through marking, where routers indicate congestion by appropriately marking packets during congestion. In this paper, we show that the randomness due to short and unresponsive flows in the Internet is sufficient to decouple the dynamics of the router queues from those of the end controllers. This implies that a time-scale decomposition naturally occurs such that the dynamics of the router manifest only through their statistical steady-state behavior. We show that this time-scale decomposition implies that a queue-length based marking function (e.g., RED-like and REM-like algorithms, which have no queue averaging, but depend only on the instantaneous queue length) has an equivalent form which depends only on the data arrival rate from the end-systems and does not depend on the queue dynamics. This leads to much simpler dynamics of the differential equation models (there is no queueing dynamics to consider), which enables easier analysis and could be potentially used for low-complexity fast simulation. Using packet-based simulations, we study queue-based marking schemes and their equivalent rate-based marking schemes for different types of controlled sources (i.e., proportional fair and TCP) and queue-based marking schemes. Our results indicate a good match in the rates observed at the intermediate router with the queue-based marking function and the corresponding rate-based approximation. Further, the window size distributions of a typical TCP flow with a queue-based marking function as well as the equivalent rate-based marking function match closely, indicating that replacing a queue-based marking function by its equivalent rate-based function does not statistically affect the end host's behavior

This paper combines millimeter-wave radar (MMW) data with connected autonomous vehicle (CAV) trajectory data to estimate queue length on a second-by-second basis. Firstly, queued vehicles on multiple lanes with the same traffic movement are mapped to a virtual lane. Then, the presence of CAV or human-driven vehicle (HDV) for any given queueing index is determined. A Bayesian joint probability model is subsequently established for queue length expectation, considering the existence of the queued vehicle type as a condition. The average time headway and dissipation speed distribution are derived from departure timestamps, which allows for the calculation of the prior probability ratio of queue length. Lastly, the maximum likelihood estimation (EM) algorithm is employed for iteratively estimating the CAV penetration rate. Simulation results demonstrate the method offers a compelling trade-off between precision and second-based real-time performance, while field test results further confirm the wide applicability under various traffic conditions.

This study investigates the factors affecting estimation accuracy of queue length at signalized intersections under low penetration of connected vehicles. A shockwave-based algorithm is proposed to estimate the maximum queue length and residual queue on a cycle-by-cycle basis. Simulation data collected from three consecutive signalized intersections were used to extract trajectories of connected vehicles under five different market penetration rates and two different traffic conditions (under-saturated and moderate). The results confirm that the queue length estimation process is probabilistic and affected by the stochastic changes in traffic conditions. This probabilistic nature is defined by a queue formation coverage index (QI) that proved to significantly affect the queue length estimation accuracy. Overall, the results show that the accuracy of the queue estimates is acceptable when a QI value of at least 50% is achieved. In such limited data environments, the QI showed potential to help as an assessment tool to evaluate the obtained queue estimates.

The advent of mobile devices, wearables and digital healthcare has unleashed a demand for accurate, reliable, and non-interventional ways to measure continuous blood pressure (BP). Many consumer products claim to measure BP with a cuffless device, but their lack of accuracy and reliability limit clinical adoption. Here, we demonstrate how multimodal feature datasets, comprising: (i) pulse arrival time (PAT); (ii) pulse wave morphology (PWM), and (iii) demographic data, can be combined with optimized Machine Learning (ML) algorithms to estimate Systolic BP (SBP), Diastolic BP (DBP) and Mean Arterial Pressure (MAP) within a 5 mmHg bias of the gold standard Intra-Arterial BP, well within the acceptable limits of the IEC/ANSI 80601-2-30 (2018) standard. Furthermore, DBP’s calculated using 126 datasets collected from 31 hemodynamically compromised patients had a standard deviation within 8 mmHg, while SBP’s and MAP’s exceeded these limits. Using ANOVA and Levene’s test for error means and standard deviations, we found significant differences in the various ML algorithms but found no significant differences amongst the multimodal feature datasets. Optimized ML algorithms and key multimodal features obtained from larger real-world data (RWD) sets could enable more reliable and accurate estimation of continuous BP in cuffless devices, accelerating wider clinical adoption.

This paper proposes a novel approach for achieving sustainable energy systems in unexpected sports event management by integrating machine learning and optimization algorithms. Specifically, we used reinforcement learning for peak load forecasting and bat evolutionary algorithm for optimization, since the energy management problem in sports events is typically non-linear. Machine learning algorithms, specifically reinforcement learning, are used to analyze historical data and provide accurate peak load forecasts. This information can then be used to optimize energy consumption during the event through the use of algorithms such as the bat evolutionary algorithm, which can effectively solve non-linear optimization problems. The integration of these algorithms in unexpected sports event management can lead to significant improvements in sustainability and cost-effectiveness. This paper presents a case study of the implementation of reinforcement learning and bat evolutionary algorithms in an unexpected sports event management scenario, demonstrating the effectiveness of the proposed approach in achieving sustainable energy systems and reducing overall energy consumption. Overall, this paper provides a roadmap for integrating machine learning and optimization algorithms, such as reinforcement learning and bat evolutionary algorithm, in unexpected sports event management to achieve sustainable energy systems, promoting a more sustainable future for the sports event industry and the planet as a whole.

This paper focuses on multi-modal Information Perception (IP) for Soft Robotic Hands (SRHs) using Machine Learning (ML) algorithms. A flexible Optical Fiber-based Curvature Sensor (OFCS) is fabricated, consisting of a Light-Emitting Diode (LED), photosensitive detector, and optical fiber. Bending the roughened optical fiber generates lower light intensity, which reflecting the curvature of the soft finger. Together with the curvature and pressure information, multi-modal IP is performed to improve the recognition accuracy. Recognitions of gesture, object shape, size, and weight are implemented with multiple ML approaches, including the Supervised Learning Algorithms (SLAs) of K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Logistic Regression (LR), and the unSupervised Learning Algorithm (un-SLA) of K-Means Clustering (KMC). Moreover, Optical Sensor Information (OSI), Pressure Sensor Information (PSI), and Double-Sensor Information (DSI) are adopted to compare the recognition accuracies. The experiment results demonstrate that the proposed sensors and recognition approaches are feasible and effective. The recognition accuracies obtained using the above ML algorithms and three modes of sensor information are higher than 85 percent for almost all combinations. Moreover, DSI is more accurate when compared to single modal sensor information and the KNN algorithm with a DSI outperforms the other combinations in recognition accuracy.