基于SQL Server2005的数据挖掘技术在高校教学评价中的应用研究

教学评价是教学管理过程中的重要环节，从教务管理系统数据库存储的大量数据中找出数据间的关系是当前教学管理的关键．本文以SQLServer2005为平台，采用Microsoft决策树算法对枣庄学院教务管理系统中的数据进行挖掘分析，找出教师本身素质与教学评价之间的内在关系．     

Enhancing site style tree construction algorithm

The World Wide Web has become a global information service center with a vast amount of news, advertisements, product and service information, and disparate information from diversified sources. However, only a small portion of information is truly relevant and useful to the users who are seeking information on specific topics. In this paper, common relations among nodes are taken into consideration when constructing site style tree, and a new node type is introduced. Experimental results show that the proposed algorithm has higher precision and recall.      

非对称恶劣信道下自动链路建立协议

自动链路建立(ALE)技术是第三代短波通信(3G)中的一项关键技术,握手过程是自动链路建立技术的一项重要内容。该文分析了3G-ALE异步握手协议在非对称信道下的性能,在此基础上提出了非对称信道下"基于信道先验估计"握手协议,给出了采用此协议的系统建链概率表达式和平均建链时间表达式。在非对称信道下,对采用3G异步握手协议和"基于信道先验估计"握手协议的系统性能进行了仿真比较。结果表明,采用"基于信道先验估计"握手协议可大大提高系统的建链效率。     

具有给定悬挂点数目的树的Merrifield—Simmons指标极值

研究了具有n个顶点的5叶树的Merrifield-Simmons指标值，并刻画了具有最小Menitleld-Simmons指标的5叶树。     

第二个大根不超过2~(1/2)的树

1982 年Cvetkovic D 提出“求出图的第二大根λ2( G) ≤1 的所有图”这一问题,1993 年,Hong Y 和Cao D 给出了λ2(G)≤13 的所有图,紧接着Miroslav P给出了λ2( G) ≤2 - 1 的所有图,但对Cvetkovic D 的问题的解决还需进一步的努力。1998 年,作者给出了第二个大根不超过1 的所有树。该文分别给出了第二个大根小于2 的所有树和第二个大根等于2 的所有树。     

系统建立线性时不变动态网络的状态方程

本文对系统建立线性时不变动态网络的状态变量的选择、规范树的确定提出了严格的规定,推出了建立网络状态方程的一套系统公式,使之有利于网络的计算机辅助分析,并通过例题对其适用性进行了论述。     

一类广义树的色性

本文证明了图G是树序列为{1，p，1，q-4个…1，2，2，r}的广义树的充要条件是G的色多项式为P(G；λ)=λ(λ-1)^p(λ-2)…(λ-q 2)^2(λ-q 1)^2(λ-q)^r，这里q=4.5。     

关于q-树的色多项式的一个注记

给出了计算q-树的色多项式的一种新方法.结果特殊化后可推出已有的一些结论.     

The runt test for multimodality

Single linkage clusters on a set of points are the maximal connected sets in a graph constructed by connecting all points closer than a given threshold distance. The complete set of single linkage clusters is obtained from all the graphs constructed using different threshold distances. The set of clusters forms a hierarchical tree, in which each non-singleton cluster divides into two or more subclusters; the runt size for each single linkage cluster is the number of points in its smallest subcluster. The maximum runt size over all single linkage clusters is our proposed test statistic for assessing multimodality. We give significance levels of the test for two null hypotheses, and consider its power against some bimodal alternatives. Research partially supported by NSF Grant No. DMS-8617919.     

The complexity of reconstructing trees from qualitative characters and subtrees

In taxonomy and other branches of classification it is useful to know when tree-like classifications on overlapping sets of labels can be consistently combined into a parent tree. This paper considers the computation complexity of this problem. Recognizing when a consistent parent tree exists is shown to be intractable (NP-complete) for sets of unrooted trees, even when each tree in the set classifies just four labels. Consequently determining the compatibility of qualitative characters and partial binary characters is, in general, also NP-complete. However for sets of rooted trees an algorithm is described which constructs the “strict consensus tree” of all consistent parent trees (when they exist) in polynomial time. The related question of recognizing when a set of subtrees uniquely defines a parent tree is also considered, and a simple necessary and sufficient condition is described for rooted trees. This work was supproted by the Alexander von Humoldt-Stiftung. I wish to thank Andreas Dress, Hans-Jürgen Bandelt and the referees for their helpful comments.