Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2022-05-11 Cooperative journals: 《计算机应用研究》
Abstract： Ant-based algorithm to solve distributed constraint optimization problems (ACO_DCOP) is an excellent population-based algorithm for solving DCOPs. However, ACO_DCOP has some shortcomings including very slow convergence speed and easily falling into local optima. To cope with these issues, this paper proposes a random disturbance based multi-population ant colony algorithm to solve DCOP (RDMAD) . The method introduces a division of labor and cooperation mechanism to divide the population into two subpopulations for greedy search and heuristic search respectively. The method also constructs a hierarchical update strategy to speed up convergence and improve solution quality. Furthermore, this paper designs an adaptive mutation operator and a reward and punishment mechanism for the greedy search subpopulation to prevent RDMAD falling into the local optima. Simultaneously, this paper introduces a random disturbance strategy to increase the population diversity when RDMAD is stagnant. To verify the performance of the proposed algorithm, RDMAD is compared with the other seven advanced incomplete algorithms on three types of benchmark problems. The extensive experimental results show that the proposed algorithm is significantly superior to the state-of-the-arts algorithms in solution quality and convergence speed. In addition, RAMAD is far stable than the competing algorithms.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2022-04-07 Cooperative journals: 《计算机应用研究》
Abstract： In order to solve the problem that it is difficult to get out of the local optimum to achieve further optimization in large-scale dense Distributed Constraint Optimization Problems(DCOPs) . This paper proposed a local parallel search framework(LPOS) for solving algorithms of DCOPs. In LPOS, the Agent searches all the value assignments of its local neighbors in parallel according to its current value assignment to further expand the search of solution space, so as to avoid the algorithm falling into local optimum prematurely. In order to ensure the convergence of the algorithm, this paper designed an adaptive equilibrium factor K to balance the exploration and exploitation ability of the DCOPs solving algorithms. At the theoretical analysis, it proved that the LPOS can expand the search of solution space and the K can achieve the balance. The experimental results demonstrate that the performance of the proposed LPOS is better than the-state-of-the-art algorithms in both low density and high density. Specifically, LPOS significantly superior to the competitors when solving high density DCOPs.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2020-09-28 Cooperative journals: 《计算机应用研究》
Abstract： Image classification techniques based on deep neural networks have achieved great success in recent years. However, recent studies have shown that deep neural network are vulnerable to the attack of adversarial examples. To solve this problem, some works train networks by adding Gaussian noise to the image. Thereby improving the ability of the network to defend adversarial examples, but the method does not consider the sensitivity of the network to different areas in the image when adding noise. To solve this problem, this paper proposed an adversarial training algorithm based on gradient guidance noise addition. When training the network, adding adaptive noise to different areas based on the sensitivity, adding large noise to the more sensitive areas, suppressing the sensitivity of the network to image changes, adding less noise to the less sensitive areas and improves the network classification accuracy. Compared with the existing algorithms on the cifar-10 dataset, the experimental results show that the proposed method effectively improved the accuracy of neural networks when classifying adversarial examples.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-04-01 Cooperative journals: 《计算机应用研究》
Abstract： Judgment of network users on information falseness is a key stage in the process of information dissemination. The personal evaluation of the information obtained by the masses and the determination of the authenticity of the information content will directly affect the breadth and spread of the information. Considering that the credibility difference of users of publishing information has certain influence on the information dissemination process, a new IBU model is proposed for the breadth and effect of true and false information dissemination, and the authenticity of information content and the credibility of users who forward information on the dynamics of information dissemination are studied. The propagation effect of the model is tested by Matlab simulation. The experimental results show that no matter the credibility of the user who publishes the information, it has nothing to do with the credibility of the information itself, only related to whether the information content itself is credible; the credibility of the information publisher The larger the time, the longer the information is transmitted; on the contrary, the lower the credibility of the information publisher, the shorter the propagation time, but it does not change the true and false nature of the information content. The research results provide a theoretical basis for relevant functional departments in information management and control.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-04-01 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the problem that the existing network does not consider the heterogeneity of mobile network nodes and the failure to construct a destructive virus propagation model, this paper proposed a destructive virus propagation model based on heterogeneous mobile networks. By considering the heterogeneity of mobile network nodes, this paper further divided the uninfected state into a new system state and an old system state, and combined with the latent and explosive characteristics of the destructive virus, divided the infection state into a latent state and an explosive state. This paper calculated the equilibrium point and propagation threshold of the model, and pointed out that when the propagation threshold is greater than 1, the model is unstable at the positive equilibrium point; when the propagation threshold is less than 1, the model is locally asymptotically stable at the positive equilibrium point. This paper carried out the simulation experiments on the NW small world network and the BA scale-free network. The simulation results showed that the virus propagation speeds of the two networks are different, and the NW network has a complete elimination of the virus, but BA does not have this situation.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-04-01 Cooperative journals: 《计算机应用研究》
Abstract： With the rapid development of social networks, the control of network rumors becomes more and more important. This paper studied the dissemination mechanism of rumors on microblog networks. According to its propagation characteristics, the paper divided the audience users of microblog rumors into four categories: Unknown, Viewer, Forwarder and Reviewer, thus constructing a network rumor propagation model of UVFR. It used the model to analyze the influence of the main parameters on the propagation process, and proposed the corresponding control strategies. The main feature of the model redefined the rules of rumor propagation and the propagation dynamics equation, which made the propagation formula more in line with the real use habits of micro-blog users. The paper used a multi-agent simulation platform to simulate the spread of rumors in scale-free network structure, and compared the simulation results with the real data of Sina Weibo to verify the rationality and validity of the conclusions. The simulation results show that the more initial propagation nodes, the faster the rumor spread, and the greater the forwarding probability, the wider range the rumor spread.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-03 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the high mismatching rate of traditional local stereo matching algorithm at the depth discontinuities, this paper proposed an occlusion information stereo matching approach based on adaptive weight. Firstly, left-right consistency check algorithm detected the occlusion area of the reference image and the target image. Then, this paper utilized occlusion information to reduce the weight of pixels in the occlusion area at the process of cost aggregation, and scanline propagation filled occlusion pixels with horizontally nearest points in the disparity refinement stage. Finally, the mismatching rate of disparity map was calculated according to the Middlebury standard image dataset. The experimental results show that compared with adaptive support weight approach, the occlusion information stereo matching approach based on adaptive weight decreases the mismatching rate by 16%. Meanwhile, the proposed algorithm not only has lower mismatching rate in the depth discontinuous region, but also improves the accuracy of algorithm matching.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-03 Cooperative journals: 《计算机应用研究》
Abstract： The existing enterprise private cloud is facing a problem about data security storage and integrity verification, this paper proposed a new data linear scrambling hybrid encryption protection method. Firstly, the data are fine-grained and linearly divided before they encrypted. Secondly, the divided sub-blocks are respectively subjected to data scrambling processing. Finally, the domestic cipher algorithm is used to perform mixed encryption and integrity check on the scrambled data blocks. The proposed algorithm is compared with the SM4 and SM2 encryption algorithms, and through experiments evaluate the correctness, encryption file type, encryption and decryption efficiency and security of the algorithm. The experimental results show that compared with the other two encryption algorithms, the proposed algorithm can greatly improve the security while improving the encryption and decryption efficiency.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： The traditional method of calculating the similarity of the Microblog users based on the user's blog content and the number of common friends has the problem of excessive potential error, and the similarity calculation model based on the user's multi-source background information has high computational complexity and ignore the user's interest and other issues, the author puts forward a combined with user's interest and background information to calculate the comprehensive similarity (BIBS) . The method extracts the user's interest from the user's tag. When the user's tag is missing, the user's interest is indirectly obtained by clustering the important user in the user's attention network, and the user's interest similarity is calculated, and then the background similarity of the user is calculated according to the background information such as the gender, age and location of the user, so that the most similar users are hierarchically mined. Experiments and analysis based on the data of Sina Microblog show that compared with MISUR algorithm based on the similarity of multi-source information, the algorithm can improve the accuracy, recall rate and F-measure by 8.1%, 16.7% and 13.6% respectively with less time consuming, which proves the effectiveness and accuracy of the proposed BIBS method.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-24 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the problem of ignores the user's interest in the key words and the data sparseness in traditional collaborative filtering algorithm. We proposed a collaborative filtering recommendation algorithm combined with the user interest degree clustering. We using user ratings for projects and extracting keywords from item attributes. A new Rating Frequency-Inverse Item Frequency algorithm is proposed. According to the target users' scoring frequency for a key word and the frequency of the keyword being evaluated by all users. We get users' preferences for keywords, form user preference matrix, and cluster on the basis of this matrix. Then we use logistic function to get users' interest in projects. Clear user preferences and find similar users of target users in the clusters. Then extract N items from neighbors' preferences, and recommend users. Experimental results show that the algorithm accuracy rate is always better than the traditional algorithm. it, s more accurate to judge the user interest, alleviating the problem of data sparseness, and effectively improves the accuracy and efficiency of recommendation.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-18 Cooperative journals: 《计算机应用研究》
Abstract： In order to study the role of opinion leaders in the dissemination of Sina micro-blog and the propagation mode of micro-blog's life cycle in social networks effectively, the paper proposed a propagation prediction OLB model. Firstly, we crawled the micro-blog data, then analyzed the data; Secondly, we fitted a mathematical expression of the four factors related to influence, and gave the weights calculation method through the analytic hierarchy process; Finally, we constructed the OLB model by using the influence of computation and the relationship between forwarding number and related factors. We analyzed the communication role of opinion leaders and micro-blog life cycle through the experiment. The simulation results showed that the influence of opinion leaders was positively proportional to the spread of micro-blog in micro-blog information dissemination. The average error of the four sets of data were 1.0%, 5.0%, 2.4% and 5.1% respectively by error analysis. The OLB model is reasonable and effective for predicting micro-blog propagation patterns.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-02 Cooperative journals: 《计算机应用研究》
Abstract： As for the Time-Efficient A* algorithm significantly reduces the algorithm time, lead to the problem of increase path planning length and path sawtooth. This paper proposed an improved Bidirectional Time-Efficient A* Algorithm, which will run the A* algorithm from the start and the end point to find the path and apply the multiple neighbor grid distance computation scheme. At the same time, according to different environment map, this paper compared and analyzed the A* algorithm, Time-Efficient A* algorithm and Bidirectional Time-Efficient A* algorithm. Finally, the index of algorithm time and path length will be chosen as two indicators to evaluate the merits and demerits of the algorithm. Experimental results show that compared with with traditional A* algorithm, the Bidirectional Time-Efficient A* decreases the time of the algorithm by 76.8% at the maximum, and reduces the maximum time by 55.4% compared with Time-efficient A* algorithm. It also solves the problem that the path distance of the Time-Efficient A* algorithm is augmented and the path is not smooth enough.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-04-24 Cooperative journals: 《计算机应用研究》
Abstract： In order to study the impact of differences in user communication capabilities on the spread of spam. This paper divided the population in the communication network into four compartments I(Ignorant) , W(Weakly spreader) , S(Strongly spreader) , R(Removal) and established state transition rules according to the theory of compartment modeling. Using differential dynamical system theory, this paper developed an IWSR spam propagation model with different communication capabilities. By calculating the basic reproduction number of the model and using the Hurwitz criterion, Lyapunov stability theorem and LaSalle invariance principle, this paper obtained the conditions for local stability and global stability of the spam information propagation equilibrium points. Finally, the comparison experiment between the numerical simulation and the Sina Weibo dataset proves that the conclusion is reasonable and effective.
Hits
Hits
Downloads
Comment