基于匹配序的合作对策联盟形成决策方法及其应用

合作对策中,联盟的形成过程是联盟一切活动的基础,直接影响着合作的稳定性与可持续发展。本文在分析局中人心理,情感,现实等因素对联盟形成所产生影响的基础上,首先定义了主观偏好标度值量化了心理、情感等因素,定义了收益分配函数将现实因素量化,构建了综合匹配函数作为局中人选择合作伙伴的一个序标准,通过定义匹配请求、交互匹配、直接交互匹配等概念,构建了基于匹配序的联盟形成决策模型,并证明了在特定情况下直接交互匹配的存在必然性。其次,给出了基于匹配序的联盟形成方法步骤,演化了大联盟的形成过程。最后通过具体实例验证了该决策方法的有效性与合理性。结果表明,该方法能有效的形成一系列可行且稳定的联盟结构,能快速演化联盟的形成过程,为有效解决联盟形成问题奠定了良好基础。

一种基于偏好序信息的双边匹配方法

针对双方主体给出匹配偏好序信息的双边匹配问题,提出了一种决策分析方法。首先通过构建双边匹配满意度函数,将匹配偏好序信息转化为匹配满意度,然后通过集结双方主体相互间的匹配满意度得到综合匹配满意度,进一步地,将综合匹配满意度视为双边主体之间匹配的权,进而将基于偏好序信息的双边匹配问题转化为完全二分图中的权匹配问题。为了解决双边匹配问题,构建了最大权匹配问题的优化模型,并通过模型的求解确定最优双边匹配结果。在本文最后,通过一个算例说明了提出方法的实用性和有效性。

基于序贯多目标匹配滤波器的雷达信号分选方法

面对日益复杂的电磁环境,电子侦察关注的重点是未经掌握的电磁目标,利用"先验信息"对密集脉冲流进行分选可以有效稀释脉冲流密度,从而提高后续信号分选的效率。针对此应用背景,在RFS理论对雷达模板状态集和量测集建模的基础上提出了一种基于序贯多目标匹配滤波器的信号分选方法。仿真实验表明该方法具备分选效率高、对丢失脉冲和干扰脉冲不敏感的优势。

基于图模型的供需匹配决策研究

从分析供需匹配之间存在的冲突入手,提出一种基于图模型冲突分析法来求解供需匹配问题的思路。首先在图模型视角下给出供需匹配问题的研究框架,分析不同类型的供需匹配问题,设定决策主体和决策策略;然后讨论不同匹配类型下的状态约简、偏好表达,进行稳定性分析;最后通过应用案例,将图模型法与群决策匹配算法进行对比分析,验证图模型求解供需匹配问题的有效性。

一种改进的Sunday模式匹配算法

字符匹配效率是很多计算机应用系统的性能瓶颈,研究设计高效的匹配算法有助于提高相应系统的应用性能。在分析典型Sunday匹配算法的基础上,对其进行了较为有效的改进。改进算法在字符串匹配前先计算模式串的倒序特征值,也就是以此计算出模式串的最后s个字符在本模式串中倒序除自己以外的下一次出现的位置。每一次字符匹配都采用倒序匹配并利用这种匹配的结果,匹配结果结合倒序特征值可以直接决定特征串的下一次位移数。在进行完一次字符匹配后,采用增加一个遍历字符的Sunday算法来遍历模式串以计算下一次位移数,以此尽可能地排除无效匹配。实验结果表明改进算法的效率比Sunday算法有一定提高。

六角格网的弧线矢量数据量化拟合方法

兵棋地图矢量化是指将地理信息因子以属性形式映射到以六角网格为组织结构的兵棋地图中的过程.由于地理信息连通结构复杂,其中包含大量的有向弧段数据,如何在保持原有拓扑连接的前提下快速准确地量化到六角网格一直是一个困难的问题.对此,提出一种串序匹配拟合方法.首先依据有向弧段生成所穿越的匹配单元序列;然后对每个匹配单元依据离散Fréchet距离确定最佳的拟合六角格边;最后寻找并连接各条有向格边序列的连通端点,形成连通图.实验结果表明,文中方法可以在线性时间内完成大量弧段的量化拟合计算;同时,由于在量化中弧段间的连接节点被调整到格点,各弧段间的连接关系可在拟合过程中得以保持;串序匹配拟合方法具有很好的适应性和很高的效率.

通用型Smart Help的开发

该文详细论述了Smart Help系统的开发原因,提出一种开发思想,最后谈及开发体会。

一种新的捷联惯导系统对准方法

针对舰载鱼雷捷联惯导系统的初始对准问题,提出了一种新的动基座快速传递对准方案——贯序传递对准方案。该方案采用"先角速度匹配,后速度+姿态匹配"的方法,在基座角运动不明显时,使失准角快速收敛。运用卡尔曼滤波算法,对这一传递对准方法与速度+姿态传递对准方案进行了仿真比较,研究结果表明,贯序传递对准方案具有更快的估计收敛速度,适用性更强。

Development of a SCAR marker for male gametophyte of Gracilariopsis lemaneiformis based on AFLP technique

The red alga Gracilariopsis lemaneiformis(Bory) is an economically valuable macroalgae. As a means to identify the sex of immature Gracilariopsis lemaneiformis, the amplifi ed fragment length polymorphism(AFLP) technique was used to search for possible sex- or phase-related markers in male gametophytes, female gametophytes, and tetrasporophytes, respectively. Seven AFLP selective amplifi cation primers were used in this study. The primer combination E-TG/M-CCA detected a specifi c band linked to male gametophytes. The DNA fragment was recovered and a 402-bp fragment was sequenced. However, no DNA sequence match was found in public databases. Sequence characterized amplifi ed region(SCAR) primers were designed from the sequence to test the repeatability of the relationship to the sex, using 69 male gametophytes, 139 female gametophytes, and 47 tetrasporophytes. The test results demonstrate a good linkage and repeatability of the SCAR marker to sex. The SCAR primers developed in this study could reduce the time required for sex identifi cation of Gracilariopsis lemaneiformis by four to six months. This can reduce both the time investment and number of specimens required in breeding experiments.

Middle matching mining algorithm

A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.

An Improving Indexing Approach on Time Series Based on Minimum Bounding Rectangle

A fundamental problem in whole sequence matching and subsequence matching is the problem of representation of time series.In the last decade many high level representations of time series have been proposed for data mining which involve a trade-off between accuracy and compactness.In this paper the author proposes a novel time series representation called Grid Minimum Bounding Rectangle(GMBR) and based on Minimum Bounding Rectangle.In this paper,the binary idea is applied into the Minimum Bounding Rectangle.The experiments have been performed on synthetic,as well as real data sequences to evaluate the proposed method.The experiment demonstrates that 69%-92% of irrelevant sequences are pruned using the proposed method.

A HYBRID THINNING ALGORITHM FOR BINARY TOPOGRAPHY MAP

A hybrid thinning algorithm for binary topography maps is proposed on the basis of parallel thinning templates in this paper.The algorithm has a high processing speed and the strong ability of noise immunity and preservation of connectivity and skeleton symmetry. Experimental results show that the algorithm can solve the thinning problem of binary maps effectively.

A Single Pattern Matching Algorithm Based on Character Frequency

Based on the study of single pattern matching, MBF algorithm is proposed by imitating the string searching procedure of human. The algorithm preprocesses the pattern by using the idea of Quick Search algorithm and the already-matched pattern psefix and suffix information. In searching phase, the algorithm makes use of the!character using frequency and the continue-skip idea. The experiment shows that MBF algorithm is more efficient than other algorithms.

3D Motion Parameters Determination Based on Binocular Sequence Images

Exactly capturing three dimensional (3D) motion i nf ormation of an object is an essential and important task in computer vision, and is also one of the most difficult problems. In this paper, a binocular vision s ystem and a method for determining 3D motion parameters of an object from binocu lar sequence images are introduced. The main steps include camera calibration, t he matching of motion and stereo images, 3D feature point correspondences and re solving the motion parameters. Finally, the experimental results of acquiring th e motion parameters of the objects with uniform velocity and acceleration in the straight line based on the real binocular sequence images by the mentioned meth od are presented.

Introducing semantic information into motion graph

To improve motion graph based motion synthesis,semantic control was introduced.Hybrid motion features including both numerical and user-defined semantic relational features were extracted to encode the characteristic aspects contained in the character's poses of the given motion sequences.Motion templates were then automatically derived from the training motions for capturing the spatio-temporal characteristics of an entire given class of semantically related motions.The data streams of motion documents were automatically annotated with semantic motion class labels by matching their respective motion class templates.Finally,the semantic control was introduced into motion graph based human motion synthesis.Experiments of motion synthesis demonstrate the effectiveness of the approach which enables users higher level of semantically intuitive control and high quality in human motion synthesis from motion capture database.

A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism

To meet the urgent requirement of enterprises for three-dimensional (3D) process models, an approach based on subgraph isomorphism is proposed to solve the matching problem between precursory 3D process model and 2D working procedure drawings. First, the projection drawings of the precursory 3D process model are obtained, then the primitives are extracted and the attributed adjacency graph (AAG) is constructed. Finally, by taking the 2D working procedure drawing as the AAG, and the projection drawing as the whole AAG, the matching problem between precursory 3D process model and 2D working procedure drawings is translated into the problem of subgraph isomorphism. To raise the matching efficiency, the AAG is partitioned, and the vertexes of the graph are classified effectively using the vertex’s attributes. Experimental results show that this method is able to support exact match and the matching efficiency can meet the requirement of practical applications.

Efficient processing of ordered XML twig pattern matching based on extended Dewey

Finding all occurrences of a twig pattern is a core operation of extensible markup language (XML) query processing. Holistic twig join algorithms, which avoid a large number of intermediate results, represent the state-of-the-art algorithms. However, ordered XML twig join is mentioned rarely in the literature and previous algorithms developed in attempts to solve the problem of ordered twig pattern (OTP) matching have poor performance. In this paper, we first propose a novel children linked stacks encoding scheme to represent compactly the partial ordered twig join results. Based on this encoding scheme and extended Dewey, we design a novel holistic OTP matching algorithm, called OTJFast, which needs only to access the labels of the leaf query nodes. Furthermore, we propose a new algorithm, named OTJFaster, incorporating three effective optimization rules to avoid unnecessary computations. This works well on available indices (such as B+-tree), skipping useless elements. Thus, not only is disk access reduced greatly, but also many unnecessary computations are avoided. Finally, our extensive experiments over both real and synthetic datasets indicate that our algorithms are superior to previous approaches.

Nested Chain Order

Let Xi,X2,... ,Xk be k disjoint subsets of S with the same cardinality m. Define H（m,k） = {X lahtain in S ： X ￠Xi for 1 ≤ i≤ k} and P（m,k） = {X lohtain ni S ： X ∩ Xi ≠0 for at least two Xi＇s}. Suppose S=Ui=1^k Xi , and let Q（m, k, 2） be the collection of all subsets K of S satisfying ｜K ∩ Xi｜ ≥ 2 for some 1 ≤ i ≤ k. For any two disjoint subsets Yi and Y2 of S, we define F1,j = {X lahtain in S ： either ｜X ∩Y1｜≥1 or ｜X ∩ Y2｜≥ j}. It is obvious that the four posets are graded posets ordered by inclusion. In this paper we will prove that the four posets are nested chain orders.