Your search

SESSION TITLE: Clinical Prediction and Diagnosis of OSA

The goal of the ambient intelligence system is not only to enhance the way people communicate with the surrounding environment but also to advance safety measures and enrich human lives. In this paper, we introduce an integrated ambient intelligence system (IAmIS) to perceive the presence of people, identify them, determine their locations, and provide suitable interaction with them. The proposed framework can be applied in various application domains such as a smart house, authorisation, surveillance, crime prevention, and many others. The proposed system has five components: body detection and tracking, face recognition, controller, monitor system, and interaction modules. The system deploys RGB cameras and Kinect depth sensors to monitor human activity. The developed system is designed to be fast and reliable for indoor environments. The proposed IAmIS can interact directly with the environment or communicate with humans acting on the environment. Thus, the system behaves as an intelligent agent. The system has been deployed in our research lab and can recognise lab members and guests to the lab as well as track their movements and have interactions with them depending upon their identity and location within the lab.

There is still an urgent need of finding a mathematical model which can provide an accurate relationship between the software project effort/cost and the cost drivers. A powerful algorithm which can optimize such a relationship via developing a mathematical relationship between model variables is urgently needed. In this paper, we explore the use of GP to develop a software cost estimation model utilizing the effect of both the developed line of code and the used methodology during the development. An application of estimating the effort for some NASA software projects is introduced. The performance of the developed Genetic Programming (GP) based model was tested and compared to known models in the literature. The developed GP model was able to provide good estimation capabilities compared to other models.

​The hands-on textbook covers both the theory and applications of data communications, the Internet, and network security technology, following the ACM guideline for courses in networking. The content is geared towards upper undergraduate and graduate students in information technology, communications engineering, and computer science. The book is divided into three sections: Data Communications, Internet Architecture, and Network Security. Topics covered include flow control and reliable transmission; modulation, DSL, cable modem, and FTTH; Ethernet and Fast Ethernet; gigabit and 10 gigabit Ethernet; and LAN interconnection devices, among others. The book also covers emerging topics such as IPv6 and software defined networks. The book is accompanied with a lab manual which uses Wireshark, Cisco Packet Tracer, and virtual machines to lead students through simulated labs.

Obstructive sleep apnea (OSA) is a prevalent sleep disorder that affects approximately 3–7% of males and 2–5% of females. In the United States alone, 50–70 million adults suffer from various sleep disorders. OSA is characterized by recurrent episodes of breathing cessation during sleep, thereby leading to adverse effects such as daytime sleepiness, cognitive impairment, and reduced concentration. It also contributes to an increased risk of cardiovascular conditions and adversely impacts patient overall quality of life. As a result, numerous researchers have focused on developing automated detection models to identify OSA and address these limitations effectively and accurately. This study explored the potential benefits of utilizing machine learning methods based on demographic information for diagnosing the OSA syndrome. We gathered a comprehensive dataset from the Torr Sleep Center in Corpus Christi, Texas, USA. The dataset comprises 31 features, including demographic characteristics such as race, age, sex, BMI, Epworth score, M. Friedman tongue position, snoring, and more. We devised a novel process encompassing pre-processing, data grouping, feature selection, and machine learning classification methods to achieve the research objectives. The classification methods employed in this study encompass decision tree (DT), naive Bayes (NB), k-nearest neighbor (kNN), support vector machine (SVM), linear discriminant analysis (LDA), logistic regression (LR), and subspace discriminant (Ensemble) classifiers. Through rigorous experimentation, the results indicated the superior performance of the optimized kNN and SVM classifiers for accurately classifying sleep apnea. Moreover, significant enhancements in model accuracy were observed when utilizing the selected demographic variables and employing data grouping techniques. For instance, the accuracy percentage demonstrated an approximate improvement of 4.5%, 5%, and 10% with the feature selection approach when applied to the grouped data of Caucasians, females, and individuals aged 50 or below, respectively. Furthermore, a comparison with prior studies confirmed that effective data grouping and proper feature selection yielded superior performance in OSA detection when combined with an appropriate classification method. Overall, the findings of this research highlight the importance of leveraging demographic information, employing proper feature selection techniques, and utilizing optimized classification models for accurate and efficient OSA diagnosis.

The Crow Search Algorithm (CSA) is a swarm-based metaheuristic algorithm that simulates the intelligent foraging behaviors of crows. While CSA effectively handles global optimization problems, it suffers from certain limitations, such as low search accuracy and a tendency to converge to local optima. To address these shortcomings, researchers have proposed modifications and enhancements to CSA’s search mechanism. One widely explored approach is the structured population mechanism, which maintains diversity during the search process to mitigate premature convergence. The island model, a common structured population method, divides the population into smaller independent sub-populations called islands, each running in parallel. Migration, the primary technique for promoting population diversity, facilitates the exchange of relevant and useful information between islands during iterations. This paper introduces an enhanced variant of CSA, called Enhanced CSA (ECSA), which incorporates the cooperative island model (iECSA) to improve its search capabilities and avoid premature convergence. The proposed iECSA incorporates two enhancements to CSA. Firstly, an adaptive tournament-based selection mechanism is employed to choose the guided solution. Secondly, the basic random movement in CSA is replaced with a modified operator to enhance exploration. The performance of iECSA is evaluated on 53 real-valued mathematical problems, including 23 classical benchmark functions and 30 IEEE-CEC2014 benchmark functions. A sensitivity analysis of key iECSA parameters is conducted to understand their impact on convergence and diversity. The efficacy of iECSA is validated by conducting an extensive evaluation against a comprehensive set of well-established and recently introduced meta-heuristic algorithms, encompassing a total of seventeen different algorithms. Significant differences among these comparative algorithms are established utilizing statistical tests like Wilcoxon’s rank-sum and Friedman’s tests. Experimental results demonstrate that iECSA outperforms the fundamental ECSA algorithm on 82.6% of standard test functions, providing more accurate and reliable outcomes compared to other CSA variants. Furthermore, Extensive experimentation consistently showcases that the iECSA outperforms its comparable algorithms across a diverse set of benchmark functions.

More than half a billion people worldwide are affected by diabetes, which is a prevalent non-communicable disease that can lead to critical health conditions, including vision loss. Diabetic Macular Edema (DME) is a primary cause of vision impairment and can eventually lead to blindness in diabetic patients. Early detection of DME and proper health management are crucial to controlling the disease. Retinal image-based AI-enabled diabetes diagnosis has gained significant attention as a non-invasive, fast, and reasonably accurate method for diagnosing DME. To make this technology accessible to underserved communities or areas lacking proper clinical facilities, a mobile application-based solution could have a significant impact. In this article, we describe how we transformed our previously published AI-enabled model into an Android-based mobile application, which is part of a two-phase research study. In the first phase, we developed a deep learning-based model that predicts DME grading using retinal images. In the second phase, we built a mobile application DMEgrader to make our model accessible via a mobile device. To the best of our knowledge, this is the first article to demonstrate necessary steps and code snippets to support developers in transforming deep learning models into Android based mobile applications for DME grading prediction. © 2023 IEEE.

In this paper, we focus on improving the age estimation accuracy on smartphones. Estimating a smartphone user’s age has several applications such as protecting our children online by filtering age-inappropriate contents, providing a customized e-commerce experience, etc. However, accuracy of the the state-of-the-art age estimation techniques that use touch behavior on smartphones is still limited because of the lack of sufficient amount of training data. We perform rigorous experiments using zoom gestures on smartphones and demonstrate that increasing the amount of training data can significantly improve the age estimation accuracy. Based on the findings in this study, we recommend creating a large touch dynamics-based age estimation data set so that more accurate age estimation models can be built and in turn, can be used more confidently.

Over recent decades, research in Artificial Intelligence (AI) has developed a broad range of approaches and methods that can be utilized or adapted to address complex optimization problems. As real-world problems get increasingly complicated, this requires an effective optimization method. Various meta-heuristic algorithms have been developed and applied in the optimization domain. This paper used and ameliorated a promising meta-heuristic approach named Crow Search Algorithm (CSA) to address numerical optimization problems. Although CSA can efficiently optimize many problems, it needs more searchability and early convergence. Its positioning updating process was improved by supporting two adaptive parameters: flight length (fl) and awareness probability (AP) to tackle these curbs. This is to manage the exploration and exploitation conducts of CSA in the search space. This process takes advantage of the randomization of crows in CSA and the adoption of well-known growth functions. These functions were recognized as exponential, power, and S-shaped functions to develop three different improved versions of CSA, referred to as Exponential CSA (ECSA), Power CSA (PCSA), and S-shaped CSA (SCSA). In each of these variants, two different functions were used to amend the values of fl and AP. A new dominant parameter was added to the positioning updating process of these algorithms to enhance exploration and exploitation behaviors further. The reliability of the proposed algorithms was evaluated on 67 benchmark functions, and their performance was quantified using relevant assessment criteria. The functionality of these algorithms was illustrated by tackling four engineering design problems. A comparative study was made to explore the efficacy of the proposed algorithms over the standard one and other methods. Overall results showed that ECSA, PCSA, and SCSA have convincing merits with superior performance compared to the others.

This paper introduces an enhanced version of the Capuchin Search Algorithm (CapSA) called ECapSA. CapSA draws inspiration from the collective intelligence of Capuchin monkeys and has shown success in solving real-world problems. However, it may encounter challenges handling complex optimization tasks, such as premature convergence or being trapped in local optima. ECapSA employs a local escaping mechanism operating the abandonment limit concept to exploit potential solutions and introduce diversification trends. Additionally, the ECapSA algorithm is improved by integrating the principles of the cooperative island model, resulting in the iECapSA. This modification enables better management of population diversity and a more optimal balance between exploration and exploitation. The efficiency of iECapSA is validated through a series of experiments, including the IEEE-CEC2014 benchmark functions and training the feedforward neural network (FNN) on seven biomedical datasets. The performance of iECapSA is compared to other metaheuristic techniques, namely differential evolution (DE), sine cosine algorithm (SCA), and whale optimization algorithm (WOA). The results of the comparative study demonstrate that iECapSA is a strong contender and surpasses other training algorithms in most datasets, particularly in terms of its ability to avoid local optima and its improved convergence speed.

In this study, we conducted experiments to model the temperature of two manufacturing processes using various metaheuristic search algorithms. The two processes adopted were the P05 horny steel tool and the AISI304 stainless steel castings machines. Our approach involves building a data-driven model, as traditional search methods for modeling manufac-turing problems often need help finding the global optimum when faced with a complex objective function and numerous decision variables. Bio-inspired metaheuristic search algorithms have shown promising performance in handling multi-model optimization functions, and efficiently exploring the search space to attain more global results. We applied several metaheuristic search algorithms to find the optimal tuning parameters of a temperature-based model. The results from the case studies demonstrate that Particle Swarm Optimization (PSO) provided the best performance in tuning model parameters, resulting in minimum modeling error.

Sleep apnea is a sleeping disorder affecting more than 20 % of all American adults, associated with intermittent air passageway obstruction during sleep. This results in intermittent hypoxia, sympathetic activation, and an interruption of sleep with various health consequences. The diagnosis of sleep apnea traditionally involves the performance of overnight polysomnography, where oxygen, heart rate, and breathing, among other physiologic variables, are continuously monitored during sleep at a sleep center. However, these sleep studies are expensive and impose access issues, given the number of patients who need to be diagnosed. There is hence utility in having an effective triage system to screen for OSA to utilize polysomnography better. In this study, we plan to explore using several machine learning algorithms to utilize pre-screening symptoms to diagnose obstructive sleep apnea (OSA). Per our experimental results, it was found that Decision Tree Classifier (DTC) and Random Forest (RF) provided the highest classification accuracies compared to other algorithms such as Logistic Regression (LR), Support Vector Machines (SVM), Gradient Boosting Classifier (GBC), Gaussian Naive Bayes (GNB), K Neighbors Classifier (KNC), and Artificial Neural Networks (ANN).

Identification of the optimal subset of features for Feature Selection (FS) problems is a demanding problem in machine learning and data mining. A trustworthy optimization approach is required to cope with the concerns involved in such a problem. Here, a Binary version of the Capuchin Search Algorithm (CSA), referred to as BCSA, was developed to select the optimal feature combination. Owing to the imbalance of parameters and random nature of BCSA, it may sometimes fall into the trap of an issue called local maxima. To beat this problem, the BCSA could be further improved with the resettlement of its individuals by adopting some methods of repopulating the individuals during foraging. Lévy flight was applied to augment the exploitation and exploration abilities of BCSA, a method referred to as LBCSA. A Chaotic strategy is used to reinforce search behavior for both exploration and exploitation potentials of BCSA, which is referred to as CBCSA. Finally, Lévy flight and chaotic sequence are integrated with BCSA, referred to as LCBCSA, to increase solution diversity and boost the openings of finding the global optimal solutions. The proposed methods were assessed on twenty-six datasets collected from the UCI repository. The results of these methods were compared with those of other FS methods. Overall results show that the proposed methods render more precise solutions in terms of accuracy rates and fitness scores than other methods.

Winning football matches is the major goal of all football clubs in the world. Football being the most popular game in the world, many studies have been conducted to analyze and predict match winners based on players’ physical and technical performance. In this study, we analyzed the matches from the professional football league of Qatar Stars League (QSL) covering the matches held in the last ten seasons. We incorporated the highest number of professional matches from the last ten seasons covering from 2011 up to 2022 and proposed SoccerNet, a Gated Recurrent Unit (GRU)-based deep learning-based model to predict match winners with over 80% accuracy. We considered match- and player-related information captured by STATS platform in a time slot of 15 minutes. Then we analyzed players’ performance at different positions on the field at different stages of the match. Our results indicated that in QSL, the defenders’ role in matches is more dominant than midfielders and forwarders. Moreover, our analysis suggests that the last 15–30 minutes of match segments of the matches from QSL have a more significant impact on the match result than other match segments. To the best of our knowledge, the proposed model is the first DL-based model in predicting match winners from any professional football leagues in the Middle East and North Africa (MENA) region. We believe the results will support the coaching staff and team management for QSL in designing game strategies and improve the overall quality of performance of the players.

In modern-day computing, cloud services are widely used in every aspect of life. So, user satisfaction depends on the effectiveness and efficiency of cloud services. Service broker policy of the cloud maintains the effectiveness and efficiency of cloud services. Service broker policy provides the rules and norms based on which a data center is selected for a userbase request. This paper proposes a genetic algorithm-based service broker policy that provides the optimal sequence of data centers for different userbases based on their requirements. This research aims to find an optimal data center for userbases that can achieve user satisfaction by minimizing the cloud service's response time and data processing time. We have experimented with our proposed genetic algorithm-based service broker policy in the CloudAnalyst platform based on different real-world scenarios. Simulation results indicate that our proposed genetic algorithm outperforms existing traditional algorithms. © 2023 IEEE.