نتایج جستجو برای: convex func

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

2013
Charles D. Warden Noriko Kanaya Shiuan Chen Yate-Ching Yuan

BD-Func (BiDirectional FUNCtional enrichment) is an algorithm that calculates functional enrichment by comparing lists of pre-defined genes that are known to be activated versus inhibited in a pathway or by a regulatory molecule. This paper shows that BD-Func can correctly predict cell line alternations and patient characteristics with accuracy comparable to popular algorithms, with a significa...

In this manuscript, we consider the interpolative contractions mappings via simulation func-tions in the setting of complete metric space. We also express an illustrative example to show the validity of our presented results.

2008
J. LEITNER

In an incomplete Brownian-motion market setting, we propose a convex monotonic pricing functional for nonattainable bounded contingent claims which is compatible with prices for attainable claims. The pricing functional is defined as the convex conjugate of a generalized entropy penalty functional and an interpretation in terms of tracking with instantaneously vanishing risk can be given. 1. In...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

Journal: :Acta Arithmetica 2021

In 2010, Cilleruelo, Ruzsa, and Vinuesa established a surprising connection between the maximum possible size of generalized Sidon set in first $N$ natural numbers optimal constant an “analogous” problem concerning nonnegative-valued func

Journal: :PRIMUS - INFORMATIKA, PRAVO, EKONOMIJA, BANKARSTVO 2016

2016
Felipe Kenji Sudo Gilberto Sousa Alves Denise Madeira Moreira Jerson Laks Eliasz Engelhardt

Background Staging vascular cognitive impairment (VCI) might be useful for sample selection in clinical trials and for guiding clinical decision-making. Clinical dementia rating (CDR) has been applied for staging cognitive impairments of different etiologies, but it may underestimate severity of non-Alzheimer's disease cognitive deficits. Methods Out of a total of 147 elderly subjects, 23 (me...

Journal: :Fundamenta Mathematicae 2022

We consider hyperbolic links that admit alternating projections on surfaces in compact, irreducible 3-manifolds. show that, under some mild hypotheses, the volume of complement such a link is bounded below terms Kauffman bracket func

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

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