Pub Date : 2021-01-01Epub Date: 2021-07-09DOI: 10.1007/s00446-021-00397-4
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus
We present a randomized distributed algorithm that computes a -coloring in any non-complete graph with maximum degree in rounds, as well as a randomized algorithm that computes a -coloring in rounds when . Both these algorithms improve on an -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 round lower bound of Brandt et al. (STOC'16).
{"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":"<p><p>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).</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"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}
Pub Date : 2021-01-01Epub Date: 2021-03-24DOI: 10.1007/s00446-021-00390-x
Javier Esparza, Stefan Jaax, Mikhail Raskin, Chana Weil-Kennedy
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 to PSPACE.
种群协议(Angluin 等人,PODC, 2004 年)是分布式计算的一种模型,其中不可区分的有限状态代理成对交互,以决定其初始配置(即每个状态中代理的初始数量)是否满足给定属性。在一篇开创性的论文中,Angluin 等人根据群体协议的通信机制对其进行了分类,并对每一类协议的表达能力,即它们能决定的属性进行了详尽的研究(Angluin 等人,载于 Distrib Comput 20(4):279-304, 2007)。在本文中,我们将研究群体协议的正确性问题,即特定协议是否能决定特定属性。之前的一篇论文(Esparza et al. in Acta Inform 54(2):191-215, 2017)表明,对于主要种群协议模型来说,这个问题是可解的,但至少和 Petri 网的可达性问题一样难,而 Petri 网最近被证明具有非基本复杂性。受这一结果的启发,我们研究了安格鲁因等人引入的所有其他类的正确性问题的计算复杂度,其中一些类的计算复杂度比主模型低。我们的主要结果表明,对于观测模型类,问题的复杂度要低得多,从 Π 2 p 到 PSPACE 不等。
{"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":"<p><p>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.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"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}
Pub Date : 2021-01-01Epub Date: 2020-10-07DOI: 10.1007/s00446-020-00386-z
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol.
{"title":"Redundancy in distributed proofs.","authors":"Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry","doi":"10.1007/s00446-020-00386-z","DOIUrl":"https://doi.org/10.1007/s00446-020-00386-z","url":null,"abstract":"<p><p>Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a <i>prover</i> that assigns a <i>certificate</i> to each node, and a distributed algorithm called a <i>verifier</i> that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the <i>size of the certificate</i> stored at every node, and the <i>number of rounds</i> of the verification protocol.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00446-020-00386-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39831163","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}
Pub Date : 2021-01-01Epub Date: 2020-08-05DOI: 10.1007/s00446-020-00385-0
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
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.
{"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":"<p><p>Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of <i>n</i> 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 <i>n</i>), yielding the first uniform majority protocols that stabilize in a subquadratic number of interactions.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"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}
Pub Date : 2020-12-31DOI: 10.35799/DC.9.2.2020.28263
Laurentia Nindya Sari Prameswara, B. Susanto, Leopoldus Ricky Sasongko
Received : 8 April 2020 Received in revised form : 29 August 2020 Available online : 30 December 2020
接收时间:2020年4月8日修订后接收日期:2020年8月29日在线提供时间:2020月30日
{"title":"Pendekatan Generalized Linear Model Pada Regresi Kuantil Copula Normal Untuk Keterhubungan IHSG dan Kurs EUR-IDR","authors":"Laurentia Nindya Sari Prameswara, B. Susanto, Leopoldus Ricky Sasongko","doi":"10.35799/DC.9.2.2020.28263","DOIUrl":"https://doi.org/10.35799/DC.9.2.2020.28263","url":null,"abstract":"Received : 8 April 2020 Received in revised form : 29 August 2020 Available online : 30 December 2020","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49072692","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}
Pub Date : 2020-12-24DOI: 10.18572/2072-4160-2020-4-11-15
M. K. Geldibaev
Purpose: assessment of criminal law and criminological problems of combating crime in the field of sports related to doping. Research method: doctrinal analysis of criminal legislation, conducting surveys of specialists in the field of justice and non-such citizens interested in sports, analysis of survey results. Conclusions: amendments to the criminal legislation providing for liability for acts related to doping is justified and timely. Scientific and practical significance: the significance of surveys for assessing decisions made in the field of criminal liability for acts related to doping is shown; the point of view is substantiated according to which, when doping is used against an athlete by taking pills or powder inside, injection, etc., regardless of his consent, the respective athlete should be recognized as a victim of this illegal act.
{"title":"Criminal Liability for the Use of Substances and (or) Methods Prohibited in Sports in Respect of a Sportsman","authors":"M. K. Geldibaev","doi":"10.18572/2072-4160-2020-4-11-15","DOIUrl":"https://doi.org/10.18572/2072-4160-2020-4-11-15","url":null,"abstract":"Purpose: assessment of criminal law and criminological problems of combating crime in the field of sports related to doping. Research method: doctrinal analysis of criminal legislation, conducting surveys of specialists in the field of justice and non-such citizens interested in sports, analysis of survey results. Conclusions: amendments to the criminal legislation providing for liability for acts related to doping is justified and timely. Scientific and practical significance: the significance of surveys for assessing decisions made in the field of criminal liability for acts related to doping is shown; the point of view is substantiated according to which, when doping is used against an athlete by taking pills or powder inside, injection, etc., regardless of his consent, the respective athlete should be recognized as a victim of this illegal act.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2020-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42664444","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}
Pub Date : 2020-12-24DOI: 10.18572/2072-4160-2020-4-27-31
P. Teplyashin
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.
{"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":null,"pages":null},"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}
Pub Date : 2020-11-16DOI: 10.12801/1947-5403.2020.12.01.02
Chris McGuinness
{"title":"India's Electronic Music Scene Under Lockdown: The First Three Months of the COVID-19 Pandemic","authors":"Chris McGuinness","doi":"10.12801/1947-5403.2020.12.01.02","DOIUrl":"https://doi.org/10.12801/1947-5403.2020.12.01.02","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43876881","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}
Pub Date : 2020-11-16DOI: 10.12801/1947-5403.2020.12.01.12
Edward K. Spencer
{"title":"Bass, Mids, Tops: An Oral History of Sound System Culture (Joe Muggs & Brian David Stevens)","authors":"Edward K. Spencer","doi":"10.12801/1947-5403.2020.12.01.12","DOIUrl":"https://doi.org/10.12801/1947-5403.2020.12.01.12","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46073904","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}
Pub Date : 2020-11-16DOI: 10.12801/1947-5403.2020.12.01.10
P. Chambers
This article explores electronic music making in a context of precarity and climate crisis. I use ethnographic research conducted in the Australian city of Adelaide and the provocative ideas of nineteenth century German philosopher, Max Stirner, to situate the electronic music studio as a contemporary autonomous zone, an interface between creative expression and capitalist existence. I argue that the studio functions as a physical and psychological space to develop what Stirner termed “ownness”, taking possession and realizing one’s own capacity and power. I propose ownness as a theoretical tool for understanding the studio as a site of self-realisation and micropolitical action, investigating how electronic music practice shapes subjectivity, autonomy and resistance. The contemporary studio emerges as a refuge from the anxieties and uncertainties of late-capitalism, a therapeutic outlet and means of becoming, an opportunity to find voice and vocation in the violence of the present.
{"title":"The Studio as Contemporary Autonomous Zone: Crisis and Creativity in Electronic Music","authors":"P. Chambers","doi":"10.12801/1947-5403.2020.12.01.10","DOIUrl":"https://doi.org/10.12801/1947-5403.2020.12.01.10","url":null,"abstract":"This article explores electronic music making in a context of precarity and climate crisis. I use ethnographic research conducted in the Australian city of Adelaide and the provocative ideas of nineteenth century German philosopher, Max Stirner, to situate the electronic music studio as a contemporary autonomous zone, an interface between creative expression and capitalist existence. I argue that the studio functions as a physical and psychological space to develop what Stirner termed “ownness”, taking possession and realizing one’s own capacity and power. I propose ownness as a theoretical tool for understanding the studio as a site of self-realisation and micropolitical action, investigating how electronic music practice shapes subjectivity, autonomy and resistance. The contemporary studio emerges as a refuge from the anxieties and uncertainties of late-capitalism, a therapeutic outlet and means of becoming, an opportunity to find voice and vocation in the violence of the present.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43069140","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}