Output feedback controller for polytopic systems exploiting the direct searching of the design space

This paper deals with the problem of designing a robust static output feedback controller for polytopic systems. The current research that tackled this problem is mainly based on LMI method, which is conservative by nature. In this paper, a novel approach is proposed, which considers the design space of the controller parameters and iteratively partitions the space to small simplexes. Then, by assessing the stability in each simplex, the solution space for design parameters is directly determined. It has been theoretically proved that, if there exists a feasible solution in the design space, the algorithm can find it. To validate the result of the proposed approach, comparative simulation examples are given to illustrate the performance of the design methodology as compared to those of previous approaches.     

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

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

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

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

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

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

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

一种全局优化的多面体凸分解匹配方法

提出了一种全局优化的多面体匹配方法，该方法对物体的拓扑关系和结构关系进行多级匹配,利用全局优化的松驰迭代方法减少匹配误差，并由匹配的一致性准则进行匹配结果的检测，根据物体的内在特征来进行匹配，从而解决非同构物体的匹配.可广泛应用于物体识别、三维物体重建、医学图象处理等领域，实验证明此方法质量好、自动化程度高，是一种有效的全局优化结构匹配方法．     

渐变填充的性质和算法

本文着重研究了Jordan数字流形上的渐变填充,设计了紧缩渐变填充算法和分裂渐变填充算法;并证明:如果D是离散网格空间上的Jordan凸集,那么存在O(|D||D|)时间的紧缩算法去做渐变填充.最后,我们对Jordan正方形区域、三角域和圆盘,分别给出了它们各自的O(|D|log_2|D|)时间的分裂渐变填充算法.     

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.     

计算几何与并行算法

本文首先介绍了计算几何的基本概念,论述了计算几何的四个基本问题,即几何搜索问题、相交问题、邻接问题及凸壳问题。然后重点分析了凸壳构造问题,介绍了其最佳串行算法、及相应的并行算法。接着对一些计算几何的串行及并行算法进行了分析比较。最后提出了笔者对新一代并行计算机系统上设计计算几何并行算法的看法。