The Mukokuseki Strategy and the Application of Pivot Translation in the Localization of Japanese Games

This article investigates the impact of using pivot language on the quality of game localization via a case study on the Japanese game Dark Souls 3. It first discusses the indirectness of the source text and the complexity of the target text in game localization by highlighting the “born translated” nature of the game narrative design. It then explicates the intricacy of having game audio voiced over in English only and including both direct and indirect translations in the localization workflow. It demonstrates the complication in evaluating localization quality from players’ perspectives and suggests that using English as a pivot language has certain advantages in ensuring multimodal cohesiveness in game localization. The rationale behind the localization approach is then explored through the lens of the mukokuseki strategy, which suggests that the application of pivot translation is driven by market globalization and, ultimately, the pursuit of economic gain

Conditional control of equivalence and the relations different and opposite : a behavior analytic model of complex verbal behavior

Behavior analytic approaches to the explanation of verbal behavior have been criticized because of difficulty explaining verbal productivity---the ability to make novel verbalizations which are in some way appropriate to the context. Match to sample procedures have resulted in the formation of equivalence classes which allow productive responding to untrained stimulus combinations. The central hypothesis of this study is that arbitrarily applicable relations other than equivalence can come to control human responding in ways which are productive. A second-order conditional discrimination procedure was used to establish control over sample-comparison selections where samples and comparisons were arbitrary visual stimuli. Pretraining with non-arbitrary stimuli gave second-order conditional stimuli the function of signaling which relation—same, different, or opposite---was to control sample-comparison discriminations. These pretrained second-order conditional stimuli were used to establish networks of relations between arbitrary visual stimuli. It was predicted that the network of relations could come to control untrained responding to probes which presented second-order conditional stimuli, samples, and comparisons in novel arrangements. The predicted pattern of responding was derived from formal logic

Relationship-based access control: its expression and enforcement through hybrid logic

Access control policy is typically de ned in terms of attributes, but in many applications it is more natural to de- ne permissions in terms of relationships that resources, systems, and contexts may enjoy. The paradigm of relationshipbased access control has been proposed to address this issue, and modal logic has been used as a technical foundation. We argue here that hybrid logic { a natural and wellestablished extension of modal logic { addresses limitations in the ability of modal logic to express certain relationships. Also, hybrid logic has advantages in the ability to e ciently compute policy decisions relative to a relationship graph. We identify a fragment of hybrid logic to be used for expressing relationship-based access-control policies, show that this fragment supports important policy idioms, and study its expressiveness. We also capture the previously studied notion of relational policies in a static type system. Finally, we point out that use of our hybrid logic removes an exponential penalty in existing attempts of specifying complex relationships such as \at least three friends"

The Governance of Disease Outbreaks

This edited volume is directed at experts in international law, practitioners in international institutions, and other experts who would like to familiarize themselves with the legal framework of infectious disease governance. Using the West African Ebola crisis as a case study, this book is part of a larger collaborative project on international health governance. Project partners are the Forschungsstätte der Evangelischen Studiengemeinschaft e.V. - Institute for Interdisciplinary Research and the Max Planck Institute for Comparative Public Law and International Law (MPIL). The authors explain the context and substantive legal framework of the Ebola crisis, while also highlighting its human rights aspects, institutional law (such as the debate on the securitization of health), and the limits to a purely legal approach to the subject. The authors are experts in public international law, public health, political science, and anthropology. With contributions by: Elif Askin, Susan L. Erikson, André den Exter, Robert Frau, Wolfgang Hein, Bonnie Kaiser, Hunter Keys, Michael Marx, Edefe Ojomo, Ilja Richard Pavone, Mateja Steinbrück Platise, Christian R. Thauer, Leonie Vierck, Pedro A. Villarreal, A. Katarina Weilert. Der Sammelband richtet sich an ein Fachpublikum von Völkerrechtlern, Praktikern in internationalen Institutionen und anderen Experten, die sich mit den rechtlichen Rahmenbedingungen der internationalen Governance ansteckender Krankheiten vertraut machen möchten. Fallbeispiel ist die Ebola-Krise in Westafrika. Der Band geht aus einem breiter angelegten Heidelberger Kooperationsprojekt zur „International Health Governance“ der Forschungsstätte der Evangelischen Studiengemeinschaft e.V. - Institut für interdisziplinäre Forschung (FEST) und des Max-Planck-Instituts für ausländisches öffentliches Recht und Völkerrecht (MPIL) hervor. Die Autoren beleuchten Kontext und materiellen Rechtsrahmen des Themas, auch unter Hervorhebung menschenrechtlicher Bezüge, institutionelles Recht („Gesundheit als Sicherheitsrisiko?“) sowie die Grenzen eines genuin rechtlichen Ansatzes. Die Autoren sind den Disziplinen Völkerrecht, Public Health, Politikwissenschaften und Anthropologie zuzuordnen. Mit Beiträgen von: Elif Askin, Susan L. Erikson, André den Exter, Robert Frau, Wolfgang Hein, Bonnie Kaiser, Hunter Keys, Michael Marx, Edefe Ojomo, Ilja Richard Pavone, Mateja Steinbrück Platise, Christian R. Thauer, Leonie Vierck, Pedro A. Villarreal, A. Katarina Weilert

Bisimulation, Logic and Reachability Analysis for Markovian Systems

In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verification is called stochastic reachability analysis, while in computer science this is called probabilistic model checking (PMC). In the context of this work, we consider the two terms interchangeable. It is worthy to note that PMC has been mostly considered for discrete systems. Therefore, there is an issue of improving the application of computer science techniques in the formal verification of continuous stochastic systems. We present a new probabilistic logic of model theoretic nature. The terms of this logic express reachability properties and the logic formulas express statistical properties of terms. Moreover, we show that this logic characterizes a bisimulation relation for continuous time continuous space Markov processes. For this logic we define a new semantics using state space symmetries. This is a recent concept that was successfully used in model checking. Using this semantics, we prove a full abstraction result. Furthermore, we prove a result that can be used in model checking, namely that the bisimulation preserves the probabilities of the reachable sets

Flow Logic

Flow networks have attracted a lot of research in computer science. Indeed, many questions in numerous application areas can be reduced to questions about flow networks. Many of these applications would benefit from a framework in which one can formally reason about properties of flow networks that go beyond their maximal flow. We introduce Flow Logics: modal logics that treat flow functions as explicit first-order objects and enable the specification of rich properties of flow networks. The syntax of our logic BFL* (Branching Flow Logic) is similar to the syntax of the temporal logic CTL*, except that atomic assertions may be flow propositions, like $> \gamma$ or $\geq \gamma$, for $\gamma \in \mathbb{N}$, which refer to the value of the flow in a vertex, and that first-order quantification can be applied both to paths and to flow functions. We present an exhaustive study of the theoretical and practical aspects of BFL*, as well as extensions and fragments of it. Our extensions include flow quantifications that range over non-integral flow functions or over maximal flow functions, path quantification that ranges over paths along which non-zero flow travels, past operators, and first-order quantification of flow values. We focus on the model-checking problem and show that it is PSPACE-complete, as it is for CTL*. Handling of flow quantifiers, however, increases the complexity in terms of the network to ${\rm P}^{\rm NP}$, even for the LFL and BFL fragments, which are the flow-counterparts of LTL and CTL. We are still able to point to a useful fragment of BFL* for which the model-checking problem can be solved in polynomial time. Finally, we introduce and study the query-checking problem for BFL*, where under-specified BFL* formulas are used for network exploration

Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for the orbit relation. Dynamic symmetry reduction calculates representatives of equivalence classes of states dynamically and thus avoids the construction of the orbit relation. In this paper, we present a new efficient model checking algorithm based on dynamic symmetry reduction. Our experiments show that the algorithm is very fast and allows the verification of larger systems. We additionally implemented the use of state symmetries for symbolic symmetry reduction. To our knowledge we are the first who investigated state symmetries in combination with BDD based symbolic model checking

Measurable Safety of Automated Driving Functions in Commercial Motor Vehicles

With the further development of automated driving, the functional performance increases resulting in the need for new and comprehensive testing concepts. This doctoral work aims to enable the transition from quantitative mileage to qualitative test coverage by aggregating the results of both knowledge-based and data-driven test platforms. The validity of the test domain can be extended cost-effectively throughout the software development process to achieve meaningful test termination criteria

Towards the integration of functions, relations and types in an AI programming language

This paper describes the design and implementation of the programming language PC-Life. This language integrates the functional and the Logic-oriented programming style and feature types supporting inheritance. This combination yields a language particularly suited to knowledge representation, especially for application in computational linguistics

On the complexity of determinizing monitors

We examine the determinization of monitors. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly-exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then they can be exponentially more succinct than their CCS process form.peer-reviewe