Computational aspects of harmonic wavelet Galerkin methods and an application to a precipitation front propagation model

This article is dedicated to harmonic wavelet Galerkin methods for the solution of partial differential equations. Several variants of the method are proposed and analyzed, using the Burgers equation as a test model. The computational complexity can be reduced when the localization properties of the wavelets and restricted interactions between different scales are exploited. The resulting variants of the method have computational complexities ranging from O(N(3)) to O(N) (N being the space dimension) per time step. A pseudo-spectral wavelet scheme is also described and compared to the methods based on connection coefficients. The harmonic wavelet Galerkin scheme is applied to a nonlinear model for the propagation of precipitation fronts, with the front locations being exposed in the sizes of the localized wavelet coefficients. (C) 2011 Elsevier Ltd. All rights reserved.

A non-normal topology generated by a two-point selection

We construct a two-point selection f : [P](2) -> P, where P is the set of the irrational numbers, such that the space (P, tau(f)) is not normal and it is not collectionwise Hausdorff either. Here, tau(f) denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if f :[X](2) -> X is a two-point selection such that the topology tau(f) has countable pseudocharacter, then tau(f) is a Tychonoff topology. (C) 2008 Elsevier B.V. All rights reserved.

A group topology on the free abelian group of cardinality c that makes its square countably compact

Under p = c, we prove that it is possible to endow the free abelian group of cardinality c with a group topology that makes its square countably compact. This answers a question posed by Madariaga-Garcia and Tomita and by Tkachenko. We also prove that there exists a Wallace semigroup (i.e., a countably compact both-sided cancellative topological semigroup which is not a topological group) whose square is countably compact. This answers a question posed by Grant.

Abelian torsion groups with a countably compact group topology

Comfort and Remus [W.W. Comfort, D. Remus, Abelian torsion groups with a pseudo-compact group topology, Forum Math. 6 (3) (1994) 323-337] characterized algebraically the Abelian torsion groups that admit a pseudocompact group topology using the Ulm-Kaplansky invariants. We show, under a condition weaker than the Generalized Continuum Hypothesis, that an Abelian torsion group (of any cardinality) admits a pseudocompact group topology if and only if it admits a countably compact group topology. Dikranjan and Tkachenko [D. Dikranjan. M. Tkachenko, Algebraic structure of small countably compact Abelian groups, Forum Math. 15 (6) (2003) 811-837], and Dikranjan and Shakhmatov [D. Dikranjan. D. Shakhmatov, Forcing hereditarily separable compact-like group topologies on Abelian groups, Topology Appl. 151 (1-3) (2005) 2-54] showed this equivalence for groups of cardinality not greater than 2(c). We also show, from the existence of a selective ultrafilter, that there are countably compact groups without non-trivial convergent sequences of cardinality kappa(omega), for any infinite cardinal kappa. In particular, it is consistent that for every cardinal kappa there are countably compact groups without non-trivial convergent sequences whose weight lambda has countable cofinality and lambda > kappa. (C) 2009 Elsevier B.V. All rights reserved.

Oxindole-Schiff base copper(II) complexes interactions with human serum albumin: Spectroscopic, oxidative damage, and computational studies

CD and EPR were used to characterize interactions of oxindole-Schiff base copper(II) complexes with human serum albumin (HSA). These imine ligands form very stable complexes with copper, and can efficiently compete for this metal ion towards the specific N-terminal binding site of the protein, consisting of the amino acid sequence Asp-Ala-His. Relative stability constants for the corresponding complexes were estimated from CD data, using the protein as competitive ligand, with values of log K(CuL) in the range 15.7-18.1, very close to that of [Cu(HSA)] itself, with log K(CuHSA) 16.2. Some of the complexes are also able to interfere in the a-helix structure of the protein, while others seem not to affect it. EPR spectra corroborate those results, indicating at least two different metal species in solution, depending on the imine ligand. Oxidative damage to the protein after incubation with these copper(II) complexes, particularly in the presence of hydrogen peroxide, was monitored by carbonyl groups formation, and was observed to be more severe when conformational features of the protein were modified. Complementary EPR spin-trapping data indicated significant formation of hydroxyl and carbon centered radicals, consistent with an oxidative mechanism. Theoretical calculations at density functional theory (DFT) level were employed to evaluate Cu(II)-L binding energies, L -> Cu(II) donation, and Cu(II) -> L back-donation, by considering the Schiff bases and the N-terminal site of HSA as ligands. These results complement previous studies on cytotoxicity, nuclease and pro-apoptotic properties of this kind of copper(II) complexes, providing additional information about their possibilities of transport and disposition in blood plasma. (C) 2009 Elsevier Inc. All rights reserved.

Structural studies of prephenate dehydratase from Mycobacterium tuberculosis H37Rv by SAXS, ultracentrifugation, and computational analysis

Tuberculosis (TB) is one of the most common infectious diseases known to man and responsible for millions of human deaths in the world. The increasing incidence of TB in developing countries, the proliferation of multidrug resistant strains, and the absence of resources for treatment have highlighted the need of developing new drugs against TB. The shikimate pathway leads to the biosynthesis of chorismate, a precursor of aromatic amino acids. This pathway is absent from mammals and shown to be essential for the survival of Mycobacterium tuberculosis, the causative agent of TB. Accordingly, enzymes of aromatic amino acid biosynthesis pathway represent promising targets for structure-based drug design. The first reaction in phenylalanine biosynthesis involves the conversion of chorismate to prephenate, catalyzed by chorismate mutase. The second reaction is catalyzed by prephenate dehydratase (PDT) and involves decarboxylation and dehydratation of prephenate to form phenylpyruvate, the precursor of phenylalanine. Here, we describe utilization of different techniques to infer the structure of M. tuberculosis PDT (MtbPDT) in solution. Small angle X-ray scattering and ultracentrifugation analysis showed that the protein oligomeric state is a tetramer and MtbPDT is a flat disk protein. Bioinformatics tools were used to infer the structure of MtbPDT A molecular model for MtbPDT is presented and molecular dynamics simulations indicate that MtbPDT i.s stable. Experimental and molecular modeling results were in agreement and provide evidence for a tetrameric state of MtbPDT in solution.

Computational study of the step size parameter of the subgradient optimization method

The subgradient optimization method is a simple and flexible linear programming iterative algorithm. It is much simpler than Newton's method and can be applied to a wider variety of problems. It also converges when the objective function is non-differentiable. Since an efficient algorithm will not only produce a good solution but also take less computing time, we always prefer a simpler algorithm with high quality. In this study a series of step size parameters in the subgradient equation is studied. The performance is compared for a general piecewise function and a specific p-median problem. We examine how the quality of solution changes by setting five forms of step size parameter.

Experimental and computational investigation of the roll forming process

One of the first questions to consider when designing a new roll forming line is the number of forming steps required to produce a profile. The number depends on material properties, the cross-section geometry and tolerance requirements, but the tool designer also wants to minimize the number of forming steps in order to reduce the investment costs for the customer. There are several computer aided engineering systems on the market that can assist the tool designing process. These include more or less simple formulas to predict deformation during forming as well as the number of forming steps. In recent years it has also become possible to use finite element analysis for the design of roll forming processes. The objective of the work presented in this thesis was to answer the following question: How should the roll forming process be designed for complex geometries and/or high strength steels? The work approach included both literature studies as well as experimental and modelling work. The experimental part gave direct insight into the process and was also used to develop and validate models of the process. Starting with simple geometries and standard steels the work progressed to more complex profiles of variable depth and width, made of high strength steels. The results obtained are published in seven papers appended to this thesis. In the first study (see paper 1) a finite element model for investigating the roll forming of a U-profile was built. It was used to investigate the effect on longitudinal peak membrane strain and deformation length when yield strength increases, see paper 2 and 3. The simulations showed that the peak strain decreases whereas the deformation length increases when the yield strength increases. The studies described in paper 4 and 5 measured roll load, roll torque, springback and strain history during the U-profile forming process. The measurement results were used to validate the finite element model in paper 1. The results presented in paper 6 shows that the formability of stainless steel (e.g. AISI 301), that in the cold rolled condition has a large martensite fraction, can be substantially increased by heating the bending zone. The heated area will then become austenitic and ductile before the roll forming. Thanks to the phenomenon of strain induced martensite formation, the steel will regain the martensite content and its strength during the subsequent plastic straining. Finally, a new tooling concept for profiles with variable cross-sections is presented in paper 7. The overall conclusions of the present work are that today, it is possible to successfully develop profiles of complex geometries (3D roll forming) in high strength steels and that finite element simulation can be a useful tool in the design of the roll forming process.

A computational comparison of different algorithms for very large p-median problems

In this paper, we propose a new method for solving large scale p-median problem instances based on real data. We compare different approaches in terms of runtime, memory footprint and quality of solutions obtained. In order to test the different methods on real data, we introduce a new benchmark for the p-median problem based on real Swedish data. Because of the size of the problem addressed, up to 1938 candidate nodes, a number of algorithms, both exact and heuristic, are considered. We also propose an improved hybrid version of a genetic algorithm called impGA. Experiments show that impGA behaves as well as other methods for the standard set of medium-size problems taken from Beasley’s benchmark, but produces comparatively good results in terms of quality, runtime and memory footprint on our specific benchmark based on real Swedish data.