媒体同步关系的描述

由于多媒体信息系统中，需要集成各种数据类型，而这些数据类型又有着密切的时间关系，所以对于多媒体来说，同步问题是很重要的，而同步的基础是为同步关系建立一个独立于实现环境的抽象的表示模型，本文着重讨论几种描述媒体同步关系的模型。     

带有光放大的波分复用技术在光纤通信中的应用

本文论述了波分复用技术的优点及其应用；介绍了波分复用技术与光纤放大器相结合后的发展概况２；评述了波分复用技术发展中的主要问题及其在当前实用系统中的解决方案和今后的发展方向。     

分偏移距动校正方法的改进

在地震资料处理中，速度分析和动校正对资料品质的影响很大。由于动校正速度是随偏移距变化而变化的，而常规速度分析并没有考虑这一因素，动校正效果往往不是很理想，从而影响资料的叠加和成像效果。分偏移距动校方法是在不同偏移距上采用不同的速度进行动校正。但由于是在不同偏移距组上分别独立进行速度分析和动校正，因此不能将不同偏移距组的同一反射同相轴校正到同一to层位上。这样就需要进行繁琐的后续处理，而且还会降低同相轴的连续性和平滑性。为此，对该方法进行了一些改进，即固定to在不同的分偏移距段进行速度扫描，段与段之间的衔接问题采用平滑处理解决。理论模型分析表明，采取上述改进措施后，动校正效果得到了一定提高，改善了同相轴的连续性和平滑性。     

汽轮机转子热应力在线计算灰色数学模型

热应力计算中边界条件、物性参数和初始条件等模型输入参数的灰色特性，使得以近似点值为输入得到的计算结果缺乏准确性依据和度量，该文提出的灰色数学模型，用区间数代替近似点值建立灰色数学模型，得出热应力在线计算值的灰色描述，可以更好地符合工程计算需要。文中针对模型应用的复杂程度，以汽轮机转子为对象，对单纯灰边界问题给出了简单的端点计算法及其依据；对复合灰边界灰物性问题建立了差分格式的数学模型，应用区间高斯迭代算法，结合模型结构特点推导了简易的基于内包含不等式的算法，并且给出两种算法的数值算例对比。     

三峡永久船闸中隔墩卸荷松弛特征研究

本选取三峡水利枢纽永久船闸二闸室桩号15 583代表性断面，通过地表测绘与地质编录、钻孔勘探、压水试验、全孔壁数字成像，物探测试，弹性模测试等综合勘察手段，并结合岩体变形监测成果等，查清了中隔墩岩体的工程地质特征，岩体卸荷松驰范围、物理力学性质及其稳定性。     

CDC15, an essential cell cycle gene in Saccharomyces cerevisiae, encodes a protein kinase domain

The cell division cycle gene CDC15 is essential for the late nuclear division in the yeast Saccharomyces cerevisiae. The amino acid sequence of the 974 amino acids/110 kDa CDC15 gene product, as deduced from the nucleotide sequence, includes an aminoterminal protein kinase domain which contains a primary sequence mosaic showing patterns specific for protein serine/threonine kinases besides those for protein tyrosine kinases. Many protein kinases non-essential for growth are known. CDC15 represents an essential protein kinase like CDC7 and CDC28. A carboxyterminal deletion of 32 amino acids renders the protein inactive.     

时分复用光纤光栅传感阵列中DFB激光器的高精度温控设计

针对时分复用光纤光栅(TDM-FBG)传感阵列中使用的分布反馈(DFB)激光器高波长稳定度的要求,设计了一个高精度的DFB温控方案,包括温度测量与设定、热敏电阻线性化、PID补偿回路、H桥驱动、温度电压采集与显示等。使用DFB内置的热敏电阻和半导体制冷器(TEC)对温控电路进行了测试,其精度在180s内达到±0.04℃,温控后激光器温度变化引起的应变测量误差为±3.4με左右,满足TDM-FBG传感阵列的要求。     

Positive state‐bounding observer for positive interval continuous‐time systems with time delay

This paper is concerned with the problem of positive observer synthesis for positive systems with both interval parameter uncertainties and time delay. Conventional observers may no longer be applicable for such kind of systems due to the positivity constraint on the observers, and they only provide an estimate of the system state in an asymptotic way. A pair of positive observers with state‐bounding feature is proposed to estimate the state of positive systems at all times in this paper. A necessary and sufficient condition for the existence of desired observers is first established, and the observer matrices can be obtained easily through the solutions of a set of linear matrix inequalities (LMIs). Then, to reduce the error signal between the system state and its estimates, an iterative LMI algorithm is developed to compute the optimized state‐bounding observer matrices. Finally, a numerical example is presented to show the effectiveness and applicability of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Analysis of nonlinear electrical circuits using bernstein polynomials

In electrical circuit analysis, it is often necessary to find the set of all direct current (d.c.) operating points (either voltages or currents) of nonlinear circuits. In general, these nonlinear equations are often represented as polynomial systems. In this paper, we address the problem of finding the solutions of nonlinear electrical circuits, which are modeled as systems of n polynomial equations contained in an n-dimensional box. Branch and Bound algorithms based on interval methods can give guaranteed enclosures for the solution. However, because of repeated evaluations of the function values, these methods tend to become slower. Branch and Bound algorithm based on Bernstein coefficients can be used to solve the systems of polynomial equations. This avoids the repeated evaluation of function values, but maintains more or less the same number of iterations as that of interval branch and bound methods. We propose an algorithm for obtaining the solution of polynomial systems, which includes a pruning step using Bernstein Krawczyk operator and a Bernstein Coefficient Contraction algorithm to obtain Bernstein coefficients of the new domain. We solved three circuit analysis problems using our proposed algorithm. We compared the performance of our proposed algorithm with INTLAB based solver and found that our proposed algorithm is more efficient and fast.