{"title":"Multipath query spreading over vehicular ad-hoc networks","authors":"Singha Wongdeethai, P. Siripongwutikorn","doi":"10.1109/ICSEC.2013.6694789","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694789","url":null,"abstract":"Real-time traffic information can effectively be collected from nodes in a vehicular ad hoc network. We consider the problem of spreading a query message from a source node to a destination location over several different paths in the network in order to collect traffic information on road segments in those paths. A query spreading protocol is designed by combining broadcasting and geocasting so that the query message can traverse over a prespecified region between the source node and the destination location. Our simulation result shows that the proposed protocol can cover the segments 80% or more provided that the network has a sufficiently large number of vehicles. However, the variation of the percentage of road segment coverage can highly vary due to an uneven vehicle distribution in the network.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124816835","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}
Sarutte Atsawaraungsuk, Punyaphol Horata, K. Sunat, S. Chiewchanwattana, P. Musigawan
{"title":"Evolutionary Circular Extreme Learning Machine","authors":"Sarutte Atsawaraungsuk, Punyaphol Horata, K. Sunat, S. Chiewchanwattana, P. Musigawan","doi":"10.1109/ICSEC.2013.6694796","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694796","url":null,"abstract":"Circular Extreme Learning Machine (C-ELM) is an extension of Extreme Learning Machine. Its power is mapping both linear and circular separation boundaries. However, C-ELM uses the random determination of the input weights and hidden biases, which may lead to local optimal. This paper proposes a hybrid learning algorithms based on the C-ELM and the Differential Evolution (DE) to select appropriate weights and hidden biases. It called Evolutionary circular extreme learning machine (EC-ELM). From experimental results show EC-ELM can slightly improve C-ELM and also reduce the number of nodes network.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130597035","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}
{"title":"A design pattern knowledge base and its application to sequence diagram design","authors":"B. Shakya, E. Nantajeewarawat","doi":"10.1109/ICSEC.2013.6694775","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694775","url":null,"abstract":"A design pattern describes a problem that commonly occurs in software design and provides the core of a tested and proven solution to that problem. It suggests an appropriate object responsibility assignment and provides guidelines on how to make changes in the state of objects in terms of object interaction. This research presents a framework for constructing a design pattern knowledge base. The structures of design patterns are represented using Ontology Web Language (OWL) and the design solutions suggested by design patterns are represented as rules in Java Expert System Shell. We demonstrate how the obtained knowledge base is employed to construct a UML sequence diagram from requirements specified in the form of an operation contract.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123730534","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}
{"title":"Applying a mixed objective model in a university timetabling solution searching technique","authors":"W. Sitthirit, S. Vasupongayya","doi":"10.1109/ICSEC.2013.6694768","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694768","url":null,"abstract":"Course timetable is a problem that can be solved using a search technique. The task is usually required in all educational institutes. Even though several literature's had been proposed for the problem, the practical solution is still required a lot of human modifications due to a list of specific requirements and the different characteristics of each institution. This work aims to develop a flexible model to guide the search technique namely dept-bounded discrepancy search to solve timetabling problems. The experiments are done using the real data set of the Faculty of Engineering at Prince of Songkla University. The results show that the objective model can guide the search to a solution that satisfies all hard constraints with a minimal number of soft-constraints violations. However, the order of the soft constraints considered by the search technique can affect the number of soft-constraints violations.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125609739","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}
{"title":"Learning in Moodle using Competence-Based Knowledge Space Theory and IMS QTI","authors":"Onjira Sitthisak, L. Gilbert, D. Albert","doi":"10.1109/ICSEC.2013.6694752","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694752","url":null,"abstract":"The Modular Object Oriented Developmental Learning Environment (Moodle) LMS is currently a powerful tool in the educational process, as it supports web-based courses and quizzes, along with providing tools for communication and collaboration. Moodle can be considered as the best platform to support adaptive learning. Using a quiz component is critical to providing an adequate level of adaptation in e-assessment. This paper proposes an implementation of Competence-Based Knowledge Space Theory (CbKST) within Moodle which delivers assessments using an IMS QTI-compliant application. This implementation enhances adaptability, interoperability, portability, and reusability of e-assessments. The paper explores CbKST, a framework for domain and learner knowledge representation which constitutes the basis for meaningful learning paths adapted to the learners' knowledge state. We introduce IMS QTI and its application for managing, verifying, and delivering e-assessments. The proposed system architecture is presented, and key benefits of the implementation are identified and suggestions for future work are provided.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131351629","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}
{"title":"Proactive ergonomics through digital human modeling and simulation for product design innovation: A case study","authors":"B. Kumar, Abhinandan Bora, J. Sanjog, S. Karmakar","doi":"10.1109/ICSEC.2013.6694801","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694801","url":null,"abstract":"Now-a-days, it is a very common trend for youth to go for regular gymnasium for muscular body building or eliminating extra fat. Most of the equipments used for these purposes are generally for indoor exercises. Thus there is least scope of rigorous outdoor exercise in open air environment. An attempt has been made by the present authors to develop a concept model of Ergometer which is to be installed in open space like park. After a small user survey and brain storming, it was decided that the intended design should be unique in look; aesthetically appealing; compatible for both adult Indian male and female; easy to use and most interestingly, it would be motivational factor for people to continue their exercise for longer duration. People would feel happy because more battery (inbuilt) recharging would happen if they go for intense and longer duration exercise. Those batteries would be used in night for illuminating the park. Innovative concept model of the Ergometer was evaluated and subsequently, design was modified by providing more human-centric inputs (various adjustable features for anthropometric compatibility; easy reach towards handle, clearance dimensions, inputs for riding comfort etc.) through proactive virtual ergonomics techniques using digital human modeling and simulation.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123451882","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}
{"title":"Semantically enabled academic paper sharing used in a seminar course","authors":"Siraya Sitthisarn, Kamoltip Rattanabundan","doi":"10.1109/ICSEC.2013.6694746","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694746","url":null,"abstract":"Knowledge sharing is the main activity of knowledge management and it enables the concept of collective intelligence. Social platform as Web 2.0 allows users to easily share information in online communities. However, most shared information is represented in unstructured format so that it impacts to effective information usage (i.e. low search precision, lack of intelligent way of information usage). Semantic web technology makes it possible to address the above problems by including the meaning to the information. Furthermore, information could be represented in a machine readable format. This offers potential for development of mechanisms to enhance the precision of search and provide information recommendation to users. This paper proposed a knowledge-sharing system used for enabling effective academic paper sharing used in a seminar course. Ontology is a knowledge model for describing user profile and seminar paper information. Its vocabulary was used as metadata for annotating information. Semantic search engine and recommendation engine were implemented to support students on seminar paper usage. The user evaluation found that the system reaches the high level of satisfaction for recommendation capability and system's value added. In addition it also reaches the highest satisfaction for retrieval effectiveness.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126144069","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}
Satawat Benromarn, Patrachart Komolkiti, C. Aswakul
{"title":"Game theoretic analysis of jamming attack in wireless mesh network with delay tolerance","authors":"Satawat Benromarn, Patrachart Komolkiti, C. Aswakul","doi":"10.1109/ICSEC.2013.6694808","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694808","url":null,"abstract":"This paper proposes a framework for studying the impact of a smart attacker in a wireless mesh network that is used to provide delay-tolerant internet connectivity. Non-cooperative game theory is used to define the defending player strategy in terms of network tree routing as well as the attacking player strategy in terms of the varying position of communication signal jammer. To evaluate the game value, the payoff is captured by the expected number of backlogged packets, based on the assumption of network of M/M/1 queues. This game is solved by the well-known method of successive average. And a preliminary experimental result has been reported on a small 2×2 grid network. The finding sheds insights on three scenarios reflecting different intelligence levels inherited by the attacker and the defender in comparison with the equivalent settings without the attacker. Finally, future work worth investigating has been given.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129908312","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}
{"title":"A high performance computing for AOM stock trading order matching using GPU","authors":"Ketsarin Rungraung, P. Uthayopas","doi":"10.1109/ICSEC.2013.6694750","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694750","url":null,"abstract":"The task of trading orders matching in financial markets is a very challenging task since due to the speed of arriving request. In this paper, the GPUs technology and CUDA programming is explored as a potential technology to accelerate this task. The trading method in Automatic Order Matching (AOM) of Stock Exchange of Thailand (SET) is used as a case study. The code is developed and parallelized using GPU technology to speeding up the. The experimental results indicated that GPU can increase the performance for this process. In addition, the speedup of the work increases with the data size. Thus, the use of GPU can be substantially important when there is a need to handle massive data at a very high speed.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114195551","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}
{"title":"Prediction oriented analysis of optimal replacement","authors":"Liu Fang, Zhang Shengbing, Ren Meng, Zhang Meng","doi":"10.1109/ICSEC.2013.6694766","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694766","url":null,"abstract":"The optimization of memory latency is always an important bottleneck to improving the performance of computer systems. The memory system, especially the last-level cache (LLC) as the important method to solve the “Memory Wall” problem, its management has become a key factors of influencing the performance of processor. And prefetching technology can improve the overall performance of the system by reducing pipeline stalls according to the temporal and spatial locality. This article is based on the characteristics of different workloads to study the performance of state-of-art LLC management policies with prediction technology. We achieve Bimodal Insertion Policy (BIP) which can adapt to changes in the working set. In order to further reduce the cache miss rate, we use the Set Dueling mechanism to dynamically choose the best replacement policy between Static Re-Reference Interval Policy (SRRIP) and Bimodal Re-Reference Interval Policy (BRRIP) based on the historical information [13]. We take SPLASH-2 as the benchmark to test the performance of these replacement policies. Finally we give a summary on the characteristics of different kinds of policies.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115222292","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}