磁悬浮硬盘转子控制系统中时序电路测试技术

为提高磁悬浮硬盘转子控制系统的可靠性，提出了对时序芯片的测试方法：手工测试和计算机辅助测试；及时时序电路逻辑功能的两种检测技术；基于状态表的测试技术和自动检测技术。对于时序芯片，手工测试方法效率较低，计算机辅助测试方法适用范围更广；对于电路逻辑功能，基于状态表的测试技术操作相对困难，但无须增加额外测试电路；自动检测技术操作简单，且测试速度快，但需要增加辅助检测电路。时序电路测试技术对保证悬浮硬盘转子各组成部分协同工作十分重要。     

Effects of Plasmodium berghei infection on arteether metabolism and disposition

Arteether (AE) is primarily deethylated to dihydroqinghaosu (DQHS) in rats and humans. Conversion of AE to DQHS was impaired in microsomes from rats infected with Plasmodium berghei. The Km for AE was 175.1 +/- 49.1 and 124.4 +/- 115.1 mumol/l, and Vmax was 2.24 +/- 0.45 and 1.22 +/- 0.67 nmol AE formed/mg protein/min in control and infected microsomes (p < 0.05), respectively. Calculated intrinsic clearance (CLint = initial Vmax/Km) for AE was only 4% lower in infected microsomes. Apparent pharmacokinetic parameter estimates for AE using the isolated perfused rat liver demonstrated no differences (p > 0.05) in volume of distribution, clearance, and half-life between normal and infected animals. Malaria infection resulted in decreased biliary excretion of free AE and DQHS. The majority of AE is eliminated via biliary excretion of conjugated DQHS, which is approximately 500-fold higher than free DQHS and 75-fold higher than free AE on a molar basis.     

基于剪切带扩展法的海底斜坡稳定性分析

简介剪切带扩展法（SBP）的原理及其在海底滑坡稳定性分析的应用;以舟山六横岛典型海底斜坡为分析案例,开展基于高斯函数的SBP和极限平衡法（LEM）斜坡稳定性对比分析研究;进行SBP输入参数对剪切带扩展系数R的敏感度分析. 研究结果显示,对于斜坡剪切带破坏长度,当剪切带扩展系数R不大于1时,LEM与SBP得到的滑坡滑裂面区域一致,当R大于1时,SBP计算得到的最终滑动区域比LEM计算得到的区域大;在斜坡发生滑动破坏区域SBP比LEM计算得到的安全系数低;地震影响因素和土体特征位移对R的影响较大.     

风电机组监测数据的动态可视化

以风力发电机为研究对象,在分析风电机组的结构、故障特点以及监测方式的基础上,实现了风电机组监测数据的动态可视化。本仿真系统是在Windows XP操作系统下以Visual C++6.0为开发工具进行研发,通过网络传输获取机组实时数据,利用OpenGL进行机组实体建模,采用显示列表与双缓存技术实现了机组模型的动态显示。系统具有良好的实时性、交互性,为进一步研究风力发电机的三维可视化状态监测奠定了基础。     

Playing Mastermind with Constant-Size Memory

We analyze the classic board game of Mastermind with n holes and a constant number of colors. The classic result of Chvátal (Combinatorica 3:325–329, 1983) states that the codebreaker can find the secret code with Θ(n/logn) questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory Comput. Syst. 39:525–544, 2006) on the memory-restricted black-box complexity of the OneMax function class.     

基于MB-LBP和张量HOSVD的人脸识别算法

融合多尺度分块局部二值模式和张量高阶奇异值分解提出一种人脸识别算法.优选不同尺度的MB-LBP算子组合提取图像纹理特征,构造人脸图像的3阶张量模型;利用HOOI算法进行张量高阶奇异值分解;基于HOSVD分解结果采用最邻近算法设计识别分类器.运用Yale数据库和自制数据库进行算法对比实验,验证算法的有效性,实验结果表明,基于Yale数据库,提出算法与LBP深度置信网络算法的识别精度一样高,均为98.667％;基于自制人脸数据库,该算法识别精度为100％.综上提出算法是一种有效的、可行的识别算法.     

响应面分析法优化山楂叶中黄酮的提取工艺

响应面分析法优化山楂叶中黄酮的提取工艺,以黄酮粗提取率为指标,采用乙醇回流法提取。通过单因素试验及响应面分析,研究了提取温度、液固比、乙醇体积分数和提取时间4个主要因素对山楂叶中黄酮粗提取率的影响。采用Box-Behnken中心组合设计和响应面分析法,建立了回归方程的预测模型,确定最佳提取条件为液固比29 mL/g ,乙醇体积分数68％,提取温度64℃,提取时间34 min ,在此条件下黄酮粗提取率为3．07％。试验结果与模型预测值基本相符,因此,该工艺可应用于山楂叶中黄酮的提取。     

Tight analysis of the (1+1)-EA for the single source shortest path problem

We conduct a rigorous analysis of the (1+1) evolutionary algorithm for the single source shortest path problem proposed by Scharnow, Tinnefeld, and Wegener (The analyses of evolutionary algorithms on sorting and shortest paths problems, 2004, Journal of Mathematical Modelling and Algorithms, 3(4):349-366). We prove that with high probability, the optimization time is O(n2 max{?, log(n)}), where ? is the smallest integer such that any vertex can be reached from the source via a shortest path having at most ? edges. This bound is tight. For all values of n and ? we provide a graph with edge weights such that, with high probability, the optimization time is of order Ω(n2 max{?, log(n)}). To obtain such sharp bounds, we develop a new technique that overcomes the coupon collector behavior of previously used arguments. Also, we exhibit a simple Chernoff type inequality for sums of independent geometrically distributed random variables, and one for sequences of random variables that are not independent, but show a desired behavior independent of the outcomes of the previous random variables. We are optimistic that these tools find further applications in the analysis of evolutionary algorithms.