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

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

筛选
英文 中文
Cache replication for information-centric networks through programmable networks 通过可编程网络实现信息中心网络的缓存复制
Int. J. Grid Util. Comput. Pub Date : 2019-08-09 DOI: 10.1504/IJGUC.2019.10023106
E. B. Nascimento, E. Moreno, D. D. J. D. Macedo
{"title":"Cache replication for information-centric networks through programmable networks","authors":"E. B. Nascimento, E. Moreno, D. D. J. D. Macedo","doi":"10.1504/IJGUC.2019.10023106","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10023106","url":null,"abstract":"Software-Defined Networking (SDN) is a new approach that decouples control from the data transfer function and can be directly programmable by the programming language. At the same time, Information-Centric Networks (ICNs) influence the search for information through network caching and multipart communication. Moreover, these projects are developed to solve traffic problems and have content transfer through a scalable network structure with simple management. The SDN covers ICNs, besides decoupling the control to allow flexibility of network settings to reduce overhead of segments. Based on this information, an architecture was designed to provide reliable content that can be replicated in the network. The ICN architecture proposed stores information through a logical volume to the next access, enabling connection with remote controllers for reliable storage in cloud environments. The cache efficiency achieved almost 50% reduction of time response, in addition, there was improvement around 10% when the number of parallel requests was increased.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131029874","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
Towards autonomous creation of service chains on cloud markets 在云市场上自主创建服务链
Int. J. Grid Util. Comput. Pub Date : 2019-08-09 DOI: 10.1504/IJGUC.2019.10023105
Benedikt Pittl, I. Haq, W. Mach, E. Schikuta
{"title":"Towards autonomous creation of service chains on cloud markets","authors":"Benedikt Pittl, I. Haq, W. Mach, E. Schikuta","doi":"10.1504/IJGUC.2019.10023105","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10023105","url":null,"abstract":"Today, cloud services, such as virtual machines, are traded directly at fixed prices between consumers and providers on platforms, e.g. Amazon EC2. The recent development of Amazon's EC2 spot market shows that dynamic cloud markets are gaining popularity. Hence, autonomous multi-round bilateral negotiations, also known as bazaar negotiations, are a promising approach for trading cloud services on future cloud markets. They play a vital role for composing service chains. Based on a formal description we describe such service chains and derive different negotiation types. We implement them in a simulation environment and evaluate our approach by executing different market scenarios. Therefore, we developed three negotiation strategies for cloud resellers. Our simulation results show that cloud resellers as well as their negotiation strategies have a significant impact on the resource allocation of cloud markets. Very high as well as very low mark-ups reduce the profit of a reseller.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129164049","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
An autonomic mechanism based on ant colony pattern for detecting the source of incidents in complex enterprise systems 基于蚁群模式的复杂企业系统事件源检测自主机制
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/IJGUC.2019.10022685
Kamaleddin Yaghoobirafi, E. Nazemi
{"title":"An autonomic mechanism based on ant colony pattern for detecting the source of incidents in complex enterprise systems","authors":"Kamaleddin Yaghoobirafi, E. Nazemi","doi":"10.1504/IJGUC.2019.10022685","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022685","url":null,"abstract":"In complex enterprises, various events such as failure of a server, malfunction of an application etc. may happen. In many cases, these events are caused by a change or an incident in a resource which belongs to another layer of information technology architecture. This makes the detection of complex events very difficult. In this paper, a mechanism is proposed based on pheromone deposition pattern for detecting the main source of failures and deficiencies in any position in the information technology architectural layers and recognising appropriate alternative solutions. It is expected that this mechanism facilitates the coordination between the resources which are not digitally represented. For sake of evaluation, two case studies are considered which investigate the inter-layer adaptation scenarios. The results show that the adaptation process can be done in less time and with more scalability with utilisation of the proposed mechanism in comparison with classic approaches.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128413449","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}
引用次数: 12
Facial expression recognition using geometric features and modified hidden Markov model 基于几何特征和改进隐马尔可夫模型的面部表情识别
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/IJGUC.2019.10022683
M. Rahul, Narendra Kohli, Rashi Agarwal, Sanju Mishra
{"title":"Facial expression recognition using geometric features and modified hidden Markov model","authors":"M. Rahul, Narendra Kohli, Rashi Agarwal, Sanju Mishra","doi":"10.1504/IJGUC.2019.10022683","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022683","url":null,"abstract":"This work proposes a geometric feature-based descriptor for efficient Facial Expression Recognition (FER) that can be used for better human-computer interaction. Although lots of research has been focused on descriptor-based FER still different problems have to be solved regarding noise, recognition rate, time and error rates. The Japanese Female Facial Expression (JAFFE) data sets help to make FER more reliable and efficient as pixels are distributed uniformly. The proposed system introduces novel geometric features to extract important features from the images and layered Hidden Markov Model (HMM) as a classifier. The layered HMM is used to recognised seven facial expressions i.e., anger, disgust, fear, joy, sadness, surprise and neutral. The proposed framework is compared with existing systems where the proposed framework proves its superiority with the recognition rate of 84.7% with the others 85%. Our proposed framework is also tested in terms of recognition rates, processing time and error rates and found its best accuracy with the other existing systems.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130406315","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}
引用次数: 19
A new bi-matrix game model with fuzzy payoffs in credibility space 可信度空间中具有模糊收益的双矩阵对策模型
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/ijguc.2019.101997
Cunlin Li, Ming Li
{"title":"A new bi-matrix game model with fuzzy payoffs in credibility space","authors":"Cunlin Li, Ming Li","doi":"10.1504/ijguc.2019.101997","DOIUrl":"https://doi.org/10.1504/ijguc.2019.101997","url":null,"abstract":"Uncertain theory based on expert's evaluation and non-additive measure is introduced to explore the bi-matrix game with the uncertain payoffs. The uncertainty space based on the axiom of the uncertain measures is presented. Some basic characteristics of uncertain events are described and the expected value of the uncertain variables is given in uncertainty space. A new model of bi-matrix game with uncertain payoffs is established and its equivalent strategy is given. Then, we develop an expected model of uncertain bi-matrix games and define the uncertain equilibrium strategy of uncertain bi-matrix games. By using the expected value of uncertain variable, we transform the model into a linear programming, the expected equilibrium strategy of the uncertain bi-matrix games is identified through solving linear equations.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123829947","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
An enhanced Jaya algorithm for solving nurse scheduling problem 一种改进的Jaya算法求解护士调度问题
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/IJGUC.2019.10022662
W. H. Elashmawi, A. Ali
{"title":"An enhanced Jaya algorithm for solving nurse scheduling problem","authors":"W. H. Elashmawi, A. Ali","doi":"10.1504/IJGUC.2019.10022662","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022662","url":null,"abstract":"Nurse Scheduling Problem (NSP) is one of the main optimisation problems that require an efficient assignment of a number of nurses to a number of shifts in order to cover the hospital's planning horizon demands. NSP is an NP-hard problem which subjects to a set of hard and soft constraints. Such problems can be solved by optimisation algorithms efficiently such as meta-heuristic algorithms. In this paper, we enhanced one of the most recent meta-heuristic algorithms which is called Jaya for solving the NSP. The enhanced algorithm is called EJNSP (Enhanced Jaya for Nurse Scheduling Problem). EJNSP focuses on maximising the nurses' preferences about shift requests and minimising the under- and over-staffing. EJNSP has two main strategies. First, it randomly generates an initial effective scheduling that satisfies a set of constraints. Second, it uses swap operators in order to satisfy the set of soft constraints to achieve an effective scheduling. A set of experiments have been applied to a set of the benchmark dataset with different numbers of nurses and shifts. The experimental results demonstrated that EJNSP algorithm achieved effective results for solving NSP in order to minimise the under- and over-staffing and satisfy the nurses' preferences.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123443521","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
An efficient content sharing scheme using file splitting and differences between versions in hybrid peer-to-peer networks 在混合型点对点网络中，利用文件分割和版本间差异的高效内容共享方案
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/IJGUC.2019.10022665
Toshinobu Hayashi, S. Sugawara
{"title":"An efficient content sharing scheme using file splitting and differences between versions in hybrid peer-to-peer networks","authors":"Toshinobu Hayashi, S. Sugawara","doi":"10.1504/IJGUC.2019.10022665","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022665","url":null,"abstract":"This paper proposes an efficient content sharing strategy using file splitting and difference between versions in hybrid Peer-to-Peer (P2P) networks. In this strategy, when a user requests a content item, he/she can get it from the network by retrieving the other version of the content item and the difference from the requested version, if the obtaining cost of the requested version is expensive. This way of content sharing can be expected to accomplish effective and flexible operation. Furthermore, efficient utilisation of a peer's storage capacity is achieved by splitting each replica of a content item into several small blocks and storing them separately in the plural peers.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125106553","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
Novel mobile palmprint databases for biometric authentication 用于生物识别认证的新型移动掌纹数据库
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/IJGUC.2019.10019524
Mahdieh Izadpanahkakhk, S. Razavi, Mehran Taghipour-Gorjikolaie, Seyyed Hamid Zahiri, A. Uncini
{"title":"Novel mobile palmprint databases for biometric authentication","authors":"Mahdieh Izadpanahkakhk, S. Razavi, Mehran Taghipour-Gorjikolaie, Seyyed Hamid Zahiri, A. Uncini","doi":"10.1504/IJGUC.2019.10019524","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10019524","url":null,"abstract":"Mobile palmprint biometric authentication has attracted a lot of attention as an interesting analytics tool for representing discriminative features. Despite the advances in this technology, there are some challenges including lack of enough data and invariant templates to the rotation, illumination, and translation. In this paper, we provide two mobile palmprint databases and we can address the aforementioned challenges via deep convolutional neural networks. In the best of our knowledge, this paper is the first study in which mobile palmprint images were acquired in some special views and then were evaluated via deep learning training algorithms. To evaluate our mobile palmprint images, some well-known convolutional neural networks are applied for verification task. By using these networks, the best performing results are achieved via GoogLeNet and CNN-F architectures in terms of cost of the training phase and classification accuracy of the test phase obtained in the 1-to-1 matching procedure.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134192495","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
An intelligent water drops-based approach for workflow scheduling with balanced resource utilisation in cloud computing 云计算中基于智能水滴的平衡资源利用工作流调度方法
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/ijguc.2019.101995
Mala Kalra, Sarbjeet Singh
{"title":"An intelligent water drops-based approach for workflow scheduling with balanced resource utilisation in cloud computing","authors":"Mala Kalra, Sarbjeet Singh","doi":"10.1504/ijguc.2019.101995","DOIUrl":"https://doi.org/10.1504/ijguc.2019.101995","url":null,"abstract":"The problem of finding optimal solutions for scheduling scientific workflows in cloud environment has been thoroughly investigated using various nature-inspired algorithms. These solutions minimise the execution time of workflows, however may result in severe load imbalance among Virtual Machines (VMs) in cloud data centres. Cloud vendors desire the proper utilisation of all the VMs in the data centres to have efficient performance of overall system. Thus, load balancing of VMs becomes an important aspect while scheduling tasks in cloud environment. In this paper, we propose an approach based on Intelligent Water Drops (IWD) algorithm to minimise the execution time of workflows while balancing the resource utilisation of VMs in cloud computing environment. The proposed approach is compared with a variety of well-known heuristic and meta-heuristic techniques using three real-time scientific workflows, and experimental results show that the proposed algorithm performs better than these existing techniques in terms of makespan and load balancing.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125612487","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}
引用次数: 8
Fog computing with original data reference function 雾计算具有原始数据参考功能
Int. J. Grid Util. Comput. Pub Date : 2019-07-18 DOI: 10.1504/IJGUC.2019.10022667
Tsukasa Kudo
{"title":"Fog computing with original data reference function","authors":"Tsukasa Kudo","doi":"10.1504/IJGUC.2019.10022667","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022667","url":null,"abstract":"In recent years, since large amounts of data are being transferred to the cloud server because of the evolution of the Internet of Things (IoT), problems such as the network bandwidth restrictions and sensor feedback control delays have appeared. For these limitations, fog computing, in which the primary processing of sensor data is performed at the fog node, and only the results are transferred to the cloud server, has been proposed. However, in this method, when the original sensor data are necessary for the analysis in the cloud server, the data are missing. For this problem, I propose a data model, in which the original sensor data are stored at the fog node with a distributed database. Furthermore, the performance of this data model is evaluated, showing the original data reference from the cloud server can be executed efficiently, particularly in the case of installing multiple fog nodes.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131732564","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学术官方微信