The hierarchical routing protocol in the wireless sensor network (WSN) is widely applied because of its good network stability and effective communication capability. Its cluster structure and the integration process of the data have a satisfactory performance in energy consumption and data transmission. To guide the design of hierarchical routing protocol, in this paper, we review the current research on these protocols, some typical technical characteristics such as the cluster head selection, clustering, and data routing are analysed, and a suggestion on the direction of the hierarchical routing protocol research is given. The work of this paper will be beneficial to the research, design, and optimisation of the hierarchical routing protocol.
{"title":"Hierarchical routing protocol in wireless sensor network: a state-of-the-art review","authors":"Weidong Fang, Wuxiong Zhang, Lianhai Shan, Biruk Assefa, Wei Chen","doi":"10.1504/ijcse.2020.10029221","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029221","url":null,"abstract":"The hierarchical routing protocol in the wireless sensor network (WSN) is widely applied because of its good network stability and effective communication capability. Its cluster structure and the integration process of the data have a satisfactory performance in energy consumption and data transmission. To guide the design of hierarchical routing protocol, in this paper, we review the current research on these protocols, some typical technical characteristics such as the cluster head selection, clustering, and data routing are analysed, and a suggestion on the direction of the hierarchical routing protocol research is given. The work of this paper will be beneficial to the research, design, and optimisation of the hierarchical routing protocol.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"52 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73323206","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 : 2020-04-17DOI: 10.1504/ijcse.2020.10028618
Zeng Saifeng
In cloud environments, data-intensive applications have been widely deployed to solve non-trivial applications, while cloud-based storage systems usually fail to provide desirable performance and efficiency when running those data-intensive applications. To address the problems of storage capacity and performance when executing data-intensive applications, we design and implement a light-weight distributed file system middleware, namely virtual file system for cloud storage, which allows other storage-level services to be easily incorporated into an integrated framework in a plug-in manner. In the proposed middleware, we implement three effective mechanisms: disk caching, file striping, and metadata management. The implementation of the proposed middleware has been deployed in a realistic cloud platform, and its performance has been thoroughly investigated under various workloads. Experimental results show that it can significantly improve I/O performance compared with existing approaches. In addition, it also exhibits better robustness when the cloud system is facing intensive workloads.
{"title":"VFS_CS: a light-weight and extensible virtual file system middleware for cloud storage system","authors":"Zeng Saifeng","doi":"10.1504/ijcse.2020.10028618","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10028618","url":null,"abstract":"In cloud environments, data-intensive applications have been widely deployed to solve non-trivial applications, while cloud-based storage systems usually fail to provide desirable performance and efficiency when running those data-intensive applications. To address the problems of storage capacity and performance when executing data-intensive applications, we design and implement a light-weight distributed file system middleware, namely virtual file system for cloud storage, which allows other storage-level services to be easily incorporated into an integrated framework in a plug-in manner. In the proposed middleware, we implement three effective mechanisms: disk caching, file striping, and metadata management. The implementation of the proposed middleware has been deployed in a realistic cloud platform, and its performance has been thoroughly investigated under various workloads. Experimental results show that it can significantly improve I/O performance compared with existing approaches. In addition, it also exhibits better robustness when the cloud system is facing intensive workloads.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"4 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2020-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87470098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A comparative linguistic analysis of English news headlines in China, USA, UK, and ASEAN countries","authors":"Yingwen Fu, Yusha Zhang, Xiaoming Lu, Shengyi Jiang","doi":"10.1504/ijcse.2020.10033510","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10033510","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"40 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73779218","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 : 2020-01-01DOI: 10.1504/ijcse.2020.10027431
Wang Gaocai, Peng Ying, Wang Nao, Liu Taoshen
{"title":"A routing strategy with energy optimisation based on community in mobile social networks","authors":"Wang Gaocai, Peng Ying, Wang Nao, Liu Taoshen","doi":"10.1504/ijcse.2020.10027431","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027431","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"84 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79398435","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 : 2020-01-01DOI: 10.1504/ijcse.2020.10031609
Mengmeng Song, Lin Qiao, R. Law
{"title":"Formation path of customer engagement in virtual brand community based on back propagation neural network algorithm","authors":"Mengmeng Song, Lin Qiao, R. Law","doi":"10.1504/ijcse.2020.10031609","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10031609","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"61 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74229692","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 : 2019-07-26DOI: 10.1504/IJCSE.2019.10022733
N. A. Madi, J. Khan
The modality effect is a term that refers to differences in learning performance in relation to the mode of presentation. It is an interesting phenomenon that impacts education, online-learning, and marketing among many other areas of life. In this study, we use electroencephalography (EEG alpha, beta, and theta) and computational modelling of comprehension to study the modality effect in text and multimedia. First, we provide a framework for evaluating learning performance, working-memory, and emotions during learning. Second, we apply these tools to investigate the modality effect computationally focusing on text in contrast to multimedia. This study is based on a dataset that we have collected through a human experiment involving 16 participants. Our results are important for future learning systems that incorporate learning performance, working-memory, and emotions in a continuous feedback system that measures and optimises learning during learning and not after.
{"title":"Is a picture worth a thousand words A computational investigation of the modality effect","authors":"N. A. Madi, J. Khan","doi":"10.1504/IJCSE.2019.10022733","DOIUrl":"https://doi.org/10.1504/IJCSE.2019.10022733","url":null,"abstract":"The modality effect is a term that refers to differences in learning performance in relation to the mode of presentation. It is an interesting phenomenon that impacts education, online-learning, and marketing among many other areas of life. In this study, we use electroencephalography (EEG alpha, beta, and theta) and computational modelling of comprehension to study the modality effect in text and multimedia. First, we provide a framework for evaluating learning performance, working-memory, and emotions during learning. Second, we apply these tools to investigate the modality effect computationally focusing on text in contrast to multimedia. This study is based on a dataset that we have collected through a human experiment involving 16 participants. Our results are important for future learning systems that incorporate learning performance, working-memory, and emotions in a continuous feedback system that measures and optimises learning during learning and not after.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"7 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2019-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75011147","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 : 2019-05-02DOI: 10.1504/IJCSE.2019.10020961
Hong Wang, Xiaomei Yu, Jun Zhao, Yuanjie Zheng
Ranking method for online recommendation system is challenging due to the rating sparsity and the spam rating attacks. The former can cause the well-known cold start problem while the latter complicates the recommendation task by detecting these unreasonable or biased ratings. In this paper, we treat the spam ratings as 'corruptions' which spatially distribute in a sparse pattern and model them with a L1 norm and a L2,1 norm. We show that these models can characterise the property of the original ratings by removing spam ratings and help to resolve the cold start problem. Furthermore, we propose a group-reputation-based method to re-weight the rating matrix and an iterative programming-based technique for optimising the ranking for online recommendation. We show that our optimisation methods outperform other recommendation approaches. Experimental results on four famous datasets reveal the superior performances of our methods.
{"title":"Detecting sparse rating spammer for accurate ranking of online recommendation","authors":"Hong Wang, Xiaomei Yu, Jun Zhao, Yuanjie Zheng","doi":"10.1504/IJCSE.2019.10020961","DOIUrl":"https://doi.org/10.1504/IJCSE.2019.10020961","url":null,"abstract":"Ranking method for online recommendation system is challenging due to the rating sparsity and the spam rating attacks. The former can cause the well-known cold start problem while the latter complicates the recommendation task by detecting these unreasonable or biased ratings. In this paper, we treat the spam ratings as 'corruptions' which spatially distribute in a sparse pattern and model them with a L1 norm and a L2,1 norm. We show that these models can characterise the property of the original ratings by removing spam ratings and help to resolve the cold start problem. Furthermore, we propose a group-reputation-based method to re-weight the rating matrix and an iterative programming-based technique for optimising the ranking for online recommendation. We show that our optimisation methods outperform other recommendation approaches. Experimental results on four famous datasets reveal the superior performances of our methods.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"15 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2019-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88022619","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 : 2019-01-01DOI: 10.1504/ijcse.2019.10026142
A. F. da Silva, Luis Gustavo Araujo Rodriguez, João Fabrício Filho
Graph colouring is a complex computational problem that focuses on colouring all vertices of a given graph using a minimum number of colours. However, adjacent vertices are restricted from receiving the same colour. Over recent decades, various algorithms have been proposed and implemented to solve such a problem. An interesting algorithm is the hybrid colouring algorithm, which was developed in 1999 by Galinier and Hao. The hybrid colouring algorithm was widely regarded at the time as one of the best performing algorithms for graph colouring. Nowadays, high-performance out-of-order multi-cores have emerged; consequently, executing applications faster and efficiently. Thus, the objective of this paper is to analyse whether the hybrid colouring algorithm can take advantage of multi-core architectures, in terms of performance, or not. For this purpose, we propose and implement a parallel version of the hybrid colouring algorithm that takes advantage of all hardware resources. Several experiments were performed on a machine with two Intel(R) Xeon(R) CPU E5-2630 processors, thus having a total of 24 cores. The experiment proved that the parallel hybrid colouring algorithm, using multi-core architectures, is a significant improvement over the original because it achieves enhancements of up to 40% in terms of the distance to the best chromatic number found in the literature. The expected contribution of this paper is to encourage developers to take advantage of high performance out-of-order multi-cores to solve complex computational problems.
图着色是一个复杂的计算问题，其重点是使用最少数量的颜色为给定图的所有顶点着色。然而，相邻的顶点被限制不能接收相同的颜色。近几十年来，人们提出并实现了各种算法来解决这一问题。一个有趣的算法是混合着色算法，它是由Galinier和Hao在1999年开发的。混合着色算法在当时被广泛认为是图形着色性能最好的算法之一。目前，高性能无序多核已经出现;因此，更快、更有效地执行应用程序。因此，本文的目的是分析混合着色算法是否可以在性能方面利用多核架构。为此，我们提出并实现了一种利用所有硬件资源的混合着色算法的并行版本。几个实验是在一台带有两个Intel(R) Xeon(R) CPU E5-2630处理器的机器上进行的，因此总共有24个核心。实验证明，使用多核架构的并行混合着色算法比原始算法有了显着改进，因为它在与文献中发现的最佳色数的距离方面实现了高达40%的增强。本文的预期贡献是鼓励开发人员利用高性能乱序多核来解决复杂的计算问题。
{"title":"Can the hybrid colouring algorithm take advantage of multi-core architectures","authors":"A. F. da Silva, Luis Gustavo Araujo Rodriguez, João Fabrício Filho","doi":"10.1504/ijcse.2019.10026142","DOIUrl":"https://doi.org/10.1504/ijcse.2019.10026142","url":null,"abstract":"Graph colouring is a complex computational problem that focuses on colouring all vertices of a given graph using a minimum number of colours. However, adjacent vertices are restricted from receiving the same colour. Over recent decades, various algorithms have been proposed and implemented to solve such a problem. An interesting algorithm is the hybrid colouring algorithm, which was developed in 1999 by Galinier and Hao. The hybrid colouring algorithm was widely regarded at the time as one of the best performing algorithms for graph colouring. Nowadays, high-performance out-of-order multi-cores have emerged; consequently, executing applications faster and efficiently. Thus, the objective of this paper is to analyse whether the hybrid colouring algorithm can take advantage of multi-core architectures, in terms of performance, or not. For this purpose, we propose and implement a parallel version of the hybrid colouring algorithm that takes advantage of all hardware resources. Several experiments were performed on a machine with two Intel(R) Xeon(R) CPU E5-2630 processors, thus having a total of 24 cores. The experiment proved that the parallel hybrid colouring algorithm, using multi-core architectures, is a significant improvement over the original because it achieves enhancements of up to 40% in terms of the distance to the best chromatic number found in the literature. The expected contribution of this paper is to encourage developers to take advantage of high performance out-of-order multi-cores to solve complex computational problems.","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"15 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90926828","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 : 2019-01-01DOI: 10.1504/ijcse.2019.10020394
P.H. Moraes Rego, Guilherme Bonfim De Sousa
{"title":"Convergence and numerical stability of action-dependent heuristic dynamic programming algorithms based on RLS learning for online DLQR optimal control","authors":"P.H. Moraes Rego, Guilherme Bonfim De Sousa","doi":"10.1504/ijcse.2019.10020394","DOIUrl":"https://doi.org/10.1504/ijcse.2019.10020394","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"237 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76760658","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
扫码关注我们
求助内容：
应助结果提醒方式：