Distributed Computing最新文献

筛选
英文 中文
Improved weighted additive spanners 改进的加权附加扳手
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-08-22 DOI: 10.1007/s00446-022-00433-x
Michael Elkin, Yuval Gitlitz, Ofer Neiman
{"title":"Improved weighted additive spanners","authors":"Michael Elkin, Yuval Gitlitz, Ofer Neiman","doi":"10.1007/s00446-022-00433-x","DOIUrl":"https://doi.org/10.1007/s00446-022-00433-x","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"36 1","pages":"385 - 394"},"PeriodicalIF":1.3,"publicationDate":"2020-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47486554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
The splay-list: a distribution-adaptive concurrent skip-list 显示列表:一个自适应分布的并发跳表
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-08-03 DOI: 10.1007/s00446-022-00441-x
V. Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
{"title":"The splay-list: a distribution-adaptive concurrent skip-list","authors":"V. Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami","doi":"10.1007/s00446-022-00441-x","DOIUrl":"https://doi.org/10.1007/s00446-022-00441-x","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"1 1","pages":"1-24"},"PeriodicalIF":1.3,"publicationDate":"2020-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47506684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Single-source shortest paths in the CONGEST model with improved bounds 具有改进边界的CONGEST模型中的单源最短路径
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-07-31 DOI: 10.1007/s00446-021-00412-8
S. Chechik, Doron Mukhtar
{"title":"Single-source shortest paths in the CONGEST model with improved bounds","authors":"S. Chechik, Doron Mukhtar","doi":"10.1007/s00446-021-00412-8","DOIUrl":"https://doi.org/10.1007/s00446-021-00412-8","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"35 1","pages":"357 - 374"},"PeriodicalIF":1.3,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46907520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Phase transition of the k-majority dynamics in biased communication models 有偏通信模型中k多数动力学的相变
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-07-30 DOI: 10.1007/s00446-023-00444-2
Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo
{"title":"Phase transition of the k-majority dynamics in biased communication models","authors":"Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo","doi":"10.1007/s00446-023-00444-2","DOIUrl":"https://doi.org/10.1007/s00446-023-00444-2","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"36 1","pages":"107-135"},"PeriodicalIF":1.3,"publicationDate":"2020-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42069155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Low-Congestion shortcuts without embedding 无嵌入的低拥塞快捷方式
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-07-24 DOI: 10.1007/s00446-020-00383-2
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
{"title":"Low-Congestion shortcuts without embedding","authors":"Bernhard Haeupler, Taisuke Izumi, Goran Zuzic","doi":"10.1007/s00446-020-00383-2","DOIUrl":"https://doi.org/10.1007/s00446-020-00383-2","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"34 1","pages":"79 - 90"},"PeriodicalIF":1.3,"publicationDate":"2020-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00446-020-00383-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43478755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 37
Revisiting asynchronous fault tolerant computation with optimal resilience 重新审视具有最优弹性的异步容错计算
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-06-30 DOI: 10.1145/3382734.3405722
Ittai Abraham, D. Dolev, Gilad Stern
{"title":"Revisiting asynchronous fault tolerant computation with optimal resilience","authors":"Ittai Abraham, D. Dolev, Gilad Stern","doi":"10.1145/3382734.3405722","DOIUrl":"https://doi.org/10.1145/3382734.3405722","url":null,"abstract":"The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminating. In 1994, Ben-Or, Kelmer and Rabin published a proof-sketch of a lesser known lower bound for asynchronous fault tolerant computation with optimal resilience in face of a Byzantine adversary: if n≤4tdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$nle 4t$$end{document} then any t-resilient asynchronous verifiable secret sharing protocol must have some non-zero probability of not terminating. Our main contribution is to revisit this lower bound and provide a rigorous and more general proof. Our second contribution is to show how to avoid this lower bound. We provide a protocol with optimal resilience that is almost surely terminating for a strong common coin functionality. Using this new primitive we provide an almost surely terminating protocol with optimal resilience for asynchronous Byzantine agreement that has a new fair validity property. To the best of our knowledge this is the first asynchronous Byzantine agreement with fair validity in the information theoretic setting.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"35 1","pages":"333 - 355"},"PeriodicalIF":1.3,"publicationDate":"2020-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3382734.3405722","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47201427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
APPLICATION OF BLOCKCHAIN BASED WAQF CROWDFUNDING IN FISHERMEN GROUP: CASE STUDY OF NAMBANGAN AND CUMPAT, SURABAYA 基于区块链的WAQF众筹在渔民群体中的应用&以南班甘和苏拉巴亚坎帕特为例
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-06-28 DOI: 10.20473/dc.v2.i1.2020.26-29
R. Sukmana, R. H. Setianto, G. Premananto, S. Ajija
{"title":"APPLICATION OF BLOCKCHAIN BASED WAQF CROWDFUNDING IN FISHERMEN GROUP: CASE STUDY OF NAMBANGAN AND CUMPAT, SURABAYA","authors":"R. Sukmana, R. H. Setianto, G. Premananto, S. Ajija","doi":"10.20473/dc.v2.i1.2020.26-29","DOIUrl":"https://doi.org/10.20473/dc.v2.i1.2020.26-29","url":null,"abstract":"Background: The image of fishermen so far is a group of people classified as poor. One effort to reduce poverty is to revive the microenterprise economy through cooperatives and utilize waqf funds as an alternative source of financing for microbusinesses. The Mining and Cumpat Fishermen Group of Kenjeran District in Surabaya City has now received capital injections from productive endowments in their cooperatives. However, another problem arises from productive waqf there, the waqf that is collected is not as much as what is needed by the person. Purpose: This service program is expected to produce an outcome that is a blockchain based application that can facilitate endowments and willingness. Thus it is expected to help increase the capital of the Fishermen and Cumpat Fishermen Group, Kenjeran District, Surabaya City. Method: This service program used a participatory method whereby the companion was also involved in the application business process. In addition, the companion also asked for active participation from the mauquf alaih to provide detailed information about his business. Thus, the facilitators could promote to the prospective waqf to channel the endowment funds. Results: This assistance program produced a waqf application with blockchain technology that can be accessed on waqf.network. Conclusion: This program was considered effective in growing trust in the distribution of waqf funds. In addition, maukuf alaih also makes it easier to get investors in developing their businesses.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"2 1","pages":"26-29"},"PeriodicalIF":1.3,"publicationDate":"2020-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48022637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
PROMOTION MIX TRAINING AS A PREPARATION OF BAMBOO HANDICRAFT EDUCATIONAL TOUR LAUNCHING FOR UMKM AT SUMBERREJO DISTRICT, BOJONEGORO, EAST JAVA 推广混合培训作为竹工艺品教育之旅的准备,在东爪哇博琼戈罗的SUMBERREJO区为UMKM启动
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-06-28 DOI: 10.20473/dc.v2.i1.2020.30-37
Maurisia Putri Permatasari, Annysa Endriastuti
{"title":"PROMOTION MIX TRAINING AS A PREPARATION OF BAMBOO HANDICRAFT EDUCATIONAL TOUR LAUNCHING FOR UMKM AT SUMBERREJO DISTRICT, BOJONEGORO, EAST JAVA","authors":"Maurisia Putri Permatasari, Annysa Endriastuti","doi":"10.20473/dc.v2.i1.2020.30-37","DOIUrl":"https://doi.org/10.20473/dc.v2.i1.2020.30-37","url":null,"abstract":"Background: This community service is a follow up of community service in Kecamatan Sumberrejo in 2017 and is expected to be the first step to preparing the launching of the bamboo tourism village in Kecamatan Sumberrejo. Purpose: This community service aims to provide solutions for problems faced by partners, preparation for launching and planning the right promotional mix to attract consumers’ interest in the newly formed educational tourism in Kecamatan Sumberrejo. Method: Assistance by the team to partners through counseling, training, and practical assistance. In addition, worksheets have been provided to monitor partner activities and measure the effectiveness of the training. Result: The pre-test and post-test results illustrate an increase in partner knowledge regarding the promotion mix. Conclusion: The material delivered by the team was able to be well understood by partners and partners’ knowledge and interest in marketing through the promotion mix increased.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"2 1","pages":"30-37"},"PeriodicalIF":1.3,"publicationDate":"2020-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43651993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
TRAINING OF MAKING FEED SUPPLEMENT OF UMB HERBAL IN PARENGAN, TUBAN REGENCY 在我县、自治区等地开展中药饲料添加剂制作培训
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-06-28 DOI: 10.20473/dc.v2.i1.2020.15-19
Siti Eliana Rochmi, Herinda Pertiwi, Agung Budianto Achmad, R. S. Wahjuni, T. W. Suprayogi, T. B. Dadi
{"title":"TRAINING OF MAKING FEED SUPPLEMENT OF UMB HERBAL IN PARENGAN, TUBAN REGENCY","authors":"Siti Eliana Rochmi, Herinda Pertiwi, Agung Budianto Achmad, R. S. Wahjuni, T. W. Suprayogi, T. B. Dadi","doi":"10.20473/dc.v2.i1.2020.15-19","DOIUrl":"https://doi.org/10.20473/dc.v2.i1.2020.15-19","url":null,"abstract":"Background: Subdistrict Parengan has high livestock potential especially Suciharjo Village and Margorejo Village. The existing agricultural waste is not treated properly and livestock cannot reach maximum weights. The provision of quality animal feed is one of the efforts to improve the welfare of the community. Quality of animal feed can be increasing cattle productivity so that the selling value will increase. Purpose: This Community Service activity aims to improve the economic strengthening of the community through breeders through the introduction, dissemination, through technology UMB Herbal based on local resources that can increase the weight gain of beef cattle. UMB Herbal is a concentrate feed that uses raw materials based on raw materials (agriculture) with curcuma which is widely available in the regions. Improving skills makes UMB Herbal can be a provision for the community to be able to increase income. Methods: The method used in community service is the counseling for animal feed and health, training to make UMB Herbal and focus group discussions then applicating of UMB Herbal to pilot cattle. Results: The results of this community service include an increase in beef cattle body weight,  decreasing the gastrointestinal worm infestations, and increasing the knowledge and skills of the participants of the community service. Conclusion: Community Service Activities have a positive impact related to the development of beef cattle farms.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"2 1","pages":"15-19"},"PeriodicalIF":1.3,"publicationDate":"2020-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47955764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
GEMA CERMAT (GERAKAN MASYARAKAT CERDAS MENGGUNAKAN OBAT) FOR STUDENT IN THE CITY OF KENDARI SOUTHEAST SULAWESI 苏拉威西岛东南部肯达里市学生用GEMA金属陶瓷
IF 1.3 4区 计算机科学
Distributed Computing Pub Date : 2020-06-28 DOI: 10.20473/dc.v2.i1.2020.4-8
S. Suryani, L. Fitrawan, Waode Sukmawati Arsyad, Rina Andriani, Rini Hamsidi
{"title":"GEMA CERMAT (GERAKAN MASYARAKAT CERDAS MENGGUNAKAN OBAT) FOR STUDENT IN THE CITY OF KENDARI SOUTHEAST SULAWESI","authors":"S. Suryani, L. Fitrawan, Waode Sukmawati Arsyad, Rina Andriani, Rini Hamsidi","doi":"10.20473/dc.v2.i1.2020.4-8","DOIUrl":"https://doi.org/10.20473/dc.v2.i1.2020.4-8","url":null,"abstract":"Background: The problem of rational use of drugs in the community, especially among students, still not many know or still lack of knowledge. The careful echo is a joint effort of the government and the community through a series of activities in realizing the awareness, awareness, understanding and community skills in using drugs appropriately and correctly. Purpose: This activity aims as an effort to improve understanding, knowledge and awareness of the community, especially students about the use of appropriate and correct medicines by providing training in the skills to choose and use drugs properly for self-medication so that drug abuse does not occur as a manifestation of the Program of Echoing Careful. Method: The method to be used in increasing knowledge was the Active Learning method (CBIA). This method was an educational model of community empowerment to be more skilled in choosing drugs so that self-medication becomes more effective, safe, and cost-effective. Results: The result of this program was an increase in student understanding of the types of drugs, forms of drug preparation, and independence in choosing, obtaining, using, storing, and destroying / disposing of drugs correctly and appropriately. Conclusion: The Schematic Echoes Program (GeMa CerMat) increased student knowledge about rational use of drugs and self-medication (Swamedikasi) through how to properly manage drugs, use and choose drugs correctly, and or how to see their efficacy and side effects.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"2 1","pages":"4-8"},"PeriodicalIF":1.3,"publicationDate":"2020-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41764166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术文献互助群
群 号:604180095
Book学术官方微信