33,898 research outputs found
A study on exponential-size neighborhoods for the bin packing problem with conflicts
We propose an iterated local search based on several classes of local and
large neighborhoods for the bin packing problem with conflicts. This problem,
which combines the characteristics of both bin packing and vertex coloring,
arises in various application contexts such as logistics and transportation,
timetabling, and resource allocation for cloud computing. We introduce
evaluation procedures for classical local-search moves, polynomial variants of
ejection chains and assignment neighborhoods, an adaptive set covering-based
neighborhood, and finally a controlled use of 0-cost moves to further diversify
the search. The overall method produces solutions of good quality on the
classical benchmark instances and scales very well with an increase of problem
size. Extensive computational experiments are conducted to measure the
respective contribution of each proposed neighborhood. In particular, the
0-cost moves and the large neighborhood based on set covering contribute very
significantly to the search. Several research perspectives are open in relation
to possible hybridizations with other state-of-the-art mathematical programming
heuristics for this problem.Comment: 26 pages, 8 figure
An Adaptive Locally Connected Neuron Model: Focusing Neuron
This paper presents a new artificial neuron model capable of learning its
receptive field in the topological domain of inputs. The model provides
adaptive and differentiable local connectivity (plasticity) applicable to any
domain. It requires no other tool than the backpropagation algorithm to learn
its parameters which control the receptive field locations and apertures. This
research explores whether this ability makes the neuron focus on informative
inputs and yields any advantage over fully connected neurons. The experiments
include tests of focusing neuron networks of one or two hidden layers on
synthetic and well-known image recognition data sets. The results demonstrated
that the focusing neurons can move their receptive fields towards more
informative inputs. In the simple two-hidden layer networks, the focusing
layers outperformed the dense layers in the classification of the 2D spatial
data sets. Moreover, the focusing networks performed better than the dense
networks even when 70 of the weights were pruned. The tests on
convolutional networks revealed that using focusing layers instead of dense
layers for the classification of convolutional features may work better in some
data sets.Comment: 45 pages, a national patent filed, submitted to Turkish Patent
Office, No: -2017/17601, Date: 09.11.201
Theories of the development of human communication
This article considers evidence for innate motives for sharing rituals and symbols from animal semiotics, developmental neurobiology, physiology of prospective motor control, affective neuroscience and infant communication. Mastery of speech and language depends on polyrhythmic movements in narrative activities of many forms. Infants display intentional activity with feeling and sensitivity for the contingent reactions of other persons. Talk shares many of its generative powers with music and the other ‘imitative arts’. Its special adaptations concern the capacity to produce and learn an endless range of sounds to label discrete learned understandings, topics and projects of intended movement
Towards formal models and languages for verifiable Multi-Robot Systems
Incorrect operations of a Multi-Robot System (MRS) may not only lead to
unsatisfactory results, but can also cause economic losses and threats to
safety. These threats may not always be apparent, since they may arise as
unforeseen consequences of the interactions between elements of the system.
This call for tools and techniques that can help in providing guarantees about
MRSs behaviour. We think that, whenever possible, these guarantees should be
backed up by formal proofs to complement traditional approaches based on
testing and simulation.
We believe that tailored linguistic support to specify MRSs is a major step
towards this goal. In particular, reducing the gap between typical features of
an MRS and the level of abstraction of the linguistic primitives would simplify
both the specification of these systems and the verification of their
properties. In this work, we review different agent-oriented languages and
their features; we then consider a selection of case studies of interest and
implement them useing the surveyed languages. We also evaluate and compare
effectiveness of the proposed solution, considering, in particular, easiness of
expressing non-trivial behaviour.Comment: Changed formattin
A Multi-Engine Approach to Answer Set Programming
Answer Set Programming (ASP) is a truly-declarative programming paradigm
proposed in the area of non-monotonic reasoning and logic programming, that has
been recently employed in many applications. The development of efficient ASP
systems is, thus, crucial. Having in mind the task of improving the solving
methods for ASP, there are two usual ways to reach this goal: extending
state-of-the-art techniques and ASP solvers, or designing a new ASP
solver from scratch. An alternative to these trends is to build on top of
state-of-the-art solvers, and to apply machine learning techniques for choosing
automatically the "best" available solver on a per-instance basis.
In this paper we pursue this latter direction. We first define a set of
cheap-to-compute syntactic features that characterize several aspects of ASP
programs. Then, we apply classification methods that, given the features of the
instances in a {\sl training} set and the solvers' performance on these
instances, inductively learn algorithm selection strategies to be applied to a
{\sl test} set. We report the results of a number of experiments considering
solvers and different training and test sets of instances taken from the ones
submitted to the "System Track" of the 3rd ASP Competition. Our analysis shows
that, by applying machine learning techniques to ASP solving, it is possible to
obtain very robust performance: our approach can solve more instances compared
with any solver that entered the 3rd ASP Competition. (To appear in Theory and
Practice of Logic Programming (TPLP).)Comment: 26 pages, 8 figure
- …