05 February 2012, Volume 38 Issue 3
-
Select all|
-
Computer Engineering. 2012, 38(3): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2012.03.001A multi-thread parallel Single-source Shortest Path(SSSP) algorithm is proposed in multi-cores platform. It employs buckets to sort and uses the similar parallel strategy of Δ-Stepping algorithm. It does edge relaxations of the same bucket in parallel by slave threads, and searches all buckets in sequence by master thread. Experimental results show that this algorithm performs 4 seconds in the USA road network, achieving a higher speedup compared with serial parallel algorithm using same code.
-
Computer Engineering. 2012, 38(3): 4-6. https://doi.org/10.3969/j.issn.1000-3428.2012.03.002For the purpose of making the compiler more adaptive and dealing with complex architecture, a compiler framework is proposed which combines iterative compilation and instance-based learning. On one hand, the compiler can search the optimization space and save the best compiler options into the knowledge library; on the other hand, the compiler can learn from the library to get the best compiler options for the current program. The incremental algorithm can make full use of the accumulated data of the compilation. The algorithms are proposed which can keep the redundant instance out of the knowledge library and filter the noise from the library.
-
Computer Engineering. 2012, 38(3): 7-8,11. https://doi.org/10.3969/j.issn.1000-3428.2012.03.003This paper proposes a performance prediction method of photoelectric imaging detection system. It designes the detection system model including the sensor and processor. Likelihood ration test detector is designed under minimum error probability which is based on signal detection theory. Analytical expression of false probability is derived based on central limit theorem. Experimental results show that detection error rate drops with the quantitative digits improving, and calculation error rates and simulation error rates are basically the same.
-
Computer Engineering. 2012, 38(3): 9-11. https://doi.org/10.3969/j.issn.1000-3428.2012.03.004In base vector randomly selection, the convergence speed of Differential Evolution(DE) algorithm is low. In order to solve this problem, a Modified DE(MDE) algorithm is proposed. Some good individuals are chosen to form the base vector group. Base vector is chosen from the base vector group when mutation is operated. Test functions are used to prove the new algorithm. Results show that the modified algorithm can reduce the selecting range of base vector and the iteration times for convergence.
-
Computer Engineering. 2012, 38(3): 12-13,18. https://doi.org/10.3969/j.issn.1000-3428.2012.03.005In the existed privacy-preserving classification mining methods based on data perturbation, the privacy data is not protected perfectly because the perturbed data and the original data have been related. The classification algorithm and the data perturbation algorithm have high coupling It is not easy to use these methods in practice. To solve these problems, it proposes a privacy-preserving classification mining algorithm based on probability theory. The perturbed data is independent from the original data and they have the same distribution. This proposed method overcomes the shortcomings of others. The perturbed data is no relation with the original data and the classification methods can be used on the perturbed data directly.
-
Computer Engineering. 2012, 38(3): 14-18. https://doi.org/10.3969/j.issn.1000-3428.2012.03.006A method of real-time simulation system is discussed based on synthesizing the benefits of the Simulink/Real-time Workshop(RTW) and the Real-time eXtension(RTX) for Windows. Rapid modeling and encapsulating is implemented by high-powered software and self-defining VC project respectively, which depends on building a Real-time Dynamic Linkable Library(RtDll) composed of model codes generated by RTW. A simulation engine is designed that can load/unload models dynamically and give attention to both decoupling and real-time intercommunication between the model and the engine, which settles for the requirements of transmission model’s input/output information in time and parameter-tuning online. Experiments indicate that the system improves the real-time performance of simulation and gets the identical results as running on Simulink.
-
Computer Engineering. 2012, 38(3): 19-21,30. https://doi.org/10.3969/j.issn.1000-3428.2012.03.007The calculation of risk probability in the attack graph lacks cycles nodes processing. In order to sovle this problem, this paper proposes a nodes risk probability algorithm in attack graph with cycles. It gives examples of the attack graph with cycles, and introduces the risk probability calculating method with cycles or no cycles. It gives the not retrospective hypothesis to make sure the cycle path, and breaks the cycles through removing the export edge of the nodes in the cycles, and unreachable nodes. Experimental results show that this algorithm can obtain accurate calculation results, and its time complexity is low.
-
Computer Engineering. 2012, 38(3): 22-24,33. https://doi.org/10.3969/j.issn.1000-3428.2012.03.008This paper proposes a decimal system encryption algorithm based on Feistel network. Aiming at the characteristics of decimal system operations, four operations are defined in encryption algorithm, two operations are defined in key expansion algorithm and decryption algorithm, and the new decimal system substitution table is designed. The new encryption algorithm is applied to the short-block encryption simulation system, simulation results show that the proposed algorithm has excellent cryptographic properties, all diffusion rate targets reach desired impact, and the diffusion rate of key to ciphertext after 6-round encryption reaches full diffusion. The encryption algorithm can be applied to all areas of decimal system encryption.
-
Computer Engineering. 2012, 38(3): 25-27. https://doi.org/10.3969/j.issn.1000-3428.2012.03.009On the basis of the research of previous object storage metadata management strategies, this paper puts forward a new kind of metadata management strategy. The method is to divide namespace directory into neutron trees, and compute with hash function using the combination of the root directory name and file name. Metadata Server(MDS) determines its storage path according to the hash value. Experimental result shows that this new kind of metadata management tactics can avoid the massive metadata migration problems and network overhead problems in dealing with metadata rename operation and modify filename.
-
Computer Engineering. 2012, 38(3): 28-30. https://doi.org/10.3969/j.issn.1000-3428.2012.03.010This paper proposes an incremental sequential patterns updating algorithm based on frequent sequence tree, called IUFST, in order to solve the problem that when the database is updated, the existed incremental mining algorithms of sequential patterns only mention two kinds of database updates, insert and append rather than the delete operation. When the database is updated and the support is changed, IUFST is divided into four kinds of situations to update the frequent sequence tree. It reduces the size of the projected database and improves the efficiency. Experimental results show that IUFST outperforms PrefixSpan and IncSpan in time cost.
-
Computer Engineering. 2012, 38(3): 31-33. https://doi.org/10.3969/j.issn.1000-3428.2012.03.011The existing weighted frequent itemset mining algorithms which are based on Apriori require multiple dataset scans. This paper proposes a weighted frequent itemset algorithm weighted frequent itemset mining based on dynamic itemset counting which uses the structure of weighted trie tree and the method of dynamic itemset counting. This algorithm satisfies the downward closure property and dynamically generates candidate frequent itemsets, thereby reduces the number of scanning datasets and improves the performance. Experimental results show that the proposed algorithm not only generates the weighted frequent itemsets, but also has high efficiency and time performance.
-
Computer Engineering. 2012, 38(3): 34-36. https://doi.org/10.3969/j.issn.1000-3428.2012.03.012This paper proposes a capability knowledge management in equipment system based on XML. It holds the knowledge obtained in the structured XML document, and manages the knowledge of mission and capability requirement using Native-XML to realize knowledge extraction and management. Experinmental results show this system can improve the whole efficiency of equipment system by using large mount of experience before.
-
Computer Engineering. 2012, 38(3): 37-38,42. https://doi.org/10.3969/j.issn.1000-3428.2012.03.013In order to solve the recursion problems involving several functions, this paper proposes a systematic recursion-removal method. It cuts the calls among different functions through artificial stack and replaces the recursions inside each function with iteration. It also researches on the relation between recursion-removal depth and the programs’ time efficiency. Experiments prove that it can successfully remove the recursion of dominating tree and double the time efficiency before recursion-removal.
-
Computer Engineering. 2012, 38(3): 39-42. https://doi.org/10.3969/j.issn.1000-3428.2012.03.014This paper proposes a method to assess the uncertainty of using COCOMO81 model. It uses the variance of model’s output to assess the uncertainty of model’s output. And uses both the data’s variance and the model’s output to assess the uncertainty of the distance between estimated effort and its real value. Based on the uncertainty, it proposes the prediction interval. It proposes the Mean Relative Variance (MRV) and shooting ration as the measurement to assess the uncertainty. In the experiment, re-Sampling method is employed to get N pairs of train set and test set. The average value of SR and MRV for different confidence level is calculated. After that, the scatter plot of SR and MRV is used to compare the different intervals that generated by different methods of assessing uncertainty. Experimental result shows that the measurement for uncertainty can generate narrower interval at the context of the same shooting ratio.
-
Computer Engineering. 2012, 38(3): 43-45,48. https://doi.org/10.3969/j.issn.1000-3428.2012.03.015Now the statistical analysis for the massive logs not only is time-consuming, but also requires higher hard configuration. For these questions, a method based on the file software strategy and SMCS algorithm is proposed in this paper. By the software strategy, the log file indexing and the association between the log file and log time are adopted in this method, so as to quicken the log extraction. In order to analyze the massive logs statistically and control the memory loss, hash tables, file merging and heap operation are used in the SMCS algorithm. By experiment of the real software, results indicate that the proposed method is faster than that of traditional statistical analysis by four times.
-
Computer Engineering. 2012, 38(3): 46-48. https://doi.org/10.3969/j.issn.1000-3428.2012.03.016It is difficult to be understood that some complicated declarations in C language. In order to solve this problem, an algorithm of program comprehension which auto charts and describes the declaration of C language is proposed. The concept of chart and description are proposed in this algorithm. They are the key of the algorithm and also used in other researches of program understanding. Experimental results show that the chart and description of C declaration can be understood.
-
Computer Engineering. 2012, 38(3): 49-50,53. https://doi.org/10.3969/j.issn.1000-3428.2012.03.017This paper studies the Quality of Service(QoS) evaluation criteria of Web service and the computing model for composite service, meanwhile establishes the evaluation system of customer perspective-oriented quality offline, including reasonable degree of cost, conformity of service and satisfaction of service. It proposes the model of customer perspective-oriented Web service integration and optimization with the constraint condition of service cost. Analysis result shows that, compared with the model of QoS-based composite service selection, this model considers the attributes of service quality, in essence, quality of service(goods) offline which are cared by end users.
-
Computer Engineering. 2012, 38(3): 51-53. https://doi.org/10.3969/j.issn.1000-3428.2012.03.018This paper proposes a software reliability model to resolve the software reliability growth problem in the distributed development environment. It does experiment on practical software reliability data set to demonstrate the model through the use of adaptive measures and AIC criterion. Experiments show that this model can capture a large number of reliability growth curves, has strong flexibility and adaptability, and a distributed development environment described by this model can be more realistic.
-
Computer Engineering. 2012, 38(3): 54-56,66. https://doi.org/10.3969/j.issn.1000-3428.2012.03.019For the limitations of unit and system tests, this paper presents a Capture/Replay(C/R)-based differential unit tests. Differential unit tests capture variables that may influence the behavior of target unit during the system tests and executes the unit tests through these input variables so that they can detect faults by comparing the output variables between multiple versions. Simulation results show that C/R-based differential unit tests can get lower test costs and higher coverage rate of faults detection.
-
Computer Engineering. 2012, 38(3): 57-59. https://doi.org/10.3969/j.issn.1000-3428.2012.03.020To remedy the deficiency of the existing methods about the 3D direction relations, a new relation representation model called 3DR44-4d model is presented. The space is divided 158 orientation-space and the 2128 spatial orientation relations can be represented and disqueced. in the 3DR44-4d model. The dynamic adjacent relations of the 3DR44-4d are studied. The massive complex dynamic orientation relations can be checked. Application results show that the model can enhance the ability to represent the 3D orientation relation of the spatial database.
-
Computer Engineering. 2012, 38(3): 60-62. https://doi.org/10.3969/j.issn.1000-3428.2012.03.021In order to get accurate predictions in the complex environment, for the image method is usually only used in simple communication environment, a new ray tracking method is obtained by analyzing the characteristics of test ray and image ray method. Test ray method is effectively and succinctly used to find out a rough path from the source to the scene point. The path is corrected by image ray method. This method has high accuracy and can be used in complex environments.
-
Computer Engineering. 2012, 38(3): 63-66. https://doi.org/10.3969/j.issn.1000-3428.2012.03.022In order to satisfy the requirement of data freshness in Wireless Sensor Network(WSN), by combining network data transportation and mobile element transportation, this paper proposes an efficient carrying routing algorithm. It calculates the optimal node positions for mobile elements to transmit data, and plans the paths of mobile elements, so that the energy consumption of sensor nodes is reduced and the network performance is improved. Simulation results show that the proposed algorithm can reduce network energy consumption under the premise of guaranteeing data freshness.
-
Computer Engineering. 2012, 38(3): 67-70. https://doi.org/10.3969/j.issn.1000-3428.2012.03.023The link prediction problem in scale free networks is studied. Based on the man-made and real social network, the general processes of static and dynamic prediction are given respectively. The accuracy of several similarity methods is verified, and therefore, the method of using similarity to predict links is proved to be feasible. The pridiction algorithms are recommendied according to the effectiveness of pridiction results.
-
Computer Engineering. 2012, 38(3): 71-73. https://doi.org/10.3969/j.issn.1000-3428.2012.03.024This paper proposes a design of low power consumption Wireless Sensor Network(WSN) node. It uses low power consumption energy-saving chip CC2530, and the self-organizing of WSN and the automatic collection of monitoring data are realized based on ZigBee technique. It gives the whole block diagram, the hardware design module and software design process. Taking the temperature acquisition system as an example, the experimental results prove the nodes designed by this method have low power consumption and high accuracy.
-
Computer Engineering. 2012, 38(3): 74-76,79. https://doi.org/10.3969/j.issn.1000-3428.2012.03.025In order to improve the lifetime of Wireless Sensor Network(WSN), this paper proposes a clustering algorithm for WSN based on minimum energy path. It evaluates the ratio of residual energy of a particular node to the average energy of the network, and uses the ratio to determine whether the node would become a cluster head. It uses the minimum energy paths between the cluster heads to achieve balanced energy consumption of the network. Simulation results show that the proposed algorithm can improve the network lifetime, energy consumption and data throughput.
-
Computer Engineering. 2012, 38(3): 77-79. https://doi.org/10.3969/j.issn.1000-3428.2012.03.026To improve the stability of Networked Control System(NCS) of Mobile Ad Hoc Network(MANET), this paper proposes a MANET based on overlay technology. As different types of data require different Quality of Service(QoS) in NCS, like delay, loss rate, basing on service weight, a queue schedule mechanism for overlay-based MANET is proposed. Experimental results show that the mechanism is flexible and can guarantee different QoS requirements to a certain extent.
-
Computer Engineering. 2012, 38(3): 80-81,84. https://doi.org/10.3969/j.issn.1000-3428.2012.03.027Aiming at the network coverage problem of random deployment node in Wireless Sensor Network(WSN), this paper proposes a square region based probability coverage model. According to the coverage expectation and the impact of network boundary, it gives the number of nodes that need to be deployed. Simulation experimental results show that the model can cover the region by using least nodes without the information of these nodes.
-
Computer Engineering. 2012, 38(3): 82-84. https://doi.org/10.3969/j.issn.1000-3428.2012.03.028In order to solve the raw Internet data collection, Internet data redistribution, traffic identification and protocol analysis in complex network environment, by using virtual tunnel, multicast, traffic collection and protocol analysis technology, this paper designs and implements a cater to IP network data collection, redistribution and analysis system. Application results show that the system can identify more than 90% protocols of Internet, and can identify more than 2 000 types of protocols.
-
Computer Engineering. 2012, 38(3): 85-87,90. https://doi.org/10.3969/j.issn.1000-3428.2012.03.029According to the limitations of LEACH and PEGASIS, an improved cluster head chaining routing protocol is proposed. The core idea is all of sensor nodes in the network are divided by area, sink goes down through all the nodes within the region to establish a number of cluster head chaining. By calculating the packet loss rate, a final cluster-head-chain which is able to concatenate the whole network is reached. Simulation result shows that the improved routing protocol has good reliability and real-time of data transmission.
-
Computer Engineering. 2012, 38(3): 88-90. https://doi.org/10.3969/j.issn.1000-3428.2012.03.030The energy of cluster-heads is consumed rapidly because all cluster-heads directly sent data to sink in LEACH protocol. Aiming at this problem, this paper proposes a Wireless Sensor Network(WSN) routing protocol based on Ant Colony Algorithm(ACA) with energy forecast. As the ant colony algorithm, cluster-head sent data to sink by multiple hops transmission, the new algorithm predicts energy consumption of nodes when it calculates probability of next-hop. Simulation results show that the new algorithm can avoid route over-concentration, reduce cluster-heads energy consumption, and prolong the network lifetime.
-
Computer Engineering. 2012, 38(3): 91-92,96. https://doi.org/10.3969/j.issn.1000-3428.2012.03.031In cooperative frequency spectrum sensing, signal detection for single user will influence united detection performance a lot because of different environment. Aiming at the problem, according to the Signal-to-noise Ratio(SNR) of cognitive node, this paper proposes a new cooperative sensing method, which can dynamically adjust threshold. Simulation results illustrate that in the same false alarm probability, the method can significantly improve the united detection probability and reliability of frequency spectrum detection.
-
Computer Engineering. 2012, 38(3): 93-96. https://doi.org/10.3969/j.issn.1000-3428.2012.03.032In order to reduce the interference caused by Cognitive User(CU) to Primary User(PU) while guaranteeing the Quality of Service(QoS) demands for all services, this paper proposes a packet schedule algorithm based on interference control. It is suitable for the Cognitive Radio Network(CRN) with spectrum underlay sharing. The algorithm improves the Modify Largest Weighted Delay First with Interference Mitigation (MLWDF-IM) algorithm, defines the Interference Control Factor(ICF) and Service Urgency Function(SUF) to design schedule strategy. Simulation results show that the proposed algorithm can improve the QoS for all services with only a limited decline in the interference performance.
-
Computer Engineering. 2012, 38(3): 97-99. https://doi.org/10.3969/j.issn.1000-3428.2012.03.033Existing scheduling algorithms have the problems of large energy consumption and high latency for data collection. So this paper proposes an energy-efficient algorithm called Contiguous Node Data Aggregation Scheduling(CNDAS), which generates a collision-free schedule by computing nodes’ competitor sets. It assigns sibling nodes consecutive time slots to reduce the frequency of state transitions and to reduce the energy consumption of sensor nodes. Simulation results show that CNDAS outperforms SCHDL algorithm when the network scale is large.
-
Computer Engineering. 2012, 38(3): 100-103,115. https://doi.org/10.3969/j.issn.1000-3428.2012.03.034Based on correlation matrix method, Multiple-input and Multiple-output(MIMO) channel coefficient matrix can be obtained by calculating the correlation coefficient between two antennas and MIMO correlation matrix. The steering vector and beam-forming vector of Smart Antenna(SA) are added to the MIMO channel coefficient matrix to form MIMO/SA channel matrix, so that MIMO/SA multi-antenna space-time channel is modeled. A channel simulation platform is established to simulate and analyze MIMO/SA channel in time domain, frequency domain and space domain. Simulation results show that the model has a good channel directivity gain and the channel properties in space, time and frequency meet the demands of 3GPP TR 25.996, and it is useful for designing and optimizing MIMO/SA multi-antenna system and the analysis of channel capacity.
-
Computer Engineering. 2012, 38(3): 104-106,118. https://doi.org/10.3969/j.issn.1000-3428.2012.03.035For the problem of load balance in Wireless Sensor Network(WSN), based on the Geographic Adaptive Fidelity of Hierarchical Structure(GAFH) algorithm, the Geographic Adaptive Fidelity of Hierarchical Honeycomb structure(GAFHH) algorithm is proposed for WSN. The nodes belong to several adjacent honeycomb grids construct a cluster in GAFHH, and each grid is unified numbered according to its position in the cluster. Selecting a middle grid as an active grid in each cluster, and adopting the principle of maximum residual energy to select a node as a cluster head in each active grid. And all cluster heads construct the backbone network of wireless sensor network is using of communicating. At the beginning of the next round, re-selecting the active grid, and moving the boundaries of each cluster to make the active grid is always in the center of the cluster. Simulation results show that the load balance and throughput of GAFHH is superior to the GAFH.
-
Computer Engineering. 2012, 38(3): 107-109. https://doi.org/10.3969/j.issn.1000-3428.2012.03.036Genetic Algorithm(GA) and adaptive GA often trap into local optimum when they are used in optimizing the system utility of Cognitive Radio(CR) network. By introducing the Euclidean distance reflecting characteristics of genes, this paper improves GA, and proposes a spectrum allocation scheme with system utility maximization. Experimental results prove that compared with traditional GA and adaptive GA, the scheme proposed has better performance.
-
Computer Engineering. 2012, 38(3): 110-112. https://doi.org/10.3969/j.issn.1000-3428.2012.03.037For the existing content extraction signature scheme, because calculated bilinear pairings caused the problem of low efficiency, based on certificateless thinking, this paper proposes an efficient content extraction signature scheme without pairings. Scheme of binding techniques, use hash functions will the public key binding to the partial private key generates and signature algorithms, reduce the possibility of public key substitution attack, and in the random oracle model proved scheme is existentially unforgeable under adaptive chosen-message attacks assuming. Compared with known solutions, the efficiency is higher.
-
Computer Engineering. 2012, 38(3): 113-115. https://doi.org/10.3969/j.issn.1000-3428.2012.03.038For improving the transparency of embedding watermark into 3D mesh model, an adaptive watermark intensity adjusting algorithm based on local geometric features of mesh model is proposed. Mesh model is partitioned into some local area first, and embedding intensity is adjusted according to fluctuation of local geometric features. Evaluation of geometric error and evaluation of visual distortion are both adapted to test the performance of the algorithm. Experimental results show that, compared with the non-adaptive technique, the proposed adaptive technique can improve transparency of watermark effectively both in object evaluation and in subject evaluation.
-
Computer Engineering. 2012, 38(3): 116-118. https://doi.org/10.3969/j.issn.1000-3428.2012.03.039An improved polynomial key predistribution scheme is proposed for clustered sensor networks. The communication keys among cluster head nodes are obtained according to the symmetric property of two-parameter 4th-order polynomial, which solves the threshold security problem and makes the node overheads lower. The communication keys between the cluster head node and its common nodes are built with little communication after all the nodes are deployed, the authentication mechanism guarantees the security during communication keys establishment. It indicates that the scheme appears to be connective and secure, simultaneously makes the overheads of nodes low. It is shown that addition and revocation of the nodes are feasible in the scheme.
-
Computer Engineering. 2012, 38(3): 119-120,123. https://doi.org/10.3969/j.issn.1000-3428.2012.03.040Aiming to satisfy identity management function requirements such as federal cross domain access, trust delegation and privacy protection, and the requirements of integration among different identity management systems, it proposes a general identity model in this paper. These models consist of global identifier, local identifier, temp identifier, access information set, credential set, attribute set and trusted domain set. Then the construction process of this model which includes two stages is shown, the collection of attributes and credentials, the update of trusted domains and access information is finished during these two stages. Application result shows that this model provides good support for current identity management systems to implement integration and identity protection.
-
Computer Engineering. 2012, 38(3): 121-123. https://doi.org/10.3969/j.issn.1000-3428.2012.03.041Based on Hoare logic and ANSI/ISO C Specification Language(ACSL) specification, this paper presents a formal verification system for cryptographic software, which is composed of program specification, inference rules, reliability strategy and verification module. It takes the software realization of RC4 algorithm in OpenSSL as an example, the functional correctness, safety properties and information flow security are tested and verified. Results show that this system can reduce the complexity of formal verification method and has a high level of automation.
-
Computer Engineering. 2012, 38(3): 124-125,129. https://doi.org/10.3969/j.issn.1000-3428.2012.03.042This paper analyzes the scheme proposed by Chen et al and presents an improved protocol based on quadratic residue and Hash function. In the improved protocol, random numbers are generated both by reader and tags. The transmitted information is encrypted by quadratic residue and Hash function. Analysis result demonstrates that the improved protocol not only can resist various attacks and ensure privacy, but also needs less computation and storage in the tags and server compared to other improved scheme.
-
Computer Engineering. 2012, 38(3): 126-129. https://doi.org/10.3969/j.issn.1000-3428.2012.03.043This paper proposes the decentralized secure distributed storage system. The privacy of data is fulfilled by the combination of public key system and symmetric key system. Symmetric key for data from different sources are different, hence encryptions can be implemented in a distributed way. The employment of decentralized erasure code, together with the distributed encryptions, makes possible the decentralization of the system. RS codes are used to store the encryption of symmetric keys, and the list decoding of RS codes ensures the robust. Analysis result shows that the computing efficiency of this system is higher.
-
Computer Engineering. 2012, 38(3): 130-133,136. https://doi.org/10.3969/j.issn.1000-3428.2012.03.044To meet the requirement of short communication time and real-time in Vehicular Ad Hoc Network(VANET), this paper designs a mechanism using compressed Bloom Filter mechanism, and realizes pseudonym-based malicious node detection in VANET. The mechanism can effectively reduce the data size of pseudonym set of malicious nodes and the exchanging information content in data updating process with lower false positive. Analysis results show that this method can reduce data transmission and correspondence expenses, and improve real-time of communication.
-
Computer Engineering. 2012, 38(3): 134-136. https://doi.org/10.3969/j.issn.1000-3428.2012.03.045In order to fit with the Peer to Peer Session Initiation Protocol(P2PSIP) security issues and its distributed characteristics, this paper proposes an authenticable key agreement scheme for P2PSIP by using identity-based cryptography, and analyzes its security, efficiency and key escrow problem. This scheme provides mutual-authentication and key agreement in the process of P2PSIP call, ensuring the security of P2PSIP communication, and avoiding the disadvantage of Public Key Infrastructure(PKI).
-
Computer Engineering. 2012, 38(3): 137-138. https://doi.org/10.3969/j.issn.1000-3428.2012.03.046An efficient biometrics-based mutual authentication scheme is proposed, which is based on personal biometrics, one-way Hash function and smart card. For enhancing the system security, a one-time key is generated by using the timestamp. In the scheme, the authentication process can resist all known attacks including replay attacks and the DoS attacks, and needs only twice online message transmissions. Analysis shows that the scheme is secure and effective.
-
Computer Engineering. 2012, 38(3): 139-140,144. https://doi.org/10.3969/j.issn.1000-3428.2012.03.047To solve the contradiction that current signature schemes can not protect the benefits of proxy signer and message owner at the same time, a blind proxy blind signature scheme without trusted party base on elliptic curve is presented. It hides both the identity of the proxy signer and the message to be signed. The property analysis shows that the proposed scheme satisfies the security properties of proxy blind signature and blind proxy signature scheme. It can effectively protect the proxy signer and user’s identity privacy and prevents abusing signature. It also has a higher safety and efficiency compared with other schemes.
-
Computer Engineering. 2012, 38(3): 141-144. https://doi.org/10.3969/j.issn.1000-3428.2012.03.048This paper presents an impossible differential cryptanalysis of 13-round CLEFIA-128 no whitening key, which use the 9-round impossible differential. In the process of cryptanalysis, it guesses each key and filter the data pairs using the output and input differences of S-box. It utilizes the keys relations to reduce the number of guessed keys, and introduces the early abort technique to reduce the time complexity. Computing result shows that the complexity of the cryptanalysis is about 2120 data and 2125.5 encryptions
-
Computer Engineering. 2012, 38(3): 145-147,162. https://doi.org/10.3969/j.issn.1000-3428.2012.03.049This paper focuses on the protection problem of private information in data mining, and proposes multi-dimensional sensitive k-anonymity privacy protection model. Sensitive attribute leakage problems are divided into general leakage similar leakage, multi-dimensional independent leakage, cross leakage and multi-dimensional mixed data leakage. On the basis of k-anonymity, the similarities of multi-dimensional sensitive attribute are marked by clustering features. The model searches for anonymous records, computes the similarities between the remained records and grouped records, and generalizes the dataset satisfied to the anonymous model. The dataset is released. Experimental results show that the model is appropriate for the multi-dimensional sensitive data, and can prevent privacy leaking and have good data availability.
-
Computer Engineering. 2012, 38(3): 148-149,165. https://doi.org/10.3969/j.issn.1000-3428.2012.03.050In the available weighted secret sharing scheme, only one secret can be shared in one sharing session. A weighted threshold multi-secret sharing scheme is proposed. By using the Chinese remainder theorem, many secrets mapping to one parameter is presented, when the sum of weights of the participants is as big as or bigger than the threshold value, they can recover the secret. Analysis shows that the proposed scheme is secure and has advantages of less communication.
-
Computer Engineering. 2012, 38(3): 150-152,168. https://doi.org/10.3969/j.issn.1000-3428.2012.03.051This paper proposes the research of the security situational awareness system, aiming at solving the risk existed in the LAN and the bottleneck problem of United Threat Management(UTM). For the first time, it brings forward security situational awareness system architecture in the LAN combining UTM. The main security index is acquired through the DEMATEL method and the situational measurement model is built by adopting the fuzzy comprehensive evaluation algorithm. The threat measurement model is constructed to compute the threat degree in the LAN based on the security index and situational measurement model. The result proves that the system can analyze the security situation accurately and make the UTM strengthen the network security.
-
Computer Engineering. 2012, 38(3): 153-155. https://doi.org/10.3969/j.issn.1000-3428.2012.03.052This paper proposes a safety and high-efficiency improved strategy for WAPI. It introduces the WAI access identify mechanism and its formalization description. According to RSA algorithm and public key authentication framework, it improves the key authentication system, discusses the certificate authentication and key agreementconsultation process, and analyzes the security and efficiency of improved WAPI. Analysis results show that this strategy can realize authentication and key agreement process organic union, and resist the replay attack.
-
Computer Engineering. 2012, 38(3): 156-158. https://doi.org/10.3969/j.issn.1000-3428.2012.03.053This paper proposes a fracture surface matching algorithm based on integral invariants. Through comparing feature point’s multi-scale volume integral invariants, it obtains initial matching point pairs and discard outliers. According to the similarity of surface patches based on compatibility constraint, it gets small and efficient matching point pairs. It calculates every 3D space transformation set which makes the normal vectors to the same one. A two level voting scheme based geometric hash is employed to find out optimal transformation. Experimental results show this algorithm can realize full and partial matching of fracture surface.
-
Computer Engineering. 2012, 38(3): 159-162. https://doi.org/10.3969/j.issn.1000-3428.2012.03.054Aiming at the application of planetary rover vision system, this paper proposes a stereo matching algorithm. It uses Census transformation to get a group of binary code flow, gets through the colour weight and distance weight to complete weight calculating, and uses the method of double channel to accumulate the matching the price. Experimental results show that this algorithm can process 23 frames stereo images per second at 100 MHz, and the average error rate is lower than 6%.
-
Computer Engineering. 2012, 38(3): 166-168. https://doi.org/10.3969/j.issn.1000-3428.2012.03.056This paper proposes the classification algorithm of fast iterative reweighted q-norm regularization Least Squares Support Vector Machine(LS SVM). The proposed algorithm can select q value via cross-validation, where 0
