基于近似高斯金字塔的视觉注意模型快速算法

利用输入图像的近似高斯金字塔,将经典的基于显著性的视觉注意模型改造为时空开销更小的版本,从而使其更加适合在嵌入式实时系统中实现.首先采用矩形窗口近似圆形窗口,矩形平均算子近似高斯卷积核;然后采用“先做行累加,再做列累加”的方法来实现矩形平均算子,并直接采样计算出各个特征通道的显著性分布图,该算法关于输入图像像素点个数具有线性时间复杂度;最后,还给出了在显著性分布图中抑制已提取区域显著性的快速算法.在Berkeley分割图像库上的实验结果表明,该方法极大地减小了系统实现的时空开销,且输出结果的误差在可接受范围内.提出的用矩形窗口近似圆形窗口,用矩形平均算子近似高斯卷积核的方法,还适用于其他需要在嵌入式实时系统中实现的图像处理问题.     

On the combinatorial complexity of fuzzy pattern matching in music analysis

In music analysis it is a common requirement to search a musical score for occurrences of a particular musical motif and its variants. This tedious and time-consuming task can be carried out by computer, using one of several models to specify which variants are to be included in the search. The question arises: just how many variants must be explicitly considered? The answer has a profound effect on the computer time needed. In this paper, recurrence relations and closed form analytic expressions are derived for the run time complexity of two models of fuzzy pattern matching for use in music analysis; each model assumes the existence of an atomic exact pattern matching operation. The formulae so obtained are evaluated and tabulated as a function of their independent parameters. These results enable a priori estimates to be made of the relative run times of different music searches performed using either model. This is illustrated by applying the results to an actual musical example.Richard E. Overill, BSc, PhD, C.Math, FIMA, C.Eng, MBCS, MIEE, is Lecturer in Computer Science at King's College London. His research includes the design, analysis, and practical implementation of algorithms on supercomputers. He has also given lecture-recitals on the keyboard music of the Tudor composers Thomas Tallis (1985), John Blitheman (1991), and William Byrd (1993).     

时滞系统问题的一种近似解方法

本文对线性时滞微分方程边值函数问题提出一种级数近似解方法。其基本思想是利用正交多项式级数的近似性质把它近似地简化为一线性代数方程组的求解问题     

病态线性系统的控制模型设计及其迭代算法

建立一种解决病态线性系统的控制模型，得到求解病态线性系统近似解的一种新算法．该算法为病态线性系统利用计算机迭代求解提供了直接的算法依据，同时也适合于常态线性系统近似解的计算．最后将新算法与传统的Gauss—Seidel算法进行比较．     

自反传递粗集中近似算子与拓扑算子的复合

在内部算子、闭包算子和近似算子概念的基础上，研究了内部算子、闭包算子与自反传递粗集中近似算子的复合以及交叉复合，得到了它们之间的一些关系．     

Identifying cell-to-cell variability in internalization using flow cytometry

Biological heterogeneity is a primary contributor to the variation observed in experiments that probe dynamical processes, such as the internalization of material by cells. Given that internalization is a critical process by which many therapeutics and viruses reach their intracellular site of action, quantifying cell-to-cell variability in internalization is of high biological interest. Yet, it is common for studies of internalization to neglect cell-to-cell variability. We develop a simple mathematical model of internalization that captures the dynamical behaviour, cell-to-cell variation, and extrinsic noise introduced by flow cytometry. We calibrate our model through a novel distribution-matching approximate Bayesian computation algorithm to flow cytometry data of internalization of anti-transferrin receptor antibody in a human B-cell lymphoblastoid cell line. This approach provides information relating to the region of the parameter space, and consequentially the nature of cell-to-cell variability, that produces model realizations consistent with the experimental data. Given that our approach is agnostic to sample size and signal-to-noise ratio, our modelling framework is broadly applicable to identify biological variability in single-cell data from internalization assays and similar experiments that probe cellular dynamical processes.     

一种改进的气动弹性时域推进方法

针对气动弹性控制方程,结构项采用标准龙格库塔方法推进,广义气动力项采用时间上的插值技术,发展了一种在每一时间步内只用计算一次非定常气动力的近似四阶龙格库塔推进方法。通过计算非线性Bernoulli方程和某一超音速翼面的气动弹性响应,证明该方法的时间准确度远高于采用气动力冻结技术的四阶龙格库塔方法。其准确度与标准龙格库塔方法相差不大,而其调用非定常气动力求解器的次数仅为其四分之一,大大提高了气动弹性数值模拟的效率。对于一般的气动弹性响应而言,该时间推进方法只用保证每个周期内的时间步在20～30个左右就能满足较高的准确度要求。     

弹道方程边值问题中的直射弹道公式

本文探求了属于微分方程边值问题的直射弹道公式,以形简、意明、精确度高、研究方法的多样性和事物规律的不同表现形式为特征。在直射弹道的定义和数学描述之后,先从它的微分方程出发推导出了公式;再从方程的数字解出发探寻并确立了其规律性。     

基于稀疏重构的跳频信号时频分析方法

针对现有时频分析方法存在噪声抑制能力弱、时频聚集性不强的缺点,提出了一种基于稀疏重构的跳频信号时频分析方法来获取清晰的、高聚集度的时频图。首先根据惩罚函数的思想建立了跳频信号无约束的稀疏重构模型;然后理论分析了罚函数因子的取值标准;最后用近似l0范数算法求解得出跳频信号的时频图。仿真结果表明该算法能够有效地获取跳频信号的时频图。     

矩形窗正交时频空检测算法

针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统采用矩形窗函数时,信道矩阵结构复杂导致的鲁棒性差的问题,提出了一种基于时域处理和酉近似消息传递的检测算法。该算法首先添加循环前缀,将时域信道转换为分块对角矩阵;然后应用酉变换和近似消息传递建立迭代检测算法。仿真结果表明,所提检测算法能够在不增加复杂度的条件下有效提升检测精度和鲁棒性,特别是存在信道编码的条件下表现出2 dB的性能增益,使得该算法更适用于杂散多径、高速移动等环境,具有较高的应用价值。