Search results for "Information Theory"

showing 10 items of 664 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…

Basis (linear algebra)Computational complexity theoryComputer scienceGaussianFatorial Gaussian graphical modelsPenalized graphical models; Fatorial Gaussian graphical modelsType (model theory)Constraint (information theory)Matrix (mathematics)symbols.namesakeConvex optimizationsymbolsGraphical modelPenalized graphical modelSettore SECS-S/01 - StatisticaAlgorithm
researchProduct

MODELLING USER UNCERTAINTY FOR DISCLOSURE RISK AND DATA UTILITY

2002

In this paper we show how a simple model that captures user uncertainty can be used to define suitable measures of disclosure risk and data utility. The model generalizes previous results of Duncan and Lambert.1 We present several examples to illustrate how the new measures can be used to implement existing optimality criteria for the choice of the best form of data release.

Bayes estimatorArtificial IntelligenceControl and Systems EngineeringComputer scienceSimple (abstract algebra)Data miningcomputer.software_genreInformation theoryData releasecomputerSoftwareInformation SystemsInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
researchProduct

Robust Transmit Beamforming for Underlay D2D Communications on Multiple Channels

2020

Underlay device-to-device (D2D) communications lead to improvement in spectral efficiency by simultaneously allowing direct communication between the users and the existing cellular transmission. However, most works in resource allocation for D2D communication have considered single antenna transmission and with a focus on perfect channel state information (CSI). This work formulates a robust transmit beamforming design problem for maximizing the aggregate rate of all D2D pairs and cellular users (CUs). Assuming complex Gaussian distributed CSI error, our formulation guarantees probabilistically a signal to interference plus noise ratio (SINR) above a specified threshold. In addition, we al…

BeamformingMathematical optimizationComputer scienceProbabilistic logicSignal-to-interference-plus-noise ratio020302 automobile design & engineering020206 networking & telecommunicationsData_CODINGANDINFORMATIONTHEORY02 engineering and technologySpectral efficiency0203 mechanical engineeringChannel state informationRobustness (computer science)Computer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringResource allocationUnderlayVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550Computer Science::Information Theory2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
researchProduct

Reliable Underlay D2D Communications over Multiple Transmit Antenna Framework

2020

Robust beamforming is an efficient technique to guarantee the desired receiver performance in the presence of erroneous channel state information (CSI). However, the application of robust beamforming in underlay device-to-device (D2D) communication still requires further investigation. In this paper, we investigate resource allocation problem for underlay D2D communications by considering multiple antennas at the base station (BS) and at the transmitters of D2D pairs. The proposed design problem aims at maximizing the aggregate rate of all D2D pairs and cellular users (CUs) in downlink spectrum. In addition, our objective is augmented to achieve a fair allocation of resources across the D2D…

BeamformingMathematical optimizationOptimization problemComputer scienceChannel state informationTelecommunications linkComputer Science::Networking and Internet ArchitectureSignal-to-interference-plus-noise ratioData_CODINGANDINFORMATIONTHEORYRelaxation (approximation)UnderlayComputer Science::Information TheorySlack variableICC 2020 - 2020 IEEE International Conference on Communications (ICC)
researchProduct

Relay selection in FDD amplify-and-forward cooperative networks

2017

In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable sub-optimal multiple relay selection and beamforming optimization scheme based on the l1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming…

BeamformingOptimizationMathematical optimizationOptimization problemComputer scienceDuplex (telecommunications)02 engineering and technologyData_CODINGANDINFORMATIONTHEORY01 natural scienceslaw.inventionL1 normRelaylawBi-directional communicationBeamformingComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringAmplify and forward0101 mathematicsRelayingComputer Science::Information TheoryWireless network010102 general mathematicsComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsSemidefinite relaxation
researchProduct

Clustering-Assisted 3D Beamforming for Throughput Maximization in mmWave Networks

2021

Beamforming schemes have been widely used to improve network throughput in 5G mmWave networks. However, 3D beamforming schemes have hereto not been investigated in this context. In this work, a cluster-assisted 3D beamforming scheme is proposed to optimize the downtilt angle for network coverage and throughput maximization. User Equipment (UEs) are clustered based on inter-user and the inter-cluster distances. The interference is accounted from the adjacent clusters and thus frequency resources can be assigned to the non-adjacent clusters. Optimal downtilt angles are obtained for every cluster to maximize the throughput while considering the interference from adjacent clusters. 3D beam patt…

BeamformingUser equipmentComputer scienceComputer Science::Networking and Internet ArchitectureContext (language use)ThroughputMaximal-ratio combiningInterference (wave propagation)Cluster analysisAlgorithm5GComputer Science::Information Theory2021 IEEE International Conference on Communications Workshops (ICC Workshops)
researchProduct

Coordination in a multi-cell multi-antenna multi-user W-CDMA system: a beamforming approach

2008

The problem of designing joint power control and optimal beamforming (JPCOB) algorithms for the downlink of a coordinated multi-cell WCDMA system is considered throughout this paper. In this case, the JPCOB design is formulated as the problem of minimizing the total transmitted power in the coordinated multi-cell system, subject to a certain quality of service requirement for each user. In this paper, the performance of two JPCOB algorithms based on different beamforming approaches is compared over the coordinated multi-cell system. The first one, obtains local beamformers by means of the well-known virtual uplink-downlink duality. In contrast, the second algorithm implements multi-base bea…

BeamformingWSDMAComputer scienceCode division multiple accessApplied MathematicsReal-time computingEqualizerData_CODINGANDINFORMATIONTHEORYInterference (wave propagation)Computer Science ApplicationsSpread spectrumTelecomunicacióBase stationAsynchronous communicationTelecommunications linkComputer Science::Networking and Internet ArchitectureSistemes multimèdiaAlgorithm designElectrical and Electronic EngineeringAntenna (radio)Power controlComputer Science::Information Theory
researchProduct

Textual data compression in computational biology: Algorithmic techniques

2012

Abstract In a recent review [R. Giancarlo, D. Scaturro, F. Utro, Textual data compression in computational biology: a synopsis, Bioinformatics 25 (2009) 1575–1586] the first systematic organization and presentation of the impact of textual data compression for the analysis of biological data has been given. Its main focus was on a systematic presentation of the key areas of bioinformatics and computational biology where compression has been used together with a technical presentation of how well-known notions from information theory have been adapted to successfully work on biological data. Rather surprisingly, the use of data compression is pervasive in computational biology. Starting from…

Biological dataData Compression Theory and Practice Alignment-free sequence comparison Entropy Huffman coding Hidden Markov Models Kolmogorov complexity Lempel–Ziv compressors Minimum Description Length principle Pattern discovery in bioinformatics Reverse engineering of biological networks Sequence alignmentSettore INF/01 - InformaticaGeneral Computer ScienceKolmogorov complexityComputer scienceSearch engine indexingComputational biologyInformation theoryInformation scienceTheoretical Computer ScienceTechnical PresentationEntropy (information theory)Data compressionComputer Science Review
researchProduct

Analysis of the Characteristics in the Meudon Constrained Evolution Scheme

2007

A first analysis of the characteristics associated with the evolving modes in the constraint evolution scheme proposed by the Meudon group in 2004 is presented. The system is written in a first-order hyperbolic form and a so-called generalized Dirac gauge is considered. Applications to inner boundary conditions in an excised approach to black hole evolutions are discussed.

Black holeConstraint (information theory)PhysicsHistoryClassical mechanicsGroup (mathematics)Scheme (mathematics)Dirac (software)Mathematical analysisBoundary value problemGauge (firearms)Computer Science ApplicationsEducationJournal of Physics: Conference Series
researchProduct

On the Statistical Properties of Capacity Outage Intervals in OSTBC-MIMO Rayleigh Fading Channels

2016

This paper deals mainly with the study of the asymptotic probability density functions (PDFs) of the outage durations of the instantaneous capacity of orthogonal space-time block code (OSTBC) multiple-input multiple-output (MIMO) systems over Rayleigh channels. Drawing upon known statistical properties for the asymptotic behavior of chi-squared processes at low levels, we provide approximate solutions for the PDF, the cumulative distribution function (CDF), and the $k$ th-order moments of the outage intervals of the underlying capacity processes. Then, as an application of the derived PDF, the performance assessment of capacity simulators is reported. Following this, we introduce the newly …

Block codeAsymptotic analysisStochastic processApplied MathematicsCumulative distribution functionMIMO020302 automobile design & engineering020206 networking & telecommunicationsProbability density function02 engineering and technologyComputer Science ApplicationsChannel capacity0203 mechanical engineeringStatistics0202 electrical engineering electronic engineering information engineeringApplied mathematicsElectrical and Electronic EngineeringComputer Science::Information TheoryRayleigh fadingMathematicsIEEE Transactions on Wireless Communications
researchProduct