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.     

Additive Hermitian idempotent preservers between operator algebras

Let L be an additive map between (real or complex) matrix algebras sending $n\times n$ Hermitian idempotent matrices to $m\times m$ Hermitian idempotent matrices. We show that there are nonnegative integers $p,q$ with $n(p+q)=r\le m$ and an $m\times m$ unitary matrix U such that$L(A)=U[(I_p?A)\oplus (I_q?A^t)\oplus 0_{m?r}]U^{?},\text{for any}n\times n\text{Hermitian}A\text{with rational trace}.$ We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism.     

Classification problems for shifts on modules over a principal ideal domain

In this paper we study symbolic dynamics over alphabets which are modules over a principal ideal domain, considering topological shifts which are also submodules. Our main result is the classification, up to algebraic and topological conjugacy, of the torsion-free, transitive, finite memory shifts.

     

〈I〉型三角剖分下非张量积连续小波基的构造

多维非张量积小波是近年小波研究领域中的热点问题之一 ,它们与多维张量积小波相比具有更多的优势 .关于高维张量积、非张量积小波 ,目前已有一些很好的工作 (见文[2 ] [3 ] [4 ] ) ,但关于样条小波 ,还有许多问题有待于研究 .本文针对〈I〉型三角剖分下的二维线性元空间 ,讨论其具有紧支集和对称性的半正交样条小波基 .给定 x1 x2 平面上的〈I〉型三角剖分 (图 1 ( a)所示 ) ,记 j=( j1 ,j2 ) ,| j| =j1 + j2 ,πm= { 0≤ |j|≤ mCj1j2 xj11 xj22 ,Cj1,j2 是任意实数 }为次数不超过 m的代数多项式全体 .引入剖分尺度为 1的线性元空间 V0…     

非负定阵元素的扰动和正定完备化

在保持非负定性不变的前提下,本文对矩阵每一元素容许多大的扰动作了进一步的研究, 将本文的结论和C．R．Johnson提出的部分正定阵的正定完备化进行比较,容易发现对已知的正定矩阵求扰动,本文的结论比用C．R.Johnson的正定完备化计算扰动形式上更简单,同时也给出了不同于C．R．Johnson的部分正定阵的正定完备化表示的另外一个公式,推出了这些正定完备化矩阵应具有的若干性质．     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

Multilevel preconditioners for a quadrature Galerkin solution of a biharmonic problem

Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

On the distribution singular values of Toeplitz matrices

We prove a second order formula concerning distribution of singular values of Toeplitz matrices in some cases when conditions of the H. Widom Theorem are not satisfied.