Periodic antiphase boundary spinel-based structures in aluminates,gallates, aluminium oxynitrides and transition aluminas

The crystallographic structures of several transition aluminas possessing a face-centred cubic packing of oxygen anions can be considered as deriving from that of a non-stoichiometric spinel. However, they are not yet known in detail owing to the poor crystallinity of most of the samples studied by X-ray or electron diffraction. Conversely, relatively large crystals have been produced in the case of non-stoichiometric spinels in the alumina-rich (or Ga₂O₃-rich) parts of the Al₂O₃–AlN, Al₂O₃–MgO, Al₂O₃–NiO, Al₂O₃–Li₂O and Ga₂O₃–MgO systems. Detailed studies of their diffraction patterns have shown that all these phases possess periodic antiphase boundary (PAPB) structures based on the spinel structure. In the case of the so-called δ-transition aluminas, various structural models have been previously proposed and in this paper we are focusing on the striking similarities between their diffraction patterns and those of several metastable PAPB aluminate structures. This makes it possible to show that at least three distinct PAPB structures must be taken into account in the case of δ-transition aluminas. APB planes are either {100} or {110} whereas APB vectors are either 1/2??001? or 1/4??110? when referring to the spinel structure. Neighbouring octahedral and tetrahedral incompatible sites are observed in the vicinity of each APB and cation vacancies are shown to occupy these octahedral sites.     

The entropies of renewal systems

Renewal systems are symbolic dynamical systems originally introduced by Adler. IfW is a finite set of words over a finite alphabetA, then the renewal system generated byW is the subshiftX _W ⊂A ^Z formed by bi-infinite concatenations of words fromW. Motivated by Adler’s question of whether every irreducible shift of finite type is conjugate to a renewal system, we prove that for every shift of finite type there is a renewal system having the same entropy. We also show that every shift of finite type can be approximated from above by renewal systems, and that by placing finite-type constraints on possible concatenations, we obtain all sofic systems. The authors were supported in part by NFS grants DMS-8706284, DMS-8814159 and DMS-8820716.     

A comparison of two methods for estimating DCE-MRI parameters via individual and cohort based AIFs in prostate cancer: A step towards practical implementation

Multi-parametric Magnetic Resonance Imaging, and specifically Dynamic Contrast Enhanced (DCE) MRI, play increasingly important roles in detection and staging of prostate cancer (PCa). One of the actively investigated approaches to DCE MRI analysis involves pharmacokinetic (PK) modeling to extract quantitative parameters that may be related to microvascular properties of the tissue. It is well-known that the prescribed arterial blood plasma concentration (or Arterial Input Function, AIF) input can have significant effects on the parameters estimated by PK modeling. The purpose of our study was to investigate such effects in DCE MRI data acquired in a typical clinical PCa setting. First, we investigated how the choice of a semi-automated or fully automated image-based individualized AIF (iAIF) estimation method affects the PK parameter values; and second, we examined the use of method-specific averaged AIF (cohort-based, or cAIF) as a means to attenuate the differences between the two AIF estimation methods.     

Non-Convex Global Minimization and False Discovery Rate Control for the TREX

The TREX is a recently introduced method for performing sparse high-dimensional regression. Despite its statistical promise as an alternative to the lasso, square-root lasso, and scaled lasso, the TREX is computationally challenging in that it requires solving a nonconvex optimization problem. This article shows a remarkable result: despite the nonconvexity of the TREX problem, there exists a polynomial-time algorithm that is guaranteed to find the global minimum. This result adds the TREX to a very short list of nonconvex optimization problems that can be globally optimized (principal components analysis being a famous example). After deriving and developing this new approach, we demonstrate that (i) the ability of the preexisting TREX heuristic to reach the global minimum is strongly dependent on the difficulty of the underlying statistical problem, (ii) the new polynomial-time algorithm for TREX permits a novel variable ranking and selection scheme, (iii) this scheme can be incorporated into a rule that controls the false discovery rate (FDR) of included features in the model. To achieve this last aim, we provide an extension of the results of Barber and Candes to establish that the knockoff filter framework can be applied to the TREX. This investigation thus provides both a rare case study of a heuristic for nonconvex optimization and a novel way of exploiting nonconvexity for statistical inference.     

Two remarks on the Burr–Erdős conjecture

The Ramsey number r(H) of a graph H is the minimum positive integer N such that every two-coloring of the edges of the complete graph K_N on N vertices contains a monochromatic copy of H. A graph H is d-degenerate if every subgraph of H has minimum degree at most d. Burr and Erdős in 1975 conjectured that for each positive integer d there is a constant c_d such that r(H)≤c_dn for every d-degenerate graph H on n vertices. We show that for such graphs , improving on an earlier bound of Kostochka and Sudakov. We also study Ramsey numbers of random graphs, showing that for d fixed, almost surely the random graph G(n,d/n) has Ramsey number linear in n. For random bipartite graphs, our proof gives nearly tight bounds.     

Spectrum and analyticity of semigroups arising in elasticity theory and hydromechanics

Cauchy problems for a second order linear differential operator equation

On the Krein and Friedrichs extensions of a positive Jacobi operator

We show that for a positive linear operator acting in ℓ² and defined from

a_nx_n+1+b_nx_n+a_n-1x_n-1

Fabrication and characterization of a PbTe quantum dots multilayer structure

Multilayer PbTe quantum dots (QDs) and SiO₂ were grown by pulsed laser deposition (PLD) and Plasma enhanced chemical vapor deposition (PECVD) techniques. The crystalline structure, QD size and size dispersion were observed by high-resolution transmission electron microscopy (HRTEM) measurements. This technique allows one to grow PbTe QDs as small as 1.8 nm diameter and 0.6 nm size dispersion. The whole structure can be used in a Fabry–Perot cavity for an optical device operating at the mid-infrared region.     

On Rado's Boundedness Conjecture

We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We then prove the first nontrivial case of Rado's Boundedness Conjecture: if a₁,a₂, and a₃ are integers, and if for every 24-coloring of the positive integers (or even the nonzero rational numbers) there is a monochromatic solution to the equation a₁x₁+a₂x₂+a₃x₃=0, then for every finite coloring of the positive integers there is a monochromatic solution to a₁x₁+a₂x₂+a₃x₃=0.