نتایج جستجو برای: strong

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

2003

Paavolainen et. al. (1991) reported that national level cross-country skiers who engaged in explosive type strength training in addition to their normal training, were able improve their force-times i.e. improve their ability to produce a given amount of force in shorter time. This was also described by a significant improvement of jump heights in both static and counter movement jumps, whereas...

Journal: :Discrete Mathematics 2005
Khee Meng Koh K. L. Ng

For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number d (G) of G is defined by → d (G)=min{d(D) |D ∈ D(G)}. In this paper, we study the orientation numbers of a family of graphs, denoted by G(p, q;m), that are obtained from the disjoint union of two complete graphs Kp a...

2007
Lajos Kossuth MICHAEL VOIT

Suitable normalization of time{homogeneous rotation{invariant random walks on unit spheres S d R d+1 for d > 2 leads to a central limit theorem with a Gaussian limit measure. This paper is devoted to an associated Edgeworth expansion with respect to the total variation norm. This strong type of convergence is diierent from the classical case. The proof is performed in the more general setting o...

Journal: :IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 1996
Nikos D. Sidiropoulos John S. Baras Carlos Alberto Berenstein

Morphological openings and closings can be viewed as consistent MAP estimators of smooth random binary image signals immersed in i.i.d. clutter, or suffering from i.i.d. random dropouts. We revisit this viewpoint under much more general assumptions and show that, quite surprisingly, the above interpretation is still valid.

2018
Domingo G'omez-P'erez Min Sha Andrew Tirkel

In this paper, we focus on linear complexity measures of multidimensional sequences over finite fields, generalizing the one-dimensional case and including that of multidimensional arrays (identified with multidimensional periodic sequence) as a particular instance. A cryptographically strong sequence or array should not only have a high linear complexity, it should also not be possible to decr...

2007
Bezalel Peleg Ariel D. Procaccia

Implementation theory tackles the following problem: given a social choice correspondence, find a decentralized mechanism such that for every constellation of the individuals’ preferences, the set of outcomes in equilibrium is exactly the set of socially optimal alternatives (as specified by the correspondence). In this paper we are concerned with implementation by mediated equilibrium; under s...

Journal: :Discrete Mathematics 1992
Olivia M. Carducci

We define a diamonded odd cycle to be an odd cycle C with exactly two chords and either a) C has length five and the two chords are non-crossing; or b) C has length greater than five and has chords (x,y) and (x,z) with (y,z) an edge of C and there exists a node w not on C adjacent to y and C, but not x. In this paper, we show that given a diamonded odd cycle-free graph G, G is perfect if and on...

Journal: :Math. Comput. 2005
Joshua Knauer Jörg Richstein

A prime p satisfying the congruence 2p−1 ≡ 1 (mod p) is called a Wieferich prime. Although the number of Wieferich primes is believed to be infinite, the only ones that have been discovered so far are 1093 and 3511. This paper describes a search for further solutions. The search was conducted via a large scale Internet based computation. The result that there are no new Wieferich primes less th...

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

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