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

Int. J. Grid Util. Comput.最新文献

筛选
英文 中文
Predicting students' academic performance: Levy search of cuckoo-based hybrid classification 预测学生学习成绩:基于杜鹃鸟混合分类的Levy搜索
Int. J. Grid Util. Comput. Pub Date : 2020-06-23 DOI: 10.1504/ijguc.2020.10029853
D. Vora, R. Kamatchi
{"title":"Predicting students' academic performance: Levy search of cuckoo-based hybrid classification","authors":"D. Vora, R. Kamatchi","doi":"10.1504/ijguc.2020.10029853","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029853","url":null,"abstract":"Educational Data Mining (EDM) exists as a novel trend in the Knowledge Discovery in Databases (KDD) and Data Mining (DM) field that concerns in mining valuable patterns and finding out practical knowledge from the educational systems. However, evaluating the educational performance of students is challenging as their academic performance pivots on varied constraints. Hence, this paper intends to predict the educational performance of students based on socio-demographic information. To attain this, performance prediction architecture is introduced with two modules. One module is for handling the big data via MapReduce (MR) framework, whereas the second module is an intelligent module that predicts the performance of the students using intelligent data processing stages. Here, the hybridisation of classifiers like Support Vector Machine (SVM) and Deep Belief Network (DBN) is adopted to get better results. In DBN, Levy Search of Cuckoo (LC) algorithm is adopted for weight computation. Hence, the proposed prediction model SVM-LCDBN is proposed that makes deep connection with the hybrid classifier to attain more accurate output. Moreover, the adopted scheme is compared with conventional algorithms, and the results are attained.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134038626","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
Link survivability rate-based clustering for QoS maximisation in VANET VANET中基于链路存活率的QoS最大化聚类
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029847
Kalaivani Dhanasegaran, P. C. Mouli
{"title":"Link survivability rate-based clustering for QoS maximisation in VANET","authors":"Kalaivani Dhanasegaran, P. C. Mouli","doi":"10.1504/ijguc.2020.10029847","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029847","url":null,"abstract":"A clustering technique is used in VANET to manage and stabilise topology information. Data communication in the cluster is performed by Cluster Heads (CH). The major issues involved in the clustering approaches are improper definition of cluster structure and maintenance of cluster structure in dynamic networks. To overcome these issues a link and weight-based clustering approach is developed along with Distributed Dispatching Information Table (DDIT). It is based on relative velocity of two same directional vehicles by forming a cluster with a number of nodes in VANET. The cluster head is selected based on link survival rate of the vehicles to provide the emergency message towards different vehicles in the cluster along with stored data packet information in DDIT table for fault prediction. Finally, an efficient medium access control protocol is used to provide prioritised message for avoiding spectrum shortage of emergency messages in the cluster. Comparative analysis between the proposed method and existing methods proves the effectiveness of our method with minimum transmission delay and reduced routing control overhead.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124760256","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
Analysis of spectrum handoff schemes for cognitive radio networks considering secondary user mobility 考虑二次用户移动性的认知无线网络频谱切换方案分析
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029844
K. S. Preetha, S. Kalaivani
{"title":"Analysis of spectrum handoff schemes for cognitive radio networks considering secondary user mobility","authors":"K. S. Preetha, S. Kalaivani","doi":"10.1504/ijguc.2020.10029844","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029844","url":null,"abstract":"Cognitive radio has been proposed as an intelligent wireless communication system towards the usage of dynamic spectrum access in next generation networks, where the primary users (PU) and secondary users (SU) can share the spectrum, while causing minimum interference to each other. Spectrum mobility is the main element for the effective execution of cognitive radio networks. Spectrum mobility can be achieved by means of spectrum handoff (SHO). Initially, SUs continuously sense the channels to identify an idle channel. Error in sensing channel is possible. A detection theory is put forth to analyse the spectrum-sensing errors with the receiver operating characteristic (ROC) considering false alarm probability, missed detection and detection probability. Also, we meticulously investigate and analyse the probability of spectrum handoff (PSHO) with lognormal-3 and Hyper-Erlang distribution models considering SU call duration and residual time of spectrum holes availability designed for tele-traffic analysis.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134238125","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}
引用次数: 4
Study on NVH robustness evaluation method of high-mileage automobile based on systematic sampling 基于系统抽样的高行驶里程汽车NVH稳健性评价方法研究
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029850
Jianqiang Xiong, Le Yuan, Dingding Liao, Jun Wu
{"title":"Study on NVH robustness evaluation method of high-mileage automobile based on systematic sampling","authors":"Jianqiang Xiong, Le Yuan, Dingding Liao, Jun Wu","doi":"10.1504/ijguc.2020.10029850","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029850","url":null,"abstract":"In order to study the Noise Vibration and Harshness (NVH) changing characteristics of high-mileage automobile, master the NVH variation regularity of high-mileage automobile, and improve the riding comfort of automobile, based on the principle of statistical analysis and the adaptability of different sampling methods, a robust evaluation method of NVH of high-mileage automobile based on systematic sampling is proposed. In this paper, the basic principle and system implementation steps of this method are described. An example is provided to illustrate the robustness evaluation process of high-mileage automobile vibration acceleration by using the method proposed, and requirements and precautions in using the method are pointed out. The method proposed in the paper can provide a theoretical basis and guidance for quantitative and qualitative evaluation of automobile NVH robustness.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124623252","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
Performance analysis of StaaS on IoT devices in fog computing environment using embedded systems 基于嵌入式系统的雾计算环境下物联网设备StaaS性能分析
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029852
José dos Santos Machado, D. Silva, R. S. Fontes, Adauto Cavalcante Menezes, E. Moreno, Admilson R. L. Ribeiro
{"title":"Performance analysis of StaaS on IoT devices in fog computing environment using embedded systems","authors":"José dos Santos Machado, D. Silva, R. S. Fontes, Adauto Cavalcante Menezes, E. Moreno, Admilson R. L. Ribeiro","doi":"10.1504/ijguc.2020.10029852","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029852","url":null,"abstract":"This work presents the concept of Fog Computing, its theoretical contextualisation and the related works, and performs the analysis of a Fog Computing to provide Storage as a Service (StaaS) on IoT devices using embedded systems platforms, in addition to comparing its results with those obtained by a high-performance server. In this paper, we use OwnCloud and Benchmark SmashBox (for data transfer analysis). The results showed that the implementation of this service in embedded systems devices can be a good alternative to reduce one of these problems, in this case, the storage of data, which currently reaches IoT devices.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125215750","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 study on data de-duplication schemes in cloud storage 云存储中重复数据删除方案的研究
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029846
P. Kumar, U. Gandhi, Shakila Basheer, Parthasarathy Panchatcharam
{"title":"A study on data de-duplication schemes in cloud storage","authors":"P. Kumar, U. Gandhi, Shakila Basheer, Parthasarathy Panchatcharam","doi":"10.1504/ijguc.2020.10029846","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029846","url":null,"abstract":"Digital data is growing at immense rates day by day and finding efficient storage and security mechanisms is a challenge. Cloud storage has already gained popularity because of the huge data storage capacity in storage servers made available to users by the cloud service providers. When lots of users upload data in cloud there can be much redundant data as well and this can waste storage space as well as affect transmission bandwidth. To promise efficient storage handling of this redundant data is very important which is done by the concept of deduplication. The major challenge for deduplication is that most users upload data in encrypted form for privacy and security of data. There are many prevailing mechanisms for deduplication some of which handle encrypted data as well. The purpose of this paper is to conduct a survey of the existing deduplication mechanisms in cloud storage and to analyse the methodologies used by each of them.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115555206","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
A survey on Fog Computing and its research challenges 雾计算综述及其研究挑战
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029843
José dos Santos Machado, E. Moreno, Admilson R. L. Ribeiro
{"title":"A survey on Fog Computing and its research challenges","authors":"José dos Santos Machado, E. Moreno, Admilson R. L. Ribeiro","doi":"10.1504/ijguc.2020.10029843","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029843","url":null,"abstract":"This paper reviews the new paradigm of distributed computing, which is Fog Computing, and it presents its concept, characteristics and areas of performance. It performs a literature review on the problem of its implementation and analyses its research challenges such as: security issues; operational issues and their standardisation. We show and discuss that many questions need to be researched in academia so that their implementation will become a reality, but it became clear that their adherence is inevitable for the internet of the future.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661614","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}
引用次数: 4
Multi-objective optimisation of traffic signal control based on particle swarm optimisation 基于粒子群算法的交通信号控制多目标优化
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029851
L. Jian
{"title":"Multi-objective optimisation of traffic signal control based on particle swarm optimisation","authors":"L. Jian","doi":"10.1504/ijguc.2020.10029851","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029851","url":null,"abstract":"In order to relieve the traffic jam, the improved particle swarm optimisation is applied in multiple objective optimisation of traffic signal control. Multiple objective optimal model of traffic signal is constructed considering the queue length, vehicle delay, and exhaust emission. The vehicle delay and queue length model under control of traffic signal is constructed through combining the Webster model and High Capacity Manual delay model. The vehicle exhaust emission model under control of traffic signal is also constructed and the objective function and constraint conditions are confirmed. Improved particle swarm optimisation algorithm is established through combining the traditional particle swarm algorithm and genetic algorithm. In every iteration, a number of particles are selected based on hybrid probability to put them into pool. The value of inertia factor can be regulated based on the following non-linear inertia weight decrement function. Finally, the simulation analysis is carried out using an intersection as research objective, flow of straight road ranges from 300 to 450 pcu, the flow of left turn road ranges from 250 to 380 pcu, and the optimal performance index is obtained, the new multiple objective optimisation model can obtain better optimal results than the traditional multiple objective optimisation algorithm, and the better traffic control effect is obtained.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121048041","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
Research on data access control algorithm based on fine-grained cloud storage 基于细粒度云存储的数据访问控制算法研究
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.108462
Qiaoge Xu
{"title":"Research on data access control algorithm based on fine-grained cloud storage","authors":"Qiaoge Xu","doi":"10.1504/ijguc.2020.108462","DOIUrl":"https://doi.org/10.1504/ijguc.2020.108462","url":null,"abstract":"In order to ensure the cloud storage security and achieve fine-grained data access control, a new fine-grained data access control algorithm is established based on CP-ABE algorithm. The basic theory of CP-ABE algorithm is studied in depth, and then the fine-grained cloud storage controlling scheme based on digital envelope is put forward. The new scheme construction process is given, and then the corresponding algorithm is designed. Simulation analysis is carried out, results show that the proposed data access control algorithm can effectively improve the searching efficiency of cipher text, and achieve fine-grained access under cloud storage environment.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134628344","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
Evaluation of navigation based on system optimal traffic assignment for connected cars 基于系统最优交通分配的网联汽车导航评价
Int. J. Grid Util. Comput. Pub Date : 2020-06-04 DOI: 10.1504/ijguc.2020.10029848
Weibin Wang, M. Uehara, H. Ozaki
{"title":"Evaluation of navigation based on system optimal traffic assignment for connected cars","authors":"Weibin Wang, M. Uehara, H. Ozaki","doi":"10.1504/ijguc.2020.10029848","DOIUrl":"https://doi.org/10.1504/ijguc.2020.10029848","url":null,"abstract":"Recently, many cars have become connected to internet. In the near future, almost all cars will be connected cars. Such a connected car will automatically drive according to a navigation system. Conventional car navigation systems are based on User Equilibrium (UE) traffic assignment. However, System Optimal (SO) traffic assignment is better than UE traffic assignment. To realise SO traffic assignment, complete traffic information is required. When connected cars become ubiquitous, all traffic information will be gathered into the cloud. Therefore, a cloud-based navigation system can provide SO-based navigation to connected cars. An SO-based navigation method in which the cloud collects traffic information from connected cars, computes SO traffic assignments, and recommends SO routes to users was recently proposed. In this paper, we evaluate this SO-based navigation method in detail.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268367","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学术文献互助群
群 号：481959085
Book学术官方微信