Table of Content

01 August 2009, Volume 29 Issue 08

Previous Issue    Next Issue

Granhic and image processing

Research on hole filling algorithm in triangle mesh models

2009, 29(08):  2035-2037. 

Asbtract ( )   PDF (598KB) ( )  

Related Articles | Metrics

In this paper, a new algorithm of hole filling is put forward. The algorithm mainly contains four steps. First, the information in the hole’s contour is achieved by the relations of vertex, edge and triangle in the triangular mesh. And then, the hole is filled with triangles according to angles in the hole directly. Next, the new triangles with high curvature are divided. Last, The filled mesh is refined according to surrounding mesh. Some examples are given to show efficiency and stability.

Improved method for recognizing and suppressing blend features

2009, 29(08):  2038-2042. 

Asbtract ( )   PDF (803KB) ( )  

Related Articles | Metrics

Based on the curvature of crosssection curves, an improved blend feature recognizing and suppressing method was proposed. Firstly, all edgeround faces and vertexblend faces in the model were recognized, and then the adjacent recognized faces were combined together as a blend feature. Secondly, all recognized blend features were suppressed as a whole. By extending the support faces of the blend feature, the point of the blendvertex and the curve of the blendedge in the suppressed model were found from the intersection between the extended faces. The topology of the original model was modified to build the suppressed model. The proposed method can recognize and suppress the blend feature with constant and variable radius of solid model with freeform surfaces, and extends the application range of current approaches. Experiments show that the proposed method is effective and feasible.

Implicit surface reconstruction from point cloud data based on generalized polynomials neural network

2009, 29(08):  2043-2045. 

Asbtract ( )   PDF (577KB) ( )  

Related Articles | Metrics

A new type of generalized polynomials neural network was proposed to reconstruct 3D implicit surface from the scattered points. Since its hiddenlayer neurons were activated with the different and linear independent generalized polynomials, the proposed neural network could achieve good performance in learning different patterns. Then the weightsupdating formula for the new type of neural network was derived based on gradientdescent method. The simulation results on some scattered point models show that this method can obtain good reconstruction quality and denoising effect.

New radius compensation algorithm based on Delaunay triangulation

Ji XiaoGang

2009, 29(08):  2046-2048. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

Reasonable radius compensation can improve the precision of reverse engineering greatly. Based on the analysis of existing radius compensation algorithms and corresponding advantages and disadvantages, a new one according to triangle grid radius compensation algorithm is proposed with thought of Delaunay triangulation. At the same time, some key technologies such as ascertainment of criteria for triangulation optimization and treatment of boundary points were expounded in details. At last, radius compensation of data points of blade surface of supercharger impeller was achieved.

Approaches of Computer Caricature : A Review

2009, 29(08):  2049-2052. 

Asbtract ( )   PDF (709KB) ( )  

Related Articles | Metrics

Caricatures are prevalent in most forms of media, from newspapers and magazines to cartoons, with themes ranging from political satire to entertainment. This paper attempted to give an overview of the development in this field by classifying the newly proposed methods into four categories: hand control, templates, caricaturerulesbased, and capturing cartoonist rules by machine learning method. In the end, a prospect of the future development in this field was presented.

Modeling and Animation of Characters with Ball B-Splines

2009, 29(08):  2053-2055. 

Asbtract ( )   PDF (533KB) ( )  

Related Articles | Metrics

Rapid modeling of character is one of challenging problems in computer graphics community. This paper proposes a new approach for modeling and animation of characters. Through using ball B-splines, a skeleton based character model is built automatically. And animation is implemented through reading motion data (from motion capturing). When the skeleton of a character is given, these radii on joints are obtained according to length of bones in Anthropometry. Then Ball B-Spline curves and surfaces are generated to represent characters through interpolating joint points and radii on them. The modeling method is rapid. Furthermore, By using motion data to update control points，character model is renewed, Therefore，character animation is implemented. Such animation can be real time.

Method of modular 2DLPP and its application in face recognition

2009, 29(08):  2056-2059. 

Asbtract ( )   PDF (547KB) ( )  

Related Articles | Metrics

A method of TwoDimensional Locality Preserving Projections (2DLPP) for face recognition was proposed, based on modular image. Firstly, the original images were divided into modular images by presented approach. Secondly, the 2DLPP method was applied to the subimages obtained from the previous step. Then, the modular images were combined according to a certain order to extract the features. Therefore, the dimension of the original images could be depressed. This approach could distill the local features of the images effectively. The experimental results indicate that the proposed method is superior to 2DLPP in recognition performance.

Small target trackbeforedetect algorithm based on unscented particle filtering

2009, 29(08):  2060-2064. 

Asbtract ( )   PDF (643KB) ( )  

Related Articles | Metrics

In order to improve the joint detecting and tracking ability for small targets under complex environments, the authors presented a new TrackBeforeDetect (TBD) algorithm based on particle filter. Unscented Particle Filter (UPF) method was adopted and the motion status and appearance status were jointly scanned in the particle filter. The new algorithm essentially introduces tracking idea into target detecting. It has the merits of highsensitivity, high acquisition probability, good tracking performance and low requirement on sample particle number. The algorithm can effectively enhance the trackingwhiledetecting ability of infrared searching and tracking system.

Feature Extraction of Image And Graphic Based on Chain Code

2009, 29(08):  2065-2067. 

Asbtract ( )   PDF (628KB) ( )  

Related Articles | Metrics

In this paper, a new method was proposed on the basis of hierarchical structure model of image content. Distance chain code was put forward under relative polar coordinate system, as well as difference value code derived from the sum of accumulation of derivatives based on 8direction chain code. Distance chain code was applied to extract internal structure category features, and the difference value code was used to extract the contour morphological characteristics. Then the algorithm extracting gradient, cloud anvil and concave of contour features was designed. The experimental results show that the extracted features have high separability between classes and the processing speed is fast. This method can be used to extract the features of nonrigid images.

A High-Order Anisotropic Diffusion Wavelet Shrinkage Image Denoising Algorithm

2009, 29(08):  2068-2070. 

Asbtract ( )   PDF (682KB) ( )  

Related Articles | Metrics

Image can be regarded as curved surface, and Gaussian Curvature can be used to describe the curves degree of curved surface relative to ball. In this paper, Gaussian curvature was used to define the energy function on image, and then the Euler equation was obtained. Gaussian curvaturebased highorder diffusion (GCBHD) was derived from the Euler equation by gradient decrease method. And then, based on the equivalence of wavelet shrinkage and anisotropic diffusion, a highorder anisotropicdiffusion waveletshrinkage image denoising algorithm (GCBHDWS) was proposed. The experimental results show that GCBHDWS can maintain the high frequency and the shape of edge while denoising image.

New image segmentation method based on gradient

2009, 29(08):  2071-2073. 

Asbtract ( )   PDF (512KB) ( )  

Related Articles | Metrics

To solve the problems of large computation, slow convergence, and easily falling into local extrimum of traditional image segmentation algorithms, a new image segmentation method based on color image gradient calculation was proposed. The experimental results on corn and Lena images, compared with level set method and watershed method, show that the new method can segment images better, faster and steadier, and suits for both grey images and color images.

Color image segmentation based on mean shift and the fusion of multi-feature

2009, 29(08):  2074-2076. 

Asbtract ( )   PDF (424KB) ( )  

Related Articles | Metrics

Since mean shift segmentation algorithm merely concerns about color and spatial information of images, and is not sufficient to segment images with complex texture. A new color image segmentation method using the combination of color, texture and spatial information was presented in this paper. Image feature with color, spatial and texture including polarity, anisotropy and contrast were exacted from images. Segmentation results were obtained by mean shift filtering and merging regions. The experiment results show that the proposed algorithm illustrates excellent performance to natural images with complex texture.

Adaptive image enhancement method based on multiscale Retinex algorithm

2009, 29(08):  2077-2079. 

Asbtract ( )   PDF (513KB) ( )  

Related Articles | Metrics

This paper presented an adaptive image enhancement approach based on MultiScale Retinex (MSR). This method was good at automatic processing on imagery in poor weather conditions, such as frog, rain, thin cloud, or lack of light, to enhance the visual quality. The experimental results approve that this method is effective and generalizable, and suits for many types of images.

Handwritten character recognition based on compressive sensing

2009, 29(08):  2080-2082. 

Asbtract ( )   PDF (441KB) ( )  

Related Articles | Metrics

A robust method for handwritten character recognition with noises based on compressive sensing was presented. The sparsest representation of the test character computed by L1 minimization had distinct class information; therefore, it is easy to classify the characters. The experimental results show that the proposed method is a noise robust technique.

Biological feature recognition and virtual reality

Augmented reality application based on hand shape interaction and palmprint recognition

2009, 29(08):  2083-2086. 

Asbtract ( )   PDF (594KB) ( )  

Related Articles | Metrics

This paper proposed and implemented an Augmented Reality (AR) system based on hand shape interaction and palmprint recognition. The paper proposed a novel fast identification method of hand contour for contour matching and its movement. This system used an improved ant colony clustering algorithm to get hand center quickly, established relevant rendering system, and registered the virtual object. Meanwhile, for personalized applications, the paper proposed fast Harris palmprint identification algorithm applied in augmented reality. Experiments show that the new algorithm has good recognition precision and realtime tracking performance, and can adapt to the application requirements of augmenting reality systems.

Combination of face and gait for human recognition

2009, 29(08):  2087-2088. 

Asbtract ( )   PDF (492KB) ( )  

Related Articles | Metrics

Focusing on the application of intelligent surveillance, this paper proposed a new approach in which the combination of face and gait was used for human recognition at a distance in video sequences. Hidden Markov Model (HMM) and Fisher faces method were primarily applied for gait and face recognition, respectively. And then, the results obtained from the two classifiers were utilized and integrated at match score level. The system was tested on video sequences of 31 individuals collected from different directions. The results show that the combination of face and gait provides a more robust recognition strategy, and it has better recognition performance compared with faceonly or gaitonly method.

Human motion tracking algorithm based on improved Snake model

2009, 29(08):  2089-2091. 

Asbtract ( )   PDF (476KB) ( )  

Related Articles | Metrics

An automatic human motion tracking algorithm combining improved Snake model and optical flow was proposed. The initial contour most close to human body was acquired by corner detection thus decreasing the iterations, and the probability of converging at local extreme value of Snake model was reduced. To resolve the problem that the tracking with Snake model is unstable and often loses the object, the strong feature points were chosen from the contour points in current frame for optical flow estimation, and then the result was chosen as the initial contour of next frame. Experimental results show that improved Snake model can make the initial coutour deform to the actual contour of human body, and realized the automatic and realtime human tracking.

Gait recognition algorithm based on motion pattern in sensor passage

2009, 29(08):  2092-2094. 

Asbtract ( )   PDF (627KB) ( )  

Related Articles | Metrics

A gait recognition algorithm based on motion pattern is presented, which is applied to identify passengers and objects in sensor passage consisted of gates in automatic fare system in railway traffic. The algorithm is improved on the XYT model which is used to detect the human gait. The infrared sensor instead of camera is used to collect the individual access information, and the XYT model in a continuous state will be changed into the gait recognition algorithm in a discrete state. By defining the composite model consistent with the special characteristics of human gait as the gait model, the walker and object can be distinguished. Experiment results show that the gait recognition algorithm used for gates intelligent recognition system is effective.

Iris recognition algorithm combining wavelet transform and LogGabor filter

2009, 29(08):  2095-2097. 

Asbtract ( )   PDF (468KB) ( )  

Related Articles | Metrics

An algorithm combining wavelet transform and LogGabor filter was presented for iris recognition. The low frequency subimage of the wavelet transform contains the primary information of the iris, and the LogGabor filter can effectively extract the iris texture information. The combination of these two approaches is an effective way to extract iris texture. This algorithm firstly decomposed the normalized image by the wavelet transform, then the low frequency subimage was filtered by LogGabor to generate the iris code, finally Hamming distance was used to classify the iris images. The experimental results show the algorithm is superior in terms of recognition rate and equal error rate.

Real AdaBoost face detection method based on multi-threshold

2009, 29(08):  2098-2100. 

Asbtract ( )   PDF (677KB) ( )  

Related Articles | Metrics

Real AdaBoost algorithm demands division of the sample space. The traditional finite division can not reflect the distribution of positive and negative samples. In this paper, a new real AdaBoost algorithm based on multithreshold method was developed. Through the selection method of multioptimization threshold and combining the strategy of weak classifier threshold selection in discrete AdaBoost algorithm, the rational division of sample space was implemented. The experimental results on MITCBCL database prove the improved real AdaBoost algorithm increases the detection rate by 0.5% and 2% than the traditional finite division algorithm and real AdaBoost altorithm, and decrease the error rate by 0.15% and 0.27%, and its convergence is faster.

Algorithm of soft tissue selfcollision detection based on potentially colliding set for virtual surgery

2009, 29(08):  2101-2104. 

Asbtract ( )   PDF (640KB) ( )  

Related Articles | Metrics

Fast and accurate detection of soft tissue selfcollision is an important prerequisite technique for reality surgery simulations. The current collision detection technologies can not meet the realtime requirement due to its high complexity in virtual surgery simulation. The authors proposed a new approach to extract possible collision dataset based on the curvature of soft tissue. The selfcollision detection was only processed on possible collision sets. In addition, the characteristic analysis was used in geometrical elementary tests between primitives. The experiments indicate that the proposed method can improve the performance and accuracy of collision detection.

Study of Contour Lines Extraction from Color Scanned Military Topographical Maps

2009, 29(08):  2103-2111. 

Asbtract ( )   PDF (512KB) ( )  

Related Articles | Metrics

An effective method based on HSV color model for extracting contour lines from color scanned topographical maps was proposed.Firstly the black elements were removed; the value of a pixel in contour line was regarded as the initial value; the scope of hue threshold was expanded in accord with definite step; the number of connectivity region was used to determine the threshold range. This algorithm does not need to artificially specify the centers and quantity of color clustering, and the choice of the initial pixel does not make crucial effect on the quality of the final result. The experimental results verify that this algorithm is robust，and can obtain good extracting effect.

Realtime rendering algorithm of massive mountainous terrain data based on GPGPU

2009, 29(08):  2105-2108. 

Asbtract ( )   PDF (622KB) ( )  

Related Articles | Metrics

Concerning the characteristics of the huge data in mountainous region, the General Purpose Computation on Graphics Processors (GPGPU) technology based on Geometrical Clipmap algorithm was introduced. It adopted easier working process, compressed the elevation data and error data into the floatingpoint type veins, and drew accurate mountain body grid in Vertex Shader. By introducing elevation error data, the crack problem between different resolutions was resolved. The primitive drawn number was reduced by designing reasonable database management. Remote sensing image with high resolution was used as topography grain and the realtime visualization of enormous clipmap data in visual reality system could be realized.

A SIFT-based optimized algorithm of frame choosing on video stitching

2009, 29(08):  2112-2115. 

Asbtract ( )   PDF (726KB) ( )  

Related Articles | Metrics

This paper presented an optimized algorithm of frame selection on the stitching of videos with overlapped visions. Firstly，it compared the Scale Invariant Feature Transform (SIFT) value differences of all the match points of standard frame and candidacy frames, and then selected the point pairs with minimal SIFT value difference, and calculated the mean values of these differences. Finally, the frame with the minimum mean value was selected as the best frame, and stitched with the standard frame. This algorithm assures the best matching frame and can be used to choose the best stitching frame automatically in video stitching. Simulation shows the effectiveness of this algorithm.

Real-time map building based on clustering for mobile robots

2009, 29(08):  2116-2119. 

Asbtract ( )   PDF (774KB) ( )  

Related Articles | Metrics

A new laser scan matching method based on clustering was advanced. It took the advantages of both noniterative matching method and iterative matching method and increased the speed and the precision of matching. A method of map building based on laser scans using the matching method above was presented for mobile robots. The map building method matched two consecutive scans according to the feature points extracted from the scans and then completed the whole map building. In the experiment of rescue robot developed by our laboratory, the new method can accomplish the task of realtime map building in indoor environment accurately and effectively.

Study of electronic madetomeasure for clothing based on body parts assembly technology

2009, 29(08):  2120-2123. 

Asbtract ( )   PDF (684KB) ( )  

Related Articles | Metrics

The human body parts template series were formed through gathering the sample data of human body. The personal 3dimensional virtual human body model was generated by extracting the feature data of the corresponding human body from different types of body shape data files provided by the customer, and then personal prototype garment chips were achieved. According to the technical route above, the architecture of the prototype system was designed, the function structure was provided, and then the prototype system was realized finally. The operation results of the prototype system show that the technical route is right, and the system scheme is reasonable, can help to popularize the application of electronic Made to Measure (eMTM).

Design and implementation of general model about special effects in battlefield based on particle system

2009, 29(08):  2124-2127. 

Asbtract ( )   PDF (646KB) ( )  

Related Articles | Metrics

The common characteristics of various special effects were distilled for simulation of battlefield. The objectoriented technology was adopted to separate the mathematical description of physical properties and the visualized description of representation characteristics special effects. The simulation of various characteristics was controlled by the random process of program schema, and the general model was optimized by adopting viewpointbased distance, and then the class libraries with the level form was realized. As a result, the requirements of authenticity, realtime and openness were satisfied for the special effects simulation in largescale virtual battlefield environment. Finally, an example was expounded based on the expansion of the general model.

High-performance computing and system design

Techniques of Windows programs running in Linux system

2009, 29(08):  2128-2131. 

Asbtract ( )   PDF (886KB) ( )  

Related Articles | Metrics

To run Windows programs in Linux systems is a difficult technological problem that Linux is facing when struggling for desktop applications. The article introduced the current technology and developing tendency of running Windows driver programs and application programs in Linux systems. To unify Windows driver programs, Linux systems can only operate Windows network interface driver programs; to unify Windows application programs, the available techniques include code refactoring, crossplatform compiling, software virtual machine and API emulation. Since these techniques have their respective limitations, the development of Linux unified kernel to support Windows driver and application programs is necessary.

Construction of high performance computing system for fusion research using cluster technology

2009, 29(08):  2132-2135. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

High performance computing is an effective solution for bulk fusion simulation calculation. The construction of high performance computing system for fusion research using cluster technology was introduced. The basic architecture of this system was given, and then, the detailed constructing methods with high performance vs price ratio were described in terms of hardware and software. Finally, the benchmark for performance evaluation, including LinPACK and NPB, was completed on this system. The test results prove that this system has highly effective capability of parallel computing.

DMA method for NAND flash based on PXA3xx processor

2009, 29(08):  2136-2138. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

According to the characteristics of PXA3xx processor, a solution of DMA controller system architecture was put forward and the low level NAND flash Direct Memory Access (DMA) driver under Linux was realized. Test method was designed in JFFS2 file system layer for data read. Test results show that DMA could improve the performance of NAND flash read efficiently, and relieve NAND flash performance bottleneck.

Haar wavelet transform algorithm based on multicore computing platform and cacheawareness

2009, 29(08):  2139-2142. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

For the widespread use of the multicore computing platform and its powerful computing ability, through the full use of the cache as well as the principle of multithreaded programming advantage, this paper proposed a cacheaware parallel Haar wavelet algorithm on the multicore platform. By measuring the ration of cache read missing and the performance on different multicore computing platforms, it is proved that the proposed calculation method has high computation speed and is transplantable on different multicore platforms.

Embedded dualcomputer redundant system design with high reliability and heterogeneous structure

2009, 29(08):  2143-2145. 

Asbtract ( )   PDF (474KB) ( )  

Related Articles | Metrics

To realize reliable operation of embedded control system under complicated electromagnetic environment, a reconfigurable dualcomputer parallel model based on ARM and FPGA was proposed. The standby strategy was adopted to guarantee system reliability. The antielectromagnetic interference ability of the system was analyzed using Markov process model.

One method of media device control

2009, 29(08):  2146-2148. 

Asbtract ( )   PDF (620KB) ( )  

Related Articles | Metrics

The traditional principle of media device control in Windows Device Model (WDM) filter driver was researched and its unsafe and inflexible shortcomings were illustrated. The source code of highlevel spin lock in Microsoft Windows was disassembled and analyzed. The mechanism to realize the WDM architecture with NT filter driver was proposed. A new exchange technology of dispatching routines entry address of the driver object was advanced and verified.

Network and communications

RTTM: New interconnection network stucture with hierarchical twist Torus

2009, 29(08):  2149-2152. 

Asbtract ( )   PDF (706KB) ( )  

Related Articles | Metrics

Because of low utilization rate and uneven load value of rectangular Torus, this paper presented a new hierarchical twist Torus structure named Rectangular Twisted Torus Meshes (RTTM). At the lowest level of RTTM network, the level 1 subnetwork, also called a basic module, consisted of a mesh connection of 2∧m×2∧m nodes. Successively higher level networks were built by recursively interconnecting a×2a next lower level subnetworks in the form of a rectangular twisted Torus. RTTM network has smaller diameter and average distance, which implies a minimization of the network communication delays. The simulation results by OPNET, consistent with theoretical analysis, show that the network is of high utilization rate, small endtoend delay and larger capacity.

The research on opportunistic distributed space-time coding

2009, 29(08):  2153-2156. 

Asbtract ( )   PDF (584KB) ( )  

Related Articles | Metrics

Cooperative diversity can provide dramatic gains in slow fading wireless environments. In all the cooperative diversity protocols, Distributed SpaceTime Coding (DSTC) is the most representative. Due to its complexity, the practical distributed spacetime coding is still a big challenge. In this paper, the authors introduced a novel cooperative diversity protocol: Opportunistic Distributed SpaceTime Coding (ODSTC), which could achieve the performance similar to distributed spacetime coding, with lower complexity. In addition, the principle to select DSTC or ODSTC was analyzed based on the distribution of relay nodes.

Antennagrouping MIMO-OFDM system combined with subcarrier correlation

2009, 29(08):  2157-2160. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

A new detection scheme was proposed by combining the advantages of subcarrier correlation and antennagrouping based MIMOOFDM system. The OFDM subcarriers were divided into several groups and the subcarriers bound into the same group shared the same detection parameters, which were obtained at the center subcarrier of that group. This feature can significantly reduce the detection complexity. The simulation results show that compared with exhaustive detection scheme, the proposed scheme can largely reduce the complexity with very small performance loss.

WAPM: A parallel programming model in large scale Internet distributed computing environments

2009, 29(08):  2161-2166. 

Asbtract ( )   PDF (976KB) ( )  

Related Articles | Metrics

Programming models like MPI or OpenMP are not suitable for largescale Internet environments because of scalability or parallel grain issues. In this paper, a novel parallel programming model in largescale Internet environments called Wide Area Programming Model (WAPM), which provided a feasible way for parallel programming, was designed and implemented. WAPM includes three modules: communication library, communication protocol and application programming interface. WAPM is a good programming model, and is strongly supported by its general programming, adaptive parallelism and fault tolerance. An example application was also demonstrated with WAPM on a specific distributed computing platform. In order to testify the efficiency of WAPM, a serial of simulation experiments were done. The results obtained from performance analysis show that WAPM is a general and feasible approach for parallel programming.

Research on node states in P2P network

2009, 29(08):  2167-2170. 

Asbtract ( )   PDF (742KB) ( )  

Related Articles | Metrics

Analyzing nodes behaviors in a PeertoPeer (P2P) network can effectively provide different services and encourage nodes to share resources, thereby improving the system performance. Using states to represent nodes behaviors, P2P node state model was proposed to describe the process of states transition. The model was combined with nodes behaviors assessment mechanism to specify conditions of node state. Experimental results show that the model, which has good scalability and availability, can achieve service differentiation and promote resources sharing by nodes.

MAC protocol with joint spatial and time reservation and power control

2009, 29(08):  2170-2174. 

Asbtract ( )   PDF (1KB) ( )  

Related Articles | Metrics

A protocol combining spatial and time reservation with power control Medium Access Control (MAC) protocol in mobile Ad Hoc networks was presented. It could efficiently utilize the available channel resource along with the spatial as well as time dimension, and improve channel spatial reuse through avoiding collision. The proposed protocol embedded the spatial and time reservation requirements in the PHY header, and transmitted them at the lowest data rate to a larger group of neighbors, and thus avoided collisions. By decreasing the transmission power of the data packet, the energy consumption of mobile nodes was decreased. Simulation results indicate that compared to IEEE 802.11 MAC protocol, the proposed protocol can improve the throughput performance and decrease the power consumption greatly and improve the energy utilization of mobile terminals while avoiding collision.

Topology control algorithm in wireless sensor networks based on link transmit hybrid cluster

2009, 29(08):  2175-2178. 

Asbtract ( )   PDF (795KB) ( )  

Related Articles | Metrics

Research of topology control can make save energy consume efficaciously and prolong live-time in wireless sensor networks. This paper put forward one based link transmit hybrid clustering arithmetic (LTHC).On the base of the LEACH, LTHC reduce energy consume through change the way of cluster-node’s communication. When clusters have been formed, one link be created between clusters and SINK node, and link-node must be non-cluster. Cluster transmits data to SINK node through the link. The communication can economize much energy for the cluster which away from SINK node, and make energy distributing on network evenly. Through experiment, we get that LTCH more better than LEACH, and has much improvement in communication times and network live-time.

Queuing delay of backbone wireless mesh networks

2009, 29(08):  2179-2182. 

Asbtract ( )   PDF (576KB) ( )  

Related Articles | Metrics

The delay of a meshdistributed backbone Wireless Mesh Network (WMN) was investigated. A shortpath routing protocol based on traffic load balance was put forward. Considering the factors of routing protocol, network scale, the serving capability of gateways and mesh routers, the arriving rate of data packets, MMNs queuing delay was researched. In addition, the relation between queuing delay and capacity of the networks was discussed, and then the capacity based on the restriction of delay was given.

Survey of coordination mechanisms in wireless sensor and actor network

2009, 29(08):  2183-2187. 

Asbtract ( )   PDF (877KB) ( )  

Related Articles | Metrics

Coordination mechanism is a highlighted topic of Wireless Sensor and Actor Network (WSAN) in recent years. The characteristics and design requirements for network architecture of WSAN were summarized; the research challenges and principal solutions of several coordination mechanisms between the sensor and the actor for saving energy consumption or obtaining high reliability were descibed; the problems of usage domain overlapping, reliability and event ordering were analyzed. Finally, some future research problems were pointed out primarily.

Load balancing intercluster routing protocol

2009, 29(08):  2188-2190. 

Asbtract ( )   PDF (506KB) ( )  

Related Articles | Metrics

A load balancing intercluster routing (LBC) protocol in wireless sensor networks was proposed to balance cluster head load. Based on the minimum hops to sink node, multiple paths were built from cluster heads to the sink node. And the routing strategy took the residual energy and load into consideration, thus load balancing between cluster heads could be achieved. Simulation results show LBC can effectively balance the load and energy consumption of cluster heads, decrease the delay of packets, and obviously prolong the lifetime of networks.

Design of integrated system for heterogeneous network query terminal

2009, 29(08):  2191-2193. 

Asbtract ( )   PDF (486KB) ( )  

Related Articles | Metrics

This paper proposed a design scheme of integrated platform for heterogeneous network information query based on terminal simulation technology, through the use of terminal simulation technology to solve the current problems in heterogeneous network information query, such as fixed information source location, difficult integration and so on. As for the problems, an implementation scheme was designed on hardware platform to build software platform. Its detailed design of hardware and software was given. Finally a model of network information auditing was designed to monitor user records.

Handover management algorithm for satellite supporting aeronautical users

2009, 29(08):  2194-2197. 

Asbtract ( )   PDF (706KB) ( )  

Related Articles | Metrics

To solve the problem of supporting aeronautical users to access satellite network of Low Earth Orbit (LEO) seamlessly, a novel handover algorithm based on dynamic Doppler shift was proposed. After analyzing the characteristic of satellite coverage for the grounded users with low velocity, the intersatellite handover algorithm for aeronautical users covered by LEO satellites was researched indepth, concerning the high velocity movement of users and the satellite. After detailed demonstration of the principal and process of the handover, the mathematical expressions of the time and position of aeronautic users when handover happens were derived out by establishing the mathematical model. Finally, with the Teledesiclike satellite system as an example, the authors analyzed the effect of the selection of timetohandover on the performance of the system and its quality of service through the simulation, so that the validity of this algorithm was proved.

Information security

S-boxes reorganization algorithm for a class of block ciphers

2009, 29(08):  2198-2199. 

Asbtract ( )   PDF (469KB) ( )  

Related Articles | Metrics

S-boxes are the only nonlinear components in many block cipher algorithms, and they decide the security strength of the whole algorithm. Generally speaking, a big enough Sbox is secure. However, for the convenience of implementation, several small Sboxes were combined. Concerning one class of block ciphers, an Sboxes reorganized algorithm was given, which enriched Sboxes application patterns and improved the security strength.

Differential electromagnetic analysis on advanced encryption standard (AES)

2009, 29(08):  2200-2203. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

To study the vulnerability of Advanced Encryption Standard (AES) against electromagnetic side channel attacks, the article analyzed the electromagnetic information leakage model of microcomputer and the choice of D function. Then, concerning the AES128 bits cryptographic system realized by the 89C51 microchip, Differential Electromagnetic Analysis (DEMA) algorithm, which was used into an attack experiment and succeeded in obtaining 128 bits secret key of AES128, was described. After analyzing the experimental results, the leakage of secret information produced by ByteSub transformation was detected. This method can be regarded as a new protective measure in cryptographic systems.

Security analysis of certificateless proxy signature scheme

2009, 29(08):  2204-2206. 

Asbtract ( )   PDF (462KB) ( )  

Related Articles | Metrics

Certificateless cryptography eliminates the need of certificates in the Public Key Infrastructure (PKI) and solves the inherent key escrow problem. Recently, Fan Rui et al. proposed a certificateless proxy signature scheme based on a certificateless signature scheme. They claimed that their scheme satisfied the security requirements of certificateless proxy signature schemes. However, the analysis of their scheme showed that it was insecure against the two kinds of attacks in certificateless cryptosystems, i.e. public key replacement attacks and malicious Key Generating Centre (KGC) attacks. The attack methods and the defensive measures were presented.

Biometric key generation based on writing force and trajectory

2009, 29(08):  2207-2209. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

In this paper, key generation algorithm was put forward to safely transform dynamic handwritten signature to biometric key based on FTablet, which used Fourier transform to extract feature and multistate discretization algorithm to generate stable key. The authentication performance and security performance were analyzed through experiment. The key is hard to decrypt and easy to carry, cant be stolen and wont burden users with memory. And the key could be applied in identity authentication, file encryption and digital rights management and so on.

Novel image encryption algorithm based on wave transmission

2009, 29(08):  2210-2212. 

Asbtract ( )   PDF (624KB) ( )  

Related Articles | Metrics

A novel image encryption algorithm was proposed. Through simulating waves transmission, the graylevel value of the pixels in the image was changed by adding the corresponding displacement of the wave to the original graylevel value according to the distance between the pixel and the source point, then modulo 256. When encrypting an image, several waves could be performed to enhance our algorithm as a phenomenon called superposition of waves. Integrated with selfadaptive encryption, this algorithm is easy to realize and computationally simple while achieving high security, high speed, high sensitivity and other properties simultaneously. Simulation results on a typical graylevel image demonstrate the high performance.

Cluster-based group key establishment scheme in Ad Hoc network

2009, 29(08):  2213-2217. 

Asbtract ( )   PDF (775KB) ( )  

Related Articles | Metrics

Based on the characteristics of the Ad Hoc networks, this paper proposes a Cluster-Based group key establishment scheme in Ad Hoc networks. Firstly, a composite method of part agreement and part distribution is adopted to establishment the cluster key, then, a full agreement method is adopted to establishment the group key. Elliptic curve cryptography and bilinear pairing is employed in the agreement, the dishonest node can be detected and identified. Member filter technique is employed in the cluster key distribution. Moreover, In order to authenticate the messages, a signature scheme is proposed. The proposed group key establishment scheme reduces both the computational overhead and communication costs and has the high security and usability.

Multi-level threshold multisecret sharing scheme with proactive security

2009, 29(08):  2218-2219. 

Asbtract ( )   PDF (389KB) ( )  

Related Articles | Metrics

In multisecret sharing schemes, the secrets can only be shared in the same level threshold. A multilevel threshold multisecret sharing scheme based on bivariate polynomial and the intractability of the discrete logarithm was proposed. A bivariate polynomial can degenerate to different lowerorder bivariate polynomial according to different thresholds. The scheme has the following characteristics: the secrets can be shared in the multiple level threshold; the multiple secrets can be shared in the same level threshold; the scheme is proactive secure, and the shadow of every participant can be renewed periodically.

Short group signature with high efficiency under standard model

2009, 29(08):  2220-2222. 

Asbtract ( )   PDF (597KB) ( )  

Related Articles | Metrics

This paper constructed a twolevel signature scheme based on BB signature based on SDH assumption. By making certain reasonable assumptions and applying the technique of noninteractive proof system, a full anonymous dynamic short group signature scheme with the standard model was presented. The scheme was proved to satisfy the secure request of BSZ model. Compared with the latest other schemes, the scheme is more efficient and of shorter length of group signature. It allows new member to join in the group dynamically, and the group manager cannot forge any member’s signature.

Automatic intrusion scenario construction by mining hyper-alert sequences

2009, 29(08):  2223-2226. 

Asbtract ( )   PDF (661KB) ( )  

Related Articles | Metrics

Traditional Intrusion Detection System (IDS) always produces a great number of raw alerts for the same attack, due to lower abstract representation of the detection rules. Researchers use intrusion scenarios to describe complicated attack procedures at a high abstract level, while, to our best knowledge, none is able to produce the scenarios online. An automatic intrusion scenario construction method was proposed. According to the attributes of the raw alerts, the method firstly clustered them into different hyperalert sequences. After that, frequent closed sequences were mined to construct scenarios. Experimental results on Darpa99 and Darpa2000 show the method can be used to run online and effectively detect attack procedures.

Anomaly intrusion detection based on genetic optimization and fuzzy rules mining

2009, 29(08):  2227-2229. 

Asbtract ( )   PDF (633KB) ( )  

Related Articles | Metrics

A geneticfuzzy rule mining approach applied to anomaly intrusion detection was proposed, with an Agentbased evolutionary computing framework. Due to the exchanging of fuzzy sets information among the fuzzy sets Agents, accurate and interpretable fuzzy IFTHEN rules could be extracted from network traffic data for optimizing the interpretability and improving the compactivity of the fuzzy systems, by using three strategies including fuzzy sets distribution, interpretable regulation and fuzzy rules generation. All the training and testing datasets were based on the KDD CUP 99 intrusion detection benchmark data set. Compared with the current methods, the experimental results show that the proposed approach can provide higher detection accuracy and lower false alarm rate for DoS, Probe and U2R attacks with a slightly poorer performance for R2L attacks.

Secure link method for preventing URL attack and fine granularity rights management

2009, 29(08):  2230-2232. 

Asbtract ( )   PDF (459KB) ( )  

Related Articles | Metrics

For preventing URL attack, this paper proposed a secure link method, which could be used to check out the modification of URL efficiently. Then it illustrated how to generate and certify the secure link, and expanded the method to rights management in mini granularity level; at last, introduced the detail of implementation of the secure link method in a J2EE project was introduced.

Artificial intelligence

Brother judgement method —an efficient algorithm for computing the core of information table

2009, 29(08):  2230-2263. 

Asbtract ( )   PDF (542KB) ( )  

Related Articles | Metrics

At present, algorithms for computing the core based on decision table are in the overwhelming majority, and based on information table are in the tiny minority.For this reason,beginning with seeking theoretical basis, the inherent correlation between U/R and U/(R-{a}) is explained, and the conclusion that [x]R-{a}/{a} subdividing [x]R-{a} is drew,.and the equivalence relation between U/(R-{a})≠U/R and the conclusion that an U/R element has a brother is discovered.Then basing on design principle of binary tree,and using the Child-brother storage structure form , a novel algorithm for computing the core of information table is designed, and the core is computed if only generating a small binary tree. The time complexity and the space complexity of the new algorithm are O(|C|2(上标)|U|) and O(|U|) respectively .The important contribution it made is that the way to get the core is transformed into judging whether it has a brother or not during the course of generating equivalence classes. It’s effectiveness is verified by the example.

Information security

Robust image copy detection based on statistical features

2009, 29(08):  2233-2235. 

Asbtract ( )   PDF (411KB) ( )  

Related Articles | Metrics

Copy detection resistance to geometric attacks is an important issue in the image copy detection community. Currently, most of the image copy detection methods can successfully resist the noiselike distortion and are quite fragile to geometric distortion. In this paper, the authors presented an image copy detection scheme by the use of two statistical features (the histogram shape and the mean) in lowfrequency component of images after Gaussian filtering. Experimental results demonstrate that the proposed scheme can resist contentpreserving geometric deformations and image processing attacks.

New method for identifying behavior patterns of worm E-mail based on dummy E-mail address

2009, 29(08):  2236-2239. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

For the purpose of the furthest controlling Email worms propagation before the immune mechanism came into force, this paper proposed a new method for identifying worm Emails behaviors based on dummy Email address, which could be assigned dynamically. By dummy luring and behavior models matching, complementary to each other, the new method can filter most of the worm Emails, and overcome the shortcoming of the low sensitivity caused by the worms long propagation lagtime. The test results show that the propagation of Email worm is well controlled by this means.

Artificial intelligence

Particle swarm optimization with dynamic change of inertia weights

2009, 29(08):  2240-2242. 

Asbtract ( )   PDF (477KB) ( )  

Related Articles | Metrics

A novel particle swarm optimization (NPSO) with modified fitness function and dynamic change of inertia weights was proposed for solving complex highdimensional optimization problems. In this algorithm, both the function value at the searching point and the function change rate at the point were combined into fitness function. This new approach could balance the local searching and the global searching by adopting inertia weight matrix to adaptively and dynamically adjust inertia weights. The convergence degree of every dimension was calculated and the dimension of minimal convergent degree was mutated according to some probability. Experiments on five highdimension test functions indicate that NPSO can enhance the performance of global searching.

Upper bound of convergence for smooth support vector classifier

2009, 29(08):  2243-2244. 

Asbtract ( )   PDF (393KB) ( )  

Related Articles | Metrics

Lee et al.used smoothing technique to propose Smooth Support Vector Machine for classification（SSVM）. However, the problem still exists in upper bound of the convergence. The principle of SSVM model was introduced. Rough Set (RS) theory was used to prove the global convergence of SSVM, and then a formula for computing the upper bound of convergence was deduced. Therefore, the problem of upper bound of convergence was successfully solved for SSVM.

Knowledge acquisition based on improved PSO algorithm and entropy

2009, 29(08):  2245-2249. 

Asbtract ( )   PDF (714KB) ( )  

Related Articles | Metrics

Considering the problem that PSO algorithm is easy to fall into local optimum, crossover and mutation operators were introduced. The modified PSO algorithm was combined with Fuzzy CMeans (FCM) algorithm and a new fuzzy clustering algorithm (CMPSOFCM) was proposed. The searching capability and clustering effect were improved by this new algorithm. Then the membership matrix obtained by clustering algorithm was used to reduce attribute set. Finally, based on entropy, a knowledge acquisition method of fuzzy Rough Set (RS) was put forward. Experiment and example were provided to verify the effectiveness and practicability of this approach.

Classification of mobile communication customers based on decision tree and dissimilarity algorithm

2009, 29(08):  2250-2252. 

Asbtract ( )   PDF (615KB) ( )  

Related Articles | Metrics

Customer information mining for mobile communication is one of the typical applications in the field of data mining and business intelligence; therefore, it is meaningful for research and contains high value among business applications. In this paper, the dataset was classified by using decision tree algorithm at first, and then based on the results the dataset was reclassified by using dissimilarity algorithm to analyze the different attributes of the customer information. Especially, the issue of predicting whether a customer would be a highvalued customer in the future was studied. Experimental results show that the average classification accuracy of mobile communication customers is as high as 83.1%.

Constructing Chebyshev polynomial synopses with greedy strategy

2009, 29(08):  2253-2253. 

Asbtract ( )   PDF (563KB) ( )  

Related Articles | Metrics

The synopses based Chebyshev polynomials can be efficiently used to estimate frequency distribution of attributes of a given database relation. However, it is a NPhard problem to choose N coefficients most approximate to the origin frequency distribution from M (M>N)Chebyshev polynomial coefficients. Three greedy algorithms were introduced, and the best one was named GreedyB. First, 2N largest absolute value coefficients were picked out, then, redundant N coefficients were eliminated by greedy strategy. Experimental results over synthetic and real data sequences clearly show that compared with the existing algorithms, despite GreedyB has higher time complexity, it achieves higher accuracy as measured by the L1,L2 and L_inf error metrics.

Evidence combination approach based on uncertainty measure

2009, 29(08):  2257-2259. 

Asbtract ( )   PDF (458KB) ( )  

Related Articles | Metrics

Focusing on the problem that the Dempsters combination rule cannot effectively combine conflict evidences and the high computational complexity of the present solution method based on distance between evidences, a weighted average evidence combination approach was proposed. First, the computational complexity of combination rule proposed by Deng Yong, taken as an instance of combination rules based on distance between evidences, was calculated and analyzed. Then the concept of uncertainty measure of evidence was used to describe the uncertainty of evidence body and as a basis of determining the weight of evidence. The numerical example shows that the evidence combination approach based on uncertainty measure can efficiently combine evidences, whether they conflict with each other or not, with faster convergence speed as well as lower computational complexity compared with those based on the distance between the evidences.

An Approach of Chinese Event Information Fusion Based on Co-reference

2009, 29(08):  2264-2267. 

Asbtract ( )   PDF (644KB) ( )  

Related Articles | Metrics

Event extraction is an important research direction in the area of information extraction. But the information extracted from single sentence is always incomplete and implicit. The authors provided a novel algorithm based on coreference resolution and information fusion basic theory. That algorithm including three steps: event element standardization, coreference event clustering and element fusion. Through those steps we can fuse all coreference events and get a more explicit and complete event description at last. The experimental results show that the precision reaches as high as 86.9%.

Feature selection combining new document frequency with binary discernibility matrix

2009, 29(08):  2268-2271. 

Asbtract ( )   PDF (629KB) ( )  

Related Articles | Metrics

Feature selection is a core research topic in text categorization. Several classic feature selection methods were analyzed and their deficiencies were summarized. A new document frequency was proposed, and Rough Set (RS) theory was adopted to provide an attribute reduction algorithm based on binary discernibility matrix. Based on the attribute reduction algorithm and the new document frequency, a comprehensive feature selection method was given. The comprehensive method firstly used the new document frequency to select features to filter out some terms, and then employed the attribute reduction algorithm to eliminate redundancy. The experimental results on data of 8 classes, 300 documents each class from http://www.people.com.cn show that the comprehensive method has higher accuracy and recall rate compared with Mutual Information (MI), CHI value and Information Gain (IG) methods.

Multi-attributes task allocation model in MAS and VIKOR based on interval grey number

2009, 29(08):  2272-2275. 

Asbtract ( )   PDF (570KB) ( )  

Related Articles | Metrics

This paper modeled a multiattributes task allocation in MultiAgent System (MAS), proposed an extended VIKOR method and raised the principle of optimal task allocation for empirical analysis on the basis of interval grey number’s norm. The results demonstrate that this method is very effective and able to help decisionmaker make reasonable decision for multiattributes task allocation.

SOA services selection based on binary-tree coding genetic algorithm

2009, 29(08):  2276-2280. 

Asbtract ( )   PDF (685KB) ( )  

Related Articles | Metrics

A binarytreecoding genetic algorithm (BTGA) was proposed for optimizing services selection during ServiceOriented Architecture (SOA) composition. The services composition plan was transferred into an AOV graph equivalently, and then was transformed into a binary tree further. The binary tree was traversed in postorder, and then encoded. The encoding scheme was based on binarytree. Since Nonleaf nodes of the tree keep the QoS information of its subtree, its calculation load was decreased. It also can represent branch architecture, and overcome the limits of One Dimension coding Genetic Algorithm (ODGA). Simulation results show that BTGA works more efficiently than ODGA.

Tyoical applications

Fast online system identification for MIMO using LSSVM

2009, 29(08):  2281-2284. 

Asbtract ( )   PDF (699KB) ( )  

Related Articles | Metrics

To tackle the difficulty in identifying timevarying nonlinear MultiInput MultiOutput (MIMO) system online, a fast online system identification approach based on Least Squares Support Vector Machine (LSSVM) was proposed. The existing LSSVM incremental and online learning algorithms were introduced, and some speeding up implementing tactics were designed and adopted in the algorithm; consequently, a fast online LSSVM learning algorithm was obtained. MIMO system was decomposed into multiple MultiInput SingleOutput (MISO) subsystems, and each MISO was modeled online via a LSSVM. The numerical simulation shows the modeling method is faster and the obtained models provide accurate prediction.

Multiple allocation algorithm based on machine vision forelevator group control system and simulation system design

2009, 29(08):  2285-2287. 

Asbtract ( )   PDF (486KB) ( )  

Related Articles | Metrics

To increase the efficiency of elevator group system, the paper introduced a new designed simulation system based on nonstationary Poisson process and Model/View/Controller (MVC) pattern. At the same time, a new dispatch algorithm was proposed based on machine vision to inspect the hall traffic. The proposed algorithm can serve one hallcall by allocating more than one elevator. Finally simulation results show that the new method outperforms the minimum longwaiting method in terms of average waiting time and leftwaiting people.

Fractal entropy analysis of overlapped transient power quality disturbance

2009, 29(08):  2288-2290. 

Asbtract ( )   PDF (485KB) ( )  

Related Articles | Metrics

Transient power quality may cause severe loss to sensitive customers; therefore, it is very important to recognize overlapped transient power quality under general terms. Starting from graphical recognition and based on fractal theory, waveform was segmented and the entropy of waveform containing disturbance was calculated, then the most prominent disturbance was identified. By subtracting identified disturbance, other disturbances can be identified in remaining waveforms through iterated cycle of analysis. Simulation results reveal that this algorithm is very robust and adaptable, which can identify overlapped transient power quality disturbance with minor magnitude under noisy environment, and the recognition rate is very inspiring.

Trust and reputation evaluation for Web services based on user experience

2009, 29(08):  2291-2292. 

Asbtract ( )   PDF (469KB) ( )  

Related Articles | Metrics

Trust and reputation are important to Web services. Short of trust and reputation evaluation, service providers and customers may not benefit from Web services. However, evaluation often puts emphasis on QoS. Actually, the factors of influencing service trust and reputation should include QoS and degree of customer satisfaction. Based on the consideration, the paper put forward trust and reputation evaluation system, which collected user feedback and computed meeting ratio of QoS. To avoid QoS cheating, QoS should be mended by results of QoS statistics. The simulation results indicate that it can make a reasonable evaluation of trust and reputation even on the conditions of fake services disturbance and QoS distortion.

DataTurbo: Design and realization of extensible data integration engine

2009, 29(08):  2293-2298. 

Asbtract ( )   PDF (974KB) ( )  

Related Articles | Metrics

For the purpose of solving the problem of Information Island in distributed heterogeneous data sharing, the authors designed and implemented DataTurbo, a platform used to migrate, integrate and syncretize distributed data. DataTurbo was considered to be a comprehensive platform: by the advantage of scalable component design, it supports userlevel strategy description; with flexible scheduling engine, it covers commercial softwares weakness that it only supports normalized data access interface and has limited functions. The article emphasized the analysis of framework of DataTurbo, the design and implementation of the sustaining level below the function level, and description about the core of scheduling logic and the specification of function component. It has been installed and served in the data center for Panyu District of Guangzhou successfully. DataTurbo can afford a great amount of heterogeneous data exchange and synchronization and is suitable to centralize data between departments in governments and corporations.

Semantic Web service discovery framework based on WSMO-QoS

2009, 29(08):  2299-2302. 

Asbtract ( )   PDF (574KB) ( )  

Related Articles | Metrics

Currently, OWL-S and WSMO are two popular frameworks that are used to describe semantic Web Service. However, due to mainly focus on the description of the functional part, it is difficult for them to select the best services with little consideration of quality of service (QoS). To solve this problem, the WSMO specification is extended and an ontology-based meta-model of QoS called WSMO-QoS is presented. Furthermore, a QoS-based discovery framework for semantic web service is proposed, which support service discovery from three levels: basic description, IOPE and QoS. The experiment results validate the effectiveness of the framework.

Mapping from XML schema to relation mode based on pivot node

2009, 29(08):  2303-2305. 

Asbtract ( )   PDF (402KB) ( )  

Related Articles | Metrics

DTD does not support the definition of the complex elements. Based on the formal definition of XML schema, the complex elements and the functional dependence were defined in XML. A new mapping method based on pivot node was proposed; it obtained the relation tables according to the pivot node and the XML functional dependences. The constraints that were represented by the XML functional dependences, as well as the content and the structure, were preserved at the same time. Much storage redundancy can be reduced. Furthermore, the relations mapped from XML were proved in Third Normal Form (3NF)．

Universal train and text modeling for intelligent terminal armament equipments operations based on Petri nets

2009, 29(08):  2306-2308. 

Asbtract ( )   PDF (540KB) ( )  

Related Articles | Metrics

There are some shortcomings in training and testing methods for intelligent terminal armament equipments, such as some special operational environment can not reappear, and the development time of training and testing simulator is long. The paper presented a universal train and test modeling method for intelligent terminal armament equipments operations based on Petri nets. In this method, the operational tasks were modeled as Petri nets, where operational steps compose tokens set, changes from one operational step to the next step compose transforms set, and operational hot areas compose fire conditions set. To shield the differences of different equipments on operational panels and buttons, the pictures taken from the real equipments were used as the operational panels. The applications indicate that, the proposed method establishes testing tasks fast, and hides the differences in appearance, operational panel and display panel among the equipments, and it is a universal modeling method.

Application and realization of transparent white board in data conference system

2009, 29(08):  2309-2311. 

Asbtract ( )   PDF (510KB) ( )  

Related Articles | Metrics

This paper first introduced the T.120 protocol of data conference system, and proposed a multipoint application program named transparent white board based on T.120 data conference system framework. It can support distance training and drawing on video windows. The design and realization of transparent white board were described.

Design of service-oriented asynchronous messaging middleware

2009, 29(08):  2312-2314. 

Asbtract ( )   PDF (457KB) ( )  

Related Articles | Metrics

Service-Oriented Architecture (SOA) can offer open standards to integrate inter-enterprise applications, but it cannot fully support complex Internet applications characterized by asynchronous transfer and high reliability. Traditional Message-Oriented Middleware(MOM), being loosely coupled and asynchronously reliable, is suitable for enterprise integration. But it is too unscalable and inflexible to expand into large-scale network environment. This paper designed a structure of service-oriented Asynchronous Messaging Middleware (called s-AMM), which fully adopted the advantages of SOA and MOM, and analyzed some key technologies such as message transfer, service recomposition and security service. Furthermore, sAMM is proved to be feasible and effective by mobile Ecommence case.