نتایج جستجو برای: multiplicative calculus

تعداد نتایج: 76008  

1993
Nick Benton Gavin M. Bierman Valeria de Paiva Martin Hyland

In this paper we consider the problem of deriving a term assignment system for Girard's Intuitionistic Linear Logic for both the sequent calculus and natural deduction proof systems. Our system di ers from previous calculi (e.g. that of Abramsky [1]) and has two important properties which they lack. These are the substitution property (the set of valid deductions is closed under substitution) a...

Journal: :computational methods for differential equations 0
abbas saadatmandi university of kashan, kashan, iran tahereh abdolahi-niasar university of kashan, kashan, iran

the euler-lagrange equation plays an important role in the minimization problems of the calculus of variations. this paper employs the differential transformation method (dtm) for finding the solution of the euler-lagrange equation which arise from problems of calculus of variations. dtm provides an analytical solution in the form of an infinite power series with easily computable components. s...

2015
Zhaojuan Wang Shengfan Zhou Z. J. Wang S. F. Zhou

In this paper we study the asymptotic dynamics of the stochastic strongly damped wave equation with multiplicative noise under homogeneous Dirichlet boundary condition. We investigate the existence of a compact random attractor for the random dynamical system associated with the equation.

1997
Peter Imkeller

Let u(t; x); t 2 R; be an adapted process parametrized by a variable x in some metric space X, (!; dx) a probability kernel on the product of the probability space and the Borel sets of X. We deal with the question whether the Stratonovich integral of u(:; x) with respect to a Wiener process on and the integral of u(t; :) with respect to the random measure (:; dx) can be interchanged. This ques...

We define a new type of spectrum, called δ-approximate spectrum, of an element a in a complex unital Banach algebra A and show that the δ-approximate spectrum σ_δ (a) of a is compact. The relation between the δ-approximate spectrum and the usual spectrum is investigated. Also an analogue of the classical Gleason-Kahane-Zelazko theorem is established: For each ε>0, there is δ>0 such that if ϕ is...

2005
Robert Granger

This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension fields essentially decomposes as a product of algebraic tori, whose properties allow for improved communication efficiency. Part I of this thesis ...

Journal: :bulletin of the iranian mathematical society 2015
e. anjidani

we define a new type of spectrum, called δ-approximate spectrum, of an element a in a complex unital banach algebra a and show that the δ-approximate spectrum σ_δ (a) of a is compact. the relation between the δ-approximate spectrum and the usual spectrum is investigated. also an analogue of the classical gleason-kahane-zelazko theorem is established: for each ε>0, there is δ>0 such that if ϕ is...

For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...

2015
V. Michele Abrusci Roberto Maieli

This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. de-sequentialized proofs, of linear logic (LL). It first provides a syntax for proof structures (PSs) of the cyclic multiplicative and additive fragment of linear logic (CyMALL). A PS is an oriented graph, weighted by boolean monomial weights, whose conclusions Γ are endowed with a cyclic order σ....

2001
Tsutomu Fujinami

The structure of objects employed in the study of Natural Language Semantics has been increasingly being complicated to represent the items of information conveyed by utterances. The complexity becomes a source of troubles when we employ those theories in building linguistic applications such as speech translation system. To understand better how programs operating on semantic representations w...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید