نتایج جستجو برای: s kernel

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

Journal: :فیزیک زمین و فضا 0
عبداله سهرابی بیدار استادیار، دانشکده زمین شناسی، دانشگاه تهران، ایران محسن کمالیان دانشیار، پژوهشکده مهندسی ژئوتکنیک، پژوهشگاه بین المللی زلزله شناسی و مهندسی زلزله، تهران، ایران محمد کاظم جعفری استاد، پژوهشکده مهندسی ژئوتکنیک، پژوهشگاه بین المللی زلزله شناسی و مهندسی زلزله، تهران، ایران

it is well established that the seismic ground response of surface topographies may differ from those of free field motion during earthquakes. complex nature of seismic wave scattering by topographical structures can only be solved accurately and economically using advanced numerical methods under realistic conditions. among the numerical methods, the boundary element is a powerful numerical te...

Journal: :Electronic Notes in Discrete Mathematics 2007
Hortensia Galeana-Sánchez Mucuy-kak Guevara

A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)−N there exists an arc from w to N . If every induced subdigraph of D has a kernel, D is said to be a kernel perfect digraph. Minimal non-kernel perfect digraph are called critical kernel imperfect digraph. If F is a set of arcs of D, a semikernel modulo F , S of D is an independent set of vertices of ...

Journal: :مهندسی بیوسیستم ایران 0
مرتضی صادقی استادیار، دانشگاه صنعتی اصفهان مهدی عباسی کارشناسی ارشد، دانشگاه صنعتی اصفهان امین اله معصومی استادیار، دانشگاه صنعتی اصفهان

a knowledge of physical and aerodynamic properties of agricultural crops is important and essentially required for the design and development of a crop's harvesting and post-harvesting equipments. in the present research, experiments were conducted to determine physical and aerodynamic properties of fars province pinto bean namely: kernel size and shape (length, width, thickness, projected...

2007
Sylvie Coste-Marquis Pierre Marquis

In this paper, we are mainly concerned with consistency-based diagnoses for systems represented in a propositional framework. Several characterizations of such diagnoses (mainly minimal diagnoses, kernel diagnoses, MT-diagnoses) have been proposed so far. Unfortunately, minimal diagnoses, and MT-diagnoses characterize only some consistency-based diagnoses and the set of kernel diagnoses for a s...

2010
Hortensia Galeana-Sánchez César Hernández-Cruz

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent set of vertices (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) \N then exists v ∈ N such that d(u, v) ≤ l). A k-kernel is a (k, k − 1)-kernel. We propose an extension of the definition of (k, l)-kernel to (arc-)weighted digraphs, verif...

1995
Harold Widom

The sine kernel K(x, y) := sin(x− y) π(x− y) arises in many areas of mathematics and mathematical physics. There is an extensive literature on the asymptotics of the eigenvalues of Ks, the operator with this kernel on an interval of length s, as s→ ∞, for example [4, 6, 8, 12], and asymptotic fomulas of various kinds were obtained. Some of these derivations were rigorous, others were more heuri...

Objective(s): Metabolic syndrome is a multiplex risk factor for diabetes and cardiovascular disease. Since some dietary fats such as mono-unsaturated fatty acids (MUFA) modify metabolic syndrome components the aim of the present study was to evaluate  the preventive effects of mixture, kernel and hull oils of wild pistachio (WP) (Pistacia atlantica mutica) as good sources of MUFA on different f...

‎In this paper‎, ‎a matrix based method is considered for the solution of a class of nonlinear Volterra integral equations with a kernel of the general form $s^{beta}(t-s)^{-alpha}G(y(s))$ based on the Tau method‎. ‎In this method‎, ‎a transformation of the independent variable is first introduced in order to obtain a new equation with smoother solution‎. ‎Error analysis of this method is also ...

2014
Fan Chung Graham Olivia Simpson

Heat kernel pagerank is a variation of Personalized PageRank given in an exponential formulation. In this work, we present a sublinear time algorithm for approximating the heat kernel pagerank of a graph. The algorithm works by simulating random walks of bounded length and runs in time O( log( ) logn 3 log log( 1) ), assuming performing a random walk step and sampling from a distribution with b...

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

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