Search

The amount of available scientific literature is increasing, and studies have proposed various methods for evaluating document-document similarity in order to cluster or classify documents for science mapping and knowledge discovery. In this paper, we propose hybrid methods for bibliographic coupling (BC) and linear evaluation of text or content similarity: We combined BC with BM25, Cosine, and PMRA to compare their performances with single methods in paper recommendation tasks using TREC Genomics Track 2005datasets. For paper recommendation, BC and text-based methods complement each other, and hybrid methods were better than single methods. The combinations of BC with BM25 and BC with Cosine performed better than BC with PMRA. The performances were best when the weights of BM25, Cosine, and PMRA were 0.025, 0.2, and 0.2, respectively, in hybrid methods. For paper recommendation, the combinations of BC with text-based methods were better than BC or text-based methods used alone. The choice of method should depend on the actual data and research needs. In the future, the underlying reasons for the differences in performance and the specific part or type of information they complement in text clustering or recommendation need to be examined.

The significance of big data are prone to complication in solving optimization issues. In several scenarios, one requires adapting several contradictory goals and satisfies various criterions. This made the research on multi-objective optimization more vital and has become main topic. This paper presents theoretical analysis and comparative study of top ten optimization algorithms with respect to DMS. The performance analysis and study of optimization algorithms in big data streaming are explicated. Here, the top ten algorithms of optimization based on recency and popularity are considered. In addition, the performance analysis based on Efficiency, Reliability, Quality of solution, and superiority of DMS algorithm over other top 10 algorithms are examined. From analysis, the DMS provides better efficiency as it endeavours less computational effort to generate better solution, due to acquisition of both DA and MS algorithm's benefits and DMS takes less time to process a task. Moreover, the DMS needs less number of iterations in the process of optimization and helps to stop optimization process in local optimum. In addition, the DMS has better reliability as it poses the potential to handle specific level of performance. In addition, the DMS utilizes heuristic information for attaining high reliability. Moreover, the DMS produced high computation accuracy, which reveals its solution quality. From the analysis, it is noted that DMS attained improved outcomes in terms of efficiency, reliability and solution quality in contrast to other top 10 optimization algorithms. [ABSTRACT FROM AUTHOR]

This paper presents an in-depth study and analysis of oil painting classification and simulation using an improved embedded learning fusion vision perception algorithm. This paper analyzes and models the image quality evaluation problem by simulating the human visual system and extracting quality perception features as the main entry point to improve the prediction accuracy of the overall algorithm. This paper proposes a multi-classification method of CCNN, which uses the similarity measure based on information first to achieve multi-classification of artwork styles and artists, and this part is the main part of this paper. This paper uses the wiki art repository to construct a dataset of oil paintings, including over 2000 works by 20 artists in 13 styles. CNN achieves an accuracy of 85.75% on the artist classification task, which is far more effective than traditional deep learning networks such as Resnet. Finally, we use the network model of this paper and other network models to train the classification of 3, 4, and 6 categories of art images. The accuracy of art image classification by this paper's algorithm is higher than that of the current mainstream convolutional neural network models, and the extracted features are more comprehensive and more accurate than traditional art image feature extraction methods, which do not rely on researchers to extract image features. Experiments show that the proposed method can achieve excellent prediction accuracy for both synthetic distorted images and distorted images. [ABSTRACT FROM AUTHOR]

To solve the problem of inaccurate user phase identification, the paper proposes a new algorithm based on improved cloud model and adaptive segmented voltage algorithm. Firstly, the new algorithm uses improved cloud model to calculate the digital features of station area and users' voltage sequences quickly. Secondly, the paper uses the adaptive segmentation voltage algorithm to divide the full voltage sequences into three parts automatically to add local features into phase identification. Finally, the paper calculates cosine similarity between each segmented voltage cloud model to identify users' voltage phase. The analysis based on station data and field verification shows that the new algorithm has not only improved the calculation efficiency by 41% compared with traditional user phase identification algorithm, but also increased the difference in identification results between different phases by 1000 times. In the final result, the accuracy of the new algorithm is 95%. The new algorithm has more obvious differentiation and higher accuracy. The analysis results based on the actual engineering data also prove the feasibility and effectiveness of the new user phase identification algorithm. [ABSTRACT FROM AUTHOR]

This paper focuses on the influence maximization problem in social networks, which aims to find some influence nodes that maximize the spread of information. Most existing achievements usually adopt a uniform propagation probability, without considering the topic information. Moreover, the classic Independent Cascade Model and its approximations have suffered from much running time. To overcome this limitation, this paper proposed a Topic based Shortest Path Set algorithm (TSPS). Additionally, a comprehensive set of experiments are conducted on large real-world networks, showing that our proposal provides more impressive results in the aspects of influence spread and running time. [ABSTRACT FROM AUTHOR]

In this paper we introduce a new ranking algorithm, called Collaborative Judgement (CJ), that takes into account peer opinions of agents and/or humans on objects (e.g. products, exams, papers) as well as peer judgements over those opinions. The combination of these two types of information has not been studied in previous work in order to produce object rankings. Here we apply Collaborative Judgement to the use case of scientific paper assessment and we validate it over simulated data. The results show that the rankings produced by our algorithm improve current scientific paper ranking practice, which is based on averages of opinions weighted by their reviewers' self-assessments. [ABSTRACT FROM AUTHOR]

In this paper, we proposed classification and clustering algorithms that are proper for analyzing customer-related datasets, which are mostly high-dimensional with too many instances. For the clustering purpose, This paper presents a Cuckoo-Search-based Variable Weighting (CSVW) Clustering algorithm to obtain optimal variable weights of high-dimensional data for each cluster. This paper also proposes a deep Inferarer Classifier for categorizing customers using Bi-Directional Long Short-Term Memory (Bi-LSTM) neural network, which uses a Fuzzy Inferential Classifier on its last layer. The Insurance Company (TIC) and InstaCart datasets are utilized for the experiments and performance evaluation. Simulation results reveal that the proposed clustering algorithm generates appropriate Silhouette and Elbow criteria scores in a few cycles of execution in comparison to ordinal clustering algorithms. Also, the proposed classification algorithm with fuzzy soft-max classifier hits the better Classification Criteria in comparison. [ABSTRACT FROM AUTHOR]

To solve the problems of high storage resource consumption and low efficiency of the RRT exploration algorithm in the late stage of exploration, this paper proposes an Improved Artificial Fish Swarm based Optimize Rapidly-exploring Random Trees multi-robot Exploration Algorithm. Firstly, the efficiency of a single robot's exploration of nearby unknown regions is improved by dynamically adjusting the step size of the RRT tree.Secondly, the improved artificial fish swarm algorithm is used to delete the redundant nodes in the RRT tree and optimize the node state in the RRT tree, which reduces the occupation of memory resources and improves the exploration efficiency of the RRT tree in the narrow environment.Results from comparative experiments in simulation environments with different degrees of openness show that the optimized exploration algorithm can save significant storage resources and show better exploration performance in narrow environments compared to the original RRT exploration algorithm. [ABSTRACT FROM AUTHOR]

The key step in the intelligence of tongue diagnosis is the segmentation of the tongue image, and the accuracy of the segmented edges has a significant impact on the subsequent medical judgment. Deep learning can predict the class of pixel points to achieve pixel-level segmentation of images, so it can be used to handle tongue segmentation tasks. However, different models have different segmentation effects, and they did not learn the connection between space and channels, resulting in inaccurate tongue segmentation. This paper first discussed the choice of model and loss function and then compared the results of different options to find the better model. Associating the red feature of the tongue is very conducive to segmentation as a feature, this paper tested many methods to try to get the color features of the original image to be paid attention to. Finally, this paper proposed an improved Encoder-Decoder network model to solve the problem based on the results. Start with Resnet as the backbone network, then introduce the U-Net model, and then we fused the attention layer, obtained from the source image through convolution and CBAM attention mechanism, and the feature layer obtained from the last upsampling in U-Net. Experimental results show that: The new, improved algorithm results are 2-3 percentage points higher than the popular algorithm, making it more suitable for tongue segmentation tasks. [ABSTRACT FROM AUTHOR]

In this paper, a new timing synchronization algorithm for the main synchronous signal (PSS) is proposed for the risk identification of cross-border e-commerce in the Internet of things, aiming at the problems of poor performance of anti frequency bias and high computational complexity of the improved PSS timing synchronization algorithm. Based on the piecewise correlation algorithm, the normalized frequency deviation of PSS sequence is preset. The segmented ones are pre stored at the terminal by using the conjugate symmetry of PSS sequence. The fast correlation of each segment correlation window is realized by combining convolution and overlapping reservation block method. Then, the threshold judgment is made after the time delay accumulation of the correlation values of the segments is made, so as to complete the joint detection of timing synchronization and coarse frequency deviation. The simulation results show that the algorithm can improve the performance of the system anti frequency offset effectively, reduce the complexity of the calculation and show that the timing synchronization conditions of the Internet can be satisfied. At the same time, under the background of the current development of cross-border logistics, this paper reviews the current research status of Transnational E-commerce logistics and Transnational E-commerce logistics risk. By comparing the advantages and disadvantages of various risk assessment methods, neural network and genetic algorithm are selected as the basic risk assessment methods in this paper. Based on the improved PSS timing synchronization algorithm and the Internet of things, the risk indicators of e-commerce logistics transnational will be selected from five risk dimensions: platform risk, customs clearance risk, organizational risk, process risk and environmental risk. Through the comprehensive literature and expert's opinion, the logistics risk assessment index system of cross-border e-commerce is established. [ABSTRACT FROM AUTHOR]

Identifying protected health identifiers (PHIs) in free text is core to anonymising clinical notes for research. There is no standard metric for the quality of a PHI detection algorithm, resulting in papers reporting heterogeneous results. CensorCheck is presented, which computes specialised metrics for evaluating PHI detection taking into account the peculiarities of anonymisation tasks.

This paper presents a comprehensive workflow for integrating revolving events into the transitive sequential pattern mining (tSPM+) algorithm and Machine Learning for Health Outcomes (MLHO) framework, emphasizing best practices and pitfalls in its application. We emphasize feature engineering and visualization techniques, demonstrating their efficacy in capturing temporal relationships. Applied to an EGFR lung cancer cohort, our approach showcases reliable temporal insights even in a small dataset. This work highlights the importance of temporal nuances in healthcare data analysis, paving the way for improved disease understanding and patient care.

The DR.BEAT project aims to develop an accelerometer-based, wearable sensor system for measuring ballistocardiographic (BCG) signals, coupled with signal processing and visualization, to support cardiac health monitoring. A rule-based heartbeat detection was developed to enable the derivation of health parameters independent of an existing reference. This paper outlines the algorithm's methodology and provides an initial evaluation of its performance based on seismocardiographic (SCG) measurements obtained from an initial study involving twelve heart-healthy adults. On average, 87.6% of the heartbeats over all measurements, 97.6% of the heartbeats at rest and 71.9% of the heartbeats during physical stress could be detected.

Causal inference seeks to learn the effect of interventions on outcomes. Its potential in the health domain has been dramatically increasing recently, due to advancements in machine learning, as well as in the growing amount of medical data collected. Gaia-X provides a framework to implement Health Data Spaces at scale, in a compliant, secure, and trustable manner. In this paper, we provide a modular online service for causal inference using observational data, building on the Gaia-X framework. While two versions of the IDA algorithm for causal inference are already provided, the service allows users to further contribute algorithms in various programming languages (not only for causal inference), as well as their data, and efficiently execute these on a central server. Additionally, the platform facilitates the exchange of algorithms and data among participants. Users of the platform can enter into agreements with other users over the use of algorithms and data. Calculations can be carried out directly on the platform without the need to locally store foreign data.

The complexity of the cancer problem domain presents challenges not only to the medical analysis systems tasked with its analysis, but also to the users of such systems. While it is desirable to assist users in operating these medical analysis systems, prior groundwork is required before this can be achieved, such as recognising patterns in the way users create certain analyses within these systems. In this paper, we use machine learning algorithms to analyse user behaviour patterns and attempt to predict the next user interaction within the CARESS medical analysis system. Since an appropriate pre-processing scheme is essential for the performance of these algorithms, we propose the usage of a Natural Language Processing (NLP)- inspired approach to preserve some semantic cohesion of the mostly categorical features of these user interactions. Furthermore, we propose to use a sliding window that contains information about the latest user interactions in combination with Latent Dirichlet Allocation (LDA) to extract a latent topic from these last interactions and use it as additional input to the machine learning models. We compare this pre-processing scheme with other approaches that utilise one-hot encoding and feature hashing. The results of our experiments show that the sliding window LDA scheme is a promising solution, that performs better for our use case than the other evaluated pre-processing schemes. Overall, our results provide an important piece for further research and development in the area of assisting users in operating analysis systems in complex problem domains.

Due to the dynamic nature of work conditions in the manufacturing plant, it is difficult to obtain accurate information on process processing time and energy consumption, affecting the implementation of scheduling solutions. The fuzzy flexible job shop scheduling problem with uncertain production parameters has not yet been well studied. In this paper, a scheduling optimization model with the objectives of maximum completion time, production cost and delivery satisfaction loss is developed using fuzzy triangular numbers to characterize the time parameters, and an improved quantum particle swarm algorithm is proposed to solve it. The innovations of this paper lie in designing a neighborhood search strategy based on machine code variation for deep search; using cross-maintaining the diversity of elite individuals, and combining it with a simulated annealing strategy for local search. Based on giving full play to the global search capability of the quantum particle swarm algorithm, the comprehensive search capability of the algorithm is enhanced by improving the average optimal position of particles. In addition, a gray target decision model is introduced to make the optimal decision on the scheduling scheme by comprehensively considering the fuzzy production cost. Finally, simulation experiments are conducted for test and engineering cases and compared with various advanced algorithms. The experimental results show that the proposed algorithm significantly outperforms the compared ones regarding convergence speed and precision in optimal-searching. The method provides a more reliable solution to the problem and has some application value. [ABSTRACT FROM AUTHOR]

The advent of the information age has made accurate search for information a challenge. In this paper, we analyze intelligent recommendations for innovative entrepreneurial projects based on collaborative filtering algorithms. Collaborative filtering is one of the most widely used and successful techniques in recommendation systems. In this paper, an interest migration function plus time is introduced to address the shortcomings of traditional collaborative filtering recommendation algorithms. Meanwhile, this paper builds an intelligent recommendation engine system for innovative entrepreneurial projects based on the Hadoop open-source distributed computing framework, sustainable PSCM, and Mahout collaborative filtering recommendation engine technology. This paper uses experiments to test and evaluate the overall performance of the distributed recommendation platform and the improved collaborative filtering recommendation algorithm. It is found that the algorithm outperforms similar algorithms in terms of data volume and coverage of recommended innovation and entrepreneurship projects. This is sufficient to show that the collaborative filtering algorithm and sustainable PSCM are useful for the intelligent recommendation analysis of innovative entrepreneurial projects. [ABSTRACT FROM AUTHOR]

Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining the HC (Hill Climbing) algorithm and PSO (Particle Swarm Optimization) algorithm, which firstly uses HC algorithm to search for locally optimal network structures, takes these networks as the initial networks, then introduces mutation operator and crossover operator, and uses PSO algorithm for global search. Meanwhile, we use the DE (Differential Evolution) strategy to select the mutation operator and crossover operator. Finally, experiments are conducted in four different datasets to calculate BIC (Bayesian Information Criterion) and HD (Hamming Distance), and comparative analysis is made with other algorithms, the structure shows that the HC-PSO algorithm is superior in feasibility and accuracy. [ABSTRACT FROM AUTHOR]

Frequent gradual pattern extraction is an important problem in computer science widely studied by the data mining community. Such a pattern reflects a co-variation between attributes of a database. The applications of the extraction of the gradual patterns concern several fields, in particular, biology, finances, health and metrology. The algorithms for extracting these patterns are greedy in terms of memory and computational resources. This clearly poses the problem of improving their performance. This paper proposes a new approach for the extraction of gradual and frequent patterns based on the reduction of candidate generation and processing costs by exploiting frequent itemsets whose size is a power of two to generate all candidates. The analysis of the complexity, in terms of CPU time and memory usage, and the experiments show that the obtained algorithm outperforms the previous ones and confirms the interest of the proposed approach. It is sometimes at least 5 times faster than previous algorithms and requires at most half the memory. [ABSTRACT FROM AUTHOR]

Among the indoor localization algorithms, the algorithm based on traditional Back Propagation Neural Network (BPNN) has the problems of slow convergence and easy to fall into local optimum. It is difficult to apply the algorithm in noisy environments. Therefore, in this paper, we propose a novel indoor localization algorithm where the whole localization process is divided into two parts: data preprocessing and localization output. Data preprocessing means using filtering algorithm to process the Received Signal Strength Indication (RSSI) sequence. It is considered that the initial value of the received sequence has a significant impact on the performance of Kalman Filter (KF). An improved Kalman Filtering algorithm (DBSCAN-KF) is proposed based on the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. First, the RSSI values that are seriously disturbed by noise in the sequence are removed using the DBSCAN algorithm, and then the RSSI sequences are processed using KF so that the RSSI values can be closer to the theoretical values. The localization output part is to reduce the localization error caused by the BPNN. In this paper, the Differential Evolution (DE) algorithm and Particle Swarm Optimization (PSO) algorithm are combined, and the Differential Evolution Particle Swarm Optimization (DE-PSO) algorithm is proposed. The BPNN weights and thresholds are optimized in parallel, which improves the speed and ability of global optimization search and further avoids the shortcomings of traditional BPNNs that are prone to fall into local optimization in the training process. Experimental results show that the BPNN localization algorithm based on DBSCAN-KF improves the average localization accuracy by 0.26m compared with the BPNN localization algorithm without filtering. After filtering, the localization algorithm based on DE-PSO improved BPNN (DE-PSO-BP) improves the average localization accuracy by about 24% compared with the localization algorithm based on DE-PSO-BP. The localization algorithm based on DE-PSO-BP improves the average localization accuracy by about 61% compared with the traditional BPNN. [ABSTRACT FROM AUTHOR]

Influence maximization is a classic network optimization problem, which has been widely used in the field of viral marketing. The influence maximization problem aims to find a fixed number of active nodes. After a specific propagation model, the number of active nodes reaches the maximum. However, the existing influence maximization algorithms are overly pursuing certain indicators of efficiency or accuracy, which cannot be well accepted by some researchers. This paper proposes an effective algorithm to balance the accuracy and efficiency of the influence maximization problem called local two-hop search algorithm (LTHS). The core of the proposed algorithm is a node not only be affected by one-hop neighbor nodes, but also by two-hop neighbor nodes. Firstly, this paper selects initial seed nodes according to the characteristics of the node degree. Generally, the high degree of nodes regards as influential nodes. Secondly, this paper proposes a node two-hop influence evaluate function called two-hop diffusion value (THDV), which can evaluate node influence more accurately. Furthermore, in order to seek higher efficiency, this paper proposes a method to reduce the network scale. This paper conducted full experiments on five real-world social network datasets, and compared with other four well-known algorithms. The experimental results show that the LTHS algorithm is better than the comparison algorithms in terms of efficiency and accuracy. [ABSTRACT FROM AUTHOR]

In process discovery, the goal is to find, for a given event log, the model describing the underlying process. While process models can be represented in a variety of ways, Petri nets form a theoretically well-explored description language and are therefore often used. In this paper, we extend the eST-Miner process discovery algorithm. The eST-Miner computes a set of Petri net places which are considered to be fitting with respect to a certain fraction of the behavior described by the given event log as indicated by a given noise threshold. It evaluates all possible candidate places using token-based replay. The set of replayable traces is determined for each place in isolation, i.e., these sets do not need to be consistent. This allows the algorithm to abstract from infrequent behavioral patterns occurring only in some traces. However, when combining places into a Petri net by connecting them to the corresponding uniquely labeled transitions, the resulting net can replay exactly those traces from the event log that are allowed by the combination of all inserted places. Thus, inserting places one-by-one without considering their combined effect may result in deadlocks and low fitness of the Petri net. In this paper, we explore adaptions of the eST-Miner, that aim to select a subset of places such that the resulting Petri net guarantees a definable minimal fitness while maintaining high precision with respect to the input event log. Furthermore, current place evaluation techniques tend to block the execution of infrequent activity labels. Thus, a refined place fitness metric is introduced and thoroughly investigated. In our experiments we use real and artificial event logs to evaluate and compare the impact of the various place selection strategies and place fitness evaluation metrics on the returned Petri net. [ABSTRACT FROM AUTHOR]

With the acceleration of urbanization, the frequency of building fire incidents has been increasing year by year. Therefore, rapid, efficient, and safe evacuation from buildings has become an urgent and important task. A construction fire escape path planning method based on an improved NavMesh algorithm is proposed in this paper. Firstly, by using the method of local updates in the navigation grid, redundant computation is reduced, and the update time of the improved algorithm is about 6.8% of that of the original algorithm, immediate generation of navigation is achieved. Secondly, the heuristic function of the pathfinding algorithm is improved, and a multi-exit path planning mechanism is proposed to achieve more efficient, which can quickly plan a safe evacuation path away from the spreading fire and smoke in the event of a fire. Finally, a new evaluation index called Navigation Grid Complexity (NGC) is proposed and demonstrated to measure the quality of navigation grids. The feasibility and effectiveness of the proposed method are validated through simulation experiments on actual building models, which can provide real-time, efficient, intelligent, and safe path planning for rapid evacuation of evacuees in the fire scene. [ABSTRACT FROM AUTHOR]

Crowd counting aims to estimate the number, density, and distribution of crowds in an image. The current mainstream approach, based on CNN, has been highly successful. However, CNN is not without its flaws. Its limited receptive field hampers the modeling of global contextual information, and it struggles to effectively handle scale variation and background complexity. In this paper, we propose a Multi-scale Hybrid Attention Network called MHANet to solve crowd counting challenges more effectively. To address the issue of scale variation, we have developed a Multi-scale Aware Module (MAM) that incorporates multiple sets of dilated convolutions with varying dilation rates. The MAM significantly improves the network's ability to extract information at multiple scales. To tackle the problem of background complexity, we have introduced a Hybrid Attention Module (HAM) that combines spatial attention and channel attention. The HAM effectively directs attention to the crowd region while suppressing background interference, resulting in more accurate counting. MHANet has been extensively experimented on four benchmark datasets and compared against state-of-the-art algorithms. It consistently achieves superior performance in terms of the MAE evaluation metric. MHANet outperforms the current state-of-the-art methods by margins of 1.9%, 5.4%, 0.4%, and 0.8% on the ShanghaiTech Part_A, ShanghaiTech Part_B, UCF-QNRF, and UCF_CC_50 datasets, respectively. Furthermore, a series of ablation experiments targeting MAM and HAM were conducted in this paper, and the experimental results fully demonstrate that MAM and HAM can effectively address the challenges of scale variation and background complexity, ultimately enhancing the accuracy and robustness of the network. [ABSTRACT FROM AUTHOR]

The quality of sleep plays a crucial role in physical well-being, and individuals are becoming increasingly concerned about sleep quality and its associated health issues. Although various sleep monitoring devices exist, there remains a need for a highly accurate sleep state identification algorithm. To address this, we present a paper that utilizes machine learning techniques to identify human sleep states based on electroencephalogram (EEG) signals collected by an EEG instrument. We propose a model that incorporates two nonlinear characteristic parameters, MSE and PSE, extracted from artificially designed EEG signals as input. Additionally, we employ a Support Vector Machine (SVM) classifier algorithm to accurately identify sleep states, eliminating uncertainties associated with manually designed feature parameters. Experimental results demonstrate the superior accuracy of our proposed model for sleep state analysis, offering valuable insights for improving sleep quality and addressing related health concerns. [ABSTRACT FROM AUTHOR]

Designers refer to existing product cases and innovate products to develop new products. However, when designers screen product cases, there is no user participation, which leads to the lack of user-side knowledge and emotional drive that is very important for design. Therefore, it is necessary to play the role of user emotional knowledge in promoting the whole design process. This paper proposes the concept of the positive perceptual sample, which applies the knowledge emotion integration of designers and users to the screening sample case stage at the beginning of the design process. This study is based on the lack of user-side knowledge and emotional drive of reference cases and integrates user emotion into the reference case screening process. Then, in the emotion measurement process, users' cognitive data in the screening process are obtained through the eye-brain fusion cognitive experiment. Finally, the XGBoost algorithm is used to process feature index data to realize the classification and recognition of cognitive data and applied to the positive perceptual classification of products. The results show that the classification accuracy of physiological cognitive data with user emotional representation by the XGBoost algorithm is 90.87%. The results of cognitive data classification are applied to the screening of positive perceptual samples, and the satisfaction rate is 98.35%. The results show that the method proposed in this paper provides a new source of ideas for obtaining positive perceptual samples and can be applied to new product development. [ABSTRACT FROM AUTHOR]

In the control system of a lithium battery rolling mill, the correction system was crucial. This was because the correction system had a significant impact on the performance of the lithium battery rolling mill, including high precision and efficient rolling quality. However, the non-linearity of the correction system and the uncertainty of the correction system made it a challenging problem to achieve a high precision correction control. The contribution and innovation of this paper was a genetic fuzzy PID control strategy based on Kalman filter, which was proposed and applied to the control of lithium battery rolling mill correction technology. In order to achieve intelligent control of a high-precision electrode rolling mill correction system, an algorithm fusion control scheme was proposed. Firstly, a novel and detailed correction system model was presented. Next, the initial PID parameters of the correction were optimized by means of a genetic algorithm so that the PID parameters could be adapted to the correction control process and then optimized again by adding an extended Kalman filter. Finally, the lithium battery rolling mill correction control system was validated, tested and commissioned in the field. The results showed that the designed algorithm could meet the working requirements of the lithium battery rolling mill and that it improved the accuracy of the correction system. In the actual lithium battery rolling mill production process, the algorithm was compared with a conventional PID. Compared with the common single algorithm, the fusion algorithm proposed in this paper was a complete set of high precision correction control system algorithm to solve the high precision problem faced by the correction system in the actual lithium battery rolling mill correction system. [ABSTRACT FROM AUTHOR]

With the raising popularity of digital devices in the current society, the present image detection system is becoming a great threaten. Especially the appearance of the recaptured images. It can be used in traditional invalid digital image detection algorithm. There is a new algorithm in this paper is presented to detect the recaptured and real image. The algorithm obtains low-frequency images, directional filtering images and high-frequency images by multiple application frequency domain filtering. Then the proposed algorithm analyzes the directional filtering images and high-frequency images by means of LBP algorithm to extract features. At last, the recaptured images were classified by the SVM. The experimental results demonstrated the algorithm in this paper could be effectively identify in the recaptured images. [ABSTRACT FROM AUTHOR]

Decisions based on artificial intelligence can reproduce biases or prejudices present in biased historical data and poorly formulated systems, presenting serious social consequences for underrepresented groups of individuals. This paper presents a systematic literature review of technical, feasible, and practicable solutions to improve fairness in artificial intelligence classified according to different perspectives: fairness metrics, moment of intervention (pre-processing, processing, or post-processing), research area, datasets, and algorithms used in the research. The main contribution of this paper is to establish common ground regarding the techniques to be used to improve fairness in artificial intelligence, defined as the absence of bias or discrimination in the decisions made by artificial intelligence systems. [ABSTRACT FROM AUTHOR]

The TFAHP-FAHP algorithm model constructed in this article can preferably avoid subjective assumptions caused by human factor. The new energy vehicle power battery is a core component for improving the performance of electric vehicles, and constitutes one of the most valuable parts of the invention patent for new energy vehicles. Patent pledge financing is a brand new form with great potential. However, as a result of the imperfect system of the patent pledge financing, banks and other financial institutions are exposed to an increased risk in the process of the patent pledge financing, which seriously limits the development of the patent pledge financing for power battery. In view of the above issues, this paper uses the SPSS reliability and validity tests in order to develop a relatively complete and accurate index system. TFAHP algorithm model and fuzzy comprehensive are combined to determine the final correction coefficient. In this study, the income method is used to determine the pledge valuation value of a new energy vehicle power battery patent portfolio, and the AHP algorithm method is used to determine the weight of the value of the invention patent portfolio within the patent portfolio. As a result, in this paper, the pledge value of the patent portfolio is multiplied by a proportion of the invention patent portfolio's value, and then multiplied by a correction coefficient to obtain the final new energy vehicle power battery invention patent portfolio pledge value. Using this reference value, technology-based energy companies can pledge financing for new energy vehicle power battery invention patent portfolios. [ABSTRACT FROM AUTHOR]

This paper aims to improve the accuracy of software defect prediction by using a prediction model based on grey incidence analysis and Naive Bayes algorithm. The model employs the Naïve Bayes as the basic classifier of the software defect prediction model. The grey incidence analysis is used to analyze the relation between software modules and ideal modules. Then, the grey correlation degree is embedded into the Naive Bayes classification model as a feature attribute. According to the comparison and analysis of NASA's public dataset, the prediction model in this paper improves the prediction accuracy. [ABSTRACT FROM AUTHOR]

Influence maximization (IM) is a problem of selecting k nodes from social networks to make the expected number of the active node maximum. Recently, with the popularity of Internet technology, more and more researchers have paid attention to this problem. However, the existing influence maximization algorithms with high accuracy are usually difficult to be applied to the large-scale social network. To solve this problem the paper proposes a new algorithm, called community-based influence maximization (ComIM). Its core idea is "divide and conquer". In detail, this algorithm first utilizes the Louvain algorithm to divide the large-scale networks into some small-scale networks. Afterwards, the algorithm utilizes the one-hop diffusion value (ODV) and two-hop diffusion value (TDV) functions to calculate the influence of a node and select nodes on these small-scale networks, which can improve the accuracy of our proposed algorithm. By using the above methods, the paper proposes a community influence-estimating method called CDV, which can improve the efficiency of the algorithm. Experimental results on six real-world datasets demonstrate that our proposed algorithm outperforms all comparison algorithms when comprehensively considering the accuracy and efficiency. [ABSTRACT FROM AUTHOR]

As the current society is increasingly facing major challenges from extremism and terrorism, protecting key urban public facilities and important targets from destruction is an important challenge facing the security departments of all countries. Based on real scene, this paper conducts researches on anti-terrorism security game algorithms and emergency response models in response to the three key links of before, during and after terrorist attacks. First of all, this paper constructs a multi-round joint attack game and emergency response model based on cooperation, establishes the optimization problem of solving the defender's optimal strategy in mathematical form, and then obtains the optimal defense strategy. Secondly, in response to the fact that terrorists are not completely rational, a new hybrid model is constructed to propose an efficient allocation and scheduling algorithm for safe resources in response to terrorist attacks. Thirdly, a model of crowd evacuation strategy after a terrorist attack is built based on the problem of crowd evacuation in multiple rounds of premeditated cooperative attacks. Finally, taking the area of the first ring of a certain city as a real scene, a complete game system of the whole process is constructed, and the game effectiveness evaluation of the existing security resource allocation scheme in the first ring area is carried out. Through the research of this thesis, the author puts forward some new technical ideas for the current society's anti-terrorism governance, and hopes to provide some technical references for the decision-making of security agencies. [ABSTRACT FROM AUTHOR]

With the development of the Intelligent Transportation System, various distributed sensors (including GPS, radar, infrared sensors) process massive data and make decisions for emergencies. Federated learning is a new distributed machine learning paradigm, in which system heterogeneity is the difficulty of fairness design. This paper designs a system heterogeneous fair federated learning algorithm (SHFF). SHFF introduces the equipment influence factor I into the optimization target and dynamically adjusts the equipment proportion with other performance. By changing the global fairness parameter θ , the algorithm can control fairness according to the actual needs. Experimental results show that, compared with the popular q-FedAvg algorithm, the SHFF algorithm proposed in this paper improves the average accuracy of the Worst 10% by 26% and reduces the variance by 61%. [ABSTRACT FROM AUTHOR]

Taking Uyghur character recognition as an example, this paper use a method of image segmentation which combines traditional methods with CNN, and transforms and implements the Uyghur character on intelligent devices. Firstly, after analyzing the application of several general segmentation methods, this paper finds some shortcomings but also some ideas for Uighur segmentation. Then, starting from the characteristics of Uyghur language, such as structure, word formation and input habits, the author studies the idea of Uyghur adhesive language segmentation from the perspective of language characteristics, puts forward the basic algorithm of Uyghur symbol segmentation, and applies the Uyghur character adhesion segmentation based on minimum spanning tree and multi-queue primitive merging model to improve the segmentation efficiency. In addition, in order to solve the limitations of the traditional handwriting recognition framework of "preprocessing + feature extraction + classifier", this paper puts forward a new solution of Uyghur handwriting recognition technology combining prior domain knowledge with CNN, constructs a Uyghur handwriting recognition model on the basis of CNN and random elastic deformation, and also improves the recognition rate of the system by combining domain knowledge with CNN. According to the experimental results, we can conclude that the mixed method proposed in this paper can effectively break the technical bottleneck of traditional methods, thus improving the efficiency of segmentation and recognition. [ABSTRACT FROM AUTHOR]

Recent research emphasized the utilization of rechargeable wireless sensor networks (RWSNs) in a variety of cutting-edge fields like drones, unmanned aerial vehicle (UAV), healthcare, and defense. Previous studies have shown mobile data collection and mobile charging should be separately. In our paper, we created an novel algorithm for mobile data collection and mobile charging (MDCMC) that can collect data as well as achieves higher charging efficiency rate based upon reinforcement learning in RWSN. In first phase of algorithm, reinforcement learning technique used to create clusters among sensor nodes, whereas, in second phase of algorithm, mobile van is used to visit cluster heads to collect data along with mobile charging. The path of mobile van is based upon the request received from cluster heads. Lastly, we made the comparison of our proposed new MDCMC algorithm with the well-known existing algorithms RLLO [32] & RL-CRC [33]. Finally, we found that, the proposed algorithm (MDCMC) is effectively better collecting data as well as charging cluster heads. [ABSTRACT FROM AUTHOR]

In view of the defects and shortcomings of the traditional target detection and tracking algorithm in accurately detecting targets and targets in different scenarios, based on the current research status and technical level of target detection and tracking at home and abroad, this paper proposes a target detection algorithm and tracking method using neural network algorithm, and applies it to the athlete training model. Based on the Alex-Net network structure, this paper designs a three-layer convolutional layer and two layers of fully connected layers. The last layer is used as the input of the SVM classifier, and the target classification result is obtained by the SVM classifier. In addition, this article adds SPP-Layer between the convolutional layer and the fully connected layer, enabling the same dimension of the Feature Map to be obtained before the fully connected layer for different sized input images. The research results show that the proposed method has certain recognition effect and can be applied to athlete training. [ABSTRACT FROM AUTHOR]

The purpose of this article is to explore effective image feature extraction algorithms in the context of big data, and to mine their potential information from complex image data. Based on the BRISK and SIFT algorithms, this paper proposes an image feature extraction and matching algorithm based on BRISK corner points. By combining the SIFT scale space and the BRISK algorithm, a new scale space construction method is proposed. The BRISK algorithm extracts the corner invariant features. Then, by using the improved feature matching method and eliminating the mismatching algorithm, the exact matching of the images is realized. A large number of experimental verifications were performed in the standard test Mikolajczyk image database and aerial image database. The experimental results show that the improved algorithm in this paper is an effective image matching algorithm. The highest accuracy of actual aerial image matching can reach 85.19%, and it can realize the actual aerial image matching that BRISK and SIFT algorithms cannot complete. The improved algorithm in this paper has the advantages of higher matching accuracy and strong robustness. [ABSTRACT FROM AUTHOR]

Nowadays, moving object detection in sequence images has become a hot topic in computer vision research, and has a very wide range of practical applications in many fields of military and daily life. In this paper, fast detection of moving objects in complex background is studied, and fast detection methods for moving objects in static and dynamic scenes are proposed respectively. Firstly, based on image preprocessing, aiming at the difficulty of feature extraction of moving targets in low illumination at night, Gamma change is used to process. Secondly, for the fast detection of moving objects in static scenes, this paper designs a detection method combining background difference and edge frame difference. Finally, aiming at the fast detection of moving objects in dynamic scenes, a feature matching detection method based on the SIFT algorithm is designed in this paper. Simulation experiments show that the method designed in this paper has good detection performance. [ABSTRACT FROM AUTHOR]

In server clusters, the static scheduling algorithm has superior performance when the user visits are relatively stable. In the face of sudden increase in user traffic, the dynamic scheduling algorithm has a better load balancing effect than the static scheduling algorithm. However, in the face of complex network environments, the static scheduling algorithm cannot adjust the load according to the performance of the server in real time. The dynamic scheduling algorithm using a single weight to evaluate server performance is unreliable, and load scheduling with reference to the number of connections has uncertainty. In view of this problem, this paper proposes a cluster load balancing algorithm based on dynamic consistent hash based on the study of load balancing based on LVS clusters. By analyzing the performance and load parameters, we divide the request process into in-cycle and out-of-cycle. By setting up the LVS cluster system, the performance weights, load parameters, number of virtual nodes and cycles of the algorithm in this paper are determined experimentally. Finally, the response time and throughput of the algorithm in this paper are compared with the WRR algorithm and WLC algorithm. The results show that the time and throughput of this algorithm are better than WRR algorithm and WLC algorithm. [ABSTRACT FROM AUTHOR]

WCSN is one of the most significant research areas in the terrestrial networking field due to its wide range of applications. One of the most difficult challenges is expanding the overall running time without attaching any new batteries or hardware. Using a novel EDT (Energy, Distance, Time) driven strategy, this paper proposes a clustering algorithm to solve the problems of the hotspot as well as reduce battery energy loss. The CH rotation method was then described in detail. This paper will introduce a new function called SCH (Substitute cluster head), which has replaced CH. The main aim of this research is to improve energy reliability and network lifetime. Finally, the presented EDT approach can be comparable to current algorithms, where MFSTERP's network lifetime is 15.4%, EECHS's is 23.2%, and ABC-DE's is 11.4%, but our proposed EDT methodology extends network lifetime by 40% as well as decreases energy usage by 7% as compared to LEACH when determining the SCH. [ABSTRACT FROM AUTHOR]

Accurate identification of the QRS complex is critical to analyse heart rate variability (HRV), which is linked to various adverse outcomes in premature infants. Reliable and accurate extraction of HRV characteristics at a large scale in the neonatal context remains a challenge. In this paper, we investigate the capabilities of 15 state-of-the-art QRS complex detection implementations using two real-world preterm neonatal datasets. As an attempt to improve the accuracy and reliability, we introduce a weighted ensemble-based method as an alternative. Obtained results indicate the superiority of the proposed method over the state of the art on both datasets with an F1-score of 0.966 (95% CI 0.962-0.97) and 0.893 (95% CI 0.892-0.894). This motivates the deployment of ensemble-based methods for any HRV-based analysis to ensure robust and accurate QRS complex detection.

Background: Thyroid tumor is considered to be a very rare form of cancer. But recent researches and surveys highlight the fact that it is becoming prevalent these days because of various factors., Objectives: This paper proposes a novel hybrid classification system that is able to identify and classify the above said four different types of thyroid tumors using high end artificial intelligence techniques. The input data set is obtained from Digital Database of Thyroid Ultrasound Images through Kaggle repository and augmented for achieving a better classification performance using data warping mechanisms like flipping, rotation, cropping, scaling, and shifting., Methods: The input data after augmentation goes through preprocessing with the help of bilateral filter and is contrast enhanced using dynamic histogram equalization. The ultrasound images are then segmented using SegNet algorithm of convolutional neural network. The features needed for thyroid tumor classification are obtained from two different algorithms called CapsuleNet and EfficientNetB2 and both the features are fused together. This process of feature fusion is carried out to heighten the accuracy of classification., Results: A Multilayer Perceptron Classifier is used for classification and Bonobo optimizer is employed for optimizing the results produced. The classification performance of the proposed model is weighted using metrics like accuracy, sensitivity, specificity, F1-score, and Matthew's correlation coefficient., Conclusion: It can be observed from the results that the proposed multilayer perceptron based thyroid tumor type classification system works in an efficient manner than the existing classifiers like CANFES, Spatial Fuzzy C means, Deep Belief Networks, Thynet and Generative adversarial network and Long Short-Term memory.

Breast cancer is one of the cancers with high morbidity and mortality in the world, which is a serious threat to the health of women. With the development of deep learning, the recognition about computer-aided diagnosis technology is getting higher and higher. And the traditional data feature extraction technology has been gradually replaced by the feature extraction technology based on convolutional neural network which helps to realize the automatic recognition and classification of pathological images. In this paper, a novel method based on deep learning and wavelet transform is proposed to classify the pathological images of breast cancer. Firstly, the image flip technique is used to expand the data set, then the two-level wavelet decomposition and reconfiguration technology is used to sharpen and enhance the pathological images. Secondly, the processed data set is divided into the training set and the test set according to 8:2 and 7:3, and the YOLOv8 network model is selected to perform the eight classification tasks of breast cancer pathological images. Finally, the classification accuracy of the proposed method is compared with the classification accuracy obtained by YOLOv8 for the original BreaKHis dataset, and it is found that the algorithm can improve the classification accuracy of images with different magnifications, which proves the effectiveness of combining two-level wavelet decomposition and reconfiguration with YOLOv8 network model.

Background: The scientific revolution in the treatment of many illnesses has been significantly aided by stem cells. This paper presents an optimal control on a mathematical model of chemotherapy and stem cell therapy for cancer treatment., Objective: To develop effective hybrid techniques that combine the optimal control theory (OCT) with the evolutionary algorithm and multi-objective swarm algorithm. The developed technique is aimed to reduce the number of cancerous cells while utilizing the minimum necessary chemotherapy medications and minimizing toxicity to protect patients' health., Methods: Two hybrid techniques are proposed in this paper. Both techniques combined OCT with the evolutionary algorithm and multi-objective swarm algorithm which included MOEA/D, MOPSO, SPEA II and PESA II. This study evaluates the performance of two hybrid techniques in terms of reducing cancer cells and drug concentrations, as well as computational time consumption., Results: In both techniques, MOEA/D emerges as the most effective algorithm due to its superior capability in minimizing tumour size and cancer drug concentration., Conclusion: This study highlights the importance of integrating OCT and evolutionary algorithms as a robust approach for optimizing cancer chemotherapy treatment.

Background: In recent years, deep reinforcement learning (RL) has been applied to various medical tasks and produced encouraging results., Objective: In this paper, we demonstrate the feasibility of deep RL for denoising simulated deep-silicon photon-counting CT (PCCT) data in both full and interior scan modes. PCCT offers higher spatial and spectral resolution than conventional CT, requiring advanced denoising methods to suppress noise increase., Methods: In this work, we apply a dueling double deep Q network (DDDQN) to denoise PCCT data for maximum contrast-to-noise ratio (CNR) and a multi-agent approach to handle data non-stationarity., Results: Using our method, we obtained significant image quality improvement for single-channel scans and consistent improvement for all three channels of multichannel scans. For the single-channel interior scans, the PSNR (dB) and SSIM increased from 33.4078 and 0.9165 to 37.4167 and 0.9790 respectively. For the multichannel interior scans, the channel-wise PSNR (dB) increased from 31.2348, 30.7114, and 30.4667 to 31.6182, 30.9783, and 30.8427 respectively. Similarly, the SSIM improved from 0.9415, 0.9445, and 0.9336 to 0.9504, 0.9493, and 0.0326 respectively., Conclusions: Our results show that the RL approach improves image quality effectively, efficiently, and consistently across multiple spectral channels and has great potential in clinical applications.

Background: Beamforming is vital for medical ultrasound imaging systems. The generalized sidelobe canceller (GSC) beamforming can improve the image quality of lateral resolution, but its performance improvement in contrast and robustness is limited., Objective: This paper proposes an improved generalized sidelobe canceller algorithm based on multi-apodization with cross-correlation (MAXB-IGSC), which aims to improve the contrast and robustness of ultrasound imaging while maintaining the high image resolution and background speckle quality of GSC., Methods: The proposed MAXB-IGSC uses multiple pairs of complementary received apodization functions to process the echo data individually to obtain multiple pairs of data sets. The average of their normalized cross-correlation coefficients is then calculated and utilized to determine the adaptive subarray length of the GSC covariance matrix and weights the output of the improved GSC., Results: The MAXB-IGSC improves the contrast ratio (CR) by 171.18% in anechoic cyst simulation and by 91.23%/130.97%/171.76% in geabr_0 (a dataset from the University of Michigan) experiment compared with GSC, respectively. Furthermore, MAXB-IGSC exhibits significant noise immunity, which greatly improves the robustness of the imaging. The technology also maintains the brightness and uniformity of the background speckle., Conclusion: The proposed MAXB-IGSC has potential for obtaining high-quality ultrasound images in clinical applications.