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

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

筛选
英文 中文
Improving the Performance of kNN in the MapReduce Framework Using Locality Sensitive Hashing 利用位置敏感哈希提高MapReduce框架中kNN的性能
Int. J. Distributed Syst. Technol. Pub Date : 2019-10-01 DOI: 10.4018/ijdst.2019100101
S. Bagui, A. Mondal, S. Bagui
{"title":"Improving the Performance of kNN in the MapReduce Framework Using Locality Sensitive Hashing","authors":"S. Bagui, A. Mondal, S. Bagui","doi":"10.4018/ijdst.2019100101","DOIUrl":"https://doi.org/10.4018/ijdst.2019100101","url":null,"abstract":"In this work the authors present a parallel k nearest neighbor (kNN) algorithm using locality sensitive hashing to preprocess the data before it is classified using kNN in Hadoop's MapReduce framework. This is compared with the sequential (conventional) implementation. Using locality sensitive hashing's similarity measure with kNN, the iterative procedure to classify a data object is performed within a hash bucket rather than the whole data set, greatly reducing the computation time needed for classification. Several experiments were run that showed that the parallel implementation performed better than the sequential implementation on very large datasets. The study also experimented with a few map and reduce side optimization features for the parallel implementation and presented some optimum map and reduce side parameters. Among the map side parameters, the block size and input split size were varied, and among the reduce side parameters, the number of planes were varied, and their effects were studied.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"142 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":"129893023","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
Big Data Analytics in Healthcare: Case Study - Miscarriage Prediction 医疗保健中的大数据分析：案例研究：流产预测
Int. J. Distributed Syst. Technol. Pub Date : 2019-10-01 DOI: 10.4018/ijdst.2019100104
Hiba Asri, H. Mousannif, H. A. Moatassime
{"title":"Big Data Analytics in Healthcare: Case Study - Miscarriage Prediction","authors":"Hiba Asri, H. Mousannif, H. A. Moatassime","doi":"10.4018/ijdst.2019100104","DOIUrl":"https://doi.org/10.4018/ijdst.2019100104","url":null,"abstract":"Sensors and mobile phones shine in the Big Data area due to their capabilities to retrieve a huge amount of real-time data; which was not possible previously. In the specific field of healthcare, we can now collect data related to human behavior and lifestyle for better understanding. This pushed us to benefit from such technologies for early miscarriage prediction. This research study proposes to combine the use of Big Data analytics and data mining models applied to smartphones real-time generated data. A K-means data mining algorithm is used for clustering the dataset and results are transmitted to pregnant woman to make quick decisions; with the intervention of her doctor; through an android mobile application that we created. As well, she receives recommendations based on her behavior. We used real-world data to validate the system and assess its performance and effectiveness. Experiments were made using the Big Data Platform Databricks.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"83 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":"126227679","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}
引用次数: 6
Best Feature Selection for Horizontally Distributed Private Biomedical Data Based on Genetic Algorithms 基于遗传算法的水平分布私有生物医学数据最佳特征选择
Int. J. Distributed Syst. Technol. Pub Date : 2019-07-01 DOI: 10.4018/IJDST.2019070103
Boudheb Tarik, Z. Elberrichi
{"title":"Best Feature Selection for Horizontally Distributed Private Biomedical Data Based on Genetic Algorithms","authors":"Boudheb Tarik, Z. Elberrichi","doi":"10.4018/IJDST.2019070103","DOIUrl":"https://doi.org/10.4018/IJDST.2019070103","url":null,"abstract":"Due to the growing success of machine learning in the healthcare domain, medical institutions are striving to share their patients' data in the intention to build more accurate models which will be used to make better decisions. However, due to the privacy of the data, they are reluctant. To build the best models, they have to make the best feature selection for horizontally distributed private biomedical data. The previous proposed solutions are based on data perturbation techniques with the loss of performance. In this article, the researchers propose an original solution without perturbation. This is so the data utility is preserved and therefore the performance. The proposed solution uses a genetic algorithm, a distributed Naïve Bayes classifier, and a trusted third-party. The results obtained by the proposed approach surpass those obtained by other researchers, for the same problem.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130426769","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
User Interface Distribution Method Based on Pi-Calculus 基于pi -微积分的用户界面分布方法
Int. J. Distributed Syst. Technol. Pub Date : 2019-07-01 DOI: 10.4018/IJDST.2019070101
S. Sakulin, Alexander Alfimtsev, E. Tipsin, V. Devyatkov, Dmitry Sokolov
{"title":"User Interface Distribution Method Based on Pi-Calculus","authors":"S. Sakulin, Alexander Alfimtsev, E. Tipsin, V. Devyatkov, Dmitry Sokolov","doi":"10.4018/IJDST.2019070101","DOIUrl":"https://doi.org/10.4018/IJDST.2019070101","url":null,"abstract":"The rapid growth of computing devices has led to the emergence of distributed user interfaces. A user interface is called distributed if a user can interact with it using several devices at the same time. Formal methods for designing such interfaces, in particular methods for the distribution of interface elements across multiple devices, are yet to be developed. This is the reason why every time a new application requires a distributed user interface, the latter has to be designed from scratch, rendering the entire venture economically inefficient. In order to minimize costs, unify and automate the development of distributed interfaces, we need to formulate general formal methods for designing distributed interfaces that will be independent from a particular application or device. This article paper proposes a formal distribution method based on the pi-calculus.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130791417","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 Energy-Efficient and Fault-Tolerant Evolution Model for Large-Scale Wireless Sensor Networks Based on Complex Network Theory 基于复杂网络理论的大规模无线传感器网络节能容错进化新模型
Int. J. Distributed Syst. Technol. Pub Date : 2019-07-01 DOI: 10.4018/IJDST.2019070102
Xiaobo Tan, Ji Tang, Liting Yu, Jialu Wang
{"title":"A New Energy-Efficient and Fault-Tolerant Evolution Model for Large-Scale Wireless Sensor Networks Based on Complex Network Theory","authors":"Xiaobo Tan, Ji Tang, Liting Yu, Jialu Wang","doi":"10.4018/IJDST.2019070102","DOIUrl":"https://doi.org/10.4018/IJDST.2019070102","url":null,"abstract":"In this article, the authors present a new novel energy-efficient and fault-tolerant evolution model for large-scale wireless sensor networks based on complex network theory. In the evolution model, not only is the residual energy of each node considered, but also the constraint of links is introduced, which makes the energy consumption of the whole network more balanced. Furthermore, both preferential attachment and random attachment to the evolution model are introduced, which reduces the proportion of the nodes with high degree while keeping scale-free network characteristics to some extent. Theoretical analysis shows that the new model is an extension of the BA model, which is a mixed model between a BA model and a stochastic model. Simulation results show that EFEM has better stochastic network characteristics while keeping scale-free network characteristics if the value of random probability is near 0.2 and it can help to construct a high survivability network for large-scale WSNs.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116512995","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 Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems 基于检查点和冗余的分布式实时系统容错调度算法
Int. J. Distributed Syst. Technol. Pub Date : 2019-07-01 DOI: 10.4018/IJDST.2019070104
Barkahoum Kada, Hamoudi Kalla
{"title":"A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems","authors":"Barkahoum Kada, Hamoudi Kalla","doi":"10.4018/IJDST.2019070104","DOIUrl":"https://doi.org/10.4018/IJDST.2019070104","url":null,"abstract":"Real-time systems are becoming ever more widely used in life-critical applications, and the need for fault-tolerant scheduling can only grow in the years ahead. This article presents a novel fault tolerance approach for tolerating transient faults in hard real-time systems. The proposed approach combines both checkpointing with rollback and active replication to tolerate several transient faults. Based on this approach, a new static fault-tolerant scheduling algorithm SFTS is presented. It is based on a list of scheduling heuristics which satisfy the application time constraints even in the presence of faults by exploring the spare capacity of available processors in the architecture. Simulation results show the performance and effectiveness of the proposed approach compared to other fault-tolerant approaches. The results reveal that in the presence of multiple transient faults, the average timing overhead of this approach is lower than checkpointing technique. Moreover, the proposed algorithm SFTS achieves better feasibility rate in the presence of multiple transient faults.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121052113","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
Network Coding and Hierarchical Modulation for Energy Efficient Cooperative WBAN 高效协同WBAN的网络编码与分层调制
Int. J. Distributed Syst. Technol. Pub Date : 2019-07-01 DOI: 10.4018/IJDST.2019070106
M. Waheed, Sadaf Talha, R. Ahmad, A. K. Kiani, M. Alam, Waqas Ahmed
{"title":"Network Coding and Hierarchical Modulation for Energy Efficient Cooperative WBAN","authors":"M. Waheed, Sadaf Talha, R. Ahmad, A. K. Kiani, M. Alam, Waqas Ahmed","doi":"10.4018/IJDST.2019070106","DOIUrl":"https://doi.org/10.4018/IJDST.2019070106","url":null,"abstract":"Wireless body area networks (WBANs) have revolutionized healthcare by enabling remote supervision, prior detection, and disease interception using invasive and wearable sensor devices. The limited battery capacity of the sensors coupled with the poor channel condition (that may arise from body postures) require cooperative transmission strategies that can prolong the sensors' life time and associated functionalities. Therefore, in this article, a cooperative scheme based on single-stage relaying is presented for spectrum and energy efficiency. The relay operating for two different scenarios, i.e. network coding and hierarchical modulation, is discussed. The general trend for bit error rate (BER) is observed by modeling a Rayleigh faded link catering path loss. The results are further studied for actual channel models, defined in WBAN standard. The effect of hop-length variation on BER and packet error rate (PER) are discussed. Simulation results show that both cooperative schemes outperform direct communication. A hybrid switching scheme is proposed to enhance efficiency.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129225259","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
Innovative Outlier Removal Techniques to Enhance Signature Authentication Accuracy for Smart Society 创新的离群值去除技术提高智能社会签名认证的准确性
Int. J. Distributed Syst. Technol. Pub Date : 2019-04-01 DOI: 10.4018/IJDST.2019040104
Anindita Desarkar, Shisna Sanyal, A. Baidya, Ajanta Das, C. Chaudhuri
{"title":"Innovative Outlier Removal Techniques to Enhance Signature Authentication Accuracy for Smart Society","authors":"Anindita Desarkar, Shisna Sanyal, A. Baidya, Ajanta Das, C. Chaudhuri","doi":"10.4018/IJDST.2019040104","DOIUrl":"https://doi.org/10.4018/IJDST.2019040104","url":null,"abstract":"A smart society is an empowered society, which can improve the lives of its citizens by using the latest innovations and technologies. This improvement can happen in several dimensions out of which security is a major one. Inconsistency and forgery are very common phenomenon where handwritten signatures are often preserved for training a classifier to authenticate a person. The removal of outliers, at the outset, obviously improves the quality of training and the classifier. The present article deals with the mechanized segregation of the poor-quality authentic signatures from reliable ones. Machine learning algorithms for outlier handling utilizing clustering, classification and statistical techniques have been implemented in this context. Subsequent performance evaluation after outlier removal reflects improvement of both true positive and true negative recognition rate accuracy. The performance evaluation presents the significant differences between authentication accuracy and forgery accuracy in the context of building a safe, secure and smart society.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130917710","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
Individual Client Strategies for Active Control of Information-Driven Service Construction in IoT-enabled Smart Spaces 物联网智能空间信息驱动服务建设主动控制的个体客户端策略
Int. J. Distributed Syst. Technol. Pub Date : 2019-04-01 DOI: 10.4018/IJDST.2019040102
Olga I. Bogoiavlenskaia, A. Vdovenko, D. Korzun, A. Kashevnik
{"title":"Individual Client Strategies for Active Control of Information-Driven Service Construction in IoT-enabled Smart Spaces","authors":"Olga I. Bogoiavlenskaia, A. Vdovenko, D. Korzun, A. Kashevnik","doi":"10.4018/IJDST.2019040102","DOIUrl":"https://doi.org/10.4018/IJDST.2019040102","url":null,"abstract":"Smart spaces provide a platform for cooperative service construction by many devices in the Internet of Things (IoT) environments. When a service is constructed the service needs delivering to appropriate clients, which is typically implemented using the subscription operation (i.e., information-driven service construction). The passive form of subscription is ineffective in the IoT settings since the centralized solution—smart space information broker—needs to control all service construction updates and to notify all interested clients. This article considers the problem of active control for information-driven service construction when each client can use its own (individual) strategy to (additionally) control ongoing updates in the subscribed information. Five strategies for active control are selected for this study. For some simplified assumptions, analytical estimates are provided. For close-to-real evaluation of the strategies a simulation model is developed, based on which several performance metrics are experimentally studied.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117123228","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
Parallel Applications Mapping onto Network on Chip Based on Heterogeneous MPSoCs Using Hybrid Algorithms 基于异构mpsoc的并行应用映射到片上网络的混合算法
Int. J. Distributed Syst. Technol. Pub Date : 2019-04-01 DOI: 10.4018/IJDST.2019040103
Dihia Belkacemi, M. Daoui, S. Bouzefrane, Y. Bouchebaba
{"title":"Parallel Applications Mapping onto Network on Chip Based on Heterogeneous MPSoCs Using Hybrid Algorithms","authors":"Dihia Belkacemi, M. Daoui, S. Bouzefrane, Y. Bouchebaba","doi":"10.4018/IJDST.2019040103","DOIUrl":"https://doi.org/10.4018/IJDST.2019040103","url":null,"abstract":"Mapping parallel applications onto a network on chip (NoC) that is based on heterogeneous MPSoCs is considered as an instance of an NP-hard and a multi-objective problem. Various multi-objective algorithms have been proposed in the literature to handle this issue. Metaheuristics stand out as highly appropriate approaches to deal with this kind of problem. These metaheuristics are classified into two sets: population-based metaheuristics and single solution-based ones. To take advantage of the both sets, the trend is to use hybrid solutions that have shown to give better results. In this article, the authors propose to hybridize these two metaheuristics sets to find good Pareto mapping solutions to optimize the execution time and the energy consumption simultaneously. The experimental results have shown that the proposed hybrid algorithms give high quality non-dominated mapping solutions in a reasonable runtime.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129994520","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学术官方微信