Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： This paper proposed halftone self-hiding algorithms, and a secret image can be hidden in dot diffused or error diffused halftone images. Based on the data hiding algorithm by dual conjugate dot diffusion, a dot diffused gray-scale halftone self-hiding algorithm can be realized, and this algorithm can be extended to an error diffused halftone image, and then an error diffused gray-scale halftone self-hiding algorithm can be proposed. Based on the data hiding algorithm by new color conjugate error diffusion and the data hiding algorithm by new color conjugate dot diffusion which are the latest color halftone visual cryptography, color halftone self-hiding algorithms in dot diffused and error diffused halftone images can be proposed. Experiments of four algorithms have been implemented and the performance of different algorithms can be compared. The results show that the color halftone self-hiding algorithm based on dot diffused and error diffusion has the best performance under the same parameters.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： This paper proposed a fair secure multi-party computation (MPC) protocol to solve the problem that fairness cannot be achieved when there is no honest majority. The protocol constructed a penalty mechanism based on smart contracts which are stored on the blockchain. It includes the MPC phase based on verifiable secret sharing and the fair secret reconstruction phase. The participants can obtain the final output by collecting just t+1 correct shares. The protocol utilized homomorphic commitments to verify the correctness of the secret shares, employed timeouts to identify the premature abort behaviors of malicious parties, and punished the aborting parties financially. Security analysis shows that honest participants can get the final output, otherwise they will get financial compensation. Performance analysis shows that the protocol requires only one coin-transfer round and a large number of complex secret share verification work is off the chain, which ensures the implementation efficiency.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： At present, the traditional method of cracking WinRAR is to use the CPU and GPU, but the potential password space is very large which requiries a higher performance computing platform to find the correct password within a limited time. Therefore, this paper uses the hardware platform of multi-FPGA to achieve a high-performance WinRAR crack algorithm. The SHA-1 algorithm was optimized by adding pre-calculation and carry saving adder under the full-pipeline architecture, so as to improve the throughput of the algorithm. And the use of state machine control to optimize data splicing, to improve algorithm parallelism. At the same time, it used the asynchronous clock and multiple FIFO buffers to read and write the overall structure of the data optimization algorithm to reduce the coupling within the algorithm. The experimental results show that the final optimized resource utilization rate is 75% and the frequency reaches 200MHz. The 4-byte password deciphering speed is 102, 796 per second, which is 100 times faster than CPU and 3.5 times faster than GPU.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： The location-based hierarchical access scheme based on attribute encryption allows users to flexibly set their own location access information according to their own situation. Not only solving the problem of location sharing in social networks, but also improving the algorithm to improve the decryption efficiency. However, during the operation of the system, there is a possibility that the user has corrected his own attribute information or the private key may be leaked during the operation, supporting the withdrawal is very necessary for system security. Based on this, a location hierarchical attribute encryption scheme supporting undo is proposed, which outsources part of the decryption operation to the decryption server and combines the method of two-factor identity authentication. This solution reduces the user's computational cost and improves the security of the algorithm.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： To improve the security of authentication in multiple-server environment and reduce the computational complexity, a three factor authentication protocol based on bilinear mapping is proposed, which includes three factors of bioinformatics, smart card and bilinear mapping cipher. The proposed protocol includes 6 stages: system setup, server registration, user registration, login, authentication and key agreement, and password update. Among them, biological factors and smart cards as the core factors involve registration, landing, authentication and modification. Formal verification of Oracle verifies the security of the protocol. Attackers can not get identification, password, biometric information, etc. , and this achieves key agreement and mutual authentication. Compared with other related protocols, the proposed protocol has some advantages in security features, smart card storage cost, communication cost and so on.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： In the existing anonymous system based on network coding, the success rate of data transmission is low due to the instability of forwarding nodes and the multipath forwarding of anonymous messages. Aiming at this, a new anonymous communication mechanism ACSNC based on network coding and data redundancy method is proposed. The proposed mechanism first adopts a data redundancy mechanism to redundantly fragment the data to be sent and send it along multiple paths. Then, the intermediate forwarding node randomly encodes the information and then forwards the information so that the statistical characteristics of the information are changed before and after passing through the node. Finally, the destination node recovers the anonymous information based on the received data slice and coding coefficients. Simulation results show that the mechanism can effectively guarantee the anonymity and security of communication on the basis of significantly improving the success rate of data transmission.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the security problems existing in the process of the data aggregation and transmission in crowd sensing networks, such as privacy leakage, incomplete information, data tampering. this paper proposed a data aggregation privacy protection algorithm based on distributed compressive sensing and hash function. Firstly, it used distributed compressive sensing method to sparsely observe the sensed data and remove the redundant data. Then, it utilized one-way hash function to obtain hash value of the observation data and filled the hash value with the unconstrained camouflage data into the observation data of sensory data to reach the aim of concealing the true sensor data. Finally, after extracting the camouflage data at the sink node, it obtained the hash value of the observation data again to verify the integrity of data. Simulation results show that the algorithm takes into account the privacy preserving and integrity protecting of data, and also can reduce the communication overhead greatly, which means the strong applicability and scalability in practical applications.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： PRIDE and RoadRunneR are two lightweight block ciphers proposed in recent years. At 2016 ASIACRYPT, Xiang Zejun proposed using MILP (mixed integer linear programming) model based on bit-based division to search integral distinguisher. This paper applies this idea to two lightweight block cipher that two different types of algorithms. In order to evaluate their integral properties, MILP models are built according to their different structures, and the useful integral distinguisher can be searched by using Gurobi optimizer to solve this model. Results, 9 rounds and 5 rounds of integral distinguisher are obtained respectively, which is the longest integral distinguisher of PRIDE and RoadRunneR . More rounds of integral attack can be made by using the distinguisher.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the problem of low adaptability and low energy efficiency of MAC protocol of the wireless body area network, this paper proposes an adaptive MAC protocol based on IEEE 802.15.6 for wireless body area networks (A-MAC) . The protocol improves the superframe structure of IEEE 802.15.6, and the lengths of the contention phase and the non-contention access phase are adjusted according to the proportion of nodes generating each priority data. The contention access phase is further divided into three sub-phases, and the length of the sub-phase is dynamically adjusted according to the data priority. All nodes compete for access channels in accordance with the channel access policy during the contention access phase. Finally, the simulation results show that the network performance using A-MAC protocol is significantly better than the network performance using IEEE 802.15.6 MAC protocol and CA-MAC protocol in terms of throughput, power consumption and network delay.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： In order to solve the problems existing in the learning recommendation algorithm that ignore the analysis of the students' knowledge points and can not probabilize the knowledge mastery, this paper proposed a recommendation method based on multiple factors. The method focused on the comprehensive weight of knowledge points, error rate and loss rate, and built a knowledge point mastery probability model, and applied the proposed strategy to implement an online personalized learning recommendation system . In terms of the systematic evaluation, through a survey of 200 high school students, the accuracy of the top-8 knowledge points recommended by our system achieves significant performance, Precision: 91.2%, and F1: 78.4％. The results of the systematic survey reflect the effectiveness and reliability of the proposed strategy.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： Reducing the energy consumption of the Internet has become an urgent problem. However, the existing energy efficient routing algorithms are facing the following two problems: a) all of them will degrade the network performance in varying forms, such as network congestion, routing flap, routing availability and uneven traffic distribution; b) all of them require real-time traffic information, which lead to high complexity of the algorithm. Therefore, this paper designs a green energy efficient scheme EEIPFRR which is based on IP fast reroute, taking into account the energy saving, network performance and algorithm complexity. The experimental results show that compared with DLF algorithm, it can not only reduce network energy consumption, but also have less path stretch, lower algorithm complexity and maximum link utilization.
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-11-29 Cooperative journals: 《计算机应用研究》
Abstract： In order to improve the efficiency of task offloading in Ad hoc cloud, aiming at the effect of node random movement and resource heterogeneity on task offloading, this paper proposes the multi criteria task offloading algorithm based on mobility prediction, which is used to predict node escaping time based on time series analysis and as a measure of mobility. By using the analytic hierarchy process to get the weights of CPU speed, number of cores, workload and mobility, the task is offloaded according to task size and the combined weights which has been calculated, the simulation results show that the algorithm can reduce the task execution time and energy consumption effectively compared with the random task assignment algorithm and Min-Min scheduling algorithm.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： In the large-scale MU-MISO system, the spectral efficiency affect by the channel and power allocation is studied in spatially correlated channels. Firstly, the transmit correlation matrix of the user was derived from steering matrix which was determined by the wave path difference of the transmission signal. The spatial correlation channel was established under the large scale shadow fading and the scattering environment with Gaussian distribution. Then based on the spatial correlation channel, precoding which could reduce the interference between multiple users was simulated for the spectral efficiency performance. Finally, a power allocation algorithm that make the spectrum efficiency maximized was proposed in the scenario where the transmit power was limited and signal to interference plus noise ratio of each user was limited in receive signal. The simulation show that the spectral efficiency of RZF precoding in spatially correlated channels is better than that of MRT precoding. And compared with the average power allocation, the spectral efficiency with the algorithm which has strong theoretical and practical significance has the improvement.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： In many applications of mobile crowd sensing, participants should collect continuous data over a period of time in this scenario on which existing research lacks consideration. For this scenario, the paper proposes a participant selection mechanism which is time window dependent. This mechanism includes: a participant selection method which is time window dependent based on dynamic programming algorithm. The target of the method is to maximize data benefits while cover time period of the task; A updating mechanism of participant’s reputation given the willingness and data quality of the participant. Finally, simulation results show that compared with two common selection mechanisms, the participant selection mechanism proposed has better performance in terms of data reliability, data benefits and cost and has better prospects.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： In order to improve the performance of particle swarm optimization, the paper proposed a hybrid algorithm based on simplex search and particle swarm optimization. On the one hand, the algorithm determines the inertia weight adaptively, cognition and social parameters for the purpose of avoiding parameters. On the other hand, the simplex search is used to guide the direction of several particles, thus the convergence of the algorithm is accelerated. The results of numerical experiments show that the proposed algorithm has better performance than the compared algorithms in terms of function evaluations and accuracy.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： Distance measure can affect the clustering effect of microaggregation algorithms, in order to improve the privacy preserving ability of the algorithm, the Euclidean distance in the V-MDAV algorithm are replaced by the balanced adjacent degree in grey relational analysis method to measure the distance between records, and the V-MDAV algorithm based on grey correlation is proposed, called V-GRAV (variable-size grey relation to average vector) algorithm. The balanced adjacent degree includes the characteristic of the measure of grey relational degree to the whole approximation and balanced degree to the sequence balanced degree, which can eliminate the point correlation tendency. It overcomes the problem that the Euclidean distance is greatly influenced by the local singular value. Therefore, the V-GRAV algorithm can reduce the privacy disclosure risk while ensuring that the information loss is similar to V-MDAV algorithm. Our experiments demonstrate that the algorithm is effective.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： Collaborative filtering plays an important role in recommendation system and is the most successful and widely used technology in information filtering and information system. However, collaborative filtering has a sparse problem in data processing, which affects the accuracy of the proposed algorithm. This paper proposed a recommendation algorithm combining collaborative filtering and XGBoost to explore the potential relationship between the project and the user based on the user's evaluation of the project and its own characteristics. It improved the recommendation accuracy of the algorithm. The results of experiments on the book-crossings data set using the baidu deep learning framework paddlepaddlepaddles show that, Compared with the two algorithms in the literature, the accuracy of the proposed algorithm is significantly improved.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： In order to solve the problems of multiple schema matching in the process of integrating multi-source heterogeneous civil aviation passenger service data, such as low efficiency, low accuracy and the complexity of obtaining complete schema information, this paper proposed the multiple schema matching method based on SimHash and mixed similarity. Firstly, the method calculated the weight of feature units based on PMI, and generated the signature of columns by SimHash to represent attribute features to reduce feature dimension. Further, it employed K-means++ to generate candidate matching sets by clustering the columns. Finally, it constructed the mapping graph of attributes based on attributes’ mixed similarity, and displayed the matching relationship between attributes intuitively. Meanwhile, it improved efficiency of multiple schema matching. The experimental results verify the feasibility of the proposed method. The method provides a new solution for efficiently resolving the schema conflict in the process of integrating multi-source heterogeneous civil aviation passenger service data.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： The method based on recurrent neural network combined with syntactic structure is widely used in relation classification, and the neural network is used to automatically acquire features and realize relation classification. However, the existing methods are mainly based on a single specific syntactic structure model, and the model of a specific syntactic structure cannot be transferred to other types of syntactic structures. Aiming at this problem, a hierarchical recurrent neural network model with multi-syntactic structure is proposed. The hierarchical recurrent neural network is divided into two layers for network construction. Firstly, entity pre-training is performed in the sequence layer. The Bi-LSTM-CRF fusion Attention mechanism is used to improve the model's attention to the entity information on the text sequence, thereby obtaining more accurate. The more accurate entity feature information promotes better classification in the relation layer stage. Secondly, in the relation layer, the Bi-Tree-LSTM is nested above the sequence layer, and the hidden state and entity feature information of the sequence layer is passed into the relation layer, then three different syntax structures are weighted learned using the shared parameters and classify the semantic relation finally. The experimental results show that the model has a marco-F1 value of 85.9% on the SemEval-2010 Task8 corpus, and further improves the robustness of the model.
Hits
Hits
Downloads
Comment