Search

There is increasing focus on applying deep learning methods to electrocardiograms (ECGs), with recent studies showing that neural networks (NNs) can predict future heart failure or atrial fibrillation from the ECG alone. However, large numbers of ECGs are needed to train NNs, and many ECGs are currently only in paper format, which are not suitable for NN training. We developed a fully-automated online ECG digitisation tool to convert scanned paper ECGs into digital signals. Using automated horizontal and vertical anchor point detection, the algorithm automatically segments the ECG image into separate images for the 12 leads and a dynamical morphological algorithm is then applied to extract the signal of interest. We then validated the performance of the algorithm on 515 digital ECGs, of which 45 were printed, scanned and redigitised. The automated digitisation tool achieved 99.0% correlation between the digitised signals and the ground truth ECG (n = 515 standard 3-by-4 ECGs) after excluding ECGs with overlap of lead signals. Without exclusion, the performance of average correlation was from 90 to 97% across the leads on all 3-by-4 ECGs. There was a 97% correlation for 12-by-1 and 3-by-1 ECG formats after excluding ECGs with overlap of lead signals. Without exclusion, the average correlation of some leads in 12-by-1 ECGs was 60–70% and the average correlation of 3-by-1 ECGs achieved 80–90%. ECGs that were printed, scanned, and redigitised, our tool achieved 96% correlation with the original signals. We have developed and validated a fully-automated, user-friendly, online ECG digitisation tool. Unlike other available tools, this does not require any manual segmentation of ECG signals. Our tool can facilitate the rapid and automated digitisation of large repositories of paper ECGs to allow them to be used for deep learning projects. [ABSTRACT FROM AUTHOR]

The optimization of open pit mine production scheduling is not only a multistage decision-making problem but also involves space-time dynamic action among multiple factors, which makes it difficult to optimize production capacity, mining sequence, mining life, and other factors simultaneously in optimizing design. In addition, the production capacity is disorderly expanded, the calculation scale is large, and the optimization time is long. Therefore, this article designs a mobile capacity search domain method to improve computing efficiency without omitting the optimal production capacity. At the same time, taking the maximum net present value as the objective function, an enumeration method is used to optimize the possible paths in different capacity domains and calculate the infrastructure investment and facility idle cost required to meet the maximum production capacity on each possible path to control the disorderly expansion and violent fluctuation of production capacity. The research shows that the open pit mine production scheduling optimization algorithm proposed in this article can not only realize the simultaneous optimization of the three elements of production capacity, mining sequence, and mining life but also improve the computing efficiency by 200 times. Furthermore, the production capacity fluctuation is less than 1.4%. The mining life of the mine is extended by 13 years, and the overall economic benefit is increased by 18%., (© 2023. The Author(s).)

To date, a large number of active learning algorithms have been proposed, but active learning methods for ordinal classification are under-researched. For ordinal classification, there is a total ordering among the data classes, and it is natural that the cost of misclassifying an instance as an adjacent class should be lower than that of misclassifying it as a more disparate class. However, existing active learning algorithms typically do not consider the above ordering information in query selection. Thus, most of them do not perform satisfactorily in ordinal classification. This study proposes an active learning method for ordinal classification by considering the ordering information among classes. We design an expected cost minimization criterion that imbues the ordering information. Meanwhile, we incorporate it with an uncertainty sampling criterion to impose the query instance more informative. Furthermore, we introduce a candidate subset selection method based on the k-means algorithm to reduce the computational overhead led by the calculation of expected cost. Extensive experiments on nine public ordinal classification datasets demonstrate that the proposed method outperforms several baseline methods., (© 2022. The Author(s).)

Interstate pipelines are the most efficient and feasible mean of transport for crude oil and gas within boarders. Assessing the risks of these pipelines is challenging despite the evolution of computational fuzzy inference systems (FIS). The computational intricacy increases with the dimensions of the system variables especially in the typical Takagi-Sugeno (T-S) fuzzy-model. Typically, the number of rules rises exponentially as the number of system variables increases and hence, it is unfeasible to specify the rules entirely for pipeline risk assessments. This work proposes the significance of indexing pipeline risk assessment approach that is integrated with subtractive clustering fuzzy logic to address the uncertainty of the real-world circumstances. Hypothetical data is used to setup the subtractive clustering fuzzy-model using the fundamental rules and scores of the pipeline risk assessment indexing method. An interstate crude-oil pipeline in Egypt is used as a case study to demonstrate the proposed approach., (© 2022. The Author(s).)

Unmanned Aerial Vehicles are useful tools for many applications. However, autonomous path planning for Unmanned Aerial Vehicles in unfamiliar environments is a challenging problem when facing a series of problems such as poor consistency, high influence by the native controller of the Unmanned Aerial Vehicles. In this paper, we investigate reinforcement learning-based autonomous local path planning methods for Unmanned Aerial Vehicles with high autonomous decision-making capability and locally high portability. We propose an autonomous local path planning algorithm based on the TD3 strategy to solve the problem of local obstacle avoidance and path planning in unfamiliar environments using autonomous decision-making of Unmanned Aerial Vehicles. The simulation results on Gazebo show that our method can effectively realize the autonomous local path planning task for Unmanned Aerial Vehicles, the success rate of path planning with our method can reach 93% under the interference of no obstacles, and 92% in the environment with obstacles. Finally, our method can be used for autonomous path planning of Unmanned Aerial Vehicles in unfamiliar environments. [ABSTRACT FROM AUTHOR]

In industry, the task of defect classification and defect localization is an important part of defect detection system. However, existing studies only focus on one task and it is difficult to ensure the accuracy of both tasks. This paper proposes a defect detection system based on improved Yolo_v4, which greatly improves the detection ability of minor defects. For K_Means algorithm clustering prianchors question with strong subjectivity, the paper proposes the Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to determine the number of Anchors. To solve the problem of low detection rate of small targets caused by insufficient reuse rate of low-level features in CSPDarknet53 feature extraction network, this paper proposes an ECA-DenseNet-BC-121 feature extraction network to improve it. And the Dual Channel Feature Enhancement (DCFE) module is proposed to improve the local information loss and gradient propagation obstruction caused by quad chain convolution in PANet networks to improve the robustness of the model. The experimental results on the fabric surface defect detection datasets show that the mAP of the improved Yolo_v4 is 98.97%, which is 7.67% higher than SSD, 3.75% higher than Faster_RCNN, 10.82% higher than Yolo_v4 tiny, and 5.35% higher than Yolo_v4, and the detection speed reaches 39.4 fps. It can meet the real-time monitoring needs of industrial sites. [ABSTRACT FROM AUTHOR]

The development of visual tools for the timely identification of spatio-temporal clusters will assist in implementing control measures to prevent further damage. From January 2015 to June 2020, a total number of 1463 avian influenza outbreak farms were detected in Taiwan and further confirmed to be affected by highly pathogenic avian influenza subtype H5Nx. In this study, we adopted two common concepts of spatio-temporal clustering methods, the Knox test and scan statistics, with visual tools to explore the dynamic changes of clustering patterns. Since most (68.6%) of the outbreak farms were detected in 2015, only the data from 2015 was used in this study. The first two-stage algorithm performs the Knox test, which established a threshold of 7 days and identified 11 major clusters in the six counties of southwestern Taiwan, followed by the standard deviational ellipse (SDE) method implemented on each cluster to reveal the transmission direction. The second algorithm applies scan likelihood ratio statistics followed by AGC index to visualize the dynamic changes of the local aggregation pattern of disease clusters at the regional level. Compared to the one-stage aggregation approach, Knox-based and AGC mapping were more sensitive in small-scale spatio-temporal clustering., (© 2021. The Author(s).)

This paper aims to propose a table tennis target detection (TD) method based on deep learning (DL) and multi-scale feature fusion (MFF) to improve the detection accuracy of the ball in table tennis competition, optimize the training process of athletes, and improve the technical level. In this paper, DL technology is used to improve the accuracy of table tennis TD through MFF guidance. Initially, based on the FAST Region-based Convolutional Neural Network (FAST R-CNN), the TD is carried out in the table tennis match. Then, through the method of MFF guidance, different levels of feature information are fused, which improves the accuracy of TD. Through the experimental verification on the test set, it is found that the mean Average Precision (mAP) value of the target detection algorithm (TDA) proposed here reaches 87.3%, which is obviously superior to other TDAs and has higher robustness. The DL TDA combined with the proposed MFF can be applied to various detection fields and can help the application of TD in real life. [ABSTRACT FROM AUTHOR]

Recent research has focused on applying blockchain technology to solve security-related problems in Internet of Things (IoT) networks. However, the inherent scalability issues of blockchain technology become apparent in the presence of a vast number of IoT devices and the substantial data generated by these networks. Therefore, in this paper, we use a lightweight consensus algorithm to cater to these problems. We propose a scalable blockchain-based framework for managing IoT data, catering to a large number of devices. This framework utilizes the Delegated Proof of Stake (DPoS) consensus algorithm to ensure enhanced performance and efficiency in resource-constrained IoT networks. DPoS being a lightweight consensus algorithm leverages a selected number of elected delegates to validate and confirm transactions, thus mitigating the performance and efficiency degradation in the blockchain-based IoT networks. In this paper, we implemented an Interplanetary File System (IPFS) for distributed storage, and Docker to evaluate the network performance in terms of throughput, latency, and resource utilization. We divided our analysis into four parts: Latency, throughput, resource utilization, and file upload time and speed in distributed storage evaluation. Our empirical findings demonstrate that our framework exhibits low latency, measuring less than 0.976 ms. The proposed technique outperforms Proof of Stake (PoS), representing a state-of-the-art consensus technique. We also demonstrate that the proposed approach is useful in IoT applications where low latency or resource efficiency is required. [ABSTRACT FROM AUTHOR]

In order to address the challenges of identifying, detecting, and tracking moving objects in video surveillance, this paper emphasizes image-based dynamic entity detection. It delves into the complexities of numerous moving objects, dense targets, and intricate backgrounds. Leveraging the You Only Look Once (YOLOv3) algorithm framework, this paper proposes improvements in image segmentation and data filtering to address these challenges. These enhancements form a novel multi-object detection algorithm based on an improved YOLOv3 framework, specifically designed for video applications. Experimental validation demonstrates the feasibility of this algorithm, with success rates exceeding 60% for videos such as "jogging", "subway", "video 1", and "video 2". Notably, the detection success rates for "jogging" and "video 1" consistently surpass 80%, indicating outstanding detection performance. Although the accuracy slightly decreases for "Bolt" and "Walking2", success rates still hover around 70%. Comparative analysis with other algorithms reveals that this method's tracking accuracy surpasses that of particle filters, Discriminative Scale Space Tracker (DSST), and Scale Adaptive Multiple Features (SAMF) algorithms, with an accuracy of 0.822. This indicates superior overall performance in target tracking. Therefore, the improved YOLOv3-based multi-object detection and tracking algorithm demonstrates robust filtering and detection capabilities in noise-resistant experiments, making it highly suitable for various detection tasks in practical applications. It can address inherent limitations such as missed detections, false positives, and imprecise localization. These improvements significantly enhance the efficiency and accuracy of target detection, providing valuable insights for researchers in the field of object detection, tracking, and recognition in video surveillance. [ABSTRACT FROM AUTHOR]

Wireless sensor network (WSN) location is a significant research area. In complex environments like forests, inaccurate signal intensity ranging is a major challenge. To address this issue, this paper presents a reliable WSN distance measurement-positioning algorithm for forest environments. The algorithm divides the positioning area into several sub-regions based on the discrete coefficient of the collected signal strength. Then, using the fitting method based on the signal intensity value of each sub-region, the algorithm derives the reference points of the logarithmic distance path loss model and path loss index. Finally, the algorithm locates target nodes using anchor nodes in different regions. Additionally, to enhance the positioning accuracy, weight values are assigned to the positioning result based on the discrete coefficient of the signal intensity in each sub-region. Experimental results demonstrate that the proposed WSN algorithm has high precision in forest environments. [ABSTRACT FROM AUTHOR]

In recent years, highway accidents occur frequently, the main reason is that there is always foreign body invasion on the highway, which makes people unable to respond to emergencies in time. In order to reduce the occurrence of highway incidents, an object detection algorithm for highway intrusion was proposed in this paper. Firstly, a new feature extraction module was proposed to better preserve the main information. Secondly, a new feature fusion method was proposed to improve the accuracy of object detection. Finally, a lightweight method was proposed to reduce the computational complexity. We compare the algorithm in this paper with existing algorithms, the experimental results showed that: On the Visdrone dataset (small size targets), (a) the CS-YOLO was 3.6% more accurate than the YOLO v8. (b) The CS-YOLO was 1.2% more accurate than the YOLO v8 on the Tinypersons dataset (minimal size targets). (c) CS-YOLO was 1.4% more accurate than YOLO v8 on VOC2007 data set (normal size). [ABSTRACT FROM AUTHOR]

YOLOv5 is one of the most popular object detection algorithms, which is divided into multiple series according to the control of network depth and width. To realize the deployment of mobile devices or embedded devices, the paper proposes a lightweight aerial image object detection algorithm (LAI-YOLOv5s) based on the improvement of YOLOv5s with a relatively small amount of calculation and parameter and relatively fast reasoning speed. Firstly, to better detect small objects, the paper replaces the minimum detection head with the maximum detection head and proposes a new feature fusion method, DFM-CPFN(Deep Feature Map Cross Path Fusion Network), to enrich the semantic information of deep features. Secondly, the paper designs a new module based on VoVNet to improve the feature extraction ability of the backbone network. Finally, based on the idea of ShuffleNetV2, the paper makes the network more lightweight without affecting detection accuracy. Based on the VisDrone2019 dataset, the detection accuracy of LAI-YOLOv5s on the mAP@0.5 index is 8.3% higher than that of the original algorithm. Compared with other series of YOLOv5 and YOLOv3 algorithms, LAI-YOLOv5s has the advantages of low computational cost and high detection accuracy. [ABSTRACT FROM AUTHOR]

Image stitching is a fundamental pillar of computer vision, and its effectiveness hinges significantly on the quality of the feature descriptors. However, the existing feature descriptors face several challenges, including inadequate robustness to noise or rotational transformations and limited adaptability during hardware deployment. To address these limitations, this paper proposes a set of feature descriptors for image stitching named Lightweight Multi-Feature Descriptors (LMFD). Based on the extensive extraction of gradients, means, and global information surrounding the feature points, feature descriptors are generated through various combinations to enhance the image stitching process. This endows the algorithm with formidable rotational invariance and noise resistance, thereby improving its accuracy and reliability. Furthermore, the feature descriptors take the form of binary matrices consisting of 0s and 1s, not only facilitating more efficient hardware deployment but also enhancing computational efficiency. The utilization of binary matrices significantly reduces the computational complexity of the algorithm while preserving its efficacy. To validate the effectiveness of LMFD, rigorous experimentation was conducted on the Hpatches and 2D-HeLa datasets. The results demonstrate that LMFD outperforms state-of-the-art image matching algorithms in terms of accuracy. This empirical evidence solidifies the superiority of LMFD and substantiates its potential for practical applications in various domains. [ABSTRACT FROM AUTHOR]

The optimal operation of reservoir groups is a strongly constrained, multi-stage, and high-dimensional optimization problem. In response to this issue, this article couples the standard Pelican optimization algorithm with adaptive ε constraint methods, and further improves the optimization performance of the algorithm by initializing the population with a good point set, reverse differential evolution, and optimal individual t-distribution perturbation strategy. Based on this, an improved Pelican algorithm coupled with adaptive ε constraint method is proposed (ε-IPOA). The performance of the algorithm was tested through 24 constraint testing functions to find the optimal ability and solve constraint optimization problems. The results showed that the algorithm has strong optimization ability and stable performance. In this paper, we select Sanmenxia and Xiaolangdi reservoirs as the research objects, establish the maximum peak-cutting model of terrace reservoirs, apply the ε-IPOA algorithm to solve the model, and compare it with the ε-POA (Pelican algorithm coupled with adaptive ε constraint method) and ε-DE (Differential Evolution Algorithm) algorithms, the results indicate that ε. The peak flow rate of the Huayuankou control point solved by the IPOA algorithm is 12,319 m3/s, which is much lower than the safe overflow flow rate of 22,000 m3/s at the Huayuankou control point, with a peak shaving rate of 44%, and other algorithms do not find effective solutions meeting the constraint conditions. This paper provides a new idea for solving the problem of flood control optimal operation of cascade reservoirs. [ABSTRACT FROM AUTHOR]

For solving the problem of quality detection in the production and processing of stuffed food, this paper suggests a small neighborhood clustering algorithm to segment the frozen dumpling image on the conveyor belt, which can effectively improve the qualified rate of food quality. This method builds feature vectors by obtaining the image's attribute parameters. The image is segmented by a distance function between categories using a small neighborhood clustering algorithm based on sample feature vectors to calculate the cluster centers. Moreover, this paper gives the selection of optimal segmentation points and sampling rate, calculates the optimal sampling rate, suggests a search method for optimal sampling rate, as well as a validity judgment function for segmentation. Optimized small neighborhood clustering (OSNC) algorithm uses the fast frozen dumpling image as a sample for continuous image target segmentation experiments. The experimental results show the accuracy of defect detection of OSNC algorithm is 95.9%. Compared with other existing segmentation algorithms, OSNC algorithm has stronger anti-interference ability, faster segmentation speed as well as more efficiently saves key information ability. It can effectively improve some disadvantages of other segmentation algorithms. [ABSTRACT FROM AUTHOR]

Aiming at the problems of identifying storage pest tobacco pest beetles from images that have few object pixels and considerable image noise, and therefore suffer from lack of information and identifiable features, this paper proposes an automatic monitoring method of tobacco beetle based on Multi-scale Global residual Feature Pyramid Network and Dual-path Deformable Attention (MGrFPN-DDrGAM). Firstly, a Multi-scale Global residual Feature Pyramid Network (MGrFPN) is constructed to obtain rich high-level semantic features and more complete information on low-level features to reduce missed detection; Then, a Dual-path Deformable receptive field Guided Attention Module (DDrGAM) is designed to establish long-range channel dependence, guide the effective fusion of features and improve the localization accuracy of tobacco beetles by fitting the spatial geometric deformation features of and capturing the spatial information of feature maps with different scales to enrich the feature information in the channel and spatial. Finally, to simulate a real scene, a multi-scene tobacco beetle dataset is created. The dataset includes 28,080 images and manually labeled tobacco beetle objects. The experimental results show that under the framework of the Faster R-CNN algorithm, the detection precision and recall rate of this method can reach 91.4% and 98.4% when the intersection ratio (IoU) is 0.5. Compared with Faster R-CNN and FPN, when the intersection ratio (IoU) is 0.7, the detection precision is improved by 32.9% and 6.9%, respectively. The proposed method is superior to the current mainstream methods. [ABSTRACT FROM AUTHOR]

With the rapid development of AI and big data mining technologies, computerized medical decision-making has become increasingly prominent. The aim of high-utility pattern mining (HUPM) is to discover meaningful patterns in medical databases that contribute to maximizing the utility from the perspective of diagnosis. However, HUPM pays less attention to the interpretability and explainability of these patterns in medical decision-making scenarios. This paper proposes a novel algorithm called the Improved fuzzy high-utility pattern mining (IF-HUPM) to address this problem. First, the paper applies a fuzzy preprocessing method to divide the fuzzy intervals of a medical quantitative data set, which enhances the fuzziness and interpretability of the data. Next, in the process of IF-HUPM, both fuzzy tree and list structures are employed to calculate fuzzy high-utility values. By combining the characteristics of the one-stage and two-stage algorithms of HUPM, an adaptive-phase Fuzzy HUPM hybrid frame is proposed. The experimental results demonstrate that the proposed IF-HUPM algorithm enhances both accuracy and efficiency and the mining process requires less time and space on average. [ABSTRACT FROM AUTHOR]

Recently, skin cancer is one of the spread and dangerous cancers around the world. Early detection of skin cancer can reduce mortality. Traditional methods for skin cancer detection are painful, time-consuming, expensive, and may cause the disease to spread out. Dermoscopy is used for noninvasive diagnosis of skin cancer. Artificial Intelligence (AI) plays a vital role in diseases' diagnosis especially in biomedical engineering field. The automated detection systems based on AI reduce the complications in the traditional methods and can improve skin cancer's diagnosis rate. In this paper, automated early detection system for skin cancer dermoscopic images using artificial intelligent is presented. Adaptive snake (AS) and region growing (RG) algorithms are used for automated segmentation and compared with each other. The results show that AS is accurate and efficient (accuracy = 96%) more than RG algorithm (accuracy = 90%). Artificial Neural networks (ANN) and support vector machine (SVM) algorithms are used for automated classification compared with each other. The proposed system with ANN algorithm shows high accuracy (94%), precision (96%), specificity (95.83%), sensitivity (recall) (92.30%), and F1-score (0.94). The proposed system is easy to use, time consuming, enables patients to make early detection for skin cancer and has high efficiency., (© 2024. The Author(s).)

In the field of population health research, understanding the similarities between geographical areas and quantifying their shared effects on health outcomes is crucial. In this paper, we synthesise a number of existing methods to create a new approach that specifically addresses this goal. The approach is called a Bayesian spatial Dirichlet process clustered heterogeneous regression model. This non-parametric framework allows for inference on the number of clusters and the clustering configurations, while simultaneously estimating the parameters for each cluster. We demonstrate the efficacy of the proposed algorithm using simulated data and further apply it to analyse influential factors affecting children's health development domains in Queensland. The study provides valuable insights into the contributions of regional similarities in education and demographics to health outcomes, aiding targeted interventions and policy design., (© 2024. The Author(s).)

Stitching of microscopic images is a technique used to combine multiple overlapping images (tiles) from biological samples with a limited field of view and high resolution to create a whole slide image. Image stitching involves two main steps: pairwise registration and global alignment. Most of the computational load and the accuracy of the stitching algorithm depend on the pairwise registration method. Therefore, choosing an efficient, accurate, robust, and fast pairwise registration method is crucial in the whole slide imaging technique. This paper presents a detailed comparative analysis of different pairwise registration techniques in terms of execution time and quality. These techniques included feature-based methods such as Harris, Shi-Thomasi, FAST, ORB, BRISK, SURF, SIFT, KAZE, MSER, and deep learning-based SuperPoint features. Additionally, region-based methods were analyzed, which were based on the normalized cross-correlation (NCC) and the combination of phase correlation and NCC. Investigations have been conducted on microscopy images from different modalities such as bright-field, phase-contrast, and fluorescence. The feature-based methods were highly robust to uneven illumination in tiles. Moreover, some features were found to be more accurate and faster than region-based methods, with the SURF features identified as the most effective technique. This study provides valuable insights into the selection of the most efficient and accurate pairwise registration method for creating whole slide images, which is essential for the advancement of computational pathology and biology., (© 2024. The Author(s).)

In this research paper, the intelligent learning abilities of the gray wolf optimization (GWO), multi-verse optimization (MVO), moth fly optimization, particle swarm optimization (PSO), and whale optimization algorithm (WOA) metaheuristic techniques and the response surface methodology (RSM) has been studied in the prediction of the mechanical properties of self-healing concrete. Bio-concrete technology stimulated by the concentration of bacteria has been utilized as a sustainable structural concrete for the future of the built environment. This is due to the recovery tendency of the concrete structures after noticeable structural failures. However, it requires a somewhat expensive exercise and technology to create the medium for the growth of the bacteria needed for this self-healing ability. The method of data gathering, analysis and intelligent prediction has been adopted to propose parametric relationships between the bacteria usage and the concrete performance in terms of strength and durability. This makes is cheaper to design self-healing concrete structures based on the optimized mathematical relationships and models proposed from this exercise. The performance of the models was tested by using the coefficient of determination (R 2 ), root mean squared errors, mean absolute errors, mean squared errors, variance accounted for and the coefficient of error. At the end of the prediction protocol and model performance evaluation, it was found that the classified metaheuristic techniques outclassed the RSM due their ability to mimic human and animal genetics of mutation. Furthermore, it can be finally remarked that the GWO outclassed the other methods in predicting the concrete slump (Sl) with R 2 of 0.998 and 0.989 for the train and test, respectively, the PSO outclassed the rest in predicting the flexural strength with R 2 of 0.989 and 0.937 for train and test, respectively and the MVO outclassed the others in predicting the compressive strength with R 2 of 0.998 and 0.958 for train and test, respectively., (© 2024. The Author(s).)

YOLOv3 is a popular and effective object detection algorithm. However, YOLOv3 has a complex network, and floating point operations (FLOPs) and parameter sizes are large. Based on this, the paper designs a new YOLOv3 network and proposes a lightweight object detection algorithm. First, two excellent networks, the Cross Stage Partial Network (CSPNet) and GhostNet, are integrated to design a more efficient residual network, CSP-Ghost-Resnet. Second, combining CSPNet and Darknet53, this paper designs a new backbone network, the ML-Darknet, to realize the gradient diversion of the backbone network. Finally, we design a lightweight multiscale feature extraction network, the PAN-CSP-Network. The newly designed network is named mini and lightweight YOLOv3 (ML-YOLOv3). Based on the helmet dataset, the FLPSs and parameter sizes of ML-YOLOv3 are only 29.7% and 29.4% of those of YOLOv3. Compared with YOLO5, ML-YOLOv3 also exhibits obvious advantages in calculation cost and detection effect. [ABSTRACT FROM AUTHOR]

Robot vision technology based on binocular vision holds tremendous potential for development in various fields, including 3D scene reconstruction, target detection, and autonomous driving. However, current binocular vision methods used in robotics engineering have limitations such as high costs, complex algorithms, and low reliability of the generated disparity map in different scenes. To overcome these challenges, a cross-domain stereo matching algorithm for binocular vision based on transfer learning was proposed in this paper, named Cross-Domain Adaptation and Transfer Learning Network (Ct-Net), which has shown valuable results in multiple robot scenes. First, this paper introduces a General Feature Extractor to extract rich general feature information for domain adaptive stereo matching tasks. Then, a feature adapter is used to adapt the general features to the stereo matching network. Furthermore, a Domain Adaptive Cost Optimization Module is designed to optimize the matching cost. A disparity score prediction module was also embedded to adaptively adjust the search range of disparity and optimize the cost distribution. The overall framework was trained using a phased strategy, and ablation experiments were conducted to verify the effectiveness of the training strategy. Compared with the prototype PSMNet, on KITTI 2015 benchmark, the 3PE-fg of Ct-Net in all regions and non-occluded regions decreased by 19.3 and 21.1% respectively, meanwhile, on the Middlebury dataset, the proposed algorithm improves the sample error rate at least 28.4%, which is the Staircase sample. The quantitative and qualitative results obtained from Middlebury, Apollo, and other datasets demonstrate that Ct-Net significantly improves the cross-domain performance of stereo matching. Stereo matching experiments in real-world scenes have shown that it can effectively address visual tasks in multiple scenes. [ABSTRACT FROM AUTHOR]

Distributed learning, as the most popular solution for training large-scale data for deep learning, consists of multiple participants collaborating on data training tasks. However, the malicious behavior of some during the training process, like Byzantine participants who would interrupt or control the learning process, will trigger the crisis of data security. Although recent existing defense mechanisms use the variability of Byzantine node gradients to clear Byzantine values, it is still unable to identify and then clear the delicate disturbance/attack. To address this critical issue, we propose an algorithm named consensus aggregation in this paper. This algorithm allows computational nodes to use the information of verification nodes to verify the effectiveness of the gradient in the perturbation attack, reaching a consensus based on the effective verification of the gradient. Then the server node uses the gradient as the valid gradient for gradient aggregation calculation through the consensus reached by other computing nodes. On the MNIST and CIFAR10 datasets, when faced with Drift attacks, the proposed algorithm outperforms common existing aggregation algorithms (Krum, Trimmed Mean, Bulyan), with accuracies of 93.3%, 94.06% (MNIST dataset), and 48.66%, 51.55% (CIFAR10 dataset), respectively. This is an improvement of 3.0%, 3.8% (MNIST dataset), and 19.0%, 26.1% (CIFAR10 dataset) over the current state-of-the-art methods, and successfully defended against other attack methods. [ABSTRACT FROM AUTHOR]

The outbreak of jellyfish blooms poses a serious threat to human life and marine ecology. Therefore, jellyfish detection techniques have earned great interest. This paper investigates the jellyfish detection and classification algorithm based on optical images and deep learning theory. Firstly, we create a dataset comprising 11,926 images. A MSRCR underwater image enhancement algorithm with fusion is proposed. Finally, an improved YOLOv4-tiny algorithm is proposed by incorporating a CBMA module and optimizing the training method. The results demonstrate that the detection accuracy of the improved algorithm can reach 95.01%, the detection speed is 223FPS, both of which are better than the compared algorithms such as YOLOV4. In summary, our method can accurately and quickly detect jellyfish. The research in this paper lays the foundation for the development of an underwater jellyfish real-time monitoring system. [ABSTRACT FROM AUTHOR]

In Noisy Intermediate-Scale Quantum (NISQ) era, the scarcity of qubit resources has prevented many quantum algorithms from being implemented on quantum devices. Circuit cutting technology has greatly alleviated this problem, which allows us to run larger quantum circuits on real quantum machines with currently limited qubit resources at the cost of additional classical overhead. However, the classical overhead of circuit cutting grows exponentially with the number of cuts and qubits, and the excessive postprocessing overhead makes it difficult to apply circuit cutting to large scale circuits. In this paper, we propose a fast reconstruction algorithm based on Hamiltonian Monte Carlo (HMC) sampling, which samples the high probability solutions by Hamiltonian dynamics from state space with dimension growing exponentially with qubit. Our algorithm avoids excessive computation when reconstructing the original circuit probability distribution, and greatly reduces the circuit cutting post-processing overhead. The improvement is crucial for expanding of circuit cutting to a larger scale on NISQ devices. [ABSTRACT FROM AUTHOR]

The ever-increasing competitiveness in the academic publishing market incentivizes journal editors to pursue higher impact factors. This translates into journals becoming more selective, and, ultimately, into higher publication standards. However, the fixation on higher impact factors leads some journals to artificially boost impact factors through the coordinated effort of a "citation cartel" of journals. "Citation cartel" behavior has become increasingly common in recent years, with several instances being reported. Here, we propose an algorithm—named CIDRE—to detect anomalous groups of journals that exchange citations at excessively high rates when compared against a null model that accounts for scientific communities and journal size. CIDRE detects more than half of the journals suspended from Journal Citation Reports due to anomalous citation behavior in the year of suspension or in advance. Furthermore, CIDRE detects many new anomalous groups, where the impact factors of the member journals are lifted substantially higher by the citations from other member journals. We describe a number of such examples in detail and discuss the implications of our findings with regard to the current academic climate. [ABSTRACT FROM AUTHOR]

Canine personality and behavioural characteristics have a significant influence on relationships between domestic dogs and humans as well as determining the suitability of dogs for specific working roles. As a result, many researchers have attempted to develop reliable personality assessment tools for dogs. Most previous work has analysed dogs' behavioural patterns collected via questionnaires using traditional statistical analytic approaches. Artificial Intelligence has been widely and successfully used for predicting human personality types. However, similar approaches have not been applied to data on canine personality. In this research, machine learning techniques were applied to the classification of canine personality types using behavioural data derived from the C-BARQ project. As the dataset was not labelled, in the first step, an unsupervised learning approach was adopted and K-Means algorithm was used to perform clustering and labelling of the data. Five distinct categories of dogs emerged from the K-Means clustering analysis of behavioural data, corresponding to five different personality types. Feature importance analysis was then conducted to identify the relative importance of each behavioural variable's contribution to each cluster and descriptive labels were generated for each of the personality traits based on these associations. The five personality types identified in this paper were labelled: "Excitable/Hyperattached", "Anxious/Fearful", "Aloof/Predatory", "Reactive/Assertive", and "Calm/Agreeable". Four machine learning models including Support Vector Machine (SVM), K-Nearest Neighbour (KNN), Naïve Bayes, and Decision Tree were implemented to predict the personality traits of dogs based on the labelled data. The performance of the models was evaluated using fivefold cross validation method and the results demonstrated that the Decision Tree model provided the best performance with a substantial accuracy of 99%. The novel AI-based methodology in this research may be useful in the future to enhance the selection and training of dogs for specific working and non-working roles., (© 2024. The Author(s).)

The paper focuses on the correction of Illumina WGS sequencing reads. We provide an extensive evaluation of the existing correctors. To this end, we measure an impact of the correction on variant calling (VC) as well as de novo assembly. It shows, that in selected cases read correction improves the VC results quality. We also examine the algorithms behaviour in a processing of Illumina NovaSeq reads, with different reads quality characteristics than in older sequencers. We show that most of the algorithms are ready to cope with such reads. Finally, we introduce a new version of RECKONER, our read corrector, by optimizing it and equipping with a new correction strategy. Currently, RECKONER allows to correct high-coverage human reads in less than 2.5 h, is able to cope with two types of reads errors: indels and substitutions, and utilizes a new, based on a two lengths of oligomers, correction verification technique., (© 2024. The Author(s).)

This paper presents a novel semi-automatic method for lung segmentation in thoracic CT datasets. The fully three-dimensional algorithm is based on a level set representation of an active surface and integrates texture features to improve its robustness. The method's performance is enhanced by the graphics processing unit (GPU) acceleration. The segmentation process starts with a manual initialisation of 2D contours on a few representative slices of the analysed volume. Next, the starting regions for the active surface are generated according to the probability maps of texture features. The active surface is then evolved to give the final segmentation result. The recent implementation employs features based on grey-level co-occurrence matrices and Gabor filters. The algorithm was evaluated on real medical imaging data from the LCTCS 2017 challenge. The results were also compared with the outcomes of other segmentation methods. The proposed approach provided high segmentation accuracy while offering very competitive performance., (© 2024. The Author(s).)

In the field of data analysis, it is often faced with a large number of missing values, especially in metabolomics data, this problem is more prominent. Data imputation is a common method to deal with missing metabolomics data, while traditional data imputation methods usually ignore the differences in missing types, and thus the results of data imputation are not satisfactory. In order to discriminate the missing types of metabolomics data, a missing data classification model (PX-MDC) based on particle swarm algorithm and XGBoost is proposed in this paper. First, the missing values in a given missing data set are obtained by panning the missing values to obtain the largest subset of complete data, and then the particle swarm algorithm is used to search for the concentration threshold of missing data and the proportion of low concentration deletions as a percentage of overall deletions. Next, the missing data are simulated based on the search results. Finally, the training data are trained using the XGBoost model using the feature set proposed in this paper in order to build a classifier for the missing data. The experimental results show that the particle swarm algorithm is able to match the traditional enumeration method in terms of accuracy and significantly reduce the search time in concentration threshold search. Compared with the current mainstream methods, the PX-MDC model designed in this paper exhibits higher accuracy and is able to distinguish different deletion types for the same metabolite. This study is expected to make an important breakthrough in metabolomics data imputation and provide strong support for research in related fields., (© 2024. The Author(s).)

In the field of intelligent manufacturing, robot grasping and sorting is important content. However, there are some disadvantages in the traditional single-view-based manipulator grasping methods by using a 2D camera, where the efficiency and the accuracy of grasping are both low when facing the scene of stacking and occlusion for the reason that there is information missing by single-view 2D camera-based methods while acquiring scene information, and the methods of grasping only can't change the difficult-to-grasp scene which is stack and occluded. Regarding the issue above, a pushing-grasping collaborative method based on the deep Q-network in dual viewpoints is proposed in this paper. This method in this paper adopts an improved deep Q-network algorithm, with an RGB-D camera to obtain the information of objects' RGB images and point clouds from two viewpoints, which solved the problem of lack of information missing. What's more, it combines the pushing and grasping actions with the deep Q-network, which make it have the ability of active exploration, so that the trained manipulator can make the scenes less stacking and occlusion, and with the help of that, it can perform well in more complicated grasping scenes. In addition, we improved the reward function of the deep Q-network and propose the piecewise reward function to speed up the convergence of the deep Q-network. We trained different models and tried different methods in the V-REP simulation environment, and it drew a conclusion that the method proposed in this paper converges quickly and the success rate of grasping objects in unstructured scenes raises up to 83.5%. Besides, it shows the generalization ability and well performance when novel objects appear in the scenes that the manipulator has never grasped before. [ABSTRACT FROM AUTHOR]

This paper proposes a multi-task deep learning model for determining drug combination synergistic by simultaneously output synergy scores and synergy class labels. Initially, the two drugs are represented using a Simplified Molecular-Input Line-Entry (SMILE) system. Chemical structural features of the drugs are extracted from the SMILE using the RedKit package. Additionally, an improved Multi-view representation is proposed to extract graph-based drug features. Furthermore, the cancer cell line is represented by gene expression. Then, a three fully connected layers are learned to extract cancer cell line features. To investigate the impact of drug interactions on cell lines, the drug interaction features are extracted from a pretrained drugs interaction network and fed into an attention mechanism along with the cancer cell line features, resulting in the output of affected cancer cell line features. Subsequently, the drug and cell line features are concatenated and fed into an attention mechanism, which produces a two-feature representation for the two predicted tasks. The relationship between the two tasks is learned using the cross-stitch algorithm. Finally, each task feature is inputted into a fully connected subnetwork to predict the synergy score and synergy label. The proposed model 'MutliSyn' is evaluated using the O'Neil cancer dataset, comprising 38 unique drugs combined to form 22,737 drug combination pairs, tested on 39 cancer cell lines. For the synergy score, the model achieves a mean square error (MSE) of 219.14, a root mean square error (RMSE) of 14.75, and a Pearson score of 0.76. Regarding the synergy class label, the model achieves an area under the ROC curve (ROC-AUC) of 0.95, an area under the precision-recall curve (PR-AUC) of 0.85, precision of 0.93, kappa of 0.61, and accuracy of 0.90., (© 2023. The Author(s).)

A method of determining the optimal kernel size for filtering noise in vortex dominated flow-fields, as found in the cardiac chambers is presented in this paper. Using synthetic flow fields generated using harmonic functions and perturbed using Gaussian noises of different amplitudes and spreads, the effect of kernel size on noise removal using the Median filter is tested systematically. It is shown that there exists an optimal kernel size at which the Median filter works best. The size of the optimal kernel is shown to be related to the vortex size. When applied to MRI generated cardiac flow-fields, the approach is seen to reveal underlying vortex patterns thereby aiding as an effective tool in the diagnosis and prognosis of cardiac diseases based on vortices as clinical biomarkers. The behavior of the restored cardiac flow fields which are filtered with the optimal kernel size and also with some values preceding and succeeding it are similar to that observed in studies with synthetic flow fields. This confirms that the optimal size of the kernel is related to the cardiac vortex size as is observed in the case of synthetic flow fields., (© 2023. The Author(s).)

In this paper, with motivation from the No Free Lunch theorem, a new human-based metaheuristic algorithm named Preschool Education Optimization Algorithm (PEOA) is introduced for solving optimization problems. Human activities in the preschool education process are the fundamental inspiration in the design of PEOA. Hence, PEOA is mathematically modeled in three phases: (i) the gradual growth of the preschool teacher's educational influence, (ii) individual knowledge development guided by the teacher, and (iii) individual increase of knowledge and self-awareness. The PEOA's performance in optimization is evaluated using fifty-two standard benchmark functions encompassing unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, as well as the CEC 2017 test suite. The optimization results show that PEOA has a high ability in exploration-exploitation and can balance them during the search process. To provide a comprehensive analysis, the performance of PEOA is compared against ten well-known metaheuristic algorithms. The simulation results show that the proposed PEOA approach performs better than competing algorithms by providing effective solutions for the benchmark functions and overall ranking as the first-best optimizer. Presenting a statistical analysis of the Wilcoxon signed-rank test shows that PEOA has significant statistical superiority in competition with compared algorithms. Furthermore, the implementation of PEOA in solving twenty-two optimization problems from the CEC 2011 test suite and four engineering design problems illustrates its efficacy in real-world optimization applications., (© 2023. The Author(s).)

For the existing control center layout methods do not have targeted measures to implement human factors requirements, this paper puts forward a specific human factors design method for metro control center layout. This method covers the overall process of ergonomic standards and actual engineering requirements in personal space determination, overall location design, and personnel post layout. It introduces discrete personnel simulation to assist in physical control center layout design for the controllers' safety. To make the posts between the unified lines and the connections between the lines more reasonable, an improved genetic algorithm is used to solve the Systematic Layout Planning. This design flow and algorithm can be quickly adapted according to the project's actual needs and the application of human factors guidelines. This method is also suitable for the layout planning and design of similar large spaces, large numbers of people, and complex associated control centers., (© 2023. The Author(s).)

The Mini-Mental State Examination (MMSE) is a widely employed screening tool for the severity of cognitive impairment. Among the MMSE items, the pentagon copying test (PCT) requires participants to accurately replicate a sample of two interlocking pentagons. While the PCT is traditionally scored on a binary scale, there have been limited developments of granular scoring scale to assess task performance. In this paper, we present a novel three-stage algorithm, called Quantification of Interlocking Pentagons (QIP) which quantifies PCT performance by computing the areas of individual pentagons and their intersection areas, and a balance ratio between the areas of the two individual pentagons. The three stages of the QIP algorithm include: (1) detection of line segments, (2) unraveling of the interlocking pentagons, and (3) quantification of areas. A set of 497 PCTs from 84 participants including their baseline and follow-up PCTs from the Rush Memory and Aging Project was selected blinded about their cognitive and clinical status. Analysis of the quantified data revealed a significant inverse relationship between age and balance ratio (beta = − 0.49, p = 0.0033), indicating that older age was associated with a smaller balance ratio. In addition, balance ratio was associated with perceptual speed (r = 0.71, p = 0.0135), vascular risk factors (beta = − 3.96, p = 0.0269), and medical conditions (beta = − 2.78, p = 0.0389). The QIP algorithm can serve as a useful tool for enhancing the scoring of performance in the PCT. [ABSTRACT FROM AUTHOR]

High precision is a very important index in target tracking. In order to improve the prediction accuracy of target tracking, an optimized Kalman filter approach based on improved Gray Wolf algorithm (IGWO-OKF) is proposed in this paper. Since the convergence speed of traditional Gray Wolf algorithm is slow, meanwhile, the number of gray wolves and the choice of the maximum number of iterations has a great influence on the algorithm, a nonlinear control parameter combination adjustment strategy is proposed. An improved Grey Wolf Optimization algorithm (IGWO) is formed by determining the best combination of adjustment parameters through the fastest iteration speed of the algorithm. The improved Grey Wolf Optimization algorithm (IGWO) is formed, and the process noise covariance matrix and observation noise covariance matrix in Kalman filter are optimized by IGWO. The proposed approach is applied into. The experiment results show that the proposed IGWO-OKF approach has low error, high accuracy and good prediction effect. [ABSTRACT FROM AUTHOR]

This paper presents a fusion algorithm based on the enhanced RRT* TEB algorithm. The enhanced RRT* algorithm is utilized for generating an optimal global path. Firstly, proposing an adaptive sampling function and extending node bias to accelerate global path generation and mitigate local optimality. Secondly, eliminating path redundancy to minimize path length. Thirdly, imposing constraints on the turning angle of the path to enhance path smoothness. Conducting kinematic modeling of the mobile robot and optimizing the TEB algorithm to align the trajectory with the mobile robot's kinematics. The integration of these two algorithms culminates in the development of a fusion algorithm. Simulation and experimental results demonstrate that, in contrast to the traditional RRT* algorithm, the enhanced RRT* algorithm achieves a 5.8% reduction in path length and a 62.5% decrease in the number of turning points. Utilizing the fusion algorithm for path planning, the mobile robot generates a superior, seamlessly smooth global path, adept at circumventing obstacles. Furthermore, the local trajectory meticulously conforms to the kinematic constraints of the mobile robot. [ABSTRACT FROM AUTHOR]

There are a series of challenges in microgrid transactions, and blockchain technology holds the promise of addressing these challenges. However, with the increasing number of users in microgrid transactions, existing blockchain systems may struggle to meet the growing demands for transactions. Therefore, this paper proposes an efficient and secure blockchain consensus algorithm designed to meet the demands of large-scale microgrid electricity transactions. The algorithm begins by utilizing a Spectral clustering algorithm to partition the blockchain network into different lower-level consensus set based on the transaction characteristics of nodes. Subsequently, a dual-layer consensus process is employed to enhance the efficiency of consensus. Additionally, we have designed a secure consensus set leader election strategy to promptly identify leaders with excellent performance. Finally, we have introduced an authentication method that combines zero-knowledge proofs and key sharing to further mitigate the risk of malicious nodes participating in the consensus. Theoretical analysis indicates that our proposed consensus algorithm, incorporating multiple layers of security measures, effectively withstands blockchain attacks such as denial of service. Simulation experiment results demonstrate that our algorithm outperforms similar blockchain algorithms significantly in terms of communication overhead, consensus latency, and throughput. [ABSTRACT FROM AUTHOR]

During the manufacturing process of printed circuit boards (PCBs), quality defects can occur, which can affect the performance and reliability of PCBs. Existing deep learning-based PCB defect detection methods are difficult to simultaneously achieve the goals of high detection accuracy, fast detection speed, and small number of parameters. Therefore, this paper proposes a PCB defect detection algorithm based on CDI-YOLO. Firstly, the coordinate attention mechanism (CA) is introduced to improve the backbone and neck network of YOLOv7-tiny, enhance the feature extraction capability of the model, and thus improve the accuracy of model detection. Secondly, DSConv is used to replace part of the common convolution in YOLOv7-tiny to achieve lower computing costs and faster detection speed. Finally, Inner-CIoU is used as the bounding box regression loss function of CDI-YOLO to speed up the bounding box regression process. The experimental results show that the method achieves 98.3% mAP on the PCB defect dataset, the detection speed is 128 frames per second (FPS), the parameters is 5.8 M, and the giga floating-point operations per second (GFLOPs) is 12.6 G. Compared with the existing methods, the comprehensive performance of this method has advantages. [ABSTRACT FROM AUTHOR]

The paper proposes a nonlinear controller called dual super-twisting sliding mode command (DSTSMC) for controlling and regulating the rotor side converter (RSC) of multi-rotor wind power systems that use doubly-fed induction generators. It was proposed that this controller be developed as an alternative to the direct power control (DPC), which makes use of a pulse width modulation (PWM) strategy to regulate the RSC's functioning. Overcoming the power/current quality issue with the proposed technique (DPC-DSTSMC-PWM) is characterized by great robustness and excellent performance. The designed strategy was contrasted with the standard method of control and other methods already in use. So, the unique proposed control strategy's robustness, performance, efficiency, and efficacy in enhancing system characteristics were tested and validated in Matlab/Simulink. In both tests, the proposed method resulted in significant improvements, reducing active power ripples by 83.33%, 57.14%, and 48.57% in the proposed tests. When compared with the traditional regulation method, the reduction rates of reactive power ripples are 64.06%, 52.47%, and 68.7% in the tests. However, in contrast to the conventional method, the proposed tests showed a decrease of between 72.46%, 50%, and 76.22% in the value of total harmonic distortion (THD) of the provided currents. These ratios show how effective the proposed plan is in ameliorating and enhancing aspects of the energy system. [ABSTRACT FROM AUTHOR]

In this paper, a Cluster-based Synthetic minority oversampling technique (SMOTE) Both-sampling (CSBBoost) ensemble algorithm is proposed for classifying imbalanced data. In this algorithm, a combination of over-sampling, under-sampling, and different ensemble algorithms, including Extreme Gradient Boosting (XGBoost), random forest, and bagging, is employed in order to achieve a balanced dataset and address the issues including redundancy of data after over-sampling, information loss in under-sampling, and random sample selection for sampling and sample generation. The performance of the proposed algorithm is evaluated and compared to different state-of-the-art competing algorithms based on 20 benchmark imbalanced datasets in terms of the harmonic mean of precision and recall (F1) and area under the receiver operating characteristics curve (AUC) measures. Based on the results, the proposed CSBBoost algorithm performs significantly better than the competing algorithms. In addition, a real-world dataset is used to demonstrate the applicability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Current link prediction strategies are about finding new probable strong relations to establish or weak ones to remove. An interesting strategy is utilizing link prediction to prioritize the edges in the network and finding newly probable established relations. In this paper we will introduce and explain RLP, reverse link prediction, as a new paradigm, and use popular basic scoring methods including CN, JC, AA, RA, and PA, as its core to examine. The test cases are nine datasets. Half of them are contact networks in different levels from personal contact to aviation, and another half is for covering different test situations. After reviewing the edge removal based epidemic mitigation methods, we show that RLP can be used to decrease the epidemics spreading speed as a general method with various link prediction algorithms, and here in this paper, preferential attachment (PA) has the best results overall. But the results heavily depend on the nature of the examined networks: regular, scale-free or small-world. We also propose an easy to understand criteria, path count, for comparing the efficacy of epidemics mitigation methods. RLP can be extended to use other link prediction scoring methods in various types of graphs as well. [ABSTRACT FROM AUTHOR]

Emergencies often occur irregularly, such as infectious diseases, earthquakes, wars, floods, the diffusion and leakage of chemically toxic and harmful substances, etc. These emergencies can bring huge disasters to people, even worse, the time left for people to make critical decisions is usually very limited. When an emergency occurs, the most important thing for people is to make reasonable decisions as soon as possible to deal with the current problems, otherwise, the situation may deteriorate further. The paper proposes an emergency decision-making algorithm under the constraints of the limited time and incomplete information, the research is mainly carried out from the following aspects, firstly, we use the data structure of the hesitant fuzzy probabilistic linguistic set to collect the basic data after careful comparison, which has three advantages, (1) considering the hesitation in the decision-making process, each evaluation information is allowed to contain multiple values instead of just one value; (2) each evaluation value is followed by a probability value, which further describes the details of the evaluation information; (3) the data structure allows some probability information to be unknown, which effectively expands the application scope of the algorithm. Secondly, the maximization gap model is proposed to calculate unknown parameters, the model can distinguish alternatives with small differences. Thirdly, all the evaluation information will be aggregated by the dynamic hesitant probability fuzzy weighted arithmetic operator. Subsequently, an instance is given to illustrate the effectiveness and the accuracy of the algorithm proposed in the paper. Finally, the advantages of the proposed algorithm are further demonstrated by comparing it with other outstanding algorithms. The main contribution of the paper is that we propose the maximization gap model to obtain the unknown parameters, which can effectively and accurately distinguish alternatives with small differences. [ABSTRACT FROM AUTHOR]

Virtual fitting can bring fast and convenient fitting experience for people. The two core problems of virtual fitting system are human–computer interaction and clothing simulation. Interaction is an important factor in determining the fitting experience. The previous virtual fitting products usually use the mouse and keyboard interaction, and users rarely have a good sense of substitution and interaction. While, the method of using multiple cameras to take user images from different angles and then carry out posture recognition has the defect of low recognition accuracy. In view of clothing simulation and human–computer interaction of virtual fitting system, in order to achieve better customer immersion experience, this paper implemented a real-time interactive virtual fitting system based on Microsoft Kinect motion sensing device, and proposed a gesture determination algorithm based on finger recognition and an image transfer algorithm based on skeleton information matching. Using OpenNI development library and multi-threading technology, we have developed a motion-sensing capture module and a complete real-time virtual fitting system, and the system test results show that it has a good user experience. [ABSTRACT FROM AUTHOR]

Based on the problem of insufficient accuracy of the original tiny YOLOv3 algorithm for object detection in a lawn environment, an Optimized tiny YOLOv3 algorithm with less computation and higher accuracy is proposed. Three reasons affect the accuracy of the original tiny YOLOv3 algorithm for detecting objects in a lawn environment. First, the backbone of the original algorithm is composed of a stack of a single convolutional layer and a max-pooling layer, which results in insufficient ability to extract feature information of objects. An enhancement module is proposed to enhance the feature extraction capability of the shallow layers of the network. Second, the information of the shallow convolutional layers of the backbone is not fully used, which results in insufficient detection capability for small objects. Third, the deep part of the backbone uses a convolutional layer with an excessive number of channels, which results in a large amount of computation. A multi-resolution fusion module is proposed to enhance the information interaction capability of the deep and shallow layers of the network, and reduce the computation. To verify the accuracy of this Optimized tiny YOLOv3 algorithm, the algorithm was tested on the dataset containing trunk, spherical tree and person, and compared with the current research. The results show that the algorithm proposed in this paper improves the detection accuracy while reducing the calculation. [ABSTRACT FROM AUTHOR]

In recent times, there is an increasing interest in employing technology to process natural language with the aim of providing information that can benefit society. Language identification refers to the process of detecting which speech a speaker appears to be using. This paper presents an audio-based Ethio-semitic language identification system using Recurrent Neural Network. Identifying the features that can accurately differentiate between various languages is a difficult task because of the very high similarity between characters of each language. Recurrent Neural Network (RNN) was used in this paper in relation to the Mel-frequency cepstral coefficients (MFCCs) features to bring out the key features which helps provide good results. The primary goal of this research is to find the best model for the identification of Ethio-semitic languages such as Amharic, Geez, Guragigna, and Tigrigna. The models were tested using an 8-h collection of audio recording. Experiments were carried out using our unique dataset with an extended version of RNN, Long Short Term Memory (LSTM) and Bidirectional Long Short Term Memory (BLSTM), for 5 and 10 s, respectively. According to the results, Bidirectional Long Short Term Memory (BLSTM) with a 5 s delay outperformed Long Short Term Memory (LSTM). The BLSTM model achieved average results of 98.1, 92.9, and 89.9% for training, validation, and testing accuracy, respectively. As a result, we can infer that the best performing method for the selected Ethio-Semitic language dataset was the BLSTM algorithm with MFCCs feature running for 5 s., (© 2023. The Author(s).)