变系数一阶线性时滞微分方程的一个可积判据

首先引入广义周期函数的概念．然后给出了变系数一阶线性时滞微分方程的一个实用的可积充分判据，从而扩大了常微分方程的封闭求积范围．     

线性方程组求解及应用

文章首先介绍了用克拉默法则求解一类线性方程组(方程的个数与未知量个数相同且系数行列式不为零),由此提出对于一般的线性方程组如何求解问题.从而引出用矩阵的秩来判定线性方程组的解的结构以及用初等变换来求线性方程组的通解.最后应用线性方程组的求解问题对矩阵方程和向量组的线性相关性进行分析.     

全对称实矩阵的全正定性

本文给出了全正定矩阵的概念,讨论了全对称实矩阵是全正定矩阵的几个充分必要条件.     

多项式环上一次不定方程的矩阵解法与程序设计

利用多项式环F[x]上的欧几里德算法给出求解多项式环F[x]上的多元一次不定方程通解的矩阵解法，同时利用MATLAB数学软件给出相应的计算机求解多项式环F[x]上一次不定方程的程序，这种方法可以普遍地应用．     

Unsupervised word sense disambiguation for Korean through the acyclic weighted digraph using corpus and dictionary

Word sense disambiguation (WSD) is meant to assign the most appropriate sense to a polysemous word according to its context. We present a method for automatic WSD using only two resources: a raw text corpus and a machine-readable dictionary (MRD). The system learns the similarity matrix between word pairs from the unlabeled corpus, and it uses the vector representations of sense definitions from MRD, which are derived based on the similarity matrix. In order to disambiguate all occurrences of polysemous words in a sentence, the system separately constructs the acyclic weighted digraph (AWD) for every occurrence of polysemous words in a sentence. The AWD is structured based on consideration of the senses of context words which occur with a target word in a sentence. After building the AWD per each polysemous word, we can search the optimal path of the AWD using the Viterbi algorithm. We assign the most appropriate sense to the target word in sentences with the sense on the optimal path in the AWD. By experiments, our system shows 76.4% accuracy for the semantically ambiguous Korean words.     

一种基于AHP的企业核心能力识别新方法

对核心能力的内涵进行了新的定义；分析了现行核心能力定量识别研究存在的问题；运用了平衡记分卡的思想以及波特价值链原理来建立评价指标体系；利用层次分析法(AHP)工具并据此建立核心能力识别矩阵图，对企业核心能力进行了定量化、直观化地识别。     

非协调轴对称杂交应力元单元刚度矩阵的准确建立

给出新型三类用理性杂交模式、根据一种修正的Ｈｅｌｌｉｎｇｅｒ－Ｒｅｉｓｓｎｅｒ原理、建立高精度非协调轴对称实体旋转有限元时，其单元刚度矩阵的准确计算式。     

一矩阵方程组的反射解

We derive necessary and sufficient conditions for the existence and an expression of the （anti）reflexive solution with respect to the nontrivial generalized reflection matrix P to the system of complex matrix equations AX = B and XC = D. The explicit solutions of the approximation problem min x∈Ф ｜｜X - E｜｜F was given, where E is a given complex matrix and Ф is the set of all reflexive （or antireflexive） solutions of the system mentioned above, and ｜｜·｜｜ is the Frobenius norm. Furthermore, it was pointed that some results in a recent paper are special cases of this paper.     

Stabilization of Delayed Networks with Different Nodes

In this paper,the control of complex delayed networks with different nodes is proposed.Firstly,the stabilization of coupled networks with time delay is investigated.By constructing a Lyapunov function,a linear feedback controller design procedure for the networks is converted to the problem of solving a set of linear matrix inequalities.Then the results are extended to networks with both delayed dynamical nodes and delayed couplings.It is shown that the stabilization of complex networks is determined by the dynamics of each uncoupled node,coupling matrix and feedback gain matrix of networks.Two examples are simulated.In the first example,a network with 10 nodes consisting of Lorenz systems and systems proposed by Zhang in 2009 is given.It is found that the network states are divergent without control,and convergent under designed linear feedback controllers.In the second example,a larger network with 100 nodes consisting of delayed Chen systems and delayed Lorenz systems is given.The proposed method is also effective for large scale networks.     

上三角算子矩阵的谱扰动

本文利用算子谱的分块技巧,研究了上三角算子矩阵的谱扰动.给出了当算子A∈B(H),B∈B(K)给定时,σ(A)∪σ(B)\∩C∈B(K,H)σ(MC)的表示,这里σ(A)表示算子A的谱,MC=(AC/0B)