Valley splitting in Si/Si1-xGex heterostructures

We show that the alloy disorder potential can be a possible cause for the valley splitting observed in the Si/Si1-xGex heterostructures at high magnetic fields and low electron densities.

A Novel Operator-Splitting Technique for One-Dimensional Laminar Premixed Flames

This paper is concerned the calculation of flame structure of one-dimensional laminar premixed flames using the technique of operator-splitting. The technique utilizes an explicit method of solution with one step Euler for chemistry and a novel probabilistic scheme for diffusion. The relationship between diffusion phenomenon and Gauss-Markoff process is exploited to obtain an unconditionally stable explicit difference scheme for diffusion. The method has been applied to (a) a model problem, (b) hydrazine decomposition, (c) a hydrogen-oxygen system with 28 reactions with constant Dρ 2 approximation, and (d) a hydrogen-oxygen system (28 reactions) with trace diffusion approximation. Certain interesting aspects of behaviour of the solution with non-unity Lewis number are brought out in the case of hydrazine flame. The results of computation in the most complex case are shown to compare very favourably with those of Warnatz, both in terms of accuracy of results as well as computational time, thus showing that explicit methods can be effective in flame computations. Also computations using the Gear-Hindmarsh for chemistry and the present approach for diffusion have been carried out and comparison of the two methods is presented.

Ce0.67Cr0.33O2.11: A New Low-Temperature O-2 Evolution Material and H-2 Generation Catalyst by Thermochemical Splitting of Water

Ce0.67Cr0.33O2.11 was synthesized by hydrothermal method using diethylenetriamine as complexing agent (Chem. Mater. 2008, 20, 7268). Ce0.67Cr0.33O2.11 being the only compound likes UO2+delta to have excess oxygen, it releases a large proportion of its lattice oxygen (0.167 M [O]/mole of compound) at relatively low temperature (465 degrees C) directly and it has been utilized for generation of H-2 by thermo-splitting of water. An almost stoichiometric amount of H-2 (0.152 M/Mole of compound) is generated at much lower temperature (65 degrees C). There is an almost comparable amount of oxygen release and hydrogen generation over this material at very low temperature comparedto other CeO2-MOx (Mn, Fe, Cu, and Ni) mixed-oxide solid solutions (O-2 evolution >= 1300 degrees C and H-2 generation at 1000 degrees C). The reversible nature of oxygen release and intake of this material is attributed to its fluorite Structure and coupling between the Ce4+/Ce3+ and Cr4+/6+/Cr3+ redox couples. Compound shows reversible oxygen release and intake by H2O absorption and subsequent hydrogen release to gain parent structure and hence this material can be utilized for generation of H-2 at very low temperature by thermo-chemical splitting of water.

Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.

PVU and wave-particle splitting schemes for Euler equations of gas dynamics

A new way of flux-splitting, termed as the wave-particle splitting is presented for developing upwind methods for solving Euler equations of gas dynamics. Based on this splitting, two new upwind methods termed as Acoustic Flux Vector Splitting (AFVS) and Acoustic Flux Difference Splitting (AFDS) methods are developed. A new Boltzmann scheme, which closely resembles the wave-particle splitting, is developed using the kinetic theory of gases. This method, termed as Peculiar Velocity based Upwind (PVU) method, uses the concept of peculiar velocity for upwinding. A special feature of all these methods that the unidirectional and multidirectional parts of the flux vector are treated separately. Extensive computations done using these schemes demonstrate the soundness of the ideas.

Novel geodesic splitting on paraboloid of revolution with applications to ray-theoretic analysis

Computer simulations have shown a novel geodesic splitting on the paraboloid of revolution leading to a multiplicity of surface ray paths. Such a phenomenon would have wide ramifications for wave propagation problems in general, besides applications in target-detection problems and the computational requirements of ray-theoretic formulations such as the UTD, in computing the antenna characteristics in the high-frequency domain.

KFVS (Kinetic Flux Vector Splitting) on moving grids for unsteady aerodynamics

Accurate numerical solutions to the problems in fluid-structure (aeroelasticity) interaction are becoming increasingly important in recent years. The methods based on FCD (Fixed Computational Domain) and ALE (Alternate Lagrangian Eulerian) to solve such problems suffer from numerical instability and loss of accuracy. They are not general and can not be extended to the flowsolvers on unstructured meshes. Also, global upwind schemes can not be used in ALE formulation thus leads to the development of flow solvers on moving grids. The KFVS method has been shown to be easily amenable on moving grids required in unsteady aerodynamics. The ability of KFMG (Kinetic Flux vector splitting on Moving Grid) Euler solver in capturing shocks, expansion waves with small and very large pressure ratios and contact discontinuities has been demonstrated.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Opportunistic splitting for scheduling via stochastic approximation

We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Modified kinetic flux vector splitting (m-KFVS) method for compressible flows

To resolve many flow features accurately, like accurate capture of suction peak in subsonic flows and crisp shocks in flows with discontinuities, to minimise the loss in stagnation pressure in isentropic flows or even flow separation in viscous flows require an accurate and low dissipative numerical scheme. The first order kinetic flux vector splitting (KFVS) method has been found to be very robust but suffers from the problem of having much more numerical diffusion than required, resulting in inaccurate computation of the above flow features. However, numerical dissipation can be reduced by refining the grid or by using higher order kinetic schemes. In flows with strong shock waves, the higher order schemes require limiters, which reduce the local order of accuracy to first order, resulting in degradation of flow features in many cases. Further, these schemes require more points in the stencil and hence consume more computational time and memory. In this paper, we present a low dissipative modified KFVS (m-KFVS) method which leads to improved splitting of inviscid fluxes. The m-KFVS method captures the above flow features more accurately compared to first order KFVS and the results are comparable to second order accurate KFVS method, by still using the first order stencil. (C) 2011 Elsevier Ltd. All rights reserved.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].

An operator-splitting finite element method for the efficient parallel solution of multidimensional population balance systems

A finite element method for solving multidimensional population balance systems is proposed where the balance of fluid velocity, temperature and solute partial density is considered as a two-dimensional system and the balance of particle size distribution as a three-dimensional one. The method is based on a dimensional splitting into physical space and internal property variables. In addition, the operator splitting allows to decouple the equations for temperature, solute partial density and particle size distribution. Further, a nodal point based parallel finite element algorithm for multi-dimensional population balance systems is presented. The method is applied to study a crystallization process assuming, for simplicity, a size independent growth rate and neglecting agglomeration and breakage of particles. Simulations for different wall temperatures are performed to show the effect of cooling on the crystal growth. Although the method is described in detail only for the case of d=2 space and s=1 internal property variables it has the potential to be extendable to d+s variables, d=2, 3 and s >= 1. (C) 2011 Elsevier Ltd. All rights reserved.