广义时滞系统的时滞依赖L2-L∞滤波

讨论广义时滞系统的L2-L∞滤波问题. 目的是设计全阶滤波器保证滤波误差系统的时滞依赖指数允许性和给定的L2-L∞性能指标. 通过解线性矩阵不等式获得所需的滤波器. 数值例子表明结果具有较小的保守性.     

基于混合线性模型的图像去噪

现有的图像去噪算法大多假设图像为分段平滑信号,通过滤除图像中的振动分量达到去噪的效果.如果将这类方法应用于纹理图像,则会导致图像细节信息的损失.该文针对保留图像细节的问题,提出了基于混合线性模型的去噪方法.新方法不假设图像分段平滑,仅假设图像具有自相似性,利用图像的相似性区分图像信号与噪声.文中使用统计学习的方法对图像区域进行聚类,并得到图像主成份,以主成份作为信号分量重组图像,从而对纹理图像取得很好的去噪效果.     

A new mixed integer linear programming model for product development using quality function deployment

Quality function deployment (QFD) is a product development process performed to maximize customer satisfaction. In the QFD, the design requirements (DRs) affecting the product performance are primarily identified, and product performance is improved to optimize customer needs (CNs). For product development, determining the fulfillment levels of design requirements (DRs) is crucial during QFD optimization. However, in real world applications, the values of DRs are often discrete instead of continuous. To the best of our knowledge, there is no mixed integer linear programming (MILP) model in which the discrete DRs values are considered. Therefore, in this paper, a new QFD optimization approach combining MILP model and Kano model is suggested to acquire the optimized solution from a limited number of alternative DRs, the values of which can be discrete. The proposed model can be used not only to optimize the product development but also in other applications of QFD such as quality management, planning, design, engineering and decision-making, on the condition that DR values are discrete. Additionally, the problem of lack of solutions in integer and linear programming in the QFD optimization is overcome. Finally, the model is illustrated through an example.     

Hypothesis testing in rank-size rule regression

This note examines testing methods for Paretoness in the framework of rank-size rule regression. Rank-size rule regression describes a relationship found in the analysis of various topics such as city population, words in texts, scale of companies and so on. In terms of city population, it is basically an empirical rule that log?(_S(i))$\log ?(S_{(i)})$ is approximately a linear function of log?(i)$\log ?(i)$ where _S(i)$S_{(i)}$ is the number of population of i  th largest city in a country. This is closely related to the so-called Zipf’s law. It is known that this kind of empirical observation is found when the city population is a random variable following a Pareto distribution. Thus one may be willing to test if city size has a Pareto distribution or not. Rosen and Resnick [K.T. Rosen, M. Resnick, The size distribution of cities: an explanation of the Pareto law and primacy, Journal of Urban Economics 8 (1980), 165–186] and Soo [K.T. Soo, Zipf’s law for cities: a cross country investigation, Regional Science and Urban Economics (35) 2005, 239–263] regress log?(_S(i))$\log ?(S_{(i)})$ on log?(i)$\log ?(i)$ and log?²(i)${\log ?}^2(i)$ and test the null of Paretoness by standard t-test for the latter regressor. It is found that t-statistics take large values and the Paretoness is rejected in many countries. We study the statistical properties of the t-statistic and show that it explodes asymptotically, in fact, by simulation and thus the t-test does not provide a reasonable testing procedure. We propose an alternative test statistic which seems to be asymptotically normally distributed. We also propose a test with the null hypothesis that the city size distribution is Pareto with exponent unity, which is a modification of the F-test.     

Random linear-quadratic mathematical models: Computing explicit solutions and applications

This paper deals with the study of linear random population models and with a random logistic model (where parameters are random variables). Assuming appropriate conditions, the stochastic processes solutions are obtained under closed form using mean square calculus. Expectation and variance expressions for the stochastic processes solutions are given and illustrative examples are included.     

On partitioned controllability of switched linear systems

When a switched linear system is not completely controllable, the controllability subspace is not enough to describe the controllability of the system over whole state space. In this case the state space can be divided into two or three control-invariant sub-manifolds, which form a control-related partition of the state space. This paper investigates when each component is a controllable sub-manifold. First, we consider when a sub-manifold is controllable for no control input case. Then the results are used to produce a necessary and sufficient condition assuring the controllability of the partitioned control-invariant sub-manifolds of a class of switched linear systems. An example is given to demonstrate the effectiveness of the results.     

Experience-consistent modeling: Regression and classification problems

In this study, we are concerned with system modeling which involves limited data and reconciles the developed model with some previously acquired domain knowledge being captured in the format of already constructed models. Each of these previously available models was formed on a basis of extensive data sets which are not available for the current identification pursuits. To emphasize the nature of modeling being guided by the reconciliation mechanisms, we refer to this mode of identification as experience-consistent modeling. The paper presents the conceptual and algorithmic framework by focusing on regression models. By forming a certain extended form of the performance index, it is shown that the domain knowledge captured by regression models can play a similar role as a regularization component used quite commonly in system identification. Experimental results involve both synthetic low-dimensional data and selected data coming from Machine Learning repository. The data used in the experiments tackle regression models as well as classification problems (two-class classifiers).     

Stabilizing switching design for switched linear systems: A state-feedback path-wise switching approach

This paper addresses the problem of switching stabilization for discrete-time switched linear systems. Based on the abstraction-aggregation methodology, we propose a state-feedback path-wise switching law, which is a state-feedback concatenation from a finite set of switching paths each defined over a finite time interval. We prove that the set of state-feedback path-wise switching laws is universal in the sense that any stabilizable switched linear system admits a stabilizing switching law in this set. We further develop a computational procedure to calculate a stabilizing switching law in the set.     

Recursive reduced least squares support vector regression

Combining reduced technique with iterative strategy, we propose a recursive reduced least squares support vector regression. The proposed algorithm chooses the data which make more contribution to target function as support vectors, and it considers all the constraints generated by the whole training set. Thus it acquires less support vectors, the number of which can be arbitrarily predefined, to construct the model with the similar generalization performance. In comparison with other methods, our algorithm also gains excellent parsimoniousness. Numerical experiments on benchmark data sets confirm the validity and feasibility of the presented algorithm. In addition, this algorithm can be extended to classification.