We prove that the category of vector bundles over a fixed smooth manifold and its corresponding category of convenient modules are models for intuitionistic differential linear logic. The exponential modality is modelled by composing the jet comonad, whose Kleisli category has linear differential operators as morphisms, with the more familiar distributional comonad, whose Kleisli category has smooth maps as morphisms. Combining the two comonads gives a new interpretation of the semantics of differential linear logic where the Kleisli morphisms are smooth local functionals, or equivalently, smooth partial differential operators, and the codereliction map induces the functional derivative. This points towards a logic, and hence a computational theory of non-linear partial differential equations and their solutions based on variational calculus.

Entamoeba histolytica is a major cause of dysentery that leads to a high level of morbidity and mortality, especially in developing countries. Calmodulin-like calcium binding protein EhCaBP3 of E. histolytica is directly involved in disease mechanisms with roles in cytoskeleton dynamics and scission during erythrophagocytosis in a calcium dependent fashion. Interestingly, EhCaBP3 is also present in the nucleus of E. histolytica. We have used a transfected cell system to show that EhCaBP3 is capable of calcium dependent nucleocytoplasmic trafficking. Our data confirms and extends recent findings suggesting presence of a calcium dependent nuclear transport pathway in E. histolytica.

This study employed a narrative review and a meta-analysis to synthesize the literature on mobile-assisted language learning (MALL). Following a systematic retrieval of literature from 2008 to 2017, 17 studies with 22 effect sizes were included based on predetermined inclusion and exclusion criteria. By categorizing the characteristics of the studies retrieved, the narrative review revealed a detailed picture of MALL research in terms of the language aspects targeted, theoretical frameworks addressed, mobile technologies adopted, and multimedia components used. The qualitative review helped to contextualize and interpret the results found in the meta-analysis, which revealed a large effect for mobile technologies in language learning, identified three variables (i.e. type of activities, modality of delivery, and duration of treatment) that might influence the effectiveness of mobile technologies, and confirmed the existence of a redundancy effect and a novelty effect in MALL practice. Implications for future research and pedagogy are discussed.

In this paper, we develop a new method for evaluating the reliability polynomial of a hammock network. The method is based on a homogeneous absorbing Markov chain and provides the exact reliability for networks of width less than 5 and arbitrary length. Moreover, it produces a lower bound for the reliability polynomial for networks of width greater than or equal to 5. To investigate how sharp this lower bound is, we compare our method with other approximation methods and it proves to be the most accurate in terms of absolute as well as relative error. Using the fundamental matrix, we also calculate the average time to absorption, which provides the mean length of a network that is expected to work.

This paper deals with pricing formulae for a European call option and an exchange option in the case where underlying asset price processes are represented by stochastic delay differential equations with jumps (hereafter “SDDEJ”). We introduce a new model in which Poisson jumps are added in stochastic delay differential equations to capture behaviors of an underlying asset process more precisely. We derive explicit pricing formulae for the European call option and the exchange option by proving a Lemma on the conditional expectation. Finally, we show that our “SDDEJ” model is meaningful through some numerical experiments and discussions.

There is a set of n bandits and at every stage, two of the bandits are chosen to play a game, with the result of a game being learned. In the “weak regret problem,” we suppose there is a “best” bandit that wins each game it plays with probability at least p > 1/2, with the value of p being unknown. The objective is to choose bandits to maximize the number of times that one of the competitors is the best bandit. In the “strong regret problem”, we suppose that bandit i has unknown value vi, i = 1, …, n, and that i beats j with probability vi/(vi + vj). One version of strong regret is interested in maximizing the number of times that the contest is between the players with the two largest values. Another version supposes that at any stage, rather than choosing two arms to play a game, the decision maker can declare that a particular arm is the best, with the objective of maximizing the number of stages in which the arm with the largest value is declared to be the best. In the weak regret problem, we propose a policy and obtain an analytic bound on the expected number of stages over an infinite time frame that the best arm is not one of the competitors when this policy is employed. In the strong regret problem, we propose a Thompson sampling type algorithm and empirically compare its performance with others in the literature.