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.     

Design and investigation of UV image detectors

The results of investigation of optical image detectors designed for the largest problem, near-VUV, range of the spectrum are presented. The possibility of using a dual-stage image detection system to appreciably lower the sensitivity threshold and make computer data processing feasible is considered. The integration of a UV module into a wideband image detector is studied.     

Close‐Packed Two‐Dimensional Silver Nanoparticle Arrays: Quadrupolar and Dipolar Surface Plasmon Resonance Coupling

Silver nanoparticles (NPs) ranging in size from 40 to 100 nm were prepared in high yield by using an improved seed‐mediated method. The homogeneous Ag NPs were used as building blocks for 2D assembled Ag NP arrays by using an oil/water interface. A close‐packed 2D array of Ag NPs was fabricated by using packing molecules (3‐mercaptopropyltrimethoxysilane) to control the interparticle spacing. The homogeneous 2D Ag NP array exhibited a strong quadrupolar cooperative plasmon mode resonance and a dipolar red‐shift relative to individual Ag NPs suspended in solution. A well‐arranged 2D Ag NP array was embedded in polydimethylsiloxane film and, with biaxial stretching to control the interparticle distance, concomitant variations of the quadrupolar and dipolar couplings were observed. As the interparticle distance increased, the intensity of the quadrupolar cooperative plasmon mode resonance decreased and dipolar coupling completely disappeared. The local electric field of the 2D Ag NP array was calculated by using finite difference time domain simulation and qualitatively showed agreement with the experimental measurements.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.