Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930096
San Choosang, S. Gordon
Rapid developments in networking technologies is resulting in an increasing number of new communication protocols being created, but formal methods are seldom used to verify their design. This paper presents a set of rules for transforming state tables, a common format of protocol specifications in standards, into a formal model based on Coloured Petri nets. This reduces time for developing and debugging CPN models, which can then be used for protocol verification. Formal definitions of subsets of state tables and CPNs are presented, as well as the transformation algorithm. To demonstrate the transformation an example of Stop-and-Wait protocol is used as a case study.
{"title":"Transforming state tables to Coloured Petri nets for automatic verification of internet protocols","authors":"San Choosang, S. Gordon","doi":"10.1109/JCSSE.2011.5930096","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930096","url":null,"abstract":"Rapid developments in networking technologies is resulting in an increasing number of new communication protocols being created, but formal methods are seldom used to verify their design. This paper presents a set of rules for transforming state tables, a common format of protocol specifications in standards, into a formal model based on Coloured Petri nets. This reduces time for developing and debugging CPN models, which can then be used for protocol verification. Formal definitions of subsets of state tables and CPNs are presented, as well as the transformation algorithm. To demonstrate the transformation an example of Stop-and-Wait protocol is used as a case study.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114429850","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930101
Phruksa Sinleunam, Kanat Poolsawad, Suratose Tritilanunt
The eco tourism is a kind of tourism that is one way of traveling to natural and cultural with responsibility by not disturb or destroy natural resources and environment but having the main objective to see, learn and enjoy the scenario, forest, wild animals and also the cultural appeared in that area. The national park is one example of the eco tourism places where the tourists pay an attention to due with high competitive in tourist industrial, and high number of TV commercial and other medias. For the past 10 years statistics of visitor in national park, there is a decreasing of tourists and less realize on eco tourism. From the mentioned problems above, the researcher arises the concept of developing the web-based decision support system for eco tourism planning by selecting the national park in Chiangmai province where most of national parks located. Moreover, national parks in Chiangmai province has biological diversity and natural diversity suitable for begin promoted to be eco tourism place. This research explains the concept and two models developing method of web-based decision support system for eco tourism planning to allow the user chooses, the result is the users have a good satisfaction on the system.
{"title":"A Web-based decision support system for eco tourism planning: A case study of national park in Chiangmai province","authors":"Phruksa Sinleunam, Kanat Poolsawad, Suratose Tritilanunt","doi":"10.1109/JCSSE.2011.5930101","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930101","url":null,"abstract":"The eco tourism is a kind of tourism that is one way of traveling to natural and cultural with responsibility by not disturb or destroy natural resources and environment but having the main objective to see, learn and enjoy the scenario, forest, wild animals and also the cultural appeared in that area. The national park is one example of the eco tourism places where the tourists pay an attention to due with high competitive in tourist industrial, and high number of TV commercial and other medias. For the past 10 years statistics of visitor in national park, there is a decreasing of tourists and less realize on eco tourism. From the mentioned problems above, the researcher arises the concept of developing the web-based decision support system for eco tourism planning by selecting the national park in Chiangmai province where most of national parks located. Moreover, national parks in Chiangmai province has biological diversity and natural diversity suitable for begin promoted to be eco tourism place. This research explains the concept and two models developing method of web-based decision support system for eco tourism planning to allow the user chooses, the result is the users have a good satisfaction on the system.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128957973","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930087
Savinya Polvichai, Prawit Chumchu
Mobile MPLS, as the integration of Mobile IP and MPLS (Multiprotocol Label Switching), has the benefits of having mobility support from Mobile IP and quality of service support from MPLS. These benefits are important to mobile networks carrying various Internet services to mobile users. Nevertheless, Mobile MPLS inherits a problem of routing inefficiency called triangle routing from Mobile IP. This paper proposes a route optimization protocol to overcome this problem in Mobile MPLS. By adding a correspondent agent function to Mobile MPLS's edge routers, the mobility binding of a mobile node can be cached by the edge routers and the packet routing to the mobile node can be route-optimized. We evaluate our proposal by implementing it on the Network Simulator (NS-2). The simulation results indicate that the proposed route optimization has improved the performance of Mobile MPLS by reducing its end-to-end delay.
{"title":"Mobile MPLS with route optimization: The proposed protocol and simulation study","authors":"Savinya Polvichai, Prawit Chumchu","doi":"10.1109/JCSSE.2011.5930087","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930087","url":null,"abstract":"Mobile MPLS, as the integration of Mobile IP and MPLS (Multiprotocol Label Switching), has the benefits of having mobility support from Mobile IP and quality of service support from MPLS. These benefits are important to mobile networks carrying various Internet services to mobile users. Nevertheless, Mobile MPLS inherits a problem of routing inefficiency called triangle routing from Mobile IP. This paper proposes a route optimization protocol to overcome this problem in Mobile MPLS. By adding a correspondent agent function to Mobile MPLS's edge routers, the mobility binding of a mobile node can be cached by the edge routers and the packet routing to the mobile node can be route-optimized. We evaluate our proposal by implementing it on the Network Simulator (NS-2). The simulation results indicate that the proposed route optimization has improved the performance of Mobile MPLS by reducing its end-to-end delay.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126861623","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930150
Katsuaki Tanaka, K. Hori
We extracted design process as series tasks for objects from design process records. First, we tried to extract topics and its transitions from documents. The system divided documents into smaller text fragments and grouped these into clusters. We regarded a cluster as a topic. The system iterated clustering as topic extraction at certain intervals based on created times of documents and generated a graph of topics and its transitions. Then the system chose clusters that related to focused object and searched co-occurring words with the object from text fragments. It represented clusters labeled with these words and its transition.
{"title":"Extracting tasks in design process records","authors":"Katsuaki Tanaka, K. Hori","doi":"10.1109/JCSSE.2011.5930150","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930150","url":null,"abstract":"We extracted design process as series tasks for objects from design process records. First, we tried to extract topics and its transitions from documents. The system divided documents into smaller text fragments and grouped these into clusters. We regarded a cluster as a topic. The system iterated clustering as topic extraction at certain intervals based on created times of documents and generated a graph of topics and its transitions. Then the system chose clusters that related to focused object and searched co-occurring words with the object from text fragments. It represented clusters labeled with these words and its transition.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":" 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132125317","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930129
Chat Niramarnsakul, P. Chongstitvatana, Mark Curtis
Using GPU computing for option pricing has been a critical problem for a long time, specifically, in Monte Carlo simulation which is the most widely used solution for option pricing problem. In general, option pricing must be performed in real time. Recent multi-core CPUs can provide a high computing power, but the option pricing on recent multi-core CPUs is far from responding in real time. The development of Graphic Processing Units promises a much higher computing power than multi-core CPUs for specialized problems. In this paper, we present methods to compress the data inputs for GPU in computing European options pricing which save large memory bandwidth and give the results in an acceptable time. The experimental result shows that the overall speedup is about 900X.
{"title":"Parallelization of European Monte-Carlo options pricing on graphics processing units","authors":"Chat Niramarnsakul, P. Chongstitvatana, Mark Curtis","doi":"10.1109/JCSSE.2011.5930129","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930129","url":null,"abstract":"Using GPU computing for option pricing has been a critical problem for a long time, specifically, in Monte Carlo simulation which is the most widely used solution for option pricing problem. In general, option pricing must be performed in real time. Recent multi-core CPUs can provide a high computing power, but the option pricing on recent multi-core CPUs is far from responding in real time. The development of Graphic Processing Units promises a much higher computing power than multi-core CPUs for specialized problems. In this paper, we present methods to compress the data inputs for GPU in computing European options pricing which save large memory bandwidth and give the results in an acceptable time. The experimental result shows that the overall speedup is about 900X.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134576184","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930077
Hathaithep Siritana, S. Kitisin, Sethavidh Gertphol
In the past, the Internet topology was produced by using connection data from Internet Service Provider (ISP). However, if ISPs didn't update connection data or didn't want publish this data, the Internet topology couldn't be produced. Furthermore, there was no relationships information available between the Autonomous System (AS). In this paper, we use a technique, which does not need to use connection data from ISPs, to examine AS path in BGP routing table to produce Internet topology and infer the type of relationships between the ASs within Thailand.
{"title":"A study of autonomous system relationships within Thailand","authors":"Hathaithep Siritana, S. Kitisin, Sethavidh Gertphol","doi":"10.1109/JCSSE.2011.5930077","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930077","url":null,"abstract":"In the past, the Internet topology was produced by using connection data from Internet Service Provider (ISP). However, if ISPs didn't update connection data or didn't want publish this data, the Internet topology couldn't be produced. Furthermore, there was no relationships information available between the Autonomous System (AS). In this paper, we use a technique, which does not need to use connection data from ISPs, to examine AS path in BGP routing table to produce Internet topology and infer the type of relationships between the ASs within Thailand.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125238107","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930115
Patcharanut Daowadung, Yaw-Huei Chen
This research aims to develop a readability assessment technique to find appropriate Thai language reading materials for primary school students. The corpus contains 1050 articles from textbooks used by students from grade 1 to grade 6. We preprocess the articles by Ling CD program for Thai word segmentation and use mutual information (MI) to select the most important terms in the corpus. Term frequency and inverse document frequency (TF-IDF) are used as features for support vector machines (SVMs) to generate classification models. Experimental results show that the proposed method can reach 0.83 F-measure for identifying articles suitable for middle grades primary school students.
{"title":"Using word segmentation and SVM to assess readability of Thai text for primary school students","authors":"Patcharanut Daowadung, Yaw-Huei Chen","doi":"10.1109/JCSSE.2011.5930115","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930115","url":null,"abstract":"This research aims to develop a readability assessment technique to find appropriate Thai language reading materials for primary school students. The corpus contains 1050 articles from textbooks used by students from grade 1 to grade 6. We preprocess the articles by Ling CD program for Thai word segmentation and use mutual information (MI) to select the most important terms in the corpus. Term frequency and inverse document frequency (TF-IDF) are used as features for support vector machines (SVMs) to generate classification models. Experimental results show that the proposed method can reach 0.83 F-measure for identifying articles suitable for middle grades primary school students.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121161753","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930139
Mathaya Ratchakom, N. Prompoon
Information assets such as customer information, business transaction, and contract transaction data are important for the organization as these assets affect business value and operation. Therefore, to manage information assets, the organization needs to establish the security system, one of the non-functional requirements, to control the resource accessibility. The security patterns provide practices for formal security process establishment which could be applied to assets access control. However, the security patterns explanations are specific but an applying has to define process operation in details. This research proposes a design of process model for Information Assets Access Control (IAAC) using security patterns. In addition, the proposed process model also uses ISO/IEC 27001:2005 and ISO/IEC 27002:2005 as a fundamental framework. The supporting templates are also designed to support the proposed process model.
{"title":"A process model design and tool support for information assets access control using security patterns","authors":"Mathaya Ratchakom, N. Prompoon","doi":"10.1109/JCSSE.2011.5930139","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930139","url":null,"abstract":"Information assets such as customer information, business transaction, and contract transaction data are important for the organization as these assets affect business value and operation. Therefore, to manage information assets, the organization needs to establish the security system, one of the non-functional requirements, to control the resource accessibility. The security patterns provide practices for formal security process establishment which could be applied to assets access control. However, the security patterns explanations are specific but an applying has to define process operation in details. This research proposes a design of process model for Information Assets Access Control (IAAC) using security patterns. In addition, the proposed process model also uses ISO/IEC 27001:2005 and ISO/IEC 27002:2005 as a fundamental framework. The supporting templates are also designed to support the proposed process model.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124097970","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930114
Jumpol Polvichai, Ugrit Boonpramarn
To understand behaviors of any nature living system, a lot of experiments have to be done especially on the actual living system. Alternatively, artificial life is a sub field in artificial intelligence in which living behaviors are simulated and analyzed within computers. Virtually, artificial life can be roughly used to study of living behaviors and systems. In this work, a survival game is tested toward a colony of simulated robots. A number of simulated robots are put in a survival experiment in which the robots must try to save their life as long as possible. Initially, every robot is designed to have a brain as an artificial neural network. They have the same structure of neural network, but the different internal weights, which randomly generated. To survive, the robots must be capable of finding and eating food item to regain their reduced power otherwise they die. When a robot died, a new robot is born from two remaining robots by applying the idea of crossover operation in evolutionary computing techniques. The longer the robot lives, the better chance its own weights are spread over the population. Expectedly, at the end, some interesting behaviors will emerge as the good robot programs and robot performances are also increased. Initial experiments show the good sign for emergence of interesting robot programs.
{"title":"The survival robots: An artificial life","authors":"Jumpol Polvichai, Ugrit Boonpramarn","doi":"10.1109/JCSSE.2011.5930114","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930114","url":null,"abstract":"To understand behaviors of any nature living system, a lot of experiments have to be done especially on the actual living system. Alternatively, artificial life is a sub field in artificial intelligence in which living behaviors are simulated and analyzed within computers. Virtually, artificial life can be roughly used to study of living behaviors and systems. In this work, a survival game is tested toward a colony of simulated robots. A number of simulated robots are put in a survival experiment in which the robots must try to save their life as long as possible. Initially, every robot is designed to have a brain as an artificial neural network. They have the same structure of neural network, but the different internal weights, which randomly generated. To survive, the robots must be capable of finding and eating food item to regain their reduced power otherwise they die. When a robot died, a new robot is born from two remaining robots by applying the idea of crossover operation in evolutionary computing techniques. The longer the robot lives, the better chance its own weights are spread over the population. Expectedly, at the end, some interesting behaviors will emerge as the good robot programs and robot performances are also increased. Initial experiments show the good sign for emergence of interesting robot programs.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123224326","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}
Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930153
Naoto Sato, Kanako Komiya, Koji Fujimoto, Y. Kotani
In this paper, the authors categorize product pages on the Web depending on their information. We used naive Bayes and the complement naive Bayes classifier, and tried four kinds of features to categorize them: all the words of the titles of the product pages, the nouns extracted from the titles, all the words of the titles and the descriptions of the product pages, and the nouns extracted from them. The experiments show that the product pages can be classified most correctly depending on only the nouns of the titles of the product pages. Moreover the complement naive Bayes classifier outperformed the naive Bayes classifier.
{"title":"Categorization of product pages depending on information on the Web","authors":"Naoto Sato, Kanako Komiya, Koji Fujimoto, Y. Kotani","doi":"10.1109/JCSSE.2011.5930153","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930153","url":null,"abstract":"In this paper, the authors categorize product pages on the Web depending on their information. We used naive Bayes and the complement naive Bayes classifier, and tried four kinds of features to categorize them: all the words of the titles of the product pages, the nouns extracted from the titles, all the words of the titles and the descriptions of the product pages, and the nouns extracted from them. The experiments show that the product pages can be classified most correctly depending on only the nouns of the titles of the product pages. Moreover the complement naive Bayes classifier outperformed the naive Bayes classifier.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127633150","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
扫码关注我们
求助内容：
应助结果提醒方式：