SBBR反应器中耐冷微生物的驯化与识别

以模拟生活污水为处理对象，三种不同填料为生物膜载体，运行 A、B、C三个SBBR，通过逐步降温（25、20、15、10、6和5℃）培养驯化处理低温污水的生物膜。运行251周期，三个反应器COD出水浓度均低于50 mg/L；B反应器对氨氮去除效果优于A和C。特别在低温5℃时，A、B和C三个反应器氨氮平均出水浓度分别为14.1、3.79和14.1 mg/L。高通量测序结果显示，5℃时，三个反应器中均以降解有机物的微生物为主；只有B反应器中驯化富集出了嗜冷硝化菌（Candidatus Nitrotoga）；而其他有硝化作用的菌属在B反应器中的丰度也高于A和C反应器；不利于脱氮的类固氮菌（Elstera）在A和C反应器中丰度较高。此结果可从微生物角度解释三个反应器处理效果的差异性，表明B反应器处理低温污水有显著优势，其所用填料可结合低温菌进一步开发利用。     

一种5 重real-time PCR筛查转基因水稻方法的建立

以转基因水稻中最常用的CaMV35S启动子、NOS终止子、Cry1Ab/Ac基因、HPT基因及SPS水稻内标基因为研究对象，利用5 种不同的荧光信号（FAM、HEX、Taxas Red、Cy5、Cy5.5）进行多重实时聚合酶链式反应（real-time polymerase chain reaction，real-time PCR）检测方法的研究。通过引物组合筛选、反应体系优化、特异性测试、灵敏度测试、适用性测试等一系列实验，建立了5 重real-time PCR方法，灵敏度可达0.032%。此方法具有灵敏度高、结果准确、通量大等优点，可实现水稻中转基因成分的快速、高效检测。     

Low-cost and two-cycle hardware structures of PRINCE lightweight block cipher

In this paper, low-cost and two-cycle hardware structures of the PRINCE lightweight block cipher are presented. In the first structure, we proposed an area-constrained structure, and in the second structure, a high-speed implementation of the PRINCE cipher is presented. The substitution box (S-box) and the inverse of S-box (S-box⁻¹) blocks are the most complex blocks in the PRINCE cipher. These blocks are designed by an efficient structure with low critical path delay. In the low-cost structure, the S-boxes and S-boxes⁻¹ are shared between the round computations and the intermediate step of PRINCE cipher. Therefore, the proposed architecture is implemented based on the lowest number of computation resources. The two-cycle implementation of PRINCE cipher is designed by a processing element (PE), which is a general and reconfigurable element. This structure has a regular form with the minimum number of the control signal. Implementation results of the proposed structures in 180-nm CMOS technology and Virtex-4 and Virtex-6 FPGA families are achieved. The proposed structures, based on the results, have better critical path delay and throughput compared with other's related works.     

Motor fluency deficits in the sequencing of actions in schizophrenia.

Many everyday activities depend on the capacity to organize and smoothly execute motor sequences. The authors tested the hypothesis that a sequencing deficit is associated with schizophrenia. They used a new method to distinguish between lower and higher order mechanisms for the impairment. The 1st task involved triggered sequences in which sensory information from 1 movement was the cue for initiation of the following movement. Results showed that the motor sequences were performed as fluently in patients as in controls. The 2nd and 3rd tasks involved sequences in which the entire movement sequence could be preplanned. Patients executed the sequences less fluently than controls but only under the condition where action sequences were required. Furthermore, the patients' fluency deficit increased with sequence complexity. The high discrimination power of Task 3 gave the authors a means to control for a potential psychometric confound involving differential discriminating power and to argue in favor of a specific higher order motor fluency deficit in patients with schizophrenia. It is suggested that basic lower order mechanisms that integrate sensory information with outgoing motor commands are preserved in schizophrenia, whereas higher order integrative mechanisms that are required for the smooth coordination of motor sequences are impaired. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Infinite-horizon Scheduling Algorithms for Optimal Search for Hidden Objects

This paper considers discrete search problems in which a decision-maker has to find objects lost or hidden in a given set of locations so as to minimize the expected losses incurred. Given a chance to look for a hidden object in the same location infinitely many times, this type of problem, in contrast to standard scheduling problems, has an infinite sequence as its solution. Thus we are concerned to find an algorithm that yields an optimal solution, rather than the optimal sequence itself. Using combinatorial techniques, fast optimal algorithms for solving the problems are obtained, and optimality conditions are presented for search criteria, under which the local-search algorithms yield the global optimum.     

Simulation and optimization of tool-life in manufacturing centers

This paper presents the development of an optimization and a computer-simulation model to evaluate the process plans of a manufacturing center by analyzing the effect of tool failure on system performance. The GPSS/PC simulation program that is used in this study has been built with variables, functions and matrices so that many experiments could be conducted with the model. Sensitivity analysis is presented and the developed model has proven to be useful in determining optimum sequencing of parts for various operating policies.     

II. Yeast sequencing reports. Sequence of a segment of yeast chromosome II shows two novel genes,one almost entirely hydrophobic and the other extremely asparagine-serine rich

A 3·2 kb EcoRI fragment of yeast Saccharomyces cerevisiae was entirely sequenced. Two new open reading frames were identified. The first is extremely hydrophobic, and would likely be an integral membrane protein. It has significant similarity to only one reported gene, a gene of unknown function from Drosophila melanogaster. The second ORF is asparagine-rich and very serine-rich, with a remarkable stretch of nearly 26 consecutive asparagine residues comprised of the same codon. It has no significant similarity to any reported gene. The fragment maps to chromosome II on the left arm between the CDC27 and ILS1 loci. The nucleotide sequence reported in this paper has been deposited in the GenBank database with the Accession Number M89908.