中小学生数字阅读推广的困境与突破

文章通过面向中小学生的问卷调查和学校管理者的访谈,调研广州中小学生数字阅读现状。中小学生数字阅读接触率较高,但保障和支持体系薄弱。学校管理者普遍对学生数字阅读充满疑虑,态度消极;学校图书馆也存在数字设备不足、数字资源匮乏、网络限制等问题,造成中小学生数字阅读推广的困境。学校应因势利导,寻求合理保障和引导数字阅读的路径。     

一矩阵方程组的反射解

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)     

基于随机游走增强型矩阵分解的混合服务预测

随着Web服务数量的急剧增长,如何在大量功能相似但非功能属性各异的服务中选择满足用户个性化需求的服务是亟需解决的问题。基于QoS（Quality of Service）预测的服务推荐方法成为研究热点。然而, QoS数据的稀疏性和“冷启动”问题阻碍其发展。针对当前主流的QoS预测模型预测精度不高和收敛速度较慢等问题,提出一种基于随机游走模型和矩阵分解技术的混合QoS预测方法。该方法首先基于矩阵分解获得用户及服务的潜因子矩阵,并将用户潜因子矩阵转化为用户相似度矩阵;然后基于用户相似度矩阵并结合Web服务的网络位置信息,使用随机游走模型提高用户相似度矩阵的准确性;最终结合协同过滤方法与矩阵分解模型进行QoS预测。在真实数据集上实验,结果表明,与当前主流的QoS预测方法相比,该方法具有更高的预测精度和效率。     

约束条件下的广义最小二乘估计

本文仿造约束最小二乘估计和广义最小二乘估计的推导方法．给出约束条件下的广义最小二乘估计。     

非奇异H-矩阵判定的充分条件

通过比较矩阵元素,得到了一组H-矩阵的充要条件,进一步拓展了H-矩阵的判定准则.     

一类特殊矩阵特征值的绝对扰动上界

利用矩阵的奇异值分解和矩阵的计算技巧研究了Hermite矩阵特征值的扰动界,得到了Hermite矩阵特征值的绝对扰动上界,对以往的结果进行了改进,并推广了Wielandt-Hoffman定理。     

匈牙利算法的注记

分析在指派问题的教学中所遇到的问题,在剖析匈牙利算法的基础上,提出了改进的算法,并通过2个例子进行介绍。     

一类广义Vandermonde矩阵的相关性质

Vandermonde矩阵是矩阵理论中一个重要的矩阵类型,它的许多广义形式在处理矩阵问题时能起到关键的作用。就一类广义Vandermonde矩阵的行列式及求逆问题作初步探讨。