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

Int. J. Distributed Syst. Technol.最新文献

筛选
英文 中文
Models for Internal Clustering Validation Indexes Based on Hadoop-MapReduce 基于Hadoop-MapReduce的内部聚类验证索引模型
Int. J. Distributed Syst. Technol. Pub Date : 2020-07-01 DOI: 10.4018/ijdst.2020070103
Soumeya Zerabi, S. Meshoul, Samia Boucherkha
{"title":"Models for Internal Clustering Validation Indexes Based on Hadoop-MapReduce","authors":"Soumeya Zerabi, S. Meshoul, Samia Boucherkha","doi":"10.4018/ijdst.2020070103","DOIUrl":"https://doi.org/10.4018/ijdst.2020070103","url":null,"abstract":"Clustervalidationaimstobothevaluatetheresultsofclusteringalgorithmsandpredictthenumberof clusters.Itisusuallyachievedusingseveralindexes.Traditionalinternalclusteringvalidationindexes (CVIs)aremainlybasedincomputingpairwisedistanceswhichresultsinaquadraticcomplexity oftherelatedalgorithms.TheexistingCVIscannothandlelargedatasetsproperlyandneedtobe revisitedtotakeaccountoftheever-increasingdatasetvolume.Therefore,designofparalleland distributedsolutionstoimplementtheseindexesisrequired.Tocopewiththisissue,theauthors proposetwoparallelanddistributedmodelsforinternalCVIsnamelyforSilhouetteandDunnindexes usingMapReduceframeworkunderHadoop.TheproposedmodelstermedasMR_Silhouetteand MR_Dunnhavebeentestedtosolveboththeissueofevaluatingtheclusteringresultsandidentifying theoptimalnumberofclusters.Theresultsofexperimentalstudyareverypromisingandshowthat theproposedparallelanddistributedmodelsachievetheexpectedtaskssuccessfully. KeywoRDS Big Data, Clustering, Data Mining, Dunn Index, Hadoop, Internal Clustering Validation Indexes, MapReduce, Optimal Number Of Clusters, Silhouette Index","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125610953","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
A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture 基于非阻塞协议的分布式P2P架构的一种新的渴望复制方法
Int. J. Distributed Syst. Technol. Pub Date : 2020-04-01 DOI: 10.4018/ijdst.2020040106
Katembo Kituta Ezéchiel, S. Ojha, Ruchi Agarwal
{"title":"A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture","authors":"Katembo Kituta Ezéchiel, S. Ojha, Ruchi Agarwal","doi":"10.4018/ijdst.2020040106","DOIUrl":"https://doi.org/10.4018/ijdst.2020040106","url":null,"abstract":"Eager replication of distributed databases over a decentralized Peer-to-Peer (P2P) network is often likely to generate unreliability because participants can be or cannot be available. Moreover, the conflict between transactions initiated by different peers to modify the same data is probable. These problems are responsible of perpetual transaction abortion. Thus, a new Four-Phase-Commit (4PC) protocol that allows transaction commitment with available peers and recovering unavailable peers when they become available again has been designed using the nested transactions and the distributed voting technique. After implementing the new algorithm with C#, experiments made it possible to analyse the performance which revealed that the new algorithm is efficient because in one second it can replicate a considerable number of records, such as when an important volume of data can be queued for subsequent recovery of the concerned slave peers when they become available again.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"401 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115919327","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
Analysis and Calculation of the Probability Selectivity Using the Modern Distributed Algorithms: Modern Distributed Algorithms 现代分布式算法的概率选择性分析与计算:现代分布式算法
Int. J. Distributed Syst. Technol. Pub Date : 2020-04-01 DOI: 10.4018/ijdst.2020040102
Z. Umarova, S. Botayeva, A. Zhidebayeva, Nursaule Torebay
{"title":"Analysis and Calculation of the Probability Selectivity Using the Modern Distributed Algorithms: Modern Distributed Algorithms","authors":"Z. Umarova, S. Botayeva, A. Zhidebayeva, Nursaule Torebay","doi":"10.4018/ijdst.2020040102","DOIUrl":"https://doi.org/10.4018/ijdst.2020040102","url":null,"abstract":"The calculation of the characteristics of the selectivity in the membrane separation of mixtures, based on basic physicochemical characteristics of the solution, is a difficult task due to the large number of influencing factors. To solve this problem, for a theoretical evaluation of the selectivity of ultrafiltration membranes, modern distributed algorithms are used for a probabilistic approach, in which the mechanism of the separation process differs significantly from the separation mechanism in nanomembranes. As a result of the proposed models and modern distributed algorithms, estimates of the selectivity of nanofiltration membranes for individual ions were obtained. It was found that an important feature of mixing with the mixture flowing through the membrane is the dependence of the effective diffusion coefficient on time. Also, as a result of calculations by the proposed model, it was found that this feature is modeled by the coefficient of anomalous fractal diffusion in time, as well as by the displacement of the effective separation zone in the membrane.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116963899","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
Development and Calculation of a Computer Model and Modern Distributed Algorithms for Dispersed Systems Aggregation: Modern Distributed Algorithms 分布式系统聚合的计算机模型和现代分布式算法的开发与计算:现代分布式算法
Int. J. Distributed Syst. Technol. Pub Date : 2020-04-01 DOI: 10.4018/ijdst.2020040105
Nurlybek Zhumatayev, Zhanat Umarova, G. Besbayev, Almira Zholshiyeva
{"title":"Development and Calculation of a Computer Model and Modern Distributed Algorithms for Dispersed Systems Aggregation: Modern Distributed Algorithms","authors":"Nurlybek Zhumatayev, Zhanat Umarova, G. Besbayev, Almira Zholshiyeva","doi":"10.4018/ijdst.2020040105","DOIUrl":"https://doi.org/10.4018/ijdst.2020040105","url":null,"abstract":"In this work, an attempt has been made to eliminate the contradiction of the Smoluchowski equation, using modern distributed algorithms for creating calculation algorithm and implementation a program for building a more perfect model by changing the type of the kinetic equation of aggregation taking into account the relaxation times. On the basis of the applied Mathcad package, there is a developed computer model for calculating the aggregation of dispersed systems. The obtained system of differential equations of the second order is solved by the Runge-Kutt method. The authors are presetting the initial conditions of the calculation. A subsequent analysis was made of the obtained non-local equations and the study of the behavior of solutions of different orders. Also, this research can be aimed at the generalization of the proposed approach for the analysis of aggregation processes in heterogeneous dispersed systems, involving the creation of aggregation models, taking into account both time and space non-locality.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130746864","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
Adapting Market-Oriented Policies for Scheduling Divisible Loads on Clouds 适应面向市场的云负载调度策略
Int. J. Distributed Syst. Technol. Pub Date : 2020-04-01 DOI: 10.4018/ijdst.2020040104
M. L. A. Majid, S. Chuprat
{"title":"Adapting Market-Oriented Policies for Scheduling Divisible Loads on Clouds","authors":"M. L. A. Majid, S. Chuprat","doi":"10.4018/ijdst.2020040104","DOIUrl":"https://doi.org/10.4018/ijdst.2020040104","url":null,"abstract":"Cloud computing has become an important alternative for solving big data processing. Nowadays, cloud service providers usually offer users a virtual machine with various combinations of prices. As each user has different circumstances, the problem of choosing the cost-minimized combination under a deadline constraint as well as user's preference is becoming more complex. This article is concerned with the investigation of adapting a user's preference policies for scheduling real-time divisible loads in a cloud computing environment. The workload allocation approach used in this research is using Divisible Load Theory. The proposed algorithm aggregates resources into groups and optimally distributes the fractions of load to the available resources according to user's preference. The proposed algorithm was evaluated by simulation experiments and compared with the baseline approach. The result obtained from the proposed algorithm reveals that a significant reduction in computation cost can be attained when the user's preferences are low priority.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122261149","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
An Efficient Cloud-Based Traffic Signal Manipulation Algorithm for Path Clearance 一种高效的基于云的道路清除交通信号处理算法
Int. J. Distributed Syst. Technol. Pub Date : 2020-04-01 DOI: 10.4018/ijdst.2020040103
Aamir Wali, Khansa Tanveer, Samreen Fatima, Ayeza Tanveer, Sara Iftikhar
{"title":"An Efficient Cloud-Based Traffic Signal Manipulation Algorithm for Path Clearance","authors":"Aamir Wali, Khansa Tanveer, Samreen Fatima, Ayeza Tanveer, Sara Iftikhar","doi":"10.4018/ijdst.2020040103","DOIUrl":"https://doi.org/10.4018/ijdst.2020040103","url":null,"abstract":"Beside many challenges that urban cities have to face, one of them is increasing traffic. Unfortunately, in developing countries like, for example, Pakistan, the traffic management infrastructure does not scale accordingly. This leads to two types of problems: congestion and long queues at traffic signals. This makes it difficult for emergency vehicles (EV) such as ambulances to reach their destination on time. Therefore, in this article, the authors have developed an intelligent path clearance system for emergency vehicles. The particular focus is on long queues at traffic signals. Given the GPS coordinates of an EV, a destination, a map, and the traffic light grid system, our system provides a signal free corridor to the priority vehicle by automatically manipulating traffic signals that fall in its path using cloud computing. The idea is to clear the path of the vehicle. The proposed system also makes decision based on the time of the day and current traffic conditions in real time. In case of multiple options, it also calculates the shortest path to the destination.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122907809","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 Thematic Analysis of the Articles on the Internet of Things in the Web of Science With HAC Approach 用HAC方法对科学网上物联网文章的专题分析
Int. J. Distributed Syst. Technol. Pub Date : 2020-04-01 DOI: 10.4018/ijdst.2020040101
A. Asemi, Fezzeh Ebrahimi
{"title":"A Thematic Analysis of the Articles on the Internet of Things in the Web of Science With HAC Approach","authors":"A. Asemi, Fezzeh Ebrahimi","doi":"10.4018/ijdst.2020040101","DOIUrl":"https://doi.org/10.4018/ijdst.2020040101","url":null,"abstract":"This research was carried out using the bibliometric method to thematically analyze the articles on IoT in the Web of Science with Hierarchical Agglomerative Clustering approach. First, the descriptors of the related articles published from 2002 to 2016 were extracted from WoS, by conducting a keyword search using the “Internet of Things” keyword. Data analysis and clustering were carried out in SPSS, UCINET, and PreMap. The analysis results revealed that the scientific literature published on IoT during the period had grown exponentially, with an approximately 48% growth rate in the last two years of the study period (i.e. 2015 and 2016). After analyzing the themes of the documents, the resulting concepts were classified into twelve clusters. The twelve main clusters included: Privacy and Security, Authentication and Identification, Computing, Standards and Protocols, IoT as a component, Big Data, Architecture, Applied New Techniques in IoT, Application, Connection and Communication Tools, Wireless Network Protocols, and Wireless Sensor Networks.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115038292","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
Research on a New Convolutional Neural Network Model Combined with Random Edges Adding 结合随机边相加的卷积神经网络新模型研究
Int. J. Distributed Syst. Technol. Pub Date : 2020-03-17 DOI: 10.4018/ijdst.2021010105
Xuanyu Shu, Jin Zhang, Sen Tian, Sheng Chen, Lingyu Chen
{"title":"Research on a New Convolutional Neural Network Model Combined with Random Edges Adding","authors":"Xuanyu Shu, Jin Zhang, Sen Tian, Sheng Chen, Lingyu Chen","doi":"10.4018/ijdst.2021010105","DOIUrl":"https://doi.org/10.4018/ijdst.2021010105","url":null,"abstract":"It is always a hot and difficult point to improve the accuracy of convolutional neural network model and speed up its convergence. Based on the idea of small world network, a random edge adding algorithm is proposed to improve the performance of convolutional neural network model. This algorithm takes the convolutional neural network model as a benchmark, and randomizes backwards and cross-layer connections with probability p to form a new convolutional neural network model. The proposed idea can optimize the cross layer connectivity by changing the topological structure of convolutional neural network, and provide a new idea for the improvement of the model. The simulation results based on Fashion-MINST and cifar10 data set show that the model recognition accuracy and training convergence speed are greatly improved by random edge adding reconstructed models with aprobability p = 0.1.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122924974","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
Optimized MRAI Timers for Border Gateway Protocol in Large Networks 大型网络中边界网关协议的优化MRAI定时器
Int. J. Distributed Syst. Technol. Pub Date : 2019-10-01 DOI: 10.4018/ijdst.2019100103
S. Shukla, Mahesh Kumar
{"title":"Optimized MRAI Timers for Border Gateway Protocol in Large Networks","authors":"S. Shukla, Mahesh Kumar","doi":"10.4018/ijdst.2019100103","DOIUrl":"https://doi.org/10.4018/ijdst.2019100103","url":null,"abstract":"The global routing performance is essential for the services provided by the internet applications on the Internet. Border Gateway Protocol (BGP) is the extensively used routing protocol for the autonomous systems which constructs the internet. The reduction in convergence time is a crucial challenge for BGP. The past studies confirm that the Minimum Route Advertisement Interval (MRAI) decreases the convergence time. However, most of the approaches are focused on finding the optimum MRAI value. The techniques to implement the MRAI timers are less addressed by the researcher in compare to finding the optimum MRAI value. The implementation of reusable MRAI timers for large networks is critical at different load conditions. Therefore, this article presents the novel approach Optimized MRAI timer in a large network which reduces the convergence time. The proposed approach reduces the end-to-end delay, the number of exchanged updates message, and convergence time of BGP events and enhances the number of delivered packets in compare to related techniques.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126348498","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
IoT and Big Data Technologies for Monitoring and Processing Real-Time Healthcare Data 监测和处理实时医疗数据的物联网和大数据技术
Int. J. Distributed Syst. Technol. Pub Date : 2019-10-01 DOI: 10.4018/ijdst.2019100102
A. Kharbouch, Y. NaitMalek, H. Elkhoukhi, M. Bakhouya, V. D. Florio, M. D. E. Ouadghiri, Steven Latré, C. Blondia
{"title":"IoT and Big Data Technologies for Monitoring and Processing Real-Time Healthcare Data","authors":"A. Kharbouch, Y. NaitMalek, H. Elkhoukhi, M. Bakhouya, V. D. Florio, M. D. E. Ouadghiri, Steven Latré, C. Blondia","doi":"10.4018/ijdst.2019100102","DOIUrl":"https://doi.org/10.4018/ijdst.2019100102","url":null,"abstract":"Recent advances in pervasive technologies, such as wireless, ad hoc networks, and wearable sensor devices, allow the connection of everyday things to the Internet, commonly denoted as the Internet of Things (IoT). The IoT is seen as an enabler to the development of intelligent and context-aware services and applications. However, handling dynamic and frequent context changes is a difficult task without a real-time event/data acquisition and processing platform. Big data technologies and data analytics have been recently proposed for timely analyzing information (i.e., data, events) streams. The main aim is to make users' life more comfortable according to their locations, current requirements, and ongoing activities. In this article, combining IoT techniques and Big data technologies into a holistic platform for continuous and real-time health-care data monitoring and processing is introduced. Real-testing experiments have been conducted and results are reported to show the usefulness of this platform in a real-case scenario.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122586091","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术官方微信