1,038 research outputs found
Exact Solution Methods for the -item Quadratic Knapsack Problem
The purpose of this paper is to solve the 0-1 -item quadratic knapsack
problem , a problem of maximizing a quadratic function subject to two
linear constraints. We propose an exact method based on semidefinite
optimization. The semidefinite relaxation used in our approach includes simple
rank one constraints, which can be handled efficiently by interior point
methods. Furthermore, we strengthen the relaxation by polyhedral constraints
and obtain approximate solutions to this semidefinite problem by applying a
bundle method. We review other exact solution methods and compare all these
approaches by experimenting with instances of various sizes and densities.Comment: 12 page
Quantitative determination of spin-dependent quasiparticle lifetimes and electronic correlations in hcp cobalt
We report on a quantitative investigation of the spin-dependent quasiparticle
lifetimes and electron correlation effects in ferromagnetic hcp Co(0001) by
means of spin and angle-resolved photoemission spectroscopy. The experimental
spectra are compared in detail to state-of-the-art many-body calculations
within the dynamical mean field theory and the three-body scattering
approximation, including a full calculation of the one-step photoemission
process. From this comparison we conclude that although strong local many-body
Coulomb interactions are of major importance for the qualitative description of
correlation effects in Co, more sophisticated many-body calculations are needed
in order to improve the quantitative agreement between theory and experiment,
in particular concerning the linewidths. The quality of the overall agreement
obtained for Co indicates that the effect of non-local correlations becomes
weaker with increasing atomic number
Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization
A versatile method is described for the practical computation of the discrete
Fourier transforms (DFT) of a continuous function given by its values
at the points of a uniform grid generated by conjugacy classes
of elements of finite adjoint order in the fundamental region of
compact semisimple Lie groups. The present implementation of the method is for
the groups SU(2), when is reduced to a one-dimensional segment, and for
in multidimensional cases. This simplest case
turns out to result in a transform known as discrete cosine transform (DCT),
which is often considered to be simply a specific type of the standard DFT.
Here we show that the DCT is very different from the standard DFT when the
properties of the continuous extensions of these two discrete transforms from
the discrete grid points to all points are
considered. (A) Unlike the continuous extension of the DFT, the continuous
extension of (the inverse) DCT, called CEDCT, closely approximates
between the grid points . (B) For increasing , the derivative of CEDCT
converges to the derivative of . And (C), for CEDCT the principle of
locality is valid. Finally, we use the continuous extension of 2-dimensional
DCT to illustrate its potential for interpolation, as well as for the data
compression of 2D images.Comment: submitted to JMP on April 3, 2003; still waiting for the referee's
Repor
Disorder effects in electronic structure of substituted transition metal compounds
Investigating LaNi(1-x)M(x)O3 (M = Mn and Fe), we identify a characteristic
evolution of the spectral function with increasing disorder in presence of
strong interaction effects across the metal-insulator transition. We discuss
these results vis-a-vis existing theories of electronic structure in
simultaneous presence of disorder and interaction.Comment: Revtex, 4 pages, 3 postscript figures (To appear in Phys. Rev. Lett
Generic 3D Representation via Pose Estimation and Matching
Though a large body of computer vision research has investigated developing
generic semantic representations, efforts towards developing a similar
representation for 3D has been limited. In this paper, we learn a generic 3D
representation through solving a set of foundational proxy 3D tasks:
object-centric camera pose estimation and wide baseline feature matching. Our
method is based upon the premise that by providing supervision over a set of
carefully selected foundational tasks, generalization to novel tasks and
abstraction capabilities can be achieved. We empirically show that the internal
representation of a multi-task ConvNet trained to solve the above core problems
generalizes to novel 3D tasks (e.g., scene layout estimation, object pose
estimation, surface normal estimation) without the need for fine-tuning and
shows traits of abstraction abilities (e.g., cross-modality pose estimation).
In the context of the core supervised tasks, we demonstrate our representation
achieves state-of-the-art wide baseline feature matching results without
requiring apriori rectification (unlike SIFT and the majority of learned
features). We also show 6DOF camera pose estimation given a pair local image
patches. The accuracy of both supervised tasks come comparable to humans.
Finally, we contribute a large-scale dataset composed of object-centric street
view scenes along with point correspondences and camera pose information, and
conclude with a discussion on the learned representation and open research
questions.Comment: Published in ECCV16. See the project website
http://3drepresentation.stanford.edu/ and dataset website
https://github.com/amir32002/3D_Street_Vie
- …