基于RSKNN分类改进算法

RSKNN算法是K近邻算法的一种改进算法,该算法基于变精度粗糙集理论,能在保证一定分类精度的前提下,有效地降低分类样本的计算量,并且提高计算效率和分类精度．由于RSKNN算法对属性的依赖度较高,在分类时容易受到伪近邻的影响,导致RSKNN算法的分类精度受到一定程度的影响．针对存在问题,本文提出一种新颖的基于RSKNN算法的改进算法SMwRSKNN,该算法在RSKNN算法的基础上引入类别子空间的思想,以降低冗余属性和伪近邻对分类的影响．在UCI公共数据集上的实验结果表明,SMwRSKNN算法比RSKNN算法具有更高的分类精度．     

Spatial queueing for analysis, design and dimensioning of Picocell networks with mobile users

In this work, we characterize the performance of Picocell networks in the presence of moving users. We model various traffic types between base-stations and mobiles as different types of queues. We derive explicit expressions for expected waiting time, service time and drop/block probabilities for both fixed as well as random velocity of mobiles. We obtain (approximate) closed form expressions for optimal cell size when the velocity variations of the mobiles is small for both non-elastic as well as elastic traffic. We conclude from the study that, if the expected call duration is long enough, the optimal cell size depends mainly on the velocity profile of the mobiles, its mean and variance. It is independent of the traffic type or duration of the calls. Further, for any fixed power of transmission, there exists a maximum velocity beyond which successful communication is not possible. This maximum possible velocity increases with the power of transmission. Also, for any given power, the optimal cell size increases when either the mean or the variance of the mobile velocity increases.     

Parameterizing cut sets in a graph by the number of their components

For a connected graph G=(V,E), a subset U⊆V is a disconnected cut if U disconnects G and the subgraph G[U] induced by U is disconnected as well. A cut U is a k-cut if G[U] contains exactly k(≥1) components. More specifically, a k-cut U is a (k,?)-cut if V?U induces a subgraph with exactly ?(≥2) components. The Disconnected Cut problem is to test whether a graph has a disconnected cut and is known to be NP-complete. The problems k-Cut and (k,?)-Cut are to test whether a graph has a k-cut or (k,?)-cut, respectively. By pinpointing a close relationship to graph contractibility problems we show that (k,?)-Cut is in P for k=1 and any fixed constant ?≥2, while it is NP-complete for any fixed pair k,?≥2. We then prove that k-Cut is in P for k=1 and NP-complete for any fixed k≥2. On the other hand, for every fixed integer g≥0, we present an FPT algorithm that solves (k,?)-Cut on graphs of Euler genus at most g when parameterized by k+?. By modifying this algorithm we can also show that k-Cut is in FPT for this graph class when parameterized by k. Finally, we show that Disconnected Cut is solvable in polynomial time for minor-closed classes of graphs excluding some apex graph.     

QSAR结合人工神经网络方法研究取代芳烃分子结构与Na-K-ATP酶活性

运用函数连接型神经网络研究 3 8种取代芳烃化合物的分子结构—毒性的定量构效关系 (QSAR) ,计算结果与MLR计算结果比较 ,前者比后者好。与实验结果的线性拟合相关系数 ,FLN所得结果为 0 9561～ 0 9996,MLR所得结果为 0 869～ 0 965。     

Overexpression and elevated plasma level of tumor-associated antigen 90K/Mac-2 binding protein in colorectal carcinoma

The cancer cell secretome may contain potentially useful biomarkers. Previously, we have analyzed the colorectal carcinoma (CRC) cell secretome. In this study, tumor‐associated antigen 90K (TAA90K)/Mac‐2 binding protein (Mac‐2BP), one of the CRC cell secreted proteins, was chosen for evaluation as a potential CRC biomarker because its mRNA level was also found to be significantly elevated in CRC tissues and in a more metastatic CRC cell line from the analysis of two public domain array‐based datasets. Immunohistochemical analysis of 241 CRC specimens showed that TAA90K/Mac‐2BP was positively detected in 52.7% of the tumors, but weakly or not detected in over 95% of the adjacent nontumor epithelial cells. The plasma TAA90K/Mac‐2BP levels were significantly higher in CRC patients (N = 280) versus healthy controls (N = 147) (7.77 ± 3.49 vs. 5.72 ± 2.67 μg/mL, p<0.001). Moreover, combination of TAA90K/Mac‐2BP and carcinoembryonic antigen (CEA) could outperform CEA alone in discriminating CRC patients from healthy persons in this case‐control study. Our results collectively indicate that analysis of cancer cell secretome is a feasible strategy for identifying cancer biomarker candidates, and the TAA90K/Mac‐2BP may be a potential CRC biomarker.     

On the Efficient Evaluation of Coalescence Integrals in Population Balance Models

The solution of population balance equations is a function f(t,r,x) describing a population density of particles of the property x at time t and space r. For instance, the additional independent variable x may denote the particle size. The describing partial differential equation contains additional sink and source terms involving integral operators. Since the coordinate x adds at least one further dimension to the spatial directions and time coordinate, an efficient numerical treatment of the integral terms is crucial. One of the more involved integral terms appearing in population balance models is the coalescence integral, which is of the form ∫ ₀ ^x κ(x–y, y) f(y) f(x–y)dy. In this paper, we describe an evaluation method of this integral which needs only operations, where n is the number of degrees of freedom with respect to the variable x. This cost can also be obtained in the case of a grid geometrically refined towards x=0.     

Geodesic Matching with Free Extremities

In this paper, we describe how to use geodesic energies defined on various sets of objects to solve several distance related problems. We first present the theory of metamorphoses and the geodesic distances it induces on a Riemannian manifold, followed by classical applications in landmark and image matching. We then explain how to use the geodesic distance for new issues, which can be embedded in a general framework of matching with free extremities. This is illustrated by results on image and shape averaging and unlabeled landmark matching. Laurent Garcin is a former student of the Ecole Polytechnique. He obtained his Ph.D. in 2004 at the Ecole Normale de Cachan, working on matching methods for landmarks and images. He is an engineer at the French National Geographic Institute. Laurent Younes is a former student of the Ecole Normale Superieure in Paris. He was awarded the Ph.D. from the University Paris Sud in 1989, and the thesis advisor certification from the same university in 1995. He works on the statistical analysis of images and shapes, and on modeling shape deformations and shape spaces. Laurent Younes entered CNRS, the French National Research Center in October 1991, in which he has been a “Directeur de Recherche" until 2003. He is now a professor at the Department of Applied Mathematics and Statistics Department and the Center for Imaging Science at Johns Hopkins University in July 2003.     

单苯环氯取代指数法预测二噁类化合物PCDDs的正辛醇/水分配系数

采用单苯环氯取代指数作为氯代二苯并二口恶口英类化合物 (PCDDs)的分子结构描述符 ,通过正向逐步线性回归方法建立了PCDDs的logKow与分子结构描述符之间的定量关系模型。与文献报道的MOD模型相比 ,该模型不仅具有显著的相关性 (n =43,Radj=0 898,SE =0 195 ,在α =0 0 5时 ,F =2 0 45 5 ,p =0 0 0 0 0 ) ,而且对于分子结构具有更好的区分能力。利用建立的模型 ,对没有logKow文献值的其他 33种PCDDs化合物给出了预测值     

一种基于SOM和K means的文档聚类算法*

提出了一种把自组织特征映射SOM和Kmeans算法结合的聚类组合算法。先用SOM对文档聚类,然后以SOM的输出权值初始化Kmeans的聚类中心,再用Kmeans算法对文档聚类。实验结果表明,该聚类组合算法能改进文档聚类的性能。     

Models for Image Interpolation Based on the Optical Flow

Optical flow is the 2D motion that needs to be recovered from a video sequence. In this paper we study variational principles for the generation of interpolating sequences between two images. The basic assumption is that there exists an underlying video sequence that solves the optic flow equation and interpolates the two images. The numerical solution of the interpolation problem is reduced to the solution of a system of coupled partial differential equations. Some numerical simulations are presented. Received June 29, 2000; revised November 29, 2000