幂等矩阵线性组合的可逆性

设T1,T2,T3是三个不同的两两相互可交换的n×n非零的三次幂等矩阵,并且c1,c2,c3是非零数.本文主要给出了线性组合c1T1 c2T2 c3T3可逆性的刻画.     

Almost sufficient and necessary conditions for permanence and extinction of nonautonomous discrete logistic systems with time-varying delays and feedback control

A class of nonautonomous discrete logistic single-species systems with time-varying pure-delays and feedback control is studied. By introducing a new research method, almost sufficient and necessary conditions for the permanence and extinction of species are obtained. Particularly, when the system degenerates into a periodic system, sufficient and necessary conditions on the permanence and extinction of species are obtained. Moreover, a very important fact is found in our results, that is, the feedback control and delays are harmless for the permanence and extinction of species for discrete single-species systems. This shows that in a discrete single-species system introducing the feedback control to factitiously control the permanence and extinction of species is useless.     

The asymptotic behavior of a nonautonomous eco-epidemic model with disease in the prey

A nonautonomous eco-epidemic model with disease in the prey is formulated and studied. Some sufficient and necessary conditions on the permanence and extinction of the infective prey are established by introducing the new research method. Some sufficient conditions on the global attractivity of the model are presented by constructing a Lyapunov function. Finally, an example is given to show that the periodic model is global attractivity if the infective prey is permanent.     

Mean square exponential stability in high-order stochastic impulsive neural networks with time-varying delays

In this paper, we consider a class of stochastic impulsive high-order neural networks with time-varying delays. By using Lyapunov functional method, LMI method and mathematics induction, some sufficient conditions are derived for the globally exponential stability of the equilibrium point of the neural networks in mean square. It is believed that these results are significant and useful for the design and applications of impulsive stochastic high-order neural networks.     

Optimal manufacturer’s replenishment policies in the EPQ model under two levels of trade credit policy

In 2007, Huang proposed the optimal retailer’s replenishment decisions in the EPQ model under two levels of trade credit policy, in which the supplier offers the retailer a permissible delay period M, and the retailer in turn provides its customer a permissible delay period N (with N < M). In this paper, we extend his EPQ model to complement the shortcoming of his model. In addition, we relax the dispensable assumptions of N < M and others. We then establish an appropriate EPQ model to the problem, and develop the proper theoretical results to obtain the optimal solution. Finally, a numerical example is used to illustrate the proposed model and its optimal solution.     

Tracking a near-field moving target using fuzzy neural networks

In this paper we explore the problem of tracking a near-field moving target using fuzzy neural networks (FNNs). The moving target radiates narrow band waves that impinge on an array of passive sensors. At a particular time instance, the location of the target is estimated by several judiciously constructed FNN-based angle and distance estimators. When the target is moving, its trajectory can be on-line estimated due to the parallel and real-time computational capability of the FNNs. Computer simulation results illustrate the performance of the FNN-based angle estimator, distance estimator, and the near-field moving target tracker.     

ω-条件下Ulm-type方法的局部收敛性

由于牛顿法具有重要的理论基础和广泛的应用背景,它的收敛性得到了广泛研究([2,3,4,13,20,21,22,23]).—般而言,牛顿法的收敛性可以分成三类.一类是局部收敛性:已知方程(1)的解存在,初始点x0在该解的某个领域内时讨论牛顿法的收敛性([21,22,23]).     

Smoothed analysis of termination of linear programming algorithms

 We perform a smoothed analysis of a termination phase for linear programming algorithms. By combining this analysis with the smoothed analysis of Renegar's condition number by Dunagan, Spielman and Teng (http://arxiv.org/abs/cs.DS/0302011) we show that the smoothed complexity of interior-point algorithms for linear programming is O(m ³ log(m/Σ)). In contrast, the best known bound on the worst-case complexity of linear programming is O(m ³ L), where L could be as large as m. We include an introduction to smoothed analysis and a tutorial on proof techniques that have been useful in smoothed analyses. Received: December 10, 2002 / Accepted: April 28, 2003 Published online: June 5, 2003 Key words. smoothed analysis – linear programming – interior-point algorithms – condition numbers Mathematics Subject Classification (1991): 90C05, 90C51, 68Q25     

Smoothed analysis of condition numbers and complexity implications for linear programming

We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to a slight Gaussian perturbation. In particular, we show that for every n-by-d matrix Ā, n-vector [`(\varvec b)]{\bar{\varvec b}}, and d-vector [`(\varvec c)]{\bar{\varvec c}} satisfying ||[`(A)], [`(\varvec b)], [`(\varvec c)]||_F ￡ 1{{||\bar{\bf A}, \bar{\varvec b}, \bar{\varvec c}||_F \leq 1}} and every σ ≤ 1,