THE INVERSE EIGENPROBLEM WITH RANK-ONE UPDATING AND ITS STABLITY

Let ∑, Г be two n-by-n diagonal matrices with σi,γi as their diagonals. For the inverse eigenvalue problem: look for y∈Rn such that Г + yyT is similar to ∑, we prove thatu also the sufficient condition for the solvability of this inverse problem. Its solution (set) is given explicitly. In some case, the problem is unstable. But we prove that the sums of the square of some contigious components keep stable, i.e., small sum keeps small, large sum has a small relative perturbation, see Theorem 3.     

基于拍卖的网络带宽分配方法的研究

基于拍卖的网络带宽分配方法的研究日益受到学术界的重视,主要集中在具有激励兼容性的Vickrey拍卖上.本文首先分析并比较了目前最具代表性的两种Vickrey拍卖方案(灵活市场模型和改进的第二价格拍卖),指出其在网络可扩展性、工程效率等方面的不足.然后提出了一种新的基于统一价格拍卖的资源分配算法,论证了其在网络这一特定环境中具有激励兼容性.该算法具有与网络状态无关的特性和更高的运行效率.最后,用NS-2仿真平台验证了该算法的有效性.     

Point Cloud Geometry Compression Based on Multi-Layer Residual Structure

Point cloud data are extensively used in various applications, such as autonomous driving and augmented reality since it can provide both detailed and realistic depictions of 3D scenes or objects. Meanwhile, 3D point clouds generally occupy a large amount of storage space that is a big burden for efficient communication. However, it is difficult to efficiently compress such sparse, disordered, non-uniform and high dimensional data. Therefore, this work proposes a novel deep-learning framework for point cloud geometric compression based on an autoencoder architecture. Specifically, a multi-layer residual module is designed on a sparse convolution-based autoencoders that progressively down-samples the input point clouds and reconstructs the point clouds in a hierarchically way. It effectively constrains the accuracy of the sampling process at the encoder side, which significantly preserves the feature information with a decrease in the data volume. Compared with the state-of-the-art geometry-based point cloud compression (G-PCC) schemes, our approach obtains more than 70–90% BD-Rate gain on an object point cloud dataset and achieves a better point cloud reconstruction quality. Additionally, compared to the state-of-the-art PCGCv2, we achieve an average gain of about 10% in BD-Rate.     

有限元模型阻尼特性的复参数修正方法研究

阻尼对于结构动力学响应具有重要的影响,但有限元模型一般很难对阻尼特性进行精确建模.基于实测频响函数,研究了一种有限元模型阻尼特性的复参数修正方法.以待修正区域各单元质量、刚度矩阵的比例修正系数为复修正参数,建立了单元矩阵比例修正的灵敏度方程直接算法,并对比分析了复修正参数与不同阻尼特性之间的数学关系.以六自由度集中参数模型和25杆平面桁架模型为例,验证了复参数修正方法在阻尼特性修正中的有效性.     

基于随机投影和稀疏表示的跟踪算法

针对目标跟踪过程中存在的诸多技术问题,该文提出一种鲁棒的目标跟踪方法。首先,该文采用基于稀疏表示的全局模板描述目标的表观状态,通过构造正负模板以区分目标和背景;然后采用随机投影法对表示模板和候选目标进行降维,以降低算法的时间复杂度;采用粒子滤波法作为目标的运动模型,通过多项式重采样方法进行粒子重采样,以保持粒子的多样性;设计了正负模板更新策略,将正模板分为固定集和更新集,对这两部分在相似度计算和正模板更新时采取不同的处理方法,并且在其中加入目标遮挡的判决机制,从而可以有效避免遮挡的影响;实验结果表明,该算法能够准确跟踪受遮挡、运动模糊等多种复杂场景的目标,与现有跟踪方法相比,所提算法具有更好的准确性和稳定性。     

一种动态更新失真代价的自适应k隐写算法

基于失真函数的自适应隐写技术在嵌入过程中,忽略了嵌入操作相互间的影响,隐写策略无法随载体统计特性的改变自适应地调节。考虑嵌入操作的交互影响,该文提出一种基于动态更新失真代价的k隐写算法。首先分析了中心像素与其邻域的相关性,理论证明了在4-邻域修改情况下中心像素的最优修改方式,进而提出了失真代价更新策略MDS(Modification Degree Strategy);并结合该策略设计实现了一种自适应k隐写算法。实验表明,五元修改方式下算法UNIWARD-MDS(Pentary Version)在高嵌入率下(0.5~1.0 bpp)的抗SRM检测性优于S-UNIWARD(Pentary Version),同时在抵抗maxSRMd2检测时不同嵌入率下均优于S-UNIWARD(Pentary Version);三元修改方式下算法HILL-MDS和UNIWARD-MDS(Ternary Version)抗检测性能优于对应的自适应隐写算法HILL和S-UNIWARD(Ternary Version)。     

基于节点密度的自适应EFG法拓扑优化方法研究

针对无网格法拓扑优化中设计变量庞大、计算效率低的问题,提出了基于节点密度的自适应EFG拓扑优化方法.该方法以节点相对密度为设计变量,建立了以结构柔度最小为优化目标的自适应EFG拓扑优化模型,给出了拓扑优化中自适应节点加密准则、节点加密方法和新增节点设计变量更新规则.算例结果表明,采用论文提出的自适应EFG拓扑优化方法进行结构拓扑优化时,可以减少结构分析和优化的设计变量数目,提高优化效率.     

基于在线判别式字典学习的鲁棒视觉跟踪

现有子空间跟踪方法较好地解决了目标表观变化和遮挡问题,但是它对复杂背景下目标跟踪的鲁棒性较差。针对此问题,该文首先提出一种基于Fisher准则的在线判别式字典学习模型,利用块坐标下降和替换操作设计了该模型的在线学习算法用于视觉跟踪模板更新。其次,定义候选目标编码系数与目标样本编码系数均值之间的距离为系数误差,提出以候选目标的重构误差与系数误差的组合作为粒子滤波的观测似然跟踪目标。实验结果表明：与现有跟踪方法相比,该文跟踪方法具有较强的鲁棒性和较高的跟踪精度。     

Age Analysis of Status Updating System with Probabilistic Packet Preemption

The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is Ber/Geo/1/2*/η, which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability η. Instead of considering the system’s AoI separately, we use a three-dimensional state vector (n,m,l) to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system’s average AoI and show that the average AoI of the system without packet preemption is obtained by letting η=0. When η is set to 1, the mean of the AoI of the system with a Ber/Geo/1/2* queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the Ber/Geo/1/c queue and the average continuous AoI with the M/M/1/c queue. For each of two extreme cases where η=0 and η=1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability η, as well as the AoI’s distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.     

PROGRESSIVE DAMAGE ARREST MECHANISM IN TAILORED LAMINATED PLATES WITH A CUTOUT

This study addresses the effectiveness of a simple stiffness tailoring concept to delay damage initiation, control damage progression, and improve residual strength in tensile-loaded composite plates with a central circular cutout. The tailoring concept is to simply reposit all axially oriented （0°） material into regions near the edge of the plate away from the cutout. This tailoring is done in a way so as not to affect the weight of the plate. This accomplishes several beneficial changes in the way that the plate resists loading with no increases in material cost or weight. Lowering the axial stiffness of the laminate surrounding the cutout lowers the stress concentration. Increasing the axial stiffness near edges of the plate attracts loading away from the vicinity of the cutout to further lower stresses in the critical cutout region. This study focuses on in-plane response including damage progression and residual strength as a function of the degree of tailoring and cutout size. Strength and stiffness properties typical of IM7/8551-7 preperg material were assumed and a modified version of the Hashin failure criteria was used to identify the local damage. Results show that tailoring can significantly increase the damage initiation load and the residual strength. In some cases, observed evidence shows that tailoring performs as a damage arrest mechanism.