Iterative strong coupling of dimensionally heterogeneous models

In this article we address decomposition strategies especially tailored to perform strong coupling of dimensionally heterogeneous models, under the hypothesis that one wants to solve each submodel separately and implement the interaction between subdomains by boundary conditions alone. The novel methodology takes full advantage of the small number of interface unknowns in this kind of problems. Existing algorithms can be viewed as variants of the `natural` staggered algorithm in which each domain transfers function values to the other, and receives fluxes (or forces), and vice versa. This natural algorithm is known as Dirichlet-to-Neumann in the Domain Decomposition literature. Essentially, we propose a framework in which this algorithm is equivalent to applying Gauss-Seidel iterations to a suitably defined (linear or nonlinear) system of equations. It is then immediate to switch to other iterative solvers such as GMRES or other Krylov-based method. which we assess through numerical experiments showing the significant gain that can be achieved. indeed. the benefit is that an extremely flexible, automatic coupling strategy can be developed, which in addition leads to iterative procedures that are parameter-free and rapidly converging. Further, in linear problems they have the finite termination property. Copyright (C) 2009 John Wiley & Sons, Ltd.

Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms

J.A. Ferreira Neto, E.C. Santos Junior, U. Fra Paleo, D. Miranda Barros, and M.C.O. Moreira. 2011. Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms. Cien. Inv. Agr. 38(2): 169-178. The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot`s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.

An unstructured CVFEM and moving interface algorithm for non-Newtonian Hele-Shaw flows in injection molding

Purpose - The purpose of this paper is to develop a novel unstructured simulation approach for injection molding processes described by the Hele-Shaw model. Design/methodology/approach - The scheme involves dual dynamic meshes with active and inactive cells determined from an initial background pointset. The quasi-static pressure solution in each timestep for this evolving unstructured mesh system is approximated using a control volume finite element method formulation coupled to a corresponding modified volume of fluid method. The flow is considered to be isothermal and non-Newtonian. Findings - Supporting numerical tests and performance studies for polystyrene described by Carreau, Cross, Ellis and Power-law fluid models are conducted. Results for the present method are shown to be comparable to those from other methods for both Newtonian fluid and polystyrene fluid injected in different mold geometries. Research limitations/implications - With respect to the methodology, the background pointset infers a mesh that is dynamically reconstructed here, and there are a number of efficiency issues and improvements that would be relevant to industrial applications. For instance, one can use the pointset to construct special bases and invoke a so-called ""meshless"" scheme using the basis. This would require some interesting strategies to deal with the dynamic point enrichment of the moving front that could benefit from the present front treatment strategy. There are also issues related to mass conservation and fill-time errors that might be addressed by introducing suitable projections. The general question of ""rate of convergence"" of these schemes requires analysis. Numerical results here suggest first-order accuracy and are consistent with the approximations made, but theoretical results are not available yet for these methods. Originality/value - This novel unstructured simulation approach involves dual meshes with active and inactive cells determined from an initial background pointset: local active dual patches are constructed ""on-the-fly"" for each ""active point"" to form a dynamic virtual mesh of active elements that evolves with the moving interface.

Exciton behavior in GaAs/AlGaAs coupled double quantum wells with interface disorder

In this work, we present a detailed study on the optical properties of two GaAs/Al(0.35)Ga(0.65)As coupled double quantum wells (CDQWs) with inter-well barriers of different thicknesses, by using photoluminescence (PL) spectroscopy. The two CDQWs were grown in a single sample, assuring very similar experimental conditions for measurements of both. The PL spectrum of each CDQW exhibits two recombination channels which can be accurately identified as the excitonic e(1)-hh(1) transitions originated from CDQWs of different effective dimensions. The PL spectra characteristics and the behavior of the emissions as a function of temperature and excitation power are interpreted in the scenario of the bimodal interface roughness model, taking into account the exciton migration between the two regions considered in this model and the difference in the potential fluctuation levels between those two regions. The details of the PL spectra behavior as a function of excitation power are explained in terms of the competition between the band gap renormalization (BGR) and the potential fluctuation effects. The results obtained for the two CDQWs, which have different degrees of potential fluctuation, are also compared and discussed. (C) 2009 Elsevier B.V. All rights reserved.

First-principles calculation of the AlAs/GaAs interface band structure using a self-energy-corrected local density approximation

We apply a self-energy-corrected local density approximation (LDA) to obtain corrected bulk band gaps and to study the band offsets of AlAs grown on GaAs (AlAs/GaAs). We also investigate the Al(x)Ga(1-x)As/GaAs alloy interface, commonly employed in band gap engineering. The calculations are fully ab initio, with no adjustable parameters or experimental input, and at a computational cost comparable to traditional LDA. Our results are in good agreement with experimental values and other theoretical studies. Copyright (C) EPLA, 2011

The lipid composition of a cell membrane modulates the interaction of an antiparasitic peptide at the air-water interface

The antiparasitic property of peptides is believed to be associated with their interactions with the protozoan membrane, which calls for research on the identification of membrane sites capable of peptide binding. In this study we investigated the interaction of a lipophilicglutathioine peptide known to be effective against the African Sleeping Sickness (ASS - African Trypanosomiasis) and cell membrane models represented by Langmuir monolayers. It is shown that even small amounts of the peptide affect the monolayers of some phospholipids and other lipids, which points to a significant interaction. The latter did not depend on the electrical charge of the monolayer-forming molecules but the peptide action was particularly distinctive for cholesterol + sphingomyelin monolayers that roughly resemble rafts on a cell membrane. Using in situ polarization-modulated infrared reflection absorption spectroscopy (PM-IRRAS), we found that the orientation of the peptide is affected by the phospholipids and dioctadecyldimethylammonium bromide (DODAB), but not in monolayers comprising cholesterol + sphingomyelin. In this mixed monolayer resembling rafts, the peptide still interacts and has some induced order, probably because the peptide molecules are fitted together into a compact monolayer. Therefore, the lipid composition of the monolayer modulates the interaction with the lipophilic glutathioine peptide, and this may have important implications in understanding how the peptide acts on specific sites of the protozoan membrane. (C) 2011 Elsevier B.V. All rights reserved.

Stability and interface properties of thin cellulose ester films adsorbed from acetone and ethyl acetate solutions

Stability and interface properties of cellulose acetate propionate (CAP) and cellulose acetate butyrate (CAB) films adsorbed from acetone or ethyl acetate onto Si wafers have been investigated by means of contact angle measurements and atomic force microscopy (AFM). Surface energy (gamma(total)(S)) values determined for CAP adsorbed from acetone are larger than those from ethyl acetate. In the case of CAB films adsorbed from ethyl acetate and acetone were similar. Dewetting was observed by AFM only for CAP films prepared from ethyl acetate. Positive values of effective Hamaker constant (A(eff)) were found only for CAP prepared from ethyl acetate, corroborating with dewetting phenomena observed by AFM. Oil the contrary, negative values of A(eff) were determined for CAP and CAB prepared from acetone and for CAB prepared from ethyl acetate, Corroborating with experimental observations. Sum frequency generation (SFG) vibrational spectra indicated that CAP and CAB films prepared from ethyl acetate present more alkyl groups oriented perpendicularly to the polymer-air interface than those films prepared from acetone. Such preferential orientation corroborates with macroscopic contact angle measurements. Moreover, SFG spectra showed that acetone hinds strongly to Si wafers, creating a new surface for CAP and CAB films. (C) 2008 Elsevier Inc. All rights reserved.

Femtosecond laser ablation on dental hard tissues-Analysis of ablated profile near an interface using local effective intensity

This study evaluated the process of ablation produced by a Ti:Sapphire femtosecond laser under different average powers taking place at the enamel/dentin interface. Based on the geometry of ablated microcavities the effective intensity for ablation was obtained. This study shows the validity for the local effective intensity analysis and allows a quantification of the variation in the ablation geometry taking place at the interface of two naturally different materials. It shows that the variation of the diameter of the ablated region as a function of the cavity depth comes essentially from a mechanism of effective intensity attenuation, as a result of a series of complex effects. Additionally, our data are sufficient to predict that a discontinuity on the ablation profile will occur on the interface between two biological media: enamel-dentin, showing a suddenly jump on the ablated cavity dimensions.

Properties of lipophilic nucleoside monolayers at the air-water interface

The capability of self-assembly and molecular recognition of biomolecules is essential for many nanotechnological applications, as in the use of alkyl-modified nucleosides and oligonucleotides to increase the cellular uptake of DNA and RNA. In this study, we show that a lipophilic nucleoside, which is an isomer mixture of 2`-palmitoyluridin und 3`-palmitoyluridin, forms Langmuir monolayers and Langmuir-Blodgett films as a typical amphiphile, though with a smaller elasticity. The nucleoside may be incorporated into dipalmitoyl phosphatidyl choline (DPPC) monolayers that serve as a simplified cell membrane model. The molecular-level interactions between the nucleoside and DPPC led to a remarkable condensation of the mixed monolayer, which affected both surface pressure and surface potential isotherms. The morphology of the mixed monolayers was dominated by the small domains of the nucleoside. The mixed monolayers could be deposited onto solid substrates as a one-layer Langmuir Blodgett film that displayed UV-vis absorption spectra typical of aggregated nucleosides owing to the interaction between the nucleoside and DPPC. The formation of solid films with DNA building blocks in the polar heads may open the way for devices and sensors be produced to exploit their molecular recognition properties. (C) 2010 Elsevier B.V. All rights reserved.

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.

Surface Activity of the Triflate Ion at the Air/Water Interface and Properties of N,N,N-Trimethyl-N-Dodecylammonium Triflate Aqueous Solutions

The surface activity of salts added to water is Air orders of magnitude lower than that of surfactants. Sodium trifluoromethanesulfonate (NaTf) produced a change in surface tension. with concentration, Delta gamma/Delta c, of -13.2 mN.L/m.mol. This value is ca. 4-fold larger than those of simple salts and that of methanesulfonate. This unexpected surface effect suggested that positively charged micelles containing Tf could exhibit interesting properties. Dodecyltrimethylammonium triflate (DTATf) had a higher Kraft temperature (37 degrees C) and a lower cmc (5 x 10(-3)M) and degree of dissociation (0.11) than the chloride and bromide salts of DTA. Above the Kraft temperature, at a characteristic temperature t(1), the addition of NaTf above 0.05 M. to a DTATf solution induced phase separation. By increasing the temperature of the two-phase system to above t(1), a homogeneous, transparent solution was obtained at a characteristic temperature t(2). These results, together with well-known triflate properties, led us to suggest that the Tf ion pairs With DTA and that the -CF(3) group may be dehydrated in the interfacial region, resulting in new and interesting self-aggregated structures.