基于分层递阶商空间链的图连通性研究

图连通性的判定对于路径规划中任意两点间路径相通性判断以及连通块的划分都具有重要意义。从节点的边连通关系着手分析图的结构层次,通过构建图的分层递阶商空间链,分析不同层次商空间链中各节点分布情况,得出新的图连通性判定方法。与以往各判定方法相比,该方法具有易实现、效率高的优点,不仅能有效地判定图是否连通,还能确定图的连通分支数以及哪些节点位于同一连通分支中。     

多氯联苯（PCBS）分配系数的估算和预测

基于烷烃分子距边矢量,将以原子为基准的距离－边数 量扩展为以基团为基准的距离－边数矢量。研究发现新分子距边矢量与多氯联苯正辛醇／水分配系数的对数有很好的线性关系：ｌｏｇＫｏｗ＝４．１０８８４＋０．５２４２３７ｕ１－０．０９２９０６２ｕ２ｎ＝３７,ｒ＝０．０９９０８,Ｓ＝０．１７７５,ＥＶ＝０．９８１１,Ｆ＝１８６８。     

并行PDBMS的数据划分方法

该文系统地分析了并行关系数据库的数据划分方法,指出在不同应用中,数据划分方法极大地影响了系统的性能,提出了综合不同方法以适应不同应用的思想。文章介绍了在并行关系数据库系统产ＤＢＭＳ中实现多种划分的方法。     

面向上下文无关语言的测试工具的设计和实现

软件测试是软件开发生命周期的重要组成部分,也是目前和今后相当长一段时间内保证软件质量和可靠性的主要手段,首先以两个已经实现了的分别面向VB和C/C 语言的计算机辅助软件测试工具为基础,将该系列测试工具的系统结构推广至适用于任何一种上下文无关语言。而该系列测试式工具高度的模块可重用性特征为这种推广提供了必要的基础。为实现这种高度的模块可重用性特征。从各个角度论述了增强该特征的设计,提出了基于块的程序划分机制。这种机制从根本上保证了对多种上下文无关语言的测试语义的一致性,最后,还给出了两个不同语言写就的实例的运行结果,以说明这种一致性。     

两种P2P模型比较与研究

本文介绍了P2P的工作原理及几个典型,着重分析比较了基于超级节点的和基于区域划分结构的两种P2P模型的特性,最后提出自己的观点。     

一种新的概念格并行构造算法

概念格作为形式概念分析理论中的核心数据结构,在数据挖掘和知识发现、人工智能、信息检索、粗糙集[1]等领域得到了广泛的应用。概念格的构造在其应用过程中是一个主要问题。提出了一种基于闭包系统划分的概念格并行构造算法——Para_Prun算法,它将概念集合看作初始闭包系统,引入了子闭包系统的有效性判断,迭代生成相互独立的多个子闭包系统,然后在每个子闭包系统中独立生成概念,有效地提高了概念的求解速度。最后用实验证明了算法的正确性和有效性。     

On variable-weighted exact satisfiability problems

We show that the NP-hard optimization problems minimum and maximum weight exact satisfiability (XSAT) for a CNF formula C over n propositional variables equipped with arbitrary real-valued weights can be solved in O(||C||2^0.2441n ) time. To the best of our knowledge, the algorithms presented here are the first handling weighted XSAT optimization versions in non-trivial worst case time. We also investigate the corresponding weighted counting problems, namely we show that the number of all minimum, resp. maximum, weight exact satisfiability solutions of an arbitrarily weighted formula can be determined in O(n ²·||C||?+?2^0.40567n ) time. In recent years only the unweighted counterparts of these problems have been studied (Dahllöf and Jonsson, An algorithm for counting maximum weighted independent sets and its applications. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 292–298, 2002; Dahllöf et al., Theor Comp Sci 320: 373–394, 2004; Porschen, On some weighted satisfiability and graph problems. In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005). Lecture Notes in Comp. Science, vol. 3381, pp. 278–287. Springer, 2005).     

Satisfying quality requirements in the design of a partition‐based,distributed stock trading system

Although quality requirements (QRs) have become a major drive in today's software development, there have been very few real‐world examples in the literature that demonstrate how to meet these requirements. This paper presents such an example. Specifically, the paper describes the design of a partition‐based distributed stock trading service system that satisfies a set of QRs related to resource utilization, performance, scalability and availability. The paper evaluates this design through detailed experiments and discusses some design alternatives and the lessons learned. Central to this design are a static load distribution strategy and a dynamic load balancing strategy. The first strategy is to achieve an initial balanced workload on the system's server cluster during the system initialization time, whereas the second strategy is to maintain this balanced workload throughout the system execution time. Together, these two strategies work in unison to ensure that the server resources are efficiently utilized; the user requests are processed with the required speed; the application is partitioned with sufficient room to scale; and the system is highly available. Copyright © 2011 John Wiley & Sons, Ltd.     

基于ANSYS的拱坝建模及网格划分

随着拱坝体型的复杂化,拱坝的建模及网格划分的难度也越来越大。以某拱坝为例,通过实体建模,介绍了ANSYS的APDL参数化建立拱坝的方法、过程与特点;采用ANSYS中的Extend(线的延伸)、Extrude(面的拉伸)和Divide(体切割)功能为该模型划分网格,解决了U型拱坝等边划分出的网格比例不当的问题。结果表明:APDL参数化建模的方法方便、快捷、易学习、易交流修改。采用切割等功能划分出的网格形状合理、比例恰当,并且可根据具体要求变更网格的密度,因此能对类似体型复杂、划分要求较高的有限元模型的划分具有很好的借鉴作用,也为此后的拱坝仿真计算打下坚实的基础。