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.     

Fabrication of Microporous Metal–Organic Frameworks in Uninterrupted Mesoporous Tunnels: Hierarchical Structure for Efficient Trypsin Immobilization and Stabilization

Hierarchically porous metal–organic frameworks (HP-MOFs) are promising in various applications. Most reported HP-MOFs are prepared based on the generation of mesopores in microporous frameworks, and the formed mesopores are connected by microporous channels, limiting the accessibility of mesopores for bulky molecules. A hierarchical structure is formed by constructing microporous MOFs in uninterrupted mesoporous tunnels. Using the confined space in as-prepared mesoporous silica, highly dispersed metal precursors for MOFs are coated on the internal surface of mesoporous tunnels. Ligand vapor-induced crystallization is employed to enable quantitative formation of MOFs in situ, in which sublimated ligands diffuse into mesoporous tunnels and react with metal precursors. The obtained hierarchically porous composites exhibit record-high adsorption capacity for the bulky molecule trypsin. The thermal and storage stability of trypsin is improved upon immobilization on the composites.     

Conversion of Methanol to Aromatic-Rich Gasoline over High-Efficiency Bifunctional Catalysts: Green Synthesis of GaZSM-5 Zeolites via Dry-Gel Conversion Strategy

Russian Journal of Applied Chemistry - Nanoscale ZSM-5 (AlZ5-D) and Ga-substituted ZSM-5 zeolites ((Al,Ga)Z5-D and GaZ5-D) were synthesized by a green dry-gel conversion strategy. For comparison,...     

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.     

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.