Blind Multiuser Receivers for ISI CDMA Channels Using the ε-Approximation Algorithms

The problem of the blind demodulation of multiuser information symbols in ahigh-rate Code Division Multiple Access (CDMA) network in the presence of InterSymbol Interference(ISI) is of considerable interest. The dispersive CDMA channel is first cast into a Multiple-InputMultiple-Out (MIMO) signal model framework. Then , the problem of the blind channel equalization andmultiuser detection is considered. In this paper, we formulate the problem of blind channelestimation and signal detection into a quadratic programming with binary constraints. Then, theefficient ε-approximation algorithms are presented and applied to find the solution to thequadratic programming. The proposed approach does not estimate the channel directly or rely on anystatistics . Simulation results support our theoretical analysis .

D_∞-APPROXIMATION OF PRODUCT VARIATIONS OF TWO PARAMETER SMOOTH SEMIMARTINGALES

Let X be a two parameter smooth semimartingale and (?) be its process of the product variation. It is proved that (?) can be approximated as D_∞-limit of sums of its discrete product variations as the mesh of division tends to zero. Moreover, this result can be strengthen to yield the quasi sure convergence of sums by estimating the speed of the convergence.

CHARACTERIZATION OF BEST APPROXIMATIONS IN METRIC LINEAR SPACES

Let (X,d) be a real metric linear space, with translation-invariant metric d and C a linear subspace of X. In this paper we use functionals in the Lipschitz dual of X to characterize those elements of G which are best approximations to elements of X.We also give simultaneous characterization of elements of best approximation and also consider elements of ε-approximation.

W^t-approximation representations over quasi k-Gorenstein algebras

The notions of quasi k-Gorenstein algebras and W^t-approximation representations are introduced. The existence and uniqueness (up to projective equivalences) of W^t-approximation representations over quasi k-Gorenstein algebras are established. Some applications of W^t-approximation representations to homologically finite subcategories are given.

WEIGHTED BEST LOCAL APPROXIMATION IN ORLICZ SPACE

We present a common fixed point theorem for generalized asymptotically non- expansive and noncommuting mappings in normed linear spaces.

Equilibria of the Abstract Economy under Almost Lower Semi-continuous Assumption

The purpose of this paper is to make a further study on the abstract economy. Here, for the constraint correspondences we assume that they are almost lower semi-continuous (n-lower semi-continuous), which is weaken than that they are lower semi-continuous. Several equilibria existence theorems are proved.

A MFE method combined with L1-approximation for a nonlinear time-fractional coupled diffusion system

In this paper,a nonlinear time-fractional coupled diffusion system is solved by using a mixed finite element(MFE)method in space combined with L1-approximation and implicit second-order backward difference scheme in time.The stability for nonlinear fully discrete finite element scheme is analyzed and a priori error estimates are derived.Finally,some numerical tests are shown to verify our theoretical analysis.

D_∞-APPROXIMATION OF QUADRATIC VARIATIONS OF SMOOTH IT PROCESSES

The purpose of this paper is to prove that the quadratic variations of smooth It process in the sense of Malliavin-Nualart can be approximated in Sobolev spaces over the Wiener space by its discrete quadratic variations.

On the k-sample Behrens-Fisher problem for high-dimensional data

For several decades, much attention has been paid to the two-sample Behrens-Fisher (BF) problem which tests the equality of the means or mean vectors of two normal populations with unequal variance/covariance structures. Little work, however, has been done for the k-sample BF problem for high dimensional data which tests the equality of the mean vectors of several high-dimensional normal populations with unequal covariance structures. In this paper we study this challenging problem via extending the famous Scheffe’s transformation method, which reduces the k-sample BF problem to a one-sample problem. The induced one-sample problem can be easily tested by the classical Hotelling’s T 2 test when the size of the resulting sample is very large relative to its dimensionality. For high dimensional data, however, the dimensionality of the resulting sample is often very large, and even much larger than its sample size, which makes the classical Hotelling’s T 2 test not powerful or not even well defined. To overcome this difficulty, we propose and study an L 2-norm based test. The asymptotic powers of the proposed L 2-norm based test and Hotelling’s T 2 test are derived and theoretically compared. Methods for implementing the L 2-norm based test are described. Simulation studies are conducted to compare the L 2-norm based test and Hotelling’s T 2 test when the latter can be well defined, and to compare the proposed implementation methods for the L 2-norm based test otherwise. The methodologies are motivated and illustrated by a real data example.

One-Sided Exact Boundary Null Controllability of Entropy Solutions to a Class of Hyperbolic Systems of Conservation Laws with Characteristics with Constant Multiplicity

This paper proves the local exact one-sided boundary null controllability of entropy solutions to a class of hyperbolic systems of conservation laws with characteristics with constant multiplicity. This generalizes the results in [Li, T. and Yu, L., One-sided exact boundary null controllability of entropy solutions to a class of hyperbolic systems of conservation laws, To appear in Journal de Mathematiques Pures et Appliquees, 2016.] for a class of strictly hyperbolic systems of conservation laws.

A PRIMAL-DUAL INTERIOR POINT METHOD FOR PARAMETRIC SEMIDEFINITE PROGRAMMING PROBLEMS

On the basis of primal-dual approach, we present in this paper an interior point method that gives parametric E-approximate solutions to parametric semi-definite programming problems. The method is finite, and the number of its iterations is quasi-polynomially bounded.