大华matrix 120

matrix 120是国内品牌第一次采用TI DM320方案的。视频上，matrix 120支持MPEG1／2／4、DIVX4／5、XVID等视频编码格式，并支持SUB字幕显示。音频上，matrix 120支持MPEG1／2、LAYER1／2／3、WMA、PCM等音频编码格式，并且支持电视录制／输出功能。     

A data locality methodology for matrix–matrix multiplication algorithm

Matrix-Matrix Multiplication (MMM) is a highly important kernel in linear algebra algorithms and the performance of its implementations depends on the memory utilization and data locality. There are MMM algorithms, such as standard, Strassen–Winograd variant, and many recursive array layouts, such as Z-Morton or U-Morton. However, their data locality is lower than that of the proposed methodology. Moreover, several SOA (state of the art) self-tuning libraries exist, such as ATLAS for MMM algorithm, which tests many MMM implementations. During the installation of ATLAS, on the one hand an extremely complex empirical tuning step is required, and on the other hand a large number of compiler options are used, both of which are not included in the scope of this paper. In this paper, a new methodology using the standard MMM algorithm is presented, achieving improved performance by focusing on data locality (both temporal and spatial). This methodology finds the scheduling which conforms with the optimum memory management. Compared with (Chatterjee et al. in IEEE Trans. Parallel Distrib. Syst. 13:1105, 2002; Li and Garzaran in Proc. of Lang. Compil. Parallel Comput., 2005; Bilmes et al. in Proc. of the 11th ACM Int. Conf. Super-comput., 1997; Aberdeen and Baxter in Concurr. Comput. Pract. Exp. 13:103, 2001), the proposed methodology has two major advantages. Firstly, the scheduling used for the tile level is different from the element level’s one, having better data locality, suited to the sizes of memory hierarchy. Secondly, its exploration time is short, because it searches only for the number of the level of tiling used, and between (1, 2) (Sect. 4) for finding the best tile size for each cache level. A software tool (C-code) implementing the above methodology was developed, having the hardware model and the matrix sizes as input. This methodology has better performance against others at a wide range of architectures. Compared with the best existing related work, which we implemented, better performance up to 55% than the Standard MMM algorithm and up to 35% than Strassen’s is observed, both under recursive data array layouts.     

Structural controllability and matrix nets†

We establish structural controllability results for matrix pairs [A, B] where A = A ₀ + Σ μ _iA_i , B = B ₀ + σ μ _i, B_i , with the A_i , B_i , fixed, and the μ _i , free scalar parameters. The results characterize structural controllability in several ways, via tests involving the checking of the rank or the evaluation of the determinant of various constant matrices formed from the A_i , B_i . A number of the results used as intermediate results tests for a full rank property of matrix nets, i.e. tests that check if M = M₀+ Σμ_iM_i prescribed, μ _i variable, has full rank for almost all μ _i .     

Spectral clustering based on matrix perturbation theory

This paper exposes some intrinsic characteristics of the spectral clustering method by using the tools from the matrix perturbation theory. We construct a weight ma- trix of a graph and study its eigenvalues and eigenvectors. It shows that the num- ber of clusters is equal to the number of eigenvalues that are larger than 1, and the number of points in each of the clusters can be approximated by the associated eigenvalue. It also shows that the eigenvector of the weight matrix can be used directly to perform clustering; that is, the directional angle between the two-row vectors of the matrix derived from the eigenvectors is a suitable distance measure for clustering. As a result, an unsupervised spectral clustering algorithm based on weight matrix (USCAWM) is developed. The experimental results on a number of artificial and real-world data sets show the correctness of the theoretical analysis.     

Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem一个基于矩阵分解的非对称密码协议的分析

Advances in quantum computation threaten to break public key cryptosystems such as RSA, ECC, and ElGamal that are based on the difficulty of factorization or taking a discrete logarithm, although up to now, no quantum algorithms have been found that are able to solve certain mathematical problems on noncommutative algebraic structures. Against this background, Raulynaitis et al. have proposed a novel asymmetric cipher protocol using a matrix decomposition problem. Their proposed scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we show that the asymmetric cipher of the non-commutative cryptography scheme is vulnerable to a linear algebra attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. We also propose an improvement to enhance the scheme of Raulynaitis et al.     

Brown�CRobinson method for interval matrix games

In this paper, two-person interval matrix games are considered, and by means of acceptability index, Brown–Robinson method to find a mixed-strategy equilibrium is adapted to interval matrix games. Numerical examples are also given.     

翻译矩阵

S_n=U 2 规范分析是这样一种分析,即对句子是精确地从左到右处理,且在进一步向右处理之前尽可能地简化句子的最左部分。也就是说,S_0简化成U的分析Φ_1,Φ_2,…,Φ_n是规范的,当且仅当对所有k>j(j=1,2,…,n),u_k不被包含在x_j中。     

矩阵存储技术

对于新一代芯片组而言，支持串行ATA RAID功能并没有什么出奇，无论Intel平台还是AMD平台，串行ATA RAID都被认为是必备磁盘功能，当然，i915/925开发一种新颖的磁盘阵列模式；Matrix Storage,或者说“矩阵存储”。     

矩阵革命

“都是刷夜的吧?准备好钱啊!”随着网管一声吆喝，网吧门口的卷帘门开始缓缓放下，并最终将这里与外界隔离开来……     

矩阵重心坐标

在二维重心坐标——复数重心坐标的基础上引入二维矩阵重心坐标的概念,并利用球面坐标将二维矩阵重心坐标推广到三维.三维矩阵重心坐标适用于三角控制网格、四边形控制网格甚至一般的混合控制网格.对所提出的重心坐标性质进行了研究,发现其满足大部分好的重心坐标所应具有的性质.最后对矩阵重心坐标在三维网格模型中的应用进行了细致的实验,分析了它的优缺点.     

矩阵校验

改进交叉校验，增设校验位的校验，形成偶校验矩阵，校验能力大大增强，具有一定的纠错能力，算法简单，效率较高。     

粗信息矩阵与其粒度矩阵特征

提出了粗信息矩阵、信息粒度矩阵、粗粒度矩阵的概念,给出了粗信息矩阵的结构及粒度特征;讨论了粗信息矩阵、粗粒度矩阵的性质及运算法则。给出粗信息矩阵与粗集、S-粗集的关系定理、粗信息矩阵与其粗粒度矩阵的关系定理,粗信息矩阵不仅是研究粗系统结构特征的新理论工具,而且是粗系统理论研究与应用研究又一个新的研究方向。     

矩阵趋势

矩阵型的组织架构和渠道组织,让趋势这样的企业能够更好地应对发展瓶颈。     

A note on combined generalized Sylvester matrix equations

The solution of two combined generalized Sylvester matrix equations is studied. It is first shown that the two combined generalized Sylvester matrix equations can be converted into a normal Sylvester matrix equation through extension, and then with the help of a result for solution to normal Sylvester matrix equations, the complete solution to the two combined generalized Sylvester matrix equations is derived. A demonstrative example shows the effect of the proposed approach.     

求Sylvester矩阵逆矩阵的快速算法

本文利用m+n阶Sylvester矩阵的位移结构并在假设该矩阵的所有顺序主子矩阵可逆的条件下给出了求解Sylvester矩阵的逆的一种快速算法.该算法所需计算量为O(m+n)~2,而高斯-约当消去法所需计算量为O(m+n)~3.最后通过数值算例说明了算法的有效性.     

基于矩阵张量积的数据加密矩阵的构造

通过讨论二阶矩阵的可逆性,研究了基于矩阵张量积合成加密矩阵的构造问题,并用实例进行了加密实践。     

基于Skowron差别矩阵属性约简的矩阵表示

针对目前基于Skowron差别矩阵的属性约简中缺少矩阵表示的问题,定义一种新的矩阵,并给出基于新矩阵的属性约简定义,证明该定义与基于Skowron差别矩阵的属性约简等价。以矩阵为基础,定义属性的重要性,设计一个基于Skowron差别矩阵的属性约简算法,实例证明了算法的有效性。