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)理论,建立了模拟松纵坑切梢小蠹虫害的一种动态演化数学模型,并讨论了模型的收敛性.然后选用昆明小哨林场为背景,进行了各种抚育间伐决策的仿真,从中优选抚育间伐决策.结果表明:模拟优化方案与实际调查统计分析结果一致:均为弱度间伐与中弱度间伐控制蠹害效果最好.最后通过森林积材量与虫害程度之间的优化,给出了抚育间伐的优化策略.     

Asymptotic stability, ergodicity and other asymptotic properties of the nonlinear filter

In this work we study connections between various asymptotic properties of the nonlinear filter. It is assumed that the signal has a unique invariant probability measure. The key property of interest is expressed in terms of a relationship between the observation σ field and the tail σ field of the signal, in the stationary filtering problem. This property can be viewed as the permissibility of the interchange of the order of the operations of maximum and countable intersection for certain σ-fields. Under suitable conditions, it is shown that the above property is equivalent to various desirable properties of the filter such as

(a) uniqueness of invariant measure for the signal,

(b) uniqueness of invariant measure for the pair (signal, filter),

(c) a finite memory property of the filter,

(d) a property of finite time dependence between the signal and observation σ fields and

(e) asymptotic stability of the filter.

Previous works on the asymptotic stability of the filter for a variety of filtering models then identify a rich class of filtering problems for which the above equivalent properties hold.     

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     

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

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

Layered Video and Differentiated Coding for Adaptive QoS in Mixed Wired-Satellite Networks

Mobile networks are becoming nothing but a way to allow ubiquitous access to multimedia services. To allow efficient use of resources, new systems provide flexible bandwidth and different error protection techniques to match channel behavior. As the backbone network is increasingly becoming based on packet techniques and in particular on IP and related transport protocols, end to end service quality must be analyzed considering both the fixed and the mobile part. Source scalability may help in coping with a mixed and heterogeneous environment. In this work we present some results of a transmission chain comprising a scalable MPEG-2 coder, an IP network and a radio access exploiting the availability of satellites. It is shown that for a given target rate, differentiated coding can be exploited to achieve decodability and good quality at a channel SNR much lower that single layer streams. This revised version was published online in July 2006 with corrections to the Cover Date.     

自适应RBF神经网络在CDMA移动通信上行链路功率控制中的应用研究

提出了一种自适应RBF神经网络功率控制方案。详细研究了该网络在DS-CDMA通信中，进行上行链路闭环功率控制(基于信扰比(SIR))的应用理论，给出了该网络参数的计算方法。最后用计算机仿真法模拟出该控制器的运行性能。结果表明基于SIR的自适应RBF神经网络功率控制器能自适应地调整移动台的发射功率，使基站接收信号的信扰比始终非常接近于一个常数，且有比定步长功率控制更小的SIR跟踪误差，从而可以降低接收信号的中断概率、提高信道容量。     

Comparisons of pharynx, source, formant, and pressure characteristics in operatic and musical theatre singing

Belting, a vocal technique typically cultivated in musical theatre singing, differs timbrally from operatic singing in many interesting respects. The underlying phonatory differences have not been previously investigated in detail. Yet, belting is frequently associated with disturbances of voice function. Articulatory and phonatory characteristics are investigated in a female subject who is a professional singer (co-author JL) trained in both the operatic and belting styles and in an intermediate vocal technique (“mixed”). This article presents data obtained from this subject by video-fiberoptic observation of the pharynx, inverse filtering of airflow, and measurement of subglottal pressure. The results reveal that belting was characterized by very high subglottal pressures and sound levels, and apparently also by a comparatively high degree of glottal adduction. Comparisons with other investigations of related aspects of belting and operatic singing support the assumption that the data obtained from our subject are representative for these vocal techniques.     

在线滤波技术在光纤马赫-德尔交叉复用器中的应用

为构造出与理想梯形滤波器接近的滤波形状，在单级光纤马赫-德尔交叉复用器的基础上，引入在线滤波技术；通过增加干涉级数和调整2对干涉臂的干涉长度和耦合器的耦合比，实现了逼近宽带陡沿的滤波输出。通过与梯形滤波器傅里叶展开式的比较，计算得到了器件的最佳参数，器件的滤波性能以及温度稳定性相对于单级结构得到了明显提高。根据理论计算，成功制作出通道间隔为50GHz的样品器件。其输出为-0.5dB，带宽大于0.185nm，相邻通道隔离度大于30dB，满足了DWDM系统指标要求。