{"title":"Utilising fuzzy logic to improve Wi-Fi security","authors":"A. Naqvi","doi":"10.1109/ICTKE.2013.6756275","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756275","url":null,"abstract":"The imperative aspect for any wireless network node is to know the authenticity of its association. Any rogue node associations can seriously compromises, not only the wireless node, but the entire wireless network as well. Many researchers have proposed protocols to overcome this issue. However, these protocols do not effectively solve the rogue network issue. Henceforth, we propose the Security Swarm Wireless Access Algorithm which is a functional layer model that utilizes fuzzy logic. Our algorithm improves the security of the wireless associations of a node in a rogue node scenario.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125559402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure online exams on thin client","authors":"Tassanan Treenantharath, P. Sutheebanjard","doi":"10.1109/ICTKE.2013.6756287","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756287","url":null,"abstract":"Nowadays, the online exam is become popular because the examination often have multiple-choice questions that can be quickly automated evaluation and graded by automated test scoring machines known as online exams. This paper proposed the secure online exams on thin client. The client in this system can be used older computer to reduced total cost of ownership. The proposed system used the Ubuntu operating system; the LTSP and the LXDE desktop manager to provide the thin client infrastructure in a dedicated exam room. The quiz activity was managed by Moodle that is a popular course management system.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129991545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Workflow mining: Discovering process patterns & data analysis from MXML logs","authors":"P. Porouhan, N. Jongsawat, W. Premchaiswadi","doi":"10.1109/ICTKE.2013.6756289","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756289","url":null,"abstract":"Contemporary workflow management systems are determined by precise process models, i.e., a totally specific workflow design is necessary so as to discover a given workflow process. Creating a workflow design is a complex time-consuming process and characteristically there are conflicts and discrepancies between the real-time workflow processes and the processes as professed by the management. Consequently, we recommend a method for process mining. This method employs workflow logs to determine the workflow process as it is truly being implemented. The process mining method proposed in this paper can cope with noise and can also be exercised to authorize workflow processes by revealing and measuring the discrepancies between prescriptive models and factual process executions.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132082582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multiscale entropy based compressive sensing for electrocardiogram signal compression","authors":"L. Sharma","doi":"10.1109/ICTKE.2013.6756267","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756267","url":null,"abstract":"Classically, signal information is believed to be retrieved, if it is sampled at Nyquist rate. Since last decade compressive sensing is evolving which shows the signal reconstruction ability from insufficient data points. It reconstructs the signal from a set of reduced number of sparse samples that is lesser than Nyquist rate. It is required that the signal should be sparse in some basis. In wavelet domain, electrocardiogram signal shows sparseness. This paper suggests applying compressive sensing at wavelet scales. Also, the number of measurements taken at wavelet scales plays important role for successful reconstruction and to capture the maximum diagnostic information of electrocardiogram signal. At wavelet scales, the numbers of measurements are taken based on multiscale entropy. At scales, it uses random sensing matrix with independent identically distributed (i.i.d.) entries formed by sampling a Gaussian distribution. The compressed measurements are encoded using Huffman coding scheme. The reconstruction of signal is achieved by convex optimization problem by L1-norm minimization. Reconstruction error introduced due to L1-norm minimization and coding is evaluated using percentage root mean square difference (PRD), wavelet energy based diagnostic distortion (WEDD), root mean square error (RMSE), normalized maximum amplitude error (NMAX) and maximum absolute error (MAE). The highest compression ratio value is found 6.92:1 with PRD and WEDD values 8.18% and 2.33% respectively.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126497074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Three-input single-output current-mode universal filter using a MCDTA","authors":"M. Kumngern, Kulasak Khwama, S. Junnapiya","doi":"10.1109/ICTKE.2013.6756281","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756281","url":null,"abstract":"This paper presents a new three inputs and one output current-mode universal filter employing one modified current differencing transconductance amplifier (MCDTA) and two grounded capacitors. The filter can realize low-pass, bandpass, high-pass, band-stop and all-pass responses by appropriately connecting the input terminals. For realize filtering functions, without component-matching conditions and inverting-type input signal requirements. The natural frequency can be electronically controlled by the bias currents of MCDTA. The active and passive sensitivity of the filter are low. The PSPICE simulation results are performed to confirm the presented theory.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130203695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tunable sinusoidal oscillator using CCII with variable current gain","authors":"M. Kumngern, P. Phatsornsiri, K. Dejhan","doi":"10.1109/ICTKE.2013.6756280","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756280","url":null,"abstract":"This paper presents a new electronically tunable sinusoidal oscillator. The proposed oscillator is consisted of two second-generation current conveyors with variable current gain, two grounded capacitors, one grounded resistor and one floating resistor. Unlike previously oscillators, the condition and the frequency of oscillation of this oscillator can be controlled electronically and independently by adjusting the current gains of current conveyors. The proposed circuit is beneficial to monolithic integrated circuit implementation using only grounded capacitors. Simulation results that confirm the theoretical predictions are also given.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134090290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sentiment classification by a hybrid method of greedy search and multinomial naïve bayes algorithm","authors":"N. Chirawichitchai","doi":"10.1109/ICTKE.2013.6756285","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756285","url":null,"abstract":"In this paper, we proposed sentiment classification framework focusing on the hybrid method of greedy and multinomial naive bayes algorithm. We found greedy search feature selection most effective in our experiments with multinomial naive bayes algorithm. We also discovered that the multinomial naive bayes is suitable for combination with the greedy method. The hybrid method of greedy and multinomial naive bayes algorithm yielded the best performance with the accuracy over all traditional algorithms. Based on our experiments, the multinomial naive bayes algorithm with the greedy search feature selection yielded the best performance with the accuracy of 85.00 %. Our experimental results also reveal that hybrid methods have a positive effect on sentiment classification framework.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visualization of zone activity and possession in soccer games","authors":"Sanetoshi Yamada, Keita Yagi, Syohei Munataka, Yoshiro Yamamoto","doi":"10.1109/ICTKE.2013.6756274","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756274","url":null,"abstract":"As data recording methods for soccer games develop, detailed game data is becoming more easily attainable. However, there are various ways in which to use the data to understand the game. We recorded data for every game in the 2011 J League. In soccer games the ball is always moving, it is difficult to digitally illustrate a soccer game, so we thought about ways to visualize the play data. Visualization methods of soccer games have been proposed.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131943886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Solving the NP-hard computational problem in Bayesian networks using apache hadoop MapReduce","authors":"N. Jongsawat, W. Premchaiswadi","doi":"10.1109/ICTKE.2013.6756288","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756288","url":null,"abstract":"The problem of exact probabilistic inference in an arbitrary Bayes network is NP-hard. The process is time consuming and complex. To speed up the processing, we need to run parts of the subnetwork in parallel. This work addresses the application of a MapReduce based distributed computing framework, Hadoop, to Bayesian network model to speed up the Bayesian update and inference processes. We present an analytical framework for understanding the transformation of Bayesian network model to Map and Reduce tasks. Computer-based Patient Case Simulation System (422 nodes) is chosen as a case study for the transformation.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124640974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Sasikala, S. Geetha, A. Christopher, S. Balamurugan
{"title":"A predictive model using improved Normalized Point Wise Mutual Information (INPMI)","authors":"S. Sasikala, S. Geetha, A. Christopher, S. Balamurugan","doi":"10.1109/ICTKE.2013.6756284","DOIUrl":"https://doi.org/10.1109/ICTKE.2013.6756284","url":null,"abstract":"In machine learning, selection of optimal features for the classifier is a critical problem. In order to address this problem a novel feature selection method named “Improved Normalized Point wise Mutual Information (INPMI)” is proposed. The proposed INPMI method coupled with Sequential forward search (SFS) finds the best feature subset to aid feature selection process. The key properties of evaluating feature subset i.e. relevancy and redundancy are analysed well. The classifiers like Naive Bayes, Support Vector Machine and J48 are used to determine the accuracy for the choice of features selected. Experimental results with benchmark medical datasets from UCI (University of California Irvine) machine learning database show that proposed INPMI-NB model with SFS, INPMI-SVM model with SFS, INPMI-J48model with SFS achieves 98.36 %, 98.90 %, 94.53 % classification accuracy and selects 22 features for erythemato-squamous diseases. Also the proposed work is evaluated on a World Aircraft dataset to prove its generalization ability. Experimental results prove that the proposed INPMI method outperforms the existing systems.","PeriodicalId":122281,"journal":{"name":"2013 Eleventh International Conference on ICT and Knowledge Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114624763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}