Modelling and simulation (M&S) is a valuable tool and provides means for reducing, amongst others, manufacturing and training costs. However, development of simulation models is a multi-disciplinary and time/resource consuming process. Building simulation models through composition and reuse of predefined and already existing validated simulation components is an approach to reduce the associated costs and improving the usability of the models. The base object model, BOM, is a new standard for defining reusable and composable simulation components. However, BOMs lack the necessary expressive power to ensure semantic matching of simulation components. In Web service composition (WSC), composite services are built by assembling existing services in order to address functionalities required by users. In WSC much emphasis has been on including the semantic aspects of the composition, through among others utilization of the semantic Web concept. In this paper we describe a process that has been developed at the Swedish Defence Research Agency (FOI) with the aim to speed up and improve the development of simulation models. This process utilizes the BOM concept and extends it by taking advantage of the techniques used in WSC. We will present our approach and findings based on our implementation of the proposed process
{"title":"Component-Based Simulation Model Development Using BOMs and Web Services","authors":"F. Moradi","doi":"10.1109/AMS.2007.26","DOIUrl":"https://doi.org/10.1109/AMS.2007.26","url":null,"abstract":"Modelling and simulation (M&S) is a valuable tool and provides means for reducing, amongst others, manufacturing and training costs. However, development of simulation models is a multi-disciplinary and time/resource consuming process. Building simulation models through composition and reuse of predefined and already existing validated simulation components is an approach to reduce the associated costs and improving the usability of the models. The base object model, BOM, is a new standard for defining reusable and composable simulation components. However, BOMs lack the necessary expressive power to ensure semantic matching of simulation components. In Web service composition (WSC), composite services are built by assembling existing services in order to address functionalities required by users. In WSC much emphasis has been on including the semantic aspects of the composition, through among others utilization of the semantic Web concept. In this paper we describe a process that has been developed at the Swedish Defence Research Agency (FOI) with the aim to speed up and improve the development of simulation models. This process utilizes the BOM concept and extends it by taking advantage of the techniques used in WSC. We will present our approach and findings based on our implementation of the proposed process","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124776370","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}
Recent advances in Internet, peer-to-peer and grid technologies have made collaboration and resource sharing across organizational boundaries more feasible. Today, it is essential for many organizations to be able to discover, share and manage distributed resources in a transparent, meaningful and secure way. A fundamental problem is locating, matching and composing resources or services of interest. In this paper we describe our initial work designing and developing a semantic based distributed repository for secure sharing of simulation models, components and related resources such as computer resources. We propose an overlay architecture which combines advances in semantic Web, peer-to-peer and grid techniques. In our project at the Swedish Defence Research Agency (FOI) we had a need for a repository of simulation related resources and having identified our requirements we found that there was no suitable of-the-shelf system available. We describe the design, tools and a prototype implementation of this system - the semantic based distributed repository (SDR) and conclude with our experiences and some raised issues. We argue that although some of the used techniques still are a bit immature and need further improvements a system like the SDR has a lot of potential and can also be used in other domains than modeling and simulation
{"title":"SDR: A Semantic Based Distributed Repository for Simulation Models and Resources","authors":"Marianela García Lozano, F. Moradi, R. Ayani","doi":"10.1109/AMS.2007.87","DOIUrl":"https://doi.org/10.1109/AMS.2007.87","url":null,"abstract":"Recent advances in Internet, peer-to-peer and grid technologies have made collaboration and resource sharing across organizational boundaries more feasible. Today, it is essential for many organizations to be able to discover, share and manage distributed resources in a transparent, meaningful and secure way. A fundamental problem is locating, matching and composing resources or services of interest. In this paper we describe our initial work designing and developing a semantic based distributed repository for secure sharing of simulation models, components and related resources such as computer resources. We propose an overlay architecture which combines advances in semantic Web, peer-to-peer and grid techniques. In our project at the Swedish Defence Research Agency (FOI) we had a need for a repository of simulation related resources and having identified our requirements we found that there was no suitable of-the-shelf system available. We describe the design, tools and a prototype implementation of this system - the semantic based distributed repository (SDR) and conclude with our experiences and some raised issues. We argue that although some of the used techniques still are a bit immature and need further improvements a system like the SDR has a lot of potential and can also be used in other domains than modeling and simulation","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126347311","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}
Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to exploit all semantic information available for semantic Web services to complete this task. For semantic Web services, we propose a prioritized and limited list of other Web services, with composability measure value based on feasibility of being succeeding service in a composition to fulfil the request. Due to the fact that in semantic Web services, semantic information - all description and signatures - is defined by ontology language, we use some of the mapping rules to estimate a correlation between services for composability. Then we order them based on composability measure value and choose the n top values from them, for a list, which can be referenced in planning the composition with high degree of automation
{"title":"Semantic Composability Measure for Semantic Web Services","authors":"Elham Paikari, J. Habibi, S. Yeganeh","doi":"10.1109/AMS.2007.88","DOIUrl":"https://doi.org/10.1109/AMS.2007.88","url":null,"abstract":"Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to exploit all semantic information available for semantic Web services to complete this task. For semantic Web services, we propose a prioritized and limited list of other Web services, with composability measure value based on feasibility of being succeeding service in a composition to fulfil the request. Due to the fact that in semantic Web services, semantic information - all description and signatures - is defined by ontology language, we use some of the mapping rules to estimate a correlation between services for composability. Then we order them based on composability measure value and choose the n top values from them, for a list, which can be referenced in planning the composition with high degree of automation","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134418298","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}
Object recognition and shape matching are important issues in the field of image processing. Extraction and application of skeleton of a shape is widely used in these fields. In this paper shape matching and retrieval is performed using one of the skeleton-based methods called "shock graphs". By modifying and optimizing this method, results have been improved significantly, especially in the presence of occlusion and missing parts. In this extension, branch points are added as key points to the shock graph and its grammar and consequently a new grammar is developed. Our experimental results due to the modifications and extensions are presented with different examples and tests, especially in the presence of occlusion and missing parts
{"title":"An Improved Shock Graph Approach for Shape Recognition and Retrieval","authors":"Hamidreza Zaboli, M. Rahmati","doi":"10.1109/AMS.2007.13","DOIUrl":"https://doi.org/10.1109/AMS.2007.13","url":null,"abstract":"Object recognition and shape matching are important issues in the field of image processing. Extraction and application of skeleton of a shape is widely used in these fields. In this paper shape matching and retrieval is performed using one of the skeleton-based methods called \"shock graphs\". By modifying and optimizing this method, results have been improved significantly, especially in the presence of occlusion and missing parts. In this extension, branch points are added as key points to the shock graph and its grammar and consequently a new grammar is developed. Our experimental results due to the modifications and extensions are presented with different examples and tests, especially in the presence of occlusion and missing parts","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132220544","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}
Static synchronous series compensator (SSSC) is widely used in power systems to control power of power system by injecting appropriate reactive power into the system. It also has the capability of improving stability and damping by dynamically controlling its reactive power output. This paper presents the energy function of a power system with a SSSC. The proposed energy function is used for transient stability assessment of a power system. This paper develops the control strategy of a SSSC for transient stability and dynamic improvement
{"title":"Transient Stability Assessment of a Power System with a Static Synchronous Series Compensator","authors":"P. Kumkratug, P. Laohachai","doi":"10.1109/AMS.2007.107","DOIUrl":"https://doi.org/10.1109/AMS.2007.107","url":null,"abstract":"Static synchronous series compensator (SSSC) is widely used in power systems to control power of power system by injecting appropriate reactive power into the system. It also has the capability of improving stability and damping by dynamically controlling its reactive power output. This paper presents the energy function of a power system with a SSSC. The proposed energy function is used for transient stability assessment of a power system. This paper develops the control strategy of a SSSC for transient stability and dynamic improvement","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233266","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}
Since nodes in the mobile ad hoc networks (MANETs) network move freely and randomly, routes often get disconnected. The major challenge for MANETs is therefore to implement routing protocols that must respond to changes in the network topology in order to maintain and reconstruct the routes in a timely manner as well as to establish reliable routes. In this paper, we propose a new routing algorithm called grid-based stable routing algorithm (GSRA), GSRA exploits the concept of a routing protocol called Grid. The main difference, between these two protocols is that GSRA considers grid head stability and route stability but the Grid does not. In GSRA, grid partitioning is the same as in the Grid routing protocol. Each grid zone selects a grid head to route. Also, GSRA defines a new parameter called grid head stability to select stable grid head. In routing discovery, each node receives the RREQ packet and uses the link stability metric to evaluate link stability. The destination node collects several feasible routes and then selects the most stable route according to end-to-end reliability. Simulation results indicate that GSRA has a higher packet delivery ratio, lower end-to-end delay and lower routing load than Grid and AODV
{"title":"A Grid-Based Stable Routing Algorithm in Mobile Ad Hoc Networks","authors":"Zhengyu Wu, Hantao Song, Shaofeng Jiang, Xiaomei Xu","doi":"10.1109/AMS.2007.3","DOIUrl":"https://doi.org/10.1109/AMS.2007.3","url":null,"abstract":"Since nodes in the mobile ad hoc networks (MANETs) network move freely and randomly, routes often get disconnected. The major challenge for MANETs is therefore to implement routing protocols that must respond to changes in the network topology in order to maintain and reconstruct the routes in a timely manner as well as to establish reliable routes. In this paper, we propose a new routing algorithm called grid-based stable routing algorithm (GSRA), GSRA exploits the concept of a routing protocol called Grid. The main difference, between these two protocols is that GSRA considers grid head stability and route stability but the Grid does not. In GSRA, grid partitioning is the same as in the Grid routing protocol. Each grid zone selects a grid head to route. Also, GSRA defines a new parameter called grid head stability to select stable grid head. In routing discovery, each node receives the RREQ packet and uses the link stability metric to evaluate link stability. The destination node collects several feasible routes and then selects the most stable route according to end-to-end reliability. Simulation results indicate that GSRA has a higher packet delivery ratio, lower end-to-end delay and lower routing load than Grid and AODV","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124840280","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 introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and the steps are determined. The modified line search technique (MLS) is applied for some global optimization problems. Functions having a high number of dimensions are considered (50 in this case). Results obtained by the proposed method on a set of well known benchmarks are compared to the results obtained by the standard line search method, genetic algorithms and differential evolution. Numerical results show the effectiveness of the proposed approach while compared to the other techniques
{"title":"Modified Line Search Method for Global Optimization","authors":"C. Grosan, A. Abraham","doi":"10.1109/AMS.2007.68","DOIUrl":"https://doi.org/10.1109/AMS.2007.68","url":null,"abstract":"This paper introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and the steps are determined. The modified line search technique (MLS) is applied for some global optimization problems. Functions having a high number of dimensions are considered (50 in this case). Results obtained by the proposed method on a set of well known benchmarks are compared to the results obtained by the standard line search method, genetic algorithms and differential evolution. Numerical results show the effectiveness of the proposed approach while compared to the other techniques","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114824446","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}
Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due to the dynamic environment, clusterhead selection becomes an important issue. We consider the problem of appropriate clusterhead selection in wireless ad-hoc networks and sensor networks. This work analyzes synchronous as well as asynchronous heuristics for discovering nodes with prolonged topological stability. These nodes appear more appropriate to be elected as clusterheads, since the frequency of clusterhead re-election and re-clustering can be decreased. The heuristics described rely on 2-hop topological information and avoid any use of geographical data
{"title":"Node Stability in Dynamic Communication Networks","authors":"Matthias R. Brust, S. Rothkugel, A. Andronache","doi":"10.1109/AMS.2007.73","DOIUrl":"https://doi.org/10.1109/AMS.2007.73","url":null,"abstract":"Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due to the dynamic environment, clusterhead selection becomes an important issue. We consider the problem of appropriate clusterhead selection in wireless ad-hoc networks and sensor networks. This work analyzes synchronous as well as asynchronous heuristics for discovering nodes with prolonged topological stability. These nodes appear more appropriate to be elected as clusterheads, since the frequency of clusterhead re-election and re-clustering can be decreased. The heuristics described rely on 2-hop topological information and avoid any use of geographical data","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122757727","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 paper presents how the Grid/Web services architecture can constitute a knowledge Grid that will facilitate access to vocational training courses in the framework of a job-rotation e-service implementing the job-rotation model. The job-rotation e-service is an integrated on-line system that links training policy with employment policy. On one hand it supports enterprises to find the proper training for their employees and on the other it supports them to find adequate unemployed resources to replace their own while on training. All involved parties benefit from this rotation. The main problem of the job rotation e-service, and generally of systems providing information on vocational training, is the lack of up to date information on running courses due to large administrative costs. The Grid/Web services solution can solve these problems by providing accurate information, directly from the organizations who offer the courses, and reducing administrative costs for the job rotation e-service
{"title":"Grid Web Services Facilitating Access to Vocational Training for Job Rotation","authors":"N. Karadimas, A. Orsoni, N. Papastamatiou","doi":"10.1109/AMS.2007.49","DOIUrl":"https://doi.org/10.1109/AMS.2007.49","url":null,"abstract":"The paper presents how the Grid/Web services architecture can constitute a knowledge Grid that will facilitate access to vocational training courses in the framework of a job-rotation e-service implementing the job-rotation model. The job-rotation e-service is an integrated on-line system that links training policy with employment policy. On one hand it supports enterprises to find the proper training for their employees and on the other it supports them to find adequate unemployed resources to replace their own while on training. All involved parties benefit from this rotation. The main problem of the job rotation e-service, and generally of systems providing information on vocational training, is the lack of up to date information on running courses due to large administrative costs. The Grid/Web services solution can solve these problems by providing accurate information, directly from the organizations who offer the courses, and reducing administrative costs for the job rotation e-service","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122762664","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 contribution presents developments and trend for the structure of new simulation systems, or for extensions of existing simulation systems, in order to handle structural-dynamics systems in an adequate manner. The paper first introduces the CSSL standard for continuous system simulation and its consequences. In the following, discrete elements in continuous modelling and simulation; in more detail event structures are discussed and state events are classified. Thereby, the class of structural-dynamic systems is introduced: state events, changing the dimension of the state space, generate structural-dynamic systems. The paper continues with recent modelling standards in continuous modelling and simulation. There, Modelica and VHDL-AMS are leaving the classic input/output minus; related modelling methods and introduce non-causal modelling on a high level, including implicit models and state events associated with state events. Both new standards, extending and replacing the CSSL standard for the model frame, emphasise on continuous and hybrid modelling; but also especially Modelica allows defining pure discrete model constructs based on events, state charts, and Petri nets. The main chapter concentrates on new proposals for extending model frame and experimental frame of simulation systems, mainly in order to handle structural-dynamic systems properly. There, features of two competing 'philosophies' are sketched, maximal state space versus hybrid decomposition. The paper concludes with a concept for generalisation of the experimental frame, leaving the limits of pure time domain analysis
{"title":"Structure of Simulation Systems for Structural-Dynamic Systems","authors":"F. Breitenecker, N. Popper","doi":"10.1109/AMS.2007.97","DOIUrl":"https://doi.org/10.1109/AMS.2007.97","url":null,"abstract":"This contribution presents developments and trend for the structure of new simulation systems, or for extensions of existing simulation systems, in order to handle structural-dynamics systems in an adequate manner. The paper first introduces the CSSL standard for continuous system simulation and its consequences. In the following, discrete elements in continuous modelling and simulation; in more detail event structures are discussed and state events are classified. Thereby, the class of structural-dynamic systems is introduced: state events, changing the dimension of the state space, generate structural-dynamic systems. The paper continues with recent modelling standards in continuous modelling and simulation. There, Modelica and VHDL-AMS are leaving the classic input/output minus; related modelling methods and introduce non-causal modelling on a high level, including implicit models and state events associated with state events. Both new standards, extending and replacing the CSSL standard for the model frame, emphasise on continuous and hybrid modelling; but also especially Modelica allows defining pure discrete model constructs based on events, state charts, and Petri nets. The main chapter concentrates on new proposals for extending model frame and experimental frame of simulation systems, mainly in order to handle structural-dynamic systems properly. There, features of two competing 'philosophies' are sketched, maximal state space versus hybrid decomposition. The paper concludes with a concept for generalisation of the experimental frame, leaving the limits of pure time domain analysis","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117254394","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
扫码关注我们
求助内容：
应助结果提醒方式：