An enzymatic route to a benzocarbazole framework using bacterial CotA laccase

The CotA laccase-catalysed oxidation of the meta, para-disubstituted arylamine 2,4-diaminophenyldiamine delivers, under mild reaction conditions, a benzocarbazole derivative (1) (74% yield), a key structural motif of a diverse range of applications. This work extends the scope of aromatic frameworks obtained using these enzymes and represents a new efficient and clean method to construct in one step C-C and C-N bonds.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

Foraging at the Edge of Chaos: Internal Clock versus External Forcing

Activity rhythms in animal groups arise both from external changes in the environment, as well as from internal group dynamics. These cycles are reminiscent of physical and chemical systems with quasiperiodic and even chaotic behavior resulting from “autocatalytic” mechanisms. We use nonlinear differential equations to model how the coupling between the self-excitatory interactions of individuals and external forcing can produce four different types of activity rhythms: quasiperiodic, chaotic, phase locked, and displaying over or under shooting. At the transition between quasiperiodic and chaotic regimes, activity cycles are asymmetrical, with rapid activity increases and slower decreases and a phase shift between external forcing and activity. We find similar activity patterns in ant colonies in response to varying temperature during the day. Thus foraging ants operate in a region of quasiperiodicity close to a cascade of transitions leading to chaos. The model suggests that a wide range of temporal structures and irregularities seen in the activity of animal and human groups might be accounted for by the coupling between collectively generated internal clocks and external forcings.

NoC contention analysis using a branch-and-prune algorithm

“Many-core” systems based on a Network-on-Chip (NoC) architecture offer various opportunities in terms of performance and computing capabilities, but at the same time they pose many challenges for the deployment of real-time systems, which must fulfill specific timing requirements at runtime. It is therefore essential to identify, at design time, the parameters that have an impact on the execution time of the tasks deployed on these systems and the upper bounds on the other key parameters. The focus of this work is to determine an upper bound on the traversal time of a packet when it is transmitted over the NoC infrastructure. Towards this aim, we first identify and explore some limitations in the existing recursive-calculus-based approaches to compute the Worst-Case Traversal Time (WCTT) of a packet. Then, we extend the existing model by integrating the characteristics of the tasks that generate the packets. For this extended model, we propose an algorithm called “Branch and Prune” (BP). Our proposed method provides tighter and safe estimates than the existing recursive-calculus-based approaches. Finally, we introduce a more general approach, namely “Branch, Prune and Collapse” (BPC) which offers a configurable parameter that provides a flexible trade-off between the computational complexity and the tightness of the computed estimate. The recursive-calculus methods and BP present two special cases of BPC when a trade-off parameter is 1 or ∞, respectively. Through simulations, we analyze this trade-off, reason about the implications of certain choices, and also provide some case studies to observe the impact of task parameters on the WCTT estimates.

GPU implementation of a hyperspectral coded aperture algorithm for compressive sensing

This paper presents a new parallel implementation of a previously hyperspectral coded aperture (HYCA) algorithm for compressive sensing on graphics processing units (GPUs). HYCA method combines the ideas of spectral unmixing and compressive sensing exploiting the high spatial correlation that can be observed in the data and the generally low number of endmembers needed in order to explain the data. The proposed implementation exploits the GPU architecture at low level, thus taking full advantage of the computational power of GPUs using shared memory and coalesced accesses to memory. The proposed algorithm is evaluated not only in terms of reconstruction error but also in terms of computational performance using two different GPU architectures by NVIDIA: GeForce GTX 590 and GeForce GTX TITAN. Experimental results using real data reveals signficant speedups up with regards to serial implementation.

Bacterial enzymes and multi-enzymatic systems for cleaning-up dyes from the environment

Synthetic dyes are xenobiotic compounds that are being increasingly used in several industries, with special emphasis in the paper, textile and leather industries. Over 100,000 commercial dyes exist today and more than 7 × 105 tons of dyestuff is produced annually, of which 1–1.5 × 105 tons is released into the wastewaters (Rai et al in Crit Rev Environ Sci Tecnhol 35:219–238, 2005). Among these, azo dyes, characterized by the presence of one or more azo groups (–N=N–), and anthraquinonic dyes represent the largest and most versatile groups.

Step count algorithm adapted to indoor localization

This paper presents a step count algorithm designed to work in real-time using low computational power. This proposal is our first step for the development of an indoor navigation system, based on Pedestrian Dead Reckoning (PDR). We present two approaches to solve this problem and compare them based in their error on step counting, as well as, the capability of their use in a real time system.

Traveled Distance Estimation Algorithm for Indoor Localization

This paper presents an ankle mounted Inertial Navigation System (INS) used to estimate the distance traveled by a pedestrian. This distance is estimated by the number of steps given by the user. The proposed method is based on force sensors to enhance the results obtained from an INS. Experimental results have shown that, depending on the step frequency, the traveled distance error varies between 2.7% and 5.6%.

Hyperspectral unmixing algorithm via dependent component analysis

This paper introduces a new method to blindly unmix hyperspectral data, termed dependent component analysis (DECA). This method decomposes a hyperspectral images into a collection of reflectance (or radiance) spectra of the materials present in the scene (endmember signatures) and the corresponding abundance fractions at each pixel. DECA assumes that each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abudances are modeled as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. This method overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. The effectiveness of the proposed method is illustrated using simulated data based on U.S.G.S. laboratory spectra and real hyperspectral data collected by the AVIRIS sensor over Cuprite, Nevada.

Bacterial agents isolated from cerebrospinal fluid of patients with Acquired Immunodeficiency Syndrome (AIDS) and neurological complications

Cerebrospinal fluid (CSF) samples from 2083 patients with acquired immunodeficiency syndrome (AIDS) and neurological complications were bacteriologically examined during a period of 7 years (1984-1990). The percentage of patients who had at least one bacterial agent cultured from the CSF was 6.2%. Mycobacterium tuberculosis was the most frequently isolated agent (4.3%), followed by Mycobacterium avium complex or MAC (0.7%), Pseudomonas spp (0.5%), Enterobacter spp (0.4%), and Staphylococcus aureus (0.3%). Among 130 culture positive patients, 89 (68.5%) had M. tuberculosis and 15 (11.6%) had MAC. The frequency of bacterial isolations increased from 1988 (5.2%) to 1990 (7.2%), partly due to the increase in MAC isolations. Bacterial agents were more frequently isolated from patients in the age group 21-30 years and from women (p<0.05).

Dot-enzyme-linked immunosorbent assay (Dot-ELISA) for detection of pneumococcal polysaccharide antigens in pleural fluid effusion samples.: Comparison with bacterial culture, counterimmunoelectrophoresis and latex agglutination

A dot-enzyme-linked immunosorbent assay (Dot-ELISA) for pneumococcal antigen detection was standardized in view of the need for a rapid and accurate immunodiagnosis of acute pneumococcal pneumonia. A total of 442 pleural fluid effusion samples (PFES) from children with clinical and laboratory diagnoses of acute bacterial pneumonia, plus 38 control PFES from tuberculosis patients and 20 negative control serum samples from healthy children were evaluated by Dot-ELISA. The samples were previously treated with 0.1 M EDTA pH 7.5 at 90°C for 10 min and dotted on nitrocellulose membrane. Pneumococcal omniserum diluted at 1:200 was employed in this assay for antigen detection. When compared with standard bacterial culture, counterimmunoelectrophoresis and latex agglutination techniques, the Dot-ELISA results showed relative indices of 0.940 to sensitivity, 0.830 to specificity and 0.760 to agreement. Pneumococcal omniserum proved to be an optimal polyvalent antiserum for the detection of pneumococcal antigen by Dot-ELISA. Dot-ELISA proved to be a practical alternative technique for the diagnosis of pneumococcal pneumonia.

A lightweight distributed super peer election algorithm for unstructured dynamic P2P systems

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Bacterial antigen detection in cerebrospinal fluid by the latex agglutination test

Eighty purulent cerebrospinal fluid (CSF) samples from patients with clinical evidence of meningitis were studied using the Directigen latex agglutination (LA) kit to determine the presence of bacterial antigen in CSF. The results showed a better diagnostic performance of the LA test than bacterioscopy by Gram stain, culture and counterimmunoelectrophoresis (CIE), as far as Neisseria meningitidis groups B and C, and Haemophilus influenzae type b are concerned, and a better performance than bacterioscopy and culture considering Streptococcus pneumoniae. Comparison of the results with those of culture showed that the LA test had the highest sensitivity for the Neisseria meningitidis group C. Comparing the results with those of CIE, the highest levels of sensitivity were detected for N. meningitidis groups B and C. Regarding specificity, fair values were obtained for all organisms tested. The degree of K agreement when the LA test was compared with CIE exhibited better K indices of agreement for N. meningitidis groups B and C.