Dynamic V2I/V2V cooperative scheme for connectivity and throughput enhancement
- Nguyen, Bach, Ngo, Duy, Tran, Nguyen, Dao, Minh, Vu, Hai
- Authors: Nguyen, Bach , Ngo, Duy , Tran, Nguyen , Dao, Minh , Vu, Hai
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Intelligent Transportation Systems Vol. 23, no. 2 (2022), p. 1236-1246
- Full Text: false
- Reviewed:
- Description: Automotive infotainment systems are expected to be first deployed on highways to service drivers travelling long distances, who are more likely to utilize the infotainment applications. In order to meet the stringent requirements of the infotainment systems, road side units (RSUs) are installed along the highway to facilitate a continuous vehicle-to-infrastructure (V2I) connectivity. Due to the long travelling distance and small coverage of the individual RSU, a more cost-effective solution would be to combine V2I with the vehicle-to-vehicle (V2V) communications to maintain the continuous connectivity. In this paper, we propose a new dynamic cooperation scheme that employs a dynamic forwarder selection strategy to generate an adaptive multi-hop V2V path for connectivity maintenance and throughput enhancement at a vehicle located outside of the RSU's coverage range. For the commonly assumed scenario that all vehicles travel in the same direction and at the same speed, we develop an analytical model and derive closed-formed expressions for the average out-of-range connection time, number of service resumptions and achieved throughput. The developed analytical model provides insights into the impacts of inter-RSU distance, vehicles' assistance willingness and the target vehicle's buffer size to the network performance. Simulation results with practical parameter settings show that our proposed scheme is effective in improving connectivity while offering a high throughput for the target vehicle. In particular, a high vehicle density, more assistance willingness by the forwarders and a large buffer size at the target vehicle are shown to be helpful in sparse RSU deployments. © 2000-2011 IEEE.
- Afsana, Fariha, Paul, Manoranjan, Murshed, Manzur, Taubman, David
- Authors: Afsana, Fariha , Paul, Manoranjan , Murshed, Manzur , Taubman, David
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Circuits and Systems for Video Technology Vol. 32, no. 6 (2022), p. 3961-3977
- Full Text: false
- Reviewed:
- Description: The scalable extension of High Efficiency Video Coding, SHVC can code Ultra High-Definition (UHD) video, including 360-degree video for various devices to serve a single bitstream with different display resolutions and qualities. To improve the SHVC compression efficiency, this paper proposes a novel intra and inter-frame coding scheme by first separating the common/visually important information and then applying cuboid-based variable size block partitioning and coding process for the common/visually important information in the base layer. In cuboid-based partitioning a video frame is partitioned into arbitrary shaped rectangular regions, known as cuboids, based on the distribution of relatively homogeneous pixel values. As the cuboid adopts a variable block partitioning based on the homogeneity of the data value, the partitioned blocks have better alignment with the object boundary. Moreover, in the cuboid coding process, only the partitioning tree information and a single value for each block need to be coded which takes lower number of bits and computational time compared to the traditional SHVC base layer. To verify the performance of the proposed method we embedded the proposed scheme as a base layer into the standard SHVC reference software and used several popular UHD/360-degree videos. The experimental results indicate that the proposed scalable coding strategy achieves an average of 14.04% BD-Rate reduction and 0.61 dB BD-PSNR gain for UHD/360-video compared to the operation points provided by an SHVC conforming encoder. © 1991-2012 IEEE.
- Ali, Farman, El-Sappagh, Shaker, Islam, S., Kwak, Daehan, Ali, Amjad, Imran, Muhammad, Kwak, Kyung-Sup
- Authors: Ali, Farman , El-Sappagh, Shaker , Islam, S. , Kwak, Daehan , Ali, Amjad , Imran, Muhammad , Kwak, Kyung-Sup
- Date: 2020
- Type: Text , Journal article
- Relation: Information Fusion Vol. 63, no. (2020), p. 208-222
- Full Text: false
- Reviewed:
- Description: The accurate prediction of heart disease is essential to efficiently treating cardiac patients before a heart attack occurs. This goal can be achieved using an optimal machine learning model with rich healthcare data on heart diseases. Various systems based on machine learning have been presented recently to predict and diagnose heart disease. However, these systems cannot handle high-dimensional datasets due to the lack of a smart framework that can use different sources of data for heart disease prediction. In addition, the existing systems utilize conventional techniques to select features from a dataset and compute a general weight for them based on their significance. These methods have also failed to enhance the performance of heart disease diagnosis. In this paper, a smart healthcare system is proposed for heart disease prediction using ensemble deep learning and feature fusion approaches. First, the feature fusion method combines the extracted features from both sensor data and electronic medical records to generate valuable healthcare data. Second, the information gain technique eliminates irrelevant and redundant features, and selects the important ones, which decreases the computational burden and enhances the system performance. In addition, the conditional probability approach computes a specific feature weight for each class, which further improves system performance. Finally, the ensemble deep learning model is trained for heart disease prediction. The proposed system is evaluated with heart disease data and compared with traditional classifiers based on feature fusion, feature selection, and weighting techniques. The proposed system obtains accuracy of 98.5%, which is higher than existing systems. This result shows that our system is more effective for the prediction of heart disease, in comparison to other state-of-the-art methods. © 2020
An IoT-based smart healthcare system to detect dysphonia
- Ali, Zulfiqar, Imran, Muhammad, Shoaib, Muhammad
- Authors: Ali, Zulfiqar , Imran, Muhammad , Shoaib, Muhammad
- Date: 2022
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 34, no. 14 (2022), p. 11255-11265
- Full Text:
- Reviewed:
- Description: Smart healthcare systems for the internet of things (IoT) platform are cost-efficient and facilitate continuous remote monitoring of patients to avoid unnecessary hospital visits and long waiting times to see practitioners. Presenting a smart healthcare system for the detection of dysphonia can reduce the suffering and pain of patients by providing an initial evaluation of voice. This preliminary feedback of voice could minimize the burden on ENT specialists by referring only genuine cases to them as well as giving an early alarm of potential voice complications to patients. Any possible delay in the treatment and/or inaccurate diagnosis using the subjective nature of tools may lead to severe circumstances for an individual because some types of dysphonia are life-threatening. Therefore, an accurate and reliable smart healthcare system for IoT platform to detect dysphonia is proposed and implemented in this study. Higher-order directional derivatives are used to analyze the time–frequency spectrum of signals in the proposed system. The computed derivatives provide essential and vital information by analyzing the spectrum along different directions to capture the changes that appeared due to malfunctioning the vocal folds. The proposed system provides 99.1% accuracy, while the sensitivity and specificity are 99.4 and 98.1%, respectively. The experimental results showed that the proposed system could provide better classification accuracy than the traditional non-directional first-order derivatives. Hence, the system can be used as a reliable tool for detecting dysphonia and implemented in edge devices to avoid latency issues and protect privacy, unlike cloud processing. © 2021, Springer-Verlag London Ltd., part of Springer Nature.
- Authors: Ali, Zulfiqar , Imran, Muhammad , Shoaib, Muhammad
- Date: 2022
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 34, no. 14 (2022), p. 11255-11265
- Full Text:
- Reviewed:
- Description: Smart healthcare systems for the internet of things (IoT) platform are cost-efficient and facilitate continuous remote monitoring of patients to avoid unnecessary hospital visits and long waiting times to see practitioners. Presenting a smart healthcare system for the detection of dysphonia can reduce the suffering and pain of patients by providing an initial evaluation of voice. This preliminary feedback of voice could minimize the burden on ENT specialists by referring only genuine cases to them as well as giving an early alarm of potential voice complications to patients. Any possible delay in the treatment and/or inaccurate diagnosis using the subjective nature of tools may lead to severe circumstances for an individual because some types of dysphonia are life-threatening. Therefore, an accurate and reliable smart healthcare system for IoT platform to detect dysphonia is proposed and implemented in this study. Higher-order directional derivatives are used to analyze the time–frequency spectrum of signals in the proposed system. The computed derivatives provide essential and vital information by analyzing the spectrum along different directions to capture the changes that appeared due to malfunctioning the vocal folds. The proposed system provides 99.1% accuracy, while the sensitivity and specificity are 99.4 and 98.1%, respectively. The experimental results showed that the proposed system could provide better classification accuracy than the traditional non-directional first-order derivatives. Hence, the system can be used as a reliable tool for detecting dysphonia and implemented in edge devices to avoid latency issues and protect privacy, unlike cloud processing. © 2021, Springer-Verlag London Ltd., part of Springer Nature.
Bidirectional mapping coupled GAN for generalized zero-shot learning
- Shermin, Tasfia, Teng, Shyh, Sohel, Ferdous, Murshed, Manzur, Lu, Guojun
- Authors: Shermin, Tasfia , Teng, Shyh , Sohel, Ferdous , Murshed, Manzur , Lu, Guojun
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Image Processing Vol. 31, no. (2022), p. 721-733
- Full Text:
- Reviewed:
- Description: Bidirectional mapping-based generalized zero-shot learning (GZSL) methods rely on the quality of synthesized features to recognize seen and unseen data. Therefore, learning a joint distribution of seen-unseen classes and preserving the distinction between seen-unseen classes is crucial for GZSL methods. However, existing methods only learn the underlying distribution of seen data, although unseen class semantics are available in the GZSL problem setting. Most methods neglect retaining seen-unseen classes distinction and use the learned distribution to recognize seen and unseen data. Consequently, they do not perform well. In this work, we utilize the available unseen class semantics alongside seen class semantics and learn joint distribution through a strong visual-semantic coupling. We propose a bidirectional mapping coupled generative adversarial network (BMCoGAN) by extending the concept of the coupled generative adversarial network into a bidirectional mapping model. We further integrate a Wasserstein generative adversarial optimization to supervise the joint distribution learning. We design a loss optimization for retaining distinctive information of seen-unseen classes in the synthesized features and reducing bias towards seen classes, which pushes synthesized seen features towards real seen features and pulls synthesized unseen features away from real seen features. We evaluate BMCoGAN on benchmark datasets and demonstrate its superior performance against contemporary methods. © 1992-2012 IEEE.
- Authors: Shermin, Tasfia , Teng, Shyh , Sohel, Ferdous , Murshed, Manzur , Lu, Guojun
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Image Processing Vol. 31, no. (2022), p. 721-733
- Full Text:
- Reviewed:
- Description: Bidirectional mapping-based generalized zero-shot learning (GZSL) methods rely on the quality of synthesized features to recognize seen and unseen data. Therefore, learning a joint distribution of seen-unseen classes and preserving the distinction between seen-unseen classes is crucial for GZSL methods. However, existing methods only learn the underlying distribution of seen data, although unseen class semantics are available in the GZSL problem setting. Most methods neglect retaining seen-unseen classes distinction and use the learned distribution to recognize seen and unseen data. Consequently, they do not perform well. In this work, we utilize the available unseen class semantics alongside seen class semantics and learn joint distribution through a strong visual-semantic coupling. We propose a bidirectional mapping coupled generative adversarial network (BMCoGAN) by extending the concept of the coupled generative adversarial network into a bidirectional mapping model. We further integrate a Wasserstein generative adversarial optimization to supervise the joint distribution learning. We design a loss optimization for retaining distinctive information of seen-unseen classes in the synthesized features and reducing bias towards seen classes, which pushes synthesized seen features towards real seen features and pulls synthesized unseen features away from real seen features. We evaluate BMCoGAN on benchmark datasets and demonstrate its superior performance against contemporary methods. © 1992-2012 IEEE.
A prioritized objective actor-critic method for deep reinforcement learning
- Nguyen, Ngoc, Nguyen, Thanh, Vamplew, Peter, Dazeley, Richard, Nahavandi, Saeid
- Authors: Nguyen, Ngoc , Nguyen, Thanh , Vamplew, Peter , Dazeley, Richard , Nahavandi, Saeid
- Date: 2021
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 33, no. 16 (2021), p. 10335-10349
- Full Text: false
- Reviewed:
- Description: An increasing number of complex problems have naturally posed significant challenges in decision-making theory and reinforcement learning practices. These problems often involve multiple conflicting reward signals that inherently cause agents’ poor exploration in seeking a specific goal. In extreme cases, the agent gets stuck in a sub-optimal solution and starts behaving harmfully. To overcome such obstacles, we introduce two actor-critic deep reinforcement learning methods, namely Multi-Critic Single Policy (MCSP) and Single Critic Multi-Policy (SCMP), which can adjust agent behaviors to efficiently achieve a designated goal by adopting a weighted-sum scalarization of different objective functions. In particular, MCSP creates a human-centric policy that corresponds to a predefined priority weight of different objectives. Whereas, SCMP is capable of generating a mixed policy based on a set of priority weights, i.e., the generated policy uses the knowledge of different policies (each policy corresponds to a priority weight) to dynamically prioritize objectives in real time. We examine our methods by using the Asynchronous Advantage Actor-Critic (A3C) algorithm to utilize the multithreading mechanism for dynamically balancing training intensity of different policies into a single network. Finally, simulation results show that MCSP and SCMP significantly outperform A3C with respect to the mean of total rewards in two complex problems: Food Collector and Seaquest. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd. part of Springer Nature.
Scheduling and power control for connectivity enhancement in multi-hop I2V/V2V networks
- Nguyen, Bach, Ngo, Duy, Dao, Minh, Bao, Vo, Vu, Hai
- Authors: Nguyen, Bach , Ngo, Duy , Dao, Minh , Bao, Vo , Vu, Hai
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Intelligent Transportation Systems Vol. 23, no. 8 (2022), p. 10322-10332
- Full Text: false
- Reviewed:
- Description: Infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communications are often combined to extend the connectivity and coverage in the Intelligent Transportation System (ITS) and its applications, e.g., augmented reality, real-time parking management and online shopping. Through multi-hop I2V and V2V communications, requesting vehicles are always connected to road side units (RSUs) even when they do not reside within the RSUs' coverage range. However, there may be not adequate network resource for several I2V and V2V links when multiple vehicles request services simultaneously. In this paper, we propose a joint frequency scheduling and power control scheme to enhance connectivity in multi-hop I2V/V2V networks. We associate I2V and V2V links with tuple-links, then formulate an NP-hard problem in which a frequency scheduler and a power controller are jointly designed for the tuple-links. The NP-hard problem is decomposed into two separate subproblems by employing the delayed column generation technique. Then, we employ a method for linear programming and a greedy algorithm to address these subproblems. Through numerical experiments with practical parameter settings, we demonstrate the proposed scheme outperforms several existing ones in terms of connectivity enhancement, measured by the service resumption number and average achieved throughput. Furthermore, the efficiency of our scheme is further enhanced when the number of available channels is high, and buffer size equipped to the requesting vehicles is large. © 2000-2011 IEEE.
VRConvMF : visual recurrent convolutional matrix factorization for movie ecommendation
- Wang, Zhu, Chen, Honglong, Li, Zhe, Lin, Kai, Jiang, Nan, Xia, Feng
- Authors: Wang, Zhu , Chen, Honglong , Li, Zhe , Lin, Kai , Jiang, Nan , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 6, no. 3 (2022), p. 519-529
- Full Text:
- Reviewed:
- Description: Sparsity of user-to-item rating data becomes one of challenging issues in the recommender systems, which severely deteriorates the recommendation performance. Fortunately, context-aware recommender systems can alleviate the sparsity problem by making use of some auxiliary information, such as the information of both the users and items. In particular, the visual information of items, such as the movie poster, can be considered as the supplement for item description documents, which helps to obtain more item features. In this paper, we focus on movie recommender system and propose a probabilistic matrix factorization based recommendation scheme called visual recurrent convolutional matrix factorization (VRConvMF), which utilizes the textual and multi-level visual features extracted from the descriptive texts and posters respectively. We implement the proposed VRConvMF and conduct extensive experiments on three commonly used real world datasets to validate its effectiveness. The experimental results illustrate that the proposed VRConvMF outperforms the existing schemes. © 2017 IEEE.
- Authors: Wang, Zhu , Chen, Honglong , Li, Zhe , Lin, Kai , Jiang, Nan , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 6, no. 3 (2022), p. 519-529
- Full Text:
- Reviewed:
- Description: Sparsity of user-to-item rating data becomes one of challenging issues in the recommender systems, which severely deteriorates the recommendation performance. Fortunately, context-aware recommender systems can alleviate the sparsity problem by making use of some auxiliary information, such as the information of both the users and items. In particular, the visual information of items, such as the movie poster, can be considered as the supplement for item description documents, which helps to obtain more item features. In this paper, we focus on movie recommender system and propose a probabilistic matrix factorization based recommendation scheme called visual recurrent convolutional matrix factorization (VRConvMF), which utilizes the textual and multi-level visual features extracted from the descriptive texts and posters respectively. We implement the proposed VRConvMF and conduct extensive experiments on three commonly used real world datasets to validate its effectiveness. The experimental results illustrate that the proposed VRConvMF outperforms the existing schemes. © 2017 IEEE.
Discrete-to-deep reinforcement learning methods
- Kurniawan, Budi, Vamplew, Peter, Papasimeon, Michael, Dazeley, Richard, Foale, Cameron
- Authors: Kurniawan, Budi , Vamplew, Peter , Papasimeon, Michael , Dazeley, Richard , Foale, Cameron
- Date: 2022
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 34, no. 3 (2022), p. 1713-1733
- Full Text:
- Reviewed:
- Description: Neural networks are effective function approximators, but hard to train in the reinforcement learning (RL) context mainly because samples are correlated. In complex problems, a neural RL approach is often able to learn a better solution than tabular RL, but generally takes longer. This paper proposes two methods, Discrete-to-Deep Supervised Policy Learning (D2D-SPL) and Discrete-to-Deep Supervised Q-value Learning (D2D-SQL), whose objective is to acquire the generalisability of a neural network at a cost nearer to that of a tabular method. Both methods combine RL and supervised learning (SL) and are based on the idea that a fast-learning tabular method can generate off-policy data to accelerate learning in neural RL. D2D-SPL uses the data to train a classifier which is then used as a controller for the RL problem. D2D-SQL uses the data to initialise a neural network which is then allowed to continue learning using another RL method. We demonstrate the viability of our algorithms with Cartpole, Lunar Lander and an aircraft manoeuvring problem, three continuous-space environments with low-dimensional state variables. Both methods learn at least 38% faster than baseline methods and yield policies that outperform them. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
- Authors: Kurniawan, Budi , Vamplew, Peter , Papasimeon, Michael , Dazeley, Richard , Foale, Cameron
- Date: 2022
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 34, no. 3 (2022), p. 1713-1733
- Full Text:
- Reviewed:
- Description: Neural networks are effective function approximators, but hard to train in the reinforcement learning (RL) context mainly because samples are correlated. In complex problems, a neural RL approach is often able to learn a better solution than tabular RL, but generally takes longer. This paper proposes two methods, Discrete-to-Deep Supervised Policy Learning (D2D-SPL) and Discrete-to-Deep Supervised Q-value Learning (D2D-SQL), whose objective is to acquire the generalisability of a neural network at a cost nearer to that of a tabular method. Both methods combine RL and supervised learning (SL) and are based on the idea that a fast-learning tabular method can generate off-policy data to accelerate learning in neural RL. D2D-SPL uses the data to train a classifier which is then used as a controller for the RL problem. D2D-SQL uses the data to initialise a neural network which is then allowed to continue learning using another RL method. We demonstrate the viability of our algorithms with Cartpole, Lunar Lander and an aircraft manoeuvring problem, three continuous-space environments with low-dimensional state variables. Both methods learn at least 38% faster than baseline methods and yield policies that outperform them. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
Automatic driver distraction detection using deep convolutional neural networks
- Hossain, Md Uzzol, Rahman, Md Ataur, Islam, Md Manowarul, Akhter, Arnisha, Uddin, Md Ashraf, Paul, Bikash
- Authors: Hossain, Md Uzzol , Rahman, Md Ataur , Islam, Md Manowarul , Akhter, Arnisha , Uddin, Md Ashraf , Paul, Bikash
- Date: 2022
- Type: Text , Journal article
- Relation: Intelligent Systems with Applications Vol. 14, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Recently, the number of road accidents has been increased worldwide due to the distraction of the drivers. This rapid road crush often leads to injuries, loss of properties, even deaths of the people. Therefore, it is essential to monitor and analyze the driver's behavior during the driving time to detect the distraction and mitigate the number of road accident. To detect various kinds of behavior like- using cell phone, talking to others, eating, sleeping or lack of concentration during driving; machine learning/deep learning can play significant role. However, this process may need high computational capacity to train the model by huge number of training dataset. In this paper, we made an effort to develop CNN based method to detect distracted driver and identify the cause of distractions like talking, sleeping or eating by means of face and hand localization. Four architectures namely CNN, VGG-16, ResNet50 and MobileNetV2 have been adopted for transfer learning. To verify the effectiveness, the proposed model is trained with thousands of images from a publicly available dataset containing ten different postures or conditions of a distracted driver and analyzed the results using various performance metrics. The performance results showed that the pre-trained MobileNetV2 model has the best classification efficiency. © 2022 The Author(s)
- Authors: Hossain, Md Uzzol , Rahman, Md Ataur , Islam, Md Manowarul , Akhter, Arnisha , Uddin, Md Ashraf , Paul, Bikash
- Date: 2022
- Type: Text , Journal article
- Relation: Intelligent Systems with Applications Vol. 14, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Recently, the number of road accidents has been increased worldwide due to the distraction of the drivers. This rapid road crush often leads to injuries, loss of properties, even deaths of the people. Therefore, it is essential to monitor and analyze the driver's behavior during the driving time to detect the distraction and mitigate the number of road accident. To detect various kinds of behavior like- using cell phone, talking to others, eating, sleeping or lack of concentration during driving; machine learning/deep learning can play significant role. However, this process may need high computational capacity to train the model by huge number of training dataset. In this paper, we made an effort to develop CNN based method to detect distracted driver and identify the cause of distractions like talking, sleeping or eating by means of face and hand localization. Four architectures namely CNN, VGG-16, ResNet50 and MobileNetV2 have been adopted for transfer learning. To verify the effectiveness, the proposed model is trained with thousands of images from a publicly available dataset containing ten different postures or conditions of a distracted driver and analyzed the results using various performance metrics. The performance results showed that the pre-trained MobileNetV2 model has the best classification efficiency. © 2022 The Author(s)
A hybrid metaheuristic approach using random forest and particle swarm optimization to study and evaluate backbreak in open-pit blasting
- Dai, Yong, Khandelwal, Manoj, Qiu, Yingui, Zhou, Jian, Monjezi, Monjezi, Yang, Peixi
- Authors: Dai, Yong , Khandelwal, Manoj , Qiu, Yingui , Zhou, Jian , Monjezi, Monjezi , Yang, Peixi
- Date: 2022
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 34, no. 8 (2022), p. 6273-6288
- Full Text:
- Reviewed:
- Description: Backbreak is a rock fracture problem that exceeds the limits of the last row of holes in an explosion operation. Excessive backbreak increases operational costs and also poses a threat to mine safety. In this regard, a new hybrid intelligence approach based on random forest (RF) and particle swarm optimization (PSO) is proposed for predicting backbreak with high accuracy to reduce the unsolicited phenomenon induced by backbreak in open-pit blasting. A data set of 234 samples with six input parameters including special drilling (SD), spacing (S), burden (B), hole length (L), stemming (T) and powder factor (PF) and one output parameter backbreak (BB) is set up in this study. Seven input combinations (one with six parameters, six with five parameters) are built to generate the optimal prediction model. The PSO algorithm is integrated with the RF algorithm to find the optimal hyper-parameters of each model and the fitness function, which is the mean absolute error (MAE) of ten cross-validations. The performance capacities of the optimal models are assessed using MAE, root-mean-square error (RMSE), Pearson correlation coefficient (R2) and mean absolute percentage error (MAPE). Findings demonstrated that the PSO–RF model combining L–S–B–T–PF with MAE of 0.0132 and 0.0568, RMSE of 0.0811 and 0.1686, R2 of 0.9990 and 0.9961 and MAPE of 0.0027 and 0.0116 in training and testing phases, respectively, has optimal prediction performance. The optimal PSO–RF models were compared with the classical artificial neural network, RF, genetic programming, support vector machine and convolutional neural network models and show that the PSO–RF model has superiority in predicting backbreak. The Gini index of each input variable has also been calculated in the RF model, which was 31.2 (L), 23.1 (S), 27.4 (B), 36.6 (T), 23.4 (PF) and 16.9 (SD), respectively. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
- Authors: Dai, Yong , Khandelwal, Manoj , Qiu, Yingui , Zhou, Jian , Monjezi, Monjezi , Yang, Peixi
- Date: 2022
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 34, no. 8 (2022), p. 6273-6288
- Full Text:
- Reviewed:
- Description: Backbreak is a rock fracture problem that exceeds the limits of the last row of holes in an explosion operation. Excessive backbreak increases operational costs and also poses a threat to mine safety. In this regard, a new hybrid intelligence approach based on random forest (RF) and particle swarm optimization (PSO) is proposed for predicting backbreak with high accuracy to reduce the unsolicited phenomenon induced by backbreak in open-pit blasting. A data set of 234 samples with six input parameters including special drilling (SD), spacing (S), burden (B), hole length (L), stemming (T) and powder factor (PF) and one output parameter backbreak (BB) is set up in this study. Seven input combinations (one with six parameters, six with five parameters) are built to generate the optimal prediction model. The PSO algorithm is integrated with the RF algorithm to find the optimal hyper-parameters of each model and the fitness function, which is the mean absolute error (MAE) of ten cross-validations. The performance capacities of the optimal models are assessed using MAE, root-mean-square error (RMSE), Pearson correlation coefficient (R2) and mean absolute percentage error (MAPE). Findings demonstrated that the PSO–RF model combining L–S–B–T–PF with MAE of 0.0132 and 0.0568, RMSE of 0.0811 and 0.1686, R2 of 0.9990 and 0.9961 and MAPE of 0.0027 and 0.0116 in training and testing phases, respectively, has optimal prediction performance. The optimal PSO–RF models were compared with the classical artificial neural network, RF, genetic programming, support vector machine and convolutional neural network models and show that the PSO–RF model has superiority in predicting backbreak. The Gini index of each input variable has also been calculated in the RF model, which was 31.2 (L), 23.1 (S), 27.4 (B), 36.6 (T), 23.4 (PF) and 16.9 (SD), respectively. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
Cognitive AmBC-NOMA IoV-MTS networks with IQI : reliability and security analysis
- Li, Xingwang, Zheng, Yike, Alshehri, Mohammad, Hai, Linpeng, Balasubramanian, Venki, Zeng, Ming, Nie, Gaofeng
- Authors: Li, Xingwang , Zheng, Yike , Alshehri, Mohammad , Hai, Linpeng , Balasubramanian, Venki , Zeng, Ming , Nie, Gaofeng
- Date: 2023
- Type: Text , Journal article
- Relation: IEEE Transactions on Intelligent Transportation Systems Vol. 24, no. 2 (2023), p. 2596-2607
- Full Text: false
- Reviewed:
- Description: Internet-of-Vehicle (IoV) enabled Maritime Transportation Systems (MTS) communication is anticipated to support ultra-reliable and low latency, diverse quality-of-service (QoS) and large-scale connectivities. To meet such stringent demands, a cognitive ambient backscatter non-orthogonal multiple access (C-AmBC-NOMA) IoV-MTS network is proposed. We explore the reliable and secure performance of the proposed C-AmBC-NOMA IoV-MTS network with in-phase and quadrature phase imbalance (IQI) at radio-frequency (RF) front-ends and the existence of an eavesdropper. In particular, the analytical expressions on the outage probability (OP) and intercept probability (IP) are obtained after a series of calculations. For a deeper understanding, we discuss the asymptotic behavior of OPs in the high signal-to-noise ratio (SNR) region, the diversity orders of OPs, and IPs in the high main-to-eavesdropper ratio (MER) regime. The results of Monte-Carlo simulation and a series of corresponding theoretical analysis show that: i) As the SNR approaches infinity, the OPs tend to be fixed non-negative values, indicating that the diversity orders of the OPs have error floors; ii) When the MER approaches infinity, the IPs of legitimate users decrease continuously, while the IP of backscatter device (BD) increases; iii) Compared with the system performance under ideal condition, the system performance is less reliable under IQI condition, but the security performance is enhanced; iv) By carefully selecting the system parameters, a trade-off can be achieved between reliability and security. © 2000-2011 IEEE.
Exploring human mobility for multi-pattern passenger prediction : a graph learning framework
- Kong, Xiangjiea, Wang, Kailai, Hou, Mingliang, Xia, Feng, Karmakar, Gour, Li, Jianxin
- Authors: Kong, Xiangjiea , Wang, Kailai , Hou, Mingliang , Xia, Feng , Karmakar, Gour , Li, Jianxin
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Intelligent Transportation Systems Vol. 23, no. 9 (2022), p. 16148-16160
- Full Text:
- Reviewed:
- Description: Traffic flow prediction is an integral part of an intelligent transportation system and thus fundamental for various traffic-related applications. Buses are an indispensable way of moving for urban residents with fixed routes and schedules, which leads to latent travel regularity. However, human mobility patterns, specifically the complex relationships between bus passengers, are deeply hidden in this fixed mobility mode. Although many models exist to predict traffic flow, human mobility patterns have not been well explored in this regard. To address this research gap and learn human mobility knowledge from this fixed travel behaviors, we propose a multi-pattern passenger flow prediction framework, MPGCN, based on Graph Convolutional Network (GCN). Firstly, we construct a novel sharing-stop network to model relationships between passengers based on bus record data. Then, we employ GCN to extract features from the graph by learning useful topology information and introduce a deep clustering method to recognize mobility patterns hidden in bus passengers. Furthermore, to fully utilize spatio-temporal information, we propose GCN2Flow to predict passenger flow based on various mobility patterns. To the best of our knowledge, this paper is the first work to adopt a multi-pattern approach to predict the bus passenger flow by taking advantage of graph learning. We design a case study for optimizing routes. Extensive experiments upon a real-world bus dataset demonstrate that MPGCN has potential efficacy in passenger flow prediction and route optimization. © 2000-2011 IEEE.
- Authors: Kong, Xiangjiea , Wang, Kailai , Hou, Mingliang , Xia, Feng , Karmakar, Gour , Li, Jianxin
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Intelligent Transportation Systems Vol. 23, no. 9 (2022), p. 16148-16160
- Full Text:
- Reviewed:
- Description: Traffic flow prediction is an integral part of an intelligent transportation system and thus fundamental for various traffic-related applications. Buses are an indispensable way of moving for urban residents with fixed routes and schedules, which leads to latent travel regularity. However, human mobility patterns, specifically the complex relationships between bus passengers, are deeply hidden in this fixed mobility mode. Although many models exist to predict traffic flow, human mobility patterns have not been well explored in this regard. To address this research gap and learn human mobility knowledge from this fixed travel behaviors, we propose a multi-pattern passenger flow prediction framework, MPGCN, based on Graph Convolutional Network (GCN). Firstly, we construct a novel sharing-stop network to model relationships between passengers based on bus record data. Then, we employ GCN to extract features from the graph by learning useful topology information and introduce a deep clustering method to recognize mobility patterns hidden in bus passengers. Furthermore, to fully utilize spatio-temporal information, we propose GCN2Flow to predict passenger flow based on various mobility patterns. To the best of our knowledge, this paper is the first work to adopt a multi-pattern approach to predict the bus passenger flow by taking advantage of graph learning. We design a case study for optimizing routes. Extensive experiments upon a real-world bus dataset demonstrate that MPGCN has potential efficacy in passenger flow prediction and route optimization. © 2000-2011 IEEE.
Graph learning : a survey
- Xia, Feng, Sun, Ke, Yu, Shuo, Aziz, Abdul, Wan, Liangtian, Pan, Shirui, Liu, Huan
- Authors: Xia, Feng , Sun, Ke , Yu, Shuo , Aziz, Abdul , Wan, Liangtian , Pan, Shirui , Liu, Huan
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Artificial Intelligence Vol. 2, no. 2 (2021), p. 109-127
- Full Text:
- Reviewed:
- Description: Graphs are widely used as a popular representation of the network structure of connected data. Graph data can be found in a broad spectrum of application domains such as social systems, ecosystems, biological networks, knowledge graphs, and information systems. With the continuous penetration of artificial intelligence technologies, graph learning (i.e., machine learning on graphs) is gaining attention from both researchers and practitioners. Graph learning proves effective for many tasks, such as classification, link prediction, and matching. Generally, graph learning methods extract relevant features of graphs by taking advantage of machine learning algorithms. In this survey, we present a comprehensive overview on the state-of-the-art of graph learning. Special attention is paid to four categories of existing graph learning methods, including graph signal processing, matrix factorization, random walk, and deep learning. Major models and algorithms under these categories are reviewed, respectively. We examine graph learning applications in areas such as text, images, science, knowledge graphs, and combinatorial optimization. In addition, we discuss several promising research directions in this field. Impact Statement—Real-world intelligent systems generally rely on machine learning algorithms handling data of various types. Despite their ubiquity, graph data have imposed unprecedented challenges to machine learning due to their inherent complexity. Unlike text, audio and images, graph data are embedded in an irregular domain, making some essential operations of existing machine learning algorithms inapplicable. Many graph learning models and algorithms have been developed to tackle these challenges. This article presents a systematic review of the state-of-the-art graph learning approaches as well as their potential applications. The article serves multiple purposes. First, it acts as a quick reference to graph learning for researchers and practitioners in different areas such as social computing, information retrieval, computer vision, bioinformatics, economics, and e-commence. Second, it presents insights into open areas of research in the field. Third, it aims to stimulate new research ideas and more interests in graph learning. © IEEE Transactions on Artificial Intelligence 2020.
- Authors: Xia, Feng , Sun, Ke , Yu, Shuo , Aziz, Abdul , Wan, Liangtian , Pan, Shirui , Liu, Huan
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Artificial Intelligence Vol. 2, no. 2 (2021), p. 109-127
- Full Text:
- Reviewed:
- Description: Graphs are widely used as a popular representation of the network structure of connected data. Graph data can be found in a broad spectrum of application domains such as social systems, ecosystems, biological networks, knowledge graphs, and information systems. With the continuous penetration of artificial intelligence technologies, graph learning (i.e., machine learning on graphs) is gaining attention from both researchers and practitioners. Graph learning proves effective for many tasks, such as classification, link prediction, and matching. Generally, graph learning methods extract relevant features of graphs by taking advantage of machine learning algorithms. In this survey, we present a comprehensive overview on the state-of-the-art of graph learning. Special attention is paid to four categories of existing graph learning methods, including graph signal processing, matrix factorization, random walk, and deep learning. Major models and algorithms under these categories are reviewed, respectively. We examine graph learning applications in areas such as text, images, science, knowledge graphs, and combinatorial optimization. In addition, we discuss several promising research directions in this field. Impact Statement—Real-world intelligent systems generally rely on machine learning algorithms handling data of various types. Despite their ubiquity, graph data have imposed unprecedented challenges to machine learning due to their inherent complexity. Unlike text, audio and images, graph data are embedded in an irregular domain, making some essential operations of existing machine learning algorithms inapplicable. Many graph learning models and algorithms have been developed to tackle these challenges. This article presents a systematic review of the state-of-the-art graph learning approaches as well as their potential applications. The article serves multiple purposes. First, it acts as a quick reference to graph learning for researchers and practitioners in different areas such as social computing, information retrieval, computer vision, bioinformatics, economics, and e-commence. Second, it presents insights into open areas of research in the field. Third, it aims to stimulate new research ideas and more interests in graph learning. © IEEE Transactions on Artificial Intelligence 2020.
- Mak, Nguoy, Ooi, Ean, Lau, Ee, Ooi, Ean Tat, Pamidi, Narendra, Foo, Ji, Mohd Ali, Ahmad
- Authors: Mak, Nguoy , Ooi, Ean , Lau, Ee , Ooi, Ean Tat , Pamidi, Narendra , Foo, Ji , Mohd Ali, Ahmad
- Date: 2022
- Type: Text , Journal article
- Relation: Computer Methods and Programs in Biomedicine Vol. 227, no. (2022), p.
- Full Text: false
- Reviewed:
- Description: Background and objectives: Thermochemical ablation (TCA) is a thermal ablation technique involving the injection of acid and base, either sequentially or simultaneously, into the target tissue. TCA remains at the conceptual stage with existing studies unable to provide recommendations on the optimum injection rate, and reagent concentration and volume. Limitations in current experimental methodology have prevented proper elucidation of the thermochemical processes inside the tissue during TCA. Nevertheless, the computational TCA framework developed recently by Mak et al. [Mak et al., Computers in Biology and Medicine, 2022, 145:105494] has opened new avenues in the development of TCA. Specifically, a recommended safe dosage is imperative in driving TCA research beyond the conceptual stage. Methods: The aforesaid computational TCA framework for sequential injection was applied and adapted to simulate TCA with simultaneous injection of acid and base at equimolar and equivolume. The developed framework, which describes the flow of acid and base, their neutralisation, the rise in tissue temperature and the formation of thermal damage, was solved numerically using the finite element method. The framework will be used to investigate the effects of injection rate, reagent concentration, volume and type (weak/strong acid-base combination) on temperature rise and thermal coagulation formation. Results: A higher injection rate resulted in higher temperature rise and larger thermal coagulation. Reagent concentration of 7500 mol/m3 was found to be optimum in producing considerable thermal coagulation without the risk of tissue overheating. Thermal coagulation volume was found to be consistently larger than the total volume of acid and base injected into the tissue, which is beneficial as it reduces the risk of chemical burn injury. Three multivariate second-order polynomials that express the targeted coagulation volume as functions of injection rate and reagent volume, for the weak-weak, weak-strong and strong-strong acid-base combinations were also derived based on the simulated data. Conclusions: A guideline for a safe and effective implementation of TCA with simultaneous injection of acid and base was recommended based on the numerical results of the computational model developed. The guideline correlates the coagulation volume with the reagent volume and injection rate, and may be used by clinicians in determining the safe dosage of reagents and optimum injection rate to achieve a desired thermal coagulation volume during TCA. © 2022 Elsevier B.V.
Development and validation of a miniature programmable tDCS device
- Kouzani, Abbas, Jaberzadeh, Shapour, Zoghi, Maryam, Usma, Clara, Parastarfeizabadi, Mahboubeh
- Authors: Kouzani, Abbas , Jaberzadeh, Shapour , Zoghi, Maryam , Usma, Clara , Parastarfeizabadi, Mahboubeh
- Date: 2016
- Type: Text , Journal article
- Relation: IEEE Transactions on Neural Systems and Rehabilitation Engineering Vol. 24, no. 1 (2016), p. 192-198
- Full Text: false
- Reviewed:
- Description: Research is being conducted on the use of transcranial direct current stimulation (tDCS) for therapeutic effects, and also on the mechanisms through which such therapeutic effects are mediated. A bottleneck in the progress of the research has been the large size of the existing tDCS systems which prevents subjects from performing their daily activities. To help research into the principles, mechanisms, and benefits of tDCS, reduction of size and weight, improvement in simplicity and user friendliness, portability, and programmability of tDCS systems are vital. This paper presents a design for a low-cost, light-weight, programmable, and portable tDCS device. The device is head-mountable and can be concealed in a hat and worn on the head by the subject while receiving the stimulation. The strength of the direct current stimulation can be selected through a simple user interface. The device is constructed and its performance evaluated through bench and in vivo tests. The tests validated the operation of the device in inducing neuromodulatory changes in primary motor cortex, M1, through measuring excitability of dominant M1 of resting right first dorsal interosseus muscle by transcranial magnetic stimulation induced motor evoked potentials. It was observed that the tDCS device induced comparable neuromodulatory effects in M1 as the existing bulky tDCS systems.
Finding compact and well-separated clusters : clustering using silhouette coefficients
- Bagirov, Adil, Aliguliyev, Ramiz, Sultanova, Nargiz
- Authors: Bagirov, Adil , Aliguliyev, Ramiz , Sultanova, Nargiz
- Date: 2023
- Type: Text , Journal article
- Relation: Pattern Recognition Vol. 135, no. (2023), p.
- Relation: http://purl.org/au-research/grants/arc/DP190100580
- Full Text: false
- Reviewed:
- Description: Finding compact and well-separated clusters in data sets is a challenging task. Most clustering algorithms try to minimize certain clustering objective functions. These functions usually reflect the intra-cluster similarity and inter-cluster dissimilarity. However, the use of such functions alone may not lead to the finding of well-separated and, in some cases, compact clusters. Therefore additional measures, called cluster validity indices, are used to estimate the true number of well-separated and compact clusters. Some of these indices are well-suited to be included into the optimization model of the clustering problem. Silhouette coefficients are among such indices. In this paper, a new optimization model of the clustering problem is developed where the clustering function is used as an objective and silhouette coefficients are used to formulate constraints. Then an algorithm, called CLUSCO (CLustering Using Silhouette COefficients), is designed to construct clusters incrementally. Three schemes are discussed to reduce the computational complexity of the algorithm. Its performance is evaluated using fourteen real-world data sets and compared with that of three state-of-the-art clustering algorithms. Results show that the CLUSCO is able to compute compact clusters which are significantly better separable in comparison with those obtained by other algorithms. © 2022 Elsevier Ltd
A smart healthcare framework for detection and monitoring of COVID-19 using IoT and cloud computing
- Nasser, Nidal, Emad-ul-Haq, Qazi, Imran, Muhammad, Ali, Asmaa, Razzak, Imran, Al-Helali, Abdulaziz
- Authors: Nasser, Nidal , Emad-ul-Haq, Qazi , Imran, Muhammad , Ali, Asmaa , Razzak, Imran , Al-Helali, Abdulaziz
- Date: 2023
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 35, no. 19 (2023), p. 13775-13789
- Full Text:
- Reviewed:
- Description: Coronavirus (COVID-19) is a very contagious infection that has drawn the world’s attention. Modeling such diseases can be extremely valuable in predicting their effects. Although classic statistical modeling may provide adequate models, it may also fail to understand the data’s intricacy. An automatic COVID-19 detection system based on computed tomography (CT) scan or X-ray images is effective, but a robust system design is challenging. In this study, we propose an intelligent healthcare system that integrates IoT-cloud technologies. This architecture uses smart connectivity sensors and deep learning (DL) for intelligent decision-making from the perspective of the smart city. The intelligent system tracks the status of patients in real time and delivers reliable, timely, and high-quality healthcare facilities at a low cost. COVID-19 detection experiments are performed using DL to test the viability of the proposed system. We use a sensor for recording, transferring, and tracking healthcare data. CT scan images from patients are sent to the cloud by IoT sensors, where the cognitive module is stored. The system decides the patient status by examining the images of the CT scan. The DL cognitive module makes the real-time decision on the possible course of action. When information is conveyed to a cognitive module, we use a state-of-the-art classification algorithm based on DL, i.e., ResNet50, to detect and classify whether the patients are normal or infected by COVID-19. We validate the proposed system’s robustness and effectiveness using two benchmark publicly available datasets (Covid-Chestxray dataset and Chex-Pert dataset). At first, a dataset of 6000 images is prepared from the above two datasets. The proposed system was trained on the collection of images from 80% of the datasets and tested with 20% of the data. Cross-validation is performed using a tenfold cross-validation technique for performance evaluation. The results indicate that the proposed system gives an accuracy of 98.6%, a sensitivity of 97.3%, a specificity of 98.2%, and an F1-score of 97.87%. Results clearly show that the accuracy, specificity, sensitivity, and F1-score of our proposed method are high. The comparison shows that the proposed system performs better than the existing state-of-the-art systems. The proposed system will be helpful in medical diagnosis research and healthcare systems. It will also support the medical experts for COVID-19 screening and lead to a precious second opinion. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
- Authors: Nasser, Nidal , Emad-ul-Haq, Qazi , Imran, Muhammad , Ali, Asmaa , Razzak, Imran , Al-Helali, Abdulaziz
- Date: 2023
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 35, no. 19 (2023), p. 13775-13789
- Full Text:
- Reviewed:
- Description: Coronavirus (COVID-19) is a very contagious infection that has drawn the world’s attention. Modeling such diseases can be extremely valuable in predicting their effects. Although classic statistical modeling may provide adequate models, it may also fail to understand the data’s intricacy. An automatic COVID-19 detection system based on computed tomography (CT) scan or X-ray images is effective, but a robust system design is challenging. In this study, we propose an intelligent healthcare system that integrates IoT-cloud technologies. This architecture uses smart connectivity sensors and deep learning (DL) for intelligent decision-making from the perspective of the smart city. The intelligent system tracks the status of patients in real time and delivers reliable, timely, and high-quality healthcare facilities at a low cost. COVID-19 detection experiments are performed using DL to test the viability of the proposed system. We use a sensor for recording, transferring, and tracking healthcare data. CT scan images from patients are sent to the cloud by IoT sensors, where the cognitive module is stored. The system decides the patient status by examining the images of the CT scan. The DL cognitive module makes the real-time decision on the possible course of action. When information is conveyed to a cognitive module, we use a state-of-the-art classification algorithm based on DL, i.e., ResNet50, to detect and classify whether the patients are normal or infected by COVID-19. We validate the proposed system’s robustness and effectiveness using two benchmark publicly available datasets (Covid-Chestxray dataset and Chex-Pert dataset). At first, a dataset of 6000 images is prepared from the above two datasets. The proposed system was trained on the collection of images from 80% of the datasets and tested with 20% of the data. Cross-validation is performed using a tenfold cross-validation technique for performance evaluation. The results indicate that the proposed system gives an accuracy of 98.6%, a sensitivity of 97.3%, a specificity of 98.2%, and an F1-score of 97.87%. Results clearly show that the accuracy, specificity, sensitivity, and F1-score of our proposed method are high. The comparison shows that the proposed system performs better than the existing state-of-the-art systems. The proposed system will be helpful in medical diagnosis research and healthcare systems. It will also support the medical experts for COVID-19 screening and lead to a precious second opinion. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
An intelligent heart disease prediction system based on swarm-artificial neural network
- Nandy, Sudarshan, Adhikari, Mainak, Balasubramanian, Venki, Menon, Varun, Li, Xingwang, Zakarya, Muhammad
- Authors: Nandy, Sudarshan , Adhikari, Mainak , Balasubramanian, Venki , Menon, Varun , Li, Xingwang , Zakarya, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Neural Computing and Applications Vol. 35, no. 20 (2023), p. 14723-14737
- Full Text: false
- Reviewed:
- Description: The accurate prediction of cardiovascular disease is an essential and challenging task to treat a patient efficiently before occurring a heart attack. In recent times, various intelligent healthcare frameworks have been designed with different machine learning and swarm optimization techniques for cardiovascular disease prediction. However, most of the existing strategies failed to achieve higher accuracy for cardiovascular disease prediction due to the lack of data-recognized techniques and proper prediction methodology. Motivated by the existing challenges, in this paper, we propose an intelligent healthcare framework for predicting cardiovascular heart disease based on Swarm-Artificial Neural Network (Swarm-ANN) strategy. Initially, the proposed Swarm-ANN strategy randomly generates predefined numbers of Neural Networks (NNs) for training and evaluating the framework based on their solution consistency. Additionally, the NN populations are trained by two stages of weight changes and their weight is adjusted by a newly designed heuristic formulation. Finally, the weight of the neurons is modified by sharing the global best weight with other neurons and predicts the accuracy of cardiovascular disease. The proposed Swarm-ANN strategy achieves 95.78% accuracy while predicting the cardiovascular disease of the patients from a benchmark dataset. The simulation results exhibit that the proposed Swarm-ANN strategy outperforms the standard learning techniques in terms of various performance matrices. © 2021, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
DQN-based resource allocation for NOMA-MEC-aided multi-source data stream
- Ling, Jing, Xia, Junjuan, Zhu, Fusheng, Gao, Chongzhi, Lai, Shiwei, Balasubramanian, Venki
- Authors: Ling, Jing , Xia, Junjuan , Zhu, Fusheng , Gao, Chongzhi , Lai, Shiwei , Balasubramanian, Venki
- Date: 2023
- Type: Text , Journal article
- Relation: Eurasip Journal on Advances in Signal Processing Vol. 2023, no. 1 (2023), p.
- Full Text:
- Reviewed:
- Description: This paper investigates a non-orthogonal multiple access (NOMA)-aided mobile edge computing (MEC) network with multiple sources and one computing access point (CAP), in which NOMA technology is applied to transmit multi-source data streams to CAP for computing. To measure the performance of the considered NOMA-aided MEC network, we first design the system cost as a linear weighting function of energy consumption and delay under the NOMA-aided MEC network. Moreover, we propose a deep Q network (DQN)-based offloading strategy to minimize the system cost by jointly optimizing the offloading ratio and transmission power allocation. Finally, we design experiments to demonstrate the effectiveness of the proposed strategy. Specifically, the designed strategy can decrease the system cost by about 15% compared with local computing when the number of sources is 5. © 2023, The Author(s).
- Authors: Ling, Jing , Xia, Junjuan , Zhu, Fusheng , Gao, Chongzhi , Lai, Shiwei , Balasubramanian, Venki
- Date: 2023
- Type: Text , Journal article
- Relation: Eurasip Journal on Advances in Signal Processing Vol. 2023, no. 1 (2023), p.
- Full Text:
- Reviewed:
- Description: This paper investigates a non-orthogonal multiple access (NOMA)-aided mobile edge computing (MEC) network with multiple sources and one computing access point (CAP), in which NOMA technology is applied to transmit multi-source data streams to CAP for computing. To measure the performance of the considered NOMA-aided MEC network, we first design the system cost as a linear weighting function of energy consumption and delay under the NOMA-aided MEC network. Moreover, we propose a deep Q network (DQN)-based offloading strategy to minimize the system cost by jointly optimizing the offloading ratio and transmission power allocation. Finally, we design experiments to demonstrate the effectiveness of the proposed strategy. Specifically, the designed strategy can decrease the system cost by about 15% compared with local computing when the number of sources is 5. © 2023, The Author(s).
- «
- ‹
- 1
- ›
- »