期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Intelligent System for Parallel Fault-Tolerant Diagnostic Tests Construction
1
作者 Anna Yankovskaya Sergei Kitler 《Journal of Software Engineering and Applications》 2013年第4期54-61,共8页
This investigation deals with the intelligent system for parallel fault-tolerant diagnostic tests construction. A modified parallel algorithm for fault-tolerant diagnostic tests construction is proposed. The algorithm... This investigation deals with the intelligent system for parallel fault-tolerant diagnostic tests construction. A modified parallel algorithm for fault-tolerant diagnostic tests construction is proposed. The algorithm is allowed to optimize processing time on tests construction. A matrix model of data and knowledge representation, as well as various kinds of regularities in data and knowledge are presented. Applied intelligent system for diagnostic of mental health of population which is developed with the use of intelligent system for parallel fault-tolerant DTs construction is suggested. 展开更多
关键词 Intelligent System Test Methods of Pattern Recognition MATRIX Model of Knowledge and Data Representation REVEALING of Various Kinds REGULARITIES FAULT-TOLERANT Diagnostic Tests PARALLEL Algorithm irredundant H-Fold Column Coverings of BOOLEAN MATRIX
下载PDF
The Total Irredundance Numbers on Graphs
2
作者 WANG Chunxiang FEI Pusheng 《Wuhan University Journal of Natural Sciences》 CAS 2007年第3期417-420,共4页
This paper discusses the total irredundance relations between the graph G and its clone-contraction graph H, that is, let H be the clone-contraction graph of G and v1,v2,...,vk be all contraction vertices ofH. IfS is ... This paper discusses the total irredundance relations between the graph G and its clone-contraction graph H, that is, let H be the clone-contraction graph of G and v1,v2,...,vk be all contraction vertices ofH. IfS is a maximal total irredundant set of H such that A = S ∩ {V1,V2,…,Vk} contains as few vertices as possible, then S'= S-A is the maximal total irredundant set of G. Furthermore, we obtain the bound of the total irredundance A(G) number: irt ≤△(G)/2△(G)+1 n, which n is the order of graph G, and △(G) is maximum degree in G. 展开更多
关键词 GRAPHS irredundance set total irredundance set totalirredundance number
下载PDF
The complete principal divisor lattices 被引量:3
3
作者 WANG XuePing & QU XiaoBing College of Mathematics and Software Science,Sichuan Normal University,Chengdu 610066,China 《Science China Mathematics》 SCIE 2010年第8期2159-2172,共14页
In this paper,we introduce a concept of principal divisor lattice and describe the structure of its elements.We first give a necessary and sufficient condition for the existence of irredundant join irreducible decompo... In this paper,we introduce a concept of principal divisor lattice and describe the structure of its elements.We first give a necessary and sufficient condition for the existence of irredundant join irreducible decompositions in complete principal divisor distributive lattices,and prove that the complete lower continuous,principal divisor lattices have irredundant join irreducible decompositions.In the end,we show the descriptions of lattices that have unique(resp.replaceable) irredundant join irreducible decompositions in complete lower continuous principal divisor lattices. 展开更多
关键词 COMPLETE LATTICE principal DIVISOR LATTICE DISTRIBUTIVE LATTICE irredundant join IRREDUCIBLE decomposition
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部