支持向量机在胎膜早破预测中的应用

为快速、准确地对胎膜早破进行预测,首次应用了一种新型的数据挖掘技术-支持向量机预测模型.该模型针对所获取的胎膜早破及正常破膜数据集100个病例进行建模,并与神经网络、Logistic回归建模的性能进行了比较.结果表明,支持向量机具有可调参数少、学习速度快等优点,计算所得到的结果无论从准确率,还是所获取知识的可理解性等方面,都优于常用的神经网络等方法.用支持向量机方法建立的胎膜早破预测模型合理可行.     

广义Poisson超代数的同调与上同调群

给出了广义Poisson超代数的同调和上同调群的基本性质.特别是,通过Hochschild上同调以及长正合列,建立了广义Poisson超代数上同调群的理论,刻画了这种代数的低阶上同调群.最后,决定了5-正合列以及它的泛中心扩张的核.     

一般Hopf曲面上向量丛的结构

得到了非主Hopf曲面上连续复向量丛全纯结构的存在性及可滤性问题的充要条件.     

一类基于分层量化的Domain上的广义Alexander拓扑

文献[8]提出了一类基于分层量化的偏序集结构(以下简称R-偏序集).此结构是sfe[5]的非对称推广,也是拟度量空间(quasi-metric spaces,qms)[3]和广义超度量空间(generalized ultrametric spaces,gums)[4]的一种特殊情形.本文定义了其上的广义Alexande...     

Support vector machines in water quality management

Support vector classification (SVC) and regression (SVR) models were constructed and applied to the surface water quality data to optimize the monitoring program. The data set comprised of 1500 water samples representing 10 different sites monitored for 15 years. The objectives of the study were to classify the sampling sites (spatial) and months (temporal) to group the similar ones in terms of water quality with a view to reduce their number; and to develop a suitable SVR model for predicting the biochemical oxygen demand (BOD) of water using a set of variables. The spatial and temporal SVC models rendered grouping of 10 monitoring sites and 12 sampling months into the clusters of 3 each with misclassification rates of 12.39% and 17.61% in training, 17.70% and 26.38% in validation, and 14.86% and 31.41% in test sets, respectively. The SVR model predicted water BOD values in training, validation, and test sets with reasonably high correlation (0.952, 0.909, and 0.907) with the measured values, and low root mean squared errors of 1.53, 1.44, and 1.32, respectively. The values of the performance criteria parameters suggested for the adequacy of the constructed models and their good predictive capabilities. The SVC model achieved a data reduction of 92.5% for redesigning the future monitoring program and the SVR model provided a tool for the prediction of the water BOD using set of a few measurable variables. The performance of the nonlinear models (SVM, KDA, KPLS) was comparable and these performed relatively better than the corresponding linear methods (DA, PLS) of classification and regression modeling.     

Cohen–Macaulayness of monomial ideals and symbolic powers of Stanley–Reisner ideals

We present criteria for the Cohen–Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen–Macaulayness of monomial ideals which are intersections of prime ideal powers. We can characterize the Cohen–Macaulayness of the second symbolic power or of all symbolic powers of a Stanley–Reisner ideal in terms of the simplicial complex. These characterizations show that the simplicial complex must be very compact if some symbolic power is Cohen–Macaulay. In particular, all symbolic powers are Cohen–Macaulay if and only if the simplicial complex is a matroid complex. We also prove that the Cohen–Macaulayness can pass from a symbolic power to another symbolic powers in different ways.     

The ubiquity of generalized cluster categories

Associated with a finite-dimensional algebra of global dimension at most 2, a generalized cluster category was introduced in Amiot (2009) [1]. It was shown to be triangulated, and 2-Calabi–Yau when it is Hom-finite. By definition, the cluster categories of Buan et al. (2006) [4] are a special case. In this paper we show that a large class of 2-Calabi–Yau triangulated categories, including those associated with elements in Coxeter groups from Buan et al. (2009) [7], are triangle equivalent to generalized cluster categories. This was already shown for some special elements in Amiot (2009) [1].     

On some structural properties of generalized fullerene graphs with 13 pentagonal faces

It is shown that every generalized fullerene graph G with 13 pentagons is 2-extendable, a brick, and cyclically 5-edge-connected, i.e., that G cannot be separated into two components, each containing a cycle, by deletion of fewer than five edges. New lower bound on the number of perfect matchings in such graphs are also established.     

On the extendability of certain semi-Cayley graphs of finite abelian groups

A connected graph Γ with at least 2n+2 vertices is said to be n-extendable if every matching of size n in Γ can be extended to a perfect matching. The aim of this paper is to study the 1-extendability and 2-extendability of certain semi-Cayley graphs of finite abelian groups, and the classification of connected 2-extendable semi-Cayley graphs of finite abelian groups is given. Thus the 1-extendability and 2-extendability of Cayley graphs of non-abelian groups which can be realized as such semi-Cayley graphs of abelian groups can be deduced. In particular, the 1-extendability and 2-extendability of connected Cayley graphs of generalized dicyclic groups and generalized dihedral groups are characterized.     

强(A,η)-增生算子及其在变分包含中的应用

本文引入一类广义增生算子——强(A,η)-增生算子.定义强(A,η)-增生算子的广义预解算子并证明它的Lipschitz连续性,进一步证明含强(A,η)-增生算子的变分包含的一些新的迭代算法的收敛性.所得结果改进和推广了许多文献的相应结果.