Resistant and Susceptible BIB Designs

27 pages, 1 article*Resistant and Susceptible BIB Designs* (Hedayat, A.; John, P. W. M.) 27 page

A Comparative Study of PMETAC-Modified Mesoporous Silica and Titania Thin Films for Molecular Transport Manipulation

The manipulation and understanding of molecular transport across functionalized nanopores will take us closer to mimicking biological membranes and thus to design high-performance permselective separation systems. In this work, Surface-initiated atom transfer radical polymerization (SI-ATRP) of (2-methacryloyloxy)-ethyltrimethylammonium chloride (METAC) was performed on both mesoporous silica and mesoporous titania thin films. Pores were proven to be filled using ellipsometry and diffuse reflectance infrared Fourier transform spectroscopy (DRIFTS). Furthermore, the employed method leads to a polymer overlayer, whose thickness could be discriminated using a double-layer ellipsometry model. Cyclic voltammetry experiments reveal that the transport of electrochemically active probes is affected by the PMETAC presence, both due to the polymer overlayer and the confined charge of the pore-tethered PMETAC. A more detailed study demonstrates that ion permeability depends on the combined role of the inorganic scaffolds’ (titania and silica) surface chemistry and the steric and charge exclusion properties of the polyelectrolyte. Interestingly, highly charged negative walls with positively charged polymers may resemble zwitterionic polymer behavior in confined environments

Efficient augmented block designs for unreplicated test treatments

Augmented block designs for unreplicated test treatments are investigated under the A- and MV-criteria with respect to control versus control, test versus test and control versus test comparisons. We derive design-independent lower bounds on these criteria over a wide class of competing designs. These bounds are useful benchmarks and the resulting expressions for efficiencies enable objective assessment of any given design under the A- and MV-criteria. It is seen that the use of BIB or PBIB designs or duals thereof often leads to very high efficiencies, which compare extremely well with algorithmic constructions. Our findings also cover the case of partial replication of some test treatments. Illustrative examples, including large-scale ones, are presented

Predicting miRNA-disease associations based on multi-view information fusion

MicroRNAs (miRNAs) play an important role in various biological processes and their abnormal expression could lead to the occurrence of diseases. Exploring the potential relationships between miRNAs and diseases can contribute to the diagnosis and treatment of complex diseases. The increasing databases storing miRNA and disease information provide opportunities to develop computational methods for discovering unobserved disease-related miRNAs, but there are still some challenges in how to effectively learn and fuse information from multi-source data. In this study, we propose a multi-view information fusion based method for miRNA-disease association (MDA)prediction, named MVIFMDA. Firstly, multiple heterogeneous networks are constructed by combining the known MDAs and different similarities of miRNAs and diseases based on multi-source information. Secondly, the topology features of miRNAs and diseases are obtained by using the graph convolutional network to each heterogeneous network view, respectively. Moreover, we design the attention strategy at the topology representation level to adaptively fuse representations including different structural information. Meanwhile, we learn the attribute representations of miRNAs and diseases from their similarity attribute views with convolutional neural networks, respectively. Finally, the complicated associations between miRNAs and diseases are reconstructed by applying a bilinear decoder to the combined features, which combine topology and attribute representations. Experimental results on the public dataset demonstrate that our proposed model consistently outperforms baseline methods. The case studies further show the ability of the MVIFMDA model for inferring underlying associations between miRNAs and diseases

Partially Balanced Incomplete Block Designs from Weakly Divisible Nearrings

In [[6] Riv. Mat. Univ. Parma 11 (2) (1970) 79–96] Ferrero demonstrates a connection between a restricted class of planar nearrings and balanced incomplete block designs. In this paper, bearing in mind the links between planar nearrings and weakly divisible nearrings (wd-nearrings), first we show the construction of a family of partially balanced incomplete block designs from a special class of wd-nearrings; consequently, we are able to give some formulas for calculating the design parameters

Applications of finite geometries to designs and codes

This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures. A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples. We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs. Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes