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

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

筛选
英文 中文
Reliability Enhancement Algorithm of Human Motion Recognition Based on Knowledge Graph 基于知识图的人体运动识别可靠性增强算法
Int. J. Distributed Syst. Technol. Pub Date : 2021-01-01 DOI: 10.4018/ijdst.2021010101
Yongwei Wang, Feng Feng
{"title":"Reliability Enhancement Algorithm of Human Motion Recognition Based on Knowledge Graph","authors":"Yongwei Wang, Feng Feng","doi":"10.4018/ijdst.2021010101","DOIUrl":"https://doi.org/10.4018/ijdst.2021010101","url":null,"abstract":"In order to solve the problem of uneven spatial distribution of human motion image and low peak signal-to-noise ratio (PSNR) of image reliability enhancement, a reliability enhancement algorithm for human motion recognition based on knowledge graph is proposed. An automatic spatial planning model of human motion image is constructed. The human motion spatial features are sampled, and the three-dimensional contour feature reconstruction model is established. The human motion spatial contour structure is reconstructed by adaptive edge feature detection method, and the knowledge graph of the motion image is extracted. Multi-scale information enhancement method is used to enhance and recognize the reliability of human motion image. The experimental results show that the method has the advantages of good reliability, high signal-to-noise ratio of image enhancement, and high accuracy of human motion recognition.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133737719","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
Implementation and Evaluation of Local Knowledge Inheritance System 地方知识继承系统的实施与评价
Int. J. Distributed Syst. Technol. Pub Date : 2020-10-01 DOI: 10.4018/ijdst.2020100101
Tomoyuki Ishida, Hayato Ito
{"title":"Implementation and Evaluation of Local Knowledge Inheritance System","authors":"Tomoyuki Ishida, Hayato Ito","doi":"10.4018/ijdst.2020100101","DOIUrl":"https://doi.org/10.4018/ijdst.2020100101","url":null,"abstract":"In this study, we implemented and evaluated a local knowledge inheritance system using old maps and location-based augmented reality (AR) technology. This system is comprised of a mobile local knowledge inheritance application and a local knowledge inheritance data management system. This system provides local knowledge to users using a map axis and location-based AR on mobile terminals. The map axis clarifies the relevance associated with the times and themes in local knowledge. We conducted an evaluation experiment with 47 local residents. The results confirm the effectiveness of the system relative to improving understanding of local knowledge and the effectiveness of using museum materials.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121622317","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
WMN-PSODGA - An Intelligent Hybrid Simulation System for WMNs Considering Load Balancing: A Comparison for Different Client Distributions 考虑负载均衡的WMN-PSODGA智能混合仿真系统:不同客户端分布的比较
Int. J. Distributed Syst. Technol. Pub Date : 2020-10-01 DOI: 10.4018/ijdst.2020100103
Seiji Ohara, Ermioni Qafzezi, Admir Barolli, Shinji Sakamoto, Yi Liu, L. Barolli
{"title":"WMN-PSODGA - An Intelligent Hybrid Simulation System for WMNs Considering Load Balancing: A Comparison for Different Client Distributions","authors":"Seiji Ohara, Ermioni Qafzezi, Admir Barolli, Shinji Sakamoto, Yi Liu, L. Barolli","doi":"10.4018/ijdst.2020100103","DOIUrl":"https://doi.org/10.4018/ijdst.2020100103","url":null,"abstract":"Wireless mesh networks (WMNs) are becoming an important networking infrastructure because they have many advantages, such as low cost and increased high-speed wireless Internet connectivity. In the authors' previous work, they implemented a hybrid simulation system based on particle swarm optimization (PSO) and distributed genetic algorithm (DGA), called WMN-PSODGA. Moreover, they added to the fitness function a new parameter for mesh router load balancing a number of covered mesh clients per router (NCMCpR). In this article, the authors consider Exponential, Weibull, and Normal distributions of mesh clients and carry out a comparison study. The simulation results show that the performance of the Exponential, Weibull and Normal distributions was improved by considering load balancing when using WMN-PSODGA. For the same number of mesh clients, the Normal distribution behaves better than the other distributions. This is because all mesh clients are covered by a smaller number of mesh routers and the standard deviation is improved by effectively using NCMCpR.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127180789","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
PaaS Optimization of Apache Applications Using System Parameter Tuning of Big Data Platforms in Distributed Computing 基于分布式计算大数据平台系统参数调优的Apache应用PaaS优化
Int. J. Distributed Syst. Technol. Pub Date : 2020-10-01 DOI: 10.4018/ijdst.2020100102
T. Pattanshetti, V. Attar
{"title":"PaaS Optimization of Apache Applications Using System Parameter Tuning of Big Data Platforms in Distributed Computing","authors":"T. Pattanshetti, V. Attar","doi":"10.4018/ijdst.2020100102","DOIUrl":"https://doi.org/10.4018/ijdst.2020100102","url":null,"abstract":"Widely used data processing platforms use distributed systems to process huge data efficiently. The aim of this article is to optimize the platform services by tuning only the relevant, tunable, system parameters and to identify the relation between the software quality metrics. The system parameters of data platforms based on the service level agreements can be defined and customized. In the first stage, the most significant parameters are identified and shortlisted using various feature selection approaches. In the second stage, the iterative runs of applications are executed for tuning these shortlisted parameters to identify the optimal value and to understand the impact of individual input parameters on the system output parameter. The empirical results imply significant improvement in performance and with which it is possible to render the proposed work optimizing the services offered by these data platforms.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134057630","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
Fuzzy Crow Search Algorithm-Based Deep LSTM for Bitcoin Prediction 基于模糊乌鸦搜索算法的深度LSTM比特币预测
Int. J. Distributed Syst. Technol. Pub Date : 2020-10-01 DOI: 10.4018/ijdst.2020100104
Chandrasekar Ravi
{"title":"Fuzzy Crow Search Algorithm-Based Deep LSTM for Bitcoin Prediction","authors":"Chandrasekar Ravi","doi":"10.4018/ijdst.2020100104","DOIUrl":"https://doi.org/10.4018/ijdst.2020100104","url":null,"abstract":"Prediction of stock market trends is considered as an important task and is of great attention as predicting stock prices successfully may lead to attractive profits by making proper decisions. Stock market prediction is a major challenge owing to non-stationary, blaring, and chaotic data and thus, the prediction becomes challenging among the investors to invest the money for making profits. Initially, the blockchain network is fed to the blockchain network bridge from which the bitcoin data is acquired that is followed with the bitcoin prediction. Bitcoin prediction is performed using the proposed FuzzyCSA-based Deep Long short-term memory (LSTM). At first, the flow strength indicators are extracted based on Double exponential moving average (DEMA), Rate of Change (ROCR), Average True Range (ATR), Simple Moving Average (SMA), and Moving Average Convergence Divergence (MACD) from the blockchain data. Based on the extracted features, the prediction is done using FuzzyCSA-based Deep LSTM, which is the combination of FuzzyCSA with Deep LSTM. Then, the CSA is modified using the fuzzy operator for determining the optimal weights in Deep LSTM. The experimentation of the proposed method is performed from the openly available dataset. The analysis of the method in terms of Mean Absolute Error (MAE), and Root Mean Square Error (RMSE) reveals that the proposed FuzzyCSA-based Deep LSTM acquired a minimal MAE of 0.4811, and the minimal RMSE of 0.3905, respectively.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132526433","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}
引用次数: 11
Fault-Tolerant Strategies in the Tree-Based Fog Computing Model 基于树的雾计算模型中的容错策略
Int. J. Distributed Syst. Technol. Pub Date : 2020-10-01 DOI: 10.4018/ijdst.2020100105
R. Oma, Shigenari Nakamura, T. Enokido, M. Takizawa
{"title":"Fault-Tolerant Strategies in the Tree-Based Fog Computing Model","authors":"R. Oma, Shigenari Nakamura, T. Enokido, M. Takizawa","doi":"10.4018/ijdst.2020100105","DOIUrl":"https://doi.org/10.4018/ijdst.2020100105","url":null,"abstract":"In the Fog Comput$ing (FC) model of the Internet of Things (IoT), application processes to handle sensor data are distributed to fog nodes and servers. In the Tree-based FC (TBFC) model proposed by the authors, fog nodes are hierarchically structured. In this article, the authors propose a TBFC for a General Process (TBFCG) model to recover from the faults of fog nodes. If a node gets faulty, the child nodes are disconnected. The authors propose Minimum Energy in the TBFCG tree (MET) and selecting Multiple Parents for recovery in the TBFCG tree (MPT) algorithms to select a new parent node for the disconnected nodes. A new parent node has to process data from not only the disconnected nodes, but also its own child nodes. In the evaluation, the energy consumption and execution time of a new parent node can be reduced by the proposed algorithms.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133753281","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 Energy and Fault Aware Mechanism of Wireless Sensor Networks Using Multiple Mobile Agents 基于多移动代理的无线传感器网络能量与故障感知机制
Int. J. Distributed Syst. Technol. Pub Date : 2020-07-01 DOI: 10.4018/ijdst.2020070102
Rajendra Kumar Dwivedi, Rakesh Kumar
{"title":"An Energy and Fault Aware Mechanism of Wireless Sensor Networks Using Multiple Mobile Agents","authors":"Rajendra Kumar Dwivedi, Rakesh Kumar","doi":"10.4018/ijdst.2020070102","DOIUrl":"https://doi.org/10.4018/ijdst.2020070102","url":null,"abstract":"Wireless sensor networks find several applications in hard-to-reach areas. As sensors have limited battery power, many energy aware protocols based on negotiation, clustering, and agents have been developed to increase lifetime of the network. This article finds limitation with some multi-agent-based protocols as they place the sink node at the centre of the monitoring region which is quite difficult in hard-to-reach areas. Therefore, a multi-agent-based energy and fault-aware protocol for hard-to-reach territories (MAHT) is proposed which uses technique of impact factor to identify the high power capability of the central node and dynamic itinerary planning to make the protocol fault tolerant. Its agent migration technique results in improvement ofn energy efficiency, task completion time and network lifetime. MAHT is simulated using Castalia simulator and the impact of payload size, network size, node failures, etc., on various performance metrics is analysed. The proposed protocol found outperforming over the existing ones.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"24 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":"124556928","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
Improved Compact Routing Schemes for Random Interconnects 改进的随机互连的紧凑路由方案
Int. J. Distributed Syst. Technol. Pub Date : 2020-07-01 DOI: 10.4018/ijdst.2020070105
Chi-Hieu Nguyen, Chung T. Kieu, Khanh-Van Nguyen
{"title":"Improved Compact Routing Schemes for Random Interconnects","authors":"Chi-Hieu Nguyen, Chung T. Kieu, Khanh-Van Nguyen","doi":"10.4018/ijdst.2020070105","DOIUrl":"https://doi.org/10.4018/ijdst.2020070105","url":null,"abstract":"Random topology has been an increasingly favorable approach for designing interconnection networks,asitcanprovideacombinationoflowlatencyandincrementalnetworkgrowththatcould notbeprovidedbythetraditionalrigidtopologies.However,thecommonshortest-pathroutingina randominterconnectposesascalabilityproblem,foritrequiresglobalnetworkinfotomakerouting decisionsandso,theroutingtablesize(RTS)canbeverylarge.Therefore,thismanuscriptwould aim to revisit the well-known research area of landmark-based compact routing and to improve theuniversalroutingschemesforthespecificcaseofrandominterconnects.Itwouldproposenew landmark-basedcompactroutingschemes,using2heuristictechniquestoselectlandmarksthatare evenlyspaced,whichwouldreducetheRTSinthewell-knownThorupandZwick’sschemebyup to18%andproduceashorteraveragepathlength. KeywoRDS Compact Routing, Data Center Networks, Interconnection Networks, Landmark-Based Routing, Random Interconnect, Random Networks, Routing Algorithm, Routing Table Size","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"10 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":"131621990","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 Osmosis-Based Intelligent Agent Scheduling Framework for Cloud Bursting in a Hybrid Cloud 一种基于渗透的混合云爆发智能代理调度框架
Int. J. Distributed Syst. Technol. Pub Date : 2020-07-01 DOI: 10.4018/ijdst.2020070104
P. Hepsiba, E. G. Kanaga
{"title":"An Osmosis-Based Intelligent Agent Scheduling Framework for Cloud Bursting in a Hybrid Cloud","authors":"P. Hepsiba, E. G. Kanaga","doi":"10.4018/ijdst.2020070104","DOIUrl":"https://doi.org/10.4018/ijdst.2020070104","url":null,"abstract":"An intelligent system to efficiently provision resources in a hybrid cloud environment is necessary due to the high level of complexity. The semi-permeable agent for hybrid cloud scheduling (SPAH) is a bio-inspired agent that adapts the biological process of osmosis into cloud bursting. The primary objective of the agent is to minimize the makespan. The framework and algorithm for the two phases of SPAH, to recognize the state and decide on action are presented. A QoS (Quality of Service) deadline factor metric is proposed to study the indirect impact of SPAH in deadline satisfaction. SPAH shows significant improvement in deadline satisfaction of up to 85% as compared to other cloud bursting techniques. This is the result of a reduced makespan and a reduced cumulative waiting time. The analysis of SPAH shows that it works in quadratic time complexity.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"36 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":"115663228","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
Using Wireless Multimedia Sensor Networks to Enhance Early Forest Fire Detection 利用无线多媒体传感器网络增强森林火灾早期探测
Int. J. Distributed Syst. Technol. Pub Date : 2020-07-01 DOI: 10.4018/ijdst.2020070101
Houache Noureddine, Kechar Bouabdellah
{"title":"Using Wireless Multimedia Sensor Networks to Enhance Early Forest Fire Detection","authors":"Houache Noureddine, Kechar Bouabdellah","doi":"10.4018/ijdst.2020070101","DOIUrl":"https://doi.org/10.4018/ijdst.2020070101","url":null,"abstract":"In the present paper, the authors present the design, the development and field experiment of a forest fire detection system based on Wireless Multimedia Sensor Networks (WMSN) technology using a real test-bed. This system is an extension of their previous work presented in (Bouabdellah, Noureddine, & Larbi, 2013). The latter is based on mono modal approach (only scalar sensors were considered for data sensing), by adopting a new multimodal and cooperative approach in which it added the acquisition of much richer information using the image sensor in order to minimize false alarms that represents the main weakness for the old system. The validation of the proposal was performed by comparing two detection techniques (Canadian and Korean) in terms of time constraint and energy consumption. The results of the practical assessment confirmed the importance of the multimodal approach and also revealed the supremacy of the Canadian method and its compliance to the climate of Algeria's region.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"40 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":"129420739","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
首页 上一页 下一页 尾页
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学术官方微信