Loveland complexity Loveland (1969) is a variant of Kolmogorov complexity, where it is asked to output separately the bits of the desired string, instead of the string itself. Similarly to the resource-bounded Kolmogorov sets we define Loveland sets. We highlight a structural connection between resource-bounded Loveland sets and some advice complexity classes. This structural connection enables...

chemoCR makes chemical information contained in depictions of chemical structures accessible as connection table for computer programs. In order to solve the problem of recognizing and translating chemical structures in image documents, our chemoCR system combines pattern recognition techniques with supervised machine learning concepts. The method is based on the idea of identifying from struct...

The electroluminescence from PPV and the blue light emission from PPP constitute exciting subjects of study. The band gap of these semiconducting polymers can be engineered in a wide range from red to ultraviolet by structural changes made on them. In the present work, we present a theoretical approach based on semiempirical and ab initio total energy and force calculations of PPV and PPP. We p...

Anatomical connectivity imposes strong constraints on brain function, but there is no general agreement about principles that govern its organization. Based on extensive quantitative data, we tested the power of three factors to predict connections of the primate cerebral cortex: architectonic similarity (structural model), spatial proximity (distance model) and thickness similarity (thickness ...

We study numerically how the intercellular conductance affects the process of spiral breakup in an array of coupled excitable cells. The cell dynamics are described by the Aliev-Panfilov model, and the intercellular connection is made via Ohmic elements. We find that decreasing intercellular conductance can prevent the breaking up of a spiral wave into a complex spatiotemporal pattern. We study...

This article determines and characterizes the minimal number of actuators needed to ensure structural controllability of a linear system under structural alterations that can severe the connection between any two states. We assume that initially the system is structurally controllable with respect to a given set of controls, and propose an efficient system-synthesis mechanism to find the minima...

This paper deals with the structural recognition of symbols on the documents. We have based our system on a combination of local and global structural approaches. The global approach groups the connected components together according to some closeness and connection constraints. The local approach splits up each connected component into a graph of geometrical objects (vectors, arcs, curves). Th...