Family I.3 lipase: bacterial lipases secreted by the type I secretion system

Based on the classification of bacterial lipolytic enzymes, family I.3 lipase is a member of the large group of Gram-negative bacterial true lipases. This lipase family is distinguished from other families not only by the amino acid sequence, but also by the secretion mechanism. Lipases of family I.3 are secreted via the well-known type I secretion system. Like most of proteins secreted via this system, family I.3 lipases are composed of two domains with distinct yet related functions. Recent years have seen an increasing amount of research on this lipase family, in terms of isolation, secretion mechanism, as well as biochemical and biophysical studies. This review describes our current knowledge on the structure-function relationships of family I.3 lipase, with an emphasis on its secretion mechanism. Received 18 April 2006; received after revision 3 July 2006; accepted 24 August 2006     

分数Hamilton圈与分数树形图

定义有向图的分数有向Hamilton圈和分数支撑树形图，讨论分数Hamilton圈、分数旅行售货员问题和分数支撑树形图基于线性规划的等价定义及多项式时间算法。     

Shevrin问题的若干充要条件

利用偏序讨论了Ｉ＿３一半群的一些性质，并给出了Ｓｈｅｖｒｉｎ问题的若干充要条件。     

障碍可越路线规划的符号图方法

本文给出２—Ｄ路线规划问题在障碍可越情况下的启发式符号方法．这一方法利用推理规则在由图像信息导出的连通图知识结构上进行启发式符号Ａ搜索以对空间关系进行分析和分类，以符号描述形式给出两声间路线规划方案．     

最小二乘解存在的充分必要条件

本文提出了当观测值的权矩阵为正定或半正定的前提下，其最小二乘解存在的充分必要条件为并以间接平差为例验证了该结论的正确性。     

图Cn∪Pm的算术标号

设Ｃｎ∪Ｐｍ（ｎ≥３，ｍ≥２，ｎ，ｍ∈Ｎ）表示一个圈Ｃｎ和一条与其不相交的路Ｐｍ组成的图，本文证明图Ｃｎ∪Ｐｍ是算术图。     

滚齿切削图形的解析求法

本文提出了求滚齿图形的解析方法,用该方法可以方便而精确地求出各种类型滚刀的切削图形,并能在计算机上直接打印出来。它既可以用来分析各种类型滚刀的切削过程,又可以作为滚刀计算机辅助设计的一个环节,以寻求更加高效和高耐用度的滚刀齿形。     

基于3S技术的土地利用动态变化研究

3S技术是研究土地利用动态变化的重要技术手段，具有传统方法无法比拟的优越性。本文以秦皇岛市为例，定量分析了区域内土地利用动态变化。针对区域土地利用程度及生态环境可能产生的影响进行了简要的评价，揭示了研究区土地利用变化规律，为秦皇岛市实现生态环境目标提供决策依据。     

用面扩树的方法找三次图的边三着色

本文通过分析三次图中面的奇偶性及组合情况,引出了可边三色块的概念,接着用面扩树方式给出了三次图中大量的可边三色块,在这些可边三色块中导出了三次图的一些边三色解.     

Theoretical design for a class of chaotic stream cipher based on nonlinear coupled feedback

1.INTRODUCTION Inordertoimprovethesecurityofchaosencryption system,wecaniteratethechaossystem.Themore chaossystemiterates,themorecomplexitbecomes, andthemoresecurethecorrespondingchaosencryp tionsystembecomes.Zhouetal[1]proposedaclassof chaoticsequencegeneratorinwhichthelinearseg mentnumberincreasedwiththeiterationnumberex ponentially.Withtheincreaseoftheiterationnum ber,thesecurityofthesystemincreaseswhilethe rateofencoding/decodingdecreases.Inaddition,the phase spacegraphhassomedefe…