18 November 2011, Volume 37 Issue 22
-
Select all|
-
Computer Engineering. 2011, 37(22): 1-4. https://doi.org/10.3969/j.issn.1000-3428.2011.22.001
This paper proposes a kind of mobile botnet based on Android system, including the design of command and control channel, the way that botmaster recycles the information of controlled phones. It analyzes the malicious act of the bot phones, gives the defense of hijack, including the multiserver strategy, the domain-flux technology, and the identity authentication system. It reduces the flow rate of bot program by RSS and GZIP technology. The future and the defense of mobile botnet are discussed.
-
Computer Engineering. 2011, 37(22): 5-7. https://doi.org/10.3969/j.issn.1000-3428.2011.22.002
To enhance the accuracy and efficiency of endpoint detection, a detection method based on Circular Autocorrelation Function(CACF) is proposed. The method calculates CACF of the speech, defines the loss functions of state and state transforming with the values of CAF and the short-term energy, and decides the voiced endpoints with dynamic programming. Experimental results display several comparisons including that among detections using the traditional Autocorrelation Function(CAF), average magnitude difference function and the CACF, which demonstrate that CACF improves the accuracy and efficiency of endpoint detection and better resists the acoustic noise than the traditional energy and spectral entropy method.
-
Computer Engineering. 2011, 37(22): 8-11. https://doi.org/10.3969/j.issn.1000-3428.2011.22.003
Ostu Dual-threshold Image Segmentation Algorithm Based on Bacterial Chemotaxis
-
Computer Engineering. 2011, 37(22): 12-18. https://doi.org/10.3969/j.issn.1000-3428.2011.22.004
Aiming at shortcomings that current network attack models can not be efficiently suitable for complicated network systems, a global network attack model based on the hierarchical expanded Stochastic Petri Net(SPN) is presented. The model can describe both macroscopic network attack and microcosmic host attack synthetically, and is very suitable for the cooperative attack simulation. It can solve efficiently the network states space explosion problem. Based on the model, the model generation algorithm is represented and potential attack relationships among hosts are dug for according to the definition of rough attack path. The Ant Colony Algorithm(ACA) is utilized to find k-critical vulnerable paths after expanding sub Petri net. By analyzing rough attack paths and accurate attack paths synthetically, a network risk evaluation method is proposed.
-
Computer Engineering. 2011, 37(22): 19-23. https://doi.org/10.3969/j.issn.1000-3428.2011.22.005
With respect to visual character descriptions and extractions of boundary structural irregularity, a novel method is proposed in the paper on a reconstructed structural component of a tumour contour using Local Fractal Dimension(LFD). A neural network is utilized to implement skin tumour classifications on boundary structural irregularity, then by using wavelet decomposition and Hausdroff Distance analysis, frequency bands for structural components of tumour boundaries(significant wavelet sub-bands) are determined, and based on the structural components of reconstructed boundaries, features of irregularity which are extracted from LFD are used for melanomas classification. Experimental results show that the method proposed in the paper has advantages in classification accuracy, specialty and sensitivity.
-
Computer Engineering. 2011, 37(22): 24-27. https://doi.org/10.3969/j.issn.1000-3428.2011.22.006
To address the memory wall issue of the high performance hybrid computing systems, this paper proposes a novel hierarchical explicit memory access mechanism based on the analysis of hybrid computing mode and the limitations of the traditional memory access mechanism. The proposed mechanism is implemented and evaluated on a multi-core hybrid computing system Engineering and Scientific Computing Architecture (ESCA). Experimental results show that the hidden of memory access latency can occupy 56% of the total run time and achieve 1.5 times speedup with the kernel of DGEMM, which proves that the proposed memory access mechanism is beneficial to fill the gap between computing and memory, thus improving the system efficiency.
-
Computer Engineering. 2011, 37(22): 28-31. https://doi.org/10.3969/j.issn.1000-3428.2011.22.007
IGRS and UPnP are the two main protocols in the field of digital home net work, but the two devices cannot interact directly. Oriented to this problem, the paper reviews some related works at the beginning. A transformation engine for link IGRS and UPnP devices seamlessly is discussed by analysis of addressing, device/service discover, service control and other levels. According to the engine, the working mechanism for invoking block is explained in details, the engine architecture and transfer method for device/service description are presented. It developes a bridge based on the transformation engine. Experimental results validate that these two heterogeneous home network protocols can interact seamlessly without doing anything to the existing devices. Besides, the stability of the bridge is also verified.
-
Computer Engineering. 2011, 37(22): 32-34. https://doi.org/10.3969/j.issn.1000-3428.2011.22.008In order to efficiently make disease diagnosis and prevention, a medical data mining with weight based on optimal risk and prevention model is proposed. It generates attribute-value items associated with disease based on optimal risk and prevention model, and the weight of attribute-value items is determined by Risk and Prevention Set with Weight(RPSW) algorithm. The algorithm is tested by two benchmark medical data sets. Experimental results show that the algorithm can obtain representative attribute-value items in medical data, and each attribute-value item is assigned to a weight so as to achieve better performance.
-
Computer Engineering. 2011, 37(22): 35-38. https://doi.org/10.3969/j.issn.1000-3428.2011.22.009Traditional clustering method for attribute space ignores the object relationship information. In order to improve it, transforming the relationship into special attribute named relation attribute, a method for computing the dissimilarity for the relation attribute is raised. After changing interval and ordinal variables into standard interval variable, changing categorical variable into binary variable, regarding relation variable as binary variable, a method for computing the synthesized difference degree by considering attribute and object relation information. Theoretical analysis and a clustering example result show that the clustering accuracy degree is higher based on the difference degree, and the clustering result is more practical.
-
Computer Engineering. 2011, 37(22): 39-41. https://doi.org/10.3969/j.issn.1000-3428.2011.22.010There are few studies on universal description framework and the methods of analysis and design of executable architecture. So this paper proposes an executable architecture framework with behavior diagrams, requirement diagrams and construct diagrams in System Modeling Language(SysML) to describe a new three-view architecture ameliorated from Department of Defense Architecture Framework(DoDAF). Based on it, the uniform process of executable development is presented. Appliaction results show that the method is feasible, and it can provide a guide for dynamic simulation evaluation and verification of architecture.
-
Computer Engineering. 2011, 37(22): 42-44. https://doi.org/10.3969/j.issn.1000-3428.2011.22.011A new algorithm of calculating semantic similarity of concepts in WordNet based on Information Content(IC) is presented. The model considers the IC value of concepts and their positions in the is_a taxonomy tree in WordNet, which improves the performance of the model efficiently. Furthermore, a new method of calculating IC value of concept is given. The method considers the number of child node of concept and its depth in the taxonomy tree of WordNet, which makes the IC value more accurate.
-
Computer Engineering. 2011, 37(22): 45-47. https://doi.org/10.3969/j.issn.1000-3428.2011.22.012This paper present an improved method for analyzing the schedulability of periodic task sets under Rate Monotonic(RM) priority assignment. This algorithm simulates the system clock in the process of scheduling by setting clock variable, in the process of this clock variable growth, according to the task priority from high to low sequence, which analyzes each task deadline constraint, judge the single task schedulability, thus determine whole task set scenario. At the end, an instance analysis and comparison with existing methods verify the accuracy and efficiency.
-
Computer Engineering. 2011, 37(22): 48-50. https://doi.org/10.3969/j.issn.1000-3428.2011.22.013This paper proposes an algorithm based on Δ-tree to support efficient main memory K-Nearest Neighbor(KNN) query in high-dimensional databases. By recursive transfer method and depth-first traversal of Δ-tree, the algorithm finds the leaf nodes that are nearer to query point and adopts the superior KNN candidates in them to reduce pruning distance, thus lesses calculation amount and accelerates the nearest neighbors search. Experimental results show that this algorithm can improve query efficiency.
-
Computer Engineering. 2011, 37(22): 51-52. https://doi.org/10.3969/j.issn.1000-3428.2011.22.014This paper proposes a semantic Web service clustering method wihtout knowing the number of kinds of services. The similarity matrix of the services is calculated, and the threshold value of similarity is calculated based on the matrix. Those elements which are greater than the threshold value are set 1, and the other elements are 0 in the similarity matrix, so that the connecting matrix of services based on the threshold is formed. Regarding the connecting matrix as a graph, it abstracts the biggest complete sub-graphs from this graph one by one. The services in each sub-graph are a kind of services. Theory analysis and experiments verify that the method can acquire nature clusters by one time of clustering in acceptable time.
-
Computer Engineering. 2011, 37(22): 53-55. https://doi.org/10.3969/j.issn.1000-3428.2011.22.015Aiming at relaxed reservation of grid resource, an improved continuous double auction model is proposed. The concept of relaxed time is applied into the pricing strategy model, in which the buyers determine their price according to the amount of remaining time and remaining resources, and the sellers ask price considering the workload of the system. Simulation experimental results show that the model can increase the profit of resource provider by 21% and the rate of resource utilization by 15%.
-
Computer Engineering. 2011, 37(22): 56-58. https://doi.org/10.3969/j.issn.1000-3428.2011.22.016This paper adopts the widely used preprocessing techniques to facilitate shortest path query, and proposes a new index structure, namely Shortest Path B+ tree(SPB tree), which can encode both the shortest path information and vertices’ spatial position compactly. Using this index structure, the point-to-point shortest path query in road network can be answered up to three orders of magnitude faster than using the classical Dijkstra algorithm. Besides, SPB tree is space efficient which occupies reasonable memory consumption and can be constructed efficiently. Extensive experimental studies validates the effectiveness and efficiency of using SPB tree in point-to-point shortest path query.
-
Computer Engineering. 2011, 37(22): 59-63. https://doi.org/10.3969/j.issn.1000-3428.2011.22.017For the existed test tools of file system can not accurately and fully reflect the overall state of the file system, the paper provides a multi-dimensional test index system of storage file system. It can explore the factors that affect the file system from multiple perspectives and comprehensively present various technical indicators of the file system. It provides strong support to evaluate and optimize the performance of storage file system. It introduces the specialized test tools and tests the Blue Whale File System(BWFS) and CAPFS. Results show the index system is practical and effective.
-
Computer Engineering. 2011, 37(22): 64-66. https://doi.org/10.3969/j.issn.1000-3428.2011.22.018Aiming at the problem of mining repetition in decremental mining, based on closed sequential pattern PosD*, a decremental algorithm of DePosD* is presented, which has better time efficiency. This algorithm gets the new result by moving the data between the frequent and non- frequent closed sequence, directly decreasing and uqdating the original mining result. Thus it saves time, which has proven by the experiment.
-
Computer Engineering. 2011, 37(22): 67-69. https://doi.org/10.3969/j.issn.1000-3428.2011.22.019It is needed to assess the safety of the chosen components when applying component technology to develop the Safety-critical System(SCS). On the basis of the Analytic Hierarchy Process(AHP), the Fuzzy AHP(FAHP) approach is used to analysis the node weight of components. The fuzzy information is identified with triangular fuzzy number and the node data is processed with fuzzy membership function. The approach is used to analyze the safety of components and experimental result shows that it is significant to the safety assessment of components.
-
Computer Engineering. 2011, 37(22): 70-73. https://doi.org/10.3969/j.issn.1000-3428.2011.22.020Many applications of Wireless Sensor Network(WSN) need clock of sensors nodes to be synchronized, but the traditional synchronization methods is unsuitable for WSN. This paper presents the problems faced when designing the time synchronization protocol. It reviews the existing clock synchronization protocols for WSN and the methods of estimating clock offset and clock drift in the most representative clock synchronization protocols for WSN. The future directions of research on time synchronization for WSN are forecasted.
-
Computer Engineering. 2011, 37(22): 74-76. https://doi.org/10.3969/j.issn.1000-3428.2011.22.021In order to solve the problem that image and video have high data reliability requirement in transmission, this paper proposes Luby Transform(LT) coding scheme having Unequal Error Protection(UEP) characteristic. It analyses the UEP of LT coding in wirless channel, adds appropriate bit of important information to improve the rate of checking in coding process, and realizes the purpose of protection. Experimental results show that the performance of this scheme with iterative decoding is evaluated over Additive White Gaussian Noise(AWGN) and fast Rayleigh fading channels is good in the side of UEP characteristic.
-
Computer Engineering. 2011, 37(22): 77-78. https://doi.org/10.3969/j.issn.1000-3428.2011.22.022This paper models the problem of underdetermined blind source separation using linear array and discusses the effect of space distribution of sources on underdetermined blind source separation. At present, underdetermined blind source separation is mainly discussed in the context of sparse component analysis and is usually resolved by means of two-step strategy. The characteristic that linear mixture of sparse source signals clusters along vectors of mixing matrix is used to estimate the mixing matrix. It is theoretically analyzes that mixing matrix can not be correctly estimated when sources are located in some areas using linear clustering method. Hence, underdetermined blind source separation is intractable. Simulations confirm the correctness of theoretical analysis.
-
Computer Engineering. 2011, 37(22): 79-81. https://doi.org/10.3969/j.issn.1000-3428.2011.22.023Three kinds of FC-AE-1553B network topology structures are studied in this paper, including point-to-point topology, fabric topology and arbitrated loop topology. The Markov model of FC-AE-1553B network is built, and the effect of the single-point fault on three kinds of FC-AE-1553B network is analyzed. Simulation results show that point-to-point topology has the lowest data transmission delays from NT node to NC node, and the fabric topology lowest data transmission delays from NT node to NT node.
-
Computer Engineering. 2011, 37(22): 82-84. https://doi.org/10.3969/j.issn.1000-3428.2011.22.024This paper analyzes the shortcomings of uneven distribution of energy and nodes for Wireless Sensor Network(WSN) and proposes a cluster head optimization strategy for WSN based on Low Energy Adaptive Clustering Hierarchy(LEACH). In the secondary cluster head selection mechanism, it optimizes the worst performance cluster head nodes, in a certain radius of the region to find the node which energy is greater than the average within the cluster, and selects the node nearest the worst performance node as the cluster head forming a optimal multi-hop communication among the cluster head. Experimental results show that this strategy can reduce node energy consumption and extend the network life cycle.
-
Computer Engineering. 2011, 37(22): 85-87. https://doi.org/10.3969/j.issn.1000-3428.2011.22.025Aiming at the energy problem and the bottleneck problem of Low-energy Adaptive Clustering Hierarchy(LEACH) algorithm, the parameters such as the nodes’ energy and the number of adjacent nodes are elected to make sure the cluster heads distributed evenly in the process of cluster heads selection. And the energy threshold is set as the condition of the cluster rebuilding to decrease the frequency of the cluster formation while the single-hop model combined with the multi-hop model is used to resolve the problem of hot nodes. Simulation results show that the new algorithm can use energy effectively, improve the stability of the network, and be able to balance the energy consumption and effective network of prolonging the life span of the network, and it has better ductility, convergence and security.
-
Computer Engineering. 2011, 37(22): 88-90. https://doi.org/10.3969/j.issn.1000-3428.2011.22.026Two algorithms using Orthogonal Frequency Division Multiplexing(OFDM) are proposed after reviewing research on spectrum allocation in multiuser Cognitive Radio(CR). The optimal algorithm obtains the total transmission power through the lower limit of primary users’ Signal to Interference Ratio(SIR), and allots every user subcarriers and power according to Lagrange’s theorem. The hypo-optimal algorithm uses a prorating gene to determine equity of allocation. Results are obtained through restricting the users’ SIR. Simulations results show both algorithms are effective compared with Frequency Division Multiple Access(FDMA) allocation, and satisfy the needs of CR.
-
Computer Engineering. 2011, 37(22): 91-93. https://doi.org/10.3969/j.issn.1000-3428.2011.22.027Traditional techniques in mobile ad hoc networks is relatively complex in digital home applications. Therefore, a wireless control for digital home networking network strategy system is proposed. Analysis of digital wireless home control network composition and characteristics, this paper introduces one-step molding and local repair mechanism, and uses the hardware nodes and the design of command frame format to complete the design of network strategies. Experimental results show that, this strategy has good effect in networking and can well meet the requirements of the digital home.
-
Computer Engineering. 2011, 37(22): 94-95. https://doi.org/10.3969/j.issn.1000-3428.2011.22.028In this paper the synchronization problem of two identical Chen chaotic systems is studied and the design of a sliding mode synchronization control method of Chen chaotic system. This paper directly makes master-slave Chen chaoic system satisfy stability in the Lyapunov sense, and desighs the sliding mode controller. Moreover, the information signal can be recovered undistorted when this method is applied to secure communication. Experimental results show that this method has good robustness and safety.
-
Computer Engineering. 2011, 37(22): 96-98. https://doi.org/10.3969/j.issn.1000-3428.2011.22.029This paper proposes an efficient hybrid multicast key management scheme to solve the problem of high key update cost in large dynamic multicast group. This scheme constructs a hierarchical and grouped key tree and adopts the RSA encryption algorithm, which increases the extensibility and safety. And batch key update is used for more multicast member changes in order to reduce the burden of Grid Security Infrastructure(GSI). The result shows that its storage cost, communication cost and calculation cost are significantly better than the previous schemes, it improves key update efficiency.
-
Computer Engineering. 2011, 37(22): 99-101. https://doi.org/10.3969/j.issn.1000-3428.2011.22.030By means of accelerating the fuzzy Analytic Hierarchy Process(AHP) screening index of genetic algorithm, this paper constructs evaluation index system of computer network security, puts forward the information entropy with objective and subjective empowerment and improved AHP coupling weighting, sequences the influence factors of network security, the network safety evaluation model is established with the fuzzy comprehensive evaluation method. Application results show that the evaluate results of this model are objective and reasonable.
-
Computer Engineering. 2011, 37(22): 102-104. https://doi.org/10.3969/j.issn.1000-3428.2011.22.031In the broadcast multi-signature scheme like ElGamal, the random parameters can introduce the subliminal channels and cause potential safety problems. Aiming at the problem, a new interactive subliminal-free protocol is designed. The warden cooperates with each signer for generating part signature, and signature center generates multi-signature. The collision-free performance of hash function ensures that the warden can not forge the signatures, so the signature authority of the signer is guaranteed. Compared with the similar protocol, theoretical analysis shows that the proposed protocol is closing the subliminal channel completely and lower in computation complexity and higher in communications efficiency.
-
Computer Engineering. 2011, 37(22): 105-106. https://doi.org/10.3969/j.issn.1000-3428.2011.22.032This paper presents an anonymous veto protocol based on bilinear pairings. The session keys established in the setup phase can be used repeatedly over multiple runs. So it requires only 1 round of broadcast in every voting and is optimal in terms of round efficiency. When the protocol runs several times, it involves less computational load and bandwidth usage in every round on average than all the other available designs. The robustness and anonymity are proved under the Decision Bilinear Diffie-Hellman(DBDH) and random oracle assumptions.
-
Computer Engineering. 2011, 37(22): 107-109. https://doi.org/10.3969/j.issn.1000-3428.2011.22.033To solve the problem that the position graph which can not be best compressed in the existing difference expansion authentications, this paper proposes a reversible image embedding authentication, which combines the Reversible Watermark based on Invariability and Adjustment on Pixel Pairs(RWIAPP) and block difference expansion method together. This algorithm separates the host graph to 2×2 pixel blocks, and scans each block in both transverse dimension and vertical dimension. Experimental results show that the proposed algorithm can not only improve the reversible embedding capacity, but also produces only 1/4 host image size drawing. Therefore, this algorithm has better practical value.
-
Computer Engineering. 2011, 37(22): 110-111. https://doi.org/10.3969/j.issn.1000-3428.2011.22.034All existing two party multiple key exchange protocols cannot resist ephemeral key compromise attack. To solve this problem, a new two party authenticated key exchange protocol based bilinear map is proposed for enhancing the security and efficiency of two party key exchange protocols. Four different session keys can be computed through one session of the proposed protocol. Compared with existing protocols, the new protocol with stronger security can resist ephemeral key compromise attack and provide mutual authentication.
-
Computer Engineering. 2011, 37(22): 112-113. https://doi.org/10.3969/j.issn.1000-3428.2011.22.035This paper analyzes the security of a certificateless proxy signature scheme and shows that it is insecure against the public key replacement attack in certificateless cryptosystems. The attack method is presented, in which adversary can forge a signature of any message by substituting the public keys of the original signer and the proxy signer. An improved scheme is presented to defense against this public key replacement attack.
-
Computer Engineering. 2011, 37(22): 114-115. https://doi.org/10.3969/j.issn.1000-3428.2011.22.036This paper studies the hiding method of the G.723.1 high-rate speech coder which is used in streaming media communications, analyzes the hiding performance of Line Spectrum Frequency(LSF) parameters, then proposes the LSF parameters hiding performance analysis method based on critical bandwidth. By using the method of digital-position information, it proposes the information hiding algorithm of G.723.1 high-rate speech flow. Experimental results proves the validity of the proposed algorithm.
-
Computer Engineering. 2011, 37(22): 116-118. https://doi.org/10.3969/j.issn.1000-3428.2011.22.037This paper researches on attack techniques for cipher realization in satellite network. Security threats of ciphers are analyzed and a differential fault attack model is built up to cipher used in satellite network according to characters of satellite network. A real simulation experimental platform is also built up. According to the model, attack experiment is done to ARIA-128 on the platform, and under simulation condition, the session key is got successfully.
-
Computer Engineering. 2011, 37(22): 119-121. https://doi.org/10.3969/j.issn.1000-3428.2011.22.038Aiming at the problems of dual watermark algorithm, poor robustness, low signal to noise rate and inaccurate positioning, a novel dual watermark based on wavelet packet is presented. The robust watermark possesses is constructed by taking advantage of the stability of Singular Value Decomposition(SVD) and the security of chaotic system. A new bipolar quantization is used to enhance the sensibility of fragile watermark. The algorithm makes the watermark embedding noise attribute to the odd coefficients by quantizing the difference of the sum of the odd and the even coefficient, effectively improving signal to noise rate after embedding. Experimental results show that the robust watermark can provide high robustness to conventional attacks, and malicious tampering, it has good accuracy of tamper localization.
-
Computer Engineering. 2011, 37(22): 122-124. https://doi.org/10.3969/j.issn.1000-3428.2011.22.039Reputation is used to help user select trustworthy peers in Peer-to-Peer(P2P) file sharing systems. But few and malicious feedback often leads to decrease of availability and reliability of reputation. So this paper proposes an objective evaluation method based on sharing duration, which makes system automatically obtain evaluation information of each user and builds trusts among peers. Simulation results show that the method effectively isolates malicious peers from good peers, resulting in increase of the reliability of trust. At the same time, differentiated services for peers with different behaviors ensure the fair of allocation of resources.
-
Computer Engineering. 2011, 37(22): 125-127. https://doi.org/10.3969/j.issn.1000-3428.2011.22.040This paper proposes a motion estimation algorithm based on adaptive search pattern. The non-zero movement blocks are subdivided into three types of large, medium and small blocks, and three searching templates including hexagonal, large diamond and small diamond are proposed for blocks motion estimation. Experimental results show that the new search algorithm reduces the search points, so that it ensures the accuracy of motion estimation while reducing the complexity of the algorithm to improve search efficiency.
-
Computer Engineering. 2011, 37(22): 128-130. https://doi.org/10.3969/j.issn.1000-3428.2011.22.041This paper implements a semantic role labeling in Chinese language, uses the convolution tree kernel of Support Vector Machine (SVM). It focuses on how to properly express the structural representation between predicates and arguments on dependency tree and let the input tree contain less noise information. It explores two methods to prune the dependency tree: Shortest Path Tree(SPT) and Minimum Tree(MT). Experimental results on the transferred corpuses from Chinese PropBank and Chinese NomBank show the system achieves 83.66 in labeled F1 on verbal predicates and 76.87 in labeled F1 on nominal predicates
-
Computer Engineering. 2011, 37(22): 131-133. https://doi.org/10.3969/j.issn.1000-3428.2011.22.042Most swarm intelligence algorithms fall into local optimum easily, and convergence speed is very slow. By introducing Particle Swarm Optimization(PSO) algorithm into Artificial Bee Colony(ABC) algorithm, this paper proposes an improved path generation method for selection of the optimal target location and the path planning of particle individuals. The path data are imported into maya software to conduct simulation experiments, and the results show that the method can generate lifelike group animation and enhance animation production efficiency.
-
Computer Engineering. 2011, 37(22): 134-136. https://doi.org/10.3969/j.issn.1000-3428.2011.22.043To effectively deal with face recognition problem, an efficient face recognition algorithm based on Local Fisher Discriminant Analysis(LFDA) and optimal Support Vector Machine(SVM) is proposed in this paper. By comprehensive consideration of local geometric structure and class information, the high dimensional face data are first mapped into lower dimensional feature space with LFDA so that the curse of dimensionality can be avoided, the optimal SVM that is trained by the multiplicative update rule is used to classify and recognize different face image herein. Experimental results on face image databases demonstrate that the proposed algorithm not only has fast running speed, but also achieves higher recognition accuracy.
-
Computer Engineering. 2011, 37(22): 137-138. https://doi.org/10.3969/j.issn.1000-3428.2011.22.044Aiming at the problems of the character recognition for degraded license plates, a novel recognition method for Chinese character of license plate based on wavelet transform and fractal dimension is proposed in this paper. The image pre-processing and wavelet transform technologies are applied to the character images. An shifting differential box-counting approach(SDBC) is used to compute fractal box-counting of the images and gain the feature vector. Support Vector Machine(SVM) is adopted to design the classifier for recognizing the chinese characters . Experimental results show that the proposed method is robust in dealing with blurred character images, and it can improve the recognition rate of Chinese characters.
-
Computer Engineering. 2011, 37(22): 139-142. https://doi.org/10.3969/j.issn.1000-3428.2011.22.045In order to overcome the problem of premature convergence frequently appeared in Artificial Bee Colony(ABC) algorithm and convergence slowly of ABC, this paper proposes an improved ABC algorithm with sharing factor. In the algorithm, the information is shared by individual and its neighbor changing dynamic according to the search process. The shared information is weakened to avoid bee colony fly across the region where global solution stays at the initial stage and enhances at the last stage to improve the global convergence of the bee colony. Functional test result shows that this algorithm has higher convergence property, and it is suitable for solving complex function optimization problem.
-
Computer Engineering. 2011, 37(22): 143-144. https://doi.org/10.3969/j.issn.1000-3428.2011.22.046A moving object tracking algorithm based on shape induction is proposed to solve problems of the Mean-Shift algorithm, which can not track the targets automatically and adapt well to the shape changes of objects. It obtains initial contour of objects automatically by building a background image with mixture Gaussian distribution. The parameter of covariance matrix is added to Mean-Shift algorithm to feel the shape changes of objects. Experimental results indicate this algorithm solves the problems concerned with automatic positioning and shape changes and the accuracy is increased by 40% at least with real-time guaranteed.
-
Computer Engineering. 2011, 37(22): 145-147. https://doi.org/10.3969/j.issn.1000-3428.2011.22.047Least Squares Support Vector Machine(LSSVM) increases the algorithm’s efficiency, but the sparsity of the solution is lost, which results in the low prediction speed of new samples. A new sparsified LSSVM classification algorithm is proposed. The approximate linear independent vector set in feature space is first searched and thus the sparse discriminative function can be constructed. The corresponding optimization problem of LSSVM can then be solved through the linear equation set. So the optimal discriminative function is achieved. Experiments show that the prediction speed of the proposed algorithm is faster than that of LSSVM without the loss of classification accuracy.
-
Computer Engineering. 2011, 37(22): 148-150. https://doi.org/10.3969/j.issn.1000-3428.2011.22.048The traditional block matching method only considers the translation motion. It can not estimate the rational motion correctly. Considering the circle is robust to rotation, a circular block matching method is proposed. It adopts the circle projection as the feature vector, and obtains the motion vector of the current block. In order to improve the efficiency, it adopts the feature points using Harris arithmetic operator to get the motion vectors. A linear equation is constructed from the local motion vector and the rigid model, and it determines the global motion parameters by the popular RANSAC algorithm. Experimental results show the method is robust to determine the global motion parameters even if they are very big or small.
-
Computer Engineering. 2011, 37(22): 151-152. https://doi.org/10.3969/j.issn.1000-3428.2011.22.049In view of feature binding in visual perception, this paper presents an advanced Pulse Coupled Neural Network(PCNN) model based on traditional PCNN. In this model, the pulse of the total strength in the neighborhood of neuron makes different characteristics separate, while the pulse of strength of neuron itself makes different characteristics bind. Simulation result indicates that the model can achieve feature separation and binding, so that it accomplishes the task of feature binding in visual perception and provides certain reference value for further research of feature binding in visual perception.
-
Computer Engineering. 2011, 37(22): 153-155. https://doi.org/10.3969/j.issn.1000-3428.2011.22.050Traditional input devices are increasingly unable to meet people’s needs of random input. Aiming at the defect, a 3D gesture recognition scheme based on gyroscope sensor is proposed. The hardware architecture of scheme includes a high accuracy data acquisition hardware system based on gyroscope and a MCU based on atmega16 and a wireless transmission module based on nRf24API. The gesture recognition algorithm includes data preprocessing module based on multisection filter. A feature extraction algorithm is based on angular movement to extract the 3D gesture feature. Experimental results show that the average recognition rate of this scheme is 99.3% which can well realize 3D space mouse input function and the keyboard function.
-
Computer Engineering. 2011, 37(22): 156-158. https://doi.org/10.3969/j.issn.1000-3428.2011.22.051Taking use of background filtering method effectively reduces the positive error. The method uses the collaborative information processing of speed, angle etc based on maximum likelihood estimation and the adaptive sliding window method. The lidar-based method to detect and track multiple people is implementes for indoor and outdoor complex background. Data test result shows that this method has the advantage of high precision, fast processing and strong robustness, it can effectively restrain the positive error.
-
Computer Engineering. 2011, 37(22): 159-161. https://doi.org/10.3969/j.issn.1000-3428.2011.22.052In view of the distortional background extracted by time-averaged method, an improved algorithm that combined with the frame- difference method is presented in this paper. During background updating, this paper uses multi-level background update strategy, it can avoid the effect of new objects to the background and eliminate the ghosts caused by the move-away of background objects or by the move-in of foreground objects. Experimental result shows that the proposed algorithm can be used to extract backgrounds effectively and quickly when the scene changes, and it has better effect .
-
Computer Engineering. 2011, 37(22): 162-163. https://doi.org/10.3969/j.issn.1000-3428.2011.22.053Maximum likelihood identification is proposed for parameter estimation of multivariable state-space models subject to missing states. The likelihood function conditioned on input, output and missing series is constructed. The influence of parameter estimation by missing mode is analyzed. And the modified Kalman filter suitable for state estimation with missing state is presented. And parameter estimation algorithm for maximization of likelihood function is given. Numerical simulation results show the effectiveness of the proposed method.
-
Computer Engineering. 2011, 37(22): 164-167. https://doi.org/10.3969/j.issn.1000-3428.2011.22.054This paper proposes Mean Shift algorithm based on multi-scale feature extraction for fulfilling the target tracking in complex environment such as images with low contrast and to many similar targets. After the feature points being matched, next frame feature points are gotten. The center of next frame feature points is took as the center of searching window by which Mean Shift searching windows are continually modified and iteration deviation is reduced. Experimental resutls show that the robustness, precision and real-time performance of the algorithm are improved, and its iteration frequency is reduced.
-
Computer Engineering. 2011, 37(22): 168-170. https://doi.org/10.3969/j.issn.1000-3428.2011.22.055This paper studies the Chinese finger alphabet flow recognition and classification. As there is a problem that higher hardware requirements on data gloves are needed for the current study, a kind of lower hardware requirements and higher recognition rate method is proposed. This method uses BP neural network and Markov model and estimates the input sequence probability by Chinese alphabet spelling rules to output Chinese alphabet flow. Experimental results show that this method can get more than 91% recognition rate and output alphabet flow effectively, which proves the method is effective.
-
Computer Engineering. 2011, 37(22): 171-173. https://doi.org/10.3969/j.issn.1000-3428.2011.22.056This paper presents an incremental Laplacian method based on Cam weighted distance. The dimension of the original data are reduced with Laplacian operator, then it obtains the neighbors of each added sample by using the Cam weighted distance and constructs the feature of the current data using such neighbors. The exisiting data embedding results are updated. Experimental results show that the method is effective on data dimension reduction and face expression classification.
-
Computer Engineering. 2011, 37(22): 174-175. https://doi.org/10.3969/j.issn.1000-3428.2011.22.057Because of using L2 norm, Principal Component Analysis(PCA) method is sensitive to outliers. So this paper proposes a PCA method based on kernel function and L1 norm. It maps original data to kernel space to get a kernel matrix, and utilizes kernel function and L1 norm to minimize the distance function. Experimental result shows that the algorithm is invariant to rotations and robust to outliers and nonlinear problems, and it has higher correct recognition rate.
-
Computer Engineering. 2011, 37(22): 176-178. https://doi.org/10.3969/j.issn.1000-3428.2011.22.058A face recognition method based on 2D Principal Component Analysis(2DPCA) and compressive sensing is introduced in this paper. The 2DPCA is used to obtain the feature vectors and the compressive sensing is used to get the sparse representation of the test image given enough training images. The measure matrix is composed of the feature vectors of all training images and the feature vector of each test image is the observation value, then the encoding signal of the test image, which will be used for face recognition, can be obtained by using the L1 norm minimization. Experimental results indicate that the recognition rate based on 2DPCA and compressive sensing is higher than the recognition rate using other methods.
-
Computer Engineering. 2011, 37(22): 179-181. https://doi.org/10.3969/j.issn.1000-3428.2011.22.059A multi-objective multi-period emergency logistics model is proposed to deal with Split-delivery Vehicle Routing Problem(SDVRP). The planning aims to minimize the unsatisfied demand, total delivery time and supply unbalance among demanders. The weighted sum is taken to compromise the three objectives. Coding schemes are designed to translate the delivery plans into gene sequences. Based on the feasible initial population generated by the roulette wheel selection, disaster-affected areas are clustered and the evolutionary optimization is performed. A numeric example is presented to validate the effectiveness of the model and its algorithm.
-
Computer Engineering. 2011, 37(22): 182-184. https://doi.org/10.3969/j.issn.1000-3428.2011.22.060Corner Matching Method(CMM) of Synthetic Aperture Radar(SAR) images in INS/SAR integrated navigation system require the corner extraction to be fast, precise and dependable. Aiming at the problem, this paper puts forward a new corner detecting method combining curvature scale space and Harris operator, in which the partial Harris operator is used to locate the corner detected by curvature scale space method. Being proved via the experiment, the method has high precision, low redundancy and good real time ability to meet the requirement of the corner detecting in INS/SAR integrated navigation system.
-
Computer Engineering. 2011, 37(22): 185-186. https://doi.org/10.3969/j.issn.1000-3428.2011.22.061Dual population genetic algorithm with chaotic local search strategy is proposed to solve bad local search ability and early convergence which are the two defects of genetic algorithm. In proposed algorithm, one population is used as exploration population, the other is exploitation population. The two populations are evolved by different crossover probability and mutation probability. At the end of each generation, chaotic local search is applied to the optimal solution of each population, and the solution will be the new optimal solution if a solution found by chaotic local search is better than the optimal solution. Chaotic local search is not stopped until the predefined search time is elapsed. An immigration operation is down between the two populations each ten generation. Experimental results on six benchmark functions show that proposed algorithm had the better ability of finding optimal solution.
-
Computer Engineering. 2011, 37(22): 187-190. https://doi.org/10.3969/j.issn.1000-3428.2011.22.062According to unconstrained optimization problem, inspiring from water cycle process, a new global optimization algorithm called Water Cycle-like Algorithm(WCA) is presented. Five optimal selected processes of particles, such as confluence, diffluence, infiltration, evaporation and rainfall, are given. Through measure particles’ population, location and weight, these processes adjust particles and population to adapt the need of current searching, intellectually and dynamically. A new optimal searching mechanism of relative gravity is proposed too, which uses relative gravity to guide particles to a better location. Theoretical analysis and simulation results prove that the algorithm can increase iteration speed, enhance search accuracy, prevent the situation that particles fall into local best.
-
Computer Engineering. 2011, 37(22): 191-192. https://doi.org/10.3969/j.issn.1000-3428.2011.22.063Based on PBIL algorithm, clustering matrix and clustering probability matrix model are designed. After leading in arithmetic operators of gene mutation in genetic algorithm, mutation which adapts to Estimation of Distribution Algorithms(EDA) is designed. After improving update mode of probabilistic model, a new estimation of distribution algorithms which can be applied to solving clustering problems is originated. By comparing new algorithms with Kmeans, Kmedioid, Clarans algorithm and Genetic Algorithm(GA), better clustering quality and general performance of new algorithms are confirmed by experimental results.
-
Computer Engineering. 2011, 37(22): 193-195. https://doi.org/10.3969/j.issn.1000-3428.2011.22.064A novel adaptive variable step-size constant module medical CT image blind equalization algorithm is proposed. The process of image restoration transformed by a linear operation is equivalent to one dimensional blind equalization. The constant modulus blind equalization cost function applied to medical CT image is founded. The kurtosis of error signal is utilized as step-size control factor to speed up the convergence and improve the performance of the algorithm. Computer simulations show that the algorithm improves peak signal to noise ratio, restoration effects and efficiency of operations, decreases state residual error, and speeds up the convergence.
-
Computer Engineering. 2011, 37(22): 196-197. https://doi.org/10.3969/j.issn.1000-3428.2011.22.065In view of the absence of post-processing and visualization method for three-dimension imaging sonar based on line array synthetic aperture, an effective post-processing and 3D visualization scheme is proposed in this paper. Considering the difference of acoustic characteristics between water and seafloor, the two sets of data are separated using merged image processing algorithms, followed by a modified 3D adaptive region growing algorithm based on the mean of edge gradient to detect the targets in them. The processed data are combined and visualized using the ray casting algorithm. Experimental result in lake and near sea demonstrates the effectiveness and robustness of the proposed scheme.
-
Computer Engineering. 2011, 37(22): 198-201. https://doi.org/10.3969/j.issn.1000-3428.2011.22.066This paper presents a gray image sequence compression method by using vehicle target detection and motion compensation. Intra coding and inter coding are both used in the proposed image sequence coding algorithm. For the intra coding step, it uses the lifting 9/7 wavelet transform based Set Partitioned in Hierarchical Tree(SPIHT) method. For the inter coding step, vehicle targets in the image sequences are extracted, and objects in the current frame are predicted by the matching objects in the former frame using bilinear interpolation. Differences between the predictive frame and the current frame are coded and motion vectors of the matching objects are embedded into the bit stream. Experimental results show the method works well in image sequence coding for intelligent vehicle monitoring systems.
-
Computer Engineering. 2011, 37(22): 202-203. https://doi.org/10.3969/j.issn.1000-3428.2011.22.067According to the underwater imaging physical model, a visibility enhancement algorithm for underwater degraded images is proposed based on wavelet transform. The RGB color space is transformed to the YUV color space. For the luminance component Y, according to the contrast of the original image, the amount of media scattering light is estimated adaptively by using the wavelet transform to enhance the contrast of degraded underwater images. Moreover, non-linear luminance adjustment is implemented on the low-pass subband of wavelet transform to eliminate the problem of non-uniform luminance. The visibility enhanced underwater image is obtained by combination the resulted image of Y component and the chrominance components of U and V. Experimental results show that underwater degraded observation images can be restored adaptively by the proposed algorithm.
-
Computer Engineering. 2011, 37(22): 204-206. https://doi.org/10.3969/j.issn.1000-3428.2011.22.068Aiming at estimating the unknown shape parameter p of generalized Gaussian noise in image, this paper proposes a novel approximated moment estimation algorithm of p. It extracts noise samples from the original image, and fits the Ratio Function(RF) of p by using piecewise function, yielding an approximated expression of p. Experimental results demonstrate that, when the noise samples are precise, the estimates are accurate to the second decimal place, especially in the case of noise with uniform distribution, the estimation error is 0.3 smaller than that of the traditional algorithm. As for the imprecise noise samples, the estimation precision is dependent on the threshold parameter K.
-
Computer Engineering. 2011, 37(22): 207-208. https://doi.org/10.3969/j.issn.1000-3428.2011.22.069To solve the visibility of outdoor surveillance system in foggy weather, a weather degraded image sharpening algorithm is proposed. Combined the Approximate Point Spread Function Examining(APSFE) algorithm and Partially Overlapped Sub-block Histogram Equalization(POSHE) to wipe out the weather factor which influences the quality of image. Taking sub-block and step size input image size, and can use the preset value which needn’t parameter estimation, thus realize the improved algorithm. Experimental results show that, the improved algorithm has good adaptivity and instantaneity.
-
Computer Engineering. 2011, 37(22): 209-210. https://doi.org/10.3969/j.issn.1000-3428.2011.22.070In order to make the traditional Fuzzy C-means(FCM) algorithm more useful for image segmentation, the spatial constraints FCM algorithm for image segmentation based on pyramid information is proposed. The pyramid structure is introduced to rapid the approach and restrict membership. The proposed algorithm takes spatial information into account, and is full free of empirically adjusted parameters. Experimental results show that, the new algorithm can effectively preserve the detail information of the image and improve the quality of image segmentation.
-
Computer Engineering. 2011, 37(22): 211-214. https://doi.org/10.3969/j.issn.1000-3428.2011.22.071Because of the characteristics of small volume, low power, low cost and flexible design that the system has, the design and implementation of multiuser test system based on Field Programmable Gate Array(FPGA) and Advanced RISC Machines(ARM) is introduced in this paper. It can satisfy the specific needs of Asynchronous Transfer Mode(ATM) test. Because of the console based on Web users as long as access this network can operation the test system, which solves the problem of people can not test on the same time because it is expensive. With the characteristics of small volume, low power, low cost and flexible design that the system can satisfy the specific needs of high speed ATM test. Test show it can satisfy the need of high-speed transmission and exchange equipment.
-
Computer Engineering. 2011, 37(22): 215-218. https://doi.org/10.3969/j.issn.1000-3428.2011.22.072Aiming at the problem that he research and application on reconfigurable error-and-erasure decoders remains limited. This paper presents a Very Large Scale Integration(VLSI) architecture for high-speed reconfigurable error-and-erasure Reed-Solomon(RS) decoder. In digital transmission procedure, RS codes are widely employed due to the excellent error/erasure correction capability. Based on the ultra-folded technology, the proposed architecture achieves not only high speed but also low hardware complexity. Through 0.18 μm technology and design complier tool, the results show that it is a competitive candidate in hardware complexity, throughput and reconfiguration.
-
Computer Engineering. 2011, 37(22): 219-221. https://doi.org/10.3969/j.issn.1000-3428.2011.22.073Apply DNA computation to the modeling process of new product innovative design. A product base is built, and the function, structure, appearance, and other factors of products are expressed as DNA code. Aiming at the users’ needs, targeted product is also expressed as DNA code. It implements the associative memory to build computing model. Then do innovative operation as crossover, mutation and Boolean operation to build models, which can get kinds of innovate products. A case study of the creative design of table style is given to demonstrate the proposed method.
-
Computer Engineering. 2011, 37(22): 222-224. https://doi.org/10.3969/j.issn.1000-3428.2011.22.074This paper designs a fault injection tool base on Small Computer System Interface(SCSI) to aim at the usability evaluation of Massive Storage. The tool intercepts the SCSI commands from upper layer and modifies the commands, then passes them to the lower layer, it can inject many faults both transient and permanent. According to the characters of the target system, the fault model and inject are collected, inject results are recovered and off-line data are analyzed after inject. Experimenal test results validate the effectiveness of the tool.
-
Computer Engineering. 2011, 37(22): 225-227. https://doi.org/10.3969/j.issn.1000-3428.2011.22.075The characters and design flow of yield analysis chip are studied. Yield analysis chip contains special components with violation of design rules and mismatch of layout and schematic, so a new method is presented which is the combination of traditional Layout Versus Schematic(LVS) method and formal verification. Yield analysis chip is designed and verified under the new flow. Experimental result shows that the verification process of yield analysis chip is right and stable.
-
Computer Engineering. 2011, 37(22): 228-230. https://doi.org/10.3969/j.issn.1000-3428.2011.22.076Based on the analysis of architecture and running mechanism of Dalvik virtual machine, some key techniques of porting Dalvik virtual machine to Loongson platform are studied. It describes the implementation process of the Dalvik interpreter and the role of the stack frame of interpreter during method calls, and a Dalvik virtual machine for Loongson-based Android system is implemented. The performance bottleneck of Dalvik virtual machine is analyzed, and the optimization solution is given.
-
Computer Engineering. 2011, 37(22): 231-233. https://doi.org/10.3969/j.issn.1000-3428.2011.22.077By full using advantages of Utility-based Cache Partition(UCP) and Least-recently Used(LRU) policy, a new dynamic shared cache partitioning mechanism is presented. The proposed mechanism is called Improved Utility-based And least-recently used Cache Partition(IUL-CP). It reduces the pollution of multi-threads in the shared cache and resolves the low performance when all cores running the shared cache way number sensitive workloads in multi-core systems with the UCP mechanism. The evaluation, by running SPEC CPU2000 benchmarks, shows that IUL-CP improves the performance by 20.28% over LRU and 14.37% over UCP on average.
-
Computer Engineering. 2011, 37(22): 234-236. https://doi.org/10.3969/j.issn.1000-3428.2011.22.078In order to simplify the application program, the Real Time Operating System(RTOS) is utilized in the embedded system development. This paper proposes the method of porting open source RTOS Toppers/asp onto ARM7(S3C44B0), which is a popular microcontroller dedicated to embedded system. It solves the key problems in the startup and loading of system, and presents the most important and difficult problems in the course of porting Toppers/asp. Multitask running result shows that the system is steady and reliable.
-
Computer Engineering. 2011, 37(22): 237-239. https://doi.org/10.3969/j.issn.1000-3428.2011.22.079This paper studies the user diet preferences acquisition techonology, and establishes a food category model based on similarity. It designs a system of user diet preferences acquisition and diet recommendation in smart space. The system uses pressure sensors to gain user’s diet data, and captures user diet preferences by dynamic partition of sensor data. It uses the food category model to relize the diet recommendation. Experimental results proves the validity of the system.
-
Computer Engineering. 2011, 37(22): 240-242. https://doi.org/10.3969/j.issn.1000-3428.2011.22.080In order to overcome the disadvantage of being sensitive to model surface local trait and noise in present mesh segmentation algorithm, this paper defines a surface metric called volumetric radius that is invariant to the pose of the model and robust to noise. Based on this metric, a hierarchical mesh segmentation algorithm is proposed. It computes Volumetric Radius(VR) for each vertex, fits the distribution of VR values using two-state Gaussian Mixture Model(GMM), uses connected components algorithm to get the separated sub-parts, and employs a graph-cut algorithm to get the meaningful partitioning. Execute recursively aforementioned last three procedures for every subpart to gain hierarchical mesh segmentation. Experiment indicates that the proposed algorithm is efficient and can partition a mesh into meaningful parts, meanwhile, it is invariant to the pose of the model and robust to noise.
-
Computer Engineering. 2011, 37(22): 243-245. https://doi.org/10.3969/j.issn.1000-3428.2011.22.081An collision detection algorithm based on Axis Aligned Bounding Box(AABB) and geometrical restriction is proposed to solve the problems of collision between different objects in maintenance simulation. It adopts AABB to improve the effect of collision detection between the virtual human and others objects. Geometrical restriction algorithm is used to solve the problem of collision detection between the accessories belong to virtual human and the others. Collision detection algorithm combines the speediness of AABB and exactitude of geometrical restriction, and experimental results indicate that it makes real-time collision detection effective.
-
Computer Engineering. 2011, 37(22): 246-249. https://doi.org/10.3969/j.issn.1000-3428.2011.22.082Mode decision algorithm in Scalable Video Coding(SVC) has high computational complexity. In this paper, a fast mode decision algorithm is proposed. In the proposed algorithm, INTRA mode rate-distortion cost and its interlayer correlation are utilized to segment the enhancement picture into different texture region, the early termination threshold is utilized to determine the SKIP and BLPRED mode in advance, then, the INTRA mode rate-distortion cost is utilized to calculate the texture region type for the macroblock in enhancement layer. According to the texture region type and motion activity of the macroblock, the INTER mode estimation is dynamically adjusted. Experimental results show that the proposed algorithm can reduce the total encoding time by up to 52.58% with very low Peak Signal to Noise Ratio(PSNR) loss.
-
Computer Engineering. 2011, 37(22): 250-251. https://doi.org/10.3969/j.issn.1000-3428.2011.22.083This paper proposes a new linear fitting method for time series. The turning points are picked up in terms of the slope changes of the adjacent point connections, and the set of key points of the time series is obtained by merging these points with extreme points. The method can not only eliminate the noise points, but also more precisely locate the key points of the series. Test results show the method can much better reflect the original time series. Comparing this method with the existed ones, the smaller fitting errors are achieved.
-
Computer Engineering. 2011, 37(22): 252-254. https://doi.org/10.3969/j.issn.1000-3428.2011.22.084In order to improve the compression efficiency of the interlaced video sequences, this paper proposes a fast adaptive frame, field coding algorithm. The method selects the better mode for every macrolbock pair, according to the differences of macrolbock pair of current frame and same location in the previous frame in frame and filed mode. Then the frame moving activity is determined by the statistics of the macrolbock pairs, the fast-moving scenes are coded in field mode and static scenes are coded in frame mode. Experimental results show that this algorithm greatly reduces the computational complexity while maintaining great compression efficiency.
-
Computer Engineering. 2011, 37(22): 255-256. https://doi.org/10.3969/j.issn.1000-3428.2011.22.085In order to void cockamamie computation and pose distortion existing in traditional inverse kinematics, this paper presents a Fast Adaptive Scaled Gaussian Process Latent Variable Model(FASGPLVM), then realizes human motion generation based on it. Experimental results show that FASGPLVM has higher convergence velocity and precision and extends editing range of motion capture data by adapting motion editing direction.
-
Computer Engineering. 2011, 37(22): 257-260. https://doi.org/10.3969/j.issn.1000-3428.2011.22.086The Best Linear Unbiased Prediction for Function Continuation(FCBLUP) is introduced into high-frequency financial data mining, through which this paper constructs discrete observation sequence into functional data model to predict. Adopting high-frequency Shanghai stock index as test data to establish the FCBLUP model, meanwhile, in order to have an effective evaluation and positioning, the prediction model based on Auto Regression Moving Average(ARMA) is built as another group. Experimental results show that the prediction effect of FCBLUP is better than ARMA, its error is slightly larger than ARMA only in small interval, but it is significantly lower than the ARMA at the other times.
-
Computer Engineering. 2011, 37(22): 261-263. https://doi.org/10.3969/j.issn.1000-3428.2011.22.087The algorithm on Acoustic Event Classification(AEC) always uses traditional speech classification model at present, but to environment acoustic event, this algorithm has lower correct rate and bad stability. This paper puts forward an environment acoustic event classification algorithm based on feature analysis. It makes a definition to environment acoustic event. It analyzes familiar features of sound. It makes a classification to four typical kinds environment acoustic event just using features. Experiment proves that this method is better than traditional algorithm in correct rate and stability.
-
Computer Engineering. 2011, 37(22): 264-267. https://doi.org/10.3969/j.issn.1000-3428.2011.22.088According to the enterprise decision-making style, a new model introducing reputation into enterprise’s competition and cooperation evolutionary game is proposed. It defines the enterprise neighbors based on the reputation spreading radius, chooses game objects from enterprise neighbors, generates continuous game series given to the game objects’ decision-making style, gets its game profit and refreshes its enterprise reputation. After all the above procedures, it calculates attract value of study object. Experimental results show that the model can well classify different reputation enterprises, and make the enterprises with good reputation show their strong survival superiority with a high survival rate.
-
Computer Engineering. 2011, 37(22): 268-269. https://doi.org/10.3969/j.issn.1000-3428.2011.22.089A multi-stream Dynamic Bayesian Network(DBN) model(AF_AV_DBN) based on Articulatory Feature(AF) is proposed for audio visual speech recognition. Conditional probability distribution of each node and the degree of asynchrony between the AFs are defined, and speech recognition experiments are carried out on an audio visual connected digit database. Compared with the audio-only AF_A_DBN model, the state synchronous DBN model and the state asynchronous DBN model, the designed AF_AV_DBN model gets the highest recognition rate under various signal to noise ratios, and is more robust to background noise.
-
Computer Engineering. 2011, 37(22): 270-272. https://doi.org/10.3969/j.issn.1000-3428.2011.22.090According to the statistical analysis of Tibetan corpus and the research of the Tibetan grammar, this paper gives an analysis system model of Tibetan character property, meanwhile designs basic components character database, combination component character data base, coarse-grained structure character database, fine-grained structure character database, and the analysis algorithm of character property for the system. This system enables to conduct deep research on properties for modern Tibetan characters, and provides theoretical foundation for the Tibetan keyboard layout, the Tibetan input method, the Tibetan search engine, the Tibetan-related machine translation, and the network security. This system promotes the further development of Tibetan information processing.
-
Computer Engineering. 2011, 37(22): 273-275. https://doi.org/10.3969/j.issn.1000-3428.2011.22.091The university timetabling arrangement problem is converted into a multi-object constrained optimization problem. Immune clonal algorithm with hybrid code is used to optimize it. Similar vector-based selection method is used to suppress concentration of antibodies for avoiding premature convergence. Simulation result shows that the algorithm can provide better results in timetabling arrangements, users satisfaction and run time.
-
Computer Engineering. 2011, 37(22): 276-278. https://doi.org/10.3969/j.issn.1000-3428.2011.22.092Aiming at there is long delay of TCP data such as control command etc in remote experiment network, a video transmission control method is presented based on Back Propagation(BP) neural network. The method estimates the network utilization using BP and regulates the transmission speed of video streaming according to the estimation and the situation of routine network load. Experimental result shows that the method can ensure reliable transmission of TCP data such as control commands.
-
Computer Engineering. 2011, 37(22): 279-280. https://doi.org/10.3969/j.issn.1000-3428.2011.22.093Secondary development of map sheet decoration which is based on the Geographic Information System(GIS) platform is not conducive to the migration and expansion of functions. It analyzes the figure profile, kilometer grid, longitudinal and latitudinal lines, annotate in the automation of map sheet decoration. It develops the library of map sheet decoration corresponded from the bottom. The map sheet decoration functionality of the existing GIS platform has been improved. To achieve the function of map sheet decoration does not depend on the specific GIS platform. It improves the mapping efficiency for example of the print function. It integrates well into other geographical information systems.
-
Computer Engineering. 2011, 37(22): 281-283. https://doi.org/10.3969/j.issn.1000-3428.2011.22.094Small sample problem may influence the performance of Bayesian learning algorithms. To overcome the drawback, this paper presents a Bayesian relevance feedback algorithm based on semi-supervised learning. It labels the unlabeled samples by learning the labeled information by users, which enhance the learning ability of the relevance feedback algorithm. Experimental results show that the algorithm achieves better performance than traditional Bayesian learning algorithm.
-
Computer Engineering. 2011, 37(22): 284-286. https://doi.org/10.3969/j.issn.1000-3428.2011.22.095The problem of emergency resource allocation and dispatch is studied based on fuzzy parameter. A multi-objective fuzzy programming is established based on both the earliest emergency-start-time and minimum allocation and dispatching cost. This model is extended to multi-depots combinatorial supply policy. Giving the order relation of interval number, the solution algorithm for this model is proposed with the aid of multi-objective theory. A numerical example illustrates the model algorithm is feasible and effective.
-
Computer Engineering. 2011, 37(22): 287-289. https://doi.org/10.3969/j.issn.1000-3428.2011.22.096To resolve the color register problem on web-press machine, an intelligent register system is presented. A special diamond mark is designed, which is easier to be embedded. The high-speed cameras with external trigger signal are adopted to capture mark images under the control of synchronous encoder unit, at the same time the real-time deviation of color is obtained by analyzing the mark image. The data of color deviation are transmitted to the press system over Ethernet. A close-loop and real-time system is built. An Ethernet solution for the press machine with many towers is proposed. Application results show that the waste of newspaper decreases greatly, in addition, print quality and print efficiency are both promoted.
-
Computer Engineering. 2011, 37(22): 290-292. https://doi.org/minlj@njupt.edu.cnIn order to configure and manage the devices flexibly which are parts of smart switch lighting control system, host computer software is designed. The structure of system is described, Smart Switch Lighting Protocol(SSLPT) is proposed for coordinating communication between host computer and devices, the system is designed using Unified Modeling Language(UML). Experimental results show the reliability and stability of the software.
2024
Volume 50 No 3
Volume 50 No 3
(Started in 1975, Monthly)
Sponsored by：
East-China Institute of Computer Technology Shanghai Computer Society
Edited & Published by：
Editorial Board of Computer Engineering
Chief Editor：Jiang Bo
Executive Chief Editor:
Hu Bing
Tel：021-67092217
E-mail: ecice06@ecict.com.cn
CN: 31-1289/TP
ISSN: 1000-3428
Sponsored by：
East-China Institute of Computer Technology Shanghai Computer Society
Edited & Published by：
Editorial Board of Computer Engineering
Chief Editor：Jiang Bo
Executive Chief Editor:
Hu Bing
Tel：021-67092217
E-mail: ecice06@ecict.com.cn
CN: 31-1289/TP
ISSN: 1000-3428