Most Download articles

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

All

Please wait a minute...


For Selected: Download Citations EndNote Ris BibTeX Toggle Thumbnails

Select

Novel stability based segmented backup routing protocol ZHANG Hui 1，2，DONG Yu-ning 1，YANG Long-xiang 1，ZHU Hong-bo 1 Computer Engineering and Applications    2010, 46 (19): 14-17.   DOI: 10.3778/j.issn.1002-8331.2010.19.004 Abstract （2824）      PDF（pc） （1364KB）（91348）       Knowledge map    Save Various QoS routing protocols based on stability are briefly reviewed.The implementation method of path stability computation model is given.A novel stability based segmented backup routing protocol is proposed by combining the path stability computation method with segmented backup routing strategy.The proposed routing protocol is analyzed theoretically. Related Articles | Metrics

Select

Two dimensional heat conduction equation finite volume method to achieve on MATLAB XUE Qiong1, XIAO Xiaofeng2 Computer Engineering and Applications    2012, 48 (24): 197-200.   Abstract （8446）      PDF（pc） （544KB）（7138）       Knowledge map    Save Two dimensional diffusionless heat conduction phenomenon has been described on partial differential equation. Based on finite volume method, discretized algebraic equation of partial differential equation has been deduced. Different coefficients and source terms have been discussed under different boundary conditions, which include prescribed heat flux, prescribed temperature, convection and insulation. Transient heat conduction analysis of infinite plate with uniform thickness and two dimensional rectangle region is realized by programming using MATLAB. It is useful to make the heat conduction equation more understandable by its solution with graphical expression. Feasibility and stability of numerical method have been demonstrated by running result. Related Articles | Metrics

Select

Survey of personalized recommendation system WANG Guoxia, LIU Heping Computer Engineering and Applications    2012, 48 (7): 66-76.   Abstract （2830）      PDF（pc） （816KB）（6031）       Knowledge map    Save Information overload is one of the most critical problems, and personalized recommendation system is a powerful tool to solve this problem. In this article, the definition of recommendation system is introduced, this article also expounds some key technologies including user modeling, recommendation item modeling and recommendation algorithm. The recommendation frame and evaluation methods are also exhibited. This article tries to give the difficulties and future directions of recommendation system. Related Articles | Metrics

Select

Application on algorithm of permutation matrix in rough set attribute reduction YUN Shi-wei,ZHANG Yong-sheng Computer Engineering and Applications    2009, 45 (13): 45-46.   DOI: 10.3778/j.issn.1002-8331.2009.13.013 Abstract （3291）      PDF（pc） （351KB）（5753）       Knowledge map    Save The boolean matrix representation of rough set theory and the concept of permutation matrix are introduced，the relationship between attribute reduction and permutation matrix is derived，the theory about the solution of the logical equations is discussed，and the novel algorithm in rough set attributes reduction based on permutation matrix is proposed，the validity of the algorithm is proved by means of an example，and it shows that the algorithm possesses use for reference in rough set attribute reduction and practical significance for its application. Related Articles | Metrics

Select

Attention-YOLO：YOLO Detection Algorithm That Introduces Attention Mechanism XU Chengji, WANG Xiaofeng, YANG Yadong Computer Engineering and Applications    2019, 55 (6): 13-23.   DOI: 10.3778/j.issn.1002-8331.1812-0010 Abstract （3120）      PDF（pc） （1426KB）（4974）       Knowledge map    Save YOLOv3 is a real-time object detection algorithm, its speed and accuracy reach good trade-off, but the disadvantages are that the boundary box positioning is inaccurate and it is difficult to distinguish overlapping objects. For the above problems, this paper proposes the Attention-YOLO algorithm based on the item-wise attention mechanism which embeds channel and spatial attention mechanism in the feature extraction network, uses the filtered weighted feature vector to replace the original residual fusion, and adds a second-order item to reduce the information loss in the process of fusion and accelerate the convergence of the model. Based on the experiments on COCO and PASCAL VOC datasets, the results show that the Attention-YOLO algorithm effectively reduces the boundary box positioning loss and improves the detection accuracy. Compared with YOLOv3, the Attention-YOLO improves at most 2.5 mAP@IoU[0.5∶0.95] on COCO dataset, and reaches 81.9 mAP on PASCAL VOC 2007 test. Related Articles | Metrics

Select

Algorithm for finding shortest path which must go through specified intermediate node set HUANG Shuli, HU Dasha, JIANG Yuming Computer Engineering and Applications    2015, 51 (11): 41-46.   Abstract （5433）      PDF（pc） （546KB）（4513）       Knowledge map    Save The vast majority of researches about the shortest path algorithm, nowadays, focus just on the case starting from the beginning point and ending at the ending point. If additional condition that the shortest path must go through some given nodes of which number is uncertain must be met, then most of the existing classic algorithms are not applicable. A general method based on the classical Dijkstra algorithm and greedy algorithm is presented to solve this kind of problem. The main method is to split the relevant node set into three sub sets, find the local shortest path of connecting the three subset separately to form the global shortest path to be selected, obtain the target path through screening. The time complexity of the algorithm is given by theoretical analysis and the effectiveness of the algorithm is verified by programming calculation. Related Articles | Metrics

Select

Segmentation method for merged characters in CAPTCHA based on drop fall algorithm LI Xingguo1，2, GAO Wei1 Computer Engineering and Applications    2014, 50 (1): 163-166.   Abstract （7246）      PDF（pc） （466KB）（4444）       Knowledge map    Save Many researches demonstrate that good result can be gained by existing machine learning algorithms in the recognization of CAPTCHA（Completely Automated Public Turing test to tell Computers and Humans Apart） if single characters can be split. A method is presented to segment the merged characters in the recognization of CAPTCHA with touching characters. It seeks division points by combining the statistics of character width and the vertical histogram projection minimums, and then uses these points as the starting points of the drop fall algorithm to segment merged characters in CAPTCHA. The experiments show that it is a general method and can improve the recognization rate. Related Articles | Metrics

Select

Parameter optimizing for Support Vector Machines classification FENG Guohe Computer Engineering and Applications    2011, 47 (3): 123-124.   DOI: 10.3778/j.issn.1002-8331.2011.03.037 Abstract （4043）      PDF（pc） （459KB）（4236）       Knowledge map    Save Support Vector Machine（SVM） has good performance for classification，but the performance is restricted by the kernel function and its parameters.This paper discusses the problem，and uses cross validation，grid searching for optimizing the kernel function parameters. Related Articles | Metrics

Select

Design of loop compensator for digital DC/DC switching power supply WANG Bin，HUANG Jian-ming Computer Engineering and Applications    2010, 46 (34): 70-73.   DOI: 10.3778/j.issn.1002-8331.2010.34.022 Abstract （2724）      PDF（pc） （554KB）（4090）       Knowledge map    Save The small signal model of the closed-loop control system for the DC/DC switching power supply in s-domain is built.The digital compensator design is based on digital redesign approach.The analog compensator in s-domain is designed firstly using Bode plot and root-locus techniques，and discretized to a z-domain compensator.The delay effects associated with the AD converter and the DPWM circuits are introduced to build block diagram of the system，so that the impact of sampling rate is considered to improve the design.The digital compensator achieves accurate and programmable control of PWM regulation to ensure high dynamic performance for the closed loop operation of the converter.The simulation results verify the performance of the compensator. Related Articles | Metrics

Select

Survey on active learning algorithms LIU Kang, QIAN Xu, WANG Ziqiang Computer Engineering and Applications    2012, 48 (34): 1-4.   Abstract （9820）      PDF（pc） （572KB）（3986）       Knowledge map    Save As a method of constructing an effective training set, the goal of active learning algorithm is to find informative sample which can enhance the classification results of the model during the iteration, thereby reducing the size of the training set and improving the efficiency of the model within the limited time and resources. At present, active learning has become a hot issue in the field of pattern recognition, machine learning and data mining. The fundamental ideas, some latest research results and algorithm analysis of active learning are introduced. Some problems for further research are presented and analyzed. Related Articles | Metrics

Select

Hybrid algorithm for rounding rail guided vehicle optimization scheduling JIANG Wei, HE Fei, TONG Yifei, LI Dongbo Computer Engineering and Applications    2016, 52 (22): 242-247.   Abstract （1691）      PDF（pc） （581KB）（3843）       Knowledge map    Save In order to find out the shortest time that traverses all blocks to solve the circular orbit RGV（rail guided vehicles） scheduling problem in automated warehouse, this paper analyzes the main influencing factors and then proposes the goal that find out the shortest path and the least clogging scheme. Mathematical model is established and rule-based Genetic Algorithm is designed to solve the problem. This paper uses adaptive crossover and mutation probability to replace traditional fixed parameters to solve the problem that genetic algorithm is easy to fall into the phenomenon of local optima. An improved dynamic exploring process is advanced for the multi-objective optimization. In the end, the genetic operators are analyzed by experimental comparisons and the algorithm is validated by experiments. Related Articles | Metrics

Select

Comparison and analysis of matrix multiplications on GPU and CPU LIU Jinfeng，GUO Lei Computer Engineering and Applications    2011, 47 (19): 9-11.   Abstract （2273）      PDF（pc） （456KB）（3664）       Knowledge map    Save Three matrix multiplications on CPU and four CUDA-based matrix multiplications on GPU are described，the causes of high performance are analyzed and the common characteristic of efficient algorithm is that data are properly organized and rationally utilized，and therefore the access cost effectively reduced and the speed is greatly improved.The best optimized implementation on CPU gain more 200 times fast than the common one，the best optimized implementation on GPU gain about 6 times fast than the best one on CPU. Related Articles | Metrics

Select

Summary of crossover operator of genetic algorithm LI Shuquan1, SUN Xue1, SUN Dehui1, BIAN Weipeng2 Computer Engineering and Applications    2012, 48 (1): 36-39.   Abstract （1451）      PDF（pc） （545KB）（3624）       Knowledge map    Save Crossover is an important operator in genetic algorithm. This paper gives a brief introduction about some mature crossover operators, discusses some improved crossover operators from different aspects, such as the application of theory, mechanism and so on. Through the analysis, it is found that the improved crossover operators can overcome the shortcomings of the traditional genetic algorithm, improve search efficiency and accuracy and avoid premature convergence. This paper points out the crossover operators’ research direction, which makes the foundation for the development and application of genetic algorithms in the future. Related Articles | Metrics

Select

Clone detection method based on path sequence similarity determination LV Boran, WU Junhua Computer Engineering and Applications    2018, 54 (2): 55-61.   DOI: 10.3778/j.issn.1002-8331.1608-0344 Abstract （622）      PDF（pc） （922KB）（3604）       Knowledge map    Save Code clone is a common phenomenon in the software system. The program code is converted to path execution sequence constituted by program nodes, through static analysis, by attribute definitions of nodes in this paper, and the calculation for the similarity is solved by discrete sequence similarity detection distance, line model and sequence correlation coefficient, and similarity between different programs. The experiments and data analysis verify the feasibility of this approach. Related Articles | Metrics

Select

Survey of development and application of multi-agent technology LI Yang, XU Feng, XIE Guangqiang, HUANG Xianglong Computer Engineering and Applications    2018, 54 (9): 13-21.   DOI: 10.3778/j.issn.1002-8331.1712-0139 Abstract （1272）      PDF（pc） （642KB）（3556）       Knowledge map    Save First of all, the definition and characteristics of multi-agent technology is introduced. By analyzing the literature on application of multi-agent technology at home and abroad, the basic research of multi-agent system is analyzed and the technical development of the direction of multi-agent consensus and control are combed. Then, this article chooses the two fields of robot control and wireless sensor networks to focus on the application changes and the latest achievements of multi-agent technology in practical engineering in recent years. Finally, this paper summarizes main problems to be solved in engineering application, and points out the research direction of future multi-agent system application. Related Articles | Metrics

Select

Fast Vehicle Detection Method Based on Improved YOLOv3 ZHANG Fukai, YANG Feng, LI Ce Computer Engineering and Applications    2019, 55 (2): 12-20.   DOI: 10.3778/j.issn.1002-8331.1810-0333 Abstract （4122）      PDF（pc） （1241KB）（3519）       Knowledge map    Save Vehicle detection on image or video data is an important but challenging task for urban traffic surveillance. The difficulty of this task is to accurately locate and classify relatively small vehicles in complex scenes. In response to these problems, this paper presents a single deep neural network（DF-YOLOv3） for fast detecting vehicles with different types in urban traffic surveillance. DF-YOLOv3 improves the conventional YOLOv3 by first enhancing the residual network to extract vehicle features, then designing 6 different scale convolution feature maps and merging with the corresponding feature maps in the previous residual network, to form the final feature pyramid for performing vehicle prediction. Experimental results on the KITTI dataset demonstrate that the proposed DF-YOLOv3 can achieve efficient detection performance in terms of accuracy and speed. Specifically, for the 512×512 input model, using NVIDIA GTX 1080Ti GPU, DF-YOLOv3 achieves 93.61% mAP（mean average precision） at the speed of 45.48 f/s（frames per second）. Especially, as for accuracy, DF-YOLOv3 performances better than those of Fast R-CNN, Faster R-CNN, DAVE, YOLO, SSD, YOLOv2, YOLOv3 and SINet. Related Articles | Metrics

Select

Research on representative algorithms of swarm intelligence YU Jian-ping 1，ZHOU Xin-min 2，CHEN Ming 1 Computer Engineering and Applications    2010, 46 (25): 1-4.   DOI: 10.3778/j.issn.1002-8331.2010.25.001 Abstract （3035）      PDF（pc） （631KB）（3476）       Knowledge map    Save Swarm intelligence has the characteristics of the collective intelligence emerging from the cooperation of individuals with little intelligence，which provides basic solutions for the complicated distributed problems under the conditions without central control and global model.The potential features of the parallel and distribution make the swarm intelligence an important direction in computer domain.After introducing the basic swarm intelligence model，two kinds of the swarm intelligence-based representative algorithms——The particle swarm optimization and the ant colony optimization are detailed and the characteristics of them are compared.Finally，the future research aspects of the swarm intelligence are emphatically suggested，especially the broad-applied ant algorithms. Related Articles | Metrics

Select

Next generation automotive network：technology status and development of automotive ethernet in-vehicle network HU Buqin1, QIN Guihe1, LIU Ying2, YU He1, WU Xingchen1 Computer Engineering and Applications    2016, 52 (24): 29-36.   Abstract （2098）      PDF（pc） （608KB）（3456）       Knowledge map    Save Using Ethernet technology and architecture as the direction of the next-generation in-vehicle networks receives widespread concern by the automotive industry and communications technicians. The demand for transmission bandwidth of ADAS and entertainment system promotes the process of Ethernet network involved in automotive network. This paper analyzes the problems when in-vehicle network faces high bandwidth requirements, describes the evolution of Ethernet in-vehicle networks, and discusses the Ethernet technology for the automotive industry. Related Articles | Metrics

Select

Effective time series outlier detection algorithm based on segmentation ZHOU Da-zhuo 1,2,LIU Yue-fen 2,MA Wen-xiu 2 Computer Engineering and Applications    2008, 44 (35): 145-147.   DOI: 10.3778/j.issn.1002-8331.2008.35.044 Abstract （3187）      PDF（pc） （588KB）（3399）       Knowledge map    Save A new time series outlier detection algorithm of high-efficiency is proposed for the foundation of k-nearest local outlier detection algorithm based on segmentation.Firstly，series important point as segmentation point can compress high-proportionally time series data in this algorithm；Secondly，the outlier pattern of time series can be detected by local outlier detection technique.Experimental results on electrocardiogram（ECG） data show that the algorithm is effective and reasonable. Related Articles | Metrics

Select

FPGA-based design for convolution neural network FANG Rui, LIU Jiahe, XUE Zhihui, YANG Guangwen Computer Engineering and Applications    2015, 51 (8): 32-36.   Abstract （5928）      PDF（pc） （567KB）（3389）       Knowledge map    Save According to the characteristics of the Convolution Neural Network（CNN）, a FPGA-based acceleration program which uses deep-pipeline architecture is proposed for the MNIST data set. In this program, theoretically 28×28 clock cycles can finish the whole calculation and get the output of the CNN. For the propagation stage of the training process, and in the same network structure and the same data set, this FPGA program with 50 MHz frequency can achieve nearly five times speedup compared to GPU version（Caffe）, achieve eight times speedup compared to 12 CPU cores. While the FPGA program just costs 26.7% power which GPU version costs. Related Articles | Metrics

Select

Research overview of object detection methods FANG Luping1, HE Hangjiang1, ZHOU Guomin2 Computer Engineering and Applications    2018, 54 (13): 11-18.   DOI: 10.3778/j.issn.1002-8331.1804-0167 Abstract （2382）      PDF（pc） （716KB）（3282）       Knowledge map    Save Object detection is an important problem in computer vision, which has critical research value in the field of pedestrian tracking, license plate recognition and unmanned driving. In recent years, the accuracy of image classification is greatly improved with deep learning, thus the object detection methods based on deep learning have gradually become mainstream. The development and present situation of object detection methods are reviewed, and a prospect is made. Firstly, the development, improvement and deficiency of the traditional algorithms and depth learning-based algorithms are summarized, and then compared. Finally, the difficulties and challenges of the object detection method based on deep learning are discussed, and the possible development direction is prospected. Related Articles | Metrics

Select

Review of Intent Detection Methods in Human-Machine Dialogue System LIU Jiao, LI Yanling, LIN Min Computer Engineering and Applications    2019, 55 (12): 1-7.   DOI: 10.3778/j.issn.1002-8331.1902-0129 Abstract （1267）      PDF（pc） （700KB）（3277）       Knowledge map    Save Spoken Language Understanding（SLU） is a vital part of the human-machine dialogue system, which includes an important sub-task called intent detection. The accuracy of intent detection is directly related to the performance of semantic slot filling, and it is helpful to the following research of the dialogue system. Considering the difficulty of intent detection in human-machine dialogue system, the traditional machine learning methods cannot understand the deep semantic information of user’s discourse. This paper mainly analyzes, compares and summarizes the deep learning methods applied in the research of intent detection in recent years, and further considers how to apply deep learning model to multi-intent detection task, so as to promote the research of multi-intent detection methods based on deep neural network. Related Articles | Metrics

Select

Analysis of users and users’ Weibo information in Sina Weibo LIANG Hong, XU Nanshan, LU Gang Computer Engineering and Applications    2015, 51 (7): 141-148.   Abstract （10102）      PDF（pc） （586KB）（3223）       Knowledge map    Save Based on the relationship network of Weibo users, the number of fans, User PR values and users’ activities are considered as measurements of users’ influence on Weibo with the distributions of the three factors. Results show that both the distributions of the number of fans and User PR values follow power-law distribution. It is found that there are much more verified users in top User PR ranking list than in fans ranking list and it is suggested that top activity users are much more popular in advertisement campaign after analyzes the top users and their posts in fans ranking, User PR ranking and activity ranking. It is also found that Sina Weibo users prefer to repost and comment on other users’ Weibo. There are a large number of images, videos and links on Sina Weibo, and most of them are reposted from another user. Related Articles | Metrics

Select

Research Overview of Variational Auto-Encoders Models ZHAI Zhengli, LIANG Zhenming, ZHOU Wei, SUN Xia Computer Engineering and Applications    2019, 55 (3): 1-9.   DOI: 10.3778/j.issn.1002-8331.1810-0284 Abstract （1844）      PDF（pc） （1092KB）（3181）       Knowledge map    Save Variational Auto-Encoders（VAE） as one of deep latent space generative models have been immensely success on its performance in recent years, especially in image generation. VAEs models are important tools for unsupervised feature learning, which can learn a mapping from a latent encoding space to a data generative space and reconstruct the inputs to outputs. Firstly, this paper reviews the development and present research situation of the traditional variational auto-encoders and its variants, summarizes and compares the performance for all of them. Finally, the existing difficulties and challenges of VAEs are analyzed, and the possible development direction is prospected. Related Articles | Metrics

Select

Method for YouTube bitrate and resolution identification in mobile networks LIN Gaoquan1, PAN Wubin2, 3, CHENG Guang2, 3, XU Jian2, 3 Computer Engineering and Applications    2017, 53 (15): 18-24.   DOI: 10.3778/j.issn.1002-8331.1704-0394 Abstract （505）      PDF（pc） （1185KB）（3149）       Knowledge map    Save YouTube as the world’s largest video provider, the proportion of video traffic in network traffic is increasing. A lot of video traffic has brought great challenges to the Internet service provider. With the encryption of YouTube traffic, it is important to get video QoE evaluation information from HTTPS encrypted traffic. Based on the analysis of the streaming media transmission mode adopted by YouTube App on Android and IOS platform, this paper proposes a combination of C4.5 decision tree and [k]-means clustering to carry out resolution identification of all the video chunks when users watch the videos. The experimental results show that the method can accurately identify the bitrate and resolution of each video chunk in the video playback process. Related Articles | Metrics

Select

Survey of Knowledge Reasoning Based on Neural Network ZHANG Zhongwei1，2, CAO Lei1, CHEN Xiliang1, KOU Dalei1，3, SONG Tianting2 Computer Engineering and Applications    2019, 55 (12): 8-19.   DOI: 10.3778/j.issn.1002-8331.1901-0358 Abstract （915）      PDF（pc） （777KB）（3054）       Knowledge map    Save Knowledge reasoning is an important means of knowledge graph completion and has always been one of the research hotspots in the field of knowledge graph. With the development of neural network, its applications in knowledge reasoning have been paid more and more attention in recent years. The knowledge reasoning methods based on neural network have not only stronger reasoning and generalization abilities, but also higher utilization rates of entities, attributes, relations and text information in the knowledge base. These methods are more effective in reasoning. The relevant concepts of knowledge graph and knowledge graph completion are introduced, the concepts and basic principles of knowledge reasoning are indicated, and then the latest research progresses of the technology of knowledge reasoning based on neural network are reviewed. The existing problems and development directions of knowledge reasoning in the aspect of theory, algorithm and application are summarized. Related Articles | Metrics

Select

Collaborative filtering algorithm based on matrix decomposition LI Gai1，2，3，LI Lei2，3 Computer Engineering and Applications    2011, 47 (30): 4-7.   Abstract （7009）      PDF（pc） （588KB）（3054）       Knowledge map    Save Collaborative filtering recommendation algorithm is one of the most successful technologies in the e-commerce recommendation system.Aiming at the problem that traditional collaborative filtering algorithms generally exist sparseness resistance and extendibility，in this paper，a CF algorithm，alternating-least-squares with weighted-[λ]-regularization（ALS-WR） is described.That is，by using regularization constraint to the traditional matrix decomposition model to prevent model overfitting training data and using alternating-least-squares method to train the decomposition model.The experimental evaluation using two real-world datasets shows that ALS-WR achieves better results in comparison with several classical collaborative filtering recommendation algorithms not only in extendibility but also in sparseness resistance. Related Articles | Metrics

Select

Annotated survey on data mining technique based demographic data predictive models SHI Rui-feng,ZHOU Yi-min Computer Engineering and Applications    2008, 44 (9): 1-6.   Abstract （3417）      PDF（pc） （1329KB）（3003）       Knowledge map    Save A comprehensive investigation on data mining technique based demographic data predictive models，which include both domestic and abroad researches，has been brought forward in this paper. All the models are classified and compared with regard to specific prediction purposes. After analyzing the merits and disadvantages of these models，prospects are proposed for further study. Related Articles | Metrics

Select

Chinese resume information automatic extraction and recommendation algorithm GU Nannan, FENG Jun, SUN Xia, ZHAO Yan, ZHANG Lei Computer Engineering and Applications    2017, 53 (18): 141-148.   DOI: 10.3778/j.issn.1002-8331.1612-0406 Abstract （698）      PDF（pc） （851KB）（2946）       Knowledge map    Save In order to solve the problem of laborious and time-consuming artificial selection from mass electronic resumes, a solution to resumes automatic extraction and recommendation is proposed. Firstly, the sentences in Chinese resume are represented as vectors through word segmentation, part-of-speech tagging and other preprocessing steps, then SVM classification algorithm is used to classify the sentences into six predefined general classes, such as personal basic information, job intension, working experience and so on. Secondly, according to the lexical and grammatical features of personal basic information block, the rules are constructed by hand to extract the key information like Name, Gender, and Contact information. While the HMM model is used to extract the detailed information in complex information blocks, and puts forward rules and statistics based resume information extraction method. Finally, a Content-Based Reciprocal Recommender algorithm （CBRR） is proposed, which takes into account the preferences of both enterprise and job seekers. The experiment results show that the solution proposed in this paper can assist enterprises in recruitment, improve screening efficiency and save recruitment costs. Related Articles | Metrics

Select

Attention Mechanism-Based CNN-LSTM Model and Its Application LI Mei1，2, NING Dejun1, GUO Jiacheng1，2 Computer Engineering and Applications    2019, 55 (13): 20-27.   DOI: 10.3778/j.issn.1002-8331.1901-0246 Abstract （2476）      PDF（pc） （914KB）（2904）       Knowledge map    Save Time series have temporal property, and the characteristics of its short sequences are different in importance. Aiming at the characteristics of time series, a neural network prediction model based on Convolution Neural Network（CNN） and Long Short-Term Memory（LSTM） is proposed, which combines coarse and fine grain features to achieve accurate time series prediction. The model consists of two parts. CNN based on attention mechanism adds attention branch to standard CNN network to extract important fine-grained features. The back end is LSTM, which extracts the coarse-grained features of the hidden time series from fine-grained features. Experiments on real cogeneration heat load dataset demonstrate that the model is better than the autoregressive integrated moving average, support vector regression, CNN and LSTM models. Compared with the pre-determined method currently used by enterprises, the Mean Absolute Scaled Error（MASE） and Root Mean Square Error（RMSE） have been increased by 89.64% and 61.73% respectively. Related Articles | Metrics

Select

Review on universal no-reference image quality assessment algorithm ZHANG Shufang, ZHANG Cong, ZHANG Tao, LEI Zhichun Computer Engineering and Applications    2015, 51 (19): 13-23.   Abstract （4864）      PDF（pc） （842KB）（2855）       Knowledge map    Save Image quality assessment can effectively evaluate distortion or degradation caused by image acquisition and transmission process, which has a broad application prospect in the field of digital multimedia. And because of no need any pristine knowledge of reference images, no-reference image quality assessment has become an advanced research hotspot in the field of image quality assessment. On the basis of extensive research of literatures at home and abroad, in both of algorithm principle and performance comparison, this paper systematically introduces several state-of-the-art no-reference IQA algorithms, such as BIQI, DIIVINE, BLIINDS, BLIINDS-II, BRISQUE, NIQE and GRNN. Firstly, the methods of feature extraction and the principle of quality assessment of each algorithm are introduced. Secondly, the algorithms above are simulated and evaluated on the LIVE image database, and the performance and execution speed of the algorithms are analyzed and compared. At last, the further research trends of no-reference image quality assessment are proposed. Although these no-reference image quality assessments reviewed in this paper have satisfactory performance, their processes of evaluating image quality heavily depend on opinion data of image quality in the image database, and there still exist some deficiencies in evaluation?performance and algorithm complexity. Therefore, it is necessary to make further study in this field. Related Articles | Metrics

Select

Homology analysis of malicious code and family clustering QIAN Yucun, PENG Guojun, WANG Ying, LIANG Yu Computer Engineering and Applications    2015, 51 (18): 76-81.   Abstract （2888）      PDF（pc） （619KB）（2852）       Knowledge map    Save With the problem of the explosive growth of malicious code and many of the malicious samples are variations of previously encountered samples, this paper presents a novel approach to investigate the homology of malicious code based on behavior characteristics. To distinguish the variations of malicious code, it studies the malicious behavior of malwares, then computes the similarity of characteristics and the call graphs which are extracted by disassembly tools. It employs the clustering algorithms of DBSCAN to discover the family of malicious code. Experiments show that it effectively investigates the homology of malicious code and cluster variations into different malicious code family. Related Articles | Metrics

Select

U-Net Based Semantic Segmentation Method for High Resolution Remote Sensing Image SU Jianmin, YANG Lanxin, JING Weipeng Computer Engineering and Applications    2019, 55 (7): 207-213.   DOI: 10.3778/j.issn.1002-8331.1806-0024 Abstract （2973）      PDF（pc） （1317KB）（2793）       Knowledge map    Save Image segmentation is an important base-part of remote sensing interpretation. High resolution remote sensing image contains complex object information, but the applications of traditional segmentation methods are greatly limited. The segmentation method, represented by the deep convolution neural network, has made a breakthrough in many fields. Aiming at the problem of high resolution remote sensing image segmentation, this paper proposes a deep convolution neural network based on U-Net, which achieves the end to end pixel level semantic segmentation. It expands the original dataset, trains a binary classification model for every class of objects, and then combines the prediction subgraphs to generate the final semantic segmentation image, which has helped us get 94% training accuracy and 90% test accuracy on the dataset of AI classification and recognition contest of CCF satellite images. The experimental results show that the network not only has good generalization ability but also can be used in practical engineering with high segmentation accuracy. Related Articles | Metrics

Select

Study of SLAM based on NDT scan-matching for home service robot LI Xian-shan，ZHAO Feng-da，KONG Ling-fu Computer Engineering and Applications    2009, 45 (25): 246-248.   DOI: 10.3778/j.issn.1002-8331.2009.25.076 Abstract （2337）      PDF（pc） （715KB）（2754）       Knowledge map    Save Normal Distributions Transform（NDT） is used in scan-matching based SLAM，and map-building is implemented in larger scale indoor environment by home service robots.The matching between geometrical features is replaced by the matching of normal probability distribution of scanning points in this method，and effectively resolves the problem of slower speed of existing scan-matching method. Related Articles | Metrics

Select

Efficient short texts keyword extraction method analysis CHANG Peng1，MA Hui2 Computer Engineering and Applications    2011, 47 (20): 126-128.   Abstract （1756）      PDF（pc） （445KB）（2748）       Knowledge map    Save In order to overcome the shortcoming of traditional methods of subject extraction，such as the theme drifting and theme misjudging，a new keywords extraction algorithm based on co-occurrence analysis is proposed in this paper.The word’s weight is adjusted by its ability of associating with other words.The word that occurred with more words has greater impact and is extracted firstly.The experimental results show that the summarization generated by the improved algorithm gets better performance than other methods both in recall and precision. Related Articles | Metrics

Select

Review on sparse optimization algorithms YU Chunmei Computer Engineering and Applications    2014, 50 (11): 210-217.   Abstract （4105）      PDF（pc） （738KB）（2723）       Knowledge map    Save Compressed Sensing（CS） is a new theoretical frame about information acquisition and processing developed in recent years. This paper gives an introduction to the basic theory of CS, focused on sparse optimization algorithms, which are divided into three classes in this paper：active set methods, projection operator methods and classical convex programming methods. The basic idea, main research progresses, and adaptive optimization problems of each method are discussed. Finally, some open problems and research directions in sparse optimization of CS are pointed out. Related Articles | Metrics

Select

New effective method on content based audio feature extraction ZHENG Ji-ming 1,WEI Guo-hua 2,WU Yu 2 Computer Engineering and Applications    2009, 45 (12): 131-133.   DOI: 10.3778/j.issn.1002-8331.2009.12.043 Abstract （2010）      PDF（pc） （563KB）（2715）       Knowledge map    Save Feature extraction is the foundation of the audio classification，and good features will enhance the classification accuracy effectively.In this paper，Mel-frequency cepstrum coefficients are extracted from frequency domain of audio.At the same time，features are extracted from wavelet domain after discrete wavelet transform is done for each frame of the audio.Then the features from the frequency domain and wavelet domain are combined to calculate the statistical features.Finally，audio template is established according to the Support Vector Machine（SVM），and it is classified and identified into speech，music and speech with music.Tests show that the method gets comparatively high identification accuracy. Related Articles | Metrics

Select

Survey on development of expert system ZHANG Yu-dong，WU Le-nan，WANG Shui-hua Computer Engineering and Applications    2010, 46 (19): 43-47.   DOI: 10.3778/j.issn.1002-8331.2010.19.012 Abstract （3232）      PDF（pc） （1323KB）（2691）       Knowledge map    Save To survey the development of expert system，this paper partitions expert systems as 5 stages： rule-based， frame-based，case-based，ontology-based，and web-based，on the basis of development sequence.In each stage the concept of corresponding expert system is analyzed，the typical algorithm is put forward，and some representative examples are advanced. Then，the development law is proposed，which is advised to consist of principle development law and technique development law.The principle development obeys the negation of negation law while the technique development can be seen as the interdisciplinary. In the end，the further direction of research is predicted. Related Articles | Metrics

Select

Model and algorithm for set cover problem WANG Jiqiang Computer Engineering and Applications    2013, 49 (17): 15-17.   Abstract （3109）      PDF（pc） （451KB）（2673）       Knowledge map    Save The set cover problem has favourable applications in areas of network design, but it is NP-hard in computational complexity. A 0-1 program model is formulated for the set cover problem. An approximation algorithm deriving from greedy idea is put forward, and is proved from the angle of primal-dual program. A case study of sensor network optimal design based on LINGO software demonstrates correctness of the model and effectiveness of the algorithm. Related Articles | Metrics

Select

Review of distributed consensus problem in multi-agent system LONG Hui1，2, FAN Xiaoping1, LIU Shaoqiang1 Computer Engineering and Applications    2013, 49 (1): 36-42.   Abstract （4748）      PDF（pc） （628KB）（2654）       Knowledge map    Save This paper summarizes the development of distributed consensus problem of multi-agent system. Several common definitions and parameters related to characteristics of consensus algorithm firstly are introduced from theoretically aspects. Consensus protocols and main results are summed up in recent years. The progresses of application about consensus algorithm are presented. Finally, the future directions of open area are proposed. Related Articles | Metrics