69 research outputs found
Investigation of land use of northern megalopolis using ERTS-1 imagery
Primary objective was to produce a color-coded land use map and digital data base for the northern third of Megalopolis. Secondary objective was to investigate possible applications of ERTS products to land use planning. Many of the materials in this report already have received national, dissemination as a result of unexpected interest in land use surveys from ERTS. Of special historical interest is the first comprehensive urban-type land use map from space imagery, which covered the entire state of Rhode Island and was made from a single image taken on 28 July 1972
Random Costs in Combinatorial Optimization
The random cost problem is the problem of finding the minimum in an
exponentially long list of random numbers. By definition, this problem cannot
be solved faster than by exhaustive search. It is shown that a classical
NP-hard optimization problem, number partitioning, is essentially equivalent to
the random cost problem. This explains the bad performance of heuristic
approaches to the number partitioning problem and allows us to calculate the
probability distributions of the optimum and sub-optimum costs.Comment: 4 pages, Revtex, 2 figures (eps), submitted to PR
Number partitioning as random energy model
Number partitioning is a classical problem from combinatorial optimisation.
In physical terms it corresponds to a long range anti-ferromagnetic Ising spin
glass. It has been rigorously proven that the low lying energies of number
partitioning behave like uncorrelated random variables. We claim that
neighbouring energy levels are uncorrelated almost everywhere on the energy
axis, and that energetically adjacent configurations are uncorrelated, too.
Apparently there is no relation between geometry (configuration) and energy
that could be exploited by an optimization algorithm. This ``local random
energy'' picture of number partitioning is corroborated by numerical
simulations and heuristic arguments.Comment: 8+2 pages, 9 figures, PDF onl
Cyber Insurance: recent advances, good practices & challenges
The aim of this ENISA report is to raise awareness for the most impact to market advances, by shortly identifying the most significant cyber insurance developments for the past four years – during 2012 to 2016 – and to capture the good practices and challenges during the early stages of the cyber insurance lifecycle, i.e. before an actual policy is signed, laying the ground for future work in the area
Landscape Encodings Enhance Optimization
Hard combinatorial optimization problems deal with the search for the minimum cost solutions (ground states) of discrete systems under strong constraints. A transformation of state variables may enhance computational tractability. It has been argued that these state encodings are to be chosen invertible to retain the original size of the state space. Here we show how redundant non-invertible encodings enhance optimization by enriching the density of low-energy states. In addition, smooth landscapes may be established on encoded state spaces to guide local search dynamics towards the ground state
- …