Search results for "Gauss"
showing 10 items of 701 documents
Dynamic Gaussian Graphical Models for Modelling Genomic Networks
2014
After sequencing the entire DNA for various organisms, the challenge has become understanding the functional interrelatedness of the genome. Only by understanding the pathways for various complex diseases can we begin to make sense of any type of treatment. Unfortunately, decyphering the genomic network structure is an enormous task. Even with a small number of genes the number of possible networks is very large. This problem becomes even more difficult, when we consider dynamical networks. We consider the problem of estimating a sparse dynamic Gaussian graphical model with \(L_1\) penalized maximum likelihood of structured precision matrix. The structure can consist of specific time dynami…
Operational Quantification of Continuous-Variable Correlations
2007
We quantify correlations (quantum and/or classical) between two continuous variable modes in terms of how many correlated bits can be extracted by measuring the sign of two local quadratures. On Gaussian states, such `bit quadrature correlations' majorize entanglement, reducing to an entanglement monotone for pure states. For non-Gaussian states, such as photonic Bell states, ideal and real de-Gaussified photon-subtracted states, and mixtures of pure Gaussian states, the bit correlations are shown to be a {\em monotonic} function of the negativity. This yields a feasible, operational way to quantitatively measure non-Gaussian entanglement in current experiments by means of direct homodyne d…
Automatic program for peak detection and deconvolution of multi-overlapped chromatographic signals
2005
Several interlinked algorithms for peak deconvolution by non-linear regression are presented. These procedures, together with the peak detection methods outlined in Part I, have allowed the implementation of an automatic method able to process multi-overlapped signals, requiring little user interaction. A criterion based on the evaluation of the multivariate selectivity of the chromatographic signal is used to auto-select the most efficient deconvolution procedure for each chromatographic situation. In this way, non-optimal local solutions are avoided in cases of high overlap, and short computation times are obtained in situations of high resolution. A new algorithm, fitting both the origin…
Exact Closed-Form Expressions for the Distribution, the Level-Crossing Rate, and the Average Duration of Fades of the Capacity of OSTBC-MIMO Channels
2009
Article from the journal: IEEE Transactions on Vehicular Technology Official site: http://dx.doi.org/10.1109/TVT.2008.927038 This paper deals with some important statistical properties of the channel capacity of multiple-input-multiple-output (MIMO) systems with orthogonal space-time block code (OSTBC) transmission. We assume that all the subchannels are uncorrelated. For OSTBC-MIMO systems, exact closed-form expressions are derived for the probability density function (PDF), the cumulative distribution function (CDF), the level-crossing rate (LCR), and the average duration of fades (ADF) of the channel capacity. Furthermore, it will be shown that these exact closed-form expressions can be …
Design of efficient codes for the AWGN channel based on decomposable binary lattices
1998
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.
Optimal Sampling Period and Required Number of Samples for OSTBC-MIMO Rayleigh Fading Channel Capacity Simulators
2014
The purpose of this paper is to contribute to the performance assessment of channel capacity simulators. Here, we consider the instantaneous capacity (also referred to as the mutual information) in orthogonal space-time block code (OSTBC) transceiver systems over multiple-input multiple-output (MIMO) Rayleigh fading channels. To ensure that the level-crossing rate (LCR) of the instantaneous capacity can efficiently and accurately be simulated, we derive closed-form approximate solutions to the optimal sampling period and the required number of samples to be generated. Several numerical examples will be presented to illustrate the usefulness of our procedure. It will also be shown that the d…
Alternative single-reference coupled cluster approaches for multireference problems: the simpler, the better.
2011
We report a general implementation of alternative formulations of single-reference coupled cluster theory (extended, unitary, and variational) with arbitrary-order truncation of the cluster operator. These methods are applied to compute the energy of Ne and the equilibrium properties of HF and C(2). Potential energy curves for the dissociation of HF and the BeH(2) model computed with the extended, variational, and unitary coupled cluster approaches are compared to those obtained from the multireference coupled cluster approach of Mukherjee et al. [J. Chem. Phys. 110, 6171 (1999)] and the internally contracted multireference coupled cluster approach [F. A. Evangelista and J. Gauss, J. Chem. …
Learning to Navigate in the Gaussian Mixture Surface
2021
In the last years, deep learning models have achieved remarkable generalization capability on computer vision tasks, obtaining excellent results in fine-grained classification problems. Sophisticated approaches based-on discriminative feature learning via patches have been proposed in the literature, boosting the model performances and achieving the state-of-the-art over well-known datasets. Cross-Entropy (CE) loss function is commonly used to enhance the discriminative power of the deep learned features, encouraging the separability between the classes. However, observing the activation map generated by these models in the hidden layer, we realize that many image regions with low discrimin…
Quadrature rules for qualocation
2003
Qualocation is a method for the numerical treatment of boundary integral equations on smooth curves which was developed by Chandler, Sloan and Wendland (1988-2000) [1,2]. They showed that the method needs symmetric J–point–quadrature rules on [0, 1] that are exact for a maximum number of 1–periodic functions The existence of 2–point–rules of that type was proven by Chandler and Sloan. For J ∈ {3, 4} such formulas have been calculated numerically in [2]. We show that the functions Gα form a Chebyshev–system on [0, 1/2] for arbitrary indices a and thus prove the existence of such quadrature rules for any J.
Monogamy Inequality for Distributed Gaussian Entanglement
2007
We show that for all n-mode Gaussian states of continuous variable systems, the entanglement shared among n parties exhibits the fundamental monogamy property. The monogamy inequality is proven by introducing the Gaussian tangle, an entanglement monotone under Gaussian local operations and classical communication, which is defined in terms of the squared negativity in complete analogy with the case of n-qubit systems. Our results elucidate the structure of quantum correlations in many-body harmonic lattice systems.