903 resultados para Gaussian curvature
Resumo:
We show that as n changes, the characteristic polynomial of the n x n random matrix with i.i.d. complex Gaussian entries can be described recursively through a process analogous to Polya's urn scheme. As a result, we get a random analytic function in the limit, which is given by a mixture of Gaussian analytic functions. This suggests another reason why the zeros of Gaussian analytic functions and the Ginibre ensemble exhibit similar local repulsion, but different global behavior. Our approach gives new explicit formulas for the limiting analytic function.
Resumo:
Using van-der-Waals-corrected density functional theory calculations, we explore the possibility of engineering the local structure and morphology of high-surface-area graphene-derived materials to improve the uptake of methane and carbon dioxide for gas storage and sensing. We test the sensitivity of the gas adsorption energy to the introduction of native point defects, curvature, and the application of strain. The binding energy at topological point defect sites is inversely correlated with the number of missing carbon atoms, causing Stone-Wales defects to show the largest enhancement with respect to pristine graphene (similar to 20%). Improvements of similar magnitude are observed at concavely curved surfaces in buckled graphene sheets under compressive strain, whereas tensile strain tends to weaken gas binding. Trends for CO2 and CH4 are, similar, although CO2 binding is generally stronger by similar to 4 to 5 kJ mol(-1). However, the differential between the adsorption of CO2 and CH4 is much higher on folded graphene sheets and at concave curvatures; this could possibly be leveraged for CH4/CO2 flow separation and gasselective sensors.
Resumo:
Energy harvesting sensor nodes are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting green communication. In this paper, we focus on communicating reliably over an additive white Gaussian noise channel using such an energy harvesting sensor node. An important part of this paper involves appropriate modeling of energy harvesting, as done via various practical architectures. Our main result is the characterization of the Shannon capacity of the communication system. The key technical challenge involves dealing with the dynamic (and stochastic) nature of the (quadratic) cost of the input to the channel. As a corollary, we find close connections between the capacity achieving energy management policies and the queueing theoretic throughput optimal policies.
Three-dimensional localization of multiple acoustic sources in shallow ocean with non-Gaussian noise
Resumo:
In this paper, a low-complexity algorithm SAGE-USL is presented for 3-dimensional (3-D) localization of multiple acoustic sources in a shallow ocean with non-Gaussian ambient noise, using a vertical and a horizontal linear array of sensors. In the proposed method, noise is modeled as a Gaussian mixture. Initial estimates of the unknown parameters (source coordinates, signal waveforms and noise parameters) are obtained by known/conventional methods, and a generalized expectation maximization algorithm is used to update the initial estimates iteratively. Simulation results indicate that convergence is reached in a small number of (<= 10) iterations. Initialization requires one 2-D search and one 1-D search, and the iterative updates require a sequence of 1-D searches. Therefore the computational complexity of the SAGE-USL algorithm is lower than that of conventional techniques such as 3-D MUSIC by several orders of magnitude. We also derive the Cramer-Rao Bound (CRB) for 3-D localization of multiple sources in a range-independent ocean. Simulation results are presented to show that the root-mean-square localization errors of SAGE-USL are close to the corresponding CRBs and significantly lower than those of 3-D MUSIC. (C) 2014 Elsevier Inc. All rights reserved.
Resumo:
Smoothed functional (SF) schemes for gradient estimation are known to be efficient in stochastic optimization algorithms, especially when the objective is to improve the performance of a stochastic system However, the performance of these methods depends on several parameters, such as the choice of a suitable smoothing kernel. Different kernels have been studied in the literature, which include Gaussian, Cauchy, and uniform distributions, among others. This article studies a new class of kernels based on the q-Gaussian distribution, which has gained popularity in statistical physics over the last decade. Though the importance of this family of distributions is attributed to its ability to generalize the Gaussian distribution, we observe that this class encompasses almost all existing smoothing kernels. This motivates us to study SF schemes for gradient estimation using the q-Gaussian distribution. Using the derived gradient estimates, we propose two-timescale algorithms for optimization of a stochastic objective function in a constrained setting with a projected gradient search approach. We prove the convergence of our algorithms to the set of stationary points of an associated ODE. We also demonstrate their performance numerically through simulations on a queuing model.
On Precoding for Constant K-User MIMO Gaussian Interference Channel With Finite Constellation Inputs
Resumo:
This paper considers linear precoding for the constant channel-coefficient K-user MIMO Gaussian interference channel (MIMO GIC) where each transmitter-i (Tx-i) requires the sending of d(i) independent complex symbols per channel use that take values from fixed finite constellations with uniform distribution to receiver-i (Rx-i) for i = 1, 2, ..., K. We define the maximum rate achieved by Tx-i using any linear precoder as the signal-to-noise ratio (SNR) tends to infinity when the interference channel coefficients are zero to be the constellation constrained saturation capacity (CCSC) for Tx-i. We derive a high-SNR approximation for the rate achieved by Tx-i when interference is treated as noise and this rate is given by the mutual information between Tx-i and Rx-i, denoted as I(X) under bar (i); (Y) under bar (i)]. A set of necessary and sufficient conditions on the precoders under which I(X) under bar (i); (Y) under bar (i)] tends to CCSC for Tx-i is derived. Interestingly, the precoders designed for interference alignment (IA) satisfy these necessary and sufficient conditions. Furthermore, we propose gradient-ascentbased algorithms to optimize the sum rate achieved by precoding with finite constellation inputs and treating interference as noise. A simulation study using the proposed algorithms for a three-user MIMO GIC with two antennas at each node with d(i) = 1 for all i and with BPSK and QPSK inputs shows more than 0.1-b/s/Hz gain in the ergodic sum rate over that yielded by precoders obtained from some known IA algorithms at moderate SNRs.
Resumo:
We consider the Riemannian functional defined on the space of Riemannian metrics with unit volume on a closed smooth manifold M where R(g) and dv (g) denote the corresponding Riemannian curvature tensor and volume form and p a (0, a). First we prove that the Riemannian metrics with non-zero constant sectional curvature are strictly stable for for certain values of p. Then we conclude that they are strict local minimizers for for those values of p. Finally generalizing this result we prove that product of space forms of same type and dimension are strict local minimizer for for certain values of p.
Resumo:
We consider the Riemannian functional defined on the space of Riemannian metrics with unit volume on a closed smooth manifold M given by R-n/2(g) := integral(M) vertical bar R(g)vertical bar(n//2) dv(g) where R(g), dv(g) denote the Riemannian curvature and volume form corresponding to g. We show that there are locally symmetric spaces which are unstable critical points for this functional.
Resumo:
This paper addresses trajectory generation problem of a fixed-wing miniature air vehicle, constrained by bounded turn rate, to follow a given sequence of waypoints. An extremal path, named as g-trajectory, that transitions between two consecutive waypoint segments (obtained by joining two waypoints in sequence) in a time-optimal fashion is obtained. This algorithm is also used to track the maximum portion of waypoint segments with the desired shortest distance between the trajectory and the associated waypoint. Subsequently, the proposed trajectory is compared with the existing transition trajectory in the literature to show better performance in several aspects. Another optimal path, named as loop trajectory, is developed for the purpose of tracking the waypoints as well as the entire waypoint segments. This paper also proposes algorithms to generate trajectories in the presence of steady wind to meet the same objective as that of no-wind case. Due to low computational burden and simplicity in the design procedure, these trajectory generation approaches are implementable in real time for miniature air vehicles.
Resumo:
We present the first q-Gaussian smoothed functional (SF) estimator of the Hessian and the first Newton-based stochastic optimization algorithm that estimates both the Hessian and the gradient of the objective function using q-Gaussian perturbations. Our algorithm requires only two system simulations (regardless of the parameter dimension) and estimates both the gradient and the Hessian at each update epoch using these. We also present a proof of convergence of the proposed algorithm. In a related recent work (Ghoshdastidar, Dukkipati, & Bhatnagar, 2014), we presented gradient SF algorithms based on the q-Gaussian perturbations. Our work extends prior work on SF algorithms by generalizing the class of perturbation distributions as most distributions reported in the literature for which SF algorithms are known to work turn out to be special cases of the q-Gaussian distribution. Besides studying the convergence properties of our algorithm analytically, we also show the results of numerical simulations on a model of a queuing network, that illustrate the significance of the proposed method. In particular, we observe that our algorithm performs better in most cases, over a wide range of q-values, in comparison to Newton SF algorithms with the Gaussian and Cauchy perturbations, as well as the gradient q-Gaussian SF algorithms. (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
For a domain Omega in C and an operator T in B-n(Omega), Cowen and Douglas construct a Hermitian holomorphic vector bundle E-T over Omega corresponding to T. The Hermitian holomorphic vector bundle E-T is obtained as a pull-back of the tautological bundle S(n, H) defined over by Gr(n, H) a nondegenerate holomorphic map z bar right arrow ker(T - z), z is an element of Omega. To find the answer to the converse, Cowen and Douglas studied the jet bundle in their foundational paper. The computations in this paper for the curvature of the jet bundle are rather intricate. They have given a set of invariants to determine if two rank n Hermitian holomorphic vector bundle are equivalent. These invariants are complicated and not easy to compute. It is natural to expect that the equivalence of Hermitian holomorphic jet bundles should be easier to characterize. In fact, in the case of the Hermitian holomorphic jet bundle J(k)(L-f), we have shown that the curvature of the line bundle L-f completely determines the class of J(k)(L-f). In case of rank Hermitian holomorphic vector bundle E-f, We have calculated the curvature of jet bundle J(k)(E-f) and also obtained a trace formula for jet bundle J(k)(E-f).
Resumo:
Thin film transistors (TFTs) on elastomers promise flexible electronics with stretching and bending. Recently, there have been several experimental studies reporting the behavior of TFTs under bending and buckling. In the presence of stress, the insulator capacitance is influenced due to two reasons. The first is the variation in insulator thickness depending on the Poisson ratio and strain. The second is the geometric influence of the curvature of the insulator-semiconductor interface during bending or buckling. This paper models the role of curvature on TFT performance and brings to light an elegant result wherein the TFT characteristics is dependent on the area under the capacitance-distance curve. The paper compares models with simulations and explains several experimental findings reported in literature. (C) 2014 AIP Publishing LLC.
Resumo:
Grating Compression Transform (GCT) is a two-dimensional analysis of speech signal which has been shown to be effective in multi-pitch tracking in speech mixtures. Multi-pitch tracking methods using GCT apply Kalman filter framework to obtain pitch tracks which requires training of the filter parameters using true pitch tracks. We propose an unsupervised method for obtaining multiple pitch tracks. In the proposed method, multiple pitch tracks are modeled using time-varying means of a Gaussian mixture model (GMM), referred to as TVGMM. The TVGMM parameters are estimated using multiple pitch values at each frame in a given utterance obtained from different patches of the spectrogram using GCT. We evaluate the performance of the proposed method on all voiced speech mixtures as well as random speech mixtures having well separated and close pitch tracks. TVGMM achieves multi-pitch tracking with 51% and 53% multi-pitch estimates having error <= 20% for random mixtures and all-voiced mixtures respectively. TVGMM also results in lower root mean squared error in pitch track estimation compared to that by Kalman filtering.
Resumo:
Contact damage in curved interface nano-layeredmetal/nitride (150 (ZrN)/10 (Zr) nm) multilayer is investigated in order to understand the role of interface morphology on contact damage under indentation. A finite element method (FEM) model was formulated with different wavelengths of 1000 nm, 500 nm, 250 nm and common height of 50 nm, which gives insight on the effect of different curvature on stress field generated under indentation. Elastic-plastic properties were assigned to the metal layer and substrate while the nitride layer was assigned perfectly elastic properties. Curved interface multilayers show delamination along the metal/nitride interface and vertical cracks emanating from the ends of the delamination. FEM revealed the presence of tensile stress normal to the interface even under the contact, along with tensile radial stresses, both present at the valley part of the curve, which leads to vertical cracks associated with interfacial delamination. Stress enhancement was seen to be relatively insensitive to curvature. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
GaN nanorods were grown by plasma assisted molecular beam epitaxy on intrinsic Si (111) substrates which were characterized by powder X-ray diffraction, field emission scanning electron microscopy, and photoluminescence. The current-voltage characteristics of the GaN nanorods on Si (111) heterojunction were obtained from 138 to 493K which showed the inverted rectification behavior. The I-V characteristics were analyzed in terms of thermionic emission model. The temperature variation of the apparent barrier height and ideality factor along with the non-linearity of the activation energy plot indicated the presence of lateral inhomogeneities in the barrier height. The observed two temperature regimes in Richardson's plot could be well explained by assuming two separate Gaussian distribution of the barrier heights. (C) 2014 AIP Publishing LLC.