Locally Adaptive Wavelet Empirical Bayes Estimation of a Location Parameter

The traditional empirical Bayes (EB) model is considered with the parameter being a location parameter, in the situation when the Bayes estimator has a finite degree of smoothness and, possibly, jump discontinuities at several points. A nonlinear wavelet EB estimator based on wavelets with bounded supports is constructed, and it is shown that a finite number of jump discontinuities in the Bayes estimator do not affect the rate of convergence of the prior risk of the EB estimator to zero. It is also demonstrated that the estimator adjusts to the degree of smoothness of the Bayes estimator, locally, so that outside the neighborhoods of the points of discontinuities, the posterior risk has a high rate of convergence to zero. Hence, the technique suggested in the paper provides estimators which are significantly superior in several respects to those constructed earlier.     

松纵坑切梢小蠹虫害的仿真模型与生态防治的优化策略

根据松纵坑切梢小蠹的主要生物学特征,通过分析抚育间伐持续控制松纵坑切梢小蠹虫害的机理,应用复杂适应系统(CA S)理论,建立了模拟松纵坑切梢小蠹虫害的一种动态演化数学模型,并讨论了模型的收敛性.然后选用昆明小哨林场为背景,进行了各种抚育间伐决策的仿真,从中优选抚育间伐决策.结果表明:模拟优化方案与实际调查统计分析结果一致:均为弱度间伐与中弱度间伐控制蠹害效果最好.最后通过森林积材量与虫害程度之间的优化,给出了抚育间伐的优化策略.     

功能性丙烯酸/MBAM体系共聚产物的研制

以丙烯酸和MBAM为主要原料，经聚合，合成了一种高性能的具有良好保水性能的聚合产物，其保水量达到750～1000倍．50℃以下有良好的保水性能，28℃以下有极好的保水性能，并研究了工艺条件对该产品性能的影响因素．     

Axisymmetric Collision Problem for Two Identical Elastic Solids of Revolution

A direct central collision of two identical bodies of revolution is studied. A nonstationary mixed boundary-value problem with an unknown moving boundary is formulated. Its solution is represented by a series in term of Bessel functions. An infinite system of Volterra equations of the second kind for the unknown expansion coefficients is derived by satisfying the boundary conditions. The basic characteristics of the collision process are determined depending on the curvature of the frontal surface of the bodies     

稀薄气体二维外部柱体绕流特性研究

本文采用直接模拟蒙特卡罗方法对稀薄气体二维外部柱体绕流问题进行了数值模拟。结果表明:外部绕流问题,在特定情况下会产生激波,激波的产生,不仅与气体的稀薄程度有关,还与来流马赫数有关。而气流与壁面之间的换热,随来流马赫数增加而增加,随气体稀薄程度增加而减小。     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

互补型自适应滤波器在心磁信号处理中的应用

将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发，提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计，有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明，该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理. 关键词： 自适应滤波 心磁图 最小均方误差     

A Low-Complexity Multiuser Detector for Asynchronous CDMA QPSK Adaptive Antenna Array Systems

This paper proposes a low complexity joint space-time multiuser detection algorithm for asynchronous DS/CDMA antenna array systems. The proposed multiuser detector is composed of an adaptive antenna array, used as a linear beamformer, and a sliding window decorrelator. A QPSK modulation scheme is used in order to increase bandwidth efficiency. Numerical results are given in terms of Bit Error Rate (BER) under the assumption of a frequency-selective Rayleigh slow fading channel. In particular, the proposed receiver is shown to be near-far resistant, even in worst fading cases, and to exploit completely array introduction while maintaining acceptable computational complexity. The proposed architecture avoids linear filter realization of the decorrelator, which is impractical in the case of a large number of users, and operates with relatively short data frames instead of the complete information sequence. Finally, this receiver is very flexible to changes in timing configuration.     

SAR图像组合分割算法

由于存在乘性斑点噪声的影响,给SAR图像分割造成很大困难,本文研究利用最大似然区域增长分割算法,提出区域增长前引入自适应边缘检测,图像分割性能获得较大提高.介绍了我们研究的分割性能优异的模拟退火分割算法,提出了分割性能接近模拟退火并且在SAR图像分割中比较实用的模拟退火和最大似然混合分割算法,并给出了这些分割算法的分割性能比较,以及在实际分割SAR图像时应当如何选择分割算法.