Fracture behavior and mechanical,thermal, and rheological properties of biodegradable films extruded by flat die and calender

The development of biodegradable materials for tailored applications, particularly in the field of polymeric films and sheets, is a challenging technological goal as well as a contribution to help protect the environment. Poly(lactic) acid (PLA) is a promising substitute for several oil-based polymers; however, to overcome its thermal and mechanical drawbacks, researchers have developed solutions such as blending PLA with polybutylene adipate terephthalate (PBAT), which is capable of increasing the ductility of the final material. In this study, PLA/PBAT binary blends, with minimum possible content of nonrenewable materials, were examined from processing, thermal, morphological, and rheological perspective. An optimized PLA/PBAT ratio was chosen as the polymeric basis to obtain a biodegradable formulation by adding a biobased plasticizer and appropriate fillers to produce a micrometer film with tailored flexibility and tear resistance. The processing technology involved flat-die extrusion, followed by calendering. The tearing resistance of the produced film was investigated, and the results were compared with literature data. A study on the essential work of fracture was implemented to explore the mode III out-of-plane fracture resistance starting from a trouser tear test.     

The Landscape of the Spiked Tensor Model

We consider the problem of estimating a large rank-one tensor u ^⊗k ∈ (ℝⁿ)^⊗k , k ≥ 3 , in Gaussian noise. Earlier work characterized a critical signal-to-noise ratio λ  _Bayes = O(1) above which an ideal estimator achieves strictly positive correlation with the unknown vector of interest. Remarkably, no polynomial-time algorithm is known that achieved this goal unless λ ≥ Cn^{(k − 2)/4} , and even powerful semidefinite programming relaxations appear to fail for 1 ≪ λ ≪ n^{(k − 2)/4} . In order to elucidate this behavior, we consider the maximum likelihood estimator, which requires maximizing a degree-k homogeneous polynomial over the unit sphere in n dimensions. We compute the expected number of critical points and local maxima of this objective function and show that it is exponential in the dimensions n , and give exact formulas for the exponential growth rate. We show that (for λ larger than a constant) critical points are either very close to the unknown vector u or are confined in a band of width Θ(λ^{−1/(k − 1)}) around the maximum circle that is orthogonal to u . For local maxima, this band shrinks to be of size Θ(λ^{−1/(k − 2)}) . These “uninformative” local maxima are likely to cause the failure of optimization algorithms. © 2019 Wiley Periodicals, Inc.     

Validated Stability-Indicating Method for Alendronate Sodium Employing Zwitterionic Hydrophilic Interaction Chromatography Coupled with Charged Aerosol Detection

Alendronate sodium is widely used in the treatment of osteoporosis and Paget’s disease. The HPLC method development for alendronate sodium, in particular, is challenging owing to the absence of chromophoric group and its high polarity. In the present study, a short and simple isocratic method was developed involving hydrophilic interaction liquid chromatography, coupled with a charged aerosol detector. The developed method was validated according to the ICH Q2(R1) guideline and was successfully applied for the analysis of a marketed formulation containing the drug.

     

Activation of peroxyl and molecular oxygen using bis -benzimidazole diamide copper (II) compounds

New tetradentatebis-benzimidazole ligands have been synthesized and utilized to prepare copper (II) complexes. Some of these copper (II) complexes have been characterized structurally. The copper (II) in these complexes is found to possess varying geometries. A distorted octahedral geometry is found with a highly unsymmetrical bidentate nitrate group. An unusual polymeric one-dimensional structure is observed where copper (II) is in a distorted square pyramidal geometry with a monodentate nitrate ion, having long Cu-O bond, while a distorted triagonal bipyramidal geometry is found with two carbonyl O atoms and a Cl atom in the equatorial plane, and two benzimidazole imine N atoms occupy the axial position. These compounds are found to activate the cumylperoxyl group, and this has been utilized in the facile oxidation of aromatic alcohols to aldehydes, where they act as catalysts with large turnovers. The yields of the respective products vary from 32 to 65%. The role of molecular oxygen has been studied and an attempt has been made to identify the “active copper species”. Activation of molecular oxygen has also been observed and has been used for oxidative dealkylation of a hindered phenol, producing di-butyl quinones with yields of 20–25% and 10–12 fold catalytic turnover. Dihydroxybenzenes and substituted catechols are also readily oxidized to the corresponding quinones, in oxygen-saturated solvents. Yields of 84% have been observed with 34-fold catalyst turnover, with di-t-butylcatechol. The activity of these copper (II) —bis-benzmidazolediamide compounds is reminiscent of the functioning of copper centres in galactose oxidase, tyrosinase and catechol oxidase.     

Chain spaces via Clifford algebras

In this note we show that the chain space belonging to a quadric can be embedded into the chain geometry over a Clifford algebra via a generalized stereographic projection.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.