{"title":"A Kind of Discrete Variable Structure UCAV Guidance Law Restrict by the Entering Angle","authors":"Liu Zhaoqiang, Zhou Deyun, Xu Jiadong","doi":"10.1109/IFITA.2010.336","DOIUrl":"https://doi.org/10.1109/IFITA.2010.336","url":null,"abstract":"To solve the problem that the UCAV load data link make analog signals guidance law cannot be used directly, a kind of new discrete variable structure guidance law arithmetic is brought out, which takes the restriction of entry angle into consideration, and conquers the buffeting phenomenon when the tradition discrete variable structure control arithmetic get into sliding mode. The simulation results show that the discrete signal guidance law can meet the tactical UCAV indicator.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124246732","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}
Wang Yuhui, Lei Xiaohui, Jiang Yunzhong, Song Xinshan
{"title":"Parallelization and Performance Test to Multiple Objective Particle Swarm Optimization Algorithm","authors":"Wang Yuhui, Lei Xiaohui, Jiang Yunzhong, Song Xinshan","doi":"10.1109/IFITA.2010.109","DOIUrl":"https://doi.org/10.1109/IFITA.2010.109","url":null,"abstract":"In recent years, Model calibration and parameter estimation with high complexity is a common problem in many areas of researches, especially in environmental modeling. This paper proposes a comparatively simple technique on the parallel implement of Multi-objective Particle Swarm Optimization algorithm (MOPSO). The transformation of the sequential objective evaluation in the MOPSO is based on the Matlab parallel computing tool box. Two study cases of different complexity demonstrate that the parallel implementation resulted in a considerable time saving. The deviation of computational time indicates that MOPSO has the characteristic of randomness because of the crowding distance and the dominant ranking. The proposed parallel MOPSO therefore, provides an ideal means to solve global optimization problems that are comparatively with high complexity.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"02 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116777163","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}
{"title":"Research for Batch Steganography","authors":"Chen Gou-xi, C. Junjie","doi":"10.1109/IFITA.2010.221","DOIUrl":"https://doi.org/10.1109/IFITA.2010.221","url":null,"abstract":"In this paper, we analyzed Logistic mapping chaotic sequences and technical shortcomings for single cover steganography. Improved single cover steganography schemes based on main characteristics of steganography, and brings forward with batch theoretical model of steganography, working principle, correlation of its model maximizes payload and capacity of covers. Analyses the security, and gives formal proof by the model of information theory.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121329685","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}
{"title":"A Batch Astronomical Data Sharing System","authors":"Feng Wang, H. Deng, Ling Guo, Kaifan Ji","doi":"10.1109/IFITA.2010.211","DOIUrl":"https://doi.org/10.1109/IFITA.2010.211","url":null,"abstract":"Data sharing and distribution are critically significant in international astronomical research cooperation. In this study, based on scientific workflow technique, we further presented a batch data sharing system to solve the issue of batch data retrieval and sharing. The architecture and the implementation of the sharing system are presented in detail in this paper. The system fully takes advantage of the scientific workflow technique and support many useful features such as data provenance, workflow re-run mechanism and batch data presentation. The system overcomes the drawbacks of data dissemination system. A series of advantages for scientific data process such as the user can design and upload components to customize specific query tasks are discussed. According to the results of the subjective investigation, the system prototype and its application prove that the system is more suitable for astronomers in scientific data analysis.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125133162","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}
{"title":"Empirical Analysis: The Parameter and Internal Rate Return (IRR) of Wind Power Factory in China","authors":"Shaoyu Xiong, Xiaodong Li","doi":"10.1109/IFITA.2010.102","DOIUrl":"https://doi.org/10.1109/IFITA.2010.102","url":null,"abstract":"China decides to develop wind power in 11th five-year development programming. There are some key parameters affecting the wind power industry, such as wind resource, cost of financing, wind power price, tax. The paper illustrates Cixi & Xiangshui wind power factory, calculates the real Internal Rate Return (IRR) of wind power factory in China, discusses the mechanism of wind power investing and elicits some suggestions on wind power industry development.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"23 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125688039","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}
{"title":"A Shopping Model in Ubiquitous Media Environment","authors":"Qian Chunxia, Zhu Zhenzhong, Zhang Litao","doi":"10.1109/IFITA.2010.119","DOIUrl":"https://doi.org/10.1109/IFITA.2010.119","url":null,"abstract":"Traditional shopping activity seems to leave way to electronic commerce. But there’re still lots of people who need or like the traditional situational shopping. The paper tries to provide helpful tools and methods for consumers’ shopping. With the popularity and up-coming of the ubiquitous computing technology, we hope to design a kind of ubiquitous media device. This device is designed specially for the shopping activities because it is based on shopping processes. Different shopping steps need different ubiquitous computing. The device is aimed to include every necessary functions consumer need. For before-shopping step, what and where to buy will be solved with corresponding functions. Product information and quality, price comparison and expert suggestion services could be contained in during-shopping module. The post-shopping module is designed with the payment processing, logistics suggestion and service/maintenance information management.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122342955","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}
{"title":"Network Secure Transmission Based on Authentication for C/S Mode","authors":"Zang Mingxiang, Chen Qiuzhi, J. Jianguo","doi":"10.1109/IFITA.2010.238","DOIUrl":"https://doi.org/10.1109/IFITA.2010.238","url":null,"abstract":"Currently, network built with C/S model has been widely used in E-commerce, ERP and corporate intranets. Therefore, the security of network transmission in this model has become an increasingly important issue. In view of the low security of traditional DES algorithm and slow RSA encryption speed, this paper presented an Encryption Algorithms model of data packets on the basis of analyzing the methods of existing network transmission. The algorithm model realizes a simple Authentication Center which simulates Kerberos authentication service. Through improving Kerberos protocol, strengthening the secure of the authentication process and defending the attack of replay effectively, security Transmission by Network of C/S model is realized. The result of experimentation shows that the proposed algorithm has the advantages of fast encryption (decryption) speed, high efficiency, strong safety. Furthermore; it can guarantee integrity in network transmission.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122351584","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}
{"title":"Study of the Product Oil inventory Management Model Based on VMI","authors":"Shenghua Bao, M. Zhu","doi":"10.1109/IFITA.2010.247","DOIUrl":"https://doi.org/10.1109/IFITA.2010.247","url":null,"abstract":"The traditional inventory management method can’t meet the requirement because the event of the each link based on the supply chain of product oil are synchronized under the environment of supply chain management. In this paper, the management model of product oil inventory based on the VMI system is studied, and the inventory model for partially incoming goods evenly and delay in delivery is tried to establish througu summarizing the current problem existing in the management of product oil inventory and analysing the major inventory index of product oil, at last the model is analyzed and discussed.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373475","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}
{"title":"An Improved Policy of QoS in the Heterogeneous Network","authors":"He Li","doi":"10.1109/IFITA.2010.99","DOIUrl":"https://doi.org/10.1109/IFITA.2010.99","url":null,"abstract":"The problem how to improve the quality of server(QoS) of the heterogeneous network must be studied and solved, for long round trip times (RTTs), not negligible packet error rates (PER), and downlink-uplink asymmetry, etc. Posing new challenges to the QoS given by transmission control protocol (TCP). the paper proposes a Diff-selective(diff-sel) policy, which can solve the problem by selecting different TCP edition, the optimization measurement of the QoS in a single TCP edition. The simulation results show that the new diff-sel policy is available and feasible to improve the QoS of the heterogeneous network. This paper provides a good reference for TCP research and application in the heterogeneous network.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122611934","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}
{"title":"A New Forward-Secure Proxy Signature Scheme","authors":"Junjie He, Ximei Li, L. Li, Chunming Tang","doi":"10.1109/IFITA.2010.49","DOIUrl":"https://doi.org/10.1109/IFITA.2010.49","url":null,"abstract":"Based on the shortcomings of WCF scheme, this paper proposed an improved forward-secure proxy signature scheme. The new scheme does not evolve the authorized keys, but the proxy signer's private key, making it have the forward security. Even if the proxy signer's signature key at a certain time segment is given away, the attacker could not get the proxy signer's signature key in the previous time segment. Under these assumptions of strong RSA problem, computational Diffie-Hellman problem being hard, and discrete logarithm problem being hard in a finite field, the scheme has favorable security.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114246496","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}