Context-oriented programming (COP) is a programming style that is intended to develop maturity of executional changes that are runtime factors of execution environments of programs. Asynchronous programming is a common style of system coding to control parallel communications with the surroundings. Rather than halting until long operations are finished, in asynchronous programming, the programmer can start a non-interrupting execution of operations and post latter-executed tasks to job-buffers. This paper presents a new model for asynchronous context-oriented software (ACOS). The presented model consists of language techniques for asynchronous context-oriented software (ACOS) and a precise operational semantics for the model constructs. The proposed semantics is direct and provides a mathematical background towards further theoretical studies for ACOS programs. To prove the practicality and efficiency of the proposed model, the paper presents a detailed motivating example for the model.
{"title":"An Efficient Layer-Aware Technique for Developing Asynchronous Context-Oriented Software (ACOS)","authors":"Mohamed A. El-Zawawy","doi":"10.1109/ICCSA.2015.9","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.9","url":null,"abstract":"Context-oriented programming (COP) is a programming style that is intended to develop maturity of executional changes that are runtime factors of execution environments of programs. Asynchronous programming is a common style of system coding to control parallel communications with the surroundings. Rather than halting until long operations are finished, in asynchronous programming, the programmer can start a non-interrupting execution of operations and post latter-executed tasks to job-buffers. This paper presents a new model for asynchronous context-oriented software (ACOS). The presented model consists of language techniques for asynchronous context-oriented software (ACOS) and a precise operational semantics for the model constructs. The proposed semantics is direct and provides a mathematical background towards further theoretical studies for ACOS programs. To prove the practicality and efficiency of the proposed model, the paper presents a detailed motivating example for the model.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117240369","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}
Logistics involves a flow of resources from the origin point to the destination point. Logistics process includes planning, coordination and implementation of various activities required to deliver the goods. Cloud Computing environment may help in improving the process of logistics performance. In this paper, the process of logistics is proposed with the Cloud Computing environment. Various security issues involved in the proposed framework of logistics under the Cloud Computing environment is also discussed.
{"title":"Logistics Business under the Cloud Computing Framework","authors":"V. S. Dixit, Shruti Chhabra","doi":"10.1109/ICCSA.2015.24","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.24","url":null,"abstract":"Logistics involves a flow of resources from the origin point to the destination point. Logistics process includes planning, coordination and implementation of various activities required to deliver the goods. Cloud Computing environment may help in improving the process of logistics performance. In this paper, the process of logistics is proposed with the Cloud Computing environment. Various security issues involved in the proposed framework of logistics under the Cloud Computing environment is also discussed.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568804","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}
Sajjad Ali, Muhammad Abdul Basit Ur Rahim, F. Arif
System Modeling Language (SysML) is a standardized profile of Object Management Group (OMG) and it is used for the purpose of graphical modeling a system engineering application. The embedded system is graphically modeled using an internal block diagram of SysML. For formal verification of graphical model, a methodology is proposed which maps the SysML's internal block diagram to input language of PRISM model checker using CTMC (Continuous Time Markov Chain) model for developing more reliable real-time application. The functionality of the system is graphically modeled using an internal block diagram of SysML that is further translated to input language of PRISM. The user requirements are specified using CSL (Continuous Stochastic Logic) which are further verified against the functionality of the system. The timed and untimed properties are presented and verified against the CTMC model. The timed properties involve continuous time as it is critical in embedded system and its verification is necessary. We demonstrate our methodology by applying it on a case study of liquid fertilizer mixing plant and the methodology presents more accurate results.
{"title":"Formal Verification of Time Constrains SysML Internal Block Diagram Using PRISM","authors":"Sajjad Ali, Muhammad Abdul Basit Ur Rahim, F. Arif","doi":"10.1109/ICCSA.2015.11","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.11","url":null,"abstract":"System Modeling Language (SysML) is a standardized profile of Object Management Group (OMG) and it is used for the purpose of graphical modeling a system engineering application. The embedded system is graphically modeled using an internal block diagram of SysML. For formal verification of graphical model, a methodology is proposed which maps the SysML's internal block diagram to input language of PRISM model checker using CTMC (Continuous Time Markov Chain) model for developing more reliable real-time application. The functionality of the system is graphically modeled using an internal block diagram of SysML that is further translated to input language of PRISM. The user requirements are specified using CSL (Continuous Stochastic Logic) which are further verified against the functionality of the system. The timed and untimed properties are presented and verified against the CTMC model. The timed properties involve continuous time as it is critical in embedded system and its verification is necessary. We demonstrate our methodology by applying it on a case study of liquid fertilizer mixing plant and the methodology presents more accurate results.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131495734","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 application of wireless sensor networks is gradually gaining popularity in ubiquitous computing. They are used for military surveillance, home automation and monitoring, underwater surveillance, wearable sensor and many others. With their way of deployment and use, these tiny motes are mostly vulnerable to attacks and their mode of transfer of data depletes battery power leaving motes dead after a short while. In this paper an algorithm that can be used to minimize the energy consumed by sensor nodes communicating over multihop links is proposed. The algorithm employs unequal clustering technique taking into consideration the distance of the motes from the base station. Our algorithm considers a base station with sparsely distributed nodes that may not all receive adequate signal strength from the base station. Intuitive performance analysis of the proposed algorithm was done in comparison with EEUC and EAUCF considering their energy metrics and clustering techniques. From the preliminary results obtain, our algorithm performs better than the others and hence more stable and energy efficient clustering algorithm.
{"title":"Improving on the Reliability of Wireless Sensor Networks","authors":"F. Engmann, J. Abdulai, J. Azasoo","doi":"10.1109/ICCSA.2015.18","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.18","url":null,"abstract":"The application of wireless sensor networks is gradually gaining popularity in ubiquitous computing. They are used for military surveillance, home automation and monitoring, underwater surveillance, wearable sensor and many others. With their way of deployment and use, these tiny motes are mostly vulnerable to attacks and their mode of transfer of data depletes battery power leaving motes dead after a short while. In this paper an algorithm that can be used to minimize the energy consumed by sensor nodes communicating over multihop links is proposed. The algorithm employs unequal clustering technique taking into consideration the distance of the motes from the base station. Our algorithm considers a base station with sparsely distributed nodes that may not all receive adequate signal strength from the base station. Intuitive performance analysis of the proposed algorithm was done in comparison with EEUC and EAUCF considering their energy metrics and clustering techniques. From the preliminary results obtain, our algorithm performs better than the others and hence more stable and energy efficient clustering algorithm.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130220744","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}
Traditional meters present both the users and utilities providers with various challenges in developing countries. For instance utility providers must get access to their users' premises to be able to read these meters or check fraudulent connections. Users on the other hand have to wait for months or more before knowing their utility consumptions or join long queues to purchase credit for the post-payment and pre-payment meters respectively. This paper seeks to propose a design that retrofits traditional meters on site into smart meters by adding embedded units for communication and control. The study was conducted using a modified Design Science Methodology referred to as Retrofit Design Science Research Methodology (RDSRM). RDSRM argues that, the artifact in context (Smart Meter) has undergone evaluation and acceptance as critical for solving a defined problem and that there are enough literature to support its relevance. The traditional meters were studied and the proposed system was designed using General Packet Radio Service (GPRS) technology for communication, and Peripheral Interface Controller (PIC). Network based applications were developed to present both the consumers and the utilities with the ability to interact with the meters remotely. An attempt was made to address identified security issues of smart metering by using Message Digest 5 (MD5) Algorithm in the design. The system was evaluated based on smart metering requirements. The GPRS Retrofitted Smart Metering System (GRSMS) will reduce the cost of deploying smart meters.
{"title":"A Retrofit Design Science Methodology for Smart Metering Design in Developing Countries","authors":"J. Azasoo, K. Boateng","doi":"10.1109/ICCSA.2015.23","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.23","url":null,"abstract":"Traditional meters present both the users and utilities providers with various challenges in developing countries. For instance utility providers must get access to their users' premises to be able to read these meters or check fraudulent connections. Users on the other hand have to wait for months or more before knowing their utility consumptions or join long queues to purchase credit for the post-payment and pre-payment meters respectively. This paper seeks to propose a design that retrofits traditional meters on site into smart meters by adding embedded units for communication and control. The study was conducted using a modified Design Science Methodology referred to as Retrofit Design Science Research Methodology (RDSRM). RDSRM argues that, the artifact in context (Smart Meter) has undergone evaluation and acceptance as critical for solving a defined problem and that there are enough literature to support its relevance. The traditional meters were studied and the proposed system was designed using General Packet Radio Service (GPRS) technology for communication, and Peripheral Interface Controller (PIC). Network based applications were developed to present both the consumers and the utilities with the ability to interact with the meters remotely. An attempt was made to address identified security issues of smart metering by using Message Digest 5 (MD5) Algorithm in the design. The system was evaluated based on smart metering requirements. The GPRS Retrofitted Smart Metering System (GRSMS) will reduce the cost of deploying smart meters.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122408316","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}
Public power showcase has evaluated in time and most significant of that evaluation come up with the technology movement. Especially widened usage of internet contribute that empowerment of Public. Many studies in PPGIS areas aims' is to get more impressed views to reach optimum value of urban environment. Volunteered geographic information for acquiring flow data, and public participation geographic information science for shaping and modeling city plan would most probably play computational and rational role in future. However, for now taking the photography of that projects is possible in a concept or not?
{"title":"PPGIS Case Studies Comparison and Future Questioning","authors":"A. G. Gulnerman, H. Karaman","doi":"10.1109/ICCSA.2015.15","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.15","url":null,"abstract":"Public power showcase has evaluated in time and most significant of that evaluation come up with the technology movement. Especially widened usage of internet contribute that empowerment of Public. Many studies in PPGIS areas aims' is to get more impressed views to reach optimum value of urban environment. Volunteered geographic information for acquiring flow data, and public participation geographic information science for shaping and modeling city plan would most probably play computational and rational role in future. However, for now taking the photography of that projects is possible in a concept or not?","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016564","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}
We describe a structure we call a 3D Voronoi Subdivision Tree, a new method to create destructible objects in a physics environment. A tree of 3D Voronoi cells is created from a convex object and the cells are subdivided at each level to the bottom-most children. By traversing the tree, this method provides a dynamic way to subdivide a convex object into its smallest shards. As such, this method allows for a fine level of destruction when interacting with another object in a physics simulation environment.
{"title":"Creating Destructible Objects Using a 3D Voronoi Subdivison Tree","authors":"M. Clothier, M. Bailey","doi":"10.1109/ICCSA.2015.26","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.26","url":null,"abstract":"We describe a structure we call a 3D Voronoi Subdivision Tree, a new method to create destructible objects in a physics environment. A tree of 3D Voronoi cells is created from a convex object and the cells are subdivided at each level to the bottom-most children. By traversing the tree, this method provides a dynamic way to subdivide a convex object into its smallest shards. As such, this method allows for a fine level of destruction when interacting with another object in a physics simulation environment.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134539511","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 many Multi Agent Systems, under-education agents investigate their environments to discover their target(s). Any agent can also learn its strategy. In multitask learning, one agent studies a set of related problems together simultaneously, by a common model. In reinforcement learning exploration phase, it is necessary to introduce a process of trial and error to learn better rewards obtained from environment. To reach this end, anyone can typically employ the uniform pseudorandom number generator in exploration period. On the other hand, it is predictable that chaotic sources also offer a random-like series comparable to stochastic ones. It is useful in multitask reinforcement learning, to use teammate agents' experience by doing simple interactions between each other. We employ the past experiences of agents to enhance performance of multitask learning in a nondeterministic environment. Communications are created by operators of evolutionary algorithm. In this paper we have also employed the chaotic generator in the exploration phase of reinforcement learning in a nondeterministic maze problem. We obtained interesting results in the maze problem.
{"title":"Choatic GA Based Q-Learning in Nondeterministic Maze Benchmark","authors":"Mostafa Rafiei, M. Sina","doi":"10.1109/ICCSA.2015.27","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.27","url":null,"abstract":"In many Multi Agent Systems, under-education agents investigate their environments to discover their target(s). Any agent can also learn its strategy. In multitask learning, one agent studies a set of related problems together simultaneously, by a common model. In reinforcement learning exploration phase, it is necessary to introduce a process of trial and error to learn better rewards obtained from environment. To reach this end, anyone can typically employ the uniform pseudorandom number generator in exploration period. On the other hand, it is predictable that chaotic sources also offer a random-like series comparable to stochastic ones. It is useful in multitask reinforcement learning, to use teammate agents' experience by doing simple interactions between each other. We employ the past experiences of agents to enhance performance of multitask learning in a nondeterministic environment. Communications are created by operators of evolutionary algorithm. In this paper we have also employed the chaotic generator in the exploration phase of reinforcement learning in a nondeterministic maze problem. We obtained interesting results in the maze problem.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125638092","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}
Hae Sol Lee, Il Kim, Dong In Kim, Seokki Kim, Kwangae Lim
We consider the downlink of a wireless cellular network which consists of one Macro Base Station (MBS), multiple relays and User Equipments (UEs). In this scenario, we propose relay clustering algorithms to address the problem of inter-cluster interference. In each cluster, we adopt a time-division relaying scheme to avoid intra-cluster interference, but the inter-cluster interference still remains. In interference-aware network, an optimal clustering algorithm requires an exhaustive search, which is infeasible. Hence, we propose a clustering algorithm which improves the system capacity by exploiting the inter-cluster information. But this algorithm is implemented in a centralized manner with high complexity that requires the calculation of inter-cluster information. To circumvent this, we propose a cluster-wise distributed algorithm with manageable complexity, which shows the performance within acceptable range from the optimal one, far better than simple and intuitive algorithms because of the effect of inter-cluster interference.
{"title":"Interference-Aware Clustering Algorithms in Multi-relay Cellular Networks","authors":"Hae Sol Lee, Il Kim, Dong In Kim, Seokki Kim, Kwangae Lim","doi":"10.1109/ICCSA.2015.21","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.21","url":null,"abstract":"We consider the downlink of a wireless cellular network which consists of one Macro Base Station (MBS), multiple relays and User Equipments (UEs). In this scenario, we propose relay clustering algorithms to address the problem of inter-cluster interference. In each cluster, we adopt a time-division relaying scheme to avoid intra-cluster interference, but the inter-cluster interference still remains. In interference-aware network, an optimal clustering algorithm requires an exhaustive search, which is infeasible. Hence, we propose a clustering algorithm which improves the system capacity by exploiting the inter-cluster information. But this algorithm is implemented in a centralized manner with high complexity that requires the calculation of inter-cluster information. To circumvent this, we propose a cluster-wise distributed algorithm with manageable complexity, which shows the performance within acceptable range from the optimal one, far better than simple and intuitive algorithms because of the effect of inter-cluster interference.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134417374","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}
Andrea Chiancone, Valentina Franzoni, R. Niyogi, A. Milani
Most of the best performing link prediction ranking measures evaluate the common neighbourhood of a pair of nodes in a network, in order to assess the likelihood of a new link. On the other hand, the same zero rank value is given to node pairs with no common neighbourhood, which usually are a large number of potentially new links, thus resulting in very low quality overall link ranking in terms of average edit distance to the optimal rank. In this paper we introduce a general technique for improving the quality of the ranking of common neighbours-based measures. The proposed method iteratively applies any given ranking measure to the quasi-common neighbours of the node pair. Experiments held on widely accepted datasets show that QCNAA, a quasi-common neighbourhood measure derived from the well know Adamic-Adar (AA), generates rankings which generally improve the ranking quality, while maintaining the prediction capability of the original AA measure.
{"title":"Improving Link Ranking Quality by Quasi-Common Neighbourhood","authors":"Andrea Chiancone, Valentina Franzoni, R. Niyogi, A. Milani","doi":"10.1109/ICCSA.2015.19","DOIUrl":"https://doi.org/10.1109/ICCSA.2015.19","url":null,"abstract":"Most of the best performing link prediction ranking measures evaluate the common neighbourhood of a pair of nodes in a network, in order to assess the likelihood of a new link. On the other hand, the same zero rank value is given to node pairs with no common neighbourhood, which usually are a large number of potentially new links, thus resulting in very low quality overall link ranking in terms of average edit distance to the optimal rank. In this paper we introduce a general technique for improving the quality of the ranking of common neighbours-based measures. The proposed method iteratively applies any given ranking measure to the quasi-common neighbours of the node pair. Experiments held on widely accepted datasets show that QCNAA, a quasi-common neighbourhood measure derived from the well know Adamic-Adar (AA), generates rankings which generally improve the ranking quality, while maintaining the prediction capability of the original AA measure.","PeriodicalId":197153,"journal":{"name":"2015 15th International Conference on Computational Science and Its Applications","volume":"568 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123162747","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
扫码关注我们
求助内容：
应助结果提醒方式：