Convergence of iterated boolean sums of simultaneous approximants

Explicit error estimates are given for the iterated Boolean sum of a sequence of simultaneous approximants; the rate of convergence is shown to be improved for smooth functions. The general results are applied in the case of the Bernstein, Durrmeyer and Stancu operators.     

可调谐钛宝石双波长激光在β－BaB_2O_4晶体中和频

根据ＢＢｏ晶体Ｓｅｌｌｍｅｉｅｒ方程确定的折射率，计算了在钛宝石激光可调谐波段的和频相位匹配角。结果与实验基本一致。实验发现了４０７．３～３８４．６ｎｍ可调谐的紫－紫外相干光。     

幂级数和函数的解法综述

本文总结了求幂级数和函数的四种方法。一种方法是将待求级数分解成己知和函数的级数的运算（一般是加减）表达形式,然后逐一求和新的级数;第二种方法是“先求导,再积分”或“先积分,再求导”;第三种方法是把待求级数用基本初等函数的幂级数展开式表示出来;第四种方法是列写出和函数满足的微分方程,解此微分方程得到和函数。     

简支深梁用和函数法的级数解答

引用和函数法求解弹性力学平面问题, 对简支深梁受三角形荷载作用时的应力进行了分析,同时给出了该问题的付立叶级数解答,该方法不仅将求解弹性力学的偏微分方程组解耦成非耦联的几个偏微分方程,而且其结果与传统的Airy应力函数得到的解答完全一致, 证明了该方法的正确性和适用性,该方法拓展了将经典的弹性力学解析法用于解决工程实际问题的空间。     

FAST LINEAR ESTIMATION METHODS FOR VECTOR AUTOREGRESSIVE MOVING-AVERAGE MODELS

Abstract. Three linear methods for estimating parameter values of vector auto-regressive moving-average (VARMA) models which are in general at least an order of magnitude faster than maximum likelihood estimation are developed in this paper. Simulation results for different model structures with varying numbers of component series and observations suggest that the accuracy of these procedures is in most cases comparable with maximum likelihood estimation. Procedures for estimating parameter standard error are also discussed and used for identification of nonzero elements in the VARMA polynomial structures. These methods can also be used to establish the order of the VARMA structure. We note, however, that the primary purpose of these estimates is to generate initial estimates for the nonzero parameters in order to reduce subsequent computational time of more efficient estimation procedures such as exact maximum likelihood.     

基于多判据的散乱点云特征点提取算法

为了有效获取散乱点云中的尖锐特征点和边界特征点,提出一种利用多判据融合的特征点提取算法。首先利用一种改进的k-d tree构建点云拓扑,搜索样点的K局部邻域;然后利用法向夹角判定准则、核密度判定准则、场力和判定准则分别求取各个样点局部邻域的三个特征参数,最后通过加权计算特征参数得到每个样点的特征值与全局判定阈值,特征值比阈值大的点即为特征点。实验证明,该算法能有效的获取散乱点云中边沿特征点与尖锐特征点。     

Stochastic Optimal Design for Unknown Linear Discrete‐Time System Zero‐Sum Games in Input‐Output form Under Communication Constraints

In this paper, stochastic optimal strategy for unknown linear discrete‐time system quadratic zero‐sum games in input‐output form with communication imperfections such as network‐induced delays and packet losses, otherwise referred to as networked control system (NCS) zero‐sum games, relating to the H_∞ optimal control problem is solved in a forward‐in‐time manner. First, the linear discrete‐time zero sum state space representation is transformed into a linear NCS in the state space form after incorporating random delays and packet losses and then into the input‐output form. Subsequently, the stochastic optimal approach, referred to as adaptive dynamic programming (ADP), is introduced which estimates the cost or value function to solve the infinite horizon optimal regulation of unknown linear NCS quadratic zero‐sum games in the presence of communication imperfections. The optimal control and worst case disturbance inputs are derived based on the estimated value function in the absence of state measurements. An update law for tuning the unknown parameters of the value function estimator is derived and Lyapunov theory is used to show that all signals are asymptotically stable (AS) and that the estimated control and disturbance signals converge to optimal control and worst case disturbances, respectively. Simulation results are included to verify the theoretical claims.     

同分布PA序列部分和之和的弱大数定律

本文主要研究了同分布PA序列{Xn}的部分和之和Tn的弱大数定律,与I.I.D序列以及NA序列部分和之和的弱大数定律形成对照,从而进一步完善了PA序列的大数定律理论.     

基于距离和的孤立点用户意义分析算法及应用

有关孤立点分析的研究大多集中在如何高效地识别出孤立点,很少有研究提供对识别出的孤立点用户意义的解释。针对这一情况,提出了一种基于距离和的孤立点用户意义分析算法,针对每个孤立点都给出了其原因属性以及对该原因属性的描述,即给出了孤立点的用户意义。最后将该算法应用到质量管理中进行了实验。实验结果表明:该算法是行之有效的,有一定实用意义。     

Decentralized transceiver optimization for multi-relay aided multiuser MIMO networks

In this paper, the decentralized transceivers and corresponding channel state information （CSI） signaling concepts are proposed for weighted sum rate （WSR） maximization, via linear downlink transceiver＂ optimization in multi-relay aided multiuser multiple-input multiple-output （MIMO） networks. Three decentral- ized algorithms are proposed with the local CSI requirements at the base station （BS） and the relay nodes. In the first proposed algorithm, the generalized channel inversion precoding is used at the BS to avoid the second hop channel sharing requirements among the relay nodes, and decentralized transceiver optimization of the relay nodes and users are developed to maximize the WSR. A minimum mean square error （MMSE）-based enhanced method is proposed as well. To further improve the performance, we provide a novel structure of the precoding matrix of the BS. The decentralized joint BS, relay and user transceiver optimization problem is formulated and solved. Also, the CSI signaling and decentralized processing in the time division duplex （TDD） system are analyzed. Simulation results show the effectiveness of the decentralized transceiver design compared to the existing algorithms.