ISSN 
2007 Vol. 36, No. 3
2007, 36(3): 485-488.
Abstract:
Bayes filtering has a dominant place in the area of spam filtering for its strong categorization and high precision. Artificial immune system has become a new embranchment in computing intelligence for its good self-learning, self-adaptability, and robusticity. This paper analyzes the basic principle of Bayes and artificial immune systems, proposes a hybrid spam filtering algorithm based on Bayes and artificial immune system, and then designs and develops the spam filtering system based on this algorithm. It is proved that this system is effective to filter spam in English and Chinese e-mail corpus.
Bayes filtering has a dominant place in the area of spam filtering for its strong categorization and high precision. Artificial immune system has become a new embranchment in computing intelligence for its good self-learning, self-adaptability, and robusticity. This paper analyzes the basic principle of Bayes and artificial immune systems, proposes a hybrid spam filtering algorithm based on Bayes and artificial immune system, and then designs and develops the spam filtering system based on this algorithm. It is proved that this system is effective to filter spam in English and Chinese e-mail corpus.
2007, 36(3): 489-492.
Abstract:
Aiming at the deficiencies of existing scheduling analysis algorithms, we present a scheduling analysis algorithm for distributed real-time embedded systems. The algorithm uses relative firing domain to decide whether the transitions of scheduling sequence are scheduled. The relative executing time of parallel transition is recorded by introducing parallel space. The correct results of scheduling analysis can be obtained by taking space as executing time of parallel transition.
Aiming at the deficiencies of existing scheduling analysis algorithms, we present a scheduling analysis algorithm for distributed real-time embedded systems. The algorithm uses relative firing domain to decide whether the transitions of scheduling sequence are scheduled. The relative executing time of parallel transition is recorded by introducing parallel space. The correct results of scheduling analysis can be obtained by taking space as executing time of parallel transition.
2007, 36(3): 493-495,499.
Abstract:
According to the security requirement of Peer-to-Peer (P2P) technology, this paper analyzes the disadvantages of current P2P access control strategy and proposes an efficient P2P clustering model. The model security mechanism based on Rule Based Access Control (RBAC) as well as Java Authentication and Authorization Service (JAAS) are discussed, and the filter technology is also considered. Project application results show that RBAC technology is efficient for access control in P2P systems.
According to the security requirement of Peer-to-Peer (P2P) technology, this paper analyzes the disadvantages of current P2P access control strategy and proposes an efficient P2P clustering model. The model security mechanism based on Rule Based Access Control (RBAC) as well as Java Authentication and Authorization Service (JAAS) are discussed, and the filter technology is also considered. Project application results show that RBAC technology is efficient for access control in P2P systems.
2007, 36(3): 496-499.
Abstract:
By analyzing the problem of certificate revocation scheme existing in Ad Hoc network, this paper presents a new distributed certificate revocation scheme. The algorithm and the whole process of revocation are included in this scheme. By introducing four factors, the algorithm of certificate revocation becomes more perfect. The monitoring ability and enthusiasm of each node are enhanced as well. Besides, the traffic load in the process of certificate revocation is effectively reduced after requiring that each node maintain and refresh its two tables.
By analyzing the problem of certificate revocation scheme existing in Ad Hoc network, this paper presents a new distributed certificate revocation scheme. The algorithm and the whole process of revocation are included in this scheme. By introducing four factors, the algorithm of certificate revocation becomes more perfect. The monitoring ability and enthusiasm of each node are enhanced as well. Besides, the traffic load in the process of certificate revocation is effectively reduced after requiring that each node maintain and refresh its two tables.
2007, 36(3): 500-502.
Abstract:
In this paper, the Trusted Authentication Gateway System (TAGS), based on Trusted Platform Model (TPM) of Trusted Computing Group (TCG), is presented, its design and principle are introduced, and deficiencies of TAGS are analyzed. Key and certification are resident in TPM on client platform, so verifier can decide that when a secure link between client and server could be established by TAGS.
In this paper, the Trusted Authentication Gateway System (TAGS), based on Trusted Platform Model (TPM) of Trusted Computing Group (TCG), is presented, its design and principle are introduced, and deficiencies of TAGS are analyzed. Key and certification are resident in TPM on client platform, so verifier can decide that when a secure link between client and server could be established by TAGS.
2007, 36(3): 503-505,509.
Abstract:
Software testing scheme has the important influence with reliability and efficiency of software testing. Testing scheme can be selected according to the assessment of software testing quality. This paper mainly discusses the feasibility of fuzzy theory on assessing software testing quality. The concept of software testing quality indicator system and a method for assessing software testing quality, namely assessment method based on fuzzy partial ordering relation are provided. The advantages and drawbacks of this method and its application conditions are analyzed. By the calculation results of actual examples, the availability of the method is verified on the aspect of assessing software testing quality.
Software testing scheme has the important influence with reliability and efficiency of software testing. Testing scheme can be selected according to the assessment of software testing quality. This paper mainly discusses the feasibility of fuzzy theory on assessing software testing quality. The concept of software testing quality indicator system and a method for assessing software testing quality, namely assessment method based on fuzzy partial ordering relation are provided. The advantages and drawbacks of this method and its application conditions are analyzed. By the calculation results of actual examples, the availability of the method is verified on the aspect of assessing software testing quality.
2007, 36(3): 506-509.
Abstract:
The important step towards Web service implement is the discovery of services. Traditional keywords-based Web service discovery mechanism, Universal Description, Discovery, and Integration(UDDI), lacks semantic descriptions and has low searching efficiency. We study the Web service discovery based on domain ontology. The advertisement services and requested services are described by (Ontology Web Language for Services, OWL-S OWL-S to support semantic searching. A new web services discovery algorithm based on graph matching is presented. The experiments show that the proposed algorithm can achieve better results than UDDI in precision and recall.
The important step towards Web service implement is the discovery of services. Traditional keywords-based Web service discovery mechanism, Universal Description, Discovery, and Integration(UDDI), lacks semantic descriptions and has low searching efficiency. We study the Web service discovery based on domain ontology. The advertisement services and requested services are described by (Ontology Web Language for Services, OWL-S OWL-S to support semantic searching. A new web services discovery algorithm based on graph matching is presented. The experiments show that the proposed algorithm can achieve better results than UDDI in precision and recall.
2007, 36(3): 510-513.
Abstract:
Since the demand of the embedded Linux GUI system can be customized, an approach to customize and modify UI dynamically with XML is presented based on analyzing most of the embedded GUI productions. This approach provides a function to modify UI for the final user with a customizing modular, by which the data of UI design is separated from application logical modular. The information of the modification stored in the XML document will be used to display the new UI. This approach has been achieved in the embedded Linux system based on MiniGUI.
Since the demand of the embedded Linux GUI system can be customized, an approach to customize and modify UI dynamically with XML is presented based on analyzing most of the embedded GUI productions. This approach provides a function to modify UI for the final user with a customizing modular, by which the data of UI design is separated from application logical modular. The information of the modification stored in the XML document will be used to display the new UI. This approach has been achieved in the embedded Linux system based on MiniGUI.
2007, 36(3): 514-516.
Abstract:
In allusion to the complexity of transportation system, an on-board monitoring scheme on automobile driving state is put forward in this paper. The scheme attemps to monitor the abnormal state of the running automobile. The basic monitoring model of this system is developed based on component thinking. Different components can be assembled together easily and the system is convenient to implement, maintain and manage.
In allusion to the complexity of transportation system, an on-board monitoring scheme on automobile driving state is put forward in this paper. The scheme attemps to monitor the abnormal state of the running automobile. The basic monitoring model of this system is developed based on component thinking. Different components can be assembled together easily and the system is convenient to implement, maintain and manage.
2007, 36(3): 517-520.
Abstract:
A Multi-Agent Systems Model (MASM) is presented from the point of view of software architecture, in which Object-Oriented Petri Nets (OPN) are adopted as formal theory bases. The OPN are used to visualize architecture and system behaviors. Based on MASM, a practical toolbox for MAS (MASDT) is designed and developed, which can effectively and efficiently support the development of complicate applications. Finally, MASM is used to model and analyze the intelligent gas station, and the prototype is developed with the help of MASDT. This work has enriched the design and development theory for multi-agent systems.
A Multi-Agent Systems Model (MASM) is presented from the point of view of software architecture, in which Object-Oriented Petri Nets (OPN) are adopted as formal theory bases. The OPN are used to visualize architecture and system behaviors. Based on MASM, a practical toolbox for MAS (MASDT) is designed and developed, which can effectively and efficiently support the development of complicate applications. Finally, MASM is used to model and analyze the intelligent gas station, and the prototype is developed with the help of MASDT. This work has enriched the design and development theory for multi-agent systems.
2007, 36(3): 521-523.
Abstract:
The stochastic optimization algorithm is studied and the model of the power management system is presented. IN the situation of system's response-delay, Markov decision method is applied to optimize the power management plan and the best power management strategy is educed. The analysis of the comparison demonstrates that despite efficient energy reduction in some dynamic power management there is considerable negative influence on the system's performance. The stochastic optimization algorithm can get favorable equilibrium between the energy consumption and the reliability of performance in the system.
The stochastic optimization algorithm is studied and the model of the power management system is presented. IN the situation of system's response-delay, Markov decision method is applied to optimize the power management plan and the best power management strategy is educed. The analysis of the comparison demonstrates that despite efficient energy reduction in some dynamic power management there is considerable negative influence on the system's performance. The stochastic optimization algorithm can get favorable equilibrium between the energy consumption and the reliability of performance in the system.
2007, 36(3): 524-527.
Abstract:
The paper presents a kind of real-time scheduling algorithm with fault-tolerance for scheduling various tasks. the scheduling scheme of the algorithm is analyzed in detail. The performance simulation and analysis of the scheduling algorithm are given. The experiment results show that the algorithm performance is related with system load, failure probability, and computation time of tasks.
The paper presents a kind of real-time scheduling algorithm with fault-tolerance for scheduling various tasks. the scheduling scheme of the algorithm is analyzed in detail. The performance simulation and analysis of the scheduling algorithm are given. The experiment results show that the algorithm performance is related with system load, failure probability, and computation time of tasks.
2007, 36(3): 528-530,537.
Abstract:
This paper describes an approach to controlling inference disclosure of secure relation databases based on Rough Set Theory (RST). We analyze and discover all the relation between non-sensitive and sensitive data with RST. Then according to the importance of these relations and attributes, data of database queried by generic users are modified dynamically and most parsimoniously with preventing sensitive data being inferred from non-sensitive data. Experimental result shows that the approach is scalable and preserves high availability of data while improving security of inference control.
This paper describes an approach to controlling inference disclosure of secure relation databases based on Rough Set Theory (RST). We analyze and discover all the relation between non-sensitive and sensitive data with RST. Then according to the importance of these relations and attributes, data of database queried by generic users are modified dynamically and most parsimoniously with preventing sensitive data being inferred from non-sensitive data. Experimental result shows that the approach is scalable and preserves high availability of data while improving security of inference control.
2007, 36(3): 531-533,537.
Abstract:
In this paper,the security reforming problems of OO language are discussed,the principles multi-information flow security control principles are presented based on extended military security model.JAVA is transformed into a security program language (sJAVA) depending upon the EMSM.the security execution conditions of main executable sentences in sJAVA are discussed.A validation by an example of sJAVA program is given.
In this paper,the security reforming problems of OO language are discussed,the principles multi-information flow security control principles are presented based on extended military security model.JAVA is transformed into a security program language (sJAVA) depending upon the EMSM.the security execution conditions of main executable sentences in sJAVA are discussed.A validation by an example of sJAVA program is given.
2007, 36(3): 534-537.
Abstract:
To deal with the threat of key exposure, an identity-based encryption scheme with non-interactive key update is proposed. The non-interactive property is obtained by forward-security (a typical key evolving paradigm). First the definition and security definition of Identity-Based Encryption with Non-Interactive Key Update scheme (IBE-NIKU) are given. Then identity-based binary tree encryption scheme is constructed. As a result, a concrete IBE-NIKU is given. The security and efficiency of these schemes are also analyzed.
To deal with the threat of key exposure, an identity-based encryption scheme with non-interactive key update is proposed. The non-interactive property is obtained by forward-security (a typical key evolving paradigm). First the definition and security definition of Identity-Based Encryption with Non-Interactive Key Update scheme (IBE-NIKU) are given. Then identity-based binary tree encryption scheme is constructed. As a result, a concrete IBE-NIKU is given. The security and efficiency of these schemes are also analyzed.
2007, 36(3): 538-540,558.
Abstract:
In this paper a secure two-party bargaining protocol is proposed which is based on Pallier homomorphic public key cryptosystem. The participant can make a bargain with another one by implementing the protocol. During the protocol, the privacy of input and the correctness of output should be preserved. The third party will participate in working out the final price only under the condition of success agreement. Through the analysis of complexity and security, this protocol holds higher implementing efficiency and security characters, and therefore has application value in the e-commerce.
In this paper a secure two-party bargaining protocol is proposed which is based on Pallier homomorphic public key cryptosystem. The participant can make a bargain with another one by implementing the protocol. During the protocol, the privacy of input and the correctness of output should be preserved. The third party will participate in working out the final price only under the condition of success agreement. Through the analysis of complexity and security, this protocol holds higher implementing efficiency and security characters, and therefore has application value in the e-commerce.
2007, 36(3): 541-544.
Abstract:
This paper proposes an Integrated Control Algorithm (ICA) for the Distributed Real-Time Embedded Systems (DRES) that employs the end-to-end aperiodic task model. ICA features a distributed feedback loop that relates the per-task metric to the aggregate metric. It is able to dynamically determine the QoS (Quality of Service) of incoming tasks and guarantee the end-to-end deadlines of accepted tasks, at the same time enforce the desired utilization bound on multiple processors. Finally, experiments demonstrate that ICA is capable of providing better performance guarantees for DRES that employs the end-to-end aperiodic task model.
This paper proposes an Integrated Control Algorithm (ICA) for the Distributed Real-Time Embedded Systems (DRES) that employs the end-to-end aperiodic task model. ICA features a distributed feedback loop that relates the per-task metric to the aggregate metric. It is able to dynamically determine the QoS (Quality of Service) of incoming tasks and guarantee the end-to-end deadlines of accepted tasks, at the same time enforce the desired utilization bound on multiple processors. Finally, experiments demonstrate that ICA is capable of providing better performance guarantees for DRES that employs the end-to-end aperiodic task model.
2007, 36(3): 545-547.
Abstract:
Real-time tasks scheduling is key problem in real-time system, real-time dynamic scheduling is main aspect of real-time scheduling. When real-time scheduling is used in practical system it may just use limited number of priority level. When real-time scheduling theory carry out theoretic analysis, all of them assume that there are unlimited number of priority level. The paper present the algorithm of dynamic real-time scheduling in the condition of limited priority level, and presents the minimum number of priority level that the tasks system schedules dynamically. Finally, the algorithm complexity is analyzed.
Real-time tasks scheduling is key problem in real-time system, real-time dynamic scheduling is main aspect of real-time scheduling. When real-time scheduling is used in practical system it may just use limited number of priority level. When real-time scheduling theory carry out theoretic analysis, all of them assume that there are unlimited number of priority level. The paper present the algorithm of dynamic real-time scheduling in the condition of limited priority level, and presents the minimum number of priority level that the tasks system schedules dynamically. Finally, the algorithm complexity is analyzed.
2007, 36(3): 548-550.
Abstract:
In this paper we research the aperiodic soft real-time system in which the arrival time and the execution time of tasks are uncertain.According to the queuing theory,a aperiodic soft real-time system is a typical stochastic discrete event dynamic system and is usually considered as an M/M/1/H mixed queuing system.After a discussion of three performance metrics including rejection ratio,deadline miss ratio,and average deadline excess amount,we propose a design method for optimal buffer capacity based on these metrics.Lastly,the performance analysis shows that our method can improve the system's performance.
In this paper we research the aperiodic soft real-time system in which the arrival time and the execution time of tasks are uncertain.According to the queuing theory,a aperiodic soft real-time system is a typical stochastic discrete event dynamic system and is usually considered as an M/M/1/H mixed queuing system.After a discussion of three performance metrics including rejection ratio,deadline miss ratio,and average deadline excess amount,we propose a design method for optimal buffer capacity based on these metrics.Lastly,the performance analysis shows that our method can improve the system's performance.
2007, 36(3): 551-554.
Abstract:
Energy is the main constraint of embedded system design. In this paper, the General Stochastic Petri Net (GSPN) is used to describe the processes of electrochemical polarization and active substances diffusion in Li-ion batteries. A abstract high-level non-real battery model is presented which accurately characterized the rate-dependent and recovery feature of Li-ion batteries. The model simply adopts four easy-obtained parameters. Constant current discharge and pulse discharge experiment demonstrate that the lifetime of chemical battery could be fast and accurately estimated with this battery model.
Energy is the main constraint of embedded system design. In this paper, the General Stochastic Petri Net (GSPN) is used to describe the processes of electrochemical polarization and active substances diffusion in Li-ion batteries. A abstract high-level non-real battery model is presented which accurately characterized the rate-dependent and recovery feature of Li-ion batteries. The model simply adopts four easy-obtained parameters. Constant current discharge and pulse discharge experiment demonstrate that the lifetime of chemical battery could be fast and accurately estimated with this battery model.
2007, 36(3): 555-558.
Abstract:
In order to improve the runtime efficiency of dynamic storage management for embedded system and to bound the time spending, a method of recombination-delay is presented based on the classic buddy system, fragmentation collection, and bitmap mechanism. Simulation experiments show that this new mechanism has better runtime efficiency.
In order to improve the runtime efficiency of dynamic storage management for embedded system and to bound the time spending, a method of recombination-delay is presented based on the classic buddy system, fragmentation collection, and bitmap mechanism. Simulation experiments show that this new mechanism has better runtime efficiency.
2007, 36(3): 559-562.
Abstract:
The customization of embedded system as well as its resources constraint requires that the embedded operating system must be configurable. The design of reusable modularized software is the base of operating system tailoring and configuration. Based on abstract relation among different components, this paper proposes an uniform customizable procedure model in order to reduce the difficulty of configuration. With the help of this model, a configure-tailor on embedded Linux is realized.
The customization of embedded system as well as its resources constraint requires that the embedded operating system must be configurable. The design of reusable modularized software is the base of operating system tailoring and configuration. Based on abstract relation among different components, this paper proposes an uniform customizable procedure model in order to reduce the difficulty of configuration. With the help of this model, a configure-tailor on embedded Linux is realized.
2007, 36(3): 563-565,572.
Abstract:
Based on bit-decomposition technique and multiresolution-decomposition technique,a digital image watermarking algorithm is proposed in this paper. By multiresolution-decomposition technique, the decomposed watermarks of different resolution are embedded into the corresponding resolution of the decomposed original image, which makes the watermark be adapted to the original image. The chaotic Arnold map is utilized to generate the watermarking-embedding-position in order to enhance the security of watermarking. The watermarking can be extracted without the original image because the embedding procedure is based on the quantized method. Experimental results show that the proposed algorithm is robust to some image processing operations.
Based on bit-decomposition technique and multiresolution-decomposition technique,a digital image watermarking algorithm is proposed in this paper. By multiresolution-decomposition technique, the decomposed watermarks of different resolution are embedded into the corresponding resolution of the decomposed original image, which makes the watermark be adapted to the original image. The chaotic Arnold map is utilized to generate the watermarking-embedding-position in order to enhance the security of watermarking. The watermarking can be extracted without the original image because the embedding procedure is based on the quantized method. Experimental results show that the proposed algorithm is robust to some image processing operations.
2007, 36(3): 566-568.
Abstract:
The correlation coefficient is researched in digital watermark algorithm.The relaticon between the correlation coefficient and the bit error rates of watermark detection is found.The detection threshold and wrong probability can be calculated out directly by the relation.Furthermore,a method to calculate detection coefficient is proposed.This method can increase the threshold of detection while keeping the probability of the false detection not to change and can enable the detection to strengthen the responses of the correct watermark data.
The correlation coefficient is researched in digital watermark algorithm.The relaticon between the correlation coefficient and the bit error rates of watermark detection is found.The detection threshold and wrong probability can be calculated out directly by the relation.Furthermore,a method to calculate detection coefficient is proposed.This method can increase the threshold of detection while keeping the probability of the false detection not to change and can enable the detection to strengthen the responses of the correct watermark data.
2007, 36(3): 569-572.
Abstract:
The technique of realistic three-dimensional human facial animation is an important research direction in computer graphics. How to simulate the motions of human faces on 3D facial models in real-time to generate realistic facial expressions is still a challenge problem. Based on the theory of facial animation in MPEG-4, a new method for realizing 3-D facial animation is proposed in this paper. This method is proper for any topological face model. With the drive of Facial Animation Parameter (FAP) frame, the proposed method can realize realistic facial animation.
The technique of realistic three-dimensional human facial animation is an important research direction in computer graphics. How to simulate the motions of human faces on 3D facial models in real-time to generate realistic facial expressions is still a challenge problem. Based on the theory of facial animation in MPEG-4, a new method for realizing 3-D facial animation is proposed in this paper. This method is proper for any topological face model. With the drive of Facial Animation Parameter (FAP) frame, the proposed method can realize realistic facial animation.
2007, 36(3): 573-575,586.
Abstract:
Free Form Deformations (FFDs) have been extensively applied in computer animation and geometric modeling. FFD is an important branch of deformation methods which independent of object representation. Dirichlet Free-Form Deformation (DFFD) belongs to one of the FFDs. Comparing with other FFDs, it gives deformation more flexibility and has the ability to place control points arbitrarily. DFFD has been extensively applied in two-dimensional space, but seldom in three-dimensional space. This paper studies the application of DFFD in three-dimensional space. Good deformation results have been obtained by applying DFFD to 3D head-deformation.
Free Form Deformations (FFDs) have been extensively applied in computer animation and geometric modeling. FFD is an important branch of deformation methods which independent of object representation. Dirichlet Free-Form Deformation (DFFD) belongs to one of the FFDs. Comparing with other FFDs, it gives deformation more flexibility and has the ability to place control points arbitrarily. DFFD has been extensively applied in two-dimensional space, but seldom in three-dimensional space. This paper studies the application of DFFD in three-dimensional space. Good deformation results have been obtained by applying DFFD to 3D head-deformation.
2007, 36(3): 576-578,586.
Abstract:
A new method of volume rendering based on texture mapping is presented. The technique significantly improves both performance and image quality of the 3D reconstruction. The method realizes 3D reconstruction for 2D medical images sequence. On commodity PC, can be obtained by the proposed method, high image quality at a rate near realtime. For visual artifacts in texture mapping, two improved methods are presented. Considering the processes of making texture and resampling, the method of interactive incise for 3D image is realized
A new method of volume rendering based on texture mapping is presented. The technique significantly improves both performance and image quality of the 3D reconstruction. The method realizes 3D reconstruction for 2D medical images sequence. On commodity PC, can be obtained by the proposed method, high image quality at a rate near realtime. For visual artifacts in texture mapping, two improved methods are presented. Considering the processes of making texture and resampling, the method of interactive incise for 3D image is realized
2007, 36(3): 579-582.
Abstract:
Some common characters in the video information leaked by a computers system are the texture characteristics which are composed of moving black areas of a reconstructed image from the leaked video information. The texture characteristics are quite different with the varying of synchronal frequency. The moving speed of the texture increases when the synchronal error becomes larger. And the moving direction is decided by the sign of the error. According to these features, a similar Harr Wavelet method is used to extract the synchronal characters in the video information leaked by a computer system. Based on these synchronal characters, the angles tilted by the synchronal error are used to adjust the frequency of the synchronal pulses until the synchronal accuracy is enough for steady display.
Some common characters in the video information leaked by a computers system are the texture characteristics which are composed of moving black areas of a reconstructed image from the leaked video information. The texture characteristics are quite different with the varying of synchronal frequency. The moving speed of the texture increases when the synchronal error becomes larger. And the moving direction is decided by the sign of the error. According to these features, a similar Harr Wavelet method is used to extract the synchronal characters in the video information leaked by a computer system. Based on these synchronal characters, the angles tilted by the synchronal error are used to adjust the frequency of the synchronal pulses until the synchronal accuracy is enough for steady display.
2007, 36(3): 583-586.
Abstract:
In order to improve the performance of iris recognition, a novel iris recognition method is presented. In this method the independent component analysis is used to obtain iris high order statistic information and mapped the input mode space into the corresponding independent component space. Then the maximal hyperplane is constructed in the independent component space using the generalization of the support vector machine. Numerical simulation based on the CASIA iris database shows that the proposed method can reduce the dimension of the feature space and has higher correct classification rate. Especially, though using Gauss kernel, the rate of correct recognition reaches 98.61% which is increased 6.48% and 4.54% respectively comparing with dissimilarity functions and the nearest feature line method, while improving robustness and flexibility of iris recognition.
In order to improve the performance of iris recognition, a novel iris recognition method is presented. In this method the independent component analysis is used to obtain iris high order statistic information and mapped the input mode space into the corresponding independent component space. Then the maximal hyperplane is constructed in the independent component space using the generalization of the support vector machine. Numerical simulation based on the CASIA iris database shows that the proposed method can reduce the dimension of the feature space and has higher correct classification rate. Especially, though using Gauss kernel, the rate of correct recognition reaches 98.61% which is increased 6.48% and 4.54% respectively comparing with dissimilarity functions and the nearest feature line method, while improving robustness and flexibility of iris recognition.
2007, 36(3): 587-589,593.
Abstract:
A kernel function based Bayesian parameter estimation approach is proposed in this paper which is able to make the algorithm more applicable. Combined with the both sides of email content and format, a Bayesian network for spam classification is well constructed. The testing results by on-line learning for different email testing sets prove that the new model can ensure the classification and filtering efficiently by applying the kernel function based Bayesian parameter estimation approach into the classification network.
A kernel function based Bayesian parameter estimation approach is proposed in this paper which is able to make the algorithm more applicable. Combined with the both sides of email content and format, a Bayesian network for spam classification is well constructed. The testing results by on-line learning for different email testing sets prove that the new model can ensure the classification and filtering efficiently by applying the kernel function based Bayesian parameter estimation approach into the classification network.
2007, 36(3): 590-593.
Abstract:
In this paper,some existing models about the propagation of worms are briefly introduced,and then a concrete analysis about the effect of Network Address Translator (NAT) on worm propagation is given.To overcome the weakness of traditional models in describing the propagation of worms,a two-phase worm propagation model based on analytical active worm propagation model is proposed.Comparison between the predicted result made by this model and the real propagation data of Red Code v2 measured by CAIDA in 2001 shows that the improved model gives a better description of worm's propagation.
In this paper,some existing models about the propagation of worms are briefly introduced,and then a concrete analysis about the effect of Network Address Translator (NAT) on worm propagation is given.To overcome the weakness of traditional models in describing the propagation of worms,a two-phase worm propagation model based on analytical active worm propagation model is proposed.Comparison between the predicted result made by this model and the real propagation data of Red Code v2 measured by CAIDA in 2001 shows that the improved model gives a better description of worm's propagation.
2007, 36(3): 594-597.
Abstract:
This paper proposes an innovative 0-1 partitioning algorithm (named 0-1 algorithm) over IP cores which can efficiently partition an expected system into hardware or software parts. The correctness of the 0-1 algorithm is verified. It is illustrated that the result of optimization using the algorithm is better than using genetic algorithm, with similar convergence speed. In addition, this algorithm has the advantage that its convergence is quicker than the Integer Linear Programming (ILP) approach.
This paper proposes an innovative 0-1 partitioning algorithm (named 0-1 algorithm) over IP cores which can efficiently partition an expected system into hardware or software parts. The correctness of the 0-1 algorithm is verified. It is illustrated that the result of optimization using the algorithm is better than using genetic algorithm, with similar convergence speed. In addition, this algorithm has the advantage that its convergence is quicker than the Integer Linear Programming (ILP) approach.
2007, 36(3): 598-600.
Abstract:
According to the total coast of airlines and passengers, we define the cost unit as a function of the departure time of a aircraft in the multi-airport ground-holding model. This definition will reflect the GDP's cost degree more availably and emphasize the delay time's accumulative effect on all costs. By adjusting the value of parameters to suit the percentage of the cost factors, this modulus can apply to different kinds of applications.
According to the total coast of airlines and passengers, we define the cost unit as a function of the departure time of a aircraft in the multi-airport ground-holding model. This definition will reflect the GDP's cost degree more availably and emphasize the delay time's accumulative effect on all costs. By adjusting the value of parameters to suit the percentage of the cost factors, this modulus can apply to different kinds of applications.
2007, 36(3): 601-603.
Abstract:
For the advantages of security and computation, elliptic curve cryptography is widely used in smart cards. Width-w NAF method with small space and high speed, is favored by elliptic curve cryptography. The present of power analysis attacks give us a new way to examine the security of smart-card. This paper presents an improved algorithm based on width-w NAF method to resistant power analysis attacks, including simple power analysis attacks, differential power analysis attacks, refined power analysis attacks and zero-value point attacks, without increase any computation of main loop.
For the advantages of security and computation, elliptic curve cryptography is widely used in smart cards. Width-w NAF method with small space and high speed, is favored by elliptic curve cryptography. The present of power analysis attacks give us a new way to examine the security of smart-card. This paper presents an improved algorithm based on width-w NAF method to resistant power analysis attacks, including simple power analysis attacks, differential power analysis attacks, refined power analysis attacks and zero-value point attacks, without increase any computation of main loop.
2007, 36(3): 604-607.
Abstract:
To study and develop the confrontation capability of computer network is necessary to gain information superiority and network domination.Network confrontation training simulation system helps cultivate confrontation persons with ability and increase confrontation standards.This paper presents a network confrontation training simulation system,and discusses the related subsystems including interactive confrontation training simulation system,support software system,evaluation system,and information data base.The system can provide a favorable environment for confrontation theory research and confrontation training.It is of great significance and benefits in practice.
To study and develop the confrontation capability of computer network is necessary to gain information superiority and network domination.Network confrontation training simulation system helps cultivate confrontation persons with ability and increase confrontation standards.This paper presents a network confrontation training simulation system,and discusses the related subsystems including interactive confrontation training simulation system,support software system,evaluation system,and information data base.The system can provide a favorable environment for confrontation theory research and confrontation training.It is of great significance and benefits in practice.
2007, 36(3): 608-610,624.
Abstract:
The problem of interconnecting and communicating between IPv4 network and IPv6 network in need to be solved while transiting from IPv4 to IPv6. To connect IPv4 islands through IPv6 network, an IPv4 over IPv6 tunnel solution based on User Datagram Protocol (UDP) called BoIP is proposed. BoIP uses high bandwidth of IPv6 and runs simply and low-costly. Working processes and implementation are described. Experiment results on the test-bed show that BoIP can transparently connect two IPv4 networks through IPv6 network.
The problem of interconnecting and communicating between IPv4 network and IPv6 network in need to be solved while transiting from IPv4 to IPv6. To connect IPv4 islands through IPv6 network, an IPv4 over IPv6 tunnel solution based on User Datagram Protocol (UDP) called BoIP is proposed. BoIP uses high bandwidth of IPv6 and runs simply and low-costly. Working processes and implementation are described. Experiment results on the test-bed show that BoIP can transparently connect two IPv4 networks through IPv6 network.
2007, 36(3): 611-613,631.
Abstract:
Based on the in-depth research of the property of crosstalk fault, we presented a more efficiency Half Transition (HT) model to detecting signal integrity fault in System-on-Chip (SoC) interconnects between IP cores. In comparison with Maximal Aggressor Fault (MAF) model and Multiple Transition (MT) model, this HT model can achieve 100% faults coverage and need less test pattern. The result of theoretic analyses shows the HT model's excellence in comparison with MAF model in fault coverage and with to MT model in test pattern's efficiency.
Based on the in-depth research of the property of crosstalk fault, we presented a more efficiency Half Transition (HT) model to detecting signal integrity fault in System-on-Chip (SoC) interconnects between IP cores. In comparison with Maximal Aggressor Fault (MAF) model and Multiple Transition (MT) model, this HT model can achieve 100% faults coverage and need less test pattern. The result of theoretic analyses shows the HT model's excellence in comparison with MAF model in fault coverage and with to MT model in test pattern's efficiency.
2007, 36(3): 614-616,655.
Abstract:
Traffic control based on IP network is normally used to realize congestion control through avoiding conditions of congestion. This paper discusses primary methods of congestion control in existence. The analysis and comparison of these methods when they are used to defend attacks from the distributed denial of serve(DDoS). The results show that these methods could be used to control DDoS attacks after improved.
Traffic control based on IP network is normally used to realize congestion control through avoiding conditions of congestion. This paper discusses primary methods of congestion control in existence. The analysis and comparison of these methods when they are used to defend attacks from the distributed denial of serve(DDoS). The results show that these methods could be used to control DDoS attacks after improved.
2007, 36(3): 617-620.
Abstract:
Protocols oracle model is an open model,which provides a unified framework to describe the intruder's attack ability precisely.Therefore,This article presents a protocols oracle model which makes a formalized description of the intruder's attack ability on the protocols.This model can also follow the tracks of the intruder's attack on the protocols through the protocols spanning tree.
Protocols oracle model is an open model,which provides a unified framework to describe the intruder's attack ability precisely.Therefore,This article presents a protocols oracle model which makes a formalized description of the intruder's attack ability on the protocols.This model can also follow the tracks of the intruder's attack on the protocols through the protocols spanning tree.
2007, 36(3): 621-624.
Abstract:
Based on the research on the current developing trends of malicious programs, comparing systematically the various technologies and methodologies with respect to the hiding and detection of registry. analyzing comprehensively their deficiencies existing, we provide a brand-new hiding and detection method based on hive files of registry, which makes the detection especially on malicious programs more integrated and reliable. The experiment indicates that this method can detect all the current malicious programs which hide registry.
Based on the research on the current developing trends of malicious programs, comparing systematically the various technologies and methodologies with respect to the hiding and detection of registry. analyzing comprehensively their deficiencies existing, we provide a brand-new hiding and detection method based on hive files of registry, which makes the detection especially on malicious programs more integrated and reliable. The experiment indicates that this method can detect all the current malicious programs which hide registry.
2007, 36(3): 625-627,635.
Abstract:
The paper analyses the bluetooth network's performance of data transmission in various BER model and presents a new kind of bluetooth network adaptive data transmission algorithm, based on BER model of physical link layer. According to the data transmission experiments based on the bluetooth network ACL packet in difference BER model, it is proved that the algorithm improves the efficiency of bluetooth network data transmission.
The paper analyses the bluetooth network's performance of data transmission in various BER model and presents a new kind of bluetooth network adaptive data transmission algorithm, based on BER model of physical link layer. According to the data transmission experiments based on the bluetooth network ACL packet in difference BER model, it is proved that the algorithm improves the efficiency of bluetooth network data transmission.
2007, 36(3): 628-631.
Abstract:
To solve the problems of low adaptability for mutative external environment existed in the theory of fuzzy sets and the disadvantage of failing to obtain eventual relationship among the fuzzy sets existed in the model of neural networks, this paper proposes a multi-level discrete fuzzy neural networks model which has the "if-then" rule of fuzzy inference system. The essential stability conditon of the model is analyzed.The model uses Hard C-Means (HCM) clustering to obtain fuzzy neural networks' eventual relationship among the fuzzy sets and applies evolutionary algorithm to optimize the model. The simulation results show the effectiveness of the proposed model.
To solve the problems of low adaptability for mutative external environment existed in the theory of fuzzy sets and the disadvantage of failing to obtain eventual relationship among the fuzzy sets existed in the model of neural networks, this paper proposes a multi-level discrete fuzzy neural networks model which has the "if-then" rule of fuzzy inference system. The essential stability conditon of the model is analyzed.The model uses Hard C-Means (HCM) clustering to obtain fuzzy neural networks' eventual relationship among the fuzzy sets and applies evolutionary algorithm to optimize the model. The simulation results show the effectiveness of the proposed model.
2007, 36(3): 632-635.
Abstract:
Time-triggered mechanisms improve the ability of Controller Area Network (CAN) bus to deal with the time-critical periodic messages. However, the non-periodic messages have the burst and unpredictable characteristics with complex types. Therefore, it's difficult to analyze their transfer performance. To resolve this problem, a multi-nodes model of time-triggered CAN system is proposed, which is based on deterministic and stochastic Petri net. Through the simulation of the non-periodic messages in asynchronous part, relative performances including the throughput, the average packet delay and the quantitative laws are obtained. These performance are very useful to the analysis and design of the time-triggered CAN systems.
Time-triggered mechanisms improve the ability of Controller Area Network (CAN) bus to deal with the time-critical periodic messages. However, the non-periodic messages have the burst and unpredictable characteristics with complex types. Therefore, it's difficult to analyze their transfer performance. To resolve this problem, a multi-nodes model of time-triggered CAN system is proposed, which is based on deterministic and stochastic Petri net. Through the simulation of the non-periodic messages in asynchronous part, relative performances including the throughput, the average packet delay and the quantitative laws are obtained. These performance are very useful to the analysis and design of the time-triggered CAN systems.
2007, 36(3): 636-639.
Abstract:
This paper deduces a unique word detection method by using the characteristic of signal detection based on minimum description length criterion after introducing the test statistic, and setting the best decision threshold. Comparing with the usual unique word detection technique, this method treats directly with the modulated data with the frequency offset. Analysis and simulation demonstrate the effect of the algorithm.
This paper deduces a unique word detection method by using the characteristic of signal detection based on minimum description length criterion after introducing the test statistic, and setting the best decision threshold. Comparing with the usual unique word detection technique, this method treats directly with the modulated data with the frequency offset. Analysis and simulation demonstrate the effect of the algorithm.
2007, 36(3): 640-641,645.
Abstract:
This paper proposes an algorithm for Fetal Electrocardiogram (FECG) extraction, which is based on joint maximization of kurtosis and autocorrelation. It fully exploits the FECG's special temporal property and its independence on other sources (such as some noise, the maternal electrocardiogram); therefore it is able to extract clearer FECGs, compared with existing algorithms. Extensive experiments show that the proposed algorithm can rapidly and efficiently extract FECGs and greatly reduce lots of noise.
This paper proposes an algorithm for Fetal Electrocardiogram (FECG) extraction, which is based on joint maximization of kurtosis and autocorrelation. It fully exploits the FECG's special temporal property and its independence on other sources (such as some noise, the maternal electrocardiogram); therefore it is able to extract clearer FECGs, compared with existing algorithms. Extensive experiments show that the proposed algorithm can rapidly and efficiently extract FECGs and greatly reduce lots of noise.
2007, 36(3): 642-645.
Abstract:
Some End-to-end congestion control algorithms are researched and inproved. Incorporating with network layer congestion control algorithms, this paper presents a mixed algorithm for network congestion control named TCP-M, which unites the algorithms of network layer and transmit layer into one. After the simulation by NS2 software, it is verified that TCP-M is more effective than single congestion control algorithms.
Some End-to-end congestion control algorithms are researched and inproved. Incorporating with network layer congestion control algorithms, this paper presents a mixed algorithm for network congestion control named TCP-M, which unites the algorithms of network layer and transmit layer into one. After the simulation by NS2 software, it is verified that TCP-M is more effective than single congestion control algorithms.
2007, 36(3): 646-648.
Abstract:
A spliting files transmission system based on Message Queue (MQ) is integrated with the technologies of middleware, zlib, and symmetric key cryptography. Such a system can achive secure file exchange in heterogeneous environment. This paper introduces the major components of the system, The sending and receiving subsystems are discussed in detail. The spliting and recovering, encryption, and decryption of the algorithm are invesgated.
A spliting files transmission system based on Message Queue (MQ) is integrated with the technologies of middleware, zlib, and symmetric key cryptography. Such a system can achive secure file exchange in heterogeneous environment. This paper introduces the major components of the system, The sending and receiving subsystems are discussed in detail. The spliting and recovering, encryption, and decryption of the algorithm are invesgated.
2007, 36(3): 649-651.
Abstract:
A key delay design on block cipher is proposed and is demonstrated based on provable security with information theory. Furthermore, we evaluate the result of key delay module. For the published block cipher, the key delay technology can enforce the cryptography system and decrease the information leak from key distribution through internet. Especially, this model can prevent the only cipher-text attack by middle attack.
A key delay design on block cipher is proposed and is demonstrated based on provable security with information theory. Furthermore, we evaluate the result of key delay module. For the published block cipher, the key delay technology can enforce the cryptography system and decrease the information leak from key distribution through internet. Especially, this model can prevent the only cipher-text attack by middle attack.
2007, 36(3): 652-655.
Abstract:
This paper presents a scheme for evaluating software quality using fuzzy sets theory. The objective of the work is make the evaluation of software quality more scientific and reasonable than traditional methods. The fundament based on fuzzy sets theory for resolving fuzzy characters in realistic world is presented. The design of multi-factorial evaluation model for software quality is also provided. An example is given to demonstrate how to evaluate software quality.
This paper presents a scheme for evaluating software quality using fuzzy sets theory. The objective of the work is make the evaluation of software quality more scientific and reasonable than traditional methods. The fundament based on fuzzy sets theory for resolving fuzzy characters in realistic world is presented. The design of multi-factorial evaluation model for software quality is also provided. An example is given to demonstrate how to evaluate software quality.
