1,265,338 research outputs found

### A multiobjective optimization framework for multicontaminant industrial water network design.

The optimal design of multicontaminant industrial water networks according to several objectives is carried out in this paper. The general formulation of the water allocation problem (WAP) is given as a set of nonlinear equations with binary variables representing the presence of interconnections in the network. For optimization purposes, three antagonist objectives are considered: F1, the freshwater flow-rate at the network entrance, F2, the water flow-rate at inlet of regeneration units, and F3, the number of interconnections in the network. The multiobjective problem is solved via a lexicographic strategy, where a mixed-integer nonlinear programming (MINLP) procedure is used at each step. The approach is illustrated by a numerical example taken from the literature involving five processes, one regeneration unit and three contaminants. The set of potential network solutions is provided in the form of a Pareto front. Finally, the strategy for choosing the best network solution among those given by Pareto fronts is presented. This Multiple Criteria Decision Making (MCDM) problem is tackled by means of two approaches: a classical TOPSIS analysis is first implemented and then an innovative strategy based on the global equivalent cost (GEC) in freshwater that turns out to be more efficient for choosing a good network according to a practical point of view

### A multi-agent adaptive protocol for femto-satellite applications

Femto-satellites are a very promising category of satellites that weigh less than
100 grams.
Also, a Pico-Rover it is a self-contained robot that weighs less than 1 kilogram and its motion works by rolling the external enclosure that keeps out any environment threats.
The main advantage of this kind of small agents is the multi-point of view when
they work as swarm or taking part of a larger constellation. The complexity of
these kinds of network sensors, in addition to the low power requirements and low size, requires a good strategy of management that we want to present in this work.
The paradigm on management-on-agent consists of a single high quality point of view and multiple low quality points of view where the selection of the point of view is done inside the network but decided externally to the network or done by a basic law. This approach optimizes the bandwidth used by the net.
Instead of streaming every high quality point of view we only stream one of them. At the same time, this approach allows a task distribution on the network where there is only one producer agent, one consumer agent while the rest of agents work as relay nodes.
This work is addressed, on one side, to the design of a simple but robust and adaptive protocol based on this paradigm; on the other hand, an implementation using a low performance platform like the 8051 microcontroller architecture is required

### RotationNet: Joint Object Categorization and Pose Estimation Using Multiviews from Unsupervised Viewpoints

We propose a Convolutional Neural Network (CNN)-based model "RotationNet,"
which takes multi-view images of an object as input and jointly estimates its
pose and object category. Unlike previous approaches that use known viewpoint
labels for training, our method treats the viewpoint labels as latent
variables, which are learned in an unsupervised manner during the training
using an unaligned object dataset. RotationNet is designed to use only a
partial set of multi-view images for inference, and this property makes it
useful in practical scenarios where only partial views are available. Moreover,
our pose alignment strategy enables one to obtain view-specific feature
representations shared across classes, which is important to maintain high
accuracy in both object categorization and pose estimation. Effectiveness of
RotationNet is demonstrated by its superior performance to the state-of-the-art
methods of 3D object classification on 10- and 40-class ModelNet datasets. We
also show that RotationNet, even trained without known poses, achieves the
state-of-the-art performance on an object pose estimation dataset. The code is
available on https://github.com/kanezaki/rotationnetComment: 24 pages, 23 figures. Accepted to CVPR 201

### Learning in Networks - An Experimental Study using Stationary Concepts

Our study analyzes theories of learning for strategic interactions in networks. Participants played two of the 2 x 2 games used by Selten and Chmura (2008) and in the comment by Brunner, Camerer and Goeree (2009). Every participant played against four neighbors and could choose a different strategy against each of them. The games were played in two network structures: a attice and a circle. We compare our results with the predictions of different theories (Nash equilibrium, quantal response equilibrium, action-sampling equilibrium, payoff-sampling equilibrium, and impulse balance equilibrium) and the experimental results of Selten and Chmura (2008). One result is that the majority of players choose the same strategy against each neighbor. As another result we observe an order of predictive success for the stationary concepts that is different from the order shown by Selten and Chmura. This result supports our view that learning in networks is different from learning in random matching.experimental economics, networks, learning

### Learning in networks: An experimental study using stationary concepts

Our study analyzes theories of learning for strategic interactions in networks. Participants played two of the 2 x 2 games used by Selten and Chmura (2008) and in the comment by Brunner, Camerer and Goeree (2009). Every participant played against four neighbors and could choose a different strategy against each of them. The games were played in two network structures: a lattice and a circle. We compare our results with the predictions of different theories (Nash equilibrium, quantal response equilibrium, action-sampling equilibrium, payoff-sampling equilibrium, and impulse balance equilibrium) and the experimental results of Selten and Chmura (2008). One result is that the majority of players choose the same strategy against each neighbor. As another result we observe an order of predictive success for the stationary concepts that is different from the order shown by Selten and Chmura. This result supports our view that learning in networks is different from learning in random matching. --experimental economics,networks,learning

### (Quantum) Space-Time as a Statistical Geometry of Lumps in Random Networks

In the following we undertake to describe how macroscopic space-time (or
rather, a microscopic protoform of it) is supposed to emerge as a
superstructure of a web of lumps in a stochastic discrete network structure. As
in preceding work (mentioned below), our analysis is based on the working
philosophy that both physics and the corresponding mathematics have to be
genuinely discrete on the primordial (Planck scale) level. This strategy is
concretely implemented in the form of \tit{cellular networks} and \tit{random
graphs}. One of our main themes is the development of the concept of
\tit{physical (proto)points} or \tit{lumps} as densely entangled subcomplexes
of the network and their respective web, establishing something like
\tit{(proto)causality}. It may perhaps be said that certain parts of our
programme are realisations of some early ideas of Menger and more recent ones
sketched by Smolin a couple of years ago. We briefly indicate how this
\tit{two-story-concept} of \tit{quantum} space-time can be used to encode the
(at least in our view) existing non-local aspects of quantum theory without
violating macroscopic space-time causality.Comment: 35 pages, Latex, under consideration by CQ

### Iterative Geometry-Aware Cross Guidance Network for Stereo Image Inpainting

Currently, single image inpainting has achieved promising results based on
deep convolutional neural networks. However, inpainting on stereo images with
missing regions has not been explored thoroughly, which is also a significant
but different problem. One crucial requirement for stereo image inpainting is
stereo consistency. To achieve it, we propose an Iterative Geometry-Aware Cross
Guidance Network (IGGNet). The IGGNet contains two key ingredients, i.e., a
Geometry-Aware Attention (GAA) module and an Iterative Cross Guidance (ICG)
strategy. The GAA module relies on the epipolar geometry cues and learns the
geometry-aware guidance from one view to another, which is beneficial to make
the corresponding regions in two views consistent. However, learning guidance
from co-existing missing regions is challenging. To address this issue, the ICG
strategy is proposed, which can alternately narrow down the missing regions of
the two views in an iterative manner. Experimental results demonstrate that our
proposed network outperforms the latest stereo image inpainting model and
state-of-the-art single image inpainting models.Comment: Accepted by IJCAI 202

### Wireless Network Coding with Local Network Views: Coded Layer Scheduling

One of the fundamental challenges in the design of distributed wireless
networks is the large dynamic range of network state. Since continuous tracking
of global network state at all nodes is practically impossible, nodes can only
acquire limited local views of the whole network to design their transmission
strategies. In this paper, we study multi-layer wireless networks and assume
that each node has only a limited knowledge, namely 1-local view, where each
S-D pair has enough information to perform optimally when other pairs do not
interfere, along with connectivity information for rest of the network. We
investigate the information-theoretic limits of communication with such limited
knowledge at the nodes. We develop a novel transmission strategy, namely Coded
Layer Scheduling, that solely relies on 1-local view at the nodes and
incorporates three different techniques: (1) per layer interference avoidance,
(2) repetition coding to allow overhearing of the interference, and (3) network
coding to allow interference neutralization. We show that our proposed scheme
can provide a significant throughput gain compared with the conventional
interference avoidance strategies. Furthermore, we show that our strategy
maximizes the achievable normalized sum-rate for some classes of networks,
hence, characterizing the normalized sum-capacity of those networks with
1-local view.Comment: Technical report. A paper based on the results of this report will
appea

- …