135,296 research outputs found
Recommended from our members
Mathematical Structures in Group Decision-Making on Resource Allocation Distributions.
Optimal decisions on the distribution of finite resources are explicitly structured by mathematical models that specify relevant variables, constraints, and objectives. Here we report analysis and evidence that implicit mathematical structures are also involved in group decision-making on resource allocation distributions under conditions of uncertainty that disallow formal optimization. A group's array of initial distribution preferences automatically sets up a geometric decision space of alternative resource distributions. Weighted averaging mechanisms of interpersonal influence reduce the heterogeneity of the group's initial preferences on a suitable distribution. A model of opinion formation based on weighted averaging predicts a distribution that is a feasible point in the group's implicit initial decision space
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
We propose a randomized block-coordinate variant of the classic Frank-Wolfe
algorithm for convex optimization with block-separable constraints. Despite its
lower iteration cost, we show that it achieves a similar convergence rate in
duality gap as the full Frank-Wolfe algorithm. We also show that, when applied
to the dual structural support vector machine (SVM) objective, this yields an
online algorithm that has the same low iteration complexity as primal
stochastic subgradient methods. However, unlike stochastic subgradient methods,
the block-coordinate Frank-Wolfe algorithm allows us to compute the optimal
step-size and yields a computable duality gap guarantee. Our experiments
indicate that this simple algorithm outperforms competing structural SVM
solvers.Comment: Appears in Proceedings of the 30th International Conference on
Machine Learning (ICML 2013). 9 pages main text + 22 pages appendix. Changes
from v3 to v4: 1) Re-organized appendix; improved & clarified duality gap
proofs; re-drew all plots; 2) Changed convention for Cf definition; 3) Added
weighted averaging experiments + convergence results; 4) Clarified main text
and relationship with appendi
Constraint-wish and satisfied-dissatisfied: an overview of two approaches for dealing with bipolar querying
In recent years, there has been an increasing interest in dealing with user preferences in flexible database querying, expressing both positive and negative information in a heterogeneous way. This is what is usually referred to as bipolar database querying. Different frameworks have been introduced to deal with such bipolarity. In this chapter, an overview of two approaches is given. The first approach is based on mandatory and desired requirements. Hereby the complement of a mandatory requirement can be considered as a specification of what is not desired at all. So, mandatory requirements indirectly contribute to negative information (expressing what the user does not want to retrieve), whereas desired requirements can be seen as positive information (expressing what the user prefers to retrieve). The second approach is directly based on positive requirements (expressing what the user wants to retrieve), and negative requirements (expressing what the user does not want to retrieve). Both approaches use pairs of satisfaction degrees as the underlying framework but have different semantics, and thus also different operators for criteria evaluation, ranking, aggregation, etc
Adaptive foveated single-pixel imaging with dynamic super-sampling
As an alternative to conventional multi-pixel cameras, single-pixel cameras
enable images to be recorded using a single detector that measures the
correlations between the scene and a set of patterns. However, to fully sample
a scene in this way requires at least the same number of correlation
measurements as there are pixels in the reconstructed image. Therefore
single-pixel imaging systems typically exhibit low frame-rates. To mitigate
this, a range of compressive sensing techniques have been developed which rely
on a priori knowledge of the scene to reconstruct images from an under-sampled
set of measurements. In this work we take a different approach and adopt a
strategy inspired by the foveated vision systems found in the animal kingdom -
a framework that exploits the spatio-temporal redundancy present in many
dynamic scenes. In our single-pixel imaging system a high-resolution foveal
region follows motion within the scene, but unlike a simple zoom, every frame
delivers new spatial information from across the entire field-of-view. Using
this approach we demonstrate a four-fold reduction in the time taken to record
the detail of rapidly evolving features, whilst simultaneously accumulating
detail of more slowly evolving regions over several consecutive frames. This
tiered super-sampling technique enables the reconstruction of video streams in
which both the resolution and the effective exposure-time spatially vary and
adapt dynamically in response to the evolution of the scene. The methods
described here can complement existing compressive sensing approaches and may
be applied to enhance a variety of computational imagers that rely on
sequential correlation measurements.Comment: 13 pages, 5 figure
Biofilms in porous media: development of macroscopic transport equations via volume averaging with closure for local mass equilibrium conditions
In this work, we upscale a pore-scale description of mass transport in a porous medium containing biofilm to develop the relevant Darcy-scale equations. We begin with the pore-scale descriptions of mass transport, interphase mass transfer, and biologically-mediated reactions; these processes are then upscaled using the method of volume averaging to obtain the macroscale mass balance equations. We focus on the case of local mass equilibrium conditions where the averaged concentrations in the fluid and biological phases can be assumed to be proportional and for which a one-equation macroscopic model may be developed. We predict the effective dispersion tensor by a closure scheme that is solved for the cases of both simple and complex unit cells. The domain of validity of the approach is clearly identified, both theoretically and numerically, and unitless groupings indicating the domain of validity are reported
- …