نتایج جستجو برای: we prove that

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

‎In this work we prove Malliavin differentiability for the solution to an SDE with locally Lipschitz and semi-monotone drift‎. ‎To prove this formula‎, ‎we construct a sequence of SDEs with globally Lipschitz drifts and show that the $p$-moments of their Malliavin derivatives are uniformly bounded‎.

Journal: :journal of electrical and computer engineering innovations 2014
fatemeh baghernejad nasour bagheri masoumeh safkhani

in this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by jannati and falahati (so-called jf). we prove that an adversary can recover key bits of jf protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. in addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

Journal: :journal of sciences, islamic republic of iran 2014
b. mohammadzadeh

let s be a locally compact foundation semigroup with identity and                          be its semigroup algebra. let x be a weak*-closed left translation invariant subspace of    in this paper, we prove that  x  is invariantly  complemented in   if and  only if  the left ideal  of    has a bounded approximate identity. we also prove that a foundation semigroup with identity s is left amenab...

Journal: :bulletin of the iranian mathematical society 2012
ali tavakoli alireza abdollahi howard e. bell

let $r$ be an infinite ring. here we prove that if $0_r$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin x}$ for every infinite subset $x$ of $r$, then $r$ satisfies the polynomial identity $x^n=0$. also we prove that if $0_r$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in x}$ for every infinite subset $x$ of $r$, then $x^n=x$ for all $xin r$.

In this paper, we explain a new generalized contractive condition for multivalued mappings and prove a fixed point theorem in metric spaces (not necessary complete) which extends some well-known results in the literature. Finally, as an application, we prove that a multivalued function satisfying a general linear functional inclusion admits a unique selection fulfilling the corresp...

2003
S. SERRA

In the general case of multilevel Toeplitz matrices, we recently proved that any multilevel circulant preconditioner is not superlinear (a cluster it may provide cannot be proper). The proof was based on the concept of quasi-equimodular matrices, although this concept does not apply, for example, to the sine-transform matrices. In this paper, with a new concept of partially equimodular matrices...

2016
Joseph Vidal-Rosset Johan van Benthem Gerhard Heinzmann Manuel Rebuschi Henk Visser

Joseph Vidal-Rosset. Does Gödel’s Incompleteness Theorem Prove That Truth Transcends Proof ?. Johan van Benthem, Gerhard Heinzmann, Manuel Rebuschi, Henk Visser The Age of Alternative Logics Assessing Philosophy of Logic and Mathematics Today, 23, Springer Netherlands, pp.51-73, 2006, <10.1007/978-1-4020-50127 5>. . <h...

Journal: :Molecular genetics and metabolism 2000
U Mittwoch

The dogma that male and female embryos develop in identical fashion until SRY initiates Sertoli cell differentiation in the hitherto bipotential gonad is in need of reevaluation in the light of data that do not fit into this scheme. One of the exceptions that proves the rule of sex determination is true hermaphroditism, the existence of individuals with both testicular and ovarian tissue. Furth...

Let $R$ be an infinite ring. Here we prove that if $0_R$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin X}$ for every infinite subset $X$ of $R$, then $R$ satisfies the polynomial identity $x^n=0$. Also we prove that if $0_R$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in X}$ for every infinite subset $X$ of $R$, then $x^n=x$ for all $xin R$.

Fatemeh Baghernejad Masoumeh Safkhani, Nasour Bagheri

In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

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

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