Neuromorphometric characterization with shape functionals

This work presents a procedure to extract morphological information from neuronal cells based on the variation of shape functionals as the cell geometry undergoes a dilation through a wide interval of spatial scales. The targeted shapes are alpha and beta cat retinal ganglion cells, which are characterized by different ranges of dendritic field diameter. Image functionals are expected to act as descriptors of the shape, gathering relevant geometric and topological features of the complex cell form. We present a comparative study of classification performance of additive shape descriptors, namely, Minkowski functionals, and the nonadditive multiscale fractal. We found that the proposed measures perform efficiently the task of identifying the two main classes alpha and beta based solely on scale invariant information, while also providing intraclass morphological assessment

First-principles kinetic modeling in heterogeneous catalysis: an industrial perspective on best-practice, gaps and needs

Electronic structure calculations have emerged as a key contributor in modern heterogeneous catalysis research, though their application in chemical reaction engineering remains largely limited to academia. This perspective aims at encouraging the judicious use of first-principles kinetic models in industrial settings based on a critical discussion of present-day best practices, identifying existing gaps, and defining where further progress is needed

Exhaustible sets in higher-type computation

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which the predicate holds or else tells there is no example. The Cantor space of infinite sequences of binary digits is known to be searchable. Searchable sets are exhaustible, and we show that the converse also holds for sets of hereditarily total elements in the hierarchy of continuous functionals; moreover, a selection functional can be constructed uniformly from a quantification functional. We prove that searchable sets are closed under intersections with decidable sets, and under the formation of computable images and of finite and countably infinite products. This is related to the fact, established here, that exhaustible sets are topologically compact. We obtain a complete description of exhaustible total sets by developing a computational version of a topological Arzela--Ascoli type characterization of compact subsets of function spaces. We also show that, in the non-empty case, they are precisely the computable images of the Cantor space. The emphasis of this paper is on the theory of exhaustible and searchable sets, but we also briefly sketch applications