Results 1  10
of
29,848
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
 J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract

Cited by 1010 (2 self)
 Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 578 (6 self)
 Add to MetaCart
We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order
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
Krivine machines and higherorder schemes
, 2011
"... Abstract. We propose a new approach to analysing higherorder recursive schemes. Many results in the literature use automata models generalising pushdown automata, most notably higherorder pushdown automata with collapse (CPDA). Instead, we propose to use the Krivine machine model. Compared to CPDA ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Abstract. We propose a new approach to analysing higherorder recursive schemes. Many results in the literature use automata models generalising pushdown automata, most notably higherorder pushdown automata with collapse (CPDA). Instead, we propose to use the Krivine machine model. Compared
Efficient Crawling Through URL Ordering
 COMPUTER NETWORKS AND ISDN SYSTEMS
, 1998
"... In this paper we study in what order a crawler should visit the URLs it has seen, in order to obtain more “important” pages first. Obtaining important pages rapidly can be very useful when a crawler cannot visit the entire Web in a reasonable amount of time. We define several importance metrics, ord ..."
Abstract

Cited by 384 (9 self)
 Add to MetaCart
, ordering schemes, and performance evaluation measures for this problem. We also experimentally evaluate the ordering schemes on the Stanford University Web. Our results show that a crawler with a good ordering scheme can obtain important pages significantly faster than one without.
Higherorder schemes and morphic words
 Journées Montoises, Rennes
, 2006
"... Halfline innite graphs may be considered as words; the Caucal hierarchy therefore oers unexplored set of constructible words. Morphic words are know to belong to the second level; we present an extension which would correspond to higher levels. To reach this goal, the notion of scheme, as de ned b ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
by Damm, is intensively used: morphic words as dened are proved to be yielded by schemes of corresponding order. In what is called Caucal hierarchy, (labeled) graphs and trees are constructible by simple ways, namely monadic interpretations and graph unfoldings. In particular, we focus on semiline graphs
A Simple Transmit Diversity Technique for Wireless Communications
, 1998
"... This paper presents a simple twobranch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximalratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the scheme may ea ..."
Abstract

Cited by 2127 (0 self)
 Add to MetaCart
This paper presents a simple twobranch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximalratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the scheme may
The ordinal numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem and oth ..."
Abstract

Cited by 731 (68 self)
 Add to MetaCart
and other properties of order relation of cardinals. In the second section we show that every set has cardinal number equipotence to it. We introduce notion of alephs and we deal with the concept of finite set. At the end of the article we show two schemes of cardinal induction. Some definitions are based
Compressive sensing
 IEEE Signal Processing Mag
, 2007
"... The Shannon/Nyquist sampling theorem tells us that in order to not lose information when uniformly sampling a signal we must sample at least two times faster than its bandwidth. In many applications, including digital image and video cameras, the Nyquist rate can be so high that we end up with too m ..."
Abstract

Cited by 696 (62 self)
 Add to MetaCart
will learn about a new technique that tackles these issues using compressive sensing [1, 2]. We will replace the conventional sampling and reconstruction operations with a more general linear measurement scheme coupled with an optimization in order to acquire certain kinds of signals at a rate significantly
Efficient Implementation of Weighted ENO Schemes
, 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract

Cited by 412 (38 self)
 Add to MetaCart
In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order
Results 1  10
of
29,848