Internet technology and advances in IT in general has made another paradigm of distributed computing sort after strategy for IT organisations. From client-server computing, Grid computing and now cloud computing, distributed computing architecture made it possible for multiple uses of IT infrastructure and application with managed allocation policies to utilise shared resources and applications. Service oriented computing (SOC) implementing service oriented architecture (SOA) underlines computing as a service by leveraging internet technology such as web service. Cloud computing is promoted as the type of distributing computing that will provide anything from basic computing need to high end delivery of IT services. Hence in this paper we consider two areas of distributed computing architecture, cloud and SOA by discussing the principles and how this fits into our framework to optimised provisioning of SOA over Cloud.
{"title":"SOA and Cloud Service Provisioning Framework","authors":"E. Oppong, S. Khaddaj","doi":"10.1109/DCABES.2012.104","DOIUrl":"https://doi.org/10.1109/DCABES.2012.104","url":null,"abstract":"Internet technology and advances in IT in general has made another paradigm of distributed computing sort after strategy for IT organisations. From client-server computing, Grid computing and now cloud computing, distributed computing architecture made it possible for multiple uses of IT infrastructure and application with managed allocation policies to utilise shared resources and applications. Service oriented computing (SOC) implementing service oriented architecture (SOA) underlines computing as a service by leveraging internet technology such as web service. Cloud computing is promoted as the type of distributing computing that will provide anything from basic computing need to high end delivery of IT services. Hence in this paper we consider two areas of distributed computing architecture, cloud and SOA by discussing the principles and how this fits into our framework to optimised provisioning of SOA over Cloud.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"82 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116755303","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 a new information acquisition and processing technology, wireless sensor networks can achieve tasks with complex large-scale monitoring and tracking in wide range of applications, but the localization for node itself is the basis of most applications. APIT is a major localization algorithm of ranged free algorithms, but the algorithm has the problems of big localization errors and low coverage rate, it also has high dependence on the number of anchor nodes. In order to overcome these disadvantages, this paper propose a mixed localization algorithm based on RSSI and APIT with fitness analysis and optimization, According to the experiment and simulation, the new algorithm has smaller localization errors, higher coverage rate, and improves the overall stability of nodes' localization.
{"title":"A Mixed Localization Algorithm Based on RSSI and APIT with Fitness Analysis and Optimization","authors":"Bo Chen, Jun Sun, Wenbo Xu, Jian Xu","doi":"10.1109/DCABES.2012.45","DOIUrl":"https://doi.org/10.1109/DCABES.2012.45","url":null,"abstract":"As a new information acquisition and processing technology, wireless sensor networks can achieve tasks with complex large-scale monitoring and tracking in wide range of applications, but the localization for node itself is the basis of most applications. APIT is a major localization algorithm of ranged free algorithms, but the algorithm has the problems of big localization errors and low coverage rate, it also has high dependence on the number of anchor nodes. In order to overcome these disadvantages, this paper propose a mixed localization algorithm based on RSSI and APIT with fitness analysis and optimization, According to the experiment and simulation, the new algorithm has smaller localization errors, higher coverage rate, and improves the overall stability of nodes' localization.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127284447","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}
Owing to its great need for mapping an IP address to the corresponding MAC address over an Ethernet topology, Address Resolution Protocol (ARP) has been, and still is, capable of accomplishing this task efficiently. At the same time, it suffers from some security shortcomings, because of the malicious hosts have the possibility of poisoning the ARP cache for another host on the same LAN. In this paper, by gratuitous ARP request packets, we propose a solution to the problem of ARP poisoning. Our suggested mechanism which is named a Gratuitous Decision Packet System (GDPS) seeks to achieve two main goals: (1) Detection of suspicious ARP packets, by implementing a real-time analyzing for received ARP packets. (2) The distinction between a legitimate and malicious host through sending a modified request packet of the gratuitous ARP packets. Furthermore, the experiments show that the presented design has the efficiency and accuracy, as well as it does not require any additional software or hardware.
{"title":"Preventing ARP Spoofing Attacks through Gratuitous Decision Packet","authors":"H. Salim, Zhitang Li, Hao Tu, Zhengbiao Guo","doi":"10.1109/DCABES.2012.71","DOIUrl":"https://doi.org/10.1109/DCABES.2012.71","url":null,"abstract":"Owing to its great need for mapping an IP address to the corresponding MAC address over an Ethernet topology, Address Resolution Protocol (ARP) has been, and still is, capable of accomplishing this task efficiently. At the same time, it suffers from some security shortcomings, because of the malicious hosts have the possibility of poisoning the ARP cache for another host on the same LAN. In this paper, by gratuitous ARP request packets, we propose a solution to the problem of ARP poisoning. Our suggested mechanism which is named a Gratuitous Decision Packet System (GDPS) seeks to achieve two main goals: (1) Detection of suspicious ARP packets, by implementing a real-time analyzing for received ARP packets. (2) The distinction between a legitimate and malicious host through sending a modified request packet of the gratuitous ARP packets. Furthermore, the experiments show that the presented design has the efficiency and accuracy, as well as it does not require any additional software or hardware.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125303524","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}
It improves the algorithm because of the shortcoming that the ACO algorithm is easy to fall into local optimal solution in the cloud computing resource scheduling. The improved algorithm makes particle optimization inosculated into ant colony algorithm, which first finds out several groups of solutions using ACO algorithm according to the updated pheromone, and then gets more effective solutions using PSO algorithm to do crossover operation and mutation operation so as to avoid the algorithm prematurely into the local optimal solution.
{"title":"Study on Resources Scheduling Based on ACO Allgorithm and PSO Algorithm in Cloud Computing","authors":"Xiaotang Wen, Minghe Huang, Jianhua Shi","doi":"10.1109/DCABES.2012.63","DOIUrl":"https://doi.org/10.1109/DCABES.2012.63","url":null,"abstract":"It improves the algorithm because of the shortcoming that the ACO algorithm is easy to fall into local optimal solution in the cloud computing resource scheduling. The improved algorithm makes particle optimization inosculated into ant colony algorithm, which first finds out several groups of solutions using ACO algorithm according to the updated pheromone, and then gets more effective solutions using PSO algorithm to do crossover operation and mutation operation so as to avoid the algorithm prematurely into the local optimal solution.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115499820","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}
Chaotic encryption has a series of good characteristics such as sensitivity to initial value, pseudo-random properties and so on. However, the traditional low-dimensional chaotic sequence is truncated because of the limitation of finite precision in computer. Precision degradation has seriously affected the security of encryption. An image encryption scheme based on high-dimensional dynamical multiple chaotic maps is proposed in this paper. In order to produce fast encryption and more avalanche effect, a novel Baker map is utilized to permute the positions of the image pixels in the spatial domain. The experimental results show that it is more efficient than traditional encryption schemes. Compared with simple low-dimensional chaotic system, the proposed scheme does not readily lead to precision degradation and it has passed NIST sp800-22 standards, it provides a secure way for image encryption.
{"title":"A Novel Image Encryption Scheme Based on Dynamical Multiple Chaos and Baker Map","authors":"X. Tong, Yang Liu, Miao Zhang, Zhu Wang","doi":"10.1109/DCABES.2012.94","DOIUrl":"https://doi.org/10.1109/DCABES.2012.94","url":null,"abstract":"Chaotic encryption has a series of good characteristics such as sensitivity to initial value, pseudo-random properties and so on. However, the traditional low-dimensional chaotic sequence is truncated because of the limitation of finite precision in computer. Precision degradation has seriously affected the security of encryption. An image encryption scheme based on high-dimensional dynamical multiple chaotic maps is proposed in this paper. In order to produce fast encryption and more avalanche effect, a novel Baker map is utilized to permute the positions of the image pixels in the spatial domain. The experimental results show that it is more efficient than traditional encryption schemes. Compared with simple low-dimensional chaotic system, the proposed scheme does not readily lead to precision degradation and it has passed NIST sp800-22 standards, it provides a secure way for image encryption.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122120284","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 Daping, Wang Lin, Z. Junhua, Meng Hong, Guo Xin
The importance and emphasis on interactive teaching is to implement the modern educational thought, but also to achieve quality education. Especially in online teaching, the strengths and weaknesses of the interaction is an important guarantee for the quality of teaching. This article describes the history and development of the game theory, summarizes three features of online games in the view of learning, social and entertainment, and puts forward situated cognition theory combining online game with network teaching. Lastly it indicates how the online games influence on the network teaching interaction design.
{"title":"The Impact of Online Games on the Network Teaching Interaction Design","authors":"Wang Daping, Wang Lin, Z. Junhua, Meng Hong, Guo Xin","doi":"10.1109/DCABES.2012.74","DOIUrl":"https://doi.org/10.1109/DCABES.2012.74","url":null,"abstract":"The importance and emphasis on interactive teaching is to implement the modern educational thought, but also to achieve quality education. Especially in online teaching, the strengths and weaknesses of the interaction is an important guarantee for the quality of teaching. This article describes the history and development of the game theory, summarizes three features of online games in the view of learning, social and entertainment, and puts forward situated cognition theory combining online game with network teaching. Lastly it indicates how the online games influence on the network teaching interaction design.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129589474","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}
Matrix multiplication is one of the most important operations in linear algebra, widely used in many fields of science and engineering. Cannon's algorithm is a classical distributed algorithm for matrix multiplication for two-dimensional meshes. Generally, MPI-IO is used for its I/O requirements. However it has been well documented that MPI-IO performs poorly in a Lustre file system environment. As the scale of matrix multiplication increased, this problem trends to be serious, becoming one key factor impacting performance of the program. In order to improve the performance of Collective I/O of Cannon's program, we proposed a new aggregation pattern (Stripe-continuous aggregation pattern), which fully considers the stripping mechanism and lock protocol of Lustre file system. The theoretical analysis and experimental results show that the pattern can make full use of the capacity of Lustre file system compared with the other patterns, and improve the I/O performance of the Cannon's program efficiently.
{"title":"Optimization of Parallel I/O for Cannon's Algorithm Based on Lustre","authors":"Yunchun Li, Hongda Li","doi":"10.1109/DCABES.2012.61","DOIUrl":"https://doi.org/10.1109/DCABES.2012.61","url":null,"abstract":"Matrix multiplication is one of the most important operations in linear algebra, widely used in many fields of science and engineering. Cannon's algorithm is a classical distributed algorithm for matrix multiplication for two-dimensional meshes. Generally, MPI-IO is used for its I/O requirements. However it has been well documented that MPI-IO performs poorly in a Lustre file system environment. As the scale of matrix multiplication increased, this problem trends to be serious, becoming one key factor impacting performance of the program. In order to improve the performance of Collective I/O of Cannon's program, we proposed a new aggregation pattern (Stripe-continuous aggregation pattern), which fully considers the stripping mechanism and lock protocol of Lustre file system. The theoretical analysis and experimental results show that the pattern can make full use of the capacity of Lustre file system compared with the other patterns, and improve the I/O performance of the Cannon's program efficiently.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"79 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121148452","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}
Nowadays, the applications of MPI-based clusters are used widely, such as the damage prediction of nuclear explosion and gene decryption. However, the usages of MPIbased heterogeneous cluster are nearly reported in contrast to the MPI-based homogeneous clusters due to the immature technology. This paper focuses on building a MPI based heterogeneous cluster with the MPICH2, which is released last year and has not supported the heterogeneous cluster yet. Beside, we give the reasons and test results in the paper to illustrate the benefits of using the MPI-based heterogeneous cluster without virtualization.
{"title":"MPI-Based Heterogeneous Cluster Construction Technology","authors":"Yucheng Guo, Dongxu Hu, Peng Wu","doi":"10.1109/DCABES.2012.116","DOIUrl":"https://doi.org/10.1109/DCABES.2012.116","url":null,"abstract":"Nowadays, the applications of MPI-based clusters are used widely, such as the damage prediction of nuclear explosion and gene decryption. However, the usages of MPIbased heterogeneous cluster are nearly reported in contrast to the MPI-based homogeneous clusters due to the immature technology. This paper focuses on building a MPI based heterogeneous cluster with the MPICH2, which is released last year and has not supported the heterogeneous cluster yet. Beside, we give the reasons and test results in the paper to illustrate the benefits of using the MPI-based heterogeneous cluster without virtualization.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125590071","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 large number of devices are involved in bulk grain silos system and the control flows are particularly complicated. To cope with the complexity, a structured system program design approach is proposed in this study while the Control Logix system is adopted as the operating platform. Meantime, an intelligent flow path selection method by means of a flow table is used to select the control flow. The readability of the programming codes is greatly improved and the complication of sequence control for large-scale equipment is simplified. A range of functions are realized by help of the configuration software iFIX, including flow select, start, stop and suspend, as well as display of the running status of the devices and real-time alarming, etc.
{"title":"ControlLogix-Based Large Bulk Grain Silos Control System Design","authors":"Xing Guo, Haiying Wang, Guoxian Wang","doi":"10.1109/DCABES.2012.82","DOIUrl":"https://doi.org/10.1109/DCABES.2012.82","url":null,"abstract":"A large number of devices are involved in bulk grain silos system and the control flows are particularly complicated. To cope with the complexity, a structured system program design approach is proposed in this study while the Control Logix system is adopted as the operating platform. Meantime, an intelligent flow path selection method by means of a flow table is used to select the control flow. The readability of the programming codes is greatly improved and the complication of sequence control for large-scale equipment is simplified. A range of functions are realized by help of the configuration software iFIX, including flow select, start, stop and suspend, as well as display of the running status of the devices and real-time alarming, etc.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132235174","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}
This paper provides an overview of the current status of methods that may be used to induce parallel properties into the temporal axis for time dependent problems described by differential equations. An extension to problems with two spatial dimensions is also included.
{"title":"Inducing Temporal Parallel Properties into Time Dependent Problems","authors":"N. Kokulan, C. H. Lai","doi":"10.1109/DCABES.2012.50","DOIUrl":"https://doi.org/10.1109/DCABES.2012.50","url":null,"abstract":"This paper provides an overview of the current status of methods that may be used to induce parallel properties into the temporal axis for time dependent problems described by differential equations. An extension to problems with two spatial dimensions is also included.","PeriodicalId":426273,"journal":{"name":"2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134012439","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
扫码关注我们
求助内容：
应助结果提醒方式：