Results 1  10
of
42,441
Adaptive highorder finite element solution of transient elastohydrodynamic lubrication problems
 Proceedings of the Institution of Mechanical Engineers Part J: Journal of Engineering Tribology 220
, 2006
"... This paper presents a new numerical method to solve transient line contact elastohydrodynamic lubrication (EHL) problems. A highorder Discontinuous Galerkin nite element method is used for the spatial discretization and the standard CrankNicolson method is employed to approximate the time derivat ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper presents a new numerical method to solve transient line contact elastohydrodynamic lubrication (EHL) problems. A highorder Discontinuous Galerkin nite element method is used for the spatial discretization and the standard CrankNicolson method is employed to approximate the time
High Order Finite Element Solution of Elastohydrodynamic Lubrication Problems
, 2006
"... The candidate confirms that the work submitted is his own and that the appropriate credit has been given where reference has been made to the work of others. This copy has been supplied on the understanding that it is copyright material and that In this thesis, a highorder finite element scheme, ba ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The candidate confirms that the work submitted is his own and that the appropriate credit has been given where reference has been made to the work of others. This copy has been supplied on the understanding that it is copyright material and that In this thesis, a highorder finite element scheme
Submitted to the IEEE Visualization Conference. ElVis: A System for the Accurate and Interactive Visualization of HighOrder Finite Element Solutions
"... contour lines on curved and planar surfaces. Abstract — This paper presents the Element Visualizer (ElVis), a new scientific visualization system for use with highorder finite element solutions to PDEs in three dimensions. This system is designed to minimize visualization errors of these types of f ..."
Abstract
 Add to MetaCart
contour lines on curved and planar surfaces. Abstract — This paper presents the Element Visualizer (ElVis), a new scientific visualization system for use with highorder finite element solutions to PDEs in three dimensions. This system is designed to minimize visualization errors of these types
ElVis: A System for the Accurate and Interactive Visualization of HighOrder Finite Element Solutions
"... contour lines on curved and planar surfaces. Abstract—This paper presents the Element Visualizer (ElVis), a new, opensource scientific visualization system for use with highorder finite element solutions to PDEs in three dimensions. This system is designed to minimize visualization errors of these ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of these types of fields by querying the underlying finite element basis functions (e.g., highorder polynomials) directly, leading to pixelexact representations of solutions and geometry. The system interacts with simulation data through runtime plugins, which only require users to implement a handful
Numerical Solutions of the Euler Equations by Finite Volume Methods Using RungeKutta TimeStepping Schemes
, 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract

Cited by 517 (78 self)
 Add to MetaCart
A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used
Raptor codes
 IEEE Transactions on Information Theory
, 2006
"... LTCodes are a new class of codes introduced in [1] for the purpose of scalable and faulttolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LTCodes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract

Cited by 577 (7 self)
 Add to MetaCart
: for a given integer k, and any real ε> 0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + ε) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/ε)) operations
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 683 (1 self)
 Add to MetaCart
of a solution changes abruptly from near 0 to near 1. It is the high density of wellseparated almost solutions (local minima) at this boundary that cause search algorithms to "thrash". This boundary is a type of phase transition and we show that it is preserved under mappings between
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
law), then it is possible to reconstruct f to within very high accuracy from a small number of random measurements. typical result is as follows: we rearrange the entries of f (or its coefficients in a fixed basis) in decreasing order of magnitude f  (1) ≥ f  (2) ≥... ≥ f  (N), and define the weakℓp ball
The faculty of language: what is it, who has it, and how did it evolve?
 Science,
, 2002
"... We argue that an understanding of the faculty of language requires substantial interdisciplinary cooperation. We suggest how current developments in linguistics can be profitably wedded to work in evolutionary biology, anthropology, psychology, and neuroscience. We submit that a distinction should ..."
Abstract

Cited by 472 (7 self)
 Add to MetaCart
be made between the faculty of language in the broad sense (FLB) and in the narrow sense (FLN). FLB includes a sensorymotor system, a conceptualintentional system, and the computational mechanisms for recursion, providing the capacity to generate an infinite range of expressions from a finite set
Discrete DifferentialGeometry Operators for Triangulated 2Manifolds
, 2002
"... This paper provides a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Vorono ..."
Abstract

Cited by 449 (14 self)
 Add to MetaCart
Voronoi cells and the mixed FiniteElement/FiniteVolume method, and compare them to existing formulations. Building upon previous work in discrete geometry, these new operators are closely related to the continuous case, guaranteeing an appropriate extension from the continuous to the discrete setting
Results 1  10
of
42,441