28,530 research outputs found
FPSA: A Full System Stack Solution for Reconfigurable ReRAM-based NN Accelerator Architecture
Neural Network (NN) accelerators with emerging ReRAM (resistive random access
memory) technologies have been investigated as one of the promising solutions
to address the \textit{memory wall} challenge, due to the unique capability of
\textit{processing-in-memory} within ReRAM-crossbar-based processing elements
(PEs). However, the high efficiency and high density advantages of ReRAM have
not been fully utilized due to the huge communication demands among PEs and the
overhead of peripheral circuits.
In this paper, we propose a full system stack solution, composed of a
reconfigurable architecture design, Field Programmable Synapse Array (FPSA) and
its software system including neural synthesizer, temporal-to-spatial mapper,
and placement & routing. We highly leverage the software system to make the
hardware design compact and efficient. To satisfy the high-performance
communication demand, we optimize it with a reconfigurable routing architecture
and the placement & routing tool. To improve the computational density, we
greatly simplify the PE circuit with the spiking schema and then adopt neural
synthesizer to enable the high density computation-resources to support
different kinds of NN operations. In addition, we provide spiking memory blocks
(SMBs) and configurable logic blocks (CLBs) in hardware and leverage the
temporal-to-spatial mapper to utilize them to balance the storage and
computation requirements of NN. Owing to the end-to-end software system, we can
efficiently deploy existing deep neural networks to FPSA. Evaluations show
that, compared to one of state-of-the-art ReRAM-based NN accelerators, PRIME,
the computational density of FPSA improves by 31x; for representative NNs, its
inference performance can achieve up to 1000x speedup.Comment: Accepted by ASPLOS 201
Beyond pairwise clustering
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the hypergraph partitioning problem. We propose a two-step algorithm for solving this problem. In the first step we use a novel scheme to approximate the hypergraph using a weighted graph. In the second step a spectral partitioning algorithm is used to partition the vertices of this graph. The algorithm is capable of handling hyperedges of all orders including order two, thus incorporating information of all orders simultaneously. We present a theoretical analysis that relates our algorithm to an existing hypergraph partitioning algorithm and explain the reasons for its superior performance. We report the performance of our algorithm on a variety of computer vision problems and compare it to several existing hypergraph partitioning algorithms
Modeling a Grid-Connected PV/Battery Microgrid System with MPPT Controller
This paper focuses on performance analyzing and dynamic modeling of the
current grid-tied fixed array 6.84kW solar photovoltaic system located at
Florida Atlantic University (FAU). A battery energy storage system is designed
and applied to improve the systems stability and reliability. An overview of
the entire system and its PV module are presented. In sequel, the corresponding
I-V and P-V curves are obtained using MATLAB-Simulink package. Actual data was
collected and utilized for the modeling and simulation of the system. In
addition, a grid- connected PV/Battery system with Maximum Power Point Tracking
(MPPT) controller is modeled to analyze the system performance that has been
evaluated under two different test conditions: (1) PV power production is
higher than the load demand (2) PV generated power is less than required load.
A battery system has also been sized to provide smoothing services to this
array. The simulation results show the effective of the proposed method. This
system can be implemented in developing countries with similar weather
conditions to Florida.Comment: 6 pages, 14 figures, PVSC 201
Advances in quantum machine learning
Here we discuss advances in the field of quantum machine learning. The
following document offers a hybrid discussion; both reviewing the field as it
is currently, and suggesting directions for further research. We include both
algorithms and experimental implementations in the discussion. The field's
outlook is generally positive, showing significant promise. However, we believe
there are appreciable hurdles to overcome before one can claim that it is a
primary application of quantum computation.Comment: 38 pages, 17 Figure
Community Detection and Growth Potential Prediction Using the Stochastic Block Model and the Long Short-term Memory from Patent Citation Networks
Scoring patent documents is very useful for technology management. However,
conventional methods are based on static models and, thus, do not reflect the
growth potential of the technology cluster of the patent. Because even if the
cluster of a patent has no hope of growing, we recognize the patent is
important if PageRank or other ranking score is high. Therefore, there arises a
necessity of developing citation network clustering and prediction of future
citations. In our research, clustering of patent citation networks by
Stochastic Block Model was done with the aim of enabling corporate managers and
investors to evaluate the scale and life cycle of technology. As a result, we
confirmed nested SBM is appropriate for graph clustering of patent citation
networks. Also, a high MAPE value was obtained and the direction accuracy
achieved a value greater than 50% when predicting growth potential for each
cluster by using LSTM.Comment: arXiv admin note: substantial text overlap with arXiv:1904.1204
- …