LTE系统多小区上行联合功控算法

针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标，忽略了当前小区用户对邻小区用户同频干扰的问题，为提升边缘用户性能的同时兼顾系统整体性能，提出了一种LTE系统小区间上行联合功率控制（UJPC）算法。该算法采用单基站三扇区为系统模型，以最优化系统吞吐量比例公平函数为目标，首先根据最小信干噪比（SINR）约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型，然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明，与基准的开环功控方案相比，联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率，其最佳性能增益能达到50%。     

用单透镜变换由多模光纤出射的大功率Nd：YAG激光束的特性

根据理论假设，通过选取单透镜的参数和位置，计算说明了单透镜使经由多模光纤出射的大功率Ｎｄ：ＹＡＧ激光束的发射角压缩，光束聚焦效率提高，光束截面场为高斯分布；文中的计算结果符合已知规律，从而说明了理论假设的正确性。     

最大熵重建的迭代凸I投影算法

本文探讨了用迭代凸Ｉ投影（ＩｔｅｒａｔｉｖｅＣｏｎｖｅｘＩ－Ｐｒｏｊｅｃｔｉｏｎ，ＩＣＩＰ）算法求解最大熵Ｘ－ＣＴ重建问题．其思路是将这个复杂问题转化为多个简单子问题，然后迭代地求解这种单约束子问题．理论证明，这种算法收敛并能收敛到问题的最大熵解．这种算法形式优美，仿真结果表明算法同时也是有效的．     

Fixed point theorems on fuzzy normed linear spaces

In this paper, definitions of strongly fuzzy convergent sequence, l-fuzzy weakly convergent sequence and l-fuzzy weakly compact set are given in a fuzzy normed linear space. The concepts of fuzzy normal structure, fuzzy non-expansive mapping, uniformly convex fuzzy normed linear space are introduced and fixed point theorems for fuzzy non-expansive mappings are proved.     

无限维的不可微凸规划

本文在局部凸Ｈａｕｓｄｏｒｆｆ线性拓扑空间中讨论了一类不可微的凸规划，得到了Ｋｕｈｎ－Ｔｕｃｋｅｒ最优性条件和对偶定理。     

不确定离散系统的鲁棒Gl2滤波器设计

对于凸多面体不确定离散系统,研究了满足误差估计系统鲁棒稳定且满足一定Gl₂性能指标的线性全阶稳定滤波器设计方法.分别给出了确定性和不确定性离散系统具有Gl₂性能的线性矩阵不等式（linear matrix inequality, LMI)充要条件和充分条件.在此基础上,通过使用滤波器参数化方法,分别推导出了以LMI描述的确定性和不确定性系统的Gl₂滤波器存在的充要条件和充分条件,进而可以使用LMI凸优化程序求解滤波器.通过对算例的计算,结果表明,在噪声信号为独立范数有界情况下,鲁棒Gl₂滤波比H_∞滤波具有更少的保守性.     

Quadratic approximate dynamic programming for input‐affine systems

We consider the use of quadratic approximate value functions for stochastic control problems with input‐affine dynamics and convex stage cost and constraints. Evaluating the approximate dynamic programming policy in such cases requires the solution of an explicit convex optimization problem, such as a quadratic program, which can be carried out efficiently. We describe a simple and general method for approximate value iteration that also relies on our ability to solve convex optimization problems, in this case, typically a semidefinite program. Although we have no theoretical guarantee on the performance attained using our method, we observe that very good performance can be obtained in practice.Copyright © 2012 John Wiley & Sons, Ltd.     

Robust consensus for uncertain multi‐agent systems with discrete‐time dynamics

This paper investigates robust consensus for multi‐agent systems with discrete‐time dynamics affected by uncertainty. In particular, the paper considers multi‐agent systems with single and double integrators, where the weighted adjacency matrix is a polynomial function of uncertain parameters constrained into a semialgebraic set. Firstly, necessary and sufficient conditions are provided for robust consensus based on the existence of a Lyapunov function polynomially dependent on the uncertainty. In particular, an upper bound on the degree required for achieving necessity is provided. Secondly, a necessary and sufficient condition is provided for robust consensus with single integrator and nonnegative weighted adjacency matrices based on the zeros of a polynomial. Lastly, it is shown how these conditions can be investigated through convex programming by exploiting linear matrix inequalities and sums of squares of polynomials. Some numerical examples illustrate the proposed results. Copyright © 2013 John Wiley & Sons, Ltd.     

KKM映射和KKM型定理及其相关结果

简要介绍古典的KKM映射的演变过程和KKM理论的发展历史,并给出利用KKM型定理得到的最近的一些重要研究成果,以进一步了解和掌握并研究KKM理论．