Pub Date : 2010-11-30DOI: 10.4156/JCIT.VOL5.ISSUE9.13
Jui-Hung Chen, D. T. Ku, Te-Hua Wang, Wen-Chih Chang, T. Shih
In the 21th century, there are more and more advanced computer technologies and related applications developed to help people in complex computing and problem solving. One obvious example could be found in the game industry. The game applications have become more and more complex in bringing simulated reality for gamers to enjoy the game activities. Many researchers found that the game elements and related design concepts have strongly impressed people during the game activities, and they also pointed out that game-based learning activities can help learners to improve both the learning motivation and efficiency effectively. In this paper, we integrate a two-dimensional adventure game with conventional assessment system, and try to enrich the learning activities and to ease the management in learning and assessment content.
{"title":"Using Adventure Game to Facilitate Learning Assessment Process","authors":"Jui-Hung Chen, D. T. Ku, Te-Hua Wang, Wen-Chih Chang, T. Shih","doi":"10.4156/JCIT.VOL5.ISSUE9.13","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.13","url":null,"abstract":"In the 21th century, there are more and more advanced computer technologies and related applications developed to help people in complex computing and problem solving. One obvious example could be found in the game industry. The game applications have become more and more complex in bringing simulated reality for gamers to enjoy the game activities. Many researchers found that the game elements and related design concepts have strongly impressed people during the game activities, and they also pointed out that game-based learning activities can help learners to improve both the learning motivation and efficiency effectively. In this paper, we integrate a two-dimensional adventure game with conventional assessment system, and try to enrich the learning activities and to ease the management in learning and assessment content.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114649758","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 : 2010-11-30DOI: 10.4156/JCIT.VOL5.ISSUE9.16
Wenyuan Liu, E. Wang, Zijun Chen, L. Wang
In the trilateration of wireless sensor networks, to overcome the affection of localization error caused by the selection of beacon nodes, a selective strategy of beacon nodes based on the angle information is proposed in this paper. By the comparative analysis of angle, we can determine the topology shape of the selected beacon nodes and the position relationship with unknown node, so that unknown nodes can choose three beacon nodes which are the most accurate to execute trilateration. Simulation results demonstrate that the localization error of unknown nodes is reduced greatly by the proposed method.
{"title":"An Improved DV-Hop Localization Algorithm based on The Selection of Beacon Nodes","authors":"Wenyuan Liu, E. Wang, Zijun Chen, L. Wang","doi":"10.4156/JCIT.VOL5.ISSUE9.16","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.16","url":null,"abstract":"In the trilateration of wireless sensor networks, to overcome the affection of localization error caused by the selection of beacon nodes, a selective strategy of beacon nodes based on the angle information is proposed in this paper. By the comparative analysis of angle, we can determine the topology shape of the selected beacon nodes and the position relationship with unknown node, so that unknown nodes can choose three beacon nodes which are the most accurate to execute trilateration. Simulation results demonstrate that the localization error of unknown nodes is reduced greatly by the proposed method.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124329168","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 : 2010-11-30DOI: 10.4156/JCIT.VOL5.ISSUE9.1
Massimo Orazio Spata, S. Rinaudo
In this paper, it has been integrated Nash Equilibrium solution of Game Theory with Genetic Algorithms (GA) to optimize performance of a job scheduler, in order to simulate topology and sizing of Analog Electrical Circuits simulation. We proposed a new method for performance problems solving of Genetic Algorithms applied to Electronic Design Automation (EDA) simulator tool optimization. This optimal solution process is formulated as a non-cooperative Game in order to solve GA performance problem more efficiently and effectively. For these reasons, it has been created a new integrated Algorithm named Game Genetic Algorithm (GGA). A flow chart of the algorithm is presented to investigate the feasibility of the above approach.
{"title":"Merging Nash Equilibrium Solution with Genetic Algorithm : The Game Genetic Algorithm","authors":"Massimo Orazio Spata, S. Rinaudo","doi":"10.4156/JCIT.VOL5.ISSUE9.1","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.1","url":null,"abstract":"In this paper, it has been integrated Nash Equilibrium solution of Game Theory with Genetic Algorithms (GA) to optimize performance of a job scheduler, in order to simulate topology and sizing of Analog Electrical Circuits simulation. We proposed a new method for performance problems solving of Genetic Algorithms applied to Electronic Design Automation (EDA) simulator tool optimization. This optimal solution process is formulated as a non-cooperative Game in order to solve GA performance problem more efficiently and effectively. For these reasons, it has been created a new integrated Algorithm named Game Genetic Algorithm (GGA). A flow chart of the algorithm is presented to investigate the feasibility of the above approach.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121969712","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 : 2010-11-30DOI: 10.4156/JCIT.VOL5.ISSUE9.8
Jian Cui
Artificial neural networks and genetic algorithms derived from the corresponding simulation of biology, anatomy. The paper analyzes the advantages and the disadvantages of the artificial neural networks and genetic algorithms. The artificial neural networks and genetic algorithms to be combine in the prediction model. This method is used to predict traffic volume in a road, the accuracy of forecasting results improved significantly. Therefore, this simulation method in traffic prediction have a good prospect.
{"title":"Traffic Prediction Based on Improved Neural Network","authors":"Jian Cui","doi":"10.4156/JCIT.VOL5.ISSUE9.8","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.8","url":null,"abstract":"Artificial neural networks and genetic algorithms derived from the corresponding simulation of biology, anatomy. The paper analyzes the advantages and the disadvantages of the artificial neural networks and genetic algorithms. The artificial neural networks and genetic algorithms to be combine in the prediction model. This method is used to predict traffic volume in a road, the accuracy of forecasting results improved significantly. Therefore, this simulation method in traffic prediction have a good prospect.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123391073","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 : 2010-11-30DOI: 10.4156/JCIT.VOL5.ISSUE9.4
Liyue Zhu, Zilei Wang, H. Xi
Services composition can reorganize a variety of heterogeneous network services to form new businesses on the multi-service streaming media system, which can speed up the development and deployment of new services. In this paper, a three layer model is used to describe the service composition in a streaming media system. In order to improve the real-time request response performance, path selection is divided into two steps, the initial paths planning and dynamic path selection. The dynamic path selection behavior is described by using Markov decision processes model. When QoS is guarded, the policy iteration algorithm is adopted to improve the system of the total receipts and to reduce the refuse rate. The simulation results show that the proposed method of service composition improves the performance of the streaming media system.
{"title":"Markov Decision Process Model for Path Selection Algorithm on Multi-Business System with Services Composition","authors":"Liyue Zhu, Zilei Wang, H. Xi","doi":"10.4156/JCIT.VOL5.ISSUE9.4","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.4","url":null,"abstract":"Services composition can reorganize a variety of heterogeneous network services to form new businesses on the multi-service streaming media system, which can speed up the development and deployment of new services. In this paper, a three layer model is used to describe the service composition in a streaming media system. In order to improve the real-time request response performance, path selection is divided into two steps, the initial paths planning and dynamic path selection. The dynamic path selection behavior is described by using Markov decision processes model. When QoS is guarded, the policy iteration algorithm is adopted to improve the system of the total receipts and to reduce the refuse rate. The simulation results show that the proposed method of service composition improves the performance of the streaming media system.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129069921","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 : 2010-11-30DOI: 10.4156/JCIT.VOL5.ISSUE9.30
Shui Wang, Le Wang
FP-Growth is a classical data mining algorithm; most of its current implementations are based on programming language's primitive data types for their data structures; this leads to poor readability & reusability of the codes. Weka is an open source platform for data mining, but lacks of the ability in dealing with tree-structured data; JUNG is a network/graph computation framework. Starting from the analysis on Weka's foundation classes, builds a concise implementation for FP-Growth algorithm based on high level object-oriented data objects of the Weka-JUNG framework; comparison experiments against Weka's built-in Apriori implementation are carried out and its correctness is verified. This implementation has been published as an open source Google Code project.
{"title":"An Implementation of FP-Growth Algorithm Based on High Level Data Structures of Weka-JUNG Framework","authors":"Shui Wang, Le Wang","doi":"10.4156/JCIT.VOL5.ISSUE9.30","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.30","url":null,"abstract":"FP-Growth is a classical data mining algorithm; most of its current implementations are based on programming language's primitive data types for their data structures; this leads to poor readability & reusability of the codes. Weka is an open source platform for data mining, but lacks of the ability in dealing with tree-structured data; JUNG is a network/graph computation framework. Starting from the analysis on Weka's foundation classes, builds a concise implementation for FP-Growth algorithm based on high level object-oriented data objects of the Weka-JUNG framework; comparison experiments against Weka's built-in Apriori implementation are carried out and its correctness is verified. This implementation has been published as an open source Google Code project.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"439 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114001337","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 : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.16
Yan Chen, Yunjun Gao
Physical obstacles (e.g., buildings, hills, and blindages, etc.) are ubiquitous in the real world, and their existence may affect the visibility between objects and thus the result of spatial queries such as range query, nearest neighbor search, and spatial join, etc. In this paper, we study a novel type of spatial queries, namely, ranked continuous visible nearest neighbor (RCVNN) search, which returns the k visible nearest neighbors that have the maximal optimality according to the predefined optimality metric. We first formulate the problem, and then present an efficient algorithm for RCVNN query processing and prove its correctness. Extensive experimental evaluation demonstrates the efficiency and effectiveness of our proposed algorithm using both real and synthetic datasets.
{"title":"Ranked Continuous Visible Nearest Neighbor Search","authors":"Yan Chen, Yunjun Gao","doi":"10.4156/JCIT.VOL5.ISSUE8.16","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.16","url":null,"abstract":"Physical obstacles (e.g., buildings, hills, and blindages, etc.) are ubiquitous in the real world, and their existence may affect the visibility between objects and thus the result of spatial queries such as range query, nearest neighbor search, and spatial join, etc. In this paper, we study a novel type of spatial queries, namely, ranked continuous visible nearest neighbor (RCVNN) search, which returns the k visible nearest neighbors that have the maximal optimality according to the predefined optimality metric. We first formulate the problem, and then present an efficient algorithm for RCVNN query processing and prove its correctness. Extensive experimental evaluation demonstrates the efficiency and effectiveness of our proposed algorithm using both real and synthetic datasets.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"1329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127439622","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 : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.10
Chih-Feng Chuang, Chao-Jen Cheng
The evolution of information technologies has produced changes in learning, creating ubiquitous learning. This paper presents a case study on institutional repository service quality and users’ loyalty to College Libraries in Taiwan. Hierarchical regression analysis was used to test the hypotheses. (1) Institutional repository service quality has a direct positive prediction on users’ loyalty. (2) Institutional repository service quality has an indirect positive prediction, through the mediation effects of user satisfaction on user loyalty. (3) Users’ perceived value has a moderating effect between user satisfaction and user loyalty.
{"title":"A Study of Institutional Repository Service Quality and Users' Loyalty to College Libraries in Taiwan: The Mediating & Moderating Effects","authors":"Chih-Feng Chuang, Chao-Jen Cheng","doi":"10.4156/JCIT.VOL5.ISSUE8.10","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.10","url":null,"abstract":"The evolution of information technologies has produced changes in learning, creating ubiquitous learning. This paper presents a case study on institutional repository service quality and users’ loyalty to College Libraries in Taiwan. Hierarchical regression analysis was used to test the hypotheses. (1) Institutional repository service quality has a direct positive prediction on users’ loyalty. (2) Institutional repository service quality has an indirect positive prediction, through the mediation effects of user satisfaction on user loyalty. (3) Users’ perceived value has a moderating effect between user satisfaction and user loyalty.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125321778","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 : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.25
Yitian Xu, Haozhi Zhang, Laisheng Wang
Rough set theory is introduced into linear νsupport vector machine (svm), and rough margin-based linear νsvm is proposed in this paper. By constructing rough lower margin, rough upper margin and rough boundary in linear ν svm, then we maximize the rough margin not margin in linear ν svm. Thus more points are considered in constructing the separating hyper-plane than those used in linear υ svm. Moreover, different points in different positions are proposed to have different effect on the separating hyper-plane, where points in the lower margin have more effects than those in the boundary of the rough margin. The proposed algorithm is compared with other svm algorithms, the experiment results demonstrate the feasibility and validity of the proposed algorithm.
{"title":"Rough Margin-Based Linear v Support Vector Machine","authors":"Yitian Xu, Haozhi Zhang, Laisheng Wang","doi":"10.4156/JCIT.VOL5.ISSUE8.25","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.25","url":null,"abstract":"Rough set theory is introduced into linear νsupport vector machine (svm), and rough margin-based linear νsvm is proposed in this paper. By constructing rough lower margin, rough upper margin and rough boundary in linear ν svm, then we maximize the rough margin not margin in linear ν svm. Thus more points are considered in constructing the separating hyper-plane than those used in linear υ svm. Moreover, different points in different positions are proposed to have different effect on the separating hyper-plane, where points in the lower margin have more effects than those in the boundary of the rough margin. The proposed algorithm is compared with other svm algorithms, the experiment results demonstrate the feasibility and validity of the proposed algorithm.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"1 Chicago No 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123351268","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 : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.2
Yongguo Liu, Yi-Dong Shen
In this article, a recent metaheuristic method, cat swarm optimization, is introduced to find the proper clustering of data sets. Two clustering approaches based on cat swarm optimization called Cat Swarm Optimization Clustering (CSOC) and K-harmonic means Cat Swarm Optimization Clustering (KCSOC) are proposed. In the proposed methods, seeking mode and tracing mode are adopted to exploit and explore the solution space. In addition, K-Harmonic Means (KHM) operation is designed to refine the population and accelerate the convergence of the clustering algorithm. Experimental results on six real life data sets are given to illustrate the effectiveness of the proposed algorithms.
{"title":"Data Clustering with Cat Swarm Optimization","authors":"Yongguo Liu, Yi-Dong Shen","doi":"10.4156/JCIT.VOL5.ISSUE8.2","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.2","url":null,"abstract":"In this article, a recent metaheuristic method, cat swarm optimization, is introduced to find the proper clustering of data sets. Two clustering approaches based on cat swarm optimization called Cat Swarm Optimization Clustering (CSOC) and K-harmonic means Cat Swarm Optimization Clustering (KCSOC) are proposed. In the proposed methods, seeking mode and tracing mode are adopted to exploit and explore the solution space. In addition, K-Harmonic Means (KHM) operation is designed to refine the population and accelerate the convergence of the clustering algorithm. Experimental results on six real life data sets are given to illustrate the effectiveness of the proposed algorithms.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122706670","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
扫码关注我们
求助内容：
应助结果提醒方式：