随机幅度多项式相位信号的时延估计方法

研究了一类非平稳信号具有随机幅度的多项式相位信号的时延估计问题。充分利用信号的高阶循环平稳性，提出了一种基于信号高阶循环矩的时延估计方法。该方法容易实现，估计精度能有效地抑制加性平稳非高斯和任何高斯噪声。试验结果证明了提出方法的正确性。     

Y型喷嘴液膜随机破碎模型研究

采用Monte—Carlo法，综合考虑Y型喷嘴液膜破碎过程中表面扰动波长、液膜厚度及初始雾化液滴速度等分布的随机性，结合混合孔内气、液两相流动及二阶段雾化模型，建立Y型喷嘴雾化液滴粒度分布模型。利用FAM型激光粒度仪对实验喷嘴的雾化特性进行测试，测量结果与模型预测结果吻合较好。     

任意分布的均值的渐近有效估计

讨论一般随机分布的均值的区间估计问题,给出了一种求任意分布均值的置信区间的抽样方案：证明此抽样方案渐近有效,得出了关于任意分布均值的置信区间的新结果。     

从化市森林资源保护性开发对策

针对从化森林资源保护与开发现状,深入分析从化森林资源保护与开发过程中出现的问题,提出相应的对策：以保护性开发为前提,科学规划,合理分区,有效开发利用森林资源;治理病虫害,改良不良林分;提高服务质量,完善配套设施;加大投资力度,开发深层次具有从化特色的旅游产品和旅游纪念品。     

Dynamic spatial Bayesian models for radioactivity deposition

Dynamic spatial Bayesian (DSB) models are proposed for the analytical modelling of radioactivity deposition after a nuclear accident. The proposed models are extensions of the multi‐variate time‐series dynamic linear models of West and Harrison (1997) to Markov random field processes. They combine the outputs from a long‐range atmospheric dispersal model with measured data (and prior information) to provide improved deposition prediction in space and time. Two versions of a Gaussian DSB model were applied to the radioactivity deposition in Bavaria over a 15 days period during the Chernobyl nuclear accident. One version had fixed functional forms for its spatial variances and covariances while the other allowed those to adapt and ‘learn’ from data in the conjugate Bayesian paradigm. There were two main sources of information for radioactivity deposition in our application: radioactivity measurements at a sparse set of 13 monitoring stations, and the numerical deposition evaluation of the atmospheric dispersal K‐model for the points of a 64 × 64 regular grid. We have analysed the temporal predictions (one‐step‐ahead forecasting) of those DSB models to show that the dispersal K‐model tended in general to underestimate the deposition levels at all times while the DSB models corrected for that although with different degrees of adjustment.     

Central limit theorems for nonparametric estimators with real‐time random variables

In this article, asymptotic theories for nonparametric methods are studied when they are applied to real‐time data. In particular, we derive central limit theorems for nonparametric density and regression estimators. For this we formally introduce a sequence of real‐time random variables indexed by a parameter related to fine gridding of time domain (or fine discretization). Our results show that the impact of fine gridding is greater in the density estimation case in the sense that strong dependence due to fine gridding severely affects the major strength of nonparametric density estimator (or its data‐adaptive property). In addition, we discuss some issues about nonparametric regression model with fine gridding of time domain.     

Wonderful events automatic detection and location of the HCRF and webcast text

Based on the powerful function of the hidden conditional random fields (HCRF) model in the expression and identification of semantic events and combining the webcast text information, a new framework for wonderful events automatic detection is put forward. Firstly, by analyzing and processing the webcast text, keyword combinations corresponding to each exciting event are obtained. Secondly, by classifying the webcast text to be detected, the happening time labels of each wonderful event are obtained. Thirdly, an HCRF model for semantic shot annotation is built to realize the semantic annotation of multiple types of semantic shots simultaneously, and the semantic shot sequence of the video clip is obtained. Finally, combining the multi-modal semantic clues, an HCRF model for the wonderful events detection and localization is effectively built in the case of small-scale training samples. Based on the mapping relationship among video low-level features, the multi-modal semantic clues and the wonderful semantic events, the inherent patterns of the wonderful events are excavated deeply in the multiple dimensions of the semantic structure, and then the wonderful events automatic detection, localization and segmentation are precisely achieved. Experiments show the effectiveness of this model.     

遗传算法选择方法的比较分析

本文基于改进的基本遗传算法实验,对选择方法进行了比较分析的研究,测试了四种不同选择方法：轮盘赌选择法、锦标赛选择法、随机遍历选择法以及一种新的基于种群交流的选择方法,分析比较这四种不同选择方法封种群发展及最佳适应值的影响。结果表明各种选择方法各有特点。最後为了防止陷入局部收敛,而对轮盘赌选择方法进行了改进,并比较了改进前後的结果,发现改进后的结果要好一些。     

基于马尔可夫随机场的低分辨率车牌图像复原算法*

由于采集到的车牌图像分辨率较小,为获取高分辨率的图像,提出基于马尔可夫随机场模型的车牌图像超分辨率复原算法。首先对图像进行分块;然后利用马尔可夫随机场对这些分块进行建模,通过模型学习训练库中高低分辨率图像的关系,预测待复原的低分辨率车牌图像的高频细节信息。实验结果表明,本算法对车牌图像取得较好的复原效果,算法复原的超分辨率车牌图像更接近于真实图像,具有更高的峰值信噪比。     

COMPUTING MAXIMUM CLIQUES OF CIRCULAR ARCS IN PARALLEL*

Given a set S of n proper circular arcs, it is required to identify a largest cardinality subset K[S] of S each two of whose members intersect. This paper describes an optimal parallel algorithm to compute K[S]. The algorithm is not based on any previously known sequential solution, and is designed for the CREW PRAM model of computation. It uses 0(n/logn) processors and runs in O(logn) time. An interesting feature of the algorithm is that it transforms the computational geometric problem at hand, to a problem involving computations on 0-1 matrices, and then transforms the latter back into a ray shooting problem in computational geometry.