网站用户登录信息挖掘特征规则

本文首先研究了基本的面向属性归纳，提出了从网站用户登录信息中挖掘用户特征规则的思路。问题从解决多属性归纳着手，特点是首先建立概念树，然后用条件属性组合与约束的方法进行挖掘。实验表明，本文设计的模型能客观地描述客户行为，为从Web信息挖掘客户特征规则提出了一条有效的途径。     

网络最小树的一种矩阵算法

求网络最小树问题，人们熟知常用的方法有“避圈法”和“破圈法”，这些方法有其直观易解的优点，然而它们毕竟是要在图上作业（在图上完成）。由于网络与距离矩阵的对应关系，本文将利用矩阵性质给出该问题的一个矩阵解法。     

Constructive characterizations of （γp, γ）- and （γp, γpr）-trees

Let G =(V,E) be a graph without isolated vertices.A set S  V is a domination set of G if every vertex in V -S is adjacent to a vertex in S,that is N[S] = V .The domination number of G,denoted by γ(G),is the minimum cardinality of a domination set of G.A set S  V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S]has a perfect matching.The paired-domination number,denoted by γpr(G),is defined to be the minimum cardinality of a paired-domination set S in G.A subset S  V is a power domination set of G if all vertices of V can be observed recursively by the following rules:(i) all vertices in N[S] are observed initially,and(ii) if an observed vertex u has all neighbors observed except one neighbor v,then v is observed(by u).The power domination number,denoted by γp(G),is the minimum cardinality of a power domination set of G.In this paper,the constructive characterizations for trees with γp = γ and γpr = γp are provided respectively.     

广义可加Fuzzy测度

本文首先引入Fuzzy集类上（广义）可加Fuzzy测度的有关概念，然后给出Fuzzy集上关于可加Fuzzy测度的Fuaay积分及有关定理，最后在一定条件下给出广义可加Fuzzy测度的一系列分解定理。     

概率树在全概率公式中的应用

针对应用全概率公式计算复杂事件概率时遇到的问题，提出采用概率树进行分析的方法．该方法能使试验的整个过程更加清楚直观，易于理解和分析；而且乘法原理与加法原理的应用，便于掌握和计算，从而能使复杂问题得以有效解决．     

L-Fuzzy保序算子空间的ω-分离性

在L-fuzzy保序算子空间中引进了ω-分离性等概念，系统地讨论了这些概念的性质。得出它们保持了L-fuzzy拓扑空间中的Ti分离性的主要结论，进而说明ω-分离性是R．Lowen的推广．     

Path Decomposition of Graphs with Given Path Length

A path decomposition of a graph G is a list of paths such that each edge appears in exactly onepath in the list.G is said to admit a {P_l}-decomposition if G can be decomposed into some copies of P_l,whereP_l is a path of length l-1.Similarly,G is said to admit a {P_l,P_k}=decomposition if G can be decomposed intosome copies of P_l or P_k.An k-cycle,denoted by C_k,is a cycle with k vertices.An odd tree is a tree of which allvertices have odd degree.In this paper,it is shown that a connected graph G admits a {P_3,P_4}-decompositionif and only if G is neither a 3-cycle nor an odd tree.This result includes the related result of Yan,Xu andMutu.Moreover,two polynomial algorithms are given to find {P_3}-decomposition and {P_3,P_4}-decompositionof graphs,respectively.Hence,{P_3}-decomposition problem and {P_3,P_4}-decomposition problem of graphs aresolved completely.     

用有限元自适网格控制结构应力分析的精度

本文涉及有限元结构应务分析精度控制的三个基本方面：１）自适应的有限元网格自动生成技术；２）有限元应力分析的误差估计：３）用单元尺寸场将误差分布用于形成新网格。