Immobilization of biologically active species on PA‐6 foils treated by a dielectric barrier discharge

In the field of biomaterials and biomedical devices, surface activation has been focused on creating functional groups capable of preferential adsorption of biologically active species (proteins, enzymes, cells, drugs, etc.). In this way an interface can be created between the synthetic material and the biological medium, with the aim of increasing the compatibility of the implant with the human organism. In our experiments a dielectric barrier discharge (DBD), in helium at atmospheric pressure, was used as the source of energy capable of creating active centers that render the functionalized surface favorable to immobilization of biological molecules. Retention of immunoglobulin (IgG) and heparin biomolecules on polyamide‐6 (PA‐6) surfaces after treatment by the DBD was analyzed by atomic force microscopy, adhesion evaluation, and measurement of the contact angle titration in order to assess this incorporation on the treated surfaces. The marked adsorption of the biomolecules on the active sites created by DBD on the exposed surfaces also was related to a complex set of processes, such as enhanced roughness, increased surface wettability, and modified distribution of cationic and anionic groups on the treated surfaces. All these factors could promote interfacial interactions between the specific groups of the biomolecules existing in the biological medium and the type of cationic and/or anionic groups present on the surface. The efficiency of the DBD treatment showed that the DBD technique is useful for preactivation of the polymer surface for immobilization of other biologically active species (such as drugs and enzymes). © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 90: 1985–1990, 2003     

On numerical solution of arbitrary symmetric linear systems by approximate orthogonalization

A very important class of inverse problems are those modelled by integral equations of the first kind. These equations are usually ill-conditioned, such that any discretization technique will produce an ill-conditioned system, in classical or least-squares formulation. For such kind of symmetric problems, we propose in this paper a stable iterative solver based on an approximate orthogonalization algorithm introduced by Z. Kovarik. We prove convergence of our algorithm for general symmetric least-squares problems and present some numerical experiments ilustrating its good behaviour on problems concerned with the determination of charge distribution generating a given electric field and gravity surveying, both modelled by first kind integral equations.     

Face Editing Using Part-Based Optimization of the Latent Space

We propose an approach for interactive 3D face editing based on deep generative models. Most of the current face modeling methods rely on linear methods and cannot express complex and non-linear deformations. In contrast to 3D morphable face models based on Principal Component Analysis (PCA), we introduce a novel architecture based on variational autoencoders. Our architecture has multiple encoders (one for each part of the face, such as the nose and mouth) which feed a single decoder. As a result, each sub-vector of the latent vector represents one part. We train our model with a novel loss function that further disentangles the space based on different parts of the face. The output of the network is a whole 3D face. Hence, unlike part-based PCA methods, our model learns to merge the parts intrinsically and does not require an additional merging process. To achieve interactive face modeling, we optimize for the latent variables given vertex positional constraints provided by a user. To avoid unwanted global changes elsewhere on the face, we only optimize the subset of the latent vector that corresponds to the part of the face being modified. Our editing optimization converges in less than a second. Our results show that the proposed approach supports a broader range of editing constraints and generates more realistic 3D faces.     

Complexes With Biologically Active Ligands. Part 6 Ni(II) Coordination Compounds of Hydrazine and Heterocyclic Sulfonamides as Inhibitors of the Zinc Enzyme Carbonic Anhydrase

Ternary Ni(II) complexes of hydrazine and eight heterocyclic sulfonamides possessing carbonic anhydrase (CA) inhibitory properties, were prepared and characterized by elemental analysis, spectroscopic, magnetic, thermogravimetric, and conductimetric measurements. The complexes behave as strong inhibitors for two isozymes (I and II) of carbonic anhydrase.     

Multi-Scale Adaptive Sampling with Mobile Agents for Mapping of Forest Fires

The use of robotics in distributed monitoring applications requires wireless sensors that are deployed efficiently. A very important aspect of sensor deployment includes positioning them for sampling at locations most likely to yield information about the spatio-temporal field of interest, for instance, the spread of a forest fire. In this paper, we use mobile robots (agents) that estimate the time-varying spread of wildfires using a distributed multi-scale adaptive sampling strategy. The proposed parametric sampling algorithm, “EKF-NN-GAS” is based on neural networks, the extended Kalman filter (EKF), and greedy heuristics. It combines measurements arriving at different times, taken at different scale lengths, such as from ground, airborne, and spaceborne observation platforms. One of the advantages of our algorithm is the ability to incorporate robot localization uncertainty in addition to sensor measurement and field parameter uncertainty into the same EKF model. We employ potential fields, generated naturally from the estimated fire field distribution, in order to generate fire-safe trajectories that could be used to rescue vehicles and personnel. The covariance of the EKF is used as a quantitative information measure for sampling locations most likely to yield optimal information about the sampled field distribution. Neural net training is used infrequently to generate initial low resolution estimates of the fire spread parameters. We present simulation and experimental results for reconstructing complex spatio-temporal forest fire fields “truth models”, approximated by radial basis function (RBF) parameterizations. When compared to a conventional raster scan approach, our algorithm shows a significant reduction in the time necessary to map the fire field.     

InSAR validation based on GNSS measurements in Bucharest

This research aims to complex validate radar displacement products over Bucharest based on Global Navigation Satellite System or GNSS. Validation was represented by the comparison of the recent TerraSAR-X (TSX) displacement results with field GNSS data. For this purpose, 24 and 27 high-resolution images acquired from the TSX satellite between 2011 and 2014 were processed by Permanent Scatterer Inteferometry (PSI) and Small BASeline Subset (SBAS) – interferometric techniques using synthetic aperture radar (SAR) images. The images were selected from a larger pool of SAR images, after consulting weather databases, which helped eliminate the images acquired under adverse weather conditions. GNSS locations were cross-checked on high-resolution optical images and 21 ground points (including three permanent stations) were selected. All these points were (1) characterized by high coherence on radar images; (2) were on the ground; (3) were situated in large vacant spaces; and (4) far away from radar obstacles such as trees. A major challenge in achieving the research goal was to overcome the lack of permanent stations at the ground level within the area of Bucharest. Instead of permanent stations, our team designed and installed forced centring systems that remained stable over time, eliminating the instalment errors of GNSS receivers. The line-of-site (LOS) components derived from GNSS data have been compared with those of the SAR scatterers closest to the GNSS markers (never coinciding). For each location, the vertical reading was projected in the LOS of the SAR sensor. These readings were compared with the displacement values determined at the locations of permanent scatterers (PSs) within 100 m from the GNSS nodes, by eliminating all scatterers on buildings. The comparison has shown a good agreement.     

AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System

A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming and reasoning about interactive computing systems have been recently introduced by Stefanescu using register machines and space-time duality, see [Stefanescu, G. Interactive systems with registers and voices. Fundamenta Informaticae 73 (2006), 285–306. (Early draft, School of Computing, National University of Singapore, July 2004.)]. After that, Dragoi and Stefanescu have developed structured programming techniques for rv-systems and their verification, see, e.g., [Dragoi, C., and G. Stefanescu. Structured programming for interactive rv-systems. Institute of Mathematics of the Romanian Academy, IMAR Preprint 9/2006, Bucharest 2006. Dragoi, C., and G. Stefanescu. Towards a Hoare-like logic for structured rv-programs. Institute of Mathematics of the Romanian Academy, IMAR Preprint 10/2006, Bucharest, 2006. Dragoi, C., and G. Stefanescu. Implementation and verification of ring termination detection protocols using structured rv-programs. Annals of University of Bucharest, Mathematics-Informatics Series, 55 (2006), 129–138. Dragoi, C., and G. Stefanescu. Structured interactive programs with registers and voices and their verification. Draft, Bucharest, January 2007. Dragoi, C., and G. Stefanescu. On compiling structured interactive programs with registers and voices. In: “Proc. SOFSEM 2008,” 259–270. LNCS 4910, Springer, 2008.].In the present paper a kernel programming language AGAPIA v0.1 for interactive systems is introduced. The language contains definitions for complex spatial and temporal data, arithmetic and boolean expressions, modules, and while-programming statements with their temporal, spatial, and spatio-temporal versions. In AGAPIA v0.1 one can write programs for open processes located at various sites and having their temporal windows of adequate reaction to the environment. The main technical part of the paper describes a typing system for AGAPIA v0.1 programs.     

Tree-systems of morphisms

Starting from the idea of determinism in membrane systems, we introduce a language generating device consisting of morphisms placed in the nodes of a tree. Initial strings are given in the leaves; by iteratively applying the morphisms to them, we produce new strings, which are collected in the root of the tree. Such a device is called a tree-system of morphisms (in short, a T system). We investigate here the power of T systems, both in the extended (a terminal alphabet is considered and only strings over it are accepted) and non-extended case, mainly in comparison with classes of languages in Lindenmayer hierarchy. Received: 8 February 2001 / 18 September 2001     

Evidence for Irradiation Triggered Nonuniform Defects Distribution in Multiharmonic Magnetic Susceptibility of Neutron Irradiated YBa2Cu3O7?δ

Multiharmonic ac-magnetic susceptibility χ₁, χ₂, χ₃, of neutron irradiated Li-doped YBa₂Cu₃O_{7− x} has revealed a nonmonotonic dependence of all harmonics on the neutron fluence. The irradiation has a strongly depressive influence on the intergrain connection suggesting an increase of the effective thickness of the intergranular Josephson junction at a neutron fluence of 0.98 × 10¹⁷ cm⁻². Less damaged are the intragrain properties. A spectacular enhancement of the superconducting intragranular properties reflected in the characteristics of all harmonics was observed at highest fluence Φ = 9.98 × 10¹⁷ cm⁻². We assume that this effect results from the development of a space inhomogeneous distribution with alternating defectless and defect-rich regions.     

Languages generated by P systems with active membranes

We propose an alternative approach to generate languages by means of P systems: building up an appropriate representation for a string by means of a corresponding membrane structure and then generating the string by visiting the membrane structure according to a well-specified strategy. To this aim, we consider P systems with active membranes, allowing membrane creation or division or duplication and dissolution, where the output of a computation may be obtained either by visiting the tree associated with the membrane structure, or by following the traces of a specific object, called traveller, or sending out the objects. For each of these approaches, we provide characterizations of recursively enumerable languages based on P systems that use different sets of operations for modifying the membrane structure. Francesco Bernardini: He started his Ph.D. at the University of Sheffield in December 2002 after having previously got a master degree in Computer Science from the University of Pisa in Italy. His research is dedicated to the study of theoretical aspects of membrane computing (P systems) and discrete models of biological systems based on P systems. Marian Gheorghe, Ph.D.: His main research interests are in computational models and their applications to software modelling and testing, formal specifications of agent based systems, software engineering. He was investigating computational power of various generative devices (regular, context-free, fully initial; grammar systems; L-systems and variants). He is currently interested in natural computing (membrane calculus) and biological modelling.