Results 1  10
of
1,779,659
THE EXPLICIT FORM FOR LIE TRANSFORMATIONS
"... This paper 1 presents a method of obtaining of explicit forms for Lie transformations which are widely used in particle physics problems. This approach is based on the matrix formalism for Lie algebraic tools. All calculations are realized in symbolic form with the help of computer algebra codes ..."
Abstract
 Add to MetaCart
This paper 1 presents a method of obtaining of explicit forms for Lie transformations which are widely used in particle physics problems. This approach is based on the matrix formalism for Lie algebraic tools. All calculations are realized in symbolic form with the help of computer algebra codes
TCP and Explicit Congestion Notification
 In: ACM Computer Communication Review, V. 24 N
, 1994
"... This paper discusses the use of Explicit Congestion Notification (ECN) mechanisms in the TCP/IP protocol. The first part proposes new guidelines for TCP’s response to ECN mechanisms (e.g., Source Quench packets, ECN fields in packet headers). Next, using simulations, we explore the benefits and draw ..."
Abstract

Cited by 641 (13 self)
 Add to MetaCart
This paper discusses the use of Explicit Congestion Notification (ECN) mechanisms in the TCP/IP protocol. The first part proposes new guidelines for TCP’s response to ECN mechanisms (e.g., Source Quench packets, ECN fields in packet headers). Next, using simulations, we explore the benefits
Explicit Form and Robustness of Martingale Representations
"... Stochastic integral representation of martingales has been undergoing a renaissance due to questions motivated by Stochastic Finance theory. In the Brownian case one usually has formulas (of differing degrees of exactness) for the predictable integrands. We extend some of these to Markov cases where ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Stochastic integral representation of martingales has been undergoing a renaissance due to questions motivated by Stochastic Finance theory. In the Brownian case one usually has formulas (of differing degrees of exactness) for the predictable integrands. We extend some of these to Markov cases where one does not necessarily have stochastic integral representation of all martingales. Moreover we study various convergence questions that arise naturally from (for example) approximations of "price processes" via Euler schemes for solutions of stochastic differential equations. We obtain general results of the following type: let U , U n be random variables with decompositions: U = ff + Z 1 0 s dX s +N1 U n = ff n + Z 1 0 n s dX n s +N n 1 where X,N , X n , N n are martingales. If X n ! X and U n ! U , when and how does n ! ? 1 Introduction 1) Consider a sequence X n of squareintegrable martingales, which converge to another squareintegrable martingale X: ...
An explicit form for Kerov’s character polynomials
 Trans. Amer. Math. Soc
, 2005
"... Abstract. Kerov considered the normalized characters of irreducible representations of the symmetric group, evaluated on a cycle, as a polynomial in free cumulants. Biane has proved that this polynomial has integer coefficients, and made various conjectures. Recently, ´ Sniady has proved Biane’s co ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
conjectured explicit form for the first family of nontrivial terms in this polynomial. In this paper, we give an explicit expression for all terms in Kerov’s character polynomials. Our method is through Lagrange inversion. 1.
Computing semantic relatedness using Wikipediabased explicit semantic analysis
 In Proceedings of the 20th International Joint Conference on Artificial Intelligence
, 2007
"... Computing semantic relatedness of natural language texts requires access to vast amounts of commonsense and domainspecific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a highdimensional space of concepts derived from Wikipedi ..."
Abstract

Cited by 546 (9 self)
 Add to MetaCart
Computing semantic relatedness of natural language texts requires access to vast amounts of commonsense and domainspecific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a highdimensional space of concepts derived from
An Explicit Form of the Equation of Motion of the Interface in Bicontinuous Phases
, 2008
"... The explicit form of the interface equation of motion derived assuming a minimal surface is extended to general bicontinuous interfaces that appear in the diffusion limited stage of the phase separation process of binary mixtures. The derivation is based on a formal solution of the equivalent simple ..."
Abstract
 Add to MetaCart
The explicit form of the interface equation of motion derived assuming a minimal surface is extended to general bicontinuous interfaces that appear in the diffusion limited stage of the phase separation process of binary mixtures. The derivation is based on a formal solution of the equivalent
A Proposal to add Explicit Congestion Notification (ECN) to IP
, 1999
"... This note describes a proposed addition of ECN (Explicit Congestion Notification) to IP. TCP is currently the dominant transport protocol used in the Internet. We begin by describing TCP's use of packet drops as an indication of congestion. Next we argue that with the addition of active queue m ..."
Abstract

Cited by 477 (27 self)
 Add to MetaCart
This note describes a proposed addition of ECN (Explicit Congestion Notification) to IP. TCP is currently the dominant transport protocol used in the Internet. We begin by describing TCP's use of packet drops as an indication of congestion. Next we argue that with the addition of active queue
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
Closedform solution of absolute orientation using unit quaternions
 J. Opt. Soc. Am. A
, 1987
"... Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the leastsquares pr ..."
Abstract

Cited by 973 (4 self)
 Add to MetaCart
Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the least
Results 1  10
of
1,779,659