2,957 research outputs found
P?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches
While the P vs NP problem is mainly approached form the point of view of
discrete mathematics, this paper proposes reformulations into the field of
abstract algebra, geometry, fourier analysis and of continuous global
optimization - which advanced tools might bring new perspectives and approaches
for this question. The first one is equivalence of satisfaction of 3-SAT
problem with the question of reaching zero of a nonnegative degree 4
multivariate polynomial (sum of squares), what could be tested from the
perspective of algebra by using discriminant. It could be also approached as a
continuous global optimization problem inside , for example in
physical realizations like adiabatic quantum computers. However, the number of
local minima usually grows exponentially. Reducing to degree 2 polynomial plus
constraints of being in , we get geometric formulations as the
question if plane or sphere intersects with . There will be also
presented some non-standard perspectives for the Subset-Sum, like through
convergence of a series, or zeroing of fourier-type integral for some natural . The last discussed
approach is using anti-commuting Grassmann numbers , making nonzero only if has a Hamilton cycle. Hence,
the PNP assumption implies exponential growth of matrix representation of
Grassmann numbers. There will be also discussed a looking promising
algebraic/geometric approach to the graph isomorphism problem -- tested to
successfully distinguish strongly regular graphs with up to 29 vertices.Comment: 19 pages, 8 figure
Calibration of semi-analytic models of galaxy formation using Particle Swarm Optimization
We present a fast and accurate method to select an optimal set of parameters
in semi-analytic models of galaxy formation and evolution (SAMs). Our approach
compares the results of a model against a set of observables applying a
stochastic technique called Particle Swarm Optimization (PSO), a self-learning
algorithm for localizing regions of maximum likelihood in multidimensional
spaces that outperforms traditional sampling methods in terms of computational
cost. We apply the PSO technique to the SAG semi-analytic model combined with
merger trees extracted from a standard CDM N-body simulation. The
calibration is performed using a combination of observed galaxy properties as
constraints, including the local stellar mass function and the black hole to
bulge mass relation. We test the ability of the PSO algorithm to find the best
set of free parameters of the model by comparing the results with those
obtained using a MCMC exploration. Both methods find the same maximum
likelihood region, however the PSO method requires one order of magnitude less
evaluations. This new approach allows a fast estimation of the best-fitting
parameter set in multidimensional spaces, providing a practical tool to test
the consequences of including other astrophysical processes in SAMs.Comment: 11 pages, 4 figures, 1 table. Accepted for publication in ApJ.
Comments are welcom
Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2
Random walks describe diffusion processes, where movement at every time step
is restricted to only the neighbouring locations. We construct a quantum random
walk algorithm, based on discretisation of the Dirac evolution operator
inspired by staggered lattice fermions. We use it to investigate the spatial
search problem, i.e. finding a marked vertex on a -dimensional hypercubic
lattice. The restriction on movement hardly matters for , and scaling
behaviour close to Grover's optimal algorithm (which has no restriction on
movement) can be achieved. Using numerical simulations, we optimise the
proportionality constants of the scaling behaviour, and demonstrate the
approach to that for Grover's algorithm (equivalent to the mean field theory or
the limit). In particular, the scaling behaviour for is only
about 25% higher than the optimal value.Comment: 11 pages, Revtex (v2) Introduction and references expanded. Published
versio
Sorting Integers on the AP1000
Sorting is one of the classic problems of computer science. Whilst well
understood on sequential machines, the diversity of architectures amongst
parallel systems means that algorithms do not perform uniformly on all
platforms. This document describes the implementation of a radix based
algorithm for sorting positive integers on a Fujitsu AP1000 Supercomputer,
which was constructed as an entry in the Joint Symposium on Parallel Processing
(JSPP) 1994 Parallel Software Contest (PSC94). Brief consideration is also
given to a full radix sort conducted in parallel across the machine.Comment: 1994 Project Report, 23 page
Consensus of Multi-Agent Networks in the Presence of Adversaries Using Only Local Information
This paper addresses the problem of resilient consensus in the presence of
misbehaving nodes. Although it is typical to assume knowledge of at least some
nonlocal information when studying secure and fault-tolerant consensus
algorithms, this assumption is not suitable for large-scale dynamic networks.
To remedy this, we emphasize the use of local strategies to deal with
resilience to security breaches. We study a consensus protocol that uses only
local information and we consider worst-case security breaches, where the
compromised nodes have full knowledge of the network and the intentions of the
other nodes. We provide necessary and sufficient conditions for the normal
nodes to reach consensus despite the influence of the malicious nodes under
different threat assumptions. These conditions are stated in terms of a novel
graph-theoretic property referred to as network robustness.Comment: This report contains the proofs of the results presented at HiCoNS
201
Performance modeling of fault-tolerant circuit-switched communication networks
Circuit switching (CS) has been suggested as an efficient switching method for supporting simultaneous communications (such as data, voice, and images) across parallel systems due to its ability to preserve both communication performance and fault-tolerant demands in such systems. In this paper we present an efficient scheme to capture the mean message latency in 2D torus with CS in the presence of faulty components. We have also conducted extensive simulation experiments, the results of which are used to validate the analytical mode
Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows
A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n
- …