An analytical relation between entropy production and quantum Lyapunov exponents for Gaussian bipartite systems

We study and compare the information loss of a large class of Gaussian bipartite systems. It includes the usual Caldeira-Leggett-type model as well as Anosov models ( parametric oscillators, the inverted oscillator environment, etc), which exhibit instability, one of the most important characteristics of chaotic systems. We establish a rigorous connection between the quantum Lyapunov exponents and coherence loss, and show that in the case of unstable environments coherence loss is completely determined by the upper quantum Lyapunov exponent, a behavior which is more universal than that of the Caldeira-Leggett-type model.

2-(4,5,6,7-tetrafluorobenzimidazol-2-yl)-4,4,5,5-tetramethyl-4,5-dihydro-1H-imidazole-3-oxide-1-oxyl, a hydrogen-bonded organic quasi-1D ferromagnet

The title radical (F4BlmNN) is a stable nitronylnitroxide that forms hydrogen-bonded NH center dot center dot center dot ON chains in the solid state. The chains assemble the F4BlmNN molecules to form stacked contacts between the radical groups, in a geometry that is expected to exhibit ferromagnetic (FM) exchange based on spin polarization (SP) models. The experimental magnetic susceptibility of F4BlmNN confirms the expectation, showing 1-D Heisenberg chain FM exchange behavior over 1.8-300 K with an intrachain exchange constant Of J(chain)/k = +22 K. At lower temperatures, ac magnetic susceptibility and variable field heat capacity measurements show that F4BlmNN acts as a quasi-1-D ferromagnet. The dominant ferromagnetic exchange interaction is attributable to overlap between spin orbitals of molecules within the hydrogen-bonded chains, consistent with the SP model expectations. The chains appear to be antiferromagnetically exchange coupled, giving cusps in the ac susceptibility and zero field heat capacity at lower temperatures. The results indicate that the sample orders magnetically at about 0.7 K. The magnetic heat capacity ordering cusp shifts to lower temperatures as external magnetic field increases, consistent with forming a bulk antiferromagnetic phase below a Neel temperature of T-N(0) = 0.72 K, with a critical field of H-c approximate to 1800 Oe. The interchain exchange is estimated to be zJ/k congruent to (-)0.1 K.

Fermion perturbations in string theory black holes

In this paper we study fermion perturbations in four-dimensional black holes of string theory, obtained either from a non-extreme configuration of three intersecting five-branes with a boost along the common string or from a non-extreme intersecting system of two two-branes and two five-branes. The Dirac equation for the massless neutrino field, after conformal re-scaling of the metric, is written as a wave equation suitable to study the time evolution of the perturbation. We perform a numerical integration of the evolution equation, and with the aid of Prony fitting of the time-domain profile, we calculate the complex frequencies that dominate the quasinormal ringing stage, and also determine these quantities by the semi-analytical sixth-order WKB method. We also find numerically the decay factor of fermion fields at very late times, and show that the falloff is identical to those showing for massless fields in other four-dimensional black hole spacetimes.

From decoherence-free channels to decoherence-free and quasi-free subspaces within bosonic dissipative networks

We present a technique to build, within a dissipative bosonic network, decoherence-free channels (DFCs): a group of normal-mode oscillators with null effective damping rates. We verify that the states protected within the DFC define the well-known decoherence-free subspaces (DFSs) when mapped back into the natural network oscillators. Therefore, our technique to build protected normal-mode channels turns out to be an alternative way to build DFSs, which offers advantages over the conventional method. It enables the computation of all the network-protected states at once, as well as leading naturally to the concept of the decoherence quasi-free subspace (DQFS), inside which a superposition state is quasi-completely protected against decoherence. The concept of the DQFS, weaker than that of the DFS, may provide a more manageable mechanism to control decoherence. Finally, as an application of the DQFSs, we show how to build them for quasi-perfect state transfer in networks of coupled quantum dissipative oscillators.

The concept of quasi-integrability: a concrete example

We use the deformed sine-Gordon models recently presented by Bazeia et al [1] to take the first steps towards defining the concept of quasi-integrability. We consider one such definition and use it to calculate an infinite number of quasi-conserved quantities through a modification of the usual techniques of integrable field theories. Performing an expansion around the sine-Gordon theory we are able to evaluate the charges and the anomalies of their conservation laws in a perturbative power series in a small parameter which describes the ""closeness"" to the integrable sine-Gordon model. We show that in the case of the two-soliton scattering the charges, up to first order of perturbation, are conserved asymptotically, i.e. their values are the same in the distant past and future, when the solitons are well separated. We indicate that this property may hold or not to higher orders depending on the behavior of the two-soliton solution under a special parity transformation. For closely bound systems, such as breather-like field configurations, the situation however is more complex and perhaps the anomalies have a different structure implying that the concept of quasi-integrability does not apply in the same way as in the scattering of solitons. We back up our results with the data of many numerical simulations which also demonstrate the existence of long lived breather-like and wobble-like states in these models.

SOME COMMENTS ON QUASI-INTEGRABILITY

In this paper we present our preliminary results which suggest that some field theory models are `almost` integrable; i.e. they possess a large number of `almost` conserved quantities. First we demonstrate this, in some detail, on a class of models which generalise sine-Gordon model in (1+1) dimensions. Then, we point out that many field configurations of these models look like those of the integrable systems and others are very close to being integrable. Finally we attempt to quantify these claims looking in particular, both analytically and numerically, at some long lived field configurations which resemble breathers.

Modification of radiation pressure due to cooperative scattering of light

Cooperative spontaneous emission of a single photon from a cloud of N atoms modifies substantially the radiation pressure exerted by a far-detuned laser beam exciting the atoms. On one hand, the force induced by photon absorption depends on the collective decay rate of the excited atomic state. On the other hand, directional spontaneous emission counteracts the recoil induced by the absorption. We derive an analytical expression for the radiation pressure in steady-state. For a smooth extended atomic distribution we show that the radiation pressure depends on the atom number via cooperative scattering and that, for certain atom numbers, it can be suppressed or enhanced. Cooperative scattering of light by extended atomic clouds can become important in the presence of quasi-resonant light and could be addressed in many cold atoms experiments.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Heteroscedastic controlled calibration model applied to analytical chemistry

In chemical analyses performed by laboratories, one faces the problem of determining the concentration of a chemical element in a sample. In practice, one deals with the problem using the so-called linear calibration model, which considers that the errors associated with the independent variables are negligible compared with the former variable. In this work, a new linear calibration model is proposed assuming that the independent variables are subject to heteroscedastic measurement errors. A simulation study is carried out in order to verify some properties of the estimators derived for the new model and it is also considered the usual calibration model to compare it with the new approach. Three applications are considered to verify the performance of the new approach. Copyright (C) 2010 John Wiley & Sons, Ltd.

FROM TRISECTIONS IN MODULE CATEGORIES TO QUASI-DIRECTED COMPONENTS

In this paper, we define and study a special type of trisections in a module category, namely the compact trisections which characterize quasi-directed components. We apply this notion to the study of laura algebras and we use it to define a class of algebras with predictable Auslander-Reiten components.

Approaches for multicopper oxidases in the design of electrochemical sensors for analytical applications

We report an effective approach for the construction of a biomimetic sensor of multicopper oxidases by immobilizing a cyclic-tetrameric copper(II) species, containing the ligand (4-imidazolyl)ethylene-2-amino-1-ethylpyridine (apyhist), in the Nafion (R) membrane on a vitreous carbon electrode surface. This complex provides a tetranuclear arrangement of copper ions that allows an effective reduction of oxygen to water, in a catalytic cycle involving four electrons. The electrochemical reduction of oxygen was studied at pH 9.0 buffer solution by using cyclic voltammetry, chronoamperometry, rotating disk electrode voltammetry and scanning electrochemical microscopy techniques. The mediator shows good electrocatalytic ability for the reduction of O(2) at pH 9.0, with reduction of overpotential (350 mV) and increased current response in comparison with results obtained with a bare glassy carbon electrode. The heterogeneous rate constant (k(ME)`) for the reduction of O(2) at the modified electrode was determined by using a Koutecky-Levich plot. In addition, the charge transport rate through the coating and the apparent diffusion coefficient of O(2) into the modifier film were also evaluated. The overall process was found to be governed by the charge transport through the coating, occurring at the interface or at a finite layer at the electrode/coating interface. The proposed study opens up the way for the development of bioelectronic devices based on molecular recognition and self-organization. (C) 2010 Elsevier Ltd. All rights reserved.