RKPM形状函数的矩式显式表述及快速计算

给出了计算再生核质点法(RKPM)形状函数及其导数的矩式显式处理方法。其特点是在计算形状函数及其导数时不涉及矩阵的求逆或者线性方程组的求解,从而减少计算误差的产生并提高了计算速度。二维及三维形状函数计算算例表明该方法是提高RKPM计算效率的一种有效途径。     

上海基础房价相关指标及走势的分析与研究

基础房价的相关指标及其走势一直是大众关心的热门话题．本文通过对上海基础房价相关指标的分析，建立了市场房价走势的两个数学模型．模型一：在相关性分析的基础上利用主成分分析消除指标间的共线性，再用回归拟合房价模型并进行预测；模型二：在相关性分析的基础上利用核估计方法预测出房价．继呵对2005年下半年的房价走势进行了预测，得出的结果与实际情况相吻合．     

一种基于Bhattacharyya核的SVM

包括图像识别在内的很多应用领域里,把单个样本表示成向量的集合的形式是很自然的想法,利用一个合适的核函数我们可以把这些向量映射到一个更高维的Hilbert空间,在这个高维空间里用Kernel PCA方法找到样本的高斯分布族,这样就可以把样本上的核函数定义成它们所服从的高斯分布密度函数的Bhattacharrya仿射.这样得到的核函数具有比较好的性质,比如说在各种变换下有稳定性表现,从而也说明了即使还有别的表示样本的方法,用向量集合的形式来表示单个的样本也是具有合理性的.     

基于SVM理论的一种新的数据分类方法

基于 SVM分类器在模式识别问题中有独特的优势 ,本文通过对标准 SVM模型的改造 ,提出了一种新的简单的数据分类方法 .理论分析和实验表明 ,该方法与标准 SVM分类方法相比具有处理大规模数据识别的能力且保持较高的样本识别率 ,节省存储空间等优势 .     

Kernel energy method: Basis functions and quantum methods

The kernel energy method (KEM) has been illustrated with peptides and has been shown to reduce the computational difficulty associated with obtaining ab initio quality quantum chemistry results for large biological compounds. In a recent paper, the method was illustrated by application to 15 different peptides, ranging in size from 4 to 19 amino acid residues, and was found to deliver accurate Hartree–Fock (HF) molecular energies within the model, using Slater‐type orbital (STO)‐3G basis functions. A question arises concerning whether the results obtained from the use of KEM are wholly dependent on the STO‐3G basis functions that were employed, because of their relative simplicity, in the first applications. In the present work, it is shown that the accuracy of KEM does not depend on a particular choice of basis functions. This is done by calculating the ground‐state energy of a representative peptide, ADPGV7B, containing seven amino acid residues, using seven different commonly employed basis function sets, ranging in size from small to medium to large. It is shown that the accuracy of the KEM does not vary in any systematic way with the size or mathematical completeness of the basis set used, and good accuracy is maintained over the entire variety of basis sets that have been tested. Both approximate HF and density functional theory (DFT) calculations are made. We conclude that the accuracy inherent in the KEM is not dependent on a particular choice of basis functions. The first application, to 15 different peptides mentioned above, employed only HF calculations. A second question that arises is whether the results obtained with the use of KEM will be accurate only within the HF approximation. Therefore, in the present work we also study whether KEM is applicable across a variety of quantum computational methods, characterized by differing levels of accuracy. The peptide, Zaib4, containing 74 atoms, was used to calculate its energy at seven different levels of accuracy. These include the semi‐empirical methods, AM1 and PM5, a DFT B3LYP model, and ab initio HF, MP2, CID, and CCSD calculations. KEM was found to be widely applicable across the spectrum of quantum methods tested. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2006     

On the core and nucleolus of minimum cost spanning tree games

We develop two efficient procedures for generating cost allocation vectors in the core of a minimum cost spanning tree (m.c.s.t.) game. The first procedure requires O(n ²) elementary operations to obtain each additional point in the core, wheren is the number of users. The efficiency of the second procedure, which is a natural strengthening of the first procedure, stems from the special structure of minimum excess coalitions in the core of an m.c.s.t. game. This special structure is later used (i) to ease the computational difficulty in computing the nucleolus of an m.c.s.t. game, and (ii) to provide a geometric characterization for the nucleolus of an m.c.s.t. game. This geometric characterization implies that in an m.c.s.t. game the nucleolus is the unique point in the intersection of the core and the kernel. We further develop an efficient procedure for generating fair cost allocations which, in some instances, coincide with the nucleolus. Finally, we show that by employing Sterns' transfer scheme we can generate a sequence of cost vectors which converges to the nucleolus. Part of this research was done while the author was visiting the Department of Operations Research at Stanford University. This research was partially supported by Natural Sciences and Engineering Research Council Canada Grant A-4181.     

Group decisions I. In arbitrary spaces of fuzzy binary relations

This article solves the problem of finding a set of group decisions that satisfy the classical Pareto unanimity principle for the case of initial data represented as fuzzy relations of individual preference. The solution proceeds from results obtained in studying the structure of convex (in the sense defined here) sets and their convex hulls. In the first part that study is carried out for spaces of arbitrary fuzzy binary relations.     

On the existence of 3- and 4-kernels in digraphs

Let $D=(V\left(D\right),A\left(D\right))$ be a digraph. A subset $S?V\left(D\right)$ is $k$-independent if the distance between every pair of vertices of $S$ is at least $k$, and it is $?$-absorbent if for every vertex $u$ in $V\left(D\right)?S$ there exists $v\in S$ such that the distance from $u$ to $v$ is less than or equal to $?$. A $k$-kernel is a $k$-independent and $(k?1)$-absorbent set. A kernel is simply a $2$-kernel.A classical result due to Duchet states that if every directed cycle in a digraph $D$ has at least one symmetric arc, then $D$ has a kernel. We propose a conjecture generalizing this result for $k$-kernels and prove it true for $k=3$ and $k=4$.     

Polynomial kernels for 3-leaf power graph modification problems

A graph G=(V,E) is a 3-leaf power iff there exists a tree T the leaf set of which is V and such that uv∈E iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion are FPT when parameterized by the size of the edge set modification. However, polynomial kernels were known for none of these three problems. For each of them, we provide kernels with O(k³) vertices that can be computed in linear time. We thereby answer an open problem first mentioned by Dom et al. (2004) [8].     

Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization

Disjoint frames are interesting frames in Hilbert spaces, which were introduced by Han and Larson in [4 D. Han and D. R. Larson ( 2000 ). Frames, Basis and Group Representations . Memoirs of the American Mathematical Society, No. 679. AMS, Providence, RI.  [Google Scholar]]. In this article, we use disjoint frames to construct frames. In particular, we obtain some conditions for the linear combinations of frames to be frames where the coefficients in the combination may be operators. Our results generalize the corresponding results obtained by Han and Larson. Finally, we provide some examples to illustrate our constructions.