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.     

Generic entangling through quantum indistinguishability

We present a general scheme for entangling any degree of freedom of two uncorrelated identical particles from independent sources by a combination of two-particle interferometry and which-way detection. We show that this entanglement generation procedure works for completely random initial states of the variable to be entangled. We also demonstrate a curious complementarity exhibited by our scheme and its applications in estimating the generated entanglement as a function of wave packet overlap at the beamsplitter.     

用不确定度评价测量结果中的有效自由度的作用

论述了有效自由度的计算方法及有效自由度量值在分析测量结果中的应用。     

区间中立型大系统的强壮稳定性

本文讨论中立型大系统,获得了这类问题稳定性的一些充分判据,作为特殊情况,还得到了与[1-11]中相应的一些不同的结果.这些结果并不象文献[1]和[2]那样,要求a_(ii)的上界q_(ii)小于零.     

A priori tests of a stochastic mode reduction strategy

Several a priori tests of a systematic stochastic mode reduction procedure recently devised by the authors [Proc. Natl. Acad. Sci. 96 (1999) 14687; Commun. Pure Appl. Math. 54 (2001) 891] are developed here. In this procedure, reduced stochastic equations for a smaller collections of resolved variables are derived systematically for complex nonlinear systems with many degrees of freedom and a large collection of unresolved variables. While the above approach is mathematically rigorous in the limit when the ratio of correlation times between the resolved and the unresolved variables is arbitrary small, it is shown here on a systematic hierarchy of models that this ratio can be surprisingly big. Typically, the systematic reduced stochastic modeling yields quantitatively realistic dynamics for ratios as large as 1/2. The examples studied here vary from instructive stochastic triad models to prototype complex systems with many degrees of freedom utilizing the truncated Burgers–Hopf equations as a nonlinear heat bath. Systematic quantitative tests for the stochastic modeling procedure are developed here which involve the stationary distribution and the two-time correlations for the second and fourth moments including the resolved variables and the energy in the resolved variables. In an important illustrative example presented here, the nonlinear original system involves 102 degrees of freedom and the reduced stochastic model predicted by the theory for two resolved variables involves both nonlinear interaction and multiplicative noises. Even for large value of the correlation time ratio of the order of 1/2, the reduced stochastic model with two degrees of freedom captures the essentially nonlinear and non-Gaussian statistics of the original nonlinear systems with 102 modes extremely well. Furthermore, it is shown here that the standard regression fitting of the second-order correlations alone fails to reproduce the nonlinear stochastic dynamics in this example.     

粒子-转子模型和推转壳模型中的能谱统计分析

用粒子–转子模型和推转壳模型研究了6个粒子分别填充在单j壳和双j壳上的混沌行为.分析了单j壳和双j壳情况下能谱的最近邻能级间距分布和谱刚度随自旋及推转频率的变化,结果表明,当组态空间大小不变时,系统在双j壳(g_7/2+d_5/2)情况下比在单j壳(i_13/2)情况下更规则,而当组态空间从单j壳(i_13/2)扩大到双j壳(i_13/2+g_9/2)时,系统的混沌程度变化不大.同时比较了将6个粒子的两体相互作用分别取为δ力和对力时的系统的混沌行为     

An Algebraic Method for the Exact Solution of the Partition Function of the Canonical Ensemble in Nuclear Multifragmentation

We propose a unified method for deducing recursive relations for the canonical partition function of a system of noninteracting particles with charge conservation if the particles follow the Bose–Einstein, Fermi–Dirac, or Maxwell–Boltzmann statistics or parastatistics. For all these types of statistics, we find recursive relations for the partition function of a new statistical model of nuclear multifragmentation with electric charge and baryon number conservation, accounting for the internal degrees of freedom of the nuclear fragments.     

Nonextensive Statistical Mechanics Application to Vibrational Dynamics of Protein Folding

The vibrational dynamics of protein folding is analyzed in the framework of Tsallis statistics. We employ exact expressions for classical harmonic oscillators by considering the unnormalized constraints. As q→1, we show that these approximations agree with the result of Gaussian network model.     

Probability Inequalities and Limit Theorems for Generalized L-Statistics

We obtain exponential upper bounds for tails of distributions of generalized L-statistics based on a sample from an exponential distribution. We prove the asymptotic normality of generalized L-statistics based on a sample from the uniform distribution on [0,1] and of L-statistics with decomposed kernels (without any restrictions on the sample distribution type).     

Multiple Window and Cluster Size Scan Procedures

Researchers apply scan statistics to test for unusually large clusters of events within a time window of specified length w, or alternatively an unusually small window w that contains a specified number of events. In some cases, the researcher is interested in testing for a range of specified window lengths, or a set of several specified number of events k (cluster sizes). In this paper, we derive accurate approximations for the joint distributions of scan statistics for a range of values of w, or of k, that can be used to set an experiment-wide level of significance that takes into account the multiple comparisons involved. We use these methods to compare different ways of choosing the window sizes for the different cluster sizes. One special case is a multiple comparison procedure based on a generalized likelihood ratio test (GLRT) for a range of window sizes. We compare the power of the GLRT with another method for allocating the window sizes. We find that the GLRT is sensitive for very small window sizes at the expense of moderate and larger window sizes. We illustrate these results on two examples, one involving clustering of translocation breakpoints in DNA, and the other involving disease clusters.