共查询到20条相似文献,搜索用时 15 毫秒
1.
Mikhail Ju. Moshkov 《Information Processing Letters》2007,103(2):66-70
Lower and upper bounds on the cardinality and the number of irreducible partial covers for almost all set cover problems are obtained. These bounds allow us to prove that there is no polynomial algorithm which for almost all set cover problems constructs all irreducible partial covers, but there exists a totally polynomial algorithm which constructs all irreducible partial covers for almost all set cover problems. 相似文献
2.
3.
基于集合枚举树的关联规则生成算法 总被引:2,自引:0,他引:2
在经典算法中由频繁项集生成关联规则需要生成频繁项集的所有非空子集作为候选后件集。李雄飞对此做出改进,提出逐层搜索后件的宽度优先算法。求下集极大元的Boundary算法也可用于求所有关联规则后件。论文提出一个深度优先算法GRSET(GenerateRulesbyusingSet-EnumerationTree),该算法利用集合枚举树,按照深度优先的方法逐一找出所有关联规则后件并得到相应的关联规则。通过实验对这三种算法进行比较,结果显示GRSET算法效率较高。 相似文献
4.
Some types of research are of interest to all software readers, and all types o f research are of interest to some software readers; but not all types of research are of interest to all Software readers. The key to success for IEEE Software, or any other publication trying to disseminate research results to practitioners, is to identify research that is of interest to "all Software readers.". 相似文献
5.
介绍了剩余格上的模糊同余关系和模糊滤子的定义,给出了剩余格上模糊滤子和模糊同余关系间的一一对应,证明了在剩余格上模糊滤子和模糊同余关系上定义适当的序关系可使它们是完备格同构。 相似文献
6.
用分层关联方法求有向图中所有Hamilton回路的算法 总被引:2,自引:0,他引:2
首先建立了有向图中初级通路的关联关系,并对初级通路的关联关系进行了分析,得到了关于初级通路关联关系的一些重要结果.然后,对初级通路的关联关系进行了分级分层.在此基础上,设计了求有向图中所有Hamilton回路的算法.该算法利用长度为k的初级通路及其分层关联关系逐步求长度为k+1的初级通路及其分层关联关系的方法,求得有向图的所有Hamilton回路.通过理论分析可以看到,所设计的算法与已有的求有向图的所有Hamilton回路的算法相比,避免了大量的重复计算,从而降低了算法复杂度,为求解Hamilton回路问题提供了新思路. 相似文献
7.
8.
The author considers the problem of cataloging all the shapes that can be generated by a cubic equation. In response to a letter commenting on an earlier column, he corrects an error in his listing of all the combinations of factorizations that could make degenerate curves, pointing out that all type 5's are really the same shape and all type 7's are really the same shape. He provides additional considerations on the possible shapes of nondegenerate curves 相似文献
9.
针对AGVS中循环死锁搜索算法研究中存在的不能搜索全部的循环死锁的问题,利用任务-资源图提出一个改进算法.改进算法如下:首先,根据AGV的相对位置关系和执行任务的情况,利用任务-资源图(Task-Resource graph,T-R图)对AGVS进行建模,然后根据循环死锁的T-R图特征,在每一个状态时刻下的T-R图使用图的强连通分支理论搜索循环死锁.当访问完所有状态时刻下的T-R图,也就找到了AGVS中的所有循环死锁.算例验证与理论分析均说明改进算法可以搜索到全部类型的循环死锁,解决了原算法存在的不足.根据改进算法开发的控制规则,可以有效避免新循环死锁的产生.同时指出,对改进算法稍加修改,可以找到AGVS中所有的循环死锁和非循环死锁. 相似文献
10.
11.
给出了命题逻辑上信念修正的两种可操作的完全方法.首先对R-演算的规则进行了修改,使得对任何一个极大协调的子集都通过这组规则得到.然后,给出了求得所有的极小不协调子集的一组规则.最后,给出一个过程,该过程能求得所有的极大协调子集.因为这两种方法都能求得所有的极大协调子集,所以把它们称为完全的. 相似文献
12.
唐卡图像复杂破损区域的修复 总被引:1,自引:0,他引:1
为了解决唐卡图像复杂破损区域修复的一类实际工程问题,从唐卡图像复杂破损区域的检测分割、误检测破损区域的屏蔽、各破损区域的定位惟一化、修复块修复优先级的确定、样本块的检索,到各破损区域中既定修复块的修复等一系列的过程与工程技术,详细地介绍了该类唐卡灰度图像与彩色图像复杂破损区域的修复技术,并给出了相应的修复结果. 相似文献
13.
Vitus J. Leung 《Theoretical computer science》1997,180(1-2):203-215
We define the unrestricted modified edit distance based on the modified edit distance defined by Galil and Giancarlo (1989) where the cost of substring deletions and insertions are contextsensitive and the cost of character substitutions are context-free. The modified edit distance is the minimum cost of converting a string X to a string Y where the sequence of edit operations has the property that all substring deletions precede all character substitutions and all character substitutions precede all substring insertions. Note that the modified edit distance does not satisfy the triangle inequality. We show that the problem of finding the unrestricted modified edit distance which is the minimum cost over all edit sequences (without these constraints) of converting X to Y is undecidable. 相似文献
14.
String stability of interconnected systems 总被引:2,自引:0,他引:2
Introduces the notion of string stability of a countably infinite interconnection of a class of nonlinear systems. Intuitively, string stability implies uniform boundedness of all the states of the interconnected system for all time if the initial states of the interconnected system are uniformly bounded. It is well known that the input output gain of all the subsystems less than unity guarantees that the interconnected system is input-output stable. The authors derive sufficient (“weak coupling”) conditions which guarantee the asymptotic string stability of a class of interconnected systems. Under the same “weak coupling” conditions, string-stable interconnected systems remain string stable in the presence of small structural/singular perturbations. In the presence of parameter mismatch, these “weak coupling” conditions ensure that the states of all the subsystems are all uniformly bounded when a gradient-based parameter adaptation law is used and that the states of all the systems go to zero asymptotically 相似文献
15.
16.
Ravi R. Khargonekar P.P. Minto K.D. Nett C.N. 《Automatic Control, IEEE Transactions on》1990,35(11):1259-1262
The authors obtain a parametrization of all stabilizing controllers for a given discrete-time time-varying linear finite-dimensional multirate system. The parametrization is a natural extension of the Youla parametrization of all stabilizing controllers to the setting of multirate systems. The set of all stabilizing controllers is shown to be the set of all closed-loop systems obtained by terminating a fixed two-port multirate system in a stable multirate system. State-space formulas for the parametrization are also given 相似文献
17.
基于全相位数据空间的概念以及一种二维加窗全相位图像滤波模板的设计,给出了一修正的二维全相位图像卷积滤波模板设计方法。方法在用全相位概念设计滤波模板中充分考虑了用DFT和循环卷积表达线性卷积时的等价性条件,以确保待设计的全相位滤波器的频率响应特性与给定的原型滤波器的频率特性矩阵有更好的相关性和一致性。实验表明,该全相位滤波模板与已有的二维全相位图像滤波模板比较,有过渡带的宽度窄、滚降陡峭,阻带衰减小等特点,可以进一步有效消除方块效应,提高滤波处理后图像的质量。 相似文献
18.
随着科学技术的发展,人们越来越多地利用计算机管理相关事宜,希望能将所有多媒体文件存储在数据库中。然而,在实现的过程中,将多媒体文件插入到数据表格中又是一个比较头疼的问题。文中利用Delphi作为界面开发工具,提出了一个将图片插入到数据库中的新方法: 相似文献
19.
20.
Diamond and simplex models are useful in dealing with systems under parameter perturbations. A diamond (simplex) stability region is an open set in the complex plane with the property that if the zeros of all vertex polynomials of any diamond (simplex) family are all in , then the zeros of all the polynomials of this family are all in . It is shown that some typical stability regions used in control systems design are diamond (simplex) stability regions. Some discussions and extensions are also presented. 相似文献