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.     

一种新型递减曲线的简单求法与应用

通过对油气藏产量递减的研究、线性最优化方法的分析研究及文献[1]提出的这种新型递减曲线的研究，提出了解这种方程的一个简单求法。通过现场的实例应用表明：提出的方法具有简单、方便、方法可靠的优点。采用此方法时，产量不以年为单位而是以月为单位进行计算，这将使计算更准确、更合理。     

关于Smarandache可乘函数的均值研究

本文的主要目的是利用初等方法研究Smarandache可乘函数在简单数集中的均值性质,并给出一个有趣的渐近公式。     

柴石滩电站计算机监控系统配置及主要功能

柴石滩水库坝后电站装机容量３×２０ＭＷ，水库库容４．３７亿，坝高１０３．２ｍ，电站采用计算机监控为主简易常规监控为辅的方式。本文介绍了电站计算机监控系统网络结构及系统软硬件配置以及监控系统功能、特点，简易常规监控方式。电站监控系统采用招标方式已定了生产厂家和系统方案。     

简易炉外处理在电炉钢生产中的应用

阐述了小电炉采用投资少，见较快，简单易行的炉外处理措施，提高了钢质量和生产率，生产实践和应用结果表明，本措施可为同类型企业的炼钢工艺完善和技术进步提供参考。     

An efficient heuristic for scheduling batches of parts in a flexible flow system

Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system.The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence.A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions.     

一种简便通用的快速干涉检查算法

提出了一种简便通用的快速干涉检查算法.该算法是在机械CAD中,利用合理排序、简化建模、网格图和离散时间表、运动路径简化等方法从而实现快速干涉检查的一种方法.     

混凝土简支梁预设变形值探讨

以某高速公路钢筋混凝土与预应力混凝土工程为例，从简支梁的预拱度和下挠度的设置两方面进行了阐述，提出了钢筋混凝土简支梁下挠变形和预应力混凝土简支梁上拱变形的不同之处。     

Minimizing the number of tool switches on a flexible machine

This article analyzes a tool switching problem arising in certain flexible manufacturing environments. A batch of jobs have to be successively processed on a single flexible machine. Each job requires a subset of tools, which have to be placed in the tool magazine of the machine before the job can be processed. The tool magazine has a limited capacity, and, in general, the number of tools needed to produce all the jobs exceeds this capacity. Hence, it is sometimes necessary to change tools between two jobs in a sequence. The problem is then to determine a job sequence and an associated sequence of loadings for the tool magazine, such that the total number of tool switches is minimized. This problem has been previously considered by several authors; it is here revisited, both from a theoretical and from a computational viewpoint. Basic results concerning the computational complexity of the problem are established. Several heuristics are proposed for its solution, and their performance is computationally assessed.     

An expert decision support system for network routing: a case study

The paper presents a case study of the development of an expert decision support system which uses simple heuristic methods for fast determination of routes for simultaneous signals in a transmission network of limited capacity. It illustrates how heuristic solutions can be embodied in a model-based DSS and how the standard decision support literature, although intuitively appealing, provides little practical assistance in system construction or classification