Probability currents and entropy production in nonequilibrium lattice systems

The structure of probability currents is studied for the dynamical network after consecutive contraction on two-state, nonequilibrium lattice systems. This procedure allows us to investigate the transition rates between configurations on small clusters and highlights some relevant effects of lattice symmetries on the elementary transitions that are responsible for entropy production. A method is suggested to estimate the entropy production for different levels of approximations (cluster sizes) as demonstrated in the two-dimensional contact process with mutation.

Renyi entropy and parity oscillations of anisotropic spin-s Heisenberg chains in a magnetic field

Using the density matrix renormalization group, we investigate the Renyi entropy of the anisotropic spin-s Heisenberg chains in a z-magnetic field. We considered the half-odd-integer spin-s chains, with s = 1/2, 3/2, and 5/2, and periodic and open boundary conditions. In the case of the spin-1/2 chain we were able to obtain accurate estimates of the new parity exponents p(alpha)((p)) and p(alpha)((o)) that gives the power-law decay of the oscillations of the alpha-Renyi entropy for periodic and open boundary conditions, respectively. We confirm the relations of these exponents with the Luttinger parameter K, as proposed by Calabrese et al. [Phys. Rev. Lett. 104, 095701 (2010)]. Moreover, the predicted periodicity of the oscillating term was also observed for some nonzero values of the magnetization m. We show that for s > 1/2 the amplitudes of the oscillations are quite small and get accurate estimates of p(alpha)((p)) and p(alpha)((o)) become a challenge. Although our estimates of the new universal exponents p(alpha)((p)) and p(alpha)((o)) for the spin-3/2 chain are not so accurate, they are consistent with the theoretical predictions.

Inference of gene regulatory networks from time series by Tsallis entropy

Background: The inference of gene regulatory networks (GRNs) from large-scale expression profiles is one of the most challenging problems of Systems Biology nowadays. Many techniques and models have been proposed for this task. However, it is not generally possible to recover the original topology with great accuracy, mainly due to the short time series data in face of the high complexity of the networks and the intrinsic noise of the expression measurements. In order to improve the accuracy of GRNs inference methods based on entropy (mutual information), a new criterion function is here proposed. Results: In this paper we introduce the use of generalized entropy proposed by Tsallis, for the inference of GRNs from time series expression profiles. The inference process is based on a feature selection approach and the conditional entropy is applied as criterion function. In order to assess the proposed methodology, the algorithm is applied to recover the network topology from temporal expressions generated by an artificial gene network (AGN) model as well as from the DREAM challenge. The adopted AGN is based on theoretical models of complex networks and its gene transference function is obtained from random drawing on the set of possible Boolean functions, thus creating its dynamics. On the other hand, DREAM time series data presents variation of network size and its topologies are based on real networks. The dynamics are generated by continuous differential equations with noise and perturbation. By adopting both data sources, it is possible to estimate the average quality of the inference with respect to different network topologies, transfer functions and network sizes. Conclusions: A remarkable improvement of accuracy was observed in the experimental results by reducing the number of false connections in the inferred topology by the non-Shannon entropy. The obtained best free parameter of the Tsallis entropy was on average in the range 2.5 <= q <= 3.5 (hence, subextensive entropy), which opens new perspectives for GRNs inference methods based on information theory and for investigation of the nonextensivity of such networks. The inference algorithm and criterion function proposed here were implemented and included in the DimReduction software, which is freely available at http://sourceforge.net/projects/dimreduction and http://code.google.com/p/dimreduction/.

Adaptive Approach for a Maximum Entropy Algorithm in Ecological Niche Modeling

This paper presents an Adaptive Maximum Entropy (AME) approach for modeling biological species. The Maximum Entropy algorithm (MaxEnt) is one of the most used methods in modeling biological species geographical distribution. The approach presented here is an alternative to the classical algorithm. Instead of using the same set features in the training, the AME approach tries to insert or to remove a single feature at each iteration. The aim is to reach the convergence faster without affect the performance of the generated models. The preliminary experiments were well performed. They showed an increasing on performance both in accuracy and in execution time. Comparisons with other algorithms are beyond the scope of this paper. Some important researches are proposed as future works.

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.

Effects of temperature-dependent viscosity variation on entropy generation, heat and fluid flow through a porous-saturated duct of rectangular cross-section

Effect of temperature-dependent viscosity on fully developed forced convection in a duct of rectangular cross-section occupied by a fluid-saturated porous medium is investigated analytically. The Darcy flow model is applied and the viscosity-temperature relation is assumed to be an inverse-linear one. The case of uniform heat flux on the walls, i.e. the H boundary condition in the terminology of Kays and Crawford, is treated. For the case of a fluid whose viscosity decreases with temperature, it is found that the effect of the variation is to increase the Nusselt number for heated walls. Having found the velocity and the temperature distribution, the second law of thermodynamics is invoked to find the local and average entropy generation rate. Expressions for the entropy generation rate, the Bejan number, the heat transfer irreversibility, and the fluid flow irreversibility are presented in terms of the Brinkman number, the Péclet number, the viscosity variation number, the dimensionless wall heat flux, and the aspect ratio (width to height ratio). These expressions let a parametric study of the problem based on which it is observed that the entropy generated due to flow in a duct of square cross-section is more than those of rectangular counterparts while increasing the aspect ratio decreases the entropy generation rate similar to what previously reported for the clear flow case.

Heat transfer and entropy generation optimization of forced convection in a porous-saturated duct of rectangular cross-section

We investigate analytically the first and the second law characteristics of fully developed forced convection inside a porous-saturated duct of rectangular cross-section. The Darcy-Brinkman flow model is employed. Three different types of thermal boundary conditions are examined. Expressions for the Nusselt number, the Bejan number, and the dimensionless entropy generation rate are presented in terms of the system parameters. The conclusions of this analytical study will make it possible to compare, evaluate, and optimize alternative rectangular duct design options in terms of heat transfer, pressure drop, and entropy generation. (c) 2006 Elsevier Ltd. All rights reserved.

Entropy generation for forced convection in a porous saturated circular tube with uniform wall temperature

A numerical study is reported to investigate both the First and the Second Law of Thermodynamics for thermally developing forced convection in a circular tube filled by a saturated porous medium, with uniform wall temperature, and with the effects of viscous dissipation included. A theoretical analysis is also presented to study the problem for the asymptotic region applying the perturbation solution of the Brinkman momentum equation reported by Hooman and Kani [1]. Expressions are reported for the temperature profile, the Nusselt number, the Bejan number, and the dimensionless entropy generation rate in the asymptotic region. Numerical results are found to be in good agreement with theoretical counterparts.

A fast cross-entropy method for estimating buffer overflows in queuing networks

In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First, we estimate the minimum cross-entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer level. Finally, the tilting parameter just found is used to estimate the overflow probability of interest. We study various properties of the method in more detail for the M/M/1 queue and conjecture that similar properties also hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.

Approximate analytical solutions for porous catalysts with nonuniform activity

Using a novel finite integral transform technique, the problem of diffusion and chemical reaction in a porous catalyst with general activity profile is investigated theoretically. Analytical expressions for the effectiveness factor are obtained for pth order and Michaelis-Menten kinetics. Perturbation methods are employed to provide useful asymptotic solutions for large or small values of Thiele modulus and Biot number.

In vivo protein cyclization promoted by a circularly permuted Synechocystis sp PCC6803 DnaB mini-intein

A synthetic Synechocystis sp. PCC6803 DnaB split mini-intein gene was constructed for the in vivo cyclization of recombinant proteins expressed in Escherichia coli. The system was used to cyclize the NH2-terminal domain of E. coli DnaB, the structure of which had been determined previously by NMR spectroscopy. Cyclization was found to proceed efficiently, with little accumulation of precursor, and the product was purified in high yield. The solution structure of cyclic DnaB-N is not significantly different from that of linear DnaB-N and it unfolds reversibly at temperatures similar to14 degreesC higher. Improved hydrogen bonding was observed in the first and last helices, and the length of the last helix was increased, while the 9-amino acid linker used to join the NH2 and COOH termini was found to be highly mobile. The measured thermodynamic stabilization of the structure (DeltaDeltaG approximate to 2 kcal/mol) agrees well with the value estimated from the reduced conformational entropy in the unfolded form. Simple polymer theory can be used to predict likely free energy changes resulting from protein cyclization and how the stabilization depends on the size of the protein and the length of the linker used to connect the termini.

Approximate controllability of second-order distributed implicit functional systems

In this paper we study the approximate controllability of control systems with states and controls in Hilbert spaces, and described by a second-order semilinear abstract functional differential equation with infinite delay. Initially we establish a characterization for the approximate controllability of a second-order abstract linear system and, in the last section, we compare the approximate controllability of a semilinear abstract functional system with the approximate controllability of the associated linear system. (C) 2008 Elsevier Ltd. All rights reserved.