Table of Content

01 May 2006, Volume 26 Issue 5

Previous Issue    Next Issue

Graphics and image processing

Wide baseline image correspondences based on local affine invariant image feature

;

2006, 26(5):  1001-1003. 

Asbtract ( )   PDF (1210KB) ( )  

Related Articles | Metrics

A novel algorithm based on local affine invariants was proposed for searching correspondences between images in the most general case. Image point features were used as anchor points and the local space-variant regions around the anchor point were used as local window region to generate geometric and brightness affine invariants for image matching. The method is efficient because only the local image features are used in the process. The matching results are reliable and robust because its feature matching region is relatively large, and the shape of local window region was transformed according to possible projective deformation. In addition, overlapped sub-regions were used in local feature extraction to reduce partially occluding problems.

JPEG2000 compressed image indexing

;

2006, 26(5):  1004-1005. 

Asbtract ( )   PDF (387KB) ( )  

Related Articles | Metrics

Two index methods of compressed image were provided for image retrieval based on JPEG2000 standards, which reduce the amount of data processing without full decompression. The experimental results show that the indexes have more powerful ability of characterizing the image contents and improve performance both in retrieval efficiency and effectiveness.

Application of Wavelet Packets decompositions in iris recognition

;

2006, 26(5):  1006-1008. 

Asbtract ( )   PDF (752KB) ( )  

Related Articles | Metrics

The method of wavelet packets decompositions originating from wavelet transform is more accurate in signal analysis, with the predominance of analyzing details information of high frequency. Combined with the traits of wavelet packets decompositions, an algorithm for iris recognition was presented in this paper. Firstly, iris image was divided into several windows, and wavelet packets decompositions were done to them. At the same time, some subbands from each window were selected, which contain most information of iris image. Secondly, the farther feature extraction and compression were applied to these subband images by way of SVD(Singular Value Decomposition), and iris recognition features were obtained. Finally, weighted Euclidean distance classifier was utilized in recognition. Experimental results show the method is valid in iris recognition.

InSAR Image Compression Based on Wavelet Transformation and Fast Vector-Quantization

;;

2006, 26(5):  1009-1011. 

Asbtract ( )   PDF (891KB) ( )  

Related Articles | Metrics

A new image compression method for the interferometry synthetic aperture radar(InSAR) image based on of wavelet transform and fast VQ was presented. In the domain of wavelet transformation, data characteristics were applied to quantize data in no-linear mode. Then a fast coding method of wavelet tree-structure VQ was used to compress the InSAR data. With this method, non-linear VQ combined with the wavelet soft threshold technique can suppress noise in InSAR data definitely. Experiment results show that the presented compressing method is more efficient than typical EZW and SPIHT.

A Mosacing Algorithm of Large-Scale Microscope Images

;;

2006, 26(5):  1012-1014. 

Asbtract ( )   PDF (785KB) ( )  

Related Articles | Metrics

Image mosaicing is an important technology in the field of image processing and computer vision. To eliminate error accumulation in the mosaicing of large-scale microscope images, a new algorithm was proposed. The algorithm solved the local alignment parameters with the hierarchical model to increase the robustness and speed of image alignment. Then it constructed the global image alignment model and gets the optimization solution by solving a set of linear equations. Experiments show that this algorithm effectively eliminates error accumulation and gets the desired result.

An Adaptive Texture Segmentation Method Based on Property of HVS

bisheng;

2006, 26(5):  1015-1017. 

Asbtract ( )   PDF (801KB) ( )  

Related Articles | Metrics

Texture segmentation involves subdividing an image into differently textured regions. Many texture-segmentation schemes are based on a filter-bank model, e.g. Gabor filter-bank. But these algorithms usually are limited because of the texture's variety and the parameters selection difficulty. These deficiencies lead to the inefficient extracted feature, the worse classification results and the limited application domain. In this paper, a texture segmentation algorithm based on the HVS mechanism was presented. It can give the number of texture type and approximate areas in the image mimicking the preattentive stage, and can also give the Gabor filters parameters mimicking the focused attention stage. This algorithm corresponds to the HVS property, and the approach is easy to implement and computationally efficient. The features are characteristic, and the classification results have higher accuracy.

Constructing muti-level TIN with voronoi diagrams

;;

2006, 26(5):  1018-1020. 

Asbtract ( )   PDF (582KB) ( )  

Related Articles | Metrics

There always have a large number of terrain points in GIS because of landform’s complexity. TIN composing discrete terrain points almost has the same amount of spatial data as it is and the response time of analysis and 3D visualization becomes too long to wait for. To solve those problems, this paper constructs muti-level TIN directed by LOD. Subsequently this paper proposes an algorithm to combine all TINs to make a new one and stores data into it uniformly. This algorithm updates TIN in local for view transformation and loads data based on its level. The rendering and browsing speed is much improved with little affection from data volume. This algorithm can be used in GIS suitably.

Moving cast shadow suppression from a Gaussian mixture shadow model

;;;;

2006, 26(5):  1021-1023. 

Asbtract ( )   PDF (1019KB) ( )  

Related Articles | Metrics

The background modeling of complex environment, moving object detection, and moving cast shadow suppression could be applied to a lot of fields such as intelligent surveillance, robot vision and videoconference ect. In moving foreground detection, an improved mixture Gaussian-based background modeling method was presented, which updated the parameters of Gaussians according to the frequency of pixel value changes, to reduce the cost of computation. In shadow suppression, a mixture Gaussian-based clustering algorithm was provided to detect and suppress shadow. This method firstly identifies whether a pixel value is probable shadow by shadow model in HSV color space, the pixel values detected as probable shadow are then put into mixture Gaussian shadow model to learn and cluster. The experimental results indicates that the proposed approach in this paper can process in real-time and remove shadow more effectively.

Motion Estimation Based On Low Frequency Sub-image

;;

2006, 26(5):  1024-1026. 

Asbtract ( )   PDF (642KB) ( )  

Related Articles | Metrics

In order to reduce the computational complexity of motion estimation and improve the accuracy, a fast motion estimation algorithm based on low frequency sub-image is proposed. The algorithm firstly puts Current Frame and Reference Frame throug h a low-pass filter to get low frequency sub-images with quarter pixels, then attains the best matched sub-block by Full Search, at last the area of Reference Frame covered by the sub-block are searched to get the best matched point. Compared with tranditional algorithm, experimental results show that this algorithm gives a significant improvement in accuracy for Motion Estimation and reduces the computational complexity, and possesses strong robustness in different kinds of video sequences.

Fast Algorithm of Real-time Medical Image Lossless Compression

;;;

2006, 26(5):  1027-1029. 

Asbtract ( )   PDF (599KB) ( )  

Related Articles | Metrics

图像无损压缩技术可以改善要求高采样频率和高保真的医学图像实时传输系统的带宽占用。利用基于效率优先的快速算法，可以在相近压缩比的状态下，改善了压缩的速度，提高了压缩效率，使得整数小波变换可以做到每秒处理24帧以上的256×256医学图像。

Locally adaptive image denoising based on bivariate shrinkage function

Xin Liu;;

2006, 26(5):  1030-1031. 

Asbtract ( )   PDF (808KB) ( )  

Related Articles | Metrics

To improve the performance of image-denoising methods, a locally adaptive denoising algorithm was presented. The new algorithm assumed the statistical dependence among wavelet coefficients. First, a bivariate probability distribution model was introduced to model the statistics of wavelet coefficients, and corresponding nonlinear threshold function (bivariate shrinkage function) was derived from the model using the Bayesian estimation theory. Secondly, using locally variance estimation, a locally adaptive image-denoising algorithm was presented. Also this algorithm could be applied to the complex wavelet domain. Experimental results and comparision analysis are given to illustrate the effectiveness of this denoising algorithm.

Face detection based on facial information and SVM

;;;

2006, 26(5):  1032-1034. 

Asbtract ( )   PDF (779KB) ( )  

Related Articles | Metrics

Face detection is a complicated and significant problem of pattern recognition, which can be widely used. An algorithm for face detection with fast speed and accurate precision was presented, which integrates facial information and support vector machine. First, the skin color model is used to detect human face, then each candidate region will be evaluated by geometric feature of face, finally the appropriate features by singular value decomposition will be passed to the SVM classifier for the final decision. The experimental results demonstrate the feasibility of this approach.

A New Approach of Image Edge Detection Based on Sobel Operators and Grey Relation

KangTai Wang;

2006, 26(5):  1035-1036. 

Asbtract ( )   PDF (886KB) ( )  

Related Articles | Metrics

A new approach to detect image edge using the Sobel operators and grey relation was brought forward, and then mechanism and algorithm were introduced. Simulation shows that this method has a high precision in image detection, a better antinoise ability and improving image detection effect.

Linear discriminant analysis based on weighted Fisher criteria and face recognition

;;

2006, 26(5):  1037-1039. 

Asbtract ( )   PDF (813KB) ( )  

Related Articles | Metrics

A novel method based on weighted discriminant analysis for face recognition was proposed in this paper. First, the Fisher criterion was redefined by introducing a weighting of the contributions of individual class pairs to the overall criterion. Then, to deal with the high dimensional and singular case in face recognition problems, a simple and efficient algorithm was developed. Finally, the proposed algorithm was tested on ORL face database, and a recognition rate of 96% was achieved by using either a common nearest neighbor classifier or a minimum distance classifier. The experimental results show our method is superior to the classical Eigenfaces and Fisherfaces.

Improvement of image segmentation based on GVF model

;

2006, 26(5):  1040-1041. 

Asbtract ( )   PDF (1107KB) ( )  

Related Articles | Metrics

The GVF model is more appropriate used to segment concave and convex objects than the snake model. But the GVF model doesn’t perform very well when it segments thin and concave objects. In this paper through the analysis of the force fields, we improve the GVF model and overcome the above disadvantages. At the same time introducing direction vector in the improved GVF model we can segment any interested objects.

Improved method for image denoising based on fractal image coding

;

2006, 26(5):  1042-1044. 

Asbtract ( )   PDF (1083KB) ( )  

Related Articles | Metrics

Fractal image denoising is a novel approach of image processing which can be applied for image denoising through estimating the noise variance and fractal encoding parameters of original image from the noise image. On the basis of this approach, the block effect brought by fractal encoding was weakened. Experimental results show that the resulting fractal code yields a significantly enhanced and restored representation of the original noisy image with an acceptable PSNR.

Scientific Visualization With Spline Interpolation Model

;

2006, 26(5):  1045-1047. 

Asbtract ( )   PDF (545KB) ( )  

Related Articles | Metrics

We propose a new approach to reconstruct nondiscrete models from gridded volume samples. As a model, we use spline interpolation on a uniform tetrahedral partition, which the spline coefficients are repeated by the gridded samples. Our results confirm the efficiency of method and demonstrate high visual quality for rendering isosurfaces.

5/3 lossy compression reconfiguration optimization in JPEG2000

;

2006, 26(5):  1048-1049. 

Asbtract ( )   PDF (399KB) ( )  

Related Articles | Metrics

In Jpeg2000，define a standard reversible lifting-based 5/3 wavelet filters. In this letter, we use a method to get a parameter，which will be used at the time of decompression, we get the parameter when we compress the image use lifting-based 5/3 wavelet filters. At the time of decompression, we can use the parameter to preserve more image detail.

A new method to fuse highlight skin's pixels with multi-resolution

;;

2006, 26(5):  1050-1052. 

Asbtract ( )   PDF (831KB) ( )  

Related Articles | Metrics

A new method was proposed to syncretize highlighted and non-highlighted pixels in the multi-resolution pyramid to combine two images. In the merged image, the skin pixels still present Γ shape in Tint-Luminace plat. Several results are also provided at the end of the paper.

Method of image enlargement based on curves of rational quadratic spline

;

2006, 26(5):  1053-1054. 

Asbtract ( )   PDF (812KB) ( )  

Related Articles | Metrics

In this paper, a new method which based on the curves of rational quadratic splines was presented to enlarge images. When an image was processed by using this method, every raw and column of it was scanned and then with the greyhounds that had been gotten in the processor of scanning, a rational quadratic-curve could be constructed. In the end, appropriated greyhounds were taken down the quadratic-curve and inserted into the target to archive an enlarged image. In this method, a mapping-factor is used to modify the new greyhounds and the brim characteristic and definition of the image after enlarged have been guaranteed.

Information security

Cryptanalysis of Ku-Chien’s Remote Authentication Scheme

2006, 26(5):  1055-1057. 

Asbtract ( )   PDF (571KB) ( )  

Related Articles | Metrics

Ku-Chien proposed a low cost and practical solution to password authentication using smart cards. the security of Ku-Chien’s scheme is analyzed in this paper. it still has some weaknesses: it cannot resist parallel session attack; it also cannot withstand masquerading remote system attack. The reason of faults is due to the similar structure of secure information of login phase and authentication phase. Based on password changing counter, an enhanced password authentication scheme with better security strength is presented. This scheme has many merits: freely choosing and changing passwords; providing mutual authentication; resisting message replaying attack and insider attack; having strong security reparability; withstanding parallel session attack and remote system attack.

Chaotic-Maps-Based Hash Function and its Application to Identity Identifier Certification

;

2006, 26(5):  1058-1060. 

Asbtract ( )   PDF (485KB) ( )  

Related Articles | Metrics

The encryption, secret storage, and authentication of user-identity-identifier are the necessary steps in the copyright protection for software, and so on. In this paper, we propose a piecewise-linear chaotic map and construct its composite function whose statistic characteristics are analyzed. For the purpose of encrypting user-identity-identifier, a chaotic-map-based Hash function is constructed. Based on the first function, other Hash functions are also constructed to generate certificate in which user-identity-identifier is hidden. The authors’ experiment results show that the proposed algorithms are exact, security, efficient, and practical for information encryption and identity certification.

Encryption access control and transmission of XML documents

Jian Meng;;;

2006, 26(5):  1061-1063. 

Asbtract ( )   PDF (571KB) ( )  

Related Articles | Metrics

Extensible Markup Language (XML) has become the standard for data interchange on the Internet. In this paper, based on the special structure of XML documents, an access control model (ACM) was brought forth. According to this access control model and different roles of hosts, their characteristics, their relationships and access control base (ACB), an algorithm of grouping and encrypting XML documents was designed. Key-collation table was created and keys were distributed and managed. Hosts use one or more keys to decrypt XML documents and the server is set free. The access of hosts is temporally controlled by ACB. On the basis of access control model, the method of transmitting securely XML documents encrypted according to access control privileges, to hosts of different grades, and the method of security check-up were put forward.

Risks description based on XML and corresponding flexibly with policies

HongYan Liu

2006, 26(5):  1064-1067. 

Asbtract ( )   PDF (1043KB) ( )  

Related Articles | Metrics

With the diversification of the risk and security requirement, the traditional modes which corresponding with security policies by text or database are hardly faced the requirement of the users. In this paper, through describing the risk with XML, its harmfulness with the qualitative and quantitative method was analysed and our analysis tool was realized. Using the tool, the security policies was selected flexibly and also the composite policies were selected flexibly corresponding with the composite risks.

Improved Convertible Signcryption Schemes

;;

2006, 26(5):  1068-1070. 

Asbtract ( )   PDF (674KB) ( )  

Related Articles | Metrics

Several convertible signcryption schemes with semantic security based on elliptic curve cryptosystem are proposed. In these schemes, if the signer denies her signcryption, the receiver can prove the dishonesty of the sender to any third party by converting the signcryption into an ordinary signature. These schemes have improved the weaknesses that the semantic security of the message cannot be provided in H-C scheme and W-B scheme and the session key is easily divulged in H-C scheme. Compared with current schemes, our schemes have lower communication cost and computational cost.

Novel approach for protecting integrity of kernel based on reference monitor

;;

2006, 26(5):  1071-1074. 

Asbtract ( )   PDF (772KB) ( )  

Related Articles | Metrics

With concept of reference monitor and function of virtual machine monitor, a novel approach for protecting integrity of kernel was designed. In the design, a virtual machine monitor was used as reference monitor by our adding reference monitor module into it. Guest operating system kernel runs on the top of the reference monitor as non-privileged mode. When the non-privileged kernel attempts to write some resources, it is mandatory for the writing permission to be verified and approved by the reference monitor running in privileged mode. So, it prevents malicious code from tampering the kernel. Compared to the traditional defense methods against malicious code, these traditional methods only can detect integrity of kernel, but not prevent it from tampering the kernel.

Radial Basic Function-Based Intrusion Detection Systems

;;

2006, 26(5):  1075-1076. 

Asbtract ( )   PDF (557KB) ( )  

Related Articles | Metrics

An intrusion detection system is a critical component for secure information management , and An intrusion detection system is an art to detect network intrusions by monitoring the network traffic patterns. This paper introduces the technology of radial basic functions neural network into intrusion detection, and describes new network intrusion detection system based on radial basic functions neural network (RBFIDS). The system first gather information of the network, then use k-means clustering methods to determine the parameters of RBF neural network. In the experiments run on the KDD-99 datasets for performance evaluation the system achieved a correct detection rate equal to 98% and a false detection rate equal to 1.6%. The experimental results show the RBFIDS system improves the performance of intrusion detection systems with a high detecting rate and a low false positive.

An Intrusion Detection Model Based on Immune and Rough Sets Theory

;;

2006, 26(5):  1077-1080. 

Asbtract ( )   PDF (836KB) ( )  

Related Articles | Metrics

Intrusion detection system has become the research hotspot because it can provide dynamic protection for computer system. Aiming at the problems existed in actual methods or models of intrusion detection, an effective method for intrusion detection based on immune theory and rough sets theory was presented in this paper. The circular sequences of system call sequences generated during the normal execution of a process is replaced by circular body, then, a little data is extracted from normal system call sequences, and is transformed to decisive table, afterward, the decisive table is reduced and the simplest rules that present normal behavior mode is extracted from reduct by rough sets theory. These rules can be used to detect anomalous behavior. In order to realize the quick detection of known intrusion, an engine of quick detection inspired by immune system theory was presented in this paper. Compared with other methods in the literature, the method presented in this paper is not only able to extract a set of effective detection rules with the minimum size from part of records of system call sequences, but also can detect the known intrusion quickly. Experiments show that this method in this paper is better than other methods based on system call.

Misuse intrusion detection system based on user trust degree

QingBei Guo

2006, 26(5):  1081-1083. 

Asbtract ( )   PDF (818KB) ( )  

Related Articles | Metrics

In this paper, a misuse detection model for IDS based on user trust degree (UTD) was firstly presented. This model improves the architecture of IDS, the strategy of signature matching, and the cooperation mechanism. UTD-IDS presents a means of graded partition that based on UTD whereas there is a lack of graded partition in the architecture of CIDF, so it improves the rationality of the system. The safety level of misuse IDS was defined and the IDS of lower safety level may prevent unknown intrusion from damage by the early-alert principle. In addition, was reformed full advantage of local principle were taken in UTD-IDS, then the strategy of signature matching, so it improves the efficiency and accuracy of signature matching.

基于Windows 2000的存储加密系统设计与实现

;;

2006, 26(5):  1084-1086. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

This paper analyzes the structure of Windows2000 file system, presents a design project of virtual disk storage encrypt system. After discuss the design and implementation theory of the storage encryption system based on the file system of Windows2000, this paper presents the implementation of the storage encrypt in driver and analyzes the using method of the key in the encryption module. This storage encryption system realizes the transparent encryption and the high security.

A New Approach for Formal Analyzing Encryption Protocols

;;

2006, 26(5):  1087-1089. 

Asbtract ( )   PDF (546KB) ( )  

Related Articles | Metrics

Aiming at the shortcoming that traditional temporal logic regards protocols as close system to analyse, this paper proposes a ATL(Alternating-time Temporal Logic)logical method based on game to analyse cryptographic protocols. In the end, we make strict formal analysis for Needham-Schroeder protocol with this new method, as a result we validate there exists reply attacks。 These works indicate that the ATL logic based on game is more suitable to describe and analyze cryptographic protocols than traditional CTL.

Research and implementation on resource monitoring architecture of secret-associated network

;;

2006, 26(5):  1090-1092. 

Asbtract ( )   PDF (629KB) ( )  

Related Articles | Metrics

To establish the resource monitoring architecture of secret-associated network, the internal deregulation operations in secret-associated network was analyzed, and the ways about leaking the secret information was introduced. Based on the research, the leaking of secret-associated information can be prevented by real time monitoring usage of software or hardware resource of secret-associated compute. The prototype system's components and software structure were designed and implemented, which are based on the resource monitoring architecture proposed. Specially, the establishment, assignability and application of the security policy were described in the paper.

Dynamic key escrow scheme based on one-way function

;

2006, 26(5):  1093-1095. 

Asbtract ( )   PDF (605KB) ( )  

Related Articles | Metrics

A dynamic key escrow scheme was proposed based on ElGamal public key cryptosystem and one-way function, which could effectually identify cheaters, and could be applicable to arbitrary access structures. The key shadow could be reused for many times. When some key agents' key shadow had been revealed, they could be renewed without any effect on the others. The scheme can accept or fire a key agent easily, which not only is security, but also increases dynamic and flexibility of key escrow.

Study of workplace security in the migrating workflow management system

;;

2006, 26(5):  1096-1098. 

Asbtract ( )   PDF (940KB) ( )  

Related Articles | Metrics

The migrating workflow gave a new direction within the workflow management area, at the same time, it brought more security risks to the migrating workflow management system. Owing to the working characteristic of migrating instance, the security problems in migrating workflow management system contained the workplace security problems and the migrating instance security problems. In this paper, the workplace security problems were studied particularly, workplace security policy was given, and a security model of workplace was offered. Some key techniques and its implementation about the security model such as security loading, state monitoring and access control were also discussed here.

Research on adaptive information filtering based on incremental learning and threshold optimization

2006, 26(5):  1099-1101. 

Asbtract ( )   PDF (596KB) ( )  

Related Articles | Metrics

In order to meet web-based on-line information filtering requirement, a new realistic adaptive information filtering model was proposed in this paper. In the system initiations stage, the profile is improved by active topic term learning and term weight value updating based on incremental learning the few pseudo relevant feedback samples. An incremental feature selection method was presented based on document frequency. In the filtering test stage, aimed at the system's optimization utility, a new technique was proposed which combined the probabilistic distribution model and document stream statistical information to update and explore the dissemination threshold actively. Experimental results show that the new methods lead to a higher performance in the adaptive information filtering system.

Distributed data storage method based on information decentralization algorithm

;;

2006, 26(5):  1102-1105. 

Asbtract ( )   PDF (860KB) ( )  

Related Articles | Metrics

In the distributed data saving project, in order to solve the problem of large saving expense aroused by replication method and secret sharing method, a data saving project in the distributed system based on the customer-server mode of IDA code was put forward. In the process of data writing, through the construction of the Hash value class of data piece after coding, namely the numerical fingerprint, the integrality of the Byzantine environment data can be fully protected.

Artificial intelligence

Feedforward Neural Network Learning Algorithm Based on Bi-Phases Weights' Adjusting

;;

2006, 26(5):  1106-1108. 

Asbtract ( )   PDF (564KB) ( )  

Related Articles | Metrics

This paper presents a novel feedforward neural network learning algorithm, which adjusts the weights during both forward phase and backward phase. In the forward pass, the least norm square solution is calculated as the values of the weights between the hidden layer and output layer; The backward pass, on the other hand, modifies the weights connecting the input layer to hidden layer according to the error back-propagation algorithm based on gradient descent. The training algorithm modifies different weights in the neural network, so it converged quickly and generalization ability can be improved to a certain extent. The experimental results show that the new algorithm can produce good performance compared to Levenberg-Marquardt BP algorithm.

Method of clustering about situation assessment

;

2006, 26(5):  1109-1110. 

Asbtract ( )   PDF (599KB) ( )  

Related Articles | Metrics

Describe the issue of object clustering about situation assessment and point out that object clustering is one of important function which situation assessment need achieve. object clustering mainly use cluster analysis based on the information from lower level data fusion. The output of object clustering is helpful to determine the relationship among situation elements thus interpreting the actions related to problem field and supporting command decisions. CHAMELEON algorithms is used to clustering based on the RI and RC.

An Immune Genetic Algorithm Based on Chaos Theory

Nan Zhang;;;

2006, 26(5):  1111-1112. 

Asbtract ( )   PDF (521KB) ( )  

Related Articles | Metrics

To increase operating efficiency of immune genetic algorithm, a chaos immune genetic algorithm is presented based on the chaotic character of immune system. Over-spread character of chaos sequence was used to overcome redundancies, and chaos initial value sensitivity was used to enlarge search space. Thus, the diversity of population was retained and local optimization was avoided. The experimental results show that the algorithm evidently improves the convergent speed and astringency.

Optimal design of fuzzy controller based on immune principle and its simulation

;;

2006, 26(5):  1113-1115. 

Asbtract ( )   PDF (624KB) ( )  

Related Articles | Metrics

By use of immune evolutionary algorithm, a new optimal method of fuzzy controller was presented. Fuzzy control rules and parameters of member functions are encoded respectively in forms of real number cluster, and then integrated optimization is carried out step by step, which leads to decrease in dimension of optimal parameters and increase in optimal speed and precision. Final simulation for pressure adjustable casting control system shows better performance of the method.

Research on requirement-oriented product integration innovation model

;

2006, 26(5):  1116-1119. 

Asbtract ( )   PDF (743KB) ( )  

Related Articles | Metrics

Deficiencies of existing models were discussed at aspects of formalization, predication, feedback, etc. A new model was introduced, filtering by requirement information, analyzing from uses' point of view, and taking efficient feedback. Any product is formalized into attributes with weight, big item sets utilized to filter, fuzzy clustering leveraged to generate proposals, and estimation fed back to revise relation of attributes. The model supposes knowledge is implied in relations, takes on preferable innovation effect and adaptability, and primarily applies to integration innovation.

Separation of mixed speeches based on FastICA algorithm

;

2006, 26(5):  1120-1121. 

Asbtract ( )   PDF (507KB) ( )  

Related Articles | Metrics

The principle and algorithms of independent component analysis(ICA) was illustrated. Considering the diversity of the sound, which kept only comparatively independence in the source signal and using the idea of blind signal separating, the FastICA algorithms in sound separation was tried. Finally, two sounds were tested and some good results were got.

Application of neural network based on particle swarm algorithm for the prediction of oil quality

;;

2006, 26(5):  1122-1124. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

PSO(particle swarm optimization) algorithm is a kind of stochastic global optimization based on swarm intelligence. Through the interaction of particles, PSO searches the solution space intelligently and finds out the best solution. The advantage of PSO is that it is easy to operate and to achieve. A model integrating PSO and NN (neural network) was established in this paper, which takes full use of the global optimization of PSO and local accurate searching of BP. The example of oil quality prediction shows that PSONN is more efficient and has good generalization.

Hierarchical categorization methods of Chinese text based on vector space model

;

2006, 26(5):  1125-1126. 

Asbtract ( )   PDF (641KB) ( )  

Related Articles | Metrics

On large amount conditions of text quantity, hierarchical text categorization was an effective approach. Aiming at structural characteristics of hierarchical text categorization, and considering various demands of texts in different levels on both feature selection and categorization method, a new method, Feature Dual-Selection(FDS), and an algorithm of Hierarchical Text Categorization(HTC) based on vector space model was proposed. FDS is to perform feature selection in each level, and then modify feature number along with term weighting method accordingly; HTC algorithm integrates together center classification method and Support Vector Machine(SVM), which proves more effective for broad classification and subdivision respectively. Finally, experiment results show that the new approach, proposed in this paper, outperforms plain or generic hierarchical methods with improved accuracy.

Fast clustering algorithm based on window: F-CABDET

;;;

2006, 26(5):  1127-1129. 

Asbtract ( )   PDF (597KB) ( )  

Related Articles | Metrics

A fast clustering algorithm called F-CABDET(Fast Clustering Algorithm based on Building a DEnsity-Tree) was presented, which significantly improves computing efficiency, reduces executing time and achieves satisfactory clustering results by the window-based method of converting global computation into local computation. F-CABDET algorithm, only one input parameter needed, has the abilities of discovering clusters with arbitrary shape and processing the noise data for its changeable radius of neighborhood. The experiment results demonstrate the effectivity of F-CABDET algorithm.

Network and communications

PHY-DLL adaptive cross layer algorithm for multi-user OFDM mobile systems

;

2006, 26(5):  1130-1133. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

Adaptive cross layer design was becoming a popular design methodology for the computer and communication systems. In this paper, cross-layer adaptive transmission algorithm for OFDM mobile system was proposed. This algorithm combined sub-carrier allocation in the physical(PHY) layer with traffic scheduling at the data link layer (DLL) by employing the channel state information. Simulation results showed that the proposed cross layer scheme outperforms the mere physical layer adaptive markedly. The novel algorithm could support added active users, improve performance of the packet success rate per time chip and bit error rate.

Web page classification based on extracting hierarchy from Web site

;;

2006, 26(5):  1134-1136. 

Asbtract ( )   PDF (555KB) ( )  

Related Articles | Metrics

Web page classification was one of the hot study problems in the domain of Internet Search currently. Now there were the classifiers based on text and the hyperlinks. But all these methods of classification only used the information of the pages without the information that was provided from the whole web site. In the article, there was a new arithmetic that simplifies the topology structure of the Web site and extracted the connotative hierarchy of the classification to build the classified tree, through which we could achieve the multi-level classification. This method has been applied to the system of intelligent searching and mining of electronic business successfully.

An API Network Congestion Control Scheme Based on Velocity Control

;

2006, 26(5):  1137-1140. 

Asbtract ( )   PDF (835KB) ( )  

Related Articles | Metrics

A adaptive proportional integral-velocity (API-V) Controller for new active queue manaqement scheme was proposed, which is well suited to dynamic network environments, in order to address the show response of PI controller. Velocity controller was added based on PI controller when the length of queue is larger. obtain present load information according to present measured dropping probability, then set up the relevant parameters in PI scheme dynamically. Analysis and smulation results show that API-V controller can not only achieve faster convergence speed and faster response and smaller queue oscillation than PI controller and improved PI controller but also increase the buffer utilization.

Analysis and improvement on packet index maintenance algorithm of SRTP

;;

2006, 26(5):  1141-1143. 

Asbtract ( )   PDF (594KB) ( )  

Related Articles | Metrics

SRTP provided confidentiality, message authentication, and replay protection to the RTP traffic. One of the hard point to implement SRTP was to calculate the packet index and update the ROC and s_l. The packet index maintenance algorithm suggested in the RFC3711 was analyzed, based on which introduced an optimized algorithm to improve the SRTP performance under hardware pipeline and/or multiprocessor architecture implementation, and a comparison on the two algorithms was done based on the HIPP security chip's SRTP implementation.

Neighborhood aware routing protocol based on AODV

ZhongCan Zhao;

2006, 26(5):  1144-1145. 

Asbtract ( )   PDF (382KB) ( )  

Related Articles | Metrics

Every node has its neighbors in ad hoc networks. Making use of the information of neighbors, the routing protocol can be optimized observably. In this paper, a new Ad Hoc routing protocol named NA-AODV based on AODV is proposed. Taking advantage of neighbors, NA-AODV enable the routing nodes to repair the broken route quickly. The simulation analysis indicates that the throughput and end-to-end delay of NA-AODV are much better than that of AODV.

Study On Unified Resource Manage Architecture Supporting SSO

;;

2006, 26(5):  1146-1147. 

Asbtract ( )   PDF (581KB) ( )  

Related Articles | Metrics

Several Single Sign-On models are analyzed and compared. A broker and agent based Kerberos Single Sign-On and unified resource manage frame is proposed, which helps to simplify the user authentication and management process of network sign on and resource access. The structure and its implementation of the frame are also introduced.

A Self-adaptive Routing Algorithm Based on Clustering for Sensor Networks

;;;

2006, 26(5):  1148-1151. 

Asbtract ( )   PDF (726KB) ( )  

Related Articles | Metrics

Considering the limited energy and transmission range of sensor nodes in sensor networks, an innovative routing algorithm was proposed. Firstly it selected cluster-heads self-adaptively based on local information and worked order of each node. And then it found some efficient routes for communication among virtual backbone networks which was made up of sinks and cluster-heads. It differed from LEACH, the classical clustering algorithm, in the new algorithm it selected cluster-heads by considering the working order synthetically instead of periodically. And cluster was stable for a while until it obtained certain conditions whose cluster-head changes in-cluster. Furthermore data was forwarded via routes instead of being sent directly to sinks which might be far away. Therefore it is distributed, low complexity and can balance the energy expenditure which will render the total energy expenditure lower and increase the throughput. Also theoretic analysis and simulation results prove it is effective and scalable.

The Performance Optimization of Java Virtual Machine in Linux NC

2006, 26(5):  1152-1154. 

Asbtract ( )   PDF (574KB) ( )  

Related Articles | Metrics

Abstract: At present, the performance of Java Virtual Machine in Linux NC is relatively low. This paper came up with an optimization, which based on the Direct Threaded Interpreter, and three extended techniques were designed to stand out the effect of optimization. In this way, considered the conditions of hardware and software, the executing efficiency of Java VM can be upgraded. Besides, this project can also reduce the cost of CPU and memory. Key words: Kaffe; Linux; NC; Java Virtual Machine; Performance Optimization

Structure and realization of spatial information grid's node based on NWGISS

;;

2006, 26(5):  1155-1157. 

Asbtract ( )   PDF (756KB) ( )  

Related Articles | Metrics

The space information grid can integrate a huge volume of multi-source data from multiple data centers, and realize resource sharing and coordinating. The concept structure of space information services node was studied, the composition structure and work mechanism of NWGISS were analyzed, the structure and prototype system of the node based on NWGISS and OGC interface specification were designed. Experimental result indicates the data node can provide space information services effectively.

New Researches for Performance Monitoring of Desktop Grid

;

2006, 26(5):  1158-1160. 

Asbtract ( )   PDF (893KB) ( )  

Related Articles | Metrics

Accurate, continuous resource monitoring and profiling are keys for enabling performance tuning and scheduling optimization. After studing performance monitoring of desktop grids system based on sandbox, a monitoring tool which builds a global, accurate, and continuous view of resource utilization for desktop grids was presented. The test result demonstrate that monitoring tool can scale to large desktop grids with low cost of resource consumption (less than 0.1%) on desktop PCs. Although monitoring tool developed with the Entropia DCGrid platform, it is easily integrated into other desktop grid systems, and existing grid information services was supported.

Database Technology

A New Algorithm for Scheduling Out-Tree Task Graph

;

2006, 26(5):  1161-1163. 

Asbtract ( )   PDF (484KB) ( )  

Related Articles | Metrics

Out-Tree task graphs represent a number of divide-and-conquer algorithms. This paper proposes a new algorithm for scheduling an Out-Tree task graph. The priority of each task is defined by using the optimal scheduling algorithm of fork structure，which exactly reflects the task’s influence to the schedule, and can guarantee its right schedule order, obtained the superior scheduling length. It allocates the nodes to the used processors as possible without changing the scheduling length, saves processors. The simulation shows that the performance of the proposed algorithm is better than the other existing schmems.

Research and Implementation on Routing Mechanism Based on Interest Mining in unstructured P2P Systems

YiHong Tan;;

2006, 26(5):  1164-1166. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

In the environment of unstructured peer-to-peer (P2P), routing scheme is one of the key factors affecting information searches. A routing scheme based on interest indexical table is proposed in this paper. Moreover, on the basis of it, we implement a P2P full text information retrieval prototype system Isearch. Firstly, we represent local file content of a peer with vector space model. After that, vector space is clustered to obtain interest class of this peer. And then, interest similar degree is computed among peers to build interest indexical table locally. When search occurs, query requests are forwarded to the peers with similar interest directly according to the interest indexical table. Experimental results show that ISearch can not only make good retrieval results, but also reduce the number of query peers and make retrieval more efficient.

Reverse optimize Technique based on speculation in reverse engineering

;;

2006, 26(5):  1167-1170. 

Asbtract ( )   PDF (827KB) ( )  

Related Articles | Metrics

While Performance can be improved still further by using a feature called speculation to ameliorate the effects of long latency memory operations, it requires a significant amount of complex support code to deal with and recover from speculation failures. This greatly complicates the tasks of understanding and re-engineering speculative code. This paper describes a technique for removing speculative instructions from optimized binary programs in a way that is guaranteed to preserve program semantics, thereby making the resulting programs easier to understand and more amenable to re-engineering using traditional reverse engineering techniques.

Retrieval Algorithm Based on Hyperlinks and content similarity

;

2006, 26(5):  1171-1173. 

Asbtract ( )   PDF (564KB) ( )  

Related Articles | Metrics

Under the circumstances of web, classical hyperlink analysis algorithms (such as HITS algorithm) mainly focus on the authority of a web page rather than its topic, so it is easy to drift away from the mining topic when traversing the hyperlinks. The cause of topic drifting away in HITS algorithm is analyzed. By combining the topic analysis method with that of the content relevance evaluation, we present a novel web information retrieval algorithm－WHITS. Experiment results show that WHITS focuses on mining the potentially semantic relationship between hyperlinks and performs quite well in the topic-specific crawling.

Improved Apriori algorithm based on the absolutely join

;;;

2006, 26(5):  1174-1177. 

Asbtract ( )   PDF (802KB) ( )  

Related Articles | Metrics

Based on the principle of Apriori, a excellent premiss of absolutely join was presented, the candidate 4k-itemsets were built directly with absolutely join while created the candidate (2k+1)-itemsets from L2k (the muster of frequent 2k-itemsets); and only used the absolutely join for L2k+1(the muster of frequent (2k+1)-itemsets) to create the candidate (4k+2)-itemsets. This algorithm decreases the times of iteration and the compare. The experiment results show that no frequent itemsets is missed and the speed of the mining is effectively improved in this algorithm.

Algorithm for solving maintaining cost based on Tabu search

;;

2006, 26(5):  1178-1179. 

Asbtract ( )   PDF (585KB) ( )  

Related Articles | Metrics

A new algorithm solving the maintaining with the limited resource based on Tabu search was proposed, the mathematical model was created, and the problem was converted to 0-1 programming. In order to minimize the run times, the graphic model was created, and the idea of the Tabu search was used to solve the problem. A Tabe search heuristic procedure was proposed to find the sequence which allows one to reach a value of the cost function as close as to the global minimum. Simulation results show that the algorithm based on Tabu search has excellent performance.

Method for evaluating real performance costs of applications

;

2006, 26(5):  1180-1182. 

Asbtract ( )   PDF (582KB) ( )  

Related Articles | Metrics

A method to evaluate performance cost of applications was Presented based on execution delay of benchmarking-sequence. With well-chosen benchmark programs and well-designed viewpoints planted in them, the real costs of performance of a certain application can be evaluated relatively by calculating the delay of the characteristic viewpoints before and during executing the application under test. Such method was implemented on Linux with techniques of loadable kernel module and system call interception.

Metrics on Software Components Based on Information Entropy

;

2006, 26(5):  1183-1185. 

Asbtract ( )   PDF (460KB) ( )  

Related Articles | Metrics

The paper is aimed at the measurement of the cohesion and coupling and independce of software component, according to the abstract demonstration of Class diagrams in UML based on directed weighted class dependence graphs as Object-oriented system, combined the technology of information entropy. Through the experiment, it proved that it is an accurate way to measure the software component and it is also a good way to offer the reliable data to the design quality of software component.

Removing the feature of instruction bundle in IA-64 binary translation

;;;

2006, 26(5):  1186-1189. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

With the continuous development of Instruction Set Architecture (ISA), the slower development of corresponding software hinders the popularization of the new ISA. Binary translation is an alternative method to reuse legacy software by code migration from existing ISA. Firstly the function of decoder in binary translation was introduced and a decoding algorithm was designed based on instruction bundle according to the features of IA-64 instructions. During the test, some problems of the algorithm were found, and then an improved method was given and it removed the feature of instruction bundle, supplied a unique virtual address to each instruction on which the decoder acted. The algorithm was achieved in the research of IA-64-to-Alpha binary translation.

Typical applications

Research of the best path algorithms of expeditious reaction system of public security in scenic spot based on GIS

;

2006, 26(5):  1190-1192. 

Asbtract ( )   PDF (776KB) ( )  

Related Articles | Metrics

Classical shortest-circuit path algorithms is a basic of the transportation network analysis system, which has already got the extensive research in theoretic. According to the actual situation of security system in scenic spot, this paper gives the conception of the best path algorithms on the base of the shortest-circuit path algorithms (Dijkstra) with consideration of a coefficient of the road hustling degree. This algorithms is being used in the design and application of public security system in scenic spot with good and practical result based on GIS.

Study of Integrated Scheduling and Control System for Process Industry

;;;

2006, 26(5):  1193-1195. 

Asbtract ( )   PDF (648KB) ( )  

Related Articles | Metrics

Based on characteristic of production control system in process industry, the requirement of integration for scheduling and control system is analyzed and an integration strategy of scheduling and control system is discussed in this paper. New integration system architecture is established and the static and dynamic scheduler structure is designed. Considering the actual requirement for obtain satisfying solution on engineering, we analyzed restrict parameters and scheduling arithmetic of integration system. It offered a new way to integrate schedule and control in process industry.

Research on Automatic Migration Technique Of Web site

;;;;

2006, 26(5):  1196-1197. 

Asbtract ( )   PDF (465KB) ( )  

Related Articles | Metrics

To cope with the problem existing in information web site, such as high cost of development and maintenance, the underlying security trouble, etc, this paper analyses the advantage of using open source software to construct information web site. Then we propose an automatic processing technique which migrate the current information web site to the open source platform. The automatic migration platform designed and developed on the automatic processing technique is applied to the migration programs. The result of migration shows the correctness and validity of our method.

Design of Security Solution for Web-based Educational Administration System

;;;;

2006, 26(5):  1198-1201. 

Asbtract ( )   PDF (823KB) ( )  

Related Articles | Metrics

Abstract：The security problems of traditional educational administration systems(TEASs) are analyzed. In order to improve their security, a novel integrated solution is proposed. In which, network border protection, user identification and access control, intrusion detection, servers’ security, and disaster recovery are presented or strengthened. So the invalid users can be held back, and the exceeding access of valid users can be prevented. At the same time, the new method of Identity-Based Encryption (IBE) can ensure the confidentiality, integrality, usability and the undeniable-ness of the data during the processes of storage, transmission, processing, and so on. As a result, the shortages of PKI, such as the difficulty in managing the public keys, high costs, and low performance can be overcome. Theoretical analysis and the experimental results show that it provides a good security solution to the field of MIS.

Design and Implementation of Chain Enterprise Logistics Distribution System Based on Voronoi Tessellation

;;

2006, 26(5):  1202-1204. 

Asbtract ( )   PDF (812KB) ( )  

Related Articles | Metrics

Analyzing the characteristics of logistics distribution in city chain stores and the geometrical characteristics of Voronoi polygon ,this paper develops an approach of computational geometry for plotting market area of the chain stores based on Voronoi Tessellation so as to realize plotting distribution area automatically, optimizes the algorithm of traditional transport routing and then integrates them into the logistics distribution system of city chain stores.The organization framework of the system is introduced particularly with the application to YongHui Supermarket,which is a famous storage chain store in Fuzhou.It is showed that the system has much pratical value for the management of chain stores.

A Flash Memory Static Wear-leveling Strategy

Jun Zhang;;

2006, 26(5):  1205-1207. 

Asbtract ( )   PDF (694KB) ( )  

Related Articles | Metrics

Flash Memory is a kind of common storage device. Its characteristics of flexibility、low power, and so on offer excellent qualifications for embedded system and mobile system. But Flash Memory must be wrote after erasure operation, which brings forward challenge for storage system designer. The most important thing is that the erasure operation times are very limitable. This paper analyses the data structure and physical characteristics. And a Static Wear-leveling strategy based on classifying data with trigger condition is brought forward. An experiment is carried out to simulate this strategy using VHDL. As a result, the Wear-leveling rate improves.

Embedded Vision Sensor System Based on Windows CE.NET

;

2006, 26(5):  1208-1210. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

based on the description of the construction of Vision Sensor, a system has been developed under the Windows CE.NET environments. As an embedded system, such a system can be used to communicate with other substrate net node camera that can deliver the image data to a localhost through the net bus so as to realize the on-line data monitoring and fault diagnosis.

Defect extraction and segmentation automatically in x-ray images of carbon material

;;

2006, 26(5):  1214-1216. 

Asbtract ( )   PDF (1137KB) ( )  

Related Articles | Metrics

An Agent-Based Model of Artificial Stock Market by Using GNP

;

2006, 26(5):  1217-1219. 

Asbtract ( )   PDF (585KB) ( )  

Related Articles | Metrics

Combined with the idea of Austrian school of economics, this paper proposes a new multi-agent-based model of artificial stock market by using Genetic Network Programming. It focuses on applying the GNP approach to emulate investment behavior of agents. Simultaneously, this model enhances the heterogeneity of agents, and searches for an optimal value of parameters by using GA. Simulation results confirm the effectiveness of GNP-ASM model by empirical statistics.

Study on morphological model of reed and its visualization based on growth mechanism

;;

2006, 26(5):  1220-1222. 

Asbtract ( )   PDF (859KB) ( )  

Related Articles | Metrics

Morphogenesis model of plant considering its physiological function plays the important role in simulating plant growth on computer. After studying morphological and physiological changes of reed during their growth processes and analyzing relations between their characteristics of morphology and physiology, it introduced a method for morphological structure modeling of reed based on growth mechanism. According to this model, visualization algorithm was also presented and large numbers of data resulting from reed development were processed effectively. An example was given and experiment results illustrate the presented model is efficient in simulating reed growth.

A R-wave Detection Algorithm Based on Wavelet Transform and Mathematical Morphology

;;

2006, 26(5):  1223-1225. 

Asbtract ( )   PDF (523KB) ( )  

Related Articles | Metrics

A new algorithm for detecting R-wave of ECG was proposed on the basis of wavelet transform and morphological operation. In this paper, we used Mallat algorithm to calculate dyadic Marr wavelet transforms, did multi-resolution analysis on the signal, and used mathematical morphology operator to clarify the signal’s peaks and valleys. Test results showed that the detection method not only can detect accurately and localize precisely to the R-wave of ECG signal, but also can achieve the real-time detection.

Research on Measurement of Realistic Planting Leaf Area Based on Machine Vision

;;

2006, 26(5):  1226-1228. 

Asbtract ( )   PDF (581KB) ( )  

Related Articles | Metrics

Leaf area is a common criterion in some crop plantings, and it is also an evaluating criterion for quantities and qualities of crop products. But leaf images we get from the real world often have some geometric distortion. Now the geometry correction to leaf images with perspective distortion is researched by knowledge of machine vision, and the objective is to make the corrected leaf images be close to the leaf images without geometric distortion as far as possible. Then we can calculate the leaf area by the math relations according to the statistic of goal pixel. The method greatly decreases the difficulty of measuring leaf area of field-living plants.

Design and implementation of Graphical Label Set Tool(GLSTool) based on VC

Xianfeng Ma;;

2006, 26(5):  1229-1231. 

Asbtract ( )   PDF (656KB) ( )  

Related Articles | Metrics

A large number of data gathered in many projects are visualized in the form of curves by graphical software. For the convenience in recognition and interpretation of curves, by means of the introduction of the concept of graphical label set, GLSTool(graphical label set tool) was designed based on VC++ to create and edit graphical label set, and mark the curves with the graphical label set which has existed. GLSTool is successfully applied to the well logging curves, and turns out very efficient and convenient.

Pitch detection algorithm based on LPC and maximum likelihood

;

2006, 26(5):  1232-1233. 

Asbtract ( )   PDF (491KB) ( )  

Related Articles | Metrics

According to the mechanism of speech signal, an effective pitch detection algorithm by combined liner predictive coding with maximum likelihood is proposed. The proposed algorithm adopts frequency partition to estimate the range of pitch period, improving the computational speed. Simulation experiments show that the pitch extracting results of the proposed algorithm are superior to that of the conventional algorithms, overcoming the random errors and multiple or half frequency errors, especially robust at low SNR.

Research of Inverse-design for Cam follower motion rule based on COM technology

;;;

2006, 26(5):  1234-1236. 

Asbtract ( )   PDF (491KB) ( )  

Related Articles | Metrics

The method to obtain the coordinate va1ues of discrete point on the cam profile from the numerical model of CATIA are studied, The method for the motion regulation of the cam follower are provided on inverse design by use of given discrete point and the basic size of cam, The COM technology of CATIA and V5 Automation API function are provided, the program of the cam follower anti-resolve Kinematics analysis procedure are developed, The error between the measure results and the theoretic results are analyzed, The result shows accuracy and applicability.

Bitwidth Optimization for Loop Computations on Dynamical Reconfigurable Architectures

Wei Wang;;

2006, 26(5):  1237-1240. 

Asbtract ( )   PDF (792KB) ( )  

Related Articles | Metrics

Dynamical reconfigurablity has the potential to change the processing unit’s bitwidth according to the runtime’s condition of the computation. Further more, the dynamic bitwidth optimization for loop computations, which are the one of the most computing intensive tasks, may achieve better performance, small size and less power. In this paper, we develop a management framework to optimize the bitwidth of the loop computations dynamically, including the theoretical and runtime analysis of the loop computations’ bitwidth, and developing a bitwidth management algorithm to select the schedule of reconfiguration and schedule the configuration files. The experimentation indicates that our scheme has better performance.