• Most Download
Published in last 1 year | In last 2 years| In last 3 years| All| Most Downloaded in Recent Month | Most Downloaded in Recent Year|

Please wait a minute...
For Selected: Toggle Thumbnails
Overview of Indoor Localization Method Based on WiFi and Mobile Smart Terminal
SHI Gaotao, WANG Boyuan, WU Bin
Computer Engineering    2015, 41 (9): 39-44,50.   DOI: 10.3969/j.issn.1000-3428.2015.09.007
Abstract806)      PDF (1778KB)(30136)      
Indoor localization is a prerequisite for Location Based Services(LBS),it is research hotspot in recent years,and receive widespread attention from academia and industry.With the popularity of smart terminal,many kinds of indoor localization method which is based on WiFi and smart terminal are proposed.Compared with the previous localization method,indoor localization based on WiFi and smart terminal has advantages.Through the key factors of large scale application of indoor localization,this paper analyzes and summarizes the basic methods of indoor localization based on WiFi and smart terminal systematic.With the comparison of typical work in recent years,it points out the shortage of present work,and prospects on the difficulties and direction of the research on indoor localization based on WiFi and smart terminal.
Reference | Related Articles | Metrics
Cited: Baidu(7) CSCD(7)
Study on MPTCP and CMT-SCTP Congestion Control Mechanism
LIU Ji, TAN Yuyin, FU Fa, Thomas Dreibholz, ZHOU Xing, BAI Yong, YANG Xiong, DU Wencai
Computer Engineering    2015, 41 (4): 117-124.   DOI: 10.3969/j.issn.1000-3428.2015.04.022
Abstract559)      PDF (28239KB)(17665)      
Multi-path TCP(MPTCP) and Concurrent Multipath Transfer for SCTP(CMT-SCTP) are two technologies of the concurrent multi-path transfer for NGI,which are hot topics. Compared with the traditional TCP and SCTP,the congestion control of multi-path transport protocols will face the problem of unfairness. This paper begins with an overview of the traditional TCP congestion control algorithm,and then in view of the unfairness of concurrent multi-path transfer,basing on the resource pooling method,it introduces the slow start threshold ratio factor,increase factor,per-flow aggressiveness factor,deduces three new algorithms to solve the problem of unfairness,and carryies out the contrastive analysis through simulation.
Reference | Related Articles | Metrics
Cited: Baidu(5)
Optimization of Basic Blocks Overlapped Redundancy in Dynamic Binary Translation
LI Jun; GUAN Hai-bing; LI Zeng-xiang; LIANG A-lei
Computer Engineering    2007, 33 (22): 60-62.   DOI: 10.3969/j.issn.1000-3428.2007.22.021
Abstract1223)      PDF (225KB)(13891)      
Many dynamic binary translators chose basic block as the unit of translation and execution, the basic blocks to be translated in dynamic binary translation may have the same instructions as the other ones which have been translated. This situation consequently leads to repeating translation and incurs the unnecessary overhead. This paper focus on how to detect and eliminate the overhead caused by basic blocks overlapped redundancies from the view of dynamic binary translation optimization technology. Experiment results show there are about 5% overlapped redundancies in the course of translation. By eliminating the redundancies results in a speed up of 1%~4% in translation performance.
Related Articles | Metrics
Cited: Baidu(2)
RSA Encryption Processor Based on Montgomery Modular Multiplication
XUE Nian, BO Bin, ZHANG Yu-Hong, YAN Xiao-Lang
Computer Engineering    2010, 36 (13): 125-127.   DOI: 10.3969/j.issn.1000-3428.2010.13.044
Abstract1483)      PDF (286KB)(12559)      
A radix-4 Montgomery modular multiplication and the optimized circuit architecture are presented. It can reduce iterations of traditional radix-2 modular multiplication to about 50%. Based on this module, the implementation of high speed RSA encryption processor follows completely parallel modular exponentiation flow with Carry Save Addition(CSA) structure to perform long integer arithmetic. This avoids the repeated interim output/output format conversion. Result shows that the optimization is technology independent and thus should suit well for not only FPGA implementation but also ASIC. This design can complete a standard 1 024 bit RSA encrypt operation with only 9 836 clock cycles. Compared to the recently proposed design in the literature, the proposed design can achieve an increase of over 50% in throughput.
Reference | Related Articles | Metrics
Cited: Baidu(5) CSCD(2)
Personalized Recommendation Algorithm Based on Concept Hierarchy Tree
ZHANG Xiao-min; WANG Qian
Computer Engineering    2007, 33 (24): 57-59.   DOI: 10.3969/j.issn.1000-3428.2007.24.019
Abstract1202)      PDF (161KB)(11832)      
This paper improves traditional collaborative filtering algorithm, proposes a new user profile based on concept hierarchy tree, which can make recommender systems still work even when users have no common rating items. In the process of similarity calculation and recommendation formation, it also uses concept hierarchy thought to generate recommendation lists by different categories, avoiding recommendation lack of diversity. Experimental results on MovieLens dataset show that the improved algorithm can provide better prediction in either accuracy or diversity aspect.
Related Articles | Metrics
Cited: Baidu(2)
Topic Words Extraction Method Based on LDA Model
DAN Jing, LI Mo-Long
Computer Engineering    2010, 36 (19): 81-83.   DOI: 10.3969/j.issn.1000-3428.2010.19.028
Abstract2737)      PDF (130KB)(10930)      
Latent Dirichlet Allocation(LDA) is presented to express the distributed probability of words. The topic keywords are extracted according to Shannon information. Words which are not distinctly in the analyzed text can be included to express the topics with the help of word clustering of background and topic words association. The topic meaning is attempted to dig out. Fast Gibbs is used to estimate the parameters. Experiments show that Fast Gibbs is 5 times faster than Gibbs and the precision is satisfactory, which shows the approach is efficient.
Reference | Related Articles | Metrics
Cited: Baidu(24) CSCD(18)
Semantic-based Keyword Extraction Algorithm for Chinese Text
WANG Li-Xia, HUAI Xiao-Yong
Computer Engineering    2012, 38 (01): 1-4.   DOI: 10.3969/j.issn.1000-3428.2012.01.001
Abstract10360)      PDF (307KB)(9148)      

In order to overcome the limitation of literal matching and lacking semantic concept of the traditional keyword extraction algorithm, this paper presents a Semantic-based Keyword Extraction(SKE) algorithm for Chinese text. It uses semantic feature in the keyword extraction process and constructs word semantic similarity network and uses betweenness centrality density. Experimental results show that compared with the statistic based keyword extraction algorithm, the keywords SKE algorithm extracted are more reasonable and can represent more information of the document’s topic, and the SKE algorithm has a better performance.

Reference | Related Articles | Metrics
Cited: Baidu(24) CSCD(8)
Influence of Information Characteristic on Information Spreading in Social Network
GE Xiaoyan,ZHANG Ning
Computer Engineering    DOI: 10.3969/j.issn.1000-3428.2015.10.007
Research on the Formal Semantics of Verilog Based on ASM
HU Yanxiang;
Computer Engineering    2006, 32 (21): 1-2,21.   DOI: 10.3969/j.issn.1000-3428.2006.21.001
Abstract1638)      PDF (81KB)(7086)      
Verilog’s formal semantics using the abstract states machine are studied, and the formal definition of assignment statements and delay/event control mechanism is given. Comparing with Borger’s definition on VHDL, the key methods on how to translate Verilog description to VHDL are explained. In the end, the simulation differences before and after translation are studied.
Related Articles | Metrics
Cited: Baidu(3) CSCD(1)
Hierarchical Memory Fault-injection Method for Itanium Architecture
WANG Bei, ZUO De-Cheng, JIAN Jun, ZHANG Zhan
Computer Engineering    2012, 38 (04): 70-72.   DOI: 10.3969/j.issn.1000-3428.2012.04.023
Abstract7965)      PDF (254KB)(6905)      
In order to figure out how memory faults affect high-performance servers, this paper presents a multi-layer fault injection method for Itanium architecture computers. HMFI(Hierarchical Memory Fault Injector) is designed and developed to inject memory faults in physical level, operating system kernel level and process level. Experimental results demonstrate the effectiveness of HMFI in evaluating the fault-tolerant properties of complex computer system.
Reference | Related Articles | Metrics
Cited: Baidu(1) CSCD(1)
Parameters Selection Method for Support Vector Machine Regression
YAN Guo-hua; ZHU Yong-sheng
Computer Engineering    2009, 35 (14): 218-220.   DOI: 10.3969/j.issn.1000-3428.2009.14.076
Abstract1251)      PDF (102KB)(6219)      
By combining several parameters selection approaches of Support Vector Machine(SVM), this paper proposes a method that defines parameters directly by analyzing training samples. Experimental results based on several standard test data sets show that the method achieves better prediction accuracy and consumes less time compared to traditional grid search methods. It provides one way to deal with the problem of selecting parameters and time consuming in application of SVM.
Related Articles | Metrics
Cited: Baidu(40) CSCD(21)
Design of BCH Encoder/Decoder for NAND Flash Controller
WANG Jie, CHEN Hai-Bin
Computer Engineering    2010, 36 (16): 222-225.   DOI: 10.3969/j.issn.1000-3428.2010.16.080
Abstract1714)      PDF (143KB)(6156)      
A new architecture of parallel BCH encoder and decoder applied in NAND Flash Controller is proposed. In order to obviously increase the throughput of decoder, pipeline operation and prefetch decoding in group operation are applied in the design. It takes 565 cycles to correct 8 bit random error after NAND Flash’s 2 KB page read operation, which is a quarter of the time cost by prefetch & decode in page.
Reference | Related Articles | Metrics
Cited: Baidu(2) CSCD(2)
Course Schedule Algorithm Based on Constraint Satisfaction and Genetic Algorithm
HU Xiu-Lin, HU Ke-Jin
Computer Engineering    2010, 36 (14): 281-284.   DOI: 10.3969/j.issn.1000-3428.2010.14.102
Abstract1081)      PDF (145KB)(6030)      
Aiming at the factors of resource constraints that exist in the process of course schedule, this paper proposes an algorithm combining Genetic Algorithm(GA) and constraint satisfaction algorithm to solve course schedule problem. Course schedule tasks are sorted with constraint satisfaction algorithm, and a single course schedule task’s timetable is allocated and optimized with GA. In this algorithm, the result of single course schedule task is global optimal. Experimental results show that this method is feasible to improve the performance and the efficiency.
Reference | Related Articles | Metrics
Cited: Baidu(15) CSCD(1)
Genetic Algorithm for Solving Constrained Optimization Problem
LIANG Cuo-Meng, QIN Gao-Yu, LONG Wen
Computer Engineering    2010, 36 (14): 147-149.   DOI: 10.3969/j.issn.1000-3428.2010.14.053
Abstract874)      PDF (90KB)(5881)      
A genetic algorithm to handle constrained optimization problem is proposed. This method searches the decision space of a problem through the arithmetic crossover of feasible and infeasible solutions, and performs a selection on feasible and infeasible populations respectively according to fitness and constraint violation. It uses the boundary mutation on feasible solutions and the non-uniform mutation on infeasible solutions because the solutions usually deviate from the constraint domain after the traditional mutation operation. It maintains the population diversity through dimension mutation. Numerical results show that it is an effective algorithm.
Reference | Related Articles | Metrics
Cited: CSCD(13)
3D Face Reconstruction Method Based on Single Frontal Photo
DENG Qiu-Beng, DIAO Yu-Meng
Computer Engineering    2010, 36 (20): 176-178.   DOI: 10.3969/j.issn.1000-3428.2010.20.062
Abstract1531)      PDF (229KB)(5824)      
3D face reconstruction algorithms require more than one image to realize reconstruction and their efficiency is low. Aiming at the problems, this paper proposes a 3D face reconstruction algorithm based on single frontal photo. It uses Thin Plate Spline(TPS) function to build 3D face model by establishing the point-to-point correspondence among 3D faces in the database, so that an average 3D face model is built. It uses Levenberg-Marquardt Algorithm(LMA) to optimize the shape coefficients. The input image is projected orthogonally to the 3D shape to generate the face texture. Experimental results show that the method can generate realistic 3D faces efficiently.
Reference | Related Articles | Metrics
Cited: Baidu(1) CSCD(2)
Survey on Chinese Character Recognition Method
Computer Engineering    2010, 36 (20): 194-197.   DOI: 10.3969/j.issn.1000-3428.2010.20.068
Abstract990)      PDF (109KB)(5757)      

This paper analyzes Chinese character structure feature and evolution, combines the character recognition process together on the basis of Chinese character database and changing in recognition target, researches and comprises the advantages, disadvantages and the application range of five different kinds of Classification recognition method such as Bayesian method, quadratic discriminate function approach, Markov model, neural network classifier and Support Vector Machine(SVM). Results shows that Chinese character recognition method including recognition should be improved on the aspects of target, feature extracting and train set preparing.

Reference | Related Articles | Metrics
Cited: Baidu(9) CSCD(7)
Bayesian Indoor Location Algorithm Based on RSSI
BANG Yu-Xu, YANG Yan-Gong
Computer Engineering    2012, 38 (10): 237-240.   DOI: 10.3969/j.issn.1000-3428.2012.10.073
Abstract1184)      PDF (309KB)(5727)      
In order to increase the positioning accuracy of indoor positioning system based on Received Signal Strength Indicator(RSSI), a Bayesian indoor location algorithm based on RSSI is proposed. The algorithm preprocesses the RSSI signal by Gaussian filtering, uses the triangle centroid algorithm to calculate the unknown node’s initial coordinates, and handles it through Bayesian filtering to get the coordinates that is more accurate. Experimental results show that the precision of proposed algorithm can reach 98%, which reduces the positioning error.
Reference | Related Articles | Metrics
Cited: Baidu(10) CSCD(16)
Survey on Coreference Resolution
KONG Fang; ZHOU Guo-dong; ZHU Qiao-ming; QIAN Pei-de;
Computer Engineering    2010, 36 (8): 33-36.   DOI: 10.3969/j.issn.1000-3428.2010.08.012
Abstract1188)      PDF (109KB)(5680)      
This paper interprets the concepts of coreference resolution, and introduces the state-of-the-arts in coreference resolution from three aspects: corpus resources, evaluation measures and resolution algorithms. It analyzes the critical problems of coreference resolution: automatic capture and presentation of structured syntactic knowledge, automatic capture and usage of underlying semantic, cross-document coreference resolution. Based on the analysis, it explores its international research trend.
Related Articles | Metrics
Cited: Baidu(7) CSCD(5)
Accuracy Analysis of Binocular Stereo Vision System
LIU Beng-Cai, XIE Meng-Gong, YA Guo-Lin
Computer Engineering    2011, 37 (19): 280-282,285.   DOI: 10.3969/j.issn.1000-3428.2011.19.092
Abstract1545)      PDF (287KB)(5645)      
To raise the measurement accuracy of binocular stereo vision system, working principle of binocular vision system and error model in all aspects are analyzed. The calibration error and the image rectification error can be reduced by improving the accuracy of calibration template and increasing calibration images. By analyzing image recognition errors’ influence on the measurement accuracy of the visual system, the relationship between structural parameters of visual system and measurement errors is introduced. The influence of structural parameters to visual system is determined. The influence of object distance on measurement accuracy is discussed and a proper object distance scope is given.
Reference | Related Articles | Metrics
Cited: Baidu(13) CSCD(1)
Detection and Defence of DNS Spoofing Attack
YAN Boru; FANG Binxing; LI Bin; WANG Yao
Computer Engineering    2006, 32 (21): 130-132,.   DOI: 10.3969/j.issn.1000-3428.2006.21.045
Abstract2104)      PDF (1087KB)(5629)      
DNS is a critical component of the operation of Internet applications. The Internet is greatly affected if DNS is attacked. DNS spoofing is one of the most popular attack means with the character of high dormancy and good attack effection. But so far, little is done to defend the systerm against this attack. Three methods are presented to detect DNS spoofing attack, and then another three techniques are proposed to identify the bogus packets and the right ones to ensure DNS service even attacked.
Related Articles | Metrics
Cited: Baidu(22)
Implementation of Fast and High-precision Division Algorithm on FPGA
WANG Liu-Cheng, LIN Yong-Cai, JIANG Wen-Gang
Computer Engineering    2011, 37 (10): 240-242.   DOI: 10.3969/j.issn.1000-3428.2011.10.083
Abstract1615)      PDF (263KB)(5595)      

A new reciprocal algorithm is provided to realize the traditional reciprocal division on Field Programmable Gate Array(FPGA) with high precision and fast speed. In order to solve the reciprocal of the divisor, the Taylor series expansion is used combining with searching approximation to get a fitting binomial of degree 1 with one variable in every separated section, and the Newton-Raphson iteration is used one time to improve precision. The result of timing simulation proved that the divider based on this new division algorithm can be easily realized on FPGA. The divider can get the answer of 2-34 available accuracy only six clock pulses after input variables being given, and the highest operating frequency is 86.95 MHz.

Reference | Related Articles | Metrics
Cited: Baidu(5)
KNN Classification Algorithm Based on k-Nearest Neighbor Graph for Small Sample
LIU Ying-Dong, NIU Hui-Min
Computer Engineering    2011, 37 (9): 198-200.   DOI: 10.3969/j.issn.1000-3428.2011.09.069
Abstract3350)      PDF (455KB)(5516)      
A KNN classification algorithm based on k-nearest neighbor graph for small sample sets is presented to improve the classification accuracy, which partitions the k-nearest neighbor graph into clusters with high similarity, labels the unlabel data of each cluster with the label of the label data in the same cluster, and deletes the noise data. The sample set is expended by this method. The algorithm use the expended sample set to label the unlabel data. The presented algorithm is demonstrated with standard datasets, and the experimental results show the algorithm can enhance the accuracy of classification, reduce the influence of the value of k, and achieve a satisfying result.
Reference | Related Articles | Metrics
Cited: Baidu(10) CSCD(4)
K-means Clustering Algorithm with Meliorated Initial Center
YUAN Fang; ZHOU Zhiyong; SONG Xin
Computer Engineering    2007, 33 (03): 65-66.   DOI: 10.3969/j.issn.1000-3428.2007.03.024
Abstract1472)      PDF (102KB)(5497)      
The traditional k-means algorithm has sensitivity to the initial start center. To solve this problem, a new method is proposed to find the initial start center. First it computes the density of the area where the data object belongs to; then finds k data objects all of which are belong to high density area and the most far away to each other, using these k data objects as the initial start centers. Experiments on the standard database UCI show that the proposed method can produce a high purity clustering result and eliminate the sensitivity to the initial start centers.
Related Articles | Metrics
Weblog Mining Based on Hadoop
CHENG Miao, CHEN Hua-Beng
Computer Engineering    2011, 37 (11): 37-39.   DOI: 10.3969/j.issn.1000-3428.2011.11.013
Abstract1044)      PDF (291KB)(5489)      
The mass data from Web are distributed, heterogeneous and dynamic, so the current data mining system based on single node has developed to a bottleneck. Using the advantage of cloud computing——distributed processing and virtualization, this paper presents a Weblog analysis platform under the Hadoop’s cluster framework based on cloud computing, it also presents a hybrid algorithm which can distributed process in the cloud computing environment. To further verify the effectiveness and efficiency of the platform, it uses the improved algorithm to mine users’ preferred access path in Weblog on the platform. Experimental results show that, using distributed algorithm to process large number of Weblog files in the cluster, can significantly improve the efficiency of Web data mining.
Reference | Related Articles | Metrics
Cited: Baidu(38) CSCD(18)
Research and Realization of Dead Reckoning Algorithm for Indoor Localization
SONG Min, SHEN Yan-Chun
Computer Engineering    2013, 39 (7): 293-297,301.   DOI: 10.3969/j.issn.1000-3428.2013.07.065
Abstract612)      PDF (529KB)(5473)      
Because of the accumulation of positioning errors due to the drift of Personal Dead Reckoning(PDR) for indoor localization, this paper puts forward a Micro Electro Mechanical System(MEMS) sensor integration of PDR algorithm. It includes the following three points: It obtains displacement information based on typical pedometer principle and stride length estimate, joins dynamic time window and acceleration threshold in stride calculation algorithm, and gets the angle between the walking direction and magnetic north direction with the magnetometer and gyroscope to correct the positioning accumulative error. It realizes indoor location and navigation. The result proves that the distance errors of indoor localization experiment can be controlled within 5%, and the stride calculation is highly precise, the azimuth algorithm is easy to deal with, and it can rectify error because of long time drift in certain extent.
Reference | Related Articles | Metrics
Cited: Baidu(6) CSCD(6)
Digital Signature and Encrypt Algorithm Based on Elliptic Curve
HU De-Wu, CHEN Wei
Computer Engineering    2011, 37 (4): 168-169.   DOI: 10.3969/j.issn.1000-3428.2011.04.060
Abstract929)      PDF (134KB)(5363)      

Applying ElGamal signature scheme to the elliptic curve cryptosystem may introduce an undefined operation of point multiplex in elliptic curve. In order to solve the problem, this paper improves processes of signature generation and validation, using a simple algebra operation instead of multiplication operation, and presents feasibility and security analysis. Menezes Vanstone(MV) algorithm is improved to reduce its data expand rate. Experimental results show that its operation speed is faster than RSA or ECC-E. Execution efficiency and key length of the improved algorithms make them more efficient in the application of smart card computation.

Related Articles | Metrics
Cited: Baidu(8) CSCD(2)
Research and Development of Self-organizing Maps Algorithm
YANG Zhanhua;YANG Yan
Computer Engineering    2006, 32 (16): 201-202,.   DOI: 10.3969/j.issn.1000-3428.2006.16.077
Abstract2797)      PDF (194KB)(5348)      
The self-organizing maps (SOM) is an unsupervised learning algorithm, which is capable of self organization and visualization and has been used in many areas. In this paper, the background of self-organizing maps algorithm and basic algorithm are introduced, the parameter setting-up and disadvantage of SOM are analyzed. The improved algorithms have been reviewed emphatically, and research hotspot and applying fields are also discussed briefly. Finally, some remarks on future research are given.
Related Articles | Metrics
Cited: CSCD(18)
Classification for Imbalanced Dataset of Improved Weighted KNN Algorithm
WANG Chao-Hua, BO Zheng-Mao, MA Chun-Sen, DONG Li-Li, ZHANG Chao
Computer Engineering    2012, 38 (20): 160-163.   DOI: 10.3969/j.issn.1000-3428.2012.20.041
Abstract1268)      PDF (308KB)(5235)      
Based on analyzing the shortages of K-Nearest Neighbor(KNN) algorithm in solving classification problems on imbalanced dataset, a novel KNN approach based on weight strategy(GAK-KNN) is presented. The key of GAK-KNN lies on defining a new weight assignment model, which can fully take into account the adverse effects caused by the uneven distribution of training sample between classes and within classes. The specific steps are as follows: use K-means algorithm based on Genetic Algorithm(GA) to cluster the training sample set, compute the weight for each training sample in accordance to the clustering results and weight assignment model, use the improved KNN algorithm to classify the test samples. GAK-KNN algorithm can significantly improve the identification rate of the minority samples and overall classification performance. Theoretical analysis and comprehensive experimental results on the UCI dataset con?rm the claims.
Reference | Related Articles | Metrics
Cited: Baidu(11) CSCD(2)
Methods of Network Traffic Prediction
DONG Meng-Li, YANG Geng, CAO Xiao-Mei
Computer Engineering    2011, 37 (16): 98-100.   DOI: 10.3969/j.issn.1000-3428.2011.16.033
Abstract1018)      PDF (286KB)(5220)      
Modeling and predicting of network traffic are important for internet management and security prediction. Considering about draggle disposal and bad service quality, different kinds of classic traffic prediction methods are reviewed. Comparison about their suitable data, modeling complexity, prediction precision and suitable scene are presented. Experimental results prove that prediction model should correlate to scene tightly. It need to choose different models according to the traffic characters and prediction target in practices.
Reference | Related Articles | Metrics
Cited: Baidu(27) CSCD(2)
Security Model of Internet of Things Based on Hierarchy
SUN Zhi-Shen, JIA Bing-Qing, LUO Ku-Mei, SHU Hong-Bei
Computer Engineering    2011, 37 (10): 1-7.   DOI: 10.3969/j.issn.1000-3428.2011.10.001
Abstract2170)      PDF (1369KB)(5193)      

Different applications have different security sensitivities, which are determined by subjective judgment in the process of security research on Internet of Things(IOT). This paper presents a Security Model of IOT Based on Hierarchy(BHSM-IOT), which can be used to analyze the topology structure, predict the attack source and attack type and determine the application level of security domain, so that appropriate safety technical configuration can be made. The model is applied in a wisdom campus system of a university, and result proves that it is helpful for the managers to construct a more safe and stability system for the students and teachers with the model.

Reference | Related Articles | Metrics
Cited: Baidu(7) CSCD(3)
Application of LDA Model in Microblog User Recommendation
DI Liang, DU Yong-ping
Computer Engineering    DOI: 10.3969/j.issn.1000-3428.2014.05.001
Cloud Computing Model Based on MPI
GUO Ben-jun; WANG Peng; CHEN Gao-yun; HUANG Jian
Computer Engineering    2009, 35 (24): 84-86.   DOI: 10.3969/j.issn.1000-3428.2009.24.028
Abstract1934)      PDF (96KB)(5117)      
According to the features of Message Passing Interface(MPI), the cloud computing application methods based on MPI, including the MPI cloud computing algorithm design model, cloud computing principles, the core model, and the process are proposed. The distributed characteristic and parallel characteristic are introduced. Theoretical analysis results show this algorithm is feasible, effective and superior to the traditional parallel technology, and it can provide the new method to distributed and parallelize the ordinary algorithms.
Related Articles | Metrics
Cited: Baidu(37) CSCD(16)
Solution Analysis of L1 Regularized Machine Learning Problem
KONG Kang, HONG Qun-Shan, LIANG Mo-Lu
Computer Engineering    2011, 37 (17): 175-177.   DOI: 10.3969/j.issn.1000-3428.2011.17.059
Abstract1883)      PDF (407KB)(5114)      
To deal with the new time and space challenges of the machine learning problem algorithms from large scale data, this paper focuses on sparse-learning and categorizes the L1 regularized problem’s the-state-of-the-art solvers from the view of multi-stage and multi-step optimization schemes. It compares the algorithms’ convergence properties, time and space cost and the sparsity of these solvers. The analysis shows that those algorithms sufficiently exploiting the machine learning problem’s specific structure obtain better sparsity as well as faster convergence rate.
Reference | Related Articles | Metrics
Cited: Baidu(5) CSCD(5)
Review of One-class Classification Method Based on Support Vector
TUN Ding-Hai, ZHANG Pei-Lin, LIN Guo-Quan, CHEN Fei-
Computer Engineering    2011, 37 (5): 187-189.   DOI: 10.3969/j.issn.1000-3428.2011.05.063
Abstract842)      PDF (266KB)(5101)      
Two one-class classification models, one-class support vector machine and support vector data description, which are based on support vector machine and one-class classification are introduced. The internal relationship and parameters optimization of the two models are also analysed, and the exists of disadvantages and improvements of the two one-class classifiers are summarized.
Reference | Related Articles | Metrics
Cited: Baidu(12) CSCD(11)
Ability Test for Matrix-Multiplication and FFT Based on CUDA
XIAO Jiang; HU Ke-liang; DENG Yuan-yong
Computer Engineering    2009, 35 (10): 7-10.   DOI: 10.3969/j.issn.1000-3428.2009.10.003
Abstract1521)      PDF (119KB)(5082)      
This paper introduces the result of a test that evaluates the effectiveness of Compute Unified Device Architecture(CUDA) using NVDIA GeForce8800GT and the compiler Visual Studio 2008. It tests the speed of NVIDIA CUBLAS, CUDA kernel, common C program, Intel MKL BLAS, CUDA driver API program, FFTW and CUFFT Library in matrix-multiplication and Fast Fourier Transform(FFT). Test result of the large scale data shows that the computing ability of GPU is 25 times better than that of CPU.

Related Articles | Metrics
Cited: CSCD(13)
Landmark Tracking Algorithm Based on Adaptive Feature
ZHOU Chao, HAN Bei, LI Beng, LIN Qin-Yuan
Computer Engineering    2011, 37 (24): 155-157.   DOI: 10.3969/j.issn.1000-3428.2011.24.052
Abstract1055)      PDF (356KB)(5055)      
In order to realize landmark tracking by Unmanned Aerial Vehicle(UAV), this paper embeds online feature selection into particle filtering algorithm, and adopts adaptive transition model. Candidate feature set is composed of linear combination of R, G and B pixel values. Histograms of feature values for pixels on the object and in the background are computed for obtaining log likelihood ratio and variance ratio. The feature with the best discrimination is selected for computing the likelihood image. Two sets of particles are obtained via different approaches for estimating the position of the object. Experimental results show that the algorithm provides more reliable results and it is more robust.
Reference | Related Articles | Metrics
Cited: CSCD(2)
Region-based Bicubic Image Interpolation Algorithm
WANG Hui-Feng, ZHOU Li-Chi, ZHANG Jie
Computer Engineering    2010, 36 (19): 216-218.   DOI: 10.3969/j.issn.1000-3428.2010.19.076
Abstract1223)      PDF (163KB)(5032)      
Bicubic interpolation is an effective way to get well-qualified high-resolution image, but with high calculation load. The common used interpolation methods are discussed. A new region-based bicubic interpolation is proposed. Without segmenting the image, the mean value of the four neighboring points of the interpolated point is calculated which is used to divide the image into two regions: the flat region and the complex region with more details. Two different interpolating algorithms are chosen for each region. Experimental results show that the proposed algorithm can keep the image quality equal to the original algorithm while reducing the calculation load more than 10 percents. It is useful for applications.
Reference | Related Articles | Metrics
Cited: Baidu(19) CSCD(20)
Research on Performance Optimization of Hadoop Platform
LUAN E-Jian, HUANG Chong-Min, GONG Gao-Cheng, DIAO Tie-Zhu
Computer Engineering    2010, 36 (14): 262-263.   DOI: 10.3969/j.issn.1000-3428.2010.14.095
Abstract1092)      PDF (108KB)(5003)      

As applications programs based on MapReduce model growing up, Hadoop’s performance depends on applications. From applications, this paper analyzes the limitations and shortcomings of Hadoop architecture and storage technology, and proposes a feasible and cost-effective solution to address the problem. It builds a series tests to convince the idea. The solution is multi-level parallel, both on job and I/O levels, which makes full use of disk and network bandwidth, reduces I/O bottlenecks and improves performance.

Related Articles | Metrics
Cited: Baidu(27) CSCD(16)
Fast Algorithm for Extracting Minimum Enclosing Rectangle of Target Image
LEI Rong, FAN Yong, CHEN Nian-Nian, WANG Dun-Bei
Computer Engineering    2010, 36 (21): 178-180.   DOI: 10.3969/j.issn.1000-3428.2010.21.064
Abstract1975)      PDF (99KB)(4953)      
Geometric feature extraction from image is a crucial step in image classification and recognition algorithms. It requires to calculate the Minimum Enclosing Rectangle(MER) of the image to get some attributes, such as length and width. This paper proposes an algorithm based on the combination of the vertex chain code and the discrete Green theorem to extract MER from image. According to this algorithm, it can calculate the area, centroid, and principal axis of the image easily, only with its point coordinates from the veritical or hrizontal direction of the vertex chain code. Experimental results show that the rotation method’s speed is two times of the current algorithms, while the principal axis method is three times of the rotation method.
Reference | Related Articles | Metrics
Cited: Baidu(21) CSCD(18)
Gesture Recognition Based on Three-axial Accelerometer
LIU Rong, LIU Meng
Computer Engineering    2011, 37 (24): 141-143.   DOI: 10.3969/j.issn.1000-3428.2011.24.047
Abstract1444)      PDF (291KB)(4937)      
Aiming at similarity and instability of gesture activity signal in gesture interaction, a gesture recognition scheme based on three-axial accelerometer is presented. It utilizes a MMA7260 accelerometer to capture the acceleration signal of dominant wrist. An activity detection algorithm is used to auto determine the data stream which containing interesting motion according to the features of gesture activity signal. After denoising and resampling the acceleration data streams, gesture features are extracted, and Discrete Hidden Markov Model(DHMM) is built for gesture recognition. Experimental results demonstrate the effectiveness of the scheme.
Reference | Related Articles | Metrics
Cited: Baidu(16) CSCD(16)
Efficient Solution to Yao’s Millionaires’ Problem
CHA Dun, SU Jin-Hai, YAN Shao-Ge, YAN Xiao-Fang
Computer Engineering    2010, 36 (14): 124-126.   DOI: 10.3969/j.issn.1000-3428.2010.14.045
Abstract1114)      PDF (87KB)(4895)      
Yao’s Millionaires’ problem is a typical problem of secure multi-party computation, but most solutions are inefficient. Based on commutative encryption scheme, this paper proposes an efficient and secure solution to millionaires’ problem, which reduces the problem to the set- intersection problem by 0-encoding and 1-encoding for private inputs. Proof of security is followed. There is no complicated modular exponentiation in this solution which only needs O(n) encryption/decryption and 4 rounds of communication. It is more efficient than other solutions.
Reference | Related Articles | Metrics
Cited: CSCD(3)
Topology Optimization Strategy of Multi-source Media Streaming Network Based on Loading Balance
SHI Hou-bing; ZHU Yi-an; WANG Yun-lan; NIAN Fu-feng
Computer Engineering    2009, 35 (6): 122-124.   DOI: 10.3969/j.issn.1000-3428.2009.06.042
Abstract1168)      PDF (94KB)(4876)      
This paper analyzes the up-down layer topology of multi-source media streaming network, and presents a topology optimization strategy based on loading balance. This strategy makes use of the abundant network resource by P2P technology and combines media servers function with group broadcasting theory. It can make all media streaming network’s topology balanced, and bring on all system’s loading balanced. Playing delay is reduced, and system stability is enhanced when system expansibility is ensured.

Related Articles | Metrics
Cited: Baidu(3) CSCD(2)
Quick Algorithm for Searching Primitive Polynomial
GUO Xin; CHEN Ke-fei
Computer Engineering    2008, 34 (15): 146-147,.   DOI: 10.3969/j.issn.1000-3428.2008.15.052
Abstract1499)      PDF (73KB)(4827)      
Primitive elements and primitive polynomial play very important roles in the theory of the finite field. It is the premise of solving the problem about code sequences and searching the primitive elements can come down to searching primitive polynomial. This paper gives a new algorithm for searching primitive polynomials in the binary field making use of the algorithm for searching the minimal polynomial, and also gives out the minimal polynomial in the searching process. It shows the efficiency analysis of the algorithm.
Related Articles | Metrics
Cited: Baidu(3)
Depth Extraction Method Based on Multi-view Stereo Matching
JU Qin, AN Beng, ZHANG Qian, TUN Yan-Fei, ZHANG Zhao-Yang
Computer Engineering    2010, 36 (14): 174-176.   DOI: 10.3969/j.issn.1000-3428.2010.14.063
Abstract900)      PDF (128KB)(4821)      
A method for generating the depth image from multi-view images based on color segmentation is presented. Mean-shift algorithm is used to extract homogenous regions in the reference image. The initial disparity maps applying local window-based matching algorithm is got. According to certain criteria, these initial depth maps are merged into one disparity map to improve the quality of disparity map, and optimized the disparity map by post processing. The disparity map is converted to a depth map. The algorithm can deal with the occlusion problem effectively, which increases the matching accuracy, and improves the quality of the disparity map.
Reference | Related Articles | Metrics
Cited: Baidu(9) CSCD(5)
Match Algorithms Survey of Computing Advertising
GUO Qiang-Chao, ZHENG Tao
Computer Engineering    2011, 37 (7): 222-224,233.   DOI: 10.3969/j.issn.1000-3428.2011.07.075
Abstract1021)      PDF (291KB)(4806)      
This paper conducts a survey of pricing models, relevance match algorithms, and effective statistical models for computing advertising, analyzes and compares these approaches, like Cosine, Okapi BM25, feature learning, hierarchy-learning and Multinomial language model, and conclusively points out the feasible improvement and future of research in this field.
Reference | Related Articles | Metrics
Cited: Baidu(1)
Research on Improved Methods of Watershed Algorithm
DIAO Zhi-Hua, DIAO Chun-Jiang, GUO Xin-Yu, LIU Qing-Lian, WANG Xiu-Hui-
Computer Engineering    2010, 36 (17): 4-6.   DOI: 10.3969/j.issn.1000-3428.2010.17.002
Abstract1525)      PDF (321KB)(4703)      
Existing watershed algorithm is sensitive to noise and has over-segmentation problem. Based on previous studies and combining with the current progress, this paper introduces watershed algorithm simulating flood and watershed algorithm simulating rain. It sums up four types of improved methods for watershed algorithm according to defects of the traditional algorithms. Problems and further research aspects of improved methods for watershed algorithm are discussed.
Reference | Related Articles | Metrics
Cited: Baidu(32) CSCD(13)
Remote Online Update Technology for Embedded Device
DIAO Jiong, GU Pei-Yuan, LI Zhong-Shan, LIN Wang-Cheng
Computer Engineering    2010, 36 (12): 262-264.   DOI: 10.3969/j.issn.1000-3428.2010.12.091
Abstract835)      PDF (114KB)(4660)      
In order to reduce the costs of embedded system update and maintenance effectively, this paper presents a method of using Web interface to achieve automatic update for embedded system through remote communication according to store framework and update principle of embedded device, which includes the technique of packing kernel image and root file system before update, the method of unpacking and writing it into Flash after receiving packet, and the way of remote communication between client and embedded device.
Reference | Related Articles | Metrics
Cited: Baidu(7) CSCD(1)
Enhanced JTAG Interface Based on DSP Systems
DONG Da-ming; FANG Yong-hua; XIONG Wei
Computer Engineering    2010, 36 (8): 242-244.   DOI: 10.3969/j.issn.1000-3428.2010.08.085
Abstract1152)      PDF (99KB)(4626)      
According to the problem that high-speed processors can not be emulated through common JTAG-interface in a long distance, enhanced JTAG interface is proposed. Several factors are analyzed quantitatively that relate to the failure of emulating the high-speed processors in a long distance, through the discussion of character and timing of JTAG-interface-signals. According to the conclusion, drivers and compensation of signal integrity are given to the signals of common JTAG interface. The circuit and test result of the design is also discussed. The results show high-speed processors can be emulated through enhanced JTAG-interface over 120 cm.
Related Articles | Metrics
Cited: Baidu(2)
Edge Detection Algorithm Based on Image Partition
SONG Ying, CHEN Ke, LIN Jiang-Chi, JU Yuan-Wen
Computer Engineering    2010, 36 (14): 196-197.   DOI: 10.3969/j.issn.1000-3428.2010.14.071
Abstract876)      PDF (196KB)(4612)      
The threshold of Canny operator relays on the statistics of the image global gradient. The image global gradient differs from local gradient in most cases. Some obvious edge may be neglected while using the same threshold. Aiming at this problem and according to the image entropy, this paper proposes an edge detection algorithm for image partition and applies this algorithm in the Canny operator. Experimental results prove the validity of this method. Its detection effect is better than using Canny operator alone.
Reference | Related Articles | Metrics
Cited: Baidu(19) CSCD(8)
Application of Chinese Sentence Similarity Computation in FAQ
PEI Jing; BAO Hong
Computer Engineering    2009, 35 (17): 46-48.   DOI: 10.3969/j.issn.1000-3428.2009.17.015
Abstract881)      PDF (324KB)(4598)      
By improving the traditional Chinese sentence similarity model, this paper proposes a method based on key words weighted to compute sentence similarity, and a question answer system based on Frequently Asked Question(FAQ) is implemented. This system automatically computes sentence similarity between users’ questions in natural language and questions in FAQ, and returns the answer to the user. It can also automatically update and maintain FAQ. Test result shows that compared with traditional sentence similarity model, this method has more precision in matching question.
Related Articles | Metrics
Cited: Baidu(18) CSCD(8)