Search

The Japanese public broadcaster's global English-language TV service uses practices that can be seen as “pragmatic explicitation" (Klaudy, 2011, pp. 106-107) or “information addition" (Hasegawa, 2012, p. 179) in its creation of scripts for its main news show in order to help non-Japanese viewers who are unfamiliar with Japan to understand news that emanates from Japan (NHK World, 2015, pp. 60-61). Many of the news stories contain voice-over where the source language is Japanese. In light of (a) the aforementioned practices and (b) literature suggesting that voice-over translation should give an “almost word for word" rendering (Franco, Matamala, and Orero, 2013, p. 26), the authors investigated the extents of “pragmatic explicitation" (Klaudy, 2011, pp. 106-107), i.e., “information addition" (Hasegawa, 2012, p. 179), “obligatory explicitation" (Klaudy, 2011, p. 106), and “optional explicitation" (Klaudy, 2011, p. 106) in the show's voice-over translation and the extent to which such phenomena may cause the voice-over audio to diverge from being “a faithful, literal, authentic and complete version of the original audio" (Franco, Matamala, & Orero, 2013, p. 26). Based on their findings, they propose a Japanese-to-English news voice-over translation strategy that involves trying to limit explicitation to “obligatory explicitation" (Klaudy, 2011, p. 106).

This article sheds light on an unresearched translation modality that forms a pillar of program production for Japan's publicly funded, globally aired, round-the-clock English-language television channel, NHK World-Japan TV. The modality in question is the translation of presenter scripts written in one language(Japanese)and delivered to camera exclusively in another(English). Through a critical self-reflexion on the lead author's construction and application of translation guidelines aimed largely at optimizing comprehensibility for viewers of the NHK World-Japan TV music show J-MELO, new lines of Translation Studies research into this underrepresented modality and its significance in the wider context of international TV broadcasting are suggested.

Let P be a countably additive probability on a standard space, and let C be a tail subfield. Though no disintegration of P with respect to C that is countably additive need exist, there always is one which is finitely additive. A surprising discovery of de Finetti, [5, p. 205] (see also [4]), leads to the conclusion that probability measures which are not countably additive need not possess any disintegration with respect to certain partitions. Even countably additive, fair-coin-tossing measure possesses no proper, measurable, countably additive disintegration with respect to the usual tail field [3]. One of the questions that then arises concerns the existence of any disintegration for this and similar situations. For standard measures and tail fields, an affirmative answer is provided by the theorem below. But first a little notation and two or three definitions are needed. Throughout this note, c& is a subsigma field of a sigma field S3 of subsets of a set 0, and P is a countably additive probability defined for 63. For each w E Q, let 6(w) be the intersection of all A such that X E A E ie. Whether or not d(w) E C, call 6(w) an 6-atom, and verify that the 6atoms constitute a partition H11 of a2. A function a of two variables, h E UI-I, B E @ is a measurable disintegration of P given a, if: (i) For each h, a( I h) is a probability on J3, possibly finitely additive, which is supported by h; (ii) For each B, a(B j d((w)) is a version of the usual P-conditional-expectation of B given d. A tail field is the intersection of a decreasing sequence of subsigma fields of S3 each of which is countably generated. THEOREM 1. Let (il, 'q) be a standard space or, more generally, a Lusin space, and let C, be a tail subfield of 'M. Then every countably additive probability, P, on 6j3 possesses a measurable disintegration given d(. If the conclusion of Theorem 1 holds for C6, call C, tame. LEMMA 1. Countably generated eS's in Lusin spaces are tame. Received by the editors July 6, 1982 and, in revised form, October 6, 1982. 1980 Mathematics Subject Classification. Primary 28A35, 28A50, 60G05.

Let $x_n(t)$ be the position of a particle in one dimension that switches between uniform velocities $+n$ and $-n$ at the jump times of a Poisson process with intensity $n^2$. In this note are constructed realizations of the processes $x_n(t)$ that converge almost surely to Brownian motion, uniformly on the unit time interval.

A decision maker is seen to be coherent in the sense of de Finetti if, and only if, his probabilities are computed in accordance with some finitely additive prior. If a bounded loss function is specified, then a decision rule is extended admissible (i.e., not uniformly dominated) if and only if it is Bayes for some finitely additive prior. However, if an improper countably additive prior is used, then decisions need not cohere and decision rules need not be extended admissible. Invariant, finitely additive priors are found and their posteriors calculated for a class of problems including translation parameter problems.

A gambler seeks to maximize his probability of reaching a goal in a game where he is allowed at each stage to stake any amount of his current fortune. He wins each bet with a certain fixed probability $w$. Lester E. Dubins and Leonard J. Savage found optimal strategies for a gambler who knows $w$. Here strategies are found which are uniformly nearly optimal for all $w$ and, therefore, also for a gambler with an unknown $w$.

We show that every discrete-time martingale can be interpolated to give a continuous, continuous-time martingale, and provide a necessary and sufficient condition for the existence of an interpolated martingale with no flat spots.

In this paper we examine the interchangeability/substitutability problem for two recoverable items that fail at a single location. We assume the failure processes for each type of item are independent, stationary Poisson processes. We also assume the repair times are exponentially distributed. Furthermore, we assume that the system is a closed system, that is, no items are added to or deleted from the system. We first consider a discrete-time problem and show that this problem is a Markovian decision problem. We then show that for this problem there exist optimal stationary Markov control policies. Next we formulate a continuous time model and show how to find the optimal stationary Markov control policy using linear programming. Unfortunately, this approach is impractical for solving most real problems. Consequently we have established and explored some of the properties that we feel an optimal policy should possess. A discussion of these properties is given in Section IV. Lastly, we will describe a heuristic that can be used to find a good policy. This method is an efficient simulation search method that finds policies having the properties we conjecture an optimal policy should possess. (Author)

Conditions are given for the formal posterior of an improper prior to be coherent and applied to translation models. An example is given of a proper countably additive statistical model and a finitely additive prior for which there is no posterior.

A theorem of de Finetti states that if odds are posted on each set in a finite partition of a probability space, then either the odds are consistent with a finitely additive probability measure or a sure win is possible. A generalization of this result is proved which in turn implies a generalization of Von Neumann's theorem on the existence of the value of a game. Also, two horse race examples are considered.

Let $S(X,l)=\sum_{N(c)\leq X}\tilde{g}(c)\Lambda(c)(\frac{c}{|c|})^l$ where $\tilde{g}(c)$ is the normalized cubic Gauss sum for an integer $c\equiv 1\pmod{3}$ of the field $\mathbb{Q}(\sqrt{-3})$. It is shown that $S(X,l)\ll_{\varepsilon} X^{5/6+\ep}+|l|X^{3/4+\varepsilon}$, for every $l\in\mathbb{Z}$ and any $\varepsilon>0$. This improves on the estimate established by Heath-Brown and Patterson in demonstrating the uniform distribution of the cubic Gauss sums around the unit circle. When $l=0$ it is conjectured that the above sum is asymptotically of order $X^{5/6}$, so that the upper bound is essentially best possible. The proof uses a cubic analogue of the author's mean value estimate for quadratic character sums.

Free to read at publisher's site. This paper presents a dialogical tool for the advancement of learning analytics implementation for student retention in Higher Education institutions. The framework was developed as an outcome of a project commissioned and funded by the Australian Government’s Office for Learning and Teaching. The project took a mixed-method approach including a survey at the institutional level (n = 24), a survey of individual teaching staff and other academics with an interest in student retention (n = 353), and a series of interviews (n = 23). Following the collection and analysis of these data an initial version of the framework was developed and presented at a National Forum attended by 148 colleagues from 43 different institutions. Participants at the forum were invited to provide commentary on the usefulness and composition of the framework which was subsequently updated to reflect this feedback. Ultimately, it is envisaged that such a framework might offer institutions an accessible and concise tool to structure and systematize discussion about how learning analytics might be implemented for student retention in their own context. © 2016 Online Learning Consortium. All rights reserved.

Directed motion or ratchet-like behavior in many molecular scale systems is a consequence of diffusion mediated transport. The Brownian motor serves as a paradigm. The Parrondo Paradox is a pair of coin toss games, each of which is fair, or even losing, but become winning with a schedule of playing them in alternation. It has been proposed as a discrete analog of the Brownian motor. We examine the relationship between these two systems. We discover a class of Parrondo games with unusual ratchet-like behavior and for which diffusion plays a fundamentally different role than it does in the Brownian motor. Detailed balance is an important feature in these considerations. The Brownian motor depends on details of the potential landscape in the system but the Parrondo game is decided on the potential difference alone. There are winning Parrondo games whose Brownian motor analogs move in the opposite direction. A general framework is discussed in section 7. The original Parrondo game, here in section 7.2, is completely determined by detailed balance.

Translators can, and do, manipulate translation processes for ideologically motivated reasons (Fawcett & Munday, 2011, pp. 137-141). Ideologically motivated “rewriting” (Bassnett & Lefevere, 1992, p. xi) in translation into Japanese of non-fiction texts about Japan can, at least when it takes the form of omission of ST passages, have a misleading impact on the way Japanese people believe people in other countries see them (Cherry, 1987, p 14). This article proposes and tests a methodology for swift, simple identification and analysis of such rewriting—even in lengthy texts, e.g., books. The methodology draws on Barnard’s intensity-analysis technique (Barnard, 2000) and his concept of an “ideological filter” (Barnard, 2002, p. 149). The test source text (ST) is the opening chapter of the English-language book Princess Masako: Prisoner of the Chrysanthemum Throne (Hills, 2006). The test target text (TT) is the corresponding chapter of an unpublished Japanese translation (in the form of printer’s proofs) of the book by a Japanese publisher (Hills, 2007). The methodology proved effective for highlighting patterns of possibly ideologically motivated ST-TT semantic divergence. For instance, the results reveal systematic omission of ST content that undermines the image of the imperial family. Applying Barnard’s concept of an “ideological filter” (Barnard, 2002, p. 149) appears to be straightforward. The methodology offers great promise in enabling instances of apparently ideologically motivated rewriting in translation into Japanese of non-fiction English-language to be identified, tabulated, and further analyzed. One of its chief merits is that it semi-automates the process of identification and tabulation.

Let ε>0. It is proved that the range (x, x+x1/2+ε) has such an integer that one of its prime factors p≥x11/12-ε.

In this paper, we (a) explain how translators can benefit from creating their own glossaries; and (b) evaluate how easily a translation glossary can be created from Japanese source text using free software applications. As our study shows, a major hurdle arises from the fact that Japanese text does not include spaces; it must be segmented, i.e., broken into “usable chunks” (Fahey, 2016), before a concordancer (in our case, AntConc 3.2.4) can be used to analyze it for glossary creation. We segmented our Japanese text using an application (ChaSen 2.1) designed for this purpose. This application’s output was problematic, forcing us to devise workarounds that became labour-intensive and time-consuming. Our completed glossary (shown in Appendix 1) is fit for purpose, but the complications in the process of creating it call into question the feasibility of using free software to make translation glossaries from text written in Japanese.

(1976). De Finetti's Theorem on Exchangeable Variables. The American Statistician: Vol. 30, No. 4, pp. 188-189.

This paper investigates the relation between ex-dividend stock price behavior and arbitrage oppor tunities. In a continuous trading, frictionless economy, the authors demonstrate that it is possible for the ex-dividend stock price drop to differ from the dividend, and still short-term traders cannot gene rate arbitrage profits. The argument is independent of transactions c osts. The relevance of this insight to estimating the marginal tax br acket based on ex-dividend stock price drops is explored. Furthermore , this insight is also applied to the area of option pricing in which the special class of escrowed dividend stock price processes is stud ied. The authors show that most elements from this class of stock pri ce processes generate invalid option-pricing formulas. Copyright 1988 by the University of Chicago.

The effect of addition of free non-absorbing polymer [poly(ethylene oxide)(PEO) with MW= 20 000, 35 000 and 90 000] on the stability of concentrated (40% w/w) sterically stabilised polystyrene latex dispersions has been investigated using rheological measurements. Steady-shear, creep-compliance and elastic-modulus measurements were carried out to obtain the following rheological parameters: plastic viscosity ηPL, extrapolated yield value τβ, residual viscosity η0 and shear modulus G0. With the exception of ηPL all the other parameters showed and increase above a certain critical PEO concentration, which decreased with increase of MW of the added polymer. This critical concentration was lower than the flocculation concentration obtained using a dilute dispersion. However, at higher PEO concentrations there was some indication of a reduction in η0 values, indicating reduction in the extent of flocculation. Experiments whereby the PEO concentration was reduced by adding more latex indicated some irreversibility of the flocculation process. Three theories were used to calculate the depth of the minimum in the interaction-free-energy–particle-separation curves in the presence of the free polymer. The value for the free-energy minimum has been used to calculate the yield value and comparison was made with the experimental results.

Some notions of countable additivity, meaningful for an expectation whose domain is an arbitrary linear space of bounded, real-valued functions, are studied. For linear spaces or ordered linear spaces which do not possess the structure of a vector lattice important in the development of the Lebesgue-Daniell integralthere is to our knowledge no study of continuous or countably additive linear functionals other than the seminal contributions of de Finetti [1 and 2]. The present paper was inspired mainly by de Finetti's writings. For simplicity, linear subspaces L of lo (Q), the space of bounded R-valued (realvalued) functions defined on a nonempty set Q, will be considered and, on L, only linear functions Q, necessarily nonnegative, which satisfy f C L and a < f < b everywhere imply a < Qf < b. Call such a functional a prevision, a term borrowed from de Finetti [1 and 2]. With the help of the Hahn-Banach extension theorem, it is simple to verify that each prevision on L is the restriction to L of a prevision P on lo. Let Ap be the collection of all L such that P restricted to L is continuous or countably additive. In [1, Chapter 5.34 and 2, Vol. 2, Appendix 18.3], de Finetti introduces Ap and initiates the study of its structure. He observes L' c L C Ap implies L' C Ap, and he goes on to state "If L1 and L2 belong (to Ap), then so does L1 + L2 (the linear space of sums X1 + X2, X1 E L1 and X2 c L2)." The present paper developed in large part from the observation that the quoted assertion is erroneous. Several counterexamples, which also illustrate other phenomena, are offered. For the first, [0,1] designates the closed unit interval, C = C[0,11] the space of all continuous R-valued functions with [0,1] as their domain, and A is the usual Lebesgue integral. The indicator of a set is, as usual, the function that assumes the value 1 on the set 0 off the set. The useful convention introduced by de Finetti of designating a set and its indicator by the same letter will usually be adopted here. EXAMPLE 1. Let Wp be an open dense subset of [0,1] with Ap < 1, L1 = C[0, 1], L2 = {t: t C R}, L = L1 + L2 and P(O + t) = AO + t, 0 e C[0, 1]. To formulate the strong sense in which Example 1 is a counterexample, it is necessary to articulate two definitions. If Pfn -? 0 for every decreasing sequence fC e L that converges pointwise to 0, call P m-continuous on L (m for 'monotone'). Let v(L) designate the smallest sigma field of subsets of Q such that f-1 (B) C a(L) Received by the editors February 21, 1983 and, in revised form, August 29, 1983. 1980 Mathematics Subject Cossification. Primary 28C05, 46G12, 60A05.

A player starts at x in (-G, G) and attempts to leave the interval in a limited playing time. In the discrete-time problem, G is a positive integer and the position is described by a random walk starting at integer x, with mean increments zero, and variance increment chosen by the player from [0, 1] at each integer playing time. In the continuous-time problem, the player's position is described by an Ito diffusion process with infinitesimal mean parameter zero and infinitesimal diffusion parameter chosen by the player from [0, 1] at each time instant of play. To maximize the probability of leaving the interval (–G, G) in a limited playing time, the player should play boldly by always choosing largest possible variance increment in the discrete-time setting and largest possible diffusion parameter in the continuous-time setting, until the player leaves the interval. In the discrete-time setting, this result affirms a conjecture of Spencer. In the continuous-time setting, the value function of play is identified.

A characteristic of industry is the prevalence of production processes which yield multiple products. When the costs of producing multiple products are separable, they are readily identified with individual products, so no particular problem arises in assigning a per-unit charge, or cost, for producing each product. Common costs, or joint costs, are costs which cannot be readily identified with individual products. They are especially prominent in extractive, agricultural, and chemical industries, as well as in industries where different grades of the same product are obtained. Furthermore, if the notion of a production process is taken to a more abstract level, it can be argued that common costs are also prevalent in service industries (e.g., postal delivery costs for the delivery of multiple types of mail and telephone service costs associated with providing telephone communication to multiple areas at multiple times of the day).1 In this paper, we consider the problem of allocating common costs in the production of multiple products.2 More precisely, suppose there is a production process which yields n different goods or services (or different grades of the same good or service), and to produce xi units of good i, i