Simple Sequence Repeat Markers in Genetic Divergence and Marker-Assisted Selection of Rice Cultivars: A Review

Sequencing of rice genome has facilitated the understanding of rice evolution and has been utilized extensively for mining of DNA markers to facilitate marker-assisted breeding. Simple sequence repeat (SSR) markers that are tandemly repeated nucleotide sequence motifs flanked by unique sequences are presently the maker of choice in rice improvement due to their abundance, co-dominant inheritance, high levels of allelic diversity, and simple reproducible assay. The current level of genome coverage by SSR markers in rice is sufficient to employ them for genotype identification and marker-assisted selection in breeding for mapping of genes and quantitative trait loci analysis. This review provides comprehensive information on the mapping and applications of SSR markers in investigation of rice cultivars to study their genetic divergence and marker-assisted selection of important agronomic traits.     

应用API 581对输气站场进行定量风险评价

目前专门针对输气站场的风险评价方法还不多，现有的手段也只是根据国家法律法规得出定性的评价结果，然后按照评价结果对照得出整改方案。为此，对输气站场的定量风险评价工作提出了一套新方法，得到了定量的和更加客观的风险排序，为管道站场的完整性管理工作提供了有力的支持；并以陕京输气管道榆林压气站为例，应用美国石油学会标准API 581（基于风险检测的基本源文件）对站内设施进行了风险评价，计算了站内设备和管线的失效后果、失效概率，得到了定量风险值，进而分析了风险值产生差异的原因。最后，针对我国输气管道风险评估工作提出了看法和建议。     

An object replication algorithm for real-time distributed databases

A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective, we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are provided for the ease of understanding. Recommended by: Ashfaq Khokhar     

医学超声图像处理系统

超声图像诊断是与X线CT、同位素扫描、核磁共振等一样重要的医学图像诊断手段。根据肝脏超声图像进行脂肪肝的诊断,是病变确诊的主要方法。但是,与CT和核磁共振等医学图像相比,超声图像的图像质量较差,目前的诊断以定性为主,受主观因素影响较大。以图像分割为基础,以VC语言为工具,建立了超声图像处理系统,对超声图像进行了二值化处理,并对处理结果进行了量化,为诊断提供了依据。     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.     

Critical-point drying versus freeze drying for scanning electron microscopy: a quantitative and qualitative study on isolated hepatocytes

Critical-point drying and freeze drying were compared both quantitatively and qualitatively as preparative procedures for scanning electron microscopy. Isolated hepatocytes were used as model cells. Nomarski differential interference contrast microscopy was used for light microscopic measurements of the hepatocytes in the unfixed, the glutaraldehyde fixed, the glutaraldehyde + OsO₄ fixed, the critical-point dried and the freeze dried states. Critical-point dried hepatocytes were found to shrink to 38% of glutaraldehyde + OsO₄ fixed volume, whereas optimal freeze dried hepatocytes (frozen in water saturated with chloroform and freeze dried at 183 K for 84 h) were found to shrink to 51% of glutaraldehyde + OsO₄ fixed volume. Transmission and scanning electron micrographs of the critical-point dried cells showed well-preserved ultrastructure and surface structure. Micrographs of the freeze dried cells showed ultrastructure destroyed by internal ice crystals and surface structure destroyed by external ice crystals. Double-fixed isolated hepatocytes were shown to swell during storage in buffer and to shrink during storage after critical-point drying. For low magnification scanning electron microscopy (up to about 3000 times) both critical-point drying and freeze drying can be used. However, for high magnification scanning electron microscopy, critical-point drying is superior to freeze drying.     

Object-oriented DBMS requirements

The requirements on an object-oriented DBMS for management of information in a large, complex enterprise are presented. These requirements aid in the achievement of an environment characterized by data sharing, open architectures, application and data portability, and assurance of data integrity. They were defined from the point of view of a user of the DBMS; therefore they describe the expected functionality of the DBMS and do not specify the method of implementation to achieve this functionality. They encompass requirements on the data model, query and data manipulation languages, the system architecure, interfaces to the system, change management, and transaction management.     

手工水饺定量给馅机的设计

手工水饺定量给馅机解决了包制手工水饺的定量给馅问题，保持每个水饺的重量一致稳定。该机采用柱塞泵给馅，气动传动，自动化，高效率，适合工业化生产手工水饺使用。