15 citations found. Retrieving documents...
H. Royden, Real Analysis, New York: Macmillan, 1963.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Stability, Queue Length and Delay of Deterministic and Stochastic.. - Chang (1994)   (49 citations)  (Correct)

....from the fact that independent random variables are associated. In the following lemma, we establish monotonicity results and bounds for MEPs and MERs. Define the essential supremum of a random variable X, denoted as kXk1 , to be the greatest lower bound of the set fx : Prob(X x) 0g (see [36]) i.e. kXk1 = inffx : Prob(X x) 0g: 24 Thus, Prob(X kXk1 ) 1 and EX kXk1 . Since the function exp( x) 0 1, is strictly increasing and continuous in x, we have that k exp( X)k1 = exp( kXk1 ) Moreover, it is easy to verify that kX 1 k 1 kX 2 k 1 kX 1 X 2 k 1 : Lemma 3.5 ....

H.L. Royden, Real Analysis. New York: Macmillan, 1968.


Lanczos Methods For The Solution Of Nonsymmetric Systems Of.. - Joubert (1992)   (11 citations)  (Correct)

....algorithms is how likely is an occurrence of breakdown, lanczos methods for nonsymmetric systems 5 for a given choice of A and Z. We recall that the matrix Z defines the relationship r (0) Z r (0) To answer this question, we will use results from measure theory (see e.g. 39] [38]) Specifically, we define a field IK to be either the reals IR or the complex numbers I C, and for A, Z 2 IK N ThetaN we ask what is the measure of the set of vectors r (0) 2 IK N which cause hard or soft breakdown. The following sequence of results begins to provide an answer to the ....

H. L. Royden, Real Analysis, second edition. New York: MacMillan, 1968.


Approximations in Dynamic Zero-Sum Games, I - Tidball, Altman (1993)   (Correct)

.... = 1; 2; along which the limsup is obtained and along which a n and b n converge to some actions a and b . Then p(i; a n( b n( ffl) converges (pointwize) to the probability p(i; a ; b ; ffl) as 1 (by (M 1 ) But then it follows from a dominant convergence Theorem ([23] Ch. 11 Sec. 4) and from (B1) that lim 1 X j2I p(i; a n( b n( j)1fj = 2 I n( g = X j2I p(i; a ; b ; j) Delta 0 = 0 which contradicts (9) Hence (B2) is established. For the case of a single player, B2) was introduced as an assumption for several approximating schemes by ....

H. Royden, Real Analysis, New York: Macmillan, 1963.


Efficient Higher-order Neural Networks for Classification and.. - Ghosh, Shin (1995)   (5 citations)  (Correct)

....network defined in [11] is an HPU with a linear activation function, oe( Delta) Delta. This network aims at approximating an unknown function using a truncated Volterra series expansion or Gabor Kolmogorov polynomial expansion [13] It follows from the Stone Weierstrass approximation theorem [20] that such a network is capable of approximating any arbitrary continuous function defined over a compact set [11] This capability is possible due to the large number of degrees of freedom , since each weight corresponds to one degree of freedom. However, an infinite number of terms might be ....

H. L. Royden, Real Analysis , 2nd ed., New York: MacMillan, 1968.


A Formal Theory Of Information: I. Statics - Hillman   (Correct)

....b) R is said to be concave down if for 0 p 1 and s; t 2 (a; b) we have (ps (1 Gamma p)t) p (s) 1 Gamma p) t) A FORMAL THEORY OF INFORMATION: I. STATICS 5 That is, no point on the secant over (s; t) where s t can lie above the graph of . We will need the following useful fact [12] concerning such functions: Lemma 3.1 (Secant Lemma) Suppose is concave down on (a; b) Let x; y; x 0 ; y 0 2 (a; b) with x x 0 y 0 x y y 0 Then (y) Gamma (x) y Gamma x (y 0 ) Gamma (x 0 ) y 0 Gamma x 0 That is, define the secant over (x; y) where x y, ....

....are distinct functions which differ only on a set of measure zero, d(f; g) will vanish, so d is not a metric on the space of integrable functions. However, if we pass to equivalence classes of functions taken up to values on sets of measure zero , then we obtain a true metric. See, for instance, [12] or [14] for details. Just as in the theory of L p spaces, usually no harm will come if one blurs over the distinction between elements and codependency classes, but there are occasions when this distinction is critical. Thus, I insist on giving the metric itself a name distinct from the ....

[Article contains additional citation context not shown here]

H. L. Royden, Real analysis. Third Edition. New York: MacMillan, 1988.


Asymptotic Analysis of Multiple Description Quantizers - Vaishampayan, Batllo (1998)   (11 citations)  Self-citation (Analysis)   (Correct)

....(y) 38) 12 Note that f N (y) converges a:e: to p(y) log p(y) which is integrable since h d ( p) the differential entropy is assumed to be finite. Further, R 1 0 f N (z)dz = Gammah d ( p) Thus f N (y) is integrable. It follows from the generalized Lebesgue convergence theorem [25] that R 1 0 fN (x) log fN (x)dx Gammah d ( p) ....

H. L. Royden, Real Analysis. New York, New York: Macmillan, 1968.


Approximations in Dynamic Zero-Sum Games, I - Tidball, Altman (1993)   (Correct)

No context found.

H. Royden, Real Analysis, New York: Macmillan, 1963.


Capacity Allocation under Noncooperative Routing - Korilis, Lazar, Orda (1997)   (27 citations)  (Correct)

No context found.

H. L. Royden, Real Analysis, 3rd ed. New York: Macmillan, 1988.


Large Deviations, Moderate Deviations, and Queues with.. - Chang, Yao, Zajic (1997)   (Correct)

No context found.

H.L. Royden, Real Analysis. New York: Macmillan, 1968.


Uniqueness of the Polar Factorisation and Projection of a - Vector-Valued Mapping Burton   (Correct)

No context found.

H.L. Royden, Real Analysis, 3rd edn. (New York: Macmillan, 1988.)


Asymptotically Optimal Water-Filling in Vector.. - Viswanath, Tse.. (2001)   (13 citations)  (Correct)

No context found.

H. L. Royden, Real Analysis, 3rd ed. New York: Macmillan, 1988.


Distinguishability and Accessible Information in Quantum Theory - Fuchs (1995)   (10 citations)  (Correct)

No context found.

H. L. Royden, Real Analysis. New York: Macmillan, Second ed., 1963.


Deterministic Annealing for Clustering, Compression.. - Rose (1998)   (6 citations)  (Correct)

No context found.

H. L. Royden, Real Analysis, 3rd ed. New York: Macmillan, 1988.


Undiscounted Value Iteration in Stable Markov Decision Chains .. - Cavazos-Cadena (1996)   (Correct)

No context found.

H.L. Royden. Real Analysis, 2nd. Edition. New York: Macmillan, 1968.


Conditions for Average Optimality in Markov Control.. - Montes-de-Oca.. (1994)   (Correct)

No context found.

H.L. Royden. Real Analysis. New York: Macmillan, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC