取代酚对日本长腿蛙蝌蚪急性毒性的QSAR研究

用Hartree-Fock(HF)和DFT-B3LYP方法,分别在较高基组6-31G**和6.311G**水平下,全优化计算了21种取代酚化合物.从中获得分予最高占用和最低空轨道能(EHOMO和ELUMO)、前线轨道能级差(△E＝EHOMO-ELUMO)、分子总能量(ET)、氧原了所带的最高正电荷(QH+)、最负原子的静电荷(Q-)、分子偶极矩(μ)和分子体积(V)等描述符.结合文献中标题化合物对日本长腿蛙蝌蚪的毒性值(-logLC50)和辛醇/水分配系数(logKow),由线性同归方法成功建立包含10gKow、ELUMO和Q-的三参数QSAR模型.其中,模型(5)的复相关系数R2=0.944 8,交叉验证系数Q2=0.920 5,标准偏差SE=0.187,Fisher检验值F=98.390,故其预测能力较好.由此推断,标题物对日本长腿蛙蝌蚪的毒性作用分为2步,首先穿过细胞壁在细胞内富集,以logKow和Q-描述;其次与亲核试剂发生亲电反应,以风ELUMO表示.     

Boosting集成回归在近红外光谱定量校正中的应用

针对物性参数和近红外光谱数据之间的回归模型的建立问题,基于建立一系列回归器的思想,给出了1种用于多变量校正的Boosting-PLS算法。每个(弱/基本)回归器均建立于原校正集的1个子集上,每个子集均通过原校正集带概率重复采样的方式得到,而样本的概率则由前1个回归器的预测误差确定。大误差的样本将增大概率,以便后续的回归器更集中地对其进行训练。最终的集成回归模型则为弱回归器的加权取中值。通过1个近红外应用实例和与偏最小二乘的比较,证实了Boosting-PLS算法的优良性能,所建校正模型更精确、更稳健,对过拟合不敏感。     

具有降阶模型的多模型鲁棒自适应控制

传统鲁棒自适应控制由于考虑了实际系统存在的不确定性,在一定程度上扩大了常规自适应控制的应用范围,但是传统鲁棒自适应控制大多只是从系统全局稳定性的角度出发来设计控制器而忽略系统动态和稳态性能,导致其无法在工况多变的实际被控系统中取得令人满意的效果。针对传统鲁棒自适应控制的不足,本文对由ARMA模型描述并包含未建模动态的系统设计了多模型鲁棒自适应控制器。首先采用正则化技术将系统未建模动态转化为系统有界扰动,并在系统降阶模型的基础上根据系统工况的变化设计了多个固定控制器和2个鲁棒自适应控制器,并根据性能指标函数选择最佳控制器作为当前系统控制器以提高系统性能。仿真实验说明当系统存在未建模动态以及系统工况发生变化时,本文设计的控制器能获得较好的控制效果。     

Real-time foveation filtering using nonlinear Mipmap interpolation

In recent years, several techniques have been proposed to simulate the gaze effect of the Human Visual System (HVS). It is believed that this effect is due to the foveation filtering. Current techniques to simulate the foveation filtering in computer graphics are either slow or suffer from artifacts and limitations. In this paper, we present a new approach of foveation filtering based on the Mipmap Pyramid of the current view by considering the relationship between the Gaussian kernel and Mipmap level. Due to the nonlinear Mipmap interpolation under the Bilateral Filtering scheme, we are able to simulate the foveation filtering more naturally and efficiently than in previous work. Moreover, a detail enhancement method based on the Cornsweet illusion is proposed to augment the gazing effect. We demonstrate our new approach with a variety of examples and provide comparisons with recent approaches.     

ADSP-TS201在无线电测向系统中的应用

介绍了一种基于ADSP-TS201的无线电测向系统。给出了系统的总体结构和工作原理,研究了MUSIC测向算法及基于零点预处理的波束合成算法,介绍了DSP模块的设计思想和程序流程图。实验证明,高性能的DSP芯片和优越的阵列信号处理算法保证了系统能够快速、准确地对信号进行定位和跟踪,满足了系统需求。     

电力线通信自动抄表系统中的电能表捕获算法

针对目前电力公司按照面向人工抄表的习惯组织划分用户资料,致使理清配电台区与用电户的关系需要耗费很大的精力,现场排查困难等问题,提出了集中器自动获取表号的线性时间算法。该算法基于报文冲突和快速二分搜索技术,为抄表系统实现即插即用奠定了基础。     

一种基于系统总误码率的协同伙伴选择算法

提出了一种基于系统总误码率的协同伙伴选择算法。当系统总发送功率一定时,通过系统误码率公式,采用带CRC校验的DF协同通信的协同增益,来降低系统总的误码率。仿真表明,此算法有效地降低了系统总误码率,并且系统SNR越大,协同通信对系统数据传输的帮助越明显。     

基于SoPC的实时说话人识别控制器

运用软硬件协同设计,在DE2-70开发板上实现了一个基于SoPC的实时说话人识别控制器,控制器有很好的实时性和良好的识别性能。控制器的语音特征参数采用线性预测倒谱系数(LPCC),匹配算法采用动态时间规整算法(DTW)。     

A generalized greedy routing algorithm for 2-connected graphs

Geometric routing by using virtual locations is an elegant way for solving network routing problems. In its simplest form, greedy routing, a message is simply forwarded to a neighbor that is closer to the destination. One main drawback of this approach is that the coordinates of the virtual locations require Ω(nlogn) bits to represent, which makes this scheme infeasible in some applications.The essence of the geometric routing is the following: When an origin vertex u wants to send a message to a destination vertex w, it forwards the message to a neighbor t, solely based on the location information of u,w and all neighbors of u. In the greedy routing scheme, the decision is based on decreasing distance. For this idea to work, however, the decision needs not be based on decreasing distance. As long as the decision is made locally, this scheme will work fine.In this paper, we introduce a version of greedy routing which we call generalized greedy routing algorithm. Instead of relying on decreasing distance, a generalized greedy routing algorithm uses other criteria to determine routing paths, solely based on local information. We present simple generalized greedy routing algorithms based on st-coordinates (consisting of two integers between 0 and n−1), which are derived from an st-orientation of a 2-connected plane graph. We also generalize this result to arbitrary trees. Both algorithms are natural and simple to be implemented.