Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.     

Concurrent multiresponse non-linear screening: Robust profiling of webpage performance

Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L₉(3⁴) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded.     

Graph-based video fingerprinting using double optimal projection

A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination.     

A Least Squares Approach to Escalator Algorithms for Adaptive Filtering

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.     

具有控制项的限定记忆卡尔曼滤波器

在已有的限定记忆卡尔曼滤波器的基础上 ,将确定性先验信息作为控制项加以应用 ,推导出了完整的限定记忆卡尔曼滤波公式 ,从而在记忆长度确定的情况下 ,有效地减小了模型不准的误差 ,降低了滤波总误差。仿真同样表明了该方法的有效性     

基于系统矩阵有序实Schur分解的模型降阶

对复杂高阶系统进行模型简化，为研究与设计系统提供了方便的条件。对系统模型的降阶是控制系统设计与仿真工作者的一个重要研究课题，对高阶复杂系统的分析、设计、仿真等具有重要的理论意义和工程实用价值。针对目前比较成熟的基于系统矩阵的有序实Schur分解方法，提出了采用时矩输出拟合来改善降阶系统输出响应逼近程度的改进方法，从而使简化模型具有输出误差更小、计算简便等优点，通过给出的实例仿真证实了这一点。     

单片LCoS光学引擎中彩色LED照明系统设计

LCoS光学引擎作为整个背投的一个要组成部分，其照明系统显著地影响着LCoS背投的性能。详细分析了影响照明效果的各个因素，并利用ZEMAX软件设计出了单片LCoS光学引擎中基于彩色LED光源的照明系统，该系统能达到较好的亮度和均匀性，满足整个光机系统的成像要求。