Dynamics of the viscous Cahn-Hilliard equation

We study generalized viscous Cahn-Hilliard problems with nonlinearities satisfying critical growth conditions in W-0(1,p)(Omega), where Omega is a bounded smooth domain in R-n, n >= 3. In the critical growth case, we prove that the problems are locally well posed and obtain a bootstrapping procedure showing that the solutions are classical. For p = 2 and almost critical dissipative nonlinearities we prove global well posedness, existence of global attractors in H-0(1)(Omega) and, uniformly with respect to the viscosity parameter, L-infinity(Omega) bounds for the attractors. Finally, we obtain a result on continuity of regular attractors which shows that, if n = 3, 4, the attractor of the Cahn-Hilliard problem coincides (in a sense to be specified) with the attractor for the corresponding semilinear heat equation. (C) 2008 Elsevier Inc. All rights reserved.

KINETICS VERSUS HYDRODYNAMICS: GENERALIZATION OF LANDAU/COOPER-FRYE PRESCRIPTION FOR FREEZE-OUT

The problem of spectra formation in hydrodynamic approach to A + A collisions is considered within the Boltzmann equations. It is shown analytically and illustrated by numerical calculations that the particle momentum spectra can be presented in the Cooper-R-ye form despite freeze-out is not sharp and has the finite temporal width. The latter is equal to the inverse of the particle collision rate at points (t(sigma) (r, p), r) of the maximal emission at a fixed momentum p. The set of these points forms the hypersurfaces t(sigma)(r,p) which strongly depend on the values of p and typically do not enclose completely the initially dense matter. This is an important difference from the standard Cooper-Frye prescription (CFp), with a common freeze-out hypersurface for all p, that affects significantly the predicted spectra. Also, the well known problem of CFp as for negative contributions to the spectra from non-space-like parts of the freeze-out hypersurface is naturally eliminated in this improved prescription.

The effects of occlusal loading on the margins of cervical restorations

Background. Researchers have proposed the restoration of abfraction lesions, but limited information is available about the effects of occlusal loading on the margins of such restorations. Because abfraction is a well-recognized problem, the authors conducted a study to assess the effects of occlusal loading on the margins of cervical restorations. Methods. The authors prepared 40 wedge-shaped cavities in extracted premolars and restored them with a resin-based composite. They subjected specimens to occlusal loading (150 newtons, 101 cycles) on the buccal cusp, on the central fossa or on the lingual cusp, and they stored 1 the control group, specimens in deionized water. The authors used fluorescein to delimit marginal defects and evaluated the defects by using laser scanning confocal microscopy. Results. Results of chi(2) and Kruskal-Wallis tests (P < .05) showed that specimens subjected to occlusal loading had a higher percentage of marginal gaps (53.3 percent) than did the control specimens (10.0 percent). There were no differences between groups in marginal defect formation or in defect location, length or width. Conclusions. Occlusal loading led to a significant increase in gap formation at the margins of cervical resin-based composite restorations. Clinical Implications. The clinician cannot underestimate the effects of occlusal loading When restoring teeth with cervical wedge-shaped lesions. If occlusal loading is the main factor contributing to lesion formation, the clinician should identify and treat it before placing the restoration or otherwise run the risk that the restorative treatment will fail because of marginal gap formation.

In vitro sensitivity of Leishmania (Viannia) braziliensis and Leishmania (Leishmania) amazonensis Brazilian isolates to meglumine antimoniate and amphotericin B

Resistance of Leishmania parasites to specific chemotherapy has become a well-documented problem in the Indian subcontinent in recent years but only a few studies have focused on the susceptibility of American Leishmania isolates. Our susceptibility assays to meglumine antimoniate were performed against intracellular amastigotes after standardizing an in vitro model of macrophage infection appropriate for Leishmania (Viannia) braziliensis isolates. For the determination of promastigote susceptibility to amphotericin B, we developed a simplified MTT-test. The sensitivity in vitro to meglumine antimoniate and amphotericin B of 13 isolates obtained from Brazilian patients was determined. L. (V.) braziliensis isolates were more susceptible to meglumine antimoniate than Leishmania (Leishmania) amazonensis. EC(50), EC(90) and activity indexes (calculated over the sensitivity of reference strains), suggested that all isolates tested were susceptible in vitro to meglumine antimoniate, and did not show association with the clinical outcomes. Isolates were also uniformly susceptible in vitro to amphotericin B.

A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.

GLOBAL WELL-POSEDNESS AND NON-LINEAR STABILITY OF PERIODIC TRAVELING WAVES FOR A SCHRODINGER-BENJAMIN-ONO SYSTEM

The objective of this paper is two-fold: firstly, we develop a local and global (in time) well-posedness theory for a system describing the motion of two fluids with different densities under capillary-gravity waves in a deep water flow (namely, a Schrodinger-Benjamin-Ono system) for low-regularity initial data in both periodic and continuous cases; secondly, a family of new periodic traveling waves for the Schrodinger-Benjamin-Ono system is given: by fixing a minimal period we obtain, via the implicit function theorem, a smooth branch of periodic solutions bifurcating a Jacobian elliptic function called dnoidal, and, moreover, we prove that all these periodic traveling waves are nonlinearly stable by perturbations with the same wavelength.

A Separation Principle for the Continuous-Time LQ-Problem With Markovian Jump Parameters

In this paper, we devise a separation principle for the finite horizon quadratic optimal control problem of continuous-time Markovian jump linear systems driven by a Wiener process and with partial observations. We assume that the output variable and the jump parameters are available to the controller. It is desired to design a dynamic Markovian jump controller such that the closed loop system minimizes the quadratic functional cost of the system over a finite horizon period of time. As in the case with no jumps, we show that an optimal controller can be obtained from two coupled Riccati differential equations, one associated to the optimal control problem when the state variable is available, and the other one associated to the optimal filtering problem. This is a separation principle for the finite horizon quadratic optimal control problem for continuous-time Markovian jump linear systems. For the case in which the matrices are all time-invariant we analyze the asymptotic behavior of the solution of the derived interconnected Riccati differential equations to the solution of the associated set of coupled algebraic Riccati equations as well as the mean square stabilizing property of this limiting solution. When there is only one mode of operation our results coincide with the traditional ones for the LQG control of continuous-time linear systems.

On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain

We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.

QUADRANT-SEARCHING: A NEW TECHNIQUE TO REDUCE THE SEARCH SPACE OF THE INVERSE PROBLEM OF EIT USING BEM TO THE DIRECT PROBLEM

The image reconstruction using the EIT (Electrical Impedance Tomography) technique is a nonlinear and ill-posed inverse problem which demands a powerful direct or iterative method. A typical approach for solving the problem is to minimize an error functional using an iterative method. In this case, an initial solution close enough to the global minimum is mandatory to ensure the convergence to the correct minimum in an appropriate time interval. The aim of this paper is to present a new, simple and low cost technique (quadrant-searching) to reduce the search space and consequently to obtain an initial solution of the inverse problem of EIT. This technique calculates the error functional for four different contrast distributions placing a large prospective inclusion in the four quadrants of the domain. Comparing the four values of the error functional it is possible to get conclusions about the internal electric contrast. For this purpose, initially we performed tests to assess the accuracy of the BEM (Boundary Element Method) when applied to the direct problem of the EIT and to verify the behavior of error functional surface in the search space. Finally, numerical tests have been performed to verify the new technique.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

Self-adjoint extensions and spectral analysis in the Calogero problem

In this paper, we present a mathematically rigorous quantum-mechanical treatment of a one-dimensional motion of a particle in the Calogero potential alpha x(-2). Although the problem is quite old and well studied, we believe that our consideration based on a uniform approach to constructing a correct quantum-mechanical description for systems with singular potentials and/or boundaries, proposed in our previous works, adds some new points to its solution. To demonstrate that a consideration of the Calogero problem requires mathematical accuracy, we discuss some `paradoxes` inherent in the `naive` quantum-mechanical treatment. Using a self-adjoint extension method, we construct and study all possible self-adjoint operators (self-adjoint Hamiltonians) associated with a formal differential expression for the Calogero Hamiltonian. In particular, we discuss a spontaneous scale-symmetry breaking associated with self-adjoint extensions. A complete spectral analysis of all self-adjoint Hamiltonians is presented.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

Bjorling problem for timelike surfaces in the Lorentz-Minkowski space

We solve the Bjorling problem for timelike surfaces in the Lorentz-Minkowski space through a split-complex representation formula obtained for this kind of surface. Our approach uses the split-complex numbers and natural split-holomorphic extensions. As applications, we show that the minimal timelike surfaces of revolution as well as minimal ruled timelike surfaces can be characterized as solutions of certain adequate Bjorling problems in the Lorentz-Minkowski space. (C) 2010 Elsevier Inc. All rights reserved.