Who Rules Japan? Popular Participation in the Japanese Legal Process

"The dramatic growth of the Japanese economy in the postwar period, and its meltdown in the 1990s, has attracted sustained interest in the power dynamics underlying the management of Japan’s administrative state. Scholars and commentators have long debated over who wields power in Japan, asking the fundamental question: who really governs Japan? This important volume revisits this question by turning its attention to the regulation and design of the Japanese legal system. With essays covering the new lay-judge system in Japanese criminal trials, labour dispute resolution panels, prison policy, gendered justice, government lawyers, welfare administration and administrative transparency, this comprehensive book explores the players and processes in Japan’s administration of justice."--publisher website

Popular participation in labour law: The new labour dispute resolution tribunal

The Labour Tribunal Law (No. 45 of 2004) ushered in a new court-annexed dispute resolution system for industrial relations disputes in Japan (outlined generally in Sugeno, 2004). Similar to the lay judge system for criminal trials (Johnson and Shinomiya, Chapter 2), the new tribunal adopts an adjudicative model that blends professional and lay expertise with decisions heard by a tripartite panel comprising a professional judge and two lay judges recommended by management and labour unions respectively. The new tribunal system came into operation on 1 April 2006.

Tweeted joke lifespans and appropriated punch lines: Practices around topical humor on social media

During the coverage of breaking news and broadcasts on social media, journalists and audiences alike share links, comments, and opinions in response to new developments. On Twitter, such content can gain increased visibility by receiving retweets from other users, through automated functions, or by manually republishing and modifying comments. This article studies tweeted coverage of the doping scandal involving Lance Armstrong in 2012 and 2013. Humorous framing is found to be popular in this discussion, and such comments experience different longevity to breaking news tweets. With these patterns come new opportunities for users to modify and appropriate punch lines in attempts to receive increased attention—and for the serendipitous creation of similar jokes—which raise questions of authorship and attribution.

Kissing fish: Rex Hunt, popular culture, sustainability and fishing practices

Natural resource managers and scientists focus on the behaviour of individual recreational fishers to understand environmental problems associated with this leisure activity. They do this in an effort to identify ways to change attitudes in order to facilitate environmentally friendly choices. This applied use of ABC psychology (attitude, behaviour, choice) has not delivered the expected results. This article offers a different approach by investigating an emergent practice in diverse fishing communities, rather than looking to the responsibility of the individual recreational fisher. Using practice theory, I trace the change from take-all to catch-and-release fishing in Australia by analysing the texts of celebrity fisher Rex Hunt, who is an advocate for releasing fish. I combine this with oral history testimony from a sample of recreational fishers from the broader Australian community to show how change happened. The practice of catch-and-release fishing emerged through the combination of sociotechnical and historically specific elements present in popular culture, including the media. Paying attention to the way different elements catalyse provides a rich account of the changing modes of sustainability in recreational fishing communities.

Studying change in popular culture: A "middle-range" approach

"This chapter reviews the capacity of the discipline field to account for the velocity and quality of digitally-driven transformations, while making a case for a "middle range" approach that steers between unbridled optimism ("all-change") and determined scepticism ("Continuity") about the potential of such change. The chapter focuses on online screen distribution as a case study, considering the evidence for, and significance of, change in industry structure and the main payers, how content is produced and by whom, the nature of content, and the degree to which online screen distribution has reached thresholds of mainstream popularity."

Rhetoric and Representation : Exploring the Cultural Meaning of the Natural Sciences in Contemporary Popular Science Writing and Literature

Kirjallisuuden- ja kulttuurintutkimus on viimeisten kolmen vuosikymmenen aikana tullut yhä enenevässä määrin tietoiseksi tieteen ja taiteen suhteen monimutkaisesta luonteesta. Nykyään näiden kahden kulttuurin tutkimus muodostaa oman kenttänsä, jolla niiden suhdetta tarkastellaan ennen kaikkea dynaamisena vuorovaikutuksena, joka heijastaa kulttuurimme kieltä, arvoja ja ideologisia sisältöjä. Toisin kuin aiemmat näkemykset, jotka pitävät tiedettä ja taidetta toisilleen enemmän tai vähemmän vastakkaisina pyrkimyksinä, nykytutkimus lähtee oletuksesta, jonka mukaan ne ovat kulttuurillisesti rakentuneita diskursseja, jotka kohtaavat usein samankaltaisia todellisuuden mallintamiseen liittyviä ongelmia, vaikka niiden käyttämät metodit eroavatkin toisistaan. Väitöskirjani keskittyy yllä mainitun suhteen osa-alueista popularisoidun tietokirjallisuuden (muun muassa Paul Davies, James Gleick ja Richard Dawkins) käyttämän kielen ja luonnontieteistä ideoita ammentavan kaunokirjallisuuden (muun muassa Jeanette Winterson, Tom Stoppard ja Richard Powers) hyödyntämien keinojen tarkasteluun nojautuen yli 30 teoksen kattavaa aineistoa koskevaan tyylin ja teemojen tekstianalyysiin. Populaarin tietokirjallisuuden osalta tarkoituksenani on osoittaa, että sen käyttämä kieli rakentuu huomattavassa määrin sellaisille rakenteille, jotka tarjoavat mahdollisuuden esittää todellisuutta koskevia argumentteja mahdollisimman vakuuttavalla tavalla. Tässä tehtävässä monilla klassisen retoriikan määrittelemillä kuvioilla on tärkeä rooli, koska ne auttavat liittämään sanotun sisällön ja muodon tiukasti toisiinsa: retoristen kuvioiden käyttö ei näin ollen edusta pelkkää tyylikeinoa, vaan se myös usein kiteyttää argumenttien taustalla olevat tieteenfilosofiset olettamukset ja auttaa vakiinnuttamaan argumentoinnin logiikan. Koska monet aikaisemmin ilmestyneistä tutkimuksista ovat keskittyneet pelkästään metaforan rooliin tieteellisissä argumenteissa, tämä väitöskirja pyrkii laajentamaan tutkimuskenttää analysoimalla myös toisenlaisten kuvioiden käyttöä. Osoitan myös, että retoristen kuvioiden käyttö muodostaa yhtymäkohdan tieteellisiä ideoita hyödyntävään kaunokirjallisuuteen. Siinä missä popularisoitu tiede käyttää retoriikkaa vahvistaakseen sekä argumentatiivisia että kaunokirjallisia ominaisuuksiaan, kuvaa tällainen sanataide tiedettä tavoilla, jotka usein heijastelevat tietokirjallisuuden kielellisiä rakenteita. Toisaalta on myös mahdollista nähdä, miten kaunokirjallisuuden keinot heijastuvat popularisoidun tieteen kerrontatapoihin ja kieleen todistaen kahden kulttuurin dynaamisesta vuorovaikutuksesta. Nykyaikaisen populaaritieteen retoristen elementtien ja kaunokirjallisuuden keinojen vertailu näyttää lisäksi, kuinka tiede ja taide osallistuvat keskusteluun kulttuurimme tiettyjen peruskäsitteiden kuten identiteetin, tiedon ja ajan merkityksestä. Tällä tavoin on mahdollista nähdä, että molemmat ovat perustavanlaatuisia osia merkityksenantoprosessissa, jonka kautta niin tieteelliset ideat kuin ihmiselämän suuret kysymyksetkin saavat kulttuurillisesti rakentuneen merkityksensä.

Mediated music makers : Constructing author images in popular music

The subject of the thesis is the mediated construction of author images in popular music. In the study, the construction of images is treated as a process in which artists, the media and the members of the audience participate. The notions of presented, mediated and compiled author images are used in explaining the mediation process and the various authorial roles of the agents involved. In order to explore the issue more closely, I analyse the author images of a group of popular music artists representing the genres of rock, pop and electronic dance music. The analysed material consists mostly of written media texts through which the artists authorial roles and creative responsibilities are discussed. Theoretically speaking, the starting points for the examination lie in cultural studies and discourse analysis. Even though author images may be conceived as intertextual constructions, the artist is usually presented as a recognizable figure whose purpose is to give the music its public face. This study does not, then, deal with musical authors as such, but rather with their public images and mediated constructions. Because of the author-based functioning of popular music culture and the idea of the artist s individual creative power, the collective and social processes involved in the making of popular music are often superseded by the belief in a single, originating authorship. In addition to the collective practices of music making, the roles of the media and the marketing machinery complicate attempts to clarify the sharing of authorial contributions. As the case studies demonstrate, the differences between the examined author images are connected with a number of themes ranging from issues of auteurism and stardom to the use of masked imagery and the blending of authorial voices. Also the emergence of new music technologies has affected not only the ways in which music is made, but also how the artist s authorial status and artistic identity is understood. In the study at hand, the author images of auteurs, stars, DJs and sampling artists are discussed alongside such varied topics as collective authorship, evaluative hierarchies, visual promotion and generic conventions. Taken altogether, the examined case studies shed light on the functioning of popular music culture and the ways in which musical authorship is (re)defined.

The popular mechanicals

In Shakespeare's play, A Midsummer Night's Dream, six workers aspire to present a play for the Royal Wedding. We see their efforts and their antics in the framework of the Royal Court and the supernatural fairy world. We love them for their simplicity, laugh at their homespun ways and forgive their stumbles as they perform their play in the royal presence. In the marvellous irreverence of The Popular Mechanicals, Keith Robinson and Tony Taylor have thrown Shakespeare to the mercy of Australian larrikin humour and placed the lowly workers centre stage. This is A Midsummer Night's Dream without the Royals. Shakespeare's mechanicals become the stars, the kings of their own world, where dreams can come true, if only for a moment. With the innocence of clowns they love life, feel joy, know fear, bear sadness. In the end it is we the audience who become the Royal presence, to judge them if we dare.

Photo collage of audiences at cultural performances; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"50 Veranstaltungen der 'Seelischen Winterhilfe' wurden von 24000 Betreuten besucht"

Optimal popular matchings

In this paper we consider the problem of computing an “optimal” popular matching. We assume that our input instance View the MathML source admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness in which case we are required to return a fair popular matching. We show an O(n2+m) algorithm for this problem, assuming that the preference lists are strict, where m is the number of edges in G and n is the number of applicants.

Popular Mixed Matchings

We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.

Popular Matchings with Variable Job Capacities

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.

Antipyretic and antibacterial activity of Chloranthus erectus (Buch.-Ham.) Verdcourt leaf extract: A popular folk medicine of Arunachal Pradesh

Objective : The main objective of this work was to study the antipyretic and antibacterial activity of C. erectus (Buch.-Ham.) Verdcourt leaf extract in an experimental albino rat model. Materials and Methods : The methanol extract of C. erectus leaf (MECEL) was evaluated for its antipyretic potential on normal body temperature and Brewers yeast-induced pyrexia in albino rats model. While the antibacterial activity of MECEL against five Gram (-) and three Gram () bacterial strains and antimycotic activity was investigated against four fungi using agar disk diffusion and microdilution methods. Result : Yeast suspension (10 mL/kg b.w.) elevated rectal temperature after 19 h of subcutaneous injection. Oral administration of MECEL at 100 and 200 mg/kg b.w. showed significant reduction of normal rectal body temperature and yeast-provoked elevated temperature (38.8 0.2 and 37.6 0.4, respectively, at 2-3 h) in a dose-dependent manner, and the effect was comparable to that of the standard antipyretic drug-paracetamol (150 mg/kg b.w.). MECEL at 2 mg/disk showed broad spectrum of growth inhibition activity against both groups of bacteria. However, MECEL was not effective against the yeast strains tested in this study. Conclusion : This study revealed that the methanol extract of C. erectus exhibited significant antipyretic activity in the tested models and antibacterial activity as well, and may provide the scientific rationale for its popular use as antipyretic agent in Khamptiss folk medicines.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

Popular mixed matchings

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M, T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based on the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distribution over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P, Q) >= phi(Q, P) for all mixed matchings Q. We show that popular mixed matchings always exist and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem. (C) 2010 Elsevier B.V. All rights reserved.