> Important Dates
Special session proposal deadline: August 30, 2013
Special session notification: September 13, 2013
Paper submission extended deadline: October 13, 2013
Paper acceptance notification (Postponed): November 15, 2013
Camera-ready submission extended deadline: December 20, 2013
Early-bird registration extended deadline: December 20, 2013
Conference dates: March 19-21, 2014






Sponsored By

About The International Conference On Computer & IT

The International Conference On Computer & IT will provide parallel sessions with contributed papers on the related topics as follows: Computer Networks, Cloud Communication and Networking, Data Mining, Artificial Intelligence, Computational Theory, Information System, High Performance Computing, Computer Security, Software Engineering, Distributed and Parallel Computing, Web Services and Internet Computing, Multi-agent Systems, Human Computer Interaction, etc.


Technical Conference Co-chairs
Assoc. Prof. Dr. Sartra Wongthanavasu
Khon Kaen University, Thailand

Sartra Wongthanavasu received his B.S. in Mathematics from Khon Kaen University, Thailand, M.S. in Operations Research from National Institute of Development Administration, Thailand, M.S. in Computer Science from Illinois Institute of Technology, USA., and Ph.D. in Computer Science from Asian Institute of Technology, Thailand, in 1982, 1985, 1996 and 2001, respectively. He has been a faculty member of Khon Kaen University since 1990. He is currently an associate professor and also serves as a chairman of administrative committee of the English doctoral program in computer science, Department of Computer Science, Khon Kaen University. His research interests are mainly machine learning, cellular automata, computer vision and their applications. His MLIS (Machine Learning and Intelligent Systems) laboratory operates the research in machine learning through cellular automata and knowledge engineering (CAKE in brief) for graduate students research and a number of projects.


Asst. Prof. Dr. Marong Phadoongsidhi
King Mongkut's University of Technology, Thonburi (KMUTT), Thailand

Marong Phadoongsidhi is an assistant professor at the Department of Computer Engineering, Faculty of Engineering, King Mongkut’s University of Technology Thonburi. He received his B.A. degree in electrical engineering from Brown University and received his M.Sc. and Ph.D. degrees in electrical and computer engineering from University of Wisconsin-Madison. His research interests include integrated circuit testing, fault tolerant systems, high performance computing, and enterprise/mobile software development.


Invited Speakers
Assoc. Prof. Dr. Sartra Wongthanavasu
Khon Kaen University, Thailand

Title : Cellular Automata Learning Algorithm for Classification

Abstract
     Cellular Automata (CA) were proved by John Von Neumann as universal computation model. This means that CA are capable of modeling any problems to arrive at the solutions. Since then, researchers have paid efforts to seek the possible classifiers being constructed on this model for several decades. However, there are few papers to date has reported classification with limited applications using cellular automata. This paper presents a novel state of the art classification model on the basis of cellular automata. The proposed classifier was developed on the proposed Decision Elementary Cellular Automata (DECA). It comprises double rule vectors and a decision function. Its structure comprises two layers; the first layer is employed to evolve an input pattern into feature space and the other interprets the pattern in the feature space to binary answer through the decision function. For performance evaluation, six datasets consisting of binary and non-binary features are implemented in comparison with SVM with the optimal kernel using k-fold cross validation. In this respect, the proposed method outperforms SVM for binary featured datasets, and provides equivalent and better results on average for non-binary features.

Sartra Wongthanavasu received his B.S. in Mathematics from Khon Kaen University, Thailand, M.S. in Operations Research from National Institute of Development Administration, Thailand, M.S. in Computer Science from Illinois Institute of Technology, USA., and Ph.D. in Computer Science from Asian Institute of Technology, Thailand, in 1982, 1985, 1996 and 2001, respectively. He has been a faculty member of Khon Kaen University since 1990. He is currently an associate professor and also serves as a chairman of administrative committee of the English doctoral program in computer science, Department of Computer Science, Khon Kaen University. His research interests are mainly machine learning, cellular automata, computer vision and their applications. His MLIS (Machine Learning and Intelligent Systems) laboratory operates the research in machine learning through cellular automata and knowledge engineering (CAKE in brief) for graduate students research and a number of projects.


Assoc. Prof. Dr. Ekkarat Boonchieng
Chiang Mai University, Thailand

Title : Performance and Security Issue on Open Source Private Cloud

Abstract
     Open Source Private Cloud Software is widely used in many organizations. Eucalyptus is one of the popular open source private cloud software for building private and hybrid clouds. The benefits of this open source software for private clouds are highly efficient scalability, organization agility, and increased trust and control for IT. These studies perform tests on performance of the services of websites by using performance test tools – LoadUI and Web Performance Load Tester with some security issues purposed. The six evaluation of the performance tests are 1) average response time 2) peak response time 3) error rate of data transmission 4) throughput 5) request service per second and 6) amount of concurrent user in the system. By comparing performances with dedicated server (not on cloud), the test results from these two programs show average response time of website on cloud server is less than website on dedicated server, peak response time of website on cloud server is less than website on dedicated server, error rate of data transmission is zero on both website on cloud server and dedicated server, throughput of website on cloud server is higher than website on dedicated server, request service per second of website on cloud server is higher than website on dedicated server and amount of concurrent user in the system of website on cloud server is higher than website on dedicated server.

Ekkarat Boonchieng received his B.Sc. in Computer Science from Khon Kaen University, Thailand, M.S. in Computer Science from University of New Haven, USA, Ph.D. in Computer Science from Illinois Institute of Technology, USA. in 1991, 1993 and 2000, respectively.  He has been a faculty member of Chiang Mai University since 1993.   He is currently an associate professor and serves as a committee in Thai Biomedical Engineering Research Association.  His research interests are mainly biomedical engineering, medical image processing, computer networking and their applications.  He receives research grants from National Research Council of Thailand for developing application of cloud computing in the hospital drug information and Thai Health Promotion Foundation for developing primary health care database system using mHealth throughout the country.


Assoc. Prof. Dr. Sanpawat Kantabutra
Chiangmai Uinversity, Thailand

Title : Multi-Sources Simultaneous Communication in the Wireless Mobility Model is NP-complete.

Abstract
     In this article we consider a mobility model M = (S, D, U, L, R, V, C, O), where S is a set of sources, D a set of directions, U a set of users, L a set of user movements, R a set of source movements, V a set of velocities of sources, C a set of source coverages, and O a set of obstacles. Particularly, we study a problem called Multi-Sources Simultaneous Communication Problem in this model. This problem is stated as follows: given a mobility model M = (S, D, U, L, R, V, C, O), k pairs of distinct sources {{s1,s1'}, {s2,s2'},…,{sk,sk'}}, and a time t ∈ N, can all k pairs of sources simultaneously communicate throughout the duration t of the model without sharing a source? We show that the complexity of this problem is at least as hard as the One-In-Three 3-Satisfiability unless P = NP.

Sanpawat Kantabutra received a PhD in Theoretical Computer Science from Tufts University in the United States of America in 2001. He is currently an associate professor of Computer Science in the Theory of Computation Group in the Department of Computer Engineering in Chiang Mai University. In addition, he is also a Thailand Research Fund career development scholar in the field of theoretical computer science. His areas of research are design and analysis of algorithms, algorithm complexity and intractability, parallel algorithms and architectures, graph theory and algorithms, and combinatorics. He has published his research regularly in leading international conferences and journals and has served as a program committee member for several international conferences. He has also regularly refereed papers for leading journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE Signal Processing Letters, and IEEE Transactions on Systems, Man, and Cybernetics. In addition, he has also been invited to teach and give research talks nationally and internationally.  


Asst. Prof. Dr. Sanun Srisuk
Nakhon Phanom University, Thailand

Title : Bilateral filtering as a tool for image smoothing with edge preserving properties

Sanun Srisuk is a Dean and an Assistant Professor of faculty of industrial technology, Nakhon Phanom University. He received Doctor of Engineering in Computer Engineering from Mahanakorn University of Technology in 2003. He was with University of Surrey where he was a visiting researcher. His research interests include face recognition, image processing, bilateral filtering, iris recognition and total variation minimization.


Asst. Prof. Dr. Athasit Surarerks
Chulalongkorn University, Thailand

Title : Fast Digit-Set Conversion for Flexible Interval Representation System

Abstract
     Many researches in computer arithmetic domain concerns how computational time can be speeded up. They focussed on introducing high speed computing techniques. However, the computation may not always produce the exact value. Therefore, interval arithmetic algebra is established to handle the problem. An interval usually uses a pair of numbers in order to guarantee that uncertainty in the input data can be represented in this system. Both of space used and computational time for interal arithmetic are very high. Flexible interval representation system is introduced for solving such problems. Our binary system contains some additional flexible or interval digits. The computational space can be reduced up to twenty-five percents comparing with space used for the classical signed-digit interval representation system. In this paper, we focus on how a parallel arithmetic operation, especially digit-set conversion, can be applied for the flexible interval representation system. We propose a novel parallel digit-set conversion algorithm together with the proof of corectness for this system.

Athasit Surarerks received his Doctoral degree in Computer Algorithmic from Universite Pierre et Marie Curie (PARIS VI), Paris, France. His research concerns computer arithmetic and non-classic number representation systems. Many number systems and their arithmetic operation algorithms have been studied. Many theoretical results have also been introduced together with their proof. His interesting invention is a number system called “Flexible interval representation system” which its operations are demonstrated to be computed in parallel manner. Now, he is an assistant professor at the Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand.


Dr. Wimol San-Um
Thai-Nichi Institute of Technology, Thailand

Title : Digital Image Encryptions using Robust Chaotic Maps for Private Data Protection in Cloud Database

Abstract
     Recent advances in cloud databases have led to great demand for secured data storage through cryptosystems. Conventional cryptography such as DES, IDEA, AES, and RSA algorithm require large computational time and high computing power, especially for the images with large data capacity and high correlation among pixels. As an alternative, chaos-based encryption aspects offer high flexibility in encryption design processes and acceptable privacy due to vast numbers of chaotic system variants and numerous possible encryption keys. This paper presents a digital image encryption using robust chaotic maps for private data protections in cloud database. Various one-dimensional discrete-time chaotic maps are investigated and compared in terms of encryption performances. Experiments are performed in MATLAB using standard colour images. Nonlinear dynamics of the chaotic maps were initially investigated in terms of Cobweb map, chaotic attractor, Lyapunov exponent spectrum, bifurcation diagram, and 2-dimensional parameter spaces. Encryption qualitative performances are evaluated through pixel density histograms, 2-dimensional power spectral density, key space analysis, key sensitivity, vertical, horizontal, and diagonal correlation plots. Encryption quantitative performances are evaluated through correlation coefficients, NPCR and UACI. Demonstrations of wrong-key decrypted image are also included.

Wimol San-Um received B.Eng. Degree in Electrical Engineering and M.Sc. Degree in Telecommunications in 2003 and 2006, respectively, from Sirindhorn International Institute of Technology (SIIT), Thammasat University in Thailand. In 2007, he was a research student at University of Applied Science Ravensburg-Weingarten in Germany. He received Ph.D. in mixed-signal very large-scaled integrated circuit designs in 2010 from the Department of Electronic and Photonic System Engineering, Kochi University of Technology (KUT) in Japan. He is currently with Computer Engineering Program, Faculty of Engineering, Thai-Nichi Institute of Technology (TNI). He is also the head of Intelligent Electronic Systems (IES) Research Laboratory. His areas of research interests are chaos theory, artificial neural networks, control automations, digital image processing, secure communications, and nonlinear dynamics of chaotic circuits and systems.


Assoc. Prof. Dr. Paisarn Muneesawang
Naresuan University, Thailand

Title : A Re-Ranking Approach to Video Retrieval on the Peer-to-Peer Network

Abstract
     This paper presents a re-ranking method for retrieval of video clips in a distributed database system. The method employs a peer-to-peer architecture to implement a network of distributed computing and storage of video files. The retrieval can be started by a query node forwarding query packets to its peer nodes, and followed by the pseudo-relevance feedback within all peers. The retrieval accuracy can be improved by the forward-backward propagation of signal between the query node and the peer nodes. This process is done automatically and has no requirement for the transmission of video files over the network during the pseudo-relevance feedback learning process. This reduces the required bandwidth utilization. Based on the experimental result, the proposed re-ranking method appears to be very effective for retrieval of video clips stored in the peer-to-peer database and converges in a few iterations.

Paisarn Muneesawang received his Ph.D. degree from the school of Electrical and Information Engineering at the University of Sydney in 2002. In 2003-2004, he held a Post-Doctoral Research Fellow position at Ryerson University, Canada. In 2005-2006, he was an assistant professor at the College of Information Technology, the University of United Arab Emirates, Al-Ain, UAE. He has held a Visiting Professorship at Nanyang Technological University, Singapore, and Ryerson University, Canada since 2012 and 2013 respectively. He was the Vice President of Administrative Affairs, Naresuan University, Thailand. He is currently an Associate Professor at Naresuan University.
     His research interests include multimedia signal processing, computer vision, and machine learning. He was an organizing committee member of the 2000 IEEE Pacific-Rim Conference on Multimedia and 2000 IEEE Workshop on Neural Networks for Signal Processing, which were held in Sydney, Australia. He has also co-organized a conference special session on “Moving from Content to Concept Based Image/Video Retrieval” in the 2004 IEEE Pacific-Rim Conference on Multimedia, Tokyo, Japan. In 2004, he co-guest-edited the special issues on “Information Mining from Multimedia Databases” for the EURASIP Journal on Applied Signal Processing. In 2011, he co-guest-edited the special issues on “Advances in Multimedia Computing, Communications and Applications,” for the Journal of Signal Processing Systems. He has served as registration Co-Chair for the International conference on multimedia & expo (ICME’06), and technical program Co-Chair for the 2009 Pacific-Rim Conference on Multimedia. He is a co-author of two books, Multimedia Database Retrieval: a Human-Centered Approach, Springer (2006), and Unsupervised Learning - A Dynamic Approach, Wiley-IEEE Press (2013). He is a co-editor of the book, Advances in Multimedia Information Processing - PCM 2009, Springer (2009).


Special Sessions
To be announced.



 

iEECON2014 International Electrical Engineering Congress 2014 Pattaya City, Thailand, March 19-21, 2014
Copyright © 2014 iEECON, All Rights Reserved ® Design provided by Telco MUT Team.