The Scattering Amplitude for the Schrödinger Equation with a Long-Range Potential

We consider the Schr?dinger operator with a long-range potential V(x) in the space . Our goal is to study spectral properties of the corresponding scattering matrix and a diagonal singularity of its kernel (the scattering amplitude). It turns out that in contrast to the short-range case the Dirac-function singularity of at the diagonal disappears and the spectrum of the scattering matrix covers the whole unit circle. For an asymptotically homogeneous function V(x) of order we show that typically , where the module w and the phase ψ are asymptotically homogeneous functions, as , of orders and , respectively. Leading terms of asymptotics of w and ψ at are calculated. In the case ρ=1 our results generalize (in the limit ) the well-known formula of Gordon and Mott. As a by-product of our considerations we show that the long-range scattering fits into the theory of smooth perturbations. This gives an elementary proof of existence and completeness of wave operators in the theory of long-range scattering. In this paper we concentrate on the case ρ>1/2 when the theory of pseudo-differential operators can be extensively used. Received: 29 January 1997 / Accepted: 6 May 1997     

Differential–algebraic equations in multibody system modeling

Numerical methods for the efficient integration of both stiff and nonstiff equations of motion of multibody systems having the form of differential-algebraic equations (DAE) of index 3 are discussed. Linear multi-step ABM and BDF methods are considered for the non-iterational integration of nonstiff DAE. The Park method is proposed for integration of stiff equations. This revised version was published online in June 2006 with corrections to the Cover Date.     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.     

Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems

In this paper, we compare two strategies for constructing linear programmingrelaxations for polynomial programming problems using aReformulation-Linearization Technique (RLT). RLT involves an automaticreformulation of the problem via the addition of certain nonlinear impliedconstraints that are generated by using the products of the simple boundingrestrictions (among other products), and a subsequent linearization based onvariable redefinitions. We prove that applying RLT directly to the originalpolynomial program produces a bound that dominates in the sense of being atleast as tight as the value obtained when RLT is applied to the jointcollection of all equivalent quadratic problems that could be constructed byrecursively defining additional variables as suggested by Shor.     

Weierstrass Points and Regular Maps

It was shown by G. A. Jones and the first author in [8] that underlying any map on a compact orientable surface S there is a natural complex structure making S into a Riemann surface. In this paper we consider regular maps and enquire about the Weierstrass points on the underlying Riemann surface. We are particularly interested to know when these are geometric, i.e. whether they lie at vertices, face-centres or edge-centres of the map.     

Distribution of melamine in polyester–melamine surface coatings cured under nonisothermal conditions

The influence of experimental cure parameters on the diffusion of reactive species in polyester–melamine thermoset coatings during curing has been investigated with X‐ray photoelectron spectroscopy and attenuated total reflectance Fourier transform infrared. The diffusion of melamine plays a vital role in the curing process and, therefore, in the ultimate properties of coatings. At a low (<20%) hexamethoxymethylmelamine (HMMM) crosslinker concentration, the matrix composition is uniform, but at high HMMM concentrations, excess HMMM rapidly segregates to the air–coating interface. The rate of migration is governed by the difference in the surface free energies of polyester and HMMM and the concentration gradient of HMMM between the bulk and the surface. An increased rate of energy absorption also increases the rate of migration of HMMM to the surface. A physical model has been proposed to explain this surface segregation phenomenon in terms of cocondensation and self‐condensation reactions. It suggests that an appropriate amount of melamine can be segregated on the surface and allowed to self‐condense to form a desired thickness of a melamine topcoat through the control of the binder composition and cure conditions. This technique can be implemented to apply a melamine topcoat during cure. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 83–91, 2004