Machine Learning Assisted Prediction for Free-Space Continuous Variable Quantum Teleportation

Aim: Prediction of coronary illness utilizing novel Novel k nearest neighbor (KNN) and contrasting its accuracy with decision tree algorithm. Materials and Methods: Two gatherings are proposed for foreseeing the accuracy (%) of coronary illness. To be specific, novel Novel k nearest neighbor and decision tree algorithm. Here we take 20 examples each for assessment and look at. The sample size was calculated using G power with pretest power at 80% and the alpha of 0.05 value. Result: The decision tree gives better accuracy (84.95%) contrasted with the Novel k nearest neighbor accuracy (76.29 %). Along these lines the factual meaning of the decision tree is superior to the novel k nearest neighbor algorithm with significance value of 0.115. Conclusion: From the outcome, it may very well be inferred that the decision tree helps in anticipating the coronary illness with more precision contrasted with the novel k nearest neighbor algorithm.

We investigate continuous variable (CV) quantum teleportation using relevant classes of non-Gaussian states of the radiation field as entangled resources. First, we introduce the class two-mode squeezed symmetric superposition of Fock states, including finite truncations of twin-beam Gaussian states as special realizations. These states depend on a set of free independent parameters that can be adjusted for the optimization of teleportation protocols, with an enhancement of the success probability of teleportation both for coherent and Fock input states. We show that the optimization procedure reduces the entangled resources to truncated twin beam states, which thus represents an optimal class of non-Gaussian resources for quantum teleportation. We then introduce a further class of two-mode non-Gaussian entangled resources, in the form of squeezed cat-like states. We analyze the performance and the properties of such states when optimized for (CV) teleportation, and compare them to the optimized squeezed Bell-like states introduced in a previous work [12]. We discuss how optimal resources for teleportation are characterized by a suitable balance of entanglement content and squeezed vacuum affinity. We finally investigate the effects of thermal noise on the efficiency of quantum teleportation. To this aim, a convenient framework is to describe noisy entangled resources as linear superpositions of non-Gaussian state and thermal states. Although the presence of the thermal component strongly reduces the teleportation fidelity, noisy non-Gaussian states remain preferred resources when compared to noisy twin-beam Gaussian states.

Introduction: Propensity score matching (PSM) is a method to reduce the impact of essential and confounders. When the number of confounders is high, there may be a problem of matching, in which, finding matched pairs for the case group is difficult, or impossible. The propensity score (PS) minimizes the effect of the confounders, and it is reduced to one dimension. There are various algorithms in the field of PSM. This study aimed to compared the nearest neighbor and caliper algorithms. Methods: Data obtained in this study were from patients undergoing angiography at Ghaem Hospital in Mashhad, between 2011-12. The study was a retrospective case-control using PSM. In total, 604 patients were included in the case and control groups. A logistic regression model was used to calculate the propensity score and adjust the variables, such as age, gender, Body Mass Index (BMI), systolic blood pressure, smoking status, and triglyceride. Then, the Odds Ratios (ORs) with 95% Confidence Intervals (CIs) for the raw data and two matching algorithms were determined to examine the relationship between type 2 diabetes and coronary artery disease (CAD). Results: Propensity score in the nearest neighbor and caliper algorithms matched the total number of 604 samples, 200 and 178 pairs, respectively. All variables were significantly different between the two groups before matching (P<0.05). The gender was significantly different between the two groups after matching using the nearest neighbor algorithm (P=0.002). No variables created a significant difference between the two groups after matching with the caliper algorithm. Conclusion: Bias reduction in the caliper algorithm was greater than for the nearest neighbor algorithm for all variables except the triglyceride variable.

Aim: Coronary illness is one of the main sources of mortality in this current world. A basic test in the field of clinical information assessment is the expectation of cardiovascular infection. The fundamental target of this paper is to work on the exactness of the Data mining algorithms being used to improve heart disease prediction. We will be comparing the novel Random forest with K Nearest Neighbor to find out which of these can give us the best accuracy. Material and Methods: The study used 98 samples with Novel Random Forest and K Nearest Neighbor is executed with varying training and testing splits for predicting the accuracy for heart disease prediction with the 80% of G-power value and data about cardiovascular disease was gathered from numerous web sources, including latest research findings and threshold 0.05%, confidence interval 95% mean and standard deviation. The performance of the accuracy rate of the classifiers is examined using the heart disease dataset.. There was a statistical insignificant difference among Innovative Random Forest and K Nearest Neighbor p = 0.484 (p>0.05). Results and Discussion: The accuracy of predicting heart disease in Novel Random Forest 90.16% and K Nearest Neighbor 67.21% is obtained. Conclusion: Prediction of Heart disease using the innovative Random Forest (RF) technique appears to be a significant improvement over the K Nearest Neighbor (KNN) algorithm in terms of accuracy.

Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance information to compute NN queries (e.g., Euclidean distance or spatial network distance). However, the final goal of a user when performing an NN search is often to travel to one of the points of the search result. In this case, finding the nearest neighbors in terms of travel time is more important than the actual distance. In the existing NN algorithms dynamic real-time events (e.g., traffic congestions, detours, etc.) are usually not considered and hence the pre-computed nearest neighbor objects may not accurately reflect the shortest travel time. In this paper we propose a novel travel time network that integrates both spatial networks and real-time traffic event information. Based on this foundation of the travel time network, we develop a local-based greedy nearest neighbor algorithm and a global-based adaptive nearest neighbor algorithm that both utilize real-time traffic information to provide adaptive nearest neighbor search results. We have performed a theoretical analysis and simulations to verify our methods. The results indicate that our algorithms remarkably reduce the travel time compared with previous nearest neighbor solutions.

Machine learning methods are widely used in automated technologies. Classification prediction is a machine learning based on data mining. Today, many technological devices can make new predictions by gaining experience from past data with machine learning methods. Machine learning is widely studied in two types, supervised and unsupervised. The limits of the objectives in supervised learning are predetermined. In unsupervised learning, there are no predetermined targets. In this learning, the machines are required to determine the targets automatically. Prediction process is one of the basic components of machine learning. Machines need to use some algorithms in order to perform the prediction process on the basis of data mining. k nearest neighbor (kNN), Naive Bayes (NB), Decision Tree (DT) and Support Vector Machine (SVM) algorithms are used mostly. k nearest neighbor (kNN), Naive Bayes (NB), Decision Tree (DT) and Support Vector Machine (SVM) algorithms are used mostly. These algorithms can be applied with the help of some tools on data sets. In this study, kNN algorithm was used to estimate Iris data set classification using Orange tool. The success of the KNN algorithm depends on using the correct attribute and changing the optimum k value. As a result of the tests, it was determined that when the k neighbor value was selected as 15, it was the most suitable k neighbor value, providing 98.67% classification prediction success in the Iris dataset.

Quantum teleportation has achieved significant progress in the optical frequency domain but faces persistent challenges, including high transmission losses and limited transmittance. In contrast, the microwave frequency domain offers distinct advantages, such as reduced absorption losses, lower energy consumption, and compatibility with superconducting quantum technologies. To overcome the limitations of optical quantum teleportation, this study presents a microwave-based continuous-variable quantum teleportation (CVQT) scheme designed for open-air environments at room temperature. The proposed approach employs microwave two-mode squeezed states, with entanglement enhanced through quantum scissors operations to mitigate environmental degradation. Numerical simulations demonstrate that the maximum transmission distance of microwave entangled states for CVQT is about 200 m at room temperature. The results also indicate that the microwave CVQT scheme achieves lower attenuation and higher fidelity over short distances compared to optical frequency CVQT under similar weather conditions. Moreover, microwave quantum states exhibit reduced sensitivity to weather-induced variations, highlighting their robustness and practicality for open-air quantum communication applications.

Targeting and design of water networks for fixed flowrate and fixed contaminant load operations

Stress is a common human reaction to demanding circumstances, and prolonged and excessive stress can have detrimental effects on both mental and physical health. Heart rate variability (HRV) is widely used as a measure of stress due to its ability to capture variations in the time intervals between heartbeats. However, achieving high accuracy in stress detection through machine learning (ML), using a reduced set of statistical features extracted from HRV, remains a significant challenge. In this study, we aim to address these challenges by proposing lightweight ML models that can effectively detect stress using minimal HRV features and are computationally efficient enough for IoT deployment. We have developed ML models incorporating efficient feature selection techniques and hyper-parameter tuning. The publicly available SWELL-KW dataset has been utilized for evaluating the performance of our models. Our results demonstrate that lightweight models such as -NN and Decision Tree can achieve competitive accuracy while ensuring lower computational demands, making them ideal for real-time applications. Promisingly, among the developed models, the -nearest neighbors (-NN) algorithm has emerged as the best-performing model, achieving an accuracy score of 99.3 using only three selected features. To confirm real-world deployability, we benchmarked the best model on an 8 GB NVIDIA Jetson Orin Nano edge device, where it retained 99.26% accuracy and completed training in 31 s. Furthermore, our study has incorporated local interpretable model-agnostic explanations to provide comprehensive insights into the predictions made by the -NN-based architecture.

Introduction: Since the delay or mistake in the diagnosis of mood disorders due to the similarity of their symptoms hinders effective treatment, this study aimed to accurately diagnose mood disorders including psychosis, autism, personality disorder, bipolar, depression, and schizophrenia, through modeling and analyzing patients' data . Method : Data collected in this applied developmental research included 996 records with 130 features obtained by interviewing and completing questionnaires in a mental hospital in the city of Sari, Iran in 2021. After preprocessing, the number of features was reduced to 91, and then through Principal Component Analysis (PCA) reduced to 35 factors. Modeling was done in Python software with K -Nearest Neighbor (KNN), Naive Bayes (NB), Decision Tree (DT), Random Forest (RF), Logistic Regression (LR), and Support Vector Machine (SVM) algorithms. The models were evaluated to select algorithms with higher accuracy. Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) were applied to determine the optimal parameters of the selected algorithms . Results: Among the machine learning algorithms, random forest with 91% accuracy and support vector machine with 90% accuracy showed better performance. The genetic algorithms did not make any notable increase in prediction accuracy. Whereas considering N=30, T=150, W=0.9, c1=2, and c2=2 in the particle swarm optimization algorithm increased the prediction accuracy up to 3.3 %. Conclusion : With less classification error compared to similar studies, the PSO -SVM model designed in this study can be used in patient data monitoring with acceptable accuracy and can be used in intelligent systems in psychiatric centers.

<em><span lang="EN-ID">One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm</span></em><span lang="EN-ID">.</span>

Efficacy of Smoothing Algorithms to Enhance Detection of Visual Field Progression in Glaucoma

Atmospheric turbulence is the main barrier to large-scale free-space quantum communication networks. Aberrations distort optical information carriers, thus limiting or preventing the possibility of establishing a secure link between two parties. For this reason, forecasting the turbulence strength within an optical channel is highly desirable, as it allows for knowing the optimal timing to establish a secure link in advance. Here, we train a recurrent neural network, TAROQQO, to predict the turbulence strength within a free-space channel. The training is based on weather and turbulence data collected over 9 months for a 5.4 km intra-city free-space link across the City of Ottawa. The implications of accurate predictions from our network are demonstrated in a simulated high-dimensional quantum key distribution protocol based on orbital angular momentum states of light across different turbulence regimes. TAROQQO will be crucial in validating a free-space channel to optimally route the key exchange for secure communications in real experimental scenarios.

The goal of the Metadata Automation DREAM Challenge was to develop a tool to automate the annotation of metadata fields and values in structured biomedical data files with the best candidate Common Data Element (CDE) matches from the Cancer Data Standards Registry and Repository (caDSR). We chose to implement our model in Python 3.6 and approached this challenge from the perspective that it was essentially a fuzzy matching problem. Our approach utilizes Scikit-Learn’s TfidfVectorizer class along with a custom n-gram function to vectorize the data. These term frequency - inverse document frequency (TF-IDF) vectors are passed to Scikit-Learn’s Nearest Neighbor class which returns the k nearest CDE neighbors and their associated distance scores for each column header in the biomedical data file. For the returned CDEs with enumerated values, the Levenshtein distances from the observed values in the data to the CDE’s permissible values are computed using Python’s FuzzyWuzzy library. We then use a decision tree approach based on the TF-IDF distance scores and the observed values’ average Levenshtein distance scores to select and rank the top three CDE matches from the set of nearest neighbors for each column header. In this final ranking step, we apply cutoff values to the distance scores to determine when to include ‘NOMATCH’ as one of the three results. Throughout the challenge we experimented with many aspects of the algorithm including modifying the n-gram function, the selection of caDSR fields to include in the TF-IDF vectorization and applying different cutoff values. The final version of our model was arrived at by selecting the features and parameters that maximized the overall score across all the provided test datasets.

Quantum machine learning (QML) has emerged as a promising paradigm for solving complex classification problems by leveraging the computational advantages of quantum systems. While most traditional machine learning models focus on clean, balanced datasets, real-world data is often noisy, imbalanced and high-dimensional, posing significant challenges for scalability and generalisation. This paper conducts an extensive experimental evaluation of five supervised classifiers- Decision Tree, K nearest neighbour, Random Forest, linear regression and support vector machines in comparison with Quantum machine learning classifiers- quantum Support vector machine, quantum k- nearest neighbor and variational quantum classifier-across five diverse datasets, including iris, wine quality, Breast cancer, UCI human activity recognition, and Pima diabetes. To simulate real-world challenges, we introduce class imbalance using SMOTE and ADASYN Sampling, inject Gaussian noise into the features, and assess the impact of dimensionality reduction through ANOVA-based feature selection. Additionally, we utilise explainable AI tools, such as SHAP and LIME, to interpret model decisions. Our results demonstrate that Logistic Regression consistently performs well under various complexities, while Quantum Support Vector Machines show resilience to feature noise and class imbalance. The study also highlights the current capabilities and limitations of QML models, offering valuable insights into building generalisable and interpretable ML systems for deployment in complex environments. These insights are crucial for building robust, interpretable, and generalisable ML models for practical deployment.