Search results for "OPTIMIZATION"
showing 10 items of 2824 documents
Energy Efficiency Optimization for Multi-cell Massive MIMO : Centralized and Distributed Power Allocation Algorithms
2021
This paper investigates the energy efficiency (EE) optimization in downlink multi-cell massive multiple-input multiple-output (MIMO). In our research, the statistical channel state information (CSI) is exploited to reduce the signaling overhead. To maximize the minimum EE among the neighbouring cells, we design the transmit covariance matrices for each base station (BS). Specifically, optimization schemes for this max-min EE problem are developed, in the centralized and distributed ways, respectively. To obtain the transmit covariance matrices, we first find out the closed-form optimal transmit eigenmatrices for the BS in each cell, and convert the original transmit covariance matrices desi…
Learning Automata Based Q-learning for Content Placement in Cooperative Caching
2019
An optimization problem of content placement in cooperative caching is formulated, with the aim of maximizing sum mean opinion score (MOS) of mobile users. Firstly, a supervised feed-forward back-propagation connectionist model based neural network (SFBC-NN) is invoked for user mobility and content popularity prediction. More particularly, practical data collected from GPS-tracker app on smartphones is tackled to test the accuracy of mobility prediction. Then, a learning automata-based Q-learning (LAQL) algorithm for cooperative caching is proposed, in which learning automata (LA) is invoked for Q-learning to obtain an optimal action selection in a random and stationary environment. It is p…
Design of Asymmetric Shift Operators for Efficient Decentralized Subspace Projection
2021
A large number of applications in decentralized signal processing includes projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. Accomplishing such a task in a centralized fashion in networks is prone to a number of issues such as large power consumption, congestion at certain nodes and suffers from robustness issues against possible node failures. Decentralized subspace projection is an alternative method to address those issues. Recently, it has been shown that graph filters (GFs) can be implemented to perform decentralized subspace projection. However, most of the existing methods have focused on designing GFs for symmetr…
From optimization to algorithmic differentiation: a graph detour
2021
This manuscript highlights the work of the author since he was nominated as "Chargé de Recherche" (research scientist) at Centre national de la recherche scientifique (CNRS) in 2015. In particular, the author shows a thematic and chronological evolution of his research interests:- The first part, following his post-doctoral work, is concerned with the development of new algorithms for non-smooth optimization.- The second part is the heart of his research in 2020. It is focused on the analysis of machine learning methods for graph (signal) processing.- Finally, the third and last part, oriented towards the future, is concerned with (automatic or not) differentiation of algorithms for learnin…
PORE Algorithm for Object Recognition in Photo Layers based on Parametric Characteristics of the Object Edges
2016
PORE stands for Photo-Object Recognition based on the Edges. Coincidentally, PORE means to examine something carefully and with due attention, so "we pore over the object layers in search for information about their characteristics with the aim at improving image recognition process". Therefore, this study presents a novel approach to object recognition based on the pattern by using photo layers and by defining the objects' specific characteristics. We select and introduce the parameters which determine a higher efficiency of image retrieval of the image objects. In this paper, we describe how the same photos are recognized in a process of classical retrieval compared to our model by analyz…
Optimisation des requêtes de similarité dans les espaces métriques répondant aux besoins des usagers
2012
The complexity of data stored in large databases has increased at very fast paces. Hence, operations more elaborated than traditional queries are essential in order to extract all required information from the database. Therefore, the interest of the database community in similarity search has increased significantly. Two of the well-known types of similarity search are the Range (Rq) and the k-Nearest Neighbor (kNNq) queries, which, as any of the traditional ones, can be sped up by indexing structures of the Database Management System (DBMS). Another way of speeding up queries is to perform query optimization. In this process, metrics about data are collected and employed to adjust the par…
Computing the Arrangement of Circles on a Sphere, with Applications in Structural Biology
2009
International audience; Balls and spheres are the simplest modeling primitives after affine ones, which accounts for their ubiquitousness in Computer Science and Applied Mathematics. Amongst the many applications, we may cite their prevalence when it comes to modeling our ambient 3D space, or to handle molecular shapes using Van der Waals models. If most of the applications developed so far are based upon simple geometric tests between balls, in particular the intersection test, a number of applications would obviously benefit from finer pieces of information. Consider a sphere $S_0$ and a list of circles on it, each such circle stemming from the intersection between $S_0$ and another spher…
Simplification of Models
2016
In practical applications the “complete” model, i.e., a model that contains all features that the experts in the application domain consider important, is often quite complicated and difficult to analyse mathematically. A straightforward numerical realization is often costly and may give very little qualitative understanding of the situation. It is therefore important to study if the model can be systematically simplified in order to enhance a qualitative analysis/understanding.
Further results on H<inf>&#x221E;</inf> control of switched linear time-delay systems
2012
In this note, we study the problems of stability analysis and H ∞ controller synthesis of discrete-time switched systems with time-varying delay. The system under consideration is firstly transformed into an interconnection system. Based on the system transformation and the scaled small gain theorem, the asymptotic stability of the original system is examined via the version of the bounded realness of the transformed forward system. The aim of the proposed approach is to reduce conservatism, which is made possible by a precise approximation of the time-varying delay and the input-output approach. The proposed stability condition is demonstrated to be much less conservative than most existin…
Fuzzy filter design for discrete-time delayed systems with distributed probabilistic sensor faults
2013
In this paper, the problem of distributed fuzzy filter design has been solved for T-S fuzzy systems with time-varying delays and multiple probabilistic packet losses. Our attention is paid to designing the distributed fuzzy filters to guarantee the filtering error dynamic system to be mean-square asymptotically stable with an average ℋ∞ performance. Sufficient conditions for the obtained filtering error dynamic system are proposed by applying a comparison model and the scaled small gain theorem. Based on the measurements and estimates of the system states for each sensor and its neighbors, the solution of the parameters of the distributed fuzzy filters is characterized in terms of the feasi…