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.     

Boron(iii) β-diketonate-based small molecules for functional non-fullerene polymer solar cells and organic resistive memory devices

A class of acceptor–donor–acceptor chromophoric small-molecule non-fullerene acceptors, 1–4, with difluoroboron(iii) β-diketonate (BF₂bdk) as the electron-accepting moiety has been developed. Through the variation of the central donor unit and the modification on the peripheral substituents of the terminal BF₂bdk acceptor unit, their photophysical and electrochemical properties have been systematically studied. Taking advantage of their low-lying lowest unoccupied molecular orbital energy levels (from −3.65 to −3.72 eV) and relatively high electron mobility (7.49 × 10⁻⁴ cm² V⁻¹ s⁻¹), these BF₂bdk-based compounds have been employed as non-fullerene acceptors in organic solar cells with maximum power conversion efficiencies of up to 4.31%. Moreover, bistable resistive memory characteristics with charge-trapping mechanisms have been demonstrated in these BF₂bdk-based compounds. This work not only demonstrates for the first time the use of a boron(iii) β-diketonate unit in constructing non-fullerene acceptors, but also provides more insights into designing organic materials with multi-functional properties.

Boron(iii) β-diketonates have been demonstrated to serve as multi-functional materials in NFA-based OPVs and organic resistive memories.     

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.