2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)最新文献

{"title":"An information extraction framework for legal documents: A case study of Thai Supreme Court verdicts","authors":"Kankawin Kowsrihawat, P. Vateekul","doi":"10.1109/JCSSE.2015.7219809","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219809","url":null,"abstract":"A summary judgement of Thai Supreme Court's case is necessary for legal research. Unfortunately, among thousands of decisions, judges traditionally spend a couple of months to manually create just one of them. In this paper, we present a system called “JudgeDoll, ” which automatically extracts the gist information and provides a legal summary of the full judgement. This system can help the judge to rapidly summarize points of law with correct and reliable results. The experiment was conducted on the data set of Thai Supreme Court's cases, particularly about civil and criminal. For the information extraction part, the results showed that our system achieves more than 90% of accuracy in terms of F1. For the legal-case summarization part, experts evaluated that they are very satisfied with the summary provided by our system. Furthermore, it requires just only few minutes to process each legal case.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121508276","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":"Resourceful method to remove mixed Gaussian-Impulse noise in color images","authors":"S. Chankhachon, S. Intajag","doi":"10.1109/JCSSE.2015.7219763","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219763","url":null,"abstract":"It is a challenging task to suppress mixed noise in a color image. Simple fuzzy method could reduce the mixed Gaussian-Impulse noise with preservable edge and detail of image; however, the method provides some drawbacks and led to inappropriate outputs. This paper proposed a resourceful method to remove the mixed Gaussian-Impulse noise by designing the sequential cases to estimate the optimal weights in small window for filtering the noise signals. The sequential cases consisted of impulse detection, fuzzy system for initial weights, improving the weights and optimizing the weights, and finally the output pixels estimated by either alpha trimmed mean or convex hull techniques. As depicted in the experimental results, the proposed algorithm provided the best solutions when comparison with the vector median filter and the simple fuzzy method.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134196727","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":"An automated stock recommendation system from stock investment research using domain specific information extraction","authors":"Tayida Tapjinda, Potsawee Vechpanich, Nutchaya Leelasupakul, N. Prompoon, Chate Patanothai","doi":"10.1109/JCSSE.2015.7219765","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219765","url":null,"abstract":"The rise of internet web-based application and smart phone ease access to the stock market, attracting newcomer investors. Most investors have made their decision based on information from stock investment researches published by the brokers. An automated stock recommendation system from stock investment research is introduced in this paper. The system collects several investment researches from multiple broker sites daily, converts the researches from pdf to text file, and extracts stock recommendation from the text and saves them to the database. A web application were also developed to serve the user as an interface to access those extracted information. The developed system is capable of extracting 79% of recommendations with the precision of 85%. The web application function also meets the expected both functional requirements.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126590884","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 Relief Mapping on Augmented Reality","authors":"K. Kalarat","doi":"10.1109/JCSSE.2015.7219816","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219816","url":null,"abstract":"Augmented Reality is a variation of Virtual Environment (VE) in Virtual Reality (VR). Virtual Reality technologies Virtual Environment makes user experiences immersion inside a synthetic environment and user cannot see the real world. In contrast, Augmented Reality (AR) medium of information added to the real world in registration with the world to combine virtual objects and real world. Technically, Augmented Reality is able to enhance all five senses by adding digital or computer generated information such as images, audio, video, interaction and overlaying them over in physical world. Its most commonly use is visual. Augmented Reality allows the user to see the virtual object blended in real world environment. To apply Augmented Reality to applications used for illustration the architecture or infrastructure of building, 3D visual model is a content which is good way to show obviously architecture's element because it is able to display the appearance of each building part separately responding to camera perspective in real-time. That means AR system have to re-render the digital object every time the viewer changes position even a tiny bit as temporal registration. Therefore, the computations for three-dimensional computer graphics must be considered about rendering system on the observed devices because time lags could be occurred when lacking computational speed while it is operating the imagery overlay on the top of the physical world for each frame. There are mainly constraints that are limited the AR system performance such as limited memory and limited computational capability. To enhance the limitations of handheld devices, this research applies Relief Mapping algorithm to 3D model in Augmented Reality technology to reduce the number of polygons on the facade of Sino Portuguese Architecture which consist of many bas-relief patterns on their facades. Our system uses game engine, Unity3D, for real-time rendering and Vuforia SDK implemented augmented reality application on handheld device. The result of the research after applying Relief Mapping technique instead of using the conventional modeling creation, more than 80,000 polygons/ 1 bas-relief, is to create by having a single polygon per a bas-relief and the quality of visualization is compatible to each other on AR application.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122842538","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":"Unequal Initial Energy Assignment in Wireless Sensor Networks","authors":"Pichatorn Eak-Une, C. Pornavalai","doi":"10.1109/JCSSE.2015.7219798","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219798","url":null,"abstract":"In multi-hop clustering Wireless Sensor Networks (WSNs), Cluster Head (CH) role is rotated among sensor nodes in order to balance their residual energy usages. However, to forward data from CHs to sink or Base Station (BS), CH nodes that are placed near to the sink consume more energy than CH nodes that are further away. This is known as “Energy Hole” problem in WSNs. This paper proposes an algorithm called “Unequal Initial Energy Assignment” or UIEA to determine initial energy for sensors based on their distances to the sink. This unequal energy assignment is to assign different values of initial energy to sensors that belong to different regions in the network field. Since CHs perform data aggregation, this approach allows sensors to operate using same cluster sizes throughout deployed network field, which is one of the important requirements for some specific applications. Performance from simulation shows that UIEA can get more detail and precise data after aggregation by deploying smaller cluster size than average EC cluster size while the Stable Operation Period (SOP) is approximately the same as EC solution.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133872137","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":"Alternating Least Squares with Incremental Learning Bias","authors":"T. Aung, Rachsuda Jiamthapthaksin","doi":"10.1109/JCSSE.2015.7219813","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219813","url":null,"abstract":"Recommender systems provide personalized suggestions for every individual user in the system. Many recommender systems use collaborative filtering approach in which the system collects and analyzes users' past behaviors, activities or preferences to produce high quality recommendations for the users. Among various collaborative recommendation techniques, model-based approaches are more scalable than memory-based approaches for large scale data sets in spite of large offline computation and difficulty to update the model in real time. In this paper, we introduce Alternating Least Squares with Incremental Learning Bias (ALS++) algorithm to improve over existing matrix factorization algorithms. These learning biases are treated as additional dimensions in our algorithm rather than as additional weights. As the learning process begins after regularized matrix factorization, the algorithm can update incrementally over the preference changes of the data set in constant time without rebuilding the new model again. We set up two different experiments using three different data sets to measure the performance of our new algorithm.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120981828","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 visual editor for language-independent scripting for BPMN modeling","authors":"Jessada Wiriyakul, T. Senivongse","doi":"10.1109/JCSSE.2015.7219788","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219788","url":null,"abstract":"This paper tackles a scripting problem associated with script tasks in BPMN modeling. Usually a BPMN process modeling tool provides a plain text editor without any assisting features for writing a script for a BPMN script task. This is not very convenient even for skilled programmers. There is also a limitation on exporting the script written in one language to different process modeling and execution runtimes that support other scripting languages. To provide easy-to-use and platform-independent scripting, we present a visual block programming editor for defining a visual script for a BPMN script task. The internal representation of the visual script is an XML-based business process script, or XBPScript, from which executable scripts for different target runtimes can be generated. This paper discusses, in particular, how the editor supports a complex function block that can be used in building a script. It also discusses, as an example, how to integrate the visual editor and XBPScript with open source business process management software. An evaluation of the visual editor productivity in comparison with plain text editing is presented.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116176860","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":"Robust human tracking based on multi-features particle filter","authors":"Tassaphan Suwannatat, N. Indra-Payoong, K. Chinnasarn","doi":"10.1109/JCSSE.2015.7219762","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219762","url":null,"abstract":"Tracking moving human from a monocular vision using visual tracking is a useful skill for the coming generation of human-machine interface. It is a challenging problem of planning and control in dynamic environment. The methods used in existing moving human tracking that operate from fixed platform or fixed background, are not applicable. In this paper, we propose a visual tracking approach that detects unexpected moving human that appears in the scene of a monocular camera. This method is implemented using a novel combination of multi-features tracking algorithm based on the particle filter, which allows robust and accurate visual tracking under the circumstance of real-time visual tracking. We apply a particle filter implementation to human tracking using multi-features observation that exploits skin and head-and-shoulder boundary as its prior density. Our experimental results show that the relevance of our approach to the problem of human tracking are then investigated. The accuracy and robustness were evaluated and compared on a challenging synthetic tracking problem using real visual tracking experiments. As a result, it can be possible to track robustly human's motion in the complex environment with moving camera.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123718795","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":"Test cases prioritization for software regression testing using analytic hierarchy process","authors":"Piyakarn Klindee, N. Prompoon","doi":"10.1109/JCSSE.2015.7219790","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219790","url":null,"abstract":"Test cases are considered an important asset in the software testing process since they are used to detect defects in the software. In order to produce quality software covering all of the requirements, the test case designer requires much time and effort in designing test cases to cover all requirements and conditions according to the test case structure. This research proposes a method for storing and retrieving of test cases affected by software requirements changes, as well as ranking the retrieved test cases using the AHP method to improve the quality of the ranking. There are to assist system testers in identifying test cases for complete regression testing. An example application of the proposed method will also be presented.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122873589","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":"Exploiting the topology property of social network for rumor detection","authors":"Yekang Yang, K. Niu, Zhiqiang He","doi":"10.1109/JCSSE.2015.7219767","DOIUrl":"https://doi.org/10.1109/JCSSE.2015.7219767","url":null,"abstract":"Information credibility gradually shown its significant influence on social networks with high propagation ability and low confidence threshold, leading to the crucial work of identifying rumors. In this paper, we address the special characteristics of Weibo, the most popular microblogging service in China like Twitter, and proposed a general framework to assess the credibility of information. Specially, we analyze the specific topology-related properties of user network, and confirm the impact on credibility evaluation. We use features extracted from the microblogs, from the text of the reviews, and from the network structures. To explore the effectiveness of our approach, we conduct the experiment based on an extensive set of data provided by the community of management center in Weibo. Our results reveal that features considered in previous studies achieve a better performance with the consideration of new features we proposed. We believe the work in this paper open new dimensions in analyzing online disinformation.","PeriodicalId":126325,"journal":{"name":"2015 12th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124230164","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}