Author Login Editor-in-Chief Peer Review Editor Work Office Work

20 August 2012, Volume 38 Issue 16
    

  • Select all
    |
    Networks and Communications
  • WANG Jie-Hui, JIANG Wei
    Computer Engineering. 2012, 38(16): 1-4. https://doi.org/10.3969/j.issn.1000-3428.2012.16.001
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    In order to extract the complicated features for online reviews sentiment analysis, an online reviews sentiment analysis model based on rough sets is presented. It analyzes the traditional word bags features, and the regular collocation features are confirmed to play important role in identifying the reviews sentiment. The regular collocation features as rough rules extracted are incorporated into the sentiment analysis model, and the results on real hotel online reviews show the performance improvement under both Support Vector Machine(SVM) model and Naive Bayes model.

  • WANG Sai-Wen, GU Ke-Bin, WANG Chun, LIU Wei
    Computer Engineering. 2012, 38(16): 5-8. https://doi.org/10.3969/j.issn.1000-3428.2012.16.002
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    This paper proposes a method of abrupt cut detection based on motion information. Quantitative angle histogram entropy and average magnitude are defined to be the metrics of frame differences from the motion vector filed calculated by block-based motion estimation. Adaptive threshold strategies are designed to identify candidate abrupt cuts. False cuts caused by flashes and gradual transitions are eliminated by using a temporal window. In the process of key frame extraction, different algorithms which have different limitations of the number of extraction are selected adaptively according to the extents of similarity of video frames content. Experimental results show that the method has high accuracy and robustness.

  • LIU Li-Li, XU Ai-Dong, SONG Yan, ZHOU E
    Computer Engineering. 2012, 38(16): 9-13. https://doi.org/10.3969/j.issn.1000-3428.2012.16.003
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    ISO14299 specifying unified diagnostic services and CAN based vehicle fault diagnostic protocol ISO15765 are introduced, and the relationship between ISO14229 and ISO15765 and the architecture of ISO15765 are analyzed. The overall design of the ISO15765 protocol stack is provided in the paper. The design of the ISO15765 protocol stack uses layered and interface method. Lower layers provides services to higher layers. Modular design is adopted for developing internal operation. Experimental results show that the protocol stack satisfies ISO15765 standard and general fault diagnosis requirements.

  • SHAO Yan-Ling, GE Bo, SONG Shu-Zhong
    Computer Engineering. 2012, 38(16): 14-17. https://doi.org/10.3969/j.issn.1000-3428.2012.16.004
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Isometric Projection(IsoP) algorithm aims at preserving the distance among samples at the most, without taking into account the sample class discriminant information. Aiming at this problem, a face recognition algorithm based on Discriminant Isometric Projection(DIsoP) is proposed. The algorithm is based on IsoP and the Maximum Scatter Difference Criterion(MSDC) is introduced to its objective function. Therefore, an optimal objective function is obtained. After being embedded into a low-dimensional subspace, the samples of same class maintain their intrinsic neighbor relations, whereas the neighboring samples of the different class are far form each other. Experimental results on ORL face database demonstrate the effectiveness of the proposed algorithm.

  • JIN Lei, XIE Wei-Kai, LIN Yi, LU Chen-Beng, SHEN Rui-Min
    Computer Engineering. 2012, 38(16): 18-22. https://doi.org/10.3969/j.issn.1000-3428.2012.16.005
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    H.264 encoder is a general video encoder with the highest compression efficiency. However, to apply it directly into real-time screen video encoding brings the problems, such as high CPU occupancy rate and ineffectiveness in limiting the peak bitrate. To solve the problems above, in one hand, it integrates a Mirror Driver-based changed region computation step into the classic H.264 encoder, X264. After that, it can find the unchanged macroblocks and then quick-find optimized prediction modes. On the other hand, it proposes an adaptive frame rate constant quantization parameter rate control algorithm, which limits peak bitrate by reducing the local frame rate. Experimental results show that the schema reduces CPU time by 30%, strictly controls the peak bitrate and finally achieves 3 dB~8 dB PSNR improvement.

  • CHU Yu-Chong, HE Hong, JIAN Kang, SHU Chen-Yang, FANG Chao
    Computer Engineering. 2012, 38(16): 23-26. https://doi.org/10.3969/j.issn.1000-3428.2012.16.006
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    From the view of computer vision, the particular quantitative analyses and evaluations about rotational, scale and affine invariance of standard model of object recognition in cortex are made based on textured images. The original textured images are scaled, rotated and affinely transformed respectively. Biological visual features of these transformed images, also called Standard Model Features(SMFs), are extracted by the standard model. The SMFs are used to classify the images. After classification, the area under curve is utilized to quantitatively analyze and evaluate whether the standard model has invariance or not. Compared with the Local Binary Pattern(LBP) feature, a great deal of experiments show that the biological visual features extracted by the standard model have superior scale, rotational and affine invariance to textured images.

  • BAI Yu, ZHANG Yao-Hua, ZHOU Yue-Zhi
    Computer Engineering. 2012, 38(16): 27-30. https://doi.org/10.3969/j.issn.1000-3428.2012.16.007
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    Existing research methods cannot fulfill the service selection or service composition according to user’s individual requirements. Aiming at this problem, this paper proposes a service composition algorithm based on service quality information. Through defining the matching degree of service interfaces and considering service quality information, it converts the degree of service composition into the weight of the edge in directed graph. The service composition problem converts into the shortest path problem. Analysis result of example is given to demonstrate the effectiveness of the algorithm.

  • XIE Dao-Wen, SHI Shi-Liang
    Computer Engineering. 2012, 38(16): 31-34. https://doi.org/10.3969/j.issn.1000-3428.2012.16.008
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    A new combination method called gray correlation analysis and multiple linear regression method is proposed to establish the optimized selection model of measuring points for rainfall. A practical case is given to prove the reasonability and feasibility of this optimized selection model, and six critical points are selected from twelve points. Result shows that this model is effective, reliable and feasible, by which critical points can be picked out optimally, and the interaction between measuring points can be removed, accordingly accuracy and robustness improve greatly.

  • LV Meng-Zhou, CHEN Yao-Wu
    Computer Engineering. 2012, 38(16): 35-39. https://doi.org/10.3969/j.issn.1000-3428.2012.16.009
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    H.264 video coding standard has high computing complexity, and is difficult to meet the high-definition video in real-time encoding. In order to solve this problem, this paper proposes a parallel coding algorithm on heterogeneous multi-core platform DM6467. By analyzing the dependence between different hardware accelerators and the characteristics of different levels of memory, a macroblock level parallel scheme is designed. Further optimization is carried out by merging the pipeline of adjacent slices and balancing the tasks assigned to Digital Signal Processor (DSP) and ARM cores. Experimental result shows that the efficiency is improved by 18%, and 1080P real-time H.264 video encoder can be realized on DM6467 platform.

  • LI Bing-Long, BAO Tie-Biao, WANG Lu, WANG Qing-Xian
    Computer Engineering. 2012, 38(16): 40-43. https://doi.org/10.3969/j.issn.1000-3428.2012.16.010
    Abstract ( ) Download PDF ( )   Knowledge map   Save

    File carving is the important techniques about digital crime forensic investigation. In order to acquire digital evidence from the destroyed disk media, a feature extracting algorithm about document fragment is proposed which can identify various document fragments about its entropy value. Based on this algorithm, fragment file carving algorithm is designed by combining the logic property of disk cluster. Results show that compared with other file carving algorithms, the algorithms can carve out more files.

  • ZHANG Juan, TONG Wei-Qi, CA Li-Zhi
    Computer Engineering. 2012, 38(16): 44-48. https://doi.org/10.3969/j.issn.1000-3428.2012.16.011
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Reusable and unified description criteria is the condition of test case reuse. This criteria gives the good reuse system to test cases. In order to increase the reusability of test cases, by following the principle of minimizing the composition of test case, this paper gives the concepts and formalized definitions of test item, test case, test case suite and test case library, etc. The formalized description to test cases in the test case library, by using Z specification, ensures the accurate and unambiguous to reusable test case library. Application result shows that the method can improve the test cases reusability.
  • LIU Gao-Song, MO Li-Yong, LONG Jun
    Computer Engineering. 2012, 38(16): 49-51. https://doi.org/10.3969/j.issn.1000-3428.2012.16.012
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to improve the query effeiciency of hybrid eXtensive Makeup Language(XML) document, this paper proposes a combined index technology based on inverted table and B+ tree. The DTD structure index and content index uses inverted table as index units, and XML document index takes B+ tree as the basic organization of its index. Identification information is set in node coding of DTD structure index, and it can help to determine the document which needs to query. And XML document hybrid query is achieved by establishing DTD structure index, XML document query and content index. Theoretical analysis and experimental results show that the proposed technology not only has lower space overhead, but also has higher index efficiency.
  • SUN Mao-Hua, JIU Huai-Kou, GAO Hong-Hao
    Computer Engineering. 2012, 38(16): 52-56. https://doi.org/10.3969/j.issn.1000-3428.2012.16.013
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper introduces theorem proving method and reverse engineering method to verify database interactions of Web application. Z specification considered as the requirement model is used to describe user’s requirements. According to the proposed transformation rules, abstract database interactions from source code of Web application as implementation model, then transform these codes to Z specification. Z/EVES is used to prove whether the implementation model conforms to its properties which are written as theorems. On this basis, it designs the verify framework for the proposed method and the prototype is developed. The library database management system shows the validity of this method.
  • SHEN Li-Min, GAO Ji
    Computer Engineering. 2012, 38(16): 57-60. https://doi.org/10.3969/j.issn.1000-3428.2012.16.014
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To reduce the size of test case and the cost of regression test, the paper presents an algorithm of the combination of Genetic Algorithm(GA) and Ant Colony Algorithm(ACA). It uses the GA to realize genetic operator operation, the result as ACA for initialization pheromone distribution. It uses ACA to update the ant path and pheromone transfer, and obtains the optimal solution of the problem. Experimental results show that the method can effectively reduce the test suite, shorten operating time, and improve the effectiveness of minimization.
  • SUN Xiao-Xing, YU Hui-Qun
    Computer Engineering. 2012, 38(16): 61-64. https://doi.org/10.3969/j.issn.1000-3428.2012.16.015
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at detecting the design faults at early development stage and reducing the overhead that N-version Programming(NVP) fault tolerance strategy may bring into a system, this paper proposes an aspect-oriented modeling method based on Hierarchical Colored Petri Net(HCPN). NVP is modularized into an aspect sub-module and woven into a final executable HCPN. An aspect-oriented NVP model is built through a case study of searching system using this method. Analysis result verifies the correctness and effectiveness of this NVP model.
  • QIN Huan-Hu, ZHANG Li-Fu, LIU Kai
    Computer Engineering. 2012, 38(16): 65-69. https://doi.org/10.3969/j.issn.1000-3428.2012.16.016
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On the basis of the GeoRaster data storage model, this paper makes use of the method based on procedure to create Import_Img_Data storage process, which through C# to import hyperspectral image effectively. The data acquisition method is transformed through dynamic data table, and it can acquire any pixel’s spectral information from GeoRaster, realize integration of picture and spectrum of hyperspectral data in the database. These two methods provide valid technology to support the implementation of hyperspectral image database.
  • LIN Xiu-Dan, MAO Guo-Jun
    Computer Engineering. 2012, 38(16): 70-73. https://doi.org/10.3969/j.issn.1000-3428.2012.16.017
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A density grid-based clustering algorithm is proposed, which is suitable for the distributed data stream environment. This algorithm updates the data streams quickly and reflects the change of data streams by grid space in local sites. Center site is responsible for collecting and merging the grid structures of all local sites. Then algorithm clusters and optimizes on the global grid structure to generate the global clustering pattern. Experimental results show that the algorithm can reduce network traffic and achieve higher global clustering qualities.
  • HU Jian-Zhen, JIAO Yang, DAN Jiu-Gong
    Computer Engineering. 2012, 38(16): 74-76. https://doi.org/10.3969/j.issn.1000-3428.2012.16.018
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the unauthorized access and unstable status of devices during the data synchronization process, data synchronization model with identity authentication and disaster backup function is presented. This model uses Eschenauer-Gligor(E-G) scheme to manage key while conducting authentication. Three roles, i.e. central synchronization, disaster backup synchronization and member synchronization devices existed in the synchronization network conform data switch with triggered update. Fetching main parameters of devices in the synchronization network, the model is calculated priority to elect backup synchronization device and perform seamless switch of different roles. Application result proves that the model is feasible.
  • LAI Meng-Zhu, DUAN Zhi-Ming, LIU Su-Yan, ZHANG Guo-Yi
    Computer Engineering. 2012, 38(16): 77-80. https://doi.org/10.3969/j.issn.1000-3428.2012.16.019
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper studies the problem of integrated simulation model in the process of collaborative simulation development of complex product. Buffer pool is put forward in the combined use of loose coupling and close coupling. With software bus of High Level Architecture(HLA), the definition criterion of software simulation model in multi-disciplinary is unified by using distributed database, program simulative database and XML technology, transformed model data between different software of the collaborative simulation are interacted. Database and file storage provide a moderating effects in the collaborative simulation processes. Service-oriented Architecture(SOA) is used to construct the sub-module, and simulation software in various fields is loosely coupled to collaborative simulation platform. An example of electromechanical simulation of thermal control mechanism is compared between the centralized simulation and the collaborative simulation. Result shows that the method improves the simulation speed and accuracy.
  • WANG Shen, QI Feng-Bin, GU Hong-Feng, BO Chi
    Computer Engineering. 2012, 38(16): 81-84. https://doi.org/10.3969/j.issn.1000-3428.2012.16.020
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Based on the most time consumption consists of decomposition, update and backward substitution, this paper proposes a Linpack parallel performance model about matrix scale, network bandwidth, triangle equation solution efficiency and matrix multiplication efficiency for quickly predicting the Linpack parallel performance. It validates this model on the Sunway Bluelight and Sunway 4000A. Results testify the creditability of the model, and show it can well estimate main factors to change the influence of Linpack parallel performance, especially at the massive matrix scale, the error is less than 1%.
  • LI Gong, SONG Shun-Lin
    Computer Engineering. 2012, 38(16): 85-87. https://doi.org/10.3969/j.issn.1000-3428.2012.16.021
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    There are always some coverage holes, due to energy exhausting and random deployment in the Wireless Sensor Network(WSN). The existing of coverage holes decreases the coverage and connection of the network and severely influences the performance. This paper constructs a sensor network model with a mixture of mobile and static sensor nodes to solve this problem, and proposes a recovery algorithm of coverage hole in WSN based on distribution. The algorithm adopts the basic principle that the static sensor nodes guide mobile sensor nodes to reach the “optimum” position and recover the coverage holes. Simulation experimental results show that the algorithm achieves a suitable trade-off between the coverage and sensor cost.
  • DUAN Hao-Yu, LI Ou, HU Bin-Feng, LIU Xiang
    Computer Engineering. 2012, 38(16): 89-92. https://doi.org/10.3969/j.issn.1000-3428.2012.16.022
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a selective combining modulation recognition method for Wireless Sensor Network(WSN), in which the performance of multi-node combining modulation recognition is not increasing with the number of the nodes. The preparing conditions of combining modulation recognition based on voting algorithm and weighted voting algorithm are presented. And the nodes are selected according to the conditions. Combining modulation recognitions are processed by using the SNR as the weights of the nodes. Simulation results show that this method has an effective improvement in recognition performance in not too much increasing network communication load.
  • GUO An-Meng, ZHONG Dun
    Computer Engineering. 2012, 38(16): 93-95. https://doi.org/10.3969/j.issn.1000-3428.2012.16.023
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the phenomenon of the energy hole greatly reduces the lifetime of Wireless Sensor Network(WSN), constrains the application of WSN in the linear region of monitoring. This paper proposes a program of node non-uniform arrangement scheme. The arrangement of the nodes in the different areas uses the limit for the node number way, makes point number from outside to inside increase according to the sequence, and arranges randomly a certain number of relay node to forward packets. Simulation experimental results show that this scheme can realize subprime network energy consumption equilibrium, prolong WSN system life cycle.
  • GUO Lei, WANG E-Di, CHEN Shu-Qiao, SHU Ke, HAN Ji-Gong
    Computer Engineering. 2012, 38(16): 96-99. https://doi.org/10.3969/j.issn.1000-3428.2012.16.024
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a characteristic selection algorithm based on information metric, which includes coarse grain selection and fine grain selection. The coarse grain selection calculates the cross-entropy between different characteristics and different business categories, and chooses the most representative characteristics using in flow classification. The fine grain selection calculates the consistency between characteristics to eliminate redundant characteristics. Experimental result shows that, when the characteristics selected in the proposed algorithm are used in data flow classification, the precision rate and recall rate are higher than the other similar algorithm, and this algorithm has lower complexity.
  • KONG Fan-Feng, CHEN Xi, OU Gong-Yu, CAO Dui
    Computer Engineering. 2012, 38(16): 100-103. https://doi.org/10.3969/j.issn.1000-3428.2012.16.025
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the load uneven problem in clustering Wireless Sensor Network(WSN), this paper presents an uneven clustering algorithm for achieving load balancing in WSN. The algorithm computes optimal network cluster numbers based on the uneven cluster, and adjusts the ownership of the node to form an appropriate architecture of the network topology. Simulation experimental results show that the algorithm can effectively balance the load of nodes, reduce the energy consumption and prolong the network lifetime.
  • FENG Jiang, TUN Chun-Chun
    Computer Engineering. 2012, 38(16): 104-107. https://doi.org/10.3969/j.issn.1000-3428.2012.16.026
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents a Multi-hop and Clustering Routing algorithm based on Energy Optimized(EOMCR) for Wireless Sensor Network(WSN). It selects the cluster head nodes based on the energy factor and the ratio of energy consumption. Common node chooses a cluster to join in based on the composite distance. A cluster head node transports data to the other cluster head by the pattern of multi-hop routing. Experimental results show that the new algorithm prolongs the lifetime of WSN, compared with LEACH and other protocols, the duration of the stable phase is increased by 41%~146%, the number of the rounds of the MND phase is increased by 70.6%~239.7%, the total energy consumption of the network is reduced by 48.1%~62.2%, and it has higher feasibility and stability.
  • YAN Huan-Jie, XU Ming-Hai, GU Hai
    Computer Engineering. 2012, 38(16): 108-112. https://doi.org/10.3969/j.issn.1000-3428.2012.16.027
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Current content adaptation technology based on single network or terminal at present doesn not take network business model presenting now and future into account. Content adaptation service, which is pushed by the mismatch between capabilities of devices and multimedia content/service, is brought into academic and industry. This paper proposes a new content adaptation service which is oriented to the multi-network and multi-terminal cooperative. It divides multi-network and multi-terminal into single network single terminal, single network multi-terminal and multi-network single terminal based on ontology modeling technology, and accomplishes the content adaptation service using two-hierarchy decisions——logic decision and physical decision, and the transition from single network single terminal to multi-network multi-terminal. Application results show that the content adaptation model can solve the mismatch between capabilities of terminals and multimedia content/service.
  • XIANG Hui, BANG Li, WEN Ji-Wei
    Computer Engineering. 2012, 38(16): 113-116. https://doi.org/10.3969/j.issn.1000-3428.2012.16.028
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To deal with the problem of the short lifespan, which is caused by redundant coverage and unbalanced residual energy. This paper presents a target coverage algorithm for the coverage process in visual sensor networks. Based on the inner connection between the nodes and targets, this algorithm employs relational matrix to excavate the frequent coverage set for the targets. Moreover, the sets of work nodes are elected dynamically with the aim to extend the lifespan of the network. Experimental results show that the algorithm efficiently dispatches the work nodes under the premise of the quality of coverage. Meanwhile, it effectively balances energy consumption of the nodes and increases the lifespan of the network.
  • SU Xiao-Yan, WU Dong-Yang, LIU Long, HAN Yu-Xiang
    Computer Engineering. 2012, 38(16): 117-120. https://doi.org/10.3969/j.issn.1000-3428.2012.16.029
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Currently there are no generic tools which can completely disassemble and debug Cisco Internetwork Operating System(IOS). This paper targets protocols Cisco routers support as vulnerable, and uses Fuzzing technology for security testing to mine vulnerabilities in the system. By combining characteristics of IOS structure, storage management and process scheduling, it designs and implements an automated vulnerability mining tool named CFuzzer, and uses it for IOS security tests for several protocols. Experimental results show that CFuzzer can provide effective security protection for Cisco routers.
  • ZHOU Jian, LI Shun-Dong, XUE Dan
    Computer Engineering. 2012, 38(16): 121-123. https://doi.org/10.3969/j.issn.1000-3428.2012.16.030
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper focus on the algorithm to reduce the number of multiplication for two numbers and thus reduces the computational complexity from O(n) to O(1). According to different addition operation methods, two improved algorithms(ie. cumulative sum and uniform sum) are introduced and their time-cost is compared with that of the current large integer multiplication algorithm.
  • XU Shuai-Wen, WANG Xiao-Meng
    Computer Engineering. 2012, 38(16): 124-126. https://doi.org/10.3969/j.issn.1000-3428.2012.16.031
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the problem that the self-healing scheme can not recover the more than once previous session keys and the last key, this paper proposes a new mutual-healing key distribution scheme based on access polynomial for mobile Ad Hoc network. The proposed scheme adopts access polynomial and dual directional chains technologies to provide self-healing and mutual-healing through the neighbour nodes. The performance analysis result shows that the proposed scheme achieves forward security, backward security and the resistance to the coalition of any size.
  • JIANG Hua, HU Dan-Dong
    Computer Engineering. 2012, 38(16): 127-129. https://doi.org/10.3969/j.issn.1000-3428.2012.16.032
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The processing ability and response speed of the wireless communication terminals are limited, common signatures become the bottleneck to the development of the wireless networks. For that problem, the certificateless on-line/off-line blind signature is given in this paper which incorporates with the optimal on-line/off-line signature. Most computations are finished before the blind message is given, after that, only a few operations are needed. Results of performance analysis show that the signature scheme can be applied to the wireless network, and it can protect the users’ privacy efficiently.
  • WANG Xi, ZHANG Bin
    Computer Engineering. 2012, 38(16): 130-133. https://doi.org/10.3969/j.issn.1000-3428.2012.16.033
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problem of security threat spread in Security Assertion Markup Language(SAML) Single Sign-on(SSO), an user-centric SSO protocol based proxy signature is presented in this paper. An access control mechanism is added to the protocol, which restricts the scope of services being visited by user and limits time span that user can access. Security is analyzed in random oracle model, and results show that this protocol can resist the replay attack of identity notes and access token.
  • GUO Ling-Ling, LIN Chang-Lou, ZHANG Qing-Yuan
    Computer Engineering. 2012, 38(16): 134-137. https://doi.org/10.3969/j.issn.1000-3428.2012.16.034
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    For the security problem, which is insecure against public-key replacement attack, on the certificateless signature scheme proposed by Su et al.’s, this paper proposes an improved certificateless signature scheme. The proposed scheme simplifies the process of verification. Analysis results show that the improved scheme is secure against public-key replacement attack and is provably secure against existential forgery under adaptively chosen message attack in the random oracle model.
  • FENG Dun, WANG Jian
    Computer Engineering. 2012, 38(16): 138-141. https://doi.org/10.3969/j.issn.1000-3428.2012.16.035
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Because of the shortcoming of permission control and separation of duties in T-RBAC, an improved model is proposed. New model simplifies the task classification of T-RBAC, adds context and state property to task, and builds a close relationship between permissions granting and the task context and state property, which enhances the dynamic management of permissions. It also solves the problem of mutually exclusive rights possessed by one role while inherited in roles hierarchy using private roles, and ensures the dynamic separation of duties by checking the history of task performance. New model provides a better permissions management, and better meets the separation of duties and least privilege principles.
  • ZHOU Fa-Wang, SHI Zai-Feng, GUO Wei, LIU Rui
    Computer Engineering. 2012, 38(16): 142-144. https://doi.org/10.3969/j.issn.1000-3428.2012.16.036
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A configurable and high parallelism Elliptic Curve Cryptography(ECC) processor over GF(p) to compute point multiplication is proposed based on Transport Triggered Architecture(TTA). The processor can be extended for the different requirement of security by configuring special function units, bus and register files. The Very Long Instruction Word(VLIW) instruction format makes the processor gain the high parallelism. An especial Function Unit(FU) named Montgomery Multiplier Accumulators Unit(MMAU) is designed to accelerate the implementation of the modular multiplication. With a 0.18 μm CMOS cell library, the processor uses 83 Kgates and achieves 0.425 μs for a modular multiplication and 2 ms for a point multiplication over GF(p) at 120 MHz when the key length is 192 bit.
  • MA Dan-Dan, ZHANG Chao-Ai
    Computer Engineering. 2012, 38(16): 145-148. https://doi.org/10.3969/j.issn.1000-3428.2012.16.037
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper uses Cyclic Redundancy Check(CRC) check and deformation Rabin algorithm, proposes a Radio Frequency Identification (RFID) mutual authentication security protocol based on deformation Rabin algorithm. The protocol can prevent on location privacy attack, retransmission attack, eavesdropping attacks and dis-synchronization attack. By reducing the count of searching back-end database and avoiding the complex Hash calculation, it has high efficiency. Performance analysis shows that its hardware complexity is relatively low, applicable to low cost tag.
  • CHEN Hui-Yan, LI Wei, SU Yan-Fang
    Computer Engineering. 2012, 38(16): 149-152. https://doi.org/10.3969/j.issn.1000-3428.2012.16.038
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a new Certificate-based Proxy Ring Signature(CB-PRS) scheme against the problems of key escrow and private key distribution existing in the ID-based proxy ring signature scheme. It analyzes and concludes that the scheme possesses the properties of correctness, unforgeability, unconditional anonymity and indistinguishability in random oracle model. Compared with the existing schemes, the scheme has higher efficiency because the bilinear operation makes the computational complexity reduced to O(1) from O(n).
  • LIN Dong-Mei
    Computer Engineering. 2012, 38(16): 153-156. https://doi.org/10.3969/j.issn.1000-3428.2012.16.039
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    An extended rational secret sharing mechanism using non-simutaneous communication channels is proposed in order to avoid empty threat when players alternately take actions. To refrain effectively the dishonest behavior, reputation utility values are introduced into the new mechanism. Analysis results indicate that there is a sequential equilibrium to guarantee that players can realize secret sharing without deviating from the sequential equilibrium.
  • WANG Zheng-Yu, XIAO Na-Feng
    Computer Engineering. 2012, 38(16): 157-160. https://doi.org/10.3969/j.issn.1000-3428.2012.16.040
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper uses fuzzy integral to complete the information fusion of member classifier in ensemble neural network. A more effective fuzzy density function using in fuzzy integral is proposed. Two spirals classification is regarded as experiment object. Ensemble neural network is used to realize the classification method which has better correct rate. Simulation experiments are done to analyze the validity of neural network and different parameters. And experimental data proves the new fuzzy density function is more effective.
  • ZHANG Li-Dong, GU Lei, SHU Wen-Xin
    Computer Engineering. 2012, 38(16): 161-163. https://doi.org/10.3969/j.issn.1000-3428.2012.16.041
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The driver’s sensitivity factor in former Optimal Velocity Model(OVM) is always constant, which does not fully comply with realistic traffic flow characteristics. To gain a more realistic and objective model, a kind of probability distribution driver sensitivity OVM, i.e. PDDS-OVM is studied. In the model, the constant driver’s sensitivity is substituted with probability distribution function, and each car driver in the queue matches a probability value. With Matlab7.0 platform, three kinds of simulations are made, in which the driver’s sensitivity is fixed value, mean distribution value, and normal distribution value. The simulation after many times shows that the PDDS-OVM model is more realistic than traditional ones, and can better describe the dynamics and complexity of traffic flow.
  • HONG Wei-Han, TANG Hua-Wen, DENG Yi-Gui
    Computer Engineering. 2012, 38(16): 164-166. https://doi.org/10.3969/j.issn.1000-3428.2012.16.042
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    It is difficult to model with the conditional independence assumptions of Naive Bayes(NB) method and the small training set of Bayes Network Augmented Na?ve Bayes(BAN) approach. In order to solve this problem, a new classification method is proposed in this paper. This is a combined traffic classification based on instance-based learning. It constructs a separate NB and BAN classifiers and obtains each classifier weight according to the validation set. It obtains the classification of network traffic through weighted average combination of classifier output. Using Moore data set as the experimental data, results show that the ensemble learning method rather than NB method and BAN method has higher classification accuracy and stability.
  • FENG Jin-Mei, ZHENG Xiang-Wei, WANG Zhi-Hao
    Computer Engineering. 2012, 38(16): 167-169. https://doi.org/10.3969/j.issn.1000-3428.2012.16.043
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A double population particle swarm optimization with adaptive diversity preservation is proposed considering the population diversity in dynamic environment. The ranger idea of group search is introduced to particle swarm optimization, where subswarm B updates its speeds and positions with different methods according to the diversity of particle swarm and subswarm A and B exchange their optima. These mechanisms extend the search range and improve the swarm diversity. The scheme is tested on benchmark functions with dynamic complex changes and the simulation results show the proposed algorithm is effective in dynamic environments. It is also used to simulate group following behavior.
  • ZHENG Cheng, LIU Fu-Jun, LI Qing
    Computer Engineering. 2012, 38(16): 170-173. https://doi.org/10.3969/j.issn.1000-3428.2012.16.044
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    There are some problems should be considered in automatic extraction of traditional methods: Conference relations in the result of automatic extraction are not clear, some relationships between obvious structures of paragraphs and the theme of the text are not paid enough attention. For which, this paper presents a method based on anaphora resolution and text structure analysis, which combines the traditional statistics with regulars on automatic abstract. This method applies limited knowledge to pronoun resolution, which is to solve the problem of semantic incoherence, also to improve the precision when computing sentences’ weight. Based on sequential paragraphic similarity, this method can recognize obvious topics to partition text. Experimental results show that this method improves precision and recall when it is applied for limited-financial field.
  • CHEN Ji, HOU Hai-Liang, LUO Liang-Cai, CHENG Yun
    Computer Engineering. 2012, 38(16): 174-177. https://doi.org/10.3969/j.issn.1000-3428.2012.16.045
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Although most existing heart sound detection algorithms perform well in normal signals, they usually have no effect on abnormal signals. In this paper, an algorithm based on double-threshold method is proposed for robust detection of the first heart sound(S1) and second heart sound(S2). The original Heart Sounds Signal(HSS) is preprocessed by filter based on Hamming window. The envelope of heart sounds is extracted by improved Hilbert Huang Transform(HHT) and segmentation of heart sounds is realized by double-threshold method. The first and second heart sound are recognized automatically by clinic knowledge. Reliability of this proposed approach is confirmed through identification of S1 and S2 on several normal and abnormal heart sounds.
  • LIN An-Feng, SHU Gong, FAN Cai-Xia, ZHANG Er-Hu, LUO Lei
    Computer Engineering. 2012, 38(16): 178-181. https://doi.org/10.3969/j.issn.1000-3428.2012.16.046
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In unsupervised feature selection for clustering, the local topology of spectral clustering is usually built by Euclidean distance, which can even scramble the local topology in the small local. The scrambling topology can degrade the performance of the clustering. In this paper, Grassmann Multi-cluster Feature Selection(MCFS) algorithm is proposed to solve the problem. The tangent space of the data is approximated by local principal component analysis, which represents the main variation direction of the local data and filters the influence of the scrambling points generated by Euclidean distance. Via constructing Grassmann manifold in the tangent space, the geodesic distance of Grassmann manifold can preserve the topology structure of the local data. The topology of the manifold is approximated by L1 norm optimization, and the feature subset of original features is selected. Experimental result proves the validity of this algorithm.
  • WU Shu-Ti, TU Jie, FAN Xiao-Beng
    Computer Engineering. 2012, 38(16): 182-184. https://doi.org/10.3969/j.issn.1000-3428.2012.16.047
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Considering the heterogeneity of Peer-to-Peer(P2P) users habit and runtime environment, this paper proposes a two-layered model of P2P traffic identification to identify and filter the P2P traffic. It combines both an identification algorithm of Bayesian network based on single traffic feature method and an identification algorithm of Support Vector Machine(SVM) based on multi-traffic behavior method. Experimental results show that the method is 5.4% more accurate than the statistical feature identify method, and it has better stability in different application scenes.
  • LIN Feng, ZHANG Chao, LI Zhu-Liang, DIAO Yu-Meng
    Computer Engineering. 2012, 38(16): 185-188. https://doi.org/10.3969/j.issn.1000-3428.2012.16.048
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at human body recognition problem, this paper proposes a human body part recognition system, which is based on depth image learning. It constructs depth image sample library, including training set and testing set, extracts local gradient feature from training samples, uses random forest to learn the classifier for separating each single points going through the image and computes each joint point of human body. Experimental result shows that the system can recognize different human body parts fast and accurately.
  • YIN Chun-Xia, XU De, LI Cheng-Rong, LUO Yang-Yu
    Computer Engineering. 2012, 38(16): 189-191. https://doi.org/10.3969/j.issn.1000-3428.2012.16.049
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Image matching based on Scale Invariant Feature Transform(SIFT) feature is time-consuming, and there are always a large number of feature points. By introducing salient map into feature extraction and image matching, a new SIFT feature detection and matching method is put forward. Salient computing models are compared, and an efficient spectral residual method is selected to compute the salient map. Then the salient map is processed with binarization and morphology to get regular salient area. SIFT features are detected and matched just in the salient area instead of in the whole image. Experimental results show that the proposed method is much faster and the features in salient area are more stable.
  • CA Lian-Fang, TIAN Hua-Min
    Computer Engineering. 2012, 38(16): 192-195. https://doi.org/10.3969/j.issn.1000-3428.2012.16.050
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the limitation of the noise-free assumption in conventional Independent Components Analysis(ICA) methods, a noisy ICA method based on cross-cumulants is proposed. Considering the instantaneous mixture model with Gaussian noise, the cross-cumulants of observed signals are used to make up a set of symmetric matrixes. The joint diagonalization of those matrixes is utilized as the objective function, and the mixing matrix is optimized by particle swarm optimization. Through the estimated mixing matrix, the noisy ICA is converted to one-dimension underdetermined ICA, and the estimations of source signals can be obtained by singular value decomposition. Simulation results illustrate that, in contrast to the conventional ICA methods, the method proposed can get a more accurate estimation of the mixing matrix, and obviously improve the signal-to-noise ratio.
  • LIANG Zhi-Gang, HENG Gao
    Computer Engineering. 2012, 38(16): 196-199. https://doi.org/10.3969/j.issn.1000-3428.2012.16.051
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    On-board pedestrian detection needs processing scenarios from a mobile platform, which implies environments change quickly. And the aspects of pedestrian are inconstant, which makes detection difficult. Many approaches based on machine learning use a large number of features which need much computing time. To improve the problem, this paper provides an improved camera pose estimation method for adaptive sparse image sampling, and a classifier based on Haar-like wavelets and Real AdaBoost as learning machine. It compares the proposal with relevant approaches, experimental results show that the method reduces processing time much a lot for the image sampling.
  • XU Jin-Xia, SHANG Yong-Li, HU Jing-Min, DIAO Qian
    Computer Engineering. 2012, 38(16): 200-202. https://doi.org/10.3969/j.issn.1000-3428.2012.16.052
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a particle filtering algorithm based on hybrid proposal distribution of adaptive optimization. Based on performance analysis of particle filter with different proposal distribution, hybrid proposal distribution is used to consider the current latest observational information. Annealing parameter factor is utilized to adjust the mix ratio of state transition prior distribution and likelihood proposal distribution in hybrid proposal distribution. By the analysis of hybrid proposal distribution with fixed annealing parameter optimization, adaptive parameter optimization mechanism is combined in above hybrid proposal distribution to dynamically adjust the annealing parameter. With the simulation program of object tracking, the performance of proposed particle filtering algorithm is evaluated and its validity is verified.
  • JI Su-Qin, DAN Hong-Bei, WEI Ji
    Computer Engineering. 2012, 38(16): 203-206. https://doi.org/10.3969/j.issn.1000-3428.2012.16.053
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the problem that the classification is difficult on massive text data under the framework of a centralized system, this paper proposes a Bagging Bayes text classification algorithm based on Map Reduce. It introduces the Naive Bayes text classification algorithm. Combined with the Bagging algorithm, it uses Map Reduce parallel programming model to realize the algorithm on Hadoop platform. Experimental results show that this algorithm can be used in the classification of large-scale text data sets, have good accuracy and short running time.
  • ZHANG Jun-Hao, SUN Yan, DAN Wei-Wei
    Computer Engineering. 2012, 38(16): 207-211. https://doi.org/10.3969/j.issn.1000-3428.2012.16.054
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In medical image registration based on Mutual Information(MI) method, it exists the problem about the local extrema. Aiming at this problem, this paper proposes a multi-modality image registration algorithm based on Weighted Mutual Information(WMI). Through the preprocessing procedure by global filtering and edge extraction, it extrudes the image features, and uses WMI method to realize registration. Experimental result shows that this algorithm can improve the accuracy and the speed in mulit-modality image registration.
  • JI An-Cai, ZHANG Chu-Fang, LV Wei, CHU Jing-Hui
    Computer Engineering. 2012, 38(16): 212-214. https://doi.org/10.3969/j.issn.1000-3428.2012.16.055
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    According to the problem of existing Compressed Sensing(CS) imaging system requiring a large storage space to store the measure- ment matrix, a Toeplitz structure block-circulant measurements matrix design method based on image blocking is proposed in this paper. It uses the image block compressed sensing theory, decreases the storage space of the measurement system efficiently and reduces the difficulty of hardware implementation. Simulation results show that the proposed method can acquire the measurements quickly and effectively, and the image reconstructed has little loss in subjective and objective quality.
  • KANG Xiao-Bing, ZHANG Er-Hu, CHEN E-Jun
    Computer Engineering. 2012, 38(16): 215-218. https://doi.org/10.3969/j.issn.1000-3428.2012.16.056
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In view of image content authentication problem caused by some forensic operations disturbing forgery traces, this paper investigates the reliability of digital image forgery detection methods. It addresses the use of down-sampling process in image forgery detection, and in-depthly analyzes the influence of sub-sampling process on image copy-move forgery detection. Theoretical analysis and experimental results demonstrate that sub-sampling operation may remove the telltale traces of image copy-move forgery and influence the detection results.
  • ZHOU Zhe, LV Sai-Zhe, GU Li-Xu
    Computer Engineering. 2012, 38(16): 219-222. https://doi.org/10.3969/j.issn.1000-3428.2012.16.057
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to maintain the quality of the surface meshes in virtual surgery system, this paper proposes a fast reconstruction algorithm for surface mesh based on Loose r-sample theory. It records the sampling point set which satisfies Loose r-sample theory to describe object contour. It makes the dynamic Delaunay triangulation of the set and the labels of the Delaunay cells, and reconstructs new network. Experimental results show that this algorithm can maintain the quality of the meshes, and simplifies the simulation complexity.
  • XIAO Ran, HOU Jin
    Computer Engineering. 2012, 38(16): 223-225. https://doi.org/10.3969/j.issn.1000-3428.2012.16.058
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    To solve the problem such as over-segmentation, under segmentation and dependence on initial segmented in image segmentation, this paper proposes a new multi-resolution image segmentation algorithm based on Markov model. It makes improvements on variable weight of Multi-resolution Markov Random Field(MRMRF) algorithm, combines curvelet transform and wavelet transform to multi-resolution analysis. It reduces area number of image by area merging. Experimental result proves the effectiveness of this algorithm compared with classical algorithms.
  • OU Jia-Jia, CA Bi-Shu, XIONG Bing, LI Feng
    Computer Engineering. 2012, 38(16): 226-228. https://doi.org/10.3969/j.issn.1000-3428.2012.16.059
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    After learning the image matching algorithm by combining Scale Invarian Feature Transform(SIFT) and the rotation-invariant Local Binary Patterns(LBP), this paper proposes a detection algorithm of image region copy-move forgery based on LBP. All keypoints are extracted from the image by applying the SIFT algorithm, and each keypoint is described by the rotation-invariant LBP, which are computed from the image patch centered at the keypoint. It matches the keypoint by using the feature vectors of Euclidean distance. Experimental results show that this algorithm performs better than the classical detection algorithm based on Principal Component Analysis(PCA) in terms of robustness against rotate operation, intensity adjustment and efficiency.
  • LIANG Li-Zhu, SHI Hua-Jun, FU Shan
    Computer Engineering. 2012, 38(16): 229-232. https://doi.org/10.3969/j.issn.1000-3428.2012.16.060
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper puts forward a research method by using LabView simulation for design of fault diagnosis algorithm for dual 1553B bus controler fault-tolemnt. Using computer to perform complex logic reasoning instead of people can avoid omitting. State machine is a powerful tool to analyze logic relations among events. Based on LabView state machine, the simulation of reasoning process for fault detection and fault diagnosis of 1553B bus controller is implemented. Simulation results show that the method can achieve the fault diagnosis of backup bus controller.
  • WANG Dun, FANG Yan-Fei, LI Dai-Feng, ZHENG Yan
    Computer Engineering. 2012, 38(16): 233-236. https://doi.org/10.3969/j.issn.1000-3428.2012.16.061
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to realize real-time management of large scale chips test, this paper introduces a testing system, divides the testing work into modules and manages the chip test according to processes and phases, realizes summary and hierarchical state monitoring. Experimental result shows that the algorithm has the characteristics of less producing test data and time consumption to effectively solve the real-time test problem of large scale chip.
  • FENG Qiong-Hua, TUN Tie-Jun, MA Long-Hua
    Computer Engineering. 2012, 38(16): 237-240. https://doi.org/10.3969/j.issn.1000-3428.2012.16.062
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The carrier tracking signal of the GPS receiver is vulnerable to environmental uncertainties when a receiver system is in high dynamic. The state estimation performance of the standard Unscented Kalman Filter(UKF) becomes poor and even divergent when the prior knowledge about the noise statistical characteristics does not meet real situations. To deal with this problem, a master-slaver Adaptive UKF(AUKF) algorithm is proposed. AUKF can adjust the noise covariance, so as to minimize the estimation error of the model, and inhibit the divergence of filtering. Matlab simulation results show that the carrier tracking algorithm based on AUKF has good stability when the noise statistical characteristics changes in the high dynamic.
  • ZHANG Jia, WEI Wen-Xiong, TU Miao, GUO Jiang-Wei
    Computer Engineering. 2012, 38(16): 241-244. https://doi.org/10.3969/j.issn.1000-3428.2012.16.063
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Under the circumstances of the Windows operating system of personal computer, the function of state machine is not easy to realize. Based on PC’s own performance counters, this paper presents a method to make a high-precision and low-overhead timer, which satisfies the strict demands for real time of HART control software. Meanwhile, AES algorithm is applied to protect the HART control commands. Experimental result shows that the HART configuration software has a high degree of real-time and safety, which provides a solution to the data communication in industrial control field.
  • BI Chi-Mei, CHEN Yao-Wu, JIANG Rong-Xin
    Computer Engineering. 2012, 38(16): 245-248. https://doi.org/10.3969/j.issn.1000-3428.2012.16.064
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the requirements of high real-time and small storage space in embedded video surveillance Graphical User Interface(GUI) system. This paper presents a design of real-time On Screen Display(OSD) for video surveillance based on Nano-X. Microwindows is transplanted and tailored on the PowerPC platform. In order to improve the system in real time, Direct Memory Access(DMA) is used to help the PCI transmission. The region’s changes are judged to realize the GUI data’s refresh, and the mouse layer is blended through DM6467’s VDCE module. Experimental tests show that the maximum value of OSD display time for single-frame is adapted to 37.98 ms, and the blending time of mouse is down to 13.6 ms, reaching the requirement of refresh’s speed about 25 f/s.
  • DONG Mian, TUN Dan, RAO Jin-Li, HUANG Wei, DAI Kui, JU Xue-Cheng
    Computer Engineering. 2012, 38(16): 249-252. https://doi.org/10.3969/j.issn.1000-3428.2012.16.065
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A set of subword-parallel arithmetic units is implemented with a hardware shared method. With pipelined design, the proposed units can perform one 64-bit, two 32-bit, four 16-bit, eight 8-bit fixed-point operations, or one double-precision, two single-precision floating-point operations in single cycle. The arithmetic units are designed with Verilog HDL and implemented in 0.18μm standard CMOS process. The performance is evaluated by a real multimedia application based on Engineering and Scientific Computing Accelerator(ESCA) system. Experimental results show that the subword-parallel arithmetic units have a good tradeoff between hardware cost and performance.
  • HE Jun, SHU Yang
    Computer Engineering. 2012, 38(16): 253-254. https://doi.org/10.3969/j.issn.1000-3428.2012.16.066
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    In order to solve the issue of large area and power dissipation overhead of the 64-bit integer multiplier of the homebred multi-core processor, the Booth encoding algorithm is optimized and a new Booth encoding is put forward. The correction of the optimized design is verified through multiple methods, and the design is logic synthesized based on standard cell library. As is turned out that the design can work at 1.0 GHz at least, its area is reduced by 9.64% and its dynamic and leakage power dissipation is decreased by 6.34% and 11.98%, which means the optimization can decrease the area and power consumption of multiplier effectively as expected.
  • LEI Hui-Bin, XIAO Xia
    Computer Engineering. 2012, 38(16): 255-257. https://doi.org/10.3969/j.issn.1000-3428.2012.16.067
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper proposes a novel 3D autonomous chaotic system. Some basic dynamical properties of the novel system are not only investigated by theoretical analysis but also demonstrated by computer simulation. Changing the values can switch its state among periodic, equilibrium point and chaotic state. Compared with the Lorenz and Chen systems, this system has larger positive Lyapunov exponent, better sensitivity and larger chaotic range, and is a novel chaotic system. Because of the above properties, the proposed system has a wide application in such as secure communications and weak signal detection.
  • SHU Feng, CENG Hong-Xiang, DIAO Jia-Bao, LIU Fu-Hai
    Computer Engineering. 2012, 38(16): 258-262. https://doi.org/10.3969/j.issn.1000-3428.2012.16.068
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The data acquisition of securities dealers’ IT monitoring system lacks uniform standards. In order to solve this problem, this paper proposes monitoring system which uses Simple Network Management Protocl(SNMP) as unified data collection technology. This paper gives the extended characteristic index collection of Management Information Base(MIB) for the process securities dealers’ monitoring system, analyzes the adaptability telecommunication demand characteristics of cross network, and uses PySNMP to complete the collection of index data. A layered forwarding communication is used to realize the adaptability of cross network. Application results show the effectiveness of this system. This system has good data acquisition performance.
  • TAO Can-Zhong, YANG Jian-Mei
    Computer Engineering. 2012, 38(16): 263-266. https://doi.org/10.3969/j.issn.1000-3428.2012.16.069
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper reveals the preferred mechanism is a significant evolution characteristic of peer production virtual community by the analysis on static structure and dynamic evolution of virtual community. It analyzes the cooperation network of peer production virtual community based on Wiki voting administrators behaviors. The result shows that the contributors behave heterogeneously. It applys the link prediction method based on local information similarity to analyze the potential connection of the network, and finds the preferred mechanism plays an important role in the network formation process. It uses the link prediction method based on path and random walk similarity to analyze the network and reveal Katz index performs better than other indices, and concludes that besides the preferred mechanism, the indirect recommendation is another important evolution characteristic of virtual communities.
  • SUN Kai, AI Li-Rong
    Computer Engineering. 2012, 38(16): 267-269. https://doi.org/10.3969/j.issn.1000-3428.2012.16.070
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The recommendation accuracy of traditional Bipartite Graph Projection and Ranking(BGPR) algorithm is not high. To solve this problem, this paper proposes BGPR algorithm based on item attribute and item degree. This paper analyzes the bipartite graph characteristics of projection and the random walk, introduces two influencing factors, such as the project properties and projects degree, and gets the personalized recommendation algorithm through the similarity of initialization vector and project optimization. Experimental results show that this algorithm can efficiently improve the recommendation precision of the algorithm.
  • YI Li, WANG Li-E
    Computer Engineering. 2012, 38(16): 270-274. https://doi.org/10.3969/j.issn.1000-3428.2012.16.071
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    A novel product usability modeling and evaluation method based on opinion mining is proposed in this paper. The data is the comments from the Web. Opinion mining is used to process the unstructured product comment to structured comment database. This paper chooses the feature related to product usability and uses factor analysis method to extract common factors which affect product usability. A case study on handset is conducted to demonstrate the usefulness of the proposed methodology. Experimental result shows this method can find the defect existed in product usability from user aspect and provide the reference for product design.
  • CAO Min, LI Hai-Jiang, CAO Zhen
    Computer Engineering. 2012, 38(16): 275-278. https://doi.org/10.3969/j.issn.1000-3428.2012.16.072
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Accelerators are increasingly viewed as computer coprocessors that can provide significant computational performance at low price. This paper implements and tests every sub-procedure of Fast Multipole Method(FMM) on GPU, FPGA and CELL based on the analysis of computational, storage and communication characteristics. It makes two contributions to optimize FMM. A mixed configurable computer architecture which can run FMM well is presented. FMM is optimized on mixed architecture through decomposing its task flow. The probable solution for different task flow is also put forward based on the large experiment results. Results show that the scheme can increase the efficiency of the algorithm.
  • WANG Jie-Qing, BAO Ge-Jin
    Computer Engineering. 2012, 38(16): 279-283. https://doi.org/10.3969/j.issn.1000-3428.2012.16.073
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    The existing anti-collision algorithm can not deal with the problem of small and medium size labels identification. In order to solve this problem, this paper proposes an anti-collision algorithm with random grouping based on tree framework. The algorithm which is based on tree algorithm improves the tags grouping method. It uses the label random selection method to group the tags, and establishes the tags identification tree. Experimental results show that compared with the frame slotted ALOHA algorithm, the throughput of this algorithm increases by 10%, and the implementation is simpler than algorithms based on tree.
  • LI Jie, CHU Wu-Jie, HU Li-Yuan
    Computer Engineering. 2012, 38(16): 284-286. https://doi.org/10.3969/j.issn.1000-3428.2012.16.074
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Aiming at the software/hardware partitioning problem of the embedded system, this paper presents a modified Differential Evolution(DE) algorithm by employing the random mutation strategy on the foundation of hybrid DE algorithm. The modified algorithm extends the influence of the best vector and meanwhile mitigates the impact upon mutation vectors brought about by the best vector. Experimental results demonstrate that compared with the hybrid DE algorithm, the modified algorithm enjoys faster convergence speed and higher reliability, and can effectively solve the problem of hardware-software partitioning.
  • CHENG Hua-Yun, GUAN Zhi-Jin, CHEN Lin-Shan, YANG Ai-Qin
    Computer Engineering. 2012, 38(16): 287-290. https://doi.org/10.3969/j.issn.1000-3428.2012.16.075
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    This paper presents and proves merging, moving and splitting rules of the Positive/Negative Control(PNC) gates, and gives the simplification algorithm for the reversible network based on PNC gates by virtue of these rules. The reversible network is scanned bidirectionally according to the moving rules, and two gates which satisfy the simplification conditions are looked for until the reversible network dose not change. Experimental results on all 3 bit functions show that the number of gates and control bits can be reduced by utilizing the algorithm and the cost of the network can be decreased greatly.
  • FEI Yang, TUN Jie, WANG Xin
    Computer Engineering. 2012, 38(16): 291-292. https://doi.org/10.3969/j.issn.1000-3428.2012.16.076
    Abstract ( ) Download PDF ( )   Knowledge map   Save
    Currently, the virtual machine placement strategy of cloud computing perform is not well in the low delay require. In order to solve this problem, this paper proposes a new virtual machine placement strategy based on Particle Swarm Optimization(PSO) algorithm. It introduces the PSO algorithm, designs a delay model in cloud environment, and combines them to get virtual machine placed scheme. Experimental results show that the response time is less than Dynamic Resource Scheduler(DRS) by 14%~19%, and the Requests per Second(RPS) is more by 17%.