Dissipative analysis for nonlinear singular systems with time-delay

This paper is concerned with the dissipative control problem for a class of nonlinear singular systems with time-delay. The quadratic supply rate with coefficient matrix Q > 0 and Q ≤ 0 are both discussed. Based on the Lyapunov stability theory, sufficient conditions are given to guarantee that the system is strictly dissipative via linear matrix inequality technique. Then congruent transformation method and Schur complement lemma are respectively used to determine corresponding proportional and derivative feedback controller for Q > 0 and Q ≤ 0. At last, two examples involve a practical example are given to verify the effectiveness of the method proposed in this paper.     

Nonparametric estimation of signal amplitude in white Gaussian noise

We assume that a transmitted signal is of the form S(t)f(t), where f(t) is a known function vanishing at some points of the observation interval and S(t) is a function of a known smoothness class. The signal is transmitted over a communication channel with additive white Gaussian noise of small intensity ?. For this model, we construct an estimator for S(t) which is optimal with respect to the rate of convergence of the risk to zero as ? → 0.     

The formula of the solution for some classes of initial boundary value problems for the hyperbolic equation with two independent variables

A new representation is proved of the solutions of initial boundary value problems for the equation of the form u _xx (x, t) + r(x)u _x (x, t) ? q(x)u(x, t) = u _tt (x, t) + μ(x)u _t (x, t) in the section (under boundary conditions of the 1st, 2nd, or 3rd type in any combination). This representation has the form of the Riemann integral dependent on the x and t over the given section.     

<Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control for sochastic time-delayed Markovian switching systems with partly known transition rates and input saturation

The paper is concerned with the problem of H _∞ control for stochastic time-delayed Markovian switching systems with partly known transition rates and input saturation. By employing more appropriate Lyapunov- Krasovskii functional, a state feedback controller is designed to guarantee stochastic stability of the corresponding closed-loop system with H _∞ performance. A linear matrix inequality approach is employed to obtain the controller gain matrix. Two illustrative examples are provided to show the potential of the proposed techniques.     

On ℤ<Subscript>4</Subscript>-linear codes with the parameters of Reed-Muller codes

For any pair of integers r and m, 0 ≤ r ≤ m, we construct a class of quaternary linear codes whose binary images under the Gray map are codes with the parameters of the classical rth-order Reed-Muller code RM(r, m).     

On polynomial solutions of the linear stationary control system

It is known that the controllable system x′ = Bx + Du, where the x is the n-dimensional vector, can be transferred from an arbitrary initial state x(0) = x ⁰ to an arbitrary finite state x(T) = x ^T by the control function u(t) in the form of the polynomial in degrees t. In this work, the minimum degree of the polynomial is revised: it is equal to 2p + 1, where the number (p ? 1) is a minimum number of matrices in the controllability matrix (Kalman criterion), whose rank is equal to n. A simpler and a more natural algorithm is obtained, which first brings to the discovery of coefficients of a certain polynomial from the system of algebraic equations with the Wronskian and then, with the aid of differentiation, to the construction of functions of state and control.     

Sufficient Conditions for Monotonicity of the Undetected Error Probability for Large Channel Error Probabilities

The performance of a linear error-detecting code in a symmetric memoryless channel is characterized by its probability of undetected error, which is a function of the channel symbol error probability, involving basic parameters of a code and its weight distribution. However, the code weight distribution is known for relatively few codes since its computation is an NP-hard problem. It should therefore be useful to have criteria for properness and goodness in error detection that do not involve the code weight distribution. In this work we give two such criteria. We show that a binary linear code C of length n and its dual code C^⊥ of minimum code distance d^⊥ are proper for error detection whenever d^⊥ ≥ ?n/2? + 1, and that C is proper in the interval [(n + 1 ? 2d^⊥)/(n ? d^⊥); 1/2] whenever ?n/3? + 1 ≤ d^⊥ ≤ ?n/2?. We also provide examples, mostly of Griesmer codes and their duals, that satisfy the above conditions.     

Simultaneous <Emphasis Type="Italic">H</Emphasis><Subscript>2</Subscript>/<Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> stabilization for chemical reaction systems based on orthogonal complement space

This paper presents a simultaneous H₂/H_∞ stabilization problem for the chemical reaction systems which can be modeled as a finite collection of subsystems. A single dynamic output feedback controller which simultaneously stabilizes the multiple subsystems and captures the mixed H₂/H_∞ control performance is designed. To ensure that the stability condition, the H₂ characterization and the H_∞ characterization can be enforced within a unified matrix inequality framework, a novel technique based on orthogonal complement space is developed. Within such a framework, the controller gain is parameterized by the introduction of a common free positive definite matrix, which is independent of the multiple Lyapunov matrices. An iterative linear matrix inequality (ILMI) algorithm using Matlab Yalmip toolbox is established to deal with the proposed framework. Simulation results of a typical chemical reaction system are exploited to show the validity of the proposed methodology.     

Consensus gain conditions of stochastic multi-agent system with communication noise

This paper investigates the consensus gain conditions of the stochastic multi-agent system (SMAS) with communication noise. A new consensus stability condition of the SMAS is given when the consensus gain function c(t) does not satisfy the robustness condition of the consensus stability. Next we broaden the condition that the consensus-gain function c(t) always must be positive, and obtain the sufficient condition of the SMAS’s consensus stability when the consensus-gain function c(t)) is a negative constant. Finally, two simulation examples are given to illustrate the feasibility and effectiveness of the proposed results.     

Partial and complete local diagnosis in computer systems with circulant structure

System diagnosis at multiple faults of multiplicity not greater than t is considered. The conditions when the state of each system module is only determined by the testing rusults of the physically connected modules (self-determination conditions) are analysed. The diagnosability conditions are established for the case when the self-determination conditions are not satisfied for any module. A new class of locally (t _r /t)-diagnosable systems is introduced, where t is the fault multiplicity and t _r is the multiplicity of faults at which the states of all system modules can be determined correctly and completely. The values of t _r are estimated. It is shown that the local t-diagnosability can be achieved by the system test redundancy.     

Optimal Path Embedding in the Exchanged Crossed Cube

The (s + t + 1)-dimensional exchanged crossed cube, denoted as ECQ(s, t), combines the strong points of the exchanged hypercube and the crossed cube. It has been proven that ECQ(s, t) has more attractive properties than other variations of the fundamental hypercube in terms of fewer edges, lower cost factor and smaller diameter. In this paper, we study the embedding of paths of distinct lengths between any two different vertices in ECQ(s, t). We prove the result in ECQ(s, t): if s ≥ 3, t ≥ 3, for any two different vertices, all paths whose lengths are between \( \max \left\{9,\left\lceil \frac{s+1}{2}\right\rceil +\left\lceil \frac{t+1}{2}\right\rceil +4\right\} \) and 2 ^s+t+1 ? 1 can be embedded between the two vertices with dilation 1. Note that the diameter of ECQ(s, t) is \( \left\lceil \frac{s+1}{2}\right\rceil +\left\lceil \frac{t+1}{2}\right\rceil +2 \). The obtained result is optimal in the sense that the dilations of path embeddings are all 1. The result reveals the fact that ECQ(s, t) preserves the path embedding capability to a large extent, while it only has about one half edges of CQ _n .     

Finite Frequency Vibration Suppression for Space Flexible Structures in Tip Position Control

This paper presents a novel control strategy for the tip position and vibration control of a class of space flexible structures. The proposed control algorithm consists of finite frequency H_∞ vibration control technique and fractional-order PD ^v control technique. More specially, a new finite frequency H_∞ controller working in the inner feedback loop is proposed to suppress vibration modes and external disturbances, and a new fractional-order PD ^v controller is developed in the outer feedback loop to guarantee the desired position tracking performance. Compared with conventional methods, the proposed one could achieve better control results. Finally, an illustrative example is presented to demonstrate the robustness and effectiveness of the proposed composite control strategy.     

Polylogarithms and the Asymptotic Formula for the Moments of Lebesgue’s Singular Function

Recall that Lebesgue’s singular function L(t) is defined as the unique solution to the equation L(t) = qL(2t) + pL(2t ? 1), where p, q > 0, q = 1 ? p, p ≠ q. The variables M _n = ∫₀¹t ⁿ dL(t), n = 0,1,… are called the moments of the function The principal result of this work is \({M_n} = {n^{{{\log }_2}p}}{e^{ - \tau (n)}}(1 + O({n^{ - 0.99}}))\), where the function τ(x) is periodic in log₂x with the period 1 and is given as \(\tau (x) = \frac{1}{2}1np + \Gamma '(1)lo{g_2}p + \frac{1}{{1n2}}\frac{\partial }{{\partial z}}L{i_z}( - \frac{q}{p}){|_{z = 1}} + \frac{1}{{1n2}}\sum\nolimits_{k \ne 0} {\Gamma ({z_k})L{i_{{z_k} + 1}}( - \frac{q}{p})} {x^{ - {z_k}}}\), \({z_k} = \frac{{2\pi ik}}{{1n2}}\), k ≠ 0. The proof is based on poissonization and the Mellin transform.     

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

In its simplest form, the longest common substring problem is to find a longest substring common to two or multiple strings. Using (generalized) suffix trees, this problem can be solved in linear time and space. A first generalization is the k -common substring problem: Given m strings of total length n, for all k with 2≤k≤m simultaneously find a longest substring common to at least k of the strings. It is known that the k-common substring problem can also be solved in O(n) time (Hui in Proc. 3rd Annual Symposium on Combinatorial Pattern Matching, volume 644 of Lecture Notes in Computer Science, pp. 230–243, Springer, Berlin, 1992). A further generalization is the k -common repeated substring problem: Given m strings T ⁽¹⁾,T ⁽²⁾,…,T ^(m) of total length n and m positive integers x ₁,…,x _m , for all k with 1≤k≤m simultaneously find a longest string ω for which there are at least k strings \(T^{(i_{1})},T^{(i_{2})},\ldots,T^{(i_{k})}\) (1≤i ₁<i ₂<???<i _k ≤m) such that ω occurs at least \(x_{i_{j}}\) times in \(T^{(i_{j})}\) for each j with 1≤j≤k. (For x ₁=???=x _m =1, we have the k-common substring problem.) In this paper, we present the first O(n) time algorithm for the k-common repeated substring problem. Our solution is based on a new linear time algorithm for the k-common substring problem.     

Dynamic output-feedback <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control for active half-vehicle suspension systems with time-varying input delay

This paper addresses the new output-feedback H _∞ control problem for active half-vehicle suspension systems with time-varying input delay. By introducing multi-objective synthesis, a new dynamic output-feedback H _∞ controller is designed such that the closed-loop suspension system is asymptotically stable with guaranteed robust performance in the H _∞ sense. The proposed controller is formulated in terms of linear matrix inequality (LMI) based on the auxiliary function-based integral inequality method and the reciprocally convex approach. A new delay-dependent sufficient condition for the desired controller offers a wider range of control input delay. Numerical examples are provided to validate the effectiveness of the proposed design method.     

Transit cosmological models with domain walls in <Emphasis Type="Italic">f</Emphasis>(<Emphasis Type="Italic">R,T</Emphasis>) gravity

We study the physical behavior of the transition of a 5D perfect fluid universe from an early decelerating phase to the current accelerating phase in the framework of f(R, T) theory of gravity in the presence of domain walls. The fifth dimension is not observed because it is compact. To determine the solution of the field equations, we use the concept of a time-dependent deceleration parameter which yields the scale factor a(t) = sinh^1/n(αt), where n and α are positive constants. For 0 < n ≤ 1, this generates a class of accelerating models, while for n > 1 the universe attains a phase transition from an early decelerating phase to the present accelerating phase, consistent with the recent observations. Some physical and geometric properties of the models are also discussed.     

Design of optimal and robust control with <Emphasis Type="Italic">H</Emphasis> <Subscript>∞</Subscript>/<Emphasis Type="Italic">γ</Emphasis> <Subscript>0</Subscript> performance criterion

For a double-input single-output system, this paper defines a disturbance attenuation level (called H_∞/γ₀ norm) as the maximum-value L₂ norm of the output under an unknown disturbance with a bounded L₂ norm supplied to the first input and an impulsive disturbance in the form of the product of an unknown vector and the delta function supplied the second input, where the squared L₂ norm of the former disturbance plus the quadratic form of the impulsive disturbance vector does not exceed 1. Weight matrix choice in the H_∞/γ₀ norm yields a trade-off between the attenuation level of the L₂ disturbance and the attenuation level of the impulsive disturbance in corresponding channels. For the uncertain systems with dynamic or parametric uncertainty in the feedback loop, a robust H_∞/γ₀ norm is introduced that includes the robust H_∞ and γ₀ norms as special cases. All these characteristics or their upper bounds in the uncertain system are expressed via solutions of linear matrix inequalities. This gives a uniform approach for designing optimal and robust control laws with the H_∞/γ₀, H_∞ and γ₀ performance criteria.     

Some lower bounds on the algebraic immunity of functions given by their trace forms

The algebraic immunity of a Boolean function is a parameter that characterizes the possibility to bound this function from above or below by a nonconstant Boolean function of a low algebraic degree. We obtain lower bounds on the algebraic immunity for a class of functions expressed through the inversion operation in the field GF(2 ⁿ ), as well as for larger classes of functions defined by their trace forms. In particular, for n ≥ 5, the algebraic immunity of the function Tr _n (x ^?1) has a lower bound ?2√n + 4? ? 4, which is close enough to the previously obtained upper bound ?√n? + ?n/?√n?? ? 2. We obtain a polynomial algorithm which, give a trace form of a Boolean function f, computes generating sets of functions of degree ≤ d for the following pair of spaces. Each function of the first (linear) space bounds f from below, and each function of the second (affine) space bounds f from above. Moreover, at the output of the algorithm, each function of a generating set is represented both as its trace form and as a polynomial of Boolean variables.     

On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections

We study the quantity p(n, k, t₁, t₂) equal to the maximum number of edges in a k-uniform hypergraph having the property that all cardinalities of pairwise intersections of edges lie in the interval [t₁, t₂]. We present previously known upper and lower bounds on this quantity and analyze their interrelations. We obtain new bounds on p(n, k, t₁, t₂) and consider their possible applications in combinatorial geometry problems. For some values of the parameters we explicitly evaluate the quantity in question. We also give a new bound on the size of a constant-weight error-correcting code.