Bentuk Penyajian Dan Makna Gerak Tari Tortor Pada Upacara Kematian Adat Batak Toba Di Desa Penanggalan Kecamatan Penanggalan Kota Subulussalam Provinsi Aceh

Penelitian ini tentang “bentuk penyajian dan makna gerak tari tortor pada upacara kematian adat Batak Toba di desa Penanggalan kota Subulussalam”. Adapun yang menjadi masalah dalam penelitian ini adalah bagaimana bentuk penyajian dan makna gerak pada upacara kematian adat Batak Toba di desa Penanggalan Kota Subulussalam. Penelitian ini bertujuan untuk mendeskripsikan bentuk penyajian dan makna gerak tari tortor pada upacara kematian adat Batak Toba di desa Penanggalan Kota Subulussalam. Pendekatan yang digunakan dalam penelitin ini adalah pendekatan kualitatif dengan jenis penelitian deskriptif. Teknik pengumpulan data dilakukan dengan menggunakan teknik observasi (pengamatan), interview (wawancara), dan dokumentasi. Agar hasil penelitian dapat dipercaya, peneliti menggunakan alat bantu buku catatan, kamera foto dan kamera video. Teknik analisis data dilakukan dengan reduksi data, penyajian data, dan verifikasi data. Berdasarkan hasil penelitian tari tortor ini ditarikan pada saat sebelum jenazah dikebumikan dan tari tortor melambangkan penghormaatan terakhir kepada jenazah sebelum dikebumikan serta tari ini dilakukan agar yang ditinggalkan tidak berlarut-larut dalam kesedihan serta mengiklaskan dengan lapang dada. Tarian ini ditarikan secara gembira dalam arti tidak menangis. Tari tortor kematian memiliki 4 ragam gerakan, 4 jenis pola lantai dan menggunakan sebuah ulos kain khas suku Batak yang diulosi dibahu penari yang mengulosi hula-hula dan unsur kerabat Dalihan Natolu lainnya

Approximation Algorithms for Generalized MST and TSP in Grid Clusters

We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside the integer grid (in Euclidean plane) where each grid cell is $1 \times 1$. In the MST version of the problem, the goal is to find a minimum tree that contains exactly one point from each non-empty grid cell (cluster). Similarly, in the TSP version of the problem, the goal is to find a minimum weight cycle containing one point from each non-empty grid cell. We give a $(1+4\sqrt{2}+\epsilon)$ and $(1.5+8\sqrt{2}+\epsilon)$-approximation algorithm for these two problems in the described setting, respectively. Our motivation is based on the problem posed in [7] for a constant approximation algorithm. The authors designed a PTAS for the more special case of the GMST where non-empty cells are connected end dense enough. However, their algorithm heavily relies on this connectivity restriction and is unpractical. Our results develop the topic further

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations in actual applications. In previous work, it has been established that the sets of numbers that are recognizable by weak deterministic automata in two bases that do not share the same set of prime factors are exactly those that are definable in the first order additive theory of real and integer numbers. This result extends Cobham's theorem, which characterizes the sets of integer numbers that are recognizable by finite automata in multiple bases. In this article, we first generalize this result to multiplicatively independent bases, which brings it closer to the original statement of Cobham's theorem. Then, we study the sets of reals recognizable by Muller automata in two bases. We show with a counterexample that, in this setting, Cobham's theorem does not generalize to multiplicatively independent bases. Finally, we prove that the sets of reals that are recognizable by Muller automata in two bases that do not share the same set of prime factors are exactly those definable in the first order additive theory of real and integer numbers. These sets are thus also recognizable by weak deterministic automata. This result leads to a precise characterization of the sets of real numbers that are recognizable in multiple bases, and provides a theoretical justification to the use of weak automata as symbolic representations of sets.Comment: 17 page

Political economy of planned relocation: A model of action and inaction in government responses

This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this record.Planned relocation has been shown to have significant impacts on the livelihoods and wellbeing of people and communities, whether the resettlement process is inclusive or coercive. For states, planned relocation represents risks to those communities but also to government investments and political legitimacy. Evaluations of relocations commonly focus on the risks and benefits of government interventions while overlooking the consequences of not intervening. Here we develop a conceptual framework to examine the factors that influence government decision-making about whether or not to undertake planned relocation of populations in the context of environmental change. The study examines planned relocation decisions and non-decisions by government agencies in West Bengal in India for communities seeking relocation due to coastal flooding. It focuses on three localities facing river erosion losing significant land areas in small islands and communities where populations recognize the need for public intervention, but where there has been a diversity of responses from the state authorities. Data are derived from interviews with key respondents involved in planning and implementing relocation and with residents affected by those government decisions (n = 26). These data show that government action is explained by a combination of risk aversion within political systems to avoid perceived negative consequences, and a lack of government accountability. The empirical cases demonstrate the uneven application of action and inaction and the consequent uneven distribution of potential outcomes on populations. The study suggests that while there may be a growing demand for planned relocation in places affected by environmental change, its implementation is likely to be uneven, with profound socioeconomic implications for those living in such localities.International Development Research Centr

Commentary: Inequality, precarity and sustainable ecosystems as elements of urban resilience

This is the final version. Available on open access from SAGE Publications via the DOI in this recordThe science of resilience suggests that urban systems become resilient when they promote progressive transformative change to social and physical infrastructure. But resilience is challenged by global environmental risks and by social and economic trends that create inequality and exclusion. Here we argue that distortionary inequality and precarity undermine social processes that give access to public infrastructure and ecosystems thereby undermining urban resilience. We illustrate how inequality and precarity undermine resilience with reference to social exclusion and insecurity in growing urban settlements in the Asia-Pacific region. Inequality and exposure to environmental risks represent major challenges for governance that can be best overcome through inclusion and giving voice to marginalised populations.Economic and Social Research Council (ESRC)International Development Research Centr

When the lens is too wide: The political consequences of the visual dehumanization of refugees

Photojournalistic images shape our understanding of sociopolitical events. How humans are depicted in images may have far-reaching consequences for our attitudes towards them. Social psychology has shown how the visualization of an ‘identifiable victim effect’ can elicit empathic responses. However, images of identifiable victims in the media are the exception rather than the norm. In the context of the Syrian refugee crisis, the majority of images in Western media depicted refugees as large unidentifiable groups. While the effects of the visual depiction of single individuals are well-known, the ways in which the visual framing of large groups operates, and its social and political consequences, remain unknown. We here focus on the visual depiction of refugees to understand how exposure to the dominant visual framing used in the media, depicting them in large groups of faceless individuals, affects their dehumanization and sets off political consequences. To that end we brought together insights from social psychology, social sciences and the humanities to test a range of hypotheses using methods from social and political psychology in 10 studies with the participation of 3951 European citizens. Seeing images of large groups resulted in greater implicit dehumanization compared with images depicting refugees in small groups. Images of large groups are also explicitly rated as more dehumanizing, and when coupled with meta-data such as newspaper headlines, images continue to play a significant and independent role on how (de)humanizing we perceive such news coverage to be. Moreover, after viewing images of large groups, participants showed increased preference for more dominant and less trustworthy-looking political leaders and supported fewer pro-refugee policies and more anti-refugee policies. In terms of a mechanistic understanding of these effects, the extent to which participants felt pity for refugees depicted in large groups as opposed to small groups mediated the effect of visual framing on the choice of a more authoritarian-looking leader. What we see in the media and how it is shown not only has consequences for the ways in which we relate to other human beings and our behaviour towards them but, ultimately, for the functioning of our political systems

Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis

The classic approaches to synthesize a reactive system from a linear temporal logic (LTL) specification first translate the given LTL formula to an equivalent omega-automaton and then compute a winning strategy for the corresponding omega-regular game. To this end, the obtained omega-automata have to be (pseudo)-determinized where typically a variant of Safra's determinization procedure is used. In this paper, we show that this determinization step can be significantly improved for tool implementations by replacing Safra's determinization by simpler determinization procedures. In particular, we exploit (1) the temporal logic hierarchy that corresponds to the well-known automata hierarchy consisting of safety, liveness, Buechi, and co-Buechi automata as well as their boolean closures, (2) the non-confluence property of omega-automata that result from certain translations of LTL formulas, and (3) symbolic implementations of determinization procedures for the Rabin-Scott and the Miyano-Hayashi breakpoint construction. In particular, we present convincing experimental results that demonstrate the practical applicability of our new synthesis procedure