Local structure and magneto-transport in Sr2FeMoO6 oxides

Double perovskite oxides Sr2FeMoO6 have attracted a great interest for their peculiar magneto-transport properties, and, ill particular, for the large values of low-field magneto-resistance (MR) which remains elevated even at room temperature, thanks to their high Curie temperature (T-c > 400 K). These properties are strongly influenced by chemical cation disorder, that is by the relative arrangement of Fe and Mo on their sublattices: the regular alternation of Fe and Mo enhances the M R and saturation magnetization. On the contrary the disorder generally depresses the magnetization and worsen the MR response. In this work the X-ray absorption fine structure (XAFS) technique has been employed in order to probe the cation order from a local point of view. XAFS spectra were collected at the Fe and Mo K edges on Sr2FeMoO6 samples with different degree of long-range chemical order. The XAFS results prove that a high degree of short-range cation order is preserved, despite the different long-range order: the Fe-Mo correlations are always preferred over the Fe-Fe and Mo-Mo ones in the perfectly ordered as well as in highly disordered samples.

Segal-Bargmann transform and Paley-Wiener theorems on M(2)

We study the Segal-Bargmann transform on M(2). The range of this transform is characterized as a weighted Bergman space. In a similar fashion Poisson integrals are investigated. Using a Gutzmer's type formula we characterize the range as a class of functions extending holomorphically to an appropriate domain in the complexification of M(2). We also prove a Paley-Wiener theorem for the inverse Fourier transform.

Random matrices: Universality of ESDs and the circular law

Given an n x n complex matrix A, let mu(A)(x, y) := 1/n vertical bar{1 <= i <= n, Re lambda(i) <= x, Im lambda(i) <= y}vertical bar be the empirical spectral distribution (ESD) of its eigenvalues lambda(i) is an element of C, i = l, ... , n. We consider the limiting distribution (both in probability and in the almost sure convergence sense) of the normalized ESD mu(1/root n An) of a random matrix A(n) = (a(ij))(1 <= i, j <= n), where the random variables a(ij) - E(a(ij)) are i.i.d. copies of a fixed random variable x with unit variance. We prove a universality principle for such ensembles, namely, that the limit distribution in question is independent of the actual choice of x. In particular, in order to compute this distribution, one can assume that x is real or complex Gaussian. As a related result, we show how laws for this ESD follow from laws for the singular value distribution of 1/root n A(n) - zI for complex z. As a corollary, we establish the circular law conjecture (both almost surely and in probability), which asserts that mu(1/root n An) converges to the uniform measure on the unit disc when the a(ij) have zero mean.

Spectral Invariance of SG Pseudo-Differential Operators on L-P(R-n)

We prove the spectral invariance of SG pseudo-differential operators on L-P(R-n), 1 < p < infinity, by using the equivalence of ellipticity and Fredholmness of SG pseudo-differential operators on L-p(R-n), 1 < p < infinity. A key ingredient in the proof is the spectral invariance of SC pseudo-differential operators on L-2(R-n).

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.

In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs

We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Theta(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Theta(root n) time units. We further extend our approach to a network with noisy links. While the refresh rate remains Theta(1) time units per sample, the delay increases to Theta(root n log n). The number of transmissions in both cases is Theta(n) per histogram sample. The achieved Theta(1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of Theta(1/log n) for histogram computation in noiseless networks. We achieve this by operating in the supercritical thermodynamic regime where large pathways for communication build up, but the network may have more than one component. The largest component however will have an arbitrarily large fraction of nodes in order to enable approximate computation of the histogram to the desired level of accuracy. Operation in the supercritical thermodynamic regime also reduces energy consumption. A key step in the proof of our achievability result is the construction of a connected component having bounded degree and any desired fraction of nodes. This construction may also prove useful in other communication settings on the random geometric graph.

A note on resolving infeasibility in linear programs by constraint relaxation

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.

Current State of Domestic Concealed Wiring Practices in Bangalore, India

In a modernising world, building and construction trends in recent urban centres such as Bangalore, set precedence for developments in other urban centres of the country. Under such conditions, evaluating the current state of building practices could prove useful for identifying the likely nature of nationwide building trends. This paper comprises a study to evaluate the current state of domestic concealed wiring practices in the context of a modern urban centre area in India. Presently, concealed wiring is the predominant wiring method adopted for residences, both bungalows and apartments. A modern residential block in the city of Bangalore (India) was chosen as the study area. The study included extensive interaction and surveys amongst residents, professionals (architects and engineers) and site personnel (contractors and electricians). In addition, the study also included site verification on the state of wiring practices in the residential block. The study indicates that while aesthetics was the prime reason that dictated the choice of concealed wiring, its effectiveness as an appropriate and safe wiring method is severely compromised. Details of the study, results and recommendations are presented in this paper.

On Paley-Wiener Theorems for the Heisenberg Group

In this paper we prove two Paley-Wiener-type theorems for the Heisenberg group. One is for the group Fourier transform which is the analogue of the classical Paley-Wiener theorem. The other one is for the spectral projections associated to the sub-Laplacian

On the Milito-Cruz adaptive control scheme for Markov chains

Milito and Cruz have introduced a novel adaptive control scheme for finite Markov chains when a finite parametrized family of possible transition matrices is available. The scheme involves the minimization of a composite functional of the observed history of the process incorporating both control and estimation aspects. We prove the a.s. optimality of a similar scheme when the state space is countable and the parameter space a compact subset ofR.

Analogues of the Wiener-Tauberian and Schwartz theorems for radial functions on symmetric spaces

We prove a Wiener Tauberian theorem for the L-1 spherical functions on a semisimple Lie group of arbitrary real rank. We also establish a Schwartz-type theorem for complex groups. As a corollary we obtain a Wiener Tauberian type result for compactly supported distributions.

Transformation formula for exponential sums involving fourier coefficients of modular forms

In 1984 Jutila [5] obtained a transformation formula for certain exponential sums involving the Fourier coefficients of a holomorphic cusp form for the full modular group SL(2, Z). With the help of the transformation formula he obtained good estimates for the distance between consecutive zeros on the critical line of the Dirichlet series associated with the cusp form and for the order of the Dirichlet series on the critical line, [7]. In this paper we follow Jutila to obtain a transformation formula for exponential sums involving the Fourier coefficients of either holomorphic cusp forms or certain Maass forms for congruence subgroups of SL(2, Z) and prove similar estimates for the corresponding Dirichlet series.

Stochastic Approximation Algorithms for Constrained Optimization via Simulation

We develop four algorithms for simulation-based optimization under multiple inequality constraints. Both the cost and the constraint functions are considered to be long-run averages of certain state-dependent single-stage functions. We pose the problem in the simulation optimization framework by using the Lagrange multiplier method. Two of our algorithms estimate only the gradient of the Lagrangian, while the other two estimate both the gradient and the Hessian of it. In the process, we also develop various new estimators for the gradient and Hessian. All our algorithms use two simulations each. Two of these algorithms are based on the smoothed functional (SF) technique, while the other two are based on the simultaneous perturbation stochastic approximation (SPSA) method. We prove the convergence of our algorithms and show numerical experiments on a setting involving an open Jackson network. The Newton-based SF algorithm is seen to show the best overall performance.

An actor-critic algorithm with function approximation for discounted cost constrained Markov decision processes

We develop in this article the first actor-critic reinforcement learning algorithm with function approximation for a problem of control under multiple inequality constraints. We consider the infinite horizon discounted cost framework in which both the objective and the constraint functions are suitable expected policy-dependent discounted sums of certain sample path functions. We apply the Lagrange multiplier method to handle the inequality constraints. Our algorithm makes use of multi-timescale stochastic approximation and incorporates a temporal difference (TD) critic and an actor that makes a gradient search in the space of policy parameters using efficient simultaneous perturbation stochastic approximation (SPSA) gradient estimates. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal policy. (C) 2010 Elsevier B.V. All rights reserved.

Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks

Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.