Distributed Computing最新文献_第10页

Model Optimasi Produksi Air Bersih PDAM Kabupaten Bolaang Mongondow Timur Menggunakan Metode Preemptive Goal Programming 采用先发制人目标规划方法的PDAM清洁水生产优化模型Eastern Mongondow Bold Capsules

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2021-01-03 DOI: 10.35799/DC.9.2.2020.29187

Lita Silpianingsih Kawulusan, Altien J. Rindengan, Y. Langi

{"title":"Model Optimasi Produksi Air Bersih PDAM Kabupaten Bolaang Mongondow Timur Menggunakan Metode Preemptive Goal Programming","authors":"Lita Silpianingsih Kawulusan, Altien J. Rindengan, Y. Langi","doi":"10.35799/DC.9.2.2020.29187","DOIUrl":"https://doi.org/10.35799/DC.9.2.2020.29187","url":null,"abstract":"Air merupakan salah satu kebutuhan pokok makhluk hidup. Seiring dengan bertambahnya jumlah penduduk maka kebutuhan akan air bersih juga semakin bertambah, oleh sebab itu pemerintah mengelola sebuah perusahaan yaitu Perusahaan Daerah Air Minum (PDAM). Tujuan dari penelitian ini yaitu untuk menentukan hasil optimasi produksi air bersih dengan menggunakan metode preemptive goal programming pada PDAM Kabupaten Bolaang Mongondow Timur. Dengan menggunakan metode ini diperoleh jumlah produksi air bersih unit Modayag yaitu sebesar 16824,07 dan unit Kotabunan sebesar 7624,92 dengan jumlah pendapatan yang diperoleh unit Modayag sebesar Rp.120.291.468 dan unit Kotabunan sebesar Rp.55.192.006. Selain itu, tujuan memproduksi air bersih yang tidak melebihi kapasitas produksi dapat tercapai dimana unit Modayag tersisa sebesar 12983,93 dan unit kotabunan tersisa 5335,08 dari kapasitas produksi yang ditetapkan. Adapun fungsi tujuan memenuhi tingkat permintaan air bersih berdasarkan jenis pelanggan dapat terpenuhi dan tujuan untuk memproduksi air bersih yang melebihi produksi minimal air bersih terdapat satu variabel keputusan yaitu variabel keputusan jumlah produksi air bersih jenis pelanggan rumah sakit pemerintah unit Modayag yang memiliki nilai solusi optimal kurang dari produksi minimal air bersih, selain itu nilai variabel keputusan lainnya telah melebihi produksi minimal air bersih yang telah ditetapkan. ","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"120"},"PeriodicalIF":1.3,"publicationDate":"2021-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45353934","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

Pengelompokan Sekolah Menegah Atas (SMA) di Kabupaten Minahasa Tenggara Berdasarkan Stadar Kompetensi Lulusan Tahun 2018 Menggunakan Analisis Gerombol 根据2018年毕业生能力阶段的作战分析，南米纳哈萨内阁的高中组（高中）

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2021-01-02 DOI: 10.35799/DC.9.2.2020.28755

Agnes Mariana Veronica Sandag, Charles E. Mongi, Mans Mananohas

引用次数: 0

The complexity of verifying population protocols. 验证人口协议的复杂性。

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2021-01-01 Epub Date: 2021-03-24 DOI: 10.1007/s00446-021-00390-x

Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy

{"title":"The complexity of verifying population protocols.","authors":"Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy","doi":"10.1007/s00446-021-00390-x","DOIUrl":"10.1007/s00446-021-00390-x","url":null,"abstract":"Population protocols (Angluin et al. in PODC, 2004) are a model of distributed computation in which indistinguishable, finite-state agents interact in pairs to decide if their initial configuration, i.e., the initial number of agents in each state, satisfies a given property. In a seminal paper Angluin et al. classified population protocols according to their communication mechanism, and conducted an exhaustive study of the expressive power of each class, that is, of the properties they can decide (Angluin et al. in Distrib Comput 20(4):279-304, 2007). In this paper we study the correctness problem for population protocols, i.e., whether a given protocol decides a given property. A previous paper (Esparza et al. in Acta Inform 54(2):191-215, 2017) has shown that the problem is decidable for the main population protocol model, but at least as hard as the reachability problem for Petri nets, which has recently been proved to have non-elementary complexity. Motivated by this result, we study the computational complexity of the correctness problem for all other classes introduced by Angluin et al., some of which are less powerful than the main model. Our main results show that for the class of observation models the complexity of the problem is much lower, ranging from <math><msubsup><mi>Π</mi> <mn>2</mn> <mi>p</mi></msubsup> </math> to PSPACE.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"34 2","pages":"133-177"},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550233/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39831164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Improved distributed Δ -coloring. 改进的分布式Δ -着色。

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2021-01-01 Epub Date: 2021-07-09 DOI: 10.1007/s00446-021-00397-4

Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus

{"title":"<ArticleTitle xmlns:ns0=\"http://www.w3.org/1998/Math/MathML\">Improved distributed <ns0:math><ns0:mi>Δ</ns0:mi></ns0:math> -coloring.","authors":"Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus","doi":"10.1007/s00446-021-00397-4","DOIUrl":"https://doi.org/10.1007/s00446-021-00397-4","url":null,"abstract":"We present a randomized distributed algorithm that computes a <math><mi>Δ</mi></math> -coloring in any non-complete graph with maximum degree <math><mrow><mi>Δ</mi> <mo>≥</mo> <mn>4</mn></mrow> </math> in <math><mrow><mi>O</mi> <mrow><mo>(</mo> <mo>log</mo> <mi>Δ</mi> <mo>)</mo></mrow> <mo>+</mo> <msup><mn>2</mn> <mrow><mi>O</mi> <mo>(</mo> <msqrt><mrow><mo>log</mo> <mo>log</mo> <mi>n</mi></mrow> </msqrt> <mo>)</mo></mrow> </msup> </mrow> </math> rounds, as well as a randomized algorithm that computes a <math><mi>Δ</mi></math> -coloring in <math><mrow><mi>O</mi> <mo>(</mo> <msup><mrow><mo>(</mo> <mo>log</mo> <mo>log</mo> <mi>n</mi> <mo>)</mo></mrow> <mn>2</mn></msup> <mo>)</mo></mrow> </math> rounds when <math><mrow><mi>Δ</mi> <mo>∈</mo> <mo>[</mo> <mn>3</mn> <mo>,</mo> <mi>O</mi> <mo>(</mo> <mn>1</mn> <mo>)</mo> <mo>]</mo></mrow> </math> . Both these algorithms improve on an <math><mrow><mi>O</mi> <mo>(</mo> <msup><mo>log</mo> <mn>3</mn></msup> <mi>n</mi> <mo>/</mo> <mo>log</mo> <mi>Δ</mi> <mo>)</mo></mrow> </math> -round algorithm of Panconesi and Srinivasan (STOC'93), which has remained the state of the art for the past 25 years. Moreover, the latter algorithm gets (exponentially) closer to an <math><mrow><mi>Ω</mi> <mo>(</mo> <mo>log</mo> <mo>log</mo> <mi>n</mi> <mo>)</mo></mrow> </math> round lower bound of Brandt et al. (STOC'16).","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"34 4","pages":"239-258"},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00446-021-00397-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39845205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 13

Redundancy in distributed proofs. 分布式证明中的冗余。

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2021-01-01 Epub Date: 2020-10-07 DOI: 10.1007/s00446-020-00386-z

Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry

引用次数: 22

Time-space trade-offs in population protocols for the majority problem. 多数问题人口协议中的时空权衡。

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2021-01-01 Epub Date: 2020-08-05 DOI: 10.1007/s00446-020-00385-0

Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik

{"title":"Time-space trade-offs in population protocols for the majority problem.","authors":"Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik","doi":"10.1007/s00446-020-00385-0","DOIUrl":"https://doi.org/10.1007/s00446-020-00385-0","url":null,"abstract":"Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of n identical agents (finite state machines) performs a global task like electing a unique leader or determining the majority opinion when each agent has one of two opinions. Agents communicate in pairwise interactions with randomly assigned communication partners. Quality is measured in two ways: the number of interactions to complete the task and the number of states per agent. We present protocols for the majority problem that allow for a trade-off between these two measures. Compared to the only other trade-off result (Alistarh et al. in Proceedings of the 2015 ACM symposium on principles of distributed computing, Donostia-San Sebastián, 2015), we improve the number of interactions by almost a linear factor. Furthermore, our protocols can be made uniform (working correctly without any information on the population size n), yielding the first uniform majority protocols that stabilize in a subquadratic number of interactions.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"34 2","pages":"91-111"},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00446-020-00385-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39831162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 26

Pendekatan Generalized Linear Model Pada Regresi Kuantil Copula Normal Untuk Keterhubungan IHSG dan Kurs EUR-IDR IHSG连接和EUR-IDR过程正态Copula数量回归的广义线性模型方法

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2020-12-31 DOI: 10.35799/DC.9.2.2020.28263

Laurentia Nindya Sari Prameswara, B. Susanto, Leopoldus Ricky Sasongko

引用次数: 0

Criminal Liability for the Use of Substances and (or) Methods Prohibited in Sports in Respect of a Sportsman 运动员使用体育运动中禁用的物质和(或)方法的刑事责任

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2020-12-24 DOI: 10.18572/2072-4160-2020-4-11-15

M. K. Geldibaev

引用次数: 1

A Criminological Analysis of the Correlation Between the Dynamics of the Afghan Opium Expansion and the Heroin Abuse Situation in Russia 阿富汗鸦片扩张动态与俄罗斯海洛因滥用形势相关性的犯罪学分析

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2020-12-24 DOI: 10.18572/2072-4160-2020-4-27-31

P. Teplyashin

{"title":"A Criminological Analysis of the Correlation Between the Dynamics of the Afghan Opium Expansion and the Heroin Abuse Situation in Russia","authors":"P. Teplyashin","doi":"10.18572/2072-4160-2020-4-27-31","DOIUrl":"https://doi.org/10.18572/2072-4160-2020-4-27-31","url":null,"abstract":"The purpose of the work is to establish criminologically significant information about the relationship between the dynamics of opium expansion of Afghan origin and the heroin drug situation in Russia. The methodological basis is the method of SWOT analysis and four-element strategic PEST analysis (Policy — policy, Economy — economy, Society — society, Technology — technology), implemented to identify and study the political, economic, socio-cultural and technological aspects of the development of the object under study. Consideration of the correlation relationship led to the conclusion that active international, cross-border and interagency cooperation reduces the “heroin pressure” on the Russian Federation along the «northern route» of drug trafficking. This interaction serves as a point-by-point combination of political efforts to normalize the opium drug situation in the Central Asian region. In turn, the growing popularity of synthetic drugs reduces the demand for plant-based opium drugs. The consequences of the transformation of drug trafficking routing are noted. It was found that the increased risks of detaining drug traffickers and the overall unprofitability of the contact method of distributing heroin led to the widespread use of international mail channels, mobile communications and electronic communications. The practical significance of structuring the correlation under consideration through four aspects makes it possible to better understand the strengths and weaknesses of the domestic mechanism for combating illicit trafficking in opium drugs.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"4 1","pages":"27-31"},"PeriodicalIF":1.3,"publicationDate":"2020-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48544273","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

Bass, Mids, Tops: An Oral History of Sound System Culture (Joe Muggs & Brian David Stevens) 低音、中音、高音：音响系统文化口述史（Joe Muggs&Brian David Stevens）

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2020-11-16 DOI: 10.12801/1947-5403.2020.12.01.12

Edward K. Spencer

引用次数: 1