基于遗传模拟退火算法的神经网络预报模型

遗传和模拟退火是两种不同的优化算法，对这两种算法进行混合，有利于丰富优化过程中的搜索行为。遗传模拟退火混合策略利用了不同的邻域搜索结构，增强了算法全局和局部意义下的搜索能力和效率。分别用遗传模拟退火算法和标准遗传算法对电弧炉氧化期终点碳含量预报模型进行训练，仿真结果表明遗传模拟退火算法在收敛速度和预报精度上优于标准遗传算法。     

遗传算法的初步研究及改进后的遗传算法程序IGA1.0

遗传算法是近年来被广泛应用的一种非线性和并行算法。本文研究了几种改进遗传算法效率，提高搜索速度的方法，引入了两种变异的方法，并根据最大最小适应值的差值对适应值函数进行了修正，同时，对三种算子进行了重新安排以拓展搜索工在搜索过程中加入排序以提高杂交效率，同传统的遗传算法相 文的遗传算法没有使用固定的变异率和杂交率，而是让它们随着搜索过程中群体中的个体的重复情况改变，用经典的验证函数检验，这些改进提高     

柔性构象搜索：遗传算法与POWELL优化法的比较

在三维结构搜索中可种算法作构象搜索对系统的搜索速度和命中率有极大的影响。本文在自行的三结构搜索系统３ＤＦＳ的基础上对遗传算法和ＰＯＷＥＬＬ法的构象搜索能力进行了比较，五个典型药效团的搜索结果表明，两种算法在速度和优化能力上各有优势。应视系统的要求区别使用。     

用多Agent技术实现个性化搜索

文中分析了随着WWW发展出现的信息过量和现有的搜索引擎很难很好考虑用户兴趣的问题，提出了能够协助用户浏览的多Agent系统，这个多Agent系统主要由界面Agent,搜索Agent和学习Agent三个子Agent组成，文中主要介绍了两种界面模式和两种搜索模型，并介绍了学习Agent的学习策略，然后对两种搜索Agent进行了比较。     

踩点式信息搜索的新方法

从小偷踩点获取藏金信息中受到启发，提出了一种互联网信息智能搜索新方法。能够从已经分好类的特定领域网站中，准确高效地搜索出隐藏于其内部的目标网页。把所有的搜索网页根据检索信息分成两类：一类是信息点，一类是信息路径。采用信息路径特征与信息点信息量特征描述有机结合而形成的一种新的搜索知识表示方法。基于这种知识表示方法，智能搜索方法不仅能够对网站中网页进行深度优先的智能搜索，而且还能够通过对其搜索过程和结果的自学习来获取更多更好的搜索知识。     

双混沌机制优化方法及其应用

为了克服混沌优化方法在缩小优化变量的搜索空间前所进行的盲目搜索，提出一种具有双混沌机制的优化方法。该方法同时利用两种不同的混沌机制在搜索空间进行搜索，根据搜索情况来缩小搜索空间。该方法能够改善算法的通用性，避免了针对不同的优化函数选择搜索参数的缺点。仿真结果表明，该方法的搜索效率明显高于普通的混沌优化方法。     

基于模板的快速目标搜索算法研究

对两种基于模板的快速目标搜索算法－四叉树法、模板膨胀法进行了研究，并与逐点匹配法做了比较，得出结论。根据相关匹配原理，采用四叉树法和快速模板膨胀匹配法，对目标进行快速搜索，可以较大地提高目标区域的搜索速度。     

使用R树进行k-NN搜索

在地理信息系统中经常要做k-NN搜索，进行这些查询用到的算法与位置和范围查询的算法不同，需要专门进行研究，介绍了一种分支界限遍历R树算法，并将该算法概括为k-NN算法。文中讨论了两种方法。对R树进行结点内MBR的排序以及剪枝过程，以减少搜索空间中需访问结点的数量，有效地进行k-NN搜索。     

两种运动估值器的VLSI结构设计和研究

分别提出了菱形搜索和分层搜索两种运动估计算法的VLSI结构设计方法，前者采用较大的运算阵列，一次完成两个宏块间的匹配运算，后者将一次匹配运算分割成多个相同的运算单元，这些单元使用同一个较小的运算阵列分步完成。对两种算法及其结构进行了比较，列举几种测试序列下的实验结果和综合后芯片的一些参数的对比情况，综合采用在Synopsys软件JaNChartered 0．6um CMOS单元库进行综合。     

能力风暴机器人AS-UⅡ目标搜索研究

能力风暴机器人AS-UⅡ一般是通过一种或者两种自身携带的传感器实现目标搜索，但目标位置确定比较粗糙。通过综合应用多种传感器，采用粗搜索和精搜索相结合的方法，建立随机漫游轨迹算法实现粗搜索，建立方向和位置误差算法以实现精搜索，最后设计了目标搜索程序进行了模拟仿真和实际应用试验。结果表明：搜索目标可行，目标位置确定准确，其误差与一般搜索方法相比，大大降低，达到满意效果。     

Nonlinear analysis of reinforced concrete

This paper discusses the development of two different computer programs for nonlinear analysis of reinforced concrete structures.The first program handles plane stress problems. Flow theory of plasticity is used in the modelling of concrete and reinforcement. General four-noded quadrilateral elements with selective sampling of strain are used in the discretization.The second program is developed for analysis of plates and shells. Endochronic theory is used in the constitutive law for concrete whereas an overlay model is utilized for the reinforcement. Geometric nonlinearities are accounted for through updating of coordinates for the triangular shell elements.Several examples of applications of the two programs are given. The plane stress program is used for analysis of a beam and two different corbels, while the shell program has been applied to a square plate and a shell with geometric nonlinearities.     

利用XML和JaVa建立程序生成器

将XML、Java、JSP及程序生成器等技术与其方法结合起来，通过域分析的思路、方法和过程，讨论了使用XML和Java创建程序生成器的方法和过程，并比较了不同方法的优劣，指出了将XML应用到程序创建和维护上的优势。     

基于XML和JAVA构建程序生成器

本文将XML、JAVA、JSP及程序生成器等技术与方法结合起来,通过域分析的思路、方法、过程,讨论了使用XML和JAVA创建程序生成器的方法和过程,并比较了不同方法的优劣。指出了将XML应用到程序创建和维护上的优势。     

Evaluating the usage of fault localization in automated program repair: an empirical study

Fault localization techniques are originally proposed to assist in manual debugging by generally producing a rank list of suspicious locations.With the increasing popularity of automated program repair,the fault localization techniques have been introduced to effectively reduce the search space of automated program repair.Unlike developers who mainly focus on the rank information,current automated program repair has two strategies to use the fault localization information:suspiciousness-first algorithm(SFA)based on the suspiciousness accuracy and rank-first algorithm(RFA)relying on the rank accuracy.However,despite the fact that the two different usages are widely adopted by current automated program repair and may result in different repair results,little is known about the impacts of the two strategies on automated program repair.In this paper we empirically compare the performance of SFA and RFA in the context of automated program repair.Specifically,we implement the two strategies and six well-studied fault localization techniques into four state-of-the-art automated program repair tools,and then use these tools to perform repair experiments on 60 real-world bugs from Defects4J.Our study presents a number of interesting findings:RFA outperforms SFA in 70.02%of cases when measured by the number of candidate patches generated before a valid patch is found(NCP),while SFA performs better in parallel repair and patch diversity;the performance of SFA can be improved by increasing the suspiciousness accuracy of fault localization techniques;finally,we use SimFix that deploys SFA to successfully repair four extra Defects4J bugs which cannot be repaired by SimFix originally using RFA.These observations provide a new perspective for future research on the usage and improvement of fault localization in automated program repair.     

The Evolution of Programs: Automatic Program Modification

An attempt is made to formulate techniques of program modification, whereby a given program that achieves one goal can be transformed into a new program that uses the same principles to achieve a different goal. For example, a program that uses the binary search paradigm to calculate the square root of a number may be modified to divide two numbers in a similar manner, or vice versa. The essence of the approach is to find an analogy between the specifications of the given and desired programs, and then to transform the given program accordingly.     

Partitioning tasks between a pair of interconnected heterogeneous processors: A case study

With the variety of computer architectures available today, it is often difficult to determine which particular type of architecture will provide the best performance on a given application program. In fact, one type of architecture may be well suited to executing one section of a program while another architecture may be better suited to executing another section of the same program. One potentially promising approach for exploiting the best features of different computer architectures is to partition an application program to simultaneously execute on two or more types of machines interconnected with a high-speed communication network. A fundamental difficulty with this heterogeneous computing, however, is the problem of determining how to partition the application program across the interconnected machines. The goal of this paper is to show how a programmer or a compiler can use a model of a heterogeneous system to determine the machine on which each subtask should be executed. This technique is illustrated with a simple model that relates the relative performance of two heterogeneous machines to the communication time required to transfer partial results across their interconnection network. Experiments with a Connection Machine CM-200 demonstrate how to apply this model to partition two different application programs across the sequential front-end processor and the parallel back-end array.     

A Framework for Generating Distributed-Memory Parallel Programs for Block Recursive Algorithms

A framework for synthesizing communication-efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and Strassen's matrix multiplication is presented. This framework is based on an algebraic representation of the algorithms, which involves the tensor (Kronecker) product and other matrix operations. This representation is useful in analyzing the communication implications of computation partitioning and data distributions. The programs are synthesized under two different target program models. These two models are based on different ways of managing the distribution of data for optimizing communication. The first model uses point-to-point interprocessor communication primitives, whereas the second model uses data redistribution primitives involving collective all-to-many communication. These two program models are shown to be suitable for different ranges of problem size. The methodology is illustrated by synthesizing communication-efficient programs for the FFT. This framework has been incorporated into the EXTENT system for automatic generation of parallel/vector programs for block recursive algorithms.     

A FORTRAN program for constrained sequence-slotting based on minimum combined path length

This paper describes a program for combining or “slotting” together two ordered sequences of observations into a single combined sequence with the minimum possible “combined path length” while preserving the stratigraphic ordering within each original sequence. A dynamic programming approach is used to minimize the total length or distance through the combined sequence, taking as input user-defined distances or dissimilarities between each pair of observations. This optimization criterion in some situations may be more appropriate than other criteria. The program enables the user to specify, using simple mnemonic codes, any number of additional order constraints of 12 different types. The program is illustrated on a set of data comprising gamma, sonic, and induction logs from two wells. Detailed input instructions and a listing of the program are given.     

C/C#语言教学初探与比较

结合教学实践,通过对C语言和C#(读CSharp)语言的教学与分析,初步探讨两门程序设计语言各自的特点及在教学方面的异同,并且总结出当前高校计算机程序设计语言C与C#主要的教学方法和教学手段。     

A practical object-oriented analysis engine for CLP

The incorporation of global program analysis into recent compilers for Constraint Logic Programming (CLP) languages has greatly improved the efficiency of compiled programs. We present a global analyser based on abstract interpretation. Unlike traditional optimizers, whose designs tend to be ad hoc, the analyser has been designed with flexibility in mind. The analyser is incremental, allowing substantial program transformations by a compiler without requiring redundant re-computation of analysis data. The analyser is also generic in that it can perform a large number of different program analyses. Furthermore, the analyser has an object-oriented design, enabling it to be adapted to different applications easily and allowing it to be used with various CLP languages with simple modifications. As an example of this generality, we sketch the use of the analyser in two different applications involving two distinct CLP languages: an optimizing compiler for CLP(R) programs and an application for detecting occur-check problems in Prolog programs. © 1998 John Wiley & Sons Ltd.