It is a very hot research topic in GIS, virtual reality, computer graphics, digital photogrammetry and other fields which should be researched on 3D terrain visualization. There is also an important part of the digital earth strategy in many fields in order to resolve some comprehensive problems. Trying to take advantage of IDL data processing and graphic display function and Arc Engine spatial analysis function, in the Visual C # 2005 under the environment of hybrid programming mechanism, using of component design and development of integrated development technologies analysis of terrain visualization application operating environment. It should realize the 3D digital terrain expression and spatial analysis function. The results show that the IDL and Arc Engine integrated development method applied to the 3D terrain visualization analysis software platform developed operability and extension force with strong, both in terms of space efficiency and image data analysis, development costs advantages.
{"title":"Research of Terrain 3D Visualization Method Based on IDL and ArcEngine","authors":"Bin Yang, Xiu-mei Gu, Jinfeng Zhan, Mao-song Li","doi":"10.1109/ISCC-C.2013.109","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.109","url":null,"abstract":"It is a very hot research topic in GIS, virtual reality, computer graphics, digital photogrammetry and other fields which should be researched on 3D terrain visualization. There is also an important part of the digital earth strategy in many fields in order to resolve some comprehensive problems. Trying to take advantage of IDL data processing and graphic display function and Arc Engine spatial analysis function, in the Visual C # 2005 under the environment of hybrid programming mechanism, using of component design and development of integrated development technologies analysis of terrain visualization application operating environment. It should realize the 3D digital terrain expression and spatial analysis function. The results show that the IDL and Arc Engine integrated development method applied to the 3D terrain visualization analysis software platform developed operability and extension force with strong, both in terms of space efficiency and image data analysis, development costs advantages.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"152 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":"133034268","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}
Watching Same Content on Three-Screen TV Continuously (WSC3STVC) has been considered as one of the representative services in smart homes recently. This service offers content mobility among multiple kinds of screens based on user position in home. Quality of Experience (QoE) and service implementation cost are two important challenges for supporting WSC3STVC service. To the best of our knowledge, there is no visible attempt to design a comprehensive platform for supporting this service in smart homes. Benefiting from cloud computing, peer-to-peer (P2P) network, clustering and H.264 SVC transcoding, this paper proposes a QoE-aware and cost-effective platform for supporting WSC3STVC service in smart home. The strong points of the proposed platform are transcoding in cloud instead of Home GateWay (HGW) for decreasing HGW cost, content switching inside HGW for reducing service delay, using a cloud-managed P2P network for improving bandwidth between cloud and homes and also clustering homes for reducing transfer delay between homes.
{"title":"A Cloud-Based Platform for Watching Same Content on Three-Screen TV Continuously in Smart Home","authors":"E. Ahvar, G. Lee, N. Crespi","doi":"10.1109/ISCC-C.2013.9","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.9","url":null,"abstract":"Watching Same Content on Three-Screen TV Continuously (WSC3STVC) has been considered as one of the representative services in smart homes recently. This service offers content mobility among multiple kinds of screens based on user position in home. Quality of Experience (QoE) and service implementation cost are two important challenges for supporting WSC3STVC service. To the best of our knowledge, there is no visible attempt to design a comprehensive platform for supporting this service in smart homes. Benefiting from cloud computing, peer-to-peer (P2P) network, clustering and H.264 SVC transcoding, this paper proposes a QoE-aware and cost-effective platform for supporting WSC3STVC service in smart home. The strong points of the proposed platform are transcoding in cloud instead of Home GateWay (HGW) for decreasing HGW cost, content switching inside HGW for reducing service delay, using a cloud-managed P2P network for improving bandwidth between cloud and homes and also clustering homes for reducing transfer delay between homes.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"28 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":"134441340","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 the big data era, detecting unsupervised communities in a given dataset, analyzing the evolution of the unsupervised communities, tracing the interests of users are very important. For instance, we can capture user's interest and provide personalized information. In order to detect unsupervised communities in social tagging networks, this paper uses similarity cloud properties of cloud model to solve the different community analysis, classification, and describe the evolutions of unsupervised communities quantitatively and users' dynamic interests in unsupervised communities problems. Cloud model is used in this paper. By introducing similarity cloud properties of cloud model, cloud model can detect the unsupervised communities, describe the evolutions of unsupervised communities quantitatively, and users' dynamic interests in unsupervised communities. For illustration, the proposed model is applied to Delicious dataset to detect unsupervised communities and one month is used as time slice to study the evolutions of the unsupervised communities. Empirical results show that the unsupervised community in social tagging in network, using Similarity cloud properties of cloud model can effectively detect different unsupervised communities, and describe the evolutions of unsupervised communities quantitatively. Similarity cloud properties based cloud model can effectively detect unsupervised community in social tagging network, and quantitatively describe the evolutions of the community and community user' dynamic interest. Hence, CBUCD model is an efficient solution for detecting unsupervised community and analyzing evolutions.
{"title":"Cloud Model: Detect Unsupervised Communities in Social Tagging Networks","authors":"H. Gao, Jing Jiang, Li Zhang, Li Yuchao, Deyi Li","doi":"10.1109/ISCC-C.2013.56","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.56","url":null,"abstract":"In the big data era, detecting unsupervised communities in a given dataset, analyzing the evolution of the unsupervised communities, tracing the interests of users are very important. For instance, we can capture user's interest and provide personalized information. In order to detect unsupervised communities in social tagging networks, this paper uses similarity cloud properties of cloud model to solve the different community analysis, classification, and describe the evolutions of unsupervised communities quantitatively and users' dynamic interests in unsupervised communities problems. Cloud model is used in this paper. By introducing similarity cloud properties of cloud model, cloud model can detect the unsupervised communities, describe the evolutions of unsupervised communities quantitatively, and users' dynamic interests in unsupervised communities. For illustration, the proposed model is applied to Delicious dataset to detect unsupervised communities and one month is used as time slice to study the evolutions of the unsupervised communities. Empirical results show that the unsupervised community in social tagging in network, using Similarity cloud properties of cloud model can effectively detect different unsupervised communities, and describe the evolutions of unsupervised communities quantitatively. Similarity cloud properties based cloud model can effectively detect unsupervised community in social tagging network, and quantitatively describe the evolutions of the community and community user' dynamic interest. Hence, CBUCD model is an efficient solution for detecting unsupervised community and analyzing evolutions.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"197 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":"134365790","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 find out the key factors affecting the Information Technology (IT) absorptive capability of Small and Medium-sized Enterprises (SMEs), an empirical study is conducted in this paper. Based on the three-dimensional structure and the influence model of IT absorptive capability proposed by Cuiling Yu, and combined with the characteristics of SMEs, this paper proposes a new model of influence factors, and meanwhile makes an empirical study on the SMEs in Jilin province. Empirical results show that IT consulting, IT infrastructure and government support have significantly impacts on the three-dimension of SMEs' IT absorptive capability. On one hand, the paper reveals how the regions and industries as control variables influence the IT absorptive capacity of SMEs, on the other hand, the paper reveals that IT consulting has a special effect on IT absorptive capacity of SMEs.
{"title":"Factors Affecting Small and Medium-Sized Enterprise's Information Technology Absorptive Capability: An Empirical Study of Jilin Province in China","authors":"Lei Wang, Xinhua Bi, Yue Cao, Meiling Gu","doi":"10.1109/ISCC-C.2013.72","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.72","url":null,"abstract":"In order to find out the key factors affecting the Information Technology (IT) absorptive capability of Small and Medium-sized Enterprises (SMEs), an empirical study is conducted in this paper. Based on the three-dimensional structure and the influence model of IT absorptive capability proposed by Cuiling Yu, and combined with the characteristics of SMEs, this paper proposes a new model of influence factors, and meanwhile makes an empirical study on the SMEs in Jilin province. Empirical results show that IT consulting, IT infrastructure and government support have significantly impacts on the three-dimension of SMEs' IT absorptive capability. On one hand, the paper reveals how the regions and industries as control variables influence the IT absorptive capacity of SMEs, on the other hand, the paper reveals that IT consulting has a special effect on IT absorptive capacity of SMEs.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"31 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":"133647311","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}
Particle filter algorithm is to achieve recursive Bayesian filter through the simulation method of non-parameter Monte Carlo, It based on sequential importance sampling, and can not avoid particle degeneration problem, a way to overcome the particle degradation is re-sampling, However sample impoverishment will appear in the process of re-sampling, This paper proposes an improved particle filter method based on optimized weight. To some extent, the method solves the particle impoverishment problem, According to simulation results, we can confirm that the improved particle filter algorithm proposed in the paper can effectively improve the estimation precision of particle filter algorithm.
{"title":"The Improved Particle Filter Algorithm Based on Weight Optimization","authors":"Juntao Zhu, Xiaolong Wang, Qiansheng Fang","doi":"10.1109/ISCC-C.2013.140","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.140","url":null,"abstract":"Particle filter algorithm is to achieve recursive Bayesian filter through the simulation method of non-parameter Monte Carlo, It based on sequential importance sampling, and can not avoid particle degeneration problem, a way to overcome the particle degradation is re-sampling, However sample impoverishment will appear in the process of re-sampling, This paper proposes an improved particle filter method based on optimized weight. To some extent, the method solves the particle impoverishment problem, According to simulation results, we can confirm that the improved particle filter algorithm proposed in the paper can effectively improve the estimation precision of particle filter algorithm.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"52 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":"116687867","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}
Tea conventionally is tested by human sensory panel called Tea Tasters, which assign quality scores to different tea samples. This paper reports a method of the reliable measurement and correct classification of Anxi Tieguanyin tea in Fujian province based on a kind of electronic nose (E-nose): PEN3(Portable Electronic Nose Version 3.0). With the help of the E-nose, we analyze various grades of different kinds of tea samples by using the popular method of separation, like PCA and LDA. Experiments show that the method proposed in this paper has outstanding performance and high efficiency.
传统上，茶叶是由被称为茶品尝师的人类感官小组来测试的，他们会给不同的茶叶样品打分。本文报道了一种基于PEN3(Portable electronic nose Version 3.0)电子鼻(E-nose)的福建省安溪铁观音茶的可靠测量和正确分类方法。在电子鼻的帮助下，我们使用常用的分离方法，如PCA和LDA，来分析不同等级的不同种类的茶叶样品。实验表明，本文提出的方法性能突出，效率高。
{"title":"Quality Evaluation for Anxi Tieguanyin Tea Based on Electronic Nose and PCALDA Method","authors":"Hongxiu Liu, Dehan Luo, Fufang Li, G. Xie","doi":"10.1109/ISCC-C.2013.104","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.104","url":null,"abstract":"Tea conventionally is tested by human sensory panel called Tea Tasters, which assign quality scores to different tea samples. This paper reports a method of the reliable measurement and correct classification of Anxi Tieguanyin tea in Fujian province based on a kind of electronic nose (E-nose): PEN3(Portable Electronic Nose Version 3.0). With the help of the E-nose, we analyze various grades of different kinds of tea samples by using the popular method of separation, like PCA and LDA. Experiments show that the method proposed in this paper has outstanding performance and high efficiency.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"125 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":"115414723","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 efficiently solve the unconstrained optimization problem in which the objective function is very nonlinear, an innovative framework of optimization which is different from line search framework is proposed in this paper. This new method determines the step-length first with nonmonotone line search technique, and generates a two dimensional subspace spanned by the steepest-descent direction and an auxiliary vector. In this subspace, a circle with the current point as its center and with step-length as it radius is constructed. On this circle, the minimizer of the objective function as the next iterative point can be calculated with arc search, and the search direction can be generated with the minimizer and the current point. The variation of gradient of the objective function in the search direction is used for determining the step-length of the next step. The global convergence of this new algorithm is proved in this paper under some mild assumptions. Numerical tests illustrate that this new algorithm is more efficient than conjugate gradient direction. The arc search improves the efficiency of the iterative process. This new algorithm requires only the storage of three vectors such that it is suitable for large scale problems.
{"title":"A New Method of Optimization Based on Arc Search","authors":"Xin Pan, Weikun Sun","doi":"10.1109/ISCC-C.2013.26","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.26","url":null,"abstract":"In order to efficiently solve the unconstrained optimization problem in which the objective function is very nonlinear, an innovative framework of optimization which is different from line search framework is proposed in this paper. This new method determines the step-length first with nonmonotone line search technique, and generates a two dimensional subspace spanned by the steepest-descent direction and an auxiliary vector. In this subspace, a circle with the current point as its center and with step-length as it radius is constructed. On this circle, the minimizer of the objective function as the next iterative point can be calculated with arc search, and the search direction can be generated with the minimizer and the current point. The variation of gradient of the objective function in the search direction is used for determining the step-length of the next step. The global convergence of this new algorithm is proved in this paper under some mild assumptions. Numerical tests illustrate that this new algorithm is more efficient than conjugate gradient direction. The arc search improves the efficiency of the iterative process. This new algorithm requires only the storage of three vectors such that it is suitable for large scale problems.","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":"115462497","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}
Cyber Physical Systems are an emerging discipline that integrates computation and physical processes. With the computation field developed maturely, the major challenges of the implementation of CPSs are the informational abstraction of physical processes and the feedback control on physical processes. The aim of this paper is to provide a description methodology of the physical entity control part, which we named CPSs Hyper Control Mark up Language (CPSsHCML). Through the analysis of TV control part, which is an important physical entity in smart home which is a typical CPSs, the classification of CPSs Hyper Control is obtained in the following four aspects: Function Switch (FS), Discrete Enumerative (DE), Continuous Interval (CI) and Angle Direction (AD). Our work focuses on the definition and description of the attribute fields of global properties and the four CPSs Hyper Controls. In addition, an application of CPSsHCML, which we mentioned above, Sony KLV-40F300A TV in smart home, is provided to show that the prospects of CPSsHCML are promising. Furthermore, some important research challenges and suggestions in future are outlined in brief.
{"title":"A New Model Language for Cyber Physical Systems","authors":"Mingxing Liu, Wubin Ma, Dengsu, Hongbing Huang","doi":"10.1109/ISCC-C.2013.27","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.27","url":null,"abstract":"Cyber Physical Systems are an emerging discipline that integrates computation and physical processes. With the computation field developed maturely, the major challenges of the implementation of CPSs are the informational abstraction of physical processes and the feedback control on physical processes. The aim of this paper is to provide a description methodology of the physical entity control part, which we named CPSs Hyper Control Mark up Language (CPSsHCML). Through the analysis of TV control part, which is an important physical entity in smart home which is a typical CPSs, the classification of CPSs Hyper Control is obtained in the following four aspects: Function Switch (FS), Discrete Enumerative (DE), Continuous Interval (CI) and Angle Direction (AD). Our work focuses on the definition and description of the attribute fields of global properties and the four CPSs Hyper Controls. In addition, an application of CPSsHCML, which we mentioned above, Sony KLV-40F300A TV in smart home, is provided to show that the prospects of CPSsHCML are promising. Furthermore, some important research challenges and suggestions in future are outlined in brief.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"51 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":"116788025","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 reconstructed image problem with poor image quality and long data scan time, 3D-EVDRS algorithm is proposed in this paper. By using 3D sampling trajectory in EVDRS algorithm, 3D-EVDRS algorithm can rationally solve the reconstructed image problem with poor image quality and long data scan time. For illustration, the medical diagnosis spine data is utilized to show the feasibility of the 3D-EVDRS algorithm in solving the reconstructed image problem with poor image quality and long data scan time. Experiments show that 3D-EVDRS algorithm will be used as an efficient algorithm in solving the reconstructed image problem with poor image quality and long data scan time. 3D-EVDRS algorithm can effectively solve the problem with image quality and imaging speed and thus a class of the reconstructed image problem with poor image quality and long data scan time are solved.
{"title":"Application of 3D Sampling Trajectory in EVDRS Algorithm","authors":"Zhongyuan Mou, Jie Yang, Jieru Chi","doi":"10.1109/ISCC-C.2013.48","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.48","url":null,"abstract":"In order to solve the reconstructed image problem with poor image quality and long data scan time, 3D-EVDRS algorithm is proposed in this paper. By using 3D sampling trajectory in EVDRS algorithm, 3D-EVDRS algorithm can rationally solve the reconstructed image problem with poor image quality and long data scan time. For illustration, the medical diagnosis spine data is utilized to show the feasibility of the 3D-EVDRS algorithm in solving the reconstructed image problem with poor image quality and long data scan time. Experiments show that 3D-EVDRS algorithm will be used as an efficient algorithm in solving the reconstructed image problem with poor image quality and long data scan time. 3D-EVDRS algorithm can effectively solve the problem with image quality and imaging speed and thus a class of the reconstructed image problem with poor image quality and long data scan time are solved.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"40 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":"123691552","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}
Internet bots are software agents which perform automated tasks. Recently, Twitter bots have become popular and are widely used. However, in order to reduce the load on the Twitter server, one can only make a limited number of connections to the server. You therefore have to design a Twitter bot considering the total number of connections. Model Checking is a technique for verifying automatically whether a model satisfies a given specification. A number of model checkers have been developed, such as SPIN and UPPAAL. In this paper, we study how to apply model checking to analysis of load provided by a bot on the Twitter server. We give a model of a Twitter bot for the UPPAAL model checker. The bot is actually implemented on the Google App Engine. We analyze the dynamic features of the model with respect to restriction of communication with the Twitter server, using the UPPAAL model checker. Finally, we discuss the future direction of our work.
{"title":"Software Analysis of Internet Bots Using a Model Checker","authors":"Eri Koike, S. Nishizaki","doi":"10.1109/ISCC-C.2013.124","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.124","url":null,"abstract":"Internet bots are software agents which perform automated tasks. Recently, Twitter bots have become popular and are widely used. However, in order to reduce the load on the Twitter server, one can only make a limited number of connections to the server. You therefore have to design a Twitter bot considering the total number of connections. Model Checking is a technique for verifying automatically whether a model satisfies a given specification. A number of model checkers have been developed, such as SPIN and UPPAAL. In this paper, we study how to apply model checking to analysis of load provided by a bot on the Twitter server. We give a model of a Twitter bot for the UPPAAL model checker. The bot is actually implemented on the Google App Engine. We analyze the dynamic features of the model with respect to restriction of communication with the Twitter server, using the UPPAAL model checker. Finally, we discuss the future direction of our work.","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":"128758789","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
扫码关注我们
求助内容：
应助结果提醒方式：