7,132 research outputs found
Robust mean absolute deviation problems on networks with linear vertex weights
This article deals with incorporating the mean absolute
deviation objective function in several robust single facility
location models on networks with dynamic evolution
of node weights, which are modeled by means of linear
functions of a parameter. Specifically, we have considered
two robustness criteria applied to the mean absolute
deviation problem: the MinMax criterion, and the MinMax
regret criterion. For solving the corresponding optimization
problems, exact algorithms have been proposed and
their complexities have been also analyzed.Ministerio de Ciencia e Innovación MTM2007-67433-C02-(01,02)Ministerio de Ciencia e Innovación MTM2009-14243Ministerio de Ciencia e Innovación MTM2010-19576-C02-(01,02)Ministerio de Ciencia e Innovación DE2009-0057Junta de Andalucía P09-TEP-5022Junta de Andalucía FQM-584
Improved Distributed Estimation Method for Environmental\ud time-variant Physical variables in Static Sensor Networks
In this paper, an improved distributed estimation scheme for static sensor networks is developed. The scheme is developed for environmental time-variant physical variables. The main contribution of this work is that the algorithm in [1]-[3] has been extended, and a filter has been designed with weights, such that the variance of the estimation errors is minimized, thereby improving the filter design considerably\ud
and characterizing the performance limit of the filter, and thereby tracking a time-varying signal. Moreover, certain parameter optimization is alleviated with the application of a particular finite impulse response (FIR) filter. Simulation results are showing the effectiveness of the developed estimation algorithm
Modeling of the Acute Toxicity of Benzene Derivatives by Complementary QSAR Methods
A data set containing acute toxicity values (96-h LC50) of 69 substituted benzenes for
fathead minnow (Pimephales promelas) was investigated with two Quantitative Structure-
Activity Relationship (QSAR) models, either using or not using molecular descriptors,
respectively. Recursive Neural Networks (RNN) derive a QSAR by direct treatment of the
molecular structure, described through an appropriate graphical tool (variable-size labeled
rooted ordered trees) by defining suitable representation rules. The input trees are encoded by
an adaptive process able to learn, by tuning its free parameters, from a given set of structureactivity
training examples. Owing to the use of a flexible encoding approach, the model is
target invariant and does not need a priori definition of molecular descriptors. The results
obtained in this study were analyzed together with those of a model based on molecular
descriptors, i.e. a Multiple Linear Regression (MLR) model using CROatian MultiRegression
selection of descriptors (CROMRsel). The comparison revealed interesting similarities that
could lead to the development of a combined approach, exploiting the complementary
characteristics of the two approaches
How to Solve Classification and Regression Problems on High-Dimensional Data with a Supervised Extension of Slow Feature Analysis
Supervised learning from high-dimensional data, e.g., multimedia data, is a challenging task. We propose an extension of slow feature analysis (SFA) for supervised dimensionality reduction called graph-based SFA (GSFA). The algorithm extracts a label-predictive low-dimensional set of features that can be post-processed by typical supervised algorithms to generate the final label or class estimation. GSFA is trained with a so-called training graph, in which the vertices are the samples and the edges represent similarities of the corresponding labels. A new weighted SFA optimization problem is introduced, generalizing the notion of slowness from sequences of samples to such training graphs. We show that GSFA computes an optimal solution to this problem in the considered function space, and propose several types of training graphs. For classification, the most straightforward graph yields features equivalent to those of (nonlinear) Fisher discriminant analysis. Emphasis is on regression, where four different graphs were evaluated experimentally with a subproblem of face detection on photographs. The method proposed is promising particularly when linear models are insufficient, as well as when feature selection is difficult
Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems
This paper deals with the impact of linear approximations for the unknown
nonconvex confidence region of chance-constrained AC optimal power flow
problems. Such approximations are required for the formulation of tractable
chance constraints. In this context, we introduce the first formulation of a
chance-constrained second-order cone (SOC) OPF. The proposed formulation
provides convergence guarantees due to its convexity, while it demonstrates
high computational efficiency. Combined with an AC feasibility recovery, it is
able to identify better solutions than chance-constrained nonconvex AC-OPF
formulations. To the best of our knowledge, this paper is the first to perform
a rigorous analysis of the AC feasibility recovery procedures for robust
SOC-OPF problems. We identify the issues that arise from the linear
approximations, and by using a reformulation of the quadratic chance
constraints, we introduce new parameters able to reshape the approximation of
the confidence region. We demonstrate our method on the IEEE 118-bus system
Unsupervised Training for 3D Morphable Model Regression
We present a method for training a regression network from image pixels to 3D
morphable model coordinates using only unlabeled photographs. The training loss
is based on features from a facial recognition network, computed on-the-fly by
rendering the predicted faces with a differentiable renderer. To make training
from features feasible and avoid network fooling effects, we introduce three
objectives: a batch distribution loss that encourages the output distribution
to match the distribution of the morphable model, a loopback loss that ensures
the network can correctly reinterpret its own output, and a multi-view identity
loss that compares the features of the predicted 3D face and the input
photograph from multiple viewing angles. We train a regression network using
these objectives, a set of unlabeled photographs, and the morphable model
itself, and demonstrate state-of-the-art results.Comment: CVPR 2018 version with supplemental material
(http://openaccess.thecvf.com/content_cvpr_2018/html/Genova_Unsupervised_Training_for_CVPR_2018_paper.html
Prediction and optimization techniques for performance enhancement of vehicular ad-hoc networks
Imperial Users onl
- …