Search

Today, computer graphics and graphic image processing techniques have been widely used in daily life and industrial production. Due to the development of computers, computer graphics has brought more convenience to our daily life. In order to give full play to the value of computers, this paper takes the Hakka paper-cut art with local characteristics as the starting point, first of all its development history, artistic characteristics, compositional forms, expression techniques, cultural connotations, Hakka paper-cut patterns, and the symbolic meaning of folk customs, and then we design a visualization system for the paper-cut works of Gannan Hakka based on computer graphics. In addition, the system provides a solution for the integration of Gannan Hakka paper-cut art and Jiangxi native product packaging design and provides a reference for the theory and practice of modern native product packaging design. [ABSTRACT FROM AUTHOR]

In order to improve the effect of intelligent automatic test paper composition, this paper combines the hybrid fuzzy clustering algorithm to study the computer automatic test paper composition algorithm. In this paper, a computer automatic test paper composition system based on hybrid fuzzy clustering algorithm is constructed. Moreover, the hybrid fuzzy clustering method used in this paper is used as the basic algorithm of the system, and the algorithm is improved according to the actual needs of intelligent paper composition. In addition, this paper uses an intelligent algorithm to input the relevant constraint parameters and combines the original parameters to select the most suitable test questions from the database and combine them into test papers. Finally, this paper constructs the system structure based on the requirements of intelligent test paper composition. The experimental research shows that the computer automatic test paper composition system based on the hybrid fuzzy clustering algorithm proposed in this paper has a good test paper composition function, which can effectively promote the progress of the intelligent examination mode in colleges and universities. [ABSTRACT FROM AUTHOR]

This research studied the strategies that players use in sequential adversarial games. We took the Rock-Paper-Scissors (RPS) game as an example and ran players in two experiments. The first experiment involved two humans, who played the RPS together for 100 times. Importantly, our payoff design in the RPS allowed us to differentiate between participants who used a random strategy from those who used a Nash strategy. We found that participants did not play in agreement with the Nash strategy, but rather, their behavior was closer to random. Moreover, the analyses of the participants' sequential actions indicated heterogeneous cycle-based behaviors: some participants' actions were independent of their past outcomes, some followed a well-known win-stay/lose-change strategy, and others exhibited the win-change/lose-stay behavior. To understand the sequential patterns of outcome-dependent actions, we designed probabilistic computer algorithms involving specific change actions (i.e., to downgrade or upgrade according to the immediate past outcome): the Win-Downgrade/Lose-Stay (WDLS) or Win-Stay/Lose-Upgrade (WSLU) strategies. Experiment 2 used these strategies against a human player. Our findings show that participants followed a win-stay strategy against the WDLS algorithm and a lose-change strategy against the WSLU algorithm, while they had difficulty in using an upgrade/downgrade direction, suggesting humans' limited ability to detect and counter the actions of the algorithm. Taken together, our two experiments showed a large diversity of sequential strategies, where the win-stay/lose-change strategy did not describe the majority of human players' dynamic behaviors in this adversarial situation. [ABSTRACT FROM AUTHOR]

To serve various tasks requested by various end devices with different requirements, end-edge-cloud (E2C) has attracted more and more attention from specialists in both academia and industry, by combining both benefits of edge and cloud computing. But nowadays, E2C still suffers from low service quality and resource efficiency, due to the geographical distribution of edge resources and the high dynamic of network topology and user mobility. To address these issues, this paper focuses on task offloading, which makes decisions that which resources are allocated to tasks for their processing. This paper first formulates the problem into binary non-linear programming and then proposes a particle swarm optimization (PSO)-based algorithm to solve the problem. The proposed algorithm exploits an imbalance mutation operator and a task rescheduling approach to improve the performance of PSO. The proposed algorithm concerns the resource heterogeneity by correlating the probability that a computing node is decided to process a task with its capacity, by the imbalance mutation. The task rescheduling approach improves the acceptance ratio for a task offloading solution, by reassigning rejected tasks to computing nodes with available resources. Extensive simulated experiments are conducted. And the results show that the proposed offloading algorithm has an 8.93%-37.0% higher acceptance ratio than ten of the classical and up-to-date algorithms, and verify the effectiveness of the imbalanced mutation and the task rescheduling. [ABSTRACT FROM AUTHOR]

Autism Spectrum Disorder (ASD) diagnostics requires specialized clinical expertise, posing accessibility and affordability barriers for many. To widen the availability of precise screening, this paper examines ensemble machine learning models that combine multiple algorithms for improved accuracy and generalizability. Specifically, this paper compares the performance of K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Naive Bayes, and a Voting Classifier that integrates Logistic Regression, Decision Trees, and KNN. The comparison was conducted on separate datasets of pediatric and adult ASD questionnaire responses. The ensemble model significantly outperforms individual techniques, achieving higher accuracy for both pediatrics and adults with balanced sensitivity and specificity maintained across groups, indicating the viability of accessible community-available screening to alleviate diagnostic bottlenecks. Before scale-up, further model optimization for interpretability and testing on more diverse multi-site data are warranted. Overall, findings demonstrate the feasibility of mobile distributed pre-screening systems leveraging optimized ensembles to predict ASD with high precision across ages, opening possibilities for explainable AI to lower costs and widen access compared to in-person evaluation. [ABSTRACT FROM AUTHOR]

In order to improve the performance of UAV's autonomous maneuvering decision-making, this paper proposes a decision-making method based on situational continuity. The algorithm in this paper designs a situation evaluation function with strong guidance, then trains the Long Short-Term Memory (LSTM) under the framework of Deep Q Network (DQN) for air combat maneuvering decision-making. Considering the continuity between adjacent situations, the method takes multiple consecutive situations as one input of the neural network. To reflect the difference between adjacent situations, the method takes the difference of situation evaluation value as the reward of reinforcement learning. In different scenarios, the algorithm proposed in this paper is compared with the algorithm based on the Fully Neural Network (FNN) and the algorithm based on statistical principles respectively. The results show that, compared with the FNN algorithm, the algorithm proposed in this paper is more accurate and forward-looking. Compared with the algorithm based on the statistical principles, the decision-making of the algorithm proposed in this paper is more efficient and its real-time performance is better. [ABSTRACT FROM AUTHOR]

Social engineering attacks are considered one of themost hazardous cyberattacks in cybersecurity, as human vulnerabilities are often the weakest link in the entire network. Such vulnerabilities are becoming increasingly susceptible to network security risks. Addressing the social engineering attack defense problem has been the focus of many studies. However, two main challenges hinder its successful resolution. Firstly, the vulnerabilities in social engineering attacks are unique due to multistage attacks, leading to incorrect social engineering defense strategies. Secondly, social engineering attacks are real-time, and the defense strategy algorithms based on gaming or reinforcement learning are too complex to make rapid decisions. This paper proposes a multiattribute quantitative incentive method based on human vulnerability and an improved Q-learning (IQL) reinforcement learning method on human vulnerability attributes. The proposed algorithm aims to address the two main challenges in social engineering attack defense by using a multiattribute incentive method based on human vulnerability to determine the optimal defense strategy. Furthermore, the IQL reinforcement learning method facilitates rapid decision-making during real-time attacks. The experimental results demonstrate that the proposed algorithm outperforms the traditional Qlearning (QL) and deep Q-network (DQN) approaches in terms of time efficiency, taking 9.1% and 19.4% less time, respectively. Moreover, the proposed algorithm effectively addresses the non-uniformity of vulnerabilities in social engineering attacks and provides a reliable defense strategy based on human vulnerability attributes. This study contributes to advancing social engineering attack defense by introducing an effective and efficient method for addressing the vulnerabilities of human factors in the cybersecurity domain. [ABSTRACT FROM AUTHOR]

When the target localization algorithm based on reinforcement learning is trained on few-sample data sets, the accuracy of target localization is low due to the low degree of fitting. Therefore, on the basis of deep reinforcement learning target localization algorithm, this paper proposes a target localization algorithm based on meta-reinforcement learning. Firstly, during the initial training of the model, the meta-parameters were classified and stored according to the similarity of the training tasks. Then, for the new target location task, the task feature extraction was carried out and the meta parameters with the highest similarity were matched as the initial parameters of the model training. The model dynamically updated the meta parameter pool to ensure that the optimal meta parameters of multiple different types of features were saved in the meta parameter pool, so as to improve the generalization ability and recognition accuracy of multiple types of target location tasks. Experimental results show that in a variety of single target localization tasks, compared with the original reinforcement learning target localization algorithm, under the same data set size, the model converges under a small number of training steps with the meta-parameters in the matching meta-parameter pool as the initial training parameters. Moreover, the training speed of the meta-reinforcement learning method based on MAML-RL is increased by 28.2% for random initial parameters, and that of the metareinforcement learning method based on this paper is increased by 34.9%, indicating that the proposed algorithm effectively improves the training speed, generalization performance and localization accuracy of object detection. [ABSTRACT FROM AUTHOR]

The Internet of things (IoT) has a variety of application domains including smart homes. A smart home is an automated intelligent home where IoT technologies are used to remotely control home appliances, manage home energy, enhance home security, and increase the comfort of home residents. On the other hand, renewable energy resources are highly speared to cover huge electricity demand. To save more energy and maximize energy efficiency, smart homes are engaged with energy management systems. Energy management and optimization solutions can help in decreasing the overall cost of energy while optimizing all operational performance. This paper presents an IoT-based optimal energy management approach depending on the Harmony Search optimization technique to save energy usage in smart homes. PV and wind renewable energy systems are used to feed the home with electricity. These on-site energy sources help smart homes to decrease their dependence on power from the electricity grid. Energy storage systems are used to maintain energy system reliability due to the inherent randomness and intermittence of solar radiation and wind speed. The proposed algorithm depends on-demand response to the price variations in the electric energy over time and applies the Time-of-Use pricing principle for controlling household appliances. IoT technology is applied to exchange data between household appliances and the control center, in addition, to communicating both energy management systems and security systems with the control center. In this paper, the IoT system is based on ZigBee wireless technology which is described as the lowest power consumed wireless technology. The algorithm is applied to a proposed building consisting of five floors, each floor contains two apartments with a total area of 200 meters for one apartment. The obtained results prove the efficacy of the proposed Harmony Search-based optimization method in saving energy and reducing electricity bills in smart homes while satisfying the required constraints. Additionally, the performance of the proposed algorithm is validated against four AI algorithms including Genetic Algorithm, Artificial Immune System, Ant Lion Optimization, and Bat Algorithm. In addition to its simplicity in programming and formulation, the conducted comparison demonstrates a similarity in the results with an advantage in the proposed algorithm in improving both the electricity cost-saving and elapsed runtime. [ABSTRACT FROM AUTHOR]

For Printed Circuit Board (PCB) surface defect detection, traditional detection methods mostly focus on template matching-based reference method and manual detections, which have the disadvantages of low defect detection efficiency, large errors in defect identification and localization, and low versatility of detectionmethods. In order to furthermeet the requirements of high detection accuracy, real-time and interactivity required by the PCB industry in actual production life. In the current work, we improve the You-only-look-once (YOLOv4) defect detection method to train and detect six types of PCB small target defects. Firstly, the original Cross Stage Partial Darknet53 (CSPDarknet53) backbone network is preserved for PCB defect feature information extraction, and secondly, the original multi-layer cascade fusion method is changed to a single-layer feature layer structure to greatly avoid the problem of uneven distribution of priori anchor boxes size in PCB defect detection process. Then, the K-means++ clustering method is used to accurately cluster the anchor boxes to obtain the required size requirements for the defect detection, which further improves the recognition and localization of small PCB defects. Finally, the improved YOLOv4 defect detection model is compared and analyzed on PCB dataset with multi-class algorithms. The experimental results show that the average detection accuracy value of the improved defect detection model reaches 99.34%, which has better detection capability, lower leakage rate and false detection rate for PCB defects in comparison with similar defect detection algorithms. [ABSTRACT FROM AUTHOR]

Target maneuver recognition is a prerequisite for air combat situation awareness, trajectory prediction, threat assessment and maneuver decision. To get rid of the dependence of the current target maneuver recognition method on empirical criteria and sample data, and automatically and adaptively complete the task of extracting the target maneuver pattern, in this paper, an air combat maneuver pattern extraction based on time series segmentation and clustering analysis is proposed by combining autoencoder, G-G clustering algorithm and the selective ensemble clustering analysis algorithm. Firstly, the autoencoder is used to extract key features of maneuvering trajectory to remove the impacts of redundant variables and reduce the data dimension; Then, taking the time information into account, the segmentation of Maneuver characteristic time series is realized with the improved FSTS-AEGG algorithm, and a large number of maneuver primitives are extracted; Finally, the maneuver primitives are grouped into some categories by using the selective ensemble multiple time series clustering algorithm, which can prove that each class represents a maneuver action. The maneuver pattern extraction method is applied to small scale air combat trajectory and can recognize and correctly partition at least 71.3% of maneuver actions，indicating that the method is effective and satisfies the requirements for engineering accuracy. In addition, this method can provide data support for various target maneuvering recognition methods proposed in the literature, greatly reduce the workload and improve the recognition accuracy. [ABSTRACT FROM AUTHOR]

This article introduces the concept of load aggregation, which involves a comprehensive analysis of loads to acquire their external characteristics for the purpose of modeling and analyzing power systems. The online identification method is a computer-involved approach for data collection, processing, and system identification, commonly used for adaptive control and prediction. This paper proposes a method for dynamically aggregating large-scale adjustable loads to support high proportions of new energy integration, aiming to study the aggregation characteristics of regional large-scale adjustable loads using online identification techniques and feature extraction methods. The experiment selected 300 central air conditioners as the research subject and analyzed their regulation characteristics, economic efficiency, and comfort. The experimental results show that as the adjustment time of the air conditioner increases from 5 minutes to 35 minutes, the stable adjustment quantity during the adjustment period decreases from 28.46 to 3.57, indicating that air conditioning loads can be controlled over a long period and have better adjustment effects in the short term. Overall, the experimental results of this paper demonstrate that analyzing the aggregation characteristics of regional large-scale adjustable loads using online identification techniques and feature extraction algorithms is effective. [ABSTRACT FROM AUTHOR]

Carbon credit is known as one of the most effective market-based tools to control the generation of carbon emissions. In order to mitigate carbon intensity and enhance energy efficiency within product systems, the utilization of carbon credits emerges as a valuable tool for companies striving to achieve ambitious targets in reducing greenhouse gas (GHGs) emissions. This study aims to investigate the impact of employing carbon credits in contrast to traditional inventory models. To overcome these shortcomings, a two-stage inventory model to design a green supply chain in a carbon trading environment is presented in this paper. The model solves a pricing problem and determines the optimal production run time of component and the carbon credit price. The presented model is employed in a real-world case study, and the numerical results are meticulously analysed and interpreted. The results of the model showed that there exists an optimal solution or optimizer. We have presented an algorithm to compute the value of an optimal solution. After the computation of an algorithm, there was more than sufficient evidence to show the beneficial effects of Taiwan bike manufacturer's model. The findings of sensitivity analysis also have implications for this proposed model. As an illustration, the outcomes achieved through pollution prevention can be juxtaposed with those derived from non-investment operations, considering various parameter settings. This comparison aids in identifying an opportune moment for implementing pollution prevention measures. [ABSTRACT FROM AUTHOR]

The traditional home product design system mainly depends on relatively shallow learning network, relatively simple embedded technology and Internet of things technology. The traditional home design system mainly depends on the traditional self-encoder technology. When combined with the deep neural network, this technology has serious defects in the computer vision algorithm, resulting in the serious waste of the corresponding system storage and computing resources, the corresponding system learning efficiency is relatively poor and the learning ability is weak. Based on this, this paper will build a home product design system based on the deep neural network of self-encoder. By improving the sparsity of self-encoder in the process of learning and training, we can further improve the sparsity of the system and further optimize the structure of self-encoder in the design system, The performance of the deep learning model of the design system is further improved through the hierarchical features continuously learned by the self-encoder in the process of home case design. Based on the optimization of the home product design system in this paper, the system effectively improves and improves the accuracy and stability of the internal feature classifier of the system, and improves the overall performance of the furniture design system. In the specific system construction part, based on ZigBee technology and embedded technology as the design carrier, and adhering to the goal of simplicity, intelligence and convenience, this paper designs and constructs the home product design system. The experimental results show that the noise processing level of the proposed home product design system is lower than 4-5db compared with the traditional design system, and the corresponding image classification accuracy is about 4% higher than the traditional design system. Therefore, the experimental results show that the home design system proposed in this paper has obvious advantages. [ABSTRACT FROM AUTHOR]

This paper introduces a novel approach to enhance the performance of the stochastic gradient descent (SGD) algorithm by incorporating a modified decay step size based on .... The proposed step size integrates a logarithmic term, leading to the selection of smaller values in the final iterations. Our analysis establishes a convergence rate of O ... for smooth non-convex functions without the Polyak-Łojasiewicz condition. To evaluate the effectiveness of our approach, we conducted numerical experiments on image classification tasks using the Fashion-MNIST and CIFAR10 datasets, and the results demonstrate significant improvements in accuracy, with enhancements of 0:5% and 1:4% observed, respectively, compared to the traditional p1 t step size. [ABSTRACT FROM AUTHOR]

The Bender-Gestalt Test (BGT) is a psychological assessment used to understand the characteristics of a person by evaluating the drawings of the examinees when asked to copy provided shapes. The evaluation results in numerical scores for each shape, which describe the level of psychological issues. This test has been conducted using a pencil and a paper by a human counsellor traditionally, but the results can be contaminated by unconscious bias or mistakes. This paper proposed a digitalized BGT system which utilizes a stylus pen and a tablet to assist a human counsellor. The proposed system records the responses of examinees, and the responses were evaluated by computer algorithms. The proposed system was evaluated by comparing the scores of the proposed system and human experts, with the BGT responses of 28 participants. Both scores were similar in general, but it was found that the scores of the proposed system were more accurate for the ambiguous drawings. The results indicate that the proposed system can be utilized to assist counsellors for the diagnosis of the abnormalities precisely by accurately detecting small differences in the drawings. [ABSTRACT FROM AUTHOR]

Software requirement is become more important in recent because the development which witness in projects, badly executed requirements engineering steps can result in bad quality software and more cost for expensive maintenance. Manual classification of requirements is difficult, time-consuming, and expensive, especially in large projects and is written as a Software Requirements Specification (SRS) document. For this reason, automating software requirements classification helps in obtaining higher accuracy and saving time and effort. Most of researcher applied Intelligence techniques algorithms to avoid erroneous requirements and human intervention, as well as analyze, classify, and priority of requirements. In this paper illustrated modern of artificial techniques algorithm to classify RT approaches. It is surveyed that existing techniques like machine learning algorithms such as K-Nearest Neighbor (K-NN), decision tree (DT),.. etc. Many other technical how ensemble learning and deep learning algorithm results in classification of RF. Researchers have proposed automated techniques to classify functional and non-functional requirements using several machine learning (ML) algorithms with a combination of different vector techniques. However, using the best method in classifying functional and non-functional requirements still needs clarification, and through many studies and research by researchers. [ABSTRACT FROM AUTHOR]

Recommender systems (RS) have been developed to make personalized suggestions and enrich users' preferences in various online applications to address the information explosion problems. However, traditional recommender-based systems act as black boxes, not presenting the user with insights into the system logic or reasons for recommendations. Recently, generating explainable recommendations with deep knowledge graphs (DKG) has attracted significant attention. DKG is a subset of explainable artificial intelligence (XAI) that utilizes the strengths of deep learning (DL) algorithms to learn, provide high-quality predictions, and complement the weaknesses of knowledge graphs (KGs) in the explainability of recommendations. DKG-based models can provide more meaningful, insightful, and trustworthy justifications for recommended items and alleviate the information explosion problems. Although several studies have been carried out on RS, only a few papers have been published on DKG-based methodologies, and a review in this new research direction is still insufficiently explored. To fill this literature gap, this paper uses a systematic literature review framework to survey the recently published papers from 2018 to 2022 in the landscape of DKG and XAI. We analyze how the methods produced in these papers extract essential information from graphbased representations to improve recommendations' accuracy, explainability, and reliability. From the perspective of the leveraged knowledge-graph related information and how the knowledge-graph or path embeddings are learned and integrated with the DL methods, we carefully select and classify these published works into four main categories: the Two-stage explainable learning methods, the Joint-stage explainable learning methods, the Path-embedding explainable learning methods, and the Propagation explainable learning methods. We further summarize these works according to the characteristics of the approaches and the recommendation scenarios to facilitate the ease of checking the literature. We finally conclude by discussing some open challenges left for future research in this vibrant field. [ABSTRACT FROM AUTHOR]

In this paper, the authors propose a new machine learning paradigm, federated machine learning. This method produces accurate predictions without revealing private data. It requires less network traffic, reduces communication costs and enables private learning from device to device. Federated machine learning helps to build models and further the models are moved to the device. Applications are particularly prevalent in healthcare, finance, retail, etc., as regulations make it difficult to share sensitive information. Note that this method creates an opportunity to build models with huge amounts of data by combining multiple databases and devices. There are many algorithms available in this area of machine learning and new ones are constantly being created. Our paper presents a comparative analysis of algorithms: FedAdam, FedYogi and FedSparse. But we need to keep in mind that FedAvg is at the core of many federated machine learning algorithms. Data testing was conducted using the Flower and Kaggle platforms with the above algorithms. Federated machine learning technology is usable in smartphones and other devices where it can create accurate predictions without revealing raw personal data. In organizations, it can reduce network load and enable private learning between devices. Federated machine learning can help develop models for the Internet of Things that adapt to changes in the system while protecting user privacy. And it is also used to develop an AI model to meet the risk requirements of leaking client's personal data. The main aspects to consider are privacy and security of the data, the choice of the client to whom the algorithm itself will be directed to process the data, communication costs as well as its quality, and the platform for model aggregation. [ABSTRACT FROM AUTHOR]

In distributed edge storage, data storage data is allocated to network edge devices to achieve low latency, high security, and flexibility. However, traditional systems for distributed edge storage only consider individual factors, such as node capacity, while overlooking the network status and the load states of the storage nodes, thereby impacting the system's read and write performance. Moreover, these systems exhibit inadequate scalability in widely adopted wireless terminal application scenarios. To overcome these challenges, this paper introduces a software-defined edge storage model and a distributed edge storage architecture grounded in software-defined networking (SDN) and the Server Message Block (SMB) protocol. A data storage node selection and distribution algorithm is formulated based on a maldistributed decision model that comprehensively considers the network and storage node load states. A system prototype is implemented in combination with 5G wireless communication technology. The experimental results demonstrate that, in comparison to conventional distributed edge storage systems, the proposed wireless distributed edge storage system exhibits significantly enhanced performance under high load conditions, demonstrating superior scalability and adaptability. This approach effectively addresses the scalability limitation, rendering it suitable for edge scenarios in mobile applications and reducing hardware deployment costs. [ABSTRACT FROM AUTHOR]

Federated learning is a distributed machine learning framework that solves data security and data island problems faced by artificial intelligence. However, federated learning frameworks are not always secure, and attackers can attack customer privacy information by analyzing parameters in the training process of federated learning models. To solve the problems of data security and availability during federated learning training, this paper proposes an Efficient Differential Privacy Federated Learning Algorithm based on early stopping mechanism (EfficientDP-FL). This method inherits the advantages of differential privacy and federated learning and improves the performance of model training while protecting the parameter information uploaded by the client during the training process. Specifically, in the federated learning framework, this article uses an adaptive DP-FL method for gradient descent training, which makes the model converge faster than traditional stochastic gradient descent. In addition, due to model convergence, noise should be reduced accordingly. This paper introduces an early stopping mechanism to improve data availability. This paper demonstrates the performance improvement of the Efficient DP-FL algorithm through simulation experiments on real MNIST and Fashion-MNIST datasets. Experimental showthat the efficient DP-FL algorithm is significantly superior to other algorithms. [ABSTRACT FROM AUTHOR]

In order to obtain the knowledge information of financial texts more efficiently and make the extracted information such as entity relation attribute more accurate, this paper studies the grammatical features of financial news texts and the semantic features of How Net, and puts forward the scheme of financial information extraction based on How Net. First, the phrase matching is carried out in the dictionary. Then the neural network is used for weighting, BiLSTM is used for character vector feature enhancement training, and then conditional random field (CRF) is used to complete named entity recognition, and then the relationship extraction of entity pairs from the dependency syntax is carried out to complete the research on the construction method of knowledge extraction of text in the financial field. The experimental results show that this model is superior to the other three models in entity recognition, and the overall performance is improved by about 1.2%. In relation extraction, the accuracy and recall rate of the model algorithm adopted in this paper are improved by 5% and 1.5% respectively, which shows that the improvement of the algorithm is effective. [ABSTRACT FROM AUTHOR]

Predictive Maintenance (PM) is a major part of smart manufacturing in the fourth industrial revolution. The classical fault diagnosis approach for complex systems such as an electromechanical system is not effective. Taking the advantage of the successful implementations of PM together with Deep Learning (DL) methods replaces the conventional diagnosis methods with modern diagnosis methods. This study intends to aid experts, engineers, and technicians in different electromechanical systems in comprehending how the PM used DL methods to find the multi-fault diagnosis. In this direction, this paper presents a comprehensive review of recent works of DL techniques that are applied to PM for electromechanical systems by classifying the research according to equipment, fault, parameters, and method. To perform the review, 30 papers that are published in proceedings and journals are reviewed within a time window between the years 2016 to 2022. In the context of the electromechanical system, it is observed that motors are the most equipment selected for PM. Moreover, stator winding faults are found to be less selected than bearing for diagnosis of the unhealthy status of the motor. In terms of DL methods, the study reveals that AE, LSTM, and CNN are mostly used. In addition, poorly mixed models of DL methods are also noticed. Finally, finding the optimal design variable of the DL architecture was not widely explored. [ABSTRACT FROM AUTHOR]

The combination of computer algorithms to diagnose clinical images has attracted more and more attention. This research aims to improve the efficiency of gastric cancer (GC) diagnosis, so deep learning (DL) algorithms are tentatively used to assist doctors in the diagnosis of gastric cancer. In the experiment, the collected 3591 gastroscopic images were divided into network training set and experimental verification test set. The lesion samples in the image are all marked by many endoscopists with many years of clinical experience. In order to improve the experimental effect, 5261 endoscopic images were obtained by expanding the training set. Then the obtained training set is input into the convolutional neural network (CNN) for training, and finally get the algorithm model DLU‐Net. By inputting 598 test set samples into the CNN constructed in this paper, five results such as advanced GC, early GC, precancerous lesions, normal and benign lesions can be identified and output, with a total accuracy of 94.1%. It can be concluded that the DL algorithm model constructed in this paper can effectively identify the staging characteristics of cancer as well as gastroscopic images, greatly improve efficiency, and effectively assist physicians in the diagnosis of GC under gastroscopy. [ABSTRACT FROM AUTHOR]

Detecting occluded faces is a non-trivial problem for face detection in computer vision. This challenge becomes more difficult when the occlusion covers majority of the face. Despite the high performance of current state-of-the-art face detection algorithms, the detection of occluded and covered faces is an unsolved problem and is still worthy of study. In this paper, a deep-learning-face-detection model Niqab-Face-Detector is proposed along with context-based labeling technique for detecting unconstrained veiled faces such as faces covered with niqab. An experimental test was conducted to evaluate the performances of the proposed model using the Niqab-Face dataset. The experiment showed encouraging results and improved accuracy compared with state-of-the-art face detection algorithms. [ABSTRACT FROM AUTHOR]

Advances in computer image recognition have significantly impacted many industries, including healthcare, security and autonomous systems. This paper aims to explore the potential of improving image algorithms to enhance computer image recognition. Specifically, we will focus on regression methods as a means to improve the accuracy and efficiency of identifying images. In this study, we will analyze various regression techniques and their applications in computer image recognition, as well as the resulting performance improvements through detailed examples and data analysis. This paper deals with the problems related to visual image processing in outdoor unstructured environment. Finally, the heterogeneous patterns are converted into the same pattern, and the heterogeneous patterns are extracted from the fusion features of data modes. The simulation results show that the perception ability and recognition ability of outdoor image recognition in complex environment are improved. [ABSTRACT FROM AUTHOR]

This review explores the historical and current significance of gestures as a universal form of communication with a focus on hand gestures in virtual reality applications. It highlights the evolution of gesture detection systems from the 1990s, which used computer algorithms to find patterns in static images, to the present day where advances in sensor technology, artificial intelligence, and computing power have enabled real-time gesture recognition. The paper emphasizes the role of hand gestures in virtual reality (VR), a field that creates immersive digital experiences through the Ma blending of 3D modeling, sound effects, and sensing technology. This review presents state-of-the-art hardware and software techniques used in hand gesture detection, primarily for VR applications. It discusses the challenges in hand gesture detection, classifies gestures as static and dynamic, and grades their detection difficulty. This paper also reviews the haptic devices used in VR and their advantages and challenges. It provides an overview of the process used in hand gesture acquisition, from inputs and pre-processing to pose detection, for both static and dynamic gestures. [ABSTRACT FROM AUTHOR]

Copyright of Kirkuk Journal of Science is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We present a novel multi-modal adaptive feature extraction algorithm considering both time-domain and frequency-domain modalities (AFETF), coupled with a Bidirectional Long Short-Term Memory (Bi-LSTM) network based on the Grey Wolf Optimizer (GWO) for early-stage weak fault diagnosis in bearings. Singular Value Decomposition (SVD) was employed for noise reduction, while Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) was utilized for signal decomposition, facilitating further signal processing. AFETF algorithm proposed in this paper was employed to extract weak fault features. The adaptive diagnostic process was further enhanced using Bi-LSTM network optimized with GWO, ensuring objectivity in the hyperparameter optimization. The proposed method was validated for datasets containing weak faults with a 0.2 mm crack and strong faults with a 0.4 mm crack, demonstrating its effectiveness in early-stage fault detection. [ABSTRACT FROM AUTHOR]

To address the issue of the lack of specialized data filtering algorithms for dataset production, we proposed an image filtering algorithm. Using feature fusion methods to improve discrete wavelet transform algorithm (DWT) and enhance the robustness of image feature extraction, a weighted hash algorithm was proposed to hash features to reduce the complexity and computational cost of feature comparison. To minimize the time cost of image filtering as much as possible, a fast distance calculation method was also proposed to calculate the similarity of images. The experimental results showed that compared with other advanced methods, the algorithm proposed in this paper had an average accuracy improvement of 3% and a speed improvement of at least 30%. Compared with traditional manual filtering methods, while ensuring accuracy, the filtering speed of a single image is increased from 9.9s to 0.01s, which has important application value for dataset production. [ABSTRACT FROM AUTHOR]

This paper addresses the persistent challenges in speech processing within the Air Traffic Control (ATC) domain, a field where despite extensive research, issues such as handling noisy environments, accented speech, and the need for strict adherence to standard phraseology continue to undermine conventional language models. Our study employs a hybrid approach that integrates syntactic analysis with advanced machine learning classification algorithms – Logistic Regression, Lagrangian Support Vector Machine, and Naïve Bayes. By mixing and matching algorithms tailored for specific aspects of speech processing, our approach moves away from traditional reliance on a singular integrated system, illustrating through rigorous testing with the ATCOSIM dataset that such a multifaceted strategy markedly improves command recognition accuracy and adapts more effectively to the unique linguistic features of ATC speech. Results highlight the superior performance of Logistic Regression across various command recognition categories, pointing towards a promising direction for future advancements in ATC speech recognition technologies aimed at reducing human workload and increasing automation precision. This paper explores the complexities of the required analysis techniques and underscores the necessity of employing diverse algorithms in the processing pipeline to enhance overall system accuracy. [ABSTRACT FROM AUTHOR]

For the autonomous and intelligent operation of robots in unknown environments, simultaneous localization and mapping (SLAM) is essential. Since the proposal of visual odometry, the use of visual odometry in the mapping process has greatly advanced the development of pure visual SLAM techniques. However, the main challenges in current monocular odometry algorithms are the poor generalization of traditional methods and the low interpretability of deep learning-based methods. This paper presented a hybrid self-supervised visual monocular odometry framework that combined geometric principles and multi-frame temporal information. Moreover, a post-odometry optimization module was proposed. By using image synthesis techniques to insert synthetic views between the two frames undergoing pose estimation, more accurate inter-frame pose estimation was achieved. Compared to other public monocular algorithms, the proposed approach showed reduced average errors in various scene sequences, with a translation error of 2.211 % and a rotation error of 0.418 ∘ / 100 m. With the help of the proposed optimizer, the precision of the odometry algorithm was further improved, with a relative decrease of approximately 10 % intranslation error and 15 % in rotation error. [ABSTRACT FROM AUTHOR]

In this paper, we study the finite-time stability and applications of positive switched linear delayed systems under synchronous impulse control, which includes two types of random switching and average dwell time switching. By constructing a type of linear timevarying co-positive Lyapunov functional, we first propose several new finite-time stability criteria. It should be emphasized that the linear term coefficient of the linear vector of the Lyapunov functional is adjusted to the difference between the weighting vector and the given vector. Then, we apply the obtained stability criteria to the linear time-varying delayed systems with impulsive effects. At last, three examples are given to demonstrate the validity of the obtained results, which includes the specific linear programming algorithm process. [ABSTRACT FROM AUTHOR]

Predicting operational performance enables organizations to develop operational effectiveness goals considering different combinations of resources. Measuring performance is consolidated with advances in relative efficiency analysis techniques, including data envelopment analysis (DEA) and stochastic frontier analysis (SFA), albeit these methods lack predictive capability. This paper proposes an approach for performance prediction by integrating relative efficiency measurement models with machine learning algorithms. Data analyses were conducted using data provided by the energy assessment project offered to small and medium-sized manufacturing companies in the United States (n 7,548) using sales as the output, with the inputs being the number of employees, hours of operation, electricity, natural gas, cost of electricity, and cost of natural gas. Performance was estimated differently, employing parametric (SFA) and non-parametric (DEA) methods. The prediction benchmarking process occurred by adopting machine learning algorithms: regression (LM), support vector machine (SVM), K-nearest neighbor (KNN), linear discriminant analysis (LDA), random forest (RF), and decision tree (DT). The findings showed that it is possible to identify the best prediction algorithm associated with a performance model. However, the performance prediction may differ if different strategies for measuring performance or machine learning model configurations are used. In addition, SFA-LOG and SVM had the best performance for regression, and DEA-VRS/IRS excelled with random forest; the RF algorithm was the best fit across all performance approaches. The error rate depends on the algorithm and the performance model, and the number of classes must be reduced to obtain a higher success rate. [ABSTRACT FROM AUTHOR]

This article compares two optimization methods considering random variations in design parameters. One is reliability-based design optimization, which depends on the availability of the joint probability density function. A more practical alternative is robust optimization, which does not require the estimation of failure probability. It accounts for the random response of the structure through definitions of objective functions and constraints, incorporating mean values and response variances. An important element of the algorithm involves approximating unknown responses of the structures and employing efficient statistical moment estimation methods. The kriging method was used in this paper. Additionally, the article evaluates two experimental plan techniques: the classical random sampling plan and the OLH plan. [ABSTRACT FROM AUTHOR]

The ultimate goals of Augmented Reality (AR) applications are to provide a better management and ubiquitous access to information using seamless techniques in which the interactive real world is combined with an interactive computer-generated world, creating one coherent environment. The performance of the AR algorithm in terms of brightness, rotation, and scale in the real environment had been addressed as an issue due to the controlled environment. Hence, a performance evaluation of the AR algorithm in a real controlled environment is proposed in this paper. BRISK detector, FREAK descriptor, and Hamming distance matcher algorithms are implemented in a mobile AR application in order to evaluate the AR algorithm. The mobile AR application is run on the Samsung Note 9 smartphone. The image used in the evaluation is the Graffiti image from the Mikolajczyk data set. Graffiti image is fully printed in an A4 size paper and is attached to a wall with a height of 1.5m. This performance evaluation is able to evaluate the robustness of the AR algorithm in terms of brightness value from 0 Watts per square meter up to 70 Watts per square meter. The robustness of the AR algorithm in terms of scale invariance was evaluated from the distance of 5cm up to 50cm from the input image. The AR algorithm can obtain an accuracy of 83.49%, 70.89%, and 72.78% in terms of brightness changes, scale changes, and rotation changes respectively. This work introduces a more suitable performance evaluation for an AR application in a real controlled environment. [ABSTRACT FROM AUTHOR]

Blockchain technology finds widespread application across various fields due to its key features such as immutability, reduced costs, decentralization, and transparency. The security of blockchain relies on elements like hashing, digital signatures, and cryptography. However, the emergence of quantum computers and supporting algorithms poses a threat to blockchain security. These quantum algorithms pose a significant threat to both public-key cryptography and hash functions, compelling the redesign of blockchain architectures. This paper investigates the status quo of the post-quantum, quantum-safe, or quantum-resistant cryptosystems within the framework of blockchain. This study starts with a fundamental overview of both blockchain and quantum computing, examining their reciprocal influence and evolution. Subsequently, a comprehensive literature review is conducted focusing on Post-Quantum Distributed Ledger Technology (PQDLT). This research emphasizes the practical implementation of these protocols and algorithms providing extensive comparisons of characteristics and performance. This work will help to foster further research at the intersection of post-quantum cryptography and blockchain systems and give prospective directions for future PQDLT researchers and developers. [ABSTRACT FROM AUTHOR]

Information and communication technologies are spreading rapidly due to their fast proliferation in many fields. The number of Internet users has led to a spike in cyber-attack incidents. E-commerce applications, such as online banking, marketing, trading, and other online businesses, play an integral role in our lives. Network Intrusion Detection System (NIDS) is essential to protect the network from unauthorized access and against other cyber-attacks. The existing NIDS systems are based on the Backward Oracle Matching (BOM) algorithm, which minimizes the false alarm rate and causes of high packet drop ratio. This paper discussed the existing NIDS systems and different used pattern-matching techniques regarding their weaknesses and limitations. To address the existing system issues, this paper proposes an enhanced version of the BOM algorithm by using multiple pattern-matching methods for the NIDS system to improve the network performance. The proposed solution is tested in simulation with existing solutions using the Snort and NSL-KDD datasets. The experimental results indicated that the proposed solution performed better than the existing solutions and achieved a 5.17% detection rate and a 0.22% lower false alarm rate than the existing solution. [ABSTRACT FROM AUTHOR]

3D models are essential in virtual reality, game development, architecture design, engineering drawing, medicine, and more. Compared to digital images, 3D models can provide more realistic visual effects. In recent years, significant progress has been made in the field of digital image encryption, and researchers have developed new algorithms that are more secure and efficient. However, there needs to be more research on 3D model encryption. This paper proposes a new 3D model encryption algorithm, called the 1D map with sin and logistic coupling (1D-MWSLC), because existing digital image encryption algorithms cannot be directly applied to 3D models. Firstly, this paper introduce 1D-MWSLC, which has a wider range of parameters compared to traditional 1D chaotic systems. When the parameter exceeds a specific range, the chaotic phenomenon does not weaken. Additionally, 1D-MWSLC has two control parameters, which increases the cryptosystem's parameter space. Next, 1D-MWSLC generates keystreams for confusion and diffusion. In the confusion stage, this paper use random confusion, and the keystream generates an index matrix that confuses the integer and decimal parts of the 3D model simultaneously. In the diffusion stage, this paper use parallel bidirectional diffusion to simultaneously diffuse the integer parts of the three coordinates of the 3D model. Finally, this paper verify the proposed algorithm through statistical analysis, and experimental results demonstrate that the proposed 3D model encryption algorithm has robust security. [ABSTRACT FROM AUTHOR]

In this paper, we consider the issue of digital camera identification based on images. This topic matches the area of digital forensics. The problem is well known in the literature and many algorithms based on camera's fingerprint have been proposed. In this paper, we discuss the digital camera identification based on convolutional neural networks (CNN). CNNs are state-of-the-art method in computer vision and are widely utilized in many applications. Our goal is to find out whether it is possible to speed up the process of learning the networks by the images. We conduct a set of representative experiments which show that replacing the ReLU with SELU activation function and adjusting the network's hyperparamethers (e.g. learning rate) may have a significant impact on reduction time of learning. We also consider using the dropout layer. The experiments are held on representative image dataset, consisting of many images coming from modern cameras and show effectiveness of our propositions. [ABSTRACT FROM AUTHOR]

This paper investigates the multifaceted issue of algorithmic bias in artificial intelligence (AI) systems and explores its ethical and human rights implications. The study encompasses a comprehensive analysis of AI bias, its causes, and potential remedies, with a particular focus on its impact on individuals and marginalized communities. The primary objectives of this research are to examine the concept of algorithmic bias, assess its ethical and human rights implications, identify its causes and mechanisms, evaluate its societal impact, explore mitigation strategies, and examine regulatory and community-driven approaches to address this critical issue. The research employs a multidisciplinary approach, drawing from literature reviews, case studies, and ethical analyses. It synthesizes insights from academic papers, governmental reports, and industry guidelines to construct a comprehensive overview of algorithmic bias and its ramifications. This research paper underscores the urgency of addressing algorithmic bias, as it raises profound ethical and human rights concerns. It advocates for comprehensive approaches, spanning technical, ethical, regulatory, and communitydriven dimensions, to ensure that AI technologies respect the rights and dignity of individuals and communities in our increasingly AI-driven world. [ABSTRACT FROM AUTHOR]

This paper consists of a bibliometric study that covers the topic of 3D object detection from 2022 until the present day. It employs various analysis approaches that shed light on the leading authors, affiliations, and countries within this research domain alongside the main themes of interest related to it. The findings revealed that China is the leading country in this domain given the fact that it is responsible for most of the scientific literature as well as being a host for the most productive universities and authors in terms of the number of publications. China is also responsible for initiating a significant number of collaborations with various nations around the world. The most basic theme related to this field is deep learning, along with autonomous driving, point cloud, robotics, and LiDAR. The work also includes an in-depth review that underlines some of the latest frameworks that took on various challenges regarding this topic, the improvement of object detection from point clouds, and training end-to-end fusion methods using both camera and LiDAR sensors, to name a few. [ABSTRACT FROM AUTHOR]

Profit prediction is a pivotal task in financial markets, empowering investors and traders to make informed decisions. In recent years, the advent of deep learning techniques has revolutionized the field of financial forecasting, offering the potential to extract intricate patterns and relationships from vast and complex datasets. This paper presents an innovative approach to profit prediction using Long Short-Term Memory (LSTM) networks, a specialized type of Recurrent Neural Network (RNN). LSTMs excel at capturing long term dependencies in sequential data, making them well-suited for modeling the dynamics of the financial markets. The core of the paper lies in the practical application of LSTM model architecture specially tailored for profit prediction. This includes defining the input layer, LSTM layers, fully connected layers and the output layer. The training and validation process is elucidated, covering data splitting, model training, validation techniques and hyper parameter tuning to enter ensure the model performance. The paper also explores the practical application of the LSTM-based profit prediction algorithm through a case study involving real-world financial data. Evaluation metrics such as Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) are employed to assess the algorithm's predictive accuracy and effectiveness. Additionally, the paper addresses risk assessment, a critical aspect of profit prediction in financial markets. It sheds light on the promising potential of LSTM-based profit prediction algorithms as a powerful tool for financial forecasting. It summarizes key findings, acknowledges limitations and challenges, and outlines future directions for improving the algorithm, including incorporating additional data sources and fine-tuning hyper parameters. The presented approach offers a significant advancement in the realm of profit prediction, enabling investors and traders to make more informed and data-driven decisions in an ever-evolving financial landscape. [ABSTRACT FROM AUTHOR]

Solving arithmetic word problems (AWPs) that involve deep implicit relations can be quite challenging. However, the paper proposed two approaches to tackle this issue. The first approach used the modifier-to-matrix (MTM) model to extract noun modification components from the problem text. Specifically, a missing entity recovery (MER) model translated explicit expressions into a node dependency graph (NDG). The nodes on the graph then recursively acquired connections from the knowledge base through the MER model until the goal was achieved with a known quantity. The solving engine then selected the appropriate knowledge as the prompt. The second approach proposed in the paper was a comprehensive one that combined explicit and implicit knowledge to enhance reasoning abilities. The experimental results of the dataset demonstrate that the proposed algorithm is superior to the baseline algorithms in solving AWPs that require deep implicit relations. [ABSTRACT FROM AUTHOR]

The digital economy is developing rapidly worldwide, which is of great strategic significance in leading and driving the process of high-quality and high-efficiency development of the economy. It has gradually become a new engine to promote China's economic growth. Therefore, it is vital to establish a digital economy indicator system. In this context, according to the connotation of digital economy, comprehensively consider the four dimensions of digital foundation, digital application, digital innovation and digital benefit, and build a full-scale digital economy indicator system. However, some previous literature proposed operating the K-means clustering algorithm in optimizing the index system. The algorithm, susceptible to the initial selection of cluster center, generates completely different clustering results with other random seed points and is thus unsuitable for optimizing the index system. Based on this, the advantages of GRA, SA, and K-means algorithms are combined to propose a K-means-SA algorithm that can obtain the global optimal solution. Then, by combining the K-means SA algorithm and the rough set algorithm, the constructed index system is further optimized. Ultimately, it establishes a set of all-round, multi-system and multi-dimensional digital economy index systems, which is of great reference significance for formulating relevant policies, provides scientific index support for the subsequent extension of digital economy theory, and promotes the benign growth of the worldwide economy. Plain language summary: The importance of constructing and optimizing the digital economy indicator system In today's rapid development of the digital economy, a set of scientific, feasible, and practical application values of the digital economy evaluation index system is constructed to evaluate better and promote the development of the digital economy. Based on the four dimensions of digital foundation, digital application, digital innovation, and digital benefit, this paper constructs a comprehensive evaluation index system for the development level of the digital economy. In addition, by combining the advantages of GRA, SA, and K-means algorithms, a K-means SA algorithm can obtain the global optimal solution proposed. Then, the K-mean-SA algorithm is combined with the rough set algorithm to optimize the constructed index system further. Finally, a comprehensive, multisystem, and multi-dimensional evaluation index system for the development level of the digital economy is established, which provides scientific support for the development of digital economy theory and promotes the healthy development of the digital economy. Although this paper collects indicators related to the digital economy as comprehensively as possible based on existing studies, there are still some limitations in the selection of needles due to the strong integration of the digital economy. [ABSTRACT FROM AUTHOR]

This article proposes the deep learning algorithm- Convolutional Neural Networks (CNN) for both Glioma tumor classifications and diagnosis process. This proposed CNN architecture is derived from the conventional CNN architecture to obtain the optimum classification and diagnosis accuracy. This proposed CNN architecture is derived from the conventional system for obtaining the high classification and diagnosis performance. This proposed methodology stated in this paper uses BRATS 2015 open access dataset for obtaining the brain Magnetic Resonance Image (MRI) for tumor region detection. The proposed methodology stated in this paper for tumor diagnosis achieves 97.7% of Jaccard Index (J) and 83.8% of Dice Similarity Index (DSI) and 99.025 of Diagnosis Rate (DR) using CNN algorithm.. [ABSTRACT FROM AUTHOR]

Nowadays, the consumption is the most significant factor in the economy. The consumption requires different items, which must be produced by the industry. Production processes are realized mainly on workplaces, so their importance is inevitably. This paper presents an overview about the planning process of material handling machines, especially for the production workplaces. The research, shown in this paper, targets to select the most suitable material handling equipment for different production workplaces. The topic presented in this paper deals with the building of selection algorithm for the exclusion of non-applicable equipment types. To show the useability of the concept an example will also be presented. [ABSTRACT FROM AUTHOR]