All Papers in NCCIT2015

The Eleventh National Conference on Computing and Information Technology
NCCIT2015
TABLE OF CONTENTS
Message from KMUTNB President ........ ii
Message from General Chair ......................................... iv
Conference Organizers .............. viii
Conference Organization Committee x
Steering Committee................................................................................. xi
Technical Program Committee............................................................... xii
Technical Program Contents.................................................................................................. xiii
Keynote Speakers ...................................... xxxiv
Regular Papers...................................................................
Author Index ......................................................................... 703
NCCIT2015
( . )

ii
NCCIT2015
MESSAGE FROM KMUTNB PRESIDENT

Computer and Information Technology is a key mechanism in the economy, especially
in this era of Digital Economy, which relies on the basis of computer systems and information
technology support. Computer and Information Technology fields of study are important and
must be well prepared to provide better respond to modern needs of the people and the nation
with quality to be universal. Every country around the world has invested resources to structure
and fundamentals of Computer and Information Technology to provide public education in
national development and innovative teaching. The focus on Computer and Information
Technology is a tangible benefit of education at all levels. As for industries and private
businesses, Computer and Information Technology allows management and decision tasks to
be a fast and effective way increasing productivity and profitability of trade.
The Conference on Computer and Information Technology has been continued for many
years with good responses from the research communities. The organizers aim to provides a
stage for the exchange of knowledge from university lecturers, researchers, and students with
new research findings presented and published in the conference proceedings. It also provide
a platform to seek for academic cooperation among the researchers joining the conference from
both the state government and the private sector. This would improve and the quality of
research in Computer and Information Technology, taking the country to be able to compete
both in regional and international.
I would like to thank everyone including the NCCIT network universities, all coorganizers, especially the staff members of the Faculty of Information Technology, King
Mongkuts University of Technology North Bangkok to organize and manage this conference.
I wish the conference achieve its expected.
(Professor Dr.Teravuti Boonyasopon)

President, King Mongkuts University of Technology North Bangkok
iii
NCCIT2015

11 (NCCIT 2015) 2 - 3
2558
11 (The 11th International Conference on Computing and Information Technology: IC2IT 2015)

NCCIT 2015 183
3 2 3
118 64
NCCIT2015
(ISSN 1685-8573)
Thailand Journal Citation Index (TCI) 1
NCCIT2015

NCCIT 2015
.
NCCIT

.

iv
NCCIT2015
NCCIT
NCCIT

.
.
NCCIT2015
NCCIT2015
MESSAGE FROM GENERAL CHAIR

This volume contains the papers of the 11th National Conference on Computing and
Information Technology (NCCIT2015) held at Arnoma Hotel Bangkok, Thailand, on July 2nd - 3rd,
2015. Traditionally, it is organized in conjunction with the International Conference on
Computing and Information Technology (IC2IT), which is supported by many universities both
in Thailand and overseas.
This year, the program committee of NCCIT2015 received 183 submissions from Thai
institutions. Each submission was reviewed by at least 2, mostly 3 members of the program
committee to avoid contradictory results. On these judgments, the committee decided to accept
118 papers (64% accepted rate) for oral presentation and inclusion in the conference
proceedings of NCCIT2015. The papers from NCCIT2015 with excellent quality will be
selected for consideration and hopefully published in the Information Technology Journal
(ISSN 1685-8573), which is included in a database of academic journals in Thailand Journal
Citation Index (TCI) Group 1.
A special thanks is given to Professor Dr. Teeravuti Boonyasopon, KMUTNB President,
for his support of NCCIT from the first year onward, and for providing us with the necessary
resources from KMUTNB.
I would like to also thank the 11 co-operative universities for supporting both in finance
and personnel, which are Mahasarakham University, Ubon Ratchathani University,
Kanchanaburi Rajabhat University, Nakhon Pathom Rajabhat University, Rajabhat Mahasarakham
University, Rajamangala University of Technology Lanna, Rajamangala University of Technology
Krungthep, Rajamangala University of Technology Thanyaburi, Prince of Songkla University
Phuket Campus, National Institute of Development Administration, and Phetchaburi Rajabhat
University.
A very special and warm thank you also goes to Assistant Professor Dr.Sirapat
Boonkrong, Ms. Watchareewan Jitsakul, and the supportive research team; the proceedings
could not have been completed in a timely manner and correct format, without the painstaking
work. Moreover, a special thank is given to our web masters: Mr. Jeerasak Numpradit, and
Mr. Armornsak Armornthananun. A lot of technical and organizational work has been done by
the staff of the Information Technology Faculty at KMUTNB. We would like to also thank all
authors for their submissions and the members of the program committee for their great work
and valuable time.
vi
NCCIT2015
Hopefully, NCCIT will provide good opportunities for faculty, researchers, scholars
and students to present their work to develop themselves to become qualified researchers.
NCCIT will be continuously a platform for the exchange of knowledge in Computer and
Information Technology and to inspire researchers to generate new ideas and to discover new
technologies as well as to find new research partners to establish a research network for
collaboration in the future.
Associate Professor Dr. Phayung Meesad

Dean, Faculty of Information Technology
King Mongkuts University of Technology North Bangkok
NCCIT2015 General Chair
vii
CONFERENCE ORGANIZERS
King Mongkuts University of Technology North Bangkok, Thailand
Faculty of Information Technology
FernUniversitt in Hagen, Germany
Chemnitz University, Germany

Oklahoma State University, USA
Edith Cowan University, Australia
Hanoi National University of Education, Vietnam
Gesellschaft fr Informatik (GI) , Germany
Mahasarakham University, Thailand

Ubon Ratchathani University, Thailand
Faculty of Science
Kanchanaburi Rajabhat University, Thailand
Nakhon Pathom Rajabhat University, Thailand

Faculty of Science and Technology
Rajabhat Mahasarakham University, Thailand

Faculty of Information Technology.
Phetchaburi Rajabhat University
viii
NCCIT2015
NCCIT2015
CONFERENCE ORGANIZERS
Rajamangala University of Technology Lanna, Thailand
Faculty of Engineering
Rajamangala University of Technology Krungthep , Thailand

Center of Academic Resources and Information Technology
Rajamangala University of Technology Thanyaburi, Thailand

Office of Academic Resources and Information Technology
Prince Of Songkla University, Phuket Campus, Thailand

Faculty of Technology and Environment
National Institute of Development Administration, Thailand

Department of Information Technology and Systems Management, School of Applied Statistics
Council of IT Deans of Thailand (CITT) , Thailand
ix
NCCIT2015
CONFERENCE ORGANIZATION COMMITTEE

General Chair :
Assoc. Prof. Dr. Phayung Meesad, KMUTNB
Technical Program and Secretary :
Asst. Prof. Dr. Sirapat Boonkrong, KMUTNB
Conference Treasurer :
Asst. Prof. Dr. Nattavee Utakrit, KMUTNB
STEERING COMMITTEE
Assoc. Prof. Dr. Arunee Intrapairot, RMUTT
Assoc. Prof. Dr. Piya Kovintavewat, NPRU
Assoc. Prof. Dr. Utit Inprasit, UBU
Asst. Prof. Dr. Jugkarin Sukmok, NIDA
Asst. Prof. Dr. Pannee Khonchoho, PBRU
Asst. Prof. Dr. Rattana Wetprasit, PSU
Asst. Prof. Dr. Sirapat Boonkrong, KMUTNB
Asst. Prof. Dr. Sujin Butdisuwan, MSU
Asst. Prof. Dr. Tharat Arreerard, MRU
Asst. Prof. Dr. Uraiwan Inyaem, RMUTT
Asst. Prof. Dr. Uthen Kamnarn, RMUTL
Asst. Prof. Dr. Veerachai Khonchoho, PBRU
Asst. Prof. Dr. Worapapha Arreerard, MRU
Asst. Prof. Photjanee Sukchovna, KRU
Asst. Prof. Surasak Yousawat , RMUTL
Dr. Kairung Hengpraprohm, NPRU
Dr. Panjit Longpradit, PBRU
Dr. Thawatchai Sarawong, RMUTK
Dr. Siwiga Dusadenoad, NIDA
Dr. Sompong Valuvanathorn, UBU
Dr. Supoj Hengpraprohm, NPRU
Mr. Pongpith Tuenpusa, RMUTT
Mr. Tawatchai Lawan, MSU
xi
NCCIT2015
NCCIT2015
TECHNICAL PROGRAM COMMITTEE

Alisa Kongthon, NECTEC
Patharawut Saengsiri, TISTR
Anirach Mingkhuan, KMUTNB
Patrawadee Tanawongsuwan, NIDA
Apida Roonwat, MSU
Phayung Meesad, KMUTNB
Arunee Intrapairoth, RMUTT
Pilapan Phonarin, MUTK
Burasakorn Yoosuk, RMUTT
Pipat Hiranvanichakorn, NIDA
Burin Rujjanapan, NATION
Pongpisit Wuttidittachotti, KMUTNB
Chatchawin Namman, UBU
Pramote Kucharoen, NIDA
Choochart Haruechaiyasa, NECTEC
Prasong Praneetpolgrang, SPU
Dech Thammasiri, NPRU
Pudsadee Boonrawd, KMUTNB
Gamkarn Somprasertsri, MSU
Sakchai Tangwannawit, KMUTNB
Herwig Unger, CRU
Saowalak Arampongsanuwat, SU
Chesada Chartree, SSKRU
Sirapat Boonkrong, KMUTNB
Jamornkul Laokietkul, CHANDRA
Sompong Valuvanathorn, UBU
Jiratta Phuboon-ob, MSU
Sucha Smanchat, KMUTNB
Kittiwan Intaraha, RMUTT
Sukanya Suranauwarat, NIDA
Kriengsak Treeprapin,UBU
Suksaeng Kukanok, IBA Co.,Ltd.
Kuntpong Woraratpanya, KMITL
Sumitra Nuanmesri, SSRU
Mahasak Ketcham, KMUTNB
Sunantha Sodsee, KMUTNB
Maleerat Sodanil, KMUNB
Supoj Hengpraprohm, NPRU
Manasawee Kaenampornpan, MSU
Surapong Auwatanamongkol, NIDA
Mario Kubek, KMUTNB
Sutep Tongngam, NIDA
Montean Rattanasiriwongwut, KMUNB
Tanasai Sucontphunt, NIDA
Nadh Ditcharoen, UBU
Tharach Arreerard, RMU
Nalinpat Porrawatpreyakorn, KMUNB
Thawatchai Sahapong, MRU
Narong Photi, MOE
Thippaya Chintakovid, KMUTNB
Nattavee Utakrit, KMUTNB
Thitirat Siriborvornratanakul, NIDA
Nawaporn Wisitpongphan, KMUNB
Tong Srikacha, TOT
Nidapan Sureerattanan, TNI
Tossaporn Joochim, UBU
Noppasak Tantisattayanon, RMUTR
Uraiwan Inyaem, RMUTT
Panana Tangwannawit, PCRU
Vatinee Nuipian, KMUTNB
Panjit Longpradit, PBRU
Veerachai Khonchoho, PBRU
Paranya Palawisut, NPRU
Wongot Sriurai, UBU
Parinya Sanguansat, PIM
Worapapha Arreerard, RMU
Passakon Prathombutr, NECTEC
xii
TECHNICAL PROGRAM CONTENTS
xiii
NCCIT2015
NCCIT2015
Thursday 2nd July 2015

08:00 09:00
Registration
Report (in Thai) by Assoc.Prof.Dr. Phayung Meesad,
Dean of Faculty of Information Technology,
King Mongkut's University of Technology North Bangkok
09:00 09:10
Report by Prof.Dr.Herwig Unger,
IC2IT2015 Technical Program Chair,
Fern University in Hagen, Germany
09:10 09:40
09:40 10:40
Opening Ceremony by Prof. Dr. Teravuti Boonyasopon,

President of King Mongkuts University of Technology North Bangkok
Invited Keynote Speech by: Prof. Dr. Nicolai Petkov
Professor of Computer Science at the University of Gronigen,
the Netherlands
Topic: Brain-inspired pattern recognition
10:40 11:00
Coffee Break
11:00 12:00
Invited Keynote Speech by: Assoc. Prof. Dr. Andrew Woodward

Head of the School of Computer and Security Science,
Topic: An uncomfortable change: shifting perceptions to establish pragmatic
cyber security
12:00 13:00
Lunch
13:00 17:30
Paper Presentation
17:30 22:00
Welcome Dinner
xiv
NCCIT2015

Room 1: Data Mining and Machine Learning
Time
Title/Author
Page
13:00 13:20
NCCIT2015-9
Automatic Feeling Analysis from Opinion Text

Chetarin Wongsin, Nattakit Srikarnjanaperd and Jantima Polpinij
13:20 13:40
NCCIT2015-27
Eliminating the Noise Feature with Significant Matrix II

Algorithm
Ekapong Chuasuwan
13:40 14:00
NCCIT2015-28
An Improved Differential Evolution Algorithm with Crossover

Strategy for Continuous Optimization Problems
Duangjai Jitkongchuen
13
14:00 14:20
NCCIT2015-41
Applied Fuzzy Logic for Memory Allocation of Virtual Machines

in Cloud Computing
Tipparat Sinlapaphongwarakorn and Chaiyaporn Khemapatapan
18
14:20 14:40
NCCIT2015-48
A Self Adaptive Migration for Distributed Genetic Algorithm

Chaiwiwat Jantasarn and Pornthep Rojanavasu
24
14:40 15:00
Coffee Break
15:00 15:20
NCCIT2015-51
Enhancement of predictive models for rice production in Lower

Northern Thailand
Sujittra Sarakon, Jaratsri Rungrattanaubol and Anamai Na-Udom
31
15:20 15:40
NCCIT2015-52
Web Page Classification using Generalization Performance of

Support Vector Machines
Mulliga Khwankue, Thimaporn Phetkaew and Pornpon Thamrongrat
37
15:40 16:00
NCCIT2015-55
Performance Improvement of Extreme Learning Machine based

on Flower Pollination Algorithm for Real World Regression
Problem
Sarunyoo Boriratrit, Sirapat Chiewchanwattana, Khamron Sunat and
Punyaphol Horata
43
16:00 16:20
NCCIT2015-59
Semantic-Based Indoor Navigation for Library Book Finding

Nonthachai Dubtuk, Thimaporn Phetkeaw and Siripinyo Chantamunee
49
16:20 16:40
NCCIT2015-60
Dynamic System Identification of DC/DC Converter using Fuzzy

Model Identification
Atip Jandee and Somyot Kaitwanidvilai
55
16:40 17:00
NCCIT2015-65
Online English Crime News Classification using Text Mining

Tichakorn Netsuwon and Kraisak Kesorn
61
17:00 17:20
Welcome Dinner and Best Paper Award Presentation
xv
NCCIT2015

Room 2: Data Network and Communication
Time
Title/Author
Page
13:00 13:20
NCCIT2015-40
Blows2Safe: a Wireless Sensor Network for Detection of Breath

Alcohol to Prevent Alcohol-Impaired Driving
Apirak Tooltham and Phumin Hongma
68
13:20 13:40
NCCIT2015-42
Fairness Bandwidth Allocation for Control of Multiple Internet

Connections with Max-Min Usage Threshold Policy
Kassuda Kamluewong, Atikhom Siri, Thanawut Thanavanich and
Kamol Boonlom
74
13:40 14:00
NCCIT2015-81
The Analysis of Internet Infrastructure Network by Graph

Theory: The Case Study of Internet Infrastructure in Phetchaburi
Rajabhat University
Worawut Yimyam, Veerachai Khonchoho and Aongart Aun-A-Nan
80
14:00 14:20
NCCIT2015-89
Rogue DHCP Protection using Elliptic Curve Digital Signature

Algorithm
Theerasak Thongyan and Somnuk Puangpronpitag
86
14:20 14:40
NCCIT2015-99
Development of Anti-Collision for Radio Frequency Identification

(RFID)
Sataya Boonchaleaw and Chaiporn Jaikaeo
92
14:40 15:00
Coffee Break
15:00 15:20
NCCIT2015-103
An Analysis of Safety and Security for Internet Banking in

Thailand
Pattanarat Putla and Somnuk Puangpronpitag
99
15:20 15:40
NCCIT2015-117
Social network analysis case study Kanchanaburi Rajabhat

University
Sureewan Jangjit
106

15:40 16:00
NCCIT2015-72
IP Network Logging Management System with Automatically

Ponghathai Kanjanapart and Montean Rattanasiriwongwut
112
16:00 16:20
NCCIT2015-82
Classification of Open Source Earthquake Disaster Information

in Thai Language
Yuttana Lungkatoong and Maleerat Sodanil
118
16:20 16:40
NCCIT2015-83
Classification of Open Source Flood Disaster Information in Thai

Language
Phatcharaporn Sitikomfu and Maleerat Sodanil
124
16:40 17:00
NCCIT2015-86
The Developing Model for Predicting the Thai Population

Migration Using an Artificial Neural Network
Pichanita Seensat and Maleerat Sodanil
131
17:00 17:20
xvi
NCCIT2015

Room 3: Human Computer Interaction and Image Processing
Time
Title/Author
Page
13:00 13:20
NCCIT2015-100
Thai Hand Shapes Recognition Using ACO SVM

Anusorn Untao and Sompong Valuvanathon
137
13:20 13:40
NCCIT2015-15
Development of Navigation app using AR Technology. A Case

Study: Prince of Songkla University, Phuket Campus
Watcharavut Deklee, Jerasak Tubtong, Apiwut Wattanachai and
Jirawat Thaenthong
143
13:40 14:00
NCCIT2015-17
Question-Based Audio Captcha with Type of Answer Code for

Blind Users
Rueangchai Saiprasopsuk, Amornchai Manopiya-Anan and
Nuttanont Hongwarittorrn
149
14:00 14:20
NCCIT2015-39
Image processing and Fuzzy C-Means Clustering on Magnetic

Head Circuit
Rawinun Praserttaweelap and Somyot Kaitwanidvilai
156
14:20 14:40
NCCIT2015-95
A Comparative Study in Feature Extraction Methods of Peg-less

Hand Geometry
Jakkree Srinonchat and Apiwat Sawatdirat
162
14:40 15:00
Coffee Break
15:00 15:20
NCCIT2015-102
Enhancement Neural Network-based LED Detection Method using

Integral Image
Annop Sakachant and Jakkree Srinonchat
168
15:20 15:40
NCCIT2015-107
Usability Evaluation Framework for Android Applications on

Mobile Devices
Kritpapon Thitichaimongkhol and Twittie Senivongse
174
15:40 16:00
NCCIT2015-110
Detection of Eye Movement for controlling Smart Device on

Android OS for Impaired Arm
Warissara Suranun and Mahasak Ketcham
181
16:00 16:20
NCCIT2015-113
Real Time Monitoring System with Wireless Sensors Network for

Sinus Arrhythmia Condition
Salisa Hongsi and Mahasak Ketcham
187
16:20 16:40
NCCIT2015-114
Design Guidelines for Instructional Media Creation System for

Middle-aged Teachers on Tablets
Ketsraporn Sengprathom and Thippaya Chintakovid
193
16:40 17:00
NCCIT2015-118
Lottery Digit Recognition for The Visually Impaired

Wanida Saetang and Sakchai Tangwannawit
199
17:00 17:20
xvii
NCCIT2015

Room 4: Information Technology and Computer Education
Time
Title/Author
Page
13:00 13:20
NCCIT2015-1
A Study The Acceptance of Mobile Application

Passana Ekudompong and Sirirak Khanthanurak
205
13:20 13:40
NCCIT2015-7
Development of the System for Electronic Media Classification by

Using the Dewey Decimal Classification System
Worapapha Arreerard,Laongthip Maturos, Monchai Tiantong and
Dusanee Supawantanakul
211
13:40 14:00
NCCIT2015-12
Application Development on iOS for Cycling to Travel A case

study: Phuket Tourism
Amonrat Prasitsupparote, Phuriphong Phumirawi, Apichaya
Khwankaew and Kantida Nanon
217
14:00 14:20
NCCIT2015-13
A Prototype of Geographic Information System based on

Appropriate Irrigation Decisions in Maiseab Weir, Nakhon Si
Thammarat Province
Sarintorn Wongyoksuriya, Onjira Sitthisak and Anisara Pensuk Tibkaew
223
14:20 14:40
NCCIT2015-14
A Development of Information System Integration by TUNA

Model Using : A Case Study of Nation University
Burin Rujjanapan
229
14:40 15:00
Coffee Break
15:00 15:20
NCCIT2015-20
Development of the Training Packages the Robot Control

Programming with C for Students of Technical Teacher Training
Program
Kitti Surpare and Patpong Armornwong
235
15:20 15:40
NCCIT2015-21
Test Cases Generation from Business Process Model Based on

Event Driven
Sarawut Waleetorncheepsawasd and Taratip Suwannasart
241
15:40 16:00
NCCIT2015-22
JSON Cache with NoSQL

Aiyapan Eagobon and Nuengwong Tuaycharoen
247
16:00 16:20
NCCIT2015-23
A Web-based Information System for Reporting Traffic Police

Bribe via iOS Smartphones with Tor
Sitichai Chumjai and Nuengwong Tuaycharoen
253
16:20 16:40
NCCIT2015-25
Speech-based Thai Text Retrieval

Paphonput Sopon, Jantima Polpinij and Thongparn Suksamer
259
16:40 17:00
17:00 17:20
xviii
NCCIT2015

Time
Title/Author
Page
13:00 13:20
NCCIT2015-30
Web-based Call Center System using Voice over Internet Technology

Thanawat Chalermpong and Tanun Jaruvitayakovit
265
13:20 13:40
NCCIT2015-31
Applying the Multiple Linear Regression for Forecasting the

Inventory on Web Applications
Kangkit Warayanon, Jongkol Janruang and Wasin Treesinthuros
271
13:40 14:00
NCCIT2015-32
The Effectiveness Evaluation of Banner Advertising's Positions on

Mobile Application
Banyapon Poolsawas
277
14:00 14:20
NCCIT2015-33
A Decision Support System Applying with Ant System Algorithm

for Finding Optimal Path Case Study : Roads in Pattani Province
Taweep Janjaroen, Onjira Sitthisak and Anisara Pensuk Tibkaew
283
14:20 14:40
NCCIT2015-36
Using Semantic Approach for Developing Learning Object

Knowledge Base
Konjanat Jantawong and Noppamas Pukkhem
289
14:40 15:00
Coffee Break
15:00 15:20
NCCIT2015-44
Guideline for the Application of Database Performance Tuning

Method: A Case Study of Banking Customer Information System
Tulanun Jiangpradit and Nakornthip Prompoon
295
15:20 15:40
NCCIT2015-46
A Development of Technical Cooperation Learning Team Games

Tournament Activities (TGT) in the Course of the Information
Systems Analysis and Design. For a Third Year Student of
Computer and Information Technology. Nakorn Pathom Rajaphat
Universit
Charinthorn Aumgri
301
15:40 16:00
NCCIT2015-49
Automatic Semantic Annotation for the Official Minute

Bukhoree Sahoh and Siraya Sitthisarn
307
16:00 16:20
NCCIT2015-50
A Study of Usage Behavior of Knowledge Retrieval Function of a

Large Scale Knowledge Management System on WWW : A Case
Study of pantip.com
Nittaya Kamban and Worasit Choochaiwattana
314
16:20 16:40
NCCIT2015-57
An Application of cuckoo search algorithm for Decision Support

System of Selection the items Quality
Mana Sopa, Kanisorn Jeekratok and Nipon Sungsuthi
320
16:40 17:00
17:00 17:20
xix
Friday 3rd July 2015

08:00 09:00
Registration
09:00 12:00
Paper Presentation
12:00 13:00
Lunch
13:00 17:00
Paper Presentation
xx
NCCIT2015
NCCIT2015

Time
Title/Author
Page
09:00 09:20
NCCIT2015-87
Development of Computer Program based on Graphical User

Interface (GUI) of SCILAB in Discrete Fourier Transform for
Under Graduate Student
Kitti Surpare and Meechai Lohakan
326
09:20 09:40
NCCIT2015-88
A Recommendation System for Choosing Cultivars of the Para

Rubber Tree for Eastern Region of Thailand using Decision Table
Suteera Puengsawad, Pongsakon Bamrungthai and Naruemon Mi-Iam
332
09:40 10:00
NCCIT2015-124
Sentiment Analysis for Hotel Services from Reviews in Both Thai

and English Language
Ujchara Pooraya and Maleerat Sodanil
339
10:00 10:20
NCCIT2015-129
Clinical Support System of Aortic Aneurysm using Data Mining:

Case Study of Endovascular surgery
Nopparat Pojjiraporn, Jeerasak Nampradit and Sakchai Tangwannawit
346
10:20 10:40
Coffee Break
10:40 11:00
NCCIT2015-135
Associations Rule Mining By Using Top Weight of Complete

Symmetric Digraphs
Pramool Suksakaophong and Phayung Meesad
352
11:00 11:20
NCCIT2015-138
Loan Rejection Clustering using Text Mining Technique

Somsak Wichaikit and Maleerat Sodanil
359
11:20 11:40
NCCIT2015-146
The Recommender System for Adaptive Learning Based on

Students Competency Profile by Using FP-Growth Techniques
Uraiwan Inyaem
364
11:40 12:00
NCCIT2015-148
Online Message Ownership Identification using Nave Bayes

Learning
Nitipat Petmongkonjaras and Tanasanee Phienthrakul
371
12:00 13:00
Lunch
xxi
NCCIT2015

Time
Title/Author
Page
13:00 13:20
NCCIT2015-158
A Modification of Multi-Objective Optimization Genetic Algorithm

with Initial Population Partition
Prudtipomg Pengsiri, Sunantha Sodsee and Phayung Meesad
377
13:20 13:40
NCCIT2015-167
A Comparative Study on Tolerance of Thai / Laos Characters

Sasakorn Pichetjamroen and Pakorn Watanachaturaporn
384
13:40 14:00
NCCIT2015-173
Imputation-Boosted Collaborative Filtering Algorithm based on

User Preference Information and Matrix Factorization
Jakkarin Suksawatchon and Ureerat Suksawatchon
390
14:00 14:20
NCCIT2015-182
Electronic Document Analysis System for Educational Quality

Assurance
Ponparn Posrikaew and Thippaya Chintakovid
398
14:20 14:40
Coffee Break
xxii
NCCIT2015

Time
Title/Author
Page
09:00 09:20
NCCIT2015-58
Necessary Skills for Scrums Development Team Members

Penprapa Bootla, Olarn Rojanapornpun and Pornchai Mongkolnam
404
09:20 09:40
NCCIT2015-61
The Development of E-Learning by a new TGT Cooperative

Learning Techniques, based on Blooms Taxonomy
Somkuan Faisanoi, Jongkol Janruang and Sanun Karnka
412
09:40 10:00
NCCIT2015-63
Thai Optical Character Recognition (OCR) Enhancement using

TF-IDF and Text position differences
Phornsiri Phawapoothayanchai and Kraisak Kesorn
418
10:00 10:20
NCCIT2015-67
Decision Support System for Economic Crops using Hybrid

Approaches
Pansakorn Worawimolwanich and Kraisak Kesorn
425
10:20 10:40
Coffee Break
10:40 11:00
NCCIT2015-68
Development of E-learning for The Internet and Applications

based on Adaptive Learning Techniques
Sirinthorn Watcharaphuetphol, Jongkol Janruang and Sanun Karnka
432
11:00 11:20
NCCIT2015-69
Information System for Teachers Using Service Blueprint

Sithipong Chimthai
438
11:20 11:40
NCCIT2015-71
Monitoring Application System for Child Development

Salintip Sudsanguan and Jeerasak Numpradit
444
11:40 12:00
NCCIT2015-75
Development of a Monitoring and Tracking System for Handheld

Devices in the Work Place Using RFID Technology
Waranya Prachanban and Montean Rattanasiriwongwut
450
12:00 13:00
Lunch
xxiii
NCCIT2015

Time
Title/Author
Page
13:00 13:20
NCCIT2015-76
Knowledge Management System of Internal Organization

Information System Using Case-Based Reasoning
Linda Sobin and Maleerat Sodanil
456
13:20 13:40
NCCIT2015-77
Conceptual Framework Adaptive Learning Using Web-based

Instruction for Working Memory with Learning Disabilities
Siwaporn Klabpadung and Watcharawalee Tangkuptanon
462
13:40 14:00
NCCIT2015-78
Apply Online-Based Learning Media to Enhance Learning

Achievement in English for Computer Science Aubject of
Kanchanaburi Rajabhat University Students
Nilubon Tongchai
469
14:00 14:20
NCCIT2015-79
Development of the Management System and Support the

Students Project in General Education Courses
Patcharida Wisaiket and Maleerat Sodanil
475
14:20 14:40
Coffee Break
xxiv
NCCIT2015

Room 3: Human Computer Interaction and Image Processing
Time
Title/Author
Page
09:00 09:20
NCCIT2015-123
Design Guidelines for Creating Content on Web Sites for Elderly

Users
Nathakarn Boonrod and Thippaya Chintakovid
481
09:20 09:40
NCCIT2015-151
CCTV Image Enhancement using Sub-Image Homomorphic

Filtering
Chalermpong Intarat and Maleerat Sodanil
487
09:40 10:00
NCCIT2015-164
An Algorithm for Hymocytometer Cell Counting based on Image

Processing Technique with DBSCAN
Dechawut Wanichsan, Nitat Ninchawee, Taweesak Rattanakom and
Phannika Kongjuk
493
10:00 10:20
NCCIT2015-175
Interactive Media Design for Encourage Garbage Management

Julaluk Watthananon
499
10:20 10:40
Coffee Break
10:40 11:00
NCCIT2015-166
A Framework for Classification of Severity Levels and

Prioritization of Software Defects
Noppasorn Wiriyadilok and Twittie Senivongse
505
11:00 11:20
NCCIT2015-169
The Behavior and Attitude of Internship Student on Collaborative

Learning Management via Social Network: Facebook
Phongthanat Sae-Joo
511
11:20 11:40
NCCIT2015-176
A Comparative Study of Power Usage of Smart Phone

Boonsiri Masan, Pongpisit Wuttidittachotti and Therdpong Daengsi
517
11:40 12:00
NCCIT2015-178
A Prosody Verification and Klon Sakkana Using of Karp Word

Positions and Rule-Based Tednique
Pudsadee Boonrawd
523
12:00 13:00
Lunch
xxv
NCCIT2015

Time
Title/Author
Page
13:00 13:20
NCCIT2015-181
Odor Detection System and Tracking Application on Smartphone

Mongkol Seemawong and Nawaporn Wisitpongphan
529
13:20 13:40
NCCIT2015-183
An Analysis of Knowledge Management Situation Pursue

Learning Institutes Based on Quality Assurance Concept for
Universities in Thailand
Jeerawan Nokeangthong, Prasong Praneetpolgrang and Nivet
Chirawichitchai
535
13:40 14:00
NCCIT2015-184
An Empirical Investigation and Analysis on the ICT HR

Competency in the Government Sector to support Digital Economy
Kriengkrai Bhuvanij, Prasong Praneetpolgrang and Kulthon Kasemsan
541
14:00 14:20
NCCIT2015-186
Application of CAN Bus in Locker Control System

Thatwatchai Sarawong, Rud Wangrungarun and Siriporn Imporn
547
14:20 14:40
Coffee Break
xxvi
NCCIT2015

Time
Title/Author
Page
09:00 09:20
NCCIT2015-29
Development of a Sound System and Detection Safety Tests in the

Obstacle-Warning Glasses for the Visually Impaired
Upady Hatthasin, Nattawat Payarach and Chanarong Tamasena
553
09:20 09:40
NCCIT2015-80
Following up on Application of eDLTV media used in learning/

teaching in the Small Network Schools of Rajabhat Maha
Sarakham University
Apichat Lagdee, Somjet Poosri and Worapapha Arreerard
559
09:40 10:00
NCCIT2015-84
Quality Information Technology for Community Services

Sukuma Uamcharoen
564
10:00 10:20
NCCIT2015-85
Mobile Application Development of Oral Health Care for Preschoolers

Pornpimol Chaisanguan and Maleerat Sodanil
571
10:20 10:40
Coffee Break
10:40 11:00
NCCIT2015-90
An Application of ITIL to Cloud Service Provision

Theerasak Nitlarp and Twittie Senivongse
577
11:00 11:20
NCCIT2015-91
The Prototype System of Automatic Database Construction based

on Rules for the Thai Official Documents
Usanad Ua-Apisitwong
583
11:20 11:40
NCCIT2015-98
The Preliminary Study of Applying Specification by Example to

Scrum
Nuttaluck Boonluecha and Olarn Rojanapornpun
589
11:40 12:00
NCCIT2015-104
E-Learning Development Model to Increase Student Achievement in

High School by using Problem based on Local Knowledge with a
Variety of Online Media
Paisan Simalaotao and Ubonrat Sirisukpoca
596
12:00 13:00
Lunch
xxvii
NCCIT2015

Time
Title/Author
Page
13:00 13:20
NCCIT2015-106
Cloud Service Selection Framework Based on Service Measurement

Index Model
Songkran Totiya and Twittie Senivongse
602
13:20 13:40
NCCIT2015-112
Application of Case-Based Reasoning an Online Helpdesk System

for Website of Suan Sunandha Rajabhat University
Sutasinee Yokradubshan and Mahasak Ketcham
608
13:40 14:00
NCCIT2015-121
The Hybrid Information Systems for Monitoring the Vehicle

Quality Repair by Multi-Dimensional Analysis and Toyota Way
Patcharapol Norasarn and Nattavee Utakrit
614
14:00 14:20
NCCIT2015-131
Process Definition and Support Tool Development for Project

Planning Process based on ISO/IEC12207 and ISO/IEC15504
Premyupha Armonsak and Nakornthip Prompoon
621
14:20 14:40
Coffee Break
xxviii
NCCIT2015

Time
Title/Author
Page
09:00 09:20
NCCIT2015-133
Sea Floor Model Visualization for Barge Selection, Krabi Power

plant
Nuttanan Pipitpattanaprap and Sakchai Tangwannawit
630
09:20 09:40
NCCIT2015-136
The guidelines for Test Cases and Scenarios by Analysis Matrix

Taksaporn Phanjhan and Sakchai Tangwannawit
636
09:40 10:00
NCCIT2015-139
An Algorithm for Handwriting Exercise in Thai Alphabet on the

Use of Tablet PC
Dechawut Wanichsan, Taweesak Rattanakom, Nitat Ninchawee and
Phannika Kongjuk
642
10:00 10:20
NCCIT2015-143
Analysis of Fiber to the Home Network Based on ITU Standards

with Outside Plant
Tanaporn Jesadamethakajorn and Pudsadee Boonrawd
649
10:20 10:40
Coffee Break
10:40 11:00
NCCIT2015-145
Transformation Algorithm from BPMN Diagram to Sequence

Diagram by Metadata Model and Rule-Based
Shavan Tansap and Pudsadee Boonrawd
656
11:00 11:20
NCCIT2015-147
Time Train Tracking System Automatic and Real-Time of GPS

Based on Mobile Case Study for State Railway of Thailand
Phongphodsawat Sangthong and Pongpisit Wuttidittachotti
662
11:20 11:40
NCCIT2015-154
Adopting a TurnKey Solution Model to Manage Survey System

Online
Surakiat Rattanarod and Nattavee Utakrit
668
11:40 12:00
NCCIT2015-155
Durable Articles Management System on Android Phone by Using

QR code Technology
Jutarat Thochai and Nattavee Utakrit
674
12:00 13:00
Lunch
xxix
NCCIT2015

Time
Title/Author
Page
13:00 13:20
NCCIT2015-156
Building Prevention Maintenance System

Korapat Siriwan and Nattavee Utakrit
680
13:20 13:40
NCCIT2015-157
Development a Rice Knowledge Management System In Thailand

Thiptep Manpholsri and Montean Rattanasiriwongwut
685
13:40 14:00
NCCIT2015-159
Management Information System for Monitoring the Accrued

Income by Customer Relationship Management Technique
Ratchada Khantong, Montean Rattanasiriwongwut and Maleerat
Sodanil
691
14:00 14:20
NCCIT2015-163
The Development of the Model of Cooperative Learning Activities of

Flipped Classroom by using eDLTV Media
Sommai Kaewkanha, Worapapha Arreerard and Tharach Arreerard
697
14:20 14:40
Coffee Break
xxx
NCCIT2015
KEYNOTE SPEAKERS
Prof. Dr. Nicolai Petkov
University of Groningen, The Netherlands
About the Speaker:

Nicolai Petkov is professor of computer science at the University of Groningen since 1991. In
the period 1998-2009 he was scientific director of the Institute for Mathematics and Computer
Science. He works in the field of brain-inspired visual pattern recognition.
Topic: Brain-inspired pattern recognition

Abstract
Insights into the function of the brain can provide clues for designing effective computer
algorithms for pattern recognition. This thesis is illustrated by the design of feature detectors
that are inspired by the properties of shape-selective neurons in area V4 of visual cortex. Such
a filter is trainable as it is configured by the automatic analysis of a feature specified by a user.
Subsequently, it can detect features that are similar to the training feature. By means of training
multiple such filters for different features of an object, we design effective feature vector
representation of that object that is analogous to population coding in the brain. This approach
shares two important aspects with pattern recognition by the brain: the ability to learn and deal
with variability. It is illustrated by the detection of vascular bifurcations in medical images,
traffic sign recognition in complex scenes, optical character recognition, word spotting, object
recognition in a domestic environment and the automatic motif and repetition detection in
music.
xxxi
NCCIT2015
Assoc. Prof. Andrew Woodward

Head of the School of Computer and Security Science
About the Speaker:

Assoc. Prof. Andrew Woodward is the Head of the School of Computer and Security Science
at Edith Cowan University in Perth, Western Australia. Andrew has been an active researcher
in cyber security for over a decade, and has published over 50 papers in cyber security, as well
as receiving many grants. Andrew has been asked to contribute to the Australian Governments
cyber security strategy, and is regularly invited to speak to industry on cyber security. Andrew
consults to industry on cyber security, and has conducted cyber security vulnerability
assessments on many organisations, mostly involving critical infrastructure providers.
Topic: An uncomfortable change: shifting perceptions to establish pragmatic cyber

security
Abstract
We are approaching a rapidly uncontrollable cyber space environment, one in which traditional
boundaries no longer apply. The challenges that a lack of conventionally conceptualised
borders create are increasing in scale and form. This position paper evaluates the myriad of
reasons for this situation. Such factors include the absence of cyber security standards, a
piecemeal industry approach to education with certification substituted for education, assigning
organisational protection to a workforce with minimal skills in cyber security, and a solutions
space that has an excessive focus on technological control. Subsequent discussion identifies
the drivers for necessary change to meet the increasing intelligent and diverse threats. With
cyber security a specialist field, and not a mere extension of network and information security,
it requires a collective proactive approach for practical cyber security incorporating
technology, government support, policy and education. This will inevitably require a paradigm
shift. The drivers for such paradigm change will be the recognition of an unbounded
environment together with the advance of intelligent threats. The result is a possible reversal
xxxii
NCCIT2015
of currently accepted perceptions, where organisations will be the lesser influential party. This
will also demand acceptance of a shift in power and influence as nation states, crime and
hacktivist groups with high levels of motivation, attempt to control and exploit cyber space.
The impact of this discourse will be in opening up new conversations and perspectives on the
conflict space of the future, and how there is a need to shift conceptual understanding if
pragmatic cyber security is to be achieved.
xxxiii
NCCIT2015

Automatic Feeling Analysis from Opinion Text
(Chetarin Wongsin)1 (Nattakit Srikarnjanaperd)2
(Jantima Polpinij)3
(Intellect Laboratory)
1
chetarin.1995@gmail.com, 2armong.ton@icloud.com, 3jantima.p@msu.ac.th
based on text content. This is because the proposed method

returns the satisfactory accuracy.
Keyword: Sentiment Analysis, Text Classification, Nave
Bayes.

2

:
1.
(Sentiment
Analysis) [1-5]
(Natural Language
Processing)
(Opinion) (Text)

(Positive Good)
(Negative Bad) [1-5]

e-Tourism

Abstract
This paper presents a method of sentiment analysis to analyse
the visitors feeling after visiting the Tourist attraction in the
Northeastern, Thailand. The objective of this work is to
analyse the visitors feeling that are represented by text on a
social media into two classes: positive and negative feeling.
This work implements the model of sentiment analysis based
on the Nave Bayes text classification. After testing by
F-measure, it could be demonstrated that the proposed
method can provide more effectiveness for sentiment analysis

Social Media

NCCIT2015

[5]

[1-5]

commercial website Customer
2. (Sentiment Analysis)
Relationship Management (CRM)
(Sentiment Analysis) [1-5]
[5]
(Natural Language Processing: NLP)

(Opinion)
3. (Research Methodology)
(Text)

( 1)

1
2
(1) (2)
3.1 (Sentiment
Classifier Modelling)

1: (Document Preprocessing)
(Tokenization)
[8, 9]

(Dictionary approach) [8]
(Longest
matching Algorithm) [10]
//

(Positive Good)
(Negative Bad)

(Product Review) [1-5]

Rating

1
4 5

Blog,
Twitter Facebook [6, 7]

NCCIT2015
1:
( Stop words) [8, 9]

Vector Space Model (VSM) Bag of Words (BOW) [9]

BOW
Wij j
dj = (w11, w12, w13, , wij)
2

tf-idf (Term
Frequency Inverted Document Frequency) [9, 11]
2: (Document Representation)
(Document Representation) [9]

[9]

(frequency)

2
2: BOW
tf-idf
tf
idf

idf = 1+ log(N/df)
(1)
N df

tf-idf = tf x idf
(2)
P(a1 , a2 ,..., an | v j ) i 1 P(ai | v j )
tf-idf

[11]

1
D1
0.602
0.602
0
0.301
0
0
0
0
D2
0
0
0.301
0.301
0
0
0
0
D3
0
0
0
0
0.602
0.602
0.602
0.301
(3)
P(ai | vj) i j
1, 2, 3, , n

(1)
P(a1,a2,,an | vj )
P( vj ) VNB
(2)

(4)
V arg max P(v ) P(a |v )
1:
NCCIT2015
D4
0
0
0
0.301
0
0
0
0.301
NB
i 1

2 (Positive)
(Negative)
2
3:
Nave Bayes
(Nave Bayes) [12]

(Instance) x

<a1, a2 ... an>
V V

(Text Classification)

Vj
n X = {a1,a2,an}
P(a1,a2,an)
2: Nave Bayes
Class = Positive
P(Class = Positive)
P() x tf-idf
P() x tf-idf
P() x tf-idf
P() x tf-idf
Class = Negative
P(Class = Negative)
P() x tf-idf
P() x tf-idf
P() x tf-idf
P() x tf-idf
P() x tf-idf
0.5
0.602
0.602
0.1505
0.602
0.5
0.1505
0.1505
0.1505
0.602
0.602
3.2
(Sentiment Model Usage)

Positive
Negative

DNEW :

4.1 (Dataset)

Social Media Facebook 480
text file
4.2 (Experimental Results)

(Recall: R)
[9] (Precision: P) [9]
F-measure [9]

120

60, 80, 100
3
4

0.883
3:
Document
/ / / /
NCCIT2015

1 2
(4)
(4)
Class Class P(Class) = 0.5
Class Positive Negative
Class = Positive
VNEW = P(+) x P(|+) x P(|+)
= (0.5) x (0.602) x (0.1505) = 0.0453005
Class = Negative
VNEW = P(-) x P(|+) x P(|+)
= (0.5) x (0) x (0.1505) = 0
DNEW
Class = Positive Class =
Negative DNEW
Positive
4:
30 /
40 /
50 /
R
0.86
0.87
0.89
0.873
P
0.88
0.89
0.91
0.89
F-measure
0.869
0.879
0.899
0.883

Social Media

4. (Model Evaluation)

[2]
NCCIT2015
J.S. Modha, H. G. S. Pandi, S.J. Modha, Automatic

Sentiment Analysis for Unstructured Data, International
Journal of Advanced Research in Computer Science and
Software Engineering, Vol. 3, Issue 12, 2013.
[3]
S. Modak, A.C. Mondal, A Study on Sentiment

Analysis, International Journal of Advanced Research in
5. (Conclusion)
Computer Science &Technology, Vol. 2, Issue 2, 2014.

Social Media
2
(Positive)
(Negative) Nave Bayes

F-measure

F-measure 0.883

Social Media

[4]
Mining: Sentiment analysis on news classification, The

8th Iberian Conference on Information Systems and
Technologies (CISTI), 2013.
[5]
J. Polpinij and A.K. Ghose, An Ontology-Based

Sentiment
Classification
Consumer
Reviews,
Methodology
Proceedings
of
for
the
Online
2008
IEEE/WIC/ACM International Conference on Web

Intelligence and Intelligent Agent Technology, pp. 518 524, 2008.
[6]
K. A.C.E.S Lima and L.N. de Castro, Automatic

sentiment
analysis
of
Twitter
messages,
Fourth
International Conference on Computational Aspects of

Social Networks, 2012.
[7]
P L. Jiang, M. Yu, M. Zhou, X. Liu, T. Zhao, Targetdependent Twitter sentiment classification, Proceeding
HLT '11 Proceedings of the 49th Annual Meeting of the
Association for Computational Linguistics: Human
Language Technologies, 2011.
[8]
R. Dale, H. Moisl, H. Somers (Editor), Handbook of

Natural Language Processing, Marcel Dekker, Inc. NY.,
2000.
[9]
R. Baeza-Yates & B. Ribeiro-Neto, Modern Information

Retrieval, Addison Wesley, 1997.
[10] S. Meknavin, P. Charoenpornsawat, and B. Kijsirikul,

Feature-Based Thai Word Segmentation Proc. of
NLPRS 97, pp. 289296, 1997.
[11] N. Pascal Soucy, Guy W. Mineau, Beyond TFIDF
Weighting for Text Categorization in the Vector Space
Model, IJCAI'05 Proceedings of the 19th international
joint conference on Artificial intelligence, Morgan
Kaufmann Publishers Inc. San Francisco, CA, USA 2005.
[1]
H. Gomes, M. de Castro Neto, R. Henriques, R., Text
[12] E. Frank and R.R. Bouckaert, Naive bayes for text

classification with unbalanced classes, Proceedings of
B. Pang and L. Lee, Opinion Mining and Sentiment
the 10th European conference on Principle and Practice of
Analysis, Foundations and Trends in Information
Knowledge Discovery in Databases, 2006.
Retrieval Vol. 2, Nos. 12 (2008) PP: 1135.
NCCIT2015
Significant Matrix II
Eliminating the Noise Feature with Significant Matrix II Algorithm
(Ekapong Chuasuwan)

comcung@gmail.com
dataset will be processed by Significant Matrix II

Algorithm for Data Mining work. The highlights of the



43.45

94.76

17
:
significant matrix II are the speed and less complexity in

working. The experimental results of proposed method
can eliminate noise feature from experiment dataset. The
new dataset obtained from proposed method is less
number of features than the original dataset at 43.45%.
And the new dataset is also enhancing the average
accuracy of classification of neural network at 94.76%.
The proposed method can reduce a number of
experimental datasets, which can reduce the average
used time in neural networks at 17%.
Keywords: Eliminate Noise Feature, Noise in Data,
Significant Matrix II, Data Reduction.
1.
( Data Pre-Processing)

[1]

Abstract
This paper presents as an Elimination Noise Feature
in Data Pre-Processing for Data Mining with Significant
Matrix II Algorithm. The main purpose is to create an
algorithm, which can eliminate the noise feature. The
noise feature is a cause of a class error of the dataset in
data mining work. After eliminate noise features, the

(Noise Data)[2]

(Noise
Feature)

SignificantMatrix2 (Dataset DataTmp)

1.
For i=0 to Feature amount of dataset
2.
If total record of dataset equal 0 then return FeaList
3.
Else if i = Feature amount then return FeaList
4.
Else
5.
Foreach feature of DataTmp
6.
Create variable CountZero and MaxCountZero. Set
value 0 in both variables
7.
Count the number of data types that match each
class.
8.
If the data type does not match the class, set the
CountZero + 1
9.
Select the maximum from CountZero of each data
type, set maximum value to MaxCountZero of each
attribute
10. If MaxCountZero not equal Nc 1 then calculate
Information Gain for that feature.
11. End for
12. Select feature with the maximum of MaxCountZero
(or maximum Information Gain value in
MaxCountZero not equal Nc - 1), set to FeaList
13. If MaxCountZero equal Nc 1 then
14. Delete row of data that match the data type of
CountZero in that attribute and drop this feature
15. Else
CountZero in that attribute
17. End for
2.
2.1 Significant Matrix II [3-4]
Significant matrix II

Significant
Matrix [3] Significant Matrix

Example Dataset
Feature I
A
B
B
A
C
A
2: Significant Matrix II Algorithm

2
Count Zero (CZ)

2.2 (Noise Data)

[5-6]

Class
Class
1
1
2
0
0
1
A
B
C
0
1
0
1
1
2
1
0
2
0
1
0
NCCIT2015
CZ
1
1
2
Significant Matrix
Categorical Data
1: Significant
Matrix
1 Significant Matrix
Significant Matrix Table

NCCIT2015

(Data Clustering)

3.
3.1
3: Noise Data
4

FeaDrop

FeaDrop

3

2.3 (Data Mining) [7]

(Learning Machine) (Pattern
Recognition)
(Knowledge
Discovery in Database : KDD)

3
- (Association Rule)

- (Data Classification)

Start
Import dataset
Create new dataset form

FeaDrop
Return New Dataset
End
4: Work Proposed Flowchart
NCCIT2015

(Function GetListNoiseFeatureBySMII())
Significant Matric II

3.2 Proposed Algorithm


FeaDrop
5
CreateNewDataset(Dataset Dataset)
1. Copy Dataset to DataTmp.
2. FeaDrop = GetListNoiseFeatureBySMII(DataTmp)
3. Foreach feature list of FeaDrop
4. Drop feature of DataTmp as feature list of FeaDrop
5. End for
6. Return DataTmp
3.3
GetListNoiseFeatureBySMII (Dataset DataTmp)

1. FeaDrop = All feature list name of DataTmp
2. For i=0 to Feature amount of dataset
3. If total record of dataset equal 0 then return
FeaDrop
4. Else if i = Feature amount then return FeaDrop
5. Else
6. Foreach feature of DataTmp
7. Create variable CountZero and MaxCountZero. Set
value 0 in both variables
8. Count the number of data types that match each
class.
9. If the data type does not match the class, set the
CountZero + 1
10. Select the maximum from CountZero of each data
type, set maximum value to MaxCountZero of each
attribute
11. If MaxCountZero not equal Nc 1 then calculate
Information Gain for that feature.
12. End for
13. Select feature with the maximum of MaxCountZero
(or maximum Information Gain value in
MaxCountZero not equal Nc - 1), Eliminate
selected feature in FeaDrop.
14. If MaxCountZero equal Nc 1 then
CountZero in that attribute and drop this feature
16. Else
CountZero in that attribute
18. End for

UCI Machine Learning Repository [8]

11

1
1:
Dataset
Site
Feature
Pittsburgh Bridges
(Bridge)
108
13
Credit Approval (CRX)
690
15
Molecular Biology
(DNA)
106
58
Categorical
Heart Disease (Heart)
270
13
Integer, Real
Hepatitis
155
19
Categorical,
Integer, Real
Ionosphere
351
34
Integer, Real
Liver Disorders (Liver)
345
Categorical,
Integer, Real
208
60
Real
435
16
Categorical
Wine
178
13
Integer, Real
Zoo
101
16
Categorical,
Integer
Connectionist Bench
(Sonar)
Congressional Voting
Records (Vote)
5: Proposed Algorithm

(Function
CreateNewDataset())

(DataTmp)
Feature Type
Categorical,
Integer
Categorical,
Integer, Real
Class
6
2

(Missing Value)
(Integer)
(Real)
(Categorical)
(Normalization)
10

5 (Likert
Technique)
5
, , , [9]
43.45
4.2

3
3:
4.

Microsoft Windows 7 64 Bit
(RAM) 16GB
(CPU) 2.10 GHz i7
4.1

2
2:
Number feature of
original dataset
Number feature
of proposed work
13
15
58
14
13
Hepatitis
19
13
Ionosphere
34
14
Dataset
Pittsburgh Bridges
(Bridge)
Credit Approval
(CRX)
Molecular Biology
(DNA)
Liver Disorders
(Liver)
Connectionist Bench
(Sonar)
Congressional Voting
Records (Vote)
60
30
16
Wine
13
Zoo
16
NCCIT2015

Original
Dataset
Proposed
work
Pittsburgh Bridges (Bridge)
63.0%
87.1%
87.7%
93.0%
Molecular Biology (DNA)
90.0%
100.0%
86.7%
94.1%
Hepatitis
84.7%
100.0%
Ionosphere
94.3%
98.3%
72.9%
72.9%
Connectionist Bench (Sonar)
83.0%
100.0%
Congressional Voting Records (Vote)
96.1%
99.0%
Wine
97.1%
100.0%
Zoo
96.0%
98.0%
86.50%
94.76%
Dataset
Summarize

44
14
58
75.86

3

10
4
100 Molecular Biology (DNA), Hepatitis,
Connectionist Bench (Sonar) wine
11
4.3
43.450

94.76

17

4.2

4
4:

Time (Milliseconds)
Dataset
Original
Dataset
Proposed
work
Pittsburgh Bridges (Bridge)
90
90
140
120
140
90
250
230
Hepatitis
250
220
Ionosphere
280
220
290
290
Connectionist Bench (Sonar)
500
400
Congressional Voting Records (Vote)
170
140
Wine
90
70
Zoo
70
50
210
170
Average
NCCIT2015

[1]
[2]
[3]
[4]
4

36

17
[5]
[6]
[7]
7.
[8]


[9]
12
Pyle, Dorian. Data preparation for data mining. Vol. 1.

Morgan Kaufmann, 1999.
Steeneken, Herman JM, and Frank WM Geurtsen.
"Description of the RSG-10 noise database." report IZF 3
(1988): 1988.
Chuasuwan, Ekapong. "The Significant Matrix without
Genetic Algorithm for the feature selection (Significant
Matrix 2)." Information and Communication Technology,
Electronic and Electrical Engineering (JICTEE), 2014 4th
Joint International Conference on. IEEE, 2014.
Chuasuwan, Ekapong, and Narissara Eiamkanitchat. "The
feature selection for classification by applying the
Significant Matrix with SPEA2." Computer Science and
Engineering Conference (ICSEC), 2013 International.
IEEE, 2013.
Wu, Zhaohua, and Norden E. Huang. "Ensemble
empirical mode decomposition: a noise-assisted data
analysis method." Advances in adaptive data analysis 1.01
(2009): 1-41.
Sloan, Robert. "Types of noise in data for concept
learning." (1988): 91-96.
Tan, Pang-Ning, Michael Steinbach, and Vipin Kumar.
Introduction to data mining. Vol. 1. Boston: Pearson
Addison Wesley, 2006.
Lichman, M. (2013). UCI Machine Learning Repository
[http://archive.ics.uci.edu/ml]. Irvine, CA: University of
California, School of Information and Computer Science.
Likert, R. (1932). A technique for the measurement of
attitudes. Archives of psychology.
NCCIT2015

An Improved Differential Evolution Algorithm with Crossover Strategy
for Continuous Optimization Problems
(Duangjai Jitkongchuen)

duangjai.jit@dpu.ac.th
1.

DE JDE

8 9
:

( Continuous
optimization problems)

(Linear programming, LP),
( Nonlinear programming, NLP)

(DE)

(GA)
(DE)
Storn Price [1]

3 (GA)
(Mutation),
(Crossover) (Selection)
DE
3
(F),
(CR) (NP)
DE

[2]
DE
Abstract
This paper proposes a method to improve the
differential evolution algorithm for the continuous
optimization problems. In the proposed algorithm, the
mutation parameter is gradually self-adapted according
to the evolutionary search. Also, the krill herd algorithm
is applied to the crossover operation. The proposed
algorithm is compared with the traditional DE algorithm
and JDE. The experimental results showed that the
proposed algorithm was able to obtain the optimal
solution in eight of nine benchmark problems.
Keyword: Differential Evolution, Optimization Problem,
Self-adaptive Parameter.
13
NCCIT2015
0 1 rd
1 N

(Fitness value)

(Krill head algorithm) [3]
DE

2.
DE
(Initial population)

( Uniform probability
distribution)
U G ; if f ( U iG ) (X iG )
X iG +1 = iG
X i ; else
(3)
(T a r g e t v e c t o r s ) X iG = ( x 1,i , x 2,i , ..., x j,i , ..., x N ,i )
3.
i = 1, 2, ..., NP NP , N
G

(Mutant vectors)
ViG = ( v1,i , v 2,i , ..., v j,i , ..., v N ,i )
DE/rand/1 (1)
ViG = X Gr1 + F(X Gr2 X Gr3 )
DE/rand/1 F

F
(Self-adaptive)
F
(Local optimum)
(1)
X Gr , X Gr , X Gr
, F

0 2

(Trial vectors) U iG = (u1,i , u 2,i , ..., u j,i , ..., u N,i )

1
v j,i ;
u j,i =
x j,i ;
if (rand CR ) or ( j = rd)
else
F G +1 = F G + (F G C)
(4)
C 0 1
(Vi )

Stud
DE (stud j ) Stud DE
(Vi)
(2)
NP
stud j = v j,i , min[ f (Vi )]
(5)
; if (rand CR ) or ( j = rd)
; else
(6)
i =1
rand 0 1,
CR
v j,i
v j,i =
stud j
14

(Vi) (Vi )
(Vi)
(Vi)
ibest = K
i ,best Vi ,best
(Vi)

3 (1)

(Motion induced by its neighbors) (2)
(Foraging motion) (3)
(Random diffusion)

(Local search)
(U iG )
(7)
iter
C food = 2 1
itermax
NP
i =1
Ki
(7)
4.
(12)
Vl Vi
Vl Vi +
(13)

(Benchmark functions) [4]
9
1 1 5
(Continuous unimodal
6
functions)
(Discontinuous step function) 7
Noisy quartic function 8
9 Multimodal functions
2
(8)
( food
j,i )
( best
j,i )
ifood = C food K
i ,food Vi ,food
(11)
iter , itermax
, f best
f worst

(Fitness value)

NP
X food =
= f (Vi ) f (Vl )
K
i ,l
f worst f best
=
V
i ,l
food
best
j,i
j,i

(X food )
(Center of mass)
1
Vi
i =1 K
(10)
C food

C food , K i,l , Vi,l
( U iG )
best
u j,i = ( food
j,i + j,i ) v j,i
NCCIT2015
(9)
15
NCCIT2015
1: (Benchmark functions)
Functions
f min
30
[-100,100]
30
[-10,10]
30
[-100,100]
30
[-100,100]
30
[-30,30]
30
[-100,100]
30
[-1.28,1,28]
30
[-500,500]
-12,569.5
30
[-5.12,5.12]
f1 ( x ) = x i2
i =1
D
i =1
i =1
f 2 (x) = x i + x i
D i
f3 (x) = x j
i =1 j =1
f 4 ( x ) = max i
f 5 (x) =
{ x i , 1 i D}
100 ( x i+1 x i2 )
D 1
i =1
+ (x i 1) 2
f 6 ( x ) = ( x i + 0.5 ) 2
i =1
D
f 7 ( x ) = ix i4 + random[ 0, 1)
i =1
D
f 8 ( x ) = x i sin
i =1
D
x i
f 9 ( x ) = x i2 10 cos(2x i ) + 10
i =1
2:
Mutation parameter (F)
0.5
Crossover parameter (CR)
0.9
Population size
100
DE
DE 4

(Local search)
Function f1, f6
1500
Function f2
2000
Function f7
3000
Function f3, f4, f9
5000
Function f8
9000
Function f5
20000
5.

(Self-adaptive)

DE JDE

8 9
DE
JDE [5] 3
f1 , f 2 , f 3 , f 7

f 4 , f 5 , f 6
f 8 , f 9 JDE
16
NCCIT2015
3: DE JDE
Functions
DE
JDE
f1
8.2E-14 (5.9E-14)
1.1E-28 (1.0E-28)
0 (0)
f2
1.5E-9 (9.9E-10)
1.0E-23 (9.7E-27)
0 (0)
f3
6.8E-11 (7.4E-11)
3.1E-14 (5.9E-14)
0 (0)
f4
0 (0)
0 (0)
0 (0)
f5
0 (0)
0 (0)
0 (0)
f6
0 (0)
0 (0)
0 (0)
f7
4.63E-3 (1.2E-3)
3.15E-3 (7.5E-4)
9.05E-7 (1.82E-2)
f8
-11,080.1 (574.7)
-12,569.5 (7.0E-12)
-12,569.5 (415.91)
f9
69.2 (38.8)
0 (0)
0 (0)
4: DE

Functions
DE

()
()
f1
1500
1500
3.372
75
00.474
f2
2000
2000
2.857
133
00.467
f3
5000
5000
21.321
20
00.260
f4
5000
5000
6.775
27
00.068
f5
20000
20000
12.472
8566
115.858
f6
1500
125
0.238
00.020
f7
3000
3000
11.425
3000
16.109
f8
9000
3973
13.634
1794
51.716
f9
5000
5000
14.371
15
00.122
6.
[1]
[4]
made faster, IEEE Trans. on Evolutionary Computation,
Storn R and Price K, Differential evolution - a simple
vol. 3, no. 2, pp. 82-102, 1999.
and efficient heuristic for global optimization over

[5]
continuous spaces, Journal of Global Optimization, vol.
control
parameters
in
differential
evolution: a comparative study on numerical benchmark
Zhang J and Sanderson AC, JADE: Adaptive differential
problems, IEEE Trans. on Evolutionary Computation,
evolution with optional external archive, IEEE Trans. on
vol.10,
Evolutionary Computation, vol. 13, no. 5, pp. 945-958,

2009.
[3]
Brest J, Greiner S, Boskovic B, Mernik M and Zumer V,

Self-adapting
11, pp. 341-359, 1997.

[2]
Yao X, Liu Y and Lin G, Evolutionary programming
Gandomi AH and Alavi AH, Krill herd: a new bioinspired optimization algorithm, Commun Nonlinear Sci
Numer Simulat, 17, pp. 4831-4845, 2012.
17
no.
6,
pp.
646-657,
200
NCCIT2015

Applied Fuzzy Logic for Memory Allocation
of Virtual Machines in Cloud Computing
(Tipparat Sinlapaphongwarakorn)1 (Chaiyaporn Khemapatapan)2

1
tipparat.nid@gmail.com, 2chaipor@yahoo.com
by the center of gravitys value (COG) and the Method 2

is the fuzzy forecasting method by the Max Diff, the

EWMA Fuzzy Logic 2

COG ( 1)
Max Diff ( 2)

EWMA
EWMA

(Dynamic)
2

2

:

maximum difference value of memory. And it has the

important variables are the actual memory value, the
forecasting memory value by the EWMA forecasting
method and the differential memory value. From the
above method aims to improve the forecasting result, by
using the EWMA forecasting method, is not less than the
actual memory value. Consequently, using the forecasting
result to control the dynamic memory allocation for
reducing a risk that the system cannot service
continuously.
The results showed that the fuzzy forecasting by the
Method 2 has the risk rate of problems less than another
method. Therefore, the fuzzy forecasting by using the
Method 2 is the appropriate forecasting method that use
for controlling the memory allocation and making the
advantage to the system.
Keywords: Allocation, Forecast, Memory, Outage,
Virtual Machine, Fuzzy Logic.
1.
(Private Cloud
Computing)
Abstract
This paper presents the forecasting method and the
memory allocation for each virtual machine. By
combining the EWMA forecasting method with 2 kinds of
the Fuzzy Logic method that based on the fuzzy
processing. The method 1 is the fuzzy forecasting method
18

(Virtual Machine)

(Migration)

(Memory)

(Fuzzy Logic)

EWMA

3 4
5
NCCIT2015

Computer, Tablet
Smartphone

(Hypervisor)
(Virtualization) [2] Microsoft
Hyper-V, VMware vSphere, Citrix Xen Linux KVM

1

(CPU)
(Memory) (Disk)
(Network)
(Static)
VM1
VM2
App
App
OS
OS
Hypervisor
Hardware
1:
2.2
V Holy Angel Jenitha [3]

Xen Hypervisor
(Exponentially Weighted Moving Average :

EWMA)

EWMA
Jimoh, R.G. [4]

2.
2.1 (Cloud Computing)

[1]

19

[5]

/
[6]

NCCIT2015
Guest

10

3.2 EWMA [3]
E(t) = * E(t - 1) + (1 ) * O(t 1)
(1)
E(t) t
E(t - 1)
O(t - 1)
O(t - 1) / E(t - 1)

EWMA
EWMA

3.3

EWMA
EWMA
2
- 1
(Low), (Medium)
(High)
3.
3.1
Virtual Box(Host)
(Guest)
Host 1 RAM 5 GB
OpenStack Cloud Software
Linux KVM Apache jMeter

OpenStack
3 RAM 1.5 GB Host
Guest Ubuntu 12.04 LTS
Guest server1,
server2 server3
Guest 3
Apache jMeter
Host Guest http

3 50

2: 1(actual)
- 2
EWMA (Low),
(Medium) (High)
20
3
4
5
6
7
8
9
10
11
12
3: 2(forecast)
- 3

EWMA (Good) (Poor)
Medium
Medium
Low
Medium
Medium
High
High
Medium
High
High
N
ai wi
COG = i =1
N
ai
i =1
4: 3(diff.)
- 1

(NoChange) (Change)
Good
Poor
Poor
Good
Poor
Good
Poor
Poor
Good
Poor
NoChange
Change
Change
NoChange
Change
NoChange
Change
Change
NoChange
Change
(2)
N 1 i
ai
i
wi i
Low
Low
Medium
Medium
Medium
Medium
Medium
High
High
High

3

3.3.1 ( 1)
MATLAB (Center of
Gravity : COG) COG
NCCIT2015
5: (output)
- 12
if (actual is Low) and (forecast is
6: COG MATLAB
COG(Cg)

Cg
Low) and (diff is Good) then (output is NoChange)
1:
1
2
1
(actual)
Low
Low
2
(forecast)
Low
Low
3
(diff)
Good
Poor
(output)
E(t) = * E(t - 1) + (1 ) * O(t 1) + Cg
(3)
NoChange
Change
21
actual forecast = diff
(MB)
EWMA

Cg = 0
Cg = 13.5

EWMA

2
3 .3 .2
( 2)(Max Diff : Md)

EWMA

EWMA
1
2
7: EWMA
(MB)
2 (VM1)
(4)

EWMA
1
2
10 diff
10 diff (Md)

Md
8: EWMA
2 (VM2)
(MB)
E(t) = * E(t - 1) + (1 ) * O(t 1) + Md
NCCIT2015
(5)
3

EWMA

Md = 0
Md
3 Md(VM1)= 28, Md(VM2)= 33
Md(VM3)= 48

EWMA
1
2
9: EWMA
2 (VM3)
4.2

EWMA
2 3 10

4.
(MB)
4.1

EWMA
2 3
2

EWMA
1
2
22
10: EWMA
5.
(MB)
2 (VM1) 10
2

EWMA
1

2

(Dynamic)
2

EWMA
1
2
11: EWMA
2 (VM2) 10
(MB)
NCCIT2015

EWMA
1
2
[1]
The National Institute of Standards and Technology

(NIST). (2013, December 12). Cloud Computing [Online].
12: EWMA
Available:
2 (VM3) 10
http://www.csrc.nist.gov/groups/SNS/cloud-
computing/index.html.
7-12
EWMA

Memory Outage
2
2: Memory Outage
[2]
Bill Kleyman. (2012, August 01). Hypervisor 101:

Understanding
the
Virtualization
Market
[Online].
Available: http://www.datacenterknowledge.com/archives
/2012/08/01/hypervisor-101-a-look-hypervisor-market.
[3]
V Holy Angel Jenitha and R.Veeramani, Dynamic

memory Allocation using ballooning and virtualization in
cloud computing IOSR Journal of Computer Engineering
(IOSR-JCE), Vol. 16, Issue 2, Ver. IV (Mar-Apr. 2014),
EWMA

1
2
VM1
37.64%
0.43%
0.00%
M.A., Modeling Rainfall Prediction using Fuzzy Logic
VM2
35.44%
0.38%
0.05%
IJIRCCE, Vol. 1, Issue 4, June 2013.
VM3
39.32%
0.71%
0.00%
pp. 19-23.
[4]
[5]
2 EWMA
Memory Outage

Memory Outage
2
[6]
23
Jimoh, R.G., Olagunju, M., Folorunso, I.O., Asiribo and
, ,

1 2555.
, ,

9 ..2547 WRE 19-23.
NCCIT2015

A Self Adaptive Migration for Distributed Genetic Algorithm
(Chaiwiwat Jantasarn)1 (Pornthep Rojanavasu)2

1
, 2

1
angelwing14@hotmail.com, 2pornthep.ro@up.ac.th
functions showed that the proposed DGA convergence

faster than SGA and DGA without adaptive.
( Distributed Genetic
Algorithm : DGA)

(sub-population)
(Migration)
DGA

4 DGA
(Convergence) SGA DGA

:

Keywords: Distributed Genetic Algorithm, Adaptive

Migration Size, Adaptive Migration Period,
Adaptive Topology.
1.
(Genetic Algorithm : GA) [1][2][3]

(Optimization)

(Migration)
2
1.
[4]
[5] [6]
2.

Abstract
Distributed Genetic Algorithm (DGA) was developed
to improve the efficiency of Genetic Algorithms (GA) in
term of reduce processing time. The Population of GA is
divided into multiple groups called sub-population. The
migration process between sub-population is added to
evolution
process.
This
paper
presents
adaptive
migration and topology for DGA. The proposed method

considers variance of objective value to adjust migration
period,
migration
size
and
topology
among
sub-population. The experiments on 4 benchmark
24
Eric-Cantu Paz [8]

Gautam Roy [9]
pool
Threads
Leila
Falahiazar [10] Distributed Genetic
Algorithm pool
pool Objective Value Max, Min
Average pool

Hill-Climbing Algorithm
Yiyuan Gong [11]

Greiwangk,
Rastrigin Schwefel

Wei Li [12]
ISIM
Buffer
pool
Buffer
Core CPU

Li Junqing [13]
Crossover Mutation ISIM

2.

Eric-Cantu Paz [7]
4
Master-Slave, Coarse-Grained, Find-Grained, Hybrid

(Migration)

- (Migration period)

- (Migration size)

- (Selection/Replacement)

- (Topology)

NCCIT2015
1:
25
NCCIT2015
3.

[8]
(Variance)

s=
x
2
x =
=1( )
1
2:
2

2 5 8
2

(4) (Period
rate)

(1)
=1
(2)
xi
subpop
n subpop
x subpop
(3)
meanV =
=1
Migration period = Period rate (4)

Period rate = 0.01 0.02 0.03

(3)
subpop

(subpop)

3:
3
3
2 5 10
26
NCCIT2015

80 %

95 %

3

highV = max(s2) , midV = highV - (highV*0.8)
lowV = highV - (highV*0.95)
3
1 midV < meanV highV
1
0.01
2 lowV < meanV midV
0.6
0.02
3 meanV lowV
0.3
0.03

(5)
(Migration rate)

Migration size =
(5)
Migration rate [0,1]
4:
4

80 %
95 %

(Exploration)
(Exploitation)
27
4 meanV

5
6 3

highV= n
midV = highV (highV*0.8)
lowV = highV (highV*0.95)
4.
meanV
midV< meanV<= highV
no
lowV< meanV<= midV
no
meanV<= lowV
4.1
Benchmark Functions

4
- Sphere [9][13]
() = =1
2
(6)
yes
1
0.01
yes
0.6
0.02
[5.12,5.12] , = 1, ,
( ) = 0 , = (0, ,0)
- Rastrigins [9][11]
0.3
0.03
() = 10 + =1[2 10(2 )]
(7)
[5.12,5.12] , = 1, ,
no
NCCIT2015
( ) = 0 , = (0, ,0)
- Griewangk [11]
() = =1
yes
4000
=1 + 1
(8)
[600,600], = 1, ,
5:
( ) = 0 , = (0, ,0)
- Schwefel [9][11]

1 (1)
2 highV = max(s2) ,midV = highV(highV*0.8) lowV = highV-(highV*0.95) period

3 meanV (3)
() = =1 (| |)
[500,500], = 1, ,
( ) = 418.9829 , = (420.9687)
28
(9)
NCCIT2015
(Object value)

Sphere
Rastrigins
Griewangk
Schwefel
7: Sphere
6:
: http://www.sfu.ca/~ssurjano/optimization.html

MATLAB R2011b
Processor Intel(R) Core(TM) i5-4200 ,CPU @1.60GHz
4.2

(SGA) (DGA (1))

(DGA (2))
8: Rastrigins
1: Parameters GA
SGA
300
1
300
10

0.8
DGA (1)
50
6
300
10

0.8
DGA (2)
50
6
300
10

0.8
1/L
-
1/L
3
1/L
(L)
9: Griewangk
10: Schwefel

4

10
29
NCCIT2015
2: (milliseconds)

Sphere
Rastrigins
Griewangk
Schwefel
SGA
DGA (1)
DGA (2)
1515
1522
1377
1394
1331
1435
1328
1350
1261
1352
1275
1267
[2]
. : . Artificial
Intelligence : Swarm Intelligence. :. 2555.
. .
,
1 1 2557 40-55.
[3]
Michael Negevitsky. Artificial Intelligence : A Guild to
[1]
Intelligent Systems, Second Edition, 2004.
[4]
[5]
5.

(Exploration) (Exploitation)

GPU
[6]
[7]
.

, 2545.
.

3 6 .... 2550 28-33.
.

, 2553.
Erick
Cantu-Paz.
Survey
of
Parallel
Genetic
Algorithms Calculateurs parallele, pp. 141-171, 1998.

[8]
Erick Cantu-Paz. Migration Policies, Selection Pressure,

and Parallel Evolutionary Algorithms Journal of
Heuristics, Vol. 7, pp. 311-334, 2001.
[9]
G. Roy, H. Lee, Jennifer L. Welch, Y. Zhao, V. Pandey,

and D. Thurston. A Distributed Pool Architecture for
Genetic Algorithms IEEE (CEC), pp.1177-1184. 2009.
[10] L. Falahiazar, M. Teshnehlab, and A. Falahiazar. Parallel

Genetic Algorithm Based on a New Migration Strategy
International
Conference
on
Recent
Advances
in
Computing and Software Systems, pp. 37-41, 2012.

[11] Y. Gong and A. Fukunaga. Distributed Island-Model
Genetic Algorithms Using Heterogeneous Parameter
Setting IEEE Trans, Vol. 11, pp. 820-827, 2011.
[12] W. Li and Y. Huang, A Distributed Parallel Genetic
Algorithm
Oriented
Adaptive
Migration
Strategy
International Conference on Natural Computation, no. 8,

pp. 592-595, 2012.
[13] L. Junqing, D. Wencai, and C. Mei. A New Adaptive
Parallel
Genetic
Algorithm
Fifth
International
Conference on Intelligent Human-Machine Systems and

Cybernetics, no.5, pp. 110-113, 2013.
30
NCCIT2015

Enhancement of Predictive Models
for Rice Production in Lower Northern Thailand
(Sujittra Sarakon)1 (Jaratsri Rungrattanaubol )2
(Anamai Na-udom)3
1, 2
3

number of seeds, average rainfall and temperature at the

time of crop for each area etc. These factors are inputs for

8

2 2549 2553

(ANN) (MLR)
ANN MLR ANN
RMSE MAE MLR

:

rice yield predictive models developed based Artificial

neural network (ANN) and Multiple Linear regression
(MLR). The result shows that ANN model is more efficient
than MLR because ANN has less RMSE and MAE than
MLR for both training dataset and test dataset.
Keywords: Rice Yield Predictive Model, Artificial Neural
Network, Multiple Linear Regression, Spatial
Interpolation.
1.

2556/2557 10.8
6.9 36.84

2548 - 2551 [1] 3
65
3.1 [2]

2

Abstract
This research aims to identify the factors that affect
rice yield in kilograms per rai. By collecting data from rice
crop areas in 8 provinces in the lower-northern part of
Thailand. The secondary dataset about rice cultivation is
obtained from the Department of Agriculture District
2 since 2549 to 2553. The factors from cultivating rice
farmer and environmental conditions, such as rice type,
rice cultivation area, growing period, amount of fertilizer,
31
2.

698 [3]

8

2549 2553
2
13,360

2

[4]
RMSE 188.460 (ANN) 190.465 ( MLR)

700.00
600.00
500.00
400.00
(./ )
577.32
585.03
530.18
542.80 557.03 552.95
NCCIT2015
2.1

( )

6 15 23 21

1
1:

//

2549-2553

, , 60,
90, 105,
60-1 60-2,
,
,1, 1, 1

(./ )
( )
1 -12
1 -12
(./ )
(./ )

(Spatial Interpolation)
2.2
2549 - 2553

632.16
442.33
1:
32

p
p 2
1
2549 2553
2
3
2:
Sukhothai
Sukhothai
Sukhothai
1/2549
2/2549
12/2553
0
14.3
62.0
24.4
26.4
25.5
3:
StationID
373201
Province
Sukhothai
LAT.
17.10611
LONG.
99.80000
376201
Tak
16.88333
99.11667
378201
Phitsanulok
16.79639
100.27581
379201
Phetchabul
16.43333
101.15000
380201
Kampangphet
16.48333
99.53333
386301
Phichit
16.43611
100.28889
NCCIT2015
=1
=1
(1 )
v
vi (control point)
di i
n

3

2549 2553 48

QGIS
2
2:
3:
IDW

Inverse Distance
Weighting (IDW) [5] [6]
33
( Artificial Neural Network: ANN)

(Multiple Linear Regression:
MLR)
[7]

2 (Training Set)
( Test Set) 80:20
7,542
1,820

(Root mean square error: RMSE)
2 (Mean
absolute error: MAE) 3
4:
4
4
4:
Province
Ampher
Tumbol
start
stop
rain
temp
TAK
5/49
9/49
xxx.xx
xx.xx
)2
=1(
RMSE =
2.3

9,362
5
5:
(Field)
(Province)
(RiceID)
(GrowID)
(SeedUse)
(TimeOfCrop)
(FertChem)
(rain_idw)
(temp_idw)
(Yield)
NCCIT2015
MAE =
(2 )
=1
( ./ )
( ./ )

(Values)

1,2,3,4,5,6,7,8,9,10,11
1, 2, 3 (
)
./ ( 28.29)
( 4.97)
./ ( 37.07)
(3 )
(Artificial Neural
Network: ANN)

(Node)
(Activation function)
( weights)

(Back-propagation) [8]
(Output) (Input)

ANN
2.4

./ ( = 558)
34
NCCIT2015

6
= 0 + 1 1 + 2 2 + . . . + +
(6 )
ANN 3
(input) (hidden node)
(output) 5
0 , , (Regression
coefficients) ( x)
(y)
3.
SPSS
MLR (x) 8
(y)

(Stepwise method)
7
5:
X 1, X2, Xn y
Wk1, Wk2, Wkn
k
4 y 5
= =1 +
(4 )
y = 586.339+(-93.913RiceID4)+(-26.564TimeOfCrop)
+(0.976FertChem) + (-40.005RiceID6) +
(80.38RiceID7) + (56.603RiceID5) +
(0.374rain_idw) + (41.302Province5) +
(-77.623GrowID1) + (1.218SeedUse) +
(33.724Province7)
(7)
(5 )

, ,
,
[9]
2.5 (Multiple
Linear Regression Model: MLR)
MLR
(Independent variables)
(Dependent variable)

MLR
[10]
5
,
( Dummy variables)

( Stepwise method)
=
=1
+ 0
ANN Weka
8 1
27
( 8
11 3
27
ANN 6)
6:
35

ANN
12 23 0.1, 0.2, 0.3
0.1, 0.2 500
Seed 0
12 x 3 x 3 108 7

21 0.1
0.1
NCCIT2015

(ANN) (MLR)
ANN
MLR ANN

[1]
,
, [] 2556 :
http://www.oae.go.th/ewtadmin/ewt/oae_web/download/j
[20 2558]
, ,
[] 2556 :
ournal/trends2556.pdf
Training
195
193
191
189
187
185
183
181
179
177
175
Testing
[2]
RMSE
http://www2.oae.go.th/mis/Forecast/02_journal/rice
54.pdf [20 2558]
[3]
[4]
12
13
14
15
16
17
18
Node of ANN
19
20
21
22
23
7: RMSE ANN
[5]
6
2 ANN MLR
RMSE MAE
6:
, .
, :106 , 2555
, ,
,
2557,
11.
Shepard, R. N., The analysis of proximities:
multidimensional scaling with an unknown distance
function, Psychometrika, 27:125-140; 219-246, 1962
[6]
George Y.Lu and David W. Wong, An adaptive inversedistance weighting spatial interpolation
technique,journal of computer and geosciences,,
(ANN) (MLR)

Vol.34,pp.1044-1055,2008 Elsevier.
[7]
Raju Prasad Paswan and Shahin Ara Begum, Regression
RMSE
MAE
RMSE
MAE
and Neural Networks Models for Prediction of crop
ANN
178.135
0.313
184.884
0.329
Production, International journal of Scientific &
MLR
190.289
0.361
198.400
0.390
Engineering Research, Vol.4, 2229-5518,2013

[8]
RMSE MAE
ANN
MLR ANN RMSE
MAE MLR
Simon H. , Neural Networks and Learning Machines,

Pearson Education,Inc. Canada, 2009
[9]
Ripley, B. D. Pattern Recognition and Neural

Networks. Cambridge University Press, Cambridge,
Great Britain. 1996
[10]
4.
36
, Regression Analysis,
( 3), :
, 2548
NCCIT2015

Web Page Classification using Generalization Performance
of Support Vector Machines
(Mulliga Khwankue)1 (Thimaporn Phetkaew)2
(Pornpon Thamrongrat)3
1

2,3
kmulliga@wu.ac.th, 2pthimapo@wu.ac.th, 3pornpon.th@wu.ac.th
this enormous amount. Web page classification is one of

efficient techniques to help users to precisely find their

3
Min-max normalization

3
F-measure

F-measure
:

needs. Support Vector Machine has considered as a

state-of-the-art technique for efficiently classifying.
However each individual classification of Support Vector
Machines has given different accuracy. This paper
presents new algorithm to classify web pages by
considering generalization performance of Support
Vector Machine as condition in voting. This research
presents three scoring methods which are Min-max
normalization,
Step
scoring
and
Revoke
scoring.
Experimental results have shown that our proposed

methods yield higher F-measure. With our three methods,
Step scoring method presents the highest F-measure.
Keywords: Support Vector Machines, Generalization
Performance, Web Page Classification, Classification.
1.
Abstract
The increasing amount of web page has exponentially
growth as fast as the expansion of internet users.
Information retrieval system needs to find user needs in
37
NCCIT2015
2 i-vs-j
i j

k
1-vs-All i

[4]

(Max Wins)

2.1.1
(Generalization
performance)

[11]
R n
F = {x w x : w 1, x R} c

1- z m
h = sgn ( f ) sgn (F )

z h

(Web page classification)
(Support Vector Machines)

[10]

(Multiclass
Support Vector Machines)
(One-against-One: 1vs1) [4, 8,
9, 14, 15, 17]
(One-against-All: 1vsAll) [2, 7, 18]

(Classifier)

(Generalization Performance)

[3, 4, 14]

2
3
4 5

c R 2
1
log 2 m + log
2
m

(1)
1-
h sgn (F )
k
+
m
2.
1
c R 2
log 2 m + log
2
(2)
k z

Phetkaew [14]
2

2.1
k

k(k-1)/2
38

(Margin size) [4]
(Support vectors)
NCCIT2015

1)
2 ReliefF
Chi-square
2)

3)
2
4)

7 sectors
DataSet [1] ReliefF
100 F-measure

F-measure

VAMSVM_WPC F-measure

2.2.1

F-measure (Precision)
(Recall) F-measure
i i (
Class i: Ci) (Pi)
(Ri) F-measure (Fi) i
(3)-(5)
[3]
2.2

(Feature extraction)
(Body),
(Head), (Title)
(Feature reduction)

(Neural Network)
(Decision Tree)
[20]

[16]

Wang [19]

(Hierarchical classification)

Thamrongrat [12]

(Voting Algorithm of Multi-Class SVM for Web Page
Classification: VAMSVM_WPC)
ReliefF, Information gain, Gain

ratio Chi-square
Pi =
TPi
TPi + FPi
(3)
Ri =
TPi
TPi + FN i
(4)
Fi =
2 Pi Ri
Pi + Ri
5)
TPi (True Positive)

Ci Ci
39

1 v

3.2 (Step scoring)

3
(Max Min)/3

0.75, 0.50 0.25

3.3 (Revoke scoring)

1)

2)
2
2.1)
(Random)
2.2)

(Revote)
1
FPi (False Positive)
Ci Ci
FNi (False Negative)
Ci Ci

Ci Ci
TNi (True Negative)
3.
VAMSVM_WPC

2

(Mean) (SD)

Mean+2SD
1

3
3.1 Min-max normalization

Min-max
normalization [6]
[0, 1] (6) v
v

=
v'
NCCIT2015
v min
(new _ max new _ min) + new _ min (6)
max min
40
4.
NCCIT2015

0
[0, 1]

0

0

7 sectors DataSet
CMU WebKB [1]
7 Material, Energy, Financial,
Healthcare, Technology, Transportation Utilities
630 html

ReliefF
100 Thamrongrat [12]

21 SVM Light [13]
(RBF kernel)


VAMSVM_WPC
VAMSVM_WPC
2 ReliefF
Chi-square
10-fold
1 : F-measure
VAMSVM_WPC
VAMS
VM_W
PC
Min-max
norm.
Step
0.01
91.01
76.06
0.02
84.95
88.75
0.03
80.60
0.04
cross validation
1 F-measure
VAMSVM_WPC
(c)
F-measure

F-measure
VAMSVM_WPC

Min-max normalization F-measure
VAMSVM_WPC F-measure

Revoke
Random
Revote
92.01
89.57
89.36
90.27
89.44
89.77
88.28
88.13
88.13
88.13
77.36
87.29
87.14
87.14
87.14
0.05
75.50
84.09
85.30
84.78
84.78
0.06
72.37
80.08
83.76
81.95
80.83
0.07
70.37
77.72
81.58
75.09
74.83
0.08
63.89
65.02
71.49
63.61
64.48
5.

VAMSVM_WPC
F-measure
VAMSVM_WPC
F-measure

41
NCCIT2015
[11] P. L. Bartlett and J. Shawe-Taylor, Generalization

performance of support vector machines and other pattern
classifiers, Advances in Kernel Methods, pp. 43-54, MIT
Press, Cambridge: USA, 1999.

[12] P.
Thamrongrat,
L.
Preechaveerakul
and
W.
Wettayaprasit. A Novel Voting Algotithm of MultiClass SVM for Web Page Classification, Proceedings of
the IEEE International Conference on Computer Science
and Information Technology (ICCSIT 2009), pp. 327-331,
[1]
7 sector dataset: http://www.cs.cmu.edu/~webkb/ [1/Dec/2014].
[2]
A. Chaudhuri, K. De and D. Chatterjee, A Comparative
2009.
[13] T. Joachims,(2008). SVMlight : Support Vector Machine.
Available : http://svmlight.joachims.org/[1/Dec/2014]
Study of Kernels for the Multi-class Support Vector

Machine,
[3]
International
Conference
on
[14] T . P h e tk a e w , B . K ijs irik u l a n d W . R iv e p ib o o n ,
Natural
Computation(ICNC), Vol. 2, pp.3 7, 2008.
Multiclass classification of support vector machines by
F. Takahashi and S. Abe, "Optimizing Directed Acyclic
reordering adaptive directed acyclic graph, SANKEN
Graph Support Vector Machines," In Proc. of ANN in
International Workshop on Intelligent Systems, 2003.

[15] T. Phetkaew, B. Kijsirikul & W. Rivepiboon. Reordering
Pattern Recognition, pp.166-170, 2003.

[4]
[5]
[6]
J. C. Platt, N. Cristianini, and J. Shawe-Taylor, Large
Adaptive Directed
margin DAGs for multiclass classification, Advances in
Algorithm for Multiclass Support Vector Machines,
Neural Information Processing Systems, MIT Press, Vol.
Proceedings of the IEEE International Joint Conference
12, pp. 547-553, 2000.
on Neural Networks (IJCNN 2003), pp. 1602-1601, 2003.
Improved
classification, Technical report, Department of Statistics,
Classification Based on SVM, the 6th World Congress
Stanford University, 1996.
on Intelligent Control and Automation, Dalian, China, Jun
J. Han, M. Kamber and J. Pei, Data Mining Concepts and
21-23, 2006.
[17] X. Xia and K. Li, A New Score Correlation Analysis
Francisco, 2011.
Multi-class Support Vector Machine for Microarray,
J. Chen and C. Liu, Fast multi-class sample reduction for
International Joint Conference on Neural Networks
speeding
(IJCNN 2007), 12-17 Aug, 2007, pp.2610 2615.
up
support
vector
machines,
IEEE
[18] Y. Breaych, Classification methods using Winners-Take-
Processing (MLSP), 18-21 Sept, 2011, pp.1 6.
All neural networks, Proceedings of VIIth International
J. S. Prakash, K. A. Vignesh, C. Ashok and R. Adithyan,
Conference on Perspective Technologies and Methods in
Multi class Support Vector Machines classifier for
MEMS Design (MEMSTECH), 11-14 May, 2011, pp.234

236.
machine vision application, International Conference on
[19] Y. Wang and Z. Gong, Hierarchical Classification of
Machine Vision and Image Processing (MVIP), 14-15
[9]
An
[16] W. Xue, H. Bao, W. Huang and Y. Lu, Web Page
International Workshop on Machine Learning for Signal
[8]
Graphs:
J. H. Friedman, Another approach to Polychotomous
Techniques (3rd ed.), Morgan Kaufmann Publishers: San
[7]
Acyclic
Dec, 2012, pp.197 199.
Web Pages Using Support Vector Machine, Digital
M. Zhang, Q. Wang, Z. He, Y. Shen, and Y. Lin,
Libraries:
Bhattacharyya Distance based Kernel Method for
Information Lecture Notes in Computer Science, Vol.
Hyperspectral Data Multi-Class Classification, IEEE on
5362, pp. 12-21, 2008.
Instrumentation
and
Measurement
[20]
Technology
Conference (I2MTC), 3-6 May, 2010, pp.629 632.

[10] N. Cristianini and J. Shawe-Taylor, An introduction to
support vector machines and other kernel-based learning
methods, Cambridge University Press: New York, 2000.
42
Universal
and
Ubiquitous
Access
to
,
,
,

12, NCSEC 2008, 498-504, 2551.
NCCIT2015

Performance Improvement of Extreme Learning Machine based on
Flower Pollination Algorithm for Real World Regression Problem
(Sarunyoo Boriratrit)1 (Sirapat Chiewchanwattana)2
(Khamron Sunat)3 (Punyaphol Horata)4
Advanced Smart Computing (ASC) Laboratory
1
sarunyoob@kkumail.com, 2sunkra@kku.ac.th, 3khamron_sunat@yahoo.com, 4punhor1@kku.ac.th
Abstract

( Single-hidden Layer Feedforward
Network: SLFN)

ELM

(Flower Pollination Algorithm:
FPA) ELM

FPA

(Real World Regression Problem)

4 5

3 5
Extreme Learning Machine (ELM)
Extreme Learning Machine (ELM) was proposed as

single-hidden layer feedforward network (SLFN) of a
neural network type that training and testing faster.
However, ELM uses a randomize method to find the input
weights and hidden bias from the training phase for
finding solutions in testing phase. In this paper, we
proposed the new optimizer based on Flower Pollination
Algorithm (FPA) and merge with ELM for adjusting input
weights and hidden bias in the training phase for finding
the best solution in the testing phase. In this paper will
experiment with the real world regression problem only.
The experimental results show that the new model can
overcome 4 in 5 of datasets for all models type in training
phase and 3 in 5 of datasets for all models type in testing
phase.
Keywords: Extreme Learning Machine (ELM), Flower
Pollination Algorithm (FPA).
1.
(Extreme Learning Machine:

ELM) [1]

ELM
, ELM

[2]
43
NCCIT2015
ELM

(Flower Pollination
Algorithm) Xin-She Yang [3]

Generic
Algorithm Particle Swarm Optimization [3]

(Flower Pollination Algorithm) Xin-She Yang [3]
ELM

(Evolutionary)
4
Self-Adaptive Differential Evolution ELM
Guang-Bin Huang [4]
Differential Evolution
ELM, Online Sequential ELM
Guang-Bin Huang [5]
(Learning Algorithm) ELM
ELM
1: Single Layer
Feed-forward Networks (SLFN) [1]

(1)

(2)
g(x)
(Activation Function) L N
g(x)

(Sigmoidal Function) j

j
j

j
[6]
2.
2.1 Extreme Learning Machine [1]

(Extreme Learning Machine:
ELM) Guang-Bin Huang [1]

(Single-hidden
layer feed-forward networks: SLFNs) L
g(x)

(3)
- (Moore-Penrose) H
44
2.2 Flower Pollination Algorithm [3]

(Flower Pollination
Algorithm: FPA) Xin-She Yang
[3]
(Objective Function)

[7] [8]
- (Self-Pollination)

- (Cross-Pollination)
(
)

(Pollinator)
[9]
- (Biotic
Pollinator) , , ,
- ( Abiotic
Pollinator) ,
Xin-She
(5)
(Step size) Gaussian U V

(6)
Gaussian

(7)

(8)
2
[0,1]

[4]
1) (Cross-Pollination)
(Biotic-Pollinator)

Levy flight ( 5)
2) (SelfPollination) ( Abiotic-
Yang
(Flower Pollination Algorithm)
Levy Flights [10]

Pollinator)
3)

4)

p
[0,1]
(4)
i
t
NCCIT2015
Levy Flights L>0
45
3.

ELM FPA

Levy Flights 5

(Cross Pollination) 4
Fitness Function ELM

8
Fitness Function ELM
Fitness
Function ELM FPA Cost Function (E)
Root Mean Square Error (RMSE)
6)
7)
8)
9)
NCCIT2015
a. rand<p

b. randp
Levy Flight

3)

H

H
4.

Regression FP-ELM
SADE-ELM [4], OS-ELM [5] ELM
[1]
Intel Core i7 2.1 Ghz, RAM 4
GB MATLAB R2014a
5 [11] 1
(Training) 70% (Testing) 30%

(9)

ELM
FP-ELM
1)
L
2) n
p
3)
4)
5) (rand) [0,1]
1: [11]
Datasets
#Attributes
Breast cancer
10
Forest fires
13
Housing
14
Wine quality
12
Yacht
7
46
#Train
489
362
354
1119
216
#Test
210
155
152
480
92

10
2
Housing
Wine
Quality
Yacht
2: (Hidden nodes)
Dataset
Breast
Cancer
Forest
Fires
Housing
Wine
Quality
Yacht
FP-ELM
Dataset
ELM
Breast
Cancer
97
100
81
100
Forest
Fires
99
100
74
97
Housing
99
98
92
100
100
100
77
99
40
40
29
37
Wine
Quality
Yacht
100
FP-ELM, SADE-ELM, OSELM ELM Sigmoid

(Mean Dev)
Dataset
Breast
Cancer
Forest
Fires
Housing
Wine
Quality
Yacht
FPELM
44.8461
3.7317
0.2587
Dataset
Breast
Cancer
Forest
Fires
ELM
3.3189
0.1611
0.0252
44.4494
3.5194
0.2105
0.0242
60.8338
5.0730
0.6164
0.0447
11.6044
1.9300
0.0484
0.0061
4 : ()
Dataset
Breast
Cancer
Forest
Fires
FPELM
Testing Time (Sec)

SADEOSELM
ELM
ELM
0.0205
0.0117
0.0042
0.0041
0.0205
0.0019
0.0065
0.0041
0.0017
0.0019
0.0272
0.0077
0.0042
0.0042
0.0219
0.0013
0.0022
0.0031
Root Mean Square Error of Training

SADEOSFP-ELM
ELM
ELM
ELM
11.1835
0.2502
0.2438 0.2479
0.0124
0.0108
44.7695
0.0118
12.4288
0.1441
0.1397 0.1454
0.0252
0.0254
25.7462
0.0256
0.0107
0.0937
0.0102 0.0107
4.6574e- 5.3660e5.6414e
04
0.0050
04
-04
0.8435
0.0482
0.0467 0.0481
0.0015
0.0014
1.6244
0.0014
0.1515
0.1195
0.1291 0.1392
0.0071
0.0096
0.0061
0.0113
Root Mean Square Error of Testing

SADEOSFP-ELM
ELM
ELM
ELM
0.6627 17.1367
0.6705
0.6432
0.0269
0.0232
0.0336 74.6459
205.533
1.5937
1.4402
0
1.7566
2.7886
392.906
0.9294
0.8275
9
Housing
0.9475
0.0023
0.9464
0.0042
0.1935
0.0323
0.9469
0.0029
Wine
Quality
0.8198
0.0054
0.8204
0.0082
2.7243
6.6427
0.8220
0.0071
Yacht
0.4153
0.0416
0.4149
0.0570
745.887
4
697.412
4
0.4268
0.0432
0.0300
46.2019
0.0047
6 : RMSE
3 : ()
Training Time (Sec)
SADEOSELM
ELM
0.0322
5 : RMSE
#Hidden nodes
SADEOSELM
ELM
NCCIT2015
5.

FP-ELM Flower Pollination Algorithm
47
Extreme Learning Machine

(Real-World Regression) 5
3 5
FP-ELM 4 5
Breast Cancer, Forest Fires, Housing Wine
Quality 6 FP-ELM
3 5
Breast Cancer, Wine Quality Yacht
FP-ELM 3

[8]
[Accessed 27 09 2014].
[9]
2014].
[10] X.-S. Yang, "Levy Distribution and Levy Flight," in
Nature-Inspired
https://archive.ics.uci.edu/ml/datasets.html. [Accessed 8
December 2014].
G.-B. Huang, "Extreme Learning Machines - Learning
R. Pokaen, S. Chiewchanwattana and K. Sunat, "Accuracy
technology, vol. I, no. 1, pp. 261-266, 2012.

X.-S. Yang, "Flower Pollination Algorithms," in NatureInspired Optimization Algorithms, London, Elsevier Inc.,
2014, pp. 231-261.
C. Jiuwen, L. Zhiping and H. Guang-Bin, "Self-Adaptive
Evolutionary Extreme Learning Machine," Neural Process
Lett, vol. I, no. 36, pp. 285-305, 2012.
N.-Y. Liang, G.-B. Huang, P.Saratchandran and N.
Sundararajan, "A Fast and Accurate Online Sequential
Learning Algorithm for Feedforward Networks," Neural
Network, vol. 17, no. 6, pp. 1411-1423, 2006.
P. Musigawan, S. Chiewchanwattana and K. Sunat,
"Evolutionary Extreme Learning Machine Based on
Optimized step-size random search Firefly Algorithm,"
The 8th National Conferrence on Computing and
Information technology, vol. I, no. 1, pp. 202-209, 2012.
[7]
London,
January 1987. [Online]. Available:
National Conferrence on Computing and Information
[6]
Algorithms,
[11] A. David, "UCI Dataset," National Science Foundation, 1
Differential Evolution Search Algorithm," The 8th
[5]
Optimization
Elsevier, 2014, pp. 81-85.
Improvement of Extreme Learning Machine using
[4]
Available:
http://en.wikipedia.org/wiki/Pollination. [Accessed 27 09
University, Singapore, 2012.
[3]
Wikipedia, "Pollination," Wikipedia, 27 09 2014.

[Online].
Without Iterative Tuning," Nanyang Technological
[2]
. , ", ," l3nr.org, 20 02 2011.

[Online]. Available: https://www.l3nr.org/posts/456658.

[1]
NCCIT2015
. , " 3 ," Google

Sites, 18 10 2012. [Online]. Available:
https://sites.google.com/site/chiwwithyachanm5/system/a
pp/pages/recentChanges. [Accessed 27 09 2014].
48
NCCIT2015

Semantic-Based Indoor Navigation for Library Book Finding
(Nonthachai Dubtuk)1 (Thimaporn Phetkeaw) 2
(Siripinyo Chantamunee)3
1

2,3
within multi-floor building. Path recommendation should

be combined in one map when selected books spread in

MT-Dijkstra
Dijkstra

MT-Dijkstra

Dijkstra
:
Dijkstra

many different floors. This research proposes new 3D

semantic-based data network in order to incorporate the
structure of multi-floor building and take semantic of
library building into consideration. The new extension of
Dijkstra algorithm is developed to find multiple targets
on the data network. Experimental results has shown that
our data network is able to well incorporate building
structure and our MT-Dijkstra works faster than
traditional one.
Keywords: Semantic Indoor Navigation, 3D Data
Network, Multi-Target Dijkstra, Indoor
Navigation.
1.
(Online Public Access

Catalog: OPAC)

(Call number)

Static
Abstract
Online library retrieval systems have provided map
service explaining directional information to all library
items in order to help unfamiliar library users locating
their target bookshelves more easily. However, current
library indoor navigation has designed for one individual
floor map. The system is unable to support the navigation
49
(Floor map)
(Shelves)

(Horizontal)

(Indoor navigation)
(Multi-level building)
(Vertical) (Data network)
(Path-finding algorithm)

-

(Factor)

(3D semantic data network)
(Semantic)
(Multi-floor indoor
navigation) Dijkstra
NCCIT2015
2
3
4 5
2.

2.1

OPAC
Professional PHP programming
QA76.73 .P224 P76 2000
QA
OPAC Static

)Thailand Creative & Design Center: TCDC( [1]
Wichita State University Library
[2]
Sciacchitano [3] Dynamic

(Location-based
system)

50
NCCIT2015

[6]
3.
1:
3.1
[2]
(Zone)

[2]

2.2 (Semantic
model)
(Multi-level building)
Meijers [4]
(Semantic model)

(Connector)

-

[5]

2.3
Dijkstra

(Weight)
(Edge)

51
NCCIT2015
POSITION (mk )

3.2
2:

(Euclidean distance)

mk ml
Dist (mk , ml )
1:

( 3.1) 2

Dist (mk , ml ) = MS *Wkl * D(mk , ml )
(2)
( x x ) 2 + ( y y ) 2
k
l
D ( m k , ml ) = k l
z k z l
z k = zl
(3)
MS
(Map Scale) 10
10 1

Wkl (Edge)
mk ml Wkl
2:
()
Wkl = 1

M
( ) n {mi , i = 1..n} mk
k M
mk xk , y k z k
mk = {xk , y k , z k , s k } s k
3.1
xk , yk , z k s k mk
1
POSITION (mk )
{x k , y k , z k , s k }
zl < z k
zl = z k
(4)
zl > z k

1
3:
s0
T
n {ti , i = 1..n} t k
xtk ytk ztk t k = {xtk , ytk , z tk , stk }
(1)
52
4:
Dijkstra
4.

3 1
2
18 2 3
55
3 2
15 88
4
1.5
3

() 1 10
20
Dijkstra
Dijkstra

1
Dijkstra

5
(Multi-target Dijkstra: MT-Dijkstra)
MT-Dijkstra
(Multi-target finding)

MT Dijkstra (M , s 0 , T )
{P1 ...Pn }
NCCIT2015
(5)
P ( )
n
Dijkstra
3
MT-Dijkstra's Algorithm
Input: Data network (M), Start node (S0) , List of target
nodes (T)
Output: FinalPath
ZoneList Find zone of any target node
M
subsets of main nodes and edges from M
MainPath MT-Dijkstra(M, S0, ZoneList)
Foreach Zone in ZoneList
M all nodes and edges from M within Zone
entrance node of Zone
S0
TargetList
list of target nodes within Zone
SubzonePath MT-Dijkstra(M, S0, TargetList)
FinalPath MainPath merged with SubzonePath
Next
3: Dijkstra
Dijkstra
(MT-Dijkstra)

Dijkstra

4: 3
53
1: Dijkstra
Dijkstra (MT-Dijkstra)
Dijkstra (ms.)
0.0011
0.0005
53.80
2
3
4
5
6
7
8
9
10
0.0020
0.0028
0.0044
0.0064
0.0085
0.0102
0.0132
0.0161
0.0202
0.0018
0.0024
0.0033
0.0040
0.0047
0.0058
0.0081
0.0093
0.0142
11.01
11.98
25.10
37.67
44.95
43.35
38.97
41.93
29.50
MT-Dijkstra
(ms.)
NCCIT2015
WU58117
[ ]. :
http://library.tcdc.or.th. 1 2558.
[1]
TCDC Resource center.
[2]
Li, Hongfei, and Sai Deng. Location and shelf mapping

from OPAC search results: with reference to Wichita
State University, New Library World, Vol.109, No. 3/4,
pp. 107-116, 2008.
[3]
B. Sciacchitano, C. Cerwinski, I. Brown, M. Sampat, J.

C. Lee and D. Scott, Intelligent library navigation using
location-aware
systems:
the
Newman
project,
Proceedings of the 44th annual southeast regional

conference, pp.371-376, 2006.
[4]
5: (
M.
Meijers,
S.
Zlatanova
and
N.
Pfeifer,
3D
geoinformation indoors: structuring for evacuation, Next
Milliseconds) MT-Dijkstra Dijkstra
generation 3D city models, pp.11-16, 2005.

[5]
5.
T. H. D. Dao, Y. Zhou, Traveling in the threedimensional
city:
applications
in
route
planning,
accessibility assessment, location analysis and beyond,
Dijkstra

Dijkstra
Journal of Transport Geography, Vol. 19, pp.405-421,

2011.
[6]
Parsons, T. W. Introduction to algorithms in Pascal.

Wiley. Technet.microsoft.com [cited 2013 Jan 23].
Available
from:
us/library/bb496996.aspx
54
http://technet.microsoft.com/en-
NCCIT2015

-
Dynamic System Identification of DC/DC Converter
using Fuzzy Model Identification
(AtipJundee)1 (SomyotKaitwanidvilai)2

1
Atipkmitl@gmail.com, 2Drsomyot@gmail.com
the experiments. More than 99% accuracy was achieved

by the fuzzy model identification technique while the

-

OE (Output Error)
(Fuzzy
Identification)

99
OE (Output Error) 80

linear model can achieve only less than 80% accuracy.

The proposed technique can be used in the future design
of fuzzy controller for this circuit.
Keywords: Fuzzy Model Identification, Buck Converter,
System Identification.
1.
(DC to
DC Converter)
[1-3]

Ismial
[1] (Buck
converter)
Szczesniak
Kaniewski [2]
( Space-Vector)

( Buck-boostmatrix-
Abstract
This paper presents the study of system identification
of the DC-DC converter circuit, in this case, the buck
converter. The performance of the identification process
of the fuzzy identification technique is investigated in
comparison with the conventional linear dynamic
modeling using the OE (Output Error) model. By proper
varying the input signal of the system, the wide range
output dynamic response can be achieved. The output is
then be analyzed and compared by using the data from
55
NCCIT2015

(Adaptive
Controllers)
(Fuzzy gain scheduling)

(Interpolate)

Takagi-Sugano Fuzzy Model
(TS Fuzzy Model)[6]
reactancefrequency)Schittler

(noise)

(least
square error)
-

(Fuzzy Identification)

OE (Output Error) [4,5]
[6]

[6]

(Fuzzy Membership Function)

2.
(State-space model)
2
1(a)
1(b)
L
u=1
u=0
i
Rc
Vs
C
+
VRc
+
i
Rc
Vc
-
Vo
C
-
+
VRc
+
+
R
Vo
Vc
-
(a) 0 t ton(b)ton t T
1:(a) (b)
u
1,
0t ton
0, ton t T
u=
(1)
1

V v
di
=u s dt
L L
O
dv0
dt
(2)

RRc C V u
R
i - v L+RRc C +
0
s
CRc +RC
LCRc +LRC LCRc +LRC
(3)
56
(3)

NCCIT2015

(6) 2 [8]
x = Ax + Bu
di
0
dt
R
dvo
dt CRc +CR
1
Vs
L
L
[u ]
+
L + RRc C vo

RRc C
-
V
LCR + LRC s
c

LCRc + LRC
(4)
u(t - nk) + e(t)

F(q)
3.2
(Fuzzy model identification)
(Fuzzy) [6, 7]

[8-9]
2

[10]

(5)
(5)
(6) b f
B(s)
G(s) =
=
F(s)
(nb-2)
+b
s
+ ... + b
1
nb-1
nf
(nf -1)
s + f s
+ ... + f
1
nf
b s
nb

OE
nb, nf nk
Gray Box model [4]
3.1
OE (Output Error)[5]
OE (Output Error)

OE [6]
B(q)
2: OE [4]
3. (Linear
System identification)
(fuzzy identification methods) [4, 6]
y(t) =
_
B
F
(nb-1)
(6)
y(t) tu(t) tnb
nf
nk
,e(t), b1 ,, bnb f1 ,, fnf
57
G T-S

[6]

2
-(Takagi-Sugano
:TS) [6]

(7)
-3
L(1):
IF x1 is F11 and and xn is Fn1
THEN y1=c01+c11x1++cn1xn
(M)
L :
IF x1 is F1M and and xn is FnM
M
M
THEN y =c0 +c1Mx1++cnMxn
(9)

jthGj
jthM
( )

(Triangle function,
Trapezoidal function or Bell Shape function)
4
W1,y1
Weighted
average
xU
NCCIT2015
y(x)V
WM,yM
3:- [6]
(7)
4 : (Triangle
membership function)
; k
k; d ;

6

G=
jth,
jth
4.

u(t) y(t) 5

[20%, 40%, 60%,
80%, 100%]

(8)

Abonyi et al.[6]
G

58
2 PWM
- PWM
PWM
+5V +15V
MOSFETIR2110 50 kHz
5 20% 40% 60%
80% 100%
380 , 100
5
+12V 0
+12V 6

2
[6]
1 7 ()

7 ()

OE (Output Error)

OE
78.8% 99%

Tustin

voltage (V)
4
2
0
input signal
-2
0.002
0.006
0.004
time (s)
0.008
NCCIT2015
0.01
()
voltage (V)
15
(10)

1 2
10
5
output signal
0
0.002
0.004
0.006
time (s)
0.008
Measured and simulated model output
0.01
14
()
5 : ()u(t) () y(t)
12
Voltage (V)
10
8
6
4
2
0
fuzzy identification model

output signal
0
0.002
0.006
0.004
Time (s)
()
6 :
59
0.008
0.01
Measured and simulated model output

14
12
Voltage (V)
10
8
6
4
2
0
OE identification model
output signal
0
0.002
0.006
0.004
Time (s)
0.008
NCCIT2015
0.01
()
7: ()
() OE
[1]
[2]
1:
i
d
1
0.4343
0.5731
0.0006
3
2
0.4136
0.8652 -0.0076
2
3
0.4115
0.5971 -0.0106
2
4
0.1571
0.8536 -0.0120
2
5
0.4024
0.5541
0.0499
2
6
0.1569
0.1363
0.6759
2
[3]
[4]
R. M. T. Raja Ismail, M. A. Ahmadand M. S. Ramli,

Speed Control of Buck converter Driven DC Motor
Based on Smooth Trajectory Tracking,3rd Asia
International Conference on Modelling&Simulation,2009
Szczesniak,P.,.Kaniewski,J., Dynamic model of a space
vector modulated buck-boost matrix-reactance frequency
converter,ISNCC, 2013.
Schittler,
A.C.,Pappis,
D., Rech,
C. , Campos,
A.,Generalized state-space model for the interleaved
buck converter, COBEP, Brazilian, 2011.
LennartLjung, System identification , New jersey, P T R
Prentice Hall.inc, 1987.

Kabaila,P, On output-error methods for system
identification,Automatic Control, IEEE Transactions
on, 28:1, 1983
[6] Abonyi J, Babuka R, Verbruggen HB, Szeifert F,
Incorporating prior knowledge in fuzzy model
identification, Int J SystSci 2000;31:65767.
[7] MATLAB
2013a,What
is
Fuzzy
logic
?
[Online].Available
:http://www.mathworks.com/help/fuzzy/what-is-fuzzylogic.html
[8] Somyotkaitwanidvilai,
PiyapongOlranthichachart,
Robust loop shaping-fuzzy gain scheduling control of a
servo-pneumatic
system
using
particle
swarm
optimization aproach, Mechartronics, 21:1,2011.
[9] Tanaka K, Wang H. Fuzzy control systems design and
analysis. A linear matrix inequality approach, New York:
Wiley Interscience; 2001
[10] Katsuhigo Ogata, Modern control engineering, Pearson
Education, Inc., publishing as Prentice Hall, One Lake
Street, New Jersey 07458.
[5]
2:

Duty cycle
Model
20%
40%
60%
80%
100%
4.

OE (Output
Error) 99 %

60
NCCIT2015

Online English Crime News Classification using Text Mining
(Tichakorn Netsuwon)1 (Kraisak Kesorn)2

1
ticnet27@gmail.com, 2kraisakk@nu.ac.th
84% and 83% measured by precision and recall

respectively. The report presents data relationships by

6

(Data Warehouse)

(Neural Network)
(Precision) i84%
(Recall) i83%

(Online Analytical Processing)
(Multidimensional Table)

:
creating an Online Analytical Processing (OLAP). This is

multidimensional table representation can show the
frequency of crimes in each area in Pattaya city.
Keywords: Text Mining, Text Classification, Data
Warehouse, Online Analytical Processing.
1.

[1]

(Overload Information)
[2]

Abstract
This article presents online English crime news
analysis and classification techniques using text mining.
The proposed model classifies news into 6 categories and
they are exploited to construct data warehouse (DW) in the
form of star schema. Information stored in DW can be used
as a decision support system to aid polices to determine
dangerous areas where should be surveillance. The
experimental results show that classification technique
using neural network obtains the highest accuracy about
61
NCCIT2015

SaatvigaiSudhahar, Roberto
Franzosi iNello Cristianini [5]
(Quantitative Narrative Analysis - QNA)

iANNIE plugin
GATE (General Architecture for Text
Engineering) Miniparser

(Identifying the key actors) (action)

Miniparser

1,024

Meshrif Alruily, Aladdin Ayesh Hussein Zedan [6]

(Rule-based system)

(Datawarehouse)
2.

[3]

(Ontology) (Textimining)

i
Syed ToufeeqiAhmed,iRuchiiBhindwaleiiHasan
Davulcui[4]

(Information

extraction) (keywords)

62
NCCIT2015
1 :
4 RSS
(Extract Data)
(Text mining)
(Reporting services) 1
1. RSS
i1i 1
http:// www.pattayapeople.com/ RSS
(Really Simple Syndication) XML
<title>
<link> URL
2. (Extract Data)
2i 1
(Extraction Name Entities Named Entity Recognition
- NER )
(Named Entities)

(Database)
Wei Wang, Xia Cui
Ai Wang [7]

(Key word)

GATE Developer 7.1 (General Architecture for Text
3.
Engineering) [8], [9]
GATE Developeri7.1i

GATE. ac.th
63
NCCIT2015
1:

JAVA library
GATE

(Processing Resources) ANNIE (A Nearly-New
IE system)
- tokeniser

- sentence splitter
- tagger (parts of
,
( Serious ,
1.
offense and awesome)

2.
( Life , Body
and sexual)
3.
(Asset)
4.
(Interesting case)
speech)
-igazetteri
(organization), (location), (days of the week),
5.
(person)
- transducer
JAPE (Java Annotations Pattern Engine)

(Person), / (Date), (Location)
(Features) Export
(Named Entity Recognition - NER)
XML 2
(Corrupt state)
,
, , ,
, , ,
,
- ,
,
, ,
, ,

(Document Collection) RSS

i500i
(PreprocessiDocument)
(TextiAnalysis)
(creating
classifiesimodel) (Data Set)
(DataiSet) i2i (TrainingiSet)
80% (Test set) 20%

(Ideal Model) Lift
Chart
Ideal Model
5

(Artificial Neural Networks : ANN) [11]

(Hidden Layer)

<paragraph gate:gateId="0">
<Sentence gate:gateId="314"> Nongprue police was called out
by the Sawang Boriboon Rescue Team on the morning of
<Date gate:gateId="332" rule1="DateName" kind="date"
rule2="DateOnlyFinal"> Thursday, 23rd October </Date>
to attend to a fatal road accident. </Sentence>
<Sentence gate:gateId="315"> At the scene, opposite the
railway...
<Location gate:gateId="333" rule1="LocKey"
rule2="LocFinal"> East Pattaya </Location> ... </Sentence>
<Sentence gate:gateId="316"> There were no witnesses, but
police believe the man might have fallen asleep at the....</Sentence>
<Sentence gate:gateId="317"> The body of 27 year old
<Person gate:gateId="334" rule1="PersonTitle"
gender="male" rule="PersonFinal"> Mr. Srawut </Person>
was
taken to Banglamung ..
2 : XML GATE
3. (Text Mining)
3 1
(Text mining)
(classificationicrime News) 6
[10] 1
64
NCCIT2015

(Output Layer)
(key words)
3 :
4.
OLAP
(Multidimensional)
OLAP

[13]
d(Cube
Processing)

,

6

i4 1
(Data warehouse : DW)d
(Dimensional Data Model)
3 (star schema)

(Online Analytical Processing-OLAP) i4
Microsoft SQL Server 2008 R2 [12]

(person), (time),
(location) (class)
4.
4.1

85.5% Confusion Matrix
2 (Precision),
(Recall) F-Measure 3
4 : (star schema)
65
2: Confusion matrix
Actual
Class
0
1
0
20
1
1
1
69
2
1
1
3
4
0
4
0
4
5
1
2
Total
27
77
Accuracy = 85.5%
(Naive Bay Model)

Predicted
2 3 4
0 5 0
5 3 2
94 0 5
5 72 3
2 4 68
6 2 1
112 86 79
(Decision Tree Model)
5
5
2
0
5
1
106
119
4.2
Total
31
82
101
89
79
118
500
3:
Criteria
Precision
Recall
F-Measure
Class
0
1
2
3
4
5 Average
0.741 0.896 0.839 0.837 0.861 0.891 0.844
0.645 0.841 0.931 0.809 0.861 0.898 0.831
0.690 0.868 0.883 0.823 0.861 0.895 0.836
2

0.844 0.831
F-Measure 0.836
Population percentage%
NCCIT2015
Data Mining Lift Chart for Mining Structure: News

100
90
80
70
60
50
40
30
20
10
0
0 10 20 30 40 50 60 70 80 90 100
5.

(Neural Network)

( Textimining)

(DW) star schema

Overall Population%
IdealModel
ANN
Tree
NaiveBay
6 :

star schema
(Multidimensional table)
6 (Drill-down)

2013
(Asset)
17 Beach Road,
, CentralFestival, Pattaya Beach, Royal Garden
Plaza 4, 6, 1, 2, 1 3
22
7 14
2013 60
5 :
5
Lift chart
Ideal Model
85.5%
Ideal Model
66
(Multidimensional table)

(
) (Rule-based

System)

(real time)

COMPSAC '08. 32nd Annual IEEE International, 2008, pp.

923-928.
[8] H. Cunningham, et al., Developing Language Processing
Components with GATE Version 7 (a User Guide). United
Kingdom: The University of Sheffield, Department of
Computer Science, 2013.
[9] T. U. o. Sheffield. (1995-2014). GATE general
architecture for text engineering. Available:
https://gate.ac.uk/
[10]
[2]
[3]
http://www.royalthaipolice.go.th/
fundamentals, computing, design, and application," Journal

of Microbiological Methods, vol. 43, pp. 3-31, 2000.
[12] Microsoft. (2014). Microsoft SQL Server 2008 R2.
Available: https://www.microsoft.com/en-us/download/
[13]
, "
," . (
), , 2543.
, "
,"
, , , 2552.
, "
5
,"
, ,
, 2554.
[4] S. T. Ahmed, et al., "Tracking terrorism news threads by

extracting event signatures," in Intelligence and Security
Informatics, 2009. ISI '09. IEEE International Conference
on, 2009, pp. 182-184.
[5] S. Sudhahar, et al., "Automating Quantitative Narrative
Analysis of News Data," JMLR: Workshop and Conference
Proceedings 17, pp. 63-71, 2011.
[6] M. Alruily, et al., "Crime Type Document Classification
from Arabic Corpus," in Developments in eSystems
Engineering
(DESE),
2009
Second
. (2557). . :
[11] I. A. Basheer and M. Hajmeer, "Artificial neural networks:
[1]
NCCIT2015
International
Conference on, 2009, pp. 153-159.

[7] W. Wang, et al., "News Analysis Based on Meta-synthesis
Approach," in Computer Software and Applications, 2008.
67
, :
, 1. :
, 2555.
NCCIT2015
Blows2Safe:
Blows2Safe: a Wireless Sensor Network for Detection of Breath Alcohol to

Prevent Alcohol-Impaired Driving
(Apirak Tooltham)1 (Phumin Hongma)2
1

2

1
apirak.tl@rmuti.ac.th, 2phumin@npu.ac.th
due to the availability of tools used to measure the

amount of breath alcohol, including procedures to

Blows2Safe

Blows2Safe

:

implement are ineffective. As a result, monitoring the

driver is in the form of random testing in cases of doubt.
Hence, this paper proposes a new prototype system to
detect alcohol in the breath (named Blows2Safe), the new
format based on wireless sensor networks technology.
From the experimental, Blows2Safe can be effective and
tackling the problem in the process as well.
Keywords: Arduino, Breath Alcohol Detector,
Embedded System, Microcontroller,
Wireless Sensor Network.
1.

[1]

16 .. 2537
.. 2522
50
( mg%) 3

Abstract
From the past until now, drinking alcoholic beverages
is a major cause of the road traffic accidents around the
world. Although the agencies of government are
established many checkpoints to measure the breath
alcohol level of the drivers to deter and prosecute them,
but the amount of the accident was not reduced. Partly
68
NCCIT2015

2
2.2 Arduino
(Arduino) [3]

AVR

Input/output
(Analog)
(Digital) Arduino
(Arduino Shield)

Blows2Safe

1: Arduino [4]
2.3 Wireless Sensor Network
(Wireless Sensor Network:

WSN) [5] (Sensor)
(Sensor Node)

( Base Station Node)

2.4 Alcohol Sensor

(Alcohol Sensor) [2] 4
2.
2.1
(Blood Alcohol
Concentration: BAC) [2] 3

50 mg%

69
NCCIT2015

14

1.000 mg%
1.064 mg%
[8]

LED

Alcohol Simulation
10, 30, 45, 50 80 mg%

5%
AlcoLock
Hk [9]

Optical Module
IR Sensor

5 15

USB
45

0.05 mg/L
Noise
0.6
Sakakibara [10]

(Suction Fan)

1. Colorimeter:
(Potassium Dichromate)

2. Semiconductor:

3. Fuel Cell:
(Electrochemical Fuel Cell)

4. Infrared Absorption:

2.5
[6]

MiCS 5131 5135 Microchemical
MiCS 5135
Alcohol Simulation 0 - 100 mg%

10 50 mg%
50.2 mg% 1.687
3.4 %
[7]

70

Wagiran [11]
Multiple Detector System

PIC 16F84
Gas Sensor TGS822
LCD

PIC
3.
NCCIT2015
MQ303A
Semiconductor

Micro-ball, Heater Metal
Mesh Metal Case
Electrode
3
3: MQ303A Alcohol Sensor [12]

Sno2

(Acetic Acid)

3

4
4: Standard Circuit MQ303A [12]

2)

Wireless Access Point
Log File
2: Blow2Safe
1)

MQ303A
Arduino Ethernet
Shield Wireless
Access Point
71
NCCIT2015
4.2
1: Blows2Safe
Node
Sensor
5: WSN Monitoring
3) WSN Monitoring
C#
Wi-Fi

Log File
(m)
10
20
30
40
50
10
20
30
40
50
(mg%)
Blows2Safe
(mg%)
65
66
65
65
64
70
71
70
72
71
67.9
68
67.8
67.4
67.3
72.3
72.5
72
74.1
72.9
4.46
3.03
4.31
3.69
5.16
3.29
2.11
2.86
2.92
2.68
Blows2Safe
Arduino
Analog Input

Arduino

LCD Arduino
WSN Monitoring
WSN Monitoring
IP Address
Wireless Network
4.
4.1
(Prototype)
2 10

Blows2Safe 10
10
50

7: Blows2Safe
5.
Blows2Safe

6: Blow2Safe
72
NCCIT2015

50

3.45

WSN Monitoring

Log File


Blows2Safe

User Interface WSN
Monitoring

[1]
[2]
[3]
, , ,

, , 2554.
,
, , 2546.
Arduino S.r.l, What is Arduino?, http://arduino.cc/en/Guide/
Introduction, 2014.
[4]
A. HAFESJI, The different types of Arduino boards, http://

ahmed.hotglue.me/?arduino/, 2014.
[5]
P. Baronti, P. Pillai, V. Chook, S. Chessa, A. Gotta, Y. Fun

Hu, Wireless sensor network: A survey on the state of the
art and the 802.15.4 and Zigbee standard, Computer
Communication in Wire/Wireless Internet Communications,
Vol.30, No.7, May 2007, pp. 1655-1695.
[6]
[7]
[8]
[9]
,
, ,
, , 2553.
,
,
, ,
, 2548.
, ,
, , , 2549.
B. Hk, H. Pettersson, A. Andersson and S. Haasl, Breath
Analyzer for Alcolocks and Screening Devices, IEEE
SENSORS JOURNAL, Vol.10, No.1, Jan 2010, pp. 10-15.
[10] K. Sakibara, T. Taguchi, A. Nakashima and T. Wakita,

Development of a New Breath Alcohol Detector without
6.
Mouthpiece to Prevent Alcohol-Impaired Driving,

Proceedings of the 2008 IEEE International Conference on
Vehicular Electronics and Safety, Sep 22-24, 2008,

Columbus, OH, USA, pp. 229-302.
[11] R. Wagiran, A. Chong and I. Ahmad, Development of a
Simple In Situ Instrumentation for Detection of Breath
Alcohol and Gas Leak , Proceedings of the 2002 IEEE
International Conference on Semiconductor Electronics, Dec
19-21, 2002, Penang, Malaysia, pp. 470-474.
[12] Seeed Technology Limited, Alcohol Sensor MQ303A,
http://www.seeedstudio.com/document/pdf/MQ303A.pdf,
2014.
73
NCCIT2015

Fairness Bandwidth Allocation for Control of Multiple Internet Connections
with Max-Min Usage Threshold Policy
(Kassuda Kamluewong)1 (Atikhom Siri)2
(Thanawut Thanavanich)3 (Kamol Boonlom)4

1
kassuda_j@hotmail.com, 2atikhom.s@gmail.com, 3thanawut.cru@gmail.com, 4kamol.b@yahoo.com
of network utilization at 18.15, 14.22 and 9.48 percent

from the determined bandwidth set with decreasing ratio

120
35.22%
5%, 10%, 15% 18.15% , 14.22%
of 5, 10, and 15 percent respectively.

Keywords: Network Utilization, Network Controller,
Multiple Internet Connections.
1.
9.48%
Abstract
A problem of assigning a bandwidth network not
considers a fairness of usage from multiple Internet
connections environment, which leads to inefficient use of
Internet application. One of solution for solving this
problem is to allocate bandwidth network with the
max-min usage threshold policy, considered a fairness of
allocating bandwidth network. The objective of the
proposed method is to suitably adjust a client bandwidth
with step-down decreasing technique. The experimental
results show that the technique can improve an average
74
2.
NCCIT2015
3) Filter
class
class [9]

(Traffic Monitor)

iftop

2, 10, 40

[5]

[12]
(Bandwidth Management)

(Quality of Service) [13]

(Static)

(Dynamic)

4 Elastic utility
, Real-time utility
,
Rate-adaptive utility
Stepwise utility

[4]
(Traffic
Control)

3 1) Queuing Discipline (qdisc)

qdisc
2) Class
, class

3.

( Bandwidth Monitoring Process)

(Maximum Threshold Policy)

75

10
1
,
(Minimum Threshold Policy)
(Client
, (2)

Bandwidth Max)
(Client Bandwidth Min)
, (3)
,
(Allocation

Multiple Connections), (4)

, (5)

3.1

3 1)

(WAN)

(LAN)
192.168.43.88
10.0.0.1 2)

100
192.168.43.8 3)
2
100
10.0.0.14 10.0.0.15
2
1:

(1)
NCCIT2015
(2)
(3)
=
(4)
(5)
(Maximum Threshold Policy)
, (1)
2:
76

2
1 1

2
2

(Multiple Internet Connections) MIC
1, 2, 4, 8 16

(Single Internet Connections)
10

80% 20% 2
(Un Allocation Multiple
Connections)
(Allocation Multiple Connections)
3 5%, 10% 15%
(4) (5)
NCCIT2015
UASC 3)
(Allocation
Multiple Connections) AMC 4)

(Allocation Single Connections) ASC

4
5%

80-120
3
3:
4 5%

8
10%

70-120 4
4.

1-16
2
10-120
1-16
10-120

4 1)

(Un Allocation Multiple Connections) UAMC
2)
(Un Allocation Single Connections)
4:
8 10%
77
NCCIT2015

16
15%

60-120
5
7: 10%

15%

8
5:
16 15%
5%

6
8: 15%
5.

4

5%, 10% 15%

1-16
3.48%, 16.99%, 48.90%, 46.78% 59.94%
35.22%, 5%
5.67%, 3.10%, 15.88%, 28.32% 37.80%
18.15% 10%
6: 5%
10%

7
78
4.78%, 5.68%, 16.33%, 15.28% 29.05%

14.22%
15% 1.20%, 9.23%, 13.71%, 10.57% 12.71%
9.48% 1
[4] J.Filipe and J.Cordeiro, Stepwise Enterprise Information

Systems, Portugal, pp.163-855, 2009.
[5]
[6]
K.Orlando, D.Frueh, D.Angelo, L.Dean, Threshold

Policy SAN Storage Performance Management Using
Tivoli Storage Productivity Center, pp.91-117, 2011.
[7]

(%)
( )
J.D.Pascual, Y.Shavitt add S.Uhlig. Traffic Monitoring

Traffic Monitoring and Analysis. pp. 22-63, 2011.
1:
MIC
NCCIT2015
K. Chandrasekaran, Survey on transport control in data

center networks Essentials of Cloud Computing, pp.26269, 2015.
1
2
4
8
16
UAMC
3.48
16.99
48.90
46.78
59.94
AMC(5)
5.67
3.10
15.88
28.32
37.80
AMC(10)
4.78
5.68
16.33
15.28
29.05
AMC(15)
1.20
9.23
13.71
10.57
12.71
35.22
18.15
14.22
9.48
[8]
M.Schubert and H.Boche, "Allocation and Transceiver"

QoS-based
Resource
Allocation
and
Transceiver
Optimization, vol 2, no.6, pp.383-529, 2006.

[9]
R.Rosen, Traffic Control, Linux Kernel Networking:

Implementation and Theory, pp.509-595, 2013
[10] S.Stidham a new approach to performance-oriented flow

control Optimal Design of Queueing Systems, pp.22-188,
2010.
[11] S.Sethi, Y.Hnatyshin, ABR The Practical OPNET User
Guide for Computer Network Simulation, pp.346-482,
2013.
[12]
[13]

[1]
A.Buecker, K.Browne, L.Foss, J.Jacobs, V.Jeremic,

C.Lorenz,
C.Stabler,
J.Herzele,
Multiple
Internet
Connections IBM Security Solutions Architecture for

Network, Server and Endpoint, pp.399-461, February
2011.
[2]
A.Konig, A.Dengel, K.Hinkelmann, K.Kise, J.Howlett,

and C.Jain, Bottleneck Flow Control Knowledge-Based
and Intelligent Information and Engineering Systems,
New York, pp.178-189, 2011.
[3]
B.Anjum, G. Perros, Bandwidth Allocation Bandwidth

Allocation for Video Under Quality of Service Constraints
USA, pp.28-46, 2015.
79
,

,
398-407, 2015.
, Bandwidth management Bandwidth
management ,
, , . 11-36, 2008.
NCCIT2015

The Analysis of Internet Infrastructure Network by Graph Theory:
The Case Study of Internet Infrastructure in Phetchaburi Rajabhat University
(Worawut Yimyam)1 (Veerachai Khonchoho)2
(Aongart Aun-a-nan)3
1
2
3

worawut_yimyam@hotmail.com, vekhon@gmail.com, aidedecampc31020@hotmail.co.uk
Abstract

( Graph Theory)
Degree Centrality (DC)
Betweenness Centrality (BC)
(Switch)

( Capability: C)

Switch DC It_DS2
( DC = 13)
Switch BC
It_DS2
(BC = 0.609524)
Switch C Ind_DS1
( C = 0.5 )
Switch

:

The objectives of this research are to study and

analyze the internet network system of Phetchaburi
Rajabhat University. The research tools were the Graph
Theory and the software Pajek to simulate network and
analyze connected network which is known as Switches.
Three measures were used to analyze the network:
1)Degree Centrality (DC) was employed to investigate
connection density of switches, 2)Betweenness Centrality
(BC) was used to investigate center of network, and
3)Capability (C) was employed to measure values
capability of switches. The results showed that the highest
value of Degree Centrality and Betweenness Centrality is
It_DS2 point Information Technology Building (DC = 13,
BC = 0.609524), the highest value of Capability is
Ind_DS1 point Industry Technology Building (C=0.5). The
study found that the most important switch is Information
Technology Building.
Keywords: Graph Theory, Complex Network Theory,
Degree Centrality, Betweenness Centrality.
1.
80
2.

(.. 2554 2556) [1]

Access Switch
Distribution Switch

Distribution Switch

Access Switch Distribution
Switch

Distribution Switch

(Degree Centrality)
(Betweenness Centrality)
Distribution Switch
Distribution Switch

2
3 4
5
NCCIT2015

2.1 (Complex Networks)
(Complex Network)

Complex Network 3
Random Network [2], Small-World Network [2], Scale-free
Network [2]
2.1.1 (Random Network) Erdos
Renyo (ER)

(Random Graph) (Vertices)
(Edge)
Vertices
2.1.2 (Small-World Network)
Watts Strogatz (WS)

2.1.3 (Scale-free Network)

Barabasi Albert (BA)

power-law distribution

81
Pajek

Pajek

Pajek Switch
Distribution Switch Switch Node
Distribution Switch Switch Edge

2.2 (Graph Theory)
(Graph Theory)

[3]
(Vertices) (Edge)
1
Vertices
Vertices
Vertices
Vertices
Edge
Edge
Undirected Graphs
NCCIT2015
3.

Degree Centrality
(DC) Betweenness Centrality (BC) Capability (C)

2
Directed Graphs
1:
1
2
(Undirected Graphs)

(Directed Graphs)

Set
Pajek
Input Vertices, Edges and
Memory of Switch
Data Collection
DC
= ( , )
(1)
Analysis
Visualization
BC
2:
( )

2.3 (Pajek)
Pajek

Pajek 1996
[4]

[5]

[6]
[7]
3.1 (Data Collection)

Switch Core Switch
Distribution Switch
Switch
12 Core Switch 4 4
Core Switch 1 Main Switch
Core Switch 3
Distribution Switch

82
C Switch
Memory Flash Memory

Distribution Switch 3
Switch
3.2 (Visualization)

Pajek
Node Switch 12
Node Node 3

3.3
Degree Centrality (DC)
Betweenness Centrality (BC) Capability (C)
DC

[8]
4.
(4)

DC BC C
4.1

Pajek
Switch
3
= 1
= 0
BC

(Switch)
(Switch)

(Ram) Distribution
Switch
Distribution Switch
3.4

3 Switch
DC (2)
Switch
BC
(3) C
(4) DC BC C

(2)
() =
NCCIT2015
(3)
i
j
i j
3:
83
4.2
DC
DC
DC
4 DC 9.333
DC 3
1
2: BC 3
Rank
Label
1
It_DS2
2
Ms_DS3
3
Ind_DS1
Val
0.609524
0.233333
0.233333
2 BC
Switch

iT_DS2 Switch
0.609524
C
C
C
6 C 0.667
C 3 3
4: DC
1: DC 3
Rank
Label
1
It_DS2
2
Ms_DS3
3
Ind_DS1
NCCIT2015
Val
13
8
7
1 DC
Switch
iT_DS2 Switch
13
BC
BC
BC
5 BC 0.35873
BC 3
2
6: C
3: C 3
Order
Label
Memory Capability
1
Ind_DS1
512 MB
1
2
It_DS2
256 MB
0.5
3
Ms_DS3
256 MB
0.5
3 C
Switch
Ind_DS1 Switch
1
5: BC
84
4.3 DC BC C
DC
1 BC 2 It_DS2

DCIt_DS2 = 13 BCIt_DS2 = 0.609524
C 3
7
NCCIT2015
Flash Memory
(Network
Traffic)
[1]
,
.. 2554 - 2556. :
, 2554.
[2] X. F. Wang and G. Chen, Complex networks: smallworld, scale-free and beyond, IEEE Circuits Syst. Mag.,
100%
vol. 3, no. 1, pp. 620, 2003.
95%
90%
[3]
85%
80%
75%
It_DS2
Ms_DS3
DC
BC
,
(Social Network Theory). :
.
[4] A. M. Vladimir Batagelj, Pajek Program for Analysis and
Ind_DS1
Visualization of Large Networks Reference Manual List of
commands with short explanation version BE, 1999.
7: DC BC C
[5] P. Wang, Analysis of the Topology Structure of Network

of Chinese Stock Market, in 2012 International
7 Switch DC
BC C
DC BC C
Swatch
Conference on Management of e-Commerce and eGovernment (ICMeCG), 2012, pp. 403407.

[6] J. Li and J. Ma, Complexity and Optimization Analysis of
Spatial Network, in International Seminar on Future
Information Technology and Management Engineering,
2008. FITME 08, 2008, pp. 206209.
5.
[7] X. Tan, T. Tian, and G. Liu, Features analysis of small-

Distribution Switch

3 Distribution
Switch It_DS2
Distribution Switch

3 3
Capability Degree Capability
Distribution Switch
Capability
cell lung cancer signal transduction network by method of

complex network, in BioMedical Information
Engineering, 2009. FBIE 2009. International Conference
on Future, 2009, pp. 912.
[8]
85
,
, ,
vol. 5, no. 2, Jan. 2013.
NCCIT2015

Rogue DHCP Protection Using Elliptic Curve Digital Signature Algorithm
(Theerasak Thongyan)1 (Somnuk Puangpronpitag)2

1
theerasak.t@msu.ac.th, 2somnuk.p@msu.ac.th
Applying digital signature to DHCP can be one of the

RFC 3118 .. 2001
DHCP

DHCP 14
ECDSA

DSA / RSA
DHCP
ECDSA

:
3118 has suggested that the overhead of the digital
promising solution to this problem. Yet, since 2001, RFC
Rogue DHCP DHCP
signature would make it very inefficient. So, the digital

signature solution has been long ignored. However, we
believe
that
the
computation
powers
of
DHCP
servers/clients have been dramatically increased during

the last 14 years. Also, the Elliptic Curve Digital Signature
Algorithm (ECDSA) has a very lightweight overhead
comparing to the classical DSA/RSA digital signature.
Hence, in this paper, we propose a solution, based on an
ECDSA digital signature, to fix the rogue DHCP problem.
We have also prototyped our solution and implemented it
on a test-bed. The experiments on the test-bed have
revealed
the
high
effectiveness
of
our
solution.
Furthermore, the overhead of ECDSA seems to be in a

level of high possibility to be implemented in the real
world.
Keywords: Rogue DHCP, Digital Signature, ECDSA.
1.
DHCP
(Dynamic Host Configuration Protocol) [1]

DHCP

Abstract
Rogue DHCP is an intimidating threat to DHCP

systems. It can happen both accidentally and intentionally.
During the last few years, there have been several
proposals to solve this problem. However, most of all
proposed solutions have been proven to be ineffective.
86
NCCIT2015
10

Rogue DHCP [2]

malware

DoS (Denial of Services) [3]
(MITM: Man in the Middle) [4]
website hijacking
browse web
(DNS Spoofing) [5]

Rogue DHCP
plaintext token
DHCP
hacker token
Rogue DHCP [6]
shared key DHCP
HMAC
Rogue DHCP [6]
overhead [7-8]
DHCP IP address DHCP
server
configure [9]
ADDS (Active Directory Domain Services)
Microsoft

Unix-based OS [10]

DHCP
[6-8]

RSA DSA
Rogue DHCP
ECDSA
(Elliptic Curve Digital Signature Algorithm)
DSA RSA
ECDSA overhead
2.
2.1 (DHCP)
DHCP (Dynamic Host Configuration Protocol) [1]

4 1
1: DHCP
1. Discover

2. Offer

3. Request

4. Acknowledgement

2.2 Rogue DHCP
Rogue DHCP [2]
DHCP

hacker
87
1. DoS (Denial of Services) [3]

Rogue DHCP
2. MITM (Man in the Middle) attack [4]
Rogue DHCP gateway

gateway
3. DNS Spoofing [5]
Rogue DHCP DNS
DNS
redirect
web
site hijacking pharming
2.3 (Digital Signature)

[11]

(Authentication)

(Private Key)
(Public Key)

rogue DHCP ( RSA, DSA)

[6-7]
2.4 ECDSA (Elliptic Curve Digital Signature Algorithm)
ECDSA
RSA DSA ECC (Elliptic Curve
Cryptography) [11] Neal Koblitz
Victor S. Miller .. 1985
y2=x3+ax+b RSA/DSA
1 ECC

ECC

NCCIT2015
Pocket PC PDA
ECC DHCP

1: [8]
Key Size: DSA/RSA vs. ECC
DSA/RSA Key (bits)
ECDSA key (bits)
1,024
160
2,048
224
3,072
256
7,680
384
15,360
512
2.5
Droms Arbaugh [6]
Rogue DHCP (1) Token (2)
Delayed Authentication
RFC3118 IETF
Token (Plain Text)
DHCP
Token

Delayed Authentication shared key

HMAC (Hash Message Authentication Code)
shared key MD5 hash algorithm
DoS
(Flooding) shared key
DHCP
Hacker Hacker
key Rogue DHCP
[9]

DHCP
DHCP Client DHCP Server IP address

DHCP
Hacker IP Rogue DHCP

88
NCCIT2015
Dinu Togan [7]

overhead
RSA/DSA overhead

3.
3.1
DHCP 4
Discover, Offer, Request Acknowledgement

Offer 2
Discover
Offer message

Server Public Key Server
( Digital Certificate PKI (Public
Key Infrastructure)) DHCP server
IP network configuration
request message
DHCP
discover message DHCP Server
DHCP Server
Private Key share
DHCP client delay authentication [6] share
key DHCP client
Public Key share DHCP client

public
key digital certificate CA (Certification
Authority) operating system

2:
3.2
JDHCP (Java Implement for DHCP)

3 (1) ECC 224
RSA 2048
[12] (2) ECC 256
Google Mail (3) ECC 384
top secret [12]
JDHCP
Message
Message DHCP Option 223
DHCP Option 222
Message 20 Length

3
3:
89
3.3

public key
private key Windows7
1. Rogue DHCP

2 Valid DHCP
Server Rogue DHCP 1

8 1 LAN
NCCIT2015
ECDSA
3.2
50

error bar 95%

60
APIPA (Automatic Private IP Addressing)
IP Address assign 169.158.x.x DHCP [13]
4.
4.1 Rogue DHCP

Rogue DHCP
Rogue DHCP

Rogue
environment Rogue DHCP server

Valid DHCP server
Valid DHCP Server Rogue DHCP
configuration
4.3 overhead

JDHCP

2
2:
4:
JDHCP DHCP
DHCP Service
JDHCP 1 (
Rogue DHCP) S-JDHCP (JDHCP
Valid DHCP Server)
2
C-JDHCP (JDHCP
) C-JDHCP
1 2

2.

Discover
Acknowledgement Wireshark
()
224
256
384
No Signature
IP (ms)
95.1 1.3
98.1 1.3
121.2 2.3
18.7 1.5
224,
256, 384 95% 95.1, 98.1
90
NCCIT2015
Linux Windows

site
121.2 JDHCP
18.7
5

delay 60 APIPA
generate IP 169.158.x.x DHCP
Server
10

server overhead
DoS
S-JDHCP JAVA
overhead
C kernel
DHCP Server spec
CPU 2.8 GHz RAM 2 GB Hardware
DHCP Server Hardware
DHCP server
[1] R Droms, Dynamic Host Configuration Protocol, IETF RFC2131,

Mar 1997.
[2] E. Maiwald. Network Security A Beginner's Guide, Third Edition,
Paperback, pp. 15-22, Sep 2012.
[3] W. Stallings. Cryptography and Network Security: Principles and
Practice (5th Edition), Hardcover, pp. 809-814, 2011
[4] P. Kim, The Hacker Playbook: Practical Guide To Penetration
Testing,Paperback, Mar 2012.
[5] W. Stanek. Windows Server 2012 R2 Inside Out Volume 2:
Services, Security, & Infrastructure, Paperback, pp.171-198, May
2014.
[6] R. Droms, W. Arbaugh, Authentication for DHCP Messages, IETF
RFC 3118, Jun 2001.
[7] D. Dinu, M. Togan, DHCP Server Authentication using Digital
Certificates, Proceeding of the International Conference on
Communications, Bucharest, pp. 1-6, May 2004.
[8] S. Duangphasuk, S. Kungpisdan, S.Hankla, Design and
implementation of improved security protocols for DHCP using
digital certificates, International Conference on Networks (ICON),
Singapore, pp. 287 - 292, Dec 2011.
[9] , .
Rogue DHCP. CIT2011,
pp.171-176, 2554
[10] W. Stanek. Windows Server 2012 R2 Inside Out Volume 2:
Services, Security, & Infrastructure, Paperback, pp.623-650, May
2014.
[11] W. Stallings. Cryptography and Network Security: Principles and
Practice (5th Edition), Hardcover, pp 344-347, 2011
5.
Rogue DHCP

ECDSA

overhead overhead

224 384

overhead APIPA (Auto IP)
ECDSA
Rogue DHCP

OS kernel DHCP
Server module DHCP client
client
[12] Information Technology Laboratory. Digital Signature Standard

(DSS). National Institute for Standards and Technology (NIST),
FIPS PUB 186-4, Jul 2013.
[13] D. Lowe. Networking All-in-One for Dummies, Paperback,
pp.316-319, Nov 2012.
91
NCCIT2015

Development of Anti-Collision for Radio Frequency Identification (RFID)
(Sataya Boonchaleaw)1 (Chaiporn Jaikaeo)2

1
sataya.b@yais.me, 2chaiporn.j@ku.ac.th
1.
RFID system
(Reader) (Tag)
RFID

(Non Line of Sight ) [1]
(Radio Frequency
Identification, RFID)
RFID

RFID
RFID
EPC Global Class 1 Generation
2 (EPC C1G2)

EPC C1G2 18.83%
RFID Passive Tag

Active Tag
[1] Passive
Tag
RFID 4
[2] (Low Frequency, LF) 125 KHz
(High Frequency, HF) 13.56 MHz
1
(Ultra-High Frequency,
UHF) 868 MHz 915 MHz
2.4 GHz UHF
Motorola [3]

RFID UHF

Abstract
RFID system is an identification system that uses radio
frequency to automatically identify objects. When two or
more RFID tags transmit data at the same time, a collision
can occur, which results in more time spent to read all tags
in the system. This paper proposes two anti-collision
algorithms, called Collision Multiplier and Adaptive
RFID

Hardware Action Group (HAG)
EPCglobal Network EPC
Global Class 1 Generation 2 [4]
RFID
RFID
Binomial, which are compatible with the EPC C1G2

standard using frame slot estimation with Binomial
distribution. Numerical results show that, on average, the
proposed methods use 18.83% less identification time than
ECP C1G2 does.
Keyword: RFID, Collision
92

RFID
RFID

NCCIT2015
1 (Idle Slot) (4)

1 (3) (4)

(Collision Slot)
(5)
2.
1
1
() = 1

1
1
= () = 1

1
1
1 = 1
1
0 = 1
2.1 Dynamic Frame Slotted ALOHA (DFSA)

ALOHA [5]
ALOHA

Slotted ALOHA
ALOHA

1 1

Frame Slotted ALOHA (FSA)

()
[6], [7], [8] (1)
1
1
1 (1)

1
(2) 1

1 (Success Slot) (3)
0
= 1 0
(1)
(2)
(3)
(4)
(5)
FSA

Dynamic Frame Slotted ALOHA (DFSA)
FSA
DFSA

RFID
RFID EPC Global Class 1 Generation 2
2.2 EPC Global Class 1 Generation 2 (EPC C1G2)

EPC C1G2 [4]
DFSA
QUERY =4
22
0 21
16 RN16 RN16

QueryRep 4
RN16
ACK
2 RN16 18
RN16 96
93
NCCIT2015
QUERY

1
256
16 (CRC Code)
QueryRep
4
1
fp
- (Success) fp
- 1 (Collision)
2.2 EPC Global Class 1 Generation 2 (EPC C1G2)
EPC C1G2 [4]
DFSA
QUERY = 4 22
0
2 1 16 RN16
RN16

QueryRep 4

RN16
ACK 2 RN16
18 RN16
96 256
16 (CRC Code)

QueryRep 4

1
- (Success)
- 1 (Collision)
= min + , 15
- (Idle) =
1: EPC C1G2
2.3 (Lower Bound)

Collision Idle Success
[7]

Collision Slot 1
= 2
(6)
2.4 Chebyshev H. Vogt

H. Vogt [8]
Chebyshev

Vogt 0
celi 0.15
- 0 15

94

EPC C1G2

(Symmetric
Arithmetic Rounding)
(8)
Idle Slot 1 1 Success Slot 1

Collision Slot 1
(, , 0, 1 , )
0 , 1 ,
(0 , 1 , ) (3) (4) (5)
(, , 0, 1 , )

(, , 0 , 1 , ) =
0
0
arg min
1 1
NCCIT2015
(7)
0 , 1 ,

1
1: Chebyshev Estimation
4
5
6
7
8
Lowest
1
10
17
51
112
Highest
9
27
56
129
log(round( ))
= round
log 2
(8)
= 2.95
(9)
1.5 6
100 1,000

2
2.95
Collision Multiplier

3.
EPC C1G2

QueryAdj QueryRep
ECP C1G2

2
3.1
(Collision
Multiplier)
DFSA

2:
1.5 6
95
3.2

(Adaptive Binomial)
(3) (4) (5)
Success Idle Collision 1
0 Idle
Slot 1 1 Success Slot 1
Collision Slot 1
( )
- 0 1 1 0

-
0
1

EPC C1G2
Lower Bound, H.
Vogt, Collision Multiplier Adaptive Binomial

(14)
estimation error rate =
0 0 1 1
W() Lambert W function
W
1 (N 1) log
log
(11)
0 1 1
1
1
=
1 1
0
(12)
= 2
(13)
(14)
1
200 1
1,000
3
Lower Bound
30-40% H.
Vogt 50
100
Collision Multiplier
20-30% Adaptive Binomial
10%
(10)
= log11
NCCIT2015
0 1 0

(8) Collision Multiplier
4.

Python 3 SciPy NumPy
EPC
C1G2

3:
6
EPC C1G2, Lower Bound, H. Vogt,
Collision Multiplier Adaptive Binomial
(Ideal)
96
NCCIT2015
5.
Collision Idle 1

1
1,000 1
1,000
4
Adaptive Binomial

5 Collision
Multiplier
Lower Bound EPC
C1G2 6.22% Adaptive Binomial
180
EPC C1G2
18.83%
RFID
EPC C1G2
EPC C1G2

Adaptive Binomial
Adaptive Binomial
EPC C1G2
Adaptive Binomial EPC
C1G2

JICA-JST Science and
Technology Research Partnership for Sustainable Development
[1]
,
: Radio Frequency Identification (RFID) System,
, ,
2552
[2]
[3]
4:
[4]
[5]
[6]
[7]
[8]
[9]
5:
97
L. Bolotnyy and G. Robins, The Case for Multi-Tag

RFID Systems, International Conference on Wireless
Algorithms, Systems and Applications, 2007.
www.zebra.com, FX9500 Fixed RFID Reader,
https://www.zebra.com/us/en/products/rfid/rfidreaders/fx9500.html, April 3, 2015, Zebra Technologies
Corporation.
EPCglobal, EPC radio-frequency identity protocols class
1 generation 2 at 860 MHz-960 MHz, version 1.2.0, Oct.
2008.
Chang T. and Jia L., Analysis and Simulation of RFID
Anti-collision Algorithms, The 4th IEEE International
Conference on Autonomic Computing 2007.
D. J. Deng and H. W. Tsao, Optimal Dynamic Framed
Slotted ALOHA Based Anti-Collision Algorithm for
RFID Systems, Wireless Pers Commun, vol.59, pp. 109122, 2011.
H. Vogt, Multiple Object Identification with Passive
RFID Tags, IEEE International Conference on Systems,
Man and Cybernetics, 2002.
H. Vogt, Efficient Object Identification with Passive
RFID Tags, Proc. Pervasive 2002. Pp. 98-113, 2002.
W.-T Chen and W.-B. Kao, A novel Q-algorithm for
EPCglobal Class-1 Generation-2 Anti-collision Protocol,
Internationational Scholarly and Scientific Research and

Innovation 2011, vol.5, no. 6, pp. 667-670, 2011.
[10] Jia L. and Youguang Z., The analysis of anti-collision
algorithm based on timeslot in RFID system,
Communication and Network Conference 2006.
[11] Dheeraj K. T. et al., On the Accuracy of RFID Tag
Estimation Fucntions, International Symposium on
Communications and Information Technologies (ISCIT
2007), 17-19 Oct., pp. 1401-1406.
98
NCCIT2015
NCCIT2015

An Analysis of Safety and Security for Internet Banking in Thailand
(Pattanarat Putla) 1 (Somnuk Puangpronpitag) 2

1
54011280518 @0365.msu.ac.th, 2somnuk.p@msu.ac.th
have been proposed to analyze this problem. Yet, most of them still
have some drawbacks. Some of them have done the analysis only
Internet Banking
Internet
Banking

( ) ( )

(1)
(2)
(3)
(4)

6

(Safety)
(Security) Internet Banking
:

on the technical (security) or the management (safety) side but not

on both. Most of them have failed to provide all of these significant
points: checking safety/security best practice standard, noticing the
occurred crime cases, making detailed observation on the real
services, testing to break the real internet banking systems on the
user side. Hence, in this paper, we propose to analyze both safety &
security and cover all the aforementioned significant points. By
studying on 6 banks in Thailand, we have found several
weaknesses of both safety and security. The contribution from this
work can be a guiding direction to improve the security and safety
of i-banking systems.
Keywords: Internet Banking, Safety, Security, Social
Engineer, SSL attacks.
1.
Internet Banking
( )
[1] 4
.. 2553 .. 2557
Internet Banking [2]

[3-7]
Internet Banking
security ( )
safety ( )

Abstract
Due to its convenience, internet banking systems have recently
been growing and widely used in Thailand. However, safety and
security are big issues of the internet banking systems. The number
of the crimes on internet banking attacks has been dramatically
increased during the last few years. So, several previous works
99
NCCIT2015
[5]
Internet Banking [6, 7]
Username Password OTP
Call Center

(DSI) 3-4 SSL

Internet Banking

SSL
(Man in the Middle:
MITM) SSL Sniff SSL
Strip
(Security)
2.3
Internet Banking

Internet Banking
ISO/IEC 27001:2005 ISO/IEC 1799:2005

Internet
Banking (Safety)
2.4
[9]
Internet Banking 1 6
6

2
(1) (Safety)

ISO/IEC 27001:2005 ISO/IEC 1799:2005

(Social Engineering) [8] (2)
(Security)
Hacker
Internet Banking 3-4

2.
2.1 Internet Banking

.. 2553 .. 2556
Internet Banking
1 ..2553
62,259.51 .. 2556
173,568.48
1: Internet Banking [1]

2.2 Internet Banking
Internet Banking
[2]

100
NCCIT2015
ACIS Research LAB [2]

Internet Banking
Mobile Banking
16 8
7

Security
Safety Hacker

Internet Banking

Internet Banking
Internet Banking

Internet Banking
[10]
SSL Stripping

SSL Stripping
SSL

Social Engineering
[11]

6
6

[12]

2 ISO/IEC 17799:2005
ISO/IEC 27001:2005 Gap Analysis

3.
Internet Banking
2 (Safety)
(Security)

6 Internet banking

A-F
1-31 .. 2557

101

3.1 (Safety)

Internet Banking
(Social Engineering )
Internet Banking

2
NCCIT2015
3: (Security)
(1)
SSL Sniff (2) SSL Strip

[13] 3 (1) Google Chrome
(2) Internet Explore (3) Mozilla Firefox

2: (Safety)
4.

(1) (2)
Internet Banking (3) Login
(4) Username (5) Password
(6) OTP (7) OTP
(8) (9)
Internet Banking (10)
3.2 (Security)

Internet Banking
Hacker
3-4
(DSI)
SSL
3

(Safety)
1 (Security)
2
4.1

1
1: (Safety)

(Safety) A B C D
1.
/ / / /
1.1.
/ x / x
1.2. +
x x / x
1.3. +
102
E F
/
x
x
/
/
/
2. Internet Banking
2.1.
2.2. ATM
2.3.
3. Login
3.1. Username
3.2. Password
3.3. Captcha
3.4. Limit Login
4. Username
4.1. Reset
4.2. Reset Call Center
4.3. Reset
5. Password
5.1. Reset
5.2. Reset Call Center
5.3. Reset
6. OTP
6.1.
6.2. ATM
6.3.
7. OTP
7.1. OTP/
7.2. OTP
7.3. OTP
7.4. OTP
7.5. OTP
8.
8.1. Visual Keyboard
8.2. Log Files
8.3. Log In
8.4.
8.5.
8.6. Auto Log Off
9. Internet Banking
9.1.
9.2.
9.3. Call Center
10.
10.1.
10.2. +
10.3. +
/ / / / /
/ / / / /
/ / / x /
x
x
/
/
/
x
4
/
/
x
3
/
/
x
3
x / / x /
/ / x / x
/ x x / x
x
/
/
x x / x x
/ x / / /
/ / x / x
x
/
/
x / / / /
/ / x / x
x x x x x
/
x
/
/
/
/
3
/
/
x
5
/
/
x
3
5
/
/
/
/
5
/
/
/
/
6
/
/
x
/
3
/
/
/
/
5 12
/ /
/ /
/ /
/ /
/
/
/
/
/
/
x
x
/
/
x
/
x
/
x
/
x
/
x
/
/
/
/
/
/
/
/
/
/
/
/
x
x
/
/
/
x / / x /
x / x x x
/ / x / x
x
/
x
x / x / x
/ / / / /
/ x / x x
x
/
/
NCCIT2015
1

Internet Banking

[4, 5, 7] 5 5
ATM 5
1
VDO Call Net Officer
Log In Username
Password 1
CAPTCHA brute-force
password login
Limit Log-in
Account Limit
Log-in
password
Account Denial of Service (DoS)

Username Password
Reset Reset
Reset Call
Center
Call Center

OTP

[4]

OTP
Malware
103
3 Visual Keyboard
1 OTP

Username Password 4 Log File 4
4

[14]
4.2

2 (1) SSL Sniff
(2) SSL Strip
browser account
6 2
2: (Security)

(Safety)
1. (SSL Sniff)
1.1. CA
1.2.
1.3.
2. (SSL Strip)
2.1. SSL
2.2.
2.3.
A B C D E F
/ / / / / /
/ / / / x /
x x x x
x
NCCIT2015
(Safety)

(2) (Security)

SSL Sniff SSL Strip

Internet Banking

2
3 4

6

Mobile banking
App
6.

(DSI) IT Crime
Internet Banking
IT Security ( )

/ / / / / /
/ / / / / /
x x x x / x

3 1
SSL
SSL Sniff SSL
Strip 5 2
[1]
[2]
,
Mobile banking Internet banking,
http://www2.bot.or.th/statistics/BOTWEBSTAT.aspx?repo
rtID=688&language=TH.
ACIS Article,

InternetBanking Mobile Banking

,
5.
2
(1)
[3]
http://www.acisonline.net/article/?p=34.
it24hrs.com, Play Store
Android,
104
[4]
it24hrs.com, Internet
Banking ,
http://www.it24hrs.com/2014/hack-otp-banking-changenew-sim-card-2/.
[5]
[6]
[7]
, :
,
http://www.bot.or.th/Thai/EconomicConditions/Thai/South
/EconomicPapers/ReasearchPaper/Bad_effect_offshore_o
penAC.pdf
it24hrs.com, Internet
Banking ,
http://www.it24hrs.com/2014/hack-otp-banking-changenew-sim-card-2/.
it24hrs.com, e-Banking
. http://www.it24hrs.com/2013/stealingmoney-criminal-subrogate-bank/.
[8]
, Social Engineering,
https://www.thaicert.or.th/papers/general/2012/pa2012ge
017.html
[9] Subsorn P. A , comparative analysis of the security of
internet banking in Australia:a customer perspective,
International Cyber Resilience conference, pp69-83.
[10] ,
[11]
[12]
,
, 10 1.
,

, , 23
1 141-152.
,

: : ,
.
[13] statcounter, Top 5 Desktop,Tablet & Console Browsers

in Thailandfrom Jan 2014 to Jan 2015 ,
http://gs.statcounter.com/#browser-TH-monthly-201401201501-bar.
[14] ,

.. , , 129
191.
105
NCCIT2015
NCCIT2015

Social Network Analysis Case Study Kanchanaburi Rajabhat University
(Sureewan Jangjit )

sureewan@kru.ac.th
University: KRU with Degree centrality, Closeness centrality

and Betweeness centrality and 2) find average hop for send

1)

,

2)

1) In-degree centrality
E4
45
10 , Out-degree centrality
E2
45 10 ,
In-closeness
0.1031 Out-closeness 0.4261 E2
0.03598 E2
2) 1
Hopavg 1.7
Out-degree

: , ,

information in KRU.
The results of the social network analysis, 1) In-degree
centrality the highest node is E4 feature such as male,
instructor, Faculty of Education, live inside of KRU campus,
over 45 years of age and over 10 years of work, Out-degree
centrality the highest node is E2 , feature such as female,
instructor, Faculty of Education, live outside of KRU campus,
over 45 years of age and over 10 years of work, In-closeness
is 0 .1 0 3 1 and Out-closeness is 0 .4 2 6 1 the node is E2 and
Betweeness centrality is 0 .0 3 5 9 8 the highest node is E2, 2)
Average hop for send information, the results showed that
method 1: Hopavg= 1.7, the finding in indicates if send
information in KRU through the highest Out-degree centrality
are shortest path.
Keywords: Social Network, Centrality, HOP.
1.
(Social network)

Abstract
The Social network analysis is the study relationship
between people or things around. The purposes of the study
were to 1) analyze social network of Kanchanburi Rajabhat
106
NCCIT2015
2.2

[1]

2.2.1
(Social network analysis;
SNA)
3
(Degree centrality)
(Closeness centrality)
(Betweeness centrality)
2.2.1.1

Indegree (Path)

Out-degree

(1)
(1)
g
2
2
1)

2)

3)

4)

5)

(Social understanding)
(Social value)
(Social practice)

6)

,

S D = (C D (ni ) Cd ) / g
i =1
2.2.1.2

In-closeness Out-closeness
1
(2)
2.
2.1
(Graph) (Nodes)
(Edge) G=(N,E)
(Degree)
2
(In-degree)
(Out-degree)
Cc (ni ) = d (ni , n j )
j =1
(2)
2.2.1.3
(Betweeness centrality)

107
[4]

(degree)
[2], Mh370

,
[5]

2 (leader group A)
(follower group B)
(optimal sequencing strategy) [6],

[7]

Pajek

(N) = SNT
ST (N)
(3)
ST
(3)
ST = (shortest paths)
S N
2.2.1.4

Hop
(4) E Hopavg
(5) N
Hop =
=1
Hopavg=
=1
NCCIT2015
(4)
(5)
2.3 Pajek simulation tool

Pajek
(Large networks)

[2]
2.4
pajek (network
theory)
(subway construction accident network:
SCAN) [3],
(actors)
(Central Finland)
(information-sharing)
3.
3.1
G
, N
, E

, In-degree
, Out-degree
,
S S1S37, E E1-E37, M
M1-M29, H
H1H26, I I1-I16,
108
(address) ={ (in),
(out)} (range of age) = {<25, 25-35,
36-45, >45}
3.2
2 1
2
2
1
10
1
2 10
M1
Pajek
centrality Degree, Closseness, Betweenness
Output
E2
...
M3
MN-1
EN-1
MN
2:
2
M1 E1E2E3..EN-1EN
3.3

Yamanes
5%
145 (Sampling
random)
5

(Simple random sampling)
2
3.4
145

3.5

Pajek
Pajak

Process
M2
EN
Input
E1
NCCIT2015
1:
1
Pajek
(Input)

Pajek
(Process)
Pajek
(Output)
Pajek
109
4. (Experimental result)
NCCIT2015
E2
3

10
4.1
1 E2 Outputcloseness 1

E2
Out-degree centrality
M9, E9, H22, H3, S9, E20, E24, H4
S17
3:
1:
2 Out-degree
10
(instructor)
E2
2: Out-degree centrality
1-10
3:
3

4.2
1 E2M9E9H22H3S9
E20E24H4S17 Outdegree 10 Hopavg=1.7
2 10
E5E29M19H6S14E36H18I5S9 I12
Hopavg=2
0.03598
3 E2
0.0412 1-2
110
4: Hopavg
1
Hop
E2
1
M9
2
E9
2
H22
2
H3
3
S9
1
E20
1
E24
2
H4
2
S17
1
Hopavg
1.7
NCCIT2015

3
E2

10

Partial network

Complete network

2

Hop
E5
3
E29
2
M19
1
H6
1
S14
1
E36
3
H18
3
I5
2
S9
1
I12
3
Hopavg
2
4
Out-degree ( 1)
Hopavg
[1]
, "
," ed:
(.).
[2] B. W. Wambeke, et al., "Using Pajek and Centrality Analysis
5.
to Identify a Social Network of Construction Trades," Journal

of Construction Engineering & Management, vol. 138, pp.

3 1
, 2
3

1 E2

1
Hop 2

Hop

Hop

1192-1201, 2012.
[3] Z. Zhou, et al., "Using network theory to explore the
complexity of subway construction accident network (SCAN)
for promoting safety management," Safety Science, vol. 64,
pp. 127-136, 2014.
[4] R. Borg, et al., "Social capital and governance: a social
network analysis of forest biodiversity collaboration in
Central Finland," Forest Policy and Economics, vol. 50, pp.
90-97, 2015.
[5] M. Z. Al-Taie, et al., "Flight MH370 Community Structure,"
International Journal of Advances in Soft Computing & Its
Applications, vol. 6, pp. 1-20, 2014.
[6] J. Zhou and Y.-J. Chen, "Key leaders in social networks,"
Journal of Economic Theory, vol. 157, pp. 212-235, 2015.
[7] Y. Girard, et al., "How individual characteristics shape the
structure of social networks," Journal of Economic Behavior
& Organization.
111
NCCIT2015

IP Network Logging Management System with Automatically
Error Message Categorization
(Ponghathai Kanjanapart)1
(Montean Rattanasiriwongwut)2

1
Kponghathai@gmail.com, 2Montean@it.kmutnb.ac.th
of classifiers, Nave Bayes, Decision tree and Support

Vector Machine (SVM), were tested to classify error

3 ,
(Support Vector Machine
:SVM) 4
CONFIG, HARDWARE, SOFTWARE OTHER

SVM
82%
SVM Lookup

x = 4.57 S.D. 0.57

:

messages into 4 groups: (1) CONFIG (2) HARDWARE

(3) SOFTWARE and (4) OTHER. The result of classify
when compare with the expert's result, SVM can classify
correctly about 82% and be the classified which is the
most closely to the expert's result. And because of that,
this system decides to use SVM for create the Lookup
table to classify group error message and estimate
satisfaction with a questionnaire has x of 4.57 and S.D.
of 0.57, so the quality of system is in very good level.
Keywords:
Network
network
logging
management
system
Classification,
Management
IP
Network,
System,
Logging
Management.
1.
(Network System)

[1]

(Network Management System: NMS)

[2]

Abstract
IP
Message
with
automatically error message categorization was designed

to support the fault management of IP network. The
system consists of logging the faults to store information
and display to let users know. This system was developed
to classify the error message automatically. Three types
112
NCCIT2015
2.1.1 (Decision Tree)

(Prediction)
(Classification)

(Top Down)

(attribute)

(Branches)

(Gain Ratio)

[4]
2.1.2 (Nave Bayes)

(Bayes Theorem)

P(H) H
P(H|E) H
E

(1) [5]
(Indexing)

[3]
(Text Categorization) 3
(Decision Tree) (Nave Bayes)
(SVM)
(Classifier)

4 Config, Hardware, Software Other

2.
2.1 (Text Categorization)

(Text Categorization)

(Automatic Text Classifier)
[3]
2.1.3 (SVM)

2 SVM

(Kernel Function)

113
NCCIT2015
3.2

500
[10] 4 CONFIG, HARDWARE,
SOFTWARE OTHER
explanation
(bag of words) (training set)
3 ,
SVM WEKA
10 Fold Cross-Validation 1
(Feature Space)

(Vector)
[6,7]
2.2

[6]
SVM
(Phrase)
(single word)
SVM Linear
94.6%
[8] SVM
Longest Matching
Information Gain SVM
Linear
Polynomial Degree 3 F-measure
OpenNMS [9]
(Opensource)
(Enterprise)

1: WEKA
3.3 Lookup
3

explanation
Lookup
2
3.
3.1

Cisco [10]
explanation

explanation
2: Lookup
3.4
114
NCCIT2015
3:

Lookup

Lookup

3.5

UML (Unified
Modeling Language)

(Use Case Diagram) 4
4:
3.6

PHP
MySQL

Lookup
3.7
3.7.1

3
(2)

Lookup
x 100 (2)
500

(2) 5
115
5:
NCCIT2015
6:
SVM
Lookup
3.7.2
5 15

4
(Functional
Requirement Test)
(Functional Test)
(Usability Test)
(Security Test)

2
(IOC)
(Reliability) IOC 0.941
0.926

7:
8:
4.
4.2

SVM 82%
4.1

6, 7 8
6 7
8

116
1:*
S.D.
4.63
0.57
4.76
0.43
4.35
0.63
4.56
0.59
4.57
0.57
NCCIT2015
4.57
S.D. 0.57

5.3

Syslog Server

5.
[1]
Andrew Tanenbaum, Computer Networks, Prentice Hall:

New Jersey, 2002.
5.1

3
SVM
3
500
SVM
(82%) 2 (78%)
(52%)

SVM

SVM
5.2
4 3

[2]
, NMS ,
http://www.school.net.th/library/snet1/network/nms.html
[3]
Fabrizio Sebastiani, Machine Learning in Automated

Text Categorization ACM Computing Surveys, vol. 34,
pp.1-47, 2002.
[4]
J.R. Quinlan, C4.5:Programs for Machine Learning,

Morgan Kaufmann Publishers: Massachusetts, 1993.
[5] D.D. Lewis, Nave Bayes at Forty: The Independence

Assumption in Information Retrieval Proceedings of
European Conference on Machine Learning, pp. 4-15,
1998.
[6]
[7]
,
SVM

, 2548.
C. Cortes and V. Vapnik Support Vector Networks
Machine Learning, vol.2 , pp. 273-297, 1995.
[8]
[9]
, ,

6, 87-92, 2553
OpenNMS Group, OpenNMS Manual,
http://www.opennms.org/wiki/Manual:Main_Page
[10]**Cisco, Cisco IOS XR System Error Message Reference

Guide, Cisco System Inc., 2012.
117
NCCIT2015

Classification of Open Source Earthquake Disaster Information
in Thai Language
(Yuttana Lungkatoong)1 (Maleerat Sodanil)2

1
yuttana.la@gmail.com, 2maleerat.s@it.kmutnb.ac.th
Earthquake disaster is one of natural disaster, which is

difficult to avoid even not often to occur. In order to get

Thairath.co.th, Krobkruakao.com,
Komchadluek.net ( Web portal)
Sanook.com (Social media)
Twitter.com 15,000

:

help fast and appropriate to alleviate the suffering of the

victims, we should informed as soon as possible either
even from typical or social media. This paper presents text
mining of classification method using Open Source
information in domain of Earthquake Disaster. A corpus
of Thai Language is collected from Thairath.com
Krobkruakao.com Komchadluek.com Sanook.com and
Twitter.com with total 15,000 records. The experiments
were conducted using two classifier methods Support
Vector Machine and Nave Bayes. The performance is
measured for both classifiers. The results shown that
Support Vector Machine given the best choice of
classification method compared to Nave Bayes in term of
accuracy.
Keywords: Natural Disaster, Earthquake, Text Mining,
Support Vector Machine, Nave Bayes,
Machine Learning.
1.
(Natural Disaster)

(Earthquake)

Abstract
When a natural disaster occurred, it often leads to
damage a lot of life and property of the human being.
118
NCCIT2015
Machine Learning
(Artificial Intelligence)

(Supervised Learning )
(Unsupervised Learning ) [2]
2.2 Classification Method
2.2.1 (Support Vector
Machine : SVM)

Decision hyperplane

Support Vector
Decision hyperplane
T
x
w
= -b
(1)
T
hyperplane
w
x hyperplane
b hyperplane
.. 2553

2557

(Tsunami)

Social Media

Haruechaiyasak [1]
Twitter

2554

Social Medial

2.
2.1 (Machine Learning)

119
nd

Maximum a Posteriori (MAP)
6
(6)
cmap =arg max P (c|d) =arg max
P(c)
P(tk |c)
SVM
+1 -1
T
f(x
)=w
x
+b
(2)

1

-1
Nonlinear SVM

the kernel trick kernel
Kernel Polynomial Kernels
Radial Basis Functions (RBF) [3] 3 4
T d
K(x
,z)=(1+x
z)
(3)
2
2
)
K(x
,z)=e-(x-z /(2 )
(4)
K(x
,z) Kernel function
x z Input Space
d
Kernel
2.2.2 (Nave Bayes)

5
P(c|d)P(c) P(tk |c)
1 k nd
NCCIT2015
cC
cC
1 k nd
6

(Logarithm) 7 [3]
cmap =arg max [log P (c) + log P (tk |c) ]
cC
1 k nd
(7)
2.3 (Social Media)

(Social Media)
Haruechaiyasak [1] [4]
Twitter
Facebook [4]

Zhou [5]
(Microblog)
(Yushu) 2553

Haruechaiyasak [1]
Twitter 2554
Backfired
[6]
2.4 Corpus
(Corpus)

(5)
c tk
P(tk|c)
tk d

t1 tnd d
P(tk |c)
120
NCCIT2015

[10] [11]
[12]
[13] [14] [5] [15]

HTML XML JSON

AJAX (Asynchronous JavaScript
and XML) Catanese
[7] Facebook
Facebook API
Mfenyana [8]
RestFB & Jackson Facebook
Facebook API Wong [9] Headless
browser Java script
Document Object Model (DOM)
(Extract Knowledge)

(Classification) Zhou [5]
( Microblog)
Haruechaiyasak [1]
Keyword Analysis Rule base
Twitter Backfired [6]

Media Mining System SAIL LABS
14

2.5

(Unstructured)
(Text Mining)

3.
Thairath.co.th
Krobkroakao.com
komchadluek.net
Sanook.com
Gather information
Crawler
XML Parser
Feature Extraction
Model Development
Training
Model
Model
Twitter API
Term-Document
Matrix
Data Set
Model Assessment
Classifier
Predicted
Category
Accuracy
1:
3.1
1

Web Crawler

XML parser API

(Pattern)
121
3.3
Rapidminer 2

Process Document from Data
Term Document Metrix
(Tokenize)
(Stop Word)
(Filter Tokens)
(Model Training)

(Model
Testing)
k-fold Cross-validation k=10

15,000
3.2

LexTo 1

1. 2.
3.
4. 1
1:
Class
||..|-|.|-|||| | ||
||||| | |||
|| | ||||||
|
|(|100|)||?| |:| ||| || |||

||
(|29||.||.|)| || ||
||| ||||
| ||| |
||
\|"|||\|"| | ||||| |
||| | || |.|
|||| || ||| |118| |
|-|| || |
LexTo
NCCIT2015
4.

2
2:
Accuracy
Class
Nave Bayes
SVM
SVM
(Linear) (RBF)
1
87.48%
92.85%
0.00%
2
52.37%
75.80%
0.00%
3
77.99%
58.03%
0.00%
4
78.46%
95.07% 100.00%
76.72%
88.64% 45.90%
Overall
Accuracy

kernel Linear
: http://www.sansarn.com/lexto/download-lexto.php
122
Rapidminer : https://rapidminer.com/
88.64
76.72 kernel RBF
45.90
NCCIT2015
Security Informatics Conference (EISIC), 2012 European.

(2012) : 254-258.
[7]
Catanese, S. A., Meo, P. D. et al. Crawling Facebook for

social network analysis purposes. Proceedings of the
International Conference on Web Intelligence, Mining
5.
and Semantics. Sogndal, Norway (2011) : 1-8.

[8]

Kernel Linear RBF

Kernel Linear
88.64

Mfenyana, S., Moroosi, N. et al. Development of a

Facebook Crawler for Opinion Trend Monitoring and
Analysis Purposes: Case Study of Government Service
Delivery in Dwesa. Development. 79 (2013) .
[9]
Wong, C.-I., Wong, K.-Y. et al. Design of a Crawler for

Online Social Networks Analysis. WSEAS Transactions
on Communications. 13 (2014) .
[10] Korde, V., and Mahender, C. N. Text classification and

classifiers: A survey. International Journal of Artificial
Intelligence & Applications (IJAIA). 3 (2012) : 85-99.
[11] Dumais, S., Platt, J. et al. Inductive learning algorithms
and representations for text categorization. Proceedings
of the seventh international conference on Information
and knowledge management. Bethesda, Maryland, USA
(1998) : 148-155.

[1]
[12] Sebastiani, F. Machine learning in automated text

categorization. ACM Comput. Surv. 34 (2002) : 1-47.
Kongthon, A., Haruechaiyasak, C. et al. The role of
[13] Hassan, S., Muhammad, R., and Shaikh, M. S.
Twitter during a natural disaster: Case study of 2011 Thai
Comparing SVM and Nave Bayes classifiers for text
Flood. Technology Management for Emerging
categorization with Wikitology as knowledge
Technologies (PICMET), 2012 Proceedings of PICMET
enrichment. Multitopic Conference (INMIC), 2011 IEEE
'12. (2012) : 2227-2232.

[2]
14th International. (2011) : 31-34.
Alpaydin, E. Introduction to Machine Learning. : MIT
[14] Fanizzi, N., dAmato, C., and Esposito, F. Mining
Press, 2014.
[3]
Linked Open Data through Semi-supervised Learning
Manning, C. D., Raghavan, P., and Schtze, H.
Methods Based on Self-Training. Semantic Computing
Introduction to Information Retrieval. : Cambridge
(ICSC), 2012 IEEE Sixth International Conference.
University Press, 2008.

[4]
(2012) : 277-284.
Muralidharan, S., Rasmussen, L. et al. Hope for Haiti:
[15] Akaichi, J., Dhouioui, Z., and Lopez-Huertas Perez, M. J.
An analysis of Facebook and Twitter usage during the
Text mining facebook status updates for sentiment
earthquake relief efforts. Public Relations Review. 37
classification. System Theory, Control and Computing
(2011) : 175-177.
[5]
(ICSTCC), 2013 17th International Conference. (2013) :
Yanquan, Z., Lili, Y. et al. Classification of Microblogs
640-645.
for Support Emergency Responses: Case Study Yushu

Earthquake in China. System Sciences (HICSS), 2013
46th Hawaii International Conference on. (2013) : 15531562.
[6]
Backfried, G., Schmidt, C. et al. Open Source

Intelligence in Disaster Management. Intelligence and
123
NCCIT2015

Classification of Open Source Flood Disaster
Information in Thai Language
(Phatcharaporn Sitikomfu)1 (Maleerat Sodanil)2

1
Phatcharaporn2526@gmail.com, 2Maleerat.s@it.kmutnb.ac.th
1.

Twitter
(Web portal)
14,000

2

:

(Flood)

30%

[1]

4
[2] 2011
815
3 13.6
65
20,000 [3]

[4] Social Media

[5] Twitter
2011
Twitter 52%

(Web portal)

[6]
Abstract
This research aims to classify text from open source
data such as Twitter, News website reliable in Thailand
and Web portal in domain of flood disaster 14,000 record
using Text Mining techniques. The experiments were
conducted by comparing two classifier methods Naive
Bayes and SVM. The results show that SVM given better
performance than Naive Bayes in terms of accuracy.
Keywords: Natural Disasters, Flood, Text mining,
Classification, Support vector machines,
Nave Bayes.
124

Twitter,

2

NCCIT2015
P(B|A) B
A
P(A) A
P(B) B

Classification

(Text Classification)

(Attribute)
2 [8]
PA1 , A2 ,, An Cj = ni=1 P(Ai |Ci ) (2)
Cj n X = {A1, A2, , An}

P=(A1 ,A2,,An|Cj)
P=(Ai|Cj) i = 1, 2, 3,,n j = 1, 2, 3,, n
3
VNB =argmaxP(Cj ) ni=1 P(Ai |Ci )
(3)
2.
2.1

(Knowledge-Discovery in Text - KDT)
(
)

(Information retrieval), (Data mining),
(Machine learning), (Statistics)
(Computational linguistics)

(Structured)
(Unstructured)
(Semi-structured)
2.2

(A) (B)
1 [7]
P(B|A)P(A)
P(A|B)= P(B)
(1)
2.3
Cortes and Vapnik (1995)
(Minimize error)

2
2
(Optimal separating hyperplane) [8,9]

(Feature Space)

(Mercer Theorem) K
P(A|B) A
125
NCCIT2015

[5]
(Yushu Earthquake)
Twitter 6
Nave Bayes

(Training set)

5 , ,
,

[4]
2011 SVM
Twitter
2
[12]
Naive Bayes SVM
2

Blog Twitter
12 SVM
Naive Bayes [13]

Twitter
[6]

10 , , ,
, , , , , ,
SVM
95.1% [8]

Twitter

(x, xi) (Kernel Function)

(xi, yi),...,(xn, yn)
n m
y +1 -1 [8] 4
(xi, yi),...,(xn, yn) x Rm , y {+1,-1}
(4)
2
5
(w*x)+b=0
(5)
w b bias
6 7
(w*x)+b > 0 yi = +1
(6)
(7)
(w*x)+b < 0 yi = -1
Linear
Linear
[8,10]
2.4

Web Feeds, blogs, TV,
Social Media [11]
Twitter Social Media

Smartphones Mobile devices Real-time

2011
Twitter 52% Twitter
Thaiflood 64,582 Twitter
keyword rule based
Twitter 4 1)
2) 3)
4)

126

2
Nave Bayes SVM

14,000
1
1:

Thairath.com
Krobkruakao.com
Komchadluek.com
Sanook.com
Twitter
3.

2,300
2,400
2,000
2,600
4,700
3.2 Document Parser

import.io 1

(Thai Lexeme Tokenizer: LexTo) 2
(Training Set)
2
Document Parser
Train
2: (Training Set)
Detail
Class
||| |.| | | ||
1
||| ||| || || ||
|||||
| ||||
2
| ||||||||
|1| |||
|| | | | || |2| || |
3
| | || || |
|| |||||
|||| | || |1300| ||
4
||
Feature extraction
Model Builder
Test
NCCIT2015
Classifier
Flood Class
1:
3.1

1
2
127
https://import.io
http://www.sansarn.com/lexto/
3.3 (Feature extraction)

(Feature)

(Tokenize) (Filter Tokenize)
2 25
(Filter Stopword)

Rapidminer 3
2
NCCIT2015
2) 3)
4)
3.6 (Testing and Evaluation)

(Accuracy) 8 [14],[15]
TP+TN
Accuracy = TP+FP+FN+TN
(8)

Cj

TP Cj
Cj
FP Cj
Cj
FN Cj
Cj
TN Cj
Cj
2:
Rapidminer
3.4 (Model Builder)

2 Nave Bayes 3 SVM
4
4.
4.1

Algorithm 2 Nave Bayes SVM (Linear)
Accuracy SVM
(Linear) Accuracy 83.85 % Nave Bayes
Accuracy 63.34 % 3
3: Nave Bayes
4: SVM
3.5 (Classifier)

4 1)
https://rapidminer.com
128
3:
Nave Bayes
SVM
Class
1
2
3
4
Overall
accuracy
Accuracy
Nave Bayes
SVM (Linear)
66.49
90.96
55.67
75.35
3.72
14.89
18.80
33.90
63.34 %
NCCIT2015
[1]
L. C. Degrossi, J. P. de Albuquerque, M. C. Fava, and E. M.

Mendiondo, Flood Citizen Observatory: a crowdsourcing-based
approach for flood risk management in Brazil. 2012.
[2] A. Winijkulchai. (2012). [Online]. Thailands 2011 Flood Crisis
Reveals Potential of Technology and Social Media in Disaster
Response. [cited 20 Feb. 2015]. Available from : URL :
http://asiafoundation.org/in-asia/2012/06/27/
thailands-2011-flood-crisis-reveals-potential-of-technology
-and-social-media-in-disaster-response/
[3] P. Jongsuksomsakul, Disaster Risk Management Communication
in ASEAN Case Study in Flood, Journal on Media &
Communications (JMC), pp. 120-131, 2013.
[4] Y. Zhou, L. Yang, B. Van de Walle, and C. Han, "Classification
of Microblogs for Support Emergency Responses: Case Study
Yushu Earthquake in China." Hawaii International Conference on
System Sciences Vol. 46, pp. 1553-1562, 2013.
[5] A. Kongthon, C. Haruechaiyasak, J. Pailai, and S. Kongyoung,
"The role of Twitter during a natural disaster: Case study of 2011
Thai Flood." Proceedings of PICMET:Technology Management
for Emerging Technologies Vol. 12 , pp. 2227-2232, 2012.
[6] G. Backfried, J. Gollner, G. Qirchmayr, K. Rainer, G. Kienast, G.
Thallinger, C. Schmidt, and A. Peer, "Integration of Media
Sources for Situation Analysis in the Different Phases of Disaster
Management: The QuOIMA Project." Intelligence and Security
Informatics Conference (EISIC), pp. 143-146, 2013.
[7] . .

, 2546.
[8] .
The 6 th National
Conference Computing and Information Technology, pp. 92 -87 ,
.2010
[9] , .
.
" " 7, 3-12.
[10] . "
"
51 (2554).
83.85 %
4.2

Twitter,

2
Nave Bayes SVM

SVM
83.85%
Nave Bayes 63.34%
SVM Nave Bayes
SVM
2

2 (Optimal separating hyperplane)
(Margin)

Nave Bayes
Nave Bayes

Nave Bayes
129
[11] G. Backfried, C. Schmidt, M. Pfeiffer, G. Quirchmayr, M.

Glanzer, and K. Rainer, "Open Source Intelligence in Disaster
Management." Intelligence and Security Informatics Conference
(EISIC), pp. 254-258, 2012.
[12] Y. Tyshchuk, L. Hao, J. Heng, and W. A. Wallace, "Evolution of
communities on Twitter and the role of their leaders during
emergencies." IEEE/ACM International Conference on Advances
in Social Networks Analysis and Mining (ASONAM), pp. 727733, 2013.
[13] I. Dilrukshi, and K. De Zoysa, "Twitter news classification:
Theoretical and practical comparison of SVM against Naive
Bayes algorithms." International Conference on Advances in ICT
for Emerging Regions (ICTer), pp. 278, 2013.
[14] "
" National Conference on Information
Technology, pp 302-307, 2010.
[15] .
, 2553.
130
NCCIT2015
NCCIT2015

Model Development for Predicting the Thai Population Migration
using an Artificial Neural Network
(Pichanita Seensat)1 (Maleerat Sodanil)2
1
2

1
ppseen@gmail.com, 2Maleerat.s@it.kmutnb.ac.th
aims to use an artificial neural network (multi-layer

perceptron), which utilized back-propagation learning

11:60:2

.. 2547 .. 2556
3
70%
2
0.18

:
algorithm. The findings of this research showed that the

most appropriate of artificial neural network structure
was 11:60:2. Data more than 3 million records consist of
those from migration survey from The National Statistical
office of Thailand during 2004-2012 to reduce the
dimensions and features selected. Data was reduced
more than 70% and which are divided into 2 groups, One
for learning and the other for testing for this research.
The result showed Root mean square error of 0.18. In
conclusion, the predicting population migration of
developed model could be applied effectively.
Keywords: Prediction, Migration, Population, Artificial
Neural Network.
1.

.. 2493
.. 2556
.. 2643
[1][2]

3 1. 2 .
3.
[3]
Abstract
The objective of this research was to develop the
model for predicting the Thai population migration. It
also evaluated the effectiveness of the developed model
for predicting the population in Thailand. This research
131
NCCIT2015
2.2

2 1.

2.

1

[4]

1. 2.
3.
4. 5.
6. 7.
[5][6]

[7]

2.
2.1
3

2

2

132
NCCIT2015
Patil Mytri [10] Chon, Park,

etal [ 11]

Shi,
Wang Wang [12]

Kongmaree, Vanichayobon Wettayaprasit
[13]

1:

2.3

Folorunso, Akinwale, et al [8]

Bandyopadhyay Chattopadhyay
[9]
7

3.

Cross-Industry Process for Data Mining
2
2:
133
3.1
NCCIT2015
1,397,899 13

3.2.3 (Data Construction)

International
Standard Classification of Education

1 2

3.2.4

.. 2547, 2548, 2549, 2550, 2551, 2552,
2554, 2555 2556
.. 2553

3,201,900
3.2

3.2.1 (Data Selection)

3.2.2 (Data Cleaning)

(

) 15

1.
International
Standard Classification of Occupations
2.
International
(Data Transformation)
0-1
(1)
(1)
3.2.5 (Data Reduction)

2-2-2

679,938
3.2.6 (Data Integration)
10
3.2.1 - 3.2.5
3.2.7 (Feature
Standard Industrial Classification of All Economic

3. Standard International Age
Classification

Selection)
Activities, Third Revision
134
NCCIT2015

2

1
3
2 1 5
Correlation based Feature Selection
2 11 Chi-squared
Feature Evaluation, Consistency Subset Evaluation,
Filtered Attribute Evaluation, Gain Ratio Feature
Evaluation, Information Gain Principal Component
Analysis
3.3
2
WEKA
(
)
2 10-fold cross validation

60
5 0 0 0 .1
0.1
3.4

(Root mean square error)
(2)
3:
5.

11 60
2

(2)
T

4.

1 5

0.33
2

0.18

[1]
United Nation, Department of Economic and Social

Affairs,*World population Prospects: The 2012 Revision,
Volume II: Demographic profiles,*United Nation:
New York, 2013.
135
[2]
[3]
,

.. 2553-2583,* :
,*2556.

,
,
: , 2553.
[13] Kongmanee, T., Vanichayobon, S., and Wettayaprasit, W.

The TF-IDF and Neural Networks Approach for
Translation Initiation Site Prediction, The 2nd IEEE
International Conference on Computer Science and
Information Technology, Aug 8-11, 2009.
[4] (.)
,*
,
: , 2555.
[5] * ,
:

39, 19-28.
[6] , ,
: , 2540.
[7] ,* ..
2556, : , 2557.
[8]
O. Folorunso, A.T. Akinwale, et al, Population

prediction using artificial neural network, African
journal of mathematics and computer science research,
Vol. 3, No. 3, pp.155-162, 2010.
[9]
NCCIT2015
Goutami Bandyopadhyay and Surajit Chattopadhyay, An

Artificial Neural Net approach to forcast the population of
India, Indian International Conference on Artificial
Intelligence, 2007.
[10] Jyothi Patil and V.D.Mytri, A Prediction Model for

Population Dynamics of Cotton Pest (Thrips tabaci Linde)
using Multilayer-Perceptron Neural Network,
International Journal Computer Applications, Vol. 67,
No. 4, pp. 19-26, 2013.
[11] Tae-soo Chon, Yong-seuk Park, et al, Use of an
ArtificialNeural Network to Predict Population Dynamics
of the ForestPest Pine Needle Gall Midge (Diptera:
Cecidomyiida), Environmental Entomology, Vol. 29,
No. 6, pp. 1208-1215, 2000.
[12] L. Shi, X.C. Wang and Y.S. Wang, Artificial neural
network models for predicting 1-year mortality in elderly
patients with intertrochanteric fractures in China,
Brazilian Journal of Medical and Biological Research,
Vol. 46, pp. 993-999, 2013.
136
NCCIT2015

Thai Hand Shapes Recognition using ACO - SVM
(Anusorn Untao)1 (Sompong Valuvanathon)2

1
anusorn.un.54@ubu.ac.th, 2sompong.v@ubu.ac.th
validation was used to approximate the c and parameters in
support vector machine (SVM). The experiment dataset consists of

(Incremental model)
(
K-fold cross validation) c

1,420
10 142

96.3
:

1,420 images, 142 hand shapes from ten individuals. The

experimental results showed that the proposed method could
enhance the performance of Thai hand shape recognition up to
96.3%.
Keywords: Hand Shapes, Thai Sign Language, ACO,
Incremental model, SVM.
1.
(Hand shapes)
[1]

( Histograms of oriented gradients: HOG)
(Principal component analysis
: PCA)

(Support vector machine
: SVM) (Radial basis
function : RBF )

[2]
Abstract
This paper proposed parameter optimization to enhance
the accuracy of Thai hand shapes recognition. Ant colony
optimization (ACO) with incremental model and support vector
machine (SVM) with radial basis function (RBF) kernel were
combined to classify the Thai hand shapes. K-fold cross
[3]
(Ant colony optimization: ACO)
[4],
[5], [6], [7]

137
NCCIT2015
2.
2.1
(K-fold cross validation)

k
k
k-1

[8], [9]
2.2
1: c

(3) (4) hard margin i
0 soft margin 0 i = c
i = 1,2,,m
(Support vector machine: SVM)

[3]

2

i
max
w,b,
|| w ||2 + c i
i =1
2
subject to yi (w)T x + b
1 - i and i > 0
(3)
subject to
i yi = 0
(4)
i =1

[2], [9]
2.3 (Ant colony
optimization: ACO)
min
m m
( i - 1 i j yi y j K(xi x j) )
i=1
2 i=1 j=1

[5], [6], [7]
k i j (i,j)

(i,j) i j

k
Lk
i j
(1)
(2)
i (xi, yi) c penalizing factor

trade - off
c
c c

[10]
138
3.1
Procedure AntSystem
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
NCCIT2015
Initial Pheromone Value

Place the m ants on the node of graph
While condition not met do
for k = 1 to m {m ant}
for i 1 to n 1 do
ant k random walk to node j
Update Ik(i)
Update pheromone
Calculate Distance Lk
Print Shortest Path

(Manual method)
4,608 3,456
180 200 [2]
2:
Lk
i j
t
k
P (t) =
ij
[ij(t)] [ij]
j I [ij(t)] [ij]
k
if j I ki
3:
(5)
otherwise

HOG 0180 (a) 6 bin 8 8
2 2
(b)

(c)
2.4
(Incremental model)

(Iteration)
[11] S
S
S

new
new
best
Snew =
Snew + rand (0,1) (Sbest - Snew)
(6)
3.

1,420
142
10
3
4: HOG

PCA

Threshold [2]

139
(Normallized cross correlation)

6:4

(x ) = 1 x >0
[6] SVM
3.3

(9)
(10) Wki Wkj
i j k [4]
1: Eigenvalues threshold
90
70
88.4
Threshold
Dimension
Accuracy
HOG PCA
91
92
93
76
83
101
89.3 90.1 90.1
94
112
90.1
95
145
90.1

Threshold 92
83

2:
Data Set
Dimension
Accuracy (%)
HOG
PCA
HOG - PCA
384
89.7
276
64.3
83
90.1
NCCIT2015
ij = (1 - ) ij +
Number of Ant
k =1
3.2
SVM RBF
[7],[8]
[4],[11] (Crossvalidation accuracy: CVACC)
CVACC =
i+ Test_Acc i
K
=
k
ij
if ant k use (i,j) in its tour

CVACCk Wki Wkj
0
(9)
ij
(10)
otherwise
[2], [9]
SVM

(Main ACO)

3 c

(Random number from the continuous uniform
distribution)
i = 1,2,,K
1 ( -yi(xi) )
l i =1
ij
3.4
(7)

(Mean Squared Error: MSE)
c

S({ = xi , yi ) | xi H, yi Y, i = 1l } H
Y

minimize T =
k + e Best
(8)
140
Hand Shapes Image Input
0.01
* Initial ACO and Solution Inheritance to IACO
1/(i , j)
Feature Extraction
Pre - Processing by manual method

Hand Cropping
mAnt
10
Growth
Ant Colony Optimization (ACO)
Initialize solution archive

and ACO parameters
( i = 10, j = 10 )
5:
Build a new solution for each ant

Model parameters
Yes
if solution unsatisfactoriness
Switch to IACO
for i =1 to 3 stepSize Incremental
Add New solution Archive Size
if New Increment solution is better than Sbest
Substitute Sbest
end
end
Evaluate best solution IACO VS Main ACO
if IACO improvement
Update best solution
end
Support Vector Machine ( SVM)

Train the training
set with selected
features
Test the testing set

with selected
features
Training Classify
via k-fold
cross validation
Procedure Incremental Ant Colony Optimization : IACO

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
Histograms of Oriented Gradients (HOG)

Principal component analysis (PCA)
Resize Image
Initial State ACO Parameters
NCCIT2015
solution satisfies
condition
No
Switch to Incremental ACO
Evaluate Best Solution
Yes
Termination
Condition ?
No
Update Solution
6:
RBF Model
Recognition Output
7: HOG - PCA
4.
ACO - SVM
ACO
ACO
SVM 2fold 3-fold 6-fold 6:4
ACO c (2-9,24) (2-6,21)
(2-13,21)
IACO
8

3 4
3: ACO SVM
ACO : Time of Approximate Best Solution
Data Set
HOG
PCA
HOG -PCA
fold
2
3
6
2
3
6
2
3
6
Train
Time(min)
260.30
512.11
1357.40
230.40
445.20
893.56
98.15
156.48
336.38
Best MSE
of Train
113.72
110.01
97.08
1052.66
611.03
399.88
114.50
103.52
96.85
5.
Best
CVACC.
91.51
92.60
92.77
66.02
70.07
77.91
90.43
92.03
92.98
Test
Acc.
95.12
95.35
96.31
74.24
74.95
77.45
94.49
95.87
96.31

HOG - PCA
83 ACO
SVM 6-fold
96.85 4:
141
ACO
SVM
Data Set
HOG
PCA
HOG -PCA
fold
2
3
6
2
3
6
2
3
6
Train
Time(min)
223.31
376.32
944.01
190.08
367.50
779.22
83.56
126.50
244.42
Best MSE
122.72
115.91
99.78
924.66
516.74
395.68
119.95
110.03
96.85
Best
91.51
92.29
92.73
66.67
74.41
78.29
91.25
91.55
92.98
of The 10th National Conference on Computing and

Information Technology (NCCIT), pp. 571-576, 2014.
[3]
Test
Acc.
CVACC.
NCCIT2015
S. Valuvanathorn, S. Nitsuwat and M. Lin Huang MultiFeature Face Recognition based on PSO -SVM, IEEE
94.44
95.18
96.31
74.13
75.09
77.45
94.83
95.49
96.31
conference publication, International Conference, ICT

and Knowledge Engineering (ICT & Knowledge
Engineering), pp. 140- 145, 2012.
[4]
C. L. HuangHybridization strategies for continuous ant

colony optimization and particle swarm optimization
applied to data clustering Journal on Applied Soft
Computing 13, pp. 3864-3872, 2013.
[5]
H.B. Alwan and K.R. Ku-Mahamud Optimizing Support

Vector Machine Parameters Using continuous Ant Colony
Optimization IEEE conference publication, 7th
International Conference on Computing and Convergence
Technology (ICCCT), pp. 164 -169, 2012.
[6]
X. Zhang, X. Chaen and Z. He An ACO-base algorithm

for parameter optimization of support vector machines
Journal on Science Direct Expert Systems with
Applications 37, pp. 6618 -6628, 2010.
[7]
V. K. Ojha, A. Abraham and V. Snasel ACO for

continuous function optimization: A performance
8:
analysisIEEE conference publication, 14th International
ACO - SVM IACO - SVM
Conference on Intelligent Systems Design and

Applications (ISDA 2014), pp. 145 150, 2014.
96.3 IACO

ACO SVM
c 11.129
[8]
V. Nuipian and P. Meesad Fining Approximate

Parameter for Document Dimension Reduction Using
Support Vector Machine Proceedings of The 6 th
National Conference on Computing and Information
Technology (NCCIT), pp. 81-86, 2010.
[9]
0.1055
A.Untao and S. Valuvanathorn Thai Hand Shapes

Recognition Using Conduct CV on a grid Method For
Parameters Optimization in Support Vector Machine
Oral Presentation on, 4th North Eastern Science and
Technology Conference (NESTC), 2015.

[10] Y. Lui, J. Lian, M. Bartolacci and Q.Zeng Density-Based
[1]
N. Ditcharoen, K. Naruedomkul and N. Cercone
Penalty Parameter Optimization on C-SVM Hindawi
SignMT: An alternative language learning tool,
Publishing Corporation The Scientific World Journal
Published in Journal Computers & Education,vol.55,
Volume 2014, Article ID 851814, pp. 1 - 9, 2014.
Issue 1, pp. 118-130, 2010.

[2]
[11] H.B. Alwan and K. R. Ku-Mahamud Solving SVM
A. Untao and S. Valuvanathorn, Thai Hand Shapes
model selection problem using ACORand IACOR WSEAS
Recognition Using HOG - PCA and SVM Proceedings
Trans on. Computers, Vol.12, pp. 355 - 365, 2013.
142
NCCIT2015
AR

Development of Navigation App Using AR Technology
A Case Study: Prince of Songkla University, Phuket Campus
(Watcharavut Deklee)1 (Jerasak Tubtong)2
(Apiwut Wattanachai)3 (Jirawat Thaenthong)4

1
watcharavut_001@hotmail.com, 2don_donPsu24@hotmail.com,
3
psu-te-it-50@hotmail.com, 4jirawat.t@phuket.psu.ac.th
technology is not included in these programs. The issue

is the tourists take much time to find the destination. In

Augmented
Reality

Augmented
Reality Java
Libraries Metaio SDK

this paper, we propose the navigation application with

Augmented Reality Technology. The application is
developed by Java language on Android system with
Metaio SDK libraries. The testing results of the
application present that the application provide easiness
at Good level, and the average of navigation is better
than the commercial navigation program.
Keywords: Augmented Reality, Mobile Application,
GPS.
1.

Augmented Reality (AR)

:

Abstract
Nowadays, the tourists use mobile phone application
to navigate to the destination. Most programs support
the navigation in public area, but they do not support
finding the tourist attraction in private area, such as
University, etc. In addition, the Augmented Reality
143
NCCIT2015

AR

AR
2
AR
Google Map AR

Google Map

2.2 Mobile Application

Junaio
[4], Layar [5]
AR GPS
Android iPhone

Junaio
Layar

3.
AR
1
2.
2.1 Augmented Reality
AR
[1]

[2]

[3]
1:
1
AR
6

144

Keyword

NCCIT2015
2:
map 1 map
SQLite Database
SQLite Database
map
Download map
server
Admin map map
map Admin

3.1

AR

3.2
3.3.1 ER-Diagram
AR

Metaio SDK Libraries

Microsoft Windows 7,
Windows 8.1, Android v4.3 (Jelly Bean)
Eclipse Android
Development Tools, Sublime Text
Backend
MySQL Yii
PHP Framework
JSON Backend
3.3

2
3:
3.3.2 Software Specification
Input Specification
1)

2) GPS Information
145
Output Specification
1)

NCCIT2015
3.4
2) AR
3.5

20

3)
4)
5)
3.3.3 Data Flow Diagram
4.
4.1
4:
AR

2 AR

4

1

2

AR
3
AR
AR
Mascot
5:
146
NCCIT2015

6
Mascot
1:
1
20
3 (Mean)
Intelligent Navigator
4.091
Junaio 4.636
Layar 4.545

2:
6: AR
4.2

1:
Intelligent
Junaio
Layar
Building 5
Building 2 to
Navigator
1
2
3
4
5
6
7
8
9
AR
Map
(Help)
Map
11
(Exit)
(Mean)
1
Building 1 to
()
2 3
11
10
10
Building 6
Building7 to
1
Intelligent
Canteen
Navigator
PSU Lodge to
(About)
10
Male Dormitory
3
Building 3 to
Indoor Stadium
4.091
4.636
4.545
Building 1 to
Building 6
5
4
3
2
1
Junaio
Building 7 to
Canteen
PSU Lodge to
Building 5
Building 2 to
147
5.
Male Dormitory
Building 3 to
10
11
10
11
10
10
10
10
11
AR

Mobile Application
(
)
AR


Backend Map

AR

AR

Indoor Stadium
Building 1 to
Building 6
Building 7 to
Canteen
3
Layar
PSU Lodge to
Building 5
Building 2 to
Male Dormitory
Building 3 to
NCCIT2015
Indoor Stadium
2
5
3
Intelligent Navigator AR
Junaio Layar Map
1 6
Intelligent Navigator 7.33 Junaio
7.66 Layar 7.33 7
Intelligent Navigator 6 Junaio
9.66 Layar 9.66
PSU Lodge 5 Intelligent Navigator
7 Junaio 8 Layar 8.33
2 Intelligent
Navigator 6.66 Junaio 9
Layar 9 3
Intelligent Navigator 4.33 Junaio
10.33 Layar 10.33


[1]
[2]
[3]
, , ,
2550.
,
,
, 2553.
,
,

, 2557.
[4] junaio. (2014, April 1). Junaio Augmented Reality

[Online]. Available: http://www.junaio.com
[5] layar. (2014, April 2). Layar Augmented Reality [Online].
Available: http://www.layar.com
148
NCCIT2015

Question-Based Audio Captcha with Type of Answer Code for Blind Users
(Rueangchai Saiprasopsuk)1 (Amornchai Manopiya-anan)2
(Nuttanont Hongwarittorrn)3

1
ruengchai_syprasopsuk@hotmail.com, 2m_o_s_55@hotmail.com, 3nth@cs.tu.ac.th
Abstract

2 (
,
)
( , )
4 3

32 16
16
Mixed Factorial Design
4
Recaptcha
4

4
Recaptcha

:

In this paper, we proposed to the developed audio

CAPTCHA for blind users. By our study on the design
process of the audio CAPTCHA and User interface to get
the new audio CAPTCHA system that best for blind users
and visual users. It was done by studying the influence of
Question-based audio CAPTCHA characteristic on the
users with 2 factors which includes two types of
CAPTCHA answer (Answer Code, First-Letter of
Answering Word and Answer Code) and Type of Files of
Instruction to Test CAPTCHA (Single File, Multiple
File). The measurements of the new audio CAPTCHA
system are two areas, a security of new audio CAPTCHA
that test with Automated Speech Recognition. The result
of usability that was done by accurate time. The
experiment was implemented with 32 participants.
Include 16 subjects with blind users and 16 subjects with
visual users. These experimental use a mixed factorial
design. Another, we compare a new audio CAPTCHAs
system with reCAPTCHA to find satisfaction. The result
of experiment groups revealed that the use of 4 new audio
CAPTCHA systems was not different. In addition, the
result of satisfaction evaluation significantly showed that
participants were more satisfied with the new audio
CAPTCHA systems than audio reCAPTCHA, especially
they satisfied with multiple file. However, the research
did not find the interaction effect to the correctness and
time used for successful.
Keywords: Audio Captcha, Question base, Blinds User.
149
1.
2.
NCCIT2015
2.1

[1]
[3]
(BOT)

[8]

[7]

2.2
Sauer, Lazar, Hochheiser, and Feng (2010)
HIPUU

HIPUU
2 Drop-down Menu (HIPUU ver.
2.0) Free text (HIPUU ver. 3.0) 2

74 36
38
free text version
Drop-down Menu 2
90%[6]

2
2

W3C [9]

150
NCCIT2015

1:

2:

3:
4
Recaptcha
(2007)

There are 5 cats,
M. Shirali-Shahreza and S. Shirali-Shahreza
3 apples, and 4 dogs on the table. How many pets are

there on the table? 9 5
4

[4]
Bigham and Cavender (2009)

2008 38 100
47%

59% [5]
3.2
Mixed
Factorial Design
A:

Within Subjects Design
B:

Within Subjects
3.
3.1

2
(,
)
( )

1)

2)

3)

Design
2
(
)

(
)
Between Subjects Design
3.3

,

151
32 2
16 A 8 B
8
16

3.4

Recaptcha

1

2
4
NCCIT2015
3:
4:

4

2

Kidsfront.com [10]
2
0-9
5 F, G, K, M, W
Acoustic Confusion [2]

0-9
1:
2:

3
4
3
43G3
4

4
4
M4343
152
3.5

2

1
10

1

4 Recaptcha
5:
2

1
5

4

4.1.2
2:
4.
4.1
4.1.1
1:
Source
f Mean
Mean
F
Sig.
F
Square
Square

1 .281 5.478 .035* .008

.368
* 1 .000 .000 1
.070 3.316

1 .000 .000 1
.008
.368
1 .031 .259 .619 .008

.017
* 1 .031 .259 .619 .070
.156
1 .000 .000 1
.008
.031
* 0.05
NCCIT2015

Source
df Mean
Mean
F
Sig.
F
Sig.
Square
Square

1 .765 .003 .959 1839.370 4.927 .043*

* 1 328.788 1.186 .294 62.118 .166 .690

1 475.291 1.203 .291 542.872 2.463 .139
1 147.366 .244 .629 2.812 .003 .957

* 1 86.583 .143 .711 1123.504 1.211 .290

1 252.602 .174 .683 139.301 .126 .727

* 0.05
Sig.
.554
.090
.554
.897
.699
.863
153
NCCIT2015
4.3
Recaptcha

Recaptcha

4.5
5
Recaptcha

Recaptcha

4.2 5
6: 1
2

2
6
1
4

4.2
(. wav)
iSpeech
400
400 4
50

34.1
62.15

47.25 49
5.

2
(,
)
( )
3

4

4 Recaptcha

4

1
3
154

2

2

[7]
, , 2530
[2]
R.
CONRAD
andA.
J.
HULL
(WCAG)
"INFORMATION,
A framework for memory research. Journal of Verbal

Learning & Verbal Behavior 11(6), p. 71-84, 1972
and
S.
Shirali-Shahreza.
CAPTCHA for Blind People. in IEEE International

symposium on signal processing and information
technology. Egypt. 2007
[5]
Bigham, J. and A. Cavender, Evaluating existing audio

CAPTCHA and an interface optimized for non-visual
use, in Proceedings of ACM Conference on Assistive
Technologies(CHI). USA. 2009.
[6]
Sauer, G., et al. Toward A Universally Usable Human

Interaction
strategies.
Proof:
Evaluation
of
task
2008;
Available
Activities. Available from: www.kidsfront.com.
FIM, F.I.M.C. and R.S. Lockhart, Levels of processing:
M.
W3C.
from:
[10] All about Free Printable Kids Preschool Learning
432, November 1964
Shirali-Shahreza,
2.0
http://www.w3.org/TR/WCAG20/.
Journal of Psychology Volume 55, Issue 4, pages 429
[4]
. 2013; from : http://physics.ipstdevsite.com
[9] Caldwell, B., et al. Web Content Accessibility Guidelines
ACOUSTIC CONFUSION AND MEMORY SPAN" British
[3]
, 1 ( ).
2546;from:http://www.rsu.ac.th/science/physics/pom/physi
cs_2/sound
[8]

[1]
NCCIT2015
completion
in ACM Transactions on accessible
computing. USA. 2010.
155
NCCIT2015

Image processing and fuzzy C-means clustering on magnetic head circuit
(Rawinun Praserttaweelap)1,2 (Somyot Kiatwanidvilai)2
1
()
2

rawinun.praserttaweelap@seagate.com, drsomyotk@gmail.com
Currently, the inspection process was completed by

humans using the 30X microscope. This main drawback

30

99.11
225 3

:
of this process is the time consuming and the tedious

work of the inspector. This research studies the
application of visual inspection techniques and Fuzzy
C-Means
Keyword: Hard Disk Drive, Head Gimbal Assembly,

Magnetic Head, Microscope, Fuzzy C-Means.
1.

[1]

[2]

[3]
[4]
Assembly (HGA) or Magnetic Head is an important part

of the Hard Disk Drive because it is used in read and
write process on media disk. The inspection process on
very
HGA
clusters: good, bridging, and missing part.
development of the automation system. Head Gimbal
is
the
accuracy based on 225 samples which are grouped to the
industry, the manufacturing process focuses on the
circuit
inspecting
good performance of clustering technique with 99.11% of
With the current trends in Hard Disk Drive (HDD)
interconnection
for
interconnection circuit. The experimental results show a
Abstract
HGA
Clustering
important.
156
NCCIT2015

suspension slider

suspension slider

3: .
. .
2.2

Cognex Vision Pro Version 7.2

(Blob) (tool)

[5]

[6]

1:
2.
2.1
HGA
- 50

suspension
suspension slider
(Ring light)

2
2:

157
NCCIT2015

(Elongation)

[7]
(Acircularity)

[7]
(Perimeter)
[7]

3

2.3

[8] [9]

[10]
2
2

[11]
4:
=
J FCM
m
ij
=i 1 =j 1
xi c j
(1)
j , cj
, U

(2) (3) [7-10]
uij =
1
xi c j
k =1 xi ck
cj =
u
i =1
N
u
i =1
158
xi
m
ij
m
ij
2
m 1
(2)
(3)
3.
NCCIT2015

MATLAB
225
100 , 70
, 55

99.11

16
6

(threshold)

5

6:
MATLAB 225
225

2
30X
1

2

7
5:

1
1:
10.515
1.916
2.651
1.916
114.776
144.069
66.903

3.877
1.455
159
NCCIT2015
*10
98.9418
*10
18.9876
26.5282
15.1290

99.11
225

2

116.0578
147.5053
63.4263
7: .
7

30X
2

2
2:

37.0598
13.0662

()
(CSRU)

(SOW, Scope of Work)
152980
4.

3

MATLAB

[1]
S. Aksornnium, O. Watcharakitchakorn, and R. Silapunt,

A Study of Radiation Heating during the Curing Process
of Head Gimbal Assembly 2011 IEEE Region 10
Conference(TENCON 2011), Bali, Indonesia, Nov 21-24,
2011.
160
[2]
S. Aksornnium, O. Watcharakitchakorn, and R. Silapunt,
Clustering Algorithm, 2011 International Conference on
The Investigation of Read Layers Damage during the
Network Computing and Information Security, Guilin,
Electromagnetic
China, May 14-15, 2011.
Assembly
Curing
2011
Process
of
International
Head
Gimbal
Conference
on
Electromagnetics in Advanced Applications (ICEAA),

Torino, Italy, Sept 12-16, 2011.
[3]
R. Roajanasiri, N. Afzulpurkar, and S. Boonsang, The

Rework Study and Simulation on Solder Bridging of
TuMR Magnetic Head 2012 IEEE
International
Conference on Information Science and Technology

(ICIST), Hubei, China, Mar 23-25, 2012.
[4]
Z. S. Chow, M. P. L. Ooi, Y. C. Kuang, and S.

Demidenko, Automated Visual Inspection System for
Mass
Production
of
Hard
Disk
Drive
Media,
International Symposium on Robotics and Intelligent

Sensors 2012 (IRIS 2012), vol. 41, pp. 450-457, 2012.
[5] K. M. Adal, D. Sidib , S. Ali, E. Chaum, T. P.
Karnowski, and F. Mriaudeau, Automated detection of
microaneurysms using scale-adapted blob analysis and
semi-supervised
learning, Computer Methods
and
Programs in Biomedicine 114(2014), vol. 114, no. 1, pp.

1-10, 2014.
[6]
W. N. Tan, T. Sunday, and Y. F. Tan, Enhanced

GrabCut Tool with Blob Analysis in Segmentation of
Blooming Flower Images 2013 10th International
Conference
Computer,
Electrical
Engineering/Electronics,
Telecommunications
and
Information
Technology (ECTI-CON), Krabi, Thailand, May 15-17,

2013.
[7]
COGNEX, Image Processing & Machine Vision Training,

Cognex Corporation, Massachusetts, 2014.
[8]
N. E. A. Khalid, N. M. Noor, and N. M. Ariff, Fuzzy cMeans (FCM) for Optic Cup and Disc Segmentation with
Morphological Operation, Procedia Computer Science,
vol. 42, pp. 255-262, 2014.
[9]
NCCIT2015
L. Szilgyi and S. M. Szilgyi, Generalization rules for

the suppressed fuzzy c-means clustering algorithm,
Neurocomputing, vol. 139, pp. 298-309, 2014.
[10] X. Yu, W. Zhou, and H. He, A Method of Remote

Sensing Image Auto Classification Based on Interval
Type-2 Fuzzy C-Means, 2014 IEEE International
Conference on Fuzzy Systems (FUZZ-IEEE), Beijing,
China, July 6-11, 2014.
[11] C. Yanyun, Q. Jianlin, G. Xiang, C. Jianping, J. Dan, and
C. Li, Advances In Research Of Fuzzy C-means
161
NCCIT2015

A Comparative Study in Feature Extraction Methods of
Peg-less Hand Geometry
(Apiwat Sawatdirat)2
(Jakkree Srinonchat)1
1

2

1
jakkree.s@en.rmutt.ac.th, 2apiwat.sa@rmuti.ac.th
efficiency. It gives a vary computation which can be apply

to the different hand shape feature. This technique also

3
:

shown the maximum error is not more than 3 millimeter.

Keyword: hand geometry device, feature extraction,
hand contour.
1.
(Hand Geometry System) [1,2]

(Verification)

( Peg-less)
(Pivot line-based)
[3,4]
(Middle-Ring finger valley Parallel line-based)
[5,6]

Abstract
Feature extraction process of hand geometry device is
a majorly effected to the efficiency of hand geometry
system. This research presents a comparative study in
feature extraction methods of peg-less hand geometry
device between the pivot line-based technique and the
Middle-Ring finger valley parallel line-based technique.
This technique can be applied to the embedded system. The
experiment results show that the pivot line-based offers the
simplest implementation. While the Middle-Ring finger
valley parallel line-based provides the best average
162
NCCIT2015
RGB
(RGB-to-Gray) 3(A)
(Inverse) 3(B)
(Smooth)

3(C)
3(D)
2.
2.1

(Image
Acquisition), (Image Preprocessing)
(Feature Extraction) 1
Image
Acquisition
Image
Preprocessing
2: () ()
Feature
Extraction
() ()
Hand Template
Hand Geometry Device
1:
2.2

(Web Camera)

,
,

2
2.3
3:
2.4
[7] 4
4(A)
(Binary)
163
2.5

5

, ,

(Canny Edge Detection)
(Hand Contour Data)
4(B)
(B)
(C)
(D)
(E)
(F)
(G)
(H)
(I)
(A)
NCCIT2015
5:
4:
6(A)
2 3

1
(Pixel)
6(B)

4(C)
(Convex
hull and Convexity Defects) [8]
4(D)
4(E)

4(F)

4(G)

4(H) 4(I)
Length=
164
X tip X base + Ytip Ybase
(1)
X left + X right
X center =
(2)
Yleft + Yright
Ycenter =
(3)
X tip X palm
X tip X base
Ytip Ypalm
Ytip Ybase
X 2 Y2 120
= =
X1 Y1 100
NCCIT2015
6
7
(4)
(5)
X
Y
left, right, center
tip, palm, base
= |||| cos
(6)
A -
B -
7:

Digital differential analyzer (DDA) algorithm [9]

DDA
algorithm 8
6: () 2-3 () 4-5
2.6

[5,6]

20

dot product [
, ] [ ,
] A B
8:

165
NCCIT2015
4.

11

1

3.33

2.33
3

9:
3.
C gcc4.4.1
OpenCV 2.1
640x480
2.5
2.6

30 2
10
(A) Usual hand position
11:
1:
(B) Wide-open hand
10:
(: 1-10)
166
NCCIT2015
2:

[1] N. Duta, "A survey of biometric technology based on hand
shape," Pattern Recognition, vol. 42, pp. 2797-2806, 2009.
[2] A. K. Singh, A. K. Agrawal, and C. B. Pal, "Hand geometry
verification system: A review," in Ultra Modern Telecommunications &
Workshops, 2009. ICUMT '09. International Conference on,
2009, pp. 1-7.
[3] E. Yoruk, E. Konukoglu, B. Sankur, and J. Darbon, "Shapebased
hand
recognition,"
Image
Processing,
IEEE
Transactions on, vol. 15, pp. 1803-1815, 2006.

[4] E. Yoruk, E. Konukoglu, B. Sankur, and J. Darbon, "Person
authentication based on hand shape," in Signal Processing
and Communications Applications Conference, 2004.
Proceedings of the IEEE 12th, 2004, pp. 152-155.
[5] M. A. Ferrer, J. Fabregas, M. Faundez, J. B. Alonso, and C.
Travieso,
(: 1-10)
"Hand
geometry
identification
system
performance," in Security Technology, 2009. 43rd Annual

2009 International Carnahan Conference on, 2009, pp.

2

,

167-171.
[6] M. A. Ferrer, A. Morales, C. M. Travieso, and J. B. Alonso,
"Influence of the pegs number and distribution on a
biometric device based on hand geometry," in Security
Technology, 2008. ICCST 2008. 42nd Annual IEEE
International Carnahan Conference on, 2008, pp. 221-225.
[7]
5.
[8]

3

(Algorithm)
(Template Matching)

,

,
10 (NCCIT 2014), , 8-9 2557,
792-797
,
Hull Convexity Defects,
36, , 11-13
2556, 2, 777-780.
[9] Alan Watt, ed. (2000), 3D Computer Graphics, ISBN 0-20139855-9
167
NCCIT2015
LED

Enhancement Neural Network-based LED Detection using Integral Image
(Annop Sakachant)1 (Jakkree Srinonchat)2

1
mr.annop@outlook.com, 2jakkree.s@en.rmutt.ac.th
on promising region of interested. The results obtained from the

experiment in the real environment found that can recognize mostly

LED

Haar-like feature
AdaBoost
Cascade

LED 6
7 10
401 420
95.48%
: Haar-like
feature AdaBoost Cascade Classifiers
correct for all letters at 95.48% recognition rate.

Keyword: Neural Network, Integral Image, Haar-like
feature, AdaBoost, Cascade Classifiers.
1.

[1]

Machine Vision
LED

Haar-Like Feature Detection [2]

Viola Jones

Abstract
This research is a development for the LED display detection
system using backpropagation algorithm of the Artificial Neural
Networks (ANNs) is presented. The system used an integral image
for image recognition and representation which allows fast
computation of the original image features used. The system also
applies Haar-like feature based AdaBoost learning algorithm to
select a smallest number of critical visual features from a very large
set of potential features. Besides that, it also used Cascade Classifiers
algorithm which allows background regions of the image to
be quickly discarded while spending time more computation
168
AdaBoost Cascade Classifiers
Haar-like
Feature Detection

(Neural Network) [3][4]

NCCIT2015
(Feature)
(Integral Image) [7][8]
(x, y) 1
P ( x, y ) =
i ( x' , y ' )
(1)
x ' x , y ' y
3: Integral image
2.
2.3 Region of Interested

Region-of-interest (ROI) [8]

2.1 Haar-like feature

Viola Jones [5]
Haar Wavelet [6]
Feature
Feature

,
4:
2.4 AdaBoost
AdaBoost [8]

Positive Negative

1: Features
2: Feature
2.2 Integral Image
169
NCCIT2015
2.6 Artificial Neural Network

(Artificial Neural Network) [9]

3 Input Units, Hidden
Unit, Output Units
Input
Back-propagation Algorithm [10]
5: AdaBoost
2.5 Cascades Classifiers
Cascades Classifiers [8]

Sub Window Negative
Positive
Sub
Window

8:

2 Supervised Learning [10]

Unsupervised Learning [10]

4
Feedforward Network, Feedback Network, Network Layer
Perceptron
Multi-Layer
Perceptron (MLP) [10]
(Nodes)
(Neurons)
( W ), Bias Vector ( b )
Output Vector ( a ) m
p Input Vector
M (2)
6: Haar Cascade Classifier
a m +1 = f
7: Cascade Classifier
170
m +1
(W m +1 a m + b m +1 )
(2)
NCCIT2015
m = 0,2,..., M 1
a0 = p
a = am
f Transfer function
3.
10: Positive Image
Microsoft Visual C# .Net

EmguCV [11] .Net Wrapper OpenCV [12]
9
Executing Module
Sample Image
3.2

Positive Image
7

Importing Module
Video Frames
(Web Camera)
External Image
(Website)
Positive Image
Negative Image
Region Of Interested
Haar-like feature
Detection
Training
(AdaBoost Learning and Cascade Classifiers)
Integral
Images
Haar-like
Training Database
Neural Network
Training
(Learning and Classifiers)
LED Display
Classified
Neural Network
Training Database
11: Negative Image
Training Module
12:
9:
3.3 Haar-like feature detection

3.2
Positive Image
Vector Image 20x20
Negative Image

13
3.1
Positive Image

Negative Image
Sample Image
Positive Image
171
Haar-like feature detection Testing Set

Positive Image
Pre-Production Module
Data Set

Sample Image

Input Unit

Training Module
Training Set Pre-Processing

Testing Set

Classification Module

Sampling Set
13: Haar-like feature detection

3.4
14
Sampling Set
Training Set
Testing Set
Data Set
Pre-Processing
Pre-Processing
Pre-Processing
Pre-Processing Module
ANN Model
NCCIT2015
Training Module
Result of Classification
of Testing Data
Training Module
Prediction
LED Display
Classified
14:
15:
Data Set
Sampling Set Sample Image
Training Set (ROI)
Positive Image
LED
6 7
10
1
172
1:
Training Set (6 x 7 x 10)
420
Sample Image
20
Pixel
Sample Image
420
Input Unit (1 / 1 )
420
Nodes
Hidden Unit (20x20 pixels)
400
Nodes
Output Unit (1 / 1 )
Nodes
NCCIT2015

[1]
R. Lienhart and J. Maydt, An Extended Set of Haar like

Features for Rapid Object Detection, IEEE International
4.
Conference on Image Processing, pp. 900-903, 2002.

Haar-like feature detection
420
LED 6
7 10
70 2
[2]
B. Stanciulescu, A. Breheret, and Fabien Moutarde,

"Introducing New AdaBoost Features for Real-Time
Vehicle Detection", COgnitive Systems with Interactive
Sensors, 2007.
[3]
H. Rowley, S. Baluja, and T. Kanade, Neural networkbased face detection, IEEE Patt.Anal. Mach. Intell., Vol.
20, pp. 2238, 1998.
[4]
Yuezong W., Chenchen Z., Guodong M and Shujuan Y.

(2013). The neural network method research of colour
image used in micro stereo measuring. Information and
2: LED
LED
Display
70
68
97.14
70
66
94.29
70
69
98.57
70
70
100.00
70
65
92.86
70
63
90.00
Automation (ICIA), 2013 IEEE International Conference,

On page: 756 761.
[5]
P. Viola and M. J. Jones, Rapid Object Detection using a

Boosted Cascade of Simple Features, IEEE, Computer
Vision and Pattern Recognition, pp. 511-518, 2001.
[6]
Haar wavelet. Wikipedia. 2015.

http://en.wikipedia.org/wiki/Haar_wavelet.
[7]
Integral Image. Wikipedia. 2015.

http://en.wikipedia.org/wiki/Summed_area_table
[8]
Viola Jones Framework. Wikipedia. 2015.

http://en.wikipedia.org/wiki/ViolaJones_object_detection_framework
[9]
5.
ANN. Wikipedia. 2015.

http://en.wikipedia.org/wiki/Artificial_Neural_Network
[10] Dan W. Patterson, Artificial Neural Networks Theory and
Positive Image
Negative Image
0.05 LED

Application, Prentice Hall: New Jersey, 1996.

[11] Emgu CV. EMGUCV.COM, 2008.
http://www.emgu.com/wiki/index.php/Main_Page.
[12] Gary B. and Adrian K., Learning OpenCV. USA:
OReilly, 2008.
173
NCCIT2015

Usability Evaluation Framework for Android Applications on Mobile Devices
(Kritpapon Thitichaimongkhol)1 (Twittie Senivongse)2

1
kritpapon.t@student.chula.ac.th, 2twittie.s@chula.ac.th
1.

( )

(Usability)

Heuristic Evaluation [1], Eight
Golden Rules of Interface Design [2]

(Gesture)

(Heuristic Evaluation)

2
3
4 5
Abstract
Usability is a key attribute that mobile software
developers have to take into account. In this paper,
we propose a usability evaluation framework based
on heuristic evaluation method for Android mobile
applications. The evaluation checklist is compiled
from recommendations from literature and we add
a number of evaluation criteria to elaborate the
checklist, making it clear and easier to use by
Android developers. The checklist has been assessed
by experts and used to identify design flaws in an
Android application case study.
Keywords: Usability Evaluation, Mobile Devices,
Android Operating System.
174
2.
2.1
(Heuristic Evaluation) [1]

[3]

2.2

Inostroza
[4]
Nayebi [5]
Gmez
[6]

[7],
[8]

3.
NCCIT2015
1:
3.1
175
-

-

2

[1]
-

2

Heuristic Evaluation [1], Eight Golden Rules of Interface
Design [2], Android Design Principle [7], iOS Human
Interface Guidelines [8], User Interface Anti-pattern [9]
Dark Patterns [10]

3.2

[6]
3.3

5

1
2:
1:
:
:
:
NCCIT2015

0-4 [1]
0:
1:

2:
3:

4:

:
3.4

3.5
4.

[1-2], [7-14]
176
167 127
NCCIT2015
(5) Have the controls that are related to a task been
40

5
3 3 3
2
1

,
3, 2 1

1.5
1.5

165 (
126
39 )
44
22 (
)
grouped together? [14]

(6) Are operating systems status bars mostly (or
always) visible, except for multimedia content?
(7) Are operating systems buttons (e.g., back
button, home button) mostly (or always) visible,
except for multimedia content?
Response time:
(8) Is response time appropriate for the users
cognitive processing? [14]
(9) Is response time appropriate for the task? [14]
(10) If there are observable delays (greater than five
seconds) in the systems response time, is the
user kept informed of the system progress?
2. Match between system and real world
Metaphors/mental models:
(11) Are metaphors (e.g., icons that match actions)
used? [14]
(12) Do the selected colors correspond to common
expectations about color codes (e.g., use red to
indicate danger, green to indicate safety)? [14]
Simplicity:
(13) For question and answer interface, are questions
stated in clear, simple language? [14]
(14) Is terminology consistent with the users task
domain?
1. Visibility of system status
3. User control and freedom
System status feedback:
(15) Can the user cancel the operations in progress?
(1) Does every display begin with a title or a header
[14]
that describes screen contents? [14]
(16) Do screens move forward and backward step by
(2) Is there some form of system feedback for every
step sequentially?
operator action? [14]
(17) Does the system use transitions to show
(3) If the user is scrolling to the boundary of an
relationships among screens?
element (e.g., listview), is there some visual cue?
(18) Can operating systems buttons (e.g., back
(4) Does the system provide informative progress
button, home button) be used without blocking
disclosure when performing and action that the
by the system?
user needs to wait (percentage of completion or

time to wait to complete the task)?
Location information:
177
4. Consistency and standards
NCCIT2015
8. Aesthetic and minimalist design
Design consistency:
(33) Are field labels brief, familiar, and descriptive?
(19) Have industry or company standards been established
[14]
for element design, and are they applied consistently
(34) Does the system use too many typefaces?
on all element screens in the system? [14]
(Typefaces can be used to emphasize the content
(20) Is there consistent typography across the system?
but many typefaces may make users confused.)
(21) Is there consistent design on physical size (font size,
9. Help user recognize, diagnose, and recover from
element size) across the screen size, and screen
errors
density?
(35) Are prompts brief and unambiguous? [14]
Naming convention consistency:
(36) Do error messages worded so that the system,
(22) Are user actions named consistently across all
not the users, takes the blame? [14, 6]
prompts in the system? [14]
(37) Do error messages suggest the cause of

problem? [14]
5. Error prevention
(23) Do fields in data entry screens and dialog boxes
10. Help and documentation
contain default values when appropriate? [14]
(38) Do the instructions follow the sequence of user
(24) Do objects on the screen have the size that is easy to
actions? [14]
touch (about 1 x 1 centimeter or 48 x 48 density-
(39) Is
independent pixels)? [1]
the
information
accurate,
complete,
and
understandable? [14]
(25) Are touchable objects (e.g., buttons) in the screen not
(40) When users start using the system for the first time,
placed too close?
does the system provide instructions (or tips)?
(26) Are data input types appropriate for information types

(e.g.,
use
number
input
type
for
11. Pleasurable and respectful interaction with user
numeric
(41) Does the system use soft tones for regular
information)?
positive feedback, and harsh for rare critical

6. Recognition rather than recall
conditions? [14]
Memory load reduction:
(42) Do the typefaces used in the system suitable for
(27) Are required data entry fields clearly marked?
reading? (Not contain homoglyphs, e.g., 1, I, and
(28) Does the system provide an example input for
L; Zero and O)
format-specific or complex information?

12. Privacy
7. Flexibility and efficiency of use
(43) Can the system be protected or confidential areas
(29) Have splash screens that do nothing (no background
be accessed with certain passwords? [14]
task, only show the image or video) been avoided?
(44)
(30) Are the most frequently used menus in the most
Can users clear information that has been input

(e.g., search history)?
accessible positions? [14]

(31) Does the system support both orientations (horizontal
and vertical)?
(32) In a data entry form, can the user move from one
textbox to another textbox by pressing next on
software-keyboard?
178
NCCIT2015
3: Flexibility and efficiency of use

(32)

Software Keyboard

5.

126
39

Heuristic Evaluation [1]

,

2: ()
()

3
3:
1: Visibility of system status: Location information

(6)

2: Error prevention
Textbox
(26)

SoftwareKeyboard

[1]
J. Nielsen, Usability Engineering, Academic Press: San

Diego, 1994.
[2]
B. Shneiderman, C. Plaisant, M. Cohen, and S. Jacob,

Designing the User Interface: Strategies for Effective
Human-Computer Interaction, 5th edition, Prentice Hall,
2009.
[3]
J. Nielsen, Usability inspection method, The ACM Conf.

Human Factors in Computing Systems (CHI 94), pp.
413-414, 1994.
179
[4]
R. Inostroza, C. Rusu, S. Roncagliolo, C. Jimnez, and V.

Rusu, Usability heuristics for touchscreen-based mobile
devices, Ninth Int. Conf. Information Technology New
Generations, pp. 662-667, 2012.
[5]
F. Nayebi, J.-M. Desharnais, and A. Abran, An expertbased
framework
for
evaluating
iOS
application
usability, 2013 Joint Conf. of 23rd Int. Workshop

Software Measurement (IWSM) and 8th Int. Conf.
Software Process and Product Measurement (Mensura),
pp. 147-155, 2013.
[6]
R. Y. Gmez, D. C. Caballero, and J-L. Sevillano,

Heuristic evaluation on mobile interfaces: A new
checklist, The Scientific World Journal, vol. 2014, 19
pp., 2014.
[7]
Google Inc, Android Design Principles. Available:

https://developer.android.com/design/get-started/
principles.html.
[8]
Apple Inc, iOS Human Interface Guidelines: Design

Principles.
Available:
https://developer.apple.com/
library/ios/documentation/userexperience/conceptual/mob
ilehig/principles.html.
[9]
J.
Nielsen,
Top
10
Application-Design
Mistakes,
19 February 2008. Available: http://www.nngroup.com

/articles/top-10-application-design-mistakes.
[10] darkpatterns.org, Dark Patterns, Available:
http://darkpatterns.org.
[11] R. Budiu and J. Nielsen, Usability of iPad Apps and
Websites, 2nd Edition, Nielsen Norman Group, 2011.
[12] R. Budiu and J. Nielsen, Usability of Mobile Websites: 85
Design Guidelines for Improving Access to Web-Based
Content and Services through Mobile Devices, Nielsen
Norman Group, 2008.
[13] R. Budiu and J. Nielsen, Mobile Usability, New Riders,
2013.
[14] D. Pierotti, Heuristic Evaluation System Checklist,
Tech. Rep., Xerox Corporation, Society for Technical
Communication, 1998.
180
NCCIT2015
NCCIT2015

Detection of Eye Movement for Controlling Smart Device
on Android OS for Impaired Arm
(Warissara Suranun)1 (Mahasak Ketcham)2

1
warissara13@gmail.com, 2mahasak.k@it.kmutnb.ac.th
simulating cursor with microcontroller. The result is

showed that system can detect face and eye precisely. The

OpenCV

78

:

accuracy of this test is 78%.

Keywords: Disabled, Eye Detection, Eye Tracking,
Haar-like Feature,Region of Interest (ROI),
1.

Gradient
Boosting (GB)
[1], Gabor filter[2], SQI [3] ,
EOG (Electrooculography) [4]

Abstract
This paper focuses on developing algorithm to control
cursor on smartphone or tablet by Detection of Eye
Movements technique for help disabled or impaired
arms people. The researcher used image processing
theory that Haar-like feature, Region of interest (ROI)
and OpenCV library to calculate the position and motion
of eyes to control direction of cursor. The researcher
181
NCCIT2015

2 X Y

(pixel)
XY
2.2

(Rectangle regions)

2.3 (Region of interest)

2.4 OpenCV (Open source Computer Vision)

3
CV :

CXCORE :

HighGUI : , , ,

OpenCV [5]

(Image and
Signal Processing),
( Object Identification), ( Face
Recognition), (iris Recognition),
(Edge Detection),
(Motion Detection)
OpenCV smart camera
C
[6]
95.44%
[7]

OpenCV

OpenCV Region of interest
(ROI)

2.
2.5

,

2.1

182
-
-
-
-
,
NCCIT2015

5) Linux Kernel

4) Hardware Abstraction Layer
3.
3.1

2
1:
2.6

(Mobile
Operating System)

2) Libraries

Open CV
3) Android Runtime Dalvik Virtual Machine

,

1) Application Framework
2:
3.2
( 3)
183
NCCIT2015
A[x,y] AR[x,y]
4) ROI:
5
5:
ROI
5) :

l
(3)
3:
( , ) = (
1)
2) (Grayscale) (1)
), (
..(3)
( , ) ,
( , )
( , )
6
Gray = 0.299 R + 0.587 G+0.114 B ..(1)
Gray , R
, G , B
3) :
(X,Y)
4
6:

(4)
= ( )2 + ( )2
, ,

4:
(2)
[, ] = , | | ( , )
..(4)
(5)(6)(7)
..(2)
184
= arctan(
_ = +
_ = +
NCCIT2015
..(5)
cos
sin
..(6)
..(7)
_ , _
6) :

CascadeClassifier OpenCV

1
7)
8)
8:
9:
4.

2

100 7-12
10:
7:
11:
185
NCCIT2015

12:
6.
-

-

IOS

1 2
1:
0.96
0.87 0.89
0.96
0.95
0.93
2:
0.73
0.76
0.69 0.75
0.98
[1]
Hoang Le, Thanh Dang, Feng Liu. EYE BLINK

DETECTION FOR SMART GLASSES. IEEE
International Symposium on Multimedia, 2013.
0.78
[2]
YenWei Chen, Kenji Kubo. A Robust Eye

Detection and Tracking Technique using Gabor
5.
Filters. IEEE, 2007.

OpenCV

93

78

- 2
[3]
Sung-Uk Jung, Jang-Hee Yoo. Robust Eye

Detection Using Self Quotient image. ISPACS,
Totori, Japan, 2006.
[4]
N.M.Mohd Hassan, W.Mansor. Detection of Eye

Movements for Controlling a Television. IEEE 10th
International Colloquium on Signal Processing & its
Applications (CSPA2014), 7 - 9 Mac, Kuala
Lumpur, Malaysia, 2014.
[5]
Naotoshi Seo. Tutorial:OpenCV haartraining.
6 2557 http://note.sonots.com
[6]
Mehrube Mehrubeoglu, Linh Manh Pham, HungThieu

Le, Ramchander Muddu, Dong seok Ryu. RealTime Eye Tracking Using a Smart Camera. IEEE, 2012.
[7]
186
, .
.

, 2553.
NCCIT2015

Real Time Monitoring System with Wireless Sensors Network
for Sinus Arrhythmia Condition
(Salisa Hongsi)1 (Mahasak Ketcham)2

1
noonereplay@gmail.com, 2mahasak.k@it.kmutnb.ac.th
1.

Android
Pan-Tomkins

MIT-BIH
85

:

1 [1]
(Sinus
Arrhythmia)

Wavelet
Transform, , Neural
Network, Machine Learning Feature Extraction

Pan-Tomkins Algorithm [2]

Abstract
This research purpose is a real time monitoring ECG signal
system with wireless sensors network for sinus arrhythmia
condition. This system recognizes the importance of detecting
abnormalities of heart disease in order to reduce the loss of life. The
development of application relies on Smart Phone using Wireless
Sensors Network. The algorithm implements based on PanTomkins Algorithm which allow to recognize sinus arrhythmia
condition in Real-Time. The accuracy rate of the system is 85%
by experiment on MIT-BIH , patients with heart disease
database. The system is effective to use.
Keywords: Sinus Arrhythmia, Wireless Sensors Network, ECG
Signal, Zigbee.
187
NCCIT2015

R wave windows
Pan Tomkins
200 windows 150
150

Pan-Tomkins Algorithm

Zigbee [3]

SMS
MITBIT
2.3.5**Adjusting the Threshold
R Peak

Threshold
R-Peak
Threshold
2.4.6**Decision
R Peak
R R
2.5
Lui Wang [6] Wavelet Transform
Neural
Network Low-Pass
High-Pass
Yu Chen [7] 2
)*
DWT (Discrete Wavelet Transform)
6
Feed-
2.
2.1
[4]
*P wave,*QRS complex,*T wave U wave
Q wave, R wave S wave QRS Complex
2.2 Sinus Arrhythmia
Sinus Arrhythmia [5]

2.3 Pan-Tomkins Algorithm
Algorithm Pan Tomkins

QRS complex
R Peak

Forward Back Propagation Neural Network (FFBNN)
Classification
)* 11
Wavelet Transform Probabilistic Neural
2.3.1**Bandpass Filter
Network (PNN)
Oresko [8]

Bluetooth Pan-Tomkins
Algorithm QRS complex
Machine Learning Feed forward Multilayer Perceptron
Artificial Neural Network
MIT-BIH
2.3.2*Derivative
QRS
complex Transfer Function 5
2.3.3*Squaring Function

2.3.4**Moving-Window Integration
188
NCCIT2015
Gakare [9] Pan-Tomkins
Algorithm
Bluetooth
8
So-In [10]
Wavelet Transform

Probabilistic Neural Network

Bluetooth

Alavi Saadatmad-Tarzjan [11]

Wavelet Transform
Gaussian Function
MIT-BIH
Bor-Shyh [12]

ECG Sensor Non-contact


1:
3.1.1* (Sender) ECG Sensor
Non Contact
Sensor

Zigbee
2:

ECG MCU
(Microcontroller Unit)
Zigbee
Module
)*ECG Sensor

)*MCU

Zigbee Module
)*Zigbee
Receiver
3.1.2* (Receiver) Zigbee
Serial Port

2
(Monitor Thread)
3.*

ECG

3.1*

2
189
NCCIT2015
3.2*
3.2.1

2

)

7
(Analyst Thread)


3:
3
ECG Zigbee

Android 2
5:
)
Zigbee
3.2.2

4:
3.1.2.1*GUI (Graphic User Interface)
2 Signal Status
Screen
Alert Screen
3.1.2.2* (Background Process)

Real Time
2
). Data Receiver
ECG Sender

). Data Monitoring
Sender

6: Flow Chart Mobile Application

8
ECG Zigbee
Buffer

Buffer
190

SMS

MIT-BIH 20
20
10 20
80%

(Sinus Arrhythmia)
1:
No
R Peak QRS Complex

R Peak
Threshold PanTomkins Algorithm Threshold

R Peak R Peak 8
RR=
AVG ( RR n7 + RR n6 + RR n3 + ... + RR n ) 8 (1)
RR=
RR AVG 116% ************ (2)
HIGH
=
RR
RR AVG 92% ************ (3)
Low
RR AVG R Peak R Peak 8

HIGH
RR 100
4.*
7:
RR
RR
NCCIT2015
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
R Peak R Peak
R Peak R Peak

RR RR
100 (4) 80

SMS
AC = ( N C N A )100 ************* (4)
AC
N C RR
LOW
(10 )
95%
93%
92%
82%
89%
86%
94%
96%
60%
96%
44%
86%
94%
91%
93%
86%
31%
81%
86%
89%
(20 )
92%
96%
80%
81%
87%
87%
90%
92%
65%
92%
46%
85%
92%
85%
90%
82%
45%
81%
87%
88%
Alert
94%
95%
86%
82%
88%
87%
92%
94%
63%
94%
45%
86%
93%
88%
92%
84%
38%
81%
87%
89%
Y
Y
Y
Y
Y
Y
Y
Y
N
Y
N
Y
Y
Y
Y
Y
N
Y
Y
Y
(5) 85
A =(Y N )100 =(17 20 )100 =85 ***** (5)
191
NCCIT2015
[1] World Health Organization. The top 10 causes of death.
5.*
Available from: http://www.who.int/mediacentre/fact

sheets /fs310/en/[2014,May].

Zigbee
50 Pan-Tomkins Algorithm

24

20 10 20
17
85%

[2] J. Pan, and W. J. Tompkins. A Real-Time QRS Detection

Algorithm. IEEE Transaction on Biomedical
Engineering. 32 (March 1985) : 230-236.
[3]
[4]
** ***.*
*Zigbee, 2551.
. ECG , : ,
2546.
[5]
. The Review
Book of PRACTICAL ECG. : , 2552.
[6] C. Liu, and X. Wang. A New Adaptive Wavelet Network

for ECG Recognition, Int. Proc. Int. conf. on Signal
Processing, vol. 3. 8 (2006).
[7] Y. H. Chen, and S. N. Yu, Electrocardiograms beat
classification base on wavelet transformation and
probabilistic neural network. Pattern Recognition Letters,
vol. 28. (2007) : 1145-1150.
[8] Joseph J. Oresko, Zhanpen Jin, et al. A Wearble
Smartphone-Based Platform for Real-Time
Cardiovascular Disease Detection Via Elctrocadiogram
Processing. IEEE Trasaction on Information Technology
in Biomedicine. (May 2010) : 734-740.
[9] Pankaj K. Grakare, Abilasha M. Petel, A. N. Cheeran. Real
Time Analysis and Diagnosis of ECG Signal for
Tachycardia Condition. Internaltional Journal of
Computer Application. 3 (Apilr 2012) : 11-15.
[10] Chakchai So-In, Comdet Phaudphut, el at. A Novel
Architecture for Mobile ECG Recognition Systems Using
Hybrid Wavelet Transform Feature Extraction Schemes.
Journal of Convergence Infomation Technology. 6
(December 2013) : 471-484.
[11] Saeed Alavi. and Mahdi Saadatmand-Tarzjan. A New
Combinattorial Algorithm for QRS Detection.
International Conference on Computer and Knowledge
Engineering. 3 (November 2013) :396-399.
[12] Bor-shyn Lin, Willy Chou, el at. Development of Novel
Non-contact Electrodes for Mobile Electrocardiogram
Monitoring System. IEEE Journal of Translational
Engineering in Health and Medicine. (2013).
192
NCCIT2015

Design Guidelines for Instructional Media Creation System for
Middle-aged Teachers on Tablets
(Ketsraporn Sengprathom)1 (Thippaya Chintakovid)2

1
ketsraporn2530@gmail.com, 2thippaya.c@it.kmutnb.ac.th
studies guidelines for designing teaching media creating system for

middle-aged teachers, and developed an application installed on

30

:

android tablets for teachers to use conveniently and easily. Thirty

middle-aged teachers evaluated the learnability and satisfaction
towards the application use. The evaluation results showed that it
was easier to learn to use and more satisfactory to use the new
system compared with the application available on the market.
Keywords: Middle-aged Teachers, Instructional Media Creation,
Design Guidelines for Instructional Media Creation
System for Middle-aged Teachers.
1.

40-60 63 [1], [2]

Abstract
Todays education uses information technology as a channel to

transfer knowledge from teachers to students. Teachers use various
computer applications to help them create teaching media.
Nowadays, most of the teachers are middle-aged people. It is not
convenient for the middle-aged teachers to use currently available
media creating programs because of complicated and diverse
functions, and confusing user interfaces. Therefore, this research
193
NCCIT2015
[12] 2)*
3)
[13] 4)*
5)*

6)*
[7] 7)
8)

[14], [15] 9)*
10)*
11)*

2.3*

[16], [17] 4
1)*
[18]

2)*

3)*

4)*

[3]

2.
2.1*

.. 2551

[4]

[5]
[6]

2.2*

40 - 60 [1]
50 [7]

[8], [9], [10], [11]
11 1)

194
NCCIT2015
3-1
3-2
3-1:
3.
3.1*
3.1.1*
3-1
3-1:
3-2:
3.1.4*
PhoneGap HTML5/PHP
/JavaScript MySQL
10
3.2*

Black-Box Testing

(power)
(effect size) (significance level)
0.8 0.5
.05 27
5

(Bias)

-
[16]
,
,

,

, ,
3.1.2

1)
2) 3)

4.2
3.1.3*
3.1.1 3.1.2
195

1 ()
5 ()
1 ()
5 ()
NCCIT2015

75
15-17

7
1
75% (3 4)

1 1

2)

5 1
3)
3
0.95 em 1.10 em 1.15 em
10

4.
4.1* -

3
4-1*
4-2
4-1:
4-2:
4.2*

10

1)

1
196

4.3*

10 (33.33%)
20 (66.67%) 40-49
8 (26.7% ) 50-59 22 (73.3%)
10
56.7% 9
(30%)

paired-sample t-test

0.05, t(29) = -5.243,

p = .000

0.05, t(29) = 7.089, p = .000
4-1
4-1:

2.48
3.10
NCCIT2015

.. 2557

[1]

,
()
1 2558 http://210.246.188.122/obec_manage
/personal/report_main.php
[2]

4.02
3.48
[3]
[4]
5.*
[5]
[6]
197
, 2,
9, : , 2549.
K. Yee, Two-Handed Interaction on a Tablet Display,
Proceedings of Conference on Human Factors in Computing
Systems Extended Abstracts (CHI EA04), Vienna, Austria, April
24 April 29, 2004, pp 1493 1496.
,
,

, 2555.
,
,

, 2547.
,

3,

, 2554.
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
Professional Communication
October 17 19, 2011, pp.1-13
L.V. Hanson, Age and Web Access: The Next

Generation, Proceedings of the 2009 International
Cross-Disciplinary Conference on Web Accessibility,
Madrid, Spain, 2009, pp.7-15.
P. Zaphiris, M. Ghiawadwala and S. Mughal, AgeCentered
Research-Based
Web
Design
Guidelines,Proceedings of Conference on Human
Factors in Computing Systems (CHI05), Portland,
Oregon, USA, April 2 April 7, 2005, pp.1897-1900.
S. Kurniawan and P. Zaphiris, Research-Derived Web
Design Guidelines for Older People, Proceedings of the
7th International ACM SIGACCESS Conference on
Computers and Accessibility, Baltimore, Maryland, USA,
October 9-12, 2009, pp.129-135.
P. Zaphiris, S. Kurniawan and M. Ghiawadwala, A
Systematic Approach to the Development of ResearchBased Web Design Guidelines for Older People.
Universal Access in the Information Society, Vol.6, No.1,
pp.59-75, 2007.
E. Patsoule and P. Koutsabasis, Redesigning Web Sites
for Older Adults, Proceedings of the 5th International
Conference on PErvasive Technologies Related to
Assistive Environments (PETRA 2012), Heraklion, Crete,
Greece, June 6 9, 2012, pp. 1-8.
T. A. Hart, B. S. Chaparro and C.G. Halcomb,
Evaluating Websites for Older Adults: Adherence to
Senior-Friendly
Guidelines
and
End-User
Performance,Behaviour& Information
Technology,
Vol.27, No.3, pp.191-199, 2008.
E. Santos, S. Lara, W. Watanabe, M. Filho and R. Fortes,
Usability Evaluation of Horizontal Navigation Bar with
Drop-down Menus by Middle Aged Adults, Proceedings
of the 29th ACM International Conference on Design of
Communication, Pisa, Italy, October 3-5, 2011, pp.145-150.
D. Saito, K. Saito, K. Notomi and M. Saito, The Effect of
Age on Web-Safe Color Visibility for a White
Background, Proceedings of the 28th IEEE EMBS
Annual International Conference, New York City, USA,
August 30- September 3, 2006, pp.5145 5148.
A. Holzinger and M. Errath, Mobile Computer WebApplication Design in Medicine: Some Research Based
Guidelines, Universal Access in the Information Society,
Vol.6, No.1, pp.31-41, 2007.
W3C, Web Content Accessibility Guidelines Working
Group (WCAG WG), () 1 2558
http://www.w3.org/WAI/GL/
[17]
Funka Nu AB, Guidelines for The Development of

Accessible Mobile Interfaces,
2557
( )
http://www.funkanu.com/en/Our-
approach/
Information-web-and-IT/Rules-and-guidelines/Mobileaccessibility-guidelines/
[18] M. Rauch, Mobile Documentation: Usability Guidelines,
and Consideration for Providing Documentation on
Kindle, Tablets, and Smartphones, IEEE International
198
NCCIT2015
Conference
(IPCC),
NCCIT2015

Lottery Digit Recognition for the Visually Impaired
(Wanida Saetang)1 (Sakchai Tangwannawit)2

1
wanidasaetang@gmail.com, 2sakchai.t@it.kmutnb.ac.th
lines and digits and Recognize digit. The operation of

applications will be scan 6 digits on the lottery. Then

Tesseract OCR Engine
1. (Adaptive Thresholding)
2. (Connected component analysis) 3.
(Find text lines and digits) 4.
(Recognize digit)
6
Alpha Beta
50

90 100
:
Tesseract OCR Engine.
recognize each digit and impressions through voice. The

result of Alpha and Beta testing which has a sample of 50
tickets that the efficacy of the recognition and prize
checking is at 90% and 100% respectively.
Keyword: Lottery, Recognition, The visually impaired,
Tesseract OCR engine.
1.

500

(Slate) (Stylus)

Abstract
There is not much opportunity for the disabled people
to get a job, especially for the visually impaired. Most of
them manage to live by selling lottery. It is difficult for
the visually impaired to know the digits on a lottery. This
paper presents an algorithm to recognize lottery digits
and developed the application for reading and checking
the lottery digit. By using the Tesseract OCR engine
applications. The procedure are includes Adaptive
Thresholding, Connected component analysis, Find text
199
(Recognition)

Optical Character Recognition
3
(pre-processing) (digit recognition)
(post-processing)

OCR

( Statistical Approach),
(Structural Analysis)
(Neural Network)
3) (Post-Processing)

OCR
2.2 Tesseract OCR engine [1]
Tesseract OCR
tesseract-android-tools
tess-two Tesseract OCR engine Leptonica
Image Processing Library
60
Tesseract
(outlines
of components) outlines
Blobs (Blobs
)
Blobs Text line

2

fuzzy spaces
x-height
2.3 Adaptive Threshold [2]

Threshold 0
1
( Threshold) 1
0
Threshold
, Threshold
Segmentation

Threshold
Matching),
2.
2.1 Optical character recognition (OCR)

OCR
3 1
Pre-Processing
Recognition
NCCIT2015
Post-Processing
1: OCR
1) (Pre-Processing)

OCR
( Noise Filtering),
(Normalization), ( Cropping)
(Feature Extraction)
2) (Recognition)

4 (Template
200
NCCIT2015
2.5
[3]

6
5x7
(object)

[4]

4
(Horizontal) (Vertical)
(Left Diagonal) (Right Diagonal)

D.Renuka devi D .KanagapushpavaUi [5]

(License plate recognition)

4
Preprocessing, Segmentation, Normalization Optical
Character Recognition morphological

meaning morphological

OCR
Ismail Bouazizi [3]
standalone TTS (Text-to-speech) OCR
Manual Threshold

Threshold Automatic
Threshold Threshold

Adaptive Threshold
Adaptive Segmentation
pixel pixel
5x5 Mean
Threshold value
2.4 JSON (JavaScript Object Notation)

JavaScript
(JavaScript Programming Language, Standard ECMA-

C, C++, C#, Java, Javascript, Perl,
Python JSON
JSON 2
-
Object, record,
structure, dictionary, hash table, keyed list associate
262 3rd Edition December 1999.) JSON
array
-
array, vector, list sequence
JSON Javascript

JSON
JSON
[
{"firstname":"name","lastname":"name"},
{"firstname":"name1", "lastname":"name2"}
201
3.3

6
Beep

Tesseract OCR engine
2

OCR
OCR character recognition,
segmentation,
preprocessing,
feature
extraction,
classification post-processing
OCR text file TTS

TTS text file
linguistic analysis, text in machine
friendly language, speech synthesis speech wave form
start
3.
Camera
scanning
3.1

OCR

5-8 OCR

3.2

Tesseract OCR engine
4
2

3
6 4
1 static
2
Lottery
Adaptive
thresholdin
NCCIT2015
No
CheckingYes
Tesseract
OCR engine
Lottery digit
Audio speech
end
3:
3 1)
22
7
6 2)
4.5
11.5 3)
Connected
componen
t analysis
Find text
Recognize
Lottery
lines
digit
digit
and digit
2: Tesseract OCR engine
202
NCCIT2015
2 distances
4
2

json
array
[ ]
,
{"100":"048151","101":"048150","102":"048152","103":"
27","104":"63",
"200":["331991","266527","478311","000369","899699"],
"300":["824800","897377","883308","944556","772370",
"567240","208689","269122","896662","349830"],
3.5
2
1) Alpha testing

2) Beta testing

2557-2558 50

6 1
6 1

4:
3.4

2
1
1) Adaptive Thresholding
2

0 255
2) Line and digit finding
line finding algorithm

6
6 5
5: Line and digit finding

line Tesseract pitch
chopping
3) Word Recognition
line
associator chops blobs
3.6

A
x 100
=
C
4) Features Extracted

Morphology Rank reductions
5) Static digit Classifier
Classification 2
class pruner
203
NCCIT2015

alpha testing
beta testing
90 100

C

alpha testing beta testing 1
1:

alpha testing
94
beta testing
86

2
2:
alpha testing
100
beta testing
100
4.

5-8 Tesseract
OCR engine Tesseract
Google

OCR

Beta

[1]
Ray Smith, An Overview of the Tesseract OCR engine,

IEEE Trans. on Document Analysis and Recognition, vol 2,
No. 9, pp. 629-633, 2007.
[2]
[3]
[4]
, C++ Builder
NECTEC , 45-52, 2545.
, Thai OCR for Car License Plate
Recognition ECTI-CARD RMUTT 4 2122 2555.
. Handwritten Digits OCR for
Identifying Examinee Number on Objective Test Answer
Sheet, Naresuan University Journal: Science and Technology
2014.
[5]
Renuka Devi D and Kanagapushpavalli D, Automatic license

plate recognition, IEEE Trans. on Trendz in Information
Sciences and Computing, No.3, pp. 75-78, 2011.
[6]
5.
Bouazizi I , Bouriss F and Salih-Alj Y, Arabic Reading

Machine for Visually Impaired People using TTS and OCR ,

Tesseract OCR
engine
IEEE Trans. on Intelligent Systems Modeling & Simulation ,

No.4, pp225-229, 2013.
204
NCCIT2015

A Study the Acceptance of Mobile Application
(Passana Ekudompong)1 (Sirirak Khanthanurak)2

1
Jom_naka@yahoo.com, 2Keng_050@hotmail.com
information systems and
for suggestions a mobile
application to used in the course of the University.

400
(Convenience Sample)

:
The sample of this study was 400 samples

from
instructors,
officers,
students
Rajamangala
University of Technology Srivijaya, Trang Campus and

students, parents outside of the university using the
convenience sampling method. The study tool, mobile
application, questionnaire. The data analysis was
conducted elementary statistics.
The results of the study showed that the users
behavior of accept the innovations in a mobile application
to used.
Keywords: Acceptance, Mobile Application, Roger.
1.

(Smart Phone)

[1]

Abstract
This study was the survey research. The purposes of
this study was to study behavior of the innovation
acceptance mobile application in the using process and
the results will be used to analyze the planning and
management of the use of the internet and management
205
NCCIT2015
1. (Awareness Knowledge)

2. (How to Knowledge)

3. (Principle
Knowledge)

3
1

2
(Change Agent)

3

2 (Persuasion)

2.
2.1 (Smart Phone)

[1]
Smart Phone Mobile Device

System Software

[2] (Smart
Phone)
PDA

Contact Smart Phone

(Smart Phone)

2.2 Everett
M. Rogers

Rogers 5
[3]
1 (Knowledge)

3
206
NCCIT2015

5
5 (Confirmation)

3 (Decision)

2

4 (Implementation)

3.
3.1

400 400
[4]
0.5
95%

5%
400 400
207
4.

(Convenience Sampling)
3.2
3.2.1
3.2.2

3
3.3
3.3.1

3.3.2

3.3.3

3.3.4

3.4
3.4.1
[5]
3.4.1.1
4.1
1:
1.

2.

3.

Smart Phone Tablet
4.

5.
6.

7.
8.

9.

10.
11.

12.
10
10
x=
x
n
x
x
n
3.4.1.2
S .D. =
n x 2
x)
NCCIT2015
n (n 1)
S.D
x
208
S.D.
4.28
0.65
4.07
0.69
4.04
0.78
4.04
0.76
4.07
0.76
4.05
0.75
4.04
0.78
4.03
0.74
4.07
0.78
4.12
0.73
4.08
0.78
4.14
0.74
13.
14.

15.

16.

17.
18.

19.
20.
21.

22.

23.

24.
25.
S.D.
4.10
0.74
4.09
0.72
4.09
0.74
4.07
0.73
4.12
0.74
4.06
0.77
4.18
0.73
4.13
0.75
4.30
0.64
4.01
0.78
4.04
0.74
4.07
0.73
4.07
0.82
NCCIT2015
5.
5.1

5.2
5.3

5.4

5.5
6.
[1]
[2]
. 2548.
. , 18
2548.
. 2548. .
, 5 2548.
[3] Rogers, E.M. 2003. Diffusion of Innovation. 5th ed. New

York: The Free Press. . 2550.
209
[4]

:
. (27 2554).
. 9 2555,
http://www.jakkrit.lpru.ac.th/pdf/27_11_44/9.pdf
[5]
. 2543.
. ( ) 8. :

.
210
NCCIT2015
NCCIT2015

Development of the System for Electronic Media Classification by Using
the Dewey Decimal Classification System
(Worapapha Arreerard)1 (Laongtip Mathurasa)2
(Monchai Tiantong) 3 (Dusanee Supawantanakul)2
1
2
3

worapapha@rmu.ac.th, laongtip77@hotmail.com, drmonchai@gmail.com,s.dusanee@hotmail.com
Abstract
This research had its aims to 1) study the elements of a
1)

2)
3)
4)

1)
2

2)

DFS()

3)

100.00 4)

:

system for classifying the electronic media in the eDLTV

system, 2) to develop the system for classifying the electronic,
3) to find out the efficiency of the system for classifying the
electronic media and 4) to evaluate the system for classifying
the electronic media by the experts, by using the Dewey
decimal classification system (DDC or DC). The tools used
in this study were: the questionnaires related to the system
elements and system development. The statistics used were
Mean and Standard Deviation.
The research results found that 1) according to the study
of the elements of the system for classifying the electronic
media by using DDC, there were two components: electronic
media classification, and media search and copy. According
to the expert evaluation, the elements had the suitability in
the highest level. 2) Based on the development of the system
for classifying the electronic media by using DDC, it was
found that the system developed was to take the media in the
eDL-square system to be classified by using DDC. This
allowed users to search for the media within the system by
DFS method and the system then displayed search results
according to DDC so that the users can copy the media as
their needs. 3) In regards to the results of finding systems
efficiency, it was found that the system had its search
efficiency in the terms of accuracy and correctness, 100%
and 4) based on the expert evaluation on the system for
classifying the electronic media by DDC, the system
developed had its suitability at a high level.
Keywords: Information Classification, Electronic Media,
Information Retrieval and Dewey Decimal Classification
System
211
1.
NCCIT2015
2.
2.1

2.2
2.3

2.4

(Electronic Distance Learning Television:

eDLTV) 1-2
[1]

(.) (eLearning)
80 5
2550
1,303
[2]

[3] 932
84.82
1)
2)

3)

[4]

(Dewey Decimal Classification)

(User friendly)
(Decision tree)

3.
3.1 (Dewey Decimal Classification)
DC DDC

10 10
[5]

(Ontology)
[6]

[7]

[8]

[9]
3.2
.

2551 8 [10]

()
3.3 (Information Retrieval : IR)

212
NCCIT2015
IF-THEN

4.1.3
[15]
Breadth-First Search BFS()
DepthFirst Search DFS()

DepthFirst Search
DFS()

[11]
6 1)
(Text Processing) 2) (Indexing) 3)
(Query Processing) 4)
(Searching) 5)
(Ranging) 6) (User Interface)
[12]

(Keyword) (Query)

[13]

(Recall)
(Precision)
4.4 (Decision
Tree)

[14]

4.1.1 ( Decision Tree
Representation)
1) ( Internal Node)
(Root Node) 2)
(Branch node Link) 3) (Leaf
Node)
4.1.2

4.
4.1
4 1)

3 4 2)

3 3 3)

3 4)

3
4.2
ADDIE
5 (Analysis)
(Design) (Development)
(Implementation) (Evaluation)

1.00
4.3
213
4.4
NCCIT2015
2
Index
DFS()

2:

1:

1
1
1 ADDIE
5

1:
5.
5.1

[12]

2 2
1
eDLTV

Index
1.
2
1)
2)
2. 1

3. 2

214
SD.
5.00 0.00
5.00 0.00
5.00 0.00
5.00 0.00
5.2

1
2
3
NCCIT2015
3 2 )

) DFS()

5.3

5.3.1
26 66

100.00
5.3.2
40 882
100.00
5.4

2 3
3:
1. Functional Performance Test

2. Functional Test
3. Usability Test
4. Security Test
X
4.88
4.97
4.87
4.87
4.90
SD.
0.34
0.18
0.35
0.35
0.30
3

(X=4.90, SD.=0.30)
Functional Test
Usability Test Functional Performance Test
Security Test
3:
215
6.
6.1
2

6.2

DFS()

6.3

100.00
6.4

[5]
[6]
[2]
[3]
[4]
. (2552). :
. [].
http://mazharlaliwala. wordpress.com /2011
/07/27/treasure-of-e-books/ 2556, 21.
Prabowo, R. et al, (2002). Ontology-Based Automatic
Classification for the WebPages: Design, Implementation
and Evaluation. Proceedings of the 3rd International

Conference on Web Information Systems Engineering.
[7] . (2545).
[8]

.

.
Yelton, Andromeda. (2001). Non-Western Languages
and Literatures in the Dewey Decimal Classification

[9]
Scheme. Information Technology And Library. pp. 7-15.

Bhattacharjee, Pijush Kanti. (2010, August). Modified
Dewey Decimal Classification Theory for Library
Materials Management, International Journal of
Innovation, Management and Technology, 1(3), 292-294.
[10]
7.
[1]
NCCIT2015
. (2552).
e-Learning

80 5 2550. [].
http://www .edltv.thai.net. 2555,
20.
. (2555).

e-Learning (eDL-Square).
.
. (2556).
1
.. 2556.
: .
, ,
. (2557).
.
10 8-9
2557. :
.
[11]
[12]
[13]
[14]
[15]
216
. (2557).
. [].
http://www.otpcappcon.com 2556,
25.
Ferber, R. & Thiel, U. (1996). Digital Libraries and
Information Retrieval. ERCIM News, 927,15-27.
. (2553, ). .
. 20(3), 514-523.
. (2557). . [].
www.bannatad. human.cmu.ac.th/ index.php
/bannatad/article/download/.../34. 2557,
5.
. (2546). .

2545. :
.
. (2550).
JAVA. : .
NCCIT2015
iOS

Application Development on iOS for Cycling to Travel
A Case Study: Phuket Tourism
(Amonrat Prasitsupparote)1 (Phuriphong Phumirawi)2
(Apichaya Khwankaew)3 (Kantida Nanon)4

1
amonrat.pr@phuket.psu.ac.th, 2, 3,4project039046058@gmail.com
history. There are many applications in the App store but

they cannot locate the viewpoint, toilet or bicycle repair

iOS

Usability Testing

32

:
GPS
shop. This research develops an application on iOS for

cycling to travel that focus on Phuket tourism that it can
locate the viewpoint, toilet or bicycle repair shop on the
route workout data or on the map. We use the usability
testing for examine this application. There are 32
respondents from the online questionnaire. As a result,
all respondents are very satisfied.
Keywords: Mobile Application, Tourism, Cycling, GPS
Tracking.
1.

1
9

5%
[1]
[2]

1

Abstract
Nowadays, cycling was one of the most popular sports
in Phuket. Most cyclists use their smart phones to keep
their route workout to smart phone that they can view
their route workout data, and comprehensive workout
217
NCCIT2015

200
...
600 [5]

[3]

iOS

2.2

GPS

GPS [6]
GPS

Facebook
4
Strava, Runtastic, Endomondo
MapMyRide 1
1 4

Social Media

MapMyRide
4

iOS

2.

iOS

2.1

[4]

218
3.2

iOS Objective-C
MySQL
API MapMyRide [7]
JSON API
1
4
Social Media

4
1:

Social Media
Strava
Facebook,
Twitter,
Instagram
Runtastic
Endo
mondo
MapMy
Ride
Facebook,
Twitter,
Email
Facebook,
Twitter
Facebook,
Twitter,
Email
NCCIT2015
1: Architecture
3.
2:
3.1
2.2
App Store

iOS

3:
4:
219

Facebook account

2
3

4

5
6
1)

7

2)

3)

8
4)
9
NCCIT2015
7:
8:
9:
3.3
Usability
Testing

10
1-5
1)
2)
3)
4)
5)
6)

7)
8)

5: 6:
220
3:
9)
10)
1.
2.
3.
4.

5.

6.

7.
8.

9.
10.

2:
NCCIT2015

4.21 5.00
3.41 4.20
2.61 3.40
1.81 2.60
1.00 1.80
2

5
4.

Google 32
56 44 20 16
20 30 84 31
40 51
3
(SD) 0.62-0.78

2 9

4.19
221
SD
(X )
16
14
4.44
0.62
15
14
4.38
0.66
15
13
4.31
0.78
14
13
4.28
0.73
12
14
4.19
0.74
0.78
0.65
0.70
0.77
0.67
16
14
15
12
20
10
15
13
19
4.31
4.34
4.34
4.28
4.53
5.
NCCIT2015

iOS
App Store

App Store

32 56 44
20 16 20
30 84 31

4.34
0.66

[1]
,
.
[ ]. : http://www.phuket.go.th/webpk/
file_data/asian/01.pdf. [ : 06-Mar-2015].
[2]
, ,
. [ ]. :
http://www.phuket.go.th/webpk/contents.php?str=travel.
[ : 06-Mar-2015].
[3]
Phuket E-Magazine Blog, . [ ].

Available: http://www.phuketemagazine.com/blog/2012/
07/phuket-international-mtb-jamboree-2012. [ : 06Mar-2015].
[4]
Tourism Authority of Thailand,
Thailand
Travel
Guide for Phuket., Thailand Travel Guide for Phuket.,

06-Mar-2015. [Online]. Available: http://www.tourism
thailand.org/Phuket.
[5]
, .
[]. Available: http://www.phuketcity.go.th/gallery.
[ : 06-Mar-2015].
[6]
,
,
, 2554.
[7]
MapMyFitness, Under Armour Developer. [Online].

Available: https://developer.underarmour.com/. [Accessed
: 09-Mar-2015].
222
NCCIT2015

A Prototype of Geographic Information System based on Appropriate
Irrigation Decisions in Maiseab Weir, Nakhon Si Thammarat Province
(Sarintorn Wongyoksuriya)1 (Onjira Sitthisak)2
(Anisara Pensuk Tibkaew)3
1,2

3

sarintorn.wongyoksuriya@gmail.com, 2onjira.sitthisak@gmail.com, 3anisara.pensuk@gmail.com
rubber trees and palm trees in Maiseab weir. The

prototype was developed to solve the problem of water

-

CropWat
(Linear
Programming Models)

:
CropWat
allocation without considering irrigation schedule and

getting total profit from the harvest of all crops. The
researchers
implemented
the
prototype
as
web
application and using CropWat Program for computing

crops
water
requirements
and
applying
Linear
Programming Models to create a model for supporting

appropriate irrigation decisions. Then, the Geographic
Information Systems display the results in the form of
maps. The results of the study demonstrated that this
prototype can be developed for computing crops water
requirements and irrigation schedule of water allocation
and maximum profit from the harvest of all crops.
Keywords: Decision Support System, Linear
Programming Models, Geographic
Information System, CropWat, Irrigation.
1.

43,072
5,906 20,259 1,309
15,598

9

Abstract
The aim of this paper is to create a prototype for
calculating the quantity and finding optimal irrigation
schedule for water allocation to crops such as rice,
223

[1]
-

(Linear Programming Models)
(Decision Support
System :DSS) [2]

1
(Geographic
Information System: GIS) [3]
4 1
2
CropWat
ArcGIS
3
4
NCCIT2015

(Reference Crop Evapotranspiration (ETo)),
(Crop Water Requirements)
(Crop Irrigation Requirements)
Penman-Monteith

2.1.3 ArcGIS [8]

ESRI Component Object
Model (COM)

ArcGIS
ArcView ArcEditor ArcInfo

, ArcSDE Enterprise Database

ArcIMS
2.1.4 (Research Reliability) [9]
(Consistency)

(Measure of
Equivalence)
2

2 (Pearson
Correlation Coefficient)
Garett 0.00-0.20
0.21-0.40 0.41-0.70
0.71-1.00
(Reliability)
2.
2.1
2.1.1 (Linear Programming :
LP) [4], [5], [6]
(DSS)

(Optimization Model)

(Minimization) (Maximization)
(Objective Function)
(Constraint Functions)
2.1.2 CropWat
Land and Water Development Division [7]
224
2.2
2.2.1
Tzimopoulos, et al. [10] LP

(Irrigation Network)
LP

Bhuvandas, et al. [11] LP
Tzimopoulos, et al. [10]

(Surface Water)
100%, 90%, 80% 70%

2.2.2
Z. Chen et al. [12]

WebGIS

Penman Monteith

A. Peeters et al. [13]
Z. Chen et al. [12]
ArcGIS
(Spatial Decision Support System: SDSS)

GWR (Great woman-made River)

ArcGIS
NCCIT2015

LP

3.
3.1
1:

1

CropWat
(ETo) Penman-Monteith
(LP Model)

(Database)

ArcGIS (GIS)
(Web Application)
225
3.2
PHP
MySQL ArcGIS v. 10.2
CropWat v.4.2
CropWat v.8.0
LP

3
1
CropWat
(ETo)
CropWat

2 version CropWat v.4.2
CropWat v.8.0
2
.CSV 3
NCCIT2015
2

(ETo) .CSV

(LP
Model) 2 [14]
1)

2)

1)

4
2: CropWat
3: .CSV
4:
226
NCCIT2015

2558
2557
2557 2557 [15-17]

-
1 2
08.00 . 3
1 08.00 .

[9]

3

2

ArcGIS

5
5: GIS
5.

15

.. 2559

4.

[1]
227
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
,

, , 2556.
, (Decision Support
System), [ ], http://www.sirikitdam.egat.com/
WEB_MIS/107/index.html ( 5 2556).
,
(GIS) ArcView 3.2a 3.3. :
..., 2549.
,

, 2550.
,
, 2537.
,
(Quantitative Analysis for Management)
, 7-49.
D. Clarke, M. Smith and K. El-Askari, CROPWAT for
Windows: User Guide FAO, Rome, Institute of Irrigation and
Development Studies (IIDS), Southampton UK, National Water
Research Centre (NWRC), Cairo, Egypt, 1998.
Esri. ArcGIS. Retrieved august 18, 2013, Available at
http://www.esri.com/.
,
, , 2556
C. Tzimopoulos et al., Irrigation Network Planning Using Linear
Programming, in Proceedings of the 12th International Conference
on Environmental Science and Technology, September 8-10, 2011,
A1939A1946.
N. Bhuvandas et al., Optimization Of Irrigation Area of Ukai
Right Bank Main CanalA Linear Programming Approach, in
INTERNATIONAL CONFERENCE ON METHODS AND
MODELS IN SCIENCE AND TECHNOLOGY (ICM2ST10),
November, 2010, pp. 127-129.
Z. Chen et al., Water-Saving Irrigation Management and
Decision Support System Based on WEBGIS, in Computer and
Computing Technologies in Agriculture V, October 29-31, 2011,
pp. 301-312.
A. Peeters et al., Developing a GIS-based Spatial Decision
Support System for Automated Tree Crop Management to
[14]
[15]
[16]
[17]
228
NCCIT2015
Optimize Irrigation Inputs, in Proceedings of the sixth biannial

meeting of the International Environmental Modelling and
Software Society, July 1-5, 2012, pp. 1415-1422.
,

:
: International Computer Science and
Engineering Conference (ICSEC), 31 2557,
, 2557, 67-72.
,
2558, [ ],
http://www.oae.go.th/main.php?filename= journal_all ( 3
2558).
, 2557,
[ ], http://www.dit.go .th/SuratThani/
contentdet.asp?deptid=66&id=10553 ( 3 2558).
,
(Thailand rubber price), [ ],
http://www.rubber.co.th/rubber 2012/rubberprice_yr.php (
3 2558).
NCCIT2015

A Development of Information System Integration by TUNA Model Using :
A Case Study of Nation University
(Burin Rujjanapan)

thaiall@hotmail.com

2556

(x = 4.24,S.D.=0.11)

(x = 4.03,S.D.= 0.53)
(x =3.64,S.D.=0.93)

:

3
7 20 10

(Tuna
Model) 3
( Knowledge Vision)
(Knowledge Sharing) (Knowledge Asset)

12 ( Vision)
(Indicator)
(Plan) (Resource)
(Group Discussion)
(Analysis) (Practice)
( Synthesis)
( Management)
(Evaluation)
( Sharing) ( Outcome)
Abstract
The objective of this operational research is to
develop the integration of the information system by
TUNA model for the quality assessment. It will help the
worker to meet their requirement. The system will be used
as the case study of Nation University.
The data
sampling is divided into 3 groups, consisting of 7

administrator, 20 faculties, and 10 employees. The system
development tools are Internet Information Server, PHP
Interpreter, AJAX and MySQL Database. Another tool
for knowledge management process is TUNA model that
consist
3 parts of knowledge vision, knowledge sharing and
knowledge asset. This tool is developed to extend in
12 sub-process that consist 12 parts of vision, indicator,
229
NCCIT2015
plan, resource, group discussion, analysis, practice,

synthesis, management, evaluation, sharing and outcome.
Likert scale for rating questionnaire is collected to
evaluate system performance 3 times. This system can
serve for the assessment on 2556. The evaluation result of
training's satisfaction in statistic course is highest
(a mean of 4.24 and standard deviation of 0.11). The
evaluation result of systems satisfaction in peer visit
group is high (a mean of 4.03 and standard deviation of
0.53). The evaluation result of systems satisfaction is
high (a mean of 3.64 and standard deviation of 0.93). It is
concluded that the system performance can satisfy the
users.
Keywords: Tuna Model, Quality Assurance, Knowledge
2.
Management.
2.1 [2]
..2542
( 2) ..2545

6

(.)

9
[3]

(.)

18 2555
1.

..2542

(.) (.)

2549 [1]

230
NCCIT2015

[7]

(Tuna Model) 3 1)
(KV) 2)
(KS) 3) (KA)
2 1)
2)
4.46
0.23 3.89
0.86

.
2557
2.2
(Tuna model) [4] .

3 (KV=Knowledge Vision)
(KS=Knowledge Sharing)
(KA=Knowledge Asset)
(PHP Language) [5]
(Open Source Computer Language)
(Dynamic Webpage)

2.3
[6]

2

3.
3.1
3.1.1

3.1.2
100
7 20 10
3.2
(Tuna model)

12 3
231
NCCIT2015
(KV) 1) /
(Vision) 2) (Indicator) 3)
(Plan) 4) (Resource)
(KS) 1)
(Group Discussion) 2)
(Analysis) 3) (Practice) 4)
(Synthesis) (KA)
1) (Collection) 2)
(Management) 3) (Evaluation) 4)
(Sharing)
(Top-Down
Direction)
(Bottom-up
Direction)
2 :
3.4.1

(Rating Scale) [8]
5
3.4.2

4.215.00 3.414.20
2.613.40
1.812.60 1.001.80
1 :
3.3

(Peer visit)
3.4

3 :
4.
4.1

(Horizontal Communication) (Data)
232
NCCIT2015

4

2

(x=4.24,S.D.=0.11)

(x=4.03,S.D.=0.53)
(Information)

4 :
4.2

5 :
4.3

4 /

7 :
4.5

4

6 :
4.4
233

(x=3.64, S.D.=0.93)
5.
NCCIT2015
8 :

IPOI (Input Process Output
Impact)

[1]
[2]
[3]
[4]
[5]
[6]
[7]
,
,
, , 2550.
,
, ,
, 2553.
(
),
,
(), , 2555.
, ,
, , 2549.
, PHP MYSQL ,
., , 2549.
,
,
, , 2547.
,

, the 9th National Conference on
Computing and Information Technology (NCIT2013),
, , 9-10 ..2556 234-239.

[8] L.W. Anderson, Likert Scales, Education Research
Methodology and Measurement : An International
Handbook, John, D. Keeves, eds, Victoria : Pergamon
pp.427-428, 1988.
234
NCCIT2015

Development of the Training Packages the Robot Control Programming
with C for Students of Technical Teacher Training Program
(Kitti Surpare)1 (Patpong Armornwong)2

1
kittisurpare@yahoo.com, 2paw@kmutnb.ac.th
Abstract
The purpose of this research was to develop the

4
1
2

6
3

4

6.26

.01

:
Training packages for The Robot Control Programming

with C for students of technical teacher training
program. The research was divided into 4 stages the first
stage was to analyse for the Training packages by
studying
related
documents
and
revising
related
literature. The second state was to define elements for the

practice packages by using the information studied and
revised. The elements consist of a workshop training
course. Training plan, documents training, pretest and
posttest, evaluation form, and a robot. Six experts
examined these element and gave suggestions. The results
of their evaluation was at the Good level. The third stage
was to evaluate the Training packages with another
group which are not the sample group to check the
completeness of the practice tool. And the fourth stage is
implementing the Training packages and evaluating the
attendees knowledge by the pretest and the posttest. The
contrast of both tests resulted in the value of t-test at
6.26, which showed the higher score of the posttest,
significant level at .01. The result of the evaluation of the
attendees satisfaction and opinion was at the High level
as the assumption. This can be concluded that the
Training packages is efficient. is able to enhance
knowledge of the attendees and practical.
Keywords: C Programming, Robot.
235
1.
NCCIT2015

4

1 2

[1]

236
2.
NCCIT2015
4.
4.1

4.1.1 5
4.1.1.1

-
4.1.1.2 3
4.1.1.3

32

[2]
PBASIC
4 20
14.48

.05

3.

3.1
3.2

3.3

15
3.4
3 (18 )
.2558
1:
4.1.1.4

14
4.1.2
4
1.
2.
3.
4.

E-Book
237
NCCIT2015
SD
4.46
0.46
4.49
0.50
4.14
0.48
4.40
0.36
4.27
0.67
4.35
0.49

6

6
4.35 0.49
4.2.2

2: E-Book
4.1.3

2:

1.
2.
3.
3.1
3.2
3.3
3.4
4.
4.1
4 .2
4.3
4.4
5.
3:
4.2
4.2.1

6

1.
238
S.D.
3.93
0.79
3.73
0.70
3.73
3.80
3.73
3.66
0.79
0.77
0.88
0.61
4.00
3.73
0.84
0.88
3.66
3.53
3.80
0.61
0.91
0.67
6.
6 . 1
Presenttation
6.2
6.3
7.
8.
9.
10.
11.
12
13.
14.
3.80
0.67
4.00
0.65
3.87
3.73
3.93
4.00
4.27
4.13
4.00
4.00
4.00
0.51
0.96
0.70
0.65
0.79
0.63
0.65
0.53
0.59

.01
5.2
6

5.3
15

3:
S.D.
15
32
19.1
3.34
6.26
15
32
11.4
3.64
NCCIT2015
6.
6.1
6.2

6.3

t 6.26
t .01 df 14
t 2.624 t
t

5.

5.1
t-test
239
NCCIT2015
6.4

t-test t
t

.01
6.5

[1] 1

[2]
PBASIC
.
7.
7.1

7.2

7.3

240
NCCIT2015

Test Cases Generation from Business Process Model based on Event Driven
(Sarawut Waleetorncheepsawasd)1 (Taratip Suwannasart)2

1
Sarawut.Wa@student.chula.ac.th, 2Taratip.S@chula.ac.th
on event driven. The test cases generation process is

composed of creating a control flow graph, calculating test
path, generating test data, and generating test cases.

Keywords: Test Cases Generation, BPMN, Business
Process Model, Business Analysis, Event
Driven.
1.

(Business Process Model)
(Business Process Model and Notation) [1]
Abstract
BPMN becomes a popular choice of business analysis
for business processes of an organization. Business process
model is derived from system requirements. BPMN can be
used as a material for test cases generation. There are
many researches proposed approaches to generate test
cases from business process model, but there is no
research supports event driven concept that allows event
models triggering other parts in the business process
model. Thus, this research proposes an approach for
generating test cases from business process model based
241
NCCIT2015
(Sequence Flow)
1
2
3 4
5 6

1:
2.2 (Event driven)

(Start event)
(Intermediate
event)
(End event)

3
2
(Catch)

(Throw)

(Event
Definition)

10

2
2.

2.1
(Business Process
Management Initiative)
(Object Management Group)

(XML schema definition)

(Extensible
Markup Language) (BPMN
Diagram Interchange)

(Activity) (Event) (Gateway)
2:
242
3.
NCCIT2015
, ,

3.1 Contract-based test generation for data flow

of business processes using constraint
programming [2]

(Business process contract)
(Constraint language)

3:
4.1

2

4.1.1

(Node) ,

(Edge)

4.1.2

3.2 Design of a tool for generating test cases

from BPMN [3]

(Extension
Element)

3.3 Translating RAD Business Process Models
into BPMN [4]

(Role Activity Diagramming)
2
1)
2)

4.

3 4
243

4

signal_001 signalRef

NCCIT2015

(Physical)

(Information)

age Integer 0 100
4.4
1

4.2

4
1) :
2) : (User action)

(User
task) (Manual task)
4:
4.2

(Root node) (Leaf node)
(Token)

1 1

4.3

244
NCCIT2015

6

6 notify
8 notify

1
3) :
4) : (System
response)

5.
Check
credit

5

Check credit
, ,

(Event Sub-Process) Notify handling

6:
1: Check credit
Check credit_1
1>2>3>4>5>6>
8 > 9 > 10
Check credit_2
1 > 2 > 3 > 4 > 5 > 11

Check credit_1 4 Insert
request credit Integer
request_credit remain_credit
5

remain_credit 10
5:
245
NCCIT2015
request_credit
Insert request credit Check
credit_1 10

2
Checkcredit
2
3:
2: Check credit
Check
1. Insert
customer_id
1.1 Retrieve
credit_1
customer
= 123
customer data
Check credit
2.1 Send
request
= 11
SMS
1. Insert
customer_id
1.1 Retrieve
credit_2
customer
= 123
customer data
NestedProcess
80%
95.56%
SubEvent
50%
100%
Message
65.33%
92.85%
Condition
65.33%
92.85%
Signal
88.23%
95%
100%
100%
Escalation
45.36%
100%
Boundary
38.55%
82.54%
- SMS_item
Check
100%
6.
2.2 SMS
credit
83.35%
Link
= 10
request_credit
100%
Subprocess
- remain_credit
2. Insert
75%
- remain_credit
= 10
2. Insert
request_credit
2.1 Approved
request
= 10
- Approved
Model and Notation Specification, v2.0. Technical report,
message
OMG, 2011.
credit
[1]
[2]
Object Management Group (OMG). Business Process
A. Jimenez-Ramirez, R.M. Gasca, and A.J. Varela-Vaca.

Contract-based test generation for data flow of business
processes using
International
constraint programming. The 5th
Conference
Research
Challenges
in
Information Science (RCIS), 2011.

[3]
Yotyawilai P, and Suwannasart T. Design of a tool for

generating
test
cases
from
BPMN.
International
Conference on Data and Software Engineering (ICODSE),

2014.
[4]
Rana Yousef, et al. "Translating RAD Business Process

Models into BPMN". The 2nd International Conference
Applications of Digital Information and Web Technologies
(ICADIW09), 2009.
246
NCCIT2015

JSON Cache with NoSQL
(Aiyapan Eagobon) 1 (Nuengwong Tuaycharoen)2
1

2

1
staykung@gmail.com, 2nuengwong.tun@dpu.ac.th
make the system more efficient, this research has linked

data from various government agencies, including

JSON Text File

142.8 ms Text File
NoSQL
NoSQL
SQL MySQL
10,000 NoSQL
3.041 MySQL
140
NoSQL MySQL
JSON Cache NoSQL

:

external agencies and the Authority itself. This is to

increase the effectiveness in data usage application, and
support fast execution.Currently, the system performance
is limited by the structure of the server. The performance
of the system decreases while
the users increase,
especially when requesting for external information. Our

study found that JSON Cache on a Text File can improve
the performance of the system to 142.8 ms on average.
However, data caching on a Text File may not be the best
solution. Also, using NoSQL as the cache DBMS can
perform better than using Text file or SQL-based DBMS
such as MySQL. With 10,000 data points, NoSQL spends
only 3.041s, but MySQL spends over 140s. For data
fetching and displaying, NoSQL and MySQL have similar
performance. Therefore, when applying JSON Cache and
NoSQL together, the entire system can be improved
significantly.
Keywords: JSON Cache, NoSQL, GIS, e-government.
1.
(GIS)

.. 2543

Abstract
Currently, the Metropolitan Waterworks Authority
(MWA) has developed GIS and web technologies into use
to provide a mapping system for decision-making. To
247
NCCIT2015
(Spatial Data) 2

2.1.3 Web service[3]
(Web service)

RPC(Remote Procedure Call)

2.1.4 NoSQL[4]
NoSQL
(Relation Ship) NoSQL

NoSQL
Facebook, Twitter NoSQL
Open source
NoSQL Database

2.2

[5]

[6]
--

Apache Axis2
- -

(Centralizes System)
WGS-84

JSON Cache SQL
NoSQL
2.
2.1

2.1.1 [1]
(AJAX : Asynchronous JavaScript and XML)
(asynchronous)

2.1.2 [2]
(GIS : Geographic Information
System)

248
NCCIT2015

[5]
[6]
[7] JSON

[8]
NoSQL binary[9]

[10]
(Hyper Text
Transport Protocol)
(Simple Object Access Protocol)
[7]

(Search)

[8]

2

(Service Oriented Architecture)
(Platform)
[9]

2(Binary)

[10]

3.

[5]

3.1.
3
,

1
1
(
) ()
(Ubuntu Server)
249
NCCIT2015
4.
4.1.

Microsoft Windows 8.1 Professional 64 Bit
Firefox V.35.0.1
MySQL SQL MongoDB
NoSQL

12.00 . Web Console Firefox
4.2.

(1)
(2)

(3) MySQL NoSQL
(4)
MySQL NoSQL
4.2.1

1:

NoSQL
text file

3.2.
2: JSON Cache
2

JSON Cache JSON

Text File, NoSQL
SQL Ubuntu Server

3:
250
NCCIT2015
4.2.3. MySQL
NoSQL
3

5 x
y
2

4.2.2
5: MySQL NoSQL

2
MySQL NoSQL(Mongo DB)
MySQL
NoSQL 5

5
10, 100, 1000, 10000

5 x
y
(ms)
MySQL
NoSQL 5
MySQL NoSQL
10,000 MySQL 140,000 ms
NoSQL 3,041.4 ms
MySQL
Header Nosql
MySQL NoSQL
O(n)
4:
3

text
file 4
312 ms

100 ms
text file
query

251
4.2.4.
MySQL NoSQL
NCCIT2015

text file .JSON

NoSQL MySQL NoSQL
MySQL
6: MySQL NoSQL
6
MySQL
NoSQL MySQL
NoSQL
5 10, 100, 1000, 10000
MySQL
10,000
NoSQL MySQL
MySQL NoSQL
O(n)
[1]
http://www.w3schools.com/ajax/ ( 27
2558).
[2]
http://www.gisthai.org/about-gis/gis.html (
25 2558).
[3]
[4]
[5]
5.

,

,

NoSQL
MySQL
[6]
[7]
http://www.w3schools.com/webservices/ ( 1
2558).
http://www.w3resource.com/mongodb/nosql.php (
29 2558).
.
.

10 (NCCIT 2014). . . 8-9 2557.
Amila
Liyanaarachchi,
Shahani
Weerawarana
Applications An End-to-End Caching Protocol for Web
Services [internet].2011 [cited 2015 Jan 10]. The
International Conference on. P 096 - 102.
U.Sridhar, Dr.G.Gunasekaran, P.Rajesh, New Approach
of Dynamic Web Components Composition using Cache
Proxy Servers.2013 [cited 2015 Jan 5].
[8]
B. Chandra Mouli,Prof. C. Rajendra, Caching and SOAP

compression techniques in Service Oriented
Architecture.2012 [cited 2015 Jan 20].
[9]
B. Chandra Mouli,Prof. C. Rajendra, Caching and SOAP

compression techniques in Service Oriented
Architecture.2012 [cited 2015 Jan 28].
[10] Rifat Ozcan, Ismail Sengor Altingovde, zgr Ulusoy,

Cost-Aware Strategies for Query Result Caching in Web
Search Engines.2011 [cited 2015 Jan 30].
252
NCCIT2015
iOS Tor
A Web-based Information System for Reporting Traffic Police Bribe via
iOS Smartphones with Tor
(Sitichai Chumjai)1 (Nuengwong Tuaycharoen)2

1
meed96@gmail.com, 2nuengwong.tun@dpu.ac.th
web-based information system for reporting traffic police

bribe via iOS smartphones to allow users to engage in

iOS

Tor Network

60%-90%

:

bribery reporting and follow the information through the

application. Unlike other versions of such application,
our system provides security to users on the bribe report
by using Tor Network for hiding the sender's identity.
This assures the users that the system is safe for their
identities. The experimental result shows that the bribe
reporting has 60%-90% success rate due to the size of the
uploading pictures and the internet traffic, varied during
the day. We hope that the information on the web for
reporting traffic police bribe via iOS smartphone will be
a part in the reduction the amount of bribery for less.
Keywords: Mobile Application, Bribe Report, Tor
Network.
1.

2
[1]

Abstract
Currently, bribery amount in Thailand is increasing
every year, especially the traffic bribery, which is one of
the most prevalent bribery. In addition, in recent years,
the Internet and smart phone technology has played a
greater role in daily life.
Therefore, we develop a
253
NCCIT2015
Tor Network
AES Tor Node
3 hop Exit Node

Tor Node
Requests
IP Address
Tor Node
2.2 Tors API on iOS[4]
Tor Network
Tor Network
[4] Tor's API Smartphone

Smartphone
iOS API

API
TLS
API Tor Network
Onion Browser
Browser Tor Network
2.3
[2]
[2]

30
3G /
WIFI

on demand

iOS

[2]
iOS

Tor Network[3]

2.
2.1Tor Network [3]

Tor Network

Tor Network
Tor Network
254
3.1
10

1.97

2.4 I Paid a Bribe [5]
I Paid a Bribe

2.5 Bribe Spot [6]
Bribe Spot

iOS

iOS

3.
NCCIT2015
1:
1
GPS

Tor Network

2
2:
2
Tor Networks

iPhone 5 iPhone 5S

3.2
Xcode 6.1
iPhone iOS 7.1.2 ,
255
NCCIT2015
2).

8.1.2, 8.2 Dreamweaver CS5

www.bribery-report.com Facebook API[6]
Facebook Fanpage
3.3 GPS
GPS

[7]

3.4

1

3.5 Tors API on iOS

1 Tor API [4]
UDID
Tor Controller Tor Controller
Tor Node
4.
4.1
iPhone5
iOS 7.1.2 , 8.1.2 8.2

10
10
4.2
3

NSString *sid = var.user_id;

NSString *slat = [NSString stringWithFormat:@"%f",var.lat];
NSString *slon = [NSString stringWithFormat:@"%f",var.lon];
NSString *sp_id = var.police_id;
NSString *sdec = descripetion.text;
NSString *sbrie = bribry_money.text;
NSString *spname = var.namepolice;
NSString *udid = @"id=";
NSString *lat = @"&lat=";
NSString *lon = @"&lon=";
NSString *p_id = @"&pid=";
NSString *des = @"&des=";
NSString *brie =@"&brie=";
NSString *pname = @"&pname=";
3 :
TorController
sendIt:udid:sid:lat:slat:lon:slon:p_id:sp_id:des:sdec:brie:sbrie:
pname:spname];
1: Tors API on iOS

4: ( ),
3.6
1).

()
()
256

4
(),
()
()

( 5) ( 6 7)

NCCIT2015
5

6

10
7

4.3.
%
100
30%
50
15%
5:
5%
100%
8:
[2]
Tor Network
(100%)
1.97 iOS
Tor Network
40
8

10

30% 15% 5%

8MP iPhone5
6:
7:
257

18.00-21.00

5%

15% 30%
http://www.geodatasource.com/developers/mssql.
[Accessed November 25,2014].
5.

Tor Network

Tor Network

60%-90%

[1]
[2]
[3]
ASTV , " -- 2
5 ",
: http://www.manager.co.th/iBizChannel/ViewNews
id =9560000078328.
. "

", ECTI-CARD 2014, 21- 23 .. 57, .
Tor Project, [Online]. Available:
https://www.torproject.org/. [Accessed: May 21, 2014].
[4]
Suniti Wittayasatiankul, Sittichai Chumjai and

Nuengwong Tuaycharoen, Tors API on iOS, IC2IT2015, Bangkok, July 2015.(to be published)
[5]
Janaagraha, I PAID A BRIBE, [Online]. Available:

http://www.ipaidabribe.com. [Accessed: April 19, 2014].
[6]
Bribespot Thailand, Bribespot Thailand, [Online].

Available: http://bribespotthailand.com/. [Aceessed: April
19, 2014].
[7]
NCCIT2015
GeoDataSource.com, Calculate Distance by Latitude and

Longitude using SQL [Online]. Available:
258
NCCIT2015

Speech-Based Thai Text Retrieval
(Paphonput Sopon)1 (Jantima Polpinij)2
(Thongparn Suksamer)3
(Intellect Laboratory)
1
paphonput@gmail.com, 2jantima.p@msu.ac.th, 3thongparn@gmail.com
1.

2

:

(Text) [1-4]

(Query)

Google Smart phone
Google

Smart
phone SIRI
Smart phone SIRI
Smart phone

Mitini
( SIRI Windows)

Abstract
This work presents a method of speech-based Thai
text retrieval. The method consists of 2 main processing
steps: speech recognition and speech-based text retrieval.
For the speech recognition process, it is experimented
with the isolated words recognition. Afterwards, in the
process of speech-based text retrieval, after user inputs
the query with speech, the speech will be converted to text
( called speech-to-text). Finally, the relevant document
relating to illness and medicine household in everyday
life will be retrieved through the concept of keyword
search.
Keywords: Speech-based Text Retrieval, Speech
Recognition, Information Retrieval.
259
NCCIT2015

Douglas W Oard [3]

[4] Bai [5]
(alphabetic)

0.58-0.63
1:
2.

[6-8]

Fujii [1]

[2]
Okapi
3.

2
1
1: (Speech Recognition)

4 [9]
260
NCCIT2015
2: (Speech Feature
Extraction)

( .wav)

(Mel-Frequency Cepstrum Coefficients: MFCC)
[10]
[11-12]
3: (Acoustic Modeling)

(Isolated word)
(Hidden Markov Model: HMM) [13]

4:

(Accuracy)
[14, 15]

1: (Speech Pre-processing)

( .wav)

3
1. (Pre-emphasis)

(First order filter) [10]
(Signal to noise ratio)
2. (Endpoint Detection) [10]

(Energy
level) (Zero-crossing rate)
N DS I
=
Accuracy
N
100
N D
S I

2:
(Sick)
3. (Windowing) [10]
(Frame)
10 40

2: (Text Retrieval)
(Keyword search)
(Keyword)

(Information Retrieval - IR) [15]
(Query)

261

3
3
(Speech-to-Text)

(Query)
NCCIT2015
wt,d t d
(q)
(d)
=
Score
tq d
(1 + log10 tft ,d )
score 0

4.
4.1 (Dataset)
2

(1)
3
6 ,
, , ,
50 25
25 3
.wav
(2)

text file
200
250
3:

(Document Surogate)

(Word segmentation)

(Dictionary-based word segnmentation)
(Longest Matching)
(Stop word)

(Bag of words: BOW)
2

term frequency (tf)

1 + log10 tft,d
, tf > 0
wt,d =
0
, otherwise
4.2 (Experimental Results)

(1)

6
Real Time 3
5 1
262
2:
1:

()
( )
3
30
4
30
5
30

NCCIT2015
50

45

36
34

76

20

24
(%)
72.9
70.0
72.0
71.63
1
71.63%
Real time

[17-20]
34
30
23
22
43
12
13
5. (Conclusion)
R
0.68
0.69
0.72
0.71
0.71
0.75
0.67
0.70
F
measure
0.76
0.72
0.75
0.72
0.76
0.74
0.74
0.72
0.73
0.72
0.76
0.75
0.76
0.71
0.75 0.73

Google Smart phone

Mitini (
SIRI Windows)

2

1

6 , ,
, ,

(2)

(Recall) [15]
(Precision) [15] (F-measure) [15]

2 ( ) 4 (
)

2
2 0.70

263

2 ( ) 4 ( )

71.63%
0.70
NCCIT2015
[10] Z. Wanli and L. Guoxin, "Speech Recognition Using

improved MFCC", International Conference on Electrical
and Computer Engineering, 2012.
[11] U. Shrawankar and V. Thakare, "Techniques for Feature
Extraction in Speech Recognition System: A Comparative
Student",
Computer
Science
and
Engg.
Amravati
University, 2013

[1]
[12] C. Ittichaichareon, S. Suksri and T. Yingthawornsuk,

"Speech
[13]
Information
Retrieval
Techniques
for
. . . 2545
[14] B.H. Juang and W. Chou, and C.H, Lee "Minimum
Classification
Speech
[15]
Digital Libraries", Technical report, The National Science

Foundation, University of Maryland, 1997.
A.R. Coden, E.W. Brown, S. Srinivasan, "Information
Conference
on
,
, (..
( ), , 2547.
Entropy-based
Endpoint
Detection
for
Speech
Recognition in Noisy Environments", Proceedings IEEE
Multimodal
International
Interfaces, 1999.
Symposium
on
Circuits
andSystems
(ISCAS), 2002, vol. 3, pp.328 -331
L.S. Lee and Y.C. Pan, "Voice-based information retrieval
[18] Chung-Ho Yang, "A novel approach to robust speech
how far are we from the text-based information
endpoint detection in car environments", Proceedings of
retrieval?", IEEE Workshop on Automatic Speech
IEEE International Conference on Acoustics, Speech, and
Recognition & Understanding, 2009.
Signal Processing (ICASSP), 2000
P. Kallioniemi, N. Rajput, G. Mahajan and M. Turunen,
[19] Atanas
"Data-model for voice search of agricultural information
Ouzounov,
"Telephone
Speech
Endpoint
Detection Using Mean-Delta Feature", Cybernatics and
system", Proceedings of the first workshop on Information
Information Technologies, 2014, Vol. 14, No. 2
and knowledge management for developing region, 2012.
[20] Nazaret Garca Trascasa, "Start-and-End Point Detection
J. Nilesh, P. Alai, C. Swapnil and M.R. Bendre, "Voice
at the Input of Speech Recognition Application", Master
Based System in Desktop and Mobile Devices for Blind
Thesis in Science in Telecommunication Engineering &
People", International Journal of Emerging Technology
Management, Universitat Politechnica De Catalunya,
and Advanced Engineering, 2014.

[9]
Speech
[17] Jia-lin Shen, Jeih-weih Hung, Lin-shan Lee, "Robust
B. Bai, B. Chn, and H.M. Wang, "Syllable-Based Chinese

Text/Spoken Document Retrieval Using Text/Speech
[8]
for
Retrieval, Addison Wesley, 1997.
2273, Springer-Verlag Berlin Heidelberg, NY, 2002.
[7]
Methods
[16] R. Baeza-Yates & B. Ribeiro-Neto, Modern Information
Retrieval Techniques for Speech Applications", LNCS vol
[6]
Rate
Processing, 1997. vol. 5, no. 3.
D.W. Oard,"SpeechBased Information Retrieval for
International
Error
Recognition", IEEE Transactions on Speech and Audio
Applications, 2002.
Queries",
, "
Hidden Markov Model", .
A. Fujii , K. Itou, and T. Ishikawa, "Speech-driven text
language model adaptation in speech recognition",
[5]
International
Modeling (ICGSM'2012), 2012
retrieval: Using target IR collections for statistical
[4]
MFCC"
Vocabulary Speech-Driven Text Retrieval", Proceedings
Language Processing (EMNLP), 2002.
[3]
using
A. Fujii, K. Itou, and T. Ishikawa, "A Method for Open-
of the Conference on Empirical Methods in Natural
[2]
Recognition
Conference on Computer Graphics, Simulation and
France, 2014
. Speech Recognition
. . 2552, 24-52.
264
NCCIT2015

Web-Based Call Center System using Voice over Internet Technology
(Thanawat Chalermpong)1 (Tanun Jaruvitayakovit)2

1
thanawat1974@gmail.com, 2tjaruvit@yahoo.com
Internet. The operators can give advising to the clients

according to the knowledge database in the system or

Call center

VoIP (Voice
Over IP)

: ,
,
directly ask from the expert, in the case that cannot fix
the problem using the knowledge database. In addition,
the call center supervisor can eavesdrop on the
conversation in order to evaluate the performance of
the operator at any time.
Keywords: Call center, VoIP, Asterisk.
1.

2.
2.1 VoIP
VoIP [1]

VoIP
Abstract
Currently, customer service or call center uses
communication via landline or mobile phone access to
customer service. There is a limit on the cost of the
caller and restrictions on the operational space of the
operator. So, researchers has an idea on how to fix this
problem. With the designed solution, customers can
access through a web browser and have a call with call
center by applying the Voice over IP technology. The
operators can work in any place that can access to the
265
2 H.3 2 3 SIP (Session

Initiation Protocol) SIP

1

NCCIT2015
Zoiper Webphone [3]

SIP
2.4 PHP

PHP [4] Scripting
Language
(Script)
JavaScript, Perl
PHP PHP
HTML
PHP Server-Side
HTML-Embedded Scripting Language
2.5 SQL
Open Source
SQL

2.6
R. Gable VoIP in a University Call Center
[5] VoIP

PHP
(Soft phone)

1: SIP Server
SIP User Agent User
SIP Session SIP Register

location User Agent
Domain SIP Proxy Server
Client SIP
Server
2.2 Elastix
Elastix [2]

(Unified Communication)
VoIP SIP Server IP-PBX
Linux Asterisk Apache MySQL

PBX Elastix
SIP, H.323, IAX, MGCP SCCP
2.3 Softphone web interface

SIP

Zoiper Webphone, Mizutech
Webphone Share ware

266
NCCIT2015
3.2
3
P. Limpong A Development of Information

Management System for Call Center [6]
PHP SQL

VoIP

START
1

2

3.
3.1

Softphone web interface

SIP Server

SIP 2
Record
(
)
7
END
()
3:

3.2.1
( 1)

Plugin softphone web interface
VoIP
SIP Server

4
2:
267
NCCIT2015
4:
5:
3.2.2
( 2)
1)

2)

(Supervisor)
2
Round Robin

Less work load first

3)
PHP
MySQL
3.2.3 ( 3)

3.2.4 ( 4)

3.2.5 ( 5)

3.2.6
( 6)

3.2.7
( 7)
2
268
NCCIT2015
1)

2)

3.2.8
(Supervisor)

1-10

3.2.9 (Administrator)

5 10001
4 2001
3 301
6-7
6:
7:
269
4.

1
2
1:

25
3
2
30
()
13
5
2
20
5.

ADSL

5
5
2:
4

5

6

7
8
9

30
30

100%
20
20
100%
100%
[1]
15
15
100%
[2] http://www.elastix.org/index.php/en/ [Jan 1,2015]
15
15
100%
100%
100%
3
5
3
5
0
0
100%
100%
NCCIT2015
,
IP-PBX Asterisk, 2 2551 3-19.
[3] http://www.voip4share.com/windows-f33/
zoiper-softphone-2-sip-iax-t461.html [Jan 16,2015]
[4]
,
PHP5, 2543.
[5] R. Gable, VOIP in a University Call Center, Client

Support Services University of Wyoming, 2006.
[6] P. Limpong, A Development of Information
Management System for Call Center Information
Technology King Mongkuts Institute of Technology
North Bangkok, 2549.
270
NCCIT2015

Applying Multiple Linear Regression
for Forecasting the Inventory on Web Applications
(Kangkit Warayanon)1 (Jongkol Janruang)2
(Wasin Treesinthuros)3

1
kangkit69@gmail.com,2jj@sci.rmuti.ac.th,3dr.wasin@gmail.com
Abstract

VTN enterprise
2557

r= .4 4 8 , r2 = .2 0 1 adjusted r2 = .1 7 5
S.E.est = .820

:

Because storage costs are calculated on a monthly

basis and the total costs of storing an item depend on
how long it will be in the warehouse, the ordering is
associated with storage costs. Therefore, this paper
presents the applying multiple linear regression for
forecasting the inventory on web applications.
The
propose system can be used as a tool to support the plan

of motorcycle ordering. In this paper, the sale data of
VTN Enterprise at Nakhonratchasima province during
January to November 2013 are used as a raw data to
create forecasting model and to develop of web
application for sales forecasting. Experimental results
shown that r= .448, r2=.201 adjusted r2= .175 and
S.E.est= .820. This means that the propose model has
efficient to predict the sales. Moreover, the sales
forecasting model can be used as an algorithm to develop
web application for predicting the number of product
sold. Moreover, the overall satisfaction of general users
in all aspects is at very good.
Keywords: Series Analysis, Applying Multiple
Regression Analysis, Sale Forecasting, Web
Application.
271
1.
NCCIT2015
2.2 (Data Mining)

[4]
(Pattern)
(Rule)
(Knowledge)
(Relation)
(Trend)

CRISP-DM [5]
2.3
Han J, Kamber M [6]

1,2,3

[1]

(Demand Forecasting)

[2]

(DemandForecasting) (Multiple
Regression Analysis)
(Web Application)

VTN Enterprise

Y = + 1x1 + 2x2
(1)
Y =
= Y
=

R2 4
R2 =
( )2
( 2 2 )( 2 2 )
(4)
R2 1.00
R2 0

[7]
MAD,MSE,MAPE
2.

2.1 (Inventory)

[3]
272
2.4
[8]

204,671
199,568 5,103

[9]
(Time Series)

2,805,000
[10]

147,693,666.39 ( 6.89%)
73,846,833.19 /
45-52

[11]

:

51

NCCIT2015
3.
1:
1
CRISP-DM

(Multiple Linear Regression)
2,052
43

VTN Enterprise
273
1:
Wave125i()
b12
Zoomer
Sale
2 10
12
MSE = 0.42
MAD = 0.42
MAPE = 29.17% MSE, MAD, MAPE
[12]
1
branches ,b1-b12
(Y) R .448 R2 .201
385
R Square
.820 2

3
Click
Adjusted R2
S.E.est
.488
.201
.175
.820
Sale
Regression
Residual
Total
Sum of
Squares
df
63.081 12
250.597 373
313.679 385
Forecast
3: 1
3:
Model
1.2
1
0.8
0.6
0.4
0.2
0
1.2
1
0.8
0.6
0.4
0.2
0
2: Model Summary
R
Square
Forecast
2:
* sig < 0.05
Zoomer
b11
Wave125(H)
Wave125i
Zoomer
b10
Wave125(H)
Wave110i()
Wave125
b9
Wave125
Scoopy
0.2
0
Wave110I
b7
0.4
0.2
Wave110I(H)
Pcx
0.6
0.4
Wave110I
b6
0.6
Wave110I(H)
Msx
0.8
PCX
b5
0.8
Scoopy
Ksr
PCX
b4
1.2
1.2
Scoopy
Fino
MSX
b3
MSX
Dream
KSR
b2
4.
Fino
Click
month
(b2) - 0.804 (b3) - 1.008 (b4) - 0.973 (b5) - 1.015 (b6) 0.319 (b7) - 0.778 (b9) - 1.275 (b10) - 1.169 (b11) 0.964 (b12)
KSR
b1
.630
.743
.000
.000
.003
.000
.000
.000
.000
.014
.000
.027
.011
.000
Fino
branches
Week
Dream
sig
Dream
value

Y = 1.641 + .159 (branches) -.777 (b1) - 0.950
Click
variable
NCCIT2015
Mean
Square
820.
Sig
3 VTN
Enterprise 1
11 12
MSE = 0.08
7.824 .000
.672
274
4:

1 2 3 4

Click
(2/4)*100 = 50%

Dream
(4/4)*100 = 100%

Fino
(2/4)*100 = 50%

Ksr
(3/4)*100 = 75%

Msx
(3/4)*100 = 75%

Pcx
(4/4)*100 = 100%

Scoopy
(4/4)*100 = 100%

Wave110
(1/4)*100 = 25%

Wave110(H)
(2/4)*100 = 50%
Wave125
(3/4)*100 = 75%

Wave125(H)
(4/4)*100 = 100%
Zoomer
(4/4)*100 = 100%

MAD = 0.28
MAPE = 0%
1.2
1.2
0.8
0.8
0.6
0.6
0.4
0.4
0.2
0.2
0
Zoomer
Wave125(H)
Wave125
Wave110I
Wave110I(H)
PCX
Scoopy
KSR
MSX
Fino
Click
Dream
Sale
Forecast
4: 2
4 VTN
Enterprise 2
10 12
MSE = 0.17
MAD = 0.17
MAPE = 0%
2.2
2
1.8
1.6
1.4
1.2
1
0.8
0.6
0.4
0.2
0
4 Dream
,Pcx ,Scoopy ,Wave125(H) ,Zoomer

Zoomer
Wave125(H)
Wave125
Wave110I(H)
Wave110I
PCX
Scoopy
MSX
KSR
Fino
Dream
Click
2.2
2
1.8
1.6
1.4
1.2
1
0.8
0.6
0.4
0.2
0
Sale
NCCIT2015
Forecast
5:
5 VTN
Enterprise
5 12
MSE = 0.67
MAD = 0.75
MAPE = 54.17%
6:
6
, ,
, ,

275
5.

VTN
Enterprise .

MSE ,MAD
,MAPE VTN Enterprise

5
4
[1]
[2]
[3]
[4]
1.
2.
3.
4.
5.
. :
. :
; 2554
.
[ ]2555 [ 28 2557].http://www.freightmaxad.com/magazine/?p=2744
.

[
]. :
;2543.
Pang-Ning
Tan,
Kumar.Introduction
4: 5
NCCIT2015
Michael
to
data
Steinbanch,
and
Vipin
mining.Addison-Wesley
Longman Publishing Co., Inc.Boston, MA, USA; 2006.
[5] Pete Chapman, Julian Clinton, et al., CRISP-DM 1.0:Step-
SD
Result
4.64
4.48
0.38
0.28
4.72
0.16
[7]
4.66
0.33
[8]
4.80
0.20
by-step data mining guide. SPSS inc 78; 2000.

[6] Han J, Kamber
M. Data Mining Concept and
Technique.San Francisco : Morgan Kaufmann Publishers

(an imprint of Academic Press); 2000
5.1

43
5 10

[9]
[10]
[11]
[12]
276
. . 8.
: ; 2548.
.
[
]. :
; 2553.
.
[
]. :
; 2550.
.
[
].
: ;
2551.
.

[
]. :
;2552.
. . :
; 2549.
NCCIT2015

The Evaluation of Effectiveness on Mobile Application Banner
(Banyapon Poolsawas)

Banyapon.poo@dpu.ac.th
related to their campaigns via Mobile Advertising

Network accessing to target.
Keywords: Customer Relation Management, Smart
Phone, Mobile Advertising Network, Web
Services, Online Advertising.
1.

6.6
[1]

Google Admob 2

iAd Millennium Media
[2]

Abstract
Presently, the banner advertisements on mobile

applications become the significant marketing channel. It
is questionable which positions of banner advertising will
not interrupt and annoy mobile users, as well as which
positions are able to enhance the click-through rate. This
paper therefore will evaluate the effective position of
click-through rate for banner advertising, and also
analyze the users experiences when they see the banner
on the actual usage. The outcomes suggested that the
most clicked position which did not interrupt the users
was the top position banner advertising. This research is
applicable for marketing analysts in case that they can
design the proper and effective advertising positions
277
NCCIT2015
2.

(View, Impression)

CTR (Click through Rate)

3
(Top) (Bottom)
(Popup)

( Top)
( Bottom)
(Popup)
(Contextual, Middle)

(Mobile Advertising Network)

1
1:

Cost Per Click

2.1 (Advertisers)

(Cost Per Click)
278
2.2 (Network Operator)

2.3 (Content providers)

(Pay Per Click)
2.4 (Ad Provider)

[3,4]

2.5 (Ad Banner)

(Ad Provider)

1:
1

3

3.

2

4

3.1
3
1 15 - 24
57 3 25 - 40
24 3 55
6 3
3
1 15
2
7 3

2
3.2

3 Android
4.3 Samsung Galaxy S3
5S
iOS 8.1

, ,
(.JPG, .PNG, .GIF)

150 KB

(pixel)
NCCIT2015
320 x 50 px Leaderboard
480 x 32 px Landscape
320 x 480 px interstitial (portrait)
Popups Advertising
(Top)
(Bottom)
(Popup)
279
KamNuan

NCCIT2015
Google Analytics for Mobile

Event Tracking

3.3
2

(CTR) 1 1-6 2
7-15
3

2

4.50 - 5.00
3.50 - 4.49
2.50 - 3.49
1.50 - 2.49
1.00 - 1.49
KamNuan 1

2
7
(View)
(Click) CTR
(x ) 2
4
2:
(Bottom)
2 2

320x50 px (Bottom)
(Tab Bar)

Drink n Drunk

(Top)
(Popup) 3
3:
(Top) (Popup)
280
NCCIT2015

CTR
CTR
CTR
CTR
3.85 3 .4 1
6
4: 2 CTR
(Top)
(Popup) 2

(Bottom)
(CTR) 36.97
Drink n Drunk 1

2

KamNuan
(x ) 2
5
6: CTR

CTR

2

3
2: (Top)

(Top)

3.73
4.20
4.47
3: (Popup)

5: 2 CTR
(Popup)
CTR
2
1
281

2.73
3.73
4.40
NCCIT2015
4.
2 3

(Top)
(Popup)

7

CTR (Click
through Rate) 3.85

7:

(Top)
44%

(Popup)
CTR

(Popup) [5]
8
[1]
()
. 2557. Thailand Internet
User Profile 2014 Report. (). :
http://www.slideshare.net/wiseknow/2557-38352560.
26 2558.
[2]
MMA Global.com [homepage]. Mobile Advertising

Guidelines. Retrieved February 2015. Available from:
http://www.mmaglobal.com/files/mobileadvertising.pdf
[3]
V. Toubiana, A. Narayanan, D. Boneh, H. Nissenbaum

and S. Barocas. "Adnostic: Privacy Preserving Targeted
Advertising." In: NDSS. 2010.
[4]
MC. Grace, W. Zhou, X. Jiang and A. Sadeghi. "Unsafe

exposure analysis of mobile inapp advertisements". In:
Proceedings of the fifth ACM conference on Security and
Privacy in Wireless and Mobile Networks. ACM. 2012,
pp. 101112.
[5] Steve Smith [homepage on Internet]. Up To 40% Of

Mobile Ad Clicks May Be Accidents Or Fraud?. Retrieved
February 2015. Available from:
http://www.mediapost.com/publications/article/182029/up
8: Popup 16 %
-to-40-of-mobile-ad-clicks-may-be-accidents-or.html.
282
NCCIT2015

A Decision Support System Applying with Ant System Algorithm for Finding
Optimal Path Case Study : Roads in Pattani Province
(Taweep Janjaroen)1 (Onjira Sitthisak)2
(Anisara Pensuk Tibkaew)3

1
taweep.janjaroen@hotmail.com, 2onjira.sitthisak@gmail.com, 3anisara.pensuk@qmail.com
before they get on the road. Therefore, this research aims

to develop a decision support system for finding optimal

Ant System Algorithm ( )

path case study : roads in Pattani province. This

research, we applied the ant system algorithm for finding
optimal path. The results from this system will
recommend the most appropriate path based on user
conditions such as the shortest path, the safest path and
the unwanted path. Then, the system sorts all these paths
according to the conditions and shows to users for
planning a trip within Pattani province.
Keywords: Ant System Algorithm, Finding Optimal
Path, Decision Support System.
1.
Abstract
The insurgency in Pattani province are increasing
every day. People travel in and out of Pattani with less
comfort and safety. So, travelling plan is important. Most
people lack information of location and the violence
occurred. As a result planning accurately is quite difficult
283
NCCIT2015

Ant System Algorithm
()

Google Map

)
(Probability) [1], [2], [4]

(Random Proportional Rule)

k i j 1
2. Ant System
Algorithm
(1)
2.1

(N) (F) 1
(Weight)
(Pheromone : ) [1], [2],
[4] (Heuristic Information :
i
)
k

()
() = 0
> 1
= 0

1

(Roulette Wheel
Selection Rule)

1
1:

(Pheromone) [1], [2], [3], [4]

2.2
2
2.2.1

(
284
NCCIT2015
2.3 Ant System Algorithm

4

2

2.3.1
[5]

(

2.3.2
k

k i j

2.2.2

[1],
[2], [4]

2
(2)

() 0 < < 1

(Update Pheromone)
[1], [2], [4]
3
(3)
k

k 4
(4)
k

k

0 4
3.
285
NCCIT2015
3.3

3

4
3.1

[6]

Google Map API
3.2

(Requirements)

(Unified Modeling Language :
UML) 2
3:
3.4
PHP MySQL
4
Database
2 Attribute Data
Spatial Data

User Request Application
,
2:
286
NCCIT2015
2
5

Ant System Algorithm

( )
(DSS)

User Google Map API
Admin

Application Google
Map API
5:
4:
4.

4.1 (User)

4.1.1 User

6:
287
NCCIT2015
6.
1
Google Map 7

.. 2558

[1] E. Bonabeau, M. Dorigo and G. Theraulax,

SwarmIntelligence From Natural to Artificial Intelligence,
Oxford University Press: New York, 1999.
[2] M.Dorigo and T.Stutzle, Ant Colony Optimization,A
Bradford Book, MIT Press, Cambridge, MA, USA, 2004.
[3] , "

" ., 17,
5, 706-714, 2012.
[4] ,
The
National Conference on Computing and Information Technology,
, , 3-5, 2553.
[5] ,

: International Computer Science and
Engineering Conference (ICSEC), 31 2557,
, 2557, 61-66.
[6] ,
12 2557, http://wbns.oas. psu.ac.Th/.
7:
5.
5.1
5.1.1

5.1.2

5.1.3

5.2

288
NCCIT2015

Using Semantic Approach for Developing Learning Object Knowledge Base
(Konjanat Jantawong)1 (Noppamas Pukkhem)2

1
k.konjanat@hotmail.com, 2noppamas@tsu.ac.th
efficiency and could be applied for developing Learning

Management System in further educational research.

ACM Computer Science
Curricula

SPARQL Query

Learning
Management System

:
Keywords: Learning Object, Ontology, Metadata,

Semantic-Web.
1.

(e-Learning)

(Learning Management System : LMS)

LMS (Learning
Object : LO)

(Reusable)

LMS

Abstract
This work is focused on developing Learning Object
knowledge base by using a semantic approach. In
computer science domain with ACM Computer Science
Curricular, this proposed work was aimed at facilitating
reusability, interoperability of Learning Object and also
provide support for teaching planning in different
courses. The system architecture consists of semantic
mapping process, the knowledge base creation process
and the knowledge base evaluation process. The
inferenced results, using SPARQL query language, of this
study shows the consistent with our learning object
knowledge base. Therefore this knowledge base displays
289
2.2

LOM
SPARQL
2.
NCCIT2015

[4], [11]

XML RDF
OWL
2.1
W3C
(Learning Object)

[1]
2.1.2 (Metadata)

1995
(Dublin Core : DC) [2]
15

( Learning Object Metadata : LOM) [3]
XML
LOM 9 1.
(General) 2. (Lifecycle) 3.
(Meta-metadata) 4. (Technical)
5. (Educational) 6.
(Rights) 7. (Relation) 8.
(Annotation) 9. (Classification)
2.1.1

[5] (Class)
(Relation)
(Properties)
2.3

I-Ching Hsu [6]
LOFinder
Agent

3
LOM-based, Ontology-based Rule-based
Liu [7]

SWRL

Andr [8]

(Ontology for Organizational Learning
Objects : OOLO) LOM
290
(Competency Question)
SPARQL
3.1

Computer Science
Learning Object-Knowledge based
(CSOntology) ACM Computer
Science Curricula 2013 [7] (CSLOM)
(CSLearning
Object)
(Mapping Process)
RDF
SPARQL 1
Rights
Lifecycle
Technical
2. CSOntology
Mapping Process3.
4. Result Mapping
4. SPARQL Result
SPARQL query
3. RDF Result
hasChapter
hasTopic
Knowledge
Areas
Chapter
General
1: CSontology
1. Query
2. Query Process
Topic
have
consistBy
2
(Course)
(taughtBy)
(Instructor)

Domain Range
1
CSLOM CSOntology
1. CSLOM Instance
Course
Curriculum
2: CSontology
Knowledge based
Knowledge base Validation
Instructor
taughtBy
hasLOM
Learning_Object_
hasLO
Metadata
Educational
ACM Computer Science Curriculum
CS
Learning
Object
Learning
_Object
use
3.
NCCIT2015
RDF
Repository
Knowledge Construction Process
1: CSLO-Knowledge based
1 2

3.1.1 (Knowledge base
Construction Process) 3
3.1.1.1 CSOntology

2

Domain
ObjectProperty
taughtBy
Course
consistBy
Curriculum
Chapter
Topic
Instructor
hasChapter
have
hasTopic
hasLO
use
Learning_Object
hasLOM
Range
Instructor
Knowledge
Areas
Chapter
Course
Topic
Learning_Object
Learning_Object
Learning_Object
_Metadata

(Programming Languages : PL) ACM

3

291
CSOntology 3
1 Mapping Process
CSLOM
CSOntology XMLSchema OWL
Introduotion to Computer
CSL-08
CSL-05
CSL-04
CSL-03
CSL-07
CSL-05
CSL-06
Introduction to Computer
Programming
CSL-05|CSL-04|CSL-03
Java Programming
CSL-13
CSL-06
CSL-12
CSL-11
CSL-10
CSL-07
CSL-03|CSL-07
CSL-08
Object Oriented
Programming
CSL-12
CSL-07
CSL-13
CSL-10
CSL-03
CSL-06
CSL-08
2: XSD OWL
CSL-11
Partially Used
XSD
Fully Used
CSL-00
NCCIT2015
Learning Object
element@name,
complexType
(root)
simpleType|
element@type
3:
3.1.1.2
element@name,
complexType
CSLOM LOM
5 1.
2. 3. 4.
5.

(groupType) Extend Metadata

element@ref
Type
owl:class,
owl:Object
Property
owl:class,
owl:Dataty
peProperty
owl:class,
owl:Object
Property
owl:class,
owl:Dataty
peProperty
OWL
Domain
Class
name
Range
Child
name
Attribute
name
Datatype
Class
name
Child
name
Attribute
name
Datatype
2 XSD
element@ref

<xs:element
name="value"
type="levelType"/>
levelType
Value levelType
levelType OWL
Type
(DatatypeProperty) (Domain)
(Range)
2
<DatatypeProperty
rdf:about="http://www.semanticweb.org/ontolog
ies/LOM#exLevel">
<rdfs:domain
rdf:resource="http://www.semanticweb.org/ontol
ogies/LOM#Educational"/>
<rdfs:range rdf:resource="&rdfs;Literal"/>
4: XML
5: CSOntology
3.1.1.3 Mapping Process
LOM XML
292

SPARQL
Query RDF

4
1. 2.
3. 4.
(Competency Question)

CSL-03
Logic

Control Structure The IF
Statement 7
2 Mapping Process
XML Data
OWL
XSD OWL [10]
XML OWL
Learning
Object
LOM
Learning Object
Metadata
General
Title
Keyword
history of
computing
computer
General
Keyword
Title
2
6: OWL
6 1 XML
2 OWL
1 2
Class ObjectProperty
DatatypeProperty 1
2
3 Mapping Process
RDF Construct RDF File
RDF RDFRepository
3.1 .2 (Knowledge base
Validating)
CSLO-Knowledge based
SPARQL Query

4.
NCCIT2015
Java
Programming
Introductopn to
ComputerProgram
Introdcution to
Computer
hasChapter
hasChapter
Object Oriented
Programming
hasChapter
Elements of
Programming
Statements
hasChapter
hasTopic
hasTopic
Selection
Statements
Abstraction
hasTopic
Control
Structures
Logic
Condition
and Loops
hasLO
hasLO
hasTopic
The if
Statement
hasLO
hasLO
CSL-03
hasLOM
hasLOM
hasLOM
Rights
Copyright
General
...
Technical
Title
Format
Yes
Location
Logic
Language
th
text
http://sci/tsu.ac.th/logic.pdf
7:
7 CSL-03

20

SPARQL Query
293
NCCIT2015
1. CSL-05
SPARQLQuery :SELECT ?chName ?ID ?cName ?topicName
WHERE {?subject LO:LOID ?ID .
FILTER (?ID ="CSL-05" ).
?tName LO:hasLO ?subject .
?TopName LO:hasTopic ?tName.
?tName LO:topicName ?topicName.
?chater LO:hasChapter ?TopName.
?TopName LO:chapterName ?chName .
6.
?chater LO:courseName ?cName .}

[1]
D.A. Wiley, Connecting learning objects to instructional

design theory:A definition, a metaphor, and a taxonomy,
The Instructional Use of Learning Objects, 2000.
2. JAVA Programming DataType
[2]
National Information Standards

Organization,Understanding Metadata, 2001.
[3]
SPARQLQuery :SELECT ?cName ?LOID ?TopName ?reNCourse

?reNTop
WHERE {?subject rdf:type LO:Course .
?subject LO:courseName ?cName.
FILTER (?cName = "Java Programming" ).
?subject LO:hasChapter ?chater.
?chater LO:chapterName ?chName.
?chater LO:hasTopic ?tName.
?tName LO:topicName ?TopName.
FILTER (?TopName = "Data Types").
?tName LO:hasLO ?LO.
?LO LO:LOID ?LOID.
?reLO LO:hasLO ?LO .
?reTOP LO:hasTopic ?reLO .
?reLO LO:topicName ?reNTop.
?reChap LO:hasChapter ?reTOP .
?reChap LO:courseName ? reNCourse.}
Learning Technology Standards Committee of the IEEE,

Draft Standard for Learning Object Metadata, 2002.
[4]
I.C. Hsu, Extensible access control markup language

integrated with Semantic Web technologies, Information
Sciences, Volume 238 p.33-51, 2013.
[5]
G. Antoniou and F. Harmelen, A Semantic Web Primer

The MIT Press Cambridge, Massachusetts London,
England, 2008.
[6]
I.C.Hsu, Intelligent Discovery for Learning Objects

Using Semantic, Educational Technology & Society,
p.298312, 2012.
[7]
C.-H. Liu et al., Ontology-Based Context Representation

and Reasoning Using OWL and SWRL, 8th Annual
Communication Networks and Services Research
Conference (CNSR), p.215-220, 2010.
[8]
A.L.A. Menolli et al., Ontology for Organizational

Learning Objects based on LOM Standard Informatica
5.
(CLEI), 2012 XXXVIII Conferencia Latinoamericana En,
p.1-10, 2012.
[9]
Computer Science Curricula 2013 ,Curriculum

Guidelines for Undergraduate Degree Programs in
Computer Science, 2013.
[10] Y.K. Lee et al., S-Trans: Semantic transformation of

XML healthcare data into OWL ontology KnowledgeBased Systems, p.349356, 2012.
[11] ,
Semantic Web
,
, 2553.
294
NCCIT2015
Guideline for the Application of Database Performance Tuning Method:

A Case Study of Banking Customer Information System
(Tulanun Jiangpradit)1 (Nakornthip Prommol)2

1
tulanun.j@student.chula.ac.th, 2nakornthip.s@chula.ac.th
data base in many steps of processing. Database resource

utilization and system throughput should be considered as

2

94%
69%

:

one of major factors. Thus, it is an organization challenge

to find an optimize way to cope with this issue.
The paper presents a database performance tuning
guidelines for Oracle database in terms of elapsed time
and CPU time for task operation. The experiment was
divided into two parts. The first part involved a tuning on
an operation for data import by SQL Loader to Oracle
database by adjusting parameter direct. The second was a
tuning on the processing of SQL statement using
re-execution plan. Banking customer information system
was used in these processes.
The result showed that The SQL Loader tuning
improved elapsed time and CPU time by 94% and 69%
respectively and The SQL statement tuning slightly
improved a little elapsed time in milliseconds unit.
Keywords: Database Performance Tuning, Oracle Database,
SQL Loader, SQL Statement, Execution Plan.
1.
Abstract
Utilizing the stored data to produce reports for

organization needs may have intensively access to the
295
NCCIT2015
(Application)

(Response Time)

(Throughput)
2.2 [2]

[4]

/ (I/O) [3]

Automatic
Workload Repository
Automatic Database
Diagnostic Monitor

5 [4,11] 1)
CostBase Optimizer
7 [7] 2) (SQL Profiles)

[8,9] 3)
4)
5)
2.3

2
(DB Time)
[10]

[3]

2.
2.1
[1]

(Database Tuning)
296
(CPU Utilization)
(CPU Wait)
(DB Buffer Cache)
/
2.4 SQL Loader

(Text File)
(sqlldr command)
2 [5]
(Conventional Path Load)

(Direct Path Load)
(API) [6]

/
(Multiple Block per I/O)
2.5 PL/SQL
PL/SQL Procedural Language/Structure Query
Language
SQL

SQL
PL/SQL 3
Declaration Block, Program Block Exception
Handling Block
NCCIT2015
Fundamentals of
Database Systems by
Elmasi & Navath
1.
2.
Oracle Database
Performance Tuning
Guide [Online]
[ ]
1:

5 2
2 (Elapsed Time)
(CPU Time)
1
Oracle Database
Utilities 11g
Guide Book
3.
(Conventional Path)
(Direct Path)
22

3
1)
2) 3)

(Report)
5 1
[ ]
4
4
(CPU Time)
[ ]
5
5
2:
297

6
3 4

4.
(Top SQL Statement)
(Statistics Analysis)
(SQL Profile)
Elapsed Time
CPU used by session
Physical Reads
Session Logical Read
(Index)

(Restructure SQL)
[ ]

(Alternative Plan Analysis)
[ ]
3:

1:

( )
NCCIT2015

2

1)

3

1, 2 3
3 2
78%
10 % 2
(buffer) 3

94%, 69%

( )
18,461,200
8.6
152
1,992
18,616,387
6.1
178
2,923
24,212,757
19
391
4,370
2: 1-3

:
:
:
:
:

1
bindsize readsize

* ( 1)

1
DIRECT=FALSE,BINDSIZE=256,000
BINDSIZE,READSIZE = 52,904,874,045
bytes READSIZE=1,048,576 bytes [12]
bytes

298

1
DIRECT=TRUE
* 80%
NCCIT2015
3 : 1-3
1

1 2
1 3

()

()

()

()

()

()

(+/-) %

(+/-) %

(+/-) %

(+/-) %
66
20
31
29
10
-53.03
45.00
-84.85
-65.00
920
79
165
81
39
24
-82.07
2.53
-95.76
-69.62
66
23
29
25
-56.06
8.70
-87.88
-73.91
1052
122
225
135
57
37
-78.61
10.66
-94.58
-69.67
2)

/ (PL/SQL) Procedure
Procedure
(Select)

4, 5 6
1
1. Procedure
5 ( 5)
2. 5 Cost
:
3. 5
4. Cost
:
1.
2.
3.
:
4.
6:

4:
Procedure
403,506
()
4,320
Insert, Select
21,165,876
4,400
Insert, Select
1,327,998
21,280
SQL 56
Update, Select
SQL 8
SQL 27
SQL 7
Insert, Select
8,206,396
12,020
SQL 19
Insert, Select
5,745,613
10,510
52,530
SQL
56
5:

1
(Re Execution Plan)

Quest SQL Optimizer for Oracle
:
SQL 8
SQL
27
SQL 7
SQL
19
299
( )
( )
Original
4,068,630
4,320
21
83,483
1,635,705
Plan 1
4,035,820
41
31
78,633
2,123,090
Original
402,911
44,000
550 2,958,056 18,705,800
Plan 1
13,974
12,000
782 2,446,981 20,878,176
Original
402,832
21,280
97 1,472,338
1,686,537
Plan 1
13,973
4,250
80 1,472,802
1,578,636
Original
402,632
12,020
209 1,518,356
6,982,675
Plan 1
13,973
5,370
297 1,472,844
6,994,235
Original
295,365
10,510
518
791,558
1,236,443
Plan 1
17,751
1,400
357
536,243
1,157,404
NCCIT2015

Solid State Drive (SSD)

6.
[1] Ramez Elmasri., and Shamkant B. Navathe. Fundamentals

of Database System. 6th ed. Pearson Education: AddisonWesley Publishers, 2011.
[2] Oracle Database 2 Day + Performance Tuning Guide
11g Release 1 (11.1). [Online]. Available:
http://docs.oracle.com/cd/B28359_01/server.111/b28275.p
df 2008. [2014, Oct 22]
[3] Fu Duan, Yongjie Han, Qiuyong Zhao, and Keming Xie.
Towards self-tuning of dynamic resources for workloads.
ICST (Institute for Computer Sciences, Social-Informatics
and Telecommunications Engineering), ICST, Brussels,
Belgium, Belgium, , Article 43 , 4 pages. 2008.
[4] Oracle Database Concept 11g Release 2 (11.2).
[Online]. Available: http://docs.oracle.com/cd/E28271_01/
server.1111/e25789.pdf 2011. [2014,Aug 22]
[5] Oracle Database Utilities 11g Release 1 (11.1).
[Online]. Available: http://docs.oracle.com/cd/B28359_01/
server.111/b28319.pdf 2007. [2014,Sep 11]
[6] Oracle Call Interface Programmers Guide 11g Release
2 (11.2). [Online] Available: http://docs.oracle.com/cd/
E18283_01/appdev.112/e10646.pdf 2010. [2014,Aug 30]
[7] twp-general-cbo-migration-10gr2-040-129948 [Online]
Available: http://www.oracle.com/technetwork/
middleware/bi-foundation/twp-general-cbo-migration10gr2-040-129948.pdf [2014,Oct 15]
[8] SQL Profiles: Technical Overview. [Online]. Available:
http://www.oracle.com/technetwork/database/manageabilit
y/sql-profiles-technical-overview-128535.pdf 2010.
[2014,Oct 15]
[9] Sam R. Alapati, Darl Kuhn, and Bill Padfield. Oracle
Database 11g Performance Tuning Recipes: A ProblemSolution Approach. New York. Apress Publishers, 2011
[10] Dias,Karl Ramacher,Mark Shaft,Uri Venkataramani,
Venkateshwaran AWood, Graham, Automatic
Performance Diagnosis and Tuning in Oracle Conference
on Innovative Data Systems Research
[11] Belknap, P.; Dageville, B.; Dias, K.; Yagoub, K., SelfTuning for SQL Performance in Oracle Database 11g
Data Engineering, 2009. ICDE '09. IEEE 25th
International Conference on , vol., no., pp.1694,1700,
March 29 2009-April 2 2009
[12] SQL *Loader Command-Line Refernce. [Online].
Available: http://docs.oracle.com/cd/B28359_01/
server.111/b28319/ldr_params.htm#g1014550 [2014,July
23]
[13] SQL *Loader Control File Refernce. [Online]. Available:
http://docs.oracle.com/cd/B28359_01/server.111/b28319/ld
r_control_file.htm#i1006645 [2014,July 23]
5.

94%
69%

/

/

300
NCCIT2015
(TGT)
3

A Development of Technical Cooperation Learning Team Games
Tournament Activities (TGT) in the Course of the Information Systems
Analysis and Design for Third Year Students of Computer and
Information Technology Nakorn Pathom Rajaphat University
(Charinthorn Aumgri)

aor030@hotmail.com.com

3

:

1)

3

70/70 2)

3)

2/2556 151

1)

84.33/81.20 2)

.05 3)

4.48 0.57

Abstract
This research was an experimental research. The
purposes of this study were 1) to determine the efficiency
of the development of
technical cooperation learning
team games tournament activities (TGT) on the basis

70/70 2)to study the students achievement after learning
with the developed technical cooperation learning team
games
tournament activities (TGT)
3) to study
satisfaction of the developed technical cooperation

learning team games tournament activities (TGT) and
The sample, selected by Purposive sampling, were 151
students who studied for a third year student of computer
and information technology in Nakorn Pathom Rajaphat
University. The research tools consisted of technical
cooperation learning team games tournament activities
(TGT), pretest posttest and satisfaction .
The results showed that 1) the efficiency of technical
cooperation learning team games tournament activities
(TGT) was
301
81.20/84.33 2) the evaluation of the
NCCIT2015
1.2.2
(TGT)
1.2.3
(TGT)
1.3
1.3.1
70/70
1.3.2

0.05
satisfaction is a good level and the standard deviation is

4.48, and the average 0.57,2) 3) the academic
achievement of students learned from the developed
technical cooperation learning team games tournament
activities (TGT) was higher than the pretest with the
statistical significant of .05. Then we can use this
technical cooperation learning team games tournament
activities (TGT) on computer to the target group.
Keywords: Collaborative Learning, Teams Games
Toumaments, Concepts of Teaching the Game.
1.
1.1
2.

2557 2557

1)

2.1

[1]

[2]

4

[3]

151
3
1
1: TGT
1.2
1.2.1
(TGT)
3
302
NCCIT2015
[8]

2.2 (Teams Games

Toumaments : TGT)

[4]

2.3

[5]

3 2
[6]
1)
4.32 0.64 2)
3 85.66/65.21 3)

3 .01
3

2 [7]

3.
3.1
3.1.1

3

2:
3.1.2
(TGT)
3
(TGT) TGT Team Games
Tournament
3: TGT
3.1.3

303
NCCIT2015
ADDIE
Model [9]
5:
3.3.1.3 (Development)
TGT
1)
Facebook
54/34, 54/35, 54/36, 54/37 6
4: ADDIE Model
3.2
3

2/2556
151
3.3
3.3.1 TGT
3.3.1.1

(TGT)
3.3.1.2 (Design)
1)

1 5

4
6:
2)
1 7
7 1
3)
2 8
4:
2)
(TGT) 5
8: 2
4)
3 9
304
NCCIT2015
4.
4.1 TGT

3
9: 3
6)
4 10
10: 4
7)
5 11
13:
4.2
TGT
1:
11: 5
3.4.1.4 (Implementation)
TGT
2/2556 151
3.4.1.5 (Evaluation)

- (One Group PretestPosttest Design)
3.3.2
3 11
* .01 , df = 29
1 t
t
TGT
.05

28.17
63.90
TGT

3
4.3
TGT
11: TGT
305
NCCIT2015
2: TGT
5.2
5.2.1
(TGT)
3

TGT

5.2.2
5.2.3

5.2.4

2 4.48
0.57
4.4
TGT

5
5: (TGT)
6.
(E1)
84.33
(E2)
81.20
[1] ,
, 2550 : 121.
[2] Slavin, 1987, 7:13
[3] , 2544 : 192.
[4] , 2545 : 177 195
[5] , . 18 .69 . - . 2533
[6] .
3 2
..
10 (NCCIT
3 TGT
(E1/E2) 84.33/81.20
5.
5.1
1)
TGT
.01 2)
TGT

3
4.48 0.57
TGT
3

[7]
[8]
[9]
306
2011). 8 9 2557:
.
.
. . 2552 : 161
.ADDIE Model. 17
2553 http://student.nu.ac.th/comed/webboard/answer.asp?
questID=6
NCCIT2015

Automatic Semantic Annotation for the Official Minute
(Bukhoree Sahoh)1 (Siraya Sitthisarn)2

1
bukhorees@gmail.com, 2ssitthisarn@gmail.com
techniques in Named Entity Recognition component. The

approach will add meta-data to official minute contents

Text File

Meta-data
RDF

Pattern Recognition Ontology Entity
Mapping
Precision 94.92%
: RDF

and transform these into RDF format. Finally, the result

of effectiveness evaluation shows that our approach
reaches the Precision at 94.92%
Keywords: Ontology, RDF, Semantic Web Technology,
Semantic Annotation.
1.

Text
File (Unstructured Document)

( Semantic Web
Technology) [1]
Meta-data

Abstract
Nowadays official minutes are represented in
unstructured text files which are difficult for automatic
knowledge management. This is because computer
systems cannot understand the contents of official
minutes. Semantic web technology aims to give welldefined meaning to information which enables to address
the problems. This paper proposes an automatic semantic
annotation approach based on semantic web and natural
language processing technologies. Moreover, we apply
the Pattern Recognition and Ontology Entity Mapping
307
(Semantic Annotation) [2]

(Manual Semantic Annotation)

(Ontology) RDF (RDF Statement)

RDF
(Natural Language Processing)

(Ontology
Entity Mapping)
( Pattern Recognition)

NCCIT2015
Subject Object) Object (
Subject) RDF Statement
(Nodes) (Edge)
2 Resource Literal Literal
Resource
URI Resource Subject
Object Statement
Predicate
2.2

Meta-data Metadata

Text File

Djioua Descls [4]

( Contextual

Exploration)
Meta-data XML Smine
[5]

( Learning Object) Djioua
Descls Meta-data
XML
Jellouli Mohajir [6]

Jellouli Mohajir

Meta-data RDF Albukhitan
Tarek [7]
2.
2.1 RDF
RDF (Resource Description Framework) [3]
XML
RDF
Meta-data
RDF
Statement 3 Subject
(
) Predicate (
308
(Statements)
(4) RDF (RDF Statement
Generation) RDF

3.2

(1)
[8] (2)

Competency Question

Jellouli Mohajir

RDF
Pre-Defined
Patterns
Patterns
A Document
Tokens
Tokenization
Named Entity
Recognition
Entities
Office Minute
Document
Set of
Named Entities
Office Minute
Ontology
Set of RDF
Statements
RDF Statement
Generation
Structure
Statements
NCCIT2015
[9]
Statement
Extraction
Noy
McGuiness [9]
(Classes)
(Properties) (Constrains)
(Instances)
Protg [10]
2
RDF Repository
1:
3.
3.1

1

[4], [5], [6], [7]

DOC DOCX
(1) ( Tokenization)
(Tokens)
(2) (Named
Entity Recognition)

(Named Entities) (3)

(Statement Extraction)

name
startTime
Department
Official
MinutesOf
title
firstName
place
Official
Minutes
endTime
hasExaminer
lastName
hasParticipation,
hasNonParticipation
title
hasAgenda
lastName
Examiner
title
name
Participation
degree
no
writtenBy
Secretary
firstName
date name
degree
no
subClassOf
Agenda
firstName
lastName
subClassOf
Assistant
Professor
content
hasTopic
name
comment
Lecturer
Topic
comment
no
content
comment
hasSubTopic
lecturer
content
no
SubTopic
Domain
Range
Subclass
Superclass
Domain
DataProperty
2:
2 8
OfficialMinutes

Agenda Object Property
309
NCCIT2015
2
1) ( Pattern
Recognition) 2)
(Ontology Entity Mapping)
Topic
Agenda Object
Property hasTopic OfficialMinutes
Participation Object Property
hasParticipation
hasNonParticipation

SPARQL Query
Competency Question

Competency Question

hasAgenda
1)

=: [( ) ()
()( )()] ;
=: [( )|( )|
( )|( )] ;
||
.| | | |

.

2)

Object
Property hasParticipation

OfficialMinutes Participation

(Index) Lucene [12] Label
Comment

3.3
3.3.1 (Tokenization)

LongLexTo [11]
(NECTEC)

LongLexTo

LongLexTo
07/2556 .
|| |
|07|/|2556| | | ||.| | | |

3.3.2

310
Keyword

3.3.3

Domain Object/Data Property Range
2
1
Ontology Model Jena

1 2
RDF Statements 3
<rdf:RDF
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:om="http://localhost/om#">
<om:OfficialMinutes rdf:about="http://localhost/om#07_2556.doc">
<om:no>07/2556</om:no>
<om:date>31 2556</om:date>
<om:hasParticipation>
< om:Lecturer rdf:about="http://localhost/om#Siraya">
<om:degree>.</om:degree>
<om:lastName> </om:lastName>
<om:firstName> </om:firstName>
</om:Lecturer>
</om:hasParticipation>
</om:OfficialMinutes>
</rdf:RDF>
1:
Domain
OfficialMinutes
OfficialMinutes
OfficialMinutes
Participation
Participation
Object/Data Property
hasParticipation
no
date
firstName
lastName
3: RDF
Range
Participation
Literal
Literal
Literal
Literal
4.

(Precision) (Recall) Precision =
TP
TP
Recall = TP+FN
TP
TP+FP
FP
FN

[8] 87
1991

Precision Recall

07/2556

2
2:
Domain
Object/Data Property
Range
Participation
firstName
Participation
lastName
OfficialMinutes
OfficialMinutes
no
date
07/2556
OfficialMinutes
hasParticipation
Participation
07/2556
NCCIT2015
31 2556

2 Statements
RDF
3.3.4 RDF
RDF
RDF Jena API [13]

RDF
OWL
311
3: Data Property
Classes
OfficialMinutes
Agenda
Topic
Participation
Examiner
Secretary
Sets of Named entities

no
name
date
no, name, content
no, name, content
position
degree
firstName, lastName
position
degree
firstName, lastName
title, firstName, lastName
Precision
100.00%
100.00%
100.00%
98.36%
95.96%
100.00%
100.00%
100.00%
86.66%
71.42%
86.66%
100.00%
NCCIT2015
Recall
93.75%
93.75%
93.75%
95.23%
85.38%
99.12%
98.27%
99.18%
86.66%
71.42%
86.66%
93.75%

[1]
J. Hendler, T.Berners-Lee and E. Miller, Integrating

Applications on the Semantic Web Journal of the
Institute of Electrical Engineers of Japan, Vol 122, No.
4: Object Property
Classes (Domain/Range)
OfficialMinutes/Agenda
OfficialMinutes/
Participation
Agenda/Topic
OfficialMinutes/Examiner
OfficialMinutes/Secretary
Sets of Relation
hasAgenda
hasParticipation
hasNonParticipation
hasTopic
hasExaminer
writtenBy
Precision
98.36%
100.00%
100.00%
95.68%
86.66%
100.00%
10, pp. 676-680, 2002.

[2]
Recall
95.23%
100.00%
95.54%
85.38%
86.66%
93.75%
V. Urena, P. Cimianob, J. Iriac, S. Handschuhd, M.

Vargas-Veraa, E. Mottaa and F. Ciravegnac, "Semantic
annotation for knowledge management: Requirements and
a survey of the state of the art" Web Semantics: science,
services and agents on the World Wide Web, Vol. 4, No.
1, pp. 1428, 2006.
3
Data Property

degree Examiner 3
Precision Recall

4
Object Property

3
[3]
F. Manola, E. Miller and B. McBride RDF 1.1 Primer.

W3C recommendation, Retrieved November 20, 2013,
from http://www.w3.org/TR/rdf11-primer/
[4]
B. Djioua and J.P. Descls
Indexing Documents by
Discourse and Semantic Contents from Automatic

Annotations of Texts On FLAIRS Conference, pp. 356361. 2007.
[5]
B. Smine, R. Faiz and J. Descles Extracting relevant

learning objects using a semantic annotation method
IEEE CONFERENCE PUBLICATIONS. On Education
and e-Learning Innovations (ICEELI) International
Conference, pp. 1-6. 2012.
[6]
I. Jellouli I and M.E. Mohajir toward automatic semantic

annotation of data rich web page . IEEE CONFERENCE
5.
PUBLICATIONS. On Research Challenges in Information

Pattern
Recognition Ontology Entity Mapping

Precision Recall

Science Third International Conference. pp. 139-142.

2009.
[7]
S. Albukhitan and H. Tarek Automatic Ontology-based

Annotation of Food, Nutrition and Health Arabic Web
Content On The 4th International Conference on
Ambient Systems, Networks and Technologies (ANT
2013), pp. 461-469. 2013.
[8]
[9]
N. F. Noy, McGuinnes, and L. Deborah Ontology
.. 2526, : .. 6-8.
development 101: A guide to creating your first ontology
312
Stanford Medical Informatics Technical Report SMI2001-0880 , pp. 1-25. 2001.

[10] Stanford University. Protg, Retrieved November 20,
2013, from http://protege.stanford.edu/
[11] C. Haruechaiyasak. Longlexto: Tokenizing Thai texts
using longest matching approach 2006.
[12] The Apache Software Foundation. Lucene, Retrieved
November 20, 2013, from http://lucene.apache.org/
[13] P. Mccarthy Introduction to Jena: Use RDF Models in
Your Java Applications with the Jena Semantic Web
Framework, Retrieved November 20, 2013, from
http://www.ibm.com/developerworks/xml/library/j-jena/
313
NCCIT2015
NCCIT2015

:
A Study of Usage Behavior of Knowledge Retrieval Function of a Large Scale
Knowledge Management System on WWW: A Case Study of pantip.com
(Nittaya Kamban)1 (Worasit Choochaiwattana) 2
1
2

1
nittaya1901@gmail.com, 2worasit.cha@dpu.ac.th
research study was a group of users of Pantip.com.

Random selection was applied. The sample size is 352

352

1)
2) 3)

:
people. Questionnaire was used as a research tool. In

addition, descriptive statistics such as mean, standard
deviation, and frequencies, as well as hypothesis testing
such as Chi-Square Test, T-Test, and One-Way ANOVA,
were applied. The result of this research project showed
that when users use a knowledge retrieval function of
knowledge management system, they would like the
function to display retrieval results ordered by relevance
and chronology. In addition, they would like to have a
control on specifying number of search results per page.
Excluding some keywords in the result list is another
preference feature that they would like to have. These
results could be applied when designing a knowledge
retrieval function of knowledge retrieval system in the
future.
Keywords: Knowledge Retrieval, Knowledge
Management System.
1.
Abstract
This paper aims at studying attitude and usage
behavior of knowledge retrieval function of a large scale

knowledge management system, case study of Pantip
website, and also aims at studying relationships between
attitude and usage behavior of knowledge retrieval. The
goal for this research project is to obtain preliminary
results, which can be used as a guideline for designing
knowledge retrieval system. The population for this
314
NCCIT2015

2.2
[1]
N-Gram

N-Gram

Precision
Recall

[2]

[4]

sessiam.com 4
-
-
[5]

(Information Retrieval)
Microsoft Microsoft SQL Server Version 2008
R2 ICU
IBM Algorithm C# Microsoft

2.
2.1
(Information Retrieval System)
[1]

[3]
3 1) (Spider)

2)
(Indexer and database)

(Software)
3) (Search engine
software)
315
NCCIT2015

(Descriptive Statistics)
3.
(Percentage) (Average)
(Quantitative Research)

3.1
3.4 4
1

400
700,000
7,000,000
1,000,000
Taro Yamane
n =
N =
e =
4.
3.2
400
3 1)
352
400
.. 2557
2)
0.05
3)
(H0)
(H1)
(H0) (H1)
3.3
316
1

0.05 1
1:
2:
Smart Search

4
4.31
4.31
4.00
3.82
3.77
4-6
4.00
0.31
(0.275)
-
7-9
3.82
0.49
(0.067)
0.18
(0.555)
-
Smart
Search
Smart
Search
24
37
24
12
106
36
51
23
14
12
136
.1
.2
4
Sig.
4-6
Sig.
7-9
Sig.
9
NCCIT2015
9
3.77
14
15-24
15
20
10
56
25-34
29
39
24
11
112
35-49
15
20
13
62
50
11
.3
6
-1
1-2
0.54*
(0.005)
0.23
(0.343)
0.05
(0.829)
-
2

0.05

Smart Search
0.05 2
317
Sig
1.536
.824
12.549
.712
38.400
*
.004
37.153
*
.004
39.475
*
.007
2-3
55
88
44
20
21
228
.4
1-3
21
4-6
12
26
7-9
22
39
44
51
31
11
15
152
.5

1
15
1-4
15
10
40
5-8
18
9-12
13
12
34
63
27
21
150
3

4

Smart Search 1

Smart Search
0.05
Smart Search

Smart Search
Smart Search

Smart Search Smart Search
Smart Search

3
Smart Search

Smart Search

4:
www.google.com
96
87%
14
13%
209
87%
30
13%
102
93%
7%
207
87%
32
13%
104
95%
5%
220
92%
19
8%
92
84%
18
16%
206
86%
33
14%
103
94%
6%
218
91%
21
9%
83
75%
27
25%
191
80%
48
20%
89
81%
21
19%
205
86%
34
14%
5.
6.
7.
8.URL
9.
10.
11.
Smart Search
www.pantip.com
www.google.com
Smart Search
94
85%
16
15%
200
84%
39
16%
88
80%
22
20%
179
75%
60
25%
104
95%
5%
213
89%
26
11%
86
78%
24
22%
190
79%
49
21%
87
79%
23
21%
199
83%
40
17%
81
74%
29
26%
184
77%
55
23%
105
95%
5%
212
89%
27
11%
Smart Search

1.
1.1

1.2
1.3
1.4
2.

3.
4.
Smart Search
www.pantip.com
3:
NCCIT2015
318
5:
12.
(Relevant)
13.
(Descending
Ascending)
14.

15.

16.
Smart Search
www.pantip.com
5.
www.google.com
100
91%
10
9%
213
89%
26
11%
98
89%
12
11%
212
89%
27
11%
79
72%
31
28%
181
76%
58
24%
86
78%
24
22%
197
82%
42
18%
[1]
89
81%
21
19%
204
85%
35
NCCIT2015
15%
[2]
[3]
Smart Search
(Relevant)
Smart Search
[4]

(Descending Ascending)
Smart Search
[5]

(Descending Ascending)
Smart Search

319
,
N-Gram NCCIT
5 .. 2552, 308
,
, ,
: , 2551.
,
,
, :
, 2552.
,
seesiam.com,
, :
, 2544.
,
,
, : ,
2555.
NCCIT2015

An Application of Cuckoo Search Algorithm
for Decision Support System of Selected the Item Quality
(Mana Sopa)1 (Kanisorn Jeekratok)2 (Nipon Sungsuthi)3

1
manasopa@hotmail.com, 2kanisorn_jee@hotmail.com, 3niponsst@gmail.com
Keywords: Cuckoo Search Algorithm, Decision Support

System, Items Analysis.
1.

1 1

[1]

3
[2]

[3]

Abstract
This research aimed to apply cuckoo search
algorithm for selected the item quality according to
learning objectives from the items with same learning
objectives set of multiple test. Methodology includes;
planning for creating and items analyst, applied the
cuckoo search algorithm to solve this problem and test
performance of the algorithm. The results have shown
that the proposed algorithm could process the selected
data set to be used for decision more than one set of
learning objectives. In all tests have been selected are the
item quality under criterion.
320

[4]

1
NCCIT2015
P=
R
N
(1)
P
R
N

(Discrimination)

2
D=
RU RL
RU
(2)
D
RU
RL

[5] 27
100 33 50
100

0.70
2.1.5
2.2

[6]
2.2.1 (P)
0.20 - 0.80
2.2.2 (D)
0.20

D > 0.40 ;
D > 0.30 - 0.39
D > 0.20 - 0.29 ; D < 0.19

2.2.3
0.20 [2]

2.
2.1
(Multiple
Choice) [5]
2.1.1
2.1.2 3
(Content Validity)
(IOC)
2.1.3

2.1.4
[6]
(Difficulty)

1
321
NCCIT2015
(P)
(D)

3 4
2.3
[7] (Cuckoo search
algorithm)

Lvy flight

1
[8]
STEP 1: Initialize the pheromone trails and parameter

STEP 2: Iteration
Repeat for each ant
Solution construction using global pheromone trails
Update the global pheromone trails
Until stopping criteria
2: [10]
3.
3.1
3.1.1 1
1
1 1 [11]

1
begin
Objective function f ( x), x = ( x1 , , x d )T ;
Generate initial population of n host nests
xi (i = 1,2,, n) ;
while (t < MaxGeneration) or (stop criterion);
Get a Cuckoo (say, i ) randomly by Lvy flight;
evaluate its quality/fitness Fi ;
Choose a nest among n (say j ) randomly;
1:
1
2
3

1 1/ 1 1/ 2 1/ 3
2 2/ 1 2/ 2 2/ 3
n n/ 1 n/ 2 n/ 3
if ( Fi > F j ) ,
Replace j by the new solution;
end
Abandon a fraction ( pa) of worse nests
[and build new ones at new locations via Lvy flight];
Keep the best solutions (or nests with quality solutions);
Rank the solutions and find the current best;
end while
Post process results and visualization;
End
...
...
1/ n
...
...
...
2/ n
n/ n
3.1.2
3.1.3

3.2
3.2.1

1: [8]
2.4
(AS)
(ACO) [9]

(Pheromone)
322
Ni
i
Pij j
i
Dij j
i
Dsys
3.2.2

Dsys =
1
n
1; ROUND

2
7
Lvy flight 6
nest i(t ) i ,
Lvy
fligh; r
(Standard normal distribution), nestbest
S
Lvy flight 7
X ij Dij
i =1 j =1
X ij = {0,1}, i = 1, 2, ..., n and j = 1, 2, ..., N i
(3)
(4)
u ~ N (0, u2 ),
v ~ N (0, v2 )
(8)
(1 + ) sin( / 2)
u =
(
1
)
/
2
[(1 + ) / 2]. .2
, v = 1
(9)

Fi
1 3
3
Fi
F j Fi F j
j
4
4
p [0,1]
0 1 pa
10 pa
3.2.3

1 3
4, ( pa) ,
( n ), ,

5
(7)

Lvy flight 0 < < 2 1.5;
u v
8 9
i j

nestij(0 ) = ROUND X j min + ( X j max X j min ).rand
S=
3 (Pij)
0.20 - 0.80 (Dij)
0.20 4
Xij (i = 1,2,,n j = 1,2,,Ni)
1
X ij =
0
(t ) ).r
nesti(t +1) = ROUND nesti(t ) + .S .(nesti(t ) nestbest
(6)
n Ni
0.20 Pij 0.80 Dij 0.20
NCCIT2015
) (5)
nestij(0) , i
, j
;
X j min and X j max
j (
); rand 0
323
pij 1 0
11
if rand < pa
if rand pa
1
pij =
0
nest t +1 = ROUND nest t + S . * K
4.2

[8] (n)
25 (pa) 0.70
100 0.01
1.5
4.3

[4]
3
(10)
S = (nests (randp1(n), :) nests (randp2(n), :) ).rand
(11)
randp1 randp2
(Permutation)
K pij
5
6
2
7
4.
0.6
4.1

[4] 10
5 2

50
1
2
3
4
5
6
7
8
9
10

D
P
D
P
D
P
D
P
D
P
D
P
D
P
D
P
D
P
D
P
D
0.575
0.58
0.56
AS: time = 1.4s

CS: time = 0.6s
0.54
0.52
0.5
0.48
0.46
0.44
10 20 30 40 50 60 70 80 90 100
Ant System
Cuckoo Search
3:

2: [4]

NCCIT2015
0.47
0.25
0.47
0.75*
0.57
0.375*
0.63
0.5
0.57
0.25
0.50
0.75*
0.57
0.375
0.53
0.5*
0.50
0.625
0.43
0.375*
0.43
0.5*
0.60
0.375
0.40
0.375*
0.53
0.375
0.67
0.375*
0.60
0.5
0.63
0.5*
0.67
0.375
0.60
0.25
0.57
0.25
0.67
0.5*
0.57
0.625
0.57
0.25
0.63
0.25
0.67
0.375*
0.60
0.375
0.67
0.25
0.53
0.25
0.60
0.375
0.53
0.375*
0.60
0.375
0.53
0.25
0.53
0.375*
0.47
0.875*
0.47
0.25
0.50
0.5
0.50
0.25
0.53
0.375
0.53
0.25
0.70
0.375*
3

100

5
0.50
0.375
0.70
0.375
0.53
0.25
0.70
0.25
0.70
0.25
0.47
0.25
0.40
0.25
0.60
0.5*
0.60
0.75*
0.67
0.25
3:
0.43 0.47 0.57
0.47
0.67
0.50 0.63 0.60 0.60
10
0.43
Dsys
D 0.5 0.75 0.375 0.875 0.375 0.75 0.5 0.5 0.75 0.375 0.575
1 2 1
1 4
2 1 2 5 5
1
324
0.43 0.47 0.57
0.47
0.67
0.50 0.63 0.60 0.60
0.70
D 0.5 0.75 0.375 0.875 0.375 0.75 0.5 0.5 0.75 0.375 0.575
2 2 1
1 4
2 1 2 5 5
4
3: ()
[2]
10
0.43 0.47 0.53
0.47
0.67
0.50 0.63 0.53 0.60
0.43
0.67 0.47 0.57
0.47
0.67
0.50 0.63 0.60 0.60
0.70
0.67 0.47 0.57
0.47
0.67
0.50 0.63 0.60 0.60
0.53
Dsys
[3]
D 0.5 0.75 0.375 0.875 0.375 0.75 0.5 0.5 0.75 0.375 0.575
3 2 1
4 4
2 1 2 1 5
1
D 0.5 0.75 0.375 0.875 0.375 0.75 0.5 0.5 0.75 0.375 0.575
4 3 1
1 4
2 1 2 5 5
4
[4]
D 0.5 0.75 0.375 0.875 0.375 0.75 0.5 0.5 0.75 0.375 0.575
5 3 1
1 4
3 1 2 5 5
3
3
1 5

Dsys = 0.575

2, 4, 6, 7 9
[5]
[6]
[7]
5.
[8]

( ),
, , 2546.
,
, , 27, 5,
.. .. 2552 381 388.
S. Srestasathiern, English Proficiency Test Analysis and a
Development of Test Bank Software and Computer-aided
Examinations, ,
22, 2, .. .. 2555 275 284.
,

, 37,
19 21 2557, . 869 872.
, ,
, 7, : , 2545
53 66.
,
,
, :
, 2545
230 - 251.
,

,
13,
: , 2555
316 323.
X.-S. Yang, and S. Deb, Engineering Optimisation by
Cuckoo Search. Int. J. Mathematical Modelling and
Numerical Optimisation, Vol. l, No. 4, pp. 330343, 2010.
[9] M. Dorigo & L. M. Gambardella, Ant colonies for the

traveling salesman problem. BioSys, Vol.43, pp. 7381, 1997.
[10] C. Blum & M. Dorigo, The hyper-cube framework for ant
colony optimization. IEEE Trans. Syst. Man Cybern. B,
Cybern. Part B, Vol. 34, No.2, pp. 11611172, 2004.
[11]
[1]
NCCIT2015
,
,
325
,
, , :
, 2545
253-255.
NCCIT2015
GUI-SCILAB

Development of Computer Program based on Graphical User Interface (GUI)
of SCILAB in Discrete Fourier Transform for Undergraduate Student
(Kitti Surpare)1 (Meechai Lohakan)2

1
kittisurpare@yahoo.com, 2lohakanm@yahoo.com
Fourier Transform 1D and Discrete Fourier Transform

2D. Finally, the constructed program can be applied for

SCILAB

( Open Source)

4

2 1
2

:
teaching students efficiently.

Keyword: Discrete Fourier Transform.
1.

21

[3]
Abstract
This research paper presents the development of
computer software using SCILAB, an open source
programming language, for Digital Image Processing
subject in Discrete Fourier Transform topic. The main
objective of the research is to strengthen a teaching
program that not violates the company copyright. The
research process consists of four phases, analysis,
design, evaluation and try out. As a result, the computer
software for teaching the students in undergraduate level
is legally developed. The teaching contents are Discrete
326

SCILAB

-
-
-

-
-

-
SCILAB
-
MATLAB
-
-

[1]

NCCIT2015

GUI SCILAB

2.

2.1 SCILAB
1: SCILAB
327
SCILAB

INRIA ENPC

SCILAB
MATLAB

SCILAB

SCILAB 1
NCCIT2015

(Windows Operating System) 2
GUI SCILAB
2.3
2.3.1 1
x(n)
X(k)
N
n
k
2.2 (GUI)
2.3.2 2
F(u,v)
f(x,y)
N
M
2: GUI SCILAB
(Graphical User Interface:
GUI)

(Hyperlink) (Mouse)
Xerox PARC

PARC User Interface PUI ..2513
(Mactintsoh)
2.4
[2]
MATLAB

MATLAB
5

328
3.2

SCILAB
SCILAB
3.3

GUI

3.
3.4

3.

11
NCCIT2015
4.
3:
3.1

3

2
- 1
- 2
4: GUI 1
GUI
5

329
NCCIT2015
df = 10 .01
3.17
.01
4.2
GUI

11
GUI

2:
GUI

1.
2.
3.
4.GUI
5.
6.
5: GUI 2
7.
8. GUI
4.1
GUI

3.

11
2 2557

1: t-test
21
21
5.5
18.3
S.D.
2.2
2.0
9.
10. GUI
S.D.
3.81
4.00
4.00
4.27
3.90
4.09
4.00
4.00
4.00
4.18
4.03
0.60
0.63
0.44
0.78
0.70
0.53
0.44
0.63
0.44
0.78
0.59
GUI

t-test
17.4
5.

GUI

21
18.3

17.4
330

GUI

[1] ,
( 2550)

[2]
GUI-MATLAB
[3] 21
Panyapiwat Journal Vol.5, 2014.
331
NCCIT2015
NCCIT2015

A Recommendation System for Choosing Cultivars of the Para Rubber
Tree for Eastern Region of Thailand using Decision Table
(Suteera Puengsawad)1 (Pongsakon Bamrungthai)2
(Naruemon Mi-iam)3

1
aj-tarn@hotmail.com, 2pongsakon.bam@gmail.com, 3yui_naruemon@hotmail.com
planting in this research. Furthermore, the system can be

used to search for related information on the cultivar

20 8

20

4.19 0.52

:

from a cultivar name. The results show that the system

performs all functions correctly. For system evaluation, a
preliminary user test with 20 subjects has been
performed. The satisfaction of the system obtained from
the questionnaire is good with an average score of 4.19
and a standard deviation of 0.52. The developed system
can be further improved by covering more planting
factors that are found in other regions of Thailand.
Keywords: Recommendation
System,
Choosing
the
Cultivars of the Para Rubber Tree, Decision Table.
1.

Abstract
This research is a development of a recommendation
system for choosing cultivars of the Para rubber tree for
planting in the eastern region of Thailand. It is
implemented as a web application for facilitating the
farmer by using decision table technique. There are 20
cultivars of the Para rubber tree and 8 factors for
332
NCCIT2015
3.
3.1
3.1.1
3
[3]
- 1

- 2

- 3

1 2

3.1.2

[4]
1)

2)

16
3)

4)

2.

[1]

[2]

10
30
1 1
10 400

89
89

333
4.
5)

6)

[5]

7)

8)
[6]

3.2
(Decision Table)

[7]
1
1:
4.2

2
2:

1:

NCCIT2015
4.
4.1

1

1.
2.
3.
334
/
1.
2.
3.
1. 1
2. 1
1.
2.
3.
1. 1
2. 1
1. 1
2. 1
1. 4
2. 4
1.
2.
3.
4.
1.
2.
3.
4.
5.
6.
NCCIT2015
2
8
3
3
20 [8]
3:

BPM 24

GT 1

PB 260

2: Use Case Diagram

1
1
1

4 4 4
4.3

Use Case Diagram

2
5

3: Sequence Diagram
335
4.4

2

4.5

4

(Rating Scale)
5 4.515.00
3.514.50 2.513.50
1.512.50
1.001.50
NCCIT2015
5 8
1
4:
5:
5.

46 4
5

6

2
1
4
7
2 2
6:
336
4: 1

1

1
1
4

1

1
1
4
20
4.38
0.42
20
4.05
0.57
20
4.19
0.52
[1] ,
,
, 2551.
[2] ,

, The 5th National

6
6:
1.

2.
S.D.
8:
5.1

20
4.19
0.52
5.2

7:
5.
3.

4.

5: 2

NCCIT2015
Conference
S.D.
20
4.16
0.58
20
4.18
0.51
Computing
and
Information
Technology (NCCIT 2009), , 2552.
[3] , 2555,

, 2555.
on
337
[4] ,
,
, , 2554.
[5] ,
2553
,
, 2554.
[6] ,
2555,
, , 2555.
[7] Gary B. Shelly, Thomas J, Cashman, and Harry J,
Systems Analysis and Design, 7th Ed. Course
Technology", Rosenblatt, 2008.
[8] ,
2554, ,
, 2554.
338
NCCIT2015
NCCIT2015
Sentiment Analysis for Hotel Services from Reviews in Both Thai and
English Language
(Ujchara Pooraya)1 (Maleerat Sodanil)2

ilovekamo@gmail.com1, maleerat.s@it.kmutnb.ac.th2
by using Naive Bayes, Decision Tree and Support Vector

Machine. In order to compare and find the most accuracy

Tripadvisor Agoda 5

:

classifier of sentiment analysis and can apply the model in

future work about hotel services. The researcher collect
the reviews of 4 stars hotel from Agoda and Tripadvisor
and reviews are analyzed in 5 properties such as room,
location, service, facilities and price. The results show
that Support Vector Machine is the most accuracy
classifier.
Keyword : sentiment analysis, hotel reviews, Naive
Bayes, Decision Tree, Support Vector
Machine, sentiment analysis model
1.

2557 1.7-1.8
1.1-1.2
6 [1]

Abstract
The reviews or opinions of customers for hotel services
are very important data. Because its can indicated
customer's satisfaction and quality of hotel services which
can be used to support decision to improve quality of hotel.
In this paper present the sentiment analysis model of hotel
services from reviews in both Thai and English languages
339
NCCIT2015
(Train Model)

2.1.3 Document Clustering

search engine
2.2 (Sentiment Analysis)

(Opinion Mining)
(Positive) (Negative)

Twitter, Facebook
2.3 (Nave Bayes)
(Data Mining)
(Bayess
theorem)

PAB x P(B)
P(B|A) =
(1)
P(A)
P(B|A) Attribute
A B
P(A|B) Training Data
B Attribute A
P(B)
B
P(A)
Attribute A [2]
2.4 (Decision Tree)
(Hierarchy)

(node) (Attribute)
(Branch) (Leaf)

(Class) [3]

Facebook, Instragram

Agoda(www.agoda.com/th-th) TripAdvisor
(www.tripadvisor.com)

Text Mining
2.
2.1 (Text Mining)

3
2.1.1 Document Summarization

2.1.2 Document Classification

340
NCCIT2015

[8]
MALLET (MAchine Learning for
LanguagE Toolkit)
Andre McCallum
University of Massachusetts Amherst
6 classifier [9]
1: [4]
2.5 (Support Vector Machine)

support vector
kernel function
kernel function
(Polynomial Kernel)
3.
3.1

1,500
Agoda (www.agoda.com/th-th)
1,500 Tripadvisor
(www.tripadvisor.com)
- 2558
import.io

excel

5
(Manual)
5

(Gaussian Radial Basis Function) [5]
2: 2
2.6

2
Agoda[6]
Text Pre-Processing

[7]
classifier

WeChat

341
1:

5
3:
(Room)
The room are very big with a balcony,

clean and neat.
The bathroom was smelling a bit and the
( 1,500 )
980
(980x100) / 1500
0.653
= 65.3

513
(513x100) / 1500
0.342

= 34.2
sink was blocking whenever the tap was

running.
(Location)
Located very conveniently to the Don

Mueang Airport.
It is also far from the hub of Bangkok.

(Service)
The staff were all polite and helpful.

Upon check in, we were addressed by a

2-4

4:
very rude reception clerk.
(Facilities)
Breakfast was very good, large variety.

The pool water had a strange metallic

smell, probably from the pollution.
(Price)
Good value for the price.

The rooms are decent, but pricey.

excel 2

5
2:
1
2
n
()
NCCIT2015

1)

( 2-4)
2)

3)
4)

980
513
342
0.4
0.3
0.2
0.1
-1

Wtotal> 0
Wtotal< 0

Wtotal = 0

2
= (-0.7) + (-0.3) = -1
Wtotal< 0

3.2
1)
2)

0.45

-
0.3

3)
0.25

()

1)
0.6

2) check-in
check-in
0.4
check-out
Early Check-in

1)

0.45

2)

0.35

3)

0.2

0.7
1)
2)

0.3
3:

Training Set
Text Processing 4
Tokenization () Filter Token (
(2)
Wtotal
Wi
i=1,2,,n
n

1

Wtotal =
NCCIT2015
W1 + W2 + +Wn
343
5.
) Stem () Stop Word Filtering

( stop word) Machine Learning

Algorithm

Testing Set Text Processing

3.3

(Accuracy)

(TP+TN)
Accuracy =
(3)
(TP+ FP+FN+TN)
5 :
True Positive (TP)
False Negative (FN)
False Positive (FP)
True Negative (TN)
[1]
bFkyOHpNREkxTURFMU9BPT27.=02558
4.
Room
Location
Service
Facilities
Price
Room
Location
Service
Facilities
Price
Decision
Tree
90.12
91.40
88.52
86.56
81.70
87.70
80.37
85.47
82.02
80.91
80.36
84.72
83.20
80.93
85.48
81.72
81.54
84.40
86.37
85.63
. 2558. Naive Bayes

. :
http://dataminingtrend.com/2014/naive-bayes/

6:
Nave Bayes
. 2558. - 58 2.2
(). :
http://www.khaosod.co.th/view_news.php?newsid=TURO
[2]
Classifiers
Properties
NCCIT2015
[3]
SVM
[4]
.
.

, 2553.
J. Han and M. Kamber. Data Mining Concepts and
Techniques. 2nd ed. United States of America : Elsevier
92.61
89.91
90.39
88.75
85.50
Inc., c2006.
[5]
Namthip M. and Maleerat S. "Comparison of Feature

Selection Methods for Inappropriate Webpage
Classification by Data Mining Technique." The Tenth
National Conference on Computing and Information
Technology. 10 (2014) : 168-173.
88.34
86.77
88.19
85.92
88.25
[6]
C. Haruechaiyasak, et al. "Constructing Thai Opinion

Mining Resource:A Case Study on Hotel Reviews."
Proceedings of the 8th Workshop on Asian Language
Resources. 8 (Aug. 2010) : 64-71.
[7]
E. Haddi, X. Lui and Y. Shi. "The Role of Text Preprocessing in Sentiment Analysis." Procedia Computer
science. 17 (2013) : 26-32.
344
[8]
L. Zhang, et al. "Sentiment Analysis on Reviews of

Mobile Users." Procedia Computer Science. 34 (2014) :
458-465.
[9]
S. Fong, et al. "Sentiment Anlaysis of Online News

using MALLET." 2013 International Symposium on
Computational and Business Intelligence(ISCBI). (Aug
2013) : 301-304.
345
NCCIT2015
NCCIT2015

Clinical Support System of Aortic Aneurysm using Data Mining: Case Study of
Endovascular surgery
(Nopparat Pojjiraporn)1 (Jeerasak Nampradit)2 3
(Sakchai Tangwannawit)3

n.pojjiraporn@gmail.com , jeerasak.n@it.kmutnb.ac.th and sakchai.t@it.kmutnb.ac.th

Decision Tree (J48)
98.106%

(Root Mean Squared Error : RMSE) 0.110
J48

87.57%

4.45 0.56

:
J48

[1]

50 [2]

10,597
17,215
. 2009 [3, 4]

. 2557

Excel
Web application

Decision tree
Nave byes Neuron Network

Application

Abstract
Aneurysm is a localized, blood filled dilatation of
blood vessel that caused by disease or weakening of the
vessel wall. [1] Abdominal aortic aneurysm (AAA) is a
serious vascular disorder in which the abdominal aorta
becomes permanently dilated to at least 50% greater than
its normal diameter [2] If that aneurysm untreated in the
right way and right time, it can burst or ruptured leading
to severe hemorrhage and sudden death without any
symptoms. Aortic aneurysms were the primary cause of
346

International Society for Endovascular Surgery

50 [1]

[2]
1

(EVAR) Case Record
Form
Web
Application

Web Application

10,597 deaths and a contributing cause in more than

17,215 deaths in the United States in 2009. [3,4]
In Thailand right now AAA is put into one of life
threatening disease and also 2014 my company started to
do initiate project for AAA screening at some hospitals in
Bangkok and Upcountry by using paper case record form
and tried to summarized by using excel.
According above this paper will be developed web
application for Meddle and Senior Management by using
the best classification data mining algorithm. This paper
uses Decision tree, Nave byes and Neuron Network
technique to discover relationship between patient
demographic data, medical history and disease. In order
that all Healthcare staffs may apply this application for
disease prediction and management staffs able to analyze
market opportunities, generate marketing campaigns and
strategic planning.
From the experimental results of this paper shown
that J48 is the best model with the highest percentage of
correctly classified instances rate was 98.106 with error
between model and real power consumption at 0.110%
After Development, Web application using J48
algorithm was evaluated by using testing data (20% of
total) to predict AAA. The Result showed that web
application can predict 87.57 % correctly with survey
result that was carried by 5 expertises was shown
average overall performance and satisfaction 4.45 with
the deviation standard of 0.56.
NCCIT2015
Therefore, we can
conclude that the developed system is high effectively in a

good level.
2.
Keyword: Aortic Aneurysm, Data Ming, classification,

J48, Disease prediction
1.
Aortic Aneurysm

347

Decision Tree

[5] [6]
Vijayaothi

Decision Tree Bayesian
Classification Artificial Neuron Network Fuzzy

[7]
Bisbal
Data Mining
157 294

- SVM Binary
- SVM
- Decision Tree
- Nave Bayes
- Fuzzy Rule
- Neuron Network
- CPAR (Classification based on Predictive
Associative Rule)
SVM
95.5 [8]
Bhatla Jyoti
Cleveland Heart Disease
NCCIT2015
Database 909 Training Dataset

455 Testing Dataset 454

Nave Bayes Decision Tree ANN
Nave Bayes
86.53 Neuron
Network 85.53 Decision Tree
89 [9]
3.

1

Model
Model
Application
Application
1:

3.1

Decision Tree Nave Bayes Neuron Network

348

1 31 2557
3.2

WEKA
Case Record Form Excel file
Excel CSV data files Data
cleaning Record

Missing value
3.3
3

Web Application Decision Tree
Nave Bayes Neuron Network
3.4

WEKA
2
NCCIT2015

Decision Tree (J48)
J48 3 J48

PHP
MySql

20%

3: J48
4.
4.1

Input

4
Process
J48 Algorithm

Output
(Prediction)
5
2:
3.5 Application
349
NCCIT2015
Decision Tree (J48)

Fold Cross-Validation 30
98.106%

(Root Mean Squared Error
: RMSE) 0.110
5.2

87.57 %

5.3

5
4

(Functional Requirement Test)
(Reliability Test) (Usability
Test)
(Security Test) ( x ) 4.45
(S.D.) 0.56

Fold Cross Validation
30
98.106%
87.57%
Overfitting Fold

4: (Patient)

5
5: (Prediction)
4.2

20%

91
87.57%
5.
5.1

350
[8]
Bisbal,*J.*Engelbrecht,*G.*et al. Prediction of

Cerebral Aneurysm Rupture using Hemodynamic,
Morphologic and Clinical Feature: A Data Mining
Approach, Database and Expert Systems Applications
Conference; Database and expert systems applications:
22nd international DEXA 2011. Part II LECTURE
NOETS IN COMPUTER SCIENCE, Vol. 6861, pp. 5973, 2011.
[10] Bhatla, N. Kiran, J. An analysis of heart disease

Prediction using different data mining techiques
International journal of engineering research & technology,
Vol. 1, 2012.

[1]
Viet JAVD,*Boll APM. Abdominal aortic

aneurysm*Lancent. 349:863-6, 1997.
[2]
Benkner,*S.,* Arbona,*A.,*et al. Infrastructure for

advanced disease management through integration of
heterogeneous data, computing, and complex processing
services*IEEE Transactions on Information Technology
in Boimedicine, 2010.
[3]
Kochanek KD, Xu JQ, Murphy SL, Minio AM, Kung

HC. Deaths: final data for 2009 Natl Vital Stat Rep,
Vol.60, No. 3, 2011.
[4]
Go AS, Mozaffarian D, Roger VL, Benjamin EJ, Berry

JD, et al. Heart disease and stroke statistics-2013 update:
a report from the American Heart Association
Circulation. Vol. 12, pp. e6e245, 2013.
[5]
Lossos,*IS. Cerebrospinal fluid lactate dehydrogenase

isoenzyme analysis for the diagnosis of central nervous
system involvement in hematooncologic patients.
Cancer; Vol. 88(7), pp. 1599604, 2000.
[6]
Selker,*HP. A comparison of performance of

mathematical predictive methods for medical diagnosis:
identifying acute cardiac ischemia among emergency
department patients, J Investig Med, Vol. 43(5)8, pp.
46876, 1995.
[7]
NCCIT2015
Paramasivam,*V.*Ye, TS. et al. A methodological

review of data mining techniques in predictive medicine:
An application in hemodynamic prediction for abdominal
aortic aneurysm disease, biocybernetics and biomedical
engineering, 2014.
351
NCCIT2015

Associations Rule Mining By Using Top Weight of
Complete Symmetric Digraphs
(Pramool Suksakaophong) (Phayung Meesad)

1
pramool7@yahoo.com, 2pym@kmutnb.ac.th
rule with the maximum support can be calculated and it

works with any dataset.
Keyword: Association rule mining, Complete Symmetric

Digraphs, Adjacency matrix, Data mining.
1.
(Association
rule mining) ( Marker Basket
Transaction)
(Frequent Itemsets)
(Minimum Support)
(Minimum Confidence)

Abstract
Association rules mining from transaction data can be
used to recommend the items that are often purchased
together frequently. However, it is difficult to set minimum
support threshold. If the minimum support threshold is set
too high, then there may be only a small or even no result.
If the threshold is set too low, it may generate many
uninteresting associations. In addition, each supporting a
different set of data, enabling users to find the optimal
difficult. This paper presents a new approach to the
collection frequency by using top weight of complete
symmetric digraphs. Using the top weight, the association
352
( ) =
R = 1
x =1
2.1
2
(Frequent Items Generation)

(Rule Generation)

1
Frequent Items
Generation
Rules Generation
()
()
(3)
2.
Data
NCCIT2015
(2)
(3)
4
50 6 602 :
(Exponential)

2.3
Apriori (Apriori Algorithm) [1]

Apriori

FP-Tree
FP-Growth [2]
2
2.4

(Node) (Edge)

FP-Growth Graph [3]
FP-Growth
(Adjacency Matrix) [4]

TDB [5] (Path)
(Array) [6]
(Completed Graph) GARM [9]

(Dynamic Update)
Association Rule
1:
2.2

I = {i1, i2, , in}
(items)
n T = {t1, t2, , tm}
(Transaction) T
m
ti
I
[1]
(Support) (1)

()
()
( ) =
(1)

[1] Confidence (2)

353
1:
[10]
TID
01
02
03
04
05
06
07
08
2.5

0
1 WEKA
Apriori minsup = 0.1
minconf = 0.9

WARM [8]
Top-k [9]

2
B
(b) 2 node
(c) 3 node
1
0
0
0
0
0
1
1
1
1
1
1
0
0
1
1
0
1
D
0
1
1
1
1
1
3:
D
(a) 1 node
A B C
1 1 1
1 1 1
A
C
TID
01
02
03
TID = 04
05
06
07
08
Algorithm1 FEG Frequency-Edge-Graph Construction

load data to transaction[]
[M, N ] = Transaction[]
for i=1 to M
for j= 1 to N /*count items in each TID */
if transaction(i,j)==1
Items[]= j
end
for k = 1 to size(Items)
FEG{}= [Items{M, N}, i]
end
end
end
B
A
Items Bought
{Apple, Bread, Cake}
{Apple, Bread, Cake, Diaper}
{Apple, Cake}
{Cake, Diaper}
{Bread, Cake, Diaper}
{Bread, Cake }
{Bread, Diaper}
{Bread, Cake, Diaper}
3.1
1
(Transaction ID) (Items)
TID
0 1
3.2

(adjacency
matrix) (Cell Array, { })
- 3
3.
NCCIT2015
(d) 4 node

transaction[]
1

FEG{}
2:

1 0
354
FEG{}
2

(Union)
(Top_W)
{A,C} 3

Top_Weight = [5 5 4 3]
3.3 (Top Weight)
(Anti-Monotone property)

(4)
01
,0
,0
01
01
01
01,02
01
C
02
02
02
[01]
FEG =
[01]
NCCIT2015
[01,02]
FEG =
[01,02]
[02]
[01] [01]
[01]
[01]
[01,02] [01,02[ [02]
[01,02] [02]
[01,02]
[02]
[02]
[02]
4: 01 02
4 01
items = {A, B, C}
(TID = 01)
FEG {} 02 (TID = 02)
items = {A, B, C, D}

(Multigraph)

supermarket 1 2
6
B
,0
05
2,
,0
01
08
01
6,
,0
(4)
, ( ) () ()
01,03,2
0.9
L1
0.8
L2
05
,0
support
0.7
02
,0
4,
02
02,05,07,08
0.6
0.5
0.4
0.3
5: FEG{}
0.1
Top_weight
0.2
1
9
17
25
33
41
49
57
65
73
81
89
97
105
113
121
129
137
145
153
161
169
177
185
193
201
209
0
item

5 FEG{}
(TID)
3
6: supermarket
1
L1 L2
2
2
Top_Weight
2:
A
Top_W
[01,04]
[01,03,04]
[04]
[01,04]
[01,04,05,06,08]
[04,05,07,08]
[01,03,04] [01,04,05,06,08]
[02,04,05,08]
[04]
[02,04,05,08]
Union
[04,05,07,08]
3
355
3.4
2

FEG{}

7
FEG{}

(1)
NCCIT2015
null
6
C
B
Top_weight[1] = 5
Top_weight[2] = 5
Top_weight[3] = 4
Top_weight[4] = 3
D A B D B A
A D C A C D
C A B A C B
B D C D B C
A D D B A B
D A A C D C
A C A B B C
D B D C C B
8: Top_weight = 4
4.

MATLAB R2012a
32BIT (1)
1 (max L1) 2
(max L2) (2)
2 (max Conf)
9 11
Algorithm2 Association rule Generation

[M, N ] = size(FEG)
for i=1 to M
for j= 1 to N
/*find Maximal Weight for each item */
If ( sum(items(m,n)) > max_items
max_items = items(m,n)
end
end
Top_Weight[] = max_items
Sort(Top_Weight)
end
[M, N ] = FEG{}
Top_Weight[] = d /* define Top_Weight level */
minconf = d
for (L1 Items >= Top_Weight)
for L1 to Ln Items
sort(intersect(items(L1,L2, Ln) Top_Weitht
and items(items(L1,L2, Ln) minconf
Asso_rule[] = (items(L1,L2, Ln)
end
end
1
0.9
0.8
support
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49
items
7:
max L1
max L2
max Conf
9: Bakery
1
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
1
9
17
25
33
41
49
57
65
73
81
89
97
105
113
121
129
137
145
153
161
169
177
185
193
201
209
support

3 4 8

items
max L1
max L2
max Conf
10: supermarket
356
10
12
14
50
0.1
10
222
13
16
262
15
64
100
0.3
0.2
12
150
52
0.4
44
0.5
200
38
0.6
30
No. of Rule
support
0.7
192
250
0.8
188
300
0.9
242
NCCIT2015
240
0
1
11 13 15 17 19 21 23 25 27 29 31 33
max L1
max L2
11
14
17
Top Weight
items
max Conf
12: supermarket
5.

6

Bakery 0 0.1

11: Chess
9 Bakery 5,000
50 (max L2)
0.0512 10 supermarket
4,627 217
(max L2) 0.505079 11
Chess 3,196 33
(max L2) 0.56383

4 5

3: 5
Dataset
Chess
Supermarket
Bakery
0.56383
0.505079
0.0512
0.56383
0.502485
0.0496
0.513454
0.49665
0.0472
0.480914
0.473525
0.044
20th International Conference on Very Large Data Bases,
0.431477
0.460125
0.0436
672836: Morgan Kaufmann Publishers Inc.;. pp. 487-99,

[1]
R. Agrawal, R. Srikant, Fast Algorithms for Mining

Association Rules in Large Databases, Proceedings of the
1994

Supermarket
0.505079 2 0.502485 4
5 0.460125 12
12

[2]
J. Han, J. Pei, and Y. Yin, Mining frequent patterns

without candidate generation, Proceedings of the 2000
ACM SIGMOD international conference on Management
of data, ACM: Dallas, Texas, USA. pp. 1-12, 2000
[3]
V. Tiwari et al., Association rule mining: A graph based

approach for mining frequent itemsets, Networking and
Information Technology (ICNIT), 2010
[4]
A. Inokuchi,., T. Washio, and H. Motoda, Complete

Mining of Frequent Patterns from Graphs: Mining Graph
Data, Machine Learning,. Vol 50(3): p. 321-354, 2003
357
[5]
S. Arumugam,. and S. Sabeen, Association Rule Mining

using Path Systems in Directed Graphs, International
Journal of Computers, Communications & Control, vol
8(6): pp. 791-799, 2013
[6]
L. Naili, and M. Lei, Discovering frequent itemsets an

improved algorithm of directed graph and array, 4th IEEE
International Conference on. 2013Software Engineering
and Service Science (ICSESS), 2013
[7]
P. Amal Dev, N.V. Sobhana, and P. Joseph, GARM: A

Simple Graph Based Algorithm For Association Rule
Mining. International Journal of Computer Applications,.
Vol 76(1-16): pp. 1, 2013
[8]
A. Salam, and M. Sikandar Hayat Khayal, Mining topk

frequent patterns without minimum support threshold,
Knowledge and Information Systems, Vol 30 (1 ): pp. 5786, 2012.
[9]
R. Pears et al., Weighted association rule mining via a

graph based connectivity model, Information Sciences,
Vol 218(0): pp. 61-84, 2013.
[10] P. Suksakaophong and P. Meesad, Complete-Graph-Like

Association Rule Mining,Joint Conference on ACTIS &
NCOBA 2015 Nakhon Phanom, Thailand, January 30-31,
2015 pp. 148-154, 2015
358
NCCIT2015
NCCIT2015

Loan Rejection Clustering using Text Mining Technique
(Somsak Wichaikit)1 (Maleerat Sodanil)2

1
lovelyminami@hotmail.com, 2maleerat.s@it.kmutnb.ac.th
1.

2 K-Means

Clustering
K-Means
:

2557
SMEs
14-15
2554-2556
9.6 2553 1.2
SMEs 4.1
( 31)
( 23) [1]

(Customer Relationship Management:
CRM)

25%
Abstract
To meet the needs of customers in financial business
is important because it has a high business competition.
The existing information is used to achieve maximum
benefit, it is one way that can be done to increase the
advantage in competition. This research presents the data
of customers, the company was denied a loan. That are
formatted as text are grouped by using text mining are KMeans and Self-Organizing Maps for the best group and
can be applied in planning decisions, customer
relationship management, researchers collected data on
denied messages. Provide data and information is
grouped by Clustering method. Research has found that
the groups with the K-Means method get the best results.
Keyword: text mining, k-means, self-organizing maps
359
NCCIT2015
2.2.1 (Document Summarization)

2.2.2 (Document
Classification)
(train model)
class

2.2.3 (Document Clustering)

2.3 (Machine Learning)

(Artificial Intelligence)

(Historical Cases)

3
2.3.1 (Supervised Learning)

2.3.2 (Unsupervised Learning)

2.3.3 (Semi-supervised
Learning)

2.4 K-Means Clustering

Cluster
Centroid
Centroid

Centroid
2.
2.1 (Customer Relationship

Management: CRM)

CRM 3

2.1.1 Market Automation
(Dynamic)

2.1.2 Sales Automation CRM
(Tracking)
(Order Fulfillment)
2.1.3 Customer Service

Feedback
2.2 (Text Mining)

(Machine Learning)
(Document Processing)
(Text Processing)
Information extraction

3
360
hci(t)
BMU
2.6

WRFM Model [4]

(Decision Tree)
Clustering
K-Means

[5]
K-Means
Clustering
[6]

(SOM)
3

22 58 [7]

50%
[8]
(1)
x = { x k | k }
x = { x1, x2, x3,, xi }
Mk k
nk k
xik x i k
2.5 Self-Organizing Maps (SOM)

Teuvo Kohonen [2] [3]

2 (Weight Vector)
Wi = [Wi1,Wi2,,Wid]
(2)
Wi d
[3]
Wi

Wi

Wi Best-Matching Unit
(BMU)
(3)
|| Xj Wc || = mini {|| Xj - Wi ||}
||-||
(Euclidean Distance)
Wi BMU

Wi(t+1) = Wi(t) + (t)hci(t)[Xj(t) Wi(t)]
NCCIT2015
(4)
t

Xj(t) Input Vector
(t) t
361
3.
NCCIT2015
3.2.5 Operator Filter

Stopwords (Dictionary)
Dictionary
3.3
3.1

2557
3.2
3.2.1
3.2.2

3.2.3 THSplitLib
PHP
Web Application PHP
PostgreSQL Library THSplitLib
Dictionary

character ( | )
3 : K-Means Clustering Rapidminer

vector creation TF-IDF prune
method absolute
5 1,000
Cluster 3
4 : Self-Organizing Map Rapidminer

vector creation TF-IDF prune
method absolute
5 1,000
Dimension 3
1 : THSplitLib
3.2.4
Rapidminer Operator Tokenize
mode specify characters character
( | )
5 : Self-Organizing Map + K-Means Rapidminer

Dimension SelfOrganizing Map K-Means
Clustering Cluster 3
3.4

Centroid Operator
Cluster Distance Performance
Centroid DaviesBouldin index
2 : Rapidminer
(5)
362
5.
n Cluster
Ci Centroid Cluster i
i Cluster i
d(ci,cj) Centroid Ci Centroid Cj

THSplitLib PHP
5,898
K-Means SOM
K-Means
Centroid
4.
K-Means
5,898
1 : K-Means
cluster_0
833
cluster_1
574
cluster_2
4491
SOM
5,898
2 : SOM
SOM_0
SOM_1
SOM_2
Min
0
0
0
Max
19
19
19
Average
9.70
9.84
9.57
[1]
Deviation
5.70
5.70
5.81
cluster_1
2107
cluster_2
1873
.
.
*
, 2551.
[6] .
. *
( )*
, 2552.
[7] , .

:
The 9th National Conference Computing
and Information Technology. ..2556 7-13
[8] . SOM

. . 27
2 ..2553 25-30.
[5]
Cluster_0

Cluster_1
Cluster_2

Cluster Distance Performance
4 :
K-Means
SOM + K-Means
,
2557. 22 2558
https://www.bot.or.th/Thai/FinancialInstitutions/Publication
s/FSR_Doc/FSR2014.pdf
[2] T. Kohonen. "The self-organizing map." Proceedings of the
IEEE. 78(9) (September 1990) : 1464-1480.
[3] J. Vesanto, J. Himberg, E. Alhoniemi and J. Parhank angas.
"Self-Oganizing Map in Matlab: the SOM Toolbox." In
Proceedings of the Matlab DSP Conference. (2000) : 35-40.
[4] S. M. S. Hosseini, A. Maleki and M. R. Gholami an.
"Cluster analysis using data mining approach to develop
CRM methodology to assess the customer loyalty." Expert
Systems with Applications. 37 (July 2010) : 5259-5264.
3 : SOM + K-Means
cluster_0
1918
NCCIT2015
Average within Centroid Distance

Cluster 0
Cluster 1
Cluster 2
-0.888
-0.834
-0.964
-53.761
-63.907
-56.236
363
NCCIT2015

-
The Recommender System for Adaptive Learning Based on
Students Competency Profile by Using FP-Growth Techniques
(Uraiwan Inyaem)

uraiwan.inyaem@rmutt.ac.th
Abstract

-

1)
2) 3)
(Data Mining)
CRISP-DM

(Dashboard)

4.32
0.54
:
-
In the present time, many recommender systems

are used for complex data that help users to work easily.
This paper presents a recommender system which advises
a student to select suitable subjects based on students
competency profile by using FP-Growth techniques. It is
experimented for the bachelors degree in Computer
Science Course, Science and Technology Faculty,
RMUTT. The input data used in the system is students
personal data which are: 1) how each student attends the
course, 2) each students grade and 3) a students
occupation after finishing the course. The data will be
analyzed with Data Mining technique following CRISPDM step to find out association rules to support the
recommender system which can help a students decision
to select computer science subjects for himself/herself.
The analyzed data in the recommender system are easily
used with a variety presentation form of dashboard. The
mean assessed from users using the recommender system
is 4.32 and standard deviation is 0.54 which refer to
highly satisfy.
Keywords: Data Mining, Recommender System,
Association Rule, FP-Growth Algorithm.
1.
364
NCCIT2015

3.5
2.3 - (FP-Growth Algorithms) [3]
-

2 -
-
2.4
[4]
3

[5]

-

[1]

2.
2.1 (Recommender System) [1]

2.2 (Association Rule Discovery) [2]

365
NCCIT2015
3

ARFF
[7]

1)

c = , d = , a = 1
3.

Cross-Industry Standard Process for Data Mining
CRISP-DM [6]
3.1 (Business
Understanding)

-
3.2 (Data Understanding)
2553

1)
2) 3)

3.3 (Data Preparation)
1:
2)

[8] 16
1) 2)
1 3)
2 4) 5)
6) 7)
8)
9) 10)
11) 12)
13) 14)
15) 16)

4 [5]
366
3.4 (Modeling)
ARFF

-

1
3)
7
[8]
8 2
1:
1
2
3
4

A
B - B+
C - C+
D- D+
8
2
VG
G
M
L
2:
2:
P1
P2
P3
3.5 (Evaluation)

(Support) (Confidence)
(Lift) [9]

[9]

[9]
( )
1
1
3.6
(Deployment)
(dashboard) (Pentaho) [10]

P5
P6
P7
P8
P4
NCCIT2015
367
NCCIT2015
4.

8 3

1 : C+ , A , A , A , A , B , B ,
C+ , B , B+ , A , C+ , C+ , B+ , C , B+
2 : B+ , A , A , A , A , A , A , B ,
A , B , A , B+ , A , B , B+ , A
3 : A , A , A , A , B , B , A , C+ ,
B+ , B , C+ , B+ , B+ , A , B+ , B+
4 : A , A , A , A , B+ , B+ , A ,
B+ , A , B+ , A , A , A , A , A , B+

5 : B , B , A , B , C+ , C+ , B ,
B+ , A , B , C , D+ , C+ , D+ , D+ , B

6 : B , C+ , A , C , C+ , C , B ,
C+ , B+ , B , D+ , C+ , C+ , B , C , B+

7 : A , A , A , A , A , A , A , B+
, A , A , A , B , B+ , A , A , A

8 : B , A , A , A , A , A , C , B+ ,
A , B , C+ , A , A , A , A , B+

(Dashboard)

3 4
3:
4:

3:
C+ , A , A , A , A ,
B , B , C+ , B , B+
, A , C+ , C+ , B+ ,
C , B+
B+ , A , A , A , A ,
A,A,B,A,B,
A , B+ , A , B ,
B+ , A
A,A,A,A,B,B
, A , C+ , B+ , B ,
C+ , B+ , B+ , A ,
B+ , B+
A , A , A , A , B+ ,
B+ , A , B+ , A ,
B+ , A , A , A , A ,
A , B+
B , B , A , B , C+ ,
C+ , B , B+ , A ,
B , C , D+ , C+ ,
D+ , D+ , B
368
90%
80%

1.25
95%
85%
1.50
90%
80%
1.25
93%
85%
1.40
88%
77%
1.15
B , C+ , A , C , C+ ,
C , B , C+ , B+ , B ,
D+ , C+ , C+ , B ,
C , B+
B , C+ , A , C , C+ ,
C , B , C+ , B+ , B ,
D+ , C+ , C+ , B ,
C , B+
B,A,A,A, A,
A , C , B+ , A , B ,
C+ , A , A , A ,
A , B+
90%
80%
1.25
86%
76%
1.05
92%
77%
1.35

CRISP-DM
8
16

(Dashboard)

-

4.56 0.58
NCCIT2015
[1]

10,, , 8-9 2557.
[2] R. Agrawal, H. Mannila, R. Srikant and A. I. Verkamo., Fast
Discovery of Association Rules. In U.M. Fayyad, G.Piatetsky-Shapiro,
P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge
Discovery and Data Mining. AASAi/MIT Press, p.307-328, 1996.
[3] Han, J.,Pei, J., and Yin, Y. 2000. Mining Frequent Patterns without
Candidate Generation In proceeding of the 2000 ACM SIGMOD.
[4] , , ,

NECTEC Technical Journal 3 11 ..
2554 134-142.
[5] , -

(CIT 2011 & UniNOMS 2011),
, , , 26-28 2554.

4.53 0.55

4.32 0.54
5.
369
[6] , An Introduction to Data Mining Techniques

(Thai version), : ,
2014.
[7] . [ ], :
http://www.cs.waikato.ac.nz/ml/weka/ [1 2558].
[8] ,
, : , 2000.
[9] . Data Mining Course [ ], :
http://202.28.94.51/web/wararat/ [1 2558].
[10] . [], :
http://www.pentaho.com/ [1 2558].
370
NCCIT2015
NCCIT2015

Online Message Ownership Identification using Nave Bayes Learning
(Nitipat Petmongkonjaras)1 (Tanasaneee Phienthrakul)2

1
nitipat_boo@hotmail.com, 2tanasanee.phi@mahidol.ac.th
accuracies of Nave Bayes learning are in the range 70-95%,

which are higher than the other methods. This ownership

300
30

70-95%

:

identification method can help to identify the fraud message,

the scam, or any text written by the same person. These are
possible to detect and warn the suspect messages.
Keywords: Nave Bayes Classifier, Online Message, Text
Ownership Identification, Machine Learning.
1.

[1]

Abstract
Communication on the Internet is difficult to identify a
person. The text can be copied easily. The authors can be
forged into several accounts to deceive or create trends in
some topics. This article has analyzed the text communication
on the Internet to identify the owner. The 300 samples from
30 authors were collected from the messages on the website.
The features of text were extracted to analyze the owner of
messages using Nave Bayes learning technique. The
experimental results were compared with the nearest neighbor
and support vector machines. The results showed that the
371

[2]

[3], [4], [5]

S. Tan J. Zhang [6]
5

2.
NCCIT2015
(Nave Bayes Learning) [7]

(Class)

= ( ) ( | )
(1)

( )

3.

4
1
1:
372
3.1

http://www.pantip.com

300 30 10
2
NCCIT2015
3:
3.2.3

4
2:
3.2
3.2.1

[8]
2 - -

-
3
3.2.2

300
2,808

4:
3.3

3.4

373
NCCIT2015
4.
3:
1: KNN
3

4 3 5

(K-Nearest Neighbor: KNN) K=1
(SVM)
Polynomial 2
(Accuracy)
(Precision) (Recall)
2 10
2
10-Fold Cross-Validation
KNN, SVM,
1-3
4: 3
4

83%, 0.8502 and 0.83

30 10
10-Fold Cross-Validation
5
2: SVM
374
NCCIT2015
5: 30
5.
5 1
14 14 1

(cross-validation)

10%
2 20
14
90.86% 14
3
,
20 58.27%

71.494%

6:

3.2
375
(1)
2

1 1 2
2 1 3

=1
NCCIT2015
[1] .

,

10 (NCCIT 2014), 522-527, 2014.
[2] .
,

, 2547.
[3] T. Kasemsrithanawat and T. Phienthrakul, Sentiment Classification
using Bayes' Classifier and Feature Selection with Relief
Algorithm, National Conference on Computer Information
Technologies (CIT 2011), NakornPathom, Thailand, 2011.
[4] B. Pang, L. Lee and S. Vaithyanathan, Thumbs up? Sentiment
Classification using Machine Learning Techniques, Proceedings
of the ACL-02 conference on Empirical methods in natural
language processing, vol. 10, 2002.
[5] P.D. Turney, Thumbs Up or Thumbs Down? Semantic
Orientation Applied to Unsupervised Classification of
Reviews, Proceedings of the 40th Annual Meeting on
Association for Computational Linguistics, 2002.
[6] S. Tan and J. Zhang, An empirical study of sentiment
analysis for Chinese documents, Expert Systems with
Application, vol. 34, pp.2622-2629, 2008.
[7] T.M. Mitchell, Machine Learning, McGraw-Hill, 1997.
[8] ,
LexTo: - ,
http://www.sansarn.com/lexto/
(2)
6.

300
30 10

3

30
71.49%

376
NCCIT2015

A Modification of Multi-Objective Optimization Genetic Algorithm
with Initial Population Partition
(Prudtipong Pengsiri)1 (Sunantha Sodsee)2 (Phayung Meesad)3
1
2 3

1
prudtipong.p@hotmail.com, 2sunanthas@kmutnb.ac.th, 3pym@kmutnb.ac.th
into small groups aiming to achieve global solutions

PIMOGA (Partition of Initial population for
Multi-objective Genetic Algorithm)
K-Means

( Global Solution)

( Convergence
Distance) ( Pareto Spread)
( Terminated Generation)
Convex
Nonconvex
MOGA PIMOGA

MOGA Murata
:

efficiently. This proposed work is, however, evaluated by

considering theses following measurements: convergence
distance, pareto spread and terminated generation with
several convex and nonconvex benchmark functions. To show
its efficiency, the work compared its results to MOGA. They
showed that PIMOGA found the set of optimal solutions very
fast. Its convergence distance and pareto spread were also
smaller than MOGA, except only the Muratas problem.
Keywords: Optimization Problems, Multi-Objectives
Genetic Algorithm, Clustering Algorithms,
Initial Population Part Partition.
1.
(Optimization Problem)

Multi-Objective Genetic Algorithm (MOGA) [1]
MOGA

Constrain

MOGA

Abstract
This paper proposes a new Multi-Objective Genetic
Algorithm (MOGA), which is called a Partition of Initial
Population
for
Multi-Objective
Genetic
Algorithm
(PIMOGA). It applies a clustering algorithm, which is KMeans clustering algorithm, for partition an initial population
377
Initial Population
K-Means
MOGA

(Partition of Initial Population for Multi-objective Genetic
Algorithm; PIMOGA)

3 Convergence
Distance, Pareto Spread
(Terminated Generation)
NCCIT2015
2.2 (Genetic Algorithm)

(Evolutionary Algorithm; EA) [4]

EA (Genetic
Algorithm; GA) [5], [6]

(Heu-ristic)
GA
( Single-objective
Optimization Genetic Algorithm; SOGA)
1:
(Population) [7]

(Chromosome) ( Genome)

(String of Variables)
2:

3:

4:
5:
-

6:

(Crossover) (Mutation)
2
2.
2.1. (Optimization problem)
(Optimization)

(Optimization or Mathematical
Programming) [2] x f(x)

(Global Optimum)
3 1)
2)
3)

1
1: Maximize
Minimize [3]
378
NCCIT2015
(Convergence)
(Pareto Optimal Solution)

(Pareto Optimal Set)
(Non-dominated Set)
3 Fonseca Fleming [1]
( Pareto
Dominance)
(Pareto Optimality)
1 :
u = (u1 ,...,un) v = (v1 ,...,vn)
u v
Minimize
Maximize
n u v (2)
1 2
6 1 (Generation)

GA
2.3
SOGA
(MultiObjective Optimization Problem; MOOP) [8]

GA
(Multi-Objective Genetic
Algorithm; MOGA)
m
(1)
( ) { 1 (), 2 (), , ()}
{1, , }, {1, . . . , }
(1)
(2)
u v u
v u
v
2 :
[, ]
[, ] = ( ) = ( )
x fi (x)
i i = 1,2,,m

x m

(Non-dominated Solution Set)
(Pareto Optimal Set)
2.4

(Non-dominated Solution)
(Pareto-based method) [9],[10]
(Generation)

(
(Local Pareto Solutions)

3:
379
= {1, , | |}, || ,
2.5.3 (Terminated
Generation)

Terminated Generation

2.5
[11]
2.5.1
(Convergence Distance Measurement)
[12]
(3)
(4)
(Obtained Solution Set)
(True Pareto Set)
() =
| |
| |
=1
| |
() ()
= =1 =1 [
2.6 K-means Clustering

K-means [13]
(Unsupervised Learning)
KMeans (Partition) K

(Centroid)

1) K
K
2)

3) K

4)
2)

( Minimize Intra-Cluster
Distances)
(Maximize Inter-Cluster Distances)
(3)
(4)
convergence distance(A)
, ,
, | |
A, ()
, ()
, k
, k ,
i
(y) (x)

2.5.2
(Pareto Spread Measurement) [12]
(5)
(6)
() =
||1

+ +=1
+ +(||1)
3. PIMOGA
(5)
=
2
( ) (+1 )

=1 [ ]
NCCIT2015

K-Means Clustering
3

3

(6)
()
,
,

380
NCCIT2015

(Partition of Initial Population for Multi-Objective Genetic
Algorithm; PIMOGA)
4
Initial population
-Random population from constrain
-Clustering : K-Means
(a)
Partition#1 of
Initial population
Partition#1
Partition#2 of
Initial population
(b)
MOGA and
Comparison for Performance
Measurement
Partition#3 of
Initial population
Partition#2
Partition#3
Pareto front
Union Local
Optimal Solution
(d)
(c)
5: Pareto front (a) Shaffer,
(b)Murata, (c) Srinivas and Deb (d) KUR PIMOGA
3:
Global Optimal Solution
4: Partition of Initial population for Multi-objective Genetic

Algorithm (PIMOGA)
PIMOGA
4 [8]
Minimize Constrain 1
1:
Problem
Object function
Const.
Problem
Remark
Convex
Shaffer
1 = 2
2 = ( 2)2
[0, 20]
Murata
1 = 21
2 = 1 (1 2 ) + 5
Srinivas
& Deb
1 (, ) = ( 2 + 2 )1/8
2 (, ) = (( 0.5)2 + (
0.5)2 )1/4
1 () =
2
2
1
=1 ( 10(0.2 + +1 ))
0.8
2 () = =1(| | +
5 sin 3 )
Convex
1
[1, 4]
2
[1, 2]
Convex
=
[5, 10]
KUR
[14]
[5, 5]
Nonconvex
4.
Optimal Solution
Shaffer
[0, 4]
[0, 2]
Murata
[1, 4]
1 [1, 4] 2
[1, 2]
Srinivas & Deb
[0, 1]
[3, 5]
y [0, 1]
[20, 1]
[1, 1]
KUR
4:
Problem
Shaffer
Murata
PIMOGA
2 PIMOGA 4
MOGA
Pareto front 5
2:
Parameter
Value
Population size
100
Maximum Number of Generation
200
Crossover probability
0.5
Mutation probability
0.01
Function Values
Srinivas &
Deb
KUR
Performance Measure
MOGA
PIMOGA
Convergence Distance
0.0198274
0.00854748
Pareto Spread
0.175315
0.0807251
200
142
0.007397
0.00686308
0.117972
Pareto Spread
0.10781
200
148
0.0104297
0.00822491
Pareto Spread
0.121629
0.104202
180
126
0.014596
0.013892
Pareto Spread
0.140766
0.129873
174
134
PIMOGA 4

3
381
PIMOGA
MOGA Pareto front
4 Convex
Nonconvex 3 4 PIMOGA
Pareto front

MOGA MOGA
Pareto Spread
MOGA
Pareto front
Terminal Generation
MOGA PIMOGA
Optimal Solution MOGA
Pareto Spread Murata MOGA

PIMOGA
0.010162
NCCIT2015
Joint 7th International Conference on and Advanced

Intelligent Systems (ISIS), 2014, pp. 359364.
[3] Inductiveload, A diagram showing local and global
extrema on the graph of. 2007.
[4] G. S. Hornby and J. B. Pollack, Creating High-Level
Components with a Generative Representation for
Body-Brain Evolution, Artif. Life, vol. 8, no. 3, pp.
223246, Jul. 2002.
[5] D. E. Goldberg, Genetic Algorithms in Search,
Optimization and Machine Learning, 1st ed. Boston,
MA, USA: Addison-Wesley Longman Publishing
Co., Inc., 1989.
[6] ,
,
, vol. 2555, no. 2, pp. 7380.
[7] B. Kazimipour, X. Li, and A. K. Qin, A review of

population initialization techniques for evolutionary
algorithms, in 2014 IEEE Congress on Evolutionary
Computation (CEC), 2014, pp. 25852592.
[8] S. Sodsee, A multi-objective bisexual reproduction
genetic algorithm for computer network design
/Sunantha
Sodsee.
[Online].
Available:
http://dric.nrct.go.th/bookdetail.php?book_id=16662
7. [Accessed: 19-Apr-2015].
[9] H. . Abbass, R. Sarker, and C. Newton, PDE: a
Pareto-frontier differential evolution approach for
multi-objective
optimization
problems,
in
Proceedings of the 2001 Congress on Evolutionary
Computation, 2001, 2001, vol. 2, pp. 971978 vol. 2.
[10] J. Knowles and D. Corne, The Pareto archived
evolution strategy: a new baseline algorithm for
Pareto multiobjective optimisation, in Proceedings
of the 1999 Congress on Evolutionary Computation,
1999. CEC 99, 1999, vol. 1, p. -105 Vol. 1.
[11] ,
5.

MOGA
(PIMOGA) Convex
Nonconvex ,

MOGA

PIMOGA
Global Optimal Solution
,
, vol. 2555, no. 8, pp. 5461.
[12] R. Kumar and P. K. Singh, Pareto Evolutionary

Algorithm Hybridized with Local Search for
Biobjective TSP, in Hybrid Evolutionary
Algorithms, A. Abraham, D. C. Grosan, and P. H.
Ishibuchi, Eds. Springer Berlin Heidelberg, 2007, pp.
361398.
[13] Sapao Knowledge: Cluster K-means, Sapao
Knowledge. .
[14] F. Kursawe, A Variant of Evolution Strategies for
Vector Optimization, in Proceedings of the 1st
Workshop on Parallel Problem Solving from Nature,
London, UK, UK, 1991, pp. 193197.
6.
[1] C. M. Fonseca and P. J. Fleming, Multiobjective
optimization and multiple constraint handling with
evolutionary algorithms. I. A unified formulation,
IEEE Trans. Syst. Man Cybern. Part Syst. Hum., vol.
28, no. 1, pp. 2637, Jan. 1998.
[2] K. Sakakibara, T. Matsumoto, I. Taniguchi, and H.
Tamaki, Optimization of design of decentralized
energy networks by mathematical programming
techniques, in 15th International Symposium on Soft
Computing and Intelligent Systems (SCIS), 2014
382
algorithms, in 2014 IEEE Congress on Evolutionary

Computation (CEC), 2014, pp. 25852592.
[8] S. Sodsee, A multi-objective bisexual reproduction
genetic algorithm for computer network design
/Sunantha
Sodsee.
[Online].
Available:
http://dric.nrct.go.th/bookdetail.php?book_id=166627.
[Accessed: 19-Apr-2015].
[9] H. . Abbass, R. Sarker, and C. Newton, PDE: a Paretofrontier differential evolution approach for multiobjective optimization problems, in Proceedings of
the 2001 Congress on Evolutionary Computation, 2001,
2001, vol. 2, pp. 971978 vol. 2.
[10] J. Knowles and D. Corne, The Pareto archived
evolution strategy: a new baseline algorithm for Pareto
multiobjective optimisation, in Proceedings of the
1999 Congress on Evolutionary Computation, 1999.
CEC 99, 1999, vol. 1, p. -105 Vol. 1.
[11] ,
,
, vol. 2555, no. 8, pp. 5461.
[12] R. Kumar and P. K. Singh, Pareto Evolutionary

Algorithm Hybridized with Local Search for
Biobjective TSP, in Hybrid Evolutionary Algorithms,
A. Abraham, D. C. Grosan, and P. H. Ishibuchi, Eds.
Springer Berlin Heidelberg, 2007, pp. 361398.
[13] Sapao Knowledge: Cluster K-means, Sapao
Knowledge. .
[14] F. Kursawe, A Variant of Evolution Strategies for
Vector Optimization, in Proceedings of the 1st
Workshop on Parallel Problem Solving from Nature,
London, UK, UK, 1991, pp. 193197.
383
NCCIT2015
NCCIT2015

A Comparative Study on Tolerance of Thai / Laos Characters
and Arabic Number Recognition Algorithms
(Sasakorn Pichetjamroen)1 (Pakorn Watanachaturaporn)2

1
Sasakorn.Pichetjamroen@gmail.com, 2Pakorn@live.kmitl.ac.th
Abstract
An aim of character and number recognition is to

perform recognition while noise is presented and in
various light conditions. A character and number
recognition is, generally, developed for a character set of
a specific language. However, the union of countries such
as ASEAN community demands a system that can
recognize characters from multiple languages, especially
ones that are alike such as Thai and Laos characters.
This research paper aims to evaluate tolerance of current
algorithms for recognition Thai characters, Laos
characters, and Arabic numbers under various levels of
noise and various light conditions. The percent accuracy
is used to assess and compares performances among the
four algorithms; namely, a multi-layer feed-forward back
propagation neural network, a k-nearest neighbor, a
nave Bayes, and a decision tree algorithm. Overall
results show, in term of accuracy and tolerance, that knearest neighbor and nave Bayes perform better than the
others while decision tree shows the least accuracy and
tolerance. Results of this research are useful for
benchmarking with future researches and developments
of Thai and Laos characters and Arabic numbers
recognition.
Keywords: Character and Number Recognition, Thai
Character Recognition, Laos Character
Recognition, Arabic Number Recognition.
384
1.
2.

[1]
[2]
[3]

(ASEAN
Community AC)

[5]

(Multi-layer feed-forward back propagation
Neural Network) (K-Nearest
Neighbor) (Nave Bayes)
(Decision Tree)
2
3 4
5
6
NCCIT2015

[1,
2, 4, 5]

K-Nearest Neighbor
(KNN)

(k)

(Nave Bayes)

[7]

[8]
(Decision Tree)

[9] [10]

385
3.
64
2

1
Input data
Check blank
space
Feature
extraction
Bounding box
character
Classifier
model
Normalization
NCCIT2015
()
()
2: ()
32 32 ()
8 8
3.3 (Classifier Model)
Recognition
Binarization
1:
3.1 (Pre-Processing)

32 32

(Threshold)

3.2 (Feature Extraction)
32 32

4 4

8 8
3:

64 64
81 81

(Log-Sigmoid Transfer Function)
(Sum-Squared Error
SSE) 0.001 100,000

test sample
Test sample
4:
386
NCCIT2015
3.4 (Recognition)

64 1

(k) k

(Euclidean Distances)

81 64

4.

1)

Phetsarath OT
Saruns ThangLuang
81
44 27
10

2)

SNR

5:
0 dB
-10 dB
-5 dB
-15 dB
-20 dB
-25 dB
+25
-30 dB
-35 dB
-40 dB
6:

(Gini Index)

81

-125
-100
-75
Darker
-50
-25
+50
No Adjust Brightness
+75
+100 +125
Brighter
7:
SNR -5 dB
0, -5, 10, -15, -20, -25, -30, -35 -40 dB

10
81
10
72,900
387
5.

-/+ 25
-15 dB
82.72 97.16 -/+ 75
(0 dB)
99.26 99.14
2

-30 dB
94.44 -/+ 25
-15 dB
93.83 98.15
-/+ 75
(0 dB)

3

-30 dB
94.44 -/+ 25
-15dB
93.83 98.27
-/+ 75
(0 dB)
4

89.63

1 4
1:
()
Noise
(dB)
0
-5
-10
-15
-20
-25
-30
-35
Brightness (Level)
-125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
-75
-25
+25
99.26
1.23
1.23
1.23
1.23
1.23
1.23
1.23
100.00
100.00
100.00
82.72
6.17
1.73
1.36
1.23
100.00
100.00
100.00
100.00
100.00
96.91
61.98
22.59
100.00
100.00
100.00
97.16
12.72
1.98
1.36
1.60
+75
99.14
1.23
1.23
1.23
1.23
1.23
1.23
1.23
+125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
2:
()
Noise
(dB)
0
-5
-10
-15
-20
-25
-30
-35
Brightness (Level)
-125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
-75
-25
+25
+75
100.00
1.23
1.23
1.23
1.23
1.23
1.23
1.23
100.00
100.00
100.00
93.83
6.42
1.98
1.23
1.23
100.00
100.00
100.00
100.00
100.00
99.75
94.44
49.88
100.00
100.00
100.00
98.15
2.47
1.23
1.23
1.23
100.00
1.23
1.23
1.23
1.23
1.23
1.23
1.23
+125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
3:
()
Noise
(dB)
0
-5
-10
-15
-20
-25
-30
-35
Brightness (Level)
-125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
-75
-25
+25
+75
100.00
1.23
1.23
1.23
1.23
1.23
1.23
1.23
100.00
100.00
100.00
93.83
6.42
1.98
1.23
1.23
100.00
100.00
100.00
100.00
100.00
99.75
94.44
50.37
100.00
100.00
100.00
98.27
2.84
1.23
1.23
1.23
100.00
1.23
1.23
1.23
1.23
1.23
1.23
1.23
+125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
4:
()
Noise
(dB)
0
-5
-10
-15
-20
-25
-30
-35
Brightness (Level)
-125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
-75
-25
11.85
1.23
1.23
1.23
1.23
1.23
1.23
1.23
45.80
37.16
23.33
2.22
1.23
1.23
1.23
1.23
89.63
79.51
69.38
57.53
31.73
11.98
4.69
1.85
+25
+75
59.14
48.27
35.06
12.84
3.70
2.47
1.98
1.60
14.69
1.23
1.23
1.23
1.23
1.23
1.23
1.23
NCCIT2015
+125
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1.23
1

-25 dB 96.91
388
-30 dB

-15 dB

Transactions on Intelligent Transportation Systems, 2004, pp.

42-53.
[4]
Conference on Document Analysis and Recognition, 1997, pp.

612-615.
[5]
National Electronic and Computer Technology Center, 2008

[6]
Z. Cai, D. Wang, S. Jiang L. Jiang, "Survey of Improving KNearest-Neighbor for Classification," in The Fourth International
Conference on Fuzzy Systems and Knowledge Discovery, 2007
[7]
S. D. Lee, X. Chen, B. Kao, R. Cheng and D. Cheung J. Ren,

"Naive Bayes Classification of Uncertain Data," in The Ninth
IEEE International Conference on Data Mining, 2009, pp. 944949.
[8]
F. Fontanella, A. Scotto di Freca C. De Stefano, "A Novel Naive

Bayes Voting Strategy for Combining Classifiers," in International
Conference on Frontiers in Handwriting Recognition, Cassino,
2012, pp. 467-472.
[9]
W. Zhu, M. Xie, and Jian-Feng Xie, A Decision Tree Algorithm

for License Plate Recognition Based on Bagging, in Internationa
Conference on Wavelet Active Media Technology and Information
Processing, 2012, pp. 136-139.
[10] Iman Yousif and Adnan Shaout "Off-Line Handwriting Arabic Text
Recognition: A Survey," in International Journal of Advanced
Research in Computer Science and Software Engineering, vol. 4, no.
9, pp. 68-82, 2014.

M.H. ter Brugge, K.A. Helmholt, J.P.W. Pluim, L. Spaanenburg,
R.S. Venema, M.A. Westenberg J.A.G. Nijhuis, "Car License Plate
Recognition with Neural Networks and Fuzzy Logic," Proceeding
of the IEEE International Conference on Neural Network, 1995.
Wei Yeang Kow, Wei Leong Khong, Mei Yeen Choong,
Kenneth Tze Kin Teo Lorita Angeline, "License Plate Character
Recognition via Signature Analysis and Features Extraction," in
The Fourth International Conference on Computational
Intelligence, Modeling and Simulation, 2012, pp. 1-6.
[3]
Chittaphone Chansylilath Wasin Sinthupinyo, "Lao Optical

Character Recognition (Lao OCR)," in Technical Report from
[2]
Adnan Amin and Watbiq Mansoor, "Recognition of Printed

Arabic Text using Neural Networks," in The 12th International
6.
[1]
NCCIT2015
Li-Shien Chen, Yun-Chung Chung, and Sei-Wan Chen ShyangLih Chang, "Automatic License Plate Recognition," in IEEE
389
NCCIT2015

Imputation-Boosted Collaborative Filtering Algorithm based on
User Preference Information and Matrix Factorization
(Jakkarin Suksawatchon)1 (Ureerat Suksawatchon)2

1
jakkaman@gmail.com, 2ureerat.w@gmail.com
According to the experimental evaluation based on

Movielens dataset by using 5-fold cross validation, it has

PCAUPMedianCF LUUPMedianCF
Movielens
5
SVDUPMedianCF PCAUPMedianCF
5 0.7581

found that PCAUPMedianCF presents the lowest of mean

absolute error which is 0.7581 with when comparison with
SVDUPMedianCF and LUUPMedianCF. Therefore, the
proposed model PCAUPMedianCF can enhance the
quality of recommendation results.
Keywords: Recommender System,
Movie Recommendation System,
Collaborative Filtering, Sparsity Problem.
1.
(Collaborative Filtering)

(First Rate Problem)
(Sparsity Problem)

Abstract
This research presents this paper proposes the new approach

for solving data sparsity problem. It starts with filling in missing
values for each customer with user preference genre and the
cluster centroid, obtained from improving K-means algorithm.
Then Matrix Factorizations especially principal component
analysis (PCA) and LU Decomposition are applied
and incorporated with collaborative filtering, called
PCAUPMedianCF and LUUPMedianCF, respectively.
390
(Scalability Problem) [1]

(Rating)

1 % [2]

2 1)
2)

(Dimension Reduction)
[3]
(Hybrid
Recommendation)

[4]

[5] (Singular
Value Decomposition SVD)
(Matrix Factorization)
[6]
SVD

SVD

SVD
(Item-based Collaborative
Filtering) [7, 8, 9] SVD
NCCIT2015

SVD [10]
PCA (Principle Component Analysis)
PCA SVD

Matrix Factorization

[11]
SVDUPMedianCF

SVD

SVD
SVD

[11] Matrix Factorization

PCA LU
(LU Decomposition)
2.
2.1 (Recommender System)

( Demographic
information)

(Rating) User
391
2.2 ( Principal
Component Analysis)
[13]

(Eigenvectors and Eigenvalues)
A
nxn X
A
(3)
Ax = x

Preference

[1]
(Cosine-based Similarity)
(Adjusted Cosine
Similarity)
(Pearson correlation coefficient)

(1)
, = +
(, ),
|(, )|
NCCIT2015
(1)
2.3 LU (LU Decomposition)

LU [13]
(Upper
Triangular Matrix) (Lower
triangular matrix)
L (Lower Triangular
Matrix) U (Upper
Triangular Matrix)
A
2.2 ( Singular Value

Decomposition)
SVD [11, 12]
(Matrix
Factorization) (Latent
Semantic Indexing LSI)
SVD
m p
r
(2)
Z = U V T
U m r
(Orthogonal Eigenvectors)
ZZ T V p r
Z T Z
r r
Eigen Value Z T Z
1
*
A = LU =
*
3.
0
1
*
*
0
0
1
*
0
0 0
0 0
1 0
0
0
*
*
*
*
*
0
*
*
(4
*
)
*

SVDUPMedianCF [11]
1

392
1 ,
1 Action (G1),
Adventure (G2) Comedy (G5)
3.2

(User Preferences Movie Genre)

5

1 Action (G1)>Adventure
(G2)>Animation (G3)>Childrens (G4)>Comedy (G5)
1 {G1, G2, G3, G4,
G5}

5

4
1
{G3, G4, G5, G7, G13, G12} 1
{G3, G4, G5, G7, G13}
4 1
1
4
5
A55
1:
3.1

MovieLens (http://movielens.umn.edu)
2 (Rating)
User-Item Matrix
U 55
5 () 5 ( )
1 5 1 5
?
Non co-rate
U 55
4
= 4
5
3
?
3
4
?
5
?
3
?
4
3
3
5
?
2
2
NCCIT2015
co-rate

MovieLens
(Movie Genre) 18
G1 G18
A5 x 5 =
393
4
4
4
?
3
?
?
4
4
?
3
3
5
3
5
?
2
2
3
2
3.3

3.2

User-Item Matrix ( A55 )

[11]
3.4

2 1
2, 3 5 2 1 4
1
3 3
3 B55

1:
Cluster
1
Cluster
2
Movie1
4
Movie2
3
Movie3
3
Movie4
4
Movie5
2
NCCIT2015
B55 (Normalization)
SVD 5
k
Z u ,k ui k
i
Bui ,k ui k
Bk k
k k
N 55
0.000 0.671 - 0.730 0.447
= 0.000 - 1.565 1.095 0.447

0.000 0.671 1.095 - 1.789
0.000 0.671 - 0.730 0.447

0.000 - 0.447 - 0.730 0.447
4
4
5
3
3
5
4
3
4
3
3
3
5
5
3
5
4
- 0.447
- 0.447
- 0.447
1.789
- 0.447
N 55 (SVD)
5 U
- 0.432
0.529
0.529
- 0.480
- 0.146
- 0.103
0.129
0.129
0.609
- 0.764
0.776 - 0.443 - 0.056
0.054 - 0.532 0.645

0.054 - 0.354 - 0.757
- 0.443 - 0.443 - 0.056
- 0.441 - 0.443 - 0.056
3.694
0.000
= 0.000
0.000
0.000
0.000
1.415
0.000
0.000
0.000
0.000
0.000
0.585
0.000
0.000
U=
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.000
0.000
U d d
6
(6)
U d d
d
d = 2 U 2 5 2 2
2 2
1
B5 x 5 = 4
(5)
Bui ,k B k
Z ui ,k =
2
2
3
2
3.4 Matrix
Factorization
3.4.2 SVD
SVD
SVDUPMedianCF [11]
U 2 12/ 2
- 0.432 - 0.103
0.529 0.129
0.529 0.129
- 0.480 0.609
- 0.146 - 0.764
3.694 0.000
0.000 1.415
- 0.831 - 0.123
1.017 0.153
1.017 0.153
- 0.923 0.725
- 0.281 - 0.909
U 2 12/ 2

394
U 2 12/ 2 sim55 =
1.000 - 1.000 - 1.000 0.792 1.000
- 1.000 1.000 1.000 - 0.789 - 1.000

- 1.000 1.000 1.000 - 0.789 - 1.000
0.792 - 0.789 - 0.789 1.000 - 0.435
1.000 - 1.000 - 1.000 - 0.435 1.000
ZV =
3.4.2 PCA

PCAUPMedianCF B55
(Normalization)
7
Z ui ,k = Bui ,k B k
ZV2
(7)
Bk k
0.600 - 0.400 0.400
- 1.400 0.600 0.400
0.000 0.600 0.600 - 1.600
0.000 0.600 - 0.400 0.400

0.000 - 0.400 - 0.400 0.400
- 0.200
- 0.200
- 0.200
0.800
- 0.200
Z 55
0.000
C55 = 0.000
0.000
0.000
0.000
0.000
0.800
- 0.200
- 0.300
0.150
0.000 0.000
- 0.200 - 0.300
0.300 - 0.300
- 0.300 0.800
- 0.100 0.100
V=
D = ( 1.108
0.828
0.138
- 1.000
1.000
- 0.395
- 1.000
0.733
- 0.741 1.000 0.409
- 0.395 - 1.000 0.733

1.000 - 0.763 - 1.000
- 0.763 1.000 0.451

- 1.000 0.451 1.000
0.670 - 0.730
= - 1.565 1.095
- 0.428 1.564
0.285 - 0.666
- 0.428 - 0.166
0.000
0.150
- 0.100
0.100
0.200
L sim55
(Eigenvalues)
(Eigenvectors)

0.000 0.000 0.000
0.000
0.658
0.614 - 0.124 - 0.416
- 0.111 0.555 0.345 - 0.748
0.744 - 0.466 - 0.040 - 0.476

- 0.014 - 0.309 0.929 0.911
1.000
sim55 = - 1.000
- 0.741
1.000
0.409

LUUPMedianCF B55
(Normalization)
5 N55 SVD
Matlab L = LU ( A)
N 5 x 5
2 ( d = 2 )
0.000
- 0.715
1.069
0.773
- 1.025
- 0.101
3.4.2 LU
Z 55 = 0.000
- 0.050
1.155
- 1.649
- 0.064
0.608
ZV2
Z u ,k u i k
Bu ,k u i k
NCCIT2015
1.000 - 1.000 - 1.000 1.000 - 0.405
= - 1.000 1.000 1.000 - 1.000 0.572

- 1.000 1.000 1.000 - 1.000 - 0.174
1.000 - 1.000 - 1.000 1.000 - 0.049

- 0.405 0.572 - 0.174 - 0.049 1.000
3.5
3 Best K-Nearest
Neighbor
50
3.6

4
3.4
SVD

1.000
0.000
0.000
0.000
0.200
0.024 0.000)
D (Eigenvalues)
V (Eigenvectors)

Z Vd d = 2
395
R55 =
3.950
3.797
3.489
4.219
3.896
4.575
3.543
3.043
5.000
3.937
2.950
3.051
4.213
3.219
3.375
4.950
4.797
2.489
5.000
4.896
MAE

SVDUPMedianCF
0.7588
15
PCAUPMedianCF
0.7581
10
LUUPMedianCF
0.7898
9
2
SVDUPMedianCF MAE 5
0.7588
() 15 PCAUPMedianCF
MAE 5 0.7581
10
LUUPMedianCF MAE 5
0.7898
9 SVDUPMedianCF
PCAUPMedianCF
MAE
MAE
LUUPMedianCF
2
PCAUPMedianCF
MAE
SVDUPMedianCF
2.575
2.812
4.766
2.219
1.896
3.7

(Mean Absolute Error) MAE [14]

8 9 MAE

=1 |, , |
(8)
=
=1
NCCIT2015
(9)
,

,

4.
(Rating)
MovieLens
100,000 943
1,682
20
5 (5-Fold
Cross Validation)
MAE
2 2
2: MAE 5
2: MAE 5
3 1 37
5.
396

User-Item Matrix

PCAUPMedianCF
LUUPMedianCF

PCA
LU

Movielens 5
SVDUPMedianCF
PCAUPMedianCF MAE
5 0.7581
10
NCCIT2015
[4] S. Gong, A collaborative filtering recommendation algorithm

based on user clustering and item clustering, Journal of
software 5 (7) (2010) 745-752.
[5] B. M. Sarwar, G. Karypis, J. A. Konstan, and J. T. Riedl,
Application of dimensinality reduction in
recommender
system--a case study, in: IN ACM WEBKDD Workshop,

Citeseer, 2000.
[6] M. Vozalis and K. G. Margaritis, Using svd and demographic
data for the enhancement of generalized collaborative
filtering, Information Science 177 (2007) 3017-3037.
[7] M. G. Vozalis and K. G. Margaritis, Applying svd on itembased filtering, in: Proceedings of the 5th
Conference
on
Intelligent
International
Systems
Design
and
Applications (ISDA'05), 2005, pp. 464-469.

[8] M. Vozalis and K. G. Margaritis, Applying svd on generalized
item-based filtering, International Journal of Computer
Science and Applications 3 (3) (2006) 27-51.
[9] A. Martinez, J. Arias, A. Vilas, J. Garcia Duque, and M.
Lopez Nores, What's on tv tonight? an efficient and
effective personalized recommender system of tv program,
IEEE Transactions on Consumer
Electronics
55
(1)
(2009) 286-294.
[10] K. Goldberg, T. Roeder, D. Gupta, and C. Perkins, Eigentaste:
a constant time collaborative filtering algorithm, Information
6.
Retrieval 4 (2001) 133-151.

2557

[11] W. Insuwan, U. Suksawatchon, and J. Suksawatchon.

Improving Missing Values Imputation in Collaborative
Filtering With User-Preference Genre and Singular Value
Decomposition, in: Proceedings of the 6th International
Conference on Knowledge and Smart Technologies,
2014,pp. 87-92.
[12] V. C. Klema , A. J. Laub, The singular value decomposition:

its computation and some application, IEEE Transactions
[1] J. Bobadilla, F. Ortega, A. Hernando, and A. Gutierrez,
on Automatic Control 25 (2) (1980) 164-176.
Recommender systems survey, Knowledge-Based
[13] C. Yin and Q. Peng, A Careful Assessment of Recommendation
Systems 46 (2013) 109-132.
Algorithms Related to Dimension Reduction Technique,
[2] M. A. Ghazanfar and A. P. Bennett, The advantage of careful

imputation sources in sparse data-enviornment
Knowledge-Based Systems, 27 (2012) 407-423.
of
[14] V. Emmanouil and G. M. Konstandtinos, Analysis of
recommender systems: generating improved SVD-based
recommender system algorithm, in: Proceedings of the 6th
recommendations, Informatica 37 (2013) 61-92.
Hellenic European Conf. on Computer Mathematics and Its
[3] X. Li and T. Murata, Multidimensional clustering based
Application (HERCMA 2003), 2003.
collaborative filtering approach for diversified recommendation,

in: Proceedings of the 7th International Conference on
Computer Science & Education (ICCSE 2012), 2012, pp.
905-910.
397
NCCIT2015

Electronic Document Analysis System for Educational Quality Assurance
(Phonphan Posrikaew)1 (Thippaya Chintakovid)2

1
Ponparn.pos@rmutp.ac.th, 2thippaya.c@it.kmutnb.ac.th
Abstract
Annually, the quality performance of all processes

J48
90.46%
68.05%
NBTree
11.32% J48

4.20
0.29

3.83 0.14

related to educational management need to be reported.

To show an evidence of the quality performance,
additional documents must be attached to this report.
Prior works have developed information systems
helping users to store these supporting documents
electronically; however, these systems could not
automatically analyze and store the documents based
on related quality assurance indicators. This research,
therefore, developed an information system which can
automatically classify documents according to related
indicators by analyzing document titles and text within
documents. Classification algorithms were tested.
Results showed that J48 was the most efficient with
90.46% accuracy rate, followed by Nave Bayes with
68.05% accuracy rate. The NBTree algorithm was the
least efficient with 11.32% accuracy rate. This
research, thus, used J48 decision tree algorithm to
generate the document classification model. The system
satisfaction was assessed by IT professionals and
educational quality assurance staff. The satisfaction
evaluation results by IT professionals showed an
average of 4.20 with a standard deviation of 0.29. For
the educational quality staff, the average of their
satisfaction was 3.83, with a standard deviation of 0.14.
In conclusion, the IT professionals and educational
quality assurance staff were satisfied with the system.
Keywords: Document Classification, Document
Analysis, Educational Quality Assurance
398
1.
NCCIT2015

/
[1]

[2]

2.

[2]
[3]

[1]

[4]
399
3.

[5]

NCCIT2015
3.1

3.2
1
4
J48

2.1, 2.4, 2.5, 2.6, 2.7, 2.8, 4.1 4.2
3.3
500

(.doc)
(.xls) .pdf
3.4
LextoPlus.java
(Longest Matching Dictionary-Based Program)
(Unknown
Merging)

(Stop-Word Removal)
(Stemming)

(Term Weighting)
(Feature
Selection)

ARFF
Weka 1
400
NCCIT2015
>0
14 2.5 3
<=0

1:
ARFF
2.1 1
{3, 11, 132, 478 , 1582 , 1478,
478} keyword {,
, , , , }
3.5 500
3.3 70
(train)
J48 30
(test)
2
3:
3
(training document)

(unlabeled document)

(labeled document)
3.6 Microsoft Visual Studio.NET
Version 2012 ASP.NET

Microsoft SQL Server 2008
3.7
5

12
20 5
3.7.1
3.7.2
(Functional Test)
3.7.3
(Usability Test)
2: J48
2 3729
>0 33
2.7 2
<=0 613
401
NCCIT2015
3.7.4
(Performance Test)
3.7.5
(Security Test)
4.
4.1 J48, NBTree

J48
90.4562%
9.5438%
68.0473%
31.9527% NBTree
11.3208%
88.6792%

1
4:

5
1: J48, NBTree
Algorithm
J48
Nave
NBTree
Baye
Correctly Classified 90.4562% 68.0473% 11.3208%
Instances
Incorrectly
9.5438% 31.9527% 88.6792%
Classified Instances
Mean absolute error 0.0042
0.0131
0.0276
5:

6
4.2

4
6:
4.3

402
NCCIT2015
6.
4.20
0.29
3.83
0.14
[1] ,

,

, 2550.
[2] ,

,

, 2554.
[3] ,
,

, 2554.
[4] ,

,

, 2551.
[5] ,
,

4 (NCCIT08),
, , 23-24 2551,
645-650.
5.

500 J48

403
NCCIT2015

Necessary Skills for Scrums Development Team Members
(Penprapa Bootla)1 (Olarn Rojanapornpun)2
(Pornchai Mongkolnam)3

1
penprapa.bootla@gmail.com, 2Olarnr@sit.kmutt.ac.th, 3pornchai@sit.kmutt.ac.th
area and aptitude area toward a common goal. Team

members should have enough skill set in order to carry

3

:
out their own work and also help the team to meet the
goal. Lacking necessary skills can affect the Scrum
teams success. This study proposes the necessary skills
of the development team, which has been collected from
relevant skills found in Scrum sources and subsequently
opined by Thai Scrum experts and practitioners. Our
skills are categorized into 3 categories: technical skills,
people or soft skills, and attitudes. The results show that
most of the proposed soft skills and attitudes are
necessary for Scrums development team members.
Keywords: Attitude, People Skills, Scrum, Soft Skills,
Technical Skills.
1.
(Scrum)
(Agile Software Development)
.. 2010
54% .. 2013
55%,
18%,
[1-2]

(Time Box)

( Inspection and Adaptation)

( Working Software) [3-6]

Abstract
Scrum team is a cross-functional team which is
composed of multi-disciplinary individuals, and there are
no clearly specified positions. It means that the team
members must perform many tasks in both functional
404
2.
( Self-Organizing Team)

(Cross-Functional)

3 (Development
Team) ( Scrum Master)
(Product Owner)

[7]

[8] T. Dingsoyr
T. Dyba

[9]

NCCIT2015

12

[10-14]

Moe et al. [15]

(Communication)

[16-18]
.. 2010 P. Prabhakaran [19]
Agile Record, the Magazine for Agile
Developers and Agile Testers
2
(Technical Skills)
(Behavioural Skills)
(Developer), (Quality Assurance: QA),
(Scrum Master)
P. Prabhakaran 1

405
NCCIT2015

(Collaboration and
Communication)

C. Tan H. Teo [25]

(Software Quality)
(Work Progress)
(Dealing
with Changes) ( Conflict
Management)

(Principles)
(Value)
.. 2012 A. A. Lorber S. R. Tieszen [20]

(Pair Programming) (Peer Code Review)

(Effort Estimation)

(Negotiation)
B. Kovitz [21]
(Requirement Engineering Phase)

(Breaking Big Thing into
Tiny Things) ,
(Collaboration and
Communication),
(Test-Driven),
( Object Oriented Design)
A. Viljakainen T. Turunen [22]
R. J. Wirfs-Brock [23-24]
(Agile
Designer)
3.
3.1

(Agile Manifesto) ( Agile
Principle) [26-27]

3 (1)
(Technical Skills), (2) (People/
Soft Skills), (3) (Attitude) 1
2
406
3.2

7

(Purposive Sampling)

31
NCCIT2015
(Scrum Practitioners)
(1)
(2)

(3)
2
(Likert Scale)
5 = , 4 =
, 3 = , 2 = , 1 =
1:
(Scrum Skills)
- (Scrum Process)
- (Breaking the Product Backlog)
- (Effort Estimation)
- (Advance Prioritization)
(Popular Skills)
- (Test Driven
Practice)
- (Pair Programming)
(Related Software Development Skills)
- (Computational Thinking)
- (Object Oriented Design : OOD)
- (Design Pattern)
- (Environment
Preparation)
- (Coding Standard)
- (Code Review)
- (Code Coverage)
- (Unit Testing)
- (Code Smelling)
- (Refactoring)
- (Debugging)
407

- (Active Learning)
- (Creative Thinking)
- / (Decision
Making/ Critical Thinking)
- (Problem Solving)
- / (Time Management/
Planning)
- (Dealing with Change)
- (Stress Handling)
- (Communication)
- (Leadership)
- / (Teamwork/ Team
Building)
- (Diplomacy)
- (Conflict Management)
- (Negotiation)
- (Presentation)
NCCIT2015

(Effort)

(Product
Backlog)

(Scrum)
(Scrum Role), (Scrum
Activity), (Artifact),
(Practice),

(Task)
2:

(Focus on Working Software)
(Focus on Quality)
(Belief in Simplicity)

(Time Boxing)

(Integration)

(Belief in
Collective Code Ownership)

(Respect and Trust)
(Courage)

(Focus on Time Boxing)
(Belief in Self-Directing Team)
(Continuous Integration)
408
4.
NCCIT2015
3
(Related Software Development Skills)

3
,
,

(IT Support)

5
4.515.00 , 3.514.50
, 2.513.50 , 1.512.50
, 1.001.50
1 2 3
1
3
1

2

Test Driven Practice
2:
2

1:
409
NCCIT2015

3
,

,

3:
3

[1]
G. Azizyan, M. N. Magarian, and M. Kajko-Mattson,

Survey of Agile Tool Usage and Needs, Agile
Conference (AGILE), August 7-13, pp. 29-38, 2011.
[2]
State of Agile Survey [Online], Available:

http://stateofagile.versionone.com, accessed on Jul. 20,
2014.
[3] The Scrum Primer Version 2.0 [Online], Available:

http://www.scrumprimer.org/scrumprimer20_small.pdf,
accessed on Oct. 20, 2014.
[4]
K. S. Rubin, Essential Scrum: a practical guide to the

most popular agile process, First printing, Pearson
Education, Inc., USA, pp. 198- 211, 2012.
5.
[5]
S. Viscardi, The Professional Scrum Master's

Handbook, First printing, Packt Publishing Ltd., 35
Livery Street Birmingham B3 2PB, UK, p. 99, 2013.
410
[6]
K. Schwaber, Scrum Guide, [Online], Available:
Software Engineering. Springer Netherlands, pp. 257-261,
http://www.scrumguides.org/docs/scrumguide/v1/scrum-
2010.
[19] P. Prabhakaran, Skills for Scrum Agile Teams, Agile
guide-us.pdf, accessed on Jul. 15, 2014

[7]
Record, July 2010, Issue 3, pp. 55-57, 2010.
K. Schwaber, Scrum Development Process, Springer
[20] A. A. Lorber and S. R. Tieszen, A Starting Point for
London, pp. 117-134, 1997.

[8]
N. Chantachaimongkol and P. Sincharoenpanich,
Negotiations - Delivering with a Heterogeneous Team,
Critical factors for implementing the Scrum software
Agile Conference (AGILE), August 13-17, pp. 148-155,
development methodology, Master Thesis in IT
2012.
[21] B. Kovitz, Hidden Skills that Support Phased and Agile
Management, School of Business, Society, and
[9]
NCCIT2015
Engineering, Malardalen University, 2013.
Requirements Engineering, Requirements Engineering,
N. B. Moe, T. Dingsoyr, and T. Dyba, Understanding
April 8, pp. 135-141, 2003.

[22] A. Viljakainen and T. Turunen, Requirements
Self-organizing Teams in Agile Software Development,

Australian Conference on Software Engineering, March
Engineering in Agile software projects, [Online],
26- 28, pp. 76-85, 2008.
Available:
http://www.cs.joensuu.fi/~teturun/RE/REandAgile-
[10] M. Fowler and J. Highsmith, "The agile manifesto,"
final.pdf, accessed on Aug. 20, 2014.
Software Development, August, 2001.
[23] R. J. Wirfs-Brock, Skills for the agile designer: seeing,
[11] A. Cockburn and J. Highsmith, Agile Software

Development: The People Factor, Computer, Vol. 34,
shaping and discussing design ideas, Proceedings of the
Issue 11, pp. 131-133, 2001.
ACM international conference companion on Object

oriented programming systems languages and
[12] R. Hoda, J. Noble and S. Marshall, Organizing self-
applications companion, pp. 323-326, 2010.
organizing teams, ACM/IEEE 32nd International
[24] R. J. Wirfs-Brock, Designing with an Agile Attitude,
Conference on Software Engineering, Vol. 1, pp. 285-294,
IEEE Software Magazine, Vol. 26, Issue 2, pp. 68-69,
2010.
2009.
[13] R. Hoda, J. Noble and S. Marshall, Self-Organizing
[25] C. Tan and H. Teo, Training Future Software Developers
Roles on Agile Software Development Teams, The IEEE

Transactions on Software Engineering, Vol. 39, Issue 3,
to Acquire Agile Development Skills, Communication of
pp. 422-444, 2013.
The ACM, Vol. 50, No. 12, pp. 97-98, 2007.

[26] M. Cohn, Succeeding with Agile: Software development
[14] T. Chow and D. Cao, A Survey Study of Critical Success

Factors in Agile Software Projects, The journal of
using Scrum, Second printing, Pearson Education, Inc.,
Systems and Software, Vol. 81, No. 6, pp. 961-971, 2008.
USA, pp. 31, 155-173, 2010.

[27] L. Williams, G. Brown, A. Meltzer, and N. Nagappan,
[15] N. B. Moe and T. Dingsoyr, Scrum and team

effectiveness: theory and practice, Agile Processes in
Scrum + Engineering Practices: Experiences of Three
Software Engineering and Extreme Programming Lecture
Microsoft Teams, International Symposium on Empirical
Notes in Business Information Processing, Vol. 9, pp. 11-
Software Engineering and Measurement, September 22-
20, 2008.
23, pp. 463- 471, 2011.
[16] J. Cho, Issue and Challenges of Agile Software

Development with Scrum, Vol. IX, Issue 2, pp. 188-195,
2008.
[17] Y. I. Alzoubi and A. Q. Gill, Agile global software
development communication challenges: A systematic
review, [Online], Available:
http://pacis2014.org/data/PACIS_mainconference/pdf/pac
is2014_submission_352.pdf, accessed on Aug. 05, 2014
[18] D. Kumlander, Semi-and Fully Self-Organised Teams,
Advanced Techniques in Computing Sciences and
411
NCCIT2015

The Development of E-Learning by a New Team Games Tournament
Cooperative Learning Techniques, based on Blooms Taxonomy
(Somkuan Faisanoi)1 (Jongkol Janruang)2 (Sanun Karnka)3

1
faisanoi44@gmail.com, 2jj@sci.rmuti.ac.th, 3karnka1@gmail.com
Abstract

1)
2 )
3)
4)

24
81.05/82.50
80/80

4.52

:

The learning management based on collaborative

learning techniques and Bloom's Taxonomy emphasize as
the team's learning in the form of individual collaborative
learning. However, their techniques do not have the
activities for team collaborative learning. Therefore, this
paper presents a new TGT techniques and its evaluation
using LMS. There are four objectives in this research; (1)
to develop the E-Learning based on a new TGT technique
(2) to evaluate the efficiency of E-learning (3) to compare
the achievement of students (4) to study the satisfaction of
learners. The representative sample is derived by simple
random sampling. This sample included students in total
24
learners
who
are
studying
at
Huayluek
Phadungwittaya School in Nakhon Ratchasima province.

Experimental shows that the efficiency of E-Learning is
equal to 81.05/ 82.50 which is higher than that 80/80.
Also, the achievement of learners is increasing and their
satisfied is in the good level. Moreover, the effectiveness by
3 experts is equal to 4.52, which is in very good level.
That mean a new TGT technique can be used as well.
Keywords: Cooperative Learning, Team Games
Tournament, Blooms Taxonomy, Learning
Management System.
.
412
1.
NCCIT2015

[2]
2.1.2 (Team Games
Tournament: TGT)

[3]
2.1.3 (Blooms Taxonom)
3

6 (1)
(2) (3) (4) (5)
(6)

[8]
2.2

(TGT)
80.41/80.18
80/80
0.01

[7]

3.79

[8]

[1]

(Cooperative
Learning)

[2]

[3]

[4]

(Learning
Management System : LMS) (Moodle)

(Blooms Taxonomy)

[4]
2.
2.1
2.1.1 (Cooperative
Learning)
Chin-Wen Liao., Farn-Shing Chen., Tsai-Hsiu Chen
413
NCCIT2015
3.2.2
2

4 2 2557 24
[5]
Moodle

STAD

[9]
Shulamit Kotzer., Yossi Elran
E-learning
(Constructivism)

[10]
Effandi Zakaria., Md Yusoff Daud
Moodle
[11]

1:
(A new TGT techniques)
3.3

5 (1)
(2) (3)
(4) (5)

3.4
(1)

(Blooms
Taxonomy) (2)
(3) (4)

3.5

(System Approach)[7] 5
, , ,
3.
3.1
(A new TGT techniques)

1
3.2
3.2.1
2

4 2 2557 44
414
1)

2)

TGT
3)

TGT

4)

4

5)

NCCIT2015
2:
4.1.2
4 A, B,
C D

4.1.3 5

3
4.
4.1

(Blooms Taxonomy)
2
4.1.1 4.1.6
4.1.1

3:
4.1.4

4
415
NCCIT2015
1 :

S.D.

4.55 0.29
4.48 0.38

4.52 0.06
4.3

2
2:
80/80 (E1/E2)

E1
81.05
E2
82.50
4:
4.1.5

4.1.6

5
2
E1, E2 (81.05/82.50) (80/80)
4.4

4.29
7.75
T-Test -19.17
P
0.00 0.05

0.05 3
5:
3:
t
P
N X S.D.
24 4.29 0.90
-19.17
0.00
24 7.75 0.91
4.2

( X ) 4.52 1
416
4.5
[8]

24
4.48 (S.D.=0.55)

( x =4.63, S.D.=0.50)

Wei-Yuan Dzan, Ru-Chu Shih,
& Shi-jer Lou

[12]
[3]
[4]
[5]
[6]
[7]
[8]
5.

81.05/82.50
80/80

[2]
, , ,
: , 2553.
, ,
, :
, 2553.
, , :
, 2545.
,
TGT,

, 2551.
,

(TGT)
2,

, 2551.
,

,

, 2553.
[9] Chin-Wen Liao., Farn-Shing Chen., Tsai-Hsiu Chen,

Perspectives of University Students on Cooperative
Learning by Moodle ,International Journal of Digital
Content Technology and its Applications. Volume 5,
Number 6, June 2011.
[10] Shulamit Kotzer., Yossi Elran, Learning and teaching
with Moodle-based E-learning environments, combining
learning skills and content in the fields of Math and
Science & Technology, 1st Moodle Research Conference
Heraklion, Crete-Greece SEPTEMBER, 14 - 15, 2012.
[11] Effandi Zakaria., Md Yusoff Daud, THE ROLE OF
TECHNOLOGY: MOODLE AS A TEACHING TOOL
IN A GRADUATE MATHEMATICS EDUCATION
COURSE, Leena and Luna International, Oyama, Japan.
[1]
NCCIT2015
2013.
,
2551,
: , 2552.
,
, ,
: , 2552.
[12] Wei-Yuan Dzan, Ru-Chu Shih, & Shi-jer Lou ,

Construction and Application of Incorporating
Imagination Cooperative Learning with Team Game
Tournament, 2012 Fourth IEEE International on
Digital Game And Intelligent Toy Enhanced Learning,
Taiwan, 2012.
417
NCCIT2015
TF-IDF

Thai Optical Character Recognition (OCR) Enhancement using TF-IDF
and Text Position Differences
(Phornsiri Phawapoothayanchai)1 (Kraisak Kesorn)2

1
lookrylookroon@gmail.com, 2kraisakk@nu.ac.th
paper presents a method for enhancing OCR system

using the simple TF-IDF and the text position differences

(Thai Optical Character
Recognition : OCR)
(Image processing)

TF-IDF
( Text position
differences)
(Precision-Recall)
72.88%

:
techniques. The experimental results reveal that the

proposed methods can enhance the performance of
traditional OCR measured by Precision and Recall. The
accuracy of Thai word recognition is increased up to
72.88% compared to the traditional OCR techniques.
Keywords: Optical Character Recognition, Text
Position Differences.
1.
(Recognition)
(Artificial Intelligence) [1]

[2]

TF-IDF
(Text position differences)
Abstract
Typically, researchers focus on improving Thai
optical character recognition (OCR) efficiency by
developing new techniques using image processing
based methodology. However, the major limitation of
image processing techniques is its complexity and time
consuming. Thus they are not applicable for some
applications which are speed sensitively. Therefore, this
418

100

NCCIT2015
OCR
OCR
[10]
OCR

( Enhance)
TFIDF TPD
OCR
2.
TF-IDF
[3] OCR
[4] Text
Position Differences (TPD)

[5]
OCR
[6]
Victor Fragoso, Steffen Gauglitz [7]
Singleclick Augmented reality translator
N900

3.
3.1
1

OCR ( 1)

OCR (Tesseract) and online translation services (Google

Translation API)
9x9
Martinez-Carballido [8]
(Template) 5x7
0 1
5x7

9 7 . 3 % Victor Fragoso, Steffen
Gauglitz
Maulana Wahid Abdurrahman [9] OCR
(Tesseract)

70%

419
NCCIT2015
1 :

(Database) OCR
OCR
TF-IDF
(TPD)
( 2)
( 3)
OCR OCR
TF-IDF TPD
n ()

k k = 1, ..., m m

TF-IDF [13] 2
1
= 1 + 2
2
(2)
D
t t =1, ..., n n
TF-IDF
TF (Term Frequency)
IDF (Inverse
Document Frequency)
Salton and
Buckley (1988) [11]
TF-IDF
[12] [13]
1
=
(Text Position
Differences)
TF-IDF

[12]
OCR

(1)
420
NCCIT2015
3 : OCR
OCR
OCR
TF-IDF TPD

3.3

- j j j
- x 1 x = 1 2
- y 2 y = 1 2
- , x y
3 [14]
, = =1( )
(3)
3.2

100
Joint Photographic Experts
Group (.JPEG) 320x240 2048x1536

Precision =
Recall =
(4)
(5)
4.

OCR
100
2 :
421
NCCIT2015
4 : OCR
5 : (OCR)
4.1

OCR i2ocr [15],
newocr [16] ocrapiservice [17]
OCR
(Freeware)
6 Arail, ThSarabun, Leelawadee,

Angsana, Freesia Eucrosia
422
NCCIT2015

OCR
1
TF-IDF
TPD
( Precision-Recall)
1 :
4 OCR
OCR
3 ocrapiservice
66.51%
i2ocr, newocr 52.29%,
50.56%
Arail 77.71%
4
4.2

45 60
90

90 92%
60 45
I2ocr
52.29%
68.13%
11.84%
Newocr
50.26%
64.79%
12.53%
Ocrapiservice
66.55%
85.72%
16.17%
Average
58.36%
72.88%
14.51%
1
OCR
85.72%
ocrapiservice Arial

Text Position Differences

OCR

12% 5% 5
2 :

OCR
OCR+TF-IDF
OCR+TFIDF+TPD
4.3
TF-IDF Text
Precisions
Recall
0.71
0.66
0.82
0.79
0.88
0.86
position differences

TF-IDF TPD
OCR
2
OCR TF-IDF
Text position differences
423
0.88
0.86
[6]
5.
[7]
[3]
[4]
hi, jan 5-7 2001 pp. 497-502.

[8]
Martinez-carballido, nac. de astrofis, License plate

digit recognition using binary templates at an
outdoor parking lot entrance proceedings of the
IEEE, san andres cholula, feb. 28 2011-march 2
2011, pp. 18-21.
[9]
Maulana wahid abdurrahman, Devel opting mobile

sunda-indonesia-inggris translator application using
capture camera on android smarthphone Teknik
informatika, UIN syarif hidayatullah jakarta, 2012
[10]
[11]
[12]

12 .. 2554 57-62.

2553.

2555
[13]

.
( )
2541.

2555.

2555
,

The 12th Graduate research conference
Khonkaen University 2011. 228-238
[14] T.Joachims, "A probabilistic analysis of the rocchio

algorithm with TFIDF for text c ategorization"
presented at the proceedings of the fourteenth
international conference on machine learning,
1997.pp.
Thai OCR [Online] Available from: thaiocr.com
[15] I2ocr
http://thaiocr.phaisarn.com July 10, 2011.

[5]
Victor fragoso, steffen gauglitz, jim kleban,
on the nokia N900 proceedings of the IEEE, kona,
[2]

2543.
TranslatAR: A mobile augmented reality translator
TF-IDF
Text Position Differences OCR

90

(image processing)

[1]
NCCIT2015
Developers.
Sciweavers
Pathum thani hospital Comparison of prosthesis
[Online]
Available
from:
LLC http://www.i2ocr.com 2009-
2013.
position in total hip rthroplasty by lateral and
[16] Newocr Developers. [Online] Available from:
posterior approach in pathum thani hospital
NewOCR.com 2009-2015 http://www.newocr.com
pathum thani, Thailand JRCOST VOL.34 NO. 3-4
[17] Ocrapiservice Developers. [Online] Available
July-October 2010
from: smart mobile software 2011-2015

http://ocrapiservice.com
424
NCCIT2015

Decision Support System for Economic Crops using Hybrid Approaches
(Pansakorn Worawimolwanich)1 (Kraisak Kesorn)2

1
pw.pansakorn@gmail.com, 2kraisakk@nu.ac.th
Preference by Similarity to Ideal Solution) to rank the

eligible corps regarding to FAO (Food and Agricultue

(Hybrid Approaches)
(Multiple Criteria Decision Making,
MCDM) AHP (Analytic Hierachy Process)

Oraganization of the United Nations) framework. This

research shows that the presented technique can
enhance the crop products effectively and can be used
as a guideline for other areas.
Keywords:aMultipleiCriteriaiDecisioniMaking,
MCDM, Analytic Hierachy Process, AHP, TOPSIS,
Decision Support System, DSS, Economic Crops.
TOPSIS (Technique for Order Preference by Similarity
1.
to Ideal Solution)

(Food and Agricultue Oraganization
of the United Nations : FAO)

:
TOPSIS

Abstract
This research aims to support a decision making for

the most suitable economic crops in Phitsanulok,
Thailand using the proposed hybrid approaches. The
proposed technique applies multi criteria decision
making (MCDM) techniques using AHP (Analytic
Hierachy Process) and TOPSIS (Technique for Order
425
NCCIT2015
2.2 (Multiple
Criteria Decision Making, MCDM) [3]

2
2.2.1 (Analytic
Hierachy Process, AHP) [4]

[5]
AHP [6]
[7]

1. (Structuring the
Hierachy)
(Goal) (Criteria) (Subcriteria)
(Alternatives)

AHP (Analytic Hierachy Process)

TOPSIS (Technique for
Order Preference by Similarity to Ideal Solution)

(Food and Agricultue
Oraganization of the United Nations : FAO) [1]

2.
2.1 (Decision Support
System) [2]
1:
2. (Calculation of
Relative Priority)

(Pairwise

Comparison)
9
1 =
426
, 3 = , 5 = , 7 =
, 9 = 2, 4, 6, 8 =

[8]
(Weight) (Relative
Priority)
(Matrix)

3.

(Concurrency Reasonable)

5.
=1
i= 1,.,m , j = 1,.,n
(1)

2. Normalized Decision matrix
= =1

i= 1,.,m , j = 1,.,n
, i = 1,2,.,m
(6)

2.3

(AHP)

[10]
FAO
(1983)

[11]

Chutiphon Srisawat and
Janjira Payakpate [12] AHP

2

1. (Normalization)
+
+
6.
2.2.2 TOPSIS (Technique for Order

Treference by Similarity to an Ideal Solution) [9]
NCCIT2015
(2)

3. Positive
ideal Negative ideal
+ = {1+ , . , + }=max , min (3)
= {1 , . , }=max , min (4)
i
j
4.

+ 2 12
+ =
, i = 1,.,m
=1( )
2 1 2
=
, i = 1,.,m (5)
=1( )
427

3 1 2

TOPSIS

AHP
TOPSIS

3.
NCCIT2015
3:
TOPSIS
AHP
4:
3 4

3) AHP
AHP
(Pairwise

Comparison)

5
2:
2
1)
9 93 909
[13]

[14]
2)

5:
428
3: Eigen Value

Eigen Values ( max)
(7)
max = aij w j
i =1
j =1

(Consistency Index : CI)
( n )
CI = max
(n 1)
(Consistency Ratio : CR)
CR =
CI
RI
ph
0.523
0.174
0.174
0.058
0.035
0.035
0.523
0.174
0.174
0.058
0.035
0.035
0.285
0.285
0.285
0.095
0.032
0.019
0.250
0.250
0.250
0.150
0.050
0.050
0.227
0.227
0.227
0.227
0.045
0.045
0.371
0.208
0.208
0.121
0.047
0.045
1.000
3.000
0.750
0.333
1.000
0.250
(8)
(9)
10
0.58
0.90
1.12
1.14
1.32
1.41
1.45
1.49
( Concurrency
Reasonable)
(8) (9) Eigen Value
2, 3 4
3
6
ph

4

4) TOPSIS

TOPSIS

AHP
(2) (6) 4
4: TOPSIS
0.278
0.261
0.470
0.157
0.470
0.470
0.470
0.157
0.156
0.376
0.388
0.298
0.399
0.388
0.405
0.382
0.156
0.378
0.378
0.378
0.378
0.378
0.378
0.378
0.091
0.394
0.347
0.394
0.410
0.410
0.252
0.410
1.000
3.000
0.750
0.333
1.000
0.250
2: Eigen Value
0.417
0.139
0.139
0.139
0.083
0.083
1: RI

RI
ph
4: Eigen Value
(7)
NCCIT2015
0.035
0.474
0.118
0.711
0.474
0.095
0.118
0.095
0.033
0.378
0.378
0.378
0.378
0.378
0.378
0.378
0.188
0.241
0.181
0.574
0.543
0.513
0.091
0.115
0.063
0.043
0.045
0.976
0.140
0.146
0.034
0.024
0.201
0.275
0.124
0.301
0.244
0.197
0.269

5)
429
6

2

3 3

4.
5:
0.201
0.275
0.124
0.301
0.244
0.197
0.269
NCCIT2015
2

(0.301)

(0.124)
5

[1]
Nations, F.A.O.o.t.U.: Guidelines : Land Evaluation

for Rainfed agriculture, Soil Bulletin, 1983
[2]
Huizingh, E., K.R., and Vrolijk., H.C.J.: Decision

Support for Information Systems Management. :
Applying Analytic Hierarchy Process, Organizations
and Management, 1994, pp. 15
[3]
Parols, and M.P.: Multi-Criteria Decision making

Methods: A comparative Study, 2000
5.
[4] Saaty, T.L.: Decision making with the analytic

hierarchy process, International joural of services

AHP

TOPSIS
TOPSIS

sciences, 2008
[5]
[6]
[7]
430
:
:
,
, 2555
:
AHP :
, , 2557
:

, Naresuan University Science Journal,
2557, 29-46
[8]
.: AHP
( (), 2542.
2542)
[9]
[10]
[11]
., .:

,
, 2551
:

,
, 2555
:
:

, , 2556, 41, 173-180
[12] Srisawat, C., and Payakpate, J.: Using Analytical

Hierarchy Process for Selecting Intercrop in Rubber
Field A Case Study in Phitsanulok, THAILAND,
International Journal of Advances in Computer
Science and Technology (IJACST), 2014, 3, pp. 1115
[13] . 2556. Available:
http://oss101.ldd.go.th/web_thaisoilmap/north/Pisanu
lok/ pnl_prov.htm/
[14] : ,
[15]
, 2553
. 2014. Available:
http://psl.brrd.in.th/km/index.php?option=com_conte
nt&view=article&id=44#psl5.2
[16] P. Meesad and G. Yen, Fuzzy Temporal

Representation and Reasoning, Proceedings of the
IEEE International Symposium on Circuits and
Systems (ISCAS03), Bangkok, Thailand, May 25May 28, 2003, Vol. 5, pp.789-792.
431
NCCIT2015
NCCIT2015
Development of E-learning for the Internet and Applications

based on Adaptive Learning Techniques
(Sirinthorn Watcharaphuetphol)1 (Jongkol Janruang) 2
(Sanun Karnka)3

Sirinthorn29@hotmail.com , 2jj@sci.rmuti.ac.th , 3karnka1@gmail.com
evaluation
the
effectiveness
of
E-learning
used
comparing the pretest and posttest. Thirdly, to evaluation
1)

2)

3)

4) 5)

2 ( )
2 2557
15

.05
.05
80.42/81.11

4.05
:
the effectiveness of E-learning used the adaptive testing.

Fourthly, to evaluation the efficiency of E-learning.
Finally, to study satisfy of students to learn by
E-learning based on adaptive learning techniques. The
sample used in this research was students of Secondary
Education Grade 2, Bannongsai School,They are
studying a course in Information Technology, Semester
2/2557 in total 15 students by simple random sampling.
Experimental
results
shown
that
effectiveness
of
E-learning is shown that the posttest results were higher

than that pretest in the significance level of 0.05.
Similarly, the results of posttest were higher than
that
pretest when students used adaptive testing. The

efficiency is equal to 80.42/81.11 which is higher than
standard critical 80/80. Moreover, students satisfy is
equal to 4.05 which is in very good level.
Keywords: E-learning, Adaptive Learning,
Adaptive Testing.
1.
.. 2542
22

Abstract
There are five objectives in this research. Firstly, to
develop e-learning for the Internet and Application topic
based on adaptive learning techniques. Secondly, to
432
NCCIT2015

1.1.3
1.1.4
1.1.5

1.2
1.2.1
2 ( )
2 2557 2
35
1.2.2
2
( ) 2
2557 1
15

3
3
10
24

[1][2]
E-Learning
ICT

[3][4]

3

2

Moodle
PHP
Moodle
1.1
1.1.1

1.1.2
2.
[4]

2 2
2551 40

.05

433
NCCIT2015
4.26
[7]

(Hiding)

4
7
110 7

.05

Wang and Chen [8] Framework
Adaptive learning systems
(Adaptive learning : AL)
web-base personalized learning
framework
Semantic Web languages
modules
(AL system)
service-base
Adaptive learning
Adaptive learning

Samia and Abdelkrim [9]

[5]

Online Help

Online Help

(Adaptive testing)

1 24

86.29/85.45

.05

[6]

1
1
40
3 4.67

3
4.29
0.05

434
NCCIT2015
3.3 3
3.3.1
Moodle 4

2
(LS-AEHS)

3.

3
1
2: Moodle
3.3.2 3
Conditional Text

[5]
3
1:
1

3.1

2

3.2 2
1)
2)

3)
(p) (r)
3:
3.3.3 PHP

4
1
435
2
3

3.4.2
15

1)

2)

3)

3.5

4:
1:

0-25
26-59
60-100
NCCIT2015

4
1

5
4.
5
4.1

.05 3
5: PHP

3.4
3.4.1
3
(
4.67 0.29)

3:
S.D

15
30.67 6.26

15
17.53 4.03
* P < 0.05 .05
436
11.50*
.000
4.2

.05
4
4:
X
N
S.D

15
29.20
6.53

15
8.07
3.61
* P < 0.05 .05
16.23*
.000
[1]
1.
2.
3.
4.

4.15
4.00
3.97
4.07
S.D.
0.67
0.71
0.78
0.77
4.05
0.73
.. 2542 ( 2) .. 2545 ,
: ,2545.
[2] ,
2551,
: ,2552.
[3] , t
, : ,2551.
[4] ,
,

,2551.
[5] ,

Online Help
,
,2551
[6] ,

,

,2553.
[7] , ,

,2553.
[8] Wang and Chen,"A Knowledge Integration Framework for
Adaptive Learning Systems Based on Semantic Web
Languages",IEEE International conference on Advanced
Learning , 2008.
[9] Drissi samia and Amirat abdelkrim,'An adaptive educationnal
hypermedia system intergrating learning styles : model and
experiment',International ,2012.
4.3
80/80
80.42/81.11
4.4

4.05 (S.D.=0.73)
5
5:
NCCIT2015
5.

80/80
2
( ) 15

437
NCCIT2015

Information System for Teachers using Service Blueprint
(Sithipong Chimthai)

Sithipong@buu.ac.th
Keywords: Service Science, Service Innovation, Service

Blueprint, Co-Creation.
1.
Abstract
The concept of service innovation is used to refer
many things such as innovation in services and
innovation in service processes which mean new or
improved ways of designing and services. The service
blueprint is a tool used for service innovation. It shows a
framework for viewing service improvement.
This research presents a service blueprint for teacher
services. This service blueprint used in diagnosing
problems and improving existing services. The result of
this study shows that the service blueprinting allows for
visualization of the service process. It is possible to
identify failure points and discover areas for innovation.
438
NCCIT2015
[5] (Service Innovation)

2.2.2 Service Innovation

[6]

2.2.3 Service Blueprint

5
1
2.
2.1

2.1.1 [1]

Services Sciences, Management and Engineering (SSME)
2.1.2 (Service Innovation) [2]

2.1.3 (Service Blueprint)
[3]

(Flowchart)

-------------------------------------------------------
1:
[7]
4 Overnight
Hotel Stay Service

(IBM) [8]

2.2
2.2.1 Service Science
[4]

439

[9]

3
NCCIT2015
2:
3.2
(Survey Research) [11]

[12]
(Waiting point)

(Failure point)
[13]
3
1.

.
2.
[14]

.
3.
[15]

4.

5.

3.
3.1
[10]

1

2

1.1

1.2 Google form
2
4.2
2
1

(Co-creation)
440
3:
4:
441
NCCIT2015
3.3

[16]

.

4
NCCIT2015
4.2

1
1:
5
3.90

5
3.59
10
7.49
4.

4.1

Responsive
Web

5
S.D.
0.5
0.7
1.2

16 0.16
3.90 5
0.5
3.59 5 0.7

7.49 10
1.2

5.
5:
442
Experience Center for Services Leadership W. P. Carey

School of Business Arizona State University.
[10]
[11]
[12]

[1]
[3]
Business, Education and Government in 21st Century and

AEC2015
Choudaha, Rahul "Competency-based curriculum for a
[14] Arash
. , ,
. (2553). :
,

Department of Management, University of Isfahan Hezar

Jarib St., Isfahan 81746-73441, Iran
[15]
Ioannis (Giannis) Kostopoulos, PhD (UK)
Yongtae Park.
Designing
the
Research Report December 2013, Volume 6, Number 4
sustainable product-service integration: a product-service
Tadahiko Abe. (2005). What is Service Science? The
blueprint approach Journal of Cleaner Production.
Fujitsu Research Institute, Economic Research Center,
Journal homepage: www.elsevier.com/ locate/jclepro
Economics:
DTI
OCCASIONAL
PAPER
NO.
Natalia Luca Agudelo lvaro: Co-created tools for
innovation
Mary Jo Bitner. (2007). Service Blueprinting: A
Practical Technique for Service Innovation, Center for
Services Leadership W. P. Carey School of Business
Arizona State University.
Deb, B. (2012). "Towards a Framework for Service
Ontology Evaluation". International Journal of Computer
Applications 48: 1215.
[9]
[16] Youngjung Geum,
Facilitating interdisciplinary learning in service design
[8]
Effective
a Case Study in a Four-Star International Hotel.
teaching, learning and designing services in Colombia.
[7]
An
of Denver (2008)"
Innovation in Services. JUNE 2007

[6]
Blueprinting:
Approach for Targeting Critical Service Processes With
Tokyo, Japan.
[5]
Shahin:"Service
Engineering (SSME)", "Doctoral dissertation, University
Designing a Strategic Service Blueprint: Keller Center
[4]
, , .
(2557). Service Design Workbook,
(TCDC)
. "
(Survey Research)

.. 2552 ( 3)"
. (2554).
Service Blueprint

[13] Service Science: The New Paradigm of Innovation for
master's program in Service Science, Management and
[2]
NCCIT2015
Mary Jo Bitner, Amy L. Ostrom, and Kevin A. Burkhard:

Service
Blueprinting:
Transforming
the
Student
443
NCCIT2015
5
Monitoring Application System for Child Development
(Salintip Sudsanguan)1 (Jeerasak Numpradit)2
1
2

1
a_aamp@hotmail.com, 2jeerasakn@kmutnb.ac.th
which
were
Android
Operating
System
and
Web Application, in order to support different kind of

5
2

5
30
4.61 0.39

5

5

users. The objectives of the system were not only for

reducing time spend and error on recording and
assessing of growth and development, but also improving
the performance and efficiency of such processes. The
Android application was developed for the parents, who
had to record the growth and development of their
children. On the other hand, the Web application was
developed for those healthcare staffs to ease the
monitoring of the records from those parents.
After evaluated by 5 experts and 30 users, the result of
satisfaction level was an average of 4.61 with 0.39
standard deviation. The result could be concluded that
the satisfaction rate on the developed system was in a
very good level and reach the objectives of the research.
Therefore, the deployment of the monitoring system will
help improving the performance and quality of growth
monitoring process efficiently.
Keywords: Monitoring, Development of Children,
Android.
1.
5

5

Abstract
This research aimed to develop the information
system for infant and children of preschool age growth
monitoring. The system was able to run with 2 platform,
444

[1]

NCCIT2015

0-5

4 ,
,
2.2 (Monitoring)
(Monitoring)

(monitoring)

2.3 (
)

(Android software development kit) SDK

APK

2.
2.1 5
5 ()

5

445
NCCIT2015
3.
2.4
[2]
(Decision Table)

(OLAP)

OLAP

Shao-Hsia Chang [3]

Fitts' paradigm

5 4

3.1

[1]
5

3.2

5

1:
2
-

-

446

(Use Case Diagram)
NCCIT2015
3.3.2 PHP
HTML5 Adobe Dreamweaver CS6

3.4

5

4

(Functional Requirement)
(Usability Test)
(Reliability Test)
(Security Test)

2

2: (Use Case Diagram)
-
)
)
)
-
)
)
)

)
3.3
2

3.3.1
Java for Androids

JDK (java Development
Kit) Eclipse Android SDK Android
4.
4.1
5
2
4.1.1
Development Tools
447
NCCIT2015
4 :
4.2

5
4.61
0.39
5
1
1:

(Mean)
(S.D.)
1.
( Functional Requirement )
-
4.80
0.17
-
4.37
0.61
2. ( Usability Test )
-
4.60
0.35
-
4.37
0.61
3. ( Reliability Test )
-
4.88
0.26
-
4.36
0.62
4. ( Security Test )
-
5.00
0.00
-
4.52
0.50

4.61
0.39
3:
4.1.2

5

448
5.
NCCIT2015
5.1
5

2

5
4.61 0.39

5
5

5
[1]
[2]

." ", 2556.
. "

"
,
2556.
[3] Shao-Hsia Chang. "Motor control in children wit

developmental coordination disorder Fitts paradigm of
pointing task performance measurement" International
Conference on Biomedical Engineering and Informatics
(BMEI) 2011 ,2554.
5.2

5

5.2.1
5.2.2

5.2.3

449
NCCIT2015

Development of a Monitoring and Tracking System for Handheld Devices
in the Work Place Using RFID Technology
(Waranya Prachanban)1

1
littlestamford@gmail.com, 2montean@it.kmutnb.ac.th
levels towards this system are at a good level (

PHP
MySQL
-
E-Mail
SMS
3.93 0.53

3.88 0.54 2

: -
= 0.53 by a panel of experts and

= 0.54 by general users). The above
= 3.93,
= 3.88,
and
values are higher than the criterion level, meaning this

special problem was successful. In conclusion, this
developed system can be used in a real word scenario
effectively and efficiently.
Keywords: Borrowing-Returning, RFID Technology,
Notification.
1.

[1]

[2]
RFID (Radio Frequency Identification)
RFID
(RFID Tag)
Abstract
The objectives of this research are to develop a
monitoring and tracking system for handheld devices in
the work place using RFID technology and a web
application. Then evaluate the quality levels and
satisfaction levels towards the system from experts and
users. The database support system was developed using
the PHP programming language and MySQL. This
system will provide the ability to enhance management
performance and data monitoring via a notification
system with SMS and E-Mail channels. The results from
this study discovered that quality levels and satisfaction
450
NCCIT2015
2.1.2* (Reader)
-

[4]
2.2*
RFID
ISM
(Industrial-Scientific-Medical)

2.2.1* (Low Frequency, LF)
125 kHz 134 kHz
10

2.2.2* (High Frequency, HF)
HF 13.56 MHz

Contactless Smart Card
Smart Label RFID

1

2.2.3* (Ultra high frequency,
UHF) RFID 866-915 MHz
3-7
Supply Chain Management, Logistics
Electronic Product Code

RFID

RFID
RFID

RFID
RFID

[1]
2.
2.1* (RFID Technology)
(RFID Technology)

2
RFID

RS-232 RS-485
[1]
2.1.1* (Tag)

[3] 2
-
451
NCCIT2015
3.
EPC Global RFID

Supply Chain Management
RFID
RFID
EPC
2.2.4* (Microwave) RFID

2.45 GHz
10

(Backscatter)

RFID

2.45
GHz Wireless
Lan Bluetooth
RFID [5]
2.3* (Web Application)
Web Application
Rendering Engine

Rendering Engine

Web Application

HTTP/HTTPS
HTTP

Script Engine PHP
.NET Framework [6]

(SDLC : System Development Life Cycle)
3.1*

-

-

-

1
1: -
3.2*
452
NCCIT2015

E-Mail SMS 4
Start
Login to web application.
Scan device (RFID Tag).
Borrow device.
Borrow device
over time?
2:
No
Yes
Send Email & SMS notifications
to user and admin.
(Context
Diagram) 3
Return device.
Stop
Admin
Email & SMS notifications for tracking

Email & SMS notifications for monitoring
Username & Password
Authorization to access
Borrow data
Return data
Add/update/delete/search users
Add/update/delete/search devices
Borrow
RFID
Search users
Search devices
0
4: Flowchart -
User
Email & SMS notifications for tracking
3.3.2*

RFID Tag RFID
E-Mail
SMS 5
Development of Monitoring and

Tracking System
Email & SMS notifications for monitoring
Borrow
Return
Return
Search reports
Reports
Manager
3: Context Diagram
Start
3.3*

2
3.3.1*
-
RFID -
Standby for the web application.
Device is out of
area?
No
Yes
Send Email & SMS notifications
to manager and admin.
Stop
5: Flowchart
453
3.4*
NCCIT2015
4.1.2* -
(Borrow/Return Reports)
-
Export Excel 7

5

2
5 5

7: -
4.
4.1*
4.1.1* (Devices)

6
4.2*

3.93
0.53
1
1:

1.
2.
3.
4.
5.
3.73
3.83
4.08
4.08
3.93
3.93
0.52
0.53
0.57
0.49
0.46
0.53
4.3*
3.88

0.54
2
6:
454
2:
1.
2.
3.
4.
5.
5.2.2* E-mail
SMTP
E-mail
5.2.3*

RFID
RFID Gate
5.2.4*

3.80
3.77
3.92
3.96
3.93
3.88
0.61
0.57
0.49
0.54
0.46
0.54
NCCIT2015
5.
[1]
5.1*
5.1.1*

5.1.2*

5.1.3*

5.1.4*

5.1.5*

5.2*
5.2.1*
Browser
[2]
[3]
[4]
[5]
[6]
.

RFID :

, 2554.
, .
RFID

, ...
.

,
2551.
.

, 2550.
. -
RFID

. 2552.
. ( Web
Application) [ ]. [ 25
2557]. http://aicomputer.co.th/sArticle/002-what-isWeb-Application.aspx
455
NCCIT2015

Knowledge Management System of Internal Organization Information System
using Case-Based Reasoning
(Linda Sobin)1 (Maleerat Sodanil)2
1
2

1
somja015@gmail.com, 2msn@kmutnb.ac.th
Abstract

(Case-Based Reasoning)

Cosine
Similarity

5 10
4.10
0.51
4.41 0.20

(Competitive Advantage)
:

Nowadays knowledge sharing developments are the

main interest in the office, using knowledge as a sharing
media. The system collected all the scattered knowledge
from individual and documents, so that all the employees
could access to the providing knowledge and improve
themselves to be experts. This paper aimed to develop a
knowledge management system for the organization
internal information system, by using Case-Based
Reasoning technique to help support problem storing and
solving technique. A Similarity of new case and case
based technique is that the measurement is done by using
cosine similarity technique. The performance evaluation
is measured by using the questionnaires with experts and
users. The result shows 4.10 average (S.D. 0.51) and 4.41
average (S.D. 0.20) respectively, which could be
concluded that the system satisfaction was in a good
level.
In summary, the developed system can be deployed in
the organization for use, in order to gather all the
knowledge inside the organization and make use of them
to achieve competitive advantage over the business
rivals.
Keywords: Knowledge Management, Case-Based
Reasoning, Cosine Similarity.
456
1.
NCCIT2015

[2]
2
2.1.1* (Tacit Knowledge)

2.1.2* (Explicit Knowledge)

2.2

[3]
1

[1]
2.
2.1
(Knowledge Management: KM)

1:
457
NCCIT2015

Query
Search Engine
Query

Query
(Cosine Similarity)
2
(Vector Space)
0-1
2

2

+ Query [4] 1
2.2.1* (Case Representation)

Case indexing
2.2.2* (Case Retrieval)

2.2.3* (Case Adaptation)

Adaptation
)**
2.2.2
)** Feature

)**

2.2.4* (Case Maintenance)

(Ranking)

2.3 (Cosine Similarity)

(1)
Similarity -1 1

A
B /
A B Dot product A B
||A|| A
||B|| B
Ai
Bi /

n
/
458
2.4
[5] Case-Based Reasoning

Case-Based
Reasoning
Normalized Frequencies Weight
Similarity
Similarity
Index Term

Query
Term
Index Term

Similarity [6]

PHP
MySQL
NCCIT2015
Import

(JTDA)

Knowledge

Base
ICU4NET
Cosine
similarity
2:
3.
3.1

Library ICU4NET [7]

Similarity Similarity
2
(JTDA)

/ //

3.2 (Context Diagram)

3

/ //
/

0
Download

Link

Link/Download

/ //
/
3: (Context Diagram)

459
3.3

Recall

1
0
2
Recall =
NCCIT2015

Similarity

Similarity 5
(2)
Precision

Precision 1
Precision 0
3
Precision =

5:
(3)

, ,
, ,
(Solution) 6
4.

Search, Basic Information, Users JTDA, Employee, Solution
Data (JTDA), Download, Link Web Board 4
4:
6:
460
4.10 ( 0.51)
10
4.41 ( 0.20)

5
Precision

Precision 5
0.64

Recall

Recall 5
0.98

1
[1]
1: Precision, Recall
1
2
Call center
3
4
5
6
14
Precision
Recall
0.34
1.00
1.00
1.00
0.29
1.00
13
0.57
0.92
1.00
0.64
1.00
0.98
NCCIT2015
[2]
[3]
... .
. 2549.* 1
2557 http://www.opdc.go.th/oldweb/thai/
frame_kpi_49/handbook_2549.doc
**,*** ***
.** .*
.** 18 2.*(- 2550)*:*79.
Pal, K. and Shiu, C.K.**Foundations of Soft Case-Based
Reasoning.**United Stated of America : A John Wiley &
Sons, Inc.*2004.
[4]
[5]
5.

2
5
[6]
[7]
461
Wikipedia The Free Encyclopedia.**Cosine Similarity.**

15 2557
http://en.wikipedia.org/wiki/Cosine_similarity
** .** Case-Based Reasoning
.**

.*2549.
**.**
.**

.*2554.
Life On VM.** C#.** 15
2557 http://lifeonvm.nkuln.com/?p=26
NCCIT2015

Conceptual Framework Adaptive Learning using Web-based Instruction
for Working Memory with Learning Disabilities
(Siwaporn Klabpadung)1 (Watcharawalee Tangkuptanon)2

1
siwaporn.kla@gmail.com, 2watcharawalee.t@psu.ac.th

(Learning Disabilities
: LD)

(WBI)
(Adaptive Learning)

(Learning Disability Media)
(Working Memory)

( = 4.66,
0.08)

:

Abstract
Children with Learning Disabilities of various levels
can study with intellectually normal children in the same
age group. This group has a process to recognize and
interpret data. Children with Learning Disabilities have
trouble remembering the process. The ability for each
child to learn is different. This research aims to propose a
conceptual framework for adaptive learning, using Webbased Instruction to improve memory in children with
learning disabilities. This framework consists of the
synthesized, Web-based Instruction Module, Adaptive
Learning Module, Learning Disability Media and
Working Memory. Each module should be applied in the
development of Digital learning content for Working
Memory with Learning Disabilities. The result of this
assessment
were
expert
opinion
this
conceptual
Framework was higher level (Mean = 4.66, SD. = 0.08).

In conclusion, that can be used the synthesized framework
properly.
Keywords: Learning Disabilities, Adaptive Learning,
Web-based Instruction, Working Memory.
1.
(Learning Disabilities :
LD)

462

[1-2]

13

[3]

(Individualized Education Program : IEP)

IEP

[2]

[4]
(Adaptive Learning)

NCCIT2015

[5]
IEP

[6]

[7]

2.
1.

2.

3.
3.1
3.1.1 (Learning
Disabilities : LD)
463

[1]
2
.4

.1 .3 [2]

1)
2) 3)
4)
5) 6)
7) 8)
9) 10)
[1]
1)
(Attention) 2)
(Interested) 3)
(Desire) 4) (Active)
[1]

(Font)
(Speech)
3.1.2 (Adaptive Learning)

3 1) (Student Model) 2)
(Domain Model) 3) (Adaptive
Model) [8]
Adaptive Learning 2 [5]
NCCIT2015
1) Personalization

2) Customization

1) (Couse)
2) (Curriculum Sequencing)
3)
(Adaptive Navigation Support)
4)
(Intelligent Analysis of Student Solutions)
5)
(Interactive Problem Solving Support)
6) (Example-base
Problem Solving)
3.1.3 (Memory)

[8]

[9]
1) (Organization)

2) (Rehearsal)

3) (Over-learning)

4) (Mind Map)

5) (Cue)

464
6)
(Link to Learn)

7) (Law of Practice)

3.1.4 (Web-based Instruction)

[10]
1) (Presentation Media)

2) (Interactivity)

3) (Database Management)

4) (Couse Support)

3

3.2
3 .2 .1 Principles Underlying the Design of "The Number
Race", an Adaptive Computer Game for Remediation of
Dyscalculia [11]
NCCIT2015
3.2.2 [12]

(Web Application)
3
3

4.
1.

2.

,

3.
(1)
(2)

465
NCCIT2015
4.
5. /

1

2:

5.1.1 (Web-based Instruction)

5.1.2 (Adaptive Learning)

1:
3
1) (Student Model)
5.

2

5.1
2) (Domain Model)

/
2

(1) Couse
(2) Curriculum
Sequencing
(3) Adaptive Navigation Support
Link
(4) Intelligent Analysis of Student Solutions

3+2
4
35
466
6 (5) Interactive Problem Solving Support

(Help)

(6) Example-base Problem
Solving

3) (Adaptive Model)

(Student Model) (Domain
Model) (1)

(2)

(3)
(4) (5)

(6)

5.1.3
(Learning Disability Media)

(1) Attention

(2) Interested
(3) Desire

(4) Active (5) Font

NCCIT2015
(6) Speech
(7) Reinforcement

5.1.4 (Working Memory)

(1) Organization

(2) Rehearsal
(3) Over-Learning
(4) Mind Map
(5) Cue
(6) Link to Learn

(7) Law of Practice

5.2

4

1

(x = 4.66,
S.D. = 0.08)

467
1:
S.D.
4.31 0.02
1.
2. 4.72 0.13
3.
4.89 0.21
4.71 0.02
4.
4.66 0.08
6.

[12]

HTML5
CSS 3 Action Script 3 PHP

2

NCCIT2015
[3] (.),
(2556, .. 30), LD :
, [], :
http://www.qlf.or.th/Home/Contents/530.
[4]
,

,

, , 2551.
[5] , (2557, .. 27), Adaptive Learning
Environments e -Learning , [],
: http://www.msitmonline.com/media/Adaptive Learning
Environments.pdf.
[6] ,
,
: , 2543.
[7] ,
,
3 1 .. .. 2551 84-97.
[8] ,

, . 27 92 2557 23-31.
[9] , ,
: . 2556.
[10] . "WBI (Web-based Instruction) WBT (Webbased Trainning)." . 13 37 2554 72-78.
[ 11]
Anna J Wilson, Stanislas Dehaene, Philippe Pinel,
Susannah K Revkin and Laurent Cohen, David Cohen.

Principles Underlying The Design of "The Number Race", an
Adaptive Computer Game for Remediation of Dyscalculia.
7.
[1] , ,

. :, 2554
[2]

, ,

:
, 2551.
Behavioral and Brain Functions. Vol. 2, No. 19, May 2006.

[12] . " ."

, , 2553.
468
NCCIT2015

Apply Online-Based Learning Media to Enhance Learning Achievement in
English for Computer Science Subject of
Kanchanaburi Rajabhat University Students
(Nilubon Tongchai)
1

nilubon.tongchai@kru.ac.th
http://elearningcoit.kru.ac.th. There are 2 1 participants

who attend for a whole process.

2 1 ( = 66.51,
S.D. =18.26) ( = 33.21,
S.D. = 14.14) 33.30
0.01
(r = 0.911, sig. = .000)

:

The result shows that students can achieve average
( = 66.51, S.D. =1 8 .2 6 ) higher than

pre-test score ( = 3 3 .2 1 , S.D. = 1 4 .1 4 ) at 3 3 . 3 0
post-test score
(sig. 0.01).
Moreover the correlation between the post-test score
and the total score for a whole semester is highly
significant (r = 0.911, sig. = .000) which means that both
score related to each other. In addition the questionnaire
results shows that students agree on every question items
at the Much level. This can be inferred that developed
multimedia contents which provided on the online-based
learning environment increase the opportunity for
learners to choose to do whenever, wherever, and
whatever they want to learn in order to enhance their
learning achievement.
Keyword: Multimedia, Online-learning media, learning
achievement, English for computer, Learning tools,
Online-learning
1.
1.1
Abstract

. . 2542 22

This research aimed to develop online learning

multimedia in order to enhance learning achievement of
students in English for Computer Science subject. The
way of teaching and learning is blended from both
classroom-based and online-based learning via website
469
NCCIT2015
24

[1]

(ICT)

(Web Based Instruction: WBI)
( Computer Assisted
Instruction: CAI)
(e-Learning)

2.

1) 2)
3)
2.1

[2, 3]
2.2

[4]

[5]

[6]

470

( Synchronous Interaction)
NCCIT2015

8

1/2556
3.2
1.4.1

1/2556 2/2556
1.4.2

1 .4 .3
http://elearningcoit.kru.ac.th

1.4.4

3.3

1/2556 21
3.4

3.4.1

(Asynchronous Interaction) [7]

[8, 9]

2.3
Learning Management System: LMS

(Courseware)

[10]

(Moodle)
3.

3.1


471
NCCIT2015

[11]
3.4.2
120

3.4.3
5

(LMS)
3.5
2
3.5.1

Paired-sample T-test
3.5.2
LMS

1:
4.
4.1

http://elearningcoit.kru.ac.th ( 13 )

2:
3:
4.2
472
NCCIT2015

Facebook

4.2.1
(x = 66.51, S.D. =18.26)
(x = 33.21, S.D. = 14.14)

33.30
5.

33.30
0.01

[9, 12-14]

(r)

0.911 (sig. .000)
.001

[9] [13] [14]

0.01
4.2.2

69.95 66.51
(r)

0.911
(sig. .000)
.001
4.3

LMS

( x = 4.32, S.D. = 0.64)

(x = 4.13, S.D. = 0.84)

473
[9]

1.

1.

2.

3.

NCCIT2015
[4] Doherty, A.,The Internet: Destired to Become a Passive

Surfing Technology?,Educational Technology, vol.38
no.5, pp. 61-63, 1998.
[5] ,

.
, 2543. ()
[6] ,
. :
, 2548.
[7] , Definition of Web-Based
Instruction.
. 12 34 2543
53-56.
[8] ,
. ,
, 2553.
[9] Tongchai, N., Impact of Self-Regulation and Open Learner
Model on Learning Achievement in Blended Learning
Environment, 3rd International Conference on Information
and Education Technology (ICIET 2015), Bali, Indonesia,
Jan 5-6, 2015.
, .

, 2548.
[11] ,

. ,
, 2556.
[10]
[12] Oden,R.E., An Assessment of the Effectiveness of Computer

Assisted Instruction on Altering Teacher Behavior and the
Achievement and Attitude of Ninth Grade Per-Algerbra

Mathematics Student. Dissertation, August 1998.
,
. :
, 2544.
[2] , . : ,
2548.
[3] , . :

, 2528.
[1]
[13] .

Moodle. ,
, 2550.
[14] .
. .., :

, 2544.
474
NCCIT2015

Development of the Management System and Support
the Students Project in General Education Courses
(Patcharida Wisaiket)1 (Maleerat Sodanil)2
1
2

1
patcharida13@gmail.com, 2msn@kmunb.ac.th
submission, record and report students score, making an

appointment to the lecturer, and also helping the

5 ( x )
4.54 (S.D.) 0.53

:

executive by issuing the statistical reports of teaching of

General Education courses. The system has developed by
linking the central database of each agencies for more
convenient to manage the data information together.
Moreover, the application of Barcode Technology has
implemented in manage the database of student for
increase the accuracy and decrease the errors and
processing time in the evaluation of students who
enrolled in General Education courses. The performance
results in terms of user satisfaction using statistic are
average and standard deviation which evaluated by
experts and users given as very good satisfaction with
4.54 and 0.5 for average and s.d.srespectively and can be
applied in the future.
Keywords: Learning Management System, Barcode,
Project Based Learning.
1.

[1]
10,000-30,000
60

Abstract
A development of the management system and support the
students project in General Education Courses aims to
support the teaching and learning process in General
Education courses (large group) by using learning
process management on project based learning for
475
NCCIT2015

3

1/2555

[5]
2556

30

[6]

Client-Server,
HTML, PHP, Database, Flash & Flex Barcode

[7]

[8]
(e-Learning)

[2]

2.

[3]

[4]
476
(Barcode)

[9]

[10]

1
NCCIT2015
3.
3.1

2

( 1)

( 2)
One-stop service

1:
1

2:
477
3.2x
(Context Diagram Level 0)
3

-
-
-
-
- -
-
-
-
-
-
-
3.4x

4.

-
-
-
-
-
NCCIT2015

5
4.1*

(Login)

4
-
-
-
-
3:
3
4

3.3
PHP, HTML, Database
4:
5:
478
NCCIT2015
8:

9
6:

7
7:

9:
4.2
5
4 (Functional
Requirement Test)
(Functional Test)
479
(Usability Test) (Security
Test)
[1]
1.
2.
3.
4.

x
4.62
4.62
4.40
4.40
4.54
S.D
0.52
0.52
0.56
0.53
0.53
.
2555. 2
2557 http://gen-ed.ssru.ac.th/
[2] .
Zero Defect. 2556.
5 2557 http://www.km.ssru.ac.th/
[3] .
. :
,[2549].
[4] .

. :
,[2550].
[5] .
.

, 2555.
[6] .

.

, 2556.
[7] .
.

, 2554.
[8] .

:
,[2554].
[9] .
.

,[2553].
[10] .
. :
, [2556].
4 1
1:
NCCIT2015
1

4.62 0.52

4.62
0.52
4.40
0.56

4.40
0.53
( x ) 4.54
(S.D.) 0.53
5.

(Smart phone)
(Tablet)
480
NCCIT2015

Design guidelines for creating content on web sites for
elderly users
(Nathakarn Boonrod) (Thippaya Chintakovid)

nathakarn.b@gmail.com, thippaya.c@it.kmutnb.ac.th
and were more satisfied with the developed site than an

existing social network site.

30

:

Keywords: elderly, elderly users, creating content, social

network, design guidelines
1.

2557
7.2 /
2557 2556
4.6

20.5 /
2556 29.6 / 2557 [1]

(25-60 )

[2]

Abstract
Online social network is a network used for
communicating, sharing photos and information among
friends and family. It plays more important role in our
daily life. However, the existing social networks have not
been designed to support elderly users. Therefore, this
paper presents design guidelines for creating content on
web sites for the elderly user. Web or application
designers can use these design guidelines in developing
an online social network site that is suitable for the
elderly. The evaluation of difficulty in learning and
satisfaction from a sample of 30 people found that the
senior could learn to use the developed site more easily
481

[3], [4]

[5]

NCCIT2015
Sun Zhao [12]

W3C
4

38
11

[13], [14], [15]

[3],
[4]
[4]

(mobile website)
2.

[6], [7], [8], [9]

National Institute on Aging
and National Library of Medicine (NIA/NLM) [10]

Hart [11]

482
NCCIT2015
PHP
JavaScript MySQL
CSS
3.
3.1
3.1.1
3-1
3-1:

[10], [11],

- san serif
12-14
/
-
[12], [13], [14],
3-1:
[15],
-

-
[10], [11], [13],
[14], [15], [16], - pull-down
-

-

-

[10], [13], [14], -
[15],
3-2:
3.2
60

(power) (effect size)
(significance level)
0.8
0.5 .05 27
5

(www.ageing-society.com)

3.1.2

4.2
3.1.3 3.1.1 3.1.2
3-1
3-2
483
NCCIT2015
5 1 () 5 ()

5 1 () 5 ()
4.
4-3:
4.2
4-1
4-1:
4.1

4-1

4-2

4-3
-

-

-

-

9.7 4

-

-
-

1
4
-

9.7 9
3 3
-
4-1:
4-2:
484
4.3

13 (43.3%) 17
(56.7%) 60-64 15 (50%) 65-69
9 (30%) 70-74 6 (20%)

7-9 10
19 (63.3%)

6 (20%) 1 / 2 (6.7%) 2-3
/ 17 (56.7%) 5
(16.7%) / 17 (56.7%)
5 (16.7%)

2

paired sample t-test

0.05, t(29) = -9.798, p = .000

0.05, t(29) =
11.619, p = .000 4-2
4-2:

NCCIT2015
5.

(mobile application)

.. 2557 ( 2)
[1]

,
2557 ( )
2 2558 https://www.etda.or.th/documents-for-
download.html
[2] A. Arch, S. Abou-Zahra and S. L. Henry, Older Users
Online: WAI Guidelines Address Older Users Web
Experience, [Online] Retrieved on 3 July 2013 from

3.30

4.40
4.20
3.65
http://www.w3.org/WAI/posts/2009/older-users-online
[3]
J. Waycott et al, Older Adults as Digital Content

Producers, Proceedings of the SIGCHI Conference on
Human Factors in Computing Systems (CHI13), Paris,
France, April 27- May 2, 2013, pp.39-48.
[4]
G. Gomes et al, Designing a Facebook Interface for

Senior Users, The Scientific World Journal, Vol. 2014,
2014.
485
[5]
[6]

,
2556 ( )
2 2558 https://www.etda.or.th/documents-for-
[14] P. Zaphiris, M. Ghiawadwala, and S. Mughal, AgeCentered Research-Based Web Design Guidelines,
Proceedings of Conference on Human Factors in
Computing Systems (CHI05), Portland, Oregon USA,
April 2-7, 2005, pp.1897-1900.
download.html
M. Ilyas, A Study of Web Accessibility Barriers for
[15] P. Zaphiris, S. Kurniawan and M. Ghiawadwala, A
Older Adults, and Heuristics Evaluation of Email
Systematic Approach to the Development of Research-
Websites Based on Web Accessibility Heuristics for
Based Web Design Guidelines for Older People,
Older Adults by AARP, Journal of Emerging Trends in
Universal Access in the Information Society, Vol. 6, No.1,
Computing and Information Sciences, Vol. 3, No.5, pp.
pp. 59-75, 2007.
806-813, 2012.
[7]
[8]
[16] E. Patsoule and P. Koutsabasis, Redesigning Web Sites
A. Arch, Web Accessibility for Older Users: Successes
for Older Adults, Proceedings of the 5th International
and Opportunities, Proceedings of the 2009 International
Conference on PErvasive Technologies Related to
Cross-Disciplinary Conference on Web Accessibility
Assistive Environments (PETRA 2012), Heraklion, Crete,
(W4A09), Madrid, Spain, April 20-21, 2009, pp.1-6.
Greece, June 6-9, 2012, pp.1-8.
V. L. Hanson, Age and Web Access: The Next

Generation, Proceedings of the 2009 International
Cross-Disciplinary Conference on Web Accessibility
(W4A09), Madrid, Spain, April 20-21, 2009, pp.7-15.
[9]
NCCIT2015
S. Sayago and J. Blat, About the Relevance of

Accessibility Barriers in the Everyday Interactions of
Older People with the Web, Proceedings of the 2009
International Cross-Disciplinary Conference on Web
Accessibility (W4A09), Madrid, Spain, April 20-21, 2009,
pp.104-113.
[10] National Institute on Aging and National Library of

Medicine, Making Your Web Site Senior-Friendly,
[Online]
Retrieved
on
17August
2013
from
http://www.nia.nih.gov/health/publication/making-yourwebsite-senior-friendly
[11] T. A. Hart, B. S. Chaparro, and C. G. Halcomb,
Evaluating Websites for Older Adults: Adherence to
Senior-Friendly
Guidelines
and
End-User
Performance, Behaviour & Information Technology, Vol.

27, No.3, pp.191-199, 2008.
[12] Z. Sun and Y. Zhao, The Preliminary Construction of
Accessibility Design Guidelines of Learning Website for
Old People, 2010 Second International Workshop on
Education Technology and Computer Science (ETCS),
Wuhan, China, March 6- 7, 2010, pp.612-615.
[13] S. Kurniawan and P. Zaphiris, Research-Derived Web
Design Guidelines for Older People, Proceedings of the
7th International ACM SIGACCESS Conference on
Computers and Accessibility, Baltimore, Maryland, USA,
October 9- 12, 2009, pp.129-135.
486
NCCIT2015

CCTV Image Enhancement using Sub-Image Homomorphic Filtering
(Chalermpong Intarat)1 (Maleerat Sodanil)2

zoo_perk@hotmail.com, maleerat.s@it.kmutnb.ac.th
1.

(Sub-Image Homomorphic
Filtering Technique)
1,280 720 RGB24 .jpg
Indoor
Outdoor .avi

PSNR

:

(Video Surveillance
System)

(Monitor)

(Image Enhancement)

(Sub-Image Homomorphic Filtering Technique)
2

Abstract
This research aims to propose the image enhancement
method
using
sub-images
homomorphic
filtering
technique. The experiments were conducted using images

with 1,280 720 pixel from both indoor and outdoor
surveillance video system. Type of images (.jpg) is
RGB24 form first frames surveillance video file (avi.).
The results showed that the proposed method using subimages homomorphic filtering technique can be used to
improve the quality of images from surveillance video
system in terms of PSNR.
Keywords: CCTV, Image Enhancement, Homomorphic
Filtering, Gaussian High-Pass Filter.
487
2.
2.3 Homomorphic Filtering
[5]

5
1
1:* (Logarithm) 2 Z(x.y)
I(x,y) R(x,y) (2)
2.1
Ahmad et al. [1]

(Indoor and Outdoor
Monitoring)

Hibell [2]

(Image Enhancement)
Z(x,y) = lnI(x,y) + lnR(x,y)
(2)
2 :* (Fourier Transform)
(3)
Z(u,v) = FFTi(u,v) + FFTr(u,v)
(3)
FFTi(u,v) FFTr(u,v)
lnI(x,y) lnR(x,y)
3 :* High Pass Z(u,v)
H(u,v) S(u,v)
(4)
2.2 Illumination Reflectance Model
Pang et al. [3] Illumination Reflectance Model 2

(x,y)
F(x,y)

(Frequency Domain
Procedure)
F(x,y) Product of Illumination
Reflectance Components Ein-shoka et
al. [4] Illumination

I(x,y) Reflectance
R(x,y) (1)
S(u,v) = H(u,v)Z(u,v)
= H(u,v)FFTi(u,v)+H(u,v)FFTr(u,v)
(4)
4:* (Inverse Fourier

Transform)
S(x,y) (5)
S(x,y) = IFFT{S(u,v)}
= IFFT{H(u,v)FFTi(u,v) + H(u,v)FFTr(u,v)} (5)
5 :*
(Exponential) G(x,y) (6)
G(x,y) = EXP{S(x,y)}
F(x,y) = I(x,y).R(x,y)
NCCIT2015
(1)
488
(6)
NCCIT2015
2.4 Gaussian High Pass Filter
H(u,v)
Y. B. Yuan et al. [6]
(Gaussian High-Pass Filter)

2 (7)

5
2
1 . (CCTV Image) RGB24
.jpg 1,280 720

(NE)
3 ()
2. (Image Enhancement)

(Gaussian High-Pass Filter)
D0 = 0.25 (HM)
3 ()
(Split)

(Gaussian High-Pass Filter) D0 = 0.25
2 Merge
(HMV)
3 ()
(Split)

(Gaussian High-Pass Filter) D0 = 0.25
2 Merge

(HMH) 3 ()
D(u,v)
3.
= D0
2.5 Sub-Image Homomorphic Filtering Technique

Delac et al. [7]

2

IHMV(x,y)

IHMH(x,y)

IHMMOD(x,y)
(8)
1:
489
NCCIT2015
2:
(HMMOD)
(Enhanced CCTV
Image) 3 ()
5.
(HMV)
(HMH) Combination

490
NCCIT2015
3:
()
()

(NE)
NE, Original
HMMOD, PSNR = 22.0416
()
()
(HM)
NE, Original
()
()
(HMV)
NE, Original
()
()
(HMH)
NE, Original
()
()
(HMMOD)
NE, Original
4.

Peak Signal to Noise Ratio (PSNR)

(9)
4:
()
NE, Original
()
NE, Original
()
NE, Original
491

(Decibel, dB)
MSE
PEAK 255
RGB 0-255
PSNR
NCCIT2015
4
PSNR 1
[1]
I. Ahmad, Z. He, et al., Special Issue on Video

Surveillance, IEEE Transactions on Circuits and
Systems for Video Technology, Vol. 18, No. 8, pp. 1001-
1: PSNR 4
()
()
()
()
()
()
()
()
Mean
1005, Aug, 2008.
HM
HMV
HMH
30.3695
30.2331
30.3146
22.5480
Collaboration with Portsmouth City Council CCTV,
28.0914
28.0969
28.1156
21.3998
University of Portsmouth, 2006.
35.4715
36.5158
34.7491
26.6442
29.7488
29.0231
29.6261
22.0416
26.7061
27.5682
26.6585
20.0581
26.8723
27.6409
27.6841
21.5540
38.4321
37.5847
37.3839
29.3992
36.4378
36.3285
35.3470
28.1057
31.5162
31.6239
31.2349
23.9688
HMMOD
[2]
[3]
L. Hibell, Surveillance Video Image Enhancement in
B. Pang, X. Sun, et al., Beef Marbling Image

Segmentation Based on Homomorphic Filtering, Journal
of Multimedia, Vol. 9, No. 2, Feb, 2014.
[4]
A. Ein-shoka, H. Kelash, et al., Enhancement of IR

Images using Homomorphic Filtering in Fast Discrete
Curvelet Transform (FDCT), International Journal of
Computer Applications (0975 - 8887), Vol. 96, No. 8,
June, 2014.
[5]
1 PSNR

(HMMOD) PSNR
1 4 () PSNR*=*29.3992 2
4 () PSNR*=*28.1057 3 4
() PSNR*=*26.6442
[6]
, ,
, , 2556.
Y. B. Yuan, W. Y. Piao and J. B. Xu, A Fast Gaussian
Filter
Algorithm
for
Three-Dimensional
Surface
Roughness Measurements, International Symposium on

Instrumentation Science and Technology, Journal of
Physics: Conference Series, 48, 1401-61, 2006.
[7]
K.
Delac,
M.
Grgic,
and
T.
Kos,
Sub-Image
Homomorphic Filtering Technique for Improving Facial

Identification under Difficult Illumination Conditions,
5.
International Conference on Systems, Signals and Image

Processing (IWSSIP06), Sep 21-23, 2006.

2

(HMMOD)

PSNR

[8]
P. H. Yawalkar and P. N. Pusdekar, A Review on Low

Light Video Enhancement Using Image Processing
Technique, International Journal of Advanced Research
in Computer and Communication Engineering, Vol. 4,
Issue 1, Jan, 2015.
492
NCCIT2015

An Algorithm for Hymocytometer Cell Counting based on
Image Processing Technique and DBSCAN
(Dechawut Wanichsan)1 (Nitat Ninchawee)2
(Taweesak Rattanakom)3 (Phannika Kongjuk)4
1
2 3

4

1
dechawut.w@rbru.ac.th, 2nitat_nin@hotmail.com, 3hs2wjo@hotmail.com, 4phannikaecon@gmail.com
traditional method, which is counting by human, to those

of cell counting using the proposed technique. The
promising results revealed that using the method provided

slightly different results comparing with counting by
human.
Keywords: Hymocytometer, DBSCAN, Density-based
Clustering, Digital Image Processing.
1.

[1]

Abstract
The main objective of this research was to apply image
processing technique together with DBSCAN, which is
density-based clustering algorithm, so as to increase
efficiency of hymocytometer cell counting using a
computer. Conventionally, cell counting in laboratory
could be done by human who counts the number of
clusters. Due to human limitations, it was not easy to
durably work with no mistakes. This work designed
experiment with comparing results of cell counting using
493

(DNA)
(Bioinformatics) (Colony)

400x
4,000 [2]
(DBSCAN)

NCCIT2015
11 0.250.25 0.250.20
0.200.20

1:
2.2
(DBSCAN: Density-based Spatial Clustering of
Applications with Noise)
1996 Martin Ester Hans-Peter
Kriegel, Jrg Sander Xiaowei Xu [4]
(Data Mining)
(SIG KDD) 2014
[5]

(k-mean Clustering
Algorithm)
eps
(Minpoint) minpts
2 A B
C D E
A (Core Point)
minpts 3
A
2.
2.1
[3] Louis-Charles Malassez

(Blood Cells)

(Chamber)
1
40

0.1

494
3.

(Neighbor Point)
A C D E
1
(Pseudo code)
expandCluster() regionQuery()

1
2
dist(, ) = (1 1 )2 + + ( )2
3.1

(Plankton)
100x 100 25
25
3
(1)
a = (a1, a2, a3, , am) b =

(b1, b2, b3, , bn) a b m n
C
B
NCCIT2015
0.2 mm
E
D
0.2 mm
2:
3: 100
1:
Algorithm:DBSCAN(D,eps,MinPts)
C = 0
FOR each unvisited point P in dataset D
mark P as visited
NbrPts = regionQuery(P,eps)
IF sizeof(NbrPts) < MinPts
mark P as NOISE
ELSE
C = next cluster
expandCluster(P,NbrPts,C,eps,MinPts)
END IF
END FOR
3 (Plankton)

(Colony)

1 5 13 21 25 ( )

0.2

25

//increase number of points in same cluster

FUNCTION expandCluster(P,NbrPts,C,eps,MinPts)
add P to cluster C
FOR each point P' in NbrPts
IF P' is not visited
mark P' as visited
NbrPts'=regionQuery(P',eps)
IF sizeof(NbrPts') >= MinPts
NbrPts= NbrPts joined with NbrPts'
IF P' is not yet member of any cluster
add P' to cluster C
END IF
END IF
END IF
END FOR
//find neighbor points of P
FUNCTIONregionQuery(P,eps)
return all points within P's eps-distance
495

(Record)
(Attribute)
x y
(pixel) 6 intensity
4

2
density =
1
106
(2)
nColony
nGrid
1 5 13 21 25

[6]
3.2

4

100x (RGB)

3.1 (Input
Data) 5
(Grey Scale Image)
(Image Binarization) (
) ( )
6
RGB
3 4
= 0.299 + 0.587 +
0.114
128
1
=
0
< 128
NCCIT2015
4:
(3)
(4)
3

(Lightness)

(Y)
(YUV Color Space) [7]
5:
496

(4,3) (5,2)
(4 5)2+(3 2)2
1.414
eps = 1.415 (4,3)

minpts
4

(4,3)

(4,3)

(Colony)

6:

minpts eps
eps 2
1.415
1
1 7
(1,1)
(2,1)
(3,1)
(4,1)
(5,1)
(6,1)
(1,2)
(2,2)
(3,2)
(4,2)
(5,2)
(6,2)
(1,3)
(2,3)
(3,3)
(4,3)
(5,3)
(6,3)
(1,4)
(2,4)
(3,4)
(4,4)
(5,4)
(6,4)
(1,5)
(2,5)
(3,5)
(4,5)
(5,5)
(6,5)
NCCIT2015
4.

2

3
3
7:
7
(2,4) (3,3) (3,4) (4,3) (4,4) (5,2)

(3,3) (4,3) (3 4)2+(3 3)2
1
(Neighbor Point)
(Core Point) eps

2:
(0.25 0.25 )
1
4
6
15
25
497
4
1
1
1
1
3:
6-7
NCCIT2015
31
31
50
51
129
128
204-210
206
[1] R. G. Haaker, M. Stockheim, M. Kamp, et.al, "Computer-assisted

navigation increases precision of component placement in total knee
arthroplasty", Clinical Orthopaedics and Related Research. vol. 433 .
pp.152-9, 2005.
[2] Microscope.in.th. " ". Internet:
http://www.microscope.in.th/product/mda1300. [Mar. 29, 2015].
[3] Y. Xie, Y. Yang2, X. Kang, et.al, "Bioassembly of three-dimensional
embryonic stem cell-scaffold complexes using compressed gases",
Biotechnology Progress. vol.25, no.2, pp.535-542, 2004.
[4] T. N. Trana, K. Drabb, M. Daszykowskib, "Revised DBSCAN
algorithm to cluster data with dense adjacent clusters", Chemometrics
and Intelligent Laboratory Systems. vol.120, pp.92-96, 2013.
[5] SIGKDD, "2014 SIGKDD Test of Time Award". Internet:
http://www.kdd.org/blog/2014-sigkdd-test-time-award.[Feb.
14, 2015].
[6] T. L. Hoffman, Cell Biology, A Laboratory Handbook. Elsevier
Academic Press: San Diego, 2006.
[7] V. Santhi, A. Thangavelu, DWT-SVD Combined Full Band
Robust Watermarking Technique for Color Images in YUV
Color Space, International Journal of Computer Theory and
Engineering, vol. 1, no. 4, pp. 424-429, 2009.
5.
498
NCCIT2015

Interactive Media Design for Encourage Garbage Management
on Android Operating System of Early Childhood
(Julaluk Watthananon)

watthananon@hotmail.com
sample of this research consisted of 50 pre-school children

in kindergarten 1 from La-orutis Demonstration School

1 2
.
50 25 25
1)

2)
3)

0.05

(X = 4.65, S.D = 0.54)
84.44/83.75 80/80
and
Innovation
Demonstration
School
RMUTT.
Twenty-Five children and in experimental group and the

other twenty-five children are in control group.
The experimental tools are: 1) Interactive media design for
encourage garbage management on Android operation
system of early childhood 2) The garbage classification
childrens test and 3) A satisfaction questionnaire of
experts. The research statistics were used mean standard
deviation and t-test. Results of the research were as
follows: The mean score of the garbage classification
childrens test after watching the Encourage garbage
management on android operation system was higher than
before watching in significantly different at the rate of
0.05. The experts satisfaction with learning through use
of the interactive media was the most level. (= 4.65, S.D
= 0.54) and the efficiency of the interactive media was
84.44/83.75 which was higher than the criteria of 80/80.
Keywords: Interactive Media, Encourage Garbage
Management, Android Operation System,
Early Childhood.
1.
Abstract
The purposes of this research were to design of

interactive media for encouraging garbage management
on android operation system of early childhood. The
499
NCCIT2015

(Concept)
[10] [11]

0.05
[12]

.. 2554 [1]
15.16 41,532
. 8,766
16,620
16,146
8
2558 18,750
[2]

[3]

[4]

[5]

. [6]

[7]

[8], [9]

2.
2.1
E1/E2
[13]

=
(1 ) =
500
(1)
(2)
100

(1)
(2)
(2 ) =
100

.
2 50
3.2
(Purposive
Random Sampling) 1 2
50 25 25
3.3
2

-
12
-
3.4

6
1
(3)
1
,
A
N
2

B
N
2.2
(Mean) (X) [14]
=
(4)
(Standard Deviation)
[14]
2 (
. . =
(1)
(5)
S.D. X
N

2.3
=
1
2
2
2
1 2
1 2
NCCIT2015
(6)
t
t 1, 2
1 2
1 2 , 2 2 1
2 1, 2
1 2

Use case diagram
GUI
3.
3.1

3 5 1 2
1 :
501
NCCIT2015

(Interactive Multimedia) 2

Use case diagram

GUI (Graphic User Interface)
Use case

2

Action Script

Alpha Test
Beta Test

(Evaluation)

2:
1:

4.
4.1

3:
502
4.2

1 2
. 50
25 25
12
2
2:

0.05
4.3
4:
X S.D.

4.73 0.52 3
4.60 0.50 5
4.87 0.43 1
4.73 0.52 3
4.57 0.63 6
4.63 0.56 4
4.57 0.63 6
4.43 0.63
7
4.83 0.46 2
4.60 0.56 5
46.6
0.54
4.65
1
2
3
4
5
6
7
50
( 12 ) ( 12 )
10
12
11
11
11
11
11
7
504
9.8036
11
12
11
11
12
12
12
12
556
10.4643
4

(X = 4.65,
S.D = 0.54)
9
1 3
1
2
3

4.3
5:
2

10.4643
9.8036

3:
Mean n
S.D.
9.80 50 1.14
10.46 50 1.15
* Sig. 0.05
Sig.
1.34
0.05*
NCCIT2015

80/80 (E1/E2)
E1
E2
503

84.44
83.75
5

84.44/83.75
[3]
[4]
[5]
5.
[6]
[7]
.
: [...].
; ; ;
.
. :
(.),
2554.
[8] Brewer, Jo Ann. Instruction to Early Children Education:
preschool through primary grades. 5th ed. Boston: Allyn
and Bacon, 2004.
[9] . .
[10]
[11]
[12]
[13]
[2]
.
: [.
..], 2539.
.
. : [...], 2542.
.
: [...],
2544.

1.

0.05
2.

4.65

3.

84.44/83.75
80/80

[1]
NCCIT2015
.

, 2555.

10
, 2557.
[14]
504
: , 2555.
. .
: , 2545.
.

4.

24 3 , 2556.
.

2.

9 (NCCIT2014). :
, 2557.
.
: 90/90 Stardard E1/E2.
19 1 2550
2551, 1 16.
. . :
, 2537.
NCCIT2015

A Framework for Classification of Severity Levels
and Prioritization of Software Defects
(Noppasorn Wiriyadilok)1 (Twittie Senivongse)2

1
Noppasorn.W@student.chula.ac.th, 2Twittie.S@chula.ac.th
software needs to be fixed as soon as possible for delivery.

Uncovered defects are logged by the software team but

-

57.49%, 76.78%
80.39%

:

specifying severity and priority of the defects requires

experiences and understanding of the software system, and
many times mistakes are made when specifying. This paper
presents a framework to help with defect management during
software maintenance. The framework focuses on two tasks.
First, software defects will have their severity levels classified.
Nave Bayes, k-NN and Support Vector Machine algorithms
can be used to build severity level classification models using
defect log history as training data. In an experiment, they give
57.49%, 76.78%, and 80.39% of accuracy respectively.
Second, severity level classification results of the defects,
together with the priority levels of the defects recorded in the
defect log, are used in the Analytic Hierarchy Process to
prioritize defects to be resolved.
Keywords: Software Defect, Severity, Priority,
Text Classification, Analytic Hierarchy
Process.
1.

(Software Defect)

Abstract
Software defect management is an important process in
software development life cycle. If defects are reported, the
505
NCCIT2015

2
3 4
5
6

Support, QA Analyst

(Defect Log)

[1]

[2]

(Text
Classification)

(Analytic Hierarchy
Process: AHP)

2.
2.1

IEEE Std 1044:
IEEE Standard Classification for Software Anomalies [3]
(Defect
Severity) 5
Blocking, Critical, Major, Minor Inconsequential
(Defect
Priority) 3 High, Medium, Low

2.2
(Text Processing)
(Text
Classification)
[4]
(Lexical Analysis)

(Stop Words)
(Noun
Grouping)
(Stemming)

506
NCCIT2015
[1]

Tian [7]

AHP
Ahmad Laplante [8]
AHP

Term Frequency-Inverse Document

Frequency (TF-IDF)

(Cosine
Similarity) [4]
Nave Bayes, k-NN, Decision Tree, Neural Network
Support Vector Machines.
2.3
(Analytic Hierarchy
Process : AHP)

[5] AHP

2.4

Menzies
Marcus [2]
RIPPER Rule Learner

Malhotra [6]
[2]
Support
Vector Machine

Kaushik
1:
3.

4 5
507
4.

Nave Bayes, k-NN Support Vector Machines
RapidMiner Studio 6.3.000 [10]
4.1.3

Cross Validation

10-Fold Cross Validation
Nave Bayes
Accuracy 57.49% k-NN
k 3 5 Accuracy
74.47% 76.78%
Support Vector Machines Accuracy
80.39%

4.1

(Training Set)
1,000

www.bugzilla.org [9]
1 ( Bugzilla
7 Blocker, Critical, Major, Normal, Minor,
Trivial Enhancement
IEEE 1044 5
2.1 Normal Minor
Bugzilla Minor IEEE 1044
Enhancement Bugzilla)
4.2

(Test Data)
5
Support Vector
Machines 2
1: Bugzilla [9]
Issue
ID
83444
63480
63320
Summary
Severity
Priority
Attaching eventlistener
cause Writer to hang
Impress: manually set
colours overridden by
'auto' colours on other
machines
EDITING: Snap to grid
does not work
Blocker
Medium
Trivial
Low
Minor
High
NCCIT2015
2:
4.1.1
Summary
2.2

1,571
RapidMiner www.bugzilla.org
4.1.2

Issue
ID
125532
120415
121146
123617
63720
508
Summary
Prediction
Confidence
Http proxy is not

working (even without
authentication)
Crash after apply
gradient to a square
shape
SVG Export as PDF
has Opacity Error
[SVG] flags in elliptic
arc path data are not
parsed correctly
Allow user to resize a
graphic around its
center by dragging
minor
0.6
critical
0.4
major
0.4
minor
trivial
0.8
5.
NCCIT2015

4
)

AHP
3:

5.1

2
4.2
(
[1] 2.4

Bugzilla )

2 0.5
-4
-3
-2
-1
1/9
1/7
1/5
1/3
4
3
2
1
0
9
7
5
3
1
4:
5.2

5
IEEE 1044 InconsequentialBlocking
1-5
3

(
1-3
3 Low-High
-2
-1
1/9
1/5
2
1
0
9
5
1
5 2

5 Issue ID 125532
120415 Minor (2) Critical (4)
125532
120415 -2 1/5
5:

509
Issue ID
125532
120415
121146
123617
63720
125532
1/5
1/3
120415
121146
1/3
123617
1/5
1/3
63720
1/3
1/7
1/5
1/3
Sum
10.33
1.88
4.87
10.33
19.00

Bugzilla

Minor

1

( 2) 6
Issue ID 120415
0.5
() 5
2, 3, 2, 3
1 5 0.13, 0.34,
0.13, 0.34 0.05
6:
120415
121146
123617
63720
125532
120415
121146
123617
63720
Sum
0.10
0.48
0.29
0.10
0.03
1
0.11
0.53
0.18
0.11
0.08
1
0.07
0.62
0.21
0.07
0.04
1
0.10
0.48
0.29
0.10
0.03
1
0.16
0.37
0.26
0.16
0.05
1
Weight
(Sum /2)
125532

Issue ID
NCCIT2015

[1]
0.11
0.50
0.24
0.11
0.47
1
N. Kaushik, M. Amoui, L. Tahvildari, W. Liu, and S. Li,

Defect prioritization in the software industry: challenges
and opportunities, IEEE Sixth Int. Conf. Software
Testing, Verification and Validation, pp. 70-73, 2013.
[2]
T. Menzies and A. Marcus, Automated severity

assessment of software defect report, IEEE Int. Conf.
Software Maintenance, pp. 346-355, 2008.
5.3

Issue ID
[3]
IEEE, IEEE Std 1044-1993 IEEE Standard Classification

for Software Anomalies, 2009.
[4]
G. Salton and M. J. McGill, Introduction to Modern

Information Retrieval, McGraw-Hill Publishing
Company, 1983.
[5]
125532= (0.11*0.50) + (0.13*0.50) = 0.120

120415= (0.50*0.50) + (0.34*0.50) = 0.42
121146 = (0.24*0.50) + (0.13*0.50) = 0.185
123617= (0.11*0.50) + (0.34*0.50) = 0.225
63720= (0.47*0.50) + (0.05*0.50) = 0.26
T. L. Saaty, Decision making with the analytic hierarchy

process, Int. J. Services Science, vol. 1, no. 1, pp. 83-98,
2008.
[6]
R. Malhotra, N. Kapoor, R. Jain, and S. Biyani, Severity

assessment of software defect reports using text
classification, Int. J. Computer Applications, pp. 13-16,

120415,
63720, 123617, 121146 125532
2013.
[7]
Y. Tian, D. Lo, and C. Sun, "DRONE: Predicting priority

of reported bugs by multi-factor analysis," IEEE Int. Conf.
Software Maintenance, pp. 202-209, 2013.
[8]
6.
N. Ahmad and P. A. Laplante, "Software project

management tools: making a practical decision using
AHP," Software Engineering Workshop, pp. 76-84, 2006.

[9]
Bugzilla, Available: https://www.bugzilla.org, March

2015.
[10] RapidMiner, Available: https://rapidminer.com, Feb 2015.
510
NCCIT2015

The Behavior and Attitude of Internship Student on Collaborative Learning
Management via Social Network: Facebook
(Phongthanat Sae-Joo)

x = 4.34,
S.D.= 0 .8 7

x = 4.64, S.D.= 0.70

4.70, S.D.= 0.60

5

1 2
2556

45
4-6 4 41
4-6 18 17
6 10

x =
4.89, S.D.= 0.32
x = 4.10, S.D.= 0.80

x =
x = 4.28, S.D.= 0.89
:
Abstract
This
survey
research
was
implemented
by
questionnaire to investigate Facebook usage behavior

and attitude of internship students, faculty of Education,
Khon Kaen University toward collaborative learning
management via social network: Facebook in 2013
academic year. The survey findings were 45 internship
students. Facebook were used 4-6 days a week by 4
students while 41 students used daily. 18 students used
Facebook 4-6 hours per day and 17 students did longer
than 6 hours but 10 students did lesser. Nearly all
students used Facebook with personal computer, smart
phone but less than 50% used with tablet. The purposes
of Facebook usage mostly were to communicate among
friends and to entertain, to up to date, to trade and to find
new friends respectively. Almost students used Facebook
to enhance internship activities and created Facebook
group for subject implementation. The top activities in
Facebook group were to inform news, to share
information
511
and
to
inquiry
help
and
questions
2.
respectively. For the attitude of students toward

Facebook usage, Facebook had the most supporting
NCCIT2015
Brufee Collaborative learning

(high education)

(Peers)

cooperative learning
cooperative learning
[3]

5 [4]
1. (Positive interdependence)
2. (face-to-face
promotive interaction)
3.
(individual accountability)
4.
(Interpersonal and small-group
skills)
5. (group processing)
Cecez-Kecmanovic and Webb

[5]
Amy L.

device such as PC was highest level x = 4.8, S.D.= 0.32,

but Facebook had game and entertain was lowest level
x = 4.10, S.D.= 0.80.
Keywords: Collaborative Learning, Social Network,
Facebook.
1.
(Instruction)

[1]

[2]

1.

2.

512
NCCIT2015

Facebook

2368
3 19

Facebook

Facebook
[8]

[9]

2

[6]

[7] Matthew &
Marilyn

Reynol
Facebook Facebook
Facebook

Facebook
Facebook
3.

School Internship of Computer Education
2013 1
1:
513
NCCIT2015
1:

Google Form
45 2
3
2556
45
22
23
48.89
51.11
2:
1
2-3
4-6
0
4
0
8.88
41
91.12
3:
30
30 1
2-3
4-6
6
2:
1
3
6
18
17

2.22
6.67
13.33
40.00
37.78
4: ( 1 )
3:
41
38
15
5: (
1 )
4.
514
42
31
15
12
6:
43
95.56
4.44
42
93.33
6.67
9:

1. Facebook

2. Facebook

3. Facebook

4. Facebook

5. Facebook
fu
6. Facebook

7:
43
37
43
1. Facebook Social Network
2. Facebook

3. Facebook
4. Facebook

5. Facebook
6. Facebook
7. Facebook
SMS MMS
8. Facebook

x
4.55
S.D.
0.59
4.66
0.57
4.66
0.57
4.70
0.60
4.39
0.82
4.34
0.87
10:
8:
NCCIT2015
x
4.77
S.D.
0.42
4.89
0.32
4.57
0.70
4.66
0.53
4.57
0.50
4.10
0.80
4.72
0.59
4.87
0.35
1. Facebook

2. Facebook

3. Facebook

4. Facebook

5. Facebook

6. Facebook

5.
x
4.32
S.D.
0.91
4.32
0.93
4.64
0.70
4.60
0.73
4.28
0.89
4.30
0.91
515
NCCIT2015
[1]
[2]
[3]
,
. :
, 2550 9.
,

, 2554.
Buffee, K.A, Sharing our toys: Cooperative learning versus
collaborative learning. Change, 27(1), pp.12-18, 1995.
[4]
Johnson, R.T., & Johnson, D.W, Action research: Cooperative

learning in the science classroom Science and Children, 24, pp.
31-32, 1986.
[5]
Cecez-Kecmanovic, D. and Webb, C, Towards a Communicative

Model of Collaborative Web-Mediated Learning, University of
Western Sydney, Hawkesbury
[6]
Amy L. Soller, Supporting Social Interaction in an Intelligent

Collaborative Learning System, International Journal of Artificial
Intelligence in Education Vol.12 pp.40-62, 2001.
[7]
Matthew Loving & Marilyn Ochoa, Facebook as a classroom

management solotion, New Library World, Emerald Group
Publishing Limited, Vol.112 No.3/4pp.121-130, 2011.
[8] Reynol Junco, The relationship between frequency of Facebook

use, particication in Facebook activities, and student engagement
Computers & Education Vol. 58, pp. 162-171, 2012.
[9] Jeff Cain, Instructional Design and Assessment Using Facebook as
an Informal Learning Environment, American Journal of
Pharmaceutical Education; 75 (10) Article 207, 2011.
516
NCCIT2015

3G 4G
A Comparative Study of Power Usage of Smart Phone
for Data Transmission over 3G and 4G
(Boonsiri Masan)1 (Therdpong Daengsi)2

(Pongpisit Wuttidittachotiti)3
1
3

2

1
boonsiri.ma@hotmail.com, 2Therdpong1@yahoo.com, 3pongpisitw@kmutnb.ac.th
1.

3G 4G

1,006 GB
4 G
3G
15% 4G
4G
: 3 4
3
(3G)

3G
4G 3G
4G

4G

3G
Abstract
This paper presents test the performance tests about
2.
energy consumption of smartphones over 3G and 4G

mobile network in Bangkok. From the tests about power
2.1
(Cloud computing)

consumption when transmitted the same size of data files

size 1,006 GB over different mobile network, it has been
found that transmitting over 4G network saves more
power than doing the same over 3G networks
approximately 15%. Therefore, it can be said that 4G
network has more environment friendliness than the 3G
network.
Keywords: 3G, 4G, Power Consumption, Green IT.
517
(Always On)
[1]

One Drive

2.2 (Green IT)

Maximum
Megabytes
for
Minimum
NCCIT2015

3G

42 Mbps
4 Mbps [3-5]
3G (Topology)
(UE)
(BS) (RNC)
GPRS ( GGSN)
(MSC) (GMSC)
(IMS)
3G
4 (4G)
10 100 Mbps
3G
all-IP all
Internet Protocol
[8]

3G Video Call

4G
100 Mbps

4G
WiMAX
MAN LTE
4G [6]

2. 2.4
( Android) ( Google
Android) ( Android
Kilowatts

[2]
Green IT

Green IT

2.3 3 4
3 (3G)

384 Kbps 2 Mbps
( Multimedia)

WCDMA/UMTS, HSDPA, CDMA 2 0 0 0 1 xEv-DO 3 G
IMT-2000
3 ITU
UMTS 3GPP
2001 [3] 3G 2G
(Data)

(Voice Over IP)
(Video Call) (Streaming)

518
NCCIT2015
Wi-Fi access point

2
MixZones
[9]
S. Zeadally

ICT [6]
A. Mtibaa offload
MDC
MDC

[11]
L. Wang

RRC Header
[12]
G.P. Perrucciy
2G 3G

3G
2G
3G
[13]
A.Sharma
Cool-Tether
on-the-fly WiFi
Hotspot
WiFi Ad Hoc Mode

(Platform)
,
( Telephone), ( Cell phone),
(MID)
Android Inc.
(Linux)
(Server)
[7]
Operating System)
2. 2.5
2.5 P = VI
2.5 P (W)
2.5 V (V)
2.5 I (A)
2. 2.2.6

M. R. Zakerinasab

[8] Wi-Fi

XORonly

73%

N. Ristanovic 2
delay tolerant 3 G offloading
MixZones
Hotzones
delay tolerant
519
NCCIT2015
4.
Cool-Tether
WAN (GPRS /
EDGE / 3G) WiFi
Cool-Tether Cloud-Based
Energy-Aware striper
WAN Cool-Tether reverseinfrastructure mode WiFi Hot Serves
WiFi
WiFi client
Cool-Tether
38% -71%
Energy-Agnostic [14]

3G 4G

0.21 A
3G 4G 1820 14-15
3

3G 4G
Standby
3G 4G 3G
4G
Standby
1:
3.
3.1
1 Port USB
Android
1
2

3.2
1 3G 4G
( 2)
2
One Drive 100 100.6 GB (
2)
3
(A) (V) (
3)
4 1-3 40
5 Excel
6
3G
40
4G
40
(A) (V)
(W)
2:
2:
JPEG

520
(MB)
1.06
NCCIT2015
10
3G (3.943.67)*0.21 = 0.0567 = 56.7 mW 4G
(4.02-3.79)*0.21 = 0.0483 = 48.3
mW W/MB
56.4 W/MB 3G 48 W/MB
4G 4
3: 5
(V)

(A)
3G
4G
4.16
0.21
3.99
0.21
3.91
0.21
3.85
0.21
3.80
0.21
3.76
0.21
3.73
0.21
3.70
0.21
3.66
0.21
10
3.62
0.21
4.18
0.21
4.15
0.21
4.10
0.21
4.06
0.21
4.00
0.21
3.97
0.21
3.93
0.21
3.88
0.21
3.84
0.21
10
3.81
0.21
3:
3G 4G Standby
0.21 A
5.

4G 3G
(56.4-48.0)/56.4*100% 15%
4G

3G 3G

Android
3G
4G
2

iOS

4G
3G
4:

(GB) (mW)
(W/MB)
3G
1,006
56.7
~56.4
4G
1,006
48.3
~48.0
521
6.
NCCIT2015
[11] A. Mtibaa, A. Fahim, K.A. Harras, and M. H. Ammar,

Towards Resource Sharing in Mobile Device Clouds:
Power Balancing Across Mobile Devices, SIGCOMM,

Hong Kong, 2013, pp. 51-56
[12] L. Wang and J. Manner. Energy-efficient mobile web in
a bundle. Journal Computer Networks, 2013, pp. 3581-3600.
[13] G. P. Perrucciy, F.H.P. Fitzek, G. Sasso, W. Kellerer, and
J. Widmer, On the Impact 0f 2G and 3G Network Usage
for Mobile Phones Battery Lifte, European Wireless,
2009, pp. 255-259.
[14] A.Sharma, V.Navda, R.Ramjee, V.N.Padmanabhan, and
E.M.Belding, Cool-Tether: Energy Efficient On-the-fly
[1]
WiFi Hot-spots using Mobile Phones, CoNEXT09,
. [].
December 14, Rome, Italy, 2009, pp.1-12.
https://www.value.co.th/th/service/articles/Cloud_computi
ng.htm [ 15 2558]
[2]
Green IT . [ ].
http://compcenter.bu.ac.th/index.php?option=com_
content&task=view&id=72&Itemid=172
[ 19 2558]
[3]
[4]
[5]
3G 4G .
[ ]. AIS, Annual Report
2013. [ 15 2558]
3G 4G . [].
http://www.dtac.co.th/postpaid/products/addoninternet.html [ 17 2558]
3G+.
[].
http://truemoveh.truecorp.co.th/why/entry/51
[ 17 2558]
[6]
[7]
My 3G
Cat. [].
http://www.mybycat.com/about.php?id=31
[ 15 2558]
. [].
http://guru.google.co.th/guru/thread?tid=10e626014dcf9de9
[8]
[ 15 2558]
M. R. Zakerinasab, and M. Wang, A Cloud-Assisted
Energy-Efficient Video Streaming System for Smartphones,
IEEE 978-1-4799-0590-4/13, 2013, pp.1-10.
[9]
N.Ristanovic, J.Y.L.Boudec, A.Chaintreau, and V.Erramilli,

"Energy Efficient Offloading of 3G Networks",
Proceedings of IEEE MASS, 2013 pp.1-6
[10] S. Zeadally, S.U. Khan, and N. Chilamkurti, Energyefficient networking: past, present, and future Springer
Science Business Media, 2011, pp.1-26.
522
NCCIT2015

A Prosody Verification and Recommendation of Karp Yanee 11
and Klon Sakkawa Using Word Positions and Rule-Based Technique
(Pudsadee Boonrawd)

pudsadee@kmutnb.ac.th
In conclusion, the algorithm and the application can be

effectively used to assist in the verification and

(Word Positions)
(Rule-Based)

(Accuracy) 91.61

( X = 4.57 S.D. = 0.50)

:

improvement of prosodies, and enhanced to support other

types of poems to improve the quality of Thai poetry.
Keywords: Karp Yanee 11, Klon Sakkawa, Prosody,
Word Position, Rule-Based.
1.

[1]

Abstract
This research aims to design a prosody verification
algorithm and develop a prosody recommendation
application of Karp Yanee 11 and Klon Sakkawa using
Word Positions and a Rule-Based Technique. The
research results show that the overall average accuracy
of the prosody verification algorithm is 91.61 % and the
overall evaluation of the recommendation program from
experts at an excellent level. (X = 4.57, and S.D. = 0.50)
523
NCCIT2015
2.2

(Basque) POS-tag
Sequence
Frame Semantics
[5]
(Hybrid Method)

[6]
Full-Face
Poetry Generator [7], PoeTryMe [8] iPoet [9]

[10]

83 [11]

- (Backus-Naur Form)

83 [12]
2.
2.1

[2]

5
6 [3] 2 1 2 1
1
1:
1 8
2 6-9

[4]
2
3.
3.1

2:
524
NCCIT2015

THSplitLib (Array)

4

3.2

4:
3:
3

3 (Input)
(Process) (Output)
3.2.1 (Input)

3.2.2 (Process)
(Data Preprocessing)
5:
3.2.3 (Output)

525
3.3

(Unified Modeling Language: UML)
(Use Case Diagram)
(Actor) 2

6
NCCIT2015
(Functional Test)
(Usability Test)
4.
4.1

4
(No. of Words) (Segmentation)
(External Rhyme) (Between Rhyme)

30

92.46

90.76
2
91.61 1
6:
1:

(Freeware) (MySQL)
PA (PHP:
Hypertext Preprocessor)
3.4
3.4.1
(Accuracy)

1
Accuracy = . Results of the Algorithm X 100 (1)
Results of the correct answers
No. of Words
Segmentation
External Rhyme
Between Rhyme
Total of Accuracy
Overall Average Accuracy (2 Algorithms)

Accuracy (%)

Accuracy (%)
96.89
95.45
84.17
93.33
92.46
98.78
94.83
79.44
90.00
90.76
91.61
3.4.2
(Black-Box Testing)

3
7:
526
4.2
4.2.1

8
NCCIT2015
4.2.2

10
( X = 4.53 S.D. = 0.51)
(Functional Test) ( X =
4.60 S.D. = 0.50)
(Usability Test) ( X = 4.57
S.D. = 0.50)
( X = 4.57 S.D. = 0.50)
8:

9
10:
5.

92.46
90.76
2
91.61

9:
527

( X = 4.57
S.D. = 0.50)

(Text Mining)

[5] M. Agirrezabal, et al., POS-tag Based Poetry Generation with

WordNet, Proceedings of the 14th European Workshop
on Natural Language Generation, Sofia, Bulgaria, August
8-9, 2013, pp. 162-166.
[6] Q. Chen, et al., Poetry of the Crowd: A Human Computation
Algorithm to Convert Prose into Rhyming Verse, Conference
On Human Computation and Crowdsourcing (HCOMP 2014),
Pittsburgh, November 2, 2014.
[7] S. Colton, et al., Full-FACE Poetry Generation, Proceedings
of International Conference on Computational Creativity
2012, Dublin, Ireland, May 30-June 1, 2012, pp. 95-102.
[8] H. Oliveira, PoeTryMe: a Versatile Platform for Poetry
Generation, Computational Creativity, Concept Invention,
and General Intelligence, 2012.

[9] R. Yan, et al., i, Poet: Automatic Chinese Poetry Composition
through a Generative Summarization Framework under
Constrained
,
2
4 MAT
,

, 2553.
[2] , . :
, 2541.
[3] ,
, : ,
[1]
Optimization,
Proceedings
of
the 23rd
International Joint Conference on Artificial Intelligence

(IJCAI-13), Beijing, China, August 3-9, 2013, pp. 2197-2203.
[10]
, ,

, 2555.
[11] ,
, Proceedings of the 10th National
Conference on Computing and Information Technology (NCCIT
2014), Phuket, Thailand, May 8-9, 2014, pp. 834-839.
[12] , ,

,
, 2554.
2551.
[4]
NCCIT2015
, , :
, 2555.
528
NCCIT2015

Odor Detection System and Tracking Application on Smartphone
(Mongkol Seemawong)1 (Nawaporn Wisitpongphan)2

1
mk.seemawong@gmail.com, 2nawaporn.w@it.kmutnb.ac.th
the police sniffer dogs which are hard and time-consuming

6 Arduino Uno R3

to train. The proposed system consists of 6 array sensors
Bluetooth
calculated similarity value is then converted and
on microcontroller board, Arduino Uno R3 which can be

controlled by both the switch and Smartphone application
via Bluetooth.
The system can record the target odor and calculate
the similarity score by using the Cosine Distance method
and the absolute difference between the sensors value
measured from the sample odor and the target odor. The

Cosine
Distance

3

82.22%, 32.22% 25.55%

: ,,
represented on the application using percentage value for

ease of understanding. As for the performance, we tested
the system against three different group of odors, i.e.,
objects with specific odor, odor of used clothes, and odor
of human body. The experiment showed that the efficiency
8 2.22%, 3 2 .22% and 2 5 .55% , respectively. Hence, this
system could be used to detect objects with specific odor.
Keywords: Odor Detection, Array Sensor, Odor Pattern.
1.

(Sniffer Dog)
12

Abstract
The purpose of this research was to implement
the Odor Detection System and Tracking Application on
Android Smartphone. The application is target to replace
529
NCCIT2015

6-10
(Straight chain)
(Branched chain)

(Corynebacteria spp.)

[3]

Sunil et al.[ 4 ]

,
, , ,

- (Gas
ChromatographyMass Spectrometry GC-MS)

Thara et al. [5]

8-16

SD Card

Bluetooth XBee

Ji Zhang et al. [6]

(%)

(Odor)

( volatile organic

compounds VOCs)
30 300

[1], [2]
(Human Odor)

2.
530
Ayhan Muhendisligi [7 ]

4.5 V 5.5 V

Atsushi Hiroshi [8]

2
2

NCCIT2015

Chow [9]

(ANN)
5
3.
3.1
2
1
6 Arduino
C Arduino IDE

- -

Bluetooth

1
1:
2

2 2
531

MIT App Inventor 2
Fusion Table
Google Cloud Table ID APIKey

Google Graph Image
Speech to Text

3.3

2
(Alpha Stage)

3 1.
2.

3.

3.4

3
3 30

4.
4.1
4
5 V
2

Cosine Distance

2

2
3.2
Round 1
Odor Molecules
Array
Sensor
Data
Preprocessing
Data Processing
Compare Data
Data Base
Odor Molecules
Array
Sensor
Data
Preprocessing
Data Processing
Round 2
2:

Threshold
Cosine Distance 2

3
Data Base
Select Data
Compare Data
Screen Display
Odor Molecules
Array
Sensor
Data
Preprocessing
NCCIT2015
Data Processing
3:
532
4.3
4.7 68.28
3 V 5 V -

(Srting) Serial Port RX(0) , TX(1)
Bluetooth Arduino
9600
Bluetooth Client
Arduino 2.5
Ai
Bi
N
NCCIT2015
1
2
1

80%
4:

5

2

Threshold
10
2 2
100
N
i=1(100 (|Ai Bi |
100 (1
5:
100
)
Threshold
N
i=1(Ai Bi )
) 1000
2 ) N ( |B |2 )
N
|A
|
(
i
i
i=1
i=1
6:
533
NCCIT2015
3
3 30

82.22%

32.1% 25.02%
4.2
[1] Sichu L., "Overview of Odor Detection Instrumentation and

the Potential for Human Odor Detection in Air Matrices."
MITRE Innovation Program and U.S. Government Nanoenabled Technology Initiative, 2009.
[2] Yuwono A. and Lammers P.S., "Odor Pollution in the
Environment
26
11
23

8
25
10
the
Detection
Instrumentation."
Agricultural Engineering International: the CIGR Journal

of Scientific Research and Development VI, 2004.
[3] Curran A.M., Rabin S.I., and Furton K.G., "Analysis of the
Uniqueness and Persistence of Human Scent." Forensic
Science Communications 7, 2005.
1:
and
[4] Sunil K.J., et al. "Data fusion approach for human body odor
discrimination using GC-MS spectra." 2014 IEEE Ninth
International Conference on Intelligent Sensors, Sensor

82.22%

32.22%

25.55%
Networks and Information Processing (ISSNIP), 2014.

[5] Thara S., et al. "On-cloth wearable E-nose for monitoring
and discrimination of body odor signature." 2014 IEEE
Ninth International Conference on Intelligent Sensors,
Sensor Networks and Information Processing (ISSNIP),
2014.
[6] Zhang J., Qin G. and Zhang W., "Complex Frequency-
5.
domain Analysis of Sensor Response Function for
6.

1.

2.

Quantitative
Odor
Identification."
4th
International
Congress on Image and Signal Processing, 2011.

[7] Ayhan T. and Muhendisligi B. "Statistical pattern analysis
assisted selection of polymers for odor sensor array." 2011
International
Conference on
in
Signal
Processing
Communication Computing and Networking Technologies

(ICSCCN), 2011.
[8] Atsushi K. and Hiroshi I. "Active Stereo Olfactory Sensing
System for Localization of Gas/Odor Source." Seventh
International Conference on Machine Learning and
Applications, ICMLA '08, 2008.
[9] Chow K.K., et al. "E-nose herbs recognition system based
on Artificial Neural Network technique." 2013 IEEE Ninth
International Conference on Control System, Computing
and Engineering (ICCSCE), 2013.
534
NCCIT2015
An Analysis of Knowledge Management Situation Pursue Learning Institutes

based on Quality Assurance Concept for Universities in Thailand
(Jeerawan Nokeangthong)1 (Prasong Praneetpolgrang)2
(Nivet Chirawichitchai)3

1
jeerawan74@hotmail.co.th, 2prasong.pr@spu.ac.th, 3nivet.ch@spu.ac.th
from OHEC. Furthermore, experts from different fields;

CMMI, Quality Assurance, and Knowledge Management

3
CMMI

5 38 %
5
6
1. 2.
3. 4.
5 . 6 .

: CMMI
are insight interviewed. The reports obviously show that

about 38% of the academic institutes did not pass 5-score
qualification. Moreover, this study propose the methods
and plans in 6 categories; IT, KM, Infrastructure, Human
Resource, Operation and Control, and evaluation for
those academic institutes which do not pass the 5-score
qualification to become the learning institutes in the near
future.
Keywords: CMMI, Learning Institutes, Quality Assurance.
1.
Abstract
This study targets the analysis the status of
knowledge management of academic institutes following
the assessment criterias from Office of the Higher
Education Commission (OHEC). This study aims on the
strategy, policy and academic reports and documents
535
2.
NCCIT2015
2.1
( Knowledge
Management: KM)

[1]

[2]
[3]

2.3
... .. 2542
48

4

[4]
2.2
[4]

5
1. (Learning)
(Learning Dynamics)

2. (Organization)
(Organization Transformation)

3. (People) (People
Empowerment)

4. (Knowledge)

4. (Technology)
(Technology Application)

2.4

11 [5]
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
536
3.
NCCIT2015
22
51
15
14
CHE QA Online
3.3

5

4

69
3.4

KMMM [6, 7] [8]

1:
1

CHE QA Online

69

4.

102
3.1

2556
7 7.2
5

1: 102
3.2 4
4 102

537
( )
22
33
38
9
NCCIT2015
4.3

5

7.58
5
63 61.76
4 9
8.82 3 5
4.90
2 10
9.80 0 3
2.94
12 11.76
4.1

5

5.75
4.4

5

11.63
4.5

, CMMI, 7
69
4.2

5

2.63
538
NCCIT2015
3:
3

69%

2:

10 5
2
2:

1.
4.40
2.
4.89
3.
4.89
4.
4.50
5.
4.40
6. KM
4.70
7.
4.78
4:
4 5
62% 4
26% 3 12%
2

(4.40 )
(4.89 )
6.

CHE QA Online 102

5.
102
90
88%
3
539
NCCIT2015
2 1)
7 7.2
2)

6

[1] Earl, MJ. (1994). 'Knowledge as Strategy: Reflections

On Skandia International and Shorko Films', in Strategic
Information Systems: A European Perspective (Ciborra,
C., and Jelassi, T., Eds.), pp53-69, Wiley & Sons,
Chichester.
[2] Introduction to Knowledge Management". University of
North Carolina at Chapel Hill. Retrieved 18 April 2013.
[3] Marquardt, M. J., & Reynolds, A. (1994). The Global
Learning Organization. New York: IRWIN
[4]
.
. :
[5] Romberg, D. (1998a). Seeking clarity in knowledge

management, Computing Canada, October 26.
[6]
K. Ehms, M. Langen, Holistic Development of

Knowledge Management with KMMM, Siemens AG /
7.

7.1

7.2

7.3

7.4

Corporate Technology pp.1-8

[7]
H. Y. Teah, L. G. Pee, A. Kananhalli, Development and

Application
of
General
Knowledge
Management
Maturity Model, The Proceeding of Tenth Pacific Asia

Conference on Information
System (PACIS
2006),
pp.401-146.
[8]
J. H. Lee, Y. G. Kim, A stage model of organizational

knowledge management a latent content analysis, Expert
Systems with Applications Vol.20 (2001), pp. 299-311.
540
NCCIT2015

An Empirical Investigation and Analysis on the ICT HR Competency
in the Government Sector to Support Digital Economy
(Kriengkrai Bhuvanij)1 (Prasong Praneetpolgrang)2
(Kulthon Kasemsan)3
1,3

2

kriengkr@th.ibm.com, prasong.pr@spu.ac.th, kkasemsan@rsu.ac.th
have the highest gap and deserve to be improved and

developed to meet the requirement of the government
sector. From the study, we find that, currently, there is a

significant gap between the required ICT competencies in
the government sector and the existing ones. And this
could bring to the concern for the urgent training and
development on the specific required ICT competencies
for the workforce to best support government sector.
Hence this could prepare Thailand to be ready for the
Knowledge-based Economy and the upcoming ASEAN
Economic Community.
Keywords: ICT Competency, Digital Economy,
Knowledge-based.
1.
20
.. 2550

.. 2558 [1]
Abstract
This paper studies on the gap between the required
ICT competencies for HR in government sector and the
current existing ICT competencies of HR in the market
which will help to identify that what ICT competencies
541
NCCIT2015

1.
2.

3.

.. 2557 5
1. Hard Infrastructure 2. Soft infrastructure
3. Service Infrastructure 4. Promotion and Innovation 5.
Society and Knowledge
Digital Economy

ICT2020

[2]
3 - 4

(..)

2.
2.1

Knowledge Based Economy (KBE)

Organization for Economy Co-Operation and Development
OECD
[3] Choudaha [4]
-

Turban [5]

(Network Economy)
542
NCCIT2015

57

Choudaha [4]
T

(Web-based Economy)
(New Economy)

2.2

1

[6]
2: (US DoL)
20%
Good but limited
information
regarding
education,
experience,
skills, your gut
feel.
T

T

80%
The essence of
person:
Thinking
styles
Motivations
Job fit
1:
2.3

[7] 2 1
3

4
8

3:
.. 2554

(Thailand Qualifications
Framework for Higher Education TQF)
543
NCCIT2015
Scientist Model)

4
5

5

[8]
3.
Layer 7: Management Competencies
Upper Tier
(Future Study)
Layer 6: Occupation-Specific Requirements for Service Knowledge-based Works Competencies

(Service Scientist: Master Degree level)
Consumer
Behavior
Information & Services Services

Service
Innovation Design
Economy
Services
Operation &
Supply Chain
Business
Process
Modeling
Service
Engineering
Service Enterprise Business & Conceptualize

Needs
Contexualized
Marketing
Technology
Service
assessment
service
Systems
Integration
System
science
Industry-specific
Competencies
Layer 5: Industry/Service Sector Technology and Business Process Competencies

Agriculture
Healthcare
Examples of Industry/Service Sectors including IT Services and IT-enabled Services

ICT Services and other
Logistics/Transportation/
Government
ICT-enabled Services
Supply Chain Management
BPO
Tourism
KPO
ESO
Education
Layer 4: ICT Competencies

Suggested courses for IT Services Related & Knowledge-based Service Economy:
(TQF) Knowledge in 5 Computer Bachelor Degrees:

1.Comp.Sci.
2.Comp.Eng.
Teamwork
Soft Skills, Academic Skills,

Fundamental IT User Skills,
Motives, Traits, and Workplace
Competencies
Banking/Finance
Planning &
Organizing
3.Software.Eng. 4.ICT
Innovative
Thinking
Problem Solving &
Decision Making
5.Bus.Comp.
Emerging Tech.: Cloud

Cyber Security
ICT Services Management
Analytics Mobile Social Media
ICT Architecture/Consultancy
SOA
BPM
ICT Project Mgnt.
ICT and Service Economy
Business Systems Management
Service Science
Layer 3: Workplace Competencies Layer 3:

Workplace Competencies
Working with Tools &
Technology
Business
Fundamental
Interdisciplinary
Collaboration
Leadership & Organization

Behavior
Diversity
Orientation
Integrative
Competence
Layer 2: Academic Competencies

(TQF) Numerical
Analysis and ICT
Skills
(TQF)
Moral and
Ethics
(TQF)
Cognitive Skills
Mathematic
(TQF)
Reading
Science
Communication
Critical and
Analytical Thinking
Fundamental ICT
User Skills
Writing
(TQF)
Interpersonal
skills and
Responsibilities
Layer 1: Personal Effectiveness Competencies

Integrity
Professionalism
Initiative
Adaptability &
Flexibility
Dependability
& Reliability
Life Long Learning
4:

12

4
TQF

(IT Service Curriculum (ITSC))
Cloud Analytics, Big Data, Mobility, Social and
Security 5
6 (Service
544
6

2

-

5 Likert
Scale 5 1 (5)
(1)

Likert Scale 5
1, 2, 3 4
5 - 6
n
each.expert.view.score
i=1
:3 x5
(1)
(1)
(2)
Layer 6: Service
Scientist Comp.:
M.S.
Layer 6: Service Scientist Comp.: M.S.
Layer 4: ITSC &

KBSE Courses
Layer 4: ITSC & KBSE Courses
Layer 5: Industry/Service Sector: Tech. Comp
Layer 4: ICT Comp.: B.S. (IT)
Layer 5: Industry/Service Sector: Bus. Proc. Comp
4.
Competencies in each layer

Competencies in each layer
Layer 4: ICT Comp.: B.B.A.(Bus. Comp.)/B.B.A.(IS)
(4)
5:
5

5
16 3

4 ()

Competency Gap (Govt. Sector)
3.00
2.50
2.00
Govt. Sector
1.50
Layer 6: Service
Layer 6: Service
Scientist Comp.: M.S.
Scientist
Comp.:
M.S.
Layer 5: Industry/Service Sector: Bus. Proc. Comp
0.00
LayerLayer
4: 4:ITSC
&
ITSC & KBSE Courses
KBSE Courses
0.50
Layer 5: Industry/Service Sector: Tech. Comp
1.00
Layer 4: ICT Comp.: B.S. (IT)
Likert Scale Score
3.50
Layer 4: ICT Comp.: B.B.A.(Bus. Comp.)/B.B.A.(IS)
(4)
Layer 4: ICT
Comp.: B.S.(Soft.
Eng.)
:1 y 3
Layer 4: ICT Comp.: B.S.(Soft. Eng.)
Layer 4: ICT Comp.: B.E.(Comp. Eng.)
Layer 4: ICT Comp.: B.E.(Comp. Eng.)
j=1
Layer 4: ICT
Layer 4: ICT
Comp.: B.S.(Soft. Eng.)
Comp.:
B.S.(Soft.
Eng.)
gap.competency
Layer 3: Workplace
Layer 3: Workplace Competencies
Competencies
1
Layer 1: (TQF)
Morals and Ethics
Layer j
Govt. Sector
Gap.Competencies
Layer 4: ICT Comp.: B.S.(Comp. Sci.)
(3)
Layer 4: ICT Comp.: B.S.(Comp. Sci.)
(3)
LayerLayer
3: 3:Workplace
Workplace Competencies
Competencies
: 1 x 3
Layer 2: (TQF) Cognitive Skills
i=1
Layer 2: (TQF) Cognitive Skills
layer
Layer 2: (TQF)
Numerical
Analysis/ICT Skills
Gap.Competency
each.expert.view.score
Layer 1: (TQF) Interpersonal Skills
(2)
Layer 1: (TQF) Interpersonal Skills
:3 x5
Layer 1: (TQF)
Layer 1: (TQF) Morals and Ethics
Morals and Ethics
Layer j
Graph of Required Comp. (Government Sector)

j
Likert Scale Score
j=1
Layer 1: (TQF) Morals and Ethics
Required.Competencies
each.required.competency
Layer 2: (TQF) Numerical Analysis/ICT Skills
Layer 2: (TQF)
Numerical
Analysis/ICT Skills
Layer 2: (TQF) Numerical Analysis/ICT Skills
layer
Each.Required.Competency
NCCIT2015
Competencies
each
layer
Competencies
inin
each
layer
6:

-
545
NCCIT2015
5.
[1]
The Association of Southeast Asian Nations (ASEAN),

ASEAN Economic Blueprint at the 13th ASEAN
Summit on 20 November 2007, 2007.
[2]
The Ministry of ICT, National ICT Policy Framework

2011-2020: ICT2020 , Government of Thailand, 2011.
[3]
Organization for Economics Co-Operation and

Development (OECD), The Knowledge-Based
Economy, Paris, France Head of Publications Service,
OECD, 1996.
[4]
R. Choudaha, Competency-Based Curriculum for A

Masters Program in Service Science, Management and
Engineering (SSME): An Online Delphi Study,
Morgridge College of Education, University of Denver,
November 2008.
[5]
E. Turban, D. Leidner, E. McLean, Information

Technology for Management: Transforming
Organizations in the Digital Economy, 5th Edition, John
Wiley & Sons, Inc., 2005.
[6]
L.M. Spencer, S.M. Spencer, Competence at work, New

York,Wiley, 1993.
[7] U. S Department of Labor, Employment and Training

Administration, Information Technology Competency
Model, CareerOneStop, Copyright 2014 State of
Minnesota,
http://www.careeronestop.org/competencymodel/pyramid.
aspx?it=Y, 2014.
[8]
Office of the Higher Education Commission, Thailand

Qualification Framework for Bachelor Degrees, 2009.
546
NCCIT2015

Application of CAN Bus in Locker Control System
(Thawatchai Sarawong)1 (Rud Wangrungarun)2
(Siriporn Imporn)3

1
thawatchai.s@rmutk.ac.th, 2rudw@mail.rmutk.ac.th, 3545021000603@mail.rmutk.ac.th
study the development of locker control system using CAN

bus. Lockers that use password authentication required
(CAN Bus)

2

3.83
0.56
4.11
0.55
: , ,
user to remember the password and locker number. When

the user cannot remember the password or locker number,
they need to contact staff for other methods of
authentication which unnecessarily wasted time and
increasedpersonnels work load. The objective of
development of locker control system is to solve such
problems. The system has 2 service processes for user and
staff. The results from the evaluation by users showed that
the satisfaction level is good with average value of 3.83
and standard deviation of 0.56 and results from the
evaluation by operators showed that the satisfaction level
is good with average value of 4.11 and standard deviation
of 0.55.
Keywords: CAN Bus, Locker, Mobile Application.
1.

-

[1]

(Mobile Application)
Abstract
CAN bus is a serial communications bus standards that
allow microcontrollers and devices to communicate with
each
other.
Originally
designed
for
automotive
applications to reduce wiring complexities. This paper
547

(Radio Frequency Identification : RFID)

(Controller Area Network : CAN)

NCCIT2015
1: OSI [4]
2.2
(Web Service)

[5][6]
2.3
(Raspberry Pi)

[7]
2.4
(Apache Cordova)

(Hypertext Markup Language: HTML)
(Cascading Style Sheet: CSS)

(iOS) (Android)
(BlackBerry) (Windows Phone)
(Palm WebOS) (Bada) (Symbian) [8]
2.
2.1

ISO-11898 ISO-11519
Physical Data Link OSI
1

[2][3]
548
NCCIT2015
2.5
(Node.js)
(Google
Chrome)
(Event-driven Architecture)
/
(Non-blocking I/O)

[9]
2:
CAT5e
RJ-11 4 CAN-H CAN-L
12V GND 3
3.

3.1

3.2

2
3: RJ-11

3
3: 0
549
NCCIT2015
Linux
REST (Representational
State Transfer)
PostgreSQL 9.4.1
, Trigger Stored
Procedure

LDAP
3 2

1.0

2.0

Entity
Relationship Diagram (ER-Diagram)
4
3.4
3
(Alpha Testing)

(Beta Testing)

30

11
4.
4.1

5

4: ER-Diagram
3.3

PIC

550
NCCIT2015
4.3
1
1:
MCP2551

112 50
Identifier
S.D.
1.
4.34 0.48
2.
3.69 0.66
3.
3.62 0.49
4.
3.66 0.61
3.83 0.56
1
3.83
0.56
2
2:
5:
1.
2.
3.
4.
6:
4.2
19
1086
50 2.17%
30

551

4.45
S.D.
0.69
3.64
0.50
4.10
0.54
4.27
0.48
4.11
0.55
2
4.11
0.55
[6]
[7]
NCCIT2015
.. . ,
, :
, 2552.
Matt Richardson and Shawn Wallace, Make: Getting
Started with Raspberry Pi: Electronic Projects with the
5.
Low-Cost Pocket-Sized Computer, Maker Media:

Sebastopol: 2014.

3.83
0.56
4.11
0.55
[8]
Pearson Education, 2013.

[9]
[2]
, 2552,
6 2557, [], http://www.usnl.or.kr
/usnl2009/thi/e_guide/e_guide01_05.php
Renesas Electronics Corporation, 2006, Introduction to
CAN [online] Available at
http://documentation.renesas.com/doc/products/mpumcu/a
pn/rej05b0804_m16cap.pdf (accessed September 15,
2014)
[3]
Steve Corrigan, 2008, Introduction to the Controller Area

Network (CAN) [online] Available at http://www.ti.com/
lit/an/sloa101a/sloa101a.pdf (accessed September 15,
2014)
[4]
Aboubacar Diarra, 2013, OSI Layers in Automotive

Networks [online] Available at http://www.ieee802.org
/1/files/public/docs2013/new-tsn-diarra-osi-layers-inautomotive-networks-0313-v01.pdf (accessed September
15, 2014)
[5]
Brad Dayley, Node.js, MongoDB, and AngularJS Web

Development, Pearson Education, 2014.
[1]
John M. Wargo, Apache Cordova 3 Programming,
James Snell, Doug Tidwell and Pavel Kulchenko,

Programming Web Services with SOAP, O'Reilly:
Sebastopol, 2001
552
NCCIT2015

Development of a Sound System and Detection Safety Tests in
the Obstacle-Warning Glasses for the Visually Impaired
(Upady Hatthasin)1 (Nattawat Payarach)2
(Chanarong Tamasena)3

1
UHT@rmutl.ac.th, 2c.curaga@gmail.com, 3davil_sunlife@hotmail.com
Abstract

Delay
Real Time

Ultrasonic Sensor
Ultrasonic 5
2
5
Ultrasonic
4

93.61% 85.41%
94.16% 87.50%
86.87% 79.68%
This article is a further development of previous

research which has been shown to delay the audio
system. Therefore, it is necessary to improve the
algorithm by the editor of a Delay. It gives the utterance
approaches Real Time as possible. It is aimed to test the
accuracy of measuring the distance associated with the
angle in front of Ultrasonic Sensor. Also, it is examined
the reflection of Ultrasonic wave to the incident with the
five materials of sponges, glass, wood, metal, and plastic
bottle of water. The testing result has two parts. The first
is experiments to measure the distance for those five
materials. Their testing results shows that only sponges
did not respond to Ultrasonic while other four materials
reflect back. Their reflecting results of the precise
distance from the object of each type of wave were
diagnosed in a need to consider mechanisms to position
equipment and system design to ensure safety for the
visually impaired. The second part is assessments from
the normal vision people and the blindness which shown
that the accuracy of the measured distance as 93.61%
and 85.41%, the faster warning sound as 94.16% and
87.50%, the convenience and versatility of wearing
glasses as 86.87% and 79.68%, respectively.
Keywords: Distance Measurement, Sound System, The
Visually Impaired, Ultrasonic Sensor.
553
1.
NCCIT2015

[3]

[4]

[5]

[6]

[7] [8]

[1]

[2]
Ultrasonic Sensor

Ultrasonic Sensor
Accelerometer Sensor
-
Microcontroller Arduino
4 1)
Vibration Motor, 2) Buzzer, 3)
, 4)

Ultrasonic Sensor

Real Time

3.
3.1

1

Clip-on with the left

Ultrasonic sensor
Battery 9V.
Jack 3.5 mm.
Clip-on with the

right Ultrasonic
sensor
Microcontroller
Board
MP3 playback
Module
Accelerometer
Sensor
Buzzer
Vibration Motor
1:
- Clip-on with the left / right Ultrasonic Sensor
2
(Error) Clip-on
/
2.
554
- Accelerometer Sensor
3 1)
2)
3)

- Microcontroller Board
Ultrasonic Sensor Accelerometer
Sensor Vibration
Motor, Buzzer, Embedded MP3 Module

- Buzzer
Microcontroller Board
- Vibration Motor

Microcontroller Board

- Embedded MP3 Module MP3

Jack Stereo
- Jack Stereo 3.5 mm.

- Battery 9V.
Battery 9V. (Volts)
3.2

Ultrasonic Sensor

2.) 50
cm. 2 m.
( ) / ( )
0
2.)
3.3 Clip-On Ultrasonic Sensor

/ / /
NCCIT2015

Clip-On
Clip-On Ultrasonic
Sensor Accelerometer 2mm.
3
2: Ultrasonic Sensor
Clip-On
3: Clip-On
3.4
4
Raw Arduino Pro mini
9V. 5V.
Arduino Pro mini Accelerometers GY-61
5V. 5V. VCC
VCC
trig Echo Ultrasonic
Sensor D9-D12 Arduino
Pro mini X, Y,
Z Accelerometers A0, A1, A2
Arduino Pro mini
Vibration Motor
Buzzer D7 D8 Arduino
Pro mini
555

200 mS.
2
5.
Ultrasonic Sensor
VCC
Trig
Echo
GND
VCC
Trig
Echo
GND
D6
Pull- down ThaiEasyElec MP3
Embedded Module Arduino Pro mini
D3-D4 Rx Tx
Busy
D5 PH_R
PH_L 3.5 mm.

Ultrasonic Sensor
GND
XY
Z
VCC
RAW
GND
Accelerometer Sensor
NCCIT2015
Vibration Motors
A2 A1 A0 D12 D11 D10
GND
Buzzer
GND
VCC
D9
D3 D4 D5 D6D7 D8
VCC
GND
Arduino Pro mini
L R TX RX Busy
GND
Button
GND
R L
Stereo Jack 3.5 mm

ThaiEasyElec MP3
Embedded Module

Vibration Motor
Buzzer
4:
3.5
Delay Arduino Pro mini
Sequence

Multithreading Multithreading
Arduino Threading
millis()
Arduino millis()
Arduino

200 mS. (milli-Seconds)
Ultrasonic Sensor

200 mS.

200
mS. ?
5:
4.
4.1 Ultrasonic Sensor

Ultrasonic sensor T1

T2 (T2 - T1 )
T (Distance1)
556
4.2
3
1) 3m, 2)
2m. 3) 1m. 34
30 4

1
2

94.16%
87.50%
2 cm.
29.4 S/cm.
(1) (2)
Distance1 = ( T / 2 ) / 29.4
NCCIT2015
(1)
(2)
T T2 - T1
Distance1 cm. ()
Distance2 cm. ()
100.00%
Ultrasonic Sensor

5

1) 2) 3) 4) 5)
6
5 7
4
8
Ultrasonic Sensor Clip-On 9
95.21% 96.65% 96.23% 96.40%
50.00%
0.00%
0.00%
7:
5

8:
4
6:
4
9: Ultrasonic Sensor
Clip-On
557
1:
6.
1 m.
2 m.
3 m.

- 91.67%
92.50% 85.00% 96.67%
- 81.25%
87.50% 93.05% 93.75%
-

HRS2015

2:
NCCIT2015

Clip-on Clip-on
87.50%
89.38%
90.27%
79.68%
[1]
5.
[2]
1)

3m. 2m.
10 cm.
2) Ultrasonic Sensor 2

3) 5

4) /

200mS.
1S.
5)

2m., 1m., 50cm.
6)

Ultrasonic Sensor

[3]
[4]
[5]
[6]
[7]
[8]
558
,
,
, , JARS 2010,
141-157.
, , ,
,
,
EENET 2014, 4 .
, , ,

, NCCIT 2013, ., 6 .
, , ,
, NCCIT
2014, , 6 .
,

, RCCON 2015
, 23-24 2558,
, 439-442.
,

6, , 2549 35 36.
,
,
, , 2554.
,

, 22 .. 2553.
NCCIT2015

Following up on Application of eDLTV Media Used in Learning/Teaching in the
Small Network Schools of Rajabhat Maha Sarakham University
(Apichat Lagdee)1 (Somjet Poosri)2 (Worapapha Arreerard)3
1
3 1, 2, 3
1
pugan31@gmail.com, 2somjet.p@rmu.mail.go.th, 3dr.worapapha@hotmail.com
schools. The research tools were the evaluation form of
1)

2)

40

1)

(=4.75, SD.=0.43) 2)

application of eDLTV media for learning/teaching and the
1.
questionnaire related to following up on and assessment of the

volunteer camp activities for learning eDLTV media in the
small schools in the network of Rajabhat Maha Sarakham
University. The statistics used in this study were mean and
standard deviation. According to the research results, it
was found that 1) the result of the application of eDLTV
media for learning/ teaching in the small schools in the
network of Rajabhat Maha Sarakham University showed
that the teachers in the small schools has the average
scores of application of eDLTV media in learning/
teaching in the highest level, and 2) the result on the
acceptance and application of eDLTV media for
learning/teaching in the small schools of the network of
Rajabhat Maha Sarakham University was in the highest
level.
Keywords: Volunteer Camp Activities, Volunteer Camp
Activities of Application of eDLTV Media
for Learning, Acceptance and Application.
(=4.54)

[1]

Abstract
This research had its aims to 1) study the application and
2) the acceptance of eDLTV media used in learning/teaching
in the small network schools of Rajabhat Maha Sarakham
University. The samples used in this research were the
administrators and teachers from 40 small eDLTV network
559
2.

[2]

[3] eDLTV (Electronic Distance
Learning via Television)
e-Learning

5 2550

[3]

.. 2552
[4] .. 2555-2556

( 60 )

NCCIT2015
2.1
[5]
(Education Transformation)

[6] 3
1)
2)
3)
1
2.2
[3]

(eDL-Square)
4

73,867

4 2

[2]

[8]
5 1)
2) 3)
4) 5)

2.3
[7] UTAUT
UTAUT

560
NCCIT2015
3.3
(Performance expectance)

(Effort expectancy)

UTAUT

3.
3.1

65
[8]
90 % 39.39
40
2
80
1
1
3.2
3.2.1
5

(Best, 1997 : 190)

(Bloom Taxonomy) 5
9
1.00
3.2.2

5

UTAUT 9
1.00 0.87
1:
1

4 1) 2)
3)
4)
4

3.4

[9]
561
4.51 5.00
3.51 4.50
2.51 3.50
1.51 2.50
1.00 1.50
4.2

2:
4.
4.1

1:

()
1.
10
.2
8
.3
3
.4
19
5
5
5
5
4.73
4.75
4.88
4.74
4.75
SD.
0.45
0.43
0.33
0.44
0.43
NCCIT2015
1.

4.31
4.55
4.69
4.48
4.47
2.

4.36
4.73
4.70
4.52
4.54
3. /
/
4.39
4.59
4.30
4.66
4.55
4.
4.33
4.84
4.67
4.43
4.50
5.

4.36
4.89
4.80
4.56
4.59
6.

4.50
4.84
4.88
4.53
4.61
4.37
4.74
4.67
4.53
4.54
1

4
=4.75,
)X
SD.=0.43)
1

=4.73, SD.=0.45)
(X
2

=4.75, SD.=0.43)
(X
3

=4.88, SD.=0.33)
(X
4

=4.74, SD.=0.44)
(X
2

=4.54)
(X

562

//

NCCIT2015
[1] .
eDLTV
.

e-Learning (eDL-Square).
, 2555.
[2] .

. , 2556.
[3] e-Learning
. http://edltv.thai.net. [20
2556]
[4] .

eDLTV. , 2554.
[5] . .
http://www.gotoknow.org/posts/258414. [7 ..56]
[6] .
.
, 2556.
[7] Marchewka, J.T., Liu & Kostiwa, K. (2007). An
5.
5.1

4
=4.75, SD.=0.43)
(X
5.2

=4.54, SD.=0.62)
(X

5

(2557)
.

( 4.52 0.59)
4
12 A
3 B

5 C
2 D
Application of the UTAUT Model for

Understanding Student Perceptions Using Course
Management Software. Communications of The
IIMA, 7, 93-104.
[8]
Yamane, Taro.1973. Statistics: An Introductory

Analysis. Third editio. Newyork : Harper and
Row Publication.
[9] . . , 2545.
[10] .
2553-2554
, 2554.
563
NCCIT2015
Quality Information Technology for Community Services

(Sukuma Uamcharoen)

Sukuma_ay@yahoo.com
community service, nor a means of evaluating the benefits

or impacts derived from the services it provides to the

1)
2)
1)

2)
1)
5

2)
7

4.24
0.48
:

community. The purpose of this research was to invent

the alternative method to solve the aforementioned
problems by creating a Knowledge Management Model
for community services. The methods used included
Quality Information Technology (QIT) and DMAIC
Quality Methodology.
following. 1) The newly created Model consisted of five

modules: knowledge identification, knowledge creation
and acquisition, knowledge organisation, knowledge
codification and refinement, and knowledge sharing
module. 2) After being tested by seven experts, this
innovative Knowledge Management Model was accepted
at the mean score of 4.24 and the standard deviation of
0.48.
Keywords: Knowledge Management, Community
Services, Local Wisdom, Quality
Information Technology.
1.
.. 2542

Abstract
At present, Phetchaburi Rajabhat University
neither have a systematic and electronic means of
knowledge
management
in
promoting
The research resulted in the
sustainable
564
NCCIT2015

[2]
2
(Tacit knowledge) (Explicit knowledge)
[3]
1. Natural Talent

2. Experience

3. Heuristics
4. Skills
5. Artifacts

[5]
1. (Knowledge Creation)

2. (Knowledge Organizing)

3. (Knowledge Dissemination)

4. (Knowledge Application)

1

(DMAIC)

1.

2.
2.
2.1

[1]

565
NCCIT2015
1:
[10]
[11]
[12]
[13]
/
/
/
application
/
/
/
/
/
1.
Sharing
/
/
/
/
/
Knowledge
codification
and refinement
Creating
Organizing
Acquiring
Evaluating
Identifying
[9]
Goal setting
/
/
/
/
/
/
/
/
/
/
2.
1+2
1+3
3.
2+3
1:
2.2

[7]
DMAIC
Six Sigma [8]
(define : D)

( measure : M)
(analyze : A)

(improve : I)
(control : C)

2.3

(QIT)
(science) (integration)
(Information Technology : IT)

(organization)
(efficiency) 1 [6]

1

1
2
(six sigma)

3

2
2.
1.
1+2
1+3
2+3
3.
2:
( , 2548 : 9)
566

1. (Problem Domain Definition)

2. (Feasibility Study)
3. (Develop
Model for the Community Services)
4. (Test)
( , 2548 : 11)
enhance
QMDMAIC
develop
ITKM + OO
CAQI
QIT
integrate
NCCIT2015
Community Service
enhance/improve
QIT =

QMDMAIC = DMAIC
ITKM+ OO= (
)

(QIT)

(computer-aided quality improvement : CAQI)

4.
4.1
4
3.
(applied research)

4:

5
1. (Knowledge Identification)
(define)

Problem Domain Definition
Feasibility Study
Develop Model for the Community Services
Test
3:
567
- Natural Talent

- Experience

- Heuristics

- Skills

- Artifacts

(personal knowledge)
tacit knowledge
(community knowledge) explicit
knowledge
2. (Knowledge
Creation and Acquisition)

(measure)

NCCIT2015

96.67

3. (Knowledge
Organization)

(analyze)

4.
(Knowledge Codification and Refinement)

(improve)

5. (Knowledge
Sharing)

(control)
DMAIC

568
4.2
2
2:

SD
1.

(

)
2.
DMAIC (Define, Measure, Analyze, Improve,

Control)
3. (KM)
4.43
0.53
4.29
0.49
4.14
0.38
4.(Object-Oriented)
4.14
0.38
5.
(National Talent, Experience, Heuristics, Skills
Artifacts)
6. (ICT Systems)
4.43
0.53
4.00
0.58
4.24
0.48
NCCIT2015
[1] , Modern KM applications in business

management ,
, 2551 : 1.
[2] , :
[3]
2 7

(x 4.24)

(x 4.43)

DMAIC (x 4.29)

( x 4.14)
(x 4.00)
, :
, 2557 : 2.
,
(Management Information System : MIS),
:
, 2554.
[5] S. E. Mehrabani, Knowledge Management and

Innovation Capacity,Journal of Management Research,
vol. 4, no. 2, pp. 171 - 175, 2012.
[6]
, :
, , 7,
1-14.
[7]
[8]
, :
. 21 69 2552
24.
C.A. Siebra, P.R. Costa, A.L. Santos, F.Q. Silva,
Improving the Handsets Network Test Process via
5.
DMAIC Concepts, ICSE 2008, pp. 736, 2008.

[9] R.Hosseingholizadeh, Managing the knowledge lifecycle
: A Integrated Knowledge Management Process Model,

IEEE Trans. on International Conference on Computer
and Knowledge Engineering (ICCKE), pp. 105-106,2014.
[10] A.Akhavan, M.S. Owlia, M.Jafari, Y.Zare, A Model for
Linking Knowledge Management Strategies, Critical
Success Factors, Knowledge Management Practices and
Organizational Performanace; the Case of Iranian
569
University, Proceeding of the 2011 IEEE IEEM, pp.

1594, 2011.
[11] V. Supyuenyong, N. Islam, Knowledge Management
Architecture : Building Blocks and Their Relationships,
PICMET 2006 Proceeding, pp. 1215, 2006.
[12]
, 23
2 2556 451.
[13] V. Hirunyasiri and S. Butdee, Knowledge Synthesis

Using Multichannel of Media in the Case Study of
Integrated Circuit Industry, AIJSTP ME, pp. 68, 2013.
570
NCCIT2015
NCCIT2015

Mobile Application Development of Oral Health Care for Preschoolers
(Pornpimol Chaisanguan)1 (Maleerat Sodanil)2
1
2

1
pc.pornpimol@gmail.com, 2Maleerat.s@it.kmutnb.ac.th
care for preschoolers which is another choice of

knowledge distribution. An application consists of six

6

:

main functions: Dental health question, Knowledge of the

oral health care, Dental center, Favorite, The baby info
and reminder settings menu. The application was
evaluated by experts and user using questionnaire in
order to measure the performance of application in terms
of quality and satisfaction which given both are good.
Therefore, this application can be used to help user as a
source of information for the children's oral health care.
Keywords: Oral and Dental Health, Mobile Application,
1.
7
.. 2555 3
20 51.8
(dmft)2.7 / 3.2
[1]

[2]

[3]

Smart Phone Tablet 6

3 [4]
Abstract
The children's oral health care is one of an important
issue for the ministry of public health in Thailand. Its
effected directly on their growth. The root cause comes
from several factors such as foods, environmental, social,
economic and parenting behavior. The purpose of this
paper is to develop the mobile application of oral health
571
NCCIT2015
Bone Box
Dental Anatomy Ultimate
MCQs in Dentistry [7]

2.
2.1

[5]
1-5

[6]
2.2

2 1

Dentist Mania
Fiasco 2

3.
3.1

1
1:
572
PKGU
Problems:
Knowledge of oral health:

Good oral health:

User:

3.2

0-3
50

16 1 ..-.. 2552
SIRIRAJ E-PUBPLIC
LIBRALY
2
NCCIT2015
Mobile Application
Oral Health Care for Preschoolers
Share the result analyze
via facebook
Analysis risk of
the dental caries
<<Extend>>
Send contents via e-mail
<<include>>
Display result analyze

the risk of dental caries.
<<Extend>>
Share content via

facebook
<<Extend>>
View contents
User
<<Extend>>
Favorite contents
<<include>>
Favorite List
Search the dental clinics
nearby
View profile
<<include>>
Favorite dental clinic

<<Extend>>
<<Extend>>
Dial call to dental clinic
<<Extend>>
Display map coordinates

<<Extend>>
Get message notification
Navigate to dental clinic

<<include>>
Manage profile
<<include>>
Manage Notification
3:

Actor

3.3.1
3.3.2
3.3.3
3.3.4
3.3.5
3.3.6

3.4
Android SDK
Android 4.2 Google
Map API V.2 Eclipse Tools and Java Development Kit
(JDK)

White-Box Testing

2:
3.3

(UML: Unified Modeling Language)
3
573
NCCIT2015
4.2

5
3.5
1)

2)
3)
3.6

2
3

2-3 30

2556 - 2557

5:
4.
4.3

6

SmartDent
4.1

6

4
6:
4.4

4:
574
NCCIT2015
9:
4.7

// 10
7:
4.5

Favorite 8
8:
10:
4.6

9
5.
5.1

575
NCCIT2015
5.2
1

iOS Window Mobile

1:
[1]
S.D.
4.30
0.77
4.33
0.80
4.32
4.45
4.34
0.63
0.62
0.70
[2]
[3]
[4]
,

7, 2556.
,

4, 2556.
.
(5 -12 ). http://www.mission
hospital.org/index.php/th/component/content/article/354-5-12-.html. 30/06/2557.
, 2022

Veridian E-Journal, SU Vol.5 No. 2 May-August
2012.
2:
[5]
S.D.
3.79
0.62
3.96
0.65
3.80
3.84
3.84
0.63
0.60
0.63
[6]
[7]
[8]
[9]
[10]
[11]
576
,
16 1
..-.. 2552.
, ,
1-5

, 2556.
Google Play. Android Application. https://play
.google.com/store 19/07/2557.
,
: , 2552.
,
: , 2551.
,
16 1 ..-.. 2552
SIRIRAJ E-PUBLIC LIBRARY,
http://www.si.mahidol.ac.th/sidoctor/epl/article
detail.asp?id=91 20/07/2557.
NCCIT2015

An Application of ITIL to Cloud Service Provision
(Theerasak Nitlarp)1 (Twittie Senivongse)2

1
theerasak.n@student.chula.ac.th, 2twittie.s@chula.ac.th
Computing Reference Architecture issued as ISO/IEC

17789.

/ 17789

: / 17789

A set of questions related to the mapped ITIL
processes are then defined as a guideline for cloud

providers for self-assessment. Cloud providers can assess
to determine the maturity of their cloud service
management and identify room for improvement toward
service provision standards.
Keywords: ITIL, ISO/IEC 17789, Cloud Computing,
Service Provision, Service Management, SelfAssessment.
1.

(IaaS) (PaaS)
(SaaS) [1]

ISO/IEC 17789
(Cloud Computing
Reference Architecture) [2]

[11]
Abstract
Cloud computing has become one of the driving
forces behind todays IT systems. Cloud providers offer
their services to accommodate increasing cloud adoption
and, aiming at service quality, require best practice for
service management. This paper presents an application
of ITIL a set of practices for IT service management
to cloud service provision. The application is by mapping
ITIL processes to management functions of the Cloud
577

ITIL (IT Infrastructure
Library) [3]

ITIL
ISO/IEC 17789

2
3 ITIL
ISO/IEC 17789
4
5
NCCIT2015
2.2 ISO/IEC 17789
ISO/IEC 17789:2014 Information Technology - Cloud

Computing Reference Architecture [2]

(Role),
(Activity)
(Foundation Component)
Foundation Component 1

(Multi-Layer Functions)

(Mapping) ITIL
2.
2.1 ITIL
ITIL (IT Infrastructure Library) [4], [5], [6], [7], [8], [3]
(Framework)

ITSM (IT Service Management)

(Best Practices) ITIL

ITIL 5 26
12

1: ISO/IEC 17789 [2]

2.3

NIST Cloud Computing
Reference Architecture [1]

IBM
Cloud Computing Reference Architecture [9]

578

Amanatullah [10]

NIST

IBM

3

NCCIT2015
3) ITIL

ISO/IEC 17789 1
ITIL

2
FM ( Finance Management) ITIL
Account Management, Billing
Accounts ISO/IEC 17789
3. ITIL ISO/IEC 17789

ITIL

ITIL

1)
ITIL

ISO/IEC 17789

(Infrastructure as a Service)
2) ITSM

6 People, Processes, Customer,
Technology, Information Service
ITIL
ITIL Process Activity

2: ITIL
ISO/IEC 17789
4) ITIL
2 ITIL Process
Activity [4], [5], [6], [7], [8]

5
5)

ITIL 4
ITIL

[12], [13],
[14] 1.
(Required)
579
NCCIT2015
Account Management,
Billing Accounts

Yes No 2. (Optional)

3 Yes No N/A

Account Management, Billing Accounts ISO/IEC
17789 Finance Management
ITIL 3
Level 1: Process Prerequisites
ITIL
ITIL Finance
Management 3
5: Process Capability Questionnaire

6)
ITIL ISO 20000
5
ITIL Foundation
Implementer
Controller Consultant ITIL ISO 20000
4
1-5
6
Finance Management 1
3: Process Prerequisites Questionnaire

Level 2: Process Management Intent
ITIL

ITIL 4
Finance Management
4: Process Management Intent Questionnaire

Level 3: Process Capability
ITIL
5
Finance Management ITIL
6: Finance
Management
580
7 Finance
Management 60%

NCCIT2015

9

ITIL
ISO/IEC 17789,

10-12

7: Finance Management
4.
Google
Sheets
8
9:
5.
ITIL

ITIL

ISO/IEC 17789

CCM
CAIQ Cloud Security Alliance (CSA)

ITIL
PaaS SaaS
8:

581
NCCIT2015
12:
ISO/IEC 17789
10: ITIL
[1]
F. Liu, J. Tong, J. Mao, R. Bohn, J. Messina, L. Badger, and D. Leaf, NIST

Cloud Computing Reference- Architecture, NIST, Special Publication 500292, 2011.
[2]
ISO/IEC,
ISO/IEC
17789:2014
Information
Technology
Cloud
Computing Reference Architecture, 2014.

[3]
M. Nieves, Best Practice in the Cloud: An Introduction Using ITIL to
[4]
Cabinet Office, ITIL Service Operation, The Stationery Office, London,
Seize the Opportunities of the Cloud, 2014.
2011.
[5]
Cabinet Office, ITIL Continual Service Improvement, The Stationery

Office, London, 2011.
[6]
Cabinet Office, ITIL Service Design, The Stationery Office, London, 2011.
[7]
Cabinet Office, ITIL Service Strategy, The Stationery Office, London,
[8]
Cabinet Office, ITIL Service Transition. The Stationery Office, London,
[9]
IBM
2011.
2011.
Corporation,
Cloud
Computing
Reference
Architecture
4.0:
Overview, 2014.
[10]
Y. Amanatullah, C. Lim, H. P. Ipung and A. Juliandri, Toward Cloud

Computing
Reference
Architecture:
Cloud
Service
Management
Perspective, 2013 Int. Conf. ICT for Smart Society (ICISS), pp. 1-4,
11:
2013.
ISO/IEC 17789
[11]
AXELOS, It Service Management and Cloud Computing, 2014.
[12]
IBM Redguide Publication, IBM SmartCloud: Becoming a Cloud Service

Provider, 2012.
[13]
IBM Redguide Publication, IBM SmartCloud: Building a Cloud Enabled

Data Center, 2013.
[14]
582
IBM Redguide Publication, IBM Smart Analytics Cloud, 2010.
NCCIT2015

The Prototype System of Automatic Database
Construction based on Rules for the Thai Official Documents
(Usanad Ua-apisitwong)

Usanad@hotmail.com
prototype system for automatic extracting any information from

Thai government documents based on generated rules. The data

150
(
3.20)
80
:
are 150 Thai official documents from the faculty of science and
technology, Nakhon Ratchasima Rajabhat University. For the
experimental results, the satisfaction level of the user is fair (3.20
on average) and the extracting accuracy is 80 percentage.
Keywords: Information Extraction, Unstructured Data,
Government Document.
1.
(Textual Document)

3
(Structured Document)

XML (Extensible Markup Language)
(Semi-structured Document)
(Web Document)
(Unstructured Document)

(Official Correspondence)

Abstract
There are a lot of usage for official documents in government

agencies. They can be separated to two types: Internal agency
documents and External agency documents. They have many
differences of documents features such as file format, document
structure, document alignment, or fonts. From these reason, its
so hard to extract data from a document because of the official
document is an unstructured data. This paper aims to develop a
583

(Information

Extraction: IE)

XML [1]

NCCIT2015
1:
[2]
2.2 (Text Mining) [3]

(Natural Language Processing: NLP)

2
2.
2.1 Information Extraction [2]

Information
Extraction (IE) 4 Manuallyconstructed IE system IE
Supervised IE
system Training
Model Test data
Model Semi-supervised IE
system Unsupervised IE

system
Wrapper
1
2:
[3]
2.3
Usanad Ua-apisitwong and
T eer ap o ng Sungsr i , [1]

584
NCCIT2015

DOM API
(Tree Traversals) (Depth First Search: DFS)

Jianfeng Tang, [4]
(Metadata)

2

PDF
(Heterogeneous Collection documents)
Wachirawut Thamviset and Sartra
Wongthanavasu, [5]

(Repetitive Subject Pattern)
Data Record
Subject Pattern
Subject Item Product Name
[6]

TEI (Text Encoding Initiative)
3:
3.1

150

Microsoft word (.doc .docx)
4
XML
Word-to-LaTeX Version: 2.43 [7]
Michal Kebrt
XML (Preprocessing)
Tag (White space)
3.
4:
585
3.2

Usanad Ua-apisitwong and Teerapong Sungsri [1]

3.2.1 (keyword)

DOM Tree
3.2.2

(tag) XML

(Depth First Search)
3.2.1
5
NCCIT2015
3.2.4
CREATE TABLE
SQL (Standard relational database Query Language)

5

CREATE TABLE Dtype1 (Key1 VARCHAR(100), Key2
VARCHAR(100), Key3 VARCHAR(100), Key4
VARCHAR(100), Key5 VARCHAR(100), Key6
VARCHAR(500))
3.3

Window application
Netbeans IDE 8.0

6 7
5: XML [1]
6:
3.2.3
5

3.2.2

7: 1
586
4.
NCCIT2015
x=

4.1
S .D. =
x
i =1
(1)
n
n fx i2 (x )
n(n 1)
(2)

3.20 0.58

word
8:
2:
S.D.

3.00 0.63
3.40 0.49
2.60 0.49

3.40 0.49
3.80 0.74
3.00 0.63
3.20 0.58
9:
4.2
5
5 [8] 1
5
1:

4.515.00

3.514.50

2.513.50

1.512.50

1.001.50

2 (Mean) 1
(Standard Deviation) 2
587
4.3

(Accuracy)
150
NCCIT2015

[1]
Usanad Ua-apisitwong and Teerapong Sungsri, The

Automatic Rule-based Information Extraction for
Unknown Official Document, International Journal of
Intelligent Information Processing(IJIIP), Volume4,
Number4, December 2013, pp. 46-51.
[2]
80

XML

,
-,

6 (NCCIT2010), 2553, 940945.
[3]
[4]
, ,
, 4, 2556, 157-165.
J. Tang. Template-based Metadata Extraction for
Heterogenous Collection, A Thesis Submitted to the
Faculty of Old Dominion University in Partial
Fulfillment of the Requirement for the Degree of Doctor
of Philosophy Computer Science, 2006.
[5]
5.
W. Thamviset and S. Wongthanavasu, Structured Web

Information Extraction Using Repetitive Subject Pattern,

XML

(E-Office) (E-Document)

Electrical Engineering/Electronics, Computer,

Telecommunications and Information Technology (ECTICON), 9th International Conference on, pp. 1-4, 2012.
[6]
. (2546).
,
[], :
http://www.arts.chulaac.th/~ling/thesis/2546MA/Amornth
[7]
ip.pdf, [ : 27 2557].
Michal Kebrt, Word-to-LaTeX Converter, Department
of Software Engineering, Charles University, Czech
Republic, 2006.
[8]
588
,
(Movies
Recommender System using Collaborative Filtering and KMeans), The 5th National Conference on Computing ang
Information Technology (NCCIT 2009), 2552,
502-507.
NCCIT2015

The preliminary study of applying specification by example to Scrum
(Nuttaluck Boonluecha)1 (Olarn Rojanapornpun)2

1
b.nuttaluck@gmail.com, 2olarnr@sit.kmutt.ac.th
estimation accuracy. Nevertheless, further study is

required to confirm the results.

(Specification by Example)

3

4
2

1

: , ,
Keyword: Scrum Development, Sprint, Specification by

Example
1.

..
2010 54%

18%
[1],[2]

6
(Product Backlog Refinement) 1
(Sprint Planning part I) 2 (Sprint
Planning part II) (Daily Scrum)
(Sprint Review) (Sprint
Retrospective) [3],[4]

Abstract
Clear understanding of software requirement is

critical to software development. This paper presents the
preliminary study of applying Specification by Example
(SBE) to scrum software development. Three scrum teams
with similar experiences and projects were selected for
this study. The project consisted of 4 sprints and SBE were
applied to sprint 2-4. Based on our collected metrics and
the interview with the Scrum teams, application of SBE
during
sprint
planning
has
improved
team
understanding of software behaviors and the effort
589
NCCIT2015

[9]
A.A Lorber S.R. Tieszen

(Work Balancing Methodology)

(Pair Programming)
(Peer Code Review)

(Estimation)

[10]
Gojko Adzic Specification By Example:
How successful teams deliver the rights software

(Lean)

[11]
Scott Downey

(Hyper productivity)
10
(Velocity)
(Work Capacity)

[5]

1

[6],[7]

1
(Software Metrics)

2.

12 [8]

Carlos Solis

590
NCCIT2015
(Percentage of
Adopted Work)
(Percentage of Found Work)
(Accuracy of Estimation)
(Accuracy of Forecast)
(Targeted
Value Increase)
(Success at Scale)
(Win/Loss Record)

[12]
(Focus Factor)
1:
3.

3.1
2:
3.2

3.2.1
(Behavior Driven Development)

1

(Test Case)

591

(Test Driven Development)

3
NCCIT2015
4
3.3

1.
(Business Value)
2.

3.
(Spreadsheet)
(Automate Testing)
4. ( Living Documentation)

3:
3.2.2
(User Story)

4
4.
4.1

(Convenience Sampling)
592

3 3

1
1
1

4

2
5.
NCCIT2015
3
2
4.2
3

1. (Velocity)
(Story Point)

2. (Focus Factor)

( Work Capacity)

3.
(The number of Requirement Change)

1 2 3 4
1
30
30
30
33
2
22
22
22
27
3
25
23
25
33

1 2 3 4
1
74
100
91
94
2
67
100
81
100
3
76
100
76
100

1 2 3 4
1
2
1
1
1
2
4
2
2
1
3
2
1
3
1
4.3

4

2 2
1
2 3 4
593
NCCIT2015
2 :
1

3

80%

3

4
2

1 :

6.
594
7.
SPRINT3R WotIf
Ook-Bee Harmonious Technology

8.
[1]
G. Azizyan, M. N. Magarian, and M. Kajko-Mattson,

Survey of Agile Tool Usage and Needs, Agile
Conference (AGILE), August 7-13, pp. 29-38, 2011
[2]
State
of
Agile
Survey
[Online],
Available:
http://stateofagile.versionone.com, accessed on Jul. 20,

2014.
[3]
Odd-e
Thailand
and
Agile66,
Available:
http://www.scrumprimer.org/, 2014
[4]
K. Schwaber, Scrum Development Process, Springer

London, pp. 117-134, 1997
[5]
Melanie Diepenbeck , Behavior Driven Development for

Circuit Design and Verification, High Level Design
Validation
and
Test
Workshop
(HLDVT),
IEEE
International, 2012
[6]
Chih-Wei, H., et al., On agile performance requirements

specification and testing. Agile Conference, Minneapolis,
23-28 July, 2006
[7]
Gallardo-Valencia, R. E., et al., Are Use Cases Beneficial

for
Developers
Using
Agile
Requirements?,
Comparative Evaluation in Requirements Engineering,

CERE '07. Fifth International Workshop on , 16 Oct., 2007
[8]
Jeff Sutherland and Ken Schwaber, SCRUM GUIDE,

Available: http://www.scrumguides.org/, 1990
[9]
Solis, C. and W. Xiaofeng , A Study of the Characteristics

of
Behaviour
Driven
Development.,
Software
Engineering and Advanced Applications (SEAA) , Aug. 30

2011-Sept. 2, 2011
[10] A. A. Lorber and S. R. Tieszen, A Starting Point for
Negotiations - Delivering with a Heterogeneous Team,
Agile Conference (AGILE), August 13-17, pp. 148-155,
2012
[11] Gojko Adzic, Specification By Example, Manning
Publications Co : Shelter Island , 2011.
[12] Scott Downey, Scrum Metrics for Hyper productive
Teams: How They Fly like Fighter Aircraft, 46th Hawaii
International Conference on System Sciences,
Jan 7 - 10, 2013
595
NCCIT2015
NCCIT2015

E-Learning Development Model to Increase Student Achievement
in High School by using Problem based on Local Knowledge
with a Variety of Online Media
(Paisan Simalaotao)1 (Ubonrat Sirisukpoca)2

1
Paisan.smlt@gmail.com, 2Ubonrat76@gmail.com
Abstract

1)

2)

3

( IOC)
3

6 5

(IOC)
0.85
85.75/90.25
4.79 0.45

:

This article is part of the research for development, Elearning center for students in junior high school. With a wide
variety of online media. The objectives were to: 1) develop the Elearning to increase student achievement in secondary school. 2)
The learning activities with the use of Problem Based Learning
on local knowledge is applied to a variety of online media. The
study is divided into three parts: the first part is the development
of E-learning is based on local knowledge model. This is
consistent with the analysis of the content (the IOC) to evaluate
the accuracy by 3 experts. The second part of the presentation
through online media such as web application, online
documentation and Geographical map, to enable the students to
learn from a variety of online media. And the third part is to
define the problem to be a catalyst for learning. By segmenting
the students into 6 groups of 5 people to achieve the exchange of
knowledge between them. The satisfaction of the students.
Understanding and evaluation of the tests and quizzes, and study
after study to measure student achievement. Operating results
found To evaluate the consistency and efficiency of content (IOC),
with an average of 0.85, learning efficiency criteria is 85.75 /
90.25 and user satisfaction is very satisfactory. The average value
of 4.79 and a standard deviation of 0.45., it is concluded that the
model, learning with the use of Problem Based on local
knowledge with a variety of online media has actually increased
student achievement.
Keywords: E-learning, local knowledge, Problem-based
Learning.
596
1.
NCCIT2015

[1]

(CAI-Computer-Assisted
Instruction) (CBTComputer-Based Training)
(WBI-Web-Based Instruction)
LMS: Learning Management

System

(Content)
[2]

4
1. (Content)

2. CMS : Course/Contents
Management System LMS : Learning Mangaement
System

3

HTML
Java

2.

(E-Learning)

597
NCCIT2015

[6]

5

50
0.1 [7]

1

60 0.1 [8]
2
e-Learning
(E1) = 82.75 (E2) =80.65
80/80
2 eLearning [9]

5
85.52/83.09
80/80

( 0.05) [10]

1
80/80
[11]

3
3.
CMS

()
CMS

TScore
4. (mode of communications)

2

2 (real
time) White Board/ text slide, chat, interactive poll,
conferencing
(non-real time) (web board)

[3]
(Problem-Based Learning)

[4]

[5]
598
NCCIT2015
1:
60
.01
[12]
3.
1.

2 70
30
2.

2
5

3.
1.

2.

3. 5

(IOC) 1
IOC
0.7
1.0
0.7
1.0
0.85
1

(IOC) 0.85

1
5

/
1:
1 30
6 5

599
NCCIT2015
4.

ADDLE Model

1. (Analysis)
2

2. (Design)
1)
2)
3)

3. (Development)

Adobe Photoshop
Camtasia Studio
Adobe Dreamweaver

4. (Implementation)

3
(IOC)
0.85
5. (Evaluation)

4.

2:
2

3:
3
4:
600

2
2:
[1]
2
85.75/90.25

5 3
3:
X S.D.
4.77
0.42
4.88
4.80
0.44
0.49
4.74
4.77
4.79
0.44
0.42
0.45
. ELearning. : , 2548.
[2] . e-Learning
. :
, 2546.
[3] ( ) . Design e-learning
.
: , 2545.
[4] . .
: 16(3): -, 2531.
[5] Majumdar, Basanti.
. ... , 2544.
[6] . PBL .
. 6(1): 12-14, 2540.
[7] .
5
. :
, 2554.
[8] .

1.
: , 2553.
[9] .
2, , 2555.
[10] .

5
, 2551.
[11] .

1 . :
, 2552.
[12] .
3. :
, 2549.
30
25.72 85.75
85.75/90.25
30
27.07 90.25
1.
2.
3.
4.
5

NCCIT2015
3

4.79
5.

(IOC) 0.85
85.75/90.25
4.79
0.45
601
NCCIT2015

Cloud Service Selection Framework based on
Service Measurement Index Model
(Songkran Totiya)1 (Twittie Senivongse)2

1
Songkran.T@student.chula.ac.th, 2Twittie.S@chula.ac.th
trustworthiness of the service provider, as well as service cost. The

framework comprises the generation of a quality requirement
model from a service requirement questionnaire, the generation of

service provider models from a catalog of target services, and the
matching of the models to identify the right service provider for the
requirement.
Keywords: Cloud Computing, Service Selection, Quality of
Service, Service Measurement Index.
1.

(IaaS: Infrastructure as a Service)

Abstract
With the growing number of various cloud providers these
days, selection of the right cloud service for a prospective cloud
consumer is not necessarily an easy task. This is because some
services may offer the consumer with the quality higher than
required and at high price, or the consumer may be interested more
in the value for money of the service payment. This paper presents a
cloud service selection framework based on service quality
attributes as defined by the Service Measurement Index Model. The
model takes into account the quality attributes of the service,
602
1)
(Service Quality Model)
(Service Measurement Index

Model: SMI) [1]
ISO
(Cloud Services Measurement Initiative

Consortium: CSMIC)

2)
(Cloud Service Catalog)

(Service Level Agreement: SLA)
3)
(Questionnaire) 4)
(Matchmaker
Tool) (Cosine
Similarity)
( AHP: Analytic Hierarchy Process)

2
3

SMI
4
5
NCCIT2015
Rehman [3]

(Cosine Similarity Measurement)
(Euclidean Distance)
(Multi-Criteria Decision Making)
Garg [4], [5]
SMICloud
SMI

(Service Level Agreement: SLA)

SMI
Monteiro [6]

Sumetanupap Senivongse [7]

3.
2.
1:

Baranwal Vidyarthi [2]

(Subjective)
(Objective)

SMI

603

3.1
SMI

[6]
SMICloud [5]

[2]
[7] SMI
XSMI 15 2
NCCIT2015
Cataloger

1)
CloudHarmony.com [8]
Availability

data center
2) (Provider website)

3) (SLA)

3.3

Cataloger
(Catalog template)

3.4

21 15
2
3.6
3.5

[5]

(Serviceability)
(Integrity) (Benevolence)
(Value for Money)

2:

(Qualitative) (Quantitative)

(SLA)

(IaaS)

3.2
604

15
1) (Ongoing Cost) [5]
(Service Instance
Package)

(Bandwidth
NCCIT2015
7) (Reliability) [5]
CloudHarmony [8 ]

8) (Serviceability)

24 7 ,
Pricing)
2) (Auditability)

3) (Provider Certification)
ISO27001, PCI, CCSK

4) (Elasticity)
[5]

(Scale Out)
Instance

Instance
5) (Recoverability)

6) (Availability) [5]

CloudHarmony [8]

Data Center

Online
support
center,
Support
forums,
Documentation, White papers, Best practice guide

9) (Functionality)

openSUSE Linux, Windows, MAC OS X

10) (Service Response Time) [5]

CloudHarmony [8]

11) (Interoperability) [5]
API
12) (Reputation) [5]

(1)

(2) (3)
(4)
(5) Data Center
(6)
13) (Integrity)
(Uptime)
605
NCCIT2015
n
(n = 15)

(Cosine Similarity) 0-1:
SLA

14) (Benevolence)
(Free-Tier)
15) (Value for Money) [5]
(Service Instance Package)

CPU, Memory Storage
(Priority)

(AHP) [9]

3.6

3.3
(Service Provider Model)
(15 )

3.4
(Quality Requirement Model)

0-5 5
, 4 , 3
, 2 , 1
, 0
3
i rai

i
cai
R = [ra1, ra2, , ran]
C = [ca1, ca2, , can]
Sim =
ra ca
i =1
ra
(1)
ca
2
i
=i 1 =i 1
2
i

Sim
3:
4.
606
NCCIT2015

SMI

3 2
5

R = [ra1= 4, ra2 = 5, ra3 = 5ra15 = 5]
C1 = [ca1= 4, ca2 = 5, ca3 = 5ca15 = 5], Sim1 = 0.9411
C2 = [ca1= 5, ca2 = 3, ca3 = 5ca15 = 3], Sim2 = 0.8969
C3 = [ca1= 3, ca2 = 1, ca3 = 0ca15 = 5], Sim3 = 0.7606
C4 = [ca1= 3, ca2 = 3, ca3 = 0ca15 = 3], Sim4 = 0.8660
C5 = [ca1= 1, ca2 = 5, ca3 = 5ca15 = 5], Sim5 = 0.9176
C1

4
C1

[1] CSMIC, Service Measurement Index (SMI). Available:

http://www.cloudcommons.com/about-smi
[2] G. Baranwal and D. P. Vidyarthi, "A framework for
selection of best cloud service provider using ranked
voting method," 2014 IEEE Int. Advance Computing
Conference (IACC), pp. 837-841, 2014.
[3] Z. ur Rehman, F. K. Hussain, and O. K. Hussain, "Towards
multi-criteria cloud service selection," 2011 Fifth Int. Conf.
Innovative Mobile and Internet Services in Ubiquitous
Computing (IMIS), pp. 44-48, 2011.
[4] S. K. Garg, S. Versteeg, and R. Buyya, "SMICloud: A
framework for comparing and ranking cloud services,"
2011 Fourth IEEE Int. Conf. Utility and Cloud Computing
(UCC), pp. 210-218, 2011.
[5] S. K. Garg, S. Versteeg, and R. Buyya, "A framework for
ranking of cloud computing services," Future Generation
Computer Systems, vol. 29, pp. 1012-1023, 2013.
[6] A. V. Lus Monteiro, "Survey on important cloud service
4:
provider attributes using the SMI framework," Procedia

Technology, vol. 9, Elsevier, pp. 253-259, 2013.
C1
[7] A. Sumetanupap and T. Senivongse, "Enhancing Service

Selection with a Provider Trustworthiness Model," 2011
5.
Eighth Int. Joint Conf. Computer Science and Software
Engineering (JCSSE), pp. 281-286, 2011.

[8] J. Read, CloudHarmony. Available:
https://cloudharmony.com
[9] T. L. Saaty, Decision making with the analytic hierarchy
process, Int. J. Services Science, vol. 1, no. 1, pp. 83-98,
2008.
607
NCCIT2015

Application of Case-Based Reasoning an Online Helpdesk System for
Website of Suan Sunandha Rajabhat University
(Sutasinee Yokradubshan)1 (Mahasak Ketcham)2

1
Sutasinee.yo@gmail.com, 2Mahasak.k@it.kmutnb.ac.th
Abstract

( Moodle)
Case-Based Reasoning

[1]
( Term Weighting) TF-IDF (Term
Frequency - Inverse Document Frequency)

(Precision) 0.80 (Recall)
0.63 F-Measure 0.71

4.43
0.41
4.25 0.31
4.30
0.45
The object of this research was to develop an online helpdesk

system for website of Suan Sunandha Rajabhat University using
case-based reasoning. This aims to provide users with a website
(Moodle) problem solutions. The proposed system is based on
case-based reasoning which searches through solutions of similar
past problems and then uses them as suggestion solutions for new
problems. It applied a vector space model for information retrieval
and term weighting by term frequency inverse document frequency
.The technique of longest matching was employed to segment
keywords. When retrieving problem-solution cases, similarity
between cases stored in the system and new problem case was
calculated. The retrieval evaluation results reveal the values of
precision, recall, and f-measure of 0.80, 0.63, and 0.71 respectively.
The system was assessed by experts, application support staff, and
general users. For experts, the mean quality score was 4.43
(S.D.=0.41). For application support staff, the mean quality score
was 4.25 (S.D.0.31). For general users, the mean quality score was
4.30 with (S.= 0.45).In conclusion, the results showed that the
system has good quality and efficiency.
Keywords: Moodle Website, Case-Based Reasoning,
Helpdesk System, Vector Space Model,
Similarity.
608
1.
NCCIT2015
2.
2.1 CBR (Case-Based

(Ranking Web of
Universities)
(Domain)

Reasoning)
CBR

[3]
CBR

4 1
Moodle (Modular Object-Oriented Dynamic Learning

Environment)

[2]

(Moodle)

(Helpdesk)

(Moodle) Case-Based Reasoning

[1]
( Term Weighting) TF-IDF (Term Frequency -
1: CBR
1
4
Inverse Document Frequency)
609
1 Retrieve

2 Reuse

3 Revise

4 Retain

2.2 (Document Representation)
(Term Weighting)

[1]
( Term Weighting) TF-IDF (Term Frequency Inverse Document Frequency)
(Vector Space Model) (Document)
(Query)
(Vector of Terms)
(Terms)

(Term Weighting)
NCCIT2015
IDF = log (N/DF)
(1)
IDF
TF
N
DF
2.3

Normalized Frequencies Weight
Similarity
Similarity
Index Term
[4]

[5]

[6]

[1]

(CaseBased Reasoning) [2],[3],[7],[8],[9]


TF-IDF (Term Frequency-Inverse Document Frequency)
(TF)
(IDF)
IDF
[4]
1
610
NCCIT2015
(Term Weighting) TF-IDF (Term Frequency - Inverse

Document Frequency) (Vector of Terms)

Similarity Similarity

3.
3.1
4.

4.1

4.1.1

Similarity

[1]
TF-IDF (Term Frequency - Inverse Document
Frequency) (TF)

3
2:
2 (Input)

(Query Term)

(Lexto) (Stop Word)
(Stem)
(Normalization) (Index)

[1]
611
NCCIT2015
(Rating) 5
5:
4.2

Precision 0.80 Recall 0.63
F-Measure 0.71
1
1:
3:
(TF-IDF)
(IDF)

(Rating)

4.1.2
(Rating)

1-5
1 5
4
Keyword
Moodle
upload
Moodle

Precision
0.36
0.88
0.83
0.86
0.50
0.89
0.88
0.45
Recall
0.40
0.78
0.83
0.86
0.67
0.80
0.96
0.17
F-Measure
0.38
0.82
0.83
0.86
0.73
0.84
0.92
0.24
0.88
0.95
0.90
0.94
0.88
0.50
0.94
0.80
0.65
0.70
0.53
0.43
0.43
0.86
0.44
0.63
0.75
0.81
0.67
0.59
0.58
0.63
0.60
0.71
4.3
3
5 5
15 5 Functional
4: (Rating)
4.1.3

Requirement test, Functional Test, Usability test, Performance

test, Security test 2
612
NCCIT2015
2:
Functional
Requirement
test
Functional
Test
Usability test
Performance
test
Security test
/S.D.
4.25/0.39
4.10/0.36
4.13/0.57
4.60/0.04
4.40/0.04
4.23/0.08
4.44/0.57
4.45/0.52
4.16/0.49
4.25/0.36
4.53/0.52
4.38/0.56
4.40/0.51
4.43/0.41
4.33/0.30
4.25/0.31
4.20/0.50
4.30/0.45
[1]
[2]
[3]
[4]
5.
[5]

3

3

(Moodle)

1.

2.

.
.
, 2549.
.

.

, 2555.
.

.
5 . :
, 2552.
. Case-Based Reasoning
.

, 2549.
Baisakhi
Chakraborty,
D.Ghosh,
Ranjan
Kumar
Maji,Saswati Garnaik, Narayan Debnath. Knowledge

Management with Case-Based Reasoning Applied on Fire
Emergency
Handling.
978-1-4244-7300-7/10/$26.00
2010 IEEE.
[6]
Saunders, A. 2004. Online Solutions. Looking to the Future of

KnowledgeBase Management.
ACM SIGUCC, Baltimore,
Maryland, USA.
[7]
[8]
[9]
613
.
.

, 2554.
.
.

, 2551.
.

.

, 2554.
NCCIT2015

The Hybrid Information Systems for monitoring the vehicle repair quality by
Multi-Dimensional analysis and Toyota Way
(Patcharapol Norasarn)1 (Nattavee Utakrit)2
1,2

pnorasar@gmail.com, nattaveeu@it.kmutnb.ac.th
idea of system to consistent with the ideals and

behaviorism of Toyota and Lexus employees as 2 pillar

*
*(OLAP)*
*
*
*
*2*
* (Continuous*Improvement)*
*(Respect*for*people)*
* *
* *
* *4.08*
*0.41* *
*4.30* *0.54
: * *
are Continuous Improvement and Respect for people. The

system able to support Operator, supervisor and Top
Management is well. The satisfaction result of panel
experts are
= 4.08,
of general users are
= 0.41, the satisfaction result

= 4.30,
= 0.54
Keyword: OLAP, Toyota Way, Vehicle Repair Quality
1.*
*(Toyota*Way)**
* *

2* * * *(Continuous
Improvement)* *(Respect
for people)* *

2505*
* * 3
** *
*
* *3*
*

Abstract
This research aims to develop the Hybrid Information
Systems for monitoring the vehicle repair quality of
Toyota and Lexus service workshops under name Fix It
Right Activity. It was developed with Multi-Dimensional
analysis via OLAP Tool to monitor vehicle repair quality
and apply Toyota Way Philosophy to design a conceptual
614
NCCIT2015
2.*

*

*
*123* * *400
*
*
*
*(Fix*It*Right*Activity)*

* * *
* *
*

(Quality*Gate)* *3**
**
*
*

*
*400*
*

*
(Management Information Systems)
(OnLine-Analytic Processing : OLAP)

2.1* *(OnLine-Analytic Processing:*OLAP)

[1]

OLAP

OLAP

2.2* *(Toyota*Way)
1:
*(Toyota*Way)*[2] *
*

2

2.2.1* *(Kaizen,*Continuous
Improvement)*

3 ,
615
NCCIT2015
2.5*
2.5.1* *[4]*
*
*
*(OLAP)*
*

2.5.2* *[5]*

*OLAP*
*(On-Line-Analytic
Processing:*OLAP)*
* *
2.5.3* *[6]*

*()*
*

*
On-Line-Analytic Processing: OLAP*
*(Multidimensional)

2.2.2* *(Respect*for
people)*

*

2

2.3* *(Fix*It*Right
Activity)
2:
*[3]* *
*
,
* 6
3
2.4* *(Quality*Gage:*Q-Gate)
3.*
3:
*[3]*

*

616
3.1
NCCIT2015

(Kaizen)

(OLAP)

6
4:
3.1.1*

3.1.2*

-*

-*

-*

3.2*
3.2.1* *

3.2.2**

5:
6:
3.3*

PHP
MySQL
(OLAP)
2
617
Q-Gate 1, Q-Gate
2 Q-Gate 3
3.4*

2
5
5
NCCIT2015
8:
8 (1) (2)
(3) (4)
(5)
4.*
9:
9 (1) (2)
(3)

7:

2

10:
618
NCCIT2015
2:
1.

2.
3.
4.

5.*
9 (1)
(2)
(3)

(4)
4.1
5
1
1:
1.
2.
3.
4.
5.

S.D.
4.32
0.61
4.34
4.48
4.18
4.30
0.59
0.52
0.51
0.54
5.1

5
4.08
0.41

5
4.30
0.54

5.2*
5.2.1

5.2.2

5.2.3

11:
S.D.
X
4.24 0.44
4.08 0.58
4.22 0.08
4.45 0.52
4.00 0.36
4.08 0.41

5 2
619
[1]** ,
**** ,
**** , 2549.
[2]** , 2001,
*****, 2544.
[3]** ,
*****, , 2549.
[4]**
,
***** ,
*****
***** , 2554.
[5]** ,
*****
*****OLAP,
*****, 2554.
[6]* ,
**** (
),
**** , 2554.
620
NCCIT2015
NCCIT2015
/ 12207 / 15504
Process Definition and Support Tool Development for Project Planning Process
based on ISO/IEC12207 and ISO/IEC15504
(Premyupha Armonsak)1 (Nakornthip Prompoon)2
1
, ,
premyupha.a@student.chula.ac.th, nakornthip.s@chula.ac.th
according to the ISO / IEC 12207: 2008 Systems and

Software Engineering - Software Life Cycle Processes[4]

/ 12207:2008 [4] /
15504:2006 [5]
3

: , ,
,
and ISO / IEC 15504: 2003, Information Technology

Process Assessment[5]. The defined planning process is
established into 3 levels; project initialization level,
sprint level, and daily basis level. Relevant roles and
responsibilities are also defined in order to enhance
SCRUM planning process efficiency.
Keyword: Project Planning Process, Process Definition,
Scrum, Agile Life Cycle Model.
1.
Abstract
Scrum is a popular process used in agile software
development model because it emphasizes on user
involvement and helps generate gradually part of
software product that meets user requirements. Planning
phase is one of the Scrum important processes which
greatly affect the process and product quality. This
research aims to demonstrate a way to define the process
and to develop a software tool to support Scrum planning
621
2.
(Project
initialization) (Sprint phase) (Daily
phase)

(ISO : The International Organization for
Standardization) 2 /
12207:2008
[4] / 15504:2006
( - )[5]

1058-1998
[3]

5 ,
, ,

NCCIT2015
2.1 / 12207:2008

[4]

2
[4] 1)
(System Context Processes) 2)
(Software Specific Processes)

2.2 / 15504:2006 ( )
[5]

12207

(Measurement Model)

(Activity Mapping)

5
(Performed), (Managed),
(Established),
(Predictable) (Optimizing)

622
NCCIT2015
(User Stories)
2)
(Scrum Master)

3) (Project Team)

, , ,

[7]

2.6

[10]
(SPrL: Software
Process Line)
(CMMI:
Capability Maturity Model Integration)

, [11]

(QFD: Quality Function
Deployment) (AHP: Analytical
Hierarchy Process), [12]
2.3 1058-1998

[3]
(Software Project
Management Plans)

, , ,
, ,
,
, ,

2.4 (Agile methods)

[ 8]

(XP: eXtreme Programming), (Scrum)

1-4

2.5 (Scrum)
[7]
3 1)
(Product Owner)

623
NCCIT2015

1) / 12207[4]

2) / 15504[5]

3) 1058-1998[3]

4)
24774:2012[2]
5)

[10], [11], [12]

[2], [6], [9]

[7]

/ 12207:2008 / 15504

/ 12207:2008 /
15504
/ 12207 /
15504 1

X

(Taxonomy)
(Knowledge Asset
Structure)
3.
1:

3.1
3.1.1 /
12207:2008 / 15504

/
12207 / 15504
624
1: / 12207

13

,
7

3.1.3

2 1)

(Activity Diagram) (UML:
Unified Modeling Language)[1 ]

3

2
/ 15504
/
/ 15504
12207

NCCIT2015
X

3.1.2
625
(Re-Estimate)
NCCIT2015
2:
2)

1

2
2:
2 (Sprint Plan 2)

1.
2.

1.

2.

626
(Task)
(Re-Estimate)

()
( )
(Go live)
1.
( )

2.

( , )

(
8)
3.

3.1.4
1
2

(Checklist)
/
12207:2008 / 15504

3

NCCIT2015
, 10 ,
4 3
3.2
3.2.1

3

4
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
3:
/
12207
/
15504
<<include>>
<<include>>
<<include>>
<<include>>

<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
<<include>>
3:

24

1 , 6
627
4.

1)

/

2)

3)

4)

5)

(Lessons Learned)

NCCIT2015
4:

3.2.2

3

1)

,
2)

3)

5.
628
/ 12207:2008
/ 15504:2006

1058-1998

2 1)
,
26 ,

24 ,
3
2)

[6]
[7]
[8]
[9]
ed. Newtown Square, PA: Project Management Institute,

2008.
[10] Daniel Dias de Carvalho et al, Definition of Software
Process Lines for Integration of Scrum and CMMI,
Universidade Federal do Para (UFPA), Brasil., 2014.
[11]
[12]

2556.

2557.
Dennis, Wixom, Tegarden. System Analysis Design
IEEE 24774:2012. Systems and Software Engineering -
IEEE STD 1058-1998, IEEE Standard for Software

Project Management Plans, IEEE 1998.
ISO/IEC 12207:2008 Systems and Software Engineering Software Life Cycle Processes. Geneva, International
Organization for Standarization. www.iso.org, 2008.
[5]
Project Management Institute, A guide to the project

management body of knowledge (PMBOK Guide), 4th
Guidelines for Process Description., 2012.
[4]
"Manifesto for Agile Software Development" at

http://agilemanifesto.org/, 2001.
ed., 2009.
[3]
Ken Schwaber, Jeff Sutherland. The Scrum Guide,

2013.
UML Version 2.0 An Object-Oriented Approach, 3th
[2]
Kathy Schwalbe. Information Technology Project

Management, Fifth Edition., 2007

[1]
NCCIT2015
ISO/IEC 15504:2003, Information Technology

ProcessAssessment - Part 5: An exemplar software life
cycle process assessment model, International
Organization for Standarization. www.iso.org, 2004
629
NCCIT2015
.
Sea Floor Model Visualization for Barge Selection, Krabi Power plant
(Nuttanan Pipitpattanaprap)1 (Sakchai Tangwannawit)2

1
nuttanan.p@gmail.com, 2sakchai.t@it.kmutnb.ac.th
model that can display in 2D model and terrain modeling

in 3D. Including develop the GIS application for

Sounding

2
3

2

(X = 4.61 S.D. = 0.49)
( X =
4.34 S.D. = 0.54)

:
2 3

represent the results via web browsers. The results of

performance evaluation is a very good level (X = 4.61
and SD = 0.49) and the results of evaluation on user
satisfaction toward the system is a good level (X = 4.34
and SD = 0.54). It can be concluded that the development
process and the application was able to use it for real
and effective.
Keyword: Geographic information system, Sea floor
Model, Sea Surface Model, 2D and 3D Model,
web based GIS
1.

3
1.

Abstract
The purpose of this special problem is to develop the
sea surface model (Sea floor model) for support Barge
selection that can be displayed via the network using a
web browser. The research used the techniques of Digital
Elevation Model (DEM) and Triangulated Irregular
Network (TIN) to analyze water depth data obtained from
survey by sounding method to generate the sea surface
630
2.
Echo
Sounding
3.
(GIS)

(Database) (Attribute Data)
(Spatial Data)

(Maps) (Graphic) (Picture)
(Model)

(Web Browser )
NCCIT2015
[1]
1:

2.3 (Surface Model)

(Surface)
X, Y, Z

GIS

(Interpolating)
[2] 2
2.3.1 (Raster)
DEM (Grid
Format)

2.3.2 TIN TIN
Node Z Node
Edge
(
)
(x,y,z) [3]
2.
2.1 - (Tide and Water Level)

-
-

-

[1]
2.2

(Echo Souder)
2: TIN Raster(DEM)
631
2.4
[4]

[5]
Small Area Estimation Minnesota
Map Server GIS
[6]

OGC Map Service Minnesota Map
Server
PHP Map Script
Map File MySQL
NCCIT2015
3:
3.2 (Sea Floor Model)
2 3

ArcGIS 10.2
QGIS
Windows
Oracle 2 3
-6
3
0.1
-6.0, -5.9, -5.8 3.0
4-5 6-7
3.

( Deep Spot )
Sounding
3 30

(Lowest Low Water :
LLW)
3.1

3
,
Lb = Lw D
Lb

Lw
4: 2
632
NCCIT2015
3 8
9

8:
2 3
5: 3
6: 2
7: 3
3.3
2 3

2 2
9:
633
3.4

3

4
1.
(Functional Test)
2.
(Performance Test)
3.
(Reliability Test)
4.
(Usability Test)

10 3
1.
(Function Requirement Test)
2.
(Performance Test)
3.
(Usability Test)
NCCIT2015
10: 2
11: 3
12:
4.
1: 4

2 3

2

0
23 (0.00 - 23.00 .)
3 1

10 - 12
634
S.D.
1.
2.
3.

4.
4.38
0.5
4.67
0.5
4.93
0.26
4.47
0.52
4.61
0.49
2: 3
S.D.
1.

2.
3.
4.15
0.53
4.53
0.51
4.36
0.53
4.34
0.54
NCCIT2015
6.
6.1

(Real Time)

6.2

5.

2 3

3

4 (X = 4.61 S.D.= 0.49 )
10
(X = 4.34 S.D. = 0.54)

[1] . Introduction to Oceanography

. ..., 2555
[2] .
ArcGIS10.1 for Desktop. :

, 2556.
[3] (
). .
: (),
2553.
[4] .
:

11 2
..-..2553
[5] .
. , 2554
[6] .
Small Area Estimation : , 2552
635
NCCIT2015

The guidelines for Test Cases and Scenarios by Analysis Matrix
1 (Taksaporn Phanjhan)1 2 (Sakchai Tangwannawit)2
1

2

tp.taksaporn@gmail.com, sakchai.t@it.kmutnb.ac.th
test with functional requirements specifications (FRS) and

Requirements traceability matrix (RTM). The average test

functional requirements
specifications (FRS) Requirements traceability
matrix (RTM)

5 3.65
0.54

:
coverage matrix score of five experts toward the guidelines

was 3.65 with a standard deviation of 0.54. In conclusion,
the results showed that experts were accepted with the
guidelines, which is very usable and useful.
Keyword: Test Scenario, Test Coverage Matrix , Test Case
1.
(Test Scenario)[1]

Flow

Abstract
The objective of this research was to develop the
guidelines for test cases and scenarios by analysis matrix.
We proposed to find a suitable for test cases and scenarios
by focusing on improving accuracy and coverage all
function of program which design by test coverage matrix
format. The result found that analysis matrix achieved the
high performance. Then, the researcher has to mapping
636
2.
NCCIT2015

2.3 Coverage Criteria for GUI Testing[4]

(Intra-component criteria)
(Intercomponent criteria)

2.4 (K-Mobile Banking PLUS)[5]
(K-Cyber Banking)[6]

2.1 (Level Of Testing) [2]

(Waterfall model)
(Software Development Life Cycle)
(Testing Life Cycle)

1:

(System
Testing) (User
Acceptance Test : UAT)
2.2 Automatic Test Generation : A Use

Case Driven Approach[3]

(System Test Scenarios)

Statement Coverage

3.
3.1

637
NCCIT2015

Functional
Requirements Specifications (FRS) 2
(K-Mobile Banking PLUS)

(K-Mobile Banking PLUS) 7
(K-Cyber Banking)

(K-Cyber Banking) 28
3.3

(Test Coverage Matrix)
2:
3.2

3.2.1

2
(K-Cyber Banking)
Functional Requirements Specifications (FRS)

Requirements Traceability
Matrix (RTM)

3.2.2
3:
(Test
Coverage Matrix)

RTM ID RTM
Requirement
Requirement Traceability Matrix (RTM)
Priority
Test Scenario ID
Test Scenario Description
Link Form

638
NCCIT2015
Main Function

Function

Sub Function
Link To
3.4

Requirements traceability matrix
(RTM)

Mapping

3.4.1
(Inquire account balance)

4
5:
( )
3.4.2
(K-Cyber Banking)
(Financial Summary)

(K-Cyber Banking)
6
Financial Summary
Inquiry S/A or C/A
balance
Saving & Investing
Inquiry Fix
A/C balance
Financial Summary
EAI OTE
Funding & Borrowing

Customer
Inquiry
Credit Card balance
CardLink
6:
uses
Inquire account balance
Customer
4:

5
639
NCCIT2015
1:
(Test
Coverage Matrix)

SD
1.

3.69 0.52
2.

3.62 0.54
)Functional Test)
3.
3.80 0.52
)Usability Test Execution)
7:
( )
3.5
2

Functional Requirements Specifications
(FRS) Requirements Traceability Matrix
(RTM) Mapping

5.
3.65 0.54
5.1

(x = 3.65 , SD = 0.54)

5.2
(Test
Coverage Matrix)

4.

5


640
[1]
[2]
[3]
[4]
[5]
[6]

Kaner C., An Introduction to Scenarios Testing, Florida
Tech, 2003.
.(2547).
..
C. Nebut, F. Fleurey, Y. Le Traon, and J.-M. Jezequel, Automatic
Test Generation:A Use Case Driven ApproachIEEE
TRANSACTIONS ON SOFTWARE ENGINEERING, VOL.
32, NO. 3, MARCH 2006
Atif M. Memon, Mary Lou Soffa, Martha E. Pollack, Coverage
Criteria for GUI Testing ACM SIGSOFT Software
Engineering Notes, Volume 26 Issue 5,Sept. 2001
Mobile Banking Plus

.
http://www.kasikornbank.com/TH/ServicesChannel/Searc
hServiceChannel/MobilePhone/Pages/NewKMobileBanki
ngPlus.aspx 01/06/2557
K-Cyber Banking
.
http://www.kasikornbank.com/TH/ServicesChannel/Searc
hServiceChannel/Internet/Pages/KCyberBanking.aspx
01/09/2557
641
NCCIT2015
NCCIT2015

An Algorithm for Handwriting Exercise in Thai Alphabet
on the Use of Tablet PC
(Dechawut Wanichsan)1 (Taweesak Rattanakom)2
(Nitat Ninchawee)3 (Phannika Kongjuk)4
1
2 3

4

1
dechawut.w@rbru.ac.th, 2hs2wjo@hotmail.com, 3nitat_nin@hotmail.com, 4phannikaecon@gmail.com
useful of using electronic equipment in education so as to

actually enhance skill of learners.
Keywords: Tablet, Thai Alphabet, Handwriting,

Computer Instruction Media, Android
Operating System.
1.

(Smartphone)
(Tablet)

(Application)

Abstract
The main objective of this research was to propose an algorithm
to develop handwriting exercise in Thai alphabet on the use of
mobile equipment such as tablet PC or mobile phone etc. This
algorithm could be implemented as a practical application, and
could be used for detecting shape of drawn alphabet in correct
direction as well as giving feedback to user during drawing
misshape alphabet comparing to model. In addition, this research
proposed how to calculate score in percentage to determine
similarity and quality of user's drawn alphabet. It was
642

1205 ( 1826) [1]

700

(Formative Assessment) [2]

(Summative Assessment) [2]

NCCIT2015
(1)

2 a =
(a1, a2, a3, , am) b = (b1, b2, b3, , bn)
a b m n
2
dist(, ) = (1 1 )2 + + ( )2
(2)
2.2 (F-measure)
[4]
(IR:
Information Retrieval)
(Pecision)
(Recall)

3

(3)
F-measure = 2
2
dist(, ) = ( )2 + ( )2
precision recall
4 5

(4)
precision =
recall =
(5)
2.3

(Computer Programming
Language)

(Java) [5] 3.0 (Action Script
3.0) [6] 5 (HTML5)
(Java Script) [7] (Event)
(Method) (Attribute)

1
2.
2.1 (Euclidean Distance

Measure)
[3]
(2-dimensional
space)
a = (xa, ya) b = (xb, yb)
a b 1
643
NCCIT2015
1:
x
y
(Event Listener)

(Collision Detection)

AS 3.0
HTML5+Java Script
Java (Native Android)
mouseX
mouseY
pageX
pageY
getX() ( MotionEvent)
getY()( MotionEvent)
MOUSE_DOWN
MOUSE_MOVE
MOUSE_UP
click
mousemove
mouseup
ACTION_DOWN
ACTION_MOVE
ACTION_UP
moveTo()
lineTo()
hitTestPoint()
moveTo()
lineTo()
()
drawLine()
drawLine()
()
2.4 (Educational Assessment)

[2]

(Formative Assessment)

(Summative Assessment)

[8] (Cognitive Domain)

(Affective Domain)

(Psychomotor Domain)

(
) (
) (
) (
)
3.

1

1)

3.1 2)

3.2 3)
644
NCCIT2015
i=1
i=i+1
i =
< 80%
1:
3.1

2 12

2
3

2:

6
dist(, )
(6)
2
= ( . )2 + ( . )2

moveTo() lineTo() drawTo()

1
2:
Algorithm:Handwriting Direction Detection
IF TouchEvent.MOUSEDOWN = true THEN
startDraw(myShape)
END IF
IF TouchEvent.MOUSEMOVE = true THEN
mousePos = (mouseX, mouseY)
distance = dist(mousePos, pi)
// equation 6
645
NCCIT2015
IF distance > THEN

//section 3.2
clear(myShape)
i = 1;
ELSE
IF pi is reached THEN
IF pn is reached THEN
calcScore(myShape, model);//section 3.3
END IF
i++;
END IF
END IF
END IF
4:
IF TouchEvent.MOUSEUP = true THEN

stopDraw(myShape)
END IF
FUNCTION findThreshold(p1..pn)
= 0
FOR i=1 TO n-1
= + dist(pi,pi+1)
// equation 6
END FOR
= / n
3:
3.3

3

(Precision)
(Recall) 7 8
(7)
precision =
p1, p2, , pi, , pn

1 n
x y
model
myShape

TouchEvent.MOUSEDOWN
TouchEvent.MOUSEUP
TouchEvent.MOUSEMOVE
startDraw()

stopDraw()

clear()

dist()

calculateScore()
(6)

3.3
mouseX
x
mouseY
y
mousePos

3.2
#( )
#
#( )
(8)
recall =
#
3
100
4.
4.1

3 ()

4

6

3 ()
3.2

(Threshold)

646
NCCIT2015

()
()
5:
3:
5.
4.2
(Application)
8.0 (Galaxy Note 8.0)
1280800

4

5

[1] , , :
, 2546.
[2] M. C. Rodriguez, The role of classroom assessment in student
performance on TIMSS, Applied Measurement in Education. vol.17,
no. 1, pp.1-24, 2004.
[3] P.A. Jaskowiak, R.J.G.B. Campello, and I.G. Costa, On the selection of
appropriate distances for gene expression data clustering, the 12th Asia
Pacific Bioinformatics Conference (APBC 2014): Bioinformatics,
Shanghai, China, January 2014.
[4] G. Hripcsak, and A. S. Rothschild, Agreement, the F-Measure, and
Reliability in Information Retrieval, Journal of the American Medical
Informatics Association. vol.12, no.3. pp.296-398, 2004.
4:
647
[5] , , ,
Android App Development, :, 2555.
[6] C.Moock, Essential Action Script 3.0, OReilly media: Adobe Dev
Library, 2007
[7] , HTML5, :
, 2556.
[8] U.Fuller, C.G. Johnson, T.Ahoniemi, et.al. Developing a computer sciencespecific learning taxonomy, the 12th Annual SIGCSE Conference on
Innovation and Technology in Computer Science Education, Dundee,
Scotland, June 2007.
648
NCCIT2015
NCCIT2015

Analysis of Fiber to the Home Network
based on ITU Standards with Outside Plant
(Tanaporn Jesadamethakajorn)1 (Pudsadee Boonrawd)2

1
toei.cs.hp@gmail.com, 2pudsadee@kmutnb.ac.th
representing the fiber optic network to the habitation. The proper

network for customers is designed by considering the

(International Telecommunication Union: ITU)
(Outside Plant)
(K-means Clustering)

(Expectation Maximization: EM)

(Google
Map)

:

International Telecommunication Union (ITU) standard

and Outside Plant. A K-means clustering is proposed to
cluster customers in this research and it needs to obtain
the High service efficiency and low investment cost. The
exp erimenta l resu lts show tha t th e Exp ecta tio n
Maximization (EM) method obtains less investment cost
than using the K-means Clustering, when the customers
size is equal. Moreover, the results of this research are
illustrated as the display of the optimal fiber optic network
design to each customer house on Google Map and the
network devices details are explained. The investment
cost can be computed therefore the system is easier and
more comfortable for users.
Keywords: Fiber to the Home, ITU Standard, Outside
Plant, K-means Clustering, Expectation
Maximization Method.
1.

..2552 2556
12.3
18.3 [1]
( Asymmetric Digital
Subscribers Line: ADSL)

Abstract
A design of Fiber to the Home is a pattern of high speed
internet services, which supports the communication of several
data types simultaneously. The objective of this research is to
develop the mathematical model and the simulation program for
649
NCCIT2015
(PON)
x

(Fiber to the Home: FTTH) [2]
(Central Office:

CO)

2.2

(Integer Linear Programming: ILP) [3],[4]

(Unconstrained
Splitting Stage)
(Nonlinear Programming:
NP)
(Genetic Algorithm: GA) [5]

GA ILP
GA
ILP
Lees Algorithm

[6]

Genetic
AutoCAD
2.
2.1
(Fiber to the x: FTTx)

10 Mbps 10 Gbps

Algorithm
[7]
650
3.
NCCIT2015
(Cluster)

3.2.3

2
[8]
(American System) (European
System)
3.2.3.1

(GPON) 1 (Centralized

Splitting) 1:64
ODP 2

3.1

11

8,617
3.2

1
2 :* 1

ODP
1 :

(CCO)
(K-means Clustering)

(Weka) 3.6
11
30 50

3.2.2

(Driving Mode)

3.2.1

1 1
Cost1 =
Cpon
512
CfdfSP
64
+ Codp + (Cf
Fiberodp
100
(1)
Cpon

651
NCCIT2015
1:64
Codp
ODP 1
Cf
100
Fiber
ODP
CfdfSP
3.2.3.2

(Cabinet)
1 1:8 SDP
2 1:8 ( Distribution Splitting)

3
4 :
(Polar
Coordinate Systems) [10]

()
2
tan1 =
lngu lngc
latu latc
(2)

0 360
64
1 64

1 3
3 :* 2

SDP

3 1 64
1 8

(Centroid)
(Decimal Degree: DD)
(Universal Transverse Mercator: UTM) [9]

4
Cost 2 =
(Cf
(Cf
512
Fibercab
100
100
Cfdf
72
)64 )
CsdpSP
+ (
Fibersdp
Cfdf
652
Cpon
)8)
+ (
CcabSP
64
(3)
1:8 1
CsdpSP
SDP
1:8 1
Fiber
Cabinet
Fiber Cabinet
SDP
NCCIT2015
CcabSP

1 3

1
4.1

Class B+ [11]
GPON 28 dB
25 dB
25 dB

1 3
1 :

NetBeans IDE 6.9.1

(Google Map API)
(Geocoding API) (Distance Matrix)
(Directions Service)
MySQL
AppServ
50
30
11
50
30
11
477
722
1,279
397
522
594
7,347
7,182
5,446
7,309
7,303
6,880
7,824
7,904
6,725
7,706
7,855
7,474
798
713
1,892
911
762
1,143
267,981,665
421,340,903
364,540,834
EM
822,842,736
Total Cost
K-means
425,824,296
Number of
groups
American
System
European
System
Service
Available
Service
Unavailable
336,964,769
Algorithms
1

50
336 30 11
425 822

50 267
30 11 421
364

3.3
4.
653
4.2
NCCIT2015
[1]**
.**
..2556.** , 2556.*
[2]** *.**FTTH - Fiber To The Home.**
,
3 2557 www.photonicsthai.org
5 :
[3]** L.*Gouveia,*M. Lope*and*A. Sousa.**Single PON

network design with unconstrained splitting
stages.**European Journal of Operational
Research.**240*(January 2015)*:*361-371.
[4] * M. Chardy,*M.-C.Costa,*et al.**Optimizing splitter and
fiber location in a multilevel optical FTTH
network.**European Journal of Operational
Research.**222*(November 2012)*:*330-340.
[5]** A.*Kokangul*and*A. Ari.**Optimization of passive
optical network planning.**Applied Mathematical
Modeling.**35*(2011)*:*3345-3354.
[6] * B.*Lakic*and*M. Hajduczenia.**On optimized passive
optical network (PON) deployment. Access Networks
Workshops.**7*(August 2007)*:*18.
[7]* K.*Poon,*D.*Mortimore*and*J.*Mellis.**Designing
optimal FTTH and PON networks using new automatic
methods.**IET Conference Publications.**(June
2006)*:*4552.

4.68
0.38

5.
654
[8]** * .** .**

[9] *
*:*
** .**

.**

,*2555.
[10]
*****.**

Correlation Plot A Comparative Efficiency of Correlation
Plot Data Classification.**
.**
*22*(..-.. 2555)*:*77-89.
[11] * ().
ITU: International Telecommunication Union.**
,*2554. 3 2557
http://www.etda.or.th
655
NCCIT2015
NCCIT2015

Transformation Algorithm from BPMN Diagram to Sequence Diagram
by Metadata Model and Rule-Based
(Shavan Tansap)1 (Pudsadee Boonrawd)2

1
childzu@gmail.com, 2pudsadee@kmutnb.ac.th
mapping is the tool of transformation. The algorithm uses a

library of Quick Sequence Diagram Editor to generate the

DOM XML Parser

Quick Sequence Diagram
Editor

:

picture of sequence diagram that is the output of transformation

process. The result of research shows the successful of model
transformation that follow by a presented algorithm. From this
successful we can adapt to use in another model transformation
and we can continues the development for create a model
transformation automatically to reduce the time of create and
modifies document and improve the efficiency in software
development life cycle.
Keywords: Business Process Model and Notation,
Sequence Diagram, Metadata Model, XML
Metadata Interchange
1.

[1]

[2]

Abstract
The purpose of this research presents the algorithm of model
transformation from BPMN diagram into the Sequence diagram.
The BPMN diagram is converted into a metadata model conform
to the format of XMI file for is an input of transformation process
and then using XML DOM Parser for extract the element of the
diagram. This algorithm use the rule-based by consider the
definition and context of both diagrams to create the rule of
656
NCCIT2015

DEVS [1]
DEVS

KAOS Goal
[6] KAOS Goal

(Pattern)

[7]

PyBPMN QVT-O PyBPMN
M2T

2.
2.1
[3]

[4]

2.2

[5]

3.
3.1

3.2
657
NCCIT2015
BPMN 2.0 [8]

UML 2.4.1 [9]
OMG Group [9]
1: Actor
Pool
Actor
Lane
1:
3.3

[11] OMG Group [9]
2
1 Pool
Pool
Lane
Pool
Actor [9]

2: Lifeline
Task
Sub-Process
2:
Choreography
Task
2
Task XMI
xmi:type= BPTask
xmi:id = " 66rKFjKGAqACIQgV"
3.4

3 Actor, Lifeline Message

Life Line
Choreography
Sub-Process
Data Object
2 Task Sub-Process

Choreography Task Choreography Sub-Process
Data Object

658
3.5
DOM XML Parser

3.6

Quick Sequence Diagram Editor [12]

3.7

(Accuracy)
3

30
Lifeline [9]
3: Message
Start Event
Actor Send
Asynchronous
Message
Intermediate
Event
Actor Send
Asynchronous
Message
End Event
Actor Receive
Asynchronous
Message
Sequence
Flow
Asynchronous
Message
Message
Flow
Synchronous
Message
Data
Association
Synchromous
Message
NCCIT2015
4.

4.1

DOM XML Parser

4.2

4.3

Quick Sequence
3 Start Event End Event

Intermediate Event
Sequence
Flow Message Flow

Data Association
Data Object
Message [9]

659
Diagram Editor
A1:Actor Customer

(Actor) Customer
4.4

3
NCCIT2015
5:
5
1)
2)
3) 4)
5)
6) 7)
8)

6
3:
4.5
30
4
4
92.86

92.86
83.33
89.68
6:
4 (Accuracy)
3

30
89.68% 70%
6 1)
I want to see doctor
2) 3)
Go to see doctor 4)
5) Need my
medicine 6)
7)
Here is my medicine
4.6

The BPM to UML activity
diagram transformation using XSLT [5]
660
8)
3rd ACM/SPEC International Conference on Performance

Engineering. ACM, 2012.
[5]
Vol. 9. 2009.

89.68% 70%

[6]
Proceedings of the 29th Annual ACM Symposium on

Applied Computing. ACM, 2014.
[7]
Proceedings of the Symposium on Theory of Modeling &

Simulation-DEVS Integrative. Society for Computer
Simulation International, 2014.
[8]
OMG, OM. "Business Process Model and Notation

(BPMN) Version 2.0."Object Management Group (2011).
[9]
UML, OMG. "OMG Unified Modeling Language (UML)

Specification: Infrastructure, Version 2.1. 2, Final
Available Specification." (2007).
[11] Kovse, Jernej, and Theo Hrder. "Generic XMI-based

UML model transformations." Object-oriented information
systems. Springer Berlin Heidelberg, 2002. 192-198.
[12] Quick Sequence Diagram Editor, "SourceForge Open
Source community. :http://sdedit.sourceforge.net/
index.html
Cetinkaya, Deniz, et al. "Model Transformation from BPMN to
Symposium on Theory of Modeling and Simulation-DEVS

Integrative M&S Symposium. Society for Computer Simulation
International, 2012.
Gary B. Shelly & Harry J. Rosenblatt. System Analysis and
Design (8th ed.). USA: COURSE TECHNOLOGY Cengage
Learning.
Cetinkaya, Deniz, and Alexander Verbraeck. "Metamodeling

and model transformations in modeling and simulation."
Proceedings of the Winter Simulation Conference. Winter
Simulation Conference, 2011.
[4]
Bocciarelli, Paolo, et al. "Empowering business process

simulation through automated model transformations."
DEVS in the MDD4MS Framework." Proceedings of the 2012
[3]
Horita, Hiroki, et al. "Transformation approach from KAOS

goal models to BPMN models using refinement patterns."
[2]
Macek, Ondrej, and Karel Richta. "The BPM to UML

activity diagram transformation using XSLT." Dateso.
5.
[1]
NCCIT2015
Bonet, Pere, and Catalina M. Llad. "Importing PMIF models

into PIPE2 using M2M transformation." Proceedings of the
661
NCCIT2015
GPS

Time Train Tracking System Automatic and Real-Time of GPS
based on Mobile Case Study for State Railway of Thailand
(Phongphodsawat Sangthong)1 (Pongpisit Wuttidittachotti)2
1
2

1
Wssangthong@gmail.com, 2Pongpisit.w@gmail.com
Currently, SRT has developed the Train Tracking System:

TTS, it showed the status of the operating trains on SRT
(.)
.
(Train Tracking System:TTS)
/
/ .
TTS

(Global Positioning System:GPS)

-

2 30
500

/
/ .
website and supplied the information to passengers,

meeters-greeters, and SRT officials on the train delay.
However, the real-time information could not be
displayed by the TTS as the data of current train was
necessarily keyed by the officials.
This study aimed to design the Real Time Train
Tracking System by using the GPS on a mobile phone.
The information was collected by tracking the real
operating train from Bangkok station to Ayutthaya
station. The work analysis of the developed system was a
comparison of longitude and latitude information of the
railway station with a 30-second mobile current point on
the running train and computation of two coordinate
points. If the programmed distance was less than 500
meters, the information was automatically saved. The
system result would continually process until the train
arrived at Ayutthaya railway station.
The results showed that the developed system has
effectively performed, the computation of the two
coordinate points was accurate that bring about the realtime information on the SRT website. The passengers,
meeters-greeters, and SRT officials were satisfied with
the developed system at a good level.
Keywords: Train Tracking System, Real Time, GPS.
Abstract
1.
The State Railway of Thailand (SRT) is an

organization providing passenger and freight services.
662
NCCIT2015
GPS

SMS
(GSM) [1], [2], [3]
SMS

[4]
GPS GPRS
(General Packet Radio Service)

[5] GPS

(Root Mean
Square:RMS) 20-100 [6]
(GSM)

GPS u-blox NEO-6Q
GPS, U-Blox LEON-G100 GSM
Arduino Uno [7]
GPS JSS55555 / MIL-STD-810E (Environmental) MIL-STD-461E
(EMI / EMC) GPS

/

JSS-55555
/ MIL-STD-810E [8]

Global Positioning System (GPS)
Google Map
[9]
( )
( ) 200

PHP, Windows
Server R2 2008 MySQL

. 15

Phone Gap
Android

2.

GPS (Global
Positioning System)

663
NCCIT2015
3.

(GPS)

(Train Tracking
System : TTS)

Phone Gap
Phone Gap Mobile Application Development
Framework Mobile Application
HTML5, JavaScript CSS
Mobile Application Platform
iOS, Android, BlackBerry, Symbian, webOS, bada, Windows
Phone
(.)

.
GPS
1. 2.
3.
4.
5.
6.

3.1

GPS

(.)

500

1:
3.2
Phone Gap API
HTML5, JavaScript CSS
Eclipse APK
Android 2
Ajax JSON
PHP
2: APK Phone Gap

(.)
.

Start
.

500

GPS 30
664

500 GPS

3
3.3

PHP MySQL
NCCIT2015
4:
4.

GPS
2
111 209

(.)
(Train Tracking System :
TTS)

5
209
3:
111 6
GPS

4

665
GPS
111
08:57 . 08:57 . . 21
GPS
1 GPS

(13/14)x100
= 92.85%
209 7
GPS

3

GPS
13:06 . 13:07 . . 2
GPS

(15/17) x 100 = 88.24%
NCCIT2015
7:
209

-

( )
9
20

8: 209
5.

GPS
(Train Tracking System : TTS)

500
GPS 30
6:
111
666

(.)

90.54%

( )

.

TTS

.
15
24 3

(.)
and Networks for Development (ICeND), 2014 Third

International Conference. Electrical and electronic
engineering Department. University of Khartoum, Sudan.
(2014) : 183-188.
[4]
Railways using GPS Receiver. Africon, 2013. National

Institute of Technology, Tiruchirappalli, INDIA. (2013) :
1-5.
[5]
and Technology Mahanakorn University of Technology.

(2555) : 104-109.
[6]
[7]
.
.

.
Hoang Dat Pham, Drieberg M. and Chi Cuong Nguyen.
Development of Vehicle Tracking System using GPS
and GSM Modem. Open Systems (ICOS), 2013 IEEE
Conference. University Teknologi PETRONAS,
Malaysia. (2013) : 89-94.
[8]
Jog S.R., Sutaone M.S. and Badawe V.V..

Ruggedisation methodologies for GPS based Vehicle
Tracking System. Electronics Computer Technology
(ICECT), 2011 3rd International Conference. (2011) :
214-218.
[9]
Rajkumar R.I, Sankaranarayanan P.E. and Sundari G..
Almomani I.M., et al.
GPS and Ethernet based Real Time Tracking System.
Ubiquitous GPS vehicle tracking and
Advanced Electronic Systems(ICAES), 2013 International
management system. Applied Electrical Engineering
Conference. Sathyabama University, Chennai, India.
and Computing Technologies (AEECT) 2011 IEEE
(2013) : 282-286.
11942. (2011) : 1-6.

Fleischer P.B., et al. Design and Development of
GPS/GSM Based Vehicle Tracking and Alert System for
Commercial Inter-City Buses. Adaptive Science &
Technoloby (ICAST), 2012 IEEE 4th International
Conference. Department of Computer Engineering,
University of Ghana. (2012) : 1-6.
[3]
.
GPS
GPRS. Proceeding of the 4th National Conference on
Information Technology. Faculty of Information Science
Jordan Conference. The University of Jordan Amman
[2]
Anish N.K. and Moorthi S.. Intelligent Location

Identification and Passenger-Alert System in Indian

[1]
NCCIT2015
Dafallah H.A.A.. Design and Implementation of an

accurate real time GPS tracking system. E-Technologies
667
NCCIT2015
Adopting a TurnKey Solution Model to Manage Online Survey System

(Surakiat Rattanarod)1 (Nattavee Utakrit)2

1
Surakiat@sueksa.go.th, 2Nattavee.u@kmutnb.ac.th
1.

97.3%
100%

4.57

8

*13*
*
*

**

(IOC)
*

*

*

Abstract
The objective of this research is to develop survey system
online by turnkey solution model to develop survey system
online was developed that quality. And covers all the functions
that should be in the process of doing survey system online.
The system has been developed that test performance
capabilities of the system are at 97.3%, and performance
analysis of up to 100% accurate statistics, which considered
the performance test of the system with the average level in
most. And evaluation of user satisfaction with the overall
average is 4.57, which is the user's satisfaction is very
satisfactory.
Keywords: Survey Online, Turnkey solution, Function,
Statistical Analysis.
668
NCCIT2015
2.3
*[3]*

*[4]*

2)

3)

*[5]*

(Rational Unified Process : RUP)

*[6]*
R

package R Commander

R

2.
2.1

*[1]*

2.2 (one stop service)

*[2]*
4

669
3.
NCCIT2015

*
(IOC) *

3.1

1
3.2

(Check List)
1 (True or False) (Rating Scale)
(Open-ended Form)

1:
3.1.1

3.1.2

670
NCCIT2015
*3)**4)*

2 35
5
30
4.
4.1
4.1.1
3
2:
3.3

MySQL 5.0.51a PHP5
JAVA
3.4

3.4.1
Black-Box Testing

3.4.2 (Beta Testing)

3.4.3
2 1) 2)
3.4.4
4 *1)**2)*
3:
4.1.2

4
4:
4.1.3

671
NCCIT2015
4.1.4

8
5:
4.1.4

2

6
8:
4.1.5
Real Time

9
6:
4.1.5

IOC
7
9:
4.2
1:
S.D.
1. Function Requirement
4.56 0.405
2. Usability Test
4.56 0.422
3. Functional Test
4.64 0.507
4. Performance Test
4.56 0.547
5. Security Test
4.67 0.514
4.60 0.479
7:
672
NCCIT2015
1

4.60 0.479

2:
S.D.
1. Function Requirement
4.57 0.514
2. Usability Test
4.57 0.514
4.57 0.514
2

4.57
0.514
4.3

30

97.3
100 2

[1] * ,*
.* .
, *2552.
[2] ,*
.*.,*2536
[3] * .*
.*

,*2553.
[4] *,*

.*

,*2549.
[5] *,*

.*
,*2555.
[6] *** *.
R .

,*2549.
5.

PHP5
JAVA MySQL
3

673
NCCIT2015

Durable Articles Management System on Android Phone
by Using QR code Technology
(Jutarat Thochai)1 (Nattavee Utakrit)2

1
Dolphin_blue27@hotmail.com, 2nattavee.u@it.kmutnb.ac.th
was 3.78 and the standard deviation score was 0.55 From
testing, the result indicated that the developed system has

5
21
99

3.78 0.55

:
efficiency at a good level. In addition, it can be efficiently

applied for the durable articles management system.
Keywords: Durable Articles Management System, QR
Code Technology, Android.
1.
Abstract
This paper proposed to develop the durable articles
management system using QR Code technology, that is
developed as a tool, for manage and able to examine durable
articles in the faculty of Science and Technology, Pathumwan
Institute of Technology. The system is developed asapplication
on android phone which is used Java programing language
and MySQL as a database management. Theperformance
system is tested by5 experts and satisfactory is tested by
21general users. The result from testing found that the
performance was n the most satisfied level, the percentage
was 99.The satisfactory was in a high level, the mean score
674

[1]

NCCIT2015

[3] QR Code Quick Response
Code 2

1
1: 2 QR Code
[4]
2 (symbol version)
(module size)
40
1-40 1 21x21
4 40
177 x177

[5]
(Open Source) (Google Inc.)

(Android software development kit: SDK)
2.
2.1
[2]

1 2
5,000

5,000

675
2.2
[6]
Mobile Device

Mobile Applications

Mobile
Application
(Operation System)

[7]

[8]
(QR Code)

NCCIT2015

PHP MYSQL

3G

3.
3.1

1)
2)
3)
3.2
3.2.1

3.2.1

676
3.3
UML
Use Case Diagram
(Data Flow Diagram)
Context Diagram
2 3
NCCIT2015
4.4.2

3.5
3.5.1
5
21

3.5.1.1
2
)
)
3.5.1.2
5
)
)
)
)
)
2 : Use Case Diagram
1 :
90 100
70 89
50 69
30 49
1 29
3 : Context Diagram
2:
3.4

Android
Microsoft SQL
Server 2008
4.51 5.00
3.51 4.50
2.51 3.50
1.51 2.50
1.00 1.50
677
NCCIT2015
4 :

5
4.1

4
4.2

5 21
3 4
3 :

4.
50
49
99
50
50
100
100
99
99
1.
2.
3.
4.
5.
6 :
678
3.95
0.57
3.77
0.49
3.87
0.64
3.83
0.57
3.50
3.78
0.50
0.55
5 :
3

99
4 :
NCCIT2015
4

3.78 0.55
5.
[1]
5.1

Android studio JAVA

MySQL

5
21

99

( 3.78 0.55)

5.2

IOS

[2]
[3]
[4]
. 2558. (QR Code)

(). : http://r64.wikidot.com/qr-code.
25 2558
:

(). : http://www.supplyrid.com. 25
2558.
, QR code

.
Denso Wave Incorporated, QR Code.com,
http://www.qrcode.com/index-e.html (accessed August 24,
2011).
[5]
[6]
[7]
[8]
.

, 2551.
.
Mobile Device 2554.
.

, 2554.
,
(QR Code)
, 2554.
679
NCCIT2015

Building Prevention Maintenance System :
The Crown Property Bureau
(Korapat Siriwan)1 (Nattavee Utakrit)2

1
Korapat.sir@gmail.com, 2nattavee.u@it.kmutnb.ac.th

Web
Application ASP.NET
2 1)
2)

5 30

3.84
0.85

4.05 0.88
2
: , ,
was developed by ASP.NET and Microsoft SQL Server

2010 is a database. The system is divided into 2 groups:
1) Officer of Real Estate Management Division 2) Officer of
Construction Management Division. Generate query There
are two tests is to test the effectiveness of an expert system for
5 people and test the satisfaction of a number of 30. The
results from this study illustrated, the satisfaction of this
system was good level ( X = 3.84, S.D. = 0.85 by panel
experts and X = 4.05, S.D. = 0.88 by users). Since X and
S.D. value was higher than the criterion level then accepting
the hypothesis at 5 level. It can be concluded that the
satisfaction system is at a good level.
Keyword: Management System, Maintenance Building,
Prevention.
1.
Abstract
The aims of this research were to develop a
Building Prevention Maintenance Management System,
The Crown Property Bureau, and to find the satisfaction
of the users to the system. The database support system
680
NCCIT2015

(Urban
Renewal)
2.2
(Preventive Maintenance : PM)

2.3
(Time Base Maintenance : TBM)

1

2.4

(Customer Relationship Management)
[1]

80 : 20
20
UML (Unified

(Prevention Maintenance : PM)

2.
2.1

4 1)
2)
3) 4)
3
90

681
NCCIT2015
3
,

Modeling Language)

ASP.NET Microsoft SQL Server 2005

[2]
77.03
63,875

[3]

10

[4]

MySQL
PHP

3.
3.1

1

3.2

2

,

1
682
NCCIT2015

(User Interface)
2

2
1:
3.3

ASP.NET

Microsoft SQL Server 2010 Adobe
Photoshop CS2
3.4

3.4.1
2
3.4.2
2 1)
2)
2:

3
3:

4
3.5
(Arithmetic Mean)
(Standard Deviation)
4.
4.1

Microsoft Vusial Studio 20 10

4:
683
NCCIT2015
0.88

5.

(Prevention
Maintenance)

5:
[1]
4.2
2

4.2.1
1:
3.84
4.09
S.D.
0.85
1.00
4.05
4.22
S.D.
0.88
0.89
.

.

,
2551.
1
3.97
0.93
4.2.1
2:
2
4.13
684
[2] .
.

, 2554.
[3] .

.
, 2554.
[4] .

.
,
2551.
NCCIT2015

Developing a Rice Knowledge Management System in Thailand
(Thiptep Manpholsri)1
(Montean Rattanasiriwongwut) 2

1
cake.ne@hotmail.com, 2montean@kmutnb.ac.th
user groups generally consisted of 20 averages the overall

quality of the expert group was 4.32 and standard deviation

MySQL

2 5
20
4.32 0.57
4.30
0.51

:

0.59 of the average of the group. Typical standard deviation

of 4.30 and 0.51 can be concluded that the developed system
users and experts were satisfied at a good level. Data and
information can be added as well.
Keywords: Rice Knowledge Management in Thailand,
Web Application.
1.

(Explicit Knowledge)
(Tacit Knowledge)

SECI Model
Ontology

Abstract
This research aims to develop a knowledge management
system of rice in Thailand. Using the principles of SECI model
Ontologies technology and techniques for developing web apps
applications. To facilitate the search and collection of information
rice in Thailand. PHP is a language used for application
development and database management system MySQL is a
powerful and informative to meet the needs of users from the
satisfaction evaluation of the program. Questionnaires were used
to collect data from a sample of two groups of 5 experts and
685
(Web Application)

3
4

NCCIT2015
SECI Nonaka Takeuchi

4
1)
Socializatio

2)

Externalization

3)

4)

Tacit Knowledge Internalization
SECI
2.
2.1

2

SECI Model

Nonaka Takeuchi [1]
Nonaka
Takeuchi

1: SECI Model
686
2.2

[2]

(Knowledge) (Meaning)

[3]

SECI
Model
[4]

Search
[5]

[6]

NCCIT2015

(Applied Research)

3.
3.1
UML
Use Case Diagram
2: Use Case Diagram

Use Case Diagram
3
(Admin)

(Username) (Password)
(Username) (Password)

687
NCCIT2015
3.3
2
5 20

(Mean) (Standard
Deviation S.D.)

,

,
,
4
,

3.2

SECI Model Ontology

Socialization (S)

Externalization (E)

,
Combination (C)

Internalization (I)

,
Word press
PHP
PHP MySQL
4.
4.1 SECI Model

3

3 :

688
NCCIT2015
1: 4

S.D.

Tacit Knowledge Explicit Knowledge
1.

2.
3.
4.
4:
4.12 0.56
4.40 0.51
4.50 0.58
4.28 0.62
4.32 0.57
1

4.32

0.57

Explicit Knowledge
4.2
Tacit Knowledge

20 4

2

2:

S.D

1.
4.28 0.52

2.

4.33 0.48
3.
4.2
4.35 0.48
5
4.
4 1
4.26 0.57

4.30 0.51
689
2

4.30 0.51

[4]
[5]
5.

1)

2)

3)

4)

Semantic Web

[6]
[1] Nonaka and Takeuchi, SECI model (Nonaka
[2]
[3]
Takeuchi). Retrieved, August 19, 2007.

. ( Knowledge
Management. : , 2547
,

NCCITW 09

, 2552
690
NCCIT2015
,

, 2551
,

, 2550.

, 2554
NCCIT2015

Management Information System for Monitoring the Accrued Income
by Customer Relationship Management Technique
(Ratchada Khantong)1
(Maleerat Sodanil)3
1, 2
3

1
ratchada.k21@gmail.com, 2montean@it.kmutnb.ac.th, 3msn@kmutnb.ac.th
standard deviation at 0.62 In overall, satisfactions of the

developed system appeared at a good level.

Web
Application PHP MySQL

5
30
4.23
0.65
4.25
0.62

:

Keywords: Web Conference, Business Intelligence,

Customer Relationship Management,
Database
1.*

(Social sourcing)

(Internet)

(Social Media)

(Facebook), (Twitter),

Abstract
The purpose of this research was to develop information
technology system to follow up pending accounts for
accounting section by employing customer relationship
management. The system was developed in the form of web
application using PHP with MySQL as a database
management system. Testing the system effectiveness from 5
experts and 30 users showed that satisfactions of the experts
were rated at 4.23 with standard deviation at 0.65, whereas
satisfactions of the users towards the system were at 4.25 with
691
NCCIT2015
2.
(Web
Conference)
2.1
(Decision Support System : DSS)
[1]

2.2 (Outstanding debt)
[2]

(Patrimony Patrimonies)

2.3

(Web Conference)

(Presentation file)

,

(Web Conference)

(Customer Relationship Management)
[3] (CRM)

4 1) (Information)

2) (Process)

3) (Technology)

[4]

4) (People)

692
NCCIT2015

(Database
Management System)

DBMS

2.4 (Business Intelligence)
Steve Nancy [5]
(Business Intelligence)

2.5 (Database)
[6 ] Database
(Database)

(Database System)

3.*
3.1

3.1.1

(Excel File)

,

1
Microsoft Excel
1:
3.1 . 2

693

3.2

MySQL PHP

1
(Web Conference)

Sale CRM
2

(Web Conference)
3

(Database)
4

6
2
NCCIT2015
(Context Diagram)

,
,

3
3:
0

0 4
1
4
4: 0
3.3

MySQL PHP
2:
694
NCCIT2015
6 :
3.3.3

, , ,
, , ,
,
.PDF, .CSV 7
Web based
.PDF .CSV
3.3.1 (Contract)
(Preview)

, , ,
,
5
7 :
4.

,

,
, ,
5
, ,
,
30

4.1

5 1
5 :
3.3.2 (Invoice)
(Preview)

,
, ,
, , ,
6
695
1 :
1. Functional Requirement Test

2. Usability Test
3. Accuracy Test
4. Performance Test
5. Security Test
S.D.
4.43
0.57
4.16
0.69
4.28
0.68
3.88
0.67
4.40
0.51
4.23
0.65
30 4.25
0.62

5.

PHP
MySQL

5.1
5.2 iPad,
Tablet

5
4.23
0.65

4.2
3 2
2 :
1. Functional Requirement Test

2. Usability Test
3. Functional Test
S.D.
4.27
0.61
4.26
0.64
4.21
0.63
4.25
0.62
NCCIT2015

[1]
Keen, P.G.W. and Scott Morton, M.S. Decision Support

Systems: An Organizational Perspective, Addison-Wesley,
Reading, MA, 1978.

30
4.25
0.62

5
4.23
0.65

[2]
[3]
[4]
[5 ]
, 13,
, , 254.5
, 8 CRM,
8, , 2546.
. .
Steve Williams and Nancy, Williams., The Profile Impact

of Business Intelligence, MorganKaufmann Publishers,
2007.
[6]
. Database, Database
System, Database Management System [Online], 2011
696
NCCIT2015

The Development of the Model of Cooperative Learning Activities of
Flipped Classroom by using eDLTV Media
(Sommai kaewkanha)1 (Worapapha Arreerard)2
(Tharach Arreerard)3
1

2,3

1
Sommai777@hotmail.co.th, 2dr.worapapha@hotmail.com, 3dr.tharach@hotmail.com
5)

( X =4.81).
:

1)
2)

3)

9 3
1) 2)
3)

( X ) (S.D.)
1)
4 1.1)
1.2) 1.3)
1.4)
1.5)
( X =4.69) 2)

4 1)
2) 3) 4)

4 1) 2)
3) 4)
Abstract
This research aimed 1 )
to develop the model of
cooperative learning activities of flipped classroom by

using eDLTV media, 2 ) to develop the steps of cooperative
learning activities of flipped classroom by using eDLTV
media and 3 ) to study the expertise towards the model and
steps of cooperative learning activities of flipped
classroom by using eDLTV media. The target group of this
research included 9 experts from 3 different groups: 1 )
Information Technology, 2 ) Computer academics, and 3 )
academics graduated from the university. The tools used in
this research were: the expertises questionnaire towards
the model and the steps of cooperative learning activities of
flipped classroom by using eDLTV media. The statistics
used in study were: mean ( X ) and standard deviation
(S.D.). The research results found that 1 ) the model of
cooperative learning activities of flipped classroom by
using eDLTV media was consisted of 5 components: 1 .1 )
policies and relevant principles, 1 .2 ) parents, 1 .3 )learning
management activity,1 . 4 ) information technology and
communications and 1 .5 ) indicators. The overall expertise
697
NCCIT2015
at the highest level ( X =4.81)
[2]

Keywords: Activity Development, Cooperative
[3]
was at the highest level ( X =4.69) and 2) according to the

result of the development of the steps of cooperative learning
activities of flipped classroom by using eDLTV media, the
activities could be separated as outside activities, including
4 steps: 1) learning, 2) additional research, 3) explanation
and 4) parental examination and approval of students work,
and inside activities including 5 steps: 1) knowledge review,
2) knowledge exchange, 3) cooperative learning activities of
students, 4) work presentation and 5) teacherwork assignment.
The overall expertise on the model of cooperative learning
activities of flipped classroom by using eDLTV media was

33
1-6

(O-NET) 6
2555

( )

[4]

Learning, Flipped Classroom, eDLTV Media.
1.

[1]

(The
Flipped Classrooms)

Flipped Classroom

698
NCCIT2015
(Mastery
Learning)

[2]

2.
2.1

2.2

2.3

3.

4
1 2 1

[5]
[6]

[3]

4.
4.1

9 3
1) 2)
3)
4.2

699
NCCIT2015
4.3
4.3.1
4.3.2
4

4.3.3

4.3.4
4.3.5

4.3.6

4.3.7

4.3.8
4.4

( X ) (S.D.)
[ 7 ]
4.51 5.00
3.51 4.50
2.51 3.50
1.51 2.50
1.00 1.50
1 :
1
1)

2)

3)

4)

)Social
Network)
5)
5.1.2

1
5.
5.1

5.1.1
4 1
700
NCCIT2015
1:
1.1
1.2
1.3
1.4

1.5
S.D.
X
4.67 0.50
4.55 0.73
4.89 0.33
4.89 0.33
4.44
4.69
0.73
0.48
1

( X =4.69, S.D. = 0.48)
5.2

5.2.1
2
2:
1) 4
(1.1)
(1.2)
(1.3)
(1.4)

2) 5
(2.1)
701
NCCIT2015
4 1) 2)
3) 4)
5
1) 2) 3)
4) 5)

(2.2)
(2.3)
(2.4)
(2.5)
5.2.2

2
2:

S.D.
X
1.
4.75 0.38
1.1
4.86 0.30
1.2
4.78 0.41
1.3
4.85 0.37
1.4
4.44 0.70

2.
4.87 0.27
4.96 0.11
2.1
2.2
4.96 0.11
2.3
4.85 0.37

2.4
4.78 0.42
2.5 4.78 0.49
4.81 0.33
[ 1 ] .
IT. 1 2556
http://www.dailynews.co.th/Content/education/1701
/67 +IT
[ 2 ] . (2556).
21. .2556 1
http://www.kan.1go.th/tablet-for-education.pdf.
[ 3 ] .
.

10 9-10 2557.
[ 4 ] 33.

(O-NET) 2555.:
.2556.
[ 5 ] Slavin, R.E. Cooperative Learning. Massachusetts
Allyn and bacon, 1990.Schoolwires. The Flipped
Classroom : A New Way to Look at
Schools.Available from 2013, May 10
http://www.schoolwires,com/cons/lip3/flipped_
classroom_0612.pdf.
[ 6 ] . :
.
. . 2553.
[7 ] , , 7,
: , 2545.
2

( X = 4.81,S.D. = 0.33)

6.

5 1)
2) 3)
4)
5

702
NCCIT2015
AUTHOR INDEX
Page
Aiyapan Eagobon
247
Amonrat Prasitsupparote
217
Amornchai Manopiya-anan
149
Anamai Na-udom
31
Anisara Pensuk Tibkaew
223, 283
Annop Sakachant
168
Anusorn Untao
137
Aongart Aun-a-nan
80
Apichat Lagdee
559
Apichaya Khwankaew
217
Apirak Tooltham
68
Apiwat Sawatdirat
162
Apiwut Wattanachai
143
Atikhom Siri
74
Atip Jundee
55
Banyapon Poolsawas
277
Boonsiri Masan
517
Bukhoree Sahoh
307
Burin Rujjanapan
229
Chaiporn Jaikaeo
92
Chaiwiwat Jantasarn
24
Chaiyaporn Khemapatapan
18
Chalermpong Intarat
487
Chanarong Tamasena
553
Charinthorn Aumgr
301
Chetarin Wongsin
Dechawut Wanichsan
493, 642
Duangjai Jitkongchuen
13
703
NCCIT2015
AUTHOR INDEX
Page
Dusanee Supawantanakul
211
Ekapong Chuasuwan
Jakkarin Suksawatchon
390
Jakkree Srinonchat
162, 168
Jantima Polpinij
1, 259
Jaratsri Rungrattanaubol
31
Jeerasak Nampradit
346, 444
Jeerawan Nokeangthong
535
Jerasak Tubtong
143
Jirawat Thaenthong
143
Jongkol Janruang
271, 412, 432
Julaluk Watthananon
499
Jutarat Thochai
674
Kamol Boonlom
74
Kangkit Warayanon
271
Kanisorn Jeekratok
320
Kantida Nanon
217
Kassuda Kamluewong
74
Ketsraporn Sengprathom
193
Khamron Sunat
43
Kitti Surpare
235, 326
Konjanat Jantawong
289
Korapat Siriwan
680
Kraisak Kesorn
61, 418, 425
Kriengkrai Bhuvanij
541
Kritpapon Thitichaimongkhol
174
Kulthon Kasemsan
94
Laongthip Maturos
211
704
NCCIT2015
AUTHOR INDEX
Page
Linda Sobin
456
Mahasak Ketcham
Maleerat Sodanil
181, 187, 608

118, 124, 131, 339, 359, 456, 475, 487, 571, 691
Mana Sopa
320
Meechai Lohakan
326
Monchai Tiantong
211
Mongkol Seemawong
529
Montean Rattanasiriwongwut
112, 450, 685, 691
Mulliga Khwankue
Nakornthip Prommol
295
Nakornthip Prompoon
621
Naruemon Mi-iam
332
Nathakarn Boonrod
481
Nattakit Srikarnjanaperd
Nattavee Utakrit
614, 668, 674, 680
Nattawat Payarach
553
Nawaporn Wisitpongphan
529
Nilubon Tongchai
469
Nipon Sungsuthi
320
Nitat Ninchawee
493, 642
Nitipat Petmongkonjaras
371
Nittaya Kamban
314
Nivet Chirawichitchai
535
Nonthachai Dubtuk
49
Noppamas Pukkhem
289
Nopparat Pojjiraporn
346
Noppasorn Wiriyadilok
505
Nuengwong Tuaycharoen
247, 253
705
NCCIT2015
AUTHOR INDEX
Page
Nuttaluck Boonluecha
589
Nuttanan Pipitpattanaprap
630
Nuttanont Hongwarittorrn
149
Olarn Rojanapornpun
404, 589
Onjira Sitthisak
223, 283
Paisan Simalaotao
596
Pakorn Watanachaturaporn
384
Pansakorn Worawimolwanich
425
Paphonput Sopon
259
Passana Ekudompong
205
Patcharapol Norasarn
614
Patcharida Wisaiket
475
Patpong Armornwong
235
Pattanarat Putla
99
Penprapa Bootla
404
Phannika Kongjuk
493, 642
Phatcharaporn Sitikomfu
124
Phayung Meesad
352, 371
Phongphodsawat Sangthong
662
Phongthanat Sae-Joo
511
Phonphan Posrikaew
398
Phornsiri Phawapoothayanchai
418
Phumin Hongma
68
Phuriphong Phumirawi
217
Pichanita Seensat
131
Ponghathai Kanjanapart
112
Pongpisit Wuttidittachotiti
517, 662
Pongsakon Bamrungthai
332
706
NCCIT2015
AUTHOR INDEX
Page
Pornchai Mongkolnam
404
Pornpimol Chaisanguan
571
Pornpon Thamrongrat
37
Pornthep Rojanavasu
24
Pramool Suksakaophong
352
Prasong Praneetpolgrang
535, 541
Premyupha Armonsak
621
Prudtipong Pengsiri
371
Pudsadee Boonrawd
523, 649, 656
Punyaphol Horata
43
Ratchada Khantong
691
Rawinun Praserttaweelap
156
Rud Wangrungarun
547
Rueangchai Saiprasopsuk
149
Sakchai Tangwannawit
199, 346, 630, 636
Salintip Sudsanguan
44
Salisa Hongsi
187
Sanun Karnka
412
Sanun Karnka
432
Sarawut Waleetorncheepsawasd
241
Sarintorn Wongyoksuriya
223
Sarunyoo Boriratrit
43
Sasakorn Pichetjamroen
384
Sataya Boonchaleaw
92
Shavan Tansap
656
Sirapat Chiewchanwattana
43
Siraya Sitthisarn
307
Sirinthorn Watcharaphuetphol
432
707
NCCIT2015
AUTHOR INDEX
Page
Siripinyo Chantamunee
Siriporn Imporn
547
Sirirak Khanthanurak
205
Sithipong Chimthai
436
Sitichai Chumjai
253
Siwaporn Klabpadung
462
Somjet Poosri
559
Somkuan Faisanoi
412
Sommai kaewkanha
697
Somnuk Puangpronpitag
86, 99
Sompong Valuvanathon
137
Somsak Wichaikit
359
Somyot Kiatwanidvilai
55, 156
Songkran Totiya
602
Sujittra Sarakon
31
Sukuma Uamcharoe
564
Sunantha Sodsee
371
Surakiat Rattanarod
668
Sureewan Jangjit
106
Sutasinee Yokradubshan
608
Suteera Puengsawad
332
Taksaporn Phanjhan
636
Tanaporn Jesadamethakajorn
649
Tanasaneee Phienthrakul
371
Tanun Jaruvitayakovit
265
Taratip Suwannasart
241
Taweep Janjaroen
283
Taweesak Rattanakom
493, 642
708
NCCIT2015
AUTHOR INDEX
Page
Thanawat Chalermpong
265
Thanawut Thanavanich
74
Tharach Arreerard
697
Thawatchai Sarawong
547
Theerasak Nitlarp
571
Theerasak Thongyan
86
Therdpong Daengsi
517
Thimaporn Phetkaew
37, 49
Thippaya Chintakovid
193, 398, 481
Thiptep Manpholsri
685
Thongparn Suksamer
259
Tichakorn Netsuwon
61
Tipparat Sinlapaphongwarakorn
18
Tulanun Jiangpradit
295
Twittie Senivongse
174, 505, 571, 602
Ubonrat Sirisukpoca
596
Ujchara Pooraya
339
Upady Hatthasin
553
Uraiwan Inyaem
364
Ureerat Suksawatchon
390
Usanad Ua-apisitwong
582
Veerachai Khonchoho
80
Wanida Saetang
199
Waranya Prachanban
450
Warissara Suranun
181
Wasin Treesinthuros
271
Watcharavut Deklee
143
Watcharawalee Tangkuptanon
462
709
NCCIT2015
AUTHOR INDEX
Page
Worapapha Arreerard
211, 559, 697
Worasit Choochaiwattana
314
Worawut Yimyam
80
Yuttana Lungkatoong
118
710

All Papers in NCCIT2015

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

All Papers in NCCIT2015

Uploaded by

Copyright:

Available Formats

The Eleventh National Conference on Computing and Information Technology

Author Index ......................................................................... 703

The Eleventh National Conference on Computing and Information Technology

The Eleventh National Conference on Computing and Information Technology

MESSAGE FROM KMUTNB PRESIDENT

(Professor Dr.Teravuti Boonyasopon)

The Eleventh National Conference on Computing and Information Technology

The Eleventh National Conference on Computing and Information Technology

The Eleventh National Conference on Computing and Information Technology

MESSAGE FROM GENERAL CHAIR

The Eleventh National Conference on Computing and Information Technology

Associate Professor Dr. Phayung Meesad

The Eleventh National Conference on Computing and Information Technology

FernUniversitt in Hagen, Germany

Chemnitz University, Germany

Edith Cowan University, Australia

Hanoi National University of Education, Vietnam

Gesellschaft fr Informatik (GI) , Germany

Mahasarakham University, Thailand

Kanchanaburi Rajabhat University, Thailand

Nakhon Pathom Rajabhat University, Thailand

Rajabhat Mahasarakham University, Thailand

The Eleventh National Conference on Computing and Information Technology

Rajamangala University of Technology Krungthep , Thailand

Rajamangala University of Technology Thanyaburi, Thailand

Prince Of Songkla University, Phuket Campus, Thailand

National Institute of Development Administration, Thailand

Council of IT Deans of Thailand (CITT) , Thailand

The Eleventh National Conference on Computing and Information Technology

CONFERENCE ORGANIZATION COMMITTEE

Assoc. Prof. Dr. Phayung Meesad, KMUTNB

Technical Program and Secretary :

Asst. Prof. Dr. Sirapat Boonkrong, KMUTNB

Asst. Prof. Dr. Nattavee Utakrit, KMUTNB

The Eleventh National Conference on Computing and Information Technology

The Eleventh National Conference on Computing and Information Technology

TECHNICAL PROGRAM COMMITTEE

Patharawut Saengsiri, TISTR

Anirach Mingkhuan, KMUTNB

Patrawadee Tanawongsuwan, NIDA

Apida Roonwat, MSU

Phayung Meesad, KMUTNB

Arunee Intrapairoth, RMUTT

Pilapan Phonarin, MUTK

Burasakorn Yoosuk, RMUTT

Pipat Hiranvanichakorn, NIDA

Burin Rujjanapan, NATION

Pongpisit Wuttidittachotti, KMUTNB

Chatchawin Namman, UBU

Pramote Kucharoen, NIDA

Choochart Haruechaiyasa, NECTEC

Prasong Praneetpolgrang, SPU

Dech Thammasiri, NPRU

Pudsadee Boonrawd, KMUTNB

Gamkarn Somprasertsri, MSU

Sakchai Tangwannawit, KMUTNB

Herwig Unger, CRU

Chesada Chartree, SSKRU

Sirapat Boonkrong, KMUTNB

Jamornkul Laokietkul, CHANDRA

Sompong Valuvanathorn, UBU

Jiratta Phuboon-ob, MSU

Sucha Smanchat, KMUTNB