Journal of Polymer ScienceVolume 61, Issue 7 p. i-i COVER IMAGEFree Access Cover Image, Volume First published: 01 April 2023 https://doi.org/10.1002/pol.20230146AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text full-text accessPlease review our Terms and Conditions Use check box below share version article.I have read accept the...

Introduction: Antibiotic- associated diarrhea is a common problem in pediatric population. There is growing interest in probiotics, probiotics and synbiotics for prevention of this complication because of their worldwide availability as dietary supplements. The aim of this study was to assess the efficacy of a synbiotic mixture in prevention of antibiotic- associated diarrhea.   Materials and M...

Polymer-supported electrophilic halogenate(I) complexes 2 and 3 promote smooth addition to vinyl and allylsilanes without loss of the silyl group. In conjunction with Amberlyst A26 (OH −-form) vinyl silanes are converted into epoxysilanes.

We discuss the production of hadrons in polarized lepton nucleon interactions and in the current jet fragmentation region; using the QCD hard scattering formalism we compute the helicity density matrix of the hadron and show how its elements, when measurable, can give information on the spin structure of the nucleon and the spin dependence of the quark fragmentation process. The cases of ρ vect...

spherical polyhedron S = (V, F ;E): For a 2-connected planar graph GS = (V,ES), embedded on a sphere (or in the plane), we record the vertices as V and the regions as faces F , and rewrite the directed edges E as ordered 4-tuples e = 〈h, i; j, k〉, where the edge from vertex h to vertex i has face j on the right and face k on the left. (The reversed edge −e = 〈i, h; k, j〉 runs from i to h, with ...

We consider the maximum integral tWo-Commodity flow problem in augmented planar graphs (i.e., with both source-sink edges added) and provide an o(IVI 2 1ogIVI) algorithm for that problem. Let G = (V, E) be a graph and w : E-t Z+ a weight function. Let T C V be an even subset of the vertices of G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. Lomonosov gave a good cha...