摘要：ＡＮＵＮＩＦＩＥＤＭＥＴＨＯＤＡＮＤＴＨＥＯＲＹＦＯＲＧＲＡＭＭＡＲＤＥＳＩＧＮ　ＯＦＡＣＬＡＳＳＯＦＣＯＮＴＥＸＴ－ＳＥＮＳＩＴＩＶＥＬＡＮＧＵＡＧＥＳＬｉＺｈｏｕｊｕｎ；ＣｈｅｎＨｕｏｗａｎｇ；ＬｉＫａｎ（ＤｅｐａｒｔｍｅｎｔｏｆＣｏｍｐｕｔｅｒ...

摘要：This paper applies genetic simulated annealing algorithm (SAGA) to solving geometric constraint problems. This method makes full use of the advantages of SAGA and can handle under-/over- constraint problems naturally. It has advantages (due to its not being sensitive to the initial values) over the Newton-Raphson method, and its yielding of multiple solutions, is an advantage over other optimal methods for multi-solution constraint system. Our experiments have proved the robustness and efficiency of this method.

摘要：This paper presents an introduction to the initial design of the Structured Hyper-text Transfer Protocol (STTP), a compatible extension to the HTTP. It includes a new message setfor the control of resource transmission, and the Structured Hypertext Markup Language (STML)for describing the structural information of Web pages. Experimental tests show that STTP canbe significantly faster than HTTP, with the improvement of transmission time being around 70%to 400% and the same magnitude of packet savings, which is among the best performance improve-ment ever reported. The paper discusses the basic idea and major design considerations of thesecomponents, as well as a few important issues in developing STTP servers and clients.

摘要：An algebra proposed for current-mode CMOS multivalued circuits is briefly reviewed. This paper discusses its application in the design of multivalued circults. Several current-mode CMOS quaternary and quinary circuits are de-signed by algebraic means. The design method based on this algebra may offer a design simpler than the previously knowll ones.

摘要：Refutation methods based on the resolution principle are generally applied to a (finite) set of sentences, which must have a series of pre-transformations (prenex normalization, Skolemization and conjunction normalization) before starting the refutation. In this paper, the authors first generalize the concept of abatract consistency class to the most general form-universal abstract consistency class, and prove its universal unifying principle. Then, based on the R-refutation, a universal refutation method is proposed and its soundness and completeness are proved by means of the universal unifying principle. This method can be applied directly to any finite set of wffs without preprocessing the wffs at all so that the refutation procedure is more natural.

摘要：Abstract This paper presents a construction of 2 (2 n-1,n,λ) designs and gives the polynomial description of this class of *** construction applies to the cases of all integer n ≥2.

摘要：In this paper, a QoS multipath source routing protocol (QoS-MSR) is proposedfor ad hoc networks. It can collect QoS information through route discovery mechanism of multipathsource routing (MSR) and establish QoS route with reserved bandwidth. In order to reserve bandwidthefficiently, a bandwidth reservation approach called the multipath bandwidth splitting reservation(MBSR) is presented, under which the overall bandwidth request is split into several smallerbandwidth requests among multiple paths. In simulations, the authors introduce Insignia, an in-bindsignaling system that supports QoS in ad hoc networks, and extend it to multipath Insignia(M-Insignia) with QoS-MSR and MBSR. The results show that QoS-MSR routing protocol with the MBSRalgorithm can improve the call admission ratio of QoS traffic, the packet delivery ratio, and theend-to-end delay of both best-effort traffic and QoS traffic. Therefore, QoS-MSR with MBSR is anefficient mechanism that supports QoS for ad hoc networks.

摘要：The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a subgraph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each subgraph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs. Key words design pattern mining - attributed relational graph - subgraph isomorphism CLC number TP 311.5 Foundation item: Supported by the National Natural Science Foundation of China (60273075) and the Science Foundation of Naval University of Engineering (HGDJJ03019)Biography: LI Qing-hua (1940-), male, Professor, research direction: parallel computing.

摘要：Despite a short history of the Web development, Web-related technologies are rapidly develop- ing. However, the Web application quality is improving slowly, which requires efficient methods for devel- oping Web systems. This study presents a model for Web-based software development for analysis and design phases based on the ISO/IEC 12207 standard. It describes the methods used to define processes and entities in order to reflect the contents in Web applications. It applies the methodology of Web-Road Map by KCC Information and Technology using this model to the public project. As a result, Web-Road Map is proven to be an efficient model to analyze and design Web-applications.

摘要：在用数量化理论 3 类(quantification theory of type 3,简称 QT3)定量地分析软件需求的基础上,以质量功能展开(quality function deployment,简称 QFD)中的质量屋(house of quality,简称 HOQ)系列矩阵为纲领,基于由模糊技术改进后的模糊层次分析法(fuzzy analytic hierarchy process,简称 FAHP),提出了一种软件需求定量分析及其向设计实现过程模糊映射的方法.将该方法具体应用于 CD-R/RW 光盘刻录机软件的开发过程,其有效性得到了验证.