A less conservative method for designing H∞ filters for linear time‐delay systems

This paper focuses on H_∞ filtering for linear time‐delay systems. A new Lyapunov–Krasovskii functional (LKF) is constructed by uniformly dividing the delay interval into two subintervals, and choosing different Lyapunov matrices on each subinterval. Based on this new LKF, a less conservative delay‐dependent bounded real lemma (BRL) is established to ensure that the resulting filtering error system is asymptotically stable with a prescribed H_∞ performance. Then, this new BRL is equivalently converted into a set of linear matrix inequalities, which guarantee the existence of a suitable H_∞ filter. Compared with some existing filtering results, some imposed constraints on the Lyapunov matrices are removed through derivation of the sufficient condition for the existence of the filter. Numerical examples show that the results obtained in this paper significantly improve the H_∞ performance of the filtering error system over some existing results in the literature. Copyright © 2008 John Wiley & Sons, Ltd.     

Robust stability and H∞ control for uncertain discrete Markovian jump singular systems with mode‐dependent time‐delay

The robust stochastic stability, stabilization and H_∞ control for mode‐dependent time‐delay discrete Markovian jump singular systems with parameter uncertainties are discussed. Based on the restricted system equivalent (r.s.e.) transformation and by introducing new state vectors, the singular system is transformed into a standard linear system, and delay‐dependent linear matrix inequalities (LMIs) conditions for the mode‐dependent time‐delay discrete Markovian jump singular systems to be regular, causal and stochastically stable, and stochastically stable with γ‐disturbance attenuation are obtained, respectively. With these conditions, robust stabilization problem and robust H_∞ control problem are solved, and the LMIs sufficient conditions are obtained. A numerical example illustrates the effectiveness of the method given in the paper. Copyright © 2008 John Wiley & Sons, Ltd.     

Controller synthesis with guaranteed closed-loop phase constraints

In this paper, we present an analysis and synthesis approach for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the interval [−α,α] for a given α>0 at all frequencies. Specifically, we first derive a sufficient condition involving a frequency domain inequality for guaranteeing a given phase constraint. Next, we use the Kalman–Yakubovich–Popov theorem to derive an equivalent time domain condition. In the case where , we show that frequency and time domain sufficient conditions specialize to the positivity theorem. Furthermore, using linear matrix inequalities, we develop a controller synthesis approach for guaranteeing a phase constraint on the closed-loop transfer function. Finally, we extend this synthesis approach to address mixed gain and phase constraints on the closed-loop transfer function.     

Controller certification

A modern problem from aerospace control involves the certification of a large set of potential controllers with either a single plant or a fleet of potential plant systems, with both plants and controllers being MIMO and, for the moment, linear. Experiments on a limited number of controller/plant pairs should establish the stability and a certain level of margin of the complete set. We consider this certification problem for a set of controllers and provide algorithms for selecting an efficient subset for testing. This is done for a finite set of candidate controllers and, at least for SISO plants, for compact infinite set. In doing this, the ν-gap metric will be the main tool. Computational examples are given, including one of certification of an aircraft engine controller. The overarching aim is to introduce truly MIMO margin calculations and to understand their efficacy in certifying stability over a set of controllers and in replacing legacy single-loop gain and phase margin calculations.     

A -based optimal finite-word-length controller design

A novel optimal Finite Word Length (FWL) controller design is proposed in the framework of μ theory. A computationally tractable close-loop stability measure with FWL implementation considerations of the controller is derived based on the μ theory, and the optimal FWL controller realizations are obtained by solving the resulting optimal FWL realization problem using linear matrix inequality techniques.     

WLAN中支持实时业务的自适应调度机制

针对IEEE 802.11e无线局域网参考调度算法分配定长的发送机会（TXOP）的缺陷,提出了一种支持实时业务的自适应调度机制。该机制通过终端反馈业务流发送队列的缓存数据量,动态分配变长TXOP以满足不同负载、不同业务的要求;当有新业务请求加入系统时,调度机制在保障现有业务最低时延的前提下,采用按比例减少现有业务的请求TXOP时间的长度的方式,并采用线性规划的优化方法,尽可能为新业务安排时间允许接入。详细的仿真实验及与IEEE 802.11e参考调度机制的比较表明,提出的调度机制提高了系统的吞吐量,有效地降低了实时业务的时延。     

基于LRC与多样本扩充的指静脉识别方法北大核心CSCD

针对目前手指静脉识别由于训练样本不足引起图像识别率低的问题,提出基于线性回归分类(linear regression classification,LRC)与多样本扩充的指静脉识别方法。首先,利用矩阵变换生成原始图像的镜像,训练原始图像与镜像,增加指静脉图像中包含的有用信息;然后,基于LRC对测试和训练样本进行分类;最后,通过计算偏差得到最终分类结果,求出识别率。此外,设计了一种指静脉采集装置收集得到自建指静脉数据库。实验结果表明:所提算法在自建指静脉数据库、山东大学指静脉数据库、马来西亚理工大学指静脉数据库上的识别率分别达到98.93%、98.89%、99.67%,最低等误率为2.3888%。实验结果与其他传统和流行算法相比具有明显优势,拥有良好的实际应用价值。     

Nanoscale Lacing by Electrons

The ability to harness the optical or electrical properties of nanoscale particles depends on their assembly in terms of size and spatial characteristics which remains challenging due to lack of size focusing. Electrons provide a clean and focusing agent to initiate the assembly of nanoclusters or nanoparticles. Here an intriguing route is demonstrated to lace gold nanoclusters and nanoparticles in string assembly through electron‐initiated nucleation and aggregative growth of Au(I)‐thiolate motifs on a thin film substrate. This size‐focused assembly is demonstrated by controlling the electron dose under transmission electron microscopic imaging conditions. The Au(I)‐thiolate motifs, in combination with the molecularly mediated alignment, facilitate the interstring electrostatic and intrastring aurophilic interactions, which functions as a molecular template to aid electron‐initiated 1D lacing. The findings demonstrate a hierarchical route for the 1D assemblies with size and spatial tunable catalytic, optical, sensing, and diagnostic properties.     

Parameterized complexity of control problems in Maximin election

Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter “number of added candidates”; both constructive and destructive control by adding/deleting voters are W[1]-hard with respect to the parameter “number of added/deleted voters”.     

A class of aggregation functions encompassing two-dimensional OWA operators

In this paper we prove that, under suitable conditions, Atanassov’s K_α operators, which act on intervals, provide the same numerical results as OWA operators of dimension two. On one hand, this allows us to recover OWA operators from K_α operators. On the other hand, by analyzing the properties of Atanassov’s operators, we can generalize them. In this way, we introduce a class of aggregation functions - the generalized Atanassov operators - that, in particular, include two-dimensional OWA operators. We investigate under which conditions these generalized Atanassov operators satisfy some properties usually required for aggregation functions, such as bisymmetry, strictness, monotonicity, etc. We also show that if we apply these aggregation functions to interval-valued fuzzy sets, we obtain an ordered family of fuzzy sets.