Scientific and technological performance evaluation of the Spanish Council for Scientific Research (CSIC) in the field of Biotechnology

An evaluation of the Spanish CSIC performance in Biotechnology, as compared with those of the French CNRS and the Italian CNR, has been carried out to determine the balance between the generation of scientific knowledge and the transfer of technology. This study shows a high scientific productivity mostly in journals with moderate impact factor, a low generation of patents and an insufficient transfer of knowledge to the Spanish companies. Other indicators confirm the existence of competitive human resources in biotechnological research producing scientific knowledge of interest for the development of patents and that cooperates successfully at European level.     

Cpk index estimation using data transformation

Process capability indices (PCIs) are used in industry to assess percentages of nonconforming parts. An underlying assumption is that the output process measurements are distributed as normal random variables. When normal distributions are assumed, but different distributions are present - such as skew, heavy-tailed, and short-tailed distributions - the percentages of nonconforming parts are significantly different than the computed PCIs indicate. Data arising from nonnormal distributions can sometimes be transformed to conform to the normality assumption and the PCI's computed for the transformed data. In this paper, the effect of the transformation on the estimate of nonconforming parts is examined for three examples of nonnormal distributions - gamma, lognormal, and Weibull. The results of this experimental analysis suggest that data transformation can be useful for estimating an interval for C_pk values and the number of nonconforming parts.     

The direct catalytic asymmetric mannich reaction

The direct catalytic asymmetric addition of unmodified carbonyl compounds to preformed or in situ-generated imines has emerged as a promising new route to optically enriched alpha- and beta-amino acid derivatives, beta-lactams, and 1,2- and gamma-amino alcohols. The direct catalytic asymmetric Mannich reactions are mediated by small organometallic and organic amine catalysts that can achieve levels of selectivity similar to those possible with natural enzymes. The different small-molecule catalysts described here are complementary in their applications. They also complement each other in syn or anti selectivity of the direct asymmetric Mannich reaction. In this Account, we highlight the recent developments in and contributions to this research.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

Delignification kinetics of empty fruit bunch (EFB): a sustainable and green pretreatment approach using malic acid-based solvents

Recently, the development of efficient and environmentally benign solvents has received great attention to replace current harsh organic solvents. In this context, low-transition-temperature mixtures (LTTMs) have emerged as favorable green solvents for biomass delignification. Palm oil biomass, empty fruit bunch (EFB) was pretreated with commercial l-malic acid and microwave hydrothermally extracted cactus malic acid-derived LTTMs at 60, 80, and 100 °C. The LTTMs applied in this study were derived from malic acid–choline chloride–water and malic acid–monosodium glutamate–water with a molar ratio of 2:4:2 and 3:1:5, respectively. Three first-order reactions were used to express the delignification kinetic model of EFB. The first term was based on the initial stage and assigned as infinite due to the fast rate of delignification which could not be detected. The second and third terms were proportional to bulk and residual delignification stages. A good agreement was obtained between the kinetic model and the experimental data obtained in this study with R²?≥?0.91. The activation energies for the delignification reactions using l-malic acid and cactus malic acid-based LTTMs in the bulk and residual stages were approximated as 36–56 and 19–26 kJ/mol and 34–90 and 47–87 kJ/mol, respectively.     

The renaming problem in shared memory systems: An introduction

Exploring the power of shared memory communication objects and models, and the limits of distributed computability are among the most exciting research areas of distributed computing. In that spirit, this paper focuses on a problem that has received considerable interest since its introduction in 1987, namely the renaming problem. It was the first non-trivial problem known to be solvable in an asynchronous distributed system despite process failures. Many algorithms for renaming and variants of renaming have been proposed, and sophisticated lower bounds have been proved, that have been a source of new ideas of general interest to distributed computing. It has consequently acquired a paradigm status in distributed fault-tolerant computing.In the renaming problem, processes start with unique initial names taken from a large name space, then deciding new names such that no two processes decide the same new name and the new names are from a name space that is as small as possible.This paper presents an introduction to the renaming problem in shared memory systems, for non-expert readers. It describes both algorithms and lower bounds. Also, it discusses strong connections relating renaming and other important distributed problems such as set agreement and symmetry breaking.     

Signal reconstruction in sensor networks with flat and clustered topologies

We apply signal processing techniques to the study of wireless sensor networks, whose nodes are deployed over a planar region for environmental monitoring. We address the problem of reconstructing the phenomenon of interest at a sink node, from the samples gathered by the sensors, and we evaluate the system performance in presence of both a flat and a clustered network topology. When the sensors are grouped into (possibly overlapping) clusters, the data collected within each cluster are compressed by the cluster head and sent to the sink node. By representing the compressed data through the Fourier coefficients of the field spectrum, we analyze both the case where the sensor positions are known to the sink, and the case where they are available at the cluster head only. We show that clustering significantly reduces the energy expenditure due to data transmission with respect to the case of a flat network topology, and, most importantly, we derive the possible degradation of the quality of the reconstructed field due to compression.     

A discontinuous Galerkin solver for Boltzmann–Poisson systems in nano devices

In this paper, we present results of a discontinuous Galerkin (DG) scheme applied to deterministic computations of the transients for the Boltzmann–Poisson system describing electron transport in semiconductor devices. The collisional term models optical-phonon interactions which become dominant under strong energetic conditions corresponding to nano-scale active regions under applied bias. The proposed numerical technique is a finite element method using discontinuous piecewise polynomials as basis functions on unstructured meshes. It is applied to simulate hot electron transport in bulk silicon, in a silicon n⁺–n–n⁺ diode and in a double gated 12 nm MOSFET. Additionally, the obtained results are compared to those of a high order WENO scheme simulation and DSMC (Discrete Simulation Monte Carlo) solvers.     

Aerodynamic and aeroelastic analyses on the CAARC standard tall building model using numerical simulation

The simulation of the wind action over the CAARC (Commonwealth Advisory Aeronautical Council) standard tall building model is performed in the present work. Aerodynamic and aeroelastic analyses are reproduced numerically in order to demonstrate the applicability of CFD techniques in the field of wind engineering. A major topic in this paper is referred to one of the first attempts to simulate the aeroelastic behavior of a tall building employing complex CFD techniques. Numerical results obtained in this work are compared with numerical and wind tunnel measurements and some important concluding remarks about the present simulation are also reported.