Sökresultat

Filtyp

Din sökning på "Fc coins Buyfc26coins.com is EA Sports official for FC 26 coins The service is affordable and quick..SVqU" gav 84569 sökträffar

Massive MIMO channels - measurements and models

Spatial multiplexing using Massive MIMO has been shown to have very promising properties, including large gains in spectral efficiency and several orders of magnitude lower transmit power, as compared to today's access schemes. The properties of massive MIMO have been studied mostly for theoretical channels with independent and identically distributed (i.i.d.) complex Gaussian coefficients. To eff

Robust Stability Analysis of Sparsely Interconnected Uncertain Systems

In this paper, we consider robust stability analysis of large-scale sparsely interconnected uncertain systems. By modeling the interconnections among the subsystems with integral quadratic constraints, we show that robust stability analysis of such systems can be performed by solving a set of sparse linear matrix inequalities. We also show that a sparse formulation of the analysis problem is equiv

Joint Positioning and Multipath Radio Channel Estimation and Prediction

This thesis investigates the topic of joint positioning and radio channel estimation and prediction. Both positioning and radio channel estimation have a long history of research with many publications but the combination of the two has so far at large been left unexplored. The reason for studying this topic is twofold: improvement of positioning and improvement of radio channel prediction. Positi

FLOPSYNC-2: efficient monotonic clock synchronisation

Time synchronisation is crucial for distributed systems, and particularly for Wireless Sensor Networks (WSNs), where each node is executing concurrent operations to achieve a real-time objective. However, synchronisation is quite difficult to achieve in WSNs, due to the unpredictable deployment conditions and to physical effects like thermal stress, that cause drifts in the local node clocks. As a

Accelerated gradient methods and dual decomposition in distributed model predictive control

We propose a distributed optimization algorithm for mixed L_1/L_2-norm optimization based on accelerated gradient methods using dual decomposition. The algorithm achieves convergence rate O(1/k^2), where k is the iteration number, which significantly improves the convergence rates of existing duality-based distributed optimization algorithms that achieve O(1/k). The performance of the developed al

Autonomous Framework for Segmenting Robot Trajectories of Manipulation Task

In manipulation tasks, motion trajectories are characterized by a set of key phases (i.e., motion primitives). It is therefore important to learn the motion primitives embedded in such tasks from a complete demonstration. In this paper, we propose a core framework that autonomously segments motion trajectories to support the learning of motion primitives. For this purpose, a set of segmentation po

Identification of Individualized Empirical Models of Carbohydrate and Insulin Effects on T1DM Blood Glucose Dynamics

One of the main limiting factors in improving glucose control for type 1 diabetes mellitus (T1DM) subjects is the lack of a precise description of meal and insulin intake effects on blood glucose. Knowing the magnitude and duration of such effects would be useful not only for patients and physicians, but also for the development of a controller targeting glycaemia regulation. Therefore, in this pa

Parallel and Distributed Vision Algorithms Using Dual Decomposition

We investigate dual decomposition approaches for optimization problems arising in low-level vision. Dual decomposition can be used to parallelize existing algorithms, reduce memory requirements and to obtain approximate solutions of hard problems. An extensive set of experiments are performed for a variety of application problems including graph cut segmentation, curvature regularization and more

Aspiration Learning in Coordination Games

We consider the problem of distributed convergence to efficient outcomes in coordination games through dynamics based on aspiration learning. Our first contribution is the characterization of the asymptotic behavior of the induced Markov chain of the iterated process in terms of an equivalent finite-state Markov chain. We then characterize explicitly the behavior of the proposed aspiration learnin

Improved modelling of atmospheric ammonia over Denmark using the coupled modelling system DAMOS

A local-scale Gaussian dispersion-deposition model (OML-DEP) has been coupled to a regional chemistry-transport model (DEHM with a resolution of approximately 6 km x 6 km over Denmark) in the Danish Ammonia Modelling System, DAMOS. Thereby, it has been possible to model the distribution of ammonia concentrations and depositions on a spatial resolution down to 400 m x 400 m for selected areas in De

Variations in tropospheric submicron particle size distributions across the European continent 2008-2009

Cluster analysis of particle number size distributions from background sites across Europe is presented. This generated a total of nine clusters of particle size distributions which could be further combined into two main groups, namely: a south-to-north category (four clusters) and a west-to-east category (five clusters). The first group was identified as most frequently being detected inside and

A Linear Framework for Region-Based Image Segmentation and Inpainting Involving Curvature Penalization

We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start from a new formulation of length-based optimization schemes, based on surface continuation constraints, and discuss the connections to existing schemes. The formulation is based on a cell complex and considers basic regions and bou

A variational formulation for interpolation of seismic traces with derivative information

We construct a variational formulation for the problem of interpolating seismic data in the case of missing traces. We assume that we have derivative information available at the traces. The variational problem is essentially the minimization of the integral over the smallest eigenvalue of the structure tensor associated with the interpolated data. This has the physical meaning of penalizing the l

Top-down isoprene emissions over tropical South America inferred from SCIAMACHY and OMI formaldehyde columns

We use formaldehyde (HCHO) vertical column measurements from the Scanning Imaging Absorption spectrometer for Atmospheric Chartography (SCIAMACHY) and Ozone Monitoring Instrument (OMI), and a nested-grid version of the GEOS-Chem chemistry transport model, to infer an ensemble of top-down isoprene emission estimates from tropical South America during 2006, using different model configurations and a

Data analysis tools for uncertainty quantification of inverse problems

We present exploratory data analysis methods to assess inversion estimates using examples based on l(2)- and l(1)-regularization. These methods can be used to reveal the presence of systematic errors such as bias and discretization effects, or to validate assumptions made on the statistical model used in the analysis. The methods include bounds on the performance of randomized estimators of a larg

Covariance Propagation and Next Best View Planning for 3D Reconstruction

This paper examines the potential benefits of applying next best view planning to sequential 3D reconstruction from unordered image sequences. A standard sequential structure-and-motion pipeline is extended with active selection of the order in which cameras are resectioned. To this end, approximate covariance propagation is implemented throughout the system, providing running estimates of the unc

Tighter Relaxations for Higher-Order Models based on Generalized Roof Duality

Many problems in computer vision can be turned into a large-scale boolean optimization problem, which is in general NP-hard. In this paper, we further develop one of the most successful approaches, namely roof duality, for approximately solving such problems for higher-order models. Two new methods that can be applied independently or in combination are investigated. The first one is based on cons

Generalized roof duality

The roof dual bound for quadratic unconstrained binary optimization is the basis for several methods for efficiently computing the solution to many hard combinatorial problems. It works by constructing the tightest possible lower-bounding submodular function, and instead of minimizing the original objective function, the relaxation is minimized. However, for higher-order problems the technique has