نتایج جستجو برای: ivficsi cycles

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

Journal: :Telecommunication Systems 2000
Douglas W. Bass Ivan Hal Sudborough

The binary hypercube Qn has small diameter, but a relatively large number of links. Because of this, efforts have been made to determine the maximum number of links that can be deleted without increasing the diameter. However, the resulting networks are not vertex-symmetric. We propose a family of vertex-symmetric spanning subnetworks of Qn, whose diameter differs from that of Qn by only a smal...

2002
Carl Pearcy Srdjan Petrović SRDJAN PETROVIĆ

(1) ‖p(T )‖ ≤M sup{|p(ζ)| : |ζ| = 1} ∀ polynomial p, and to be power bounded (notation T ∈ (PW)) if (1) holds for every polynomial of the special form p(ζ) = ζ where n is a positive integer. If T ∈ (PB) [resp., T ∈ (PW)], then there is a smallest number M which satisfies (1) [resp., (1) restricted]. This number will be called the polynomial bound of T [resp., the power bound of T ] and denoted ...

2005
Fajie Li Reinhard Klette

We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The curve’s length is defined to be that of the minimum-length polygonal curve (MLP) fully contained and complete in the tube of the curve. So far only one general algorithm called rubber-band algorithm was known ...

Journal: :Journal of Differential Geometry 1989

2013
Ronald J. Gould Kazuhide Hirohata Paul Horn

In this paper, we investigate sufficient conditions on the neighborhood of independent vertices which imply that a graph contains k independent cycles or chorded cycles. This is related to several results of Corrádi and Hajnal, Justesen, Wang, and Faudree and Gould on graphs containing k independent cycles, and Finkel on graphs containing k chorded cycles. In particular, we establish that if in...

2009
Kathryn Hargreaves Samir Siksek

Let N = {1, 2, 3, · · · } denote the natural numbers. Given integers e ≥ 1 and b ≥ 2, let x = ∑n i=0 aib i with 0 ≤ ai ≤ b − 1 (thus ai are the digits of x in base b). We define the happy function Se,b : N −→ N by

2006
Sanghun Kim Seokho Yoon Hyoung-Kee Choi Sun Yong Kim

This paper addresses the frequency offset estimation problem in the presence of the timing error for OFDM-based WLAN systems. When the timing error exists, the correlation value used for the frequency offset estimation could be reduced significantly due to the timing error, resulting in considerable degradation in estimation performance. In this paper, using the coherence phase bandwidth (CPB) ...

2014
Pengfei Chen Yong Qi Di Hou Huachong Sun

To provide a high performance and reliable big data platform, this paper proposes a comprehensive invariant-based performance diagnosis approach named InvarNetX. InvarNet-X not only covers performance anomaly detection but also root cause inference, both of which are conducted under the consideration of operation context of big data applications. The performance anomaly detection procedure is a...

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

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