Mapping of the Saccharomyces cerevisiae CDC3, CDC25, and CDC42 genes to chromosome XII by chromosome blotting and tetrad analysis

CDC3, CDC25 and CDC42 were localized to chromosome XII by hybridizing the cloned genes to Southern blots of chromosomes separated by orthogonal-field-alternation gel electrophoresis. Meiotic tetrad analyses further localized these genes to the region distal to the RDN1 locus on the right arm of the chromosome. The STE11 gene, which had previously been mapped to chromosome XII (Chaleff and Tatchell, 1985), was found to be tightly linked to ILV5. The data suggest a map order of CEN12-RDN1-CDC42-(CDC25-CDC3)-(ILV5- STE11)-URA4. Certain oddities of the data set raise the possibility that there may be constraints on the patterns of recombination in this region of chromosome XII.     

Neural Networks Analysis of Steel Plate Processing Augmented by Multi‐objective Genetic Algorithms

An earlier neural network analysis of processing of steel plates through hot rolling was subjected to a further refined analysis through some flexible neural networks that evolved using a multi‐objective predator‐prey genetic algorithm. The original data set expressing the Yield Strength and Ultimate Tensile Strength of the rolled slabs in terms of a total of 108 process variables were subjected to a systematic pruning through this evolutionary approach, till the nitrogen content of the steel emerged as the most significant input variable. A theoretical explanation is provided for this slightly unexpected result.     

An efficient algorithm for mining frequent inter-transaction patterns

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude.     

MALTING AND BREWING SCIENCE: CHALLENGES AND OPPORTUNITIES*,†

Molecular technologies have been developed for the transformation of barley. These technologies complement current methods of barley breeding. In addition, they offer the potential of altering specific components in barley that affect malting quality and of introducing foreign genes, controlling desirable traits, into barley. Application of genetic engineering to improving malt quality factors such as cell wall degradation, protein modification, starch hydrolysis and flavour stability, is discussed. Limitations to the use of this technology for improving malt-related functional properties of barley components such as cell walls and starch granules are also evaluated. Some possible constraints to the utilization of genetic engineering for malt quality improvements are identified.     

云纹图象计算机处理技术的进展及其应用

本文对１９８７年至今国内外光测力学条纹图，主要是云纹图象的计算机采集，处理和力学量提取技术的进展进行了回顾，包括利用通用图象处理程序，直接利用灰度，用付利叶变换对条纹图进行分析，引入相移技术提高灵敏度，利用采色编码提取力学量。以及建立在云纹图特点基础上的新的图象处理技术等；分析了它们各自的优缺点，适用范围和存在的问题，讨论了它们在科究和工程测试中的应用前景。     

基于Matlab的线性规划问题求解

线性规划是运筹学中研究较早、发展较快、应用广泛、方法成熟的一个重要分支,它是辅助人们进行科学管理的一种重要的数学方法.文章首先介绍了线性规划的基本概念及标准形式,着重讨论了线性规划问题的三种常用解法:单纯形法、直接搜索法以及遗传算法,最后在Matlab R2009a环境下进行了仿真.通过结果可以看出,用Matlab求解线性规划问题,可以避免手工的烦琐计算,大大地提高工作效率和结果的准确性.     

遗传算法和Dijkstra算法在动态权值系统中的比较

针对遗传算法和Dijkstra算法在求解动态权值系统中最短路径时的性能问题,采用比较法,将两种算法应用在同一个实际游戏模型中,对其算法的稳定性、智能性、时间复杂度进行对比测试。游戏模型模拟了各种条件下的动态权值系统。为了使遗传算法更加可靠,通过优化其变异过程使得收敛速度更快,可靠性更高。实验数据表明,遗传算法在每张地图上的得分数以及算法所用时间普遍高于Dijkstra算法,从而得出遗传算法在求解动态权值系统中最短路径问题时稳定性和预期效果明显好于Dijkstra算法,但其时间复杂度较高的结论。     

测井现场绘图软件的面向对象设计与实现

在面向对象的软件设计中,多态性是一种非常重要的概念,文章论述用封装、继承和多态性来实现测井绘图软件的设计和开发,实现不同测井图像连续绘制。测井绘图软件能够对不同的测井图像实现动态兼容,提高了软件系统整体的扩展性。     

基于改进遗传算法的QoS感知Web服务组合

传统遗传算法在种群初始化的时候,普遍采用均匀取种法或随机取种法,这些方法生成的种群的平均适应度比较低,难以保证算法的搜索效率。文中提出一种改进的遗传算法用于QoS敏感的Web服务组合,采用两种不同的算法进行服务选择,避免了随机生成初始种群给算法带来的负面影响。并且,该算法将路径模板化以减少服务组合的工作量,用染色体可变长的编码方式来解决组合服务的多路径选择问题。通过仿真实验,与传统的算法相比,所提出的算法在实现服务组合时收敛更快,最优解的适应度更高。