Electroreduction of laccase covalently bound to organothiol monolayers on gold electrodes

Cerrena unicolor laccase was immobilized on the gold electrode by covalent bonding to self-assembled monolayers of mercaptoundecanoic or mercaptopropionic acids. STM images of immobilized laccase proved high population of the laccase molecules on the monolayer modified electrode. The SERS experiments in concert with resonance Raman effect confirmed that the structure at the “blue” copper site of the immobilized protein remained intact. The accessibility of individual copper sites for electron exchange with the gold electrode surface was investigated by voltammetry. The electrode behavior of laccase is different in the presence and absence of oxygen, showing that the immobilized enzyme is reactive towards oxygen. Addition of two common mediators improved the electrical connectivity of the enzyme with the electrode, increased the catalytic efficiency of immobilized laccase and switched the onset of catalytic current to the potentials of the mediator. Immobilization of laccase on well-organized mercaptoundecanoic acid separates efficiently the enzyme from the electrode and does not allow easy access of mediators to the surface. Attachment of the enzyme at smaller distance from the electrode by means of significantly shorter spacer molecule—mercaptopropionic acid improved the efficiency of catalytic reduction of oxygen on the monolayer modified electrode.     

Towards Increased Understanding of Open Data Use for Software Development

Information Systems Frontiers - The way open data resources of varied type and volume are used by software applications remains only partly known. In this study, following CRoss-Industry Standard...     

Iris-based human identity recognition with machine learning methods and discrete fast Fourier transform

Innovations in Systems and Software Engineering - One of the most important modules of computer systems is the one that is responsible for user safety. It was proven that simple passwords and...     

Damage localization for beams based on the wavelet correlation operator

The continuous wavelet transform (CWT) is one of the crucial damage identification tools in the vibration-based damage assessment. Because of the vanishing moment property, the CWT method is capable of featuring damage singularity in the higher scales, and separating the global trends and noise progressively. In the classical investigations about this issue, the localization property of the CWT is usually deemed as the most critical point. The abundant information provided by the scale-domain information and the corresponding effectiveness are, however, neglected to some extent. Ultimately, this neglect restricts the sufficient application of the CWT method in damage localization, especially in noisy conditions. In order to address this problem, the wavelet correlation operator is introduced into the CWT damage detection method as a post-processing. By means of the correlations among different scales, the proposed operator suppresses noise, cancels global trends, and intensifies the damage features for various mode shapes. The proposed method is demonstrated numerically with emphasis on characterizing damage in noisy environments, where the wavelet scale Teager-Kaiser energy operator is taken as the benchmark method for comparison. Experimental validations are conducted based on the benchmark data from composite beam specimens measured by a scanning laser vibrometer. Numerical and experimental validations/comparisons present that the introduction of wavelet correlation operator is effective for damage localization in noisy conditions.     

A compositional Petri net translation of general π-calculus terms

We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. We view a computing system as consisting of a main program (π-calculus term) together with procedure declarations (recursive definitions of π-calculus identifiers). The control structure of these components is represented using disjoint high-level Petri nets, one for the main program and one for each of the procedure declarations. The program is executed once, while each procedure can be invoked several times (even concurrently), each such invocation being uniquely identified by structured tokens which correspond to the sequence of recursive calls along the execution path leading to that invocation.     

Towards measurable bounds on entanglement measures

While the experimental detection of entanglement provides already quite a difficult task, experimental quantification of entanglement is even more challenging, and has not yet been studied thoroughly. In this paper we discuss several issues concerning bounds on concurrence measurable collectively on copies of a given quantum state. Firstly, we concentrate on the recent bound on concurrence by (Mintert and Buchleitner in Phys Rev Lett 98:140505/1–140505/4, 2007). Relating it to the reduction criterion for separability we provide yet another proof of the bound and point out some possibilities following from the proof which could lead to improvement of the bound. Then, relating concurrence to the generalized robustness of entanglement, we provide a method allowing for construction of lower bounds on concurrence from any positive map (not only the reduction one). All these quantities can be measured as mean values of some two-copy observables. In this sense the method generalizes the Mintert–Buchleitner bound and recovers it when the reduction map is used. As a particular case we investigate the bound obtained from the transposition map. Interestingly, comparison with MB bound performed on the class of ${4\otimes 4}While the experimental detection of entanglement provides already quite a difficult task, experimental quantification of entanglement is even more challenging, and has not yet been studied thoroughly. In this paper we discuss several issues concerning bounds on concurrence measurable collectively on copies of a given quantum state. Firstly, we concentrate on the recent bound on concurrence by (Mintert and Buchleitner in Phys Rev Lett 98:140505/1–140505/4, 2007). Relating it to the reduction criterion for separability we provide yet another proof of the bound and point out some possibilities following from the proof which could lead to improvement of the bound. Then, relating concurrence to the generalized robustness of entanglement, we provide a method allowing for construction of lower bounds on concurrence from any positive map (not only the reduction one). All these quantities can be measured as mean values of some two-copy observables. In this sense the method generalizes the Mintert–Buchleitner bound and recovers it when the reduction map is used. As a particular case we investigate the bound obtained from the transposition map. Interestingly, comparison with MB bound performed on the class of 4?4{4\otimes 4} rotationally invariant states shows that the new bound is positive in regions in which the MB bound gives zero. Finally, we provide measurable upper bounds on the whole class of concurrences.     

A parallel direct solver for the self-adaptive hp Finite Element Method

In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive hp$hp$-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p=1$p=1$ to p=9$p=9$. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf.     

Biological cardio-micro-pumps for microbioreactors and analytical micro-systems

Bio-hybrid microsystems actuated by living cells, as micro-bio-actuators and micro-bio-pumps have been developed recently. In these devices biological cells may be powered without external energy sources and the movement or the contraction of muscle cells trigger off the flow of fluid (i.e. culture medium or blood) through microchannels in micro-multi-bioreactor systems. Isolated and in vitro cultured cardiomyocytes (cardiac cells) are the most promising bio-material, which can be used to design a micro-bio-pump/actuator. These spontaneously contracting cells are autonomously powered with glucose as an energy source without any external power supply or stimulus, unlike conventional micro-actuators/micro-pumps. Cardio-micro-bio-pumps/actuators are using collective, synchronous contracting forces of cardiac cells or cardiac cell sheets to drive the flow of fluid. The feasibility of building such actuators was demonstrated in a few examples of bio-hybrid microsystems actuated by single or sheeted cardiomyocytes.