Exact soliton solutions of spinor Bose-Einstein condensates

We study matter-wave solitons in Bose-Einstein condensates of ultracold gaseous atoms with spin degrees of freedom and present a class of exact solutions based on the inverse scattering method. The one-soliton solutions are classified with respect to the spin states. We analyze collisional effects between solitons in the same or different spin state(s), which reveals a very interesting possibility: we can manipulate the spin dynamics by controlling the parameters of colliding solitons.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

3D-TOFSIMS characterization of black spots in polymer light emitting diodes

The occurrence and formation of black spots areas in PolyLED devices has been studied by time-of-flight SIMS (TOFSIMS). The composition, shape and position of the black spots is visualised by three-dimensional (3D)-TOFSIMS depth-profiling. It has been established that the formation of non-emissive spots is due to the growth of aluminium oxide clusters at the AlBa/polymer interface. Electron injection in the black spots is lost by the resulting local increase of the resistivity of the cathode.     

Specific features of photoisomerization of provitamin D 3 in a nematic liquid crystal

Photoisomerization of provitamin D ₃ (7-dehydrocholesterol) in a nematic liquid crystal (ZLI-1695, Merck) is investigated in detail by UV absorption spectroscopy. It is found that dissolution of chiral molecules of provitamin D ₃ induces the cholesteric phase in a nematic. The spectral kinetics of photoisomerization in this phase changes significantly from that in an ethanol solution. A sharp nonmonotonic dependence of the increase in accumulation of trans isomer tachysterol in a liquid crystal matrix with a decrease in the induced cholesteric pitch from 2200 to 25 μm is revealed.     

C- and N-Amidotrichloroethylation of Azoles

1H-Pyrazoles, triazoles, and imidazoles in reaction with ethoxycarbonylimine and arylsulfonylimines of chloral yield addition products, corresponding 1-(1-amidotrichloroethyl)azoles. Derivatives of 1-alkylpyrazoles and pyrazolones react with chloral 4-chlorophenylsulfonylimine to furnish products of C-amidotrichloroethylation into position 4 of the azole ring.     

Applying Stochastic Algorithms to a Locomotive Scheduling Problem

This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.     

Initial-boundary value problems for incomplete singular perturbations of hyperbolic systems

The general problem studied has as a prototype the full non-linear Navier-Stokes equations for a slightly viscous compressible fluid including the heat transfer. The boundaries are of inflow-outflow type, i.e. non-characteristic, and the boundary conditions are the most general ones with any order of derivatives. It is assumed that the uniform Lopatinsky condition is satisfied. The goal is to prove uniform existence and boundedness of solution as the viscosity tends to zero and to justify the boundary layer asymptotics. The paper consists of two parts. In Part I the linear problem is studied. Here, uniform lower and higher order tangential estimates are derived and the existence of a solution is proved. The higher order estimates depend on the smoothness of coefficients; however this smoothness does not exceed the smoothness of the solution. In Part II the quasilinear problem is studied. It is assumed that for zero viscosity the overall initial-boundary value problem has a smooth solutionu ₀ in a time interval 0≦t≦T ₀. As a result the boundary laye, is weak and is uniformlyC ¹ bounded. This makes the linear theory applicable. an iteration scheme is set and proved to converge to the viscous solution. The convergence takes place for small viscosity and over the original time interval 0≦t≦T ₀.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Coverings of topological loops

In this paper, we show that in some cases, no proper covering of a locally compact group topologically generated by left translations of a topological loop can occur as the group topologically generated by left translations of a topological loop. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 22, Algebra and Geometry, 2004.