Results 1  10
of
403,366
Surface deformation due to shear and tensile faults in a halfspace
, 1985
"... A complete set of closed analytical expressions is presented in a unified manner for the internal displacements and strains due to shear and tensile faults in a halfspace for both point and finite rectangular sources. These expressions are particularly compact and systematically composed of terms r ..."
Abstract

Cited by 727 (1 self)
 Add to MetaCart
A complete set of closed analytical expressions is presented in a unified manner for the internal displacements and strains due to shear and tensile faults in a halfspace for both point and finite rectangular sources. These expressions are particularly compact and systematically composed of terms
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 654 (33 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a
Modeling the Interaction of Light Between Diffuse Surfaces
, 1984
"... A method is described which models the interaction of light between diffusely reflecting surfaces. Current light reflection models used in computer graphics do not account for the objecttoobject reflection between diffuse surfaces, and thus incorrectly compute the global illumination effects. The ..."
Abstract

Cited by 400 (6 self)
 Add to MetaCart
. The new procedure, based on methods used in thermal engineering, includes the effects of diffuse light sources of finite area, as well as the "colorbleeding" effects which are caused by the diffuse reflections. A simple environment is used to illustrate these simulated effects and is presented
The benefits of coding over routing in a randomized setting
 In Proceedings of 2003 IEEE International Symposium on Information Theory
, 2003
"... Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than the ..."
Abstract

Cited by 361 (44 self)
 Add to MetaCart
exponentially with the number of codeword bits. We demonstrate the advantage of randomized coding over routing for distributed transmission in rectangular grid networks by giving, in terms of the relative grid locations of a sourcereceiver pair, an upper bound on routing success probability that is exceeded
Speech Analysis
, 1998
"... Contents 1 Introduction 4 1.1 What is Speech Analysis? . . . . . . . . . . . . . . . . . . . . 4 1.1.1 So what is an acoustic vector? . . . . . . . . . . . . . . 4 1.2 Why Speech Analysis? . . . . . . . . . . . . . . . . . . . . . . 4 1.3 The problems of speech analysis . . . . . . . . . . . . . . ..."
Abstract

Cited by 359 (0 self)
 Add to MetaCart
2.2 Linear filters . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 Finite Impulse Response filters . . . . . . . . . . . . . 8 2.2.2 Infinite Impulse Response filters . . . . . . . . . . . . . 11 2.3 The source filter model of speech . . . . . . . . . . . . . . . . 12 3 Filter bank
The string dual of a confining fourdimensional gauge theory
, 2000
"... We study N = 1 gauge theories obtained by adding finite mass terms to N = 4 YangMills theory. The Maldacena dual is nonsingular: in each of the many vacua, there is an extended brane source, arising from Myers’ dielectric effect. The source consists of one or more (p,q) 5branes. In particular, the ..."
Abstract

Cited by 353 (8 self)
 Add to MetaCart
We study N = 1 gauge theories obtained by adding finite mass terms to N = 4 YangMills theory. The Maldacena dual is nonsingular: in each of the many vacua, there is an extended brane source, arising from Myers’ dielectric effect. The source consists of one or more (p,q) 5branes. In particular
The Immersed Interface Method for Elliptic Equations with Discontinuous Coefficients and Singular Sources
 SIAM J. Num. Anal
, 1994
"... Abstract. The authors develop finite difference methods for elliptic equations of the form V. ((x)Vu(x)) + (x)u(x) f(x) in a region in one or two space dimensions. It is assumed that gt is a simple region (e.g., a rectangle) and that a uniform rectangular grid is used. The situation is studied in wh ..."
Abstract

Cited by 273 (31 self)
 Add to MetaCart
Abstract. The authors develop finite difference methods for elliptic equations of the form V. ((x)Vu(x)) + (x)u(x) f(x) in a region in one or two space dimensions. It is assumed that gt is a simple region (e.g., a rectangle) and that a uniform rectangular grid is used. The situation is studied
A Markovmodulated characterization of packetized voice and data traffic and related statistical multiplexer performance
 IEEE J. ON SELECTED AREAS IN COMMUN
, 1986
"... We study the performance of a statistical multiplexer whose inputs consist of a superposition of packetized voice sources and data. The performance analysis predicts voice packet delay distributions, which usually have a stringent requirement, as well as data packet delay distributions. The superpos ..."
Abstract

Cited by 288 (4 self)
 Add to MetaCart
We study the performance of a statistical multiplexer whose inputs consist of a superposition of packetized voice sources and data. The performance analysis predicts voice packet delay distributions, which usually have a stringent requirement, as well as data packet delay distributions
Computing Simulations on Finite and Infinite Graphs
, 1996
"... . We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges ..."
Abstract

Cited by 195 (7 self)
 Add to MetaCart
(assuming m n). For effectively presented infinite graphs, we present a symbolic similaritychecking procedure that terminates if a finite similarity relation exists. We show that 2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented
Results 1  10
of
403,366