Two-Impurity Kondo Problem

The two-impurity Kondo problem is studied by use of perturbative scaling techniques. The physics is determined by the interplay between the Ruderman-Kittel-Kasuya-Yosida (RKKY) interaction between the two impurity spins and the Kondo effect. In particular, for a strong ferromagnetic RKKY interaction the susceptibility exhibits three structures as the temperature is lowered, corresponding to the ferromagnetic locking together of the two impurity spins followed by a two-stage freezing out of their local moments by the conduction electrons due to the Kondo effect.

The problem of liquid droplet combustion-reexamination

The simple quasi-steady analysis of the combustion of a liquid fuel droplet in an oxidising atmosphere provides unsatisfactory explanations for several experimental observations. It's prediction of values for the burning constant (K), the flame-to-droplet diameter ratio ( ) and the flame temperature (Tf) have been found to be amgibuous if not completely inaccurate. A critical survey of the literature has led us to a detailed examination of the effects of unsteadiness and variable properties. The work published to date indicates that the gas-phase unsteadiness is relatively short and therefore quite insignificant.A new theoretical analysis based on heat transfer within the droplet is presented here. It shows that the condensed-phase unsteadiness lasts for about 20â??25% of the total burning time. It is concluded that the discrepancies between experimental observations and the predictions of the constant-property quasi-steady analysis cannot be attributed either to gas-phase or condensed-phase unsteadiness.An analytical model of quasi-steady droplet combustion with variable thermodynamic and transport properties and non-unity Lewis numbers will be examined. Further findings reveal a significant improvement in the prediction of combustion parameters, particularly of K, when consideration is given to variations of cp and λ with the temperature and concentrations of several species. Tf is accurately predicted when the required conditions of incomplete combustion or low ( ) at the flame are met. Further refinement through realistic Lewis numbers predicts ( ) meaningfully.

Integrating strong and weak discontinuities without integration subcells and example applications in an XFEM/GFEM framework

Partition of unity methods, such as the extended finite element method, allows discontinuities to be simulated independently of the mesh (Int. J. Numer. Meth. Engng. 1999; 45:601-620). This eliminates the need for the mesh to be aligned with the discontinuity or cumbersome re-meshing, as the discontinuity evolves. However, to compute the stiffness matrix of the elements intersected by the discontinuity, a subdivision of the elements into quadrature subcells aligned with the discontinuity is commonly adopted. In this paper, we use a simple integration technique, proposed for polygonal domains (Int. J. Nuttier Meth. Engng 2009; 80(1):103-134. DOI: 10.1002/nme.2589) to suppress the need for element subdivision. Numerical results presented for a few benchmark problems in the context of linear elastic fracture mechanics and a multi-material problem show that the proposed method yields accurate results. Owing to its simplicity, the proposed integration technique can be easily integrated in any existing code. Copyright (C) 2010 John Wiley & Sons, Ltd.

Uniformly valid analytical solution to the problem of a decaying shock wave

An explicit representation of an analytical solution to the problem of decay of a plane shock wave of arbitrary strength is proposed. The solution satisfies the basic equations exactly. The approximation lies in the (approximate) satisfaction of two of the Rankine-Hugoniot conditions. The error incurred is shown to be very small even for strong shocks. This solution analyses the interaction of a shock of arbitrary strength with a centred simple wave overtaking it, and describes a complete history of decay with a remarkable accuracy even for strong shocks. For a weak shock, the limiting law of motion obtained from the solution is shown to be in complete agreement with the Friedrichs theory. The propagation law of the non-uniform shock wave is determined, and the equations for shock and particle paths in the (x, t)-plane are obtained. The analytic solution presented here is uniformly valid for the entire flow field behind the decaying shock wave.

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints

This article considers a semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC) defined as a semi-infinite mathematical programming problem with complementarity constraints. We establish necessary and sufficient optimality conditions for the (SIMPEC). We also formulate Wolfe- and Mond-Weir-type dual models for (SIMPEC) and establish weak, strong and strict converse duality theorems for (SIMPEC) and the corresponding dual problems under invexity assumptions.

An Approximate Solution Of One-Dimensional Piston Problem

A new theory of shock dynamics has been developed in the form of a finite number of compatibility conditions along shock rays. It has been used to study the growth or decay of shock strength for accelerating or decelerating piston starting with a nonzero piston velocity. The results show good agreement with those obtained by Harten's high resolution TVD scheme.

A Quasi-Newton Adaptive Algorithm for Generalized Symmetric Eigenvalue Problem

In this paper, we first recast the generalized symmetric eigenvalue problem, where the underlying matrix pencil consists of symmetric positive definite matrices, into an unconstrained minimization problem by constructing an appropriate cost function, We then extend it to the case of multiple eigenvectors using an inflation technique, Based on this asymptotic formulation, we derive a quasi-Newton-based adaptive algorithm for estimating the required generalized eigenvectors in the data case. The resulting algorithm is modular and parallel, and it is globally convergent with probability one, We also analyze the effect of inexact inflation on the convergence of this algorithm and that of inexact knowledge of one of the matrices (in the pencil) on the resulting eigenstructure. Simulation results demonstrate that the performance of this algorithm is almost identical to that of the rank-one updating algorithm of Karasalo. Further, the performance of the proposed algorithm has been found to remain stable even over 1 million updates without suffering from any error accumulation problems.

Integral Formulation of the Problem of Current Distribution in Compulsator Wires of Electromagnetic Launchers and Railguns

Compulsators are power sources of choice for use in electromagnetic launchers and railguns. These devices hold the promise of reducing unit costs of payload to orbit. In an earlier work, the author had calculated the current distribution in compulsator wires by considering the wire to be split into a finite number of separate wires. The present work develops an integral formulation of the problem of current distribution in compulsator wires which leads to an integrodifferential equation. Analytical solutions, including those for the integration constants, are obtained in closed form. The analytical solutions present a much clearer picture of the effect of various input parameters on the cross-sectional current distribution and point to ways in which the desired current density distribution can be achieved. Results are graphically presented and discussed, with particular reference to a 50-kJ compulsator in Bangalore. Finite-element analysis supports the results.

Molecular theory for the effects of specific solute-solvent interaction on the diffusion of a solute particle in a molecular liquid

An understanding of the effect of specific solute-solvent interactions on the diffusion of a solute probe is a long standing problem of physical chemistry. In this paper a microscopic treatment of this effect is presented. The theory takes into account the modification of the solvent structure around the solute due to this specific interaction between them. It is found that for strong, attractive interaction, there is an enhanced coupling between the solute and the solvent dynamic modes (in particular, the density mode), which leads to a significant increase in the friction on the solute. The diffusion coefficient of the solute is found to depend strongly and nonlinearly on the magnitude of the attractive interaction. An interesting observation is that specific solute-solvent interaction can induce a crossover from a sliplike to a sticklike diffusion. In the limit of strong attractive interaction, we recover a dynamic version of the solvent-berg picture. On the other hand, for repulsive interaction, the diffusion coefficient of the solute increases. These results are in qualitative agreement with recent experimental observations.

The Implication Problem for Functional and Multivalued Dependencies

Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.

Quantum first-passage problem

Formulation of quantum first passage problem is attempted in terms of a restricted Feynman path integral that simulates an absorbing barrier as in the corresponding classical case. The positivity of the resulting probability density, however, remains to be demonstrated.

A simplified approach to a three-part Wiener-Hopf problem arising in diffraction theory

A direct and simple approach, utilizing Watson's lemma, is presented for obtaining an approximate solution of a three-part Wiener-Hopf problem associated with the problem of diffraction of a plane wave by a soft strip.

Classification and rating of strong-motion earthquake records

Ninety-two strong-motion earthquake records from the California region, U.S.A., have been statistically studied using principal component analysis in terms of twelve important standardized strong-motion characteristics. The first two principal components account for about 57 per cent of the total variance. Based on these two components the earthquake records are classified into nine groups in a two-dimensional principal component plane. Also a unidimensional engineering rating scale is proposed. The procedure can be used as an objective approach for classifying and rating future earthquakes.