To solve fault forecast in missile guidance system, a new fault forecast method was presented, in which the grey system and multiple-sensor data fusion were used. Grey Model (GM) forecast is invalid when the data sequence is zero-mean random process, to overcome the drawback, present an improved GM method. The simulation results show the fault forecast method has better performance in missile guidance systems.
{"title":"Research of Real-time Forecast Technology in Fault of Missile Guidance System Based on Grey Model and Data Fusion","authors":"Xinguo Wang, Aihua Li, Xiaoping Zhou, Hualong Xu","doi":"10.1109/SNPD.2007.18","DOIUrl":"https://doi.org/10.1109/SNPD.2007.18","url":null,"abstract":"To solve fault forecast in missile guidance system, a new fault forecast method was presented, in which the grey system and multiple-sensor data fusion were used. Grey Model (GM) forecast is invalid when the data sequence is zero-mean random process, to overcome the drawback, present an improved GM method. The simulation results show the fault forecast method has better performance in missile guidance systems.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123556977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Most of the existing job scheduling algorithms for grids have ignored the security problem with a handful of exceptions. Moreover, existing algorithms using fixed- number job replications will consume excessive resources when grid security level changes dynamically. In this paper, a security aware and fault tolerant scheduling (SAFTS) algorithm based on adaptive replication is proposed which schedules the jobs by matching the user security demand and resource trust level and the number of the job replications changes adaptively with the dynamic of grid security. In experiments on RSBSME (remote sensing based soil moisture extraction) workload in a real grid environment, the average job scheduling success rate is 97%, and average grid utilization is 74%. Experiment results show that performance of SAFTS is better than non-security-aware and fixed-number job replication scheduling algorithms and SAFTS is fault-tolerant and scalable.
{"title":"Adaptive Replication Based Security Aware and Fault Tolerant Job Scheduling for Grids","authors":"Congfeng Jiang, Cheng Wang, Xiaohu Liu, Yinghui Zhao","doi":"10.1109/SNPD.2007.292","DOIUrl":"https://doi.org/10.1109/SNPD.2007.292","url":null,"abstract":"Most of the existing job scheduling algorithms for grids have ignored the security problem with a handful of exceptions. Moreover, existing algorithms using fixed- number job replications will consume excessive resources when grid security level changes dynamically. In this paper, a security aware and fault tolerant scheduling (SAFTS) algorithm based on adaptive replication is proposed which schedules the jobs by matching the user security demand and resource trust level and the number of the job replications changes adaptively with the dynamic of grid security. In experiments on RSBSME (remote sensing based soil moisture extraction) workload in a real grid environment, the average job scheduling success rate is 97%, and average grid utilization is 74%. Experiment results show that performance of SAFTS is better than non-security-aware and fixed-number job replication scheduling algorithms and SAFTS is fault-tolerant and scalable.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"21 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123584480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Quantum computation has important impacts on information security and modern cryptography. In 1994, Shor demonstrated that the problem of finding the prim factors of an integer, and the so called "discrete logarithm problem" could be solved efficiently on a quantum computer. Quantum information can also be proved to devise unconditionally secure cryptography protocols. In this paper, we introduce the most recent research progress in quantum information security and quantum coding theory and review several quantum quantum cryptography protocols that we have proposed.
{"title":"Quantum Information Security Protocols and Quantum Coding Theory","authors":"Xin Lü, Zhi Ma","doi":"10.1109/SNPD.2007.476","DOIUrl":"https://doi.org/10.1109/SNPD.2007.476","url":null,"abstract":"Quantum computation has important impacts on information security and modern cryptography. In 1994, Shor demonstrated that the problem of finding the prim factors of an integer, and the so called \"discrete logarithm problem\" could be solved efficiently on a quantum computer. Quantum information can also be proved to devise unconditionally secure cryptography protocols. In this paper, we introduce the most recent research progress in quantum information security and quantum coding theory and review several quantum quantum cryptography protocols that we have proposed.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125273181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Innovation is the impetus and source of enterprise development, and the cooperatively technical innovation is become a main innovation method. It is necessary to take measure to prevent and indemnify the loss that the risk may bring. Because of the existence of the complex non-linear function mechanism between the risk factors, so the non-linear method can be used to research the keeping way and controlling mechanism of cooperatively technical innovation. At first, this paper analyzed the seeking method of enterprise cooperatively technical innovation risk, and the steps of seeking risks are presented. And then the concept of controlling risk regulation gradient is put forward, and the method of calculating risk regulation gradient is expatiated in detail. The nerve network is suitable for recognizing and simulating nonlinear system, and the wavelet transformation or the decomposition displays the good time frequency localization characteristic and the multi-criteria function, therefore the wavelet nerve network based on the wavelet decomposition and the nerve network has the good fault-tolerant ability and the non-linearity approaching performance. And based on this, a complete controlling risk model of cooperatively technical innovation is brought forward, and the algorithm of risk control model is discussed.
{"title":"Research on Risk Control Model of Cooperatively Technical Innovation based on Wavelet and Nerve Network","authors":"Changhui Yang","doi":"10.1109/SNPD.2007.498","DOIUrl":"https://doi.org/10.1109/SNPD.2007.498","url":null,"abstract":"Innovation is the impetus and source of enterprise development, and the cooperatively technical innovation is become a main innovation method. It is necessary to take measure to prevent and indemnify the loss that the risk may bring. Because of the existence of the complex non-linear function mechanism between the risk factors, so the non-linear method can be used to research the keeping way and controlling mechanism of cooperatively technical innovation. At first, this paper analyzed the seeking method of enterprise cooperatively technical innovation risk, and the steps of seeking risks are presented. And then the concept of controlling risk regulation gradient is put forward, and the method of calculating risk regulation gradient is expatiated in detail. The nerve network is suitable for recognizing and simulating nonlinear system, and the wavelet transformation or the decomposition displays the good time frequency localization characteristic and the multi-criteria function, therefore the wavelet nerve network based on the wavelet decomposition and the nerve network has the good fault-tolerant ability and the non-linearity approaching performance. And based on this, a complete controlling risk model of cooperatively technical innovation is brought forward, and the algorithm of risk control model is discussed.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122371452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The distributed video coding (DVC) is a new coming video compression technology that utilizes a different computing complexity mode from the traditional video codec. As a new paradigm there are some fundamental and hard questions in DVC that are not sufficiently addressed, for example the complexity balance between DVC encoder and decoder. This will be an important factor for some promising real time applications. In this context, this paper studies the factors which affect the decoding complexities of turbo code based DVC, especially focuses on quantization, side information and turbo code bit rates. Analyzing and simulation results show that precise side information will decrease the turbo decoding complexity, large reductions in computations can be traded against relatively small increases in bit rate, and uniform quantizer possesses the advantage than the non-uniform quantizer in computation load at a expense of a little decrease in rate distortion performance.
{"title":"What Affects Decoding Complexity of Distributed Video Codec Based on Turbo Code","authors":"Sheng Fang, Yongquan Liang, Shenyuan Li","doi":"10.1109/SNPD.2007.139","DOIUrl":"https://doi.org/10.1109/SNPD.2007.139","url":null,"abstract":"The distributed video coding (DVC) is a new coming video compression technology that utilizes a different computing complexity mode from the traditional video codec. As a new paradigm there are some fundamental and hard questions in DVC that are not sufficiently addressed, for example the complexity balance between DVC encoder and decoder. This will be an important factor for some promising real time applications. In this context, this paper studies the factors which affect the decoding complexities of turbo code based DVC, especially focuses on quantization, side information and turbo code bit rates. Analyzing and simulation results show that precise side information will decrease the turbo decoding complexity, large reductions in computations can be traded against relatively small increases in bit rate, and uniform quantizer possesses the advantage than the non-uniform quantizer in computation load at a expense of a little decrease in rate distortion performance.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122720033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An encryption solution completed in a DTS is introduced. This solution consists of system management for cipher key and E2EE. For cipher key management, a server is used in the system. The E2EE is designed on the basis of a platform using OMAP5910 as a primary processor. Interface for information exchange is depicted in brief.
{"title":"An Encryption solution in Digital Trunking System","authors":"Wei Chongyu, Wang Chengjin, Zhou Chunlin","doi":"10.1109/SNPD.2007.149","DOIUrl":"https://doi.org/10.1109/SNPD.2007.149","url":null,"abstract":"An encryption solution completed in a DTS is introduced. This solution consists of system management for cipher key and E2EE. For cipher key management, a server is used in the system. The E2EE is designed on the basis of a platform using OMAP5910 as a primary processor. Interface for information exchange is depicted in brief.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122720161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper analyses completely the general network models and network structure patterns currently and discusses their characteristics and implementation approaches. The paper also summarizes similarities and differences of these network models and their merits and disadvantages. Based on the above research, the paper puts forward the thought of system design for test system based on network .The test system has changed from the previous concentrative mode to the distributive mode which is on the network and it should develop into the system with the qualities of openness, inter-operability, networking. The networking test nodes should possess the qualities as extensibility and communality. This paper also discusses the software design of the test system model based on the network and puts forward a kind of design plan for the structure of the networked test system that adopts the hierarchy plus the functional interface. The software design of networked test system closely encompasses the thought of modularization, generalization and standardization.
{"title":"The Research on the Construct Technology of the Test System Based on the Network","authors":"Q. Feng, Meng Chen","doi":"10.1109/SNPD.2007.423","DOIUrl":"https://doi.org/10.1109/SNPD.2007.423","url":null,"abstract":"This paper analyses completely the general network models and network structure patterns currently and discusses their characteristics and implementation approaches. The paper also summarizes similarities and differences of these network models and their merits and disadvantages. Based on the above research, the paper puts forward the thought of system design for test system based on network .The test system has changed from the previous concentrative mode to the distributive mode which is on the network and it should develop into the system with the qualities of openness, inter-operability, networking. The networking test nodes should possess the qualities as extensibility and communality. This paper also discusses the software design of the test system model based on the network and puts forward a kind of design plan for the structure of the networked test system that adopts the hierarchy plus the functional interface. The software design of networked test system closely encompasses the thought of modularization, generalization and standardization.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122173838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fuzzy Integral is compared with other two methods which are hot in studying of classifiers' fusion. The standard model of fuzzy integral and its general solution are introduced. Then, the state of the art and the challenge problems in fuzzy integral research field are discussed. The algorithms for standard and extended fuzzy integral models are briefly analyzed. Finally, the open areas of theoretic and applied research in fuzzy integral are brought forward.
{"title":"Advances of Research in Fuzzy Integral for Classifiers' fusion","authors":"Z. Kong, Zixing Cai","doi":"10.1109/SNPD.2007.422","DOIUrl":"https://doi.org/10.1109/SNPD.2007.422","url":null,"abstract":"Fuzzy Integral is compared with other two methods which are hot in studying of classifiers' fusion. The standard model of fuzzy integral and its general solution are introduced. Then, the state of the art and the challenge problems in fuzzy integral research field are discussed. The algorithms for standard and extended fuzzy integral models are briefly analyzed. Finally, the open areas of theoretic and applied research in fuzzy integral are brought forward.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128601931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Phase unwrapping algorithms play an important role in noncontact optical profilometries such as phase-measuring profilometry. The depth information of the measured object is implicitly defined by certain trigonometric equations derived from image data. The direct solutions to the equations, called the wrapped phases, have a limited range from -pi to pi. The main computational problem is to unwrap the wrapped phases over the entire image. This phase unwrapping process is often hindered by the presence of noises, spots of low intensity modulation, and instability of the solutions. We present a novel approach to the problem by formulating the phase solving and unwrapping as an ill-posed problem. By using the regularization method, we will be able to provide a unified view to address various challenges in the problem. A new fully automated algorithm for phase unwrapping based on this approach is also presented.
{"title":"Phase Unwrapping Algorithm for 3D Reconstruction","authors":"Hong Zhang, H. Su, X. Su","doi":"10.1109/SNPD.2007.283","DOIUrl":"https://doi.org/10.1109/SNPD.2007.283","url":null,"abstract":"Phase unwrapping algorithms play an important role in noncontact optical profilometries such as phase-measuring profilometry. The depth information of the measured object is implicitly defined by certain trigonometric equations derived from image data. The direct solutions to the equations, called the wrapped phases, have a limited range from -pi to pi. The main computational problem is to unwrap the wrapped phases over the entire image. This phase unwrapping process is often hindered by the presence of noises, spots of low intensity modulation, and instability of the solutions. We present a novel approach to the problem by formulating the phase solving and unwrapping as an ill-posed problem. By using the regularization method, we will be able to provide a unified view to address various challenges in the problem. A new fully automated algorithm for phase unwrapping based on this approach is also presented.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130617428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We present an efficient improvement of the strong RSA signature scheme [1], which is very similar to Fischlin sig nature [2]. Both two signatures are based on strong RSA assumption. In the original scheme, the signer has to choose a prime with prescribed length in signing phase. Except that, three generators of QRn should be chosen in the set-up phase. Our scheme removes or relaxes these restrictions. It only needs to choose two generators of QRn and an odd. Our scheme saves about 1/2 computational cost of the original scheme. Moreover, we propose a blind signature scheme and a partially blind signature scheme based on the basic scheme. To the best of our knowledge, it's the first time to propose such a blind signature scheme and a partially blind signature scheme based on strong RSA assumption.
{"title":"A Strong RSA Signature Scheme and Its Application","authors":"Zhengjun Cao, Lihua Liu","doi":"10.1109/SNPD.2007.33","DOIUrl":"https://doi.org/10.1109/SNPD.2007.33","url":null,"abstract":"We present an efficient improvement of the strong RSA signature scheme [1], which is very similar to Fischlin sig nature [2]. Both two signatures are based on strong RSA assumption. In the original scheme, the signer has to choose a prime with prescribed length in signing phase. Except that, three generators of QRn should be chosen in the set-up phase. Our scheme removes or relaxes these restrictions. It only needs to choose two generators of QRn and an odd. Our scheme saves about 1/2 computational cost of the original scheme. Moreover, we propose a blind signature scheme and a partially blind signature scheme based on the basic scheme. To the best of our knowledge, it's the first time to propose such a blind signature scheme and a partially blind signature scheme based on strong RSA assumption.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123507285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：