发布求助
文献互助 智能选刊 最新文献

Int. J. High Perform. Comput. Netw.最新文献

筛选
英文 中文
Telecom customer clustering via glowworm swarm optimisation algorithm 基于萤火虫群优化算法的电信客户聚类
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-19 DOI: 10.1504/ijhpcn.2019.102345
Yanli Liu, Mengyu Zhu
{"title":"Telecom customer clustering via glowworm swarm optimisation algorithm","authors":"Yanli Liu, Mengyu Zhu","doi":"10.1504/ijhpcn.2019.102345","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.102345","url":null,"abstract":"The glowworm swarm optimisation (GSO) algorithm is a novel algorithm with the simultaneous computation of multiple optima of multimodal functions. Data-clustering techniques are classification algorithms that have a wide range of applications. Since K-means algorithm is easy to fall into the local optimum by the selection of initial clustering centre, GSO algorithm is used for the telecom customers clustering. The customer consumption data is extracted by means of the recency frequency monetary (RFM) model and the standardised data is clustered automatically using the GSO algorithm's synchronous optimisation ability. In the clustering optimisation algorithm, adaptive step size is used instead of the original fixed step size to avoid local optimisation of the algorithm and obtain higher accuracy. Compared with K-means clustering algorithm, GSO approach can automatically generate the number of clusters and use RFM model to reduce effectively the size of the data processing. The results of the experiments demonstrate that the GSO-based clustering technique is a promising technique for the data clustering problems.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128674140","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 comparative study on automatic parallelisation tools and methods to improve their usage 自动并行化工具及其改进方法的比较研究
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-19 DOI: 10.1504/IJHPCN.2019.10018358
Prema Soundararajan, R. Jehadeesan, B. K. Panigrahi
{"title":"A comparative study on automatic parallelisation tools and methods to improve their usage","authors":"Prema Soundararajan, R. Jehadeesan, B. K. Panigrahi","doi":"10.1504/IJHPCN.2019.10018358","DOIUrl":"https://doi.org/10.1504/IJHPCN.2019.10018358","url":null,"abstract":"Automatic parallelisation assists users in parallelising the serial code even without acquiring knowledge about the application. Auto-parallelisers focus on loop-level parallelisation and dependence analysis. Apart from dependences present within the loop, specific coding complexities make the code not amenable to parallelisation due to the limitations of the parallelising tool. To overcome these programming complications, we can explore the possibility of minimal manual intervention to make the code suitable for parallelisation. This paper provides a study of currently available auto-parallelisers and their competence on parallelisation of different programming features. The pitfalls faced by these tools are unveiled and categorised for detailed analysis. A solution-based approach in the form of coding changes circumvents the pitfalls and achieves efficient parallelisation. It also underlines the overall capability of the tools in supporting programming features during parallelisation.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115850153","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 novel graph compression algorithm for data-intensive scientific networks 一种新的数据密集型科学网络图压缩算法
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-19 DOI: 10.1504/ijhpcn.2019.102348
Xiao Lin, Haizhou Du, Shenshen Chen
{"title":"A novel graph compression algorithm for data-intensive scientific networks","authors":"Xiao Lin, Haizhou Du, Shenshen Chen","doi":"10.1504/ijhpcn.2019.102348","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.102348","url":null,"abstract":"As one of the world's leading scientific and data-intensive computing grids, the worldwide LHC computing grid (WLCG) faces the challenge of improving its computing efficiency and network utilisation. To achieve this goal, WLCG needs an important piece of information: the network topology graphs of participating computing grids. Directly collecting such information from all of the grids, however, would cause high communication overhead and raise many security issues. In this paper, we address these issues by proposing a novel algorithm to compress such a large network topology into a compact, equivalent network topology. We formally define our problem, develop a novel, efficient topology compression algorithm and evaluate its performance using real-world network topologies. Our results show that our algorithm not only achieves a much higher topology compression ratio than state-of-the-art topology transformation algorithms, but also leads to at most 100× reduction in computation time.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127285275","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 new segmentation algorithm based on evolutionary algorithm and bag of words model 一种新的基于进化算法和词袋模型的分词算法
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-03 DOI: 10.1504/ijhpcn.2019.10023606
Kangshun Li, Weiguang Chen, Ying Huang, Shuling Yang
{"title":"A new segmentation algorithm based on evolutionary algorithm and bag of words model","authors":"Kangshun Li, Weiguang Chen, Ying Huang, Shuling Yang","doi":"10.1504/ijhpcn.2019.10023606","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.10023606","url":null,"abstract":"Crop disease and insect pest detection and recognition using machine vision can provide precise diagnosis and preventive suggestions. However, the complexity of agricultural pest and disease identification based on traditional bag of words (BOW) models is high and the effect is general. This paper presents a histogram quadric segmentation algorithm based on an evolutionary algorithm to observe the features (colour, texture) of disease spots and to learn from the guided filtering algorithm. This process aims to obtain the precise positions of disease spots in images. Dense-SIFT, which can extract features and spatial pyramid, which can map image features to high-spatial-resolution space, are simultaneously applied in the recognition of crop diseases and insect pests in the BOW model. The experimental results show that the new segmentation algorithm can effectively locate the positions of disease spots in corn images and the improved BOW model substantially increases the recognition accuracy of crop diseases and insect pests.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127586124","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
Visual vocabulary tree-based partial-duplicate image retrieval for coverless image steganography 基于视觉词汇树的无覆盖图像隐写部分重复图像检索
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-03 DOI: 10.1504/ijhpcn.2019.10023614
Yan Mu, Zhili Zhou
{"title":"Visual vocabulary tree-based partial-duplicate image retrieval for coverless image steganography","authors":"Yan Mu, Zhili Zhou","doi":"10.1504/ijhpcn.2019.10023614","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.10023614","url":null,"abstract":"The traditional image steganographic approaches embed the secret message into covers by modifying their contents. Therefore, the modification traces left in the cover will cause some damages to the cover, especially embedding more messages in the cover. More importantly, the modification traces make successful steganalysis possible. In this paper, visual vocabulary tree-based partial-duplicate image retrieval for coverless image steganography is proposed to embed the secret messages without any modification. The main idea of our method is to retrieve a set of duplicates of a given secret image as stego-images from a natural image database. The images in the database will be divided into a number of image patches, and then indexed by the features extracted from the image patches. We search for the duplicates of the secret image in the image database to obtain the stego-images. Each of these stego-images shares one similar image patch with the secret image. When receiver obtains those stego-images, our method can recover the secret image approximately by using the designed protocols. Experimental results show that our method not only resists the existing steganalysis tools, but also has high capacity.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115118072","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}
引用次数: 5
Load forecasting for cloud computing based on wavelet support vector machine 基于小波支持向量机的云计算负荷预测
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-03 DOI: 10.1504/ijhpcn.2019.10023612
W. Zhong, Y. Zhuang, Jian Sun, Jingjing Gu
{"title":"Load forecasting for cloud computing based on wavelet support vector machine","authors":"W. Zhong, Y. Zhuang, Jian Sun, Jingjing Gu","doi":"10.1504/ijhpcn.2019.10023612","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.10023612","url":null,"abstract":"Because the tasks submitted by users have random and nonlinear characteristics in the cloud computing environment, it is very difficult to forecast the load in the cloud data centre. In this paper, we combine the wavelet transform and support vector machine (SVM) to propose a wavelet support vector machine load forecast (WSVMLF) model for the cloud computing. The model uses the wavelet transform to analyse the cycle and frequency of the input data while combining with the characteristics of the nonlinear regression of the SVM, so that the task load can be modelled more accurately. Then a WSVMLF algorithm is proposed, which can improve the accuracy of the cloud load prediction. Finally, the Google cloud computing centre data set was selected to test the WSVMLF model we proposed. The comparative experimental results show that the algorithm we proposed has a better performance and accuracy than the similar forecasting algorithms.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127987411","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}
引用次数: 3
An efficient 3D point clouds covariance descriptor for object classification with mismatching correction algorithm 基于错配校正算法的三维点云协方差描述子
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-03 DOI: 10.1504/ijhpcn.2019.10023615
Heng Zhang, Bin Zhuang
{"title":"An efficient 3D point clouds covariance descriptor for object classification with mismatching correction algorithm","authors":"Heng Zhang, Bin Zhuang","doi":"10.1504/ijhpcn.2019.10023615","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.10023615","url":null,"abstract":"We introduce a new covariance descriptor combining object visual (colour, gradient, depth, etc.) and geometric information (3D coordinates, normal vectors, Gaussian curvature, etc.) for mobile robot with RGB-D camera to deal with point cloud data. The improved mismatching correction algorithm is applied in the feature point mismatching correction of 3D point clouds. This descriptor is able to quickly match the feature points of the point clouds in the surrounding environment and realise the function of object classification. Experimental results show that this descriptor has the advantages of compactness and flexibility compared with the previous descriptor, and greatly reduces the storage space required. At the same time, the instance and category recognition accuracy of the proposed descriptor for objects can respectively reach 94.6% and 86.8%, which are higher than those of the previous methods for object recognition of 3D point clouds.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124560468","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 new revocable reputation evaluation system based on blockchain 一种新的基于区块链的可撤销信誉评价系统
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-03 DOI: 10.1504/ijhpcn.2019.10023621
Haoxuan Li, Hui Huang, Shichong Tan, Ning Zhang, Xiaotong Fu, Xiaoling Tao
{"title":"A new revocable reputation evaluation system based on blockchain","authors":"Haoxuan Li, Hui Huang, Shichong Tan, Ning Zhang, Xiaotong Fu, Xiaoling Tao","doi":"10.1504/ijhpcn.2019.10023621","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.10023621","url":null,"abstract":"Reputation evaluation system, as the publisher and analyser of evaluation, is an important influencing factor for users and sellers in online business. Traditional reputation evaluation system always requires a third party to achieve the operation of analysis and publishment. However, a third party often exposes the identity of the users, and leaks the information. As far as we know, all existing revocable reputation evaluations are based on the third-party model. In this paper, we present a new reputation evaluation system based on blockchain. Compared with traditional reputation evaluation systems, our system removes the third party, it allows users to modify their own evaluation information. Moreover, the user's privacy also can be protected. The experiment performance demonstrates that the overhead of the system is acceptable, the system is feasible and efficient.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"454 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132696915","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
Efficient algorithm for online data retrieval with one antenna in wireless networks 无线网络中一根天线在线数据检索的高效算法
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-03 DOI: 10.1504/ijhpcn.2019.10023616
Ping He, Shuli Luan
{"title":"Efficient algorithm for online data retrieval with one antenna in wireless networks","authors":"Ping He, Shuli Luan","doi":"10.1504/ijhpcn.2019.10023616","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.10023616","url":null,"abstract":"Given a set of requested data items and a set of multiple channels, data retrieval problem is to find a data retrieval sequence for downloading all requested data items from these channels in a reasonable time range. Almost all existing schemes are applied in offline environment that the client can learn prior knowledge of wireless data broadcast, such as the set of broadcast channels and the broadcast time of data items. However, this information is unknown in online data retrieval. So this paper proposes three online algorithms (MRLR, RM and MRM) for solving online data retrieval problem. Compared with the optimal offline data retrieval algorithm, MRLR, RM and MRM algorithms hold (k ‒ 1), (log(k ‒ 1) + k/2 ) and k/2 competitive rate respectively. Through comparison with the competitive rates and experimental results of proposed online algorithms, we observe that the performance of online data retrieval is improved in wireless networks.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"105 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131312613","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 new localisation strategy with wireless sensor networks for tunnel space model 基于无线传感器网络的隧道空间模型定位策略
Int. J. High Perform. Comput. Netw. Pub Date : 2019-09-03 DOI: 10.1504/ijhpcn.2019.10023608
Y. Huang, Yezhen Luo, Honghui Lai, Yiwang Huang
{"title":"A new localisation strategy with wireless sensor networks for tunnel space model","authors":"Y. Huang, Yezhen Luo, Honghui Lai, Yiwang Huang","doi":"10.1504/ijhpcn.2019.10023608","DOIUrl":"https://doi.org/10.1504/ijhpcn.2019.10023608","url":null,"abstract":"Because the three-dimensional distance vector hop (DV-hop) localisation has some large error phenomena in the location of tunnel space model, an improved three-dimensional DV-hop fixed node location strategy is proposed based on the wireless sensor network for the relationship between the geometric model of tunnel space. This strategy analyses the deficiency of traditional three-dimensional DV-hop algorithm about counts hop and calculations distance on two WSN nodes, and it employs the relationship between beacon node and distance to modify the hop count of DV-hop, then using the differential method corrects distance error from the unknown node to the beacon node. According to the tunnel space model, the selection mechanism is introduced, and three optimal beacon nodes are selected to locate the unknown nodes and further improve the location accuracy. The traditional three-dimensional DV-hop calculation hops neglect the distance between nodes, the improved strategy is used to correct the distance between unknown nodes and beacon nodes. The experimental results show that the improved DV-hop localisation strategy has greatly improved the location accuracy; it can be widely used to solve the internet of things problem.","PeriodicalId":136458,"journal":{"name":"Int. J. High Perform. Comput. Netw.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125538757","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书