Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.950
Chung Tet Kun, N. Sahari
{"title":"Utilitarian or Experiential? An Analysis of Usability Questionnaires","authors":"Chung Tet Kun, N. Sahari","doi":"10.7763/IJCTE.2015.V7.950","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.950","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131048689","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.944
M. Przybylek
The basic idea behind the skeletal algorithm is to express a problem in terms of congruences on a structure, build an initial set of congruences, and improve it by taking limited unions/intersections, until a suitable condition is reached. Skeletal algorithms naturally arise in the context of data/process mining, where the skeleton is the “free” structure on initial data and congruence corresponds to similarities in data. In this paper we study skeletal algorithms applied to sequential pattern mining and compare their performance with real models, Markov chains and models based on Shannon entropy.
{"title":"Skeletal Algorithms: Sequential Pattern Mining","authors":"M. Przybylek","doi":"10.7763/IJCTE.2015.V7.944","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.944","url":null,"abstract":"The basic idea behind the skeletal algorithm is to express a problem in terms of congruences on a structure, build an initial set of congruences, and improve it by taking limited unions/intersections, until a suitable condition is reached. Skeletal algorithms naturally arise in the context of data/process mining, where the skeleton is the “free” structure on initial data and congruence corresponds to similarities in data. In this paper we study skeletal algorithms applied to sequential pattern mining and compare their performance with real models, Markov chains and models based on Shannon entropy.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121717449","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.943
Lin Jie, Yang Yujiu, L. Wenhuang
The development of travel industry gradually fosters personalized requirements of tourists, such as setting the start place, exploiting interesting activities and organizing the travel route. In this paper, we take advantage of two online websites to collect information of both scenic spots and real-world local activities, and we proposed three rule-based methods to recommend travel routes for tourists, which can take their instant location into account and satisfy their personalized demands. Specifically, we extract scenery spots dataset from Flickr and popular activities from Douban-Event in line with the visiting city and date. Then we process these items and take the filtering results as the recommendation candidates. Finally based on popularity and geographical location of these venues/activities, we focus on arranging a colorful travel route, which covers not only the everlasting scenic spots, but also some temporary activities. We evaluate the quality of travel routes produced by our recommendation approaches with an alternative plan suggested by a professional travel site. The results justify the advantages of our approaches over the baseline method provided by travel experts.
{"title":"Exploring Personalized Travel Route Using POIs","authors":"Lin Jie, Yang Yujiu, L. Wenhuang","doi":"10.7763/IJCTE.2015.V7.943","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.943","url":null,"abstract":"The development of travel industry gradually fosters personalized requirements of tourists, such as setting the start place, exploiting interesting activities and organizing the travel route. In this paper, we take advantage of two online websites to collect information of both scenic spots and real-world local activities, and we proposed three rule-based methods to recommend travel routes for tourists, which can take their instant location into account and satisfy their personalized demands. Specifically, we extract scenery spots dataset from Flickr and popular activities from Douban-Event in line with the visiting city and date. Then we process these items and take the filtering results as the recommendation candidates. Finally based on popularity and geographical location of these venues/activities, we focus on arranging a colorful travel route, which covers not only the everlasting scenic spots, but also some temporary activities. We evaluate the quality of travel routes produced by our recommendation approaches with an alternative plan suggested by a professional travel site. The results justify the advantages of our approaches over the baseline method provided by travel experts.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126079803","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.947
Lim Chee-Keong Alfred, Wai Chong Chia
This paper demonstrates electroencephalogram (EEG) analysis in MATLAB environment with the objective to investigate effectiveness of cognitive stress recognition algorithm using EEG from single-electrode BCI. 25 subjects' EEG were recorded in MATLAB with the use of Stroop color-word test as stress inducer. Questionnaire on subjects' self-perceived stress scale during Stroop test were gathered as classification's target output. The main analysis tool used were MATLAB, coupled with the use of Discrete Cosine Transform (DCT) as dimension reduction technique to reduce data size down to 2% of the origin. Three pattern classification algorithms' - Artificial Neural Network (ANN), k-Nearest Neighbor (KNN) and Linear Discriminant Analysis (LDA) were trained using the resulted 2% DCT coefficients. Our study discovered the use of DCT along with KNN offers highest average classification rate of 72% compared to ANN and LDA.
{"title":"Analysis of Single-Electrode EEG Rhythms Using MATLAB to Elicit Correlation with Cognitive Stress","authors":"Lim Chee-Keong Alfred, Wai Chong Chia","doi":"10.7763/IJCTE.2015.V7.947","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.947","url":null,"abstract":"This paper demonstrates electroencephalogram (EEG) analysis in MATLAB environment with the objective to investigate effectiveness of cognitive stress recognition algorithm using EEG from single-electrode BCI. 25 subjects' EEG were recorded in MATLAB with the use of Stroop color-word test as stress inducer. Questionnaire on subjects' self-perceived stress scale during Stroop test were gathered as classification's target output. The main analysis tool used were MATLAB, coupled with the use of Discrete Cosine Transform (DCT) as dimension reduction technique to reduce data size down to 2% of the origin. Three pattern classification algorithms' - Artificial Neural Network (ANN), k-Nearest Neighbor (KNN) and Linear Discriminant Analysis (LDA) were trained using the resulted 2% DCT coefficients. Our study discovered the use of DCT along with KNN offers highest average classification rate of 72% compared to ANN and LDA.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134102499","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.946
Kim Dae Young, Kim Hye-Jun, Bae Junhyeok, Yoon Taeseon
{"title":"Examining the Probability of the Critical Mutation of H5N8 by Comparing with H7N9 and H5N1 Using Apriori Algorithm and Support Vector Machine","authors":"Kim Dae Young, Kim Hye-Jun, Bae Junhyeok, Yoon Taeseon","doi":"10.7763/IJCTE.2015.V7.946","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.946","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127789023","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.945
Z. Halim, N. Jamaludin, S. Junaidi, S. Yusainee, S. Yahya
The conventional stress wave signal interpretation in heat exchanger tube inspection is human dependent. The difficulties associated with accurate defect interpretations are skills and experiences of the inspector. Hence, in present study, alternative pattern recognition approach was proposed to interpret the presence of defect in carbon steel heat exchanger tubes SA179. Several high frequency stress wave signals propagated in the tubes due to impact are captured using Acoustic Emission method. In particular, one reference tube and two defective tubes were adopted. The signals were then clustered using the feature extraction algorithms. This paper tested two feature extraction algorithms namely Principal Component Analysis (PCA) and Auto-Regressive (AR). The pattern recognition results showed that the AR algorithm is more effective in defect identification. Good comparisons with the commonly global statistical analysis demonstrate the effective application of the present approach for defect detection.
{"title":"Pattern Recognition Approach of Stress Wave Propagation in Carbon Steel Tubes for Defect Detection","authors":"Z. Halim, N. Jamaludin, S. Junaidi, S. Yusainee, S. Yahya","doi":"10.7763/IJCTE.2015.V7.945","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.945","url":null,"abstract":"The conventional stress wave signal interpretation in heat exchanger tube inspection is human dependent. The difficulties associated with accurate defect interpretations are skills and experiences of the inspector. Hence, in present study, alternative pattern recognition approach was proposed to interpret the presence of defect in carbon steel heat exchanger tubes SA179. Several high frequency stress wave signals propagated in the tubes due to impact are captured using Acoustic Emission method. In particular, one reference tube and two defective tubes were adopted. The signals were then clustered using the feature extraction algorithms. This paper tested two feature extraction algorithms namely Principal Component Analysis (PCA) and Auto-Regressive (AR). The pattern recognition results showed that the AR algorithm is more effective in defect identification. Good comparisons with the commonly global statistical analysis demonstrate the effective application of the present approach for defect detection.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117272599","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.941
D. Shyamala, S. Steven
{"title":"Enhanced Intensive Indexing (I2D) De-Duplication for Space Optimization in Private Cloud Storage Backup","authors":"D. Shyamala, S. Steven","doi":"10.7763/IJCTE.2015.V7.941","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.941","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127201905","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.939
T. Jamil, I. Mohammed
{"title":"Simulation of VICTOR Algorithm for Fault-Diagnosis of Digital Circuits","authors":"T. Jamil, I. Mohammed","doi":"10.7763/IJCTE.2015.V7.939","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.939","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116329433","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.937
W. Samuel, Lu Chin-Hsuan, Lee An-Chen
Abstract—In a permanent magnet (PM) brushless dc motor (BLDC), the performance of Hall effect sensors are not reliable in some applications. The back electromotive force (back-EMF) signal is used instead since the zero-crossing points of back-EMF can be used to provide the rotor position information. In this paper, a new back-EMF difference detection method based on disturbance observer is proposed. The proposed structure can detect the back-EMF as well as back-EMF difference signal. The zero-crossing points of the back-EMF difference can be used directly for commutation, requiring no phase shift. Simulation and experiment results are provided to show the feasibility of the proposed method.
{"title":"Disturbance Observer Structure Applied to Sensorless Brushless DC Motors Drive","authors":"W. Samuel, Lu Chin-Hsuan, Lee An-Chen","doi":"10.7763/IJCTE.2015.V7.937","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.937","url":null,"abstract":"Abstract—In a permanent magnet (PM) brushless dc motor (BLDC), the performance of Hall effect sensors are not reliable in some applications. The back electromotive force (back-EMF) signal is used instead since the zero-crossing points of back-EMF can be used to provide the rotor position information. In this paper, a new back-EMF difference detection method based on disturbance observer is proposed. The proposed structure can detect the back-EMF as well as back-EMF difference signal. The zero-crossing points of the back-EMF difference can be used directly for commutation, requiring no phase shift. Simulation and experiment results are provided to show the feasibility of the proposed method.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117094409","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}
Pub Date : 2015-04-01DOI: 10.7763/IJCTE.2015.V7.942
Hsieh Hui-Ching, Chiang Mao-Lun
To achieve reliability, it is very important to study the agreement and fault-tolerance topic in distributed systems. This kind of problem is known as a Byzantine Agreement (BA) problem. It requires a set of processors to agree on a common value, even if some processors and transmission media are faulty. Basically, the traditional BA protocols require (n-1)/3 + 2 rounds of message exchange to make each processor reach an agreement. In other words, those protocols are inefficient and unreasonable, due to the number of message results in a large protocol overhead. In this study, we propose a novel and efficient protocol to reduce the amount of messages. Our protocol can compare and replace the messages received from other processors to find out the reliable processors and replace the value sent by the un-reliable processors through four rounds of message exchange even when the total number of faulty components or the total number of processors in the system is large. Finally, the agreement can be reached by using the minimum number of messages in the distributed system, while tolerating the maximum number of faulty components.
{"title":"New Approach to Improve the Generalized Byzantine Agreement Problem","authors":"Hsieh Hui-Ching, Chiang Mao-Lun","doi":"10.7763/IJCTE.2015.V7.942","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.942","url":null,"abstract":"To achieve reliability, it is very important to study the agreement and fault-tolerance topic in distributed systems. This kind of problem is known as a Byzantine Agreement (BA) problem. It requires a set of processors to agree on a common value, even if some processors and transmission media are faulty. Basically, the traditional BA protocols require (n-1)/3 + 2 rounds of message exchange to make each processor reach an agreement. In other words, those protocols are inefficient and unreasonable, due to the number of message results in a large protocol overhead. In this study, we propose a novel and efficient protocol to reduce the amount of messages. Our protocol can compare and replace the messages received from other processors to find out the reliable processors and replace the value sent by the un-reliable processors through four rounds of message exchange even when the total number of faulty components or the total number of processors in the system is large. Finally, the agreement can be reached by using the minimum number of messages in the distributed system, while tolerating the maximum number of faulty components.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129667755","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：