多目标二次规划非劣解集的理论生成及应用

本文对多目标二次规划问题非劣解集的理论生成进行了探讨,在介绍二次规划单目标问题优化解求法的基础上,提出了在决策平面上互切点,共交点轨迹的概念.由此导出了非劣解集的一般解析式(对切点解问题)和另一类交点解问题时的非劣解集求法,然后介绍了在目标平面非劣解集的解析表达式.使多目标二次规划问题整个非劣解集的推求严格、明确和方便,有理论和实际意义。文中以一个综合利用水库参数的多目标优选作为例子阐述了应用,并求出了最终的最佳协调解.     

基于集群计算机的保护定值在线校核

采用分布式计算技术，研究并实现了基于集群计算机的保护定值在线校核并行计算方法。首先分析了保护定值校核计算的计算量和计算特点，接着对可能采用的并行计算方法进行比较，最后选择了基于电网分块的并行计算方法。采用协调机加计算子机的计算模式，在协调机上执行分块算法，通过基于主导节点的图划分方法把电网分成几块，每台计算子机只校核1块电网内的保护定值，最后由协调机收集汇总计算结果。现场应用证明，该并行计算方法正确、有效。     

用电话网实现远程监控自动化

分析了偏僻高山上通信机房和电气房要进行监控的内容和特点等，探讨 了用经济、可靠的电话交换网实现远程监控自动化的方案和实施办法。该设计根据监控对象 的特点，利用现有的电话网络和程控交换机实现远程监控，不需要专用通信传输通道，不需 要增加硬件和软件，成本低，技术成熟，容易实现。     

On the monotonicity of (LDL) logic programs with set

LDL is one of the recently proposed logical query languages, which incorporate set, for data and knowledge base systems. Since LDL programs can simulate negation, they are not monotonic in general. On the other hand, there are monotonic LDL programs. This paper addresses the natural question of “When are the generally nonmonotonic LDL programs monotonic?” and investigates related topics such as useful applications for monotonicity. We discuss four kinds of monotonicity, and examine two of them in depth. The first of the two, called “ω-monotonicity”, is shown to be undecidable even when limited to single-stratum programs. The second, called “uniform monotonicity”, is shown to implyω-monotonicity. We characterize the uniform monotonicity of a program (i) by a relationship between its Bancilhon-Khoshafian semantics and its LDL semantics, and (ii) with a useful property called subset completion independence. Characterization (ii) implies that uniformly monotonie programs can be evaluated more efficiently by discarding dominated facts. Finally, we provide some necessary and/or sufficient, syntactic conditions for uniform monotonicity. The conditions pinpoint (a) enumerated set terms, (b) negations of membership and inclusion, and (c) sharing of set terms as the main source for nonuniform monotonicity.     

基于Level set方法的医学图像分割

本文引入了一种基于偏微分方程的曲线进化方法—Level set方法,通过与Fast marching方法的结合,可以实现运算速度的大大提高。同时引进了更有效的Kim提出的GMM(Group Marching Method)方法,减少了运算量,并给出了改进方法。最后,把该方法用于仿真图与医学图像分割中,获得了较好的效果。     

Experiences with a parallel algorithm for data flow analysis

We have designed a family of parallel data flow analysis algorithms for execution on distributed-memory MIMD machines, based on general-purpose, hybrid algorithms for data flow analysis [Marlowe and Ryder 1990]. We exploit a natural partitioning of the hybrid algorithms and explore a static mapping, dynamic scheduling strategy. Alternative mapping-scheduling choices and refinements of the flow graph condensation used are discussed. Our parallel hybrid algorithm family is illustrated on Reaching Definitions, although parallel algorithms also exist for many interprocedural (e.g., Aliasing) and intraprocedural (e.g., Available Expressions) problems [Marlowe 1989]. We have implemented the parallel hybrid algorithm for Reaching Definitions on an Intel iPSC/2. Our empirical results suggest the practicality of parallel hybrid algorithms.An earlier version of this paper was presented at Supercomputing '90.The research reported here was supported, in part, by the New Jersey Commission on Science and Technology and the CAIP Center's Industrial Members, by Siemens Research Corporation and by National Science Foundation grant CCR-8920078.     

示例学习的扩张矩阵理论

本文提出示例学习的一种计算理论,扩张矩阵论.根据这个理论,示例学习中一些主要最优化问题被证明是NP难题,并给出这些难题的近似解法及下界的估计.     

Effect of partitioning on microstructure and properties of a medium carbon Ti Mo bearing high strength Q&P steel

In order to investigate the effect of partitioning procedures on microstructure and properties of a medium carbon Ti Mo bearing steel, the salt bath experiment, field emission SEM, TEM and tensile tests as well as wear tests were utilized to clarify the microstructural evolution and property changes treated by different partitioning parameters. The results show that the microstructures consist of tempered lath martensite, cementite and (Ti, Mo)C particles. With prolonging partitioning time or increasing partitioning temperature, the amount of laths martensite decreases and thicker martensite plates with blunt boundaries appear. In addition, with increasing partitioning temperature from 310℃ to 400℃, the tensile strength, hardness and low temperature toughness are simultaneously decreased, and the reduction reaches up to about 300MPa, 100HV and 20J, respectively. Finally, the wear performance of the samples partitioned below Ms is obviously better than that of samples partitioned above Ms. The morphology of worn surface of samples partitioned below Ms is characterized by plastic fatigue morphology, while the worn surfaces of samples partitioned above Ms are mainly dominated by grooves.     

渐变填充的性质和算法

本文着重研究了Jordan数字流形上的渐变填充,设计了紧缩渐变填充算法和分裂渐变填充算法;并证明:如果D是离散网格空间上的Jordan凸集,那么存在O(|D||D|)时间的紧缩算法去做渐变填充.最后,我们对Jordan正方形区域、三角域和圆盘,分别给出了它们各自的O(|D|log_2|D|)时间的分裂渐变填充算法.