基于目标部分满意度的需求设计方案评估

不同的需求设计方案对软件系统中非功能目标的实现具有不同的影响。这些非功能目标一般不能以一种绝对清晰定义的程度来满足,常常是以一种部分满意的方式实现,现实中寻求“满意”解比寻求“最优”解更符合实际情况。为了反映此特性,该文在分析目前已存在方法局限性的基础上,利用Letier和Lamsweedre提出的基于概率理论的面向目标的推理方法,对目标部分满意度建模。模型建立在客观标准基础上,在领域内具有实际物理解释,获得了不同方案对目标满意度的影响,可更好地用于指导需求分析和设计决策。     

近似图包含搜索和索引技术的研究

在对图形数据库中的几种有代表性的传统相似性搜索及索引构造方法进行总结分析的基础上,探讨了近似图包含搜索区别于传统相似性搜索的特征,并且提出了一种针对近似图包含搜索的基于覆盖率和支持度对频繁子模式进行筛选的索引构造算法。实验结果验证了该方法的有效性。     

Backtrack search algorithms and the maximal common subgraph problem

Backtrack algorithms are applicable to a wide variety of problems. An efficient but readable version of such an algorithm is presented and its use in the problem of finding the maximal common subgraph of two graphs is described. Techniques available in this application area for ordering and pruning the backtrack search are discussed. This algorithm has been used successfully as a component of a program for analysing chemical reactions and enumerating the bond changes which have taken place.     

A Hybrid Approach to Online and Offline Partial Evaluation

This article presents a hybrid method of partial evaluation (PE), which is exactly as precise as naive online PE and nearly as efficient as state-of-the-art offline PE, for a statically typed call-by-value functional language.PE is a program transformation that specializes a program with respect to a subset of its input by reducing the program and leaving a residual program. Online PE makes the reduction/residualization decision during specialization, while offline PE makes it before specialization by using a static analysis called binding-time analysis. Compared to offline PE, online PE is more precise in the sense that it finds more redexes, but less efficient in the sense that it takes more time.To solve this dilemma, we begin with a naive online partial evaluator, and make it efficient without sacrificing its precision. To this end, we (1) use state (instead of continuations) for let-insertion, (2) take a so-called cogen approach (instead of self-application), and (3) remove unnecessary let-insertion, unnecessary tags, and unnecessary values/expressions by using a type-based representation analysis, which subsumes various monovariant binding-time analyses.We implemented and compared our method and existing methods—both online and offline—in a subset of Standard ML. Experiments showed that (1) our method produces as fast residual programs as online PE and (2) it does so at least twice as fast as other methods (including a cogen approach to offline PE with a polyvariant binding-time analysis) that produce comparable residual programs.     

二部图凝聚子图快速查询算法以及在电子商务中的应用

随着互联网的飞速发展,亚马逊,阿里巴巴和eBay这样的的电子商务平台已经成为世界经济不可或缺的一环.在这些电子商务平台中,用户和商品之间的互动可以自然地抽象成二部图,其中每个点表示用户或商品,每条边表示用户购买或评价了物品.如果一些用户和商品之间发生了紧密的联系,那么他们就形成了一个电子社区.基于二部图中的凝聚子图模型(α,β)-core,引入了(α,β)组的概念来代表社区.设计了有效且快速的算法来计算大规模用户-商品二部图中包含给定查询点的(α,β)组,给出了查询算法并分析了算法的时间和空间复杂度.在6个真实数据集上的实验证实了采用(α,β)组这一模型的合理性以及提出的算法的高效性.     

基于子图同构与事例匹配的装配体局部结构相似性分析

基于事例推理是解决面向装配的设计和装配工艺规划问题的有效方法,装配体检索是应用此方法的关键步骤.为此提出一种基于子图同构与事例匹配的装配体局部结构相似性分析方法.该方法将装配体零件间的装配关系用属性邻接图来表示,通过对装配体中联结关系的定性分类及装配体属性邻接图预处理规则的定义,利用Ullmann算法匹配出相似的装配体图(子图)结构,并给出了装配体局部结构相似度计算公式.最后通过实例验证了文中方法的有效性.     

Maximum planar subgraphs and nice embeddings: Practical layout tools

In automatic graph drawing a given graph has to be laid out in the plane, usually according to a number of topological and aesthetic constraints. Nice drawings for sparse nonplanar graphs can be achieved by determining a maximum planar subgraph and augmenting an embedding of this graph. This approach appears to be of limited value in practice, because the maximum planar subgraph problem is NP-hard.We attack the maximum planar subgraph problem with a branch-and-cut technique which gives us quite good, and in many cases provably optimum, solutions for sparse graphs and very dense graphs. In the theoretical part of the paper, the polytope of all planar subgraphs of a graphG is defined and studied. All subgraphs of a graphG, which are subdivisions ofK ₅ orK _3,3, turn out to define facets of this polytope. For cliques contained inG, the Euler inequalities turn out to be facet-defining for the planar subgraph polytope. Moreover, we introduce the subdivision inequalities,V _2k inequalities, and the flower inequalities, all of which are facet-defining for the polytope. Furthermore, the composition of inequalities by 2-sums is investigated.We also present computational experience with a branch-and-cut algorithm for the above problem. Our approach is based on an algorithm which searches for forbidden substructures in a graph that contains a subdivision ofK ₅ orK _3,3. These structures give us inequalities which are used as cutting planes.Finally, we try to convince the reader that the computation of maximum planar subgraphs is indeed a practical tool for finding nice embeddings by applying this method to graphs taken from the literature.     

A Tabu-enhanced genetic algorithm approach for assembly process planning

Over the past decade, much work has been done to optimize assembly process plans to improve productivity. Among them, genetic algorithms (GAs) are one of the most widely used techniques. Basically, GAs are optimization methodologies based on a direct analogy to Darwinian natural selection and genetics in biological systems. They can deal with complex product assembly planning. However, during the process, the neighborhood may converge too fast and limit the search to a local optimum prematurely. In a similar domain, Tabu search (TS) constitutes a meta-procedure that organizes and directs the operation of a search process. It is able to systematically impose and release constraints so as to permit the exploration of otherwise forbidden regions in a search space. This study attempts to combine the strengths of GAs and TS to realize a hybrid approach for optimal assembly process planning. More robust search behavior can possibly be obtained by incorporating the Tabus intensification and diversification strategies into GAs. The hybrid approach also takes into account assembly guidelines and assembly constraints in the derivation of near optimal assembly process plans. A case study on a cordless telephone assembly is used to demonstrate the approach. Results show that the assembly process plans obtained are superior to those derived by GA alone. The details of the hybrid approach and the case study are presented.     

Quest for Fast Partial Search Algorithm

The Grover quantum algorithm can find a target item in a database faster than any classical algorithm. In partial search, one trades accuracy for speed, and a part of the database (a block) containing the target item can be found even faster. We consider different partial search algorithms and argue that the algorithm originally suggested by Grover and Radhakrishnan and modified by Korepin is the optimal one. The efficiency of an algorithm is measured by the number of queries to the oracle.     

基于部分失真搜索的自组织映射学习算法

针对传统的自组织映射网络在大数据量或高维情形下训练过程较慢的问题,提出了分别使用部分失真搜索和扩展的部分失真搜索来完成传统算法中最耗时的最近邻搜索过程,减少了完成训练所需乘法次数。实验表明,相对于传统的自组织映射学习算法,所提两种方法分别可以节约近1/3和1/2以上的计算量。     

Unique subgraphs are not easier to find

Given a pattern graph H with l edges, and a host graph G guaranteed to contain at most one occurrence of a subgraph isomorphic to H, we show that the time complexity of the problem of finding such an occurrence (if any) in G as well as that of the decision version of the problem are within a multiplicative factor O(l) of the time complexity for the corresponding problem in the general case, when G may contain several occurrences of H. It follows that for pattern graphs of constant size, the aforementioned uniqueness guarantee cannot yield any asymptotic speed up. We also derive analogous results with the analogous multiplicative factor linear in the number of vertices of H in the induced case when occurrences of induced subgraphs of G isomorphic to H are sought.     

CAD mesh model simplification with assembly features preservation

This paper aims to investigate a CAD mesh model simplification method with assembly features preservation, in order to satisfy the requirement of assembly field for the information of 3D model. The proposed method simplifies a CAD mesh model as follows. Firstly, the notion of ＂conjugation＂ is incorporated into the definition of assembly features, with the purpose of benefitting the downstream applications such as assembly features recognition and preservation. Subsequently, the attributed adjacency graphs （AAGs） of the region- level-represented parts are established. The assembly features are automatically recognized by searching for conjugated subgraphs of every two AAGs based on subgraph isomorphism algorithm. In order to improve the efficiency of assembly features recognition, the characteristics of conjugated subgraphs are adopted to initialize the mapping matrix, and the ＂verifying while matching strategy＂ is used to verify the validity of every two newly founded vertices which are correspondingly matched. Then, simplified CAD mesh model with assembly features preserved is constructed after suppressing the common form features. The method is applied successfully to simplify the CAD mesh model with assembly features well preserved. Moreover, the tradeoff between the cost of time for conjugated subgraphs matching and the complexity of the to-be-matched parts is proven to be almost linear.     

多装配接口的三维装配模型检索方法

针对三维模型装配时存在的多接口连接方式,提出一种多装配接口的三维装配模型检索方法.首先对三维装配模型进行属性邻接图的表达,并根据装配体零件之间的接口配合关系定义共轭子图;然后针对装配模型构成的图集进行图顶点的序列化,降低顶点匹配过程中的遍历次数;在此基础上,将装配模型的检索转化成查找符合共轭子图的属性邻接图,通过装配模型属性邻接图的图集进行模型检索;最后对频繁子图挖掘方法进行改进,提取出满足多装配接口的三维装配模型.实验结果表明,该方法能够实现多装配接口的三维装配模型检索,可以提取出设计人员所需的三维模型,提高产品的设计效率.     

三维装配模型共性结构发掘方法

为了更好地利用三维装配模型可重用的共性结构信息,减少重复性的劳动,缩短产品的开发周期,提出一种三维装配模型共性结构发掘方法.首先,以三维装配模型各零件的属性邻接图为基础,保持装配特征属性信息,简化非装配特征属性信息,形成属性化装配特征邻接图;然后,基于三维装配模型各零件之间的装配关系,将零件的属性化装配特征邻接图组合形成三维装配模型属性邻接图;其次,通过频繁子图挖掘算法提取三维装配模型的共性结构.最后,以一组夹具模型为例进行实例验证,结果表明该三维装配模型共性结构发掘方法能够准确有效地发掘产品中的共性结构信息,具有良好的应用效果.     

Object－Oriented Modeling of Virtual Assembly Process

Virtual assembly is a Virtual Reality (VR) based engineering application which allows engineers to evaluate, analyze, and plan the assembly of mechanical systems. To model the virtual assembly process, new methodology must be applied. Based on the idea that the virtual assembly system is an event driven system, the interactive behavior and information model is proposed to describe the dynamic process of virtual assembly. Definition of the object-oriented model of virtual assembly is put forward.     

动态图模式匹配技术综述

随着大数据时代的到来,多源异构数据的快速增长已经成为了一个开放性问题,这些数据之间的内在关联通常可以用图数据的形式来表现.然而在实际应用中,例如网络安全分析和社交网络舆情分析,描述实体对象之间关系的图数据的结构和内容往往不是固定不变的,图数据的结构以及节点和边的属性会随着时间的推移发生更新变化.因此,如何在动态更新的图数据中进行高效的查询、匹配是目前研究的热点问题,也涌现了许多优秀的研究工作.本文从关键技术、代表性算法和性能评价方面对动态图匹配技术的研究进展进行了综述.最后对动态图匹配技术的典型应用、面临的挑战问题和未来发展趋势进行了总结和展望.     

不含｛M（p，q），C3，C4｝作为导出子图的图的色数

Gyárfás 曾猜想,设 F是一个森林,对于每一个 F‐free 的图 G ,存在整数函数 f（F ,ω（G））使得χ（G）尘 f（F ,ω（G））。利用一个引理,得到了每一个不含｛M（p ,q）,C3,C4｝作为导出子图的图是（p ＋ q －1）‐可着色的。     

采用捕鱼策略的优化方法

引入一种采用渔夫捕鱼策略的新的优化方法。该优化方法主要采用移动搜索、收缩搜索和加速搜索三种搜索技术。设初始时在搜索域中随机分布有若干个点,每个点看作一个“渔夫”,每个“渔夫”通过移动、收缩和加速三种搜索方式在搜索空间中独立开展寻优活动,以搜寻全局的最优解或最优点。测试结果表明,该算法具有较好的全局搜索能力,因而该优化方法是有效的和可行的。     

Quantum Partial Search of a Database with Several Target Items

We consider unstructured database separated into blocks of equal size. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We present a fast quantum algorithm, which finds one of the target blocks. The algorithm uses the same oracle, which the main Grover algorithm does. We study the simplest case, when each target block has the same number of target items. Our algorithm is based on Boyer, Brassard, Hoyer, and Tapp algorithm of searching database with several target items and on Grover–Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle. We analyze the algorithm for blocks of large size. In next publications we shall consider more general case when the number of target items is different in different target blocks.