新型带锈防锈涂料的施工技术及应用

介绍了ZY系列带锈防锈漆的性能、施工技术及应用实例。     

聚氨酯泡沫固定化重组枯草杆菌三段培养生产青霉素酰化酶

引　言青霉素G酰化酶 (penicillinGacylase ,EC3 5 1 11,PGA)是 β 内酰胺类抗生素工业中的关键酶之一 .目前主要采用大肠杆菌和巨大芽孢杆菌进行工业化生产 ,但由于产酶水平较低、变温发酵和需要苯乙酸诱导等缺点 ,国内外研究者尝试采用各种基因重组技术 ,以期大幅度提高产酶     

现场总线的发展与以太网

介绍了IEC61158中的八种现场总线,针对目前多种现场总线共存竞争的局面,分析了以太网应用于工业现场设备的发展趋势。     

当代医药工业的特点及我国发展现状和对策

介绍了当代医药工业的生产特点,对我国医药工业的发展现状进行了分析,指出了存在的问题,提出我国医药工业的发展必须大力推进科技进步,加速新药研制,改进质量控制指标和方法,完善质量和技术标准体系,通过重组,优化资源配置。     

A resource-aware scheduling algorithm with reduced task duplication on heterogeneous computing systems

To satisfy the high-performance requirements of application executions, many kinds of task scheduling algorithms have been proposed. Among them, duplication-based scheduling algorithms achieve higher performance compared to others. However, because of their greedy feature, they duplicate parents of each task as long as the finish time can be reduced, which leads to a superfluous consumption of resource. However, a large amount of duplications are unnecessary because slight delay of some uncritical tasks does not affect the overall makespan. Moreover, these redundant duplications would occupy the resources, delay the execution of subsequent tasks, and increase the schedule makespan consequently. In this paper, we propose a novel duplication-based algorithm designed to overcome the above drawbacks. The proposed algorithm is to schedule tasks with the least redundant duplications. An optimizing scheme is introduced to search and remove redundancy for a schedule generated by the proposed algorithm further. Randomly generated directed acyclic graphs and two real-world applications are tested in our experiments. Experimental results show that the proposed algorithm can save up to 15.59  % resource consumption compared with the other algorithms. The makespan has improvement as well.     

均匀设计试验方法及其在Ni-P-MoS2化学镀上的应用

均匀设计是基于试验点在整个试验范围内均匀散布的一种试验设计方法。介绍了该法的特点及其软件的基本功能与基本操作过程。从均匀设计试验方案的建立、试验结果的回归分析及优化、镀液最佳配方的试验验证3个方面介绍了均匀设计法在Ni-P-MoS2化学复合镀中的应用，并得到了最佳的Ni-P-MoS2化学复合镀液配方。该法应用于化学镀的工艺试验，简便可行。     

核苷酸生产技术现状及展望

核苷酸的生产方法主要有化学合成法、RNA酶解法、微生物发酵法以及生物催化法。探讨了这些方法的原理和发展及其在工业化生产中的优劣势。化学合成法的路线长、立体选择性差,所用试剂昂贵并有一定毒性,生产成本较高;酶解法能一次得到4种核苷酸的混合物且收率较高,是目前我国核苷酸工业生产所用的主要技术,但其后提取难度大,产品纯度不高;微生物发酵法难以解决细胞通透性的问题;生物催化法是发酵法的延伸,菌体培养和酶催化反应分两步进行,有效地解决了细胞通透性问题,并可以通过偶联不同的基因工程菌株生产多种复杂核苷酸、核苷糖乃至寡聚糖,这在核苷酸工业、医药及糖化学、糖生物学合成工业中是极其重要的一个环节。     

提高复合塔板操作弹性和通量研究

在内径为 5 0 0mm和 30 0mm的塔内 ,以空气 水为物系 ,测定了不同结构 (浮阀 筛孔穿流板、非均匀开孔率穿流板、双孔径穿流板 )的穿流板与 2 5 0Y规整填料组成的各种复合塔板的流体力学性能。试验结果表明 :浮阀 筛孔复合塔板操作弹性小、气液处理量小 ;非均匀板复合塔板与均匀板复合塔板相比 ,操作弹性大2 0 %— 6 0 % ,气处理量大 2 0 %— 80 % ,液处理量大 70 %左右 ;双孔径复合塔板比单孔径复合塔板处理量略微增大 ,操作弹性高达 3.5以上。     

纤维素醚的特点、制备及在工业中的应用

综述了纤维素醚的种类、制备方法、性能和特点,以及纤维素醚在石油、建筑、造纸、纺织、医药、食品、光电材料及日化工业中的应用,介绍了一些具有发展前景的纤维素醚类衍生物的新品种并展望其应用前景。     

Approximate inference for dynamic Bayesian networks: sliding window approach

Dynamic Bayesian networks (DBNs) are probabilistic graphical models that have become a ubiquitous tool for compactly describing statistical relationships among a group of stochastic processes. A suite of elaborately designed inference algorithms makes it possible for intelligent systems to use a DBN to make inferences in uncertain conditions. Unfortunately, exact inference or even approximation in a DBN has been proved to be NP-hard and is generally computationally prohibitive. In this paper, we investigate a sliding window framework for approximate inference in DBNs to reduce the computational burden. By introducing a sliding window that moves forward as time progresses, inference at any time is restricted to a quite narrow region of the network. The main contributions to the sliding window framework include an exploration of its foundations, explication of how it operates, and the proposal of two strategies for adaptive window size selection. To make this framework available as an inference engine, the interface algorithm widely used in exact inference is then integrated with the framework for approximate inference in DBNs. After analyzing its computational complexity, further empirical work is presented to demonstrate the validity of the proposed algorithms.