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}
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}
Congestion problem is a critical issue at the cafeteria of the University of Tokushima. To cope with this problem, several solutions are under consideration, including layout design, payment method, facilities, etc. In order to examine these solutions, field studies at the cafeteria are required. However, it is neither always possible nor realistic to do so in actual situations. This study applied a simulation-based approach to this problem from the view point of saving time, saving cost, and avoidance of risks. This paper presents the simulation model designed in this research, clarifies how it was implemented for simulation, and the results of simulation to review the feasibility of the proposed solutions
{"title":"A Simulation-Based Approach to Congestion Problem in Cafeteria","authors":"Teruaki Ito","doi":"10.1109/AMS.2007.7","DOIUrl":"https://doi.org/10.1109/AMS.2007.7","url":null,"abstract":"Congestion problem is a critical issue at the cafeteria of the University of Tokushima. To cope with this problem, several solutions are under consideration, including layout design, payment method, facilities, etc. In order to examine these solutions, field studies at the cafeteria are required. However, it is neither always possible nor realistic to do so in actual situations. This study applied a simulation-based approach to this problem from the view point of saving time, saving cost, and avoidance of risks. This paper presents the simulation model designed in this research, clarifies how it was implemented for simulation, and the results of simulation to review the feasibility of the proposed solutions","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"1 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":"130205151","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 research proposes a kinematics and a dynamics models of a two-wheeled vehicle, such as a bicycle or a motorcycle. The modeling of the two-wheeled vehicle has been studied extensively for many years, this paper derives a more exact kinematic model by adding a holonomic condition which compensates exact contact of the front wheel to the ground plane against the handle operation. Using the Lagrange equation subject to the holonomic condition and five non-holonomic conditions for the rear and front wheels, a dynamic model of the two-wheeled vehicle is also derived. Simulation results are given for the kinematic motion and dynamic motion
{"title":"Modeling of a Two-Wheeled Vehicle Compensated for Exact Contact of the Wheel to the Ground Plane and Simulation","authors":"H. Kanoh, T. Uchida","doi":"10.1109/AMS.2007.62","DOIUrl":"https://doi.org/10.1109/AMS.2007.62","url":null,"abstract":"This research proposes a kinematics and a dynamics models of a two-wheeled vehicle, such as a bicycle or a motorcycle. The modeling of the two-wheeled vehicle has been studied extensively for many years, this paper derives a more exact kinematic model by adding a holonomic condition which compensates exact contact of the front wheel to the ground plane against the handle operation. Using the Lagrange equation subject to the holonomic condition and five non-holonomic conditions for the rear and front wheels, a dynamic model of the two-wheeled vehicle is also derived. Simulation results are given for the kinematic motion and dynamic motion","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"33 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":"129665017","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}
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}
FIFO channel languages of communicating finite state machines are useful for protocol verification. The reachability set is the set of all reachable states and it's the purpose of reachability analysis. Computing this set is not reasonable especially if it's infinite. Context free grammars are defined for languages for FIFO channel systems. A grammar 'like' context free is defined for each CFSM. Each rule is of the form Xrarr u-1Yv, where u-1Yv stands for the residual of the language (L(Y)v) with regard to u. Context-free grammar properties are used to make transformations for calculating the channel languages which are fix-point of a system of equations. In this paper we use some acceleration techniques to calculate the channel languages and we show how we can use theoretical framework to verify some protocol properties such as reachability and deadlock problems
{"title":"On Verification of Communicating Finite State Machines Using Residual Languages","authors":"El maati Chabbar, M. Bouhdadi","doi":"10.1109/AMS.2007.75","DOIUrl":"https://doi.org/10.1109/AMS.2007.75","url":null,"abstract":"FIFO channel languages of communicating finite state machines are useful for protocol verification. The reachability set is the set of all reachable states and it's the purpose of reachability analysis. Computing this set is not reasonable especially if it's infinite. Context free grammars are defined for languages for FIFO channel systems. A grammar 'like' context free is defined for each CFSM. Each rule is of the form Xrarr u-1Yv, where u-1Yv stands for the residual of the language (L(Y)v) with regard to u. Context-free grammar properties are used to make transformations for calculating the channel languages which are fix-point of a system of equations. In this paper we use some acceleration techniques to calculate the channel languages and we show how we can use theoretical framework to verify some protocol properties such as reachability and deadlock problems","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"153 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":"114640762","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}
Myunggwon Hwang, Hyunjang Kong, Sunkyoung Baek, Pankoo Kim
In this paper, we propose a topic selection method about Web documents. The idea of our approach is to utilize an ontology structure and TF (term frequency) values of each term. For improving the performance of documents clustering, our research is strongly demanded. We process Web documents for keywords acquisition using TF values and relevancy values between terms using relations defined in WordNet. And then, we proposed the topic selection formula as we consider three kinds of cases during the topic selection. In conclusion, we demonstrate that our approach is very useful for the topic selection of documents
{"title":"TSM. Topic Selection Method of Web Documents","authors":"Myunggwon Hwang, Hyunjang Kong, Sunkyoung Baek, Pankoo Kim","doi":"10.1109/AMS.2007.108","DOIUrl":"https://doi.org/10.1109/AMS.2007.108","url":null,"abstract":"In this paper, we propose a topic selection method about Web documents. The idea of our approach is to utilize an ontology structure and TF (term frequency) values of each term. For improving the performance of documents clustering, our research is strongly demanded. We process Web documents for keywords acquisition using TF values and relevancy values between terms using relations defined in WordNet. And then, we proposed the topic selection formula as we consider three kinds of cases during the topic selection. In conclusion, we demonstrate that our approach is very useful for the topic selection of documents","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"50 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":"114964454","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}
More and more often civil and military threats tend to occur within urban environments which raise the demand for increasing the knowledge and understanding of these events and their effects on society. Crisis simulation modeling could provide excellent support for this demand, and we present a generic platform for modeling and simulation of crises in urban environments, SimCUE, that is proposed by FOI. Such a tool could be used for planning of operations and in preparation for training rescue personnel and decision makers in emergency response. Initially our own existing models will be used as a basis for the platform but we intend and need to extend those with more models describing different kinds of disasters. An overview of existing research models and efforts is presented as well as some examples of plausible scenarios where the tool can be used
{"title":"A Platform for Simulation of Crises in Urban Environments","authors":"Gunnar Holm, F. Moradi, Pernilla Svan, N. Wallin","doi":"10.1109/AMS.2007.5","DOIUrl":"https://doi.org/10.1109/AMS.2007.5","url":null,"abstract":"More and more often civil and military threats tend to occur within urban environments which raise the demand for increasing the knowledge and understanding of these events and their effects on society. Crisis simulation modeling could provide excellent support for this demand, and we present a generic platform for modeling and simulation of crises in urban environments, SimCUE, that is proposed by FOI. Such a tool could be used for planning of operations and in preparation for training rescue personnel and decision makers in emergency response. Initially our own existing models will be used as a basis for the platform but we intend and need to extend those with more models describing different kinds of disasters. An overview of existing research models and efforts is presented as well as some examples of plausible scenarios where the tool can be used","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"169 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":"116128566","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
扫码关注我们
求助内容：
应助结果提醒方式：