Effective lower bounds of wrap-around <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-discrepancy on three-level combined designs

How to obtain an effective design is a major concern of scientific research. This topic always involves high-dimensional inputs with limited resources. The foldover is a quick and useful technique in construction of fractional designs, which typically releases aliased factors or interactions. This paper takes the wrap-around L₂-discrepancy as the optimality measure to assess the optimal three-level combined designs. New and efficient analytical expressions and lower bounds of the wraparound L₂-discrepancy for three-level combined designs are obtained. The new lower bound is useful and sharper than the existing lower bound. Using the new analytical expression and lower bound as the benchmarks, the authors may implement an effective algorithm for constructing optimal three-level combined designs.     

Efficient Asymmetrical Extended Designs Under Wrap-Around L_2-Discrepancy

The purpose of the present article is to introduce a class of mixed two-and three-level extended designs obtained by adding some new runs to an existing mixed two-and three-level design.A formulation of wrap-around L_2-discrepancy for the extended designs is developed. As a benchmark of obtaining(nearly) uniform asymmetrical extended designs, a lower bound to the wrap-around L_2-discrepancy for our proposed designs is established. Thorough numerical results are displayed, which provide further corroboration to the derived theoretical results.     

Efficient Asymmetrical Extended Designs Under Wrap-Around <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-Discrepancy

The purpose of the present article is to introduce a class of mixed two- and three-level extended designs obtained by adding some new runs to an existing mixed two-and three-level design. A formulation of wrap-around L₂-discrepancy for the extended designs is developed. As a benchmark of obtaining (nearly) uniform asymmetrical extended designs, a lower bound to the wrap-around L₂-discrepancy for our proposed designs is established. Thorough numerical results are displayed, which provide further corroboration to the derived theoretical results.     

Improved delay-dependent stability criteria for systems with interval delay

This paper deals with the problem of stability for systems with delay varying in an interval.A new Lyapunov functional,which makes use of the information of both the lower and upper bounds of the interval time-varying delay,is proposed to derive some new stability criteria.Furthermore,the relationship of the time-varying delay and its lower bound and upper bound is taken into account.As a result,some less conservative delay-dependent stability criteria are obtained without ignoring any useful information in the derivative of Lyapunov functional,which are established in the forms of linear matrix inequalities.Numerical examples are provided to show that the obtained results are better than existing ones.     

Hierarchical Control for Large-Scale Systems

1. INTRODVCTIONSeveral hierarchical or muli-1evel optidrization approaches have been aPplied to large--sca1e colltro1 problemsduring the last three decades. The theoretical development of decomposition and co--ordination has grownby leaps and bounds [1] and many successful applications have been reported [2]. Recently, the multi-leveloptimization aPproach has benn extended illto large-scale multi--objective system [3, 4]. Most of the muli-level optimization approaches have, however, been…     

不确定非线性系统的二次稳定新方法

针对一类不确定非线性系统, 采用模糊技术, 提出了一种新的二次稳定控制方案. 应用模糊T-S模型和模糊逻辑系统对非线性系统建模, 所设计的模糊控制器使得闭环系统二次稳定并满足期望的L₂范数界. 该方案的主要优点是不对逼近误差和不确定性做约束假设. 仿真结果表明了该方案的可行性.     

基于观测器的一类不确定非线性系统自适应输出反馈控制

针对一类不确定非线性系统,基于非线性状态观测器采用回馈递推(Backstepping)设计方法提出了一种鲁棒自适应L2增益控制方案。该控制方案首先对系统的不可观测状态设计非线性状态观测器,在此基础上通过多步递推得到系统的控制律并设计了未知干扰的参数自适应律,使系统具有L2增益性能。同时把采用常规设计方法需要对过多参数进行辨识问题简化为只需对与未知干扰个数相同的参数进行辨识的问题,简化了控制器结构。最后通过仿真算例验证了所设计控制方案的有效性。     

A Fast Approximation Method for Partially Observable Markov Decision Processes

This paper develops a new lower bound method for POMDPs that approximates the update of a belief by the update of its non-zero states. It uses the underlying MDP to explore the optimal reachable state space from initial belief and select actions during value iterations, which significantly accelerates the convergence speed. Also, an algorithm which collects and prunes belief points based on the upper and lower bounds is presented, and experimental results show that it outperforms some of the state-of-art point-based algorithms.     

基于单纯形剖分确定非线性比式和问题全局解的新方法

针对经济与金融中出现的一类特殊非线性比式和问题,给出一种基于单纯形剖分的全局优化算法. 在算法中, 通过构造初始单纯形, 以及使用凸包络理论, 提出了一个确定原问题最优值下界的新方法. 在确定下界的同时, 将会得到原问题的n+1可行解, 这些可行解可以用于上界的改善. 理论上证明了算法的收敛性, 数值算例表明算法是有效可行的.     

New statistical model for radar HRRP target recognition

The mixture of factor analyzers (MFA) can accurately describe high resolution range profile (HRRP) statistical characteristics.But how to determine the proper number of the models is a problem.This paper develops a variational Bayesian mixture of factor analyzers (VBMFA) model.This procedure can obtain a lower bound on the Bayesian integral using the Jensen's inequality. An analytical solution of the Bayesian integral could be obtained by a hypothesis that latent variables in the model are independent.During computing the parameters of the model,birth-death moves are utilized to determine the optimal number of model automatically.Experimental results for measured data show that the VBMFA method has better recognition performance than FA and MFA method.     

The distribution-free newsvendor problem with balking and penalties for balking and stockout

This paper investigates the ordering policy for the newsvendor problem with customer balking and penalties for balking and stockout. Our analysis is based on the assumption that only the mean and the variance of the demand distribution are known. In contrast to the existing research, we provide a new tradeoff tool as a replacement of the traditional one to weigh the holding cost and the goodwill cost segment： the balking penalty cost and the stockout penalty cost. Specifically, in addition to the stockout penalty, we also introduce the balking penalty, provide a new proof of the optimality of robust ordering policy to guarantee that the lower bound of expected profit obtained by us is tight, and get an robust optimal order quantity which is an exact solution but not an approximate one as before. Numerical experiments are conducted to illustrate the effect of penalties for balking and stockout.     

PSO与相位因子优选对结合降低OFDM峰均比的算法

针对正交频分复用 (orthogonal frequency division multiplexing, OFDM)系统的峰均功率比高的缺点,提出一种新的相位因子优选对方法,降低OFDM系统的峰均比。相位因子优选对方法原理是,筛选出多个低峰均功率比的子序列,将这些子序列重组后传输来降低系统峰值平均功率比 (peak to average power ratio, PAPR)。把相位因子优选对方法、粒子群优化算法（particle swarm optimization, PSO）与相位因子优选对结合的方法与传统PSO方法对比验证。仿真结果表明,把PSO与相位因子优选对结合的方法应用在OFDM系统中,获得了优于传统PSO算法0.1~0.2 dB的PAPR性能值,证明了新方法的有效性。     

Optimal IPO mechanism with retail investors and two asymmetric institutional investors

The authors construct an IPO selling mechanism with risk neutral retail investors, and two institutional investors that are better-informed and less-informed, respectively. In the mechanism, in addition to the main constraints such as the individual rationality (IR), the incentive compatibility (IC), and the feasibility constraint (FC), the authors consider two more typical constraints: There is a lower bound and no bound for allocation of the shares to two institutional investors. The authors derive the explicit expression of the optimal allocation of the shares to the investors. Under the lower bound constraint, the optimal mechanism will encourage the better-informed bidder to report sufficiently higher signal in order to get shares. If he gets allocation of shares, then the higher signal he reports, the more shares he will get, and the more the issuer’s expected maximum revenue will be.     

Event-Triggered L1-Gain Control of Nonlinear Positive Switched Systems

This paper is concerned with the event-triggered L_1-gain control of a class of nonlinear positive switched systems. First, an event-triggering condition in the form of 1-norm is presented for the systems. By virtue of the event-triggering strategy, the original system is transformed into an interval uncertain system. An event-triggered L_1-gain controller is designed by decomposing the controller gain matrix into the sum of nonnegative and non-positive components. Under the design controller, the resulting closed-loop systems are positive and L_1-gain stable. The obtained approach is developed for the systems subject to input saturation. All presented conditions are solvable in terms of linear programming. Finally, two examples are provided to verify the effectiveness of the design.     

改进的自适应遗传算法在TDOA定位中的应用

针对无线通信到达时间差(time difference of arrival,TDOA)定位技术位置解算为复杂的非线性方程最优化问题,采用实数编码遗传算法,提出了改进的自适应遗传算法。该算法设计了自适应交叉率和变异率的计算公式,考虑了随着进化代数增加种群的整体变化,同时考虑了每代种群不同个体适应度的作用,并引入最优保存策略防止优良个体的破坏,能有效产生新的个体进而摆脱局部最优值的搜索达到全局最优解。仿真结果表明,改进的遗传算法性能稳定,进化收敛速度和TDOA定位估计精度都有较大的提高。     

奇异线性二次型微分鞍点对策的小波逼近解法

研究广义状态系统中线性二次型微分对策鞍点策略的数值求解问题。基于小波多尺度多分辨逼近特性 ,提出了一种数值求解新方法。该法基于Daubechies小波的优良性质 ,特别是将Daubechies小波基的积分运算矩阵、乘积矩阵和快速离散小波变换系数矩阵应用于原问题的主要方程 ,将原问题转化为矩阵代数优化问题 ,避免直接计算耦合Riccati微分方程。算法简洁明了 ,适合于计算机求解。实例计算结果显示 ,该算法是可行的     

多工件族无缓冲混合Flow Shop问题的模型和算法构建

旨在研究并解决一类从集装箱混合装卸作业环境中提取的多工件族无缓冲混合Flow Shop问题. 针对该问题的多工件族、无缓冲、部分专用机、与机器和顺序相关的准备时间和作业时间等特点, 构建了问题的混合整数线性规划模型. 鉴于问题的NP-hard特性, 构造型的启发式算法被构建, 核心思想是基于提出的机器库存和配额等概念, 动态构建含有三元副的调度列表, 三元副表示与其一一对应的工件在3阶混合Flow Shop中的加工轨迹. 通过仿真实验、下界分析, 发现算法能获得好的近优解和低的计算成本. 更为重要的是, 算法尤其适合解决大规模的实际问题.     

带装卸顺序约束的装载配送联合优化算法研究

互斥产品(如液体、危险化学品等)不能混装到同一个容器中,物流企业通常使用多隔舱运输车为顾客配送多种互斥产品,合理确定装载与配送路径是提高配送效率、降低配送成本的重要手段.本文考虑互斥产品的装卸顺序约束、在途运输时间约束等,构建了以配送成本最小化为目标的互斥产品装载配送联合优化模型,设计了求解模型的改进遗传算法,算法采用蜂王进化和基于概率的边重构交叉运算,有效提高了寻优能力.本文利用Augerat提供的车辆路径问题标准测试集构造算例测试算法的运行时间和求解效果.结果显示,改进遗传算法的求解效果明显优于经典遗传算法.对于小规模算例,改进的遗传算法可以得到精确最优解,对于中等规模和不超过101个顾客点的大规模算例,改进的遗传算法可以在130秒内得到近似最优解.本文的创新点在于构建了一类新的车辆路径扩展问题的数学模型并设计了求解模型的快速有效算法,为物流企业制定多类型互斥产品配送计划提供了理论依据和算法支持.     

Exponential L_1 Filtering of Networked Linear Switched Systems: An Event-Triggered Approach

The issues of event-triggered exponential L_1 filtering are studied for a class of networked linear switched systems. An event-triggered mechanism is proposed to enhance resource utilization in transmission, and save the communication cost of systems as well. Then, the filtering error system is reconstructed as a switched delay system with bounded disturbance through the input delay system approach. By resorting to the Lyapunov-Krasovskii functional approach and the average dwell time(ADT) technique, some interesting results are derived to guarantee the exponential stability with a prescribed L_1 disturbance rejection level. Further, an event-triggered exponential L_1 filter is designed via solving a set of feasible linear matrix inequalities(LMIs). Finally, the efficiency of the proposed results is verified through a numerical example and a PWM-driven boost converter circuit system.     

带学习效应的易变质供应链库存模型研究

根据订购固定成本带学习效应的易变质供应链库存模型,在有限期内,当需求为固定常数时,分析了两种情形下的最优订购策略。一类是允许发生短缺且缺货需要回补时,证明了最优解存在的唯一性,设计了求解最优订购策略的算法;另一类是不允许发生短缺时,将订购次数作为自变量,证明了系统总成本存在最优解的唯一性,给出了求得最优订购次数的计算方法。最后通过实例进行了验证。