نتایج جستجو برای: semi weak

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

In this paper first we introduce the notion of weak $Gamma$-(semi)hypergroups, next some classes of equivalence relations which are called good regular and strongly good regular relations are defined.  Then we investigate some properties of this kind of relations on weak $Gamma$-(semi)hypergroups.

Journal: :Missouri Journal of Mathematical Sciences 2006

Journal: :علوم 0

in this note we introduce the notion of weak mccoy rings as a generalization of mccoy rings, and investigate their properties. also we show that, if is a semi-commutative ring, then is weak mccoy if and only if is weak mccoy.

‎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: :Stochastic Processes and their Applications 1982

2005
Heiko Stamer

This paper revisits a public key cryptosystem which is based on finite string-rewriting systems. We consider a new approach for cryptanalysis of such proposals—the so-called completion attack. If a particular kind of weak key is generated, then a passive adversary is able to retrieve secret messages with a significant probability. Our idea can be applied to other rewriting based cryptosystems a...

2007
Hans Zantema Johannes Waldmann

We present a new method for automatically proving termination of term rewriting and string rewriting. It is based on the wellknown idea of interpretation of terms in natural numbers where every rewrite step causes a decrease. In the dependency pair setting only weak monotonicity is required for these interpretations. For these we use quasiperiodic functions. It turns out that then the decreasin...

2010
Wenkui Ding Tao Qin Xu-Dong Zhang

This paper is concerned with a new task of ranking, referred to as “supplementary data assisted ranking”, or “supplementary ranking” for short. Different from conventional ranking, in the new task, each query is associated with two sets of objects: the target objects that are to be ranked, and the supplementary objects whose orders are not of our interest. Existing learning to rank approaches (...

2007
V. J. MIZEL

where Q <= Rm is a bounded domain, JS?W denotes m-dimensional Lebesgue measure, (p = (<p\..., (p) is a continuous transformation from Q to Rn (m ^ n) belonging to some Sobolev space W x p' (Q), and (px is the (almost everywhere defined) matrix function (d^/oxj). Here ƒ is a realvalued function o n Q x i ? n x M „ x m , where Mnxm is the space o f n x m matrices. Such integrals arise in the anal...

2015
Panupong Pasupat Percy Liang

Two important aspects of semantic parsing for question answering are the breadth of the knowledge source and the depth of logical compositionality. While existing work trades off one aspect for another, this paper simultaneously makes progress on both fronts through a new task: answering complex questions on semi-structured tables using question-answer pairs as supervision. The central challeng...

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

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