Thermal wave scattering by two overlapping and parallel cylinders

In this paper an analytical solution of the temperature of an opaque material containing two overlapping and parallel subsurface cylinders, illuminated by a modulated light beam, is presented. The method is based on the expansion of plane and cylindrical thermal waves in series of Bessel and Hankel functions. This model is addressed to the study of heat propagation in composite materials with interconnection between inclusions, as is the case of inverse opals and fiber reinforced composites. Measurements on calibrated samples using lock-in infrared thermography confirm the validity of the model.

The role of an insulating surface layer on the relaxation time of the ionic redistribution in an electrolytic cell

We analyze the influence of a surface dielectric layer on the transient phenomena related to the ionic redistribution in an electrolytic cell submitted to a step-like external voltage. The adsorption-desorption phenomenon is taken into account in the famework of the Gouy-Chapman approximation, where the ions are assumed dimensionless. In the limit of small amplitude of the applied voltage, where the equations of the problem can be linearized, we obtain an analytical solution for the surface densities of ions, for the electrical potential and for the relaxation time for the transient phenomena. In the general case, when the linearized analysis is no longer valid, the solution of the problem is obtained numerically. The role of the thickness of the dielectric layer on the relaxation time is also discussed.

Black-box decomposition approach for computational hemodynamics: One-dimensional models

Increasing efforts exist in integrating different levels of detail in models of the cardiovascular system. For instance, one-dimensional representations are employed to model the systemic circulation. In this context, effective and black-box-type decomposition strategies for one-dimensional networks are needed, so as to: (i) employ domain decomposition strategies for large systemic models (1D-1D coupling) and (ii) provide the conceptual basis for dimensionally-heterogeneous representations (1D-3D coupling, among various possibilities). The strategy proposed in this article works for both of these two scenarios, though the several applications shown to illustrate its performance focus on the 1D-1D coupling case. A one-dimensional network is decomposed in such a way that each coupling point connects two (and not more) of the sub-networks. At each of the M connection points two unknowns are defined: the flow rate and pressure. These 2M unknowns are determined by 2M equations, since each sub-network provides one (non-linear) equation per coupling point. It is shown how to build the 2M x 2M non-linear system with arbitrary and independent choice of boundary conditions for each of the sub-networks. The idea is then to solve this non-linear system until convergence, which guarantees strong coupling of the complete network. In other words, if the non-linear solver converges at each time step, the solution coincides with what would be obtained by monolithically modeling the whole network. The decomposition thus imposes no stability restriction on the choice of the time step size. Effective iterative strategies for the non-linear system that preserve the black-box character of the decomposition are then explored. Several variants of matrix-free Broyden`s and Newton-GMRES algorithms are assessed as numerical solvers by comparing their performance on sub-critical wave propagation problems which range from academic test cases to realistic cardiovascular applications. A specific variant of Broyden`s algorithm is identified and recommended on the basis of its computer cost and reliability. (C) 2010 Elsevier B.V. All rights reserved.

Numerical solution of the PTT constitutive equation for unsteady three-dimensional free surface flows

This work deals with the development of a numerical technique for simulating three-dimensional viscoelastic free surface flows using the PTT (Phan-Thien-Tanner) nonlinear constitutive equation. In particular, we are interested in flows possessing moving free surfaces. The equations describing the numerical technique are solved by the finite difference method on a staggered grid. The fluid is modelled by a Marker-and-Cell type method and an accurate representation of the fluid surface is employed. The full free surface stress conditions are considered. The PTT equation is solved by a high order method, which requires the calculation of the extra-stress tensor on the mesh contours. To validate the numerical technique developed in this work flow predictions for fully developed pipe flow are compared with an analytic solution from the literature. Then, results of complex free surface flows using the FIT equation such as the transient extrudate swell problem and a jet flowing onto a rigid plate are presented. An investigation of the effects of the parameters epsilon and xi on the extrudate swell and jet buckling problems is reported. (C) 2010 Elsevier B.V. All rights reserved.

Numerical Solution of the Upper-Convected Maxwell Model for Three-Dimensional Free Surface Flows

This work presents a finite difference technique for simulating three-dimensional free surface flows governed by the Upper-Convected Maxwell (UCM) constitutive equation. A Marker-and-Cell approach is employed to represent the fluid free surface and formulations for calculating the non-Newtonian stress tensor on solid boundaries are developed. The complete free surface stress conditions are employed. The momentum equation is solved by an implicit technique while the UCM constitutive equation is integrated by the explicit Euler method. The resulting equations are solved by the finite difference method on a 3D-staggered grid. By using an exact solution for fully developed flow inside a pipe, validation and convergence results are provided. Numerical results include the simulation of the transient extrudate swell and the comparison between jet buckling of UCM and Newtonian fluids.

Thermodynamic characterization of the palm tree Roystonea regia peroxidase stability

The structural stability of a peroxidase, a dimeric protein from royal palm tree (Roystonea regia) leaves, has been characterized by high-sensitivity differential scanning calorimetry, circular dichroism, steady-state tryptophan fluorescence and analytical ultracentifugation under different solvent conditions. It is shown that the thermal and chemical (using guanidine hydrochloride (Gdn-HCl)) folding/unfolding of royal palm tree peroxidase (RPTP) at pH 7 is a reversible process involving a highly cooperative transition between the folded dimer and unfolded monomers, with a free stabilization energy of about 23 kcal per mol of monomer at 25 degrees C. The structural stability of RPTP is pH-dependent. At pH 3, where ion pairs have disappeared due to protonation, the thermally induced denaturation of RPTP is irreversible and strongly dependent upon the scan rate, suggesting that this process is under kinetic control. Moreover, thermally induced transitions at this pH value are dependent on the protein concentration, allowing it to be concluded that in solution RPTP behaves as dimer, which undergoes thermal denaturation coupled with dissociation. Analysis of the kinetic parameters of RPTP denaturation at pH 3 was accomplished on the basis of the simple kinetic scheme N ->(k) D, where k is a first-order kinetic constant that changes with temperature, as given by the Arrhenius equation; N is the native state, and D is the denatured state, and thermodynamic information was obtained by extrapolation of the kinetic transition parameters to an infinite heating rate. Obtained in this way, the value of RPTP stability at 25 degrees C is ca. 8 kcal per mole of monomer lower than at pH 7. In all probability, this quantity reflects the contribution of ion pair interactions to the structural stability of RPTP. From a comparison of the stability of RPTP with other plant peroxidases it is proposed that one of the main factors responsible for the unusually high stability of RPTP which enhances its potential use for biotechnological purposes, is its dimerization. (c) 2008 Elsevier Masson SAS. All rights reserved.

Crystal structure and statistical coupling analysis of highly glycosylated peroxidase from royal palm tree (Roystonea regia)

Royal palm tree peroxidase (RPTP) is a very stable enzyme in regards to acidity, temperature, H(2)O(2), and organic solvents. Thus, RPTP is a promising candidate for developing H(2)O(2)-sensitive biosensors for diverse applications in industry and analytical chemistry. RPTP belongs to the family of class III secretory plant peroxidases, which include horseradish peroxidase isozyme C, soybean and peanut peroxidases. Here we report the X-ray structure of native RPTP isolated from royal palm tree (Roystonea regia) refined to a resolution of 1.85 angstrom. RPTP has the same overall folding pattern of the plant peroxidase superfamily, and it contains one heme group and two calcium-binding sites in similar locations. The three-dimensional structure of RPTP was solved for a hydroperoxide complex state, and it revealed a bound 2-(N-morpholino) ethanesulfonic acid molecule (MES) positioned at a putative substrate-binding secondary site. Nine N-glycosylation sites are clearly defined in the RPTP electron-density maps, revealing for the first time conformations of the glycan chains of this highly glycosylated enzyme. Furthermore, statistical coupling analysis (SCA) of the plant peroxidase superfamily was performed. This sequence-based method identified a set of evolutionarily conserved sites that mapped to regions surrounding the heme prosthetic group. The SCA matrix also predicted a set of energetically coupled residues that are involved in the maintenance of the structural folding of plant peroxidases. The combination of crystallographic data and SCA analysis provides information about the key structural elements that could contribute to explaining the unique stability of RPTP. (C) 2009 Elsevier Inc. All rights reserved.

Building binary-tree-based multiclass classifiers using separability measures

Various popular machine learning techniques, like support vector machines, are originally conceived for the solution of two-class (binary) classification problems. However, a large number of real problems present more than two classes. A common approach to generalize binary learning techniques to solve problems with more than two classes, also known as multiclass classification problems, consists of hierarchically decomposing the multiclass problem into multiple binary sub-problems, whose outputs are combined to define the predicted class. This strategy results in a tree of binary classifiers, where each internal node corresponds to a binary classifier distinguishing two groups of classes and the leaf nodes correspond to the problem classes. This paper investigates how measures of the separability between classes can be employed in the construction of binary-tree-based multiclass classifiers, adapting the decompositions performed to each particular multiclass problem. (C) 2010 Elsevier B.V. All rights reserved.

Numerical solution of the eXtended Pom-Pom model for viscoelastic free surface flows

In this paper we present a finite difference method for solving two-dimensional viscoelastic unsteady free surface flows governed by the single equation version of the eXtended Pom-Pom (XPP) model. The momentum equations are solved by a projection method which uncouples the velocity and pressure fields. We are interested in low Reynolds number flows and, to enhance the stability of the numerical method, an implicit technique for computing the pressure condition on the free surface is employed. This strategy is invoked to solve the governing equations within a Marker-and-Cell type approach while simultaneously calculating the correct normal stress condition on the free surface. The numerical code is validated by performing mesh refinement on a two-dimensional channel flow. Numerical results include an investigation of the influence of the parameters of the XPP equation on the extrudate swelling ratio and the simulation of the Barus effect for XPP fluids. (C) 2010 Elsevier B.V. All rights reserved.

A numerical method for solving the dynamic three-dimensional Ericksen-Leslie equations for nematic liquid crystals subject to a strong magnetic field

A finite difference technique, based on a projection method, is developed for solving the dynamic three-dimensional Ericksen-Leslie equations for nematic liquid crystals subject to a strong magnetic field. The governing equations in this situation are derived using primitive variables and are solved using the ideas behind the GENSMAC methodology (Tome and McKee [32]; Tome et al. [34]). The resulting numerical technique is then validated by comparing the numerical solution against an analytic solution for steady three-dimensional flow between two-parallel plates subject to a strong magnetic field. The validated code is then employed to solve channel flow for which there is no analytic solution. (C) 2009 Elsevier B.V. All rights reserved.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed. (C) 2007 Elsevier B.V. All rights reserved.

Epidemics in networks of spatially correlated three-dimensional root-branching structures

Using digitized images of the three-dimensional, branching structures for root systems of bean seedlings, together with analytical and numerical methods that map a common susceptible-infected- recovered (`SIR`) epidemiological model onto the bond percolation problem, we show how the spatially correlated branching structures of plant roots affect transmission efficiencies, and hence the invasion criterion, for a soil-borne pathogen as it spreads through ensembles of morphologically complex hosts. We conclude that the inherent heterogeneities in transmissibilities arising from correlations in the degrees of overlap between neighbouring plants render a population of root systems less susceptible to epidemic invasion than a corresponding homogeneous system. Several components of morphological complexity are analysed that contribute to disorder and heterogeneities in the transmissibility of infection. Anisotropy in root shape is shown to increase resilience to epidemic invasion, while increasing the degree of branching enhances the spread of epidemics in the population of roots. Some extension of the methods for other epidemiological systems are discussed.

One-dimensional trapped atoms: critical coupling parameter and critical number of particles

In this paper we consider the case of a Bose gas in low dimension in order to illustrate the applicability of a method that allows us to construct analytical relations, valid for a broad range of coupling parameters, for a function which asymptotic expansions are known. The method is well suitable to investigate the problem of stability of a collection of Bose particles trapped in one- dimensional configuration for the case where the scattering length presents a negative value. The eigenvalues for this interacting quantum one-dimensional many particle system become negative when the interactions overcome the trapping energy and, in this case, the system becomes unstable. Here we calculate the critical coupling parameter and apply for the case of Lithium atoms obtaining the critical number of particles for the limit of stability.

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.