{"title":"Configuration Design and Sizing Optimization of a Winged Airship","authors":"W. Haifeng, Song Bifeng, Z. Xiaoping","doi":"10.1109/NCIS.2011.107","DOIUrl":"https://doi.org/10.1109/NCIS.2011.107","url":null,"abstract":"This paper aims to develop a near space aerial vehicle, which combines aerodynamic lift and buoyancy with buoyancy force and operates at day and night energy saving mode. The configuration is designed and optimized by a Non-dominated Sorted Genetic Algorithm (NSGAII). The design project for winged airship in the kink of non dominated solution set is selected as a best one. The sizing of the optimized airship is closed to that of the high altitude airship published by Lockheed Martins Inc, which shows that the optimization model for the winged airship is accurate, and is of reference value for the configuration design in low speed near space aerial vehicle.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133811034","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}
Wei Yuan, Liang Hu, Kuo Zhao, Hongtu Li, Jiang-feng Chu, Yuyu Sun
{"title":"Improvement of an Efficient Identity-Based Group Key Agreement Protocol","authors":"Wei Yuan, Liang Hu, Kuo Zhao, Hongtu Li, Jiang-feng Chu, Yuyu Sun","doi":"10.1109/NCIS.2011.53","DOIUrl":"https://doi.org/10.1109/NCIS.2011.53","url":null,"abstract":"In 2009, Zeng Ping et al. proposed a new Group Key Agreement protocol Based on the ID-AGKA protocol which uses full binary tree structure and each tree node represents a user. Their protocol support users to join or leave the group at any time and the session key will be changed with the users' dynamic changes. In this paper, we point out that Zeng Ping et al.'s Group Key Agreement protocol is non-authenticated and easy to be forged or modified. Then we give a method that attacker can force all group members accepted the modified session private key in BR security model. So, It means that the Zeng Ping et al.'s Protocol can not meet the attribute of implicit key authentication and key control. Finally, we propose an improved protocol to overcome this problem.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121176522","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":"Design and Realization of Music Recognition Based on Speech Recognition","authors":"Yu-bin Zhong, Yi Xiang","doi":"10.1109/NCIS.2011.110","DOIUrl":"https://doi.org/10.1109/NCIS.2011.110","url":null,"abstract":"This paper propounds a new music recognition method which is based on singing splitting, MFCC characteristic parameter and BP Neural Network, and the origin of this idea comes from speech recognition. Firstly, fundamentals and key techniques of speech recognition are presented. In what flows is a brief introduction to a music recognition system that is designed and implemented by comparing speech recognition and music recognition. Then, we illustrate applications of BP neural network in music recognition. Finally, 10 English songs are chosen as experiment subjects and are inputted into the music recognition system. The experiment results show that this music recognition method which combines speech recognition can effectively recognize music signals.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116831657","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":"Consider Risk' Assignment of Collaborative Logistics' Interest Based on Shapely Value","authors":"Zhi Guo-jian, Zhang Rui-xia, Li Zhuang-kuo","doi":"10.1109/NCIS.2011.108","DOIUrl":"https://doi.org/10.1109/NCIS.2011.108","url":null,"abstract":"Rational the assignments of the interest are the base of collaborative logistics. While most studying does take the contributions into consider, without the risk of the enterprise take. This paper based on the assignment of shapely value, while consider the risk of the enterprise take, offer of new method of assignment, this method can achieve the \"risk high, benefit high\".","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115765091","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}
Xuping Zheng, Aixin Zhang, Shenghong Li, Jianhua Li
{"title":"Design and Anti-collusion Performance Analysis of a Quantization Based Orthogonal Fingerprinting Scheme","authors":"Xuping Zheng, Aixin Zhang, Shenghong Li, Jianhua Li","doi":"10.1109/NCIS.2011.92","DOIUrl":"https://doi.org/10.1109/NCIS.2011.92","url":null,"abstract":"Multimedia fingerprinting is a technique to trace illegal redistribution of digital representations of multimedia content and to combat multi-user collusion attack. Among existing collusion resistant fingerprinting schemes, spread spectrum (SS) orthogonal fingerprinting has the best collusion resistance in non-blind detection, but in blind detection it shows inadequate performance. In this paper, we propose a novel quantization based orthogonal fingerprinting (QOFP) scheme that possesses good performance in non-blind and blind scenarios. To generate one fingerprinted copy, we implement subtractive dither quantization to the host signal with a dither sequence. By letting the elements in all dither sequences follow independent and identically distributed uniform distribution over a quantization step size, we make fingerprints embedded in different copies mutually orthogonal. Compared with SS orthogonal fingerprinting, our proposed QOFP has almost identical collusion resistance in non-blind detection and much better collusion resistance in blind detection.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114545728","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 Optimistic Payment Protocol with Mobile Agents in Hostile Environments","authors":"Yi Liu, Yong Ding","doi":"10.1109/NCIS.2011.50","DOIUrl":"https://doi.org/10.1109/NCIS.2011.50","url":null,"abstract":"Mobile agents are autonomous software entities that are able to migrate across different execution environments. The characteristics of mobile agents make them ideal for electronic commerce applications in open networks. Security is a fundamental precondition for the acceptance of mobile agent systems. In this paper, using Pedersen's verifiable secret sharing scheme and the theory of cross validation we propose a payment protocol with the following features: (1) protect the confidentiality of sensitive payment information from spying by malicious hosts, (2) use a trusted third party in a minimal way, (3) can verify the validity of the share by the merchant, (4) allows agent to verify that the product which he is about to receive is the one he is paying for.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125364084","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":"Simulation Study for Observation of Space Reentry Vehicles Based on UKF","authors":"Jian Lu, Demin Xu, Lichuan Zhang, Junbing Li","doi":"10.1109/NCIS.2011.181","DOIUrl":"https://doi.org/10.1109/NCIS.2011.181","url":null,"abstract":"Reliable observation of space reentry vehicles is an issue which is worthy of concerning and discussing undoubtedly. The ballistic missile is a typical space reentry vehicle, and it flights along a destined trajectory with a high speed and may maneuver. The motion of the ballistic mission can be approximated by the interaction of the basic motion models that have the simpler forms, and can be observed through using ground radars and optical sensors. After the approximate motion models and observations are brought into the framework of UKF who aims at nonlinear estimation problems specially, the estimate track of the ballistic missile can be implemented. This paper describes the motion model of the ballistic missile firstly, and then the measurement equations of the different sensors and the basic model of the motion body are given out, and then the algorithms of interacting multiple model and UKF are expatiated on, and finally the estimate track is achieved in a simulation system and a conclusion is drawn.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125381648","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":"On Parallel Multisplitting Relaxation Iterative Methods for Singular Linear Systems","authors":"Qingbing Liu","doi":"10.1109/NCIS.2011.114","DOIUrl":"https://doi.org/10.1109/NCIS.2011.114","url":null,"abstract":"In this paper, we consider the semi convergence of parallel multi splitting iterative methods and relaxed parallel methods for singular linear systems. And prove its semi convergence for the case when the coefficient matrix is a singular H-matrix.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126362788","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":"Optimization Deployment Model of Tactics Fixed Force and Accompanying Force","authors":"Qu Changzheng, Ming Li, Zhang Bo, Zhang Liu","doi":"10.1109/NCIS.2011.175","DOIUrl":"https://doi.org/10.1109/NCIS.2011.175","url":null,"abstract":"to study the optimization deployment of tactics maintenance force, a task allocation strategy is proposed based on system steady-state queue length to solve the dynamic task schedule, and a queuing network optimization model is constructed, which achieves the best collocation between fixed force and accompanying force and takes the minimum task time as target.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130366922","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":"The Analysis and Countermeasures Research of Virtual Enterprise Asymmetric Knowledge Sharing","authors":"Yu Cheng-xian, Chen Huo-quan, Guo Dong-qiang","doi":"10.1109/NCIS.2011.148","DOIUrl":"https://doi.org/10.1109/NCIS.2011.148","url":null,"abstract":"Virtual enterprise knowledge sharing is important activities in its life cycle. According to the characteristics of virtual enterprises in the evolution of non-Symmetry dynamic game, the thesis analyzes the role in situation of affecting factors to the knowledge sharing, and discusses the inner mechanism of virtual enterprise's activities of knowledge sharing. Finally, the thesis proposes four countermeasures-selecting the knowledge-sharing partners, and building advanced knowledge technology, improving cross-cultural soft power, protecting intellectual property and optimizing allocation mechanism.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124595083","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}