The multi-objective TT&C (Tracking, Telemetry and Command) mission planning technique is studied based on the background of both ground-based and space-based TT&C mission to the OOS (On-Orbit Service) type of “one-station to multi-objective”. Firstly, the characteristics and constraint condition of OOS TT&C mission are analyzed. Secondly, the space-based and ground-based TT&C mission planning models are established. Finally, using typical OOS mission as an example, the method of TT&C resource planning is simulated for ground-based multi-objective and ISL (InterSatellite Link). The optimized design of TT&C events, optimization scheduling of TT&C resources and automatic implementation strategies of TT&C operations are included to the TT&C mission in this paper. The research results show that the ground-based TT&C resource can be saved by using of space-based TT&C resource. The technical reference can be provided for the implementation of future spacecraft OOS by the research results.
{"title":"Multi-objective TT&C Mission Planning Technique for On-Orbit Service","authors":"Jing Li, Xiaosong Gu, Gangqiang Ye","doi":"10.1109/ISCC-C.2013.87","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.87","url":null,"abstract":"The multi-objective TT&C (Tracking, Telemetry and Command) mission planning technique is studied based on the background of both ground-based and space-based TT&C mission to the OOS (On-Orbit Service) type of “one-station to multi-objective”. Firstly, the characteristics and constraint condition of OOS TT&C mission are analyzed. Secondly, the space-based and ground-based TT&C mission planning models are established. Finally, using typical OOS mission as an example, the method of TT&C resource planning is simulated for ground-based multi-objective and ISL (InterSatellite Link). The optimized design of TT&C events, optimization scheduling of TT&C resources and automatic implementation strategies of TT&C operations are included to the TT&C mission in this paper. The research results show that the ground-based TT&C resource can be saved by using of space-based TT&C resource. The technical reference can be provided for the implementation of future spacecraft OOS by the research results.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127555405","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}
With the characters of low maintenance and little management cost, cloud computing offers an effective and economical approach for data sharing in the cloud among group members. However, since the cloud is untrustworthy, the security guarantees for the sharing data become our concerns. Unfortunately, because of the frequent change of the membership, sharing data while providing privacy-preserving is still a challenging issue. Recently, Liu et al presented a secure multi-owner data sharing scheme, named Mona, which was claimed that any group member could anonymously share data with others by exploiting group signature technique. Meanwhile, the scheme could address fine-grained access control, which means that not only the group members could use the sharing data resource at any time, but also the new users were able to use the sharing data immediately after their revocations and the revoked users will not be allowed to use the sharing data again after they are removed from the group. However, through our security analysis, the Mona scheme still has some security vulnerabilities. It will easily suffer from the collusion attack, which can lead to the revoked users getting the sharing data and disclosing other legitimate members' secrets. In addition, there is another security shortage in the user registration phase, which is how to protect the private key when distributing it in the unsecure communication channels. This kind of attack can also lead to disclosing the user's secret data.
{"title":"The Attack on Mona: Secure Multi-owner Data Sharing for Dynamic Groups in the Cloud","authors":"Zhongma Zhu, Z. Jiang, R. Jiang","doi":"10.1109/ISCC-C.2013.135","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.135","url":null,"abstract":"With the characters of low maintenance and little management cost, cloud computing offers an effective and economical approach for data sharing in the cloud among group members. However, since the cloud is untrustworthy, the security guarantees for the sharing data become our concerns. Unfortunately, because of the frequent change of the membership, sharing data while providing privacy-preserving is still a challenging issue. Recently, Liu et al presented a secure multi-owner data sharing scheme, named Mona, which was claimed that any group member could anonymously share data with others by exploiting group signature technique. Meanwhile, the scheme could address fine-grained access control, which means that not only the group members could use the sharing data resource at any time, but also the new users were able to use the sharing data immediately after their revocations and the revoked users will not be allowed to use the sharing data again after they are removed from the group. However, through our security analysis, the Mona scheme still has some security vulnerabilities. It will easily suffer from the collusion attack, which can lead to the revoked users getting the sharing data and disclosing other legitimate members' secrets. In addition, there is another security shortage in the user registration phase, which is how to protect the private key when distributing it in the unsecure communication channels. This kind of attack can also lead to disclosing the user's secret data.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125025573","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}
A fabric simulation system of 2D virtual scene is researched and implemented in this paper. The system not only simulates the folds and transformations of the scene realistically but also allows replacement and modification of fabric. The finite element mesh algorithm is used to model the virtual scene. In order to avert deformations of texture mapping, the cubic polynomial interpolation algorithm is proposed in this paper. It can overcome the low-pass characteristic of the bilinear interpolation algorithm by eliminating the jags generated from texture mapping. To make the scene simulation more stereo, this paper utilizes the intensity based fusion algorithm, which retains the original scene's intensity. The experimental results show that the two-dimensional fabric scene simulation system is accurate and realistic, and has rapid time response.
{"title":"Simulation of Fabric in 2D Virtual Scene Based on Mesh Model","authors":"Xiaona Fan, Senlin Zhang, Zhen Fan, Zhao Chen","doi":"10.1109/ISCC-C.2013.122","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.122","url":null,"abstract":"A fabric simulation system of 2D virtual scene is researched and implemented in this paper. The system not only simulates the folds and transformations of the scene realistically but also allows replacement and modification of fabric. The finite element mesh algorithm is used to model the virtual scene. In order to avert deformations of texture mapping, the cubic polynomial interpolation algorithm is proposed in this paper. It can overcome the low-pass characteristic of the bilinear interpolation algorithm by eliminating the jags generated from texture mapping. To make the scene simulation more stereo, this paper utilizes the intensity based fusion algorithm, which retains the original scene's intensity. The experimental results show that the two-dimensional fabric scene simulation system is accurate and realistic, and has rapid time response.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134481680","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}
With the rapid development of the Internet, BBS, instant messaging, twitter, micro-blog has become an important channel for people to express their will and exchange information. With the help of the free, open and efficient network platform, opinion information can more directly, more truly reflect public opinion in all aspect of life, also become real-time mapping barometer of the social public opinion. On the other sight, the online public opinion transmit information to form a system which can be affect by many factor as the government, the traditional media, the netizens and the network media. Therefore, by the use of advanced information technology to deal with the opinion information, we analysis the related factors of relationship between them by dynamic evolution rule, and make a reasonable experiment. All of these can lay the groundwork for future scientific research.
{"title":"A Dynamics Model of Opinion Information System","authors":"Jin Du, Yanhui Du, Yiping Zhang","doi":"10.1109/ISCC-C.2013.12","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.12","url":null,"abstract":"With the rapid development of the Internet, BBS, instant messaging, twitter, micro-blog has become an important channel for people to express their will and exchange information. With the help of the free, open and efficient network platform, opinion information can more directly, more truly reflect public opinion in all aspect of life, also become real-time mapping barometer of the social public opinion. On the other sight, the online public opinion transmit information to form a system which can be affect by many factor as the government, the traditional media, the netizens and the network media. Therefore, by the use of advanced information technology to deal with the opinion information, we analysis the related factors of relationship between them by dynamic evolution rule, and make a reasonable experiment. All of these can lay the groundwork for future scientific research.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131279151","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 research purpose of this paper is hoping to quickly select the evidence center, which satisfies the object conclusion, from many uncertain observational evidences, effective position and rapid inference. So in the process of the first sampling, it is needed to establish the sample center. This paper establishes 4 collections of records, by using the threshold algorithm based on competition to reason and refine layer by layer, excluding the uncertainty disturbances, and find the optimal link existed in optimal state. The optimal link determines the selection center of evidence reasoning object, provides the core of evidence for subsequent optimization and achieves the objective of rapid position and accurate inference.
{"title":"Research on the Evidence Optimization Method Based on the Expert System","authors":"Chen Guo, Ming Huang, Xu Liang","doi":"10.1109/ISCC-C.2013.117","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.117","url":null,"abstract":"The research purpose of this paper is hoping to quickly select the evidence center, which satisfies the object conclusion, from many uncertain observational evidences, effective position and rapid inference. So in the process of the first sampling, it is needed to establish the sample center. This paper establishes 4 collections of records, by using the threshold algorithm based on competition to reason and refine layer by layer, excluding the uncertainty disturbances, and find the optimal link existed in optimal state. The optimal link determines the selection center of evidence reasoning object, provides the core of evidence for subsequent optimization and achieves the objective of rapid position and accurate inference.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129717429","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}
Zhang Zhang, Yangyang Zhao, Lina Duan, A. Qiu, Fuhao Zhang, Kunwang Tao
In order to use enterprises' distribution data effectively and maximize their social and economic values, a multi-level grid partition method for enterprise distribution data is proposed which divides the voluminous data into reasonable size. This method uses the provinces or municipalities of nationwide as the coarsest division, then a quad-tree is constructed to partition the points of enterprises according to their locations. Each node in the quad-tree has a limit of points, when the number of points in a node beyond the limit, the node is divided into four nodes with roughly the same number of points in each quadrant. This process proceeds recursively until no node contains points more than the limit. Enterprise distribution data of Harbin is used in experiments to test the feasibility and effectiveness of this method, the results of the experiments show that the enterprises distribution data are divided rapidly and accurately to the grid, which improve the applicability of the data and the convenience of data integration.
{"title":"A Multi-level Grid Partition Method for Enterprises Distribution Data","authors":"Zhang Zhang, Yangyang Zhao, Lina Duan, A. Qiu, Fuhao Zhang, Kunwang Tao","doi":"10.1109/ISCC-C.2013.22","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.22","url":null,"abstract":"In order to use enterprises' distribution data effectively and maximize their social and economic values, a multi-level grid partition method for enterprise distribution data is proposed which divides the voluminous data into reasonable size. This method uses the provinces or municipalities of nationwide as the coarsest division, then a quad-tree is constructed to partition the points of enterprises according to their locations. Each node in the quad-tree has a limit of points, when the number of points in a node beyond the limit, the node is divided into four nodes with roughly the same number of points in each quadrant. This process proceeds recursively until no node contains points more than the limit. Enterprise distribution data of Harbin is used in experiments to test the feasibility and effectiveness of this method, the results of the experiments show that the enterprises distribution data are divided rapidly and accurately to the grid, which improve the applicability of the data and the convenience of data integration.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133110969","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}
In order to solve the problem of mobile learning, the design and implementation of a mobile learning system based on Android operating system is introduced in this paper. Mobile learning brings us to new impressions of whenever and wherever there is a possible study through effective combination of digital learning and mobile computing technology. Mobile learning is regarded as a kind of indispensable learning tool in the future. There are many functions on the platform such as user management, course selection, course download, online tutorials and online test functions and so on. The learner can, whenever and wherever possible, learn by intelligent mobile phone, panel computers or other portable devices. Anyone can open course resources and use them in a convenient way. The platform has good operability and a very optimistic future business-wise, and it provides us a better solution for easy mobile learning.
{"title":"The Design and Implementation of a Mobile Learning Platform Based on Android","authors":"Song Wei","doi":"10.1109/ISCC-C.2013.136","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.136","url":null,"abstract":"In order to solve the problem of mobile learning, the design and implementation of a mobile learning system based on Android operating system is introduced in this paper. Mobile learning brings us to new impressions of whenever and wherever there is a possible study through effective combination of digital learning and mobile computing technology. Mobile learning is regarded as a kind of indispensable learning tool in the future. There are many functions on the platform such as user management, course selection, course download, online tutorials and online test functions and so on. The learner can, whenever and wherever possible, learn by intelligent mobile phone, panel computers or other portable devices. Anyone can open course resources and use them in a convenient way. The platform has good operability and a very optimistic future business-wise, and it provides us a better solution for easy mobile learning.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134107002","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}
As the underlying design of the security protection technology, security protocol plays an indispensable role in the protection of data storage and transmission of the network and information system. This paper analyzes the existing method for generating test cases based on the security testing research of protocol implementation according to the three key steps, formal description of the protocol model, the generation of test sequence and the description of test cases. This paper also provides the reference for the research of new method to generate test cases.
{"title":"The Security Testing Case Research of Protocol Implementation","authors":"Lei Zhang, Jing An, C. You, Guangxuan Chen","doi":"10.1109/ISCC-C.2013.145","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.145","url":null,"abstract":"As the underlying design of the security protection technology, security protocol plays an indispensable role in the protection of data storage and transmission of the network and information system. This paper analyzes the existing method for generating test cases based on the security testing research of protocol implementation according to the three key steps, formal description of the protocol model, the generation of test sequence and the description of test cases. This paper also provides the reference for the research of new method to generate test cases.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131601935","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}
Cloud services often depend on a mechanism that provides a reliable data storage that is resilient to failures. Majority voting and hierarchical voting, an extension of majority voting, are both used to implement such a mechanism in an unreliable network. For example, Apache ZooKeeper adopts both of the two methods. This work considers the question whether or not hierarchical voting with two levels indeed improves data availability compared to majority voting. The simulation results obtained so far suggest that hierarchical voting is unlikely to increase data availability.
{"title":"On the Availability of Replicated Data Managed by Hierarchical Voting","authors":"Yuuki Ueda, Hideharu Kojima, Tatsuhiro Tsuchiya","doi":"10.1109/ISCC-C.2013.95","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.95","url":null,"abstract":"Cloud services often depend on a mechanism that provides a reliable data storage that is resilient to failures. Majority voting and hierarchical voting, an extension of majority voting, are both used to implement such a mechanism in an unreliable network. For example, Apache ZooKeeper adopts both of the two methods. This work considers the question whether or not hierarchical voting with two levels indeed improves data availability compared to majority voting. The simulation results obtained so far suggest that hierarchical voting is unlikely to increase data availability.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132436140","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}
In this paper we examined the use of Neural Networks as a tool to predict the starting and reserve line up of All-Star game, in the National Basketball Association, from all the candidates. Statistics of data from season 2008-09 to 2012-13 were collected and used to train a verity of Neural Networks such as feed-forward, radial basis and generalized regression Neural Networks. Fusion of the neural networks was also examined by using AdaBoost ensemble learning algorithm. Further, we have explored which features set input to the neural network was the most useful ones for prediction. And an excellent prediction scheme was proposed to improve the forecast accuracy. By using AdaBoost and the proposed scheme, the accuracy of our prediction of the starting line up is up to 91.7%, the reserve line up 73.3%.
{"title":"NBA All-Star Lineup Prediction Based on Neural Networks","authors":"B. Ji, Ji Li","doi":"10.1109/ISCC-C.2013.92","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.92","url":null,"abstract":"In this paper we examined the use of Neural Networks as a tool to predict the starting and reserve line up of All-Star game, in the National Basketball Association, from all the candidates. Statistics of data from season 2008-09 to 2012-13 were collected and used to train a verity of Neural Networks such as feed-forward, radial basis and generalized regression Neural Networks. Fusion of the neural networks was also examined by using AdaBoost ensemble learning algorithm. Further, we have explored which features set input to the neural network was the most useful ones for prediction. And an excellent prediction scheme was proposed to improve the forecast accuracy. By using AdaBoost and the proposed scheme, the accuracy of our prediction of the starting line up is up to 91.7%, the reserve line up 73.3%.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123230227","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
扫码关注我们
求助内容：
应助结果提醒方式：