矩形件排样优化的最小余料删除法

针对矩形件排样优化问题,分析了传统近似算法的主要缺陷,并在此基础上提出了一种新的排样算法———最小余料删除法.实验结果表明,同近似算法相比,最小余料删除法既满足实际生产的工艺要求,并能使板材利用率提高10%以上.     

高产琥珀酸重组大肠杆菌的构建及厌氧发酵

以野生型大肠杆菌Escherichia coli W为出发菌株,利用Red同源重组系统分别敲除了乳酸脱氢酶基因(ldhA)、乙醇脱氢酶基因(adhE)、丙酮酸甲酸裂解酶基因(pflB)、丙酮酸氧化酶基因(poxB)和乙酸激酶基因(ackA),再通过无氧生长进化筛选过程,构建得到在厌氧条件下能有效生长,并以琥珀酸为主要发酵产物的重组大肠杆菌WS100(△ldhA,△adhE,△pflB,△poxB,△ackA)。利用15 L发酵罐进行厌氧发酵测定显示,经72 h发酵,菌体密度OD600最大值可提高至6.48,琥珀酸产量达到70.13 g/L,琥珀酸的生产强度为0.98 g/(L.h),葡萄糖-琥珀酸转化率为76%。发酵液中副产物含量低,乙酸含量为5.34 g/L,乳酸产量仅为0.15 g/L,未检测到甲酸和乙醇生成。结果表明,厌氧条件下,该工程菌可有效利用低营养成分的无机盐培养基,在不表达任何外源基因的条件下可稳定高产琥珀酸,具有极大的工业化开发前景。     

丝氨酸对葡萄酒酿造过程中酿酒酵母产H2S的形成研究

为探究丝氨酸对葡萄酒酿造过程中酿酒酵母产H2S的影响,以自主筛选的本土酿酒酵母32y12为研究对象,分别在正常氮源（300 mg N/L）和低浓度氮源（150 mg N/L）条件下,比较了外源丝氨酸的添加对酿酒酵母32y12发酵过程中产H2S的影响。结果显示,相对于正常氮源水平,低氮条件下外源添加140.8 mg/L（5倍）和281.5 mg/L（10倍）丝氨酸时,H2S释放量显著增加,分别达到573.1 μL/L和798.6 μL/L。为了进一步研究酵母自身丝氨酸合成对H2S产生的影响,借助Cre-Loxp系统敲除了丝氨酸合成关键基因SER33,结果发现在不同氮源水平下,基因SER33的敲除均显著降低H2S产量（P＜0.05）,并且外源添加不同浓度丝氨酸也并不会显著增加基因SER33敲除菌株的H2S释放量（P＞0.05）。该结果为工业生产中针对低氮葡萄原料选择发酵助剂提供了理论支持。     

用Tn5-mob-sacB转座子对华癸中生根瘤菌HN3015质粒进行定向标记、消除或缺失

采用Tn5-mob-sacB转座子对Mesorhizobium huakuii HN3015菌株含有的3条大质粒(pMhHN3015a,150 kb; pMhHN3015b , 294 kb 和pMhHN3015c,390 kb)进行定向标记,获得各个质粒标记菌株.利用sacB基因对蔗糖的敏感性,对标记质粒进行消除实验,获得HN3015质粒消除或缺失的突变株.并对HN3015及其突变菌株的培养特征、生长速度和共生结瘤能力进行了研究,结果表明:质粒消除或缺失的突变株的培养特征和生长速度与出发菌株基本一致,但是,pMhHN3015a与固氮有关,pMhHN3015b消除的菌株则失去结瘤能力,只有pMhHN3015c消除或缺失菌株不影响结瘤与固氮能力.     

Reconstructing a Minimum Spanning Tree after Deletion of Any Node

Abstract. Updating a minimum spanning tree (MST) is a basic problem for communication networks. In this paper we consider single node deletions in MSTs. Let G=(V,E) be an undirected graph with n nodes and m edges, and let T be the MST of G . For each node v in V , the node replacement for v is the minimum weight set of edges R(v) that connect the components of T-v . We present a sequential algorithm and a parallel algorithm that find R(v) for all V simultaneously. The sequential algorithm takes O(m log n) time, but only O(m α (m,n)) time when the edges of E are presorted by weight. The parallel algorithm takes O(log ² n) time using m processors on a CREW PRAM.     

Applying path‐counting methods for measuring the robustness of the network‐structured system

We consider the path‐counting problem that asks how many paths exist between any two different nodes in a network after deleting an arbitrary number of edges or nodes from the original network. Using path‐counting methods, we propose a quantitative method for measuring the robustness of the network‐structured system. First we define the connectivity function and attempt to obtain the expected connectivity function for the network. Applying the Monte Carlo method, we estimate expected edge deletion and node deletion connectivity functions when an arbitrary number of edges or nodes are deleted from the original network. We attempt to approximate the expected edge deletion connectivity function using an appropriate nonlinear function with two parameters. We also show the numerical results of applying the path‐counting method with their analysis in order to quantitatively evaluate the connectivity for some special types of networks.     

A new approach for approximating node deletion problems

We present a new approach for approximating node deletion problems by combining the local ratio and the greedy multicovering algorithms. For a function , our approach allows to design a 2+max_v∈V(G)logf(v) approximation algorithm for the problem of deleting a minimum number of nodes so that the degree of each node v in the remaining graph is at most f(v). This approximation ratio is shown to be asymptotically optimal. The new method is also used to design a 1+(log2)(k−1) approximation algorithm for the problem of deleting a minimum number of nodes so that the remaining graph contains no k-bicliques.     

论工程网络图中多余虚箭线的判定及去除方法

在深入分析双代号网络中虚箭线生成过程的基础上,提出了针对不同具体问题类型判断及去除网络图中多余虚箭线的方法,其意义是有助于工程网络计划编制人员迅速识别并有效去除网络图中的多余虚箭线。     

群签名及其应用

综述了群签名及基应用方面的研究成果及发展状况。分析了现有的群签名方案中所存在的一些缺陷。指出了这方面研究目前所存在的问题及几个值得重视的研究方向。