Collapse Of Hierarchy Research Articles

Interactivity on Participatory Artworks. A Case Study of Long Life Laboratory

Contemporary art is a signifier for the occurance of the melting back aspect of melting back aspects of the arts with other non art disciplinesn in the art world as well as the creative industry. The collapse of hierarchies between high art and low art is the discourse in the West also influenced the development of art in Indonesia. This allows also many works popping up to a hybrid combination between pure art and design as applied art. Nowadays people believe the participatory art can be developed as the styled identity of Indonesia contemporary arts because of the collective spirit of commonly called ‘paguyuban’ it ussualy bring. There is a place called Jatiwangi Art Factory who developed an art movements by running a kind of community based methods to build their village out of economical bankruptcy. A similar approach was elaborated by a couple of Jakarta urban artist namely Irwan Ahmett and Tita Salina. They often work with the society in daily basis to criticize the Jakarta social problems. Departing from the above observation, this paper made to dissect the authos’s works entitled “Long Life Laboratory” which had been exhibited at the Bazaar Art Jakarta 2016 in Pacific Place Mall by measuring the level of interactivity on this kind work of participatory art. A Qualitative method is used also to read this visual form associated with the theory of relational aesthetic, a thinking of a French art critic Nicolas Bourriard

Parameterized Complexity Classes Defined by Threshold Circuits and Their Connection with Sorting Networks

The main complexity classes of the Parameterized Intractability Theory are based on weighted Boolean circuit satisfiability problems and organized into a hierarchy so-called W-hierarchy. The W-hierarchy enables fine-grained complexity analyses of parameterized problems that are unlikely to belong to the FPT class. In this paper, we introduce the Th-hierarchy, a natural generalization of the W-hierarchy defined by unweighted threshold circuit satisfiability problems. Investigating the relationship between Th-hierarchy and W-hierarchy, we discuss the complexity of transforming Threshold circuits into Boolean circuits, and observe that sorting networks are powerful tools to handle such transformations. First, we show that these hierarchies collapse at the last level (W[P][Formula: see text][Formula: see text][Formula: see text]Th[P]). After that, we present a time complexity analysis of an AKS sorting network construction, which supports some of our results. Finally, we prove that Th[[Formula: see text]] [Formula: see text] W[SAT] for every [Formula: see text]. As a by-product, our studies suggest that it is relevant to consider a new class based on logarithmic depth circuits in the W-hierarchy.

The final nail in the coffin of statistically-secure obfuscator

We present an elementary proof of a theorem of Goldwasser and Rothblum [10,11] that the existence of a perfect (or even “slightly” imperfect) statistically-secure obfuscator implies a collapse of the polynomial hierarchy. In fact, our proof gives rise to a more general, quantified version of the theorem exhibiting an (impossible) tradeoff between the correctness and the security of the obfuscator. We also extend the result to a relaxed notion of security.

Сoronavirus Pandemic and Expert Knowledge Crisis: Reload of Miracle, Mystery and Authority

The article analyzes the reasons for the important effect of the COVID-19 pandemic, which has become the catalyst for long-overdue decline in the authority of expert knowledge. The author claims that widespread access to information and scientific data results in the collapse of universal and monopolistic expert-scientific hierarchies of knowledge of a large society, controlled by the state. Scientific experts, who acted as the historical heirs of priests and shamans, have lost their privileged access to sacred knowledge, made public by the media and the Internet. This resulted in severe damage to the key function of expertise – legitimization of the political order and power elites. Experts without the status of agents of the state have become indistinguishable from ordinary citizens. The example of discussions between Waxers and Anti-Waxers shows that both sides are able to put forward convincing scientific arguments that rhetorically do not allow the authorities to bring the discussion about the effectiveness of vaccinations down to a completely unobvious dispute between enlightened state experts and uneducated obscurantists. It is in the most developed Western states where one can see a strong civil dissident movement that distrusts or calls into question the disciplinary regimes of collective coexistence, legitimized by the paternalistic rhetoric of concern from political elites. Accordingly, the elites in the background situation of strengthening the practices of heterarchy, post-truth and postmodernism can no longer rely on the usual metanarratives of the Enlightenment, which allowed them to monopolize the discourse of science in the name of progress and unconditional good, building hierarchies of knowledge-power convenient for their priorities. Since science, knowledge and information have long became public domain, the line between elites, experts and citizens in the field of access to science has become almost indistinguishable. The actual political problem is that the situation of collision of different paradigms, opinions and data is exactly the normal state of science, which is now transferred to the field of public discussions following the final secularization of science. Thus, the institution of expert knowledge turns into an unnecessary link in a situation of equal access of all interested parties to scientific data; to an institution that hardly would efficiently perform the functions of scientific legitimation of socially significant decisions in the foreseeable future.

Expressivity of Planning with Horn Description Logic Ontologies

State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions. Here we address open-world state constraints formalized by planning over a description logic (DL) ontology. Previously, this combination of DL and planning has been investigated for the light-weight DL DL-Lite. Here we propose a novel compilation scheme into standard PDDL with derived predicates, which applies to more expressive DLs and is based on the rewritability of DL queries into Datalog with stratified negation. We also provide a new rewritability result for the DL Horn-ALCHOIQ, which allows us to apply our compilation scheme to quite expressive ontologies. In contrast, we show that in the slight extension Horn-SROIQ no such compilation is possible unless the weak exponential hierarchy collapses. Finally, we show that our approach can outperform previous work on existing benchmarks for planning with DL ontologies, and is feasible on new benchmarks taking advantage of more expressive ontologies.

‘Monkeys play by sizes’: the reconstruction of military hierarchy in Ghana's armed forces

AbstractGhana's post-independence era has been shaped by a series of coups and numerous attempted military interventions. While the involvement of the Ghana Armed Forces in politics has received widespread academic attention, the detrimental effects of these events on the military as an institution remain largely understudied. Using the coups of 1979 and 1981 as a point of departure, the article explores from an institutional perspective how the disruption of the everyday in the Ghanaian barracks resulted in the temporal breakdown of discipline and the collapse of military hierarchy. The article further examines the measures taken by the Provisional National Defence Council junta to rebuild and nurture hierarchy following its breakdown. It is also argued that restoration of hierarchy in the Ghanaian barracks called not only for an appeal to soldierly values, such as respect for rank and authority, but also for dramatic performances of authority and military hierarchy. The article depicts hierarchy in various settings, while exploring how the military order is expressed and lived in the current constellation. In short, the article not only illustrates a historical evolution, but also demonstrates that the maintenance of order and hierarchy in a closed institution such as the military is an ongoing and continuous negotiation process.

Neo-Ottomanism and Cool Japan in comparative perspective

AbstractTurkey and Japan have comparable histories of modernization beginning in the nineteenth century. They have since then produced modernities that are considered a mix of “Eastern” and “Western.” Over recent decades, both faced the question of what comes after modernity and began manufacturing their versions of authenticities and cultural exports. This paper comparatively locates two symptoms of this process. “Neo-Ottomanism” refers to the increasing cultural consumption of Turkey’s imperial past while “Cool Japan” emphasizes popular products in entertainment, fashion, youth culture, and food, intending to shift Japan’s image to a “cool” place. Both projects, in different ways, are sponsored by the state; yet their reception in popular culture illustrates the vexed relationship between the state and culture: while states endeavor to colonize culture for their own interests, popular culture provides avenues to outwit the state’s attempts. Popular culture’s autonomy in both contexts has to do with the collapse of traditional hierarchies, which has paved the ways for the promotion and export of new identity claims. Local and global representations of neo-Ottomanism and Cool Japan differ. Internally, they are fragmented; externally, they are linked to international “soft power,” and offer alternatives modernities in Turkey and Japan’s regional areas of influence.

Maximality and collapse in the hierarchy of α-c.a. degrees

In (A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (2020), Annals of Mathematics Studies, Princeton University Press), Downey and Greenberg define a transfinite hierarchy of low 2 c.e. degrees – the totally α-c.a. degrees, for appropriately small ordinals α. This new hierarchy is of particular interest because it has already given rise to several natural definability results, and provides a new definable antichain in the c.e. degrees. Several levels of this hierarchy contain maximal degrees. We discuss how maximality interacts with upper cones, and the related notion of hierarchy collapse in upper cones. For example, we show that there is a totally ω-c.a. degree above which there is no maximal totally ω-c.a. degree.

Fine-grained quantum computational supremacy

(pp1089-1115) Tomoyuki Morimae and Suguru Tamaki doi: https://doi.org/10.26421/QIC19.13-14-2 Abstracts: Output probability distributions of several sub-universal quantum computing models cannot be classically efficiently sampled unless some unlikely consequences occur in classical complexity theory, such as the collapse of the polynomial-time hierarchy. These results, so called quantum supremacy, however, do not rule out possibilities of super-polynomial-time classical simulations. In this paper, we study ``fine-grained" version of quantum supremacy that excludes some exponential-time classical simulations. First, we focus on two sub-universal models, namely, the one-clean-qubit model (or the DQC1 model) and the HC1Q model. Assuming certain conjectures in fine-grained complexity theory, we show that for any a>0 output probability distributions of these models cannot be classically sampled within a constant multiplicative error and in 2^{(1-a)N+o(N)} time, where N is the number of qubits. Next, we consider universal quantum computing. For example, we consider quantum computing over Clifford and T gates, and show that under another fine-grained complexity conjecture, output probability distributions of Clifford-T quantum computing cannot be classically sampled in 2^{o(t)} time within a constant multiplicative error, where t is the number of T gates.

How Bizarre: The Glitch of the Nineties as a Fantasy of New Authorship

How Bizarre: The Glitch of the Nineties as a Fantasy of New Authorship

Wojna w jednym losie

The War in One Fate: Biographical Narratives of Widows of Soviet Servicemen on the Basis of Letters to the Authorities of Lviv in 1944-1945The article analyzes letters written in late 1944 and in 1945 by widows of Soviet servicemen to the authorities of the city of Lviv requesting a permit to move or return to Lviv, the construction of women’s biographical narratives and the image of women in the war. The main topic discussed in post-war correspondence was the war trials and different fates of women sharing the experience of life in Lviv in 1939 -1941. It demonstrates similar strategies of survival and communication with the totalitarian state, and the contradictory image of woman in war time. The personal drama of her husband’s death, the sudden collapse of the social hierarchy, and, in particular, the destruction of “pre-war” housing stock in Lviv and other livelihood opportunities in a big city, prompted woman, in the already partly assumed role of the head of the family, to look for ways to regain their former position. Probably, they wrote special letters, among many other quite similar appeals to the government, in order to attract attention to themselves. The narrative analysis of the letters has made it possible to isolate the images of Lviv in the representations of people of the (post)war period, to disclose the „Soviet language” and the (un)typical gender-related aspects of texts written by women.

Resource variability and the collapse of a dominance hierarchy in a colour polymorphic species

AbstractIntraspecific social dominance hierarchies should be influenced by environmental variation; however, in colour polymorphic species, dominance hierarchies are often assumed fixed, and thus insensitive to environmental variability. We ran a series of experiments using the colour polymorphic long-tailed brush lizard (Urosaurus graciosus) to challenge this assumption. We staged contests between orange and yellow morph males over a single heated perch, two perches at the same temperature, or two perches differing in temperature. Our first experiment revealed that orange-throated males are socially dominant. However, this hierarchy collapsed in our other experiments as yellow males became more aggressive. Interestingly, both males only ever secured their own perch where the perches differed in temperature. These findings mirror observations of morph behavioural flexibility in nature and studies of behaviour–environment interactions in non-polymorphic taxa. We conclude that colour morphs may have an underappreciated ability to assess resource-level changes and respond with concomitant flexibility in behaviour.

Human Moral Becoming and the Surrealist Imagination: Saulius Tomas Kondrotas and Šarūnas Sauka

The author of this article interprets the surrealist narratives of Saulius Tomas Kondrotas and Šarūnas Sauka as signs of both a crumbling empire and the rebirth of human dignity in late Soviet-era literature and art. A sense of epochal shift provides a common background of allegorical narration in both Kondrotas’s and Saukas’s narratives, protecting them from flat politicising and encouraging us to read their work as an encounter between the human and the eternal.Countering Soviet values, Kondrotas and Sauka place the universal rebellion of the artist against an ideology that imprisons the individual at the core of their work, making it possible to draw a connection to the imagination of the medieval alchemist, as they too concentrate their attention on the search for God and the resulting visions-projections.Kondrotas’s and Saukas’s works are characterised by oniric, surrealist stylistics, an understanding of the world as a dangerous place, and the human-godlike-animal matrix. The end of the world, the collapse of foundational hierarchies of values, and a feeling of moral ambivalence are common to both, leading them to search for solutions in response to human moral decline. Kondrotas and Sauka both speak about human rebirth, one of the oldest of human archetypes and one central to the alchemical imagination.

Active symbols in grammars with valuations

Grammars with valuations are context-free rewriting mechanisms where the derivation process is controlled by a recursive function that evaluates strings. They have been introduced by Jürgen Dassow as models for the molecular replication process taking into account its selective character. A symbol is active in a grammar with valuation if it can be rewritten non-identically. This paper studies the effect of restricting the number of active symbols in grammars with valuations and several variants thereof to their generative power. It is investigated in which cases the number of active symbols induces infinite strict hierarchies and when the hierarchies collapse. The induced language families are compared among one another.

Creating a Culture of Connection: A Postmodern Punk Rock Approach to Art Therapy

Punk culture is based on an ideology that emphasizes questioning conformity and creating a space for individuality within community. It has inspired fans to create their own music and art as part of their quest for authenticity. Art therapy informed by punk culture can be a way to create a culture of connection while also building resiliency and instilling hope through core concepts of collapse of hierarchy, a search for authenticity and understanding, deconstruction/reconstruction, and empowerment through a DIY mindset. In this article the author illustrates firsthand experiences with punk rock culture and postmodern art and describes how they inform her art therapy practice.

Historicizing Play-Logic in the Making of Relatedness: The Case ofBumba Meu BoiFestival in Maranhão, Northeast Brazil

Abstract After the establishment in 1682 of a trading company to monopolize commerce between the colony and the metropolis, the Brazilian state of Maranhao has become one of the main slave ports in Latin America. Abolition in May 1888 nonetheless failed to precipitate the collapse of colonial class hierarchies so that throughout the twentieth century a series of local oligarchs continued to cultivate clientelist political systems. Despite institutionalized socioeconomic inequality, however, maranhenses celebrate on a grand popular scale a colossal repertoire of legends, tales and myths. This amounts to a corpus of shared knowledge on the forces that sustain and transform their social universe. In this article, I will focus on the local festival of Bumba meu Boi as preeminent manifestation of this cosmology. Through the analysis of post-abolition sociality in this annual celebration, I argue that in the Tristes Tropiques of Maranhao an infinitely expanding sense of affective egalitarianism is infused with ...

Collapsing modular counting in bounded arithmetic and constant depth propositional proofs

Jeřábek introduced fragments of bounded arithmetic which are axiomatized with weak surjective pigeonhole principles and support a robust notion of approximate counting. We extend these fragments to accommodate modular counting quantifiers. These theories can formalize and prove the relativized versions of Toda’s theorem on the collapse of the polynomial hierarchy with modular counting. We introduce a version of the Paris-Wilkie translation for converting formulas and proofs of bounded arithmetic with modular counting quantifiers into constant depth propositional logic with modular counting gates. We also define Paris-Wilkie translations to Nullstellensatz and polynomial calculus refutations. As an application, we prove that constant depth propositional proofs that use connectives AND, OR, and mod p gates, for p p a prime, can be translated, with quasipolynomial increase in size, into propositional proofs containing only propositional formulas of depth three in which the top level is Boolean, the middle level consists of mod p gates, and the bottom level subformulas are small conjunctions. These results are improved to depth two by using refutations from the weak surjective pigeonhole principles.

Co-Nondeterminism in Compositions

The field of kernelization offers a rigorous way of studying the ubiquitous technique of data reduction and preprocessing for combinatorially hard problems. A widely accepted definition of useful data reduction is that of a polynomial kernelization where the output instance is guaranteed to be of size polynomial in some parameter of the input. The fairly recent development of a framework for kernelization lower bounds has made this notion even more attractive as we can now classify many problems into admitting or not admitting polynomial kernelizations. The central notion of the framework is that of a polynomial-time composition algorithm due to Bodlaender et al. (ICALP 2008, JSCC 2009): given t input instances, an or -composition algorithm returns a single-output instance with bounded parameter value that is yes if and only if one of t input instances is yes; it encodes the logical OR of the input instances. Based on a result of Fortnow and Santhanam (STOC 2008, JSCC 2011), Bodlaender et al. show that an or -composition for an NP-hard problem rules out polynomial kernelizations for it unless NP ⊆ coNP/poly (which is known to imply a collapse of the polynomial hierarchy). It is implicit in the work of Fortnow and Santhanam that even co-nondeterministic composition algorithms suffice to rule out polynomial kernelizations. This was first observed in unpublished work of Chen and Müller, and it is an explicit conclusion of recent results by Dell and van Melkebeek (STOC 2010). However, in contrast to the numerous applications of deterministic composition, the added power of co-nondeterminism has not yet been harnessed to obtain kernelization lower bounds. In this work, we present the first example of how co-nondeterminism can help to make a composition algorithm. We study the existence of polynomial kernels for a Ramsey-type problem where, given a graph G and an integer k , the question is whether G contains an independent set or a clique of size at least k . It was asked by Rod Downey whether this problem admits a polynomial kernelization with respect to k ; such a result would greatly speed up the computation of Ramsey numbers. We provide a co-nondeterministic composition based on embedding t instances into a single host graph H . The crux is that the host graph H needs to observe a bound of ℓ ∈ O (log t ) on both its maximum independent set and maximum clique size, while also having a cover of its vertex set by independent sets and cliques all of size ℓ; the co-nondeterministic composition is built around the search for such graphs. Thus, we show that, unless NP ⊆ coNP/poly, the problem does not admit a kernelization with polynomial size guarantee.

Solving search problems by strongly simulating quantum circuits

Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several efficient strong simulation techniques are known for restricted families of quantum circuits and we develop an additional technique in this article. Further, we show that strong simulation algorithms perform another fundamental task: solving search problems. Efficient strong simulation techniques allow solutions to a class of search problems to be counted and found efficiently. This enhances the utility of strong simulation methods, known or yet to be discovered, and extends the class of search problems known to be efficiently simulable. Relating strong simulation to search problems also bounds the computational power of efficiently strongly simulable circuits; if they could solve all problems in P this would imply that all problems in NP and #P could be solved in polynomial time.

The Computational Complexity of Linear Optics

We give new evidence that quantum computers—moreover, rudimentary quantum computers built entirely out of linear-optical elements—cannot be efficiently simulated by classical computers. In particular, we define a model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode. This model is not known or believed to be universal for quantum computation, and indeed, we discuss the prospects for realizing the model using current technology. On the other hand, we prove that the model is able to solve sampling problems and search problems that are classically intractable under plausible assumptions. Our first result says that, if there exists a polynomial-time classical algorithm that samples from the same probability distribution as a linear-optical network, then ${\mathsf P}^{\mathsf{\#P}}=\mathsf{BPP}^{\mathsf{NP}}$, and hence the polynomial hierarchy collapses to the third level. Unfortunately, this result assumes an extremely accurate simulation. Our main result suggests that even an approximate or noisy classical simulation would already imply a collapse of the polynomial hierarchy. For this, we need two unproven conjectures: the Permanent-of-Gaussians Conjecture, which says that it is $\mathsf{\#P}$-hard to approximate the permanent of a matrix $A$ of independent $\mathcal{N}\left( 0,1\right)$ Gaussian entries, with high probability over $A$; and the Permanent Anti-Concentration Conjecture, which says that $\left\vert \operatorname*{Per}\left( A\right) \right\vert \geq\sqrt{n!}/\operatorname*{poly}\left( n\right)$ with high probability over $A$. We present evidence for these conjectures, both of which seem interesting even apart from our application. This paper does not assume knowledge of quantum optics. Indeed, part of its goal is to develop the beautiful theory of noninteracting bosons underlying our model, and its connection to the permanent function, in a self-contained way accessible to theoretical computer scientists. An extended abstract of this article appeared in the Proceedings of STOC 2011.