THE MARCINKIEWICZ-ZYGMUND INEQUALITY IN B_α SPACES(I)

The Marcinkiewicz-Zygmund inequality with derivative for an algebraic polynomial of order < N = (q +1)n - 1 is established in a Ba space. As a corollary, the Marcinkiewicz-Zygmund inequality with derivative for an algebraic polynomial in a particular Orlicz space is obtained.     

An Analogue of the Z_4-Goethals Code in Non-Primitive Length

This paper constructs a cyclic Z_4-code with a parity-check matrix similar to that of Goethals code but in length 2~m+ 1, for all m ≥ 4. This code is a subcode of the lifted Zetterberg code for m even. Its minimum Lee weight is shown to be at least 10, in general, and exactly 12 in lengths 33, 65. The authors give an algebraic decoding algorithm which corrects five errors in these lengths for m = 5, 6 and four errors for m 6.     

H ∞ filtering for continuous-time systems with pointwise time-varying delay

The problem of H_∞filtering for continuous-time systems with pointwise time-varying delay is investigated in this paper.By applying an innovation analysis in Krein space,a necessary and sufficient condition for the existence of an H_∞filter is derived in two methods:One is the partial differential equation approach,the other is the reorganized innovation analysis approach.The former gives a solution to the proposed H_∞filtering problem in terms of the solution of a partial differential equation with boundary conditions.The later gives an analytical solution to the proposed H_∞filtering problem in terms of the solutions of Riccati and matrix differential equations.     

The Algebraic Properties of Concept Lattice

Concept lattice is a powerful tool for data analysis. It has been applied widely to machine learning, knowledge discovery and software engineering and so on. Some aspects of concept lattice have been studied widely such as building lattice and rules extraction, as for its algebraic properties, there has not been discussed systematically. The paper suggests a binary operation between the elements for the set of all concepts in formal context. This turns the concept lattice in general significance into those with operators. We also proved that the concept lattice is a lattice in algebraic significance and studied its algebraic properties.These results provided theoretical foundation and a new method for further study of concept lattice.     

Bidirectional Texture Mapping

Texture mapping is an important technique for high -quality image generation in computer graphics. In this paper, the shortcoming of the traditional texture mapping approaches is analysed and a general bidirectional texture mapping method is proposed. Based on the bidirectional mapping, an algorithm for mapping an image to an arbitrary polygon in 3D space is given.     

Finding the topology of implicitly defined two algebraic plane curves

An algorithm is given for computing in a very efficient way the topology of two real algebraic plane curves defined implicitly.The authors preform a symbolic pre-processing that allows us later to execute all numerical computations in an accurate way.     

Decentralized robust guaranteed cost control for a class of interconnected singular large-scale systems with time-delay and parameter uncertainty

The decentralized robust guaranteed cost control problem is studied for a class of interconnected singular large-scale systems with time-delay and norm-bounded time-invariant parameter uncertainty under a given quadratic cost performance function. The problem that is addressed in this study is to design a decentralized robust guaranteed cost state feedback controller such that the closed-loop system is not only regular, impulse-free and stable, but also guarantees an adequate level of performance for all admissible uncertainties. A sufficient condition for the existence of the decentralized robust guaranteed cost state feedback controllers is proposed in terms of a linear matrix inequality (LMI) via LMI approach. When this condition is feasible, the desired state feedback decentralized robust guaranteed cost controller gain matrices can be obtained. Finally, an illustrative example is provided to demonstrate the effectiveness of the proposed approach.     

Robust On-Line Fault Diagnosis for Nonlinear Difference-Algebraic Systems Using Least Squares Estimate

A new robust on-line fault diagnosis method based on least squares estimate for nonlinear difference-algebraic systems (DAS) with uncertainties is proposed. Based on the known nominal model of the DAS, this method firstly constructs an auxiliary system consisting of a difference equation and an algebraic equation, then, based on the relationship between the state deviation and the faults in the difference equation and the relationship between the algebraic variable deviation and the faults in algebraic equation, it identifies the faults on-line through least squares estimate. This method can not only detect, isolate and identify faults for DAS, but also give the upper bound of the error of fault identification. The simulation results indicate that it can give satisfactory diagnostic results for both abrupt and incipient faults.     

ON THE FOUNDATION OF ALGEBRAIC DIFFERENTIAL GEOMETRY

An algebraic differential variety is defined as the zero-set of a differentialpolynomial set,and algebraic differential geometry is devoted to the study of such varieties.We give various decomposition formulas for the structures of such zero-sets which imply inparticular,the unique decomposition of an algebraic differential variety into its irreduciblecomponents.These formulas will find applications in various directions including mechanicaltheorem-proving of differential geometries.     

MINIMAL INVERSION AND ITS ALGORITHMS OF DISCRETE-TIME NONLINEAR SYSTEMS

The left-inverse system with minimal order and its algorithms of discrete-time nonlinear systems are studied in a linear algebraic framework. The general structure of left-inverse system is described and computed in symbolic algorithm. Two algorithms are given for constructing left-inverse systems with minimal order.     

Spectral analysis and stabilization of a coupled wave-ODE system

In this paper, an interconnected wave-ODE system with K-V damping in the wave equation and unknown parameters in the ODE is considered. It is found that the spectrum of the system operator is composed of two parts： Point spectrum and continuous spectrum. The continuous spectrum consists of an isolated point 1 1/d, and there are two branches of the asymptotic eigenvalues： The first branch is accumulating towards 1 -2, and the other branch tends to -∞. It is shown that there is a sequence of generalized eigenfunctions, which forms a Riesz basis for the Hilbert state space. As a consequence, the spectrum-determined growth condition and exponential stability of the system are concluded.     

A posteriori error analysis for a fully discrete discontinuous Galerkin approximation to a kind of reactive transport problems

In order to obtain an expected numerical solution,a fully discrete discontinuous Galerkin method is applied to a kind of reactive transport problems in two dimension.That is to say,the space variable is discretized with the symmetric interior penalty Galerkin method(SIPG),and the time variable is done with the backward Euler method.Making use of the duality technique,hp approximation properties and the interpolation theory,a residual-type a posteriori error estimation is achieved,which can be used for adaptivity.Compared with the analyses of semi-discretization,the current presentation is more challenging and more significant.     

A High Speed Detection Scheme for Point Targets in a Multitarget Environment

The purpose of this paper is to develop a high speed detection scheme for moving and / or stationary point targets in a multitarget environment as registered in an IR image sequence. An iterative approximate 3-D line searching algorithm based upon the geometric representation of lines (for non-maneuvering targets in space) in a 3-D space is derived. The convergency of the algorithm is proved. An analysis is performed of the theoretical detection performance of the algorithm. The statistical experiment results show high effectiveness and computational efficiency of the algorithm in the case of low SNR. The idea may be employed to satisfy the real-time processing requirement of an IR system.     

Optimal maneuvering strategy of spacecraft evasion based on angles-only measurement and observability analysis

Spacecraft orbit evasion is an effective method to ensure space safety. In the spacecraft’s orbital plane, the space non-cooperate target with autonomous approaching to the spacecraft may have a dangerous rendezvous. To deal with this problem, an optimal maneuvering strategy based on the relative navigation observability degree is proposed with angles-only measurements. A maneuver evasion relative navigation model in the spacecraft’s orbital plane is constructed and the observability measurement...     

ROBUST STABILITY WITH GUARANTEEING COST FOR DISCRETE TIME-DELAY SYSTEMS WITH NONLINEAR PERTURBATION

The problems of robust stability and robust stability with a guaranteeing cost for discrete time-delay systems with nonlinear perturbation are discussed. A sufficient criterion for robust stability is established in an LMI framework and a linear convex optimization problem with LMI constraints for computing maximal perturbation bound is proposed. Meanwhile, a sufficient criterion for robust stability with a guaranteeing cost for such systems is obtained, and an optimal procedure for decreasing the value of guaranteeing cost is put forward. Two examples are used to illustrate the efficiency of the results.     

Robust decentralized H∞ control of multi-channel systems with norm-bounded parametric uncertainties

A robust decentralized H∞ control problem for uncertain multi-channel systems is considered. The uncertainties are assumed to be time-invariant, norm-bounded, and exist in both the system and control input matrices. The dynamic output feedback is mainly dealt with. A necessary and sufficient condition for the uncertain multi-channel system to be stabilized robustly with a specified disturbance attenuation level is derived based on the bounded real lemma, which is reduced to a feasibility problem of a nonlinear matrix inequality (NMI). A two-stage homotopy method is used to solve the NMI iteratively. First, a decentralized controller for the nominal system with no uncertainty is computed by imposing structural constraints on the coefficient matrices of the controller gradually. Then the decentralized controller is modified, again gradually, to cope with the uncertainties. On each stage, a variable is fixed alternately at the iterations to reduce the NMI to a linear matrix inequality (LMI). A given example shows the efficiency of this method.     

SENSITIVITY ANALYSIS FOR PARAMETERIZED VARIATIONAL INEQUALITY PROBLEMS

This paper presents sensitivity analysis for parameterized variational inequality problems (VIP). Under appropriate assumption, it is shown that the perturbed solution to parameterized VIP is existent, unique, continuous and different iable with respect to perturbation parameter. In the case of differentiability, we derive the equations for calculating the derivative of solution variables with respect to the perturbation parameters.     

Polarimetric whitening filter for POLSAR image based on subspace decomposition

Speckle filtering is an indispensable pre-processing step for applications of polarimetric synthetic aperture radar （POLSAR）, such as terrain classification, target detection, etc. As one of the most typical methods, the polarimetric whitening filter （PWF） can be used to produce a minimum-speckle image by combining the complex elements of the scattering matrix, but polarimetric information is lost after the filtering process. A polarimetric filter based on subspaze decomposition which was proposed by Cu et al specializes in retrieving principle scattering characteristics, but the corresponding mean value of an image after filtering is not kept well. A new filter is proposed for improving the disadvantage based on subspace decomposition. Under the constraint that a weighted combination of the polarimetric SAR images equals to the output of the PWF, the Euclidean distance between an unfiltered parameter vector and a signal space vector is minimized so that noises can be reduced. It is also shown that the proposed method is equivalent to the subspace filter in the case of no constraint. Experimental results with the NASA/JPL airborne polarimetric SAR data demonstrate the effectiveness of the proposed method.     

Adaptive link layer security architecture for telecommand communications in space networks

Impressive advances in space technology are enabling complex missions, with potentially significant and long term impacts on human life and activities. In the vision of future space exploration, communication links among planets, satel ites, spacecrafts and crewed vehicles wil be designed according to a new paradigm, known as the disruption tolerant networking. In this scenario, space channel peculiarities impose a massive reengineering of many of the protocols usually adopted in terrestrial networks; among them, security solutions are to be deeply reviewed, and tailored to the specific space requirements. Security is to be provided not only to the payload data exchanged on the network, but also to the telecommands sent to a spacecraft, along possibly differentiated paths. Starting from the secure space telecommand design developed by the Consultative Committee for Space Data Systems as a response to agency-based requirements, an adaptive link layer security architecture is proposed to address some of the chal enges for future space networks. Based on the analysis of the communication environment and the error diffusion properties of the authentication algorithms, a suitable mechanism is proposed to classify frame retransmission requests on the basis of the originating event （error or security attack） and reduce the impact of security operations. An adaptive algorithm to optimize the space control protocol, based on estimates of the time varying space channel, is also presented. The simulation results clearly demonstrate that the proposed architecture is feasible and efficient, especially when facing malicious attacks against frame transmission.