24,250 research outputs found
Configuring spiking neural network training algorithms
Spiking neural networks, based on biologically-plausible neurons with temporal information
coding, are provably more powerful than widely used artificial neural networks
based on sigmoid neurons (ANNs). However, training them is more challenging than
training ANNs. Several methods have been proposed in the literature, each with its
limitations: SpikeProp, NSEBP, ReSuMe, etc. And setting numerous parameters of
spiking networks to obtain good accuracy has been largely ad hoc.
In this work, we used automated algorithm configuration tools to determine optimal
combinations of parameters for ANNs, artificial neural networks with components
simulating glia cells (astrocytes), and for spiking neural networks with SpikeProp
learning algorithm. This allowed us to achieve better accuracy on standard datasets
(Iris and Wisconsin Breast Cancer), and showed that even after optimization augmenting
an artificial neural network with glia results in improved performance.
Guided by the experimental results, we have developed methods for determining
values of several parameters of spiking neural networks, in particular weight and output
ranges. These methods have been incorporated into a SpikeProp implementation
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Open-Loop Spatial Multiplexing and Diversity Communications in Ad Hoc Networks
This paper investigates the performance of open-loop multi-antenna
point-to-point links in ad hoc networks with slotted ALOHA medium access
control (MAC). We consider spatial multiplexing transmission with linear
maximum ratio combining and zero forcing receivers, as well as orthogonal space
time block coded transmission. New closed-form expressions are derived for the
outage probability, throughput and transmission capacity. Our results
demonstrate that both the best performing scheme and the optimum number of
transmit antennas depend on different network parameters, such as the node
intensity and the signal-to-interference-and-noise ratio operating value. We
then compare the performance to a network consisting of single-antenna devices
and an idealized fully centrally coordinated MAC. These results show that
multi-antenna schemes with a simple decentralized slotted ALOHA MAC can
outperform even idealized single-antenna networks in various practical
scenarios.Comment: 51 pages, 19 figures, submitted to IEEE Transactions on Information
Theor
The Impact of CSI and Power Allocation on Relay Channel Capacity and Cooperation Strategies
Capacity gains from transmitter and receiver cooperation are compared in a
relay network where the cooperating nodes are close together. Under
quasi-static phase fading, when all nodes have equal average transmit power
along with full channel state information (CSI), it is shown that transmitter
cooperation outperforms receiver cooperation, whereas the opposite is true when
power is optimally allocated among the cooperating nodes but only CSI at the
receiver (CSIR) is available. When the nodes have equal power with CSIR only,
cooperative schemes are shown to offer no capacity improvement over
non-cooperation under the same network power constraint. When the system is
under optimal power allocation with full CSI, the decode-and-forward
transmitter cooperation rate is close to its cut-set capacity upper bound, and
outperforms compress-and-forward receiver cooperation. Under fast Rayleigh
fading in the high SNR regime, similar conclusions follow. Cooperative systems
provide resilience to fading in channel magnitudes; however, capacity becomes
more sensitive to power allocation, and the cooperating nodes need to be closer
together for the decode-and-forward scheme to be capacity-achieving. Moreover,
to realize capacity improvement, full CSI is necessary in transmitter
cooperation, while in receiver cooperation optimal power allocation is
essential.Comment: Accepted for publication in IEEE Transactions on Wireless
Communication
- …