Vibrational analysis of the (B2P{cyrillic}→X2P{cyrillic}) system of NS

A few red degraded bands attributable to NS have been reported earlier by Fowler and Barker, Dressler and Barrow et al, and they occur in the same region (2300 to 2700 Å) as the bands of the known systems (C2∑+-X2P{cyrillic}) and (A2Δ-X2P{cyrillic}). Measurements made on the heads of some of these weak bands led Barrow et al. to believe that these bands may form a system analogous to the β-system of NO and be due to a2P{cyrillic}-2P{cyrillic} transition. The spectrum of NS has now been studied in a little more detail by means of an uncondensed discharge through dry nitrogen and sulphur vapour in the presence of argon and thirty three bands belonging to this system have been recorded in the region 2280 to 2760 Å. It has been found possible to represent the band heads by means of the equation {Mathematical expression}. Taking the lower state doublet interval as 223 cm-1, it is shown that the separation in the upper state is 94 cm-1. The ratio of the force constants in the upper and the ground states is found to be 0·39 and is nearly the same as that in the β-system of NO (0·30). The present vibrational analysis therefore supports the view that these new red degraded bands of NS arise from a (B2P{cyrillic}→X2P{cyrillic}) transition and the observed intensity distribution in the form of a wide parabola is also in qualitative agreement with what is expected from the moderately large Δ re (∼0·12Å) value.

Lattice vibrations and specific heat of zinc blende

The dispersion relations, frequency distribution function and specific heat of zinc blende have been calculated using Houston's method on (1) A short range force (S. R.) model of the type employed in diamond by Smith and (2) A long range model assuming an effective charge Ze on the ions. Since the elastic constant data on ZnS are not in agreement with one another the following values were used in these calculations: {Mathematical expression}. As compared to the results on the S. R. model, the Coulomb force causes 1. A splitting of the optical branches at (000) and a larger dispersion of these branches; 2. A rise in the acoustic frequency branches the effect being predominant in a transverse acoustic branch along [110]; 3. A bridging of the gap of forbidden frequencies in the S. R. model; 4. A reduction of the moments of the frequency distribution function and 5. A flattening of the Θ- T curve. By plotting (Θ/Θ0) vs. T., the experimental data of Martin and Clusius and Harteck are found to be in perfect coincidence with the curve for the short range model. The values of the elastic constants deduced from the ratio Θ0 (Theor)/Θ0 (Expt) agree with those of Prince and Wooster. This is surprising as several lines of evidence indicate that the bond in zinc blende is partly covalent and partly ionic. The conclusion is inescapable that the effective charge in ZnS is a function of the wave vector {Mathematical expression}.

Structural stability of slender aerospace vehicles: Part I Mathematical modeling

A detailed mechanics based model is developed to analyze the problem of structural instability in slender aerospace vehicles. Coupling among the rigid-body modes, the longitudinal vibrational modes and the transverse vibrational modes due to asymmetric lifting-body cross-section are considered. The model also incorporates the effects of aerodynamic pressure and the propulsive thrust of the vehicle. The model is one-dimensional, and it can be employed to idealized slender vehicles with complex shapes. Condition under which a flexible body with internal stress waves behaves like a perfect rigid body is derived. Two methods are developed for finite element discretization of the system: (1) A time-frequency Fourier spectral finite element method and (2) h-p finite element method. Numerical results using the above methods are presented in Part II of this paper. (C) 2010 Elsevier Ltd. All rights reserved.

A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.

The hard-particle model for a dense granular flow down an inclined plane

Perfectly hard particles are those which experience an infinite repulsive force when they overlap, and no force when they do not overlap. In the hard-particle model, the only static state is the isostatic state where the forces between particles are statically determinate. In the flowing state, the interactions between particles are instantaneous because the time of contact approaches zero in the limit of infinite particle stiffness. Here, we discuss the development of a hard particle model for a realistic granular flow down an inclined plane, and examine its utility for predicting the salient features both qualitatively and quantitatively. We first discuss Discrete Element simulations, that even very dense flows of sand or glass beads with volume fraction between 0.5 and 0.58 are in the rapid flow regime, due to the very high particle stiffness. An important length scale in the shear flow of inelastic particles is the `conduction length' delta = (d/(1 - e(2))(1/2)), where d is the particle diameter and e is the coefficient of restitution. When the macroscopic scale h (height of the flowing layer) is larger than the conduction length, the rates of shear production and inelastic dissipation are nearly equal in the bulk of the flow, while the rate of conduction of energy is O((delta/h)(2)) smaller than the rate of dissipation of energy. Energy conduction is important in boundary layers of thickness delta at the top and bottom. The flow in the boundary layer at the top and bottom is examined using asymptotic analysis. We derive an exact relationship showing that the a boundary layer solution exists only if the volume fraction in the bulk decreases as the angle of inclination is increased. In the opposite case, where the volume fraction increases as the angle of inclination is increased, there is no boundary layer solution. The boundary layer theory also provides us with a way of understanding the cessation of flow when at a given angle of inclination when the height of the layer is decreased below a value h(stop), which is a function of the angle of inclination. There is dissipation of energy due to particle collisions in the flow as well as due to particle collisions with the base, and the fraction of energy dissipation in the base increases as the thickness decreases. When the shear production in the flow cannot compensate for the additional energy drawn out of the flow due to the wall collisions, the temperature decreases to zero and the flow stops. Scaling relations can be derived for h(stop) as a function of angle of inclination.

The stress in a slowly sheared granular column

We report measurements of the wall stress in a granular material sheared in a cylindrical Couette cell, as a function of the distance from the free surface. Our results shows that when the material is static, all components of the stress saturate to constant values within a short distance from the free surface, in conformity with earlier experiments and theoretical predictions. When the material is sheared by rotating the inner cylinder at a constant rate, the stresses are remarkably altered. The radial normal stress does not saturate, and increases even more rapidly with depth than the linear hydrostatic pressure profile. The axial shear stress changes sign on shearing, and its magnitude increases with depth. These results are discussed in the context of the predictions of the classical and Cosserat plasticity theories.

A note on the Berry phase for systems having one degree of freedom

A one-dimensional arbitrary system with quantum Hamiltonian H(q, p) is shown to acquire the 'geometric' phase gamma (C)=(1/2) contour integral c(Podqo-qodpo) under adiabatic transport q to q+q+qo(t) and p to p+po(t) along a closed circuit C in the parameter space (qo(t), po(t)). The non-vanishing nature of this phase, despite only one degree of freedom (q), is due ultimately to the underlying non-Abelian Weyl group. A physical realisation in which this Berry phase results in a line spread is briefly discussed.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Gauge theory of a group of diffeomorphisms. III. The fiber bundle description

A new fiber bundle approach to the gauge theory of a group G that involves space‐time symmetries as well as internal symmetries is presented. The ungauged group G is regarded as the group of left translations on a fiber bundle G(G/H,H), where H is a closed subgroup and G/H is space‐time. The Yang–Mills potential is the pullback of the Maurer–Cartan form and the Yang–Mills fields are zero. More general diffeomorphisms on the bundle space are then identified as the appropriate gauged generalizations of the left translations, and the Yang–Mills potential is identified as the pullback of the dual of a certain kind of vielbein on the group manifold. The Yang–Mills fields include a torsion on space‐time.

Generalized Burgers equations and Euler–Painlevé transcendents. III

It was proposed earlier [P. L. Sachdev, K. R. C. Nair, and V. G. Tikekar, J. Math. Phys. 27, 1506 (1986); P. L. Sachdev and K. R. C. Nair, ibid. 28, 977 (1987)] that the Euler–Painlevé equations  y(d2y/dη2)+a(dy/dη)2 +f(η)y(dy/dη)+g(η)y2+b(dy/dη) +c=0 represent generalized Burgers equations (GBE’s) in the same way as Painlevé equations represent the Korteweg–de Vries type of equations. The earlier studies were carried out in the context of GBE’s with damping and those with spherical and cylindrical symmetry. In the present paper, GBE’s with variable coefficients of viscosity and those with inhomogeneous terms are considered for their possible connection to Euler–Painlevé equations. It is found that the Euler–Painlevé equation, which represents the GBE ut+uβux=(δ/2)g(t)uxx, g(t)=(1+t)n, β>0, has solutions, which either decay or oscillate at η=±∞, only when −1

Instructional aid for tactical wargame model

A tactical gaming model for wargame play between two teams A and B through a control unit C has been developed, which can be handled using IBM personal computers (XT and AT models) having a local area network facility. This simulation model involves communication between the teams involved, logging and validation of the actions of the teams by the control unit. The validation procedure uses statistical and also monte carlo techniques. This model has been developed to evaluate the planning strategies of the teams involved. This application software using about 120 files has been developed in BASIC, DBASE and the associated network software. Experience gained in the instruction courses using this model will also be discussed.