PureSU(2) gauge field

The general structure of the pureSU(2) gauge potentials is calculated in detail. It is shown that the expansion of the gauge potentials about nonvanishing pure gauge potentials gives rise to new effects with confinement character.     

Three Electrons in a Two-Dimensional Parabolic Trap: The Relative Motion Solution

In agreement with the Kohn theorem the relative motion (rel) of three electrons in a two-dimensional parabolic trap separates from the centre-of-mass (CM) motion. By introducing new coordinates the Hamiltonian for relative motion in the approximation of non-interacting electrons can be taken to the normal form. The eigenstates of the normalized Hamiltonian are products of the Fock-Darwin states for normal modes. The energy levels for relative motion are obtained by diagonalizing the exact Hamiltonian in the eigenbasis for the non-interacting case. In this basis the interaction matrix elements can be obtained in the analytical form. Since the rank of the Hamiltonian matrix is significantly reduced, the calculations are faster and more accurate than those for the full (CM + rel) motion. This advantage is especially important for the calculations of excited states and the analysis of energy spectra.     

On Quantum Team Games

Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied.     

Lagrangian and Eulerian models for simulating turbulent dispersion and coalescence of droplets within a spray

Lagrangian and Eulerian modelling approaches are compared for simulating turbulent dispersion and coalescence of droplets within a spray. Both models predict similar droplet dispersion rates and shifts in droplet size distribution due to coalescence within the spray, over a wide range of droplet and gas flows, and for sprays with different droplet-size distributions at the nozzle exit. The computer time required for simulating coalescence within a steady axisymmetric spray is of a similar order of magnitude regardless of which formulation, Eulerian or Lagrangian, is adopted. However, the Lagrangian formulation is more practical in terms of the range of applicability and ease of implementation.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Effects of sputter deposition parameters and post-deposition annealing on the electrical characteristics of LaAlO3 dielectric films on Si

The influence of processing parameters on the electrical characteristics of RuO₂/LaAlO₃/Si metal-oxide-semiconductor structures was investigated. In particular, the sputtering regime during deposition of LaAlO₃ on Si and the atmosphere used in the post-deposition annealing step were addressed by determining capacitance-voltage and gate current-voltage characteristics. These results were correlated with compositional information obtained by Rutherford backscattering spectrometry and nuclear reaction analysis. A post-deposition annealing step in oxygen at 600 °C resulted in better electrical characteristics of the final structure as compared to the same treatment performed in nitrogen. This result is explained by oxygen ability to heal oxygen vacancies in the LaAlO₃ film, especially at the dielectric/semiconductor interface region. A thermalized sputtering regime during deposition of LaAlO₃ on Si leads to capacitors with electrical characteristics superior to those deposited in ballistic regime. PACS 77.84.Dy; 81.15.Cd; 81.40.Gh; 73.40.Qv; 82.80.Yc     

Structural and electronic properties of graphite layers grown on SiC(0 0 0 1)

Photoelectron spectroscopy, low-energy electron diffraction, and scanning probe microscopy were used to investigate the electronic and structural properties of graphite layers grown by solid state graphitization of SiC(0 0 0 1) surfaces. The process leads to well-ordered graphite layers which are rotated against the substrate lattice by 30°. On on-axis 6H-SiC(0 0 0 1) substrates we observe graphitic layers with up to several 100 nm wide terraces. ARUPS spectra of the graphite layers grown on on-axis 6H-SiC(0 0 0 1) surfaces are indicative of a well-developed band structure. For the graphite/n-type 6H-SiC(0 0 0 1) layer system we observe a Schottky barrier height of ?_B,n = 0.3 ± 0.1 eV. ARUPS spectra of graphite layers grown on 8° off-axis oriented 4H-SiC(0 0 0 1) show unique replicas which are explained by a carpet-like growth mode combined with a step bunching of the substrate.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.