International Journal of Computational Science and Engineering最新文献

筛选
英文 中文
Hierarchical routing protocol in wireless sensor network: a state-of-the-art review 无线传感器网络中的分层路由协议:最新进展综述
IF 2
International Journal of Computational Science and Engineering Pub Date : 2020-05-04 DOI: 10.1504/ijcse.2020.10029221
Weidong Fang, Wuxiong Zhang, Lianhai Shan, Biruk Assefa, Wei Chen
{"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}
引用次数: 0
VFS_CS: a light-weight and extensible virtual file system middleware for cloud storage system VFS_CS:用于云存储系统的轻量级可扩展虚拟文件系统中间件
IF 2
International Journal of Computational Science and Engineering Pub Date : 2020-04-17 DOI: 10.1504/ijcse.2020.10028618
Zeng Saifeng
{"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}
引用次数: 1
A comparative linguistic analysis of English news headlines in China, USA, UK, and ASEAN countries 中国、美国、英国和东盟国家英语新闻标题的比较语言学分析
IF 2
International Journal of Computational Science and Engineering Pub Date : 2020-01-01 DOI: 10.1504/ijcse.2020.10033510
Yingwen Fu, Yusha Zhang, Xiaoming Lu, Shengyi Jiang
{"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}
引用次数: 0
A routing strategy with energy optimisation based on community in mobile social networks 移动社交网络中基于社区的能量优化路由策略
IF 2
International Journal of Computational Science and Engineering Pub Date : 2020-01-01 DOI: 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}
引用次数: 1
Client-side ciphertext deduplication scheme with flexible access control 客户端密文重复数据删除方案,具有灵活的访问控制
IF 2
International Journal of Computational Science and Engineering Pub Date : 2020-01-01 DOI: 10.1504/ijcse.2020.10032810
Guohua Tian, Haoran Yuan, Jianfeng Wang, Chong Jiang, Ying Xie
{"title":"Client-side ciphertext deduplication scheme with flexible access control","authors":"Guohua Tian, Haoran Yuan, Jianfeng Wang, Chong Jiang, Ying Xie","doi":"10.1504/ijcse.2020.10032810","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10032810","url":null,"abstract":"","PeriodicalId":47380,"journal":{"name":"International Journal of Computational Science and Engineering","volume":"75 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86391543","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}
引用次数: 0
Formation path of customer engagement in virtual brand community based on back propagation neural network algorithm 基于反向传播神经网络算法的虚拟品牌社区顾客参与形成路径
IF 2
International Journal of Computational Science and Engineering Pub Date : 2020-01-01 DOI: 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}
引用次数: 7
Is a picture worth a thousand words A computational investigation of the modality effect 一图胜千言?对模态效应的计算研究
IF 2
International Journal of Computational Science and Engineering Pub Date : 2019-07-26 DOI: 10.1504/IJCSE.2019.10022733
N. A. Madi, J. Khan
{"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}
引用次数: 0
Detecting sparse rating spammer for accurate ranking of online recommendation 检测稀疏评级垃圾邮件的准确排序在线推荐
IF 2
International Journal of Computational Science and Engineering Pub Date : 2019-05-02 DOI: 10.1504/IJCSE.2019.10020961
Hong Wang, Xiaomei Yu, Jun Zhao, Yuanjie Zheng
{"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}
引用次数: 2
Can the hybrid colouring algorithm take advantage of multi-core architectures 混合着色算法能否利用多核架构的优势
IF 2
International Journal of Computational Science and Engineering Pub Date : 2019-01-01 DOI: 10.1504/ijcse.2019.10026142
A. F. da Silva, Luis Gustavo Araujo Rodriguez, João Fabrício Filho
{"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}
引用次数: 0
Convergence and numerical stability of action-dependent heuristic dynamic programming algorithms based on RLS learning for online DLQR optimal control 基于RLS学习的动作依赖启发式动态规划在线DLQR最优控制算法的收敛性和数值稳定性
IF 2
International Journal of Computational Science and Engineering Pub Date : 2019-01-01 DOI: 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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信