Spectral Exterior Calculus

A spectral approach to building the exterior calculus in manifold learning problems is developed. The spectral approach is shown to converge to the true exterior calculus in the limit of large data. Simultaneously, the spectral approach decouples the memory requirements from the amount of data points and ambient space dimension. To achieve this, the exterior calculus is reformulated entirely in terms of the eigenvalues and eigenfunctions of the Laplacian operator on functions. The exterior derivatives of these eigenfunctions (and their wedge products) are shown to form a frame (a type of spanning set) for appropriate L² spaces of k -forms, as well as higher-order Sobolev spaces. Formulas are derived to express the Laplace-de Rham operators on forms in terms of the eigenfunctions and eigenvalues of the Laplacian on functions. By representing the Laplace-de Rham operators in this frame, spectral convergence results are obtained via Galerkin approximation techniques. Numerical examples demonstrate accurate recovery of eigenvalues and eigenforms of the Laplace-de Rham operator on 1-forms. The correct Betti numbers are obtained from the kernel of this operator approximated from data sampled on several orientable and non-orientable manifolds, and the eigenforms are visualized via their corresponding vector fields. These vector fields form a natural orthonormal basis for the space of square-integrable vector fields, and are ordered by a Dirichlet energy functional which measures oscillatory behavior. The spectral framework also shows promising results on a non-smooth example (the Lorenz 63 attractor), suggesting that a spectral formulation of exterior calculus may be feasible in spaces with no differentiable structure. © 2020 Wiley Periodicals, Inc.     

Kβ X-Ray Emission Spectroscopic Study of a Second-Row Transition Metal (Mo) and Its Application to Nitrogenase-Related Model Complexes

In recent years, X-ray emission spectroscopy (XES) in the Kβ (3p-1s) and valence-to-core (valence-1s) regions has been increasingly used to study metal active sites in (bio)inorganic chemistry and catalysis, providing information about the metal spin state, oxidation state and the identity of coordinated ligands. However, to date this technique has been limited almost exclusively to first-row transition metals. In this work, we present an extension of Kβ XES (in both the 4p-1s and valence-to-1s [or VtC] regions) to the second transition row by performing a detailed experimental and theoretical analysis of the molybdenum emission lines. It is demonstrated in this work that Kβ₂ lines are dominated by spin state effects, while VtC XES of a 4d transition metal provides access to metal oxidation state and ligand identity. An extension of Mo Kβ XES to nitrogenase-relevant model complexes shows that the method is sufficiently sensitive to act as a spectator probe for redox events that are localized at the Fe atoms. Mo VtC XES thus has promise for future applications to nitrogenase, as well as a range of other Mo-containing biological cofactors. Further, the clear assignment of the origins of Mo VtC XES features opens up the possibility of applying this method to a wide range of second-row transition metals, thus providing chemists with a site-specific tool for the elucidation of 4d transition metal electronic structure.     

A High Cell‐Bearing Capacity Multibore Hollow Fiber Device for Macroencapsulation of Islets of Langerhans

Macroencapsulation of islets of Langerhans is a promising strategy for transplantation of insulin‐producing cells in the absence of immunosuppression to treat type 1 diabetes. Hollow fiber membranes are of interest there because they offer a large surface‐to‐volume ratio and can potentially be retrieved or refilled. However, current available fibers have limitations in exchange of nutrients, oxygen, and delivery of insulin potentially impacting graft survival. Here, multibore hollow fibers for islets encapsulation are designed and tested. They consist of seven bores and are prepared using nondegradable polymers with high mechanical stability and low cell adhesion properties. Human islets encapsulated there have a glucose induced insulin response (GIIS) similar to nonencapsulated islets. During 7 d of cell culture in vitro, the GIIS increases with graded doses of islets demonstrating the suitability of the microenvironment for islet survival. Moreover, first implantation studies in mice demonstrate device material biocompatibility with minimal tissue responses. Besides, formation of new blood vessels close to the implanted device is observed, an important requirement for maintaining islet viability and fast exchange of glucose and insulin. The results indicate that the developed fibers have high islet bearing capacity and can potentially be applied for a clinically applicable bioartificial pancreas.     

Local linear hazard rate estimation and bandwidth selection

A new kernel based local linear estimate of the hazard rate, under the random right censorship model is proposed in this article. We study its finite sample and asymptotic properties and prove its asymptotic normality. Then we bring in three popular methods for bandwidth selection to the hazard setting as potential bandwidth choice rules for the estimate. We discuss their practical implementation and through Monte Carlo simulations we use four distributions with different hazard rate shapes to compare their performance over various sample sizes and levels of censoring.     

Graphs with Branchwidth at Most Three

In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a minor. A set of four graphs is shown to be the obstruction set for the class of graphs with branchwidth at most three. Moreover, we give a safe and complete set of reduction rules for the graphs with branchwidth at most three. Using this set, a linear time algorithm is given that verifies if a given graph has branchwidth at most three, and, if so, outputs a minimum width branch decomposition.