Search

To improve the quality and efficiency of machine translation (MT) for low-resource languages (LRLs), this paper analyzes the application of genetic algorithm (GA) under the background of cloud computing (CC). By using GA to optimize MT for LRL, this study aims to address the limitations and challenges of traditional methods on LRL. Firstly, GA under the background of the CC platform is analyzed in detail. The CC platform offers powerful computing and storage capabilities that provide the basis for large-scale optimization using GA. GA is an optimization algorithm based on the principle of biological evolution, which seeks the optimal solution by simulating genes' genetic and evolutionary processes. In MT of LRL, GA can be used to optimize model parameters, select translation rules, and improve translation quality, thereby improving translation results. Secondly, the present situation of MT for LRL is described. Finally, the traditional LRL-oriented MT and the GA-optimized LRL-oriented MT are compared and analyzed. The results reveal that the traditional LRL-oriented MT has low accuracy and low customer satisfaction (CS). Considering the translation time, accuracy, and resource utilization rate (RUR), the highest rate is only about 47%. In contrast, GA-optimized LRL-oriented MT significantly improves translation accuracy and CS, reaching approximately 94%. The final evaluation results indicate that the accuracy of the model is usually above 70%, and up to 94%. Therefore, GA plays an important role in optimization for LRL-oriented MT. This paper provides technical support for optimizing LRL-oriented MT and contributes to the further development of MT technology. By applying GA, the limitations of traditional methods in LRL can be overcome and the quality and efficiency of translation can be improved. It is of great significance to improve the development of translation technology of LRL, enhance cross-language communication, and promote global cultural exchange. [ABSTRACT FROM AUTHOR]

Intelligent Transportation Systems (ITS) are a promising research area that offers a variety of applications. The objective of these applications is to enhance road safety, to optimize traffic efficiency, and to provide a better driving experience. Yet, the efficiency of ITS applications, such as safety and driver assistance applications, relies essentially on the exchanged data between different entities of the network. Accordingly, trust management models are used to guarantee the quality of the data and to eliminate malicious and selfish nodes to secure vehicular communications. In this paper, we pay a special attention to the requirements of trust management models used in the context of ITS applications. We also dissected the trust model to extract the mechanisms used in the literature to fulfil the identified requirements. Furthermore, we present the most known simulators and evaluation metrics that are used to validate the proposed models. The aim of this study is to provide a global overview of the mechanisms that may be used to fulfil the crucial requirements of trust management models. For this purpose, we employed a systematic mapping study, through which we carefully analysed 60 selected articles. Through our analysis, five main requirements were identified: scalability, accuracy, robustness, privacy preservation, appropriate response time. Different mechanisms and techniques were applied to meet with the identified requirements. Two main findings are reported: (1) The accuracy and robustness requirements are the most considered requirements. On the other hand, the privacy requirement is the least covered by the publications, (2) the majority of the reviewed papers focus on addressing two or three requirements at most. A little number of publications covered all the requirements. Based on the identified research gaps, we highlight some future directions that may be investigated. We provide general recommendations that may serve as a guideline for researchers who want to design trust models that fulfil certain requirements. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is an important virtual network that allows remote users to access linked multimedia devices. The development of IoT and its ubiquitous application across various domains of everyday life has led to continuous research efforts. Security is a perceptual concern for researchers involved in IoT as it is a key factor in the acceptance of any innovative technology. Numerous research studies have been conducted concentrating on the level of IoT security on a particular mechanism, on specific applications, or on categorizing vulnerabilities, in order to address a defined situation of securing an IoT network. This present paper aims to comprehensively review potential solutions for securing IoT, between emerging and traditional mechanisms, such as blockchain, machine learning, cryptography, and quantum computing. This study provides a comparative analysis of related papers with their characteristics, pros and cons. Accordingly, it taxonomizes relevant solutions based on their achieved security requirements. Furthermore, the potential benefits and challenges of each of the four mechanisms are discussed. [ABSTRACT FROM AUTHOR]

Location-based skyline queries in road networks can quickly return the desired data to the user from a large amount of data according to the user's needs and location. However, there is no effective mechanism for calculating the road network distance and judging the dominant relationship between data points in the existing skyline queries algorithms in road networks. In this paper, we propose improved dynamic skyline queries in road networks, which can quickly compute all skyline points in road networks. Firstly, this paper proposes a GD-tree index, which efficiently stores the location information of the target tuple in the road network and speeds up the calculation of the road network distance. In addition, the concept of the optimal scan end point is proposed to reduce the calculation cost. The histogram of frequency statistical is proposed for the non-spatial dimension, and the nearest and farthest distance is calculated for the spatial dimension to select the optimal scan end point. Finally, extensive experiments in real road network datasets demonstrate the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The metaverse is seen as a future generation of the Internet in which the virtual and the real merge into a common world. Technologies such as IoT, cloud computing, artificial intelligence or the reality–virtuality continuum underpin the metaverse and condition its evolution. This paper presents a bibliometric study on the WoS database (from 1995 to 2022) to obtain a comprehensive and non-subjective understanding of the metaverse. The study identifies the main subject areas and sources, the leading countries and authors. It also analyzes the evolution over time and the core and future research themes. Extended reality, blockchain, artificial intelligence and sensors are identified as core themes, while building information modeling, digital twins and governance emerge as future themes. Based on the bibliometric study, a general layered metaverse architecture is proposed that streamlines open challenges in the metaverse to assist researchers and companies in introducing innovative and disruptive improvements. [ABSTRACT FROM AUTHOR]

Intelligent Transportation System (ITS) aims to strengthen the connection between vehicles, roads, and people. As the important road information in ITS, intelligent detection of traffic signs has become an important part in the intelligent vehicle. In this paper, a lightweight vehicle mounted multi-scale traffic sign detector is proposed. First, guided by the attention fusion algorithm, an improved feature pyramid network is proposed, named AFPN. Assign weights according to the importance of information and fuse multi-dimensional attention maps to improve feature extraction and information retention capabilities. Second, a multi-head detection structure is designed to improve the positioning and detection capability of the detector. According to the target scale, the corresponding detection head is constructed to improve the target detection accuracy. The experimental results show that compared with other state-of-the-art methods, the proposed method not only has excellent detection accuracy with 50.3% for small targets and 64.8% for large targets but also can better trade-off detection speed and detection accuracy. Furthermore, the proposed detector is deployed on the Jetson Xavier NX and integrated with the vehicle-mounted camera, inverter, and LCD to realize real-time traffic sign detection on the vehicle terminal, and the speed reaches 25.6 FPS. [ABSTRACT FROM AUTHOR]

Supply chain management has become increasingly complex, leading to information loss and delayed transmission, exacerbating the bullwhip effect. Furthermore, the need for more reliable information storage, traceability, and accountability has slowed supply chain management. In this context, blockchain technology (BCT) solves the bullwhip effect problem, as it supports distributed networking, information synchronization among nodes, digital encryption, traceable information, and unchangeable block content. This paper proposes using public blockchain to solve the bullwhip effect problem in the supply chain (SC), which has yet to be discussed in published academic research papers. To this end, a framework has been developed to determine the readiness of a supply chain for blockchain adoption. This framework includes a checklist to evaluate the motivation, timing, and appropriate platform for adopting blockchain. The framework has been validated using a case study of personal computer devices, which were affected by the Covid-19 pandemic and resulted in semiconductors supply chain disruption. The study involved polling four executives The study involved polling four executives (of large organizations in Egypt and some Middle Eastern countries) representing different stages in the supply chain, they are retail, distribution, manufacturing, and supply. The results showed that while the executives recognized the benefits of adopting blockchain, they were still determining if it was the right time for adoption and did not see the technology ready for their supply chains. Finally, some public blockchain platforms were introduced to help businesses choose the most suitable platform for adoption. [ABSTRACT FROM AUTHOR]

Social networks are the primary source of information sharing, and with the abundant availability of the internet, more and more information is being dumped into social networks from various sources. There is no proper credibility check, so social networks have become the main source for manipulated or inclined news. As information comes in multiple forms, there is a need for multimodal models to detect Fake News. Many features being specific to the domain may mislead the process of classifying news. Obtaining specific features that could retain the framework's capability becomes the point of interest. The paper proposes a novel method first to obtain features from a specific attribute and use a mechanism to derive optimal features that helps in attaining the ability to detect Fake News across domains. Genetic algorithms, termed nature-driven, aim at exploring the best optimal features that enhance the detection capability of the framework. Therefore, the paper proposes a model that works on textual features, metadata, and author embedding data and uses genetic algorithms to extract optimal features. These multimodal are combined using fusion methods, and finally, 2-Layer MLP is used to detect the Fake posts. Fakeddit, a multimodal dataset, is used for analysis. Text features are generated from the Title parameter, which is used as clickbait to attract attention. Genetic algorithms like two-phase gray wolf (TMGWO) and improved sine cosine algorithms (ISCA) are used to extract the best optimal features from the dataset. The proposed model has achieved an accuracy of 91.05% when ISCA is used to extract optimal features, BERT is used to analyze textual features, and metadata and author embedding are combined using Concatenate. The model has shown that extracting optimal features has enhanced the overall accuracy of the multimodal model. The proposed model is observed to outperform other state-of-the-art models working on similar data. To the best of our knowledge, the proposed framework is prominent in obtaining specific features that could help to classify news or articles as real or fake using the blend of Genetic-based and fusion-based models. [ABSTRACT FROM AUTHOR]

In recent years, the development of IOTA, a new type of Distributed Ledger (DL) for internet of things (IoT), has gained significant attention. IOTA DL offers key features like scalability, fast and free transactions, making it an optimal choice for IoT devices. However, a major concern with IOTA DL is its reliance on a single coordinator for transaction confirmation. This default coordinator introduces issues of single point of failure and incomplete distribution. To address these limitations, this paper proposes the Multiple Coordinator Selection (MCS) algorithm. MCS aims to overcome the problem by involving multiple coordinators in the consensus process. Four metrics, namely "trust level," "distance from input transactions," "node activity," and "transaction distribution," are defined as properties for coordinator selection. Additionally, a checklist is employed to minimize the probability of collusion within the system. Furthermore, the paper introduces a three-layered architecture based on cloud and fog computing, where the MCS algorithm is implemented. Experimental results demonstrate improved security and distribution of the system, while reducing the chances of collusion and single point of failure. [ABSTRACT FROM AUTHOR]

Document similarity recognition is one of the most important problems in natural language processing. This paper proposes a plagiarism comparison mechanism called JCF. Initially, the TF–IDF scheme is applied to build a bag of words as the representation of the common features of all documents. Then, the plagiarism comparison is carried out in a coarse-grained manner, which speeds up the similarity comparison. Finally, the most similar documents can then be compared in detail based on a fine-grained approach. In addition, the JCF detects plagiarism at both syntax level and semantic-like level. To prevent the distortion of similarity comparison, this paper further develops a similarity restoration approach such that the proposed JCF can obtain both advantages of quickness and accuracy. Performance studies confirm that the proposed JCF outperforms existing studies in terms of precision, recall and F1 score. [ABSTRACT FROM AUTHOR]

Software testing is an efficient way to guarantee the reliability and accuracy of parallel programs. Communication plays a substantial role in parallel program testing. The huge scale of communication within parallel programs poses a great challenge to coverage testing. How to reasonably select the communication to be tested and effectively generate test data to meet the requirements of coverage is a pressing problem. In this paper, a critical communication testing method based on branch transformation is proposed, which can reasonably select part of program communication and generate test data. To be specific, firstly, this paper analyzes the features which easily lead to defects in communication, and then proposes the evaluation method of critical communication based on the above features. Next, we select the critical communication and convert the communication coverage to the coverage of the branch where the communication statement resides. Finally, a method based on genetic algorithm is used to solve the communication coverage problem in different scenarios. The proposed method is applied to the testing of several representative parallel programs. Experimental results show that compared with other methods, this proposed method can effectively reduce the quantity of communication, significantly improve the coverage rate of communication coverage testing and increase the efficiency of test data generation. [ABSTRACT FROM AUTHOR]

Blockchain technology has unlocked the doors of building decentralized applications, where security plays a vital role. Any transaction ever created in a blockchain is recorded permanently. With the increasing usage of social media modalities today, many non-reputable sources create and publish fake and luring news. Due to the easy availability of the internet and excessive use of social media, fake news can spread like a flash. It causes the need to eliminate fake news posted on social media platforms. The main motive of the paper is to develop an ensemble model that assists in the automated identification of fake news. This paper addresses the identified gaps in detecting multi-modal fake news. We propose Fake News Network (FNNet) as a novel secure blockchain-based deep learning model to detect fake news. It uses blockchain and deep learning to assure data integrity and learn data representations, respectively. The proposed model consists of four layers: the node layer, the deep learning layer, the blockchain layer, and the network layer. This is an ensemble deep-learning model that leverages Bi-LSTM and CNN models, where the Bi-LSTM model captures the sequential data in both directions, and CNN captures the hidden features. We use Pheme, CrisisLexT6, and ISOT datasets to train the model. FNNet achieves an average accuracy of 86.93%, 92.22%, and 98.53% on Pheme, CrisisLexT9, and ISOT datasets, respectively. Our results show that the proposed model is robust and applicable to real-time datasets and social media networks to detect fake news effectively. [ABSTRACT FROM AUTHOR]

The growing depletion of fossil fuels has led to the use of distributed renewable energy sources. This shift has altered the grid structure from centralized to distributed, where energy flows from multiple sources through multiple paths, besides producing a more competitive and dynamic energy market, posing new problems to power system management. To tackle the issue of effectively utilizing renewable energy sources, the energy internet (EI) was developed, in which devices are connected by energy routers. Therefore, efficiently transmitting energy within the EI has become a prominent topic in research. Despite the existence of algorithms and reviews in the literature on energy routing, there is still a lack of a thorough and comprehensive comparison of these existing algorithms. This paper classifies current energy routers and discusses and categorizes energy routing algorithms based on their methods. Additionally, the paper conducts extensive simulations to compare several energy routing algorithms in detail. [ABSTRACT FROM AUTHOR]

Within the realm of social networks, most research efforts have concentrated on identifying crucial nodes in networks, with little attention paid to identifying critical edges. Nevertheless, edges, serving as conduits for information dissemination, hold significant importance. Mining critical edges in networks can serve as a valuable target for both network disassembly as an attack strategy and network preservation as a defensive measure. This paper introduces the k -sup structure by taking into account the strength of relationships between nodes and investigates the critical subgraph based on the k -sup structure. Furthermore, this paper distinguishes between the significance of inter-community edges and intra-community edges, proposing an importance indicator based on the k -sup structure. To validate the effectiveness of the proposed indicator, comparative experiments are conducted with seven classic edge importance indicators on eight real-world network datasets and three synthetic network datasets. The experimental results demonstrate that the proposed indicator assesses their importance, exhibiting superiority over alternative methods in terms of network connectivity. [ABSTRACT FROM AUTHOR]

Controller placement issue (CPI) in software-defined networks (SDNs) describes the controllers' number, location, and assigning of forwarding devices to controllers. Recently, mathematical formulations and algorithms have been proposed to solve various problems in SDNs and software-defined wide area networks. The comprehensive literature review can be divided into four groups according to objectives: (i) minimizing latency between forwarding devices or switches and their corresponding controllers, and minimizing latency between controllers, (ii) improving network resilience and stability, (iii) minimizing energy consumption and installation costs and (iv) using multi-objective approaches. In addition to the objectives of each research, the importance of this paper is to examine the CPI in terms of reducing the network search space in order to optimally place the controller and how to assign switches to the controllers. In this paper, first the mathematical formulations in previous studies will be examined and then, for solving CPI, the existing algorithms will be discussed. Different classifications of CPIs and related formulas/algorithms, descriptions, advantages and disadvantages will be separately provided. A comprehensive comparison of proposed approaches with their advantages and disadvantages in the summarized tables will be provided. Also, a comparative discussion of different statistics of CPIs will be presented in terms of some technical features such as objective-oriented problems and parameters in four categories, estimated environments, and efficient estimating factors in CPIs. Finally, we explained the future studies' challenges, problems related to CPIs, ideas and following orientations in this field. [ABSTRACT FROM AUTHOR]

As the foundation of circuits and electronic systems, the quality of printed circuit boards (PCBs) is directly related to the reliability of the whole system. At present, deep learning-based target detection technology has a broad application prospect in PCB defect detection. However, there are still some shortcomings in the process of detection. For example, the detection speed is slow, and the detection accuracy is not ideal for defects with small size. Therefore, this paper proposes an improved algorithm based on the YOLOv5s model to improve the detection of PCB defects. The algorithm enhances the connection between the shallow and high layers of the network by improving the backbone network structure. Meanwhile, a self-attention mechanism is introduced into YoloHead to enhance the feature extraction and the ability to focus on the global information of the feature map, and the self-attention mechanism is optimized by combining the computational characteristics of the SENet, the CBAM and the residual unit. While improving the accuracy of PCB defect detection, better computational efficiency is ensured. In subsequent experiments, this paper trains and tests the improved YOLOv5s algorithm using publicly available PCB defect datasets. The results show that the algorithm achieves a detection rate of 39.7 frames per second and a maximum average precision of 96.14%, which is a 4.68% improvement over the original YOLOv5s. [ABSTRACT FROM AUTHOR]

Community detection is a significant research area in social networks. Most methods use network topology, but combining it with user interactions improves accuracy. This paper proposes a robust method to identify communities based on the improved user interaction degree, the weighted quasi-local structural similarity measure, and the frequent pattern mining on user interactions. In the community creation phase, influential users are identified based on eigenvector centrality and users who interact with them the most are extracted based on frequent pattern mining. In the community expansion phase, we introduce a measure to calculate the degree of user interactions based on the local clustering coefficient improved by interactions between common neighbors. We present two strategies to expand the community. The first strategy, a direct connection, exists between a user outside and a user inside the community. Their similarity is calculated based on the combined measure of improved user interaction degree and user degrees. The second strategy is if two users do not have a direct connection, we consider their communication paths. Therefore, we present a similarity measure combining a quasi-local path-based measure and an improved user interaction degree. Analysis of Higgs Twitter and Flickr datasets using internal density, Normalized Mutual Information, and Adjusted Rand Index shows that this paper's method outperforms the other five community detection methods. Furthermore, our method has more robustness than other relevant methods. [ABSTRACT FROM AUTHOR]

Gait recognition has become an important biometric feature for human identification, in addition to data such as face, iris, and fingerprint. The goal of human gait recognition is to identify people based on walking images. Artificial intelligence technologies have revolutionized the field of gait recognition by enabling computers to automatically learn and extract intricate patterns. These techniques examine video recordings to determine key features in an individual's gait, and these features are used to identify the person. This paper examines the existing appearance-based gait recognition methods that have been published in recent years. The primary objective of this paper is to provide an informative survey of the state-of-the-art in appearance-based gait recognition techniques, highlighting their applications, strengths, and limitations. Through our analysis, we aim to highlight the significant advance that has been made in this field, draw attention to the challenges that have been faced, and identify areas of prospective future research and advances in technology. Furthermore, we comprehensively examine common datasets used in gait recognition research. By analyzing the latest developments in appearance-based gait recognition, our study aims to be a helpful resource for researchers, providing an extensive overview of current methods and guiding future attempts in this dynamic field. [ABSTRACT FROM AUTHOR]

This paper introduces a sophisticated approach to network security, with a primary emphasis on utilizing deep learning for intrusion detection. In real-world scenarios, the high dimensionality of training data poses challenges for simple deep learning models and can lead to vanishing gradient issues with complex neural networks. Additionally, uploading network traffic data to a central server for training raises privacy concerns. To tackle these issues, the paper introduces a Residual Network (ResNet)-based deep learning model trained using a federated learning approach. The ResNet effectively tackles the vanishing gradient problem, while federated learning enables multiple Internet Service Providers (ISPs) or clients to engage in joint training without sharing their data with third parties. This approach enhances accuracy through collaborative learning while maintaining privacy. Experimental results on the X-IIoTID dataset indicate that the proposed model outperforms conventional deep learning and machine learning methods in terms of accuracy and other metrics used for evaluation. Specifically, the proposed methodology achieved 99.43% accuracy in a centralized environment and 99.16% accuracy in a federated environment. [ABSTRACT FROM AUTHOR]

Traditional camera sensors rely on human observation. However, in complex scenes, people often experience fatigue when observing objects of various sizes. Moreover, human cognitive abilities have inherent limitations, leading to potential judgment errors. To overcome these challenges, object recognition technology, a pivotal means of categorizing objects captured by camera sensors is introduced. This paper presents a specialized small-size object detection algorithm designed for unique scenarios. This algorithm offers distinct advantages, including enhanced accuracy in detecting small-size objects and improved detection performance for objects of various sizes. The main innovations in this paper include the following three points. Firstly, summarizing a small-size object detection layer and reconfiguring both the feature extraction network and the feature fusion network to enhance the effectiveness of capturing small-size objects. Secondly, SPD-Conv modules are introduced to replace stride convolutions and pooling layers to improve the detection accuracy of small objects. Finally, employing the MPDIoU loss function to enhance the precision of bounding box fitting. In our experiments. We utilized authoritative official datasets. The experimental results on the Visdrone dataset demonstrate a 10.9% increase in mAP0.5 and a 9.3% increase in mAP0.5:0.95 rates compared to the original YOLOv8s. This model not only meets the accuracy requirements but also accounts for the lightweight demands when deployed on embedded devices. [ABSTRACT FROM AUTHOR]

A promising alternative for the CMOS technology is the Quantum-dot Cellular Automata (QCA) technology. In this technology, the low-latency, ultra-dense, and low-power consumption digital circuits are designed. Until now, many digital circuits are designed and improved in the QCA technology. The Arithmetic Logic Unit (ALU) is an important digital circuit that designed in this technology. The reversible logic gates such as NOT, Feynman, and Fredkin gates are important elements in the arithmetic circuits and processors design. In addition, considering the cell arrangements has a great influence on the area and speed of execution of computing devices in the QCA technology. This paper's goal is to build a new multilayer QCA Reversible ALU (RALU). In this paper, we used one HN and three Fredkin gates to design and implement a new and efficient RALU circuit in the QCA technology. The proposed QCA RALU circuit is simulated and tested using QCADesigner tool. The simulation results demonstrate that the developed QCA multilayer RALU has 489 cells, 0.36 µm2 area, 3.75 clock cycles delay, 2.02 meV average energy, and 5.41 nW power dissipation. In addition, the comparison indicates that the developed QCA RALU circuit has advantages compared to other QCA RALU circuits with regards to energy, area, latency, and cost. [ABSTRACT FROM AUTHOR]

Recently, Egypt has recognized the pivotal role of High Performance Computing in advancing science and innovation. Additionally, Egypt realizes the importance of collaboration between different institutions and universities to consolidate their own computational and data resources into a unified platform to serve different disciplines (e.g., scientific, industrial, governmental). Otherwise, additional resources would be needed to be purchased with the associated cost, effort, and time difficulties (e.g., setup, administration, maintenance, etc.). Thus, this paper delves into the architecture and capabilities of the EN-HPCG grid using two different workload management systems: (i) Slurm (Open-Source) and (ii) PBS Pro (Licensed). This paper compares the performance of the grid between Slurm and PBS Pro in specific high-throughput computing (HTC) applications using the NAS Grid parallel benchmark (NGB) to determine which workload manager is more suitable for EN-HPCG. The evaluation includes grid-level performance metrics such as throughput, and the number of tasks completed as a function of time. Also, the presented methodology aims to assist potential partners in their decision-making process to join the EN-HPCG grid, with a focus on the site speed-up metric. Our results showed that, unless an open-source solution without cost and license problems is an obligation (in which case, Slurm is the viable solution), then it is not advisable to integrate a cluster with high-speed hardware with a cluster possessing outdated hardware when using the Slurm scheduler. In contrast, the PBS Pro scheduler takes into account online decision-making in a dynamic environment using a unified grid. [ABSTRACT FROM AUTHOR]

With the advancement of society and the improvement of living standards, the significance of students' physical health has become increasingly prominent. However, currently, the assessment and analysis of students' physical health heavily depend on conventional statistical methods. Even with the application of data mining-related methodologies for analysis and evaluation, the exploitation and utilization of physical health big data remain relatively restricted. In this paper, an improved Canopy-K-means algorithm based on principal component analysis (PCA) is used to construct and analyze a portrait of students' physical fitness and health. The method combines data dimensionality reduction techniques and cluster analysis techniques, and its combined performance is the best compared to other algorithms in the ablation experiments for both male and female student data groups. In this paper, the algorithm was used to process the grouping of physical fitness test data of male and female students, realize the construction and analysis of students' physical fitness and health portrait, and give the exercise prescription for different categories of students. In this paper, the physical health test data of students of Yunnan Agricultural University in 2020–2022 were collected to carry out experiments, and the results found that there are differences in physical health status among students of different genders, grades, and majors in this university, and the physical health status of the students of Classes 2018 and 2019 is generally deficient; on different majors, the students of the Faculty of Agricultural Sciences are slightly superior to the Faculty of Science and Technology, and the students of the Faculty of Science and Technology are slightly superior to the students of the Faculty of Humanities and Social Sciences. Our study offers novel methods and ideas for the assessment and analysis of students' physical health, holding significant implications for schools and related departments in formulating scientific and effective physical education policies and health promotion strategies. [ABSTRACT FROM AUTHOR]

The intrusion detection system is responsible for revealing different intrusion activities, including the denial of service, man-in-middle, Mirai, Scan, and other types of intrusion activities. It is used in many applications, including the smart home Internet of Things networks, where security risks threaten the privacy of individuals. In this context, many works were proposed for detecting and classifying the different types of attacks. However, many challenges are identified for this type of problem, such as the large amount of data available, the imbalanced nature of the data, and the quality of detection and classification outcomes. This paper aims to address these challenges by proposing an approach that considers a metaheuristic-based random weight neural network to detect intrusion activities and classify the different types and subtypes of activities. The following points summarize the contribution of this paper. First, the automatic tuning of the neural network parameters where the weights, biases, regularization value, the number of neurons, and the type of activation function are optimized by different metaheuristic algorithms to produce high-quality results. Second, the proposed approach adopts a clustering with reduction technique to tackle the challenge of processing large volumes of data. Third, oversampling the dataset is also embedded in the proposed approach to avoid a biased classification of the majority class. The experiments are conducted based on a large dataset with more than half a million instances. The results show that the proposed approach outperforms the other classification approaches in geometric mean (G-Mean) and has promising results. [ABSTRACT FROM AUTHOR]

In a permissionless social network environment, it is difficult for a user to assess the trustworthiness of other users. Thus, trust management becomes a crucial issue for securing social activities. The conventional method for assessing trust involves an authority to identify fakes. However, generative AI is gradually reducing the ability to distinguish by producing vivid news or images. Additionally, modern social networks are becoming flatter and more diverse, making conventional trust management methods unfeasible. There is an urgent need to design a suitable blockchain consensus for decentralized trust management. In this paper, we propose a novel three-layer autonomous trust management model for online social users based on blockchain technology and group decision making. Instead of solving a hash puzzle, which consumes too much computational resources for social network users, this paper proposes a lightweight and verifiable blockchain consensus proof of trust for decentralized trust management. Furthermore, performance analysis and simulation results show that our model is valid and flexible for both synthetic networks and real social networks. [ABSTRACT FROM AUTHOR]

Traditional point cloud simplification methods are slow to process large point clouds and prone to losing small features, which leads to a large loss of point cloud accuracy. In this paper, a new point cloud simplification method using a three-step strategy is proposed, which realizes efficient reduction of large point clouds while preserving fine features through point cloud down-sampling, normal vector calibration, and feature extraction based on the proposed feature descriptors and neighborhood subdivision strategy. In this paper, we validate the method using measured point clouds of large co-bottomed component surfaces, visualize the errors, and compare it with other methods. The results demonstrate that this method is well-suited for efficiently reducing large point clouds, even those on the order of ten million points, while maintaining high accuracy in feature retention, refinement precision, efficiency, and robustness to noise. [ABSTRACT FROM AUTHOR]

This paper proposes a parallel algorithm exploiting heterogeneous computing and edge computing for anomaly detection (AD) in remotely sensed multispectral images. These images present high spatial resolution and are captured onboard unmanned aerial vehicles. AD is applied to identify patterns within an image that do not conform to the expected behavior. In this paper, the anomalies correspond to human-made constructions that trigger alarms related to the integrity of fluvial ecosystems. An algorithm based on extracting spatial information by using extinction profiles (EPs) and detecting anomalies by using the Reed–Xiaoli (RX) technique is proposed. The parallel algorithm presented in this paper is designed to be executed on multi-node heterogeneous computing platforms that include nodes with multi-core central processing units (CPUs) and graphics processing units (GPUs) and on a mobile embedded system consisting of a multi-core CPU and a GPU. The experiments are carried out on nodes of the FinisTerrae III supercomputer and, with the objective of analyzing its efficiency under different energy consumption scenarios, on a Jetson AGX Orin. [ABSTRACT FROM AUTHOR]

The software-defined network paradigm, ensembled with a wireless sensor network, has emerged as a promising phenomenon to enable multi-tasking, re-configuration, and scalability. Termed the software-defined wireless sensor network (SDWSN), it divides the network into two planes: data and control. The data plane consists of software-defined sensor nodes (SDSN) that sense monitoring activity and generate data. On the other hand, the control plane has controller/control Nodes (CN) which collect data from SDSN, perform data aggregation, and then transmit toward the sink node. These CNs consume more amount of energy as compared to SDSNs as they perform multiple tasks. Following this scenario, this paper proposes an energy-efficient multi-objective optimization approach to solve the CNs placement problem through a meta-heuristic algorithm by considering the nodes' location, energy, and load distribution. This paper presents a particle swarm optimization-based controller placement and re-placement (PSO-CPR) algorithm for SDWSN. The PSO-CPR elects SDSNs to become CN based on their distance, residual energy, and capacity in the network. Moreover, the placement of a CN rotates within the cluster to avoid its failure and balance energy consumption. The simulation results show improved CN placement with respect to the state-of-the-art algorithms in terms of average delay by 23.5–37.4%, energy consumption by 18.6–32.6%, and probabilistic load distribution by 17.7–54.1%. Moreover, the comparative study also indicates that PSO-CPR achieve promising result by reducing packet loss by 14.4–27.5% and network re-clustering period by 32.3–68.3% and enhance the network lifetime by 22.6–42.5%. [ABSTRACT FROM AUTHOR]

With the development of science and technology, vehicles have gradually become smart network vehicles. However, applications on vehicles require great network and computing performance. It poses a great challenge to the existing Internet of Vehicles (IoV). Cloud computing can relieve the pressure of data processing, but the response time could take a long time. In the edge computing, edge server processing requests can effectively reduce response time. For example, during rush hour, in order to respond quickly, a large number of requests can be sent from the vehicles layer to the edge server. However, due to the limited bandwidth resources of edge servers, it is necessary to develop an effective bandwidth allocation model. The research in this paper consists of two main parts. First, this paper proposes a multi-objective bandwidth allocation optimization model for addressing this issue. The goal is to minimize average response time and maximize bandwidth utilization. Second, a multi-objective sparrow search algorithm (KMSSA) based on K-means algorithm is proposed to solve multi-objective bandwidth allocation. This paper compares KMSSA with particle swarm optimization (PSO) and sparrow search algorithm (SSA) on iFogSim platform. The results show that KMSSA has good optimization performance. The algorithm can be successfully applied to solve global multi-objective optimization problems. To compare with PSO algorithm, the performance of KMSSA is improved by 10%. To compare with SSA, the performance of KMSSA is improved by 5%. Also, KMSSA has superiority in solving practical problems. Its global optimal solution has superior performance in terms of average response time, bandwidth utilization, energy consumption, and cost. [ABSTRACT FROM AUTHOR]

In recent years, action recognition has been an essential branch of video understanding and a hot research direction. Among them, the graph convolutional network (GCN) is widely used in skeleton-based action recognition and has achieved remarkable performance. However, in practical situations, recognizing human action often depends on the movement of a part of the joints. In the existing GCN-based methods, the size of a single frame of the skeleton graph is fixed, and all joints of the human body will participate in the whole operation process, so the critical joints in the moving process cannot be flexibly selected. Therefore, this paper takes the adaptive graph convolutional network (AGCN) as the baseline and uses the graph-pooling method to select the critical joints in the human moving process. We design two new networks: Pooling-AGCN and U-AGCN and use them to form the multi-stream P&U AGCNs for action recognition. Extensive experiments show the complementarity between the two networks and that the method proposed in this paper outperforms the recent work on the three large-scale public datasets (NTU-RGB+D 60, NTU-RGB+D 120, Kinetics-Skeleton). [ABSTRACT FROM AUTHOR]

Developing and executing large-scale data analysis applications in parallel and distributed environments can be a complex and time-consuming task. Developers often find themselves diverted from their application logic to handle technical details about the underlying runtime and related issues. To simplify this process, ParSoDA, a Java library, has been proposed to facilitate the development of parallel data mining applications executed on HPC systems. It simplifies the process by providing built-in scalability mechanisms relying on the Hadoop and Spark frameworks. This paper presents ParSoDA-Py, the Python version of the ParSoDA library, which allows for further support of commonly used runtimes and libraries for big data analysis. After a complete library redesign, ParSoDA can be now easily integrated with other Python-based distributed runtimes for HPC systems, such as COMPSs and Apache Spark, and with the large ecosystem of Python-based data processing libraries. The paper discusses the adaptation process, which takes into consideration the new technical requirements, and evaluates both usability and scalability through some case study applications. [ABSTRACT FROM AUTHOR]

Large number factorization is not only the most critical entry point for Rivest–Shamir–Adleman (RSA) security analysis, but also the most direct means of attacking the asymmetric encryption algorithm RSA. In this paper, the factorization methods of large numbers are summarized and analysed: classical integer factoring algorithms, Shor's circuit model algorithm, quantum adiabatic methods (integer factorization based on a quantum nuclear magnetic resonance (NMR) platform and D-Wave quantum annealing), and hybrid quantum-classical computing. Finally, the feasibility of integer factorization based on quantum adiabatics is discussed. In this paper, quantum annealing is regarded as a quantum attack method that is completely different from the famous Shor algorithm, and the potential of D-Wave factorization of large numbers to crack RSA cryptography is verified, which provides a new idea for a quantum attack on RSA public key cryptography. [ABSTRACT FROM AUTHOR]

3D integration is one of the scalable multiprocessor design solutions. The main challenge in 3D design is temperature traps, especially in the upper layers and hot spots. The current studies present solutions for solving temperature and hotspot problems in topology, routing, and mapping levels. Accordingly, the characteristics of temperature-aware core mapping are beneficial for dealing with the challenges of 3D chips. In this paper, the core temperature is modeled based on processing, communication power, neighbor node temperature, distance from the heat sink, and hotspot node. To find the optimal solution, this paper proposes thermal-aware application mapping techniques using genetic algorithms and fuzzy logic to minimize peak temperatures in 3D network-on-chip (NoC) architectures. Fitness functions include the above parameters with the same weight (GSM) and the fitness function with fuzzy logic by considering the effect of distance from heat sink (GFM1) and heat sink distance and the number of neighbor's core (GFM2). Specifically, the fuzzy logic-based GFM1 algorithm demonstrates superior performance over the genetic algorithm-driven GSM approach in reducing power consumption and energy costs associated with inter-core communication traffic. Across the different traffic patterns tested, GFM1 consistently achieves lower energy expenditure, with reductions upward of 50% compared to GSM. This underlines the strengths of the fuzzy technique in enabling thermal-aware mapping to minimize chip temperatures in the presence of intensive workloads and communication. In essence, the key takeaway is that GFM1 outperforms GSM in the context of power and energy metrics linked to handling on-chip traffic between processing cores. [ABSTRACT FROM AUTHOR]

Research on resource management focuses on optimizing system performance and energy efficiency by distributing shared resources like processor cores, caches, and main memory among competing applications. This research spans a wide range of applications, including those from high-performance computing, machine learning, and mobile computing. Existing research frameworks often simplify research by concentrating on specific characteristics, such as the architecture of the computing nodes, resource monitoring, and representative workloads. For instance, this is typically the case with cloud systems, which introduce additional complexity regarding hardware and software requirements. To avoid this complexity during research, experimental frameworks are being developed. Nevertheless, proposed frameworks often fail regarding the types of nodes included, virtualization support, and management of critical shared resources. This paper presents Stratus, an experimental framework that overcomes these limitations. Stratus includes different types of nodes, a comprehensive virtualization stack, and the ability to partition the major shared resources of the system. Even though Stratus was originally conceived to perform cloud research, its modular design allows Stratus to be extended, broadening its research use on different computing domains and platforms, matching the complexity of modern cloud environments, as shown in the case studies presented in this paper. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is a collaborative artificial intelligence (AI) approach that enables distributed training of AI models without data sharing, thereby promoting privacy by design. However, it is essential to acknowledge that FL only offers a partial solution to safeguard the confidentiality of AI and machine learning (ML) models. Unfortunately, many studies fail to report the results of privacy measurement when applying FL, mainly due to assumptions that privacy is implicitly achieved as FL is a privacy-by-design approach. This trend can also be attributed to the complexity of understanding privacy measurement metrics and methods. This paper presents a survey of privacy measurement in FL, aimed at evaluating its effectiveness in protecting the privacy of sensitive data during the training of AI and ML models. While FL is a promising approach for preserving privacy during model training, ensuring privacy is genuinely achieved in practice is crucial. By evaluating privacy measurement metrics and methods in FL, we can identify the gaps in existing approaches and propose new techniques to enhance FL's privacy. A comprehensive study investigating "privacy measurement and metrics" in FL is therefore required to support the field's growth. Our survey provides a critical analysis of the current state of privacy measurement in FL, identifies gaps in existing research, and offers insights into potential research directions. Moreover, this paper presents a case study that evaluates the effectiveness of various privacy techniques in a specific FL scenario. This case study serves as tangible evidence of the real-world implications of privacy measurements, providing insightful and practical guidelines for researchers and practitioners to optimize privacy preservation while balancing other crucial factors such as communication overhead and accuracy. Finally, our paper outlines a future roadmap for advancing privacy in FL, combining traditional techniques with innovative technologies such as quantum computing and Trusted Execution Environments to fortify data protection. [ABSTRACT FROM AUTHOR]

In order to meet ever-increasing demands for reliable parallel and distributed systems, it is crucial to evaluate the reliability and fault tolerance of their underlying interconnection networks. Such an interconnection network is usually modeled as a connected graph G, where the vertex set and edge set represent the processors and links between processors in the network, respectively. In this paper, we combine Fàbrega's idea about h-extra edge-connectivity and Sampathkumar's concept about r-component edge-connectivity to introduce a more refined parameter for characterizing fault tolerance of interconnection networks, named as h-extra r-component edge-connectivity. Given a connected graph G, for two integers h ≥ 1 and r ≥ 2 , the h-extra r-component edge-connectivity of G, denoted as c λ r h (G) , is the minimum cardinality among all edge subsets F ⊂ E (G) , if any, such that G - F has at least r components, and each component has at least h vertices. As an enhancement on hypercube, the n-dimensional augmented cube AQ n , introduced by Choudum and Sunitha in 2002, reserves several excellent topological properties. As | V (AQ n) | = 2 n , the h-extra three-component edge-connectivity of AQ n is well-defined for each integer h with 1 ≤ h ≤ ⌊ 2 n / 3 ⌋ . In this paper, a generalization of Xu et al.'s conclusion is obtained that finds an upper bound for the exact value of general h-extra three-component edge-connectivity of AQ n and shows that it is sharp for 1 ≤ h ≤ 2 n 2 - 1 and h = 2 c where 1 ≤ c ≤ n - 2 . Let h = ∑ i = 0 s 2 t i be a positive integer with t 0 > t 1 > ⋯ > t s ≥ 0 . Let δ = 0 if h is even and δ = 1 if h is odd. Specifically, c λ 3 h (AQ n) = (4 n - 4) h - 2 ∑ i = 0 s (2 t i - 1) 2 t i - 2 ∑ i = 0 s 4 i · 2 t i - δ for n ≥ 4 , h ≤ 2 n 2 - 1 , and c λ 3 2 c (AQ n) = (2 n - 2 c - 1) 2 c + 1 for n ≥ 4 and 1 ≤ c ≤ n - 2 . [ABSTRACT FROM AUTHOR]

Reconfigurable hardware, extensively employed in mission-critical digital applications like space and military electronics due to its adaptability, encounters the issue of soft errors, especially in control path elements, which could result in functional failure. Various system-level fault tolerance methodologies exist, and this paper implements a bio-inspired fault tolerance technique called evolvable hardware (EHW). The preferred implementation of the EHW system involves hosting the evolutionary algorithm on the processor alongside the reconfigurable hardware. However, this approach encounters delays in the intercommunication of the evolved circuit between the reconfigurable hardware and the processor. To address this issue, the paper proposes a two-tier architecture to achieve absolute fault mitigation in the controller. In this architecture, Tier-1 involves the digital implementation of the genetic algorithm on the reconfigurable hardware to mitigate errors in the controller, while Tier-2 focuses on mitigating errors occurring in Tier-1. The aim is to establish an absolute and self-resilient controller hardware to mitigate faults. The study simulates faults at the target circuit and genetic module as a proof of concept. The proposed two-tier single event upset (SEU) mitigation is deployed on Microsemi's ProAsic3e FPGA (Field Programmable Gate Array), achieving an average efficiency of 91%. This efficiency is accompanied by ten times lesser resource utilization compared to traditional methodologies and a 30% accelerated speed when compared to hybrid evolvable systems. [ABSTRACT FROM AUTHOR]

Forest fire is natural disasters that are sudden, destructive and difficult to handle and rescue, with millions of hectares of forests burned every year all over the world, causing serious ecological damage, loss of life and property. Therefore, timely detection and treatment of early fire is of positive and important significance for forest fire early control. The fire detection method based on image processing is one of the most important means of preventing the occurrence of large-scale forest fires at present by extracting the flame and smoke features in the image and quickly determining the location of the fire. The current deep learning-based forest fire early detection methods have problems such as high false alarm rate due to small detection targets and complex environmental background, and large number of detection model parameters. In view of this, this paper proposes a lightweight early forest fire and smoke detection method based on GS-YOLOv5. Firstly, this paper proposes a novel Super-SPPF structure to replace the SPPF structure in YOLOv5, by which the output of the feature extraction network is used as input, and the input is divided into two branches to retain more semantic information, and the GhostConv operation is performed separately to reduce the number of model parameters. The Super-SPPF structure performs the serial MaxPooling operation on one of the branches, which improves the computation speed by choosing a smaller pooling kernel, and then fuses the outputs of the two branches to reduce the false alarm rate of the detection model. Secondly, C3Ghost is utilized instead of the C3 module in YOLOv5 to further reduce the number of detection model parameters. Finally, the coordinate attention (CA) module is introduced in backbone of YOLOv5 to obtain the relationship between channels and space, which enables the network to obtain the location information of interest more accurately and further improves the detection accuracy of early fires. In this paper, a self-constructed DL-Fire dataset is used to verify the performance of the GS-YOLOv5 detection model by collecting environmental interference samples and combining them with the D-Fire dataset. The experimental results show that the detection accuracy of GS-YOLOv5 is 95.9%, and the model size is 10.58 mb. Compared with YOLOv5, false alarm rate is reduced from 12% to 6% and computational complexity is reduced from 16.0 GFlops to 12.8 GFlops by GS-YOLOv5. [ABSTRACT FROM AUTHOR]

To investigate how the petroleum industry evaluates and selects powerful cloud service providers, first, an evaluation index system including 25 indices such as scalability and private data protection is built. This index system can systematically examine the comprehensive strengths of cloud service providers. Aiming to solve the problems that the traditional expert evaluation method has high requirements on expert experience and is easily affected by subjective factors, a novel artificial intelligence evaluation model named TentISSA-BPNN is proposed. The objective evaluation ability of this model can be effectively used in evaluation research on cloud service providers for petroleum enterprises. In this model, the SSA algorithm is optimized by Tent chaotic mapping and adaptive inertia weight; an algorithm, TentISSA, that has good stability and fast convergence speed is designed and proposed; and the BPNN is improved with TentISSA to obtain more accurate evaluation results. To evaluate the performance of the TentISSA algorithm, nine unimodal and multimodal functions are selected in this paper to test the convergence accuracy. Then, seven models are selected as the control groups to validate the effectiveness and performance of the TentISSA-BPNN evaluation model proposed in this paper. Finally, the preprocessed data of the candidate cloud service providers are input into the trained neural network model proposed in this paper for evaluation. Based on the ranking of the evaluation scores, the comprehensive strengths of the cloud service providers are obtained to provide a decision-making reference for managers of petroleum enterprises in the process of choosing cloud service providers. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are mostly used for monitoring the environment; however, they are usually powered by non-rechargeable batteries with limited energy. Solar energy harvesting is an attractive solution to the limit by charging the sensor nodes; however, the harvested solar energy is easily affected by weather conditions. Based on the characteristics of uncertainty and intermittency of solar energy, this paper proposes a plus-profile solar energy prediction algorithm. This algorithm makes the prediction of future available solar energy by finding the data in the dataset that is most similar to the data of the day and combining it with recent weather trend. According to the predicted result, the paper further proposes an adaptive energy management scheme to suit the harvested energy. In the scheme, sensor nodes can adaptively adjust task scheduling to achieve energy neutrality. The simulation results show that compared with other algorithms, the prediction accuracy of the proposed prediction algorithm is improved by 17.7 and 22.4%, respectively, and the proposed energy management scheme reduced energy loss by 6.2 and 46.8%, respectively. [ABSTRACT FROM AUTHOR]

In order to explore the application of neural networks in the intelligent protection of digital music copyrights, this paper initially investigates the key aspects of digital music-related supply chain management (SCM). Subsequently, this paper introduces a fuzzy, comprehensive evaluation-based method for authenticating digital music infringement. Furthermore, it employs a convolutional neural network to analyze digital music's source components. Within this context, an attention mechanism and an adaptive gate model are meticulously designed. Moreover, a selective adaptive cascade is implemented to optimize the structure of the multi-resolution coder–decoder. Through fuzzy authentication, it becomes feasible to accurately and reliably track and verify copyright information pertaining to digital music, thus providing an effective protective mechanism for the digital music industry. Experimental results reveal that in comparison with the SHN-4 series models, the network model embedded with the channel space (CS) attention module achieves improvements of up to 0.04 dB in terms of performance metrics for human voice and accompaniment sources. Furthermore, it outperforms these models by up to 0.19 dB in music source separation metrics. The incorporation of the adaptive attention mechanism profoundly enhances the model's performance in audio source separation tasks, benefiting both vocal and accompaniment sources. This improvement is evident in the form of a 0.44 SDR enhancement for vocal sources and a 0.18 SDR enhancement for accompaniment sources. Additionally, the proposed two-stage music separation-gate self-attention model surpasses the two-stage music separation-gate model in metrics associated with human voice and accompaniment sources. This outcome convincingly underscores the enhanced effectiveness achieved by integrating CS, self-attention, and adaptive connection in network performance, as well as the adaptive gate structure for music copyright protection. This approach heightens the model's autonomous selectivity, minimizes outliers, stabilizes waveform characteristics, and significantly contributes to the safeguarding of digital content. [ABSTRACT FROM AUTHOR]

In order to solve the problems of slow convergence and low accuracy of the traditional ant colony algorithm in solving the traveling salesman problem (TSP), this paper proposes a heterogeneous ant colony algorithm based on the selective evolution mechanism and game strategy (SGHACA). First, we propose a game mechanism. In each iteration, the best population and the worst population will play a game. At the end of the game, pheromone gains will be given to the participants according to the weight coefficients to motivate the populations to participate in the next round of the game, in order to promote cooperation among different populations and thus improve the diversity of the algorithm. Second, we introduce a selective evolution mechanism. The optimal paths of each iteration are compared with the historical optimal paths to evolve relatively better path fragments, thus improving the convergence speed of the algorithm. Finally, when the algorithm stagnates, we introduce a dynamic shaking mechanism, which is able to dynamically dither the pheromone on the current optimal path according to the number of iterations, increasing the probability that the algorithm chooses other paths, thus helping to jump out of the locally optimal solution. In order to verify the effectiveness of the improved algorithm in this paper, we experimentally verify through a large number of TSP instances that SGHACA is able to improve the convergence of the algorithm and the accuracy of the solution to a certain extent when solving large-scale TSP. Meanwhile, compared with the latest improved algorithms, the accuracy of the solution of SGHACA is better than most of the latest improved algorithms, which indicates that the improved algorithm of this paper has some competitiveness. [ABSTRACT FROM AUTHOR]

While traveling, people need to utilize smart tourism service systems based on the Internet of Things (IoT) to enhance their journeys' convenience. However, existing IoT-based smart tourism service systems still possess certain shortcomings. In light of this, this paper delves into the integration of IoT and machine learning (ML) technologies to improve the design of smart tourism service systems and establish a platform for intelligent tourism services. Simulated datasets are employed to evaluate the performance and functionality of the smart tourism service system. The primary contributions, as inferred from the test results, are as follows: In area 1, the model achieves a congestion recognition rate of 92.6% with an error rate of only 1.5% in congestion judgment. In area 2, congestion is accurately identified 93.5% of the time, with a misjudgment rate of just 1.2%. In area 3, the model achieves a congestion identification rate of 94.2% along with a 1.3% misjudgment rate, effectively identifying congestion situations in scenic spots. When comparing the research and design system with the system based on the support vector machine (SVM) algorithm, the results demonstrate that the smart tourism service system designed in this paper, leveraging IoT technology and ML algorithms, achieves higher prediction accuracy than the SVM-based system. These findings can serve as a valuable guide for designing future smart tourism service systems. [ABSTRACT FROM AUTHOR]

In the stochastic and dynamic edge-cloud collaborative environment, the computing resources of the host are limited, and the resource requirements of computing tasks are random and changeable. Therefore, how to efficiently schedule dynamic tasks and improve system performance becomes challenging. The scheduling algorithm based on deep reinforcement learning optimizes the delay and energy consumption of the system by dynamically interacting with the environment, which can solve the problem of dynamic and changeable environment to a certain extent, but there are still problems such as poor model adaptability, low training efficiency, and unbalanced system load. In this paper, aiming at optimizing the average response time of task scheduling and the average energy consumption of the system, a multi-objective task scheduling model is designed, and a task scheduling policy optimization algorithm based on improved asynchronous advantage actor-critic (A3C) is proposed. The residual convolutional neural network (RCNN) improves the network structure of A3C, using asynchronous multi-threaded training methods to interact with the edge-cloud collaborative environment and capturing the random dynamic characteristics of resources required for computing tasks and heterogeneous edge-cloud hosts resource change characteristics to better adapt to random dynamic environments, and it can quickly updating network parameters, improving training speed, and make full use of host resources to solve system load imbalance problems. Simulation results show that the scheduling algorithm proposed in this paper can effectively reduce task response time and system energy consumption in an edge-cloud collaborative environment. [ABSTRACT FROM AUTHOR]

Existing biohashing authentication schemes usually store bioinformation in the cloud, whose storage method can face the problems of bioinformation leakage and tampering, and single point of failure. To address the above problems, a ciphertext speech biohashing authentication scheme based on chaotic system and improved public chain is proposed. First, the fusion features are extracted and generated with the inner product of 3D chaotic system to generate the biohashing sequence. Second, the original speech is encrypted and uploaded to the InterPlanetary file system and then, uploaded to the blockchain after the data are encrypted. Finally, the server matches the hash sequence queried on the chain with the to-be-authenticated hash at the user's end using the Hamming distance. The experimental results show that the biohashing algorithm in this paper has better distinguishability, robustness, security and time efficiency. The key space of the speech encryption algorithm is 2 256 , which can well resist the exhaustive attack and ensure the security during speech authentication. In this paper, the combination of on-chain and off-chain storage of speech information can prevent the problem of bioinformation leakage and tampering, as well as avoiding the problem of single point of failure. [ABSTRACT FROM AUTHOR]

The reliable prediction of solar energy production and surplus is crucial for the stability of the electricity grid and effective energy distribution, particularly during peak consumption periods. Encouraging solar adoption by customers is also important despite fluctuations in solar energy generation. This paper addresses the need for an intelligent surplus solar energy prediction model, referred to as the Green Model, which aims to accurately predict surplus electrical energy that can be returned to the distribution grid. The Green Model utilizes a combination of a developed long short-term memory (LSTM) neural network and a novel optimization technique called deterministic selection network by gain sharing knowledge (DSN-GSK). The DSN-GSK optimizes the structure of LSTM by determining the optimal number of hidden layers, nodes in each layer, biases, weights, and activation functions based on the most important features that represent the relationship between generated solar energy and weather factors. The Green Model was evaluated and analysed, demonstrating high accuracy in the short-term prediction of surplus electrical energy with a minimal percentage of error. The model shows promising prospects for the development of returned electrical energy prediction. The main novelty of this paper lies in the development of the Green Model, which combines LSTM and DSN-GSK to enhance the accuracy of surplus solar energy prediction. The benefits of the Green Model include improved stability and efficiency of the electricity grid, effective utilization of renewable energy sources, and the reduction of negative environmental impacts. The contributions of this paper include advancing the field of intelligent energy prediction, optimizing the structure of LSTM, and providing valuable insights for the integration of renewable energy into the existing energy infrastructure. [ABSTRACT FROM AUTHOR]

The early and effective diagnosis of Alzheimer's disease (AD) and mild cognitive impairment (MCI) has received increasing attention in recent years. However, currently available deep learning methods often ignore the contextual spatial information contained in structural MRI images used for early diagnosis and classification of Alzheimer's disease. This may lead us to miss important structural details by failing to adequately capture the potential connections between each slice and its neighboring slices. This lack of contextual information may cause the accuracy of the network model to suffer, which in turn affects its generalization ability and application in real-life scenarios. To explore deeper the connection between spatial context slices, this research is designed to develop a new network model to effectively detect or predict AD by digging into the deeper spatial contextual structural information. In this paper, we design a spatial context network based on 3D convolutional neural network to learn the multi-level structural features of brain MRI images for AD classification. The experimental results show that the model has good stability, accuracy and generalization ability. Our experimental method had a classification accuracy of 92.6% in the AD/CN comparison, 74.9% in the AD/MCI comparison, and 76.3% in the MCI/CN comparison. In addition, this paper demonstrates the effectiveness of the proposed network model through ablation experiments. [ABSTRACT FROM AUTHOR]

This paper solves the task of unsupervised video object segmentation (UVOS) that segments the objects of interest through the entire videos without any annotation. In recent years, many unsupervised video object segmentation (UVOS) methods have been proposed. Although these methods perform well, they rely on networks with heavy weights, often leading to large model size. In order to reduce the model size while keeping a competitive performance, we propose a saliency-based dual-attention (SDA) method for UVOS in this paper. In our method, we take optical flow and video frames as inputs and extract the appearance information and motion information from optical flow and video frames. We design a two-branch network with appearance information and motion information. The information from these two branches is fused via a saliency-based dual-attention module to segment the primary object in one path. The saliency-based dual-attention module is composed of saliency attention and saliency-based reverse attention. To demonstrate the effectiveness of our network, we tested it on the DAVIS-2016 and SegtrackV2 datasets. Experimental results demonstrate that our method can achieve competitive results in terms of accuracy and model size. [ABSTRACT FROM AUTHOR]

Locating and maintaining multiple Pareto optimal sets (PSs) in the decision space simultaneously is a challenging issue in solving multimodal multiobjective optimization problems (MMOPs). To deal with this challenge, this paper proposed a multipopulation particle swarm optimization based on divergent guidance and knowledge transfer (MPPSO-DGKT). First, a divergent guidance strategy is proposed to utilize the information of superior and inferior particles in the subpopulation. This strategy can alleviate the premature convergence due to the excessive influence of the global Pareto optimal solutions found so far. Second, a knowledge transfer strategy is developed to promote the knowledge transfer between different subpopulations, which can enhance the exploitation ability of the population. Finally, the update and selection strategy is used to keep more promising nondominated solutions, which can help the algorithm to obtain global and local PSs. To verify the effectiveness of the proposed algorithm, MPPSO-DGKT is compared with seven state-of-the-art multimodal multiobjective optimization algorithms on CEC2020 competition. Experimental results indicate that the proposed algorithm is more competitive than its competitors when solving MMOPs with both global and local PSs. [ABSTRACT FROM AUTHOR]

The Cross-Taiwan Strait Railway (CTSR) is a significant construction, and the automatic driving of high-speed trains (HSTs) on the CTSR is a crucial technology for its operation. Before opening the CTSR, it is forward-looking to conduct theoretical research. Inspired by AlphaZero, this paper combines expert experience and Newtonian mechanics to propose a method on automatically generating massive virtual driving curves for HSTs of the CTSR. To compress the solution space from infinite to finite, we set the driving acceleration and speed limit boundary of HSTs from the perspective of expert experience. The model then combines big data technology to generate massive virtual driving curves automatically and uses statistical analysis to select high-performance ones. We found that 1) numerous virtual driving curves can be automatically generated according to different restricted speeds and line conditions, with solid adaptability; 2) the driving curves cover a specific running time and reach all running times in the range, with good ergodicity; 3) real-time tracking of the running time of each driving curve by 0.1 s, with high accuracy; 4) lots of driving curves are available on each run time for selecting curves with best performance, with good selectivity. In conclusion, this method can automatically generate virtual driving curves for HSTs on the CTSR, providing high-quality virtual data for future research on the automatic driving of HSTs on the CTSR. [ABSTRACT FROM AUTHOR]