Results 271 to 280 of about 22,113 (299)
Some of the next articles are maybe not open access.
Mathematical Notes of the Academy of Sciences of the USSR, 1969
An example of a basis for space C, close to the Schauder system, is constructed which, after orthogonalization by the Schmidt method, is not a basis for space LP for any p e [1, 2) +(2,∞].
openaire +2 more sources
An example of a basis for space C, close to the Schauder system, is constructed which, after orthogonalization by the Schmidt method, is not a basis for space LP for any p e [1, 2) +(2,∞].
openaire +2 more sources
Orthogonal hermite functions based orthogonal pulse shaping method
2009 Canadian Conference on Electrical and Computer Engineering, 2009Ultra-Wideband (UWB) communication has attracted more attentions due to its advantages in short range applications. As one of the key techniques in UWB systems, many pulse shaping methods have been proposed. The semi-definite programming (SDP) based pulse shaping method can obtain the pulse with highest power efficiency by far.
Xuanli Wu +3 more
openaire +1 more source
1987
Let X be a linear space over K and suppose that on X we have an inner product 〈,〉. The basic notion defined on X by the inner product 〈,〉 is the notion of orthogonality. Using this notion we consider certain families of orthogonal elements which are on the surface of the unit ball of X (considered as a normed linear space (X, ||, ||).
openaire +1 more source
Let X be a linear space over K and suppose that on X we have an inner product 〈,〉. The basic notion defined on X by the inner product 〈,〉 is the notion of orthogonality. Using this notion we consider certain families of orthogonal elements which are on the surface of the unit ball of X (considered as a normed linear space (X, ||, ||).
openaire +1 more source
ON PROPERTIES OF BASES AFTER THEIR ORTHOGONALIZATION
Mathematics of the USSR-Izvestiya, 1970We wish to determine which Lp spaces have bases formed by orthogonalizing a sequence of functions {fn} that is a basis in C(0,1). We show that the answer to this question depends on the sequence of functions {fn} and also on the method of orthogonalization.
openaire +2 more sources
Signal identification based on orthogonal transform
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002A new approach to the identification of a constant amplitude signal with frequency/phase modulation is investigated. The authors model the incoming signal phase as a linear combination of a set of orthogonal vectors and use the significant coefficients as features for identification.
K. C. Ho 0001 +2 more
openaire +1 more source
Orthogonal bases for LP spaces
Mathematical Notes of the Academy of Sciences of the USSR, 1971The spectrum of a system of functions which are orthogonal on [0, 1] is the set of all p ∈ [1, ∞] such that the system forms a basis in Lp[0, 1] (L∞=C). A set E is called aspectral set if there exists a system of functions orthonormal on [0, 1] whose spectrum is E.
openaire +1 more source
OEWC-Based Orthogonality Tracking on NIDS
2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2013Network Intrusion Detection System (NIDS) monitor traffic on a network looking for suspicious activity, which could be an attack or unauthorized activity. By the Orthogonal Expanded Walsh Code (OEWC) spreading and orthogonality, system can detect intrusion correlation on orthogonality tracking. This orthogonal tracking mechanism based on group matching
Yih-Fuh Wang, Meng-Yuan Liao
openaire +1 more source
2012
Two Haarwavelet bases, classic and the recently introduced unbalanced one, are presented together with the corresponding fast wavelet transforms (in the classic and lifting versions). Both linear and nonlinear (derived from the EZW algorithm) Haar approximation schemes are examined.
openaire +1 more source
Two Haarwavelet bases, classic and the recently introduced unbalanced one, are presented together with the corresponding fast wavelet transforms (in the classic and lifting versions). Both linear and nonlinear (derived from the EZW algorithm) Haar approximation schemes are examined.
openaire +1 more source
Spaces with an “orthogonal” base
2010In this chapter we study locally convex spaces E having an “orthogonal” base e 1 , e 2 , … (9.1.1). We first show that for such E , (weak) sequential completeness, quasicompleteness and completeness are equivalent (9.1.6). E may have closed subspaces and quotients without an “orthogonal” base (9.2.5).
openaire +1 more source
Orthogonal Projections and Bases
2012In this section we discuss the very practical problem of fitting a line, a plane, or a curve to a set of given points when this can only be done approximately. For example, we may expect some observed data to be the coordinates of points on a straight line, but they turn out to be only approximately so. Then our problem is to find a line that fits them
openaire +1 more source