Quantum kinematics of Fermi-Dirac vacuum-plus-one-electron problem

Following Weisskopf, the kinematics of quantum mechanics is shown to lead to a modified charge distribution for a test electron embedded in the Fermi-Dirac vacuum with interesting consequences.

Anti-windup Schemes for Proportional Integral and Proportional Resonant Controller

Problems like windup or rollover arise in a PI controller working under saturation. Hence anti-windup schemes are necessary to minimize performance degradation.Similar situation may occur in a Proportional Resonant(PR)controller in the presence of a sustained error input.Several methods can be employed based on existing knowledge on PI controller to counter this problem.In this paper few such schemes are proposed and implemented in FPGA and MATLAB and from the obtained results their possible use and limitations have been studied.

An approximate algorithm for the minimal vertex nested polygon problem

Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms.

Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).

Component Inventory Costs in an Assembly Problem with Uncertain Supplier Lead-Times

We present a generic study of inventory costs in a factory stockroom that supplies component parts to an assembly line. Specifically, we are concerned with the increase in component inventories due to uncertainty in supplier lead-times, and the fact that several different components must be present before assembly can begin. It is assumed that the suppliers of the various components are independent, that the suppliers' operations are in statistical equilibrium, and that the same amount of each type of component is demanded by the assembly line each time a new assembly cycle is scheduled to begin. We use, as a measure of inventory cost, the expected time for which an order of components must be held in the stockroom from the time it is delivered until the time it is consumed by the assembly line. Our work reveals the effects of supplier lead-time variability, the number of different types of components, and their desired service levels, on the inventory cost. In addition, under the assumptions that inventory holding costs and the cost of delaying assembly are linear in time, we study optimal ordering policies and present an interesting characterization that is independent of the supplier lead-time distributions.

A note on the porous-wavemaker problem

A complete analytical solution is obtained, by using an integral transform method, for the porous-wavemaker problem, when the effect of surface tension is taken into account on the free surface of water of finite-depth in which surface waves are produced by small horizontal oscillations of a porous vertical plate. The final results are expressed in the form of convergent integrals as well as series and known results are reproduced when surface tension is neglected.

Algorithms for Colouring Random k-colourable Graphs

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k greater than or equal to 3. The best known polynomial time approximation algorithms require n(delta) (for a positive constant delta depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be ii-coloured almost surely in polynomial time. In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into ii colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) greater than or equal to n(-1+is an element of) where is an element of is a constant greater than 1/4.

Solid-state chemistry of high-temperature oxide superconductors:The experimental situation

High-temperature superconductivity in oxides of the type(La, Ln)2?xBax(Sr)xCuO4, Y(Ln)Ba2Cu3O7??, La3?xBa3+xCu6O14, and related systems is discussed with emphasis on aspects related to experimental solid-state chemistry. All of these oxides possess perovskite-related structures. Oxygen-excess and La-deficient La2CuO4 also exhibit superconductivity in the 20�40 K just as La2?xBax(Srx)CuO4; these oxides are orthorhombic in the superconductivity phase. The crucial role of oxygen stoichiometry in the superconductivity ofYBa2Cu3O7?? (Tc = 95 ± 5K) is examined; this oxide remains orthorhombic up to ? ? 0.6 and becomes tetragonal and nonsuperconducting beyond this value of ?. Oxygen stoichiometry in this and related oxides has to be understood in terms of structure and disorder. The structure of La3?xBa3+xCu6O14 is related to that of YBa2Cu3O7, the orthorhombic structure manifesting itself when the population of O1 oxygens (along the Cusingle bondOsingle bondCu chains) is preponderant compared to that of O5 oxygens (along thea-axis); nearly equal populations of O1 and O5 sites give rise to the tetragonal structure. A transition from a high-Tc (95 K) superconductivity regime to a low-Tc (not, vert, similar60 K) regime occurs in YBa2Cu3O7?? accompanying a change in ?. There is no evidence for Cu3+ in these nominally mixed valent copper oxides. Instead, holes are present on oxygens giving rise to O? or O2?2 species, the concentration of these species increasing with the lowering of temperature. Certain interesting aspects of the superconducting oxides such as domain or twin boundaries, Raman spectra, microwave absorption, and anomalous high-temperature resistivity drops are presented along with the important material parameters. Preparative aspects of the superconducting oxides are briefly discussed. Phase transitions seem to occur atTc as well as at not, vert, similar240 K in YBa2Cu3O7.

Steady compressible flow of granular materials through a wedge-shaped hopper: The smooth wall, radial gravity problem

A continuum model based on the critical state theory of soil mechanics is used to generate stress and density profiles, and to compute discharge velocities for the plane flow of cohesionless materials. Two types of yield loci are employed, namely, a yield locus with a corner, and a smooth yield locus. The yield locus with a corner leads to computational difficulties. For the smooth yield locus, results are found to be relatively insensitive to the shape of the yield locus, the location of the upper traction-free surface and the density specified on this surface. This insensitivity arises from the existence of asymptotic stress and density fields, to which the solution tends to converge on moving down the hopper. Numerical and approximate analytical solutions are obtained for these fields and the latter is used to derive an expression for the discharge velocity. This relation predicts discharge velocities to within 13% of the exact (numerical) values. While the assumption of incompressibility has been frequently used in the literature, it is shown here that in some cases, this leads to discharge velocities which are significantly higher than those obtained by the incorporation of density variation.

On the Fekete-Szego problem for concave univalent functions

We consider the Fekete-Szego problem with real parameter lambda for the class Co(alpha) of concave univalent functions. (C) 2010 Elsevier Inc. All rights reserved.