一株耐盐性链霉菌的鉴定及其抗菌活性

从厦门海岸潮间带红树林根系海泥分离到一株链霉菌S-111-9,能在含6～8％NaCl的高氏合成一号琼脂上生长;产生对革兰氏阳性、阴性细菌、酵母菌及霉菌有较强抑制作用的抗生素,其孢子丝直至波曲,偶而有螺旋,孢子圆柱形,表面有皱折;气生菌丝浅粉红色;基内菌丝褐色,无可溶性色素,该菌应归入链霉菌属(Streptomyces)粉红孢(Roseosporus)类群,而形态和生理特征与该类?的相近种华美链霉菌、玫瑰褐链霉菌和烟薰链霉菌有显著差别,可认为是一新种,?定名为厦海链霉菌(Streptomyces xia-baiensis n.sp.Zhou)。     

药材鳖甲的真伪鉴别

中药鳖甲是使用鳖的背甲。近来发现有以腹甲混入背甲充作药用。本文从鳖的背甲及腹甲形态特征进行比较,这样就改进了鳖甲的鉴别方法。     

无穷维系统辨识的条件健态性

本文考虑非线性参数系统的辨识条件健态性问题,首先应用非线性参数系统极小解与对应线性化方程解的存在,导出辨识问题的可解性;然后引用条件可辨识性与条件稳定性,构造条件可辨识区域,从而确保了参数辨识的条件健态性.     

旋毛虫新生幼虫cDNA文库的构建与鉴定

利用λZAPExpress载体成功地构建了中国猪株旋毛虫分离株Trichinellaspiralis新生幼虫的cDNA文库 ,并对其重组噬菌体质粒pBK—CMV进行酶切鉴定 .结果表明 :所构建的cDNA文库容量为 1 92× 10 6,重组效率为 98 6 % ,所有的克隆片段都在 0 5— 2 0Kb之间 ,说明此cDNA文库几乎覆盖了全部mRNA .     

Tchebychev近似基本解的边界元法在结构边界条件识别中的应用

本文用边界元法的数值计算与动态测试相结合的方法来识别结构的边界条件。在导出边界积分方程时,文中采用了近似基本解技术,用Tchebychev多项式组成的级数来逼近解析的基本解。文中以薄板结构作为研究对象,用计算机仿真算例识别了矩形板的弹性支承刚度。仿真结果说明方法是有效和可靠的。     

蒙药材悬钩子木的生药鉴定研究

目的:建立悬钩子木生药鉴定体系.方法:采用性状鉴别、显微鉴别、一般理化鉴别法及紫外光谱线组法.结果:积累了悬钩子木的药材性状、显微特征、一般理化反应及紫外光谱线组的特征和数据.结论:本实验的方法可作为悬钩子木的真伪鉴别的依据.     

临潼华清池,蓝田汤峪温泉中的细菌类群

本文对陕西省临潼华清池,蓝田汤峪两处温泉中的细菌,主要是异养菌,在好氧和厌氧条件下进行了分离和鉴定。从临潼华清池水样中分离出6株细菌,从蓝田汤峪水样中分离出19株细菌。这些细菌经过鉴定后,将它们分为10个属。并将其中的芽孢杆菌进行了种的鉴定。     

Identification of a free boundary in Norton–Hoff flows with thermal effects

This work deals with a free boundary identification problem in a steady viscoplastic flow. We provide a novel identification model based on a non-linear optimization. The fluid motion is governed by the incompressible Norton–Hoff model coupled with the heat equation. The viscosity of the fluid is modeled by the non-linear Arrhenius law. Our point of view is to treat the problem as a shape sensitivity of a cost functional formulated on the free boundary and governed by the normal component of the velocity of the flow. We analyze the mathematical statement of the forward problem. The equations related to the free boundary are simplified. Various properties of this optimization are proved. Since the state of Norton–Hoff model is not regular enough we introduce a parameter penalization. The shape gradient of the considered cost functional is given in the strong sense up to the parameter of penalization. We supply the expression of the shape gradient in a weak sense.     

General theory of information transfer: Updated

We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main contributions concern information transfer by channels. There are also new questions and some answers in new models of source coding. While many of our investigations are in an explorative state, there are also hard cores of mathematical theories. In particular we present a unified theory of information transfer, which naturally incorporates Shannon's theory of information transmission and the theory of identification in the presence of noise as extremal cases. It provides several novel coding theorems. On the source coding side we introduce data compression for identification. Finally we are led beyond information theory to new concepts of solutions for probabilistic algorithms.

The original paper [R. Ahlswede, General theory of information transfer, Preprint 97-118, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld, 1997] gave to and received from the ZIF-project essential stimulations which resulted in contributions added as GTIT-Supplements “Search and channels with feedback” and “Noiseless coding for multiple purposes: a combinatorial model”.

Other contributions—also to areas initiated—are published in the recent book [R. Ahlswede et al. (Eds.), General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, vol. 4123, Springer, Berlin, 2006].

The readers are advised to study always the pioneering papers in a field—in this case the papers [R. Ahlswede, G. Dueck, Identification via channels, IEEE Trans. Inform. Theory 35 (1989) 15–29; R. Ahlswede, G. Dueck, Identification in the presence of feedback—a discovery of new capacity formulas, IEEE Trans. Inform. Theory 35 (1989) 30–39] on identification. It is not only the most rewarding way to come to new ideas, but it also helps to more quickly grasp the more advanced formalisms without going through too many technicalities. Perhaps also the recent Shannon Lecture [R. Ahlswede, Towards a General Theory of Information Transfer, Shannon Lecture at ISIT in Seattle 13th July 2006, IEEE Information Theory Society Newsletter, 2007], aiming at an even wider scope, gives further impetus.     

LPV identification of a turbocharged diesel engine

This work proposes a methodology of identifying linear parameter varying (LPV) models for nonlinear systems. First, linear local models in some operating points, by applying standard identifications procedures for linear systems in time domain, are obtained. Next, a LPV model with linear fractional dependence (LFR) with respect to measured variables is fitted with the condition of containing all the linear models identified in previous step (differential inclusion). The fit is carried out using nonlinear least squares algorithms. Finally, this identification methodology will then be applied to a nonlinear turbocharged diesel engine.