Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.92
S. Zheng, Hongji Yang
Computing paradigms are becoming ubiquitous and complex in computing tasks, as a computing environment is changing from one dimension to three dimensions to reflect computing tasks changing from scientific computing to ubiquitous computing. By the same principle, software evolution approach should also be a three-dimensional one. Hence a three-dimensional evolution approach is proposed by addressing the relationships among software functions, software qualities and software models. Experiments were carried out to prove the proposed concept, which projects a number of concluding remarks for this study.
{"title":"A Three-Dimensional Approach to Evolving Software","authors":"S. Zheng, Hongji Yang","doi":"10.1109/COMPSACW.2013.92","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.92","url":null,"abstract":"Computing paradigms are becoming ubiquitous and complex in computing tasks, as a computing environment is changing from one dimension to three dimensions to reflect computing tasks changing from scientific computing to ubiquitous computing. By the same principle, software evolution approach should also be a three-dimensional one. Hence a three-dimensional evolution approach is proposed by addressing the relationships among software functions, software qualities and software models. Experiments were carried out to prove the proposed concept, which projects a number of concluding remarks for this study.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128935841","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.32
Konrad Johannes Reiche, Edzard Höfig
Public government data refers to documents and proceedings which are freely available and accessible. Repositories facilitate the collection, publishing and distribution of data in a centralized and possibly standardized way. Metadata is used to catalog and organize the provided data. The operationality and interoperability depends on the metadata quality. In order to measure the efficiency of a repository the metadata quality needs to be quantified. Quality assessment is considered to be most reliable when carried out by a human expert. This approach, however, is not always feasible. Hence, an automatic assessment of the quality of metadata should be pursued. Proposed metrics from the field of metadata quality assessment are taken, implemented and applied to three public government data repositories, namely GovData.de (Germany), data.gov.uk (United Kingdom) and publicdata.eu (Europe). Five quality metrics were applied: completeness, weighted completeness, accuracy, richness of information and accessibility. The metrics and their implementation will be discussed in detail and the results evaluated.
{"title":"Implementation of Metadata Quality Metrics and Application on Public Government Data","authors":"Konrad Johannes Reiche, Edzard Höfig","doi":"10.1109/COMPSACW.2013.32","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.32","url":null,"abstract":"Public government data refers to documents and proceedings which are freely available and accessible. Repositories facilitate the collection, publishing and distribution of data in a centralized and possibly standardized way. Metadata is used to catalog and organize the provided data. The operationality and interoperability depends on the metadata quality. In order to measure the efficiency of a repository the metadata quality needs to be quantified. Quality assessment is considered to be most reliable when carried out by a human expert. This approach, however, is not always feasible. Hence, an automatic assessment of the quality of metadata should be pursued. Proposed metrics from the field of metadata quality assessment are taken, implemented and applied to three public government data repositories, namely GovData.de (Germany), data.gov.uk (United Kingdom) and publicdata.eu (Europe). Five quality metrics were applied: completeness, weighted completeness, accuracy, richness of information and accessibility. The metrics and their implementation will be discussed in detail and the results evaluated.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130853207","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.15
J. On, Yeongbok Choe, Moonkun Lee
In CCS, Milner defined the notion of Strong and Weak Bisimulations for behavioral equivalence between two processes or systems. However the notion has not been studied further in the perspective of abstraction for such behaviors in process algebra. In some sense, weak bisimulation could be interpreted as a kind of behavior equivalence between two processes at the certain degree of abstraction, based on observability. Here we noticed the possibility of representing such observable behaviors with a certain structure of abstraction and verify a number of behavioral equivalences in the structure. In the paper, such possibility has been realized with a new concept of Behavior Ontology. In the ontology, actions can be defined as an interaction between two processes or systems, and, further, behaviors can be defined as a sequence of such actions. Since some actions between the behaviors can be overlapped in some structural way, the behaviors can be organized in a lattice structure, namely, Behavior Lattice. Consequently, the lattice reveals certain levels of observability of the behaviors, based on degree of abstraction. From the lattice, a strong bisimulation and its weak bisimulations can be detected visually. The comparative study shows that the ontology is very effective and efficient for representing such abstract behaviors and verifying strong and weak bisimulations in a lattice structure. The ontology can be considered as one of the unique and innovative structure to represent such behaviors in a hierarchical structure of abstraction.
{"title":"An Abstraction Method of Behaviors for Process Algebra","authors":"J. On, Yeongbok Choe, Moonkun Lee","doi":"10.1109/COMPSACW.2013.15","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.15","url":null,"abstract":"In CCS, Milner defined the notion of Strong and Weak Bisimulations for behavioral equivalence between two processes or systems. However the notion has not been studied further in the perspective of abstraction for such behaviors in process algebra. In some sense, weak bisimulation could be interpreted as a kind of behavior equivalence between two processes at the certain degree of abstraction, based on observability. Here we noticed the possibility of representing such observable behaviors with a certain structure of abstraction and verify a number of behavioral equivalences in the structure. In the paper, such possibility has been realized with a new concept of Behavior Ontology. In the ontology, actions can be defined as an interaction between two processes or systems, and, further, behaviors can be defined as a sequence of such actions. Since some actions between the behaviors can be overlapped in some structural way, the behaviors can be organized in a lattice structure, namely, Behavior Lattice. Consequently, the lattice reveals certain levels of observability of the behaviors, based on degree of abstraction. From the lattice, a strong bisimulation and its weak bisimulations can be detected visually. The comparative study shows that the ontology is very effective and efficient for representing such abstract behaviors and verifying strong and weak bisimulations in a lattice structure. The ontology can be considered as one of the unique and innovative structure to represent such behaviors in a hierarchical structure of abstraction.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130050032","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.67
Chieh-Yuan Tsai, Bo-Han Lai
How to provide a high quality service according to consumer preference becomes a critical issue for amusement park to survive in a rapidly changing environment. To fulfill the need, this research proposes a customized visiting route service that provides tourists what facilities they should visit and in what order. In the studied environment, all regions are covered by Radio-Frequency Identification (RFID) readers so that the visiting behavior of a tourist (i.e. visiting location, sequences, and corresponding timestamps) can be collected and stored in a route database. The proposed route recommendation service consists of two major modules. The first module is to discover the frequent Location-Item-Time (LIT) sequential patterns using the proposed sequential pattern mining procedure. In the second module, the route suggestion procedure will filter the LIT sequential patterns under the constraints of intended-visiting time, favorite regions with its related visiting time, and favorite recreation facilities, then select the top-k suggested routes to guide the visitors. To show the feasibility of the proposed route recommendation system, the Tokyo DisneySea in Japan is used as an example. Based on the experimental results, it is clear that the recommended route can not only follow previous tourists' visiting experiences but also satisfy the visitor's customized requirement.
{"title":"A Customized Visiting Route Service under RFID Environment","authors":"Chieh-Yuan Tsai, Bo-Han Lai","doi":"10.1109/COMPSACW.2013.67","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.67","url":null,"abstract":"How to provide a high quality service according to consumer preference becomes a critical issue for amusement park to survive in a rapidly changing environment. To fulfill the need, this research proposes a customized visiting route service that provides tourists what facilities they should visit and in what order. In the studied environment, all regions are covered by Radio-Frequency Identification (RFID) readers so that the visiting behavior of a tourist (i.e. visiting location, sequences, and corresponding timestamps) can be collected and stored in a route database. The proposed route recommendation service consists of two major modules. The first module is to discover the frequent Location-Item-Time (LIT) sequential patterns using the proposed sequential pattern mining procedure. In the second module, the route suggestion procedure will filter the LIT sequential patterns under the constraints of intended-visiting time, favorite regions with its related visiting time, and favorite recreation facilities, then select the top-k suggested routes to guide the visitors. To show the feasibility of the proposed route recommendation system, the Tokyo DisneySea in Japan is used as an example. Based on the experimental results, it is clear that the recommended route can not only follow previous tourists' visiting experiences but also satisfy the visitor's customized requirement.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126455059","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.101
Xiaoyi Zhang, Zheng Zheng, Yueni Zhu, K. Cai
The future development trend of many supply systems is to become distributed, highlighting the requirements of agile and comprehensive decisions for both risk evaluation and protective approaches. According to the requirements, this paper proposes a distributed risk evaluation model, the distributed τ-interdiction median (DRIM) model for multiechelon supply systems, which enables the supply system to estimate the hazard using distributed computational resources. Furthermore, a protective resources allocation approach, the DRIM based protection approach (DRIMP approach) is introduced, aiming at making rational defensive strategies that consider the benefits of each facility. The experiment in typical data sets indicates that DRIM and DRIMP approach are able to fulfill the agility, distributed computing, and vendor-neutral requirements. The defensive strategies achieved by DRIMP approach are more rational in the distributed environment, compared to current centralized methods.
{"title":"A Distributed Protective Approach for Multiechelon Supply Systems","authors":"Xiaoyi Zhang, Zheng Zheng, Yueni Zhu, K. Cai","doi":"10.1109/COMPSACW.2013.101","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.101","url":null,"abstract":"The future development trend of many supply systems is to become distributed, highlighting the requirements of agile and comprehensive decisions for both risk evaluation and protective approaches. According to the requirements, this paper proposes a distributed risk evaluation model, the distributed τ-interdiction median (DRIM) model for multiechelon supply systems, which enables the supply system to estimate the hazard using distributed computational resources. Furthermore, a protective resources allocation approach, the DRIM based protection approach (DRIMP approach) is introduced, aiming at making rational defensive strategies that consider the benefits of each facility. The experiment in typical data sets indicates that DRIM and DRIMP approach are able to fulfill the agility, distributed computing, and vendor-neutral requirements. The defensive strategies achieved by DRIMP approach are more rational in the distributed environment, compared to current centralized methods.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114545567","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.119
Nao Maeda, H. Miwa
Large-volume contents distributed by a content delivery network (CDN) on the Internet increase load of content delivery servers and networks, which may degrade the quality of service. As a method to keep high quality service for CDN, some mirror servers providing the same content are located on a network and a request is navigated to one of the mirror servers. The network must offer connectivity between a user and servers with small distance even during link failures. In this paper, we address a network design method by protection of critical links whose failures significantly degrade the performance. The objective is to find the smallest number of the links to be protected so that a user can access servers with small increase of distance even if non-protected links fail. First, we formulate this problem and prove that it is NP-hard. Second, we present a polynomial-time algorithm to solve this problem when the number of simultaneously failed links is restricted to one. Furthermore, we evaluate the number of protected links of actual ISP network topologies by the algorithm and show the relationship between the number of protected links and the values of the parameters.
{"title":"Method for Keeping Small Distance from Users to Servers during Failures by Link Protection","authors":"Nao Maeda, H. Miwa","doi":"10.1109/COMPSACW.2013.119","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.119","url":null,"abstract":"Large-volume contents distributed by a content delivery network (CDN) on the Internet increase load of content delivery servers and networks, which may degrade the quality of service. As a method to keep high quality service for CDN, some mirror servers providing the same content are located on a network and a request is navigated to one of the mirror servers. The network must offer connectivity between a user and servers with small distance even during link failures. In this paper, we address a network design method by protection of critical links whose failures significantly degrade the performance. The objective is to find the smallest number of the links to be protected so that a user can access servers with small increase of distance even if non-protected links fail. First, we formulate this problem and prove that it is NP-hard. Second, we present a polynomial-time algorithm to solve this problem when the number of simultaneously failed links is restricted to one. Furthermore, we evaluate the number of protected links of actual ISP network topologies by the algorithm and show the relationship between the number of protected links and the values of the parameters.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121939453","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.47
Fu-Shiung Hsieh, Jim-Bon Lin
Workflow scheduling in multi-agent systems (MAS) is a challenging problem due to the computational complexity involved, distributed architecture and dependency of different agents' workflows. How to develop a problem solver that can be applied in MAS to achieve coherent and consistent workflow schedules that can meet a customer's order is an important issue. In this paper, we propose a solution methodology for scheduling workflows in MAS. Our solution combines the multi-agent system architecture, contract net protocol and workflow models specified by Petri nets. Our solution algorithm is developed based on transformation of workflow model to network models. A subgradient algorithm and a heuristic algorithm are applied to find the solutions. A problem solver for workflow scheduling in MAS has been implemented.
{"title":"A Problem Solver for Scheduling Workflows in Multi-agents Systems Based on Petri Nets","authors":"Fu-Shiung Hsieh, Jim-Bon Lin","doi":"10.1109/COMPSACW.2013.47","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.47","url":null,"abstract":"Workflow scheduling in multi-agent systems (MAS) is a challenging problem due to the computational complexity involved, distributed architecture and dependency of different agents' workflows. How to develop a problem solver that can be applied in MAS to achieve coherent and consistent workflow schedules that can meet a customer's order is an important issue. In this paper, we propose a solution methodology for scheduling workflows in MAS. Our solution combines the multi-agent system architecture, contract net protocol and workflow models specified by Petri nets. Our solution algorithm is developed based on transformation of workflow model to network models. A subgradient algorithm and a heuristic algorithm are applied to find the solutions. A problem solver for workflow scheduling in MAS has been implemented.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126130868","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.49
Behnam Rahnama, Makbule Canan Ozdemir, Y. Kiran, Atilla Elçi
This research presents design and implementation of the shortest path algorithm for labyrinth discovery application in a multi-agent environment. Robot agents are unaware of the maze at the beginning, they learn as they discover it. Each agent solves a part of the maze and updates the shared memory so that other robots also benefit from each other's' discovery. Finding of the destination cell by an agent helps others to interconnect their discovered paths to the one ending with the destination cell. The proposed shortest path algorithm considers the cost for not only coordinate distance but also number of turns and moves required to traverse the path. The Shortest Path algorithm is compared against various available maze solving algorithms including Flood-Fill, Modified Flood-Fill and ALCKEF. The presented algorithm can be used also as an additional layer to enhance the available methods at second and subsequent runs.
{"title":"Design and Implementation of a Novel Weighted Shortest Path Algorithm for Maze Solving Robots","authors":"Behnam Rahnama, Makbule Canan Ozdemir, Y. Kiran, Atilla Elçi","doi":"10.1109/COMPSACW.2013.49","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.49","url":null,"abstract":"This research presents design and implementation of the shortest path algorithm for labyrinth discovery application in a multi-agent environment. Robot agents are unaware of the maze at the beginning, they learn as they discover it. Each agent solves a part of the maze and updates the shared memory so that other robots also benefit from each other's' discovery. Finding of the destination cell by an agent helps others to interconnect their discovered paths to the one ending with the destination cell. The proposed shortest path algorithm considers the cost for not only coordinate distance but also number of turns and moves required to traverse the path. The Shortest Path algorithm is compared against various available maze solving algorithms including Flood-Fill, Modified Flood-Fill and ALCKEF. The presented algorithm can be used also as an additional layer to enhance the available methods at second and subsequent runs.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126594289","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}
We propose an indexing method called UBI-Tree for improving the efficiency of a new type of data search called schema-less search. Schema-less search is a multi-dimensional range search from a wide variety of data, such as sensor data, collected through participatory sensing. Such data have different types and number of dimensions because a participant uses various devices. Therefore, applications must search for their target data within the sensor data in a cross-schema manner. UBI-Tree is a tree-structured index based on R-Tree. The insert algorithm classifies various data into nodes according to newly introduced scores to estimate the inefficiency of classification. The score can uniformly represent the difference in the types of dimensions between data as well as the difference in dimension values. By classifying data that have a similar dimension set into the same node, UBI-Tree suppresses the curse of dimensionality and makes schema-less searches efficient. The validity of UBI-Tree was evaluated through experiments.
{"title":"UBI-Tree: Indexing Method for Schema-Less Search","authors":"Yutaka Arakawa, Takayuki Nakamura, Motonori Nakamura, Hajime Matsumura","doi":"10.1109/COMPSACW.2013.58","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.58","url":null,"abstract":"We propose an indexing method called UBI-Tree for improving the efficiency of a new type of data search called schema-less search. Schema-less search is a multi-dimensional range search from a wide variety of data, such as sensor data, collected through participatory sensing. Such data have different types and number of dimensions because a participant uses various devices. Therefore, applications must search for their target data within the sensor data in a cross-schema manner. UBI-Tree is a tree-structured index based on R-Tree. The insert algorithm classifies various data into nodes according to newly introduced scores to estimate the inefficiency of classification. The score can uniformly represent the difference in the types of dimensions between data as well as the difference in dimension values. By classifying data that have a similar dimension set into the same node, UBI-Tree suppresses the curse of dimensionality and makes schema-less searches efficient. The validity of UBI-Tree was evaluated through experiments.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128945836","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 : 2013-07-22DOI: 10.1109/COMPSACW.2013.132
Tingda Lu, Mi Lin, Chih-Ming Chen, Jhih-Hao Wu
To reduce effectively the reading anxiety of learners while reading English articles, a C4.5 decision tree, a widely used data mining technique, was used to develop a personalized reading anxiety prediction model (PRAPM) based on individual learners' reading annotation behavior in a collaborative digital reading annotation system. In addition to forecasting immediately the reading anxiety levels of learners, the proposed PRAPM can be used to identify the key factors that cause reading anxiety based on the fired prediction rules determined by the developed decision tree. By understanding these key factors that cause reading anxiety, instructors can apply reading strategies to reduce reading anxiety, thus promoting English-language reading performance. To assess whether the proposed PRAPM can assist instructors in reducing the reading anxiety of learners, this study applies the quasi-experimental method to compare the learning performance of three learning groups, which are supported by a collaborative digital reading annotation system with different learning mechanisms to reduce reading anxiety. The control group, experimental group A and experimental group B conducted the same English reading activity. However, each group was given a collaborative digital reading annotation system with individual annotations, cooperative annotations, and cooperative annotation with the instructor's support to reduce reading anxiety by proposed PRAPM. Experimental results indicate that the average correct prediction rate of the proposed PRAPM in identifying the reading anxiety levels of learners was as high as 70%. The online instructor who applied reading assistive strategies based on the mining factors that affect reading anxiety from the proposed PRAPM can significantly reduce the reading anxiety of male learners in the experimental group B, showing that gender difference existed, and the online instructor's interaction with the male learners of the experimental group B indeed helped reduce the reading anxiety.
{"title":"Forecasting Reading Anxiety to Promote Reading Performance Based on Annotation Behavior","authors":"Tingda Lu, Mi Lin, Chih-Ming Chen, Jhih-Hao Wu","doi":"10.1109/COMPSACW.2013.132","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.132","url":null,"abstract":"To reduce effectively the reading anxiety of learners while reading English articles, a C4.5 decision tree, a widely used data mining technique, was used to develop a personalized reading anxiety prediction model (PRAPM) based on individual learners' reading annotation behavior in a collaborative digital reading annotation system. In addition to forecasting immediately the reading anxiety levels of learners, the proposed PRAPM can be used to identify the key factors that cause reading anxiety based on the fired prediction rules determined by the developed decision tree. By understanding these key factors that cause reading anxiety, instructors can apply reading strategies to reduce reading anxiety, thus promoting English-language reading performance. To assess whether the proposed PRAPM can assist instructors in reducing the reading anxiety of learners, this study applies the quasi-experimental method to compare the learning performance of three learning groups, which are supported by a collaborative digital reading annotation system with different learning mechanisms to reduce reading anxiety. The control group, experimental group A and experimental group B conducted the same English reading activity. However, each group was given a collaborative digital reading annotation system with individual annotations, cooperative annotations, and cooperative annotation with the instructor's support to reduce reading anxiety by proposed PRAPM. Experimental results indicate that the average correct prediction rate of the proposed PRAPM in identifying the reading anxiety levels of learners was as high as 70%. The online instructor who applied reading assistive strategies based on the mining factors that affect reading anxiety from the proposed PRAPM can significantly reduce the reading anxiety of male learners in the experimental group B, showing that gender difference existed, and the online instructor's interaction with the male learners of the experimental group B indeed helped reduce the reading anxiety.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117292195","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
扫码关注我们
求助内容：
应助结果提醒方式：