Pub Date : 2013-03-01DOI: 10.1504/IJKWI.2013.052726
S. Nakamura, Keiko Nakayama, T. Nakagawa
This paper forms a stochastic model using access logging data of contents in the e-learning system. If a lecturer could not provide a suitable study support to the learner in the e-learning system, then the learner might drop out of studying the system. However, if a lecturer could provide suitable supports to the learner at planned times, the learner could attain the goal. From such viewpoints, two stochastic problems of a study support system are proposed, and their optimal policies are discussed theoretically and numerically, when the number of acquirement items has Weibull and normal distributions.
{"title":"Optimal study number of stochastic e-learning system","authors":"S. Nakamura, Keiko Nakayama, T. Nakagawa","doi":"10.1504/IJKWI.2013.052726","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.052726","url":null,"abstract":"This paper forms a stochastic model using access logging data of contents in the e-learning system. If a lecturer could not provide a suitable study support to the learner in the e-learning system, then the learner might drop out of studying the system. However, if a lecturer could provide suitable supports to the learner at planned times, the learner could attain the goal. From such viewpoints, two stochastic problems of a study support system are proposed, and their optimal policies are discussed theoretically and numerically, when the number of acquirement items has Weibull and normal distributions.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"380 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124738693","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-03-01DOI: 10.1504/IJKWI.2013.052728
Yuanyuan Wang, K. Sumiya
A communication environment in which people use presentation slides to exchange and discuss ideas can be created. Presenters, however, must clearly communicate content for audience understanding. Although most slides generated by conventional methods follow structured document summaries e.g. academic papers, our method has been designed to generate outlines for lecture slides from textbook chapters. We aimed to organise slide layouts from target chapters based on the expression styles of referred slides. Therefore, we analysed level positions of words in the referred slides and arranged words from target chapters to generate slide outlines based on difference in document structure i.e. text structure, slide structure. To achieve this, we extracted differences between tendency of word appearance in chapters and their slides. This method generated slide outlines by using the expression styles of the corresponding words from the target chapters. In this paper, we have also included an evaluation of our method's effectiveness.
{"title":"A method for generating presentation slides based on expression styles using document structure","authors":"Yuanyuan Wang, K. Sumiya","doi":"10.1504/IJKWI.2013.052728","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.052728","url":null,"abstract":"A communication environment in which people use presentation slides to exchange and discuss ideas can be created. Presenters, however, must clearly communicate content for audience understanding. Although most slides generated by conventional methods follow structured document summaries e.g. academic papers, our method has been designed to generate outlines for lecture slides from textbook chapters. We aimed to organise slide layouts from target chapters based on the expression styles of referred slides. Therefore, we analysed level positions of words in the referred slides and arranged words from target chapters to generate slide outlines based on difference in document structure i.e. text structure, slide structure. To achieve this, we extracted differences between tendency of word appearance in chapters and their slides. This method generated slide outlines by using the expression styles of the corresponding words from the target chapters. In this paper, we have also included an evaluation of our method's effectiveness.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130022133","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-03-01DOI: 10.1504/IJKWI.2013.052724
Pablo Martinez Lerin, D. Yamamoto, N. Takahashi
This study proposes a generic encoder for network-constrained travel trajectories, and it implements two encoders by combining the proposed generic encoder with two routing algorithms, which reduce the size of a travel trajectory's path along a road network without modifying it. Although most previous trajectory compression methods introduce an error in the spatial component of trajectories to achieve compression, we argue that the path of a travel trajectory, i.e. the sequence of roads travelled, is crucial information for many applications. Experimental results obtained using a large-data set of real travel trajectories show that the two proposed encoders achieve high compression, outperforming a general purpose data compression method.
{"title":"Encoding network-constrained travel trajectories using routing algorithms","authors":"Pablo Martinez Lerin, D. Yamamoto, N. Takahashi","doi":"10.1504/IJKWI.2013.052724","DOIUrl":"https://doi.org/10.1504/IJKWI.2013.052724","url":null,"abstract":"This study proposes a generic encoder for network-constrained travel trajectories, and it implements two encoders by combining the proposed generic encoder with two routing algorithms, which reduce the size of a travel trajectory's path along a road network without modifying it. Although most previous trajectory compression methods introduce an error in the spatial component of trajectories to achieve compression, we argue that the path of a travel trajectory, i.e. the sequence of roads travelled, is crucial information for many applications. Experimental results obtained using a large-data set of real travel trajectories show that the two proposed encoders achieve high compression, outperforming a general purpose data compression method.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130314843","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 : 2012-12-01DOI: 10.1504/IJKWI.2012.050852
Shunsuke Kozawa, Hitomi Tohyama, Kiyotaka Uchimoto, S. Matsubara, H. Isahara
This paper describes the design and implementation of a large scale ontological database named SHACHI, storing detailed metadata on language resources (LRs) in Asian and Western countries. SHACHI has been constructed to enhance the interoperability of LRs, that is, to effectively combine LRs, to systematically store LR metadata, to provide a common infrastructure for web services, to investigate languages, tag sets, and formats compiled in LRs, and to ultimately utilise all these factors for more efficient development of LRs. This ontological metadata database, containing more than 2,000 compiled LRs such as corpora, dictionaries, thesauruses and lexicons, has an aspect of an archive of a large scale metadata of LRs, and its website is now open to the public and accessible to all internet users. SHACHI metadata set is an extended version of OLAC metadata set which conforms to Dublin Core metadata element set. This paper first presents the methodologies to systematically store LR metadata and efficiently LR catalogues, and then explains the structure of the ontological metadata database, as well as the realisation of the LR catalogue search tool. The usefulness of the ontology search function has been investigated.
{"title":"Design and collection of ontological metadata for enhancing interoperability of language resources","authors":"Shunsuke Kozawa, Hitomi Tohyama, Kiyotaka Uchimoto, S. Matsubara, H. Isahara","doi":"10.1504/IJKWI.2012.050852","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.050852","url":null,"abstract":"This paper describes the design and implementation of a large scale ontological database named SHACHI, storing detailed metadata on language resources (LRs) in Asian and Western countries. SHACHI has been constructed to enhance the interoperability of LRs, that is, to effectively combine LRs, to systematically store LR metadata, to provide a common infrastructure for web services, to investigate languages, tag sets, and formats compiled in LRs, and to ultimately utilise all these factors for more efficient development of LRs. This ontological metadata database, containing more than 2,000 compiled LRs such as corpora, dictionaries, thesauruses and lexicons, has an aspect of an archive of a large scale metadata of LRs, and its website is now open to the public and accessible to all internet users. SHACHI metadata set is an extended version of OLAC metadata set which conforms to Dublin Core metadata element set. This paper first presents the methodologies to systematically store LR metadata and efficiently LR catalogues, and then explains the structure of the ontological metadata database, as well as the realisation of the LR catalogue search tool. The usefulness of the ontology search function has been investigated.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039977","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 : 2012-12-01DOI: 10.1504/IJKWI.2012.050851
Koichi Hanaue, Yusuke Ishiguro, Toyohide Watanabe
This paper presents a method of generating presentation slides automatically from the discourse structure of a presentation. The discourse structure represents semantic relationships among slide components such as texts and images. Although most of the slides generated by conventional methods follow the standard format of bullet lists, our method attempts to generate slides with diagrammatic representation. Our idea is to find the layout templates that are appropriate to express the discourse structure specified by presenters. To achieve this, we introduce the logical structure of slides. The logical structure represents sequential and inclusive relations among the slide components and is used as the precondition of a template. We represent the preconditions for applying a layout template as the logical structure. By comparing the preconditions and the logical structure constructed from the discourse structure, appropriate templates can be applied. Through the case study, we confirmed that our prototype system can generate the slides with diagrammatic representation from a given discourse structure.
{"title":"Composition method of presentation slides using diagrammatic representation of discourse structure","authors":"Koichi Hanaue, Yusuke Ishiguro, Toyohide Watanabe","doi":"10.1504/IJKWI.2012.050851","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.050851","url":null,"abstract":"This paper presents a method of generating presentation slides automatically from the discourse structure of a presentation. The discourse structure represents semantic relationships among slide components such as texts and images. Although most of the slides generated by conventional methods follow the standard format of bullet lists, our method attempts to generate slides with diagrammatic representation. Our idea is to find the layout templates that are appropriate to express the discourse structure specified by presenters. To achieve this, we introduce the logical structure of slides. The logical structure represents sequential and inclusive relations among the slide components and is used as the precondition of a template. We represent the preconditions for applying a layout template as the logical structure. By comparing the preconditions and the logical structure constructed from the discourse structure, appropriate templates can be applied. Through the case study, we confirmed that our prototype system can generate the slides with diagrammatic representation from a given discourse structure.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121818054","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 : 2012-12-01DOI: 10.1504/IJKWI.2012.050853
Paul Villavicencio, Toyohide Watanabe
In order to support the processes of reading digital research articles, we propose a summarisation method focused on using the localised topic information of documents. The objective is to produce summaries containing topics which are detailed in a document rather than those representing a general overview. We obtain the summaries by ranking sentences based on key-terms cooccurring throughout the document structure, and key-terms within the syntactic structure of sentences. Our idea of using the concept of syntactic structures is that authors usually have their own writing styles, represented by grammatical structures. In this paper we present a description of the method along with an evaluation, comparing our method to other existing summarisation methods.
{"title":"Localised topic information extraction for summarisation using syntactic sequences","authors":"Paul Villavicencio, Toyohide Watanabe","doi":"10.1504/IJKWI.2012.050853","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.050853","url":null,"abstract":"In order to support the processes of reading digital research articles, we propose a summarisation method focused on using the localised topic information of documents. The objective is to produce summaries containing topics which are detailed in a document rather than those representing a general overview. We obtain the summaries by ranking sentences based on key-terms cooccurring throughout the document structure, and key-terms within the syntactic structure of sentences. Our idea of using the concept of syntactic structures is that authors usually have their own writing styles, represented by grammatical structures. In this paper we present a description of the method along with an evaluation, comparing our method to other existing summarisation methods.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129601857","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 : 2012-12-01DOI: 10.1504/IJKWI.2012.050860
L. Peralta, L. D. Brito, J. F. Santos
The resource limitations of wireless sensor nodes foster the collaborative nature of wireless sensor networks (WSNs). Thus, in this paper, we propose a generic model that represents the collaboration relationships that can be established in a WSN, and its implementation. To accomplish this, we approach the different types of collaboration that may occur in any WSN. As a result, we propose a collaboration hierarchy for WSNs. Furthermore, we present the WISE-MANager tool, which is a collaborative sessions' management tool that allows bringing these concepts into practice. The establishment of collaborative sessions, using a test-bed composed by ZigBee-based sensor nodes allows demonstrating that the WISE-MANager tool optimises the WSN's operation and increases the interaction between the user and the network.
{"title":"Improving users' manipulation and control on WSNs through collaborative sessions","authors":"L. Peralta, L. D. Brito, J. F. Santos","doi":"10.1504/IJKWI.2012.050860","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.050860","url":null,"abstract":"The resource limitations of wireless sensor nodes foster the collaborative nature of wireless sensor networks (WSNs). Thus, in this paper, we propose a generic model that represents the collaboration relationships that can be established in a WSN, and its implementation. To accomplish this, we approach the different types of collaboration that may occur in any WSN. As a result, we propose a collaboration hierarchy for WSNs. Furthermore, we present the WISE-MANager tool, which is a collaborative sessions' management tool that allows bringing these concepts into practice. The establishment of collaborative sessions, using a test-bed composed by ZigBee-based sensor nodes allows demonstrating that the WISE-MANager tool optimises the WSN's operation and increases the interaction between the user and the network.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121305354","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 : 2012-12-01DOI: 10.1504/IJKWI.2012.050854
Ruqayya Abdulrahman, Sophia Alim, D. Neagu, R. Holton, M. Ridley
Nowadays, we witness a flood of continuously changing information from a variety of web sources. New challenges to track information changes in real time require new methods in web information retrieval using multi agent system (MAS) technology. This research continues previous work on extracting data from online social networks (OSNs) by using an agent in each user profile to monitor its updates, which are sent to a controller agent that saves a history of each user's activity in a local repository, as well as applying a vulnerability measure to users' profiles. An algorithm making use of MAS within the online social network retrieval system (OSNRS) is proposed. Our experiments on data extraction show that using MAS simplifies the process of tracking profile's history and opens the opportunity of understanding the dynamic behaviour of OSN users especially when it is combined with text mining. The application of the vulnerability measure over time highlighted that in the case of this experiment the structure of the node's network, rather than the contents of the node, changed over time. The validation of the vulnerability measure showed that friends of a profile, that disclose their personal details online, may not leak personal details about the profile.
{"title":"Multi agent system approach for vulnerability analysis of online social network profiles over time","authors":"Ruqayya Abdulrahman, Sophia Alim, D. Neagu, R. Holton, M. Ridley","doi":"10.1504/IJKWI.2012.050854","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.050854","url":null,"abstract":"Nowadays, we witness a flood of continuously changing information from a variety of web sources. New challenges to track information changes in real time require new methods in web information retrieval using multi agent system (MAS) technology. This research continues previous work on extracting data from online social networks (OSNs) by using an agent in each user profile to monitor its updates, which are sent to a controller agent that saves a history of each user's activity in a local repository, as well as applying a vulnerability measure to users' profiles. An algorithm making use of MAS within the online social network retrieval system (OSNRS) is proposed. Our experiments on data extraction show that using MAS simplifies the process of tracking profile's history and opens the opportunity of understanding the dynamic behaviour of OSN users especially when it is combined with text mining. The application of the vulnerability measure over time highlighted that in the case of this experiment the structure of the node's network, rather than the contents of the node, changed over time. The validation of the vulnerability measure showed that friends of a profile, that disclose their personal details online, may not leak personal details about the profile.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711578","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 : 2012-11-01DOI: 10.1504/IJKWI.2012.050283
T. Ichimura, Shin Kamada, Kosuke Kato
A self organising map (SOM) is trained using unsupervised learning to produce a two-dimensional discretised representation of input space of the training cases. Growing hierarchical SOM is an architecture which grows both in a hierarchical way representing the structure of data distribution and in a horizontal way representing the size of each individual maps. The control method of the growing degree by pruning off the redundant branch of hierarchy in SOM has been proposed and the criteria were designed by the adjustment of parameter settings according to a quantisation error and the size of map. Moreover, the interface tool for the proposed method called the interactive GHSOM has been developed. The interactive GHSOM can determine the knowledge of classification from the hierarchy of structure. A smartphone-based tourist participatory sensing system has been developed in Android smartphone. The system can collect tourist subjective data which includes jpeg files with GPS, geographic location name, the evaluation, and comments written in natural language at sightseeing spot. In this paper, we classified the subjective data by interactive GHSOM and extracted the rules by C4.5. After the interactive GHSOM implementation, the structure of the extracted rules became a lucid expression.
{"title":"Knowledge discovery of tourist subjective data in smartphone-based participatory sensing system by interactive growing hierarchical SOM and C4.5","authors":"T. Ichimura, Shin Kamada, Kosuke Kato","doi":"10.1504/IJKWI.2012.050283","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.050283","url":null,"abstract":"A self organising map (SOM) is trained using unsupervised learning to produce a two-dimensional discretised representation of input space of the training cases. Growing hierarchical SOM is an architecture which grows both in a hierarchical way representing the structure of data distribution and in a horizontal way representing the size of each individual maps. The control method of the growing degree by pruning off the redundant branch of hierarchy in SOM has been proposed and the criteria were designed by the adjustment of parameter settings according to a quantisation error and the size of map. Moreover, the interface tool for the proposed method called the interactive GHSOM has been developed. The interactive GHSOM can determine the knowledge of classification from the hierarchy of structure. A smartphone-based tourist participatory sensing system has been developed in Android smartphone. The system can collect tourist subjective data which includes jpeg files with GPS, geographic location name, the evaluation, and comments written in natural language at sightseeing spot. In this paper, we classified the subjective data by interactive GHSOM and extracted the rules by C4.5. After the interactive GHSOM implementation, the structure of the extracted rules became a lucid expression.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126985998","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 : 2012-11-01DOI: 10.1504/IJKWI.2012.050282
Shinpei Yagi, Keiichi Tamura, H. Kitakami
An approximate query, which is an approximate pattern matching in sequence databases, is one of the most important techniques for many different areas, such as computational biology, text mining, web intelligence and pattern recognition; it returns many similar sub-sequences. In this paper, we refer to a set of such similar sub-sequences as a mismatch cluster. To support users who execute an approximate query on a sequence database to find the regularities of approximate patterns that similar to the query pattern, we have developed the stepwise generalisation method that extracts a reduced expression, called a minimum generalised set, from a mismatch cluster. This paper proposes a novel parallelisation model with a hierarchical task pool for the parallel processing of the stepwise generalisation method on a multi-core PC cluster. To manage tasks efficiently on multi-core CPUs, the proposed model uses the hierarchical task pool and an efficient hierarchical dynamic load balancing technique. We evaluate the proposed method using real protein sequences on an actual multi-core PC cluster. Experimental results confirm that the proposed method performs well on multi-core CPUs and on a multi-core PC cluster.
{"title":"Parallel processing for stepwise generalisation method on multi-core PC cluster","authors":"Shinpei Yagi, Keiichi Tamura, H. Kitakami","doi":"10.1504/IJKWI.2012.050282","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.050282","url":null,"abstract":"An approximate query, which is an approximate pattern matching in sequence databases, is one of the most important techniques for many different areas, such as computational biology, text mining, web intelligence and pattern recognition; it returns many similar sub-sequences. In this paper, we refer to a set of such similar sub-sequences as a mismatch cluster. To support users who execute an approximate query on a sequence database to find the regularities of approximate patterns that similar to the query pattern, we have developed the stepwise generalisation method that extracts a reduced expression, called a minimum generalised set, from a mismatch cluster. This paper proposes a novel parallelisation model with a hierarchical task pool for the parallel processing of the stepwise generalisation method on a multi-core PC cluster. To manage tasks efficiently on multi-core CPUs, the proposed model uses the hierarchical task pool and an efficient hierarchical dynamic load balancing technique. We evaluate the proposed method using real protein sequences on an actual multi-core PC cluster. Experimental results confirm that the proposed method performs well on multi-core CPUs and on a multi-core PC cluster.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131748276","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
扫码关注我们
求助内容：
应助结果提醒方式：