{"title":"Evaluation on the Speed Stability of Electric Wheelchairs Based on Speedadaptation","authors":"L. Wenliang, Li Yujiao","doi":"10.1109/NCIS.2011.85","DOIUrl":"https://doi.org/10.1109/NCIS.2011.85","url":null,"abstract":"A conception of speed-stabilizing ratio is suggested as one of the performance indexes for the evaluation in the speed stability of electric wheelchairs. The definition and methods of acquiring the speed-stabilizing ratio are given in this paper. The speed-adaptation measurement is proposed for improving the accuracy of speed measurement. The speed stabilizing ratio testing system is constructed based on AVR single chip micro controller. The measurement of the speed stabilizing ratio and the accurate evaluation of electric wheelchairs are also achieved.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"14 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":"115449965","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 Pricing Algorithm for Cloud Computing Resources","authors":"Hao-Wen Li, Jian-hua Liu, Guo Tang","doi":"10.1109/NCIS.2011.22","DOIUrl":"https://doi.org/10.1109/NCIS.2011.22","url":null,"abstract":"Currently, resource scheduling methods of cloud computing are mainly focused on scheduling and optimization of the underlying physical resources, but there is no satisfactory resource scheduling for providers from the aspect of economic principles in the cloud applications. In this paper, the cloud bank agent model as a resource agency, from the global perspective, it provides analysis and guidance for all participants, a price update iterative algorithm has been given, it analyses the historical utilization ratio of the resource, and iteration current prices constantly, get the availability of resources next time, the final price to users are expected to calculate. Experiment shows, based on historical usage of resources, the pricing algorithm are more conducive to safeguarding the interests of participants in the cloud resources.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"44 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":"124714147","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":"Control of Spiral Waves and Spatiotemporal Chaos by Stochastic and Asymmetrical Mutual Coupling","authors":"Jun Wang, Y. Xue","doi":"10.1109/NCIS.2011.189","DOIUrl":"https://doi.org/10.1109/NCIS.2011.189","url":null,"abstract":"In this paper, the stochastic and asymmetrical coupling method to effectively suppress spiral waves and spatiotemporal chaos is proposed. Numerical simulation indicates that the control effect was affectted by the paramters coupling strengh and stochastic coupling ratio. It is confirmed that two systems can achieve complete synchronization via the computation of the Pearson's coefficient. The two different systems can achieve phase synchronization in a certain coupling strength and random coupling probability, which is validated by mean instantaneous phase difference.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"59 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":"122082854","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 Analytical Model for Random Changing Pseudonyms Scheme in VANETs","authors":"Yuanyuan Pan, Jianqing Li, Li Feng, Ben Xu","doi":"10.1109/NCIS.2011.127","DOIUrl":"https://doi.org/10.1109/NCIS.2011.127","url":null,"abstract":"Changing pseudonyms are commonly accepted as one approach to protect location privacy in VANETs, but the effectiveness of most changing pseudonyms schemes have never been investigated rigorously. In this paper, we present a detailed analytical model based on a kind of simplest scheme, called Random Changing Pseudonyms (RCP), to quantify the level of location privacy provided by this scheme. Furthermore, according to the proposed model, we analyze and compare two special distributions, i.e., uniform discrete and age-based distributions. The results show that RCP scheme with uniform discrete distribution is better than with age-based distribution on protecting location privacy in VANETs. The accuracy of this model is verified by a set of simulations.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"20 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":"121073453","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":"Secure ID-Based Blind Signature Scheme without Random Oracle","authors":"Xiaoming Hu, Jian Wang, Yinchun Yang","doi":"10.1109/NCIS.2011.56","DOIUrl":"https://doi.org/10.1109/NCIS.2011.56","url":null,"abstract":"The known construction of an identity-based blind signature scheme that is secure in the standard model is based on a generic approach which attaches a certificate to an ordinary (i.e. non-identity-based) blind signature scheme, and thus the identity-based blind signature scheme constructed by this method is inefficient and has long signature size. In this paper, based on the identity-based encryption scheme proposed by Gentry recently, we present a direct construction of an identity-based blind signature scheme. Our identity-based blind signature scheme is computationally efficient and the signature is short. We prove that our scheme is concurrently secure with a tight security reduction in the standard model assuming that the $q$-SDH problem is hard.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"120 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":"114079865","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":"Efficient 1-Out-2 Oblivious Transfer Schemes Based on EDDH Assumption","authors":"Huawei Huang, Chunhua Li","doi":"10.1109/NCIS.2011.188","DOIUrl":"https://doi.org/10.1109/NCIS.2011.188","url":null,"abstract":"This paper proposes an efficient 1-out-2 oblivious transfer scheme from fundamental cryptographic techniques directly. It achieves optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiver's choice is unconditionally secure. The computation time of the 1-out-2 oblivious transfer scheme is very efficient, too. The receiver need compute 4 modular exponentiations only, and the sender need compute 8 modular exponentiations. The new construction is secure if the EDDH assumption holds. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new scheme is a good replacement for Wen-Guey Tzeng's oblivious transfer schemes when bilinear group is adopted as construction platform.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"3 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":"122467623","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":"Effect of Multiple Flow on Performance of Real-Time Data Grids","authors":"M. M. Atanak, A. Doğan","doi":"10.1109/NCIS.2011.23","DOIUrl":"https://doi.org/10.1109/NCIS.2011.23","url":null,"abstract":"Multicommodity flow problem deals with delivering multiple data items residing on different source machines on a networking system to their destinations in an efficient manner, while respecting the bandwidth and cost limitations that may be imposed on the system components. Real-time Data Grid applications are emerging in many disciplines of science and engineering today. This study defines a real-time multisource real-time data dissemination problem and divides the problem into two sub problems. First sub problem is to find the routes on which the data transfers occur. Second sub problem is to determine the amount of flow to be committed on each route. Effect of varying diversity and link delay on the real-time performance is considered and results are discussed.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"4 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":"125147190","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":"Group Key Management Scheme Based on Proxy Re-cryptography for Near-Space Network","authors":"Zhen Wang, Xuehui Du, Yi Sun","doi":"10.1109/NCIS.2011.19","DOIUrl":"https://doi.org/10.1109/NCIS.2011.19","url":null,"abstract":"The Near-Space Network has gotten more and more attentions and become a new research focus with the rapidly development of space information system recently. It is a large network with characteristics of high exposure, dynamic topology, heterogeneous network, etc. The requirement of security for group communications system is much stronger. A group key management scheme based on the hierarchical and domain structure of Near-Space Network is proposed. The proxy re-cryptography algorithm is used in the rekeying process, which solves the problem of a single point of failure thoroughly. Rekeying algorithm for group members' switching between domains is designed and can efficaciously reduce the rekeying overhead caused by switch actions of high speed nodes. The performance analysis shows that the proposed scheme is a secure and reliable group key management scheme for near-space network.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"1 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":"126141803","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":"Cellular Communication Network Modeling Method Based on Cytokines","authors":"Yan-jun Hua, G. Pang","doi":"10.1109/NCIS.2011.96","DOIUrl":"https://doi.org/10.1109/NCIS.2011.96","url":null,"abstract":"A cytokine-based cellular communication network quantitative model is proposed. This model indicates communication between cells by cytokines which can be detected by liquid-chip. We informatically searched the cytokine database to uncover the underlying network architecture of cells related to cytokines. According to the model, a intercellular communication network figure can be got. We transformed the raw data into a network format designating cells as nodes and cytokine connections as edges. This model creates a new platform that discuss the cytokine. Experimental results can be directly observed and analyzed through the network figure, which provides a new kind of analysis method for future studies of cytokines and cells interaction. Jujube friut was choosed as an example to illustrate this model.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"18 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":"126436343","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}
Shuangyong Zuo, Guang Chen, Yong Ding, Xiangling Wang
{"title":"A Subjective Trust Model Based on Fuzzy Neartude","authors":"Shuangyong Zuo, Guang Chen, Yong Ding, Xiangling Wang","doi":"10.1109/NCIS.2011.81","DOIUrl":"https://doi.org/10.1109/NCIS.2011.81","url":null,"abstract":"Trust is an important guarantee for information security. According to the uncertainty and dynamic nature of the subjective trust evaluation, it is difficulty to describe the subjective trust with precise language. In this paper, the weight index of factors was quantified by Analytic Hierarchy Process (AHP). In view of fuzzy set corresponding with subordinate function, imitating the normal distribution function in probability theory, a subjective trust model based on fuzzy neartude was proposed. Finally, example analyses verify that the presented approach is feasible and effective.","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":"129292976","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}