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]

This paper proposed a collaborative topic regression model based on the preference for frequent topic sets to address the item-cold-start problem in academic paper recommendation. The algorithm took into account the user' s preference for research hotspots when selected academic papers, and used frequent topic sets to represent research hotspots. So, it expressed user' s preference for research hotspots as the user's preference for frequent topic sets. Firstly, it obtained the papers-topic probability distribution matrix through LDA algorithm and filter out the topics with higher probability. Then, the algorithm mined the frequently-occurring topic sets and gets the relationships between papers and frequent topic sets. Finally, it used the user's preference for frequent topic sets for the prediction of unknown scores. Experiments on CiteULike datasets show that the algorithm improves the recall, accuracy and RMSE over the matrix factorization model and the collaborative topic regression model. [ABSTRACT FROM AUTHOR]

There are many problems in the process of collecting paper data using single data source, such as insufficient data comprehensiveness and limited data collection speed due to website access frequency limitation. Aiming at these problems, this paper proposed a paper data crawling technology for multi-data sources. Firstly, it used the four Chinese document service websites-How Net, Wanfang Data, Weipu, and Chaoxing as data sources, completed the task of crawling and parsing list page data for the search keywords. Then it used the task scheduling strategy to remove repeated data and balance the tasks. Finally, it used multi-threads for each data source to crawl, parse and store the detail information of the papers, and built a website for search and display. Experiments show that under the same crawling and parsing speed, this technology can complete the paper information collection task more comprehensively and efficiently, which proves the effectiveness of this technology. [ABSTRACT FROM AUTHOR]

Considering the unique users of scholars' social networks, this paper proposed a collaborative association model of paper and project data based on scholars' social networks. Firstly, the proposed model used the two-step feature selection method to preprocess the data, removed the irrelevant and redundant features and obtained the effective features that affected the association between the paper and the project. Then it would adopt TVSM to calculate the text similarity between the paper and the project, then formed recommendation sets for different papers/projects. Through the social network (SCHOLAT) data for researchers, the model was implemented and applied to SCHOLAT. The online application situation and user feedback show that the model has good accuracy and practicability. Furthermore, it can more fully explore the potential relationship between the paper and the project, provide users with better academic research management services, and propose a novel research method for analyzing the academic big data. [ABSTRACT FROM AUTHOR]

Aiming at the low efficiency caused by massive academic paper data, this paper proposed a recommendation algorithm method based on the hierarchical mixed model named WSVD ++. According to the structural features of academic papers, the model constructed a weighted bipartite graph model. Firstly, this method extracted the features of each paper and constructed the composite relation graph according to the ratio of different features. Secondly, it used an improved PPR algorithm on the graph to calculate the importance weight of each paper, and then weighed the relation between the user and the paper. Finally, it recommend on the weighted bipartite graph by using SVD + + graph algorithm. The result shows that the proposed algorithm improves the recommended accuracy. The whole process implemented in distributed graph calculation system, that means the method has good expansibility and is suitable for big data processing. [ABSTRACT FROM AUTHOR]

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]

In recent years, the number of papers in scientific social network had grown at an explosive rate. It was difficult for users to find papers related to their requirement. And the paper recommendation is one of the key methods to solve this problem. However, most of the existing methods only focus on rating prediction, ignoring the ranking problem between papers. In addition, a lot of social information in scientific social network were not fully considered in the traditional recommendation method. Therefore, this paper proposed an improved List-wise method for scientific paper recommendation. It systematically analyzed The friendship information between users , the titles , abstracts and tags of scientific papers and incorporated theses information into the improved List-wise method. In order to verify the validity of the proposed method , this paper crawled data from a scientific social network , i. e. , CiteULike , to conduct experiments. Experimental results show that the proposed method gets the best recommendation results and performs well in scalability compared to the other traditional recommendation methods. [ABSTRACT FROM AUTHOR]

Paper folding is a common phenomenon. This paper could be referred to as the shell, and the model was the key for efficient simulation of thin shell. Based on the high cost and more complex of physical modeling and based on the accuracy of deformation was not enough of geometric modeling. Therefore, in order to realize the simulation of paper folding, this paper proposed a paper folding simulation based on physical model and geometric model. First of all, based on the hinge model and the mass spring model of paper thin shell model. Second, updating the position of the particle by the implicit integration method, it determined the initial deformation of the paper,and increased the deformation constraint. Lastly, according to Poisson deformation determining the final deformation state. The experimental results show that the hybrid model has the advantages of high speed and high stability. [ABSTRACT FROM AUTHOR]

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.)

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]

In order to overcome the existing exam management system on the speed and quality of test paper generating links exist defects, the coarse-grained parallel genetic algorithm combined with the adaptive technology, this paper proposed a fast parallel genetic algorithm of adaptive adjustment of population migration. Respectively from the examination of coding scheme, the optimization of genetic strategy, fitness function, crossover mutation operator selection and the selection of fitness value function, etc to carry on the design, had obtained the very good fitness, adopted the tactics of parallel at the same time, improved the running speed of the algorithm. Simulation experiment results show that the algorithm is successfully applied to the automatic group volume, volume and group to improve the efficiency and success rate are obvious, has the very good generality. The algorithm used in the intelligent fast automatic group volume is feasible and effective. [ABSTRACT FROM AUTHOR]

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 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 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 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 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 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.)

In order to solve the problem of multiplexing gain loss in Alamouti space-time block coding, this paper proposed a two-group Alamouti transmission scheme. On this basis, in order to improve the bit error ratio (13ER) with lower computational complexity at the receiver, this paper proposed a two-group Alamouti transmission scheme by combining GMD algorithm and non-linear precoding technique. The design method of the proposed solution consists of three main operations. Firstly, it obtained the effective channel matrix of two-group Alamouti transmission systems. Secondly, it jointly designed the transceiver with the obtained effective channel matrix by exploiting the GMD algorithm. Finally, it mitigated the inter-channel interference by utilizing non-linear precoding techniques of DPC and Tomlinson-Harashima Precoding (THP). The simulation results demonstrate that the proposed scheme is capable of significantly improving the achievable 13ER performance. [ABSTRACT FROM AUTHOR]

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 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 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.)

Screen-space ambient occlusion (AO) is a popular global illumination technique which can be used to achieve a better understanding of complex 3D streamtubes scenes. This paper proposed an anisotropic screen-space AO method to visualize complex 3D streamtubes. The basic idea is to utilize the characteristics of 3D streamtubes to design two anisotropic filters to guide screen-space sampling as well as spatial reusing. More specifically, this paper proposed to anisotropically generate samples perpendicular to the direction of streamtube to calculate AO. This mechanism can reduce the number of samples required to generate satisfactory results. In order to further improve the performance of the algorithm, this paper proposed to anisotropically reuse AO results from nearby pixels along the streamtube direction. The experimental results indicate that the proposed algorithm outperforms the existing solutions both in rendering quality and performance. [ABSTRACT FROM AUTHOR]

Most of the existing content extraction signature schemes publicly verify signatures, but in some cases, they may compromise the signer's privacy. To enhance security and render the signature scheme resistant to quantum attacks, this paper proposed a new interceptable signature scheme based on the ring-SIS problem on the ideal lattice and integrated it with the strong specified verifier signature scheme. The scheme employed the anomaly abort technique of uniform sampling, capable of thwarting side-channel attacks. Additionally, this paper validated the security and correctness of the scheme. Compared to other schemes, this scheme exhibits clear advantages in security, number of repetitions, and signature size. [ABSTRACT FROM AUTHOR]

The mutation-based grey-box protocol fuzzing methods are convenient and highly scalable. However, they lack the message format information of the protocol under test, resulting in most of the messages in test cases being rejected by the target protocol implementation, severely affecting the testing efficiency. To address this issue, this paper proposed a greybox fuzzing method for text protocol based on field perception. This method incorporated the concept of template learning into mutation-based protocol fuzzing. It used delimiters to segment message fields and utilized a field dictionary to obtain valid values for each field. Subsequently, this paper designed multiple field-level mutation strategies for the segmented messages and calculated the corresponding field mutation energy based on the number of valid values and coverage feedback. Moreover, this approach leveraged the results of message field segmentation to provide a more fine-grained characterization of the protocol implementation state. Experimental results demonstrate that this method can improve the proportion of test cases accepted by the target protocol implementation generated by the classic mutation-based protocol fuzzing framework AFLNET, thereby increasing testing efficiency over five times. It proves that the low acceptance rate of test cases in the commonly used mutation-based protocol fuzzing methods decrease the overall testing efficiency, and increasing the test case acceptance rate can improve the testing efficiency significantly. [ABSTRACT FROM AUTHOR]

Complex event processing technology is a streaming data processing technique that detects specific event sequences or performs statistics on matching events in continuously flowing data. When processing trend aggregation queries with Kleene operators, caching intermediate results is necessary to match an indefinite number of event sequences, thus requiring significant resources from the query system. Exploiting opportunities for sharing among multiple queries, generating shared plans to guide query processing can effectively enhance the processing efficiency of trend aggregation queries. However, existing methods for handling aggregate queries do not dynamically adjust the generated shared plans in real-time to support continuous and efficient processing of complex event detection in response to changes in the execution environment. Addressing these issues, this paper proposed a dynamically updatable method for multiple aggregate query sharing to support the continuous and efficient processing of real-time changing complex event detection. By introducing the shared graph data structure and cost model, this method achieved real-time adjustment of the generated shared plans. And by using the online incremental aggregation execution sharing method, it further enhanced the processing efficiency of event trend aggregation queries with Kleene operators. This paper conducted experiments on both real and simulated datasets, compared the method with other approaches for handling aggregate queries. The results of the experiments indicate that the method effectively reduces query latency and improves the overall processing performance of queries. [ABSTRACT FROM AUTHOR]

In the process of researching tree-based in-memory indexes, traditional on-chip prefetching cannot adapt to the locality of index accesses, resulting in memory accesses becoming a performance bottleneck of this type of memory index. This paper proposed a path prefetching scheme at the software level to accelerate memory index accesses by prefetching, and enabled the algorithm to be quickly deployed on real machines. Based on the analysis of the tree-based indexes memory access process, this algorithm used a prefetch table to save the relationship between keys and index access paths, and matched data in the prefetch table through a matching algorithm based on key slice hashing. This paper implemented and evaluated the algorithm on current advanced tree-based memory indexes. The results indicate that it maintains stable performance improvement under different data scale and read-write-mixed workloads. Therefore, the algorithm based on path prefetching can effectively accelerate the memory access speed of tree-based in-memory index and improve index performance. [ABSTRACT FROM AUTHOR]

Emotional blackmail is a way of communication that forces people around them to listen to their requirements by emotional pressure. It can easily lead to negative emotions and even psychological problems of the other side, then affect the communication effect. In order to detect emotional blackmail utterance in daily communication scenarios and improve the communication effect, this paper developed an emotional blackmail utterance detection system based on Chinese text similarity evaluation. Firstly, this paper labelled the collected data based on Susan Forward's emotional blackmail theory, and construeted an emotional blackmail corpus and a test set. Secondly, this paper analyzed the expression modes of emotional blackmail, and designed text similarity evaluation methods based on part of speech and semantic words respectively, then formed an emotional blackmail utterance detection algorithm based on Chinese text similarity evaluation. Thirdly, this paper carried out experiments on the constructed datasets. The average recall and F1-score of the proposed algorithm are 95.21% and 79.95% respectively, which are better than the compared algorithms. Finally, this paper integrated an emotional blackmail utterance detection prototype system based on the proposed algorithm. Under different testing conditions, system test results show that the average recall is 87.24%, which shows good robustness and detection performance. [ABSTRACT FROM AUTHOR]

Aiming at the problem that ABC has strong exploration but weak exploitation, which leads to slow convergence speed, this paper proposed an unlinear population size reduction strategy based on cluster individual rank (UPSR-CIR). Firstly, the strategy designed the long-tail unlinear population size reduction function which maintained a large population to explore fully in the early stage, and reduced the population size rapidly in the middle stage, so as to maintain a small population to strengthen exploitation in the late stage, while allocating relatively more computing resources for the late stage to accelerate convergence. Secondly, to ensure the diversity of the population, it used K-means clustering dynamically to divide the population into clusters every a certain number of generations, and carried out the population size reduction in the unit of cluster. At the same time, when the population size reducing in the unit of cluster, it determined the number of individuals deleted according to the rank of the best individual in the cluster, so as to reserve relatively more computing resources for the potential cluster with higher rank to further strengthen exploitation. This paper used 22 benchmark test functions to compare and analyze the UPSRCIR on ABC and its variants. The results show that the UPSR-CIR exhibits higher solution accuracy, stability and convergence speed. It is also universally applicable to ABC variants. Finally, this paper also used 12 classical TSP cases to validate the practicality and superiority of the UPSR-CIR strategy on real application problem. [ABSTRACT FROM AUTHOR]

Inconsistent data repair is an important research direction in the field of data repair. Most of the existing methods are based on integrity constraint rules and use the principle of minimum cost for repair. However, the repair scheme with the minimum cost is usually incorrect, which leads to the low accuracy rate of the existing repair methods. To address the problem of low accuracy of existing methods, this paper proposed an inconsistent data repair method based on statistical inference BayesOUR, to balance the cost and quality of repair and improve the repair accuracy. It mainly divided BayesOUR into three phases. Firstly, it performed error detection based on the integrity constraint rule, and then utilized Bayesian network to reason about the probability of all the possible consistent repair schemes. Finally, it selected the repair scheme with the largest probability for data repair. Experimental results on real data show that the method in this paper can significantly improve the accuracy of inconsistent data repair compared with the current leading methods. [ABSTRACT FROM AUTHOR]

Current statistical query pricing models have not considered the problem that query results reveal sensitive attributes of datasets, making it difficult to incentivize sharing by compensating data providers accordingly. Therefore, this paper proposed a pricing model based on attribute privacy. Firstly, the model calculated query sensitivity based on the relaxed approximation Wasserstein mechanism (RAWM) proposed, improving efficiency by directly calculate the relaxed upper bound of output distribution pairs. Then, with bounding privacy loss, the model compensated data providers based on query sensitivity, noise variance and compensation parameters. Finally, by using cost-plus pricing on compensation, this paper designed several arbitrage-free pricing functions, which could be used in scenarios such as single compensation costs and multiple marginal costs. The experiment results show that the running time of calculating query sensitivity is reduced from linear complexity to constant complexity, with a utility cost of only 0.52% when data volume is 100 million. The pricing model provides fine-grained compensation to incentivize sharing. Pricing functions satisfy arbitrage freeness. [ABSTRACT FROM AUTHOR]

Random forest is a classic black-box model that is widely used in various fields. The structural characteristics of black-box models lead to weak model interpretability, which can be optimized with the help of interpretable techniques to promote the application and development of random forest in scenarios with high reliability requirements. This paper constructed a rule extraction model based on ensemble pruning and multi-objective evolutionary algorithm. Ensemble pruning is an effective method for solving the problem of extracting rules from tree models that tend to fall into local optima, and multi-objective evolutionary has several applications in balancing rule accuracy and interpretability. This paper found that it improved interpretability without sacrificing accuracy. This study integrated ensemble pruning technique with a multi-objective evolutionary algorithm, which enhances the interpretability of random forests and helps promote the decision-making application of this model in areas with high interpretability requirements. [ABSTRACT FROM AUTHOR]

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 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.)

The current 3D-ConvNet-based action recognition algorithms generally use GAP to compress feature information. However, it leads to issues of information loss, redundancy, and network overfitting. To address these issues and enhance the retention of high-level semantic information extracted by the convolutional layer, this paper proposed an action recognition al- gorithm based on GFDP. Firstly, DCT shows that GAP is a special case of feature decomposition in the frequency domain. Therefore, the algorithm introduced more frequency components to increase the specificity between feature channels and reduce the information redundancy after information compression. Secondly, to better suppress the overfitting problem, the algorithm introduced the batch normalization strategy to the convolutional layer and extended it to the fully connected layer of the action recognition model with ERB-Res3D as the skeleton to optimize the data distribution. Finally, this paper verified the proposed method on the UCF101 dataset. The results reveals that the model's computational load is 3.5 GFlops, with 7.4 million para- meters. The final recognition accuracy improved by 3.9% based on the ERB-Res3D model and 17.4% based on the original Res3D model. This improvement effectively achieves more accurate behavior recognition results. [ABSTRACT FROM AUTHOR]

Existing NL2SQL approaches do not fully utilize the information of data table columns, which plays an important role in the semantic understanding of the problem and the logical generation of SQL statements. This paper proposed an NL2SQL method that fused data table columns (FC-SQL) to improve the overall accuracy of SQL generation. Firstly, this method utilized BERT to merge the problem and database table columns for encoded representations. Secondly, it used multitask learning approach to construct a multi-task network by combining parallel and cascade to predict different sub-tasks. Finally, for the conditional value extraction sub-task, this method computed the similarity between the words in the problem and the table columns by fusing the information of the columns, and it used the similarity value as a weight to compute each word as the conditional value probability of each word as a conditional value, thus improving the accuracy of conditional value prediction. The logical form accuracy and SQL execution accuracy on the TableQA dataset reach 88.23% and 91.65%, respectively. This paper designed ablation experiments to verify the effect of table columns information on the model. The experimental results show that the incorporation of table columns improves the effectiveness of the conditional value extraction sub-task, which in turn improves the overall accuracy of the NL2SQL task and provides better SQL generation compared to the comparison model. [ABSTRACT FROM AUTHOR]

The current methods for short-time precipitation nowcasting are based on radar echo extrapolation model, without fully considering the close influence of other meteorological factors on the evolution of precipitation generation and cancellation, thus limiting the accuracy of the forecasts. To address the above issues, this paper produced a short-time precipitation nowcasting dataset, and proposed the MFPNM(multiple factors precipitation nowcasting model). Based on data from the Fengyun4B satellite, the dataset toke quantitative precipitation estimation as the forecast object and contained four background meteorological factors. Taking the TransUNet as the backbone of the model, this model proposed the parallel dual encoder to extract the high-dimensional spatio-temporal features of the forecast object and the background meteorological data, respectively. Besides, it constructed the content coding module to encode the spatial features of the background data as the learnable positional embedding of the high-dimensional feature vectors of the forecast object. It used a Transformer module to construct the global relationship between the high-dimensional features of the sequence data for better sequence prediction. The metrics used in this paper included critical success index, false alarm rate, root-mean-square error, and structural similarity, etc. The MPFNM was evaluated on two datasets (the proposed dataset and an open-source dataset) and outperformed the baseline models, and it was analyzed for explainability through the SHAP technique. The experimental results and explainability analysis show that the model has better forecasting accuracy and reliability. [ABSTRACT FROM AUTHOR]

The existing branch prediction models can't predict the behaviors of various instructions in the processor accurately, which leads to the limitation of processing efficiency. Therefore, this paper proposed two hybrid prediction solutions, which aimed to combine multiple branch prediction models to improve prediction accuracy and processor execution efficiency. This paper transferred the prediction results of TAGE branch prediction model and BATAGE branch prediction model to the Hybrid model. In the prediction phase, the Hybrid model selected the prediction results of the best-performing branch prediction model based on the historical performance of TAGE and BATAGE. In the update phase, the Hybrid model updated the saturation counter of the entries that needed to be updated according to the designed hybrid prediction strategy. Experiments on 440 test programs provided by the CBP software simulation platform show that the prediction error rates of both hybrid prediction solutions are lower than those of many of the latest mainstream branch prediction models. This study provides an effective solution to the problem of predicting all command mode behaviors. In the branch instruction prediction of real CPU, this research provides some practical value. [ABSTRACT FROM AUTHOR]

Aiming at the distributed unrelated parallel machine scheduling problem with machining constraints, this paper proposed an extended empire competition algorithm to solve the problem, which took the total transportation cost, evaluation function for simultaneous shutdown of parallel machines among factories and equilibrium evaluation function for average switching frequency of workpiece types among factories as optimization objectives. Based on the original empire competition algorithm, this algorithm added an initial factory-workpiece sequence group suitable for factory assignment. According to the shortcoming of the traditional empire competition algorithm that it was easy to fall into the local optimum, this paper divided the inferior sequence assimilation into the external assimilation mechanism and the internal assimilation mechanism. The extended empire competition algorithm combined local and global search methods to realize the intelligent search behavior. This paper used the partial matching crossover and single point mutation to update the factory-workpiece sequence group and ensure the diversity of the factory-workpiece sequence. Finally, this paper designed three different scales of 12 examples and verified the effectiveness of the proposed algorithm through simulation experiments. At the same time, this paper verified the advantages of the proposed algorithm in solving the distributed multi-objective unrelated parallel machine scheduling problem by comparing the research results in related fields. [ABSTRACT FROM AUTHOR]

Aiming at the floorplanning problem with only hard modules, it is usually constructed as a combinatorial optimization model, but the time cost of solving process is high. In order to improve the solving efficiency, this paper proposed a floorplanning algorithm based on non-smooth analytic mathematical programming. Based on the coordinate representation of modules, this paper established a non-smooth mathematical programming model, which was a generalization of the optimization models corresponding to various optimization stages of different cases that were solved by the conjugate sub-gradient algorithm (CSA). Aiming at the fixed-outline floorplanning problem, this paper achieved wirelength optimization under fixed-outline constraint through the general framework consisted of three stages: global floorplanning, legalization and local optimization. To address the case without fixed-outline constraint, this paper proposed a conjugate sub-gradient algorithm with golden section strategy (CSA_GSS). The algorithm adopted golden section strategy to reduce the area of the fixed-outline and to achieve the dual effect of both area and wirelength optimization. Compared with floorplanning algorithm based on B-tree on GSRC test circuit, the proposed algorithm had advantages in terms of wirelength and time for large-scale circuits. Experimental results show that the algorithm can obtain better wirelength with lower time complexity. [ABSTRACT FROM AUTHOR]

The survival behavior of snakes in nature generates the snake optimization (SO), a meta-heuristic optimization algorithm. But the original snake optimization algorithm suffers from slow convergence and easy to fall into the local optimum, so this paper proposed an improved snake optimization algorithm that combined elite initialization and K-nearest neighbors improved snake optimizer (EKISO). Firstly, in order to improve the quality of the initial population, it proposed elite initialization during the population initialization stage, which generated high-quality initial population individuals based on elite individuals of the population. Secondly, optimizing the spiral foraging strategy with a shock factor expanded the search range during the global exploration stage and enhanced the algorithm's local escape capability. Finally, in the local exploitation stage, it proposed a position update method based on the K-nearest neighbor concept, enhancing the information interaction capability among population individuals, thus accelerating convergence speed and improving convergence accuracy. This method compared with seven other optimization algorithms using 14 classical test functions and 4 CEC2017 test functions, which proves that EKISO converges faster, has higher accuracy and is not easy to fall into local optimum. To further validate the practicality and feasibility of EKISO, this paper applied it to pressure vessel design problems. Experimental comparative analysis reveals that EKISO possesses certain advantages in dealing with real optimization problems. [ABSTRACT FROM AUTHOR]

In view of the fact that there is still a certain gap in representing and reasoning with the orientation relation between real objects due that the existing models for representing and reasoning with direction relations use a point and minimum bounding rectangle to approximate the spatial object itself, this paper proposed a new model for dealing with the disconnected spatial objects based on Voronoi diagram. With the help of the theory of Gestalt psychological, the proposed model constructed visual regions between spatial objects by extracting the feature points and feature chains of the disconnected spatial objects to generate the direction Voronoi diagram, which realized the representation of directions between the space objects which were disconnected and contain holes. This model fully considered the influence of the shape, size and other factors of the spatial objects, and had higher expression accuracy and wider applicability. In order to improve the precision of reasoning with cardinal directional relations between complex spatial objects, this paper proposed an algorithm for composing cardinal direction relations defined by the proposed model, which reduced the uncertainty of the results of composition by means of Tile-union operation and Pr operation. The results of analysis and verification show that the proposed model and algorithm reduce the uncertainty of the reasoning results, improve the accuracy of representation and reasoning, and then enhance the ability to analyze and process the direction relations with complex spatial objects. [ABSTRACT FROM AUTHOR]

The key to multimodal sarcasm detection is effective to align and fuse the features of different modes. However, the existing multimodal data fusion methods ignore the relationship between multimodal intercomponent structures. Also, the importance of common features associated with sarcastic emotions in multimodal data is overlooked in the process of recognizing sarcasm. To address the above problems, this paper proposed a model based on cross-modal hierarchical interaction networks and contrastive learning (CMHICL). Firstly, the cross-modal hierarchical interaction network employed a minimal unit alignment module based on the cross-attention mechanism and a compositional structure fusion module based on the graph attention network to identify inconsistencies between text and images at different levels, and determined the samples with low consistency as sarcasm samples. Secondly, two contrastive learning tasks, based on data enhancement and category enhancement, helped to learn common features related to sarcasm and reduce false correlations within the modality. The experimental results show that the CMHICL model has increased the Acc by 0.81% and the F₁ value by 1.6% compared to the baseline models, which verifies the key role of the hierarchical interactive network and contrastive learning method proposed in this paper in multimodal sarcasm detection. [ABSTRACT FROM AUTHOR]

Knowledge reasoning is a fundamental task in knowledge graph completion. It is a popular topic in the academie community. Integrating reinforcement learning and knowledge reasoning is a viable solution to improve the inference effectiveness and interpretability of models. Taking the problem of knowledge graph research as a path or sequence decision problem in the knowledge reasoning method based on reinforcement learning can make better use of semantic information, such as entities and relationships, to improve reasoning effect and interpretability. This paper provided a descriptive overview of the basic concepts of knowledge graph and knowledge reasoning, and described the research progress in recent years. The paper analysed and compared the related research on knowledge reasoning based on reinforcement learning from two perspectives; single-layer and double-layer reinforcement learning knowledge reasoning. Furthermore, the paper explored the application of knowledge reasoning in various domains, including knowledge question answering, intelligent recommendation systems, healthcare, and transportation. Lastly, the paper discussed future research tendencies for reinforcement learning-based knowledge reasoning and offered insights into potential avenues for exploration and development. [ABSTRACT FROM AUTHOR]

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 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 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 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.)