A review on some classes of algebraic systems

ABSTRACT

In this paper, we review some algebraic control system. Precisely, linear and bilinear systems on Euclidean spaces and invariant and linear systems on Lie groups. The fourth classes of systems have a common issue: to any class, there exists an associated subgroup. From this object, we survey the controllability property. Especially, from those coming from our contribution to the theory.     

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

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

基于承包商预期收益不变的不平衡报价模型

在招标实践中,通常采用最低价中标原则,使得投标人不得不压低其投标价格。基于承包商预期收益不变的不平衡报价模型,是在“工程量清单报价”的条件下,考虑到施工中工程量的变化及施工顺序的影响,体现了资金的时间价值,在保持承包商预期收益不变的前提下,通过调整各分项工程的单价,来降低工程报价,以增加中标机会而建立的。所建立的模型简单,易于操作,并配以具体的工程实例,通过计算机求得其最优解,可供承包商投标报价时参考。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

Sequential Spectrum Analysis of the Sideband Components of Digital Amplitude-Modulated Signals

It is shown that, for the spectrum analysis of digital quasi-periodic signals, one must use a procedure based on approximating the sequence of data readouts by a first-order trigonometric polynomial with a varying frequency of its harmonic functions.     

MIMO系统的约束广义预测控制

讨论了输出终端带不等式约束情形的多输入多输出系统，说明了这些约束可以通过修改输入柔化系数而使其得以满足，在柔化系数的选择范围确定过程中，为了避免矩阵求逆，采用利用已知数据辨识参数的方法来确定柔化系数，从而使得问题简化。降低了计算量且加快了收敛速度。     

用DSP实现多目标实时跟踪

介绍了在 TMS3 2 0 C62 0 3上实现 4个目标的快速跟踪技术。为了提高实时性和精确度 ,采用线性汇编优化实现。1个 3 2 0× 160主窗口的 DSP平均处理时间为 2 m s,3个 60× 60副窗口的 DSP平均处理时间各为 0 .4ms,实现了复杂背景下低对比度目标的快速跟踪。实验结果证明跟踪效果良好 ,解决了以前窗口开不大、跟踪速度慢的问题     

应用时频分析方法辨识时变系统的模态参数

应用Gabor展开及Hilbert变换进行时变线性系统模态参数的辨识。利用非平稳信号的Gabor变换将结构响应信号表示在时频面上，并通过Gabor展开重构分离模态分量，建立每一阶模态的时变线性模型。对单模态时变线性模型应用Hilbert变换来辨识随时间变化的模态频率和阻尼。通过对刚度和阻尼慢变的两自由度系统模态参数的仿真辨识验证辨识方法的有效性。仿真结果表明：本文方法为时变线性系统的模态参数辨识提供了一条新的途径。     

集中药包与条形药包爆破漏斗及抛掷堆积研究

把集中药包拉成条形药包之后，其爆破漏斗变化有多大?条形药包能否改善抛掷堆积?可否用集中药包的爆破漏斗参数(n、R、R’、P)及经验方法来设计条形药包的爆破漏斗?本试验研究将回答这些问题。     

PIMS在企业生产经营中的应用

介绍PIMS在企业生产经营中的应用 ,运用PIMS可对炼油化工企业进行原油采购决策、加工保本点预算、效益预测、物流分配、整体流程优化、投资分析、瓶颈制约因素探讨、原料和产品库存管理、经济活动分析等 ,并结合生产装置特点和市场环境影响因素 ,获取最大生产经营效益。根据影子价格 ,找出提高效益的潜力 ,确定产品、中间产品或半成品合理价格 ,规范关联交易 ,增强企业市场应变能力 ,提高经济效益与管理水平。