نتایج جستجو برای: the kth visit

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

Journal: :Repertorium novarum specierum regni vegetabilis 1918

Journal: :Annales Polonici Mathematici 1991

2006
Hao Yu H. YU

In this paper we construct high moment partial sum processes based on residuals of a GARCH model when the mean is known to be 0. We consider partial sums of kth powers of residuals, CUSUM processes and self-normalized partial sum processes. The kth power partial sum process converges to a Brownian process plus a correction term, where the correction term depends on the kth moment μk of the inno...

2015
Mi Seon Kim Yunmi Lee Gi-Ho Sung Ji Hye Kim Jae Gwang Park Han Gyung Kim Kwang Soo Baek Jae Han Cho Jaegu Han Kang-Hyo Lee Sungyoul Hong Jong-Hoon Kim Jae Youl Cho

Cordyceps species including Cordyceps bassiana are a notable anti-cancer dietary supplement. Previously, we identified several compounds with anti-cancer activity from the butanol fraction (Cb-BF) of Cordyceps bassiana. To expand the structural value of Cb-BF-derived anti-cancer drugs, we employed various chemical moieties to produce a novel Cb-BF-derived chemical derivative, KTH-13-amine-monop...

2009
Hjalmar Olsson

This Master’s Thesis investigates the potential benefits and challenges of using a Voice User Interface as an additional access point to a service otherwise only available as a web-based cell phone client using a Graphical User Interface. The service used in the Thesis is a furniture advertisement service. Two different user groups are thought of as the potential end users of this so-called Spo...

2016
Kirk P. Gardner Don Sheehy

Let B be a square region in the plane. We give an efficient algorithm that takes a set P of n points from B, and produces a set M ⊂ B with the property that the distance to the second nearest point in M approximates the distance to the kth nearest point of P . That is, there are constants α, β ∈ R such that for all x ∈ B, we have αdP,k(x) ≤ dM,2(x) ≤ βdP,k(x), where dM,2 and dP,k denote the sec...

2010
Arthur M. Hobbs

In this paper we show that the connectivity of the kth power of a graph of connectivity m is at least km if the kth power of the graph is not a complete graph. Also, we. prove th at removing as many as k 2 vertices from the kth power of a graph (k ;;. 3) leaves a Hamiltonian graph, and that removing as many as k 3 vertices from the kth power of a graph (k;;' 3) leaves a Hamiltonian con nected g...

Journal: :The American Mathematical Monthly 2019

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

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