The Szegö kernel on a class of non-compact CR manifolds of high codimension

We generalize Nagel’s formula for the Szegö kernel and use it to compute the Szegö kernel on a class of non-compact CR manifolds whose tangent space decomposes into one complex direction and several totally real directions. We also discuss the control metric on these manifolds and relate it to the size of the Szegö kernel.     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

分类挖掘技术在高校人事管理中的应用

探讨分类挖掘技术在高校实际工作中的应用方式与应用领域。以高校人事管理为模型，应用数据挖掘中决策树算法，对高校人力资源数据源中的信息进行分析，发现其中有价值的数据模式，寻找其中存在的关系和规则，对高校人才规划提供比较客观的决策支持。     

一种新的主动网络安全体系的设计

尽管主动网络原型系统中设计了一些安全措施，但是它们都不具通用性且主要集中在security方面，这在主动网络必须和传统网络相兼容的情况下，阻碍了主动网络的发展。本文在定义消极型错误和积极型错误的基础上，设计了主动网络资源控制核。然后提出了集security和safety保障为一体的基于资源控制核的一种通用的主动网络安全体系，探讨了该体系应具有的特点、设计目标和可行性，并设计了主动节点的安全机制。     

在线multicast数据传输网络中的一个优化问题

首先建立了数据传输网络选择的最小成本模型，给出了有效支撑树代表集的概念，并给出了一个时间复杂性为D(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题，分别给出了一个时间复杂性为D(mlogen)和O(m^2 mlogen)的多项式时间的算法。     

PZT陶瓷的断裂分析

与有限元法相比,无网格法由于只需节点不用单元而在压电分析中具有优越性。采用一个简单的包含有极化反转及电饱和影响的锆钛酸铅系压电陶瓷(PZT)的本构模型,以局部J积分作为断裂准则,应用再生核点法这一无网格数值法导出了作用电场与断裂载荷的关系曲线,该曲线的趋势与Park[1]的实验观察现象一致。计算程序采用面向对象方法实现。     

Boundedness of commutators on homogeneous Herz spaces

The boundedness on homogeneous Herz spaces is established for a large class of linear commutators generated by BMO(R ⁿ ) functions and linear operators of rough kernels which include the Calderón-Zygmund operators and the Ricci-Stein oRfiUatory singular integrals with rough kernels. Project supponed in pan by the National h’atural Science Foundation of China (Grant No. 19131080) and the NEDF of China.     

Integral Kernel Operators on Fock Space – Generalizations and Applications to Quantum Dynamics

A general theory of operators on Boson Fock space is discussed in terms of the white noise distribution theory on Gaussian space (white noise calculus). An integral kernel operator is generalized from two aspects: (i) The use of an operator-valued distribution as an integral kernel leads us to the Fubini type theorem which allows an iterated integration in an integral kernel operator. As an application a white noise approach to quantum stochastic integrals is discussed and a quantum Hitsuda–Skorokhod integral is introduced. (ii) The use of pointwise derivatives of annihilation and creation operators assures the partial integration in an integral kernel operator. In particular, the particle flux density becomes a distribution with values in continuous operators on white noise functions and yields a representation of a Lie algebra of vector fields by means of such operators.     

A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.