A Bio-Conjugated Fullerene as a Subcellular-Targeted and Multifaceted Phototheranostic Agent

Fullerenes are candidates for theranostic applications because of their high photodynamic activity and intrinsic multimodal imaging contrast. However, fullerenes suffer from low solubility in aqueous media, poor biocompatibility, cell toxicity, and a tendency to aggregate. C₇₀@lysozyme is introduced herein as a novel bioconjugate that is harmless to a cellular environment, yet is also photoactive and has excellent optical and optoacoustic contrast for tracking cellular uptake and intracellular localization. The formation, water-solubility, photoactivity, and unperturbed structure of C₇₀@lysozyme are confirmed using UV-visible and 2D ¹H, ¹⁵N NMR spectroscopy. The excellent imaging contrast of C₇₀@lysozyme in optoacoustic and third harmonic generation microscopy is exploited to monitor its uptake in HeLa cells and lysosomal trafficking. Last, the photoactivity of C₇₀@lysozyme and its ability to initiate cell death by means of singlet oxygen (¹O₂) production upon exposure to low levels of white light irradiation is demonstrated. This study introduces C₇₀@lysozyme and other fullerene-protein conjugates as potential candidates for theranostic applications.     

Near‐Infrared (NIR) Organic Light‐Emitting Diodes (OLEDs): Challenges and Opportunities

The rapid development of the science and technology of organic semiconductors has already led to mass application of organic light‐emitting diodes (OLEDs) in television monitors of outstanding quality as well as in a large variety of smaller displays found in smartphones, tablets, and other gadgets, while introduction of the technology to the illumination sector is imminent. Notably, the requirements of all such applications for emission in the visible range of the electromagnetic spectrum are well tuned to the optical and electronic properties of typical organic semiconductors, thereby representing relatively “low‐hanging fruits,” in terms of material development and exploitation. However, the question arises as to whether developing materials suited for efficient near‐infrared (NIR, 700–1000 nm) emission is possible, and, crucially, desirable to enable new classes of applications spanning from through‐space, short‐range communications to biomedical sensors, night vision, and more generally security applications to name but a few. Here, the major fundamental hurdles to be overcome to achieve efficient NIR emission from organic π‐conjugated systems are discussed, recent progress is reviewed, and an outlook for further development of both materials and applications is provided.     

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.     

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.