装备健康管理中的传感器优化配置问题研究

传感器优化配置是装备健康管理(HM)的基础。考虑传感器失效对健康管理能力的影响,以传感器代价和漏检故障的危害程度最小为优化目标,以检测性能指标为约束条件,建立了传感器优化配置的模型;并针对传感器优化配置是一个多目标非线性整数规划问题,提出了基于扩展微粒子群优化算法的模型求解方法。应用实例表明了模型和算法的有效性。     

基于遗传算法的海上舰艇编队配置方法研究

描述海上舰艇编队配置问题，建立了以舰艇数量最小、舰载装备系统协同质量最大为目标的多目标规划模型，并进行了单目标模型的转换。在此基础上，设计出一种禁忌变异的遗传算法，提出用遗传算法求解海上舰艇编队配置问题的方法。仿真结果表明了模型与算法的有效性。     

一种基于RGPS着色的C-net模型及其应用

可配置业务流程模型描述面向领域的相似流程模型家簇,这种模型能够通过配置操作获取满足特定用户需求的个性化流程模型.提出一个在角色和目标约束下以流程为中心的可配置业务流程模型,首先对因果网模型(C-net)进行扩展,将该模型中的活动元素增加角色和目标两个约束关系,从而利用RGPS需求元模型框架中对角色(R)、目标(G)、流程(P)、服务(S)之间的约束规则和关联关系去约束业务流程活动之间的执行序列,使得模型有效反映了业务流程活动中的实际行为;然后将活动的输入绑定和输出绑定端口设置配置操作标记,通过对端口配置标记的操作形成个性化流程;最后,给出了模型的形式化定义并分析模型在业务流程配置中的应用,使得能够指导业务流程的配置等管理操作.     

基于可持续发展区域水资源优化配置模型研究

介绍了水资源优化配置模型的分类,分析了现有水资源优化配置模型中存在的问题.以可持续发展思想为指导,以社会、经济、环境的综合效益最大为目标,以水量、环境和各行业发展产值作为约束条件,建立了水资源优化配置的多目标优化模型.     

基于蚁群算法的产品配置方法及其应用

为了更有效地解决产品配置优化问题,建立了基于相关矩阵的多目标产品优化配置模型,运用了改进的层次分析法计算各目标权重,提出了一种基于蚁群算法的产品配置求解方法,并在C#环境下进行了仿真实验,利用多次实验优化了算法参数。实验结果表明,该方法能有效解决产品配置求解问题,具有一定的理论参考价值和实际意义。     

教育信息网的构建

提出建设教育信息网络必须在切实可行的建网原则指导下进行。必须目标明确．措施得力,对建网原则的确定、目标的考虑、网络模型的选择、硬件和软件的配置、信息中心与校园网的连接等、县（市）级教育网的建设的关键问题作了阐述。     

基于可持续发展区域水资源优化配置模型研究

介绍了水资源优化配置模型的分类，分析了现有水资源优化配置模型中存在的问题。以可持续发展思想为指导，以社会、经济、环境的综合效益最大为目标，以水量、环境和各行业发展产值作为约束条件，建立了水资源优化配置的多目标优化模型。     

基于 BF 行为的多目标分布估计算法优化配置 SFCL

电力环网中超导故障限流器（SFCL）的优化配置需兼顾局部最优与全局最优之间的矛盾,研究满足收敛性和多样性要求的 SFCL 优化配置方法。针对现有方法遇到的局部与全局优化、单目标与多目标优化之间的矛盾,综合考虑电力环网内各条线路和全网对优化配置的要求,定义线路灵敏度系数指标,建立基于该指标的SFCL 优化配置模型,详细研究了该模型的多目标分布估计算法的具体配置过程,提出一种基于细菌觅食行为的多目标分布估计算法（MEDA-BF）的 SFCL 优化配置方法。运用评价算法优化性能的收敛性和多样性指标进行算法性能的评估,所提方法的两个指标的均值和方差均小于现有方法,具有更快、更稳定的收敛性。对 IEEE-30节点系统进行仿真,并与现有方法进行对比分析,所提方法使 SFCL 优化配置的目标函数更快速稳定地收敛到最配置目标,在实际配置 SFCL 方面优于现有方法。     

Hopfield连续模型与降低油田电网损耗

简要论述了Hopfield连续模型的原理以及电网Lyapunov能量函数的构造方法,分析了使油田电网损耗和总补偿费用最小作目标函数建立的网络综合函数,初步奠定了利用Hopfield电路模型开展油田电网节电工作的基础.     

基于工程决策的专家系统模型设计与研究

工程决策的影响因子和参数繁多且复杂,为提高工程决策的可用性和准确性提出基于工程决策的专家系统模型。模型根据现有数据模型结合实际需求,在关系数据内部形成知识支撑环境模型,采用框架和产生式规则相结合的方法,将推理过程与专家知识库结合,并提出一种综合评估方法为支持,辅助生产方案设计和措施调整。以油田实际生产现状为例,给出了相应油田异常井措施调整方案的推理过程,完成了模型的实例设计和实现,达到了提供辅助决策以提高决策可用性和准确性的目的。     

Symbolic debugging through incremental compilation in an integrated environment

It is demonstrated that fine-grained incremental compilation is a relevant technique when implementing powerful debuggers an incremental programming environments. A debugger and an incremental compiler for pascal has been implemented in the DICE system (Distributed Incremental Compiling environment). Incremental compilation is at the statement level which makes it useful for the debugger which also operates at the statement level. The quality of code produced by the incremental compiler approaches that required for production use. The algorithms involved an incremental compilation are not very complicated, but they require information that is easily available only in an integrated system, like DICE, where editor, compiler, linker, debugger and program data-base are well integrated into a single system. The extra information that has to be kept around, like the cross-reference database, can be used for multiple purposes, which makes total system economics favorable.     

LISP语言的增量式部分求值器

部分求值在软件优化中有着重要的作用，而增量式计算是避免重复计算的一种技术．本文基于部分求值和增量式计算的技术，实现了一个ＬＩＳＰ语言的增量武部分求值器，使得函数例化尽量在前次已经产生的剩余程序的基础上进行，从而很好地提高了效率．     

基于充分统计量的数据复杂度增量学习方法研究

数据复杂度是衡量数据类别可分性的指标,能够对数据预处理、分类器选择等环节提供有效的指导信息。但现有的数据复杂度计算方法不具备增量学习的功能,从而限制了它们的实际应用。研究结果表明可以通过计算充分统计量来实现增量学习功能的4个数据复杂度指标。实验结果验证,这些数据复杂度指标增量学习的有效性。     

The design of an interactive program development system for Pascal

A program language can be defined as the language in which computer programs are written, and a programming language as the language used by the programmer to create programs. This paper presents the design of an interactive program development system which uses Pascal as both program and programming language. Principal properties of the system are a complete immediate syntax check, a program-structure oriented editor, incremental compiling techniques, and interactive interpretation and debugging of programs. The syntax check is split into three phases, and the user can change the degree of check wanted. After a change of the program only part of it is recompiled, and only necessary phases of the compiling process are performed.     

Formal integration: A program transformation technique

A simple yet effective program transformation technique which turns complicated high-level expressions into incremental updating computations is introduced and discussed. This transformation, called Formal Integration, is based on a combination of general loop-fusion methods and formal differentiation. Its applicability is demonstrated in a variety of examples.     

The calculus of context relations

We present the theory of context relations. Context relations are a method for incremental semantic analysis in language-specific editors, which is able to handle incomplete program fragments. The algorithm is generated from the definition of a language's static semantics and is based on inference rules and order-sorted unification. The paper presents the underlying mathematical theory, optimal incremental analysis algorithms, handling of user-defined polymorphism and overloading, and implementation issues. It is intended as the concluding report on a by now mature concept, which has successfully been used to generate efficient incremental type inferencers for languages like ADA and Fortran 8x.     

GPU的并行支持向量机算法(英文)

提出了一种新的并行增量式支持向量机算法来解决图形处理单元(GPU)中大规模数据集的分类问题。SVM以及核相关方法可以用来创建精确分类模型,但学习过程需要大量内存和很长时间。扩展了Suykens和Vandewalle提出的最少次方SVM(LS-SVM)方法来建立增量和并行算法。新算法使用图形处理器以低代价获得高系统性能。实现表明,在UCI和Delve数据集上,基于GPU并行增量算法较CPU实现方法快130倍,而且比现行算法,如LibSVM、SVM-perf和CB-SVM等快的多(超过2500倍)。     

Complexity measure evaluation and selection

A formal model of program complexity developed earlier by the authors is used to derive evaluation criteria for program complexity measures. This is then used to determine which measures are appropriate within a particular application domain. A set of rules for determining feasible measures for a particular application domain are given, and an evaluation model for choosing among alternative feasible measures is presented. This model is used to select measures from the classification trees produced by the empirically guided software development environment of R.W. Selby and A.A. Porter, and early experiments show it to be an effective process     

Process control and machine learning: rule-based incrementalcontrol

In this paper, we discuss a rule-based incremental control program which has been used for controlling a laser cutting robot and in simulation for driving a car on a track, for a car parking manoeuvre, or for parking a truck with one trailer. The core of the paper concerns a learning program, Candide, which learns to control a process without a priori knowledge about the process, by observing random initial evolutions of the process and acquiring a qualitative model. Monotonous or derivative relationships between inputs and outputs are recognized, and then a rule-based incremental controller Is deduced from this model     

Incremental integration testing of concurrent programs

We present a method for selecting test sequences for concurrent programs from labeled transitions systems (LTS). A common approach to selecting test sequences from a set of LTSs is to derive a global LTS, called the reachability graph, and then force deterministic program executions according to paths selected from the graph. However, using a reachability graph for test path selection introduces a state explosion problem. To overcome this problem, a reduced graph can be generated using incremental reachability analysis, which consists of repeatedly generating a reachability graph for a subset of LTSs, reducing this graph, and using the reduced graph in place of the original LTSs. Unfortunately, existing incremental reachability analysis techniques generate reduced graphs with insufficient information for deterministic testing. We present an incremental approach to testing concurrent programs. Incremental testing consists of incremental reachability analysis for test path selection and deterministic testing for test execution. We define a new type of reachability graph for incremental analysis, called an annotated labeled transition system (ALTS). An ALTS is an LTS annotated with information necessary for deterministic testing. We propose practical coverage criteria for selecting tests paths from an ALTS and present an ALTS reduction algorithm. The results of several case studies are reported