Search

Traditional federated learning faces challenges such as high communication costs, structural heterogeneity,and insufficient privacy protection. To address these issues, this paper proposes a federated learning evolutionary algorithm that applies sparse evolutionary training algorithm to reduce communication costs and integrates local differential privacy protection for participants’ privacy. Additionally, it utilizes the NSGA-Ⅲ algorithm to optimize the network structure and sparsity of the global federated learning model, adjusting the relationship between data availability and privacy protection. This achieves a balance between the effectiveness, communication costs, and privacy of the global federated learning model. Experimental results under unstable communication environments demonstrate that, on the MNIST and CIFAR-10 datasets, compared to the solution with the lowest error rate using the FNSGA-Ⅲ algorithm, the proposed algorithm improves communication efficiency by 57. 19% and 52. 17%, respectively. The participants also achieved（3. 46, 10-4） and（6. 52, 10-4）-local differential privacy. This algorithm can effectively reduce communication costs and protect participant privacy without significantly compromising the accuracy of the global model. [ABSTRACT FROM AUTHOR]

In view of the problems of data sparsity and the diversity in academic paper recom-mender systems,based on CONVNCF, this paper proposed an algorithm of convolution with word and heterogeneous information network for academic paper recommendation ( WN -APR) . Firstly, WN -APR algorithm learned user and paper' s diverse features from different semantics to alleviate the sparsity problem. Then it designed an outer product fusing way to seamlessly combine user features with paper features. Replacing of 2D CNN, this algorithm applied 3 D convolution to mine the influence of different features on the performance. Finally, it modified the BPR loss function to enhance diversity in recommendations. Experimental results on CiteULike-a and CiteULike-t datasets show that WN-APR improves the performance of accuracy and diversity over the baseline models. [ABSTRACT FROM AUTHOR]

To improve the accuracy of defect detection in bank note sorting and decrease the effects of cracks and scratches of bank note on detecting, a new algorithm based on wavelet decomposition is proposed, in which affine transform and wavelet transform are applied to bank note image registration and the edge information is extracted by Kirsch operator, while the defect feature is extracted from edge intensity differential. The bank note image is divided into several fixed size subzones, in each of which the defect feature is calculated to judge the degree of contamination. The experimental results reveal that the proposed feature extraction method is robust to the gray intensity change in each subbone, and obtains high recognition rate and high stability. This method has already been used in practical bank note sorting system. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to solve the problems of the current art circulation information is not transparent and the centralized trading authority is asymmetric, this paper proposed a art blockchain certificate traceability model based on three chains. First, in view of the large amount of data in a single piece of artwork information, this paper proposed a blockchain-based symmetric searchable encryption algorithm, and used the interplanetary file system to securely store artwork circulation records on-chain and off-chain. Secondly, for the characteristics of the increasing effective data of artwork information, this paper proposed a blockchain-based inverted fast query and traceability algorithm to help data users realize fast traceability and positioning. At the same time, this paper proposed for the first time that the false information alliance chain stores false art circulation records to realize the processing of false information. Finally, experiments verify the feasibility of the model for big data security storage and fast query traceability. Experiments show that the model is feasible and the query method is efficient. [ABSTRACT FROM AUTHOR]

In view of the problem of fuzziness of rating and tag in traditional collaborative filtering algorithms,this paper used trapezoidal fuzzy number to describe the mapping relationship between rating and satisfaction.The algorithm considered the impact of sparseness of the rating,constructed a new trapezoidal fuzzy rating model to determine the similarity based on fuzzy rating,analyzed the degree of membership between the tag and the item,and constructed a fuzzy item-tag matrix to measure the similarity based on the degree of tag membership.Finally,it used the improved scoring prediction strategy to estimate the score.The experimental results on the MovieLens dataset show that the proposed algorithm improves the prediction accuracy while suppressing the cold start of the project,alleviating the problems of fuzziness and sparseness,which indicates the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

To solve the problem of identifying similar questions in examination database, an algorithm for question similarity identification is proposed in this paper. By introducing domain words to the improvement of the word similarity model in HowNet, a model for question similarity identification is proposed to make the same or similar questions be identified and cut off automatically. This method improves the accuracy of identification compared with other methods. By combining merits of the random selection with those of the backtracking method, a new algorithm of generating papers automatically based on question similarity identification is proposed. It can guarantee the quality of papers. Test results show that the accuracy of question similarity identification of this method is 96% , which approaches to that of manual identification. This method can cut off similar questions not only of the same type, but also of different types. Finally, this method has been applied to the on-line examination of C programming language. [ABSTRACT FROM AUTHOR]

This paper proposed an electronic voting scheme based on one-time ring signature and blockchain to solve the problems of the current e-voting system in terms of anonymity, transparency and open vote-counting. This paper introduced one-time ring signature, blockchain and stealth address technology. The one-time ring signature technology solved the problem of voter anonymity, repeated voting and public verification. The blockchain technology could ensure the openness and transparency of the e-voting system. The one-time ring signature technology could ensure no one or institution could obtain the voting intermediate result before the voting ends. In order to improve the efficiency of vote-counting,it used the method of key sharing to improve the vote-counting algorithm. Through security and performance analysis, the scheme conforms to the basic security standards of an electronic voting system. [ABSTRACT FROM AUTHOR]

The digital trunking system has the characteristics that the calling mode is mainly group calling and the communication mode is mostly half duplex. For the problem that the traditional user classification method couldn't meet the classification requirements of digital cluster users, this paper proposed a digital cluster user classification method based on improved RFM model. Firstly, it introduced the average speech duration attribute to establish the recency vitality speak (RVS) model. Then, it used the analytic hierarchy process to determine the weight of each parameter in the model. Finally, it used the K-means + + clustering algorithm to classify digital cluster users. The simulation result shows that, by using the user classification method proposed in this paper, the accuracy of digital cluster user classification can reach more than 87. 9% . [ABSTRACT FROM AUTHOR]

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

For the security problem of the spread of digital image and the digital image encryption from plaintext and too depend on the chaotic systems, this paper proposed a digital image encryption and monitoring algorithm combined with plaintext-related chaotic mapping and SHA-256. The algorithm used the SHA-256 algorithm to calculate the hash value as record to monitor the spread of digital image. Lorenz chaotic mapping generated the corresponding cryptogram by using forward diffusion, associated plaintext scrambling and backward diffusion to encrypt the digital image. The results show that the algorithm can resist many attacks and achieve the security and concealment of image propagation. [ABSTRACT FROM AUTHOR]

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Forest Engineering is the property of Forest Engineering Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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

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

The existing NAS methods can not directly show the relationship between network models and candidate modules and the accuracy of model recognition. At the same time, many NAS methods have poor scalability and cannot extend their search strategies to arbitrary search space. In response to the above challenges, this paper proposes a visual module contribution neural architecture search method. In this paper, the concept of module contribution is first proposed, and the unified sampling principle in arbitrary search space is given by analyzing the dilemma of the contribution calculation process. Finally, the neural network architecture is generated through a dynamic network programming algorithm for specific constraints. Extensive experimental results demonstrate the effectiveness of the proposed algorithm. Using the CIFAR-10, CIFAR-100, and ImageNet16-120 datasets, the average accuracy on the NAS- Bench- 201 benchmark is 93.33%, 71.07%, and 42.69%, respectively. [ABSTRACT FROM AUTHOR]

The simple and efficient network structure of U-Net is widely used in medical image segmentation, and many scholars have made various researches on the U-Net structure. This paper elucidates in the following: firstly, the paper summarizes the key challenges of the U-Net network in the field of medical image segmentation; next, it elaborates the formats and characteristics of medical image datasets that are commonly used in the U-Net network; then, it summarizes the six improvement mechanism of U-Net: skip connection mechanism, generative adversarial network, residual connection mechanism, 3D-UNet, Transformer mechanism, and dense connecting mechanism. Finally, the paper discusses the relationship between these improvement mechanisms and commonly used medical data formats, and points out the ideas and directions for future improvement, so as to stimulate the unlimited potential of U-Net in medical image segmentation. [ABSTRACT FROM AUTHOR]

It is very important for autonomous driving vehicles to accurately detect objects such as vehicles and pedestrians on the road in real time. Aiming at the problems of missed detection and poor detection effect of small targets in the autonomous driving scene, this paper proposes an automatic driving target detection algorithm that improves the YOLOv7 algorithm. Firstly, it modifies the modules in the network to expand the receptive field, reduces the size of the receptive field module, and improves the speed of the model and enhances the ability to extract image feature information. Secondly, the paper introduces the BRA attention mechanism at the output of the backbone network to improve the model's ability to small target objects. Finally, it replaces the original CIOU loss function of the algorithm with the EIOU loss function to minimize the difference between the height and width of the predicted frame and the real frame, and speeds up the convergence of the model while achieving better positioning results. The experimental results show that: on the KITTI dataset, when the improved YOLOv7 algorithm performs target detection, its mAP reaches 94.7%, which is 3.1 percentage points higher than the original YOLOv7 algorithm, and it has achieved higher detection accuracy in small target object detection. It effectively improves the model's detection effect on small targets. [ABSTRACT FROM AUTHOR]

Copyright of Automotive Engineer (1674-6546) is the property of Auto Engineering Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper investigates a fast and efficient dynamic channel access method for distributed channel access scenarios with strong jamming and limited channel resources to achieve effective anti-jamming communication performance. The proposed problem is constructed as a correlated equilibrium (CE)-based game model with jamming signals designed as coordination signals. To effectively raise the convergence performance under different jamming patterns, the event counters (ECs) are designed, where the coordination signal is improved according to the characteristics of the jamming signal. Next, a distributed cooperative anti-jamming approach is constructed based on coordinated learning, which effectively accelerates the generation of CE points. Based on the above approach, this paper designs a distributed channel access anti-jamming algorithm based on coordination signal optimization, and the simulation results show that the proposed approach can effectively achieve cooperative anti-jamming and channel access. Compared with the existing work, the proposed approach can achieve better communication performance and fairness in the face of sweep jamming. In the face of random jamming, it can achieve faster and better communication performance without losing fairness. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the positioning accuracy of traditional SLAM algorithm decreases due to the influence of dynamic feature points in dynamic environment, this paper proposed SF-VINS which fused semantic information. Firstly, it incorporated the PP-LiteSeg semantic segmentation network into the front-end of system based on the VINS-Mono algorithm and removed the dynamic feature points according to the results of semantic segmentation. Then, it constructed the semantic probability error constraint with the pixel semantic probabilities and employed adaptive weights for feature points in the backend. Based on these modifications, this paper proposed a new BA cost function and an optimization strategy for camera extrinsic parameters to improve the accuracy of state estimation. Finally, this paper conducted experiments on the VIODE and NTU VIRAL datasets to validate its effectiveness. The experimental results show that the proposed algorithm has advantages in terms of positioning accuracy and robustness in both dynamic and static scenes compared with state-of-the-art visual-inertial SLAM algorithms. [ABSTRACT FROM AUTHOR]

Existing cost allocation methods for adaptive video steganography mainly focus on specific transform coefficients, resulting in lower capacity. Moreover, distortion drift is a significant challenge for steganography in HEVC videos. Therefore, this paper proposed a cost allocation method that combined the intra-frame and inter-frame processes of HEVC video coding to achieve high-capacity, low-distortion transmission in high-performance adaptive video steganography. Firstly, the method investigated the discrete sine transform features in HEVC video coding, analyzing the error propagation patterns of these coefficients under disturbance. During the embedding processed, it conducted a detailed analysis on the intra-block distortion, interblock distortion, and inter-frame distortion caused by modifying transform coefficients. The algorithm also took into account the differentiation in inter-block distortion resulting from steganography in different blocks, leading to the classification of blocks. This paper maximized the utilization of all non-zero transform coefficients, allocating distinct distortion costs for various carrier coefficients. The covert information was then embedded into frames that minimally impacted video quality. Experimental results indicate that, compared to existing HEVC video coefficient domain steganography methods, the proposed algorithm demonstrates advantages in terms of video bitrate, video quality, and embedding capacity. [ABSTRACT FROM AUTHOR]

Most of the existing MAPF methods based on communication learning have poor scalability or aggregate too much redundant information, resulting in inefficient communication. To solve these problems, this paper proposed disruptor identifiable communication (DIC), which learned concise communication excluding non-disruptors by judging whether the agent in the center of the field of view would change its decision-making due to the presence of neighbors, and successfully filtered out redundant information. At the same time, this paper further instantiated DIC and developed a new highly scalable distributed MAPF solver: disruptor identifiable communication based on reinforcement and imitation learning algorithm (DICRIA). Firstly, the disruptor discriminator and the policy output layer of DICRIA identified the disruptor. Secondly, the algorithm updated the information of the disruptor and the communication wish sender in two rounds of communication respectively. Finally, DICRIA output the final policy according to the coding results of each module. Experimental results show that DICRIA S performance is better than other similar solvers in almost all environment settings, and the algorithm increases the success rate by 5.2% on average compared to the baseline solver. Especially in dense problem instances with large-size maps, the algorithm even increases the success rate of DICRIA by 44.5% compared to the baseline solver. [ABSTRACT FROM AUTHOR]

Maintaining population diversity and improving algorithm search efficiency are two major problems that need to be solved urgently in the multimodal multi-objective optimization. To address the above problems, this paper proposed a multimodal multi-objective brain storm optimization algorithm based on zoning search and reinforcement learning (MMBSO-ZSRL). In the MMBSO-ZSRL, the decision space was first decomposed into multiple subspaces to reduce the search difficulty and maintain the population diversity. Subsequently, the proposed algorithm used SARSA algorithm to balance the global exploration and local exploitation capabilities of the brain storm optimization algorithm. Additionally, the MMBSO-ZSRL utilized the special crowding distance to select individuals for guiding the population evolution. To verify the performance of the proposed algorithm, this paper selected six advanced multimodal multi-objective optimization algorithms and the IEEE CEC2019 multimodal multi-objective problem benchmark test suite for experiments. Experimental results demonstrate that the overall performance of the MMBSO-ZSRL is significantly better than that of compared algorithms. The proposed MMBSO-ZSRL can not only find the Pareto front with better diversity and approximation, but also find more Pareto optimal solutions in the decision space. [ABSTRACT FROM AUTHOR]

To solve the flexible job shop dynamic scheduling problem with fuzzy quality control time, which is more realistic, this paper established two rescheduling models for machine breakdown and urgent order insertion with the objective of minimizing completion time. Two models were for three failure scenarios: emergency order insertion, machine failure during no-load operation, and machine failure during work-piece processing. To solve this model, this paper designed a novel genetic-neighborhood search algorithm that integrated cellular-automata-based neighborhood search and random restart hill-climbing. Aiming at the characteristics of dual sub-decisions involving order sequencing and machine selection, this paper designed a two-layer coding scheme including process code and machine code, and designed corresponding genetic operations such as crossover and mutation for them. After that, this paper applied the genetic operations into the framework of cellular-automata-based neighborhood search to enhance the algorithm's global search capability, and integrated the random restart hill-climbing algorithm based on key operations to improve the algorithms local development capability. Experiments tested 10 flexible job shop scheduling instances and one flexible job shop scheduling instance with fuzzy quality control time to verify the effectiveness of the proposed algorithm and models. In addition, the test results under different failure scenarios show the proposed method outperforms the backward-based scheduling strategy used in practice. [ABSTRACT FROM AUTHOR]

In order to improve the delivery efficiency of logistics, this paper proposed a vehicle routing problem with drone and time window considered by the time window, UAV (unmanned aerial vehicle) power change and multi-point continuous delivery of UAV. Then, this paper proposed a hybrid particle swarm optimization algorithm with local search to solve it. Based on the hybrid particle swarm optimization algorithm, the proposed algorithm transformed the problem solution space into the algorithm search space by constructing an efficient encoding and decoding strategy. Further, the proposed algorithm combined a single point insertion strategy, a vehicle replacement strategy and a UAV replacement strategy to form a local search strategy to improve the optimization ability. The experimental results show that the proposed model is more efficient than the model of pure vehicle distribution and saves 31.51% of the cost. The proposed algorithm is better than the four comparison algorithms, and its highest optimization rate is 82.08%. [ABSTRACT FROM AUTHOR]

In order to address the limitations of the neighborhood rough set model caused by neighborhood parameters and inadequate sample information representation, this paper proposed a rough set model based on the maximum coalition theory. By normalizing the neighborhood information system and utilizing the maximum coalition set to describe neighborhood granular information, the proposed model enabled finer information division and significant reduction of uncertainty in the boundary region. Combining the model with three-way clustering, this paper designed a three-way clustering algorithm based on maximum coalition rough set. Comparative experiments on six UCI public data sets show that the proposed algorithm has better clustering quality than the comparison algorithms, and has higher comparison accuracy when dealing with boundary region samples. [ABSTRACT FROM AUTHOR]

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

Copyright of Big Data Research (2096-0271) is the property of Beijing Xintong Media Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Shanghai Jiao Tong University (1006-2467) is the property of Journal of Shanghai Jiao Tong University Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In view of the existing traffic signal detection algorithms, which require a large amount of computation and model, are difficult to deploy at the embedded end, and are difficult to detect long-distance traffic signals with a high miss rate, this paper designs a lightweight traffic signal detection algorithm for the embedded end, which aims at lightweight and real-time requirements. GhostNet network Ghost module and Ghost bottleneck layer structure are adopted to reduce the number of model parameters and improve the detection speed. To solve the feature similarity problem, the weighted bidirectional feature pyramid network is used to make the algorithm more sensitive to the target. The dense void space pyramid pool is used to optimize the extraction of global context information. Aiming at the problem of small target recognition, the information extraction of small target is enhanced through the improvement of multi-scale detection. Finally, the learning ability of the model is improved through knowledge distillation, and the detection performance is improved. Experimental results show that the recognition accuracy and recall rate of traffic lights by this detection algorithm reach 97.0% and 99% respectively, 2.7 and 3 percentage points higher than that of YOLOv5s. The model size is reduced to 8.06 MB, 58% of that of YOLOv5s, and the recognition rate is increased from 51 frames per second to 56 frames per second. Through testing in the embedded terminal, the improved algorithm can recognize the traffic signal in real time and accurately. [ABSTRACT FROM AUTHOR]

Symmetric non-negative matrix factorization (NMF) can naturally capture the embedded clustering structure in the graph representation. It is an important method for linear and nonlinear data clustering applications. However, it is sensitive to the initialization of variables, and the quality of the initialization matrix greatly affects the clustering performance. In semi-supervised clustering, it faces the challenge of learning a more discriminative representation from limited labeled data. This paper introduces a constrained propagation self-adaptive self-supervised non-negative matrix factorization clustering algorithm (CPS³NMF) to solve the above problems. The algorithm propagates finite constraints to unconstrained data points, constructing a similarity matrix imbued with constraint information. The resultant similarity matrix serves the role of a non-negative symmetric matrix decomposition in SNMF and functions as graph regularization for the assignment matrix, fully utilizing the limited constraint information to preserve the geometrical structure of data space. Concurrently, leveraging the sensitivity of initial features in SNMF, the algorithm employs adaptively learned weights to rank the quality of multiple initial matrices. By integrating results from multiple clustering attempts, it progressively enhances the performance of semi-supervised clustering. Experiments on 6 public datasets show that the proposed CPS³NMF algorithm outperforms other state-of-the-art algorithms, proving its effectiveness in semi-supervised clustering. [ABSTRACT FROM AUTHOR]

In order to improve the spatial resolution of brain magnetic resonance imaging (MRI) images, the super resolution (SR) reconstruction method based on deep convolutional neural network (CNN) has achieved remarkable results. Increasing network depth or width usually can expand the receptive field of the network to improve the quality of reconstruction, but it is difficult to train the network due to the large parameter quantity and huge computing requirements. Meanwhile, the network does not pay enough attention to the medium and high frequency features of the image, which affects the quality of reconstruction. To solve the above problems, this paper proposes a cascaded channels-space attention and encode-decode network for 3D-MRI image SR reconstruction. Firstly, feature extraction is carried out in the low resolution space, and the image features are extracted by the symmetric connected encoder-decoder with dilated convolution to alleviate the checkerboard artifacts. Secondly, a serial connected channel-space attention module is constructed to capture the interdependence between the feature channels by channel attention, and the spatial attention is increased to assign weight to information of different positions, effectively enhancing the network' s learning of medium and high frequency information. Finally, subpixel convolution is used to sample the feature map to the target image size and meanwhile reduce memory consumption. Experimental results on public Kirby21 and BraTS datasets show that the proposed method is superior in both quantitative peak signal-to-noise ratio (PSNR), structural similarity (SSIM) and subjective visual quality when compared with traditional SR algorithms and mainstream CNN-based SR algorithms. [ABSTRACT FROM AUTHOR]

Copyright of Automotive Engineer (1674-6546) is the property of Auto Engineering Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aiming at the problems of the practical Byzantine fault-tolerant algorithm (PBFT), such as insufficient system dynamics, low consensus efficiency and poor system robustness caused by the random selection of master nodes, a consensus algorithm of CRPBFT based on consistent hash and random selection is proposed. Firstly, the nodes are grouped by consistent hash, and the dynamic change mechanism of nodes is added to provide a dynamic network structure for the system. Secondly, the reputation value of the node is dynamically calculated according to the performance of the node in the consensus. At the same time, this paper defines three node reputation levels, namely, the candidate list of primary nodes, common nodes and malicious nodes. The primary node that is reliable and whose identity is difficult to be maliciously predicted, is selected through the verifiable random function, and the nodes that satisfied the reputation value requirements are selected to form a relatively stable consensus cluster. Experimental results show that CRPBFT algorithm is more reliable than consensus node cluster in PBFT algorithm, and its performance in consensus delay, throughput and system robustness is better than PBFT algorithm. [ABSTRACT FROM AUTHOR]

The crack image on the rail surface has a small target, many background interference information and a high resolution, making its target detection effect not ideal. In this regard, the paper proposes an improved target detection algorithm of YOLOV5s to improve the detection effect of rail cracks. The VOV-GSCSP module is introduced in the neck network, and the ordinary convolution is replaced by the lighter convolution method GSconv to reduce the computational effort of the network while retaining more detailed information. The feature pyramid structure is improved and a multipath cross-layer fusion structure is proposed to incorporate the information of the backbone network across layers in the process of feature pyramid downsampling to retain more original feature information and improve the accuracy of target detection. Meanwhile, the CA attention module and Transformer structure are introduced to further enhance the information extraction of higher-order semantics. The experimental results show that the improved YOLOV5s algorithm achieves an average mean accuracy (mAP) of 62.4%, which is 6.2 percentage points better than the original YOLOV5s algorithm; the recall rate (Recall) is 92.2%, which is 4.4 percentage points better. [ABSTRACT FROM AUTHOR]

The density peaks clustering (DPC) algorithm has several issues such as difficulties in accurately finding cluster centers of manifold data, and easily produce the joint errors in the allocation of residual samples. To address these issues, this paper proposes a density peaks clustering algorithm based on shared neighbor degree and probability assignment (SP-DPC). Firstly, using K-nearest neighbor and shared K-nearest neighbor, the shared neighbor degree between sample points is defined, and the local density of sample points is redefined using this information to identify the correct cluster centers. Next, the transfer probability assignment strategy and the evidence probability assignment strategy are proposed to optimize the allocation of the residual sample together based on their K-nearest neighbors, thus avoiding the joint allocation errors. Finally, SP-DPC algorithm is compared to DPC, SKM-DPC, DPC-NN, DBSCAN, and K-means algorithms using 17 synthetic datasets and 12 UCI datasets. The experimental results show that the SP-DPC algorithm achieves relative optimal values in the three evaluation indexes of AMI, ARI and FMI as a whole and outperforms other algorithms in terms of clustering efficiency. [ABSTRACT FROM AUTHOR]

Spatial Modulation(SM) and Orthogonal Frequency Division Multiplexing(OFDM) Multi-Mode Index Modulation (MM-OFDM-IM) techniques have significant advantages in Energy Efficiency(EE) and Spectral Efficiency(SE), respectively. The combination of multi-dimensional index modulation technology can apply multiple physical resources to meet the high demand for data transmission and system capacity in wireless communication systems. Therefore, SM and MM-OFDM-IM systems can be flexibly combined to construct an OFDM Multiple Mode Space Frequency Composite Index Modulation (MM-OFDM-SFCIM) based on space frequency combination. This system can retain the silent subcarriers in traditional subcarrier index modulation technique, expanding new composite coefficient dimensions and improving its SE and EE. Aiming at the complex characteristics of this system, this paper proposes a joint detection algorithm EL-REML (REML based on symbolic Energy and LLR) based on symbolic energy and log-likelihood. The simulation results show that the MM-OFDM-SFCIM system achieves about 30% improvement in SE compared to traditional space-frequency combination systems, and the EL-REML algorithm proposed in this system achieves a 3-4 dB improvement in BER (Bit Error Rate) compared to the LLR algorithm. Compared with traditional ML algorithm, this algorithm has lower computational complexity. [ABSTRACT FROM AUTHOR]

Articulation disorder, as a medical difficulty, currently mainstream speech recognition technologies are not well adapted to the needs of this field. At the same time, speech recognition technology for dysarthria utilizes a combination of pre training and personalized training to further improve algorithm performance and reduce recognition word error rate through data-driven methods. However, currently, speech recognition technology for dysarthria still has a certain distance from practical commercial use, and its development is limited by data scale and technology. So far, there have been no comprehensive articles on speech recognition for dysarthria. It is urgent to compare and analyze the construction methods and advanced technologies of various datasets in this field, in order to facilitate researchers entering the field to quickly acquire knowledge in this field. This paper conducts a survey on existing datasets, mainstream algorithms, and evaluation methods, and summarizes the scale, form, and characteristics of mainstream speech impairment datasets at home and abroad. It analyzes the mainstream algorithms for speech recognition with dysarthria, and provides the performance and characteristics of different algorithms. Finally, the performance evaluation indicators of the algorithm model based on the severity level of patients with dysarthria are studied, and future research directions are discussed, in order to provide help for the researchers engaged in speech recognition with dysarthria and assist in the rapid development of this field. [ABSTRACT FROM AUTHOR]

Recommendation of point of interest (POI) is one of the most popular topics in location-based social network (LBSN). The existing recommendation methods do not fully consider the deep influence of the spatial and temporal intervals between sequences of check-in data on the recommended sequences. They ignore the global information in the checkin data and focus on the local preferences in the recent check-in sequence of a single user. To address these problems, this paper proposes a global feature fusion based spatiotemporal network (GSTN) interest point recommendation algorithm. The method uses graph neural networks to obtain global features of the heterogeneous network graph of check- in data, and incorporates spatiotemporal gating into the traditional gating structure, fuses global features to model users'mobile behavior, and then introduces a self-attentive mechanism to learn user preference vector representation. Finally, the experiments are carried out on two real datasets. The experiments show that the proposesd approach outperforms similar algorithms in terms of recommendation performance and verifies the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]