id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1712.03894
|
Andrew Bedford
|
Andrew Bedford
|
Coqatoo: Generating Natural Language Versions of Coq Proofs
|
International Workshop on Coq for Programming Languages (CoqPL 2018)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to their numerous advantages, formal proofs and proof assistants, such as
Coq, are becoming increasingly popular. However, one disadvantage of using
proof assistants is that the resulting proofs can sometimes be hard to read and
understand, particularly for less-experienced users. To address this issue, we
have implemented a tool capable of generating natural language versions of Coq
proofs called Coqatoo, which we present in this paper.
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 17:12:34 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Bedford",
"Andrew",
""
]
] |
new_dataset
| 0.978884 |
1712.03931
|
Manolis Savva
|
Manolis Savva, Angel X. Chang, Alexey Dosovitskiy, Thomas Funkhouser,
Vladlen Koltun
|
MINOS: Multimodal Indoor Simulator for Navigation in Complex
Environments
|
MINOS is a simulator designed to support research on end-to-end
navigation
| null | null | null |
cs.LG cs.AI cs.CV cs.GR cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present MINOS, a simulator designed to support the development of
multisensory models for goal-directed navigation in complex indoor
environments. The simulator leverages large datasets of complex 3D environments
and supports flexible configuration of multimodal sensor suites. We use MINOS
to benchmark deep-learning-based navigation methods, to analyze the influence
of environmental complexity on navigation performance, and to carry out a
controlled study of multimodality in sensorimotor learning. The experiments
show that current deep reinforcement learning approaches fail in large
realistic environments. The experiments also indicate that multimodality is
beneficial in learning to navigate cluttered scenes. MINOS is released
open-source to the research community at http://minosworld.org . A video that
shows MINOS can be found at https://youtu.be/c0mL9K64q84
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 18:24:58 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Savva",
"Manolis",
""
],
[
"Chang",
"Angel X.",
""
],
[
"Dosovitskiy",
"Alexey",
""
],
[
"Funkhouser",
"Thomas",
""
],
[
"Koltun",
"Vladlen",
""
]
] |
new_dataset
| 0.975903 |
1608.05830
|
Ali Dorri
|
Ali Dorri, Soroush Vaseghi, Omid Gharib
|
DEBH: Detection and Elimination Black Holes in Mobile Ad Hoc Network
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security in Mobile Ad hoc Network (MANET) is one of the key challenges due to
its special features e.g. hop-by-hop communications, dynamic topology, and open
network boundary that received tremendous attention by scholars. Traditional
security methods are not applicable in MANET due to its special properties. In
this paper, a novel approach called Detecting and Eliminating Black Holes
(DEBH) is proposed that uses a data control packet and an additional Black hole
Check (BCh) table for detecting and eliminating malicious nodes. Benefiting
from trustable nodes, the processing overhead of the security method decreases
by passing time. Ad hoc On-demand Distance Vector (AODV) routing protocol is
used as the routing protocol in our design. After finding the freshest path
using AODV, our design checks the safety of selected path. In case of detecting
any malicious node, it is isolated from the entire network by broadcasting a
packet that contains the ID of malicious nodes. Simulation results show that
DEBH increases network throughput and decreases packet overhead and delay in
comparison with other studied approaches. Moreover, DEBH is able to detect all
active malicious nodes which generates fault routing information.
|
[
{
"version": "v1",
"created": "Sat, 20 Aug 2016 14:29:04 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Dec 2017 08:58:59 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Dorri",
"Ali",
""
],
[
"Vaseghi",
"Soroush",
""
],
[
"Gharib",
"Omid",
""
]
] |
new_dataset
| 0.983804 |
1701.05209
|
Lenny Fukshansky
|
Lenny Fukshansky and Ahmad Adib Shaar
|
A new family of one-coincidence sets of sequences with dispersed
elements for frequency hopping CDMA systems
|
8 pages, 5 tables; to appear in Advances in Mathematics of
Communication
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new family of one-coincidence sequence sets suitable for
frequency hopping code division multiple access (FH-CDMA) systems with
dispersed (low density) sequence elements. These sets are derived from
one-coincidence prime sequence sets, such that for each one-coincidence prime
sequence set there is a new one-coincidence set comprised of sequences with
dispersed sequence elements, required in some circumstances, for FH-CDMA
systems. Getting rid of crowdedness of sequence elements is achieved by
doubling the size of the sequence element alphabet. In addition, this doubling
process eases control over the distance between adjacent sequence elements.
Properties of the new sets are discussed.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2017 19:11:07 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Dec 2017 18:07:40 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Fukshansky",
"Lenny",
""
],
[
"Shaar",
"Ahmad Adib",
""
]
] |
new_dataset
| 0.999081 |
1707.01039
|
Prabhu Chandhar
|
Prabhu Chandhar, Danyo Danev, Erik G. Larsson
|
Massive MIMO for Communications with Drone Swarms
|
Accepted for publication in the IEEE Transactions on Wireless
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We illustrate the potential of massive MIMO for communication with unmanned
aerial vehicles (UAVs). We consider a scenario where multiple single-antenna
UAVs simultaneously communicate with a ground station (GS) equipped with a
large number of antennas. Specifically, we discuss the achievable uplink (UAV
to GS) capacity performance in the case of line-of-sight (LoS) conditions. We
develop a realistic geometric model which incorporates an arbitrary orientation
of the GS and UAV antenna elements to characterize the polarization mismatch
loss which occurs due to the movement and orientation of the UAVs. A
closed-form expression for a lower bound on the ergodic rate for a
maximum-ratio combining receiver with estimated channel state information is
derived. The optimal antenna spacing that maximizes the ergodic rate achieved
by an UAV is also determined for uniform linear and rectangular arrays. It is
shown that when the UAVs are spherically uniformly distributed around the GS,
the ergodic rate per UAV is maximized for an antenna spacing equal to an
integer multiple of one-half wavelength.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 15:39:07 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Dec 2017 18:27:06 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Chandhar",
"Prabhu",
""
],
[
"Danev",
"Danyo",
""
],
[
"Larsson",
"Erik G.",
""
]
] |
new_dataset
| 0.99037 |
1710.07789
|
Om Prakash
|
Habibul Islam and Om Prakash
|
Skew constacyclic codes over Fq+uFq+vFq
|
10 pages paper communicated to the Journal of Algebra and its
Applications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper skew constacyclic codes over finite non-chain ring R =
F_q+uF_q+vF_q, where q= p^m, p is an odd prime and u^{2}=u, v^{2}=v, uv = vu =
0 are studied. We show that Gray image of a skew alpha-constacyclic cyclic code
of length n over R is a skew alpha-quasi-cyclic code of length $3n$ over F_{q}
of index 3. It is also shown that skew alpha-constacyclic codes are either
equivalent to alpha-constacyclic codes or alpha-quasi-twisted codes over R.
Further, the structural properties of skew constacyclic over R are obtained by
decomposition method.
|
[
{
"version": "v1",
"created": "Sat, 21 Oct 2017 11:22:42 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Nov 2017 07:57:40 GMT"
},
{
"version": "v3",
"created": "Fri, 8 Dec 2017 11:31:27 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Islam",
"Habibul",
""
],
[
"Prakash",
"Om",
""
]
] |
new_dataset
| 0.999699 |
1712.02052
|
Kartik Mohta
|
Kartik Mohta, Michael Watterson, Yash Mulgaonkar, Sikang Liu, Chao Qu,
Anurag Makineni, Kelsey Saulnier, Ke Sun, Alex Zhu, Jeffrey Delmerico,
Konstantinos Karydis, Nikolay Atanasov, Giuseppe Loianno, Davide Scaramuzza,
Kostas Daniilidis, Camillo Jose Taylor, Vijay Kumar
|
Fast, Autonomous Flight in GPS-Denied and Cluttered Environments
|
Pre-peer reviewed version of the article accepted in Journal of Field
Robotics
| null |
10.1002/rob.21774
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the most challenging tasks for a flying robot is to autonomously
navigate between target locations quickly and reliably while avoiding obstacles
in its path, and with little to no a-priori knowledge of the operating
environment. This challenge is addressed in the present paper. We describe the
system design and software architecture of our proposed solution, and showcase
how all the distinct components can be integrated to enable smooth robot
operation. We provide critical insight on hardware and software component
selection and development, and present results from extensive experimental
testing in real-world warehouse environments. Experimental testing reveals that
our proposed solution can deliver fast and robust aerial robot autonomous
navigation in cluttered, GPS-denied environments.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 06:14:42 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Mohta",
"Kartik",
""
],
[
"Watterson",
"Michael",
""
],
[
"Mulgaonkar",
"Yash",
""
],
[
"Liu",
"Sikang",
""
],
[
"Qu",
"Chao",
""
],
[
"Makineni",
"Anurag",
""
],
[
"Saulnier",
"Kelsey",
""
],
[
"Sun",
"Ke",
""
],
[
"Zhu",
"Alex",
""
],
[
"Delmerico",
"Jeffrey",
""
],
[
"Karydis",
"Konstantinos",
""
],
[
"Atanasov",
"Nikolay",
""
],
[
"Loianno",
"Giuseppe",
""
],
[
"Scaramuzza",
"Davide",
""
],
[
"Daniilidis",
"Kostas",
""
],
[
"Taylor",
"Camillo Jose",
""
],
[
"Kumar",
"Vijay",
""
]
] |
new_dataset
| 0.985529 |
1712.02850
|
David Karpuk
|
Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena
Horlemann-Trautmann, David Karpuk, Ivo Kubjas
|
t-Private Information Retrieval Schemes Using Transitive Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents private information retrieval (PIR) schemes for coded
storage with colluding servers, which are not restricted to maximum distance
separable (MDS) codes. PIR schemes for general linear codes are constructed and
the resulting PIR rate is calculated explicitly. It is shown that codes with
transitive automorphism groups yield the highest possible rates obtainable with
the proposed scheme. This rate coincides with the known asymptotic PIR capacity
for MDS-coded storage systems without collusion. While many PIR schemes in the
literature require field sizes that grow with the number of servers and files
in the system, we focus especially on the case of a binary base field, for
which Reed- Muller codes serve as an important and explicit class of examples.
|
[
{
"version": "v1",
"created": "Thu, 7 Dec 2017 20:10:02 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Freij-Hollanti",
"Ragnar",
""
],
[
"Gnilke",
"Oliver W.",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Horlemann-Trautmann",
"Anna-Lena",
""
],
[
"Karpuk",
"David",
""
],
[
"Kubjas",
"Ivo",
""
]
] |
new_dataset
| 0.988777 |
1712.02923
|
Vatsal Patel
|
Vatsal Patel, Sanjay Krishnan, Aimee Goncalves, Ken Goldberg
|
SPRK: A Low-Cost Stewart Platform For Motion Study In Surgical Robotics
| null | null | null | null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To simulate body organ motion due to breathing, heart beats, or peristaltic
movements, we designed a low-cost, miniaturized SPRK (Stewart Platform Research
Kit) to translate and rotate phantom tissue. This platform is 20cm x 20cm x
10cm to fit in the workspace of a da Vinci Research Kit (DVRK) surgical robot
and costs $250, two orders of magnitude less than a commercial Stewart
platform. The platform has a range of motion of +/- 1.27 cm in translation
along x, y, and z directions and has motion modes for sinusoidal motion and
breathing-inspired motion. Modular platform mounts were also designed for
pattern cutting and debridement experiments. The platform's positional
controller has a time-constant of 0.2 seconds and the root-mean-square error is
1.22 mm, 1.07 mm, and 0.20 mm in x, y, and z directions respectively. All the
details, CAD models, and control software for the platform is available at
github.com/BerkeleyAutomation/sprk.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 03:05:37 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Patel",
"Vatsal",
""
],
[
"Krishnan",
"Sanjay",
""
],
[
"Goncalves",
"Aimee",
""
],
[
"Goldberg",
"Ken",
""
]
] |
new_dataset
| 0.996075 |
1712.02944
|
Tevfik Kosar
|
Asif Imran, Md S Q Zulkar Nine, Kemal Guner, Tevfik Kosar
|
OneDataShare: A Vision for Cloud-hosted Data Transfer Scheduling and
Optimization as a Service
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fast, reliable, and efficient data transmission across wide-area networks is
a predominant bottleneck for data-intensive cloud applications. This paper
introduces OneDataShare, which is designed to eliminate the issues plaguing
effective cloud-based data transfers of varying file sizes and across
incompatible transfer end-points. The vision of OneDataShare is to achieve
high-speed data communication, interoperability between multiple transfer
protocols, and accurate estimation of delivery time for advance planning,
thereby maximizing user-profit through improved and faster data analysis for
business intelligence. The paper elaborates on the desirable features of
OneDataShare as a cloud-hosted data transfer scheduling and optimization
service, and how it is aligned with the vision of harnessing the power of the
cloud and distributed computing. Experimental evaluation and comparison with
existing real-life file transfer services show that the transfer throughout
achieved by OneDataShare is 6.5 times greater.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 05:24:56 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Imran",
"Asif",
""
],
[
"Nine",
"Md S Q Zulkar",
""
],
[
"Guner",
"Kemal",
""
],
[
"Kosar",
"Tevfik",
""
]
] |
new_dataset
| 0.993901 |
1712.02962
|
Daizhan Cheng Dr
|
Yaqi Hao, Daizhan Cheng
|
On Skew-Symmetric Games
|
31 pages,9 tables
| null | null | null |
cs.GT math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By resorting to the vector space structure of finite games, skew-symmetric
games (SSGs) are proposed and investigated as a natural subspace of finite
games. First of all, for two player games, it is shown that the skew-symmetric
games form an orthogonal complement of the symmetric games. Then for a general
SSG its linear representation is given, which can be used to verify whether a
finite game is skew-symmetric. Furthermore, some properties of SSGs are also
obtained in the light of its vector subspace structure. Finally, a
symmetry-based decomposition of finite games is proposed, which consists of
three mutually orthogonal subspaces: symmetric subspace, skew-symmetric
subspace and asymmetric subspace. An illustrative example is presented to
demonstrate this decomposition.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 06:42:05 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Hao",
"Yaqi",
""
],
[
"Cheng",
"Daizhan",
""
]
] |
new_dataset
| 0.996232 |
1712.02977
|
Toru Niina
|
Toru Niina
|
Periortree: An Extention of R-Tree for Periodic Boundary Conditions
|
a very preliminary draft
| null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by/4.0/
|
Searching spatial data is an important operation for scientific simulations
which are performed mostly with periodic boundary conditions. An R-Tree is a
well known tree data structure used to contain spatial objects and it is
capable of answering to spatial searching queries in an efficient way. In this
paper, a novel method to construct an R-Tree considering periodic boundary
conditions is presented. Unlike existing methods, the proposed method works
without any kind of extra objects or queries. Moreover, because this method
reduces the volume of bounding box for each node under the periodic boundary
conditions, it is expected to increase the overall efficiency. While the
extension of an R-Tree is presented in this work, this method is not only
applicable to an R-Tree but also to other data structures that use axis-aligned
bounding boxes with periodic boundary conditions. The implementation is
available on GitHub.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 08:29:16 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Niina",
"Toru",
""
]
] |
new_dataset
| 0.99606 |
1712.03159
|
Pulak Purkait
|
Pulak Purkait and Christopher Zach
|
Minimal Solvers for Monocular Rolling Shutter Compensation under
Ackermann Motion
|
Submitted to WACV 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern automotive vehicles are often equipped with a budget commercial
rolling shutter camera. These devices often produce distorted images due to the
inter-row delay of the camera while capturing the image. Recent methods for
monocular rolling shutter motion compensation utilize blur kernel and the
straightness property of line segments. However, these methods are limited to
handling rotational motion and also are not fast enough to operate in real
time. In this paper, we propose a minimal solver for the rolling shutter motion
compensation which assumes known vertical direction of the camera. Thanks to
the Ackermann motion model of vehicles which consists of only two motion
parameters, and two parameters for the simplified depth assumption that lead to
a 4-line algorithm. The proposed minimal solver estimates the rolling shutter
camera motion efficiently and accurately. The extensive experiments on real and
simulated datasets demonstrate the benefits of our approach in terms of
qualitative and quantitative results.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 16:26:43 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Purkait",
"Pulak",
""
],
[
"Zach",
"Christopher",
""
]
] |
new_dataset
| 0.989411 |
1712.03186
|
Gustavo Maciel Dias Vieira
|
Rafael R. Machado, Gustavo M. D. Vieira
|
UEFI BIOS Accessibility for the Visually Impaired
|
6 pages
|
SBESC '17: Proceedings of the VII Brazilian Symposium on Computing
Systems Engineering, IEEE Computer Society, 2017, 155-160
|
10.1109/SBESC.2017.27
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People with some kind of disability face a high level of difficulty for
everyday tasks because, in many cases, accessibility was not considered
necessary when the task or process was designed. An example of this scenario is
a computer's BIOS configuration screens, which do not consider the specific
needs, such as screen readers, of visually impaired people. This paper proposes
the idea that it is possible to make the pre-operating system environment
accessible to visually impaired people. We report our work-in-progress in
creating a screen reader prototype, accessing audio cards compatible with the
High Definition Audio specification in systems running UEFI compliant firmware.
|
[
{
"version": "v1",
"created": "Thu, 7 Dec 2017 17:47:11 GMT"
}
] | 2017-12-11T00:00:00 |
[
[
"Machado",
"Rafael R.",
""
],
[
"Vieira",
"Gustavo M. D.",
""
]
] |
new_dataset
| 0.996022 |
1706.00556
|
Yang Song
|
Yang Song, Zhifei Zhang, Hairong Qi
|
r-BTN: Cross-domain Face Composite and Synthesis from Limited Facial
Patches
|
Accepted by AAAI 2018
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
We start by asking an interesting yet challenging question, "If an eyewitness
can only recall the eye features of the suspect, such that the forensic artist
can only produce a sketch of the eyes (e.g., the top-left sketch shown in Fig.
1), can advanced computer vision techniques help generate the whole face
image?" A more generalized question is that if a large proportion (e.g., more
than 50%) of the face/sketch is missing, can a realistic whole face
sketch/image still be estimated. Existing face completion and generation
methods either do not conduct domain transfer learning or can not handle large
missing area. For example, the inpainting approach tends to blur the generated
region when the missing area is large (i.e., more than 50%). In this paper, we
exploit the potential of deep learning networks in filling large missing region
(e.g., as high as 95% missing) and generating realistic faces with
high-fidelity in cross domains. We propose the recursive generation by
bidirectional transformation networks (r-BTN) that recursively generates a
whole face/sketch from a small sketch/face patch. The large missing area and
the cross domain challenge make it difficult to generate satisfactory results
using a unidirectional cross-domain learning structure. On the other hand, a
forward and backward bidirectional learning between the face and sketch domains
would enable recursive estimation of the missing region in an incremental
manner (Fig. 1) and yield appealing results. r-BTN also adopts an adversarial
constraint to encourage the generation of realistic faces/sketches. Extensive
experiments have been conducted to demonstrate the superior performance from
r-BTN as compared to existing potential solutions.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 05:07:37 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Dec 2017 20:08:27 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Song",
"Yang",
""
],
[
"Zhang",
"Zhifei",
""
],
[
"Qi",
"Hairong",
""
]
] |
new_dataset
| 0.992275 |
1710.10515
|
George Chen
|
George H. Chen, Kendall Nowocin, Niraj Marathe
|
Toward Reducing Crop Spoilage and Increasing Small Farmer Profits in
India: a Simultaneous Hardware and Software Solution
|
International Conference on Information and Communication
Technologies for Development 2017, fixed Figure 4 sparsity pattern issue,
added acknowledgments
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
India's agricultural system has been facing a severe problem of crop wastage.
A key contributing factor to this problem is that many small farmers lack
access to reliable cold storage that extends crop shelf-life. To avoid having
leftover crops that spoil, these farmers often sell their crops at unfavorable
low prices. Inevitably, not all crops are sold before spoilage. Even if the
farmers have access to cold storage, the farmers may not know how long to hold
different crops in cold storage for, which hinges on strategizing over when and
where to sell their harvest. In this note, we present progress toward a
simultaneous hardware and software solution that aims to help farmers reduce
crop spoilage and increase their profits. The hardware is a cost-effective
solar-powered refrigerator and control unit. The software refers to a produce
price forecasting system, for which we have tested a number of machine learning
methods. Note that unlike standard price forecasting tasks such as for stock
market data, the produce price data from predominantly rural Indian markets
have a large amount of missing values. In developing our two-pronged solution,
we are actively working with farmers at two pilot sites in Karnataka and
Odisha.
|
[
{
"version": "v1",
"created": "Sat, 28 Oct 2017 18:55:24 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Dec 2017 07:00:30 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Chen",
"George H.",
""
],
[
"Nowocin",
"Kendall",
""
],
[
"Marathe",
"Niraj",
""
]
] |
new_dataset
| 0.978822 |
1711.05412
|
Dianmu Zhang
|
Dianmu Zhang and Blake Hannaford
|
IKBT: solving closed-form Inverse Kinematics with Behavior Tree
|
14 pages, 6 figures
| null | null | null |
cs.RO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Serial robot arms have complicated kinematic equations which must be solved
to write effective arm planning and control software (the Inverse Kinematics
Problem). Existing software packages for inverse kinematics often rely on
numerical methods which have significant shortcomings. Here we report a new
symbolic inverse kinematics solver which overcomes the limitations of numerical
methods, and the shortcomings of previous symbolic software packages. We
integrate Behavior Trees, an execution planning framework previously used for
controlling intelligent robot behavior, to organize the equation solving
process, and a modular architecture for each solution technique. The system
successfully solved, generated a LaTex report, and generated a Python code
template for 18 out of 19 example robots of 4-6 DOF. The system is readily
extensible, maintainable, and multi-platform with few dependencies. The
complete package is available with a Modified BSD license on Github.
|
[
{
"version": "v1",
"created": "Wed, 15 Nov 2017 05:19:18 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Nov 2017 01:27:29 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Dec 2017 08:42:56 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Zhang",
"Dianmu",
""
],
[
"Hannaford",
"Blake",
""
]
] |
new_dataset
| 0.996506 |
1711.07120
|
Yu Qin
|
Yu Qin and Wanjiaman Li
|
Quantum Inspired Security on a Mobile Phone
|
The conclusion of this paper I recalculated and found to be wrong.
Since I am afraid of causing future problems, please let me withdraw it
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The widespread use of mobile electronic devices increases the complexities of
mobile security. This paper aims to provide a secure communication environment
for smartphone users. Some research proves that the one-time pad is one of the
securest encryption methods, and the key distribution problem can be solved by
using the QKD (quantum key distribution). The objective of this project is to
design an Android APP (application) to exchange several random keys between
mobile phones. Inspired by QKD, the developed APP uses the quick response (QR)
code as a carrier to dispatch large amounts of one-time keys. After evaluating
the performance of APP, it allows the mobile phone to capture and decode 1800
bytes of random data in 600ms. The continuous scanning mode of APP is designed
to improve the overall transmission performance and user experience, and the
maximum transmission rate of this mode is around 2200 bytes/s. The
omnidirectional readability and error correction capability of QR code gives it
better real-life application, and the features of adequate storage capacity and
quick response optimize overall transmission efficiency. The security of this
APP is guaranteed since QR code is exchanged face-to-face, eliminating the risk
of being eavesdropped. Also, the id of QR code is the only message that would
be transmitted through the whole communication. The experimental results show
this project can achieve superior transmission performance, and the correlation
between the transmission rate of the system and several parameters, such as the
QR code size, has been analyzed. In addition, some existing technologies and
the main findings in the context of the project are summarized and critically
compared in detail.
|
[
{
"version": "v1",
"created": "Mon, 20 Nov 2017 02:04:27 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Dec 2017 07:18:21 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Qin",
"Yu",
""
],
[
"Li",
"Wanjiaman",
""
]
] |
new_dataset
| 0.998947 |
1711.09704
|
David P. Chassin
|
David P. Chassin
|
Multi-scale Transactive Control In Interconnected Bulk Power Systems
Under High Renewable Energy Supply and High Demand Response Scenarios
|
242 pages, including auxiliary report by David P. Chassin and Ned
Djilali. Phd thesis, Mechanical Engineering, Univ of Victoria (2017)
| null | null | null |
cs.SY nlin.AO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This thesis presents the design, analysis, and validation of a hierarchical
transactive control system that engages demand response resources to enhance
the integration of renewable electricity generation resources. This control
system joins energy, capacity and regulation markets together in a unified
homeostatic and economically efficient electricity operation that increases
total surplus while improving reliability and decreasing carbon emissions from
fossil-based generation resources.
The work encompasses: (1) the derivation of a short-term demand response
model suitable for transactive control systems and its validation with field
demonstration data; (2) an aggregate load model that enables effective control
of large populations of thermal loads using a new type of thermostat (discrete
time with zero deadband); (3) a methodology for optimally controlling response
to frequency deviations while tracking schedule area exports in areas that have
high penetration of both intermittent renewable resources and fast-acting
demand response; and (4) the development of a system-wide (continental
interconnection) scale strategy for optimal power trajectory and resource
dispatch based on a shift from primarily energy cost-based approach to a
primarily ramping cost-based one.
The results show that multi-layer transactive control systems can be
constructed, will enhance renewable resource utilization, and will operate in a
coordinated manner with bulk power systems that include both regions with and
without organized power markets. Estimates of Western Electric Coordionating
Council (WECC) system cost savings under target renewable energy generation
levels resulting from the proposed system exceed US$150B annually by the year
2024, when compared to the existing control system.
|
[
{
"version": "v1",
"created": "Wed, 22 Nov 2017 19:10:47 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Dec 2017 23:53:42 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Chassin",
"David P.",
""
]
] |
new_dataset
| 0.986614 |
1712.01090
|
Chen Chen
|
Mengyuan Liu, Hong Liu, Chen Chen
|
Robust 3D Action Recognition through Sampling Local Appearances and
Global Distributions
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3D action recognition has broad applications in human-computer interaction
and intelligent surveillance. However, recognizing similar actions remains
challenging since previous literature fails to capture motion and shape cues
effectively from noisy depth data. In this paper, we propose a novel two-layer
Bag-of-Visual-Words (BoVW) model, which suppresses the noise disturbances and
jointly encodes both motion and shape cues. First, background clutter is
removed by a background modeling method that is designed for depth data. Then,
motion and shape cues are jointly used to generate robust and distinctive
spatial-temporal interest points (STIPs): motion-based STIPs and shape-based
STIPs. In the first layer of our model, a multi-scale 3D local steering kernel
(M3DLSK) descriptor is proposed to describe local appearances of cuboids around
motion-based STIPs. In the second layer, a spatial-temporal vector (STV)
descriptor is proposed to describe the spatial-temporal distributions of
shape-based STIPs. Using the Bag-of-Visual-Words (BoVW) model, motion and shape
cues are combined to form a fused action representation. Our model performs
favorably compared with common STIP detection and description methods. Thorough
experiments verify that our model is effective in distinguishing similar
actions and robust to background clutter, partial occlusions and pepper noise.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 14:31:42 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Dec 2017 15:21:15 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Liu",
"Mengyuan",
""
],
[
"Liu",
"Hong",
""
],
[
"Chen",
"Chen",
""
]
] |
new_dataset
| 0.988485 |
1712.02494
|
Jiajun Lu
|
Jiajun Lu, Hussein Sibai, Evan Fabry
|
Adversarial Examples that Fool Detectors
|
Follow up paper for adversarial stop signs. Submitted to CVPR 2018
| null | null | null |
cs.CV cs.AI cs.GR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An adversarial example is an example that has been adjusted to produce a
wrong label when presented to a system at test time. To date, adversarial
example constructions have been demonstrated for classifiers, but not for
detectors. If adversarial examples that could fool a detector exist, they could
be used to (for example) maliciously create security hazards on roads populated
with smart vehicles. In this paper, we demonstrate a construction that
successfully fools two standard detectors, Faster RCNN and YOLO. The existence
of such examples is surprising, as attacking a classifier is very different
from attacking a detector, and that the structure of detectors - which must
search for their own bounding box, and which cannot estimate that box very
accurately - makes it quite likely that adversarial patterns are strongly
disrupted. We show that our construction produces adversarial examples that
generalize well across sequences digitally, even though large perturbations are
needed. We also show that our construction yields physical objects that are
adversarial.
|
[
{
"version": "v1",
"created": "Thu, 7 Dec 2017 05:13:54 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Lu",
"Jiajun",
""
],
[
"Sibai",
"Hussein",
""
],
[
"Fabry",
"Evan",
""
]
] |
new_dataset
| 0.994413 |
1712.02731
|
Romeo Orsolino
|
Romeo Orsolino (1), Michele Focchi (1), Carlos Mastalli (1), Hongkai
Dai (2), Darwin G. Caldwell (1) and Claudio Semini (1) ((1) Department of
Advanced Robotics, Istituto Italiano di Tecnologia (IIT), (2) Toyota Research
Institute (TRI))
|
The Actuation-consistent Wrench Polytope (AWP) and the Feasible Wrench
Polytope (FWP)
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The motivation of our current research is to devise motion planners for
legged locomotion that are able to exploit the robot's actuation capabilities.
This means, when possible, to minimize joint torques or to propel as much as
admissible when required. For this reason we define two new 6 dimensional
bounded polytopes that we name Actuation-consistent Wrench Polytope (AWP) and
Feasible Wrench Polytope (FWP). These objects turn out to be very useful in
motion planning for the definition of constraints on the accelerations of the
Center of Mass of the robot that respect the friction cones and the actuation
limits. The AWP and the FWP could be used also in the robot design phase to
size the actuators of the system based on some predefined reference motion.
|
[
{
"version": "v1",
"created": "Thu, 7 Dec 2017 17:23:07 GMT"
}
] | 2017-12-08T00:00:00 |
[
[
"Orsolino",
"Romeo",
""
],
[
"Focchi",
"Michele",
""
],
[
"Mastalli",
"Carlos",
""
],
[
"Dai",
"Hongkai",
""
],
[
"Caldwell",
"Darwin G.",
""
],
[
"Semini",
"Claudio",
""
]
] |
new_dataset
| 0.99477 |
1704.03627
|
Ting-Hao Huang
|
Ting-Hao 'Kenneth' Huang, Yun-Nung Chen, Jeffrey P. Bigham
|
Real-time On-Demand Crowd-powered Entity Extraction
|
Accepted by the 5th Edition Of The Collective Intelligence Conference
(CI 2017) as an oral presentation. Interface code and data are available at:
https://github.com/windx0303/dialogue-esp-game
| null | null | null |
cs.HC cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Output-agreement mechanisms such as ESP Game have been widely used in human
computation to obtain reliable human-generated labels. In this paper, we argue
that a "time-limited" output-agreement mechanism can be used to create a fast
and robust crowd-powered component in interactive systems, particularly
dialogue systems, to extract key information from user utterances on the fly.
Our experiments on Amazon Mechanical Turk using the Airline Travel Information
System (ATIS) dataset showed that the proposed approach achieves high-quality
results with an average response time shorter than 9 seconds.
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 05:48:18 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Dec 2017 17:12:12 GMT"
}
] | 2017-12-07T00:00:00 |
[
[
"Huang",
"Ting-Hao 'Kenneth'",
""
],
[
"Chen",
"Yun-Nung",
""
],
[
"Bigham",
"Jeffrey P.",
""
]
] |
new_dataset
| 0.981196 |
1704.04683
|
Guokun Lai
|
Guokun Lai, Qizhe Xie, Hanxiao Liu, Yiming Yang, Eduard Hovy
|
RACE: Large-scale ReAding Comprehension Dataset From Examinations
|
EMNLP 2017
| null | null | null |
cs.CL cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present RACE, a new dataset for benchmark evaluation of methods in the
reading comprehension task. Collected from the English exams for middle and
high school Chinese students in the age range between 12 to 18, RACE consists
of near 28,000 passages and near 100,000 questions generated by human experts
(English instructors), and covers a variety of topics which are carefully
designed for evaluating the students' ability in understanding and reasoning.
In particular, the proportion of questions that requires reasoning is much
larger in RACE than that in other benchmark datasets for reading comprehension,
and there is a significant gap between the performance of the state-of-the-art
models (43%) and the ceiling human performance (95%). We hope this new dataset
can serve as a valuable resource for research and evaluation in machine
comprehension. The dataset is freely available at
http://www.cs.cmu.edu/~glai1/data/race/ and the code is available at
https://github.com/qizhex/RACE_AR_baselines.
|
[
{
"version": "v1",
"created": "Sat, 15 Apr 2017 19:31:41 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Apr 2017 15:47:40 GMT"
},
{
"version": "v3",
"created": "Sat, 10 Jun 2017 03:21:55 GMT"
},
{
"version": "v4",
"created": "Sat, 15 Jul 2017 18:48:57 GMT"
},
{
"version": "v5",
"created": "Tue, 5 Dec 2017 19:36:03 GMT"
}
] | 2017-12-07T00:00:00 |
[
[
"Lai",
"Guokun",
""
],
[
"Xie",
"Qizhe",
""
],
[
"Liu",
"Hanxiao",
""
],
[
"Yang",
"Yiming",
""
],
[
"Hovy",
"Eduard",
""
]
] |
new_dataset
| 0.999826 |
1706.00069
|
Qiyu Zhi
|
Qiyu Zhi, Ronald Metoyer
|
Recognizing Handwritten Source Code
|
7 pages, 6 figures, Proceedings of the 2017 Graphics Interface
conference
| null |
10.20380/GI2017.21
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Supporting programming on touchscreen devices requires effective text input
and editing methods. Unfortunately, the virtual keyboard can be inefficient and
uses valuable screen space on already small devices. Recent advances in stylus
input make handwriting a potentially viable text input solution for programming
on touchscreen devices. The primary barrier, however, is that handwriting
recognition systems are built to take advantage of the rules of natural
language, not those of a programming language. In this paper, we explore this
particular problem of handwriting recognition for source code. We collect and
make publicly available a dataset of handwritten Python code samples from 15
participants and we characterize the typical recognition errors for this
handwritten Python source code when using a state-of-the-art handwriting
recognition tool. We present an approach to improve the recognition accuracy by
augmenting a handwriting recognizer with the programming language grammar
rules. Our experiment on the collected dataset shows an 8.6% word error rate
and a 3.6% character error rate which outperforms standard handwriting
recognition systems and compares favorably to typing source code on virtual
keyboards.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2017 20:07:12 GMT"
}
] | 2017-12-07T00:00:00 |
[
[
"Zhi",
"Qiyu",
""
],
[
"Metoyer",
"Ronald",
""
]
] |
new_dataset
| 0.998192 |
1712.02167
|
Dragoi Vlad
|
Vlad Dragoi and Herv\'e Tal\'e Kalachi
|
Cryptanalysis of a public key encryption scheme based on QC-LDPC and
QC-MDPC codes
|
To be published in IEEE Communications Letters
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter presents a cryptanalysis of the modified McEliece cryptosystem
recently proposed by Moufek, Guenda and Gulliver [24]. The system is based on
the juxtaposition of quasi-cyclic LDPC and quasi-cyclic MDPC codes. The idea of
our attack is to find an alternative permutation matrix together with an
equivalent LDPC code which allow the decoding of any cipher-text with a very
high probability. We also apply a recent technique to determine weak keys [4]
for this scheme. The results show that the probability of weak keys is high
enough that this variant can be ruled out as a possible secure encryption
scheme.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 12:57:42 GMT"
}
] | 2017-12-07T00:00:00 |
[
[
"Dragoi",
"Vlad",
""
],
[
"Kalachi",
"Hervé Talé",
""
]
] |
new_dataset
| 0.993975 |
1712.02170
|
Yuliang Liu
|
Liu Yuliang, Jin Lianwen, Zhang Shuaitao and Zhang Sheng
|
Detecting Curve Text in the Wild: New Dataset and New Solution
|
9 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scene text detection has been made great progress in recent years. The
detection manners are evolving from axis-aligned rectangle to rotated rectangle
and further to quadrangle. However, current datasets contain very little curve
text, which can be widely observed in scene images such as signboard, product
name and so on. To raise the concerns of reading curve text in the wild, in
this paper, we construct a curve text dataset named CTW1500, which includes
over 10k text annotations in 1,500 images (1000 for training and 500 for
testing). Based on this dataset, we pioneering propose a polygon based curve
text detector (CTD) which can directly detect curve text without empirical
combination. Moreover, by seamlessly integrating the recurrent transverse and
longitudinal offset connection (TLOC), the proposed method can be end-to-end
trainable to learn the inherent connection among the position offsets. This
allows the CTD to explore context information instead of predicting points
independently, resulting in more smooth and accurate detection. We also propose
two simple but effective post-processing methods named non-polygon suppress
(NPS) and polygonal non-maximum suppression (PNMS) to further improve the
detection accuracy. Furthermore, the proposed approach in this paper is
designed in an universal manner, which can also be trained with rectangular or
quadrilateral bounding boxes without extra efforts. Experimental results on
CTW-1500 demonstrate our method with only a light backbone can outperform
state-of-the-art methods with a large margin. By evaluating only in the curve
or non-curve subset, the CTD + TLOC can still achieve the best results. Code is
available at https://github.com/Yuliang-Liu/Curve-Text-Detector.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 13:02:43 GMT"
}
] | 2017-12-07T00:00:00 |
[
[
"Yuliang",
"Liu",
""
],
[
"Lianwen",
"Jin",
""
],
[
"Shuaitao",
"Zhang",
""
],
[
"Sheng",
"Zhang",
""
]
] |
new_dataset
| 0.999619 |
1712.02186
|
Hu Xu
|
Hu Xu, Sihong Xie, Lei Shu, Philip S. Yu
|
Product Function Need Recognition via Semi-supervised Attention Network
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Functionality is of utmost importance to customers when they purchase
products. However, it is unclear to customers whether a product can really
satisfy their needs on functions. Further, missing functions may be
intentionally hidden by the manufacturers or the sellers. As a result, a
customer needs to spend a fair amount of time before purchasing or just
purchase the product on his/her own risk. In this paper, we first identify a
novel QA corpus that is dense on product functionality information
\footnote{The annotated corpus can be found at
\url{https://www.cs.uic.edu/~hxu/}.}. We then design a neural network called
Semi-supervised Attention Network (SAN) to discover product functions from
questions. This model leverages unlabeled data as contextual information to
perform semi-supervised sequence labeling. We conduct experiments to show that
the extracted function have both high coverage and accuracy, compared with a
wide spectrum of baselines.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 13:48:57 GMT"
}
] | 2017-12-07T00:00:00 |
[
[
"Xu",
"Hu",
""
],
[
"Xie",
"Sihong",
""
],
[
"Shu",
"Lei",
""
],
[
"Yu",
"Philip S.",
""
]
] |
new_dataset
| 0.956016 |
1302.2223
|
Marko Horvat
|
Marko Horvat, Anton Grbin, Gordan Gledec
|
WNtags: A Web-Based Tool For Image Labeling And Retrieval With Lexical
Ontologies
|
10 pages, 3 figures, published in 16th International Conference on
Knowledge-Based and Intelligent Information & Engineering Systems, 10-12 Sep
2012, San Sebastian, Spain
|
Frontiers in artificial intelligence and applications, 243, pp.
585-594 (2012)
| null | null |
cs.IR cs.AI cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ever growing number of image documents available on the Internet continuously
motivates research in better annotation models and more efficient retrieval
methods. Formal knowledge representation of objects and events in pictures,
their interaction as well as context complexity becomes no longer an option for
a quality image repository, but a necessity. We present an ontology-based
online image annotation tool WNtags and demonstrate its usefulness in several
typical multimedia retrieval tasks using International Affective Picture System
emotionally annotated image database. WNtags is built around WordNet lexical
ontology but considers Suggested Upper Merged Ontology as the preferred
labeling formalism. WNtags uses sets of weighted WordNet synsets as high-level
image semantic descriptors and query matching is performed with word stemming
and node distance metrics. We also elaborate our near future plans to expand
image content description with induced affect as in stimuli for research of
human emotion and attention.
|
[
{
"version": "v1",
"created": "Sat, 9 Feb 2013 11:49:19 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Dec 2017 18:50:48 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Horvat",
"Marko",
""
],
[
"Grbin",
"Anton",
""
],
[
"Gledec",
"Gordan",
""
]
] |
new_dataset
| 0.999523 |
1707.07833
|
Inwan Yoo
|
Inwan Yoo, David G. C. Hildebrand, Willie F. Tobin, Wei-Chung Allen
Lee, Won-Ki Jeong
|
ssEMnet: Serial-section Electron Microscopy Image Registration using a
Spatial Transformer Network with Learned Features
|
DLMIA 2017 accepted
| null |
10.1007/978-3-319-67558-9_29
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The alignment of serial-section electron microscopy (ssEM) images is critical
for efforts in neuroscience that seek to reconstruct neuronal circuits.
However, each ssEM plane contains densely packed structures that vary from one
section to the next, which makes matching features across images a challenge.
Advances in deep learning has resulted in unprecedented performance in similar
computer vision problems, but to our knowledge, they have not been successfully
applied to ssEM image co-registration. In this paper, we introduce a novel deep
network model that combines a spatial transformer for image deformation and a
convolutional autoencoder for unsupervised feature learning for robust ssEM
image alignment. This results in improved accuracy and robustness while
requiring substantially less user intervention than conventional methods. We
evaluate our method by comparing registration quality across several datasets.
|
[
{
"version": "v1",
"created": "Tue, 25 Jul 2017 06:50:34 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Dec 2017 06:56:20 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Yoo",
"Inwan",
""
],
[
"Hildebrand",
"David G. C.",
""
],
[
"Tobin",
"Willie F.",
""
],
[
"Lee",
"Wei-Chung Allen",
""
],
[
"Jeong",
"Won-Ki",
""
]
] |
new_dataset
| 0.996788 |
1709.03715
|
Stefano Bagnasco
|
Marco Aldinucci, Stefano Bagnasco, Stefano Lusso, Paolo Pasteris,
Sergio Rabellino and Sara Vallero
|
OCCAM: a flexible, multi-purpose and extendable HPC cluster
|
Accepted for publication in the Proceedings of CHEP2016, San
Francisco, USA
| null |
10.1088/1742-6596/898/8/082039
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Open Computing Cluster for Advanced data Manipulation (OCCAM) is a
multi-purpose flexible HPC cluster designed and operated by a collaboration
between the University of Torino and the Sezione di Torino of the Istituto
Nazionale di Fisica Nucleare. It is aimed at providing a flexible,
reconfigurable and extendable infrastructure to cater to a wide range of
different scientific computing use cases, including ones from solid-state
chemistry, high-energy physics, computer science, big data analytics,
computational biology, genomics and many others. Furthermore, it will serve as
a platform for R&D activities on computational technologies themselves, with
topics ranging from GPU acceleration to Cloud Computing technologies. A
heterogeneous and reconfigurable system like this poses a number of challenges
related to the frequency at which heterogeneous hardware resources might change
their availability and shareability status, which in turn affect methods and
means to allocate, manage, optimize, bill, monitor VMs, containers, virtual
farms, jobs, interactive bare-metal sessions, etc. This work describes some of
the use cases that prompted the design and construction of the HPC cluster, its
architecture and resource provisioning model, along with a first
characterization of its performance by some synthetic benchmark tools and a few
realistic use-case tests.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 07:40:51 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Aldinucci",
"Marco",
""
],
[
"Bagnasco",
"Stefano",
""
],
[
"Lusso",
"Stefano",
""
],
[
"Pasteris",
"Paolo",
""
],
[
"Rabellino",
"Sergio",
""
],
[
"Vallero",
"Sara",
""
]
] |
new_dataset
| 0.997862 |
1709.08605
|
Maxim Borisyak
|
Maxim Borisyak, Michail Usvyatsov, Michael Mulhearn, Chase Shimmin and
Andrey Ustyuzhanin
|
Muon Trigger for Mobile Phones
| null | null |
10.1088/1742-6596/898/3/032048
| null |
cs.CV astro-ph.IM physics.ins-det
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The CRAYFIS experiment proposes to use privately owned mobile phones as a
ground detector array for Ultra High Energy Cosmic Rays. Upon interacting with
Earth's atmosphere, these events produce extensive particle showers which can
be detected by cameras on mobile phones. A typical shower contains
minimally-ionizing particles such as muons. As these particles interact with
CMOS image sensors, they may leave tracks of faintly-activated pixels that are
sometimes hard to distinguish from random detector noise. Triggers that rely on
the presence of very bright pixels within an image frame are not efficient in
this case.
We present a trigger algorithm based on Convolutional Neural Networks which
selects images containing such tracks and are evaluated in a lazy manner: the
response of each successive layer is computed only if activation of the current
layer satisfies a continuation criterion. Usage of neural networks increases
the sensitivity considerably comparable with image thresholding, while the lazy
evaluation allows for execution of the trigger under the limited computational
power of mobile phones.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 17:15:09 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Borisyak",
"Maxim",
""
],
[
"Usvyatsov",
"Michail",
""
],
[
"Mulhearn",
"Michael",
""
],
[
"Shimmin",
"Chase",
""
],
[
"Ustyuzhanin",
"Andrey",
""
]
] |
new_dataset
| 0.99939 |
1711.01386
|
Yuan Yang
|
Yuan Yang, Pengtao Xie, Xin Gao, Carol Cheng, Christy Li, Hongbao
Zhang and Eric Xing
|
Predicting Discharge Medications at Admission Time Based on Deep
Learning
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Predicting discharge medications right after a patient being admitted is an
important clinical decision, which provides physicians with guidance on what
type of medication regimen to plan for and what possible changes on initial
medication may occur during an inpatient stay. It also facilitates medication
reconciliation process with easy detection of medication discrepancy at
discharge time to improve patient safety. However, since the information
available upon admission is limited and patients' condition may evolve during
an inpatient stay, these predictions could be a difficult decision for
physicians to make. In this work, we investigate how to leverage deep learning
technologies to assist physicians in predicting discharge medications based on
information documented in the admission note. We build a convolutional neural
network which takes an admission note as input and predicts the medications
placed on the patient at discharge time. Our method is able to distill semantic
patterns from unstructured and noisy texts, and is capable of capturing the
pharmacological correlations among medications. We evaluate our method on 25K
patient visits and compare with 4 strong baselines. Our methods demonstrate a
20% increase in macro-averaged F1 score than the best baseline.
|
[
{
"version": "v1",
"created": "Sat, 4 Nov 2017 03:04:40 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Nov 2017 19:33:22 GMT"
},
{
"version": "v3",
"created": "Tue, 5 Dec 2017 17:13:56 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Yang",
"Yuan",
""
],
[
"Xie",
"Pengtao",
""
],
[
"Gao",
"Xin",
""
],
[
"Cheng",
"Carol",
""
],
[
"Li",
"Christy",
""
],
[
"Zhang",
"Hongbao",
""
],
[
"Xing",
"Eric",
""
]
] |
new_dataset
| 0.972935 |
1711.03800
|
Arun Balajee Vasudevan
|
Arun Balajee Vasudevan, Dengxin Dai, Luc Van Gool
|
Object Referring in Visual Scene with Spoken Language
|
10 pages, Submitted to WACV 2018
| null | null | null |
cs.CV cs.CL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object referring has important applications, especially for human-machine
interaction. While having received great attention, the task is mainly attacked
with written language (text) as input rather than spoken language (speech),
which is more natural. This paper investigates Object Referring with Spoken
Language (ORSpoken) by presenting two datasets and one novel approach. Objects
are annotated with their locations in images, text descriptions and speech
descriptions. This makes the datasets ideal for multi-modality learning. The
approach is developed by carefully taking down ORSpoken problem into three
sub-problems and introducing task-specific vision-language interactions at the
corresponding levels. Experiments show that our method outperforms competing
methods consistently and significantly. The approach is also evaluated in the
presence of audio noise, showing the efficacy of the proposed vision-language
interaction methods in counteracting background noise.
|
[
{
"version": "v1",
"created": "Fri, 10 Nov 2017 13:04:55 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Dec 2017 15:12:24 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Vasudevan",
"Arun Balajee",
""
],
[
"Dai",
"Dengxin",
""
],
[
"Van Gool",
"Luc",
""
]
] |
new_dataset
| 0.999075 |
1712.00547
|
Tim Miller
|
Tim Miller, Piers Howe, Liz Sonenberg
|
Explainable AI: Beware of Inmates Running the Asylum Or: How I Learnt to
Stop Worrying and Love the Social and Behavioural Sciences
|
IJCAI 2017 Workshop on Explainable Artificial Intelligence (XAI)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In his seminal book `The Inmates are Running the Asylum: Why High-Tech
Products Drive Us Crazy And How To Restore The Sanity' [2004, Sams
Indianapolis, IN, USA], Alan Cooper argues that a major reason why software is
often poorly designed (from a user perspective) is that programmers are in
charge of design decisions, rather than interaction designers. As a result,
programmers design software for themselves, rather than for their target
audience, a phenomenon he refers to as the `inmates running the asylum'. This
paper argues that explainable AI risks a similar fate. While the re-emergence
of explainable AI is positive, this paper argues most of us as AI researchers
are building explanatory agents for ourselves, rather than for the intended
users. But explainable AI is more likely to succeed if researchers and
practitioners understand, adopt, implement, and improve models from the vast
and valuable bodies of research in philosophy, psychology, and cognitive
science, and if evaluation of these models is focused more on people than on
technology. From a light scan of literature, we demonstrate that there is
considerable scope to infuse more results from the social and behavioural
sciences into explainable AI, and present some key results from these fields
that are relevant to explainable AI.
|
[
{
"version": "v1",
"created": "Sat, 2 Dec 2017 04:21:14 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Dec 2017 04:23:25 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Miller",
"Tim",
""
],
[
"Howe",
"Piers",
""
],
[
"Sonenberg",
"Liz",
""
]
] |
new_dataset
| 0.999594 |
1712.01021
|
Florian Glaser
|
Florian Glaser and Stefan Mach and Abbas Rahimi and Frank K.
G\"urkaynak and Qiuting Huang and Luca Benini
|
An 826 MOPS, 210 uW/MHz Unum ALU in 65 nm
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To overcome the limitations of conventional floating-point number formats, an
interval arithmetic and variable-width storage format called universal number
(unum) has been recently introduced. This paper presents the first (to the best
of our knowledge) silicon implementation measurements of an
application-specific integrated circuit (ASIC) for unum floating-point
arithmetic. The designed chip includes a 128-bit wide unum arithmetic unit to
execute additions and subtractions, while also supporting lossless (for
intermediate results) and lossy (for external data movements) compression units
to exploit the memory usage reduction potential of the unum format. Our chip,
fabricated in a 65 nm CMOS process, achieves a maximum clock frequency of 413
MHz at 1.2 V with an average measured power of 210 uW/MHz.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 11:43:58 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Dec 2017 01:45:29 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Glaser",
"Florian",
""
],
[
"Mach",
"Stefan",
""
],
[
"Rahimi",
"Abbas",
""
],
[
"Gürkaynak",
"Frank K.",
""
],
[
"Huang",
"Qiuting",
""
],
[
"Benini",
"Luca",
""
]
] |
new_dataset
| 0.999287 |
1712.01359
|
Jae Shin Yoon
|
Jae Shin Yoon, Ziwei Li, Hyun Soo Park
|
3D Semantic Trajectory Reconstruction from 3D Pixel Continuum
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a method to reconstruct dense semantic trajectory stream
of human interactions in 3D from synchronized multiple videos. The interactions
inherently introduce self-occlusion and illumination/appearance/shape changes,
resulting in highly fragmented trajectory reconstruction with noisy and coarse
semantic labels. Our conjecture is that among many views, there exists a set of
views that can confidently recognize the visual semantic label of a 3D
trajectory. We introduce a new representation called 3D semantic map---a
probability distribution over the semantic labels per trajectory. We construct
the 3D semantic map by reasoning about visibility and 2D recognition confidence
based on view-pooling, i.e., finding the view that best represents the
semantics of the trajectory. Using the 3D semantic map, we precisely infer all
trajectory labels jointly by considering the affinity between long range
trajectories via estimating their local rigid transformations. This inference
quantitatively outperforms the baseline approaches in terms of predictive
validity, representation robustness, and affinity effectiveness. We demonstrate
that our algorithm can robustly compute the semantic labels of a large scale
trajectory set involving real-world human interactions with object, scenes, and
people.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 21:03:12 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Yoon",
"Jae Shin",
""
],
[
"Li",
"Ziwei",
""
],
[
"Park",
"Hyun Soo",
""
]
] |
new_dataset
| 0.964131 |
1712.01411
|
Ian Stewart
|
Ian Stewart and Stevie Chancellor and Munmun De Choudhury and Jacob
Eisenstein
|
#anorexia, #anarexia, #anarexyia: Characterizing Online Community
Practices with Orthographic Variation
| null | null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distinctive linguistic practices help communities build solidarity and
differentiate themselves from outsiders. In an online community, one such
practice is variation in orthography, which includes spelling, punctuation, and
capitalization. Using a dataset of over two million Instagram posts, we
investigate orthographic variation in a community that shares pro-eating
disorder (pro-ED) content. We find that not only does orthographic variation
grow more frequent over time, it also becomes more profound or deep, with
variants becoming increasingly distant from the original: as, for example,
#anarexyia is more distant than #anarexia from the original spelling #anorexia.
These changes are driven by newcomers, who adopt the most extreme linguistic
practices as they enter the community. Moreover, this behavior correlates with
engagement: the newcomers who adopt deeper orthographic variants tend to remain
active for longer in the community, and the posts that contain deeper variation
receive more positive feedback in the form of "likes." Previous work has linked
community membership change with language change, and our work casts this
connection in a new light, with newcomers driving an evolving practice, rather
than adapting to it. We also demonstrate the utility of orthographic variation
as a new lens to study sociolinguistic change in online communities,
particularly when the change results from an exogenous force such as a content
ban.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 23:27:11 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Stewart",
"Ian",
""
],
[
"Chancellor",
"Stevie",
""
],
[
"De Choudhury",
"Munmun",
""
],
[
"Eisenstein",
"Jacob",
""
]
] |
new_dataset
| 0.99968 |
1712.01429
|
Ot\'avio Penatti
|
Ot\'avio A. B. Penatti and Milton F. S. Santos
|
Human activity recognition from mobile inertial sensors using recurrence
plots
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inertial sensors are present in most mobile devices nowadays and such devices
are used by people during most of their daily activities. In this paper, we
present an approach for human activity recognition based on inertial sensors by
employing recurrence plots (RP) and visual descriptors. The pipeline of the
proposed approach is the following: compute RPs from sensor data, compute
visual features from RPs and use them in a machine learning protocol. As RPs
generate texture visual patterns, we transform the problem of sensor data
classification to a problem of texture classification. Experiments for
classifying human activities based on accelerometer data showed that the
proposed approach obtains the highest accuracies, outperforming time- and
frequency-domain features directly extracted from sensor data. The best results
are obtained when using RGB RPs, in which each RGB channel corresponds to the
RP of an independent accelerometer axis.
|
[
{
"version": "v1",
"created": "Tue, 5 Dec 2017 00:49:07 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Penatti",
"Otávio A. B.",
""
],
[
"Santos",
"Milton F. S.",
""
]
] |
new_dataset
| 0.998318 |
1712.01464
|
Parisa Hassanzadeh
|
Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip
|
Broadcast Caching Networks with Two Receivers and Multiple Correlated
Sources
|
in Proceedings of Asilomar Conference on Signals, Systems and
Computers, Pacific Grove, California, November 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The correlation among the content distributed across a cache-aided broadcast
network can be exploited to reduce the delivery load on the shared wireless
link. This paper considers a two-user three-file network with correlated
content, and studies its fundamental limits for the worst-case demand. A class
of achievable schemes based on a two-step source coding approach is proposed.
Library files are first compressed using Gray-Wyner source coding, and then
cached and delivered using a combination of correlation-unaware cache-aided
coded multicast schemes. The second step is interesting in its own right and
considers a multiple-request caching problem, whose solution requires coding in
the placement phase. A lower bound on the optimal peak rate-memory trade-off is
derived, which is used to evaluate the performance of the proposed scheme. It
is shown that for symmetric sources the two-step strategy achieves the lower
bound for large cache capacities, and it is within half of the joint entropy of
two of the sources conditioned on the third source for all other cache sizes.
|
[
{
"version": "v1",
"created": "Tue, 5 Dec 2017 03:32:17 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Hassanzadeh",
"Parisa",
""
],
[
"Tulino",
"Antonia M.",
""
],
[
"Llorca",
"Jaime",
""
],
[
"Erkip",
"Elza",
""
]
] |
new_dataset
| 0.978878 |
1712.01469
|
Weisheng Zhong
|
Weisheng Zhong, Fanglan Chen, Kaiqun Fu, Chang-Tien Lu
|
SAFEBIKE: A Bike-sharing Route Recommender with Availability Prediction
and Safe Routing
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents SAFEBIKE, a novel route recommendation system for
bike-sharing service that utilizes station information to infer the number of
available bikes in dock and recommend bike routes according to multiple factors
such as distance and safety level. The system consists of a station level
availability predictor that predicts bikes and docks amount at each station,
and an efficient route recommendation service that considers safety and
bike/dock availability factors. It targets users who are concerned about route
safeness and station availability. We demonstrate the system by utilizing Citi
Bike station availability and New York City crime data of Manhattan to show the
effectiveness of our approach. Integrated with real-time station availability
and historical crime data resources, our proposed system can effectively
recommend an optimal bike route and improve the travel experience of bike
users.
|
[
{
"version": "v1",
"created": "Tue, 5 Dec 2017 03:57:38 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Zhong",
"Weisheng",
""
],
[
"Chen",
"Fanglan",
""
],
[
"Fu",
"Kaiqun",
""
],
[
"Lu",
"Chang-Tien",
""
]
] |
new_dataset
| 0.999684 |
1712.01651
|
Shun Miao
|
Shun Miao, Sebastien Piat, Peter Fischer, Ahmet Tuysuzoglu, Philip
Mewes, Tommaso Mansi, Rui Liao
|
Dilated FCN for Multi-Agent 2D/3D Medical Image Registration
|
AAAI 2018
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
2D/3D image registration to align a 3D volume and 2D X-ray images is a
challenging problem due to its ill-posed nature and various artifacts presented
in 2D X-ray images. In this paper, we propose a multi-agent system with an auto
attention mechanism for robust and efficient 2D/3D image registration.
Specifically, an individual agent is trained with dilated Fully Convolutional
Network (FCN) to perform registration in a Markov Decision Process (MDP) by
observing a local region, and the final action is then taken based on the
proposals from multiple agents and weighted by their corresponding confidence
levels. The contributions of this paper are threefold. First, we formulate
2D/3D registration as a MDP with observations, actions, and rewards properly
defined with respect to X-ray imaging systems. Second, to handle various
artifacts in 2D X-ray images, multiple local agents are employed efficiently
via FCN-based structures, and an auto attention mechanism is proposed to favor
the proposals from regions with more reliable visual cues. Third, a dilated
FCN-based training mechanism is proposed to significantly reduce the Degree of
Freedom in the simulation of registration environment, and drastically improve
training efficiency by an order of magnitude compared to standard CNN-based
training method. We demonstrate that the proposed method achieves high
robustness on both spine cone beam Computed Tomography data with a low
signal-to-noise ratio and data from minimally invasive spine surgery where
severe image artifacts and occlusions are presented due to metal screws and
guide wires, outperforming other state-of-the-art methods (single agent-based
and optimization-based) by a large margin.
|
[
{
"version": "v1",
"created": "Wed, 22 Nov 2017 03:22:17 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Miao",
"Shun",
""
],
[
"Piat",
"Sebastien",
""
],
[
"Fischer",
"Peter",
""
],
[
"Tuysuzoglu",
"Ahmet",
""
],
[
"Mewes",
"Philip",
""
],
[
"Mansi",
"Tommaso",
""
],
[
"Liao",
"Rui",
""
]
] |
new_dataset
| 0.999569 |
1712.01700
|
Wellington Pinheiro dos Santos
|
Wellington Pinheiro dos Santos, Ricardo Emmanuel de Souza, Ascendino
Fl\'avio Dias e Silva, Pl\'inio Batista dos Santos Filho
|
Avalia\c{c}\~ao da doen\c{c}a de Alzheimer pela an\'alise multiespectral
de imagens DW-MR por redes RBF como alternativa aos mapas ADC
|
in Portuguese
|
Learning and Nonlinear Models, v. 4, p. 43-53, 2008
| null | null |
cs.CV eess.IV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Alzheimer's disease is the most common cause of dementia, yet difficult to
accurately diagnose without the use of invasive techniques, particularly at the
beginning of the disease. This work addresses the classification and analysis
of multispectral synthetic images composed by diffusion-weighted magnetic
resonance brain volumes for evaluation of the area of cerebrospinal fluid and
its correlation with the progression of Alzheimer's disease. A 1.5 T MR imaging
system was used to acquire all the images presented. The classification methods
are based on multilayer perceptrons and classifiers of radial basis function
networks. It is assumed that the classes of interest can be separated by
hyperquadrics. A polynomial network of degree 2 is used to classify the
original volumes, generating a ground-truth volume. The classification results
are used to improve the usual analysis by the map of apparent diffusion
coefficients.
|
[
{
"version": "v1",
"created": "Sun, 3 Dec 2017 19:02:00 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Santos",
"Wellington Pinheiro dos",
""
],
[
"de Souza",
"Ricardo Emmanuel",
""
],
[
"Silva",
"Ascendino Flávio Dias e",
""
],
[
"Filho",
"Plínio Batista dos Santos",
""
]
] |
new_dataset
| 0.998185 |
1712.01735
|
Qingzhi Liu
|
Qingzhi Liu, Wieger IJntema, Anass Drif, Przemys{\l}aw Pawe{\l}czak,
Marco Zuniga
|
WiPLoc: Perpetual Indoor Localization with RF Wireless Power Transfer
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indoor localization is a cornerstone of mobile services. Until now most of
the research effort has focused on achieving sub-meter localization accuracy
because many mobile applications depend on precise localization measurements.
In some scenarios, however, it is required to trade location accuracy for
system maintainability. For example, in large-scale deployments of indoor
networks, such as item-monitoring in smart buildings, attaining room-level
localization accuracy may be sufficient, but replacing the batteries of the
devices used for localization could lead to high operational costs. As indoor
localization systems grow in popularity it will be important to provide them
with full energy autonomy. To tackle this problem we propose WiPLoc: an indoor
localization system aimed at operating perpetually without batteries. Our
contributions are twofold. First, we propose a novel localization method that
exploits capture effect and orthogonal codes to operate at energy levels that
are low enough to operate within the energy budget provided by long-range
wireless power transmission. Second, we implement WiPLoc using off-the-shelf
components and test it extensively in a laboratory environment. Our test
results show that with WiPLoc one wireless charger per (16 m$^{\text{2}}$) room
can enable perpetual lifetime operation of mobile objects requiring
localization with an average accuracy of almost 90%.
|
[
{
"version": "v1",
"created": "Tue, 5 Dec 2017 16:19:23 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Liu",
"Qingzhi",
""
],
[
"IJntema",
"Wieger",
""
],
[
"Drif",
"Anass",
""
],
[
"Pawełczak",
"Przemysław",
""
],
[
"Zuniga",
"Marco",
""
]
] |
new_dataset
| 0.957797 |
1712.01794
|
Svetlana Kiritchenko
|
Svetlana Kiritchenko and Saif M. Mohammad
|
The Effect of Negators, Modals, and Degree Adverbs on Sentiment
Composition
|
In Proceedings of the 7th Workshop on Computational Approaches to
Subjectivity, Sentiment and Social Media Analysis (WASSA), San Diego,
California, 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Negators, modals, and degree adverbs can significantly affect the sentiment
of the words they modify. Often, their impact is modeled with simple
heuristics; although, recent work has shown that such heuristics do not capture
the true sentiment of multi-word phrases. We created a dataset of phrases that
include various negators, modals, and degree adverbs, as well as their
combinations. Both the phrases and their constituent content words were
annotated with real-valued scores of sentiment association. Using phrasal terms
in the created dataset, we analyze the impact of individual modifiers and the
average effect of the groups of modifiers on overall sentiment. We find that
the effect of modifiers varies substantially among the members of the same
group. Furthermore, each individual modifier can affect sentiment words in
different ways. Therefore, solutions based on statistical learning seem more
promising than fixed hand-crafted rules on the task of automatic sentiment
prediction.
|
[
{
"version": "v1",
"created": "Tue, 5 Dec 2017 18:17:43 GMT"
}
] | 2017-12-06T00:00:00 |
[
[
"Kiritchenko",
"Svetlana",
""
],
[
"Mohammad",
"Saif M.",
""
]
] |
new_dataset
| 0.994231 |
1612.01352
|
Jincheng Dai
|
Kai Niu, Jincheng Dai, Kai Chen, Jiaru Lin, Q. T. Zhang and Athanasios
V. Vasilakos
|
Rate-Compatible Punctured Polar Codes: Optimal Construction Based on
Polar Spectra
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are the first class of constructive channel codes achieving the
symmetric capacity of the binary-input discrete memoryless channels. But the
corresponding code length is limited to the power of two. In this paper, we
establish a systematic framework to design the rate-compatible punctured polar
(RCPP) codes with arbitrary code length. A new theoretic tool, called polar
spectra, is proposed to count the number of paths on the code tree with the
same number of zeros or ones respectively. Furthermore, a spectrum distance SD0
(SD1) and a joint spectrum distance (JSD) are presented as performance criteria
to optimize the puncturing tables. For the capacity-zero puncturing mode
(punctured bits are unknown to the decoder), we propose a quasi-uniform
puncturing algorithm, analyze the number of equivalent puncturings and prove
that this scheme can maximize SD1 and JSD. Similarly, for the capacity-one mode
(punctured bits are known to the decoder), we also devise a reversal
quasi-uniform puncturing scheme and prove that it has the maximum SD0 and JSD.
Both schemes have a universal puncturing table without any exhausted search.
These optimal RCPP codes outperform the performance of turbo codes in LTE
wireless communication systems.
|
[
{
"version": "v1",
"created": "Mon, 5 Dec 2016 13:48:39 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Dec 2017 02:46:35 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Niu",
"Kai",
""
],
[
"Dai",
"Jincheng",
""
],
[
"Chen",
"Kai",
""
],
[
"Lin",
"Jiaru",
""
],
[
"Zhang",
"Q. T.",
""
],
[
"Vasilakos",
"Athanasios V.",
""
]
] |
new_dataset
| 0.997434 |
1701.06188
|
Seyyed Mohammadreza Azimi
|
Seyyed Mohammadreza Azimi, Osvaldo Simeone, Avik Sengupta and Ravi
Tandon
|
Online Edge Caching in Fog-Aided Wireless Network
|
20 pages, 5 figures, Please see the updated version arXiv:1711.10430
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a Fog Radio Access Network (F-RAN) architecture, edge nodes (ENs), such as
base stations, are equipped with limited-capacity caches, as well as with
fronthaul links that can support given transmission rates from a cloud
processor. Existing information-theoretic analyses of content delivery in
F-RANs have focused on offline caching with separate content placement and
delivery phases. In contrast, this work considers an online caching set-up, in
which the set of popular files is time-varying and both cache replenishment and
content delivery can take place in each time slot. The analysis is centered on
the characterization of the long-term Normalized Delivery Time (NDT), which
captures the temporal dependence of the coding latencies accrued across
multiple time slots in the high signal-to- noise ratio regime. Online caching
and delivery schemes based on reactive and proactive caching are investigated,
and their performance is compared to optimal offline caching schemes both
analytically and via numerical results.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2017 17:09:15 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Jan 2017 06:12:45 GMT"
},
{
"version": "v3",
"created": "Wed, 10 May 2017 02:21:23 GMT"
},
{
"version": "v4",
"created": "Sun, 3 Dec 2017 18:07:23 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Azimi",
"Seyyed Mohammadreza",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Sengupta",
"Avik",
""
],
[
"Tandon",
"Ravi",
""
]
] |
new_dataset
| 0.998427 |
1703.04968
|
Youcef Maouche
|
Hongwei Liu, Youcef Maouche
|
Two-Weight and a Few Weights Trace Codes over
$\mathbb{F}_{q}+u\mathbb{F}_{q}$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any
positive divisor $e$ of $q-1$, we construct an infinite family codes of size
$q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the
ring $R=\mathbb{F}_q + u\mathbb{F}_q$, $u^2 = 0$. Using Gauss sums, their Lee
weight distributions are provided. When $\gcd(e,m)=1$, we obtain an infinite
family of two-weight codes over the finite field $\mathbb{F}_q$ which meet the
Griesmer bound. Moreover, when $\gcd(e,m)=2, 3$ or $4$ we construct new
infinite family codes with at most five-weight.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 06:50:54 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Dec 2017 07:04:00 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Liu",
"Hongwei",
""
],
[
"Maouche",
"Youcef",
""
]
] |
new_dataset
| 0.999879 |
1703.08906
|
Hongzhi Guo
|
Hongzhi Guo, Josep Miquel Jornet, Qiaoqiang Gan, and Zhi Sun
|
Cooperative Raman Spectroscopy for Real-time In Vivo Nano-biosensing
| null |
IEEE Transactions on NanoBioscience ( Volume: 16, Issue: 7, Oct.
2017 )
|
10.1109/TNB.2017.2749183
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last few decades, the development of miniature biological sensors that
can detect and measure different phenomena at the nanoscale has led to
transformative disease diagnosis and treatment techniques. Among others,
biofunctional Raman nanoparticles have been utilized in vitro and in vivo for
multiplexed diagnosis and detection of different biological agents. However,
existing solutions require the use of bulky lasers to excite the nanoparticles
and similarly bulky and expensive spectrometers to measure the scattered Raman
signals, which limit the practicality and applications of this nano-biosensing
technique. In addition, due to the high path loss of the intra-body
environment, the received signals are usually very weak, which hampers the
accuracy of the measurements. In this paper, the concept of cooperative Raman
spectrum reconstruction for real-time in vivo nano-biosensing is presented for
the first time. The fundamental idea is to replace the single excitation and
measurement points (i.e., the laser and the spectrometer, respectively) by a
network of interconnected nano-devices that can simultaneously excite and
measure nano-biosensing particles. More specifically, in the proposed system a
large number of nanosensors jointly and distributively collect the Raman
response of nano-biofunctional nanoparticles (NBPs) traveling through the blood
vessels. This paper presents a detailed description of the sensing system and,
more importantly, proves its feasibility, by utilizing accurate models of
optical signal propagation in intra-body environment and low-complexity
estimation algorithms. The numerical results show that with a certain density
of NBPs, the reconstructed Raman spectrum can be recovered and utilized to
accurately extract the targeting intra-body information.
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 02:36:19 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Guo",
"Hongzhi",
""
],
[
"Jornet",
"Josep Miquel",
""
],
[
"Gan",
"Qiaoqiang",
""
],
[
"Sun",
"Zhi",
""
]
] |
new_dataset
| 0.996338 |
1709.06916
|
Haizhong Zheng
|
Haizhong Zheng, Minhui Xue, Hao Lu, Shuang Hao, Haojin Zhu, Xiaohui
Liang, and Keith Ross
|
Smoke Screener or Straight Shooter: Detecting Elite Sybil Attacks in
User-Review Social Networks
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Popular User-Review Social Networks (URSNs)---such as Dianping, Yelp, and
Amazon---are often the targets of reputation attacks in which fake reviews are
posted in order to boost or diminish the ratings of listed products and
services. These attacks often emanate from a collection of accounts, called
Sybils, which are collectively managed by a group of real users. A new advanced
scheme, which we term elite Sybil attacks, recruits organically highly-rated
accounts to generate seemingly-trustworthy and realistic-looking reviews. These
elite Sybil accounts taken together form a large-scale sparsely-knit Sybil
network for which existing Sybil fake-review defense systems are unlikely to
succeed. In this paper, we conduct the first study to define, characterize, and
detect elite Sybil attacks. We show that contemporary elite Sybil attacks have
a hybrid architecture, with the first tier recruiting elite Sybil workers and
distributing tasks by Sybil organizers, and with the second tier posting fake
reviews for profit by elite Sybil workers. We design ElsieDet, a three-stage
Sybil detection scheme, which first separates out suspicious groups of users,
then identifies the campaign windows, and finally identifies elite Sybil users
participating in the campaigns. We perform a large-scale empirical study on ten
million reviews from Dianping, by far the most popular URSN service in China.
Our results show that reviews from elite Sybil users are more spread out
temporally, craft more convincing reviews, and have higher filter bypass rates.
We also measure the impact of Sybil campaigns on various industries (such as
cinemas, hotels, restaurants) as well as chain stores, and demonstrate that
monitoring elite Sybil users over time can provide valuable early alerts
against Sybil campaigns.
|
[
{
"version": "v1",
"created": "Wed, 20 Sep 2017 15:01:36 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Dec 2017 13:20:55 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Zheng",
"Haizhong",
""
],
[
"Xue",
"Minhui",
""
],
[
"Lu",
"Hao",
""
],
[
"Hao",
"Shuang",
""
],
[
"Zhu",
"Haojin",
""
],
[
"Liang",
"Xiaohui",
""
],
[
"Ross",
"Keith",
""
]
] |
new_dataset
| 0.991378 |
1710.10088
|
Rong Kang
|
Rong Kang, Chen Wang, Peng Wang, Yuting Ding, Jianmin Wang
|
Fine-grained Pattern Matching Over Streaming Time Series
|
14 pages, 14 figures, 29 conference
| null | null | null |
cs.CV cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pattern matching of streaming time series with lower latency under limited
computing resource comes to a critical problem, especially as the growth of
Industry 4.0 and Industry Internet of Things. However, against traditional
single pattern matching problem, a pattern may contain multiple segments
representing different statistical properties or physical meanings for more
precise and expressive matching in real world. Hence, we formulate a new
problem, called "fine-grained pattern matching", which allows users to specify
varied granularities of matching deviation to different segments of a given
pattern, and fuzzy regions for adaptive breakpoints determination between
consecutive segments. In this paper, we propose a novel two-phase approach. In
the pruning phase, we introduce Equal-Length Block (ELB) representation
together with Block-Skipping Pruning (BSP) policy, which guarantees low cost
feature calculation, effective pruning and no false dismissals. In the
post-processing phase, a delta-function is proposed to enable us to conduct
exact matching in linear complexity. Extensive experiments are conducted to
evaluate on synthetic and real-world datasets, which illustrates that our
algorithm outperforms the brute-force method and MSM, a multi-step filter
mechanism over the multi-scaled representation.
|
[
{
"version": "v1",
"created": "Fri, 27 Oct 2017 11:45:14 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Nov 2017 02:51:43 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Dec 2017 23:45:48 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Kang",
"Rong",
""
],
[
"Wang",
"Chen",
""
],
[
"Wang",
"Peng",
""
],
[
"Ding",
"Yuting",
""
],
[
"Wang",
"Jianmin",
""
]
] |
new_dataset
| 0.979972 |
1711.05017
|
Morad Behandish
|
Morad Behandish and Horea T. Ilies
|
Haptic Assembly Using Skeletal Densities and Fourier Transforms
|
A shorter version was presented in ASME Computers and Information in
Engineering Conference (CIE'2015) (Best Paper Award)
|
ASME Transactions, Journal of ASME Transactions, Journal of
Computing and Information Science in Engineering, 16(2), p.021002, 2016
|
10.1115/1.4032696
|
CDL-TR-16-01
|
cs.HC cs.CG cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Haptic-assisted virtual assembly and prototyping has seen significant
attention over the past two decades. However, in spite of the appealing
prospects, its adoption has been slower than expected. We identify the main
roadblocks as the inherent geometric complexities faced when assembling objects
of arbitrary shape, and the computation time limitation imposed by the
notorious 1 kHz haptic refresh rate. We addressed the first problem in a recent
work by introducing a generic energy model for geometric guidance and
constraints between features of arbitrary shape. In the present work, we
address the second challenge by leveraging Fourier transforms to compute the
constraint forces and torques. Our new concept of 'geometric energy' field is
computed automatically from a cross-correlation of 'skeletal densities' in the
frequency domain, and serves as a generalization of the manually specified
virtual fixtures or heuristically identified mating constraints proposed in the
literature. The formulation of the energy field as a convolution enables
efficient computation using fast Fourier transforms (FFT) on the graphics
processing unit (GPU). We show that our method is effective for low-clearance
assembly of objects of arbitrary geometric and syntactic complexity.
|
[
{
"version": "v1",
"created": "Tue, 14 Nov 2017 09:30:56 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Behandish",
"Morad",
""
],
[
"Ilies",
"Horea T.",
""
]
] |
new_dataset
| 0.980617 |
1711.08819
|
Piotr Mirowski
|
Kory Wallace Mathewson and Piotr Mirowski
|
Improvised Comedy as a Turing Test
|
4 pages, 3 figures. Presented at 31st Conference on Neural
Information Processing Systems 2017. Workshop on Machine Learning for
Creativity and Design
| null | null | null |
cs.AI
|
http://creativecommons.org/licenses/by/4.0/
|
The best improvisational theatre actors can make any scene partner, of any
skill level or ability, appear talented and proficient in the art form, and
thus "make them shine". To challenge this improvisational paradigm, we built an
artificial intelligence (AI) trained to perform live shows alongside human
actors for human audiences. Over the course of 30 performances to a combined
audience of almost 3000 people, we have refined theatrical games which involve
combinations of human and (at times, adversarial) AI actors. We have developed
specific scene structures to include audience participants in interesting ways.
Finally, we developed a complete show structure that submitted the audience to
a Turing test and observed their suspension of disbelief, which we believe is
key for human/non-human theatre co-creation.
|
[
{
"version": "v1",
"created": "Thu, 23 Nov 2017 20:13:34 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Dec 2017 00:25:58 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Mathewson",
"Kory Wallace",
""
],
[
"Mirowski",
"Piotr",
""
]
] |
new_dataset
| 0.998706 |
1711.09313
|
Jameson Merkow
|
Jameson Merkow and Robert Lufkin and Kim Nguyen and Stefano Soatto and
Zhuowen Tu and Andrea Vedaldi
|
DeepRadiologyNet: Radiologist Level Pathology Detection in CT Head
Images
|
22 pages with references, 6 figures, 2 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a system to automatically filter clinically significant findings
from computerized tomography (CT) head scans, operating at performance levels
exceeding that of practicing radiologists. Our system, named DeepRadiologyNet,
builds on top of deep convolutional neural networks (CNNs) trained using
approximately 3.5 million CT head images gathered from over 24,000 studies
taken from January 1, 2015 to August 31, 2015 and January 1, 2016 to April 30
2016 in over 80 clinical sites. For our initial system, we identified 30
phenomenological traits to be recognized in the CT scans. To test the system,
we designed a clinical trial using over 4.8 million CT head images (29,925
studies), completely disjoint from the training and validation set, interpreted
by 35 US Board Certified radiologists with specialized CT head experience. We
measured clinically significant error rates to ascertain whether the
performance of DeepRadiologyNet was comparable to or better than that of US
Board Certified radiologists. DeepRadiologyNet achieved a clinically
significant miss rate of 0.0367% on automatically selected high-confidence
studies. Thus, DeepRadiologyNet enables significant reduction in the workload
of human radiologists by automatically filtering studies and reporting on the
high-confidence ones at an operating point well below the literal error rate
for US Board Certified radiologists, estimated at 0.82%.
|
[
{
"version": "v1",
"created": "Sun, 26 Nov 2017 00:30:45 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Nov 2017 18:17:29 GMT"
},
{
"version": "v3",
"created": "Sat, 2 Dec 2017 19:14:49 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Merkow",
"Jameson",
""
],
[
"Lufkin",
"Robert",
""
],
[
"Nguyen",
"Kim",
""
],
[
"Soatto",
"Stefano",
""
],
[
"Tu",
"Zhuowen",
""
],
[
"Vedaldi",
"Andrea",
""
]
] |
new_dataset
| 0.961565 |
1712.00238
|
Morad Behandish
|
Morad Behandish and Horea T. Ilies
|
Shape Complementarity Analysis for Objects of Arbitrary Shape
|
Technical Report, University of Connecticut, 2014
| null | null |
CDL-TR-14-01
|
cs.CG cs.CV cs.GR cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The basic problem of shape complementarity analysis appears fundamental to
applications as diverse as mechanical design, assembly automation, robot motion
planning, micro- and nano-fabrication, protein-ligand binding, and rational
drug design. However, the current challenge lies in the lack of a general
mathematical formulation that applies to objects of arbitrary shape. We propose
that a measure of shape complementarity can be obtained from the extent of
approximate overlap between shape skeletons. A space-continuous implicit
generalization of the skeleton, called the skeletal density function (SDF) is
defined over the Euclidean space that contains the individual assembly
partners. The SDF shape descriptors capture the essential features that are
relevant to proper contact alignment, and are considerably more robust than the
conventional explicit skeletal representations. We express the shape
complementarity score as a convolution of the individual SDFs. The problem then
breaks down to a global optimization of the score over the configuration space
of spatial relations, which can be efficiently implemented using fast Fourier
transforms (FFTs) on nonequispaced samples. We demonstrate the effectiveness of
the scoring approach for several examples from 2D peg-in-hole alignment to more
complex 3D examples in mechanical assembly and protein docking. We show that
the proposed method is reliable, inherently robust against small perturbations,
and effective in steering gradient-based optimization.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 09:07:14 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Behandish",
"Morad",
""
],
[
"Ilies",
"Horea T.",
""
]
] |
new_dataset
| 0.995557 |
1712.00686
|
Xiangying Chen
|
Xiangying Chen
|
Digraph Polynomials for Counting Cycles and Paths
|
18 pages, 5 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many polynomial invariants are defined on graphs for encoding the
combinatorial information and researching them algebraically. In this paper, we
introduce the cycle polynomial and the path polynomial of directed graphs for
counting cycles and paths, respectively. They satisfy recurrence relations with
respect to elementary edge or vertex operations. They are related to other
polynomials and can also be generalized to the bivariate cycle polynomial, the
bivariate path polynomial and the trivariate cycle-path polynomial. And a most
general digraph polynomial satisfying such a linear recurrence relation is
recursively defined and shown to be co-reducible to the trivariate cycle-path
polynomial. We also give an explicit expression of this polynomial.
|
[
{
"version": "v1",
"created": "Sun, 3 Dec 2017 00:26:25 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Chen",
"Xiangying",
""
]
] |
new_dataset
| 0.981971 |
1712.00714
|
Nader Akoury
|
Nader Akoury and Anh Nguyen
|
Spatial PixelCNN: Generating Images from Patches
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose Spatial PixelCNN, a conditional autoregressive model
that generates images from small patches. By conditioning on a grid of pixel
coordinates and global features extracted from a Variational Autoencoder (VAE),
we are able to train on patches of images, and reproduce the full-sized image.
We show that it not only allows for generating high quality samples at the same
resolution as the underlying dataset, but is also capable of upscaling images
to arbitrary resolutions (tested at resolutions up to $50\times$) on the MNIST
dataset. Compared to a PixelCNN++ baseline, Spatial PixelCNN quantitatively and
qualitatively achieves similar performance on the MNIST dataset.
|
[
{
"version": "v1",
"created": "Sun, 3 Dec 2017 06:02:23 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Akoury",
"Nader",
""
],
[
"Nguyen",
"Anh",
""
]
] |
new_dataset
| 0.999659 |
1712.00735
|
Takeshi Koshiba
|
Takeshi Koshiba
|
Fourier-based Function Secret Sharing with General Access Structure
|
12 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Function secret sharing (FSS) scheme is a mechanism that calculates a
function f(x) for x in {0,1}^n which is shared among p parties, by using
distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the
function f:{0,1}^n -> G is kept secret to the parties. Ohsawa et al. in 2017
observed that any function f can be described as a linear combination of the
basis functions by regarding the function space as a vector space of dimension
2^n and gave new FSS schemes based on the Fourier basis. All existing FSS
schemes are of (p,p)-threshold type. That is, to compute f(x), we have to
collect f_i(x) for all the distributed functions. In this paper, as in the
secret sharing schemes, we consider FSS schemes with any general access
structure. To do this, we observe that Fourier-based FSS schemes by Ohsawa et
al. are compatible with linear secret sharing scheme. By incorporating the
techniques of linear secret sharing with any general access structure into the
Fourier-based FSS schemes, we show Fourier-based FSS schemes with any general
access structure.
|
[
{
"version": "v1",
"created": "Sun, 3 Dec 2017 09:34:31 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Koshiba",
"Takeshi",
""
]
] |
new_dataset
| 0.983749 |
1712.00776
|
Petar Bojovi\'c D.
|
Petar D. Bojovic, K. Savic, A. Smiljanic
|
Multikast rutiranje open-source platformom - XORP
|
in Serbian. Published on e-RAF Journal on Computing (e-RAF JoC), 2010
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Integration of a software router into embedded systems is obtained
possibility of the most modern routers, at a much more affordable price.
Transfer services TV and radio signals over the IP network are only activated
by using multicast 1 protocol for routing. Multicast routing 2 is currently a
feature of only costly hardware solutions. The XORP open-source platform offers
multicast routing through a software router, with the ability to integrate into
cheap embedded platforms.
---- Integracijom softverskog rutera u embedded sisteme dobija se mogu\'cnost
najsavremenijih rutera, po znatno pristupa\v{c}nijoj ceni. Servisi prenosa TV i
radio signala preko IP mre\v{z}e, za\v{z}ivljavaju tek kori\v{s}\'cenjem
multikast 1 protokola za rutiranje. Multikast rutiranje 2 je trenutno funkcija
samo skupih hardverskih re\v{s}enja. XORP open-source platforma nudi multikast
rutiranje kroz softverski ruter, sa mogu\'cno\v{s}\'cu integracije u jeftine
embedded platforme.
|
[
{
"version": "v1",
"created": "Sun, 3 Dec 2017 14:45:10 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Bojovic",
"Petar D.",
""
],
[
"Savic",
"K.",
""
],
[
"Smiljanic",
"A.",
""
]
] |
new_dataset
| 0.999268 |
1712.00983
|
Zhen Mei
|
Zhen Mei, Bin Dai, Martin Johnston and Rolando Carrasco
|
Design of Polar Codes with Single and Multi-Carrier Modulation on
Impulsive Noise Channels using Density Evolution
|
5 pages, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, density evolution-based construction methods to design good
polar codes on impulsive noise channels for single-carrier and multi-carrier
systems are proposed and evaluated. For a single-carrier system, the tight
bound of the block error probability (BLEP) is derived by applying density
evolution and the performance of the proposed construction methods are
compared. For the multi-carrier system employing orthogonal frequency-division
multiplexing, the accurate BLEP estimation is not feasible so a tight lower
bound on the BLEP for polar codes is derived by assuming the noise on each
sub-carrier is Gaussian. The results show that the lower bound becomes tighter
as the number of carriers increases.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 10:05:09 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Mei",
"Zhen",
""
],
[
"Dai",
"Bin",
""
],
[
"Johnston",
"Martin",
""
],
[
"Carrasco",
"Rolando",
""
]
] |
new_dataset
| 0.991678 |
1712.01059
|
Qizheng He
|
Qizheng He, Jianan Wu, Gang Yu, Chi Zhang
|
SOT for MOT
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a robust tracker to solve the multiple object
tracking (MOT) problem, under the framework of tracking-by-detection. As the
first contribution, we innovatively combine single object tracking (SOT)
algorithms with multiple object tracking algorithms, and our results show that
SOT is a general way to strongly reduce the number of false negatives,
regardless of the quality of detection. Another contribution is that we show
with a deep learning based appearance model, it is easy to associate detections
of the same object efficiently and also with high accuracy. This appearance
model plays an important role in our MOT algorithm to correctly associate
detections into long trajectories, and also in our SOT algorithm to discover
new detections mistakenly missed by the detector. The deep neural network based
model ensures the robustness of our tracking algorithm, which can perform data
association in a wide variety of scenes. We ran comprehensive experiments on a
large-scale and challenging dataset, the MOT16 benchmark, and results showed
that our tracker achieved state-of-the-art performance based on both public and
private detections.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 13:22:31 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"He",
"Qizheng",
""
],
[
"Wu",
"Jianan",
""
],
[
"Yu",
"Gang",
""
],
[
"Zhang",
"Chi",
""
]
] |
new_dataset
| 0.966911 |
1712.01111
|
Chen Chen
|
Rui Hou, Chen Chen, Mubarak Shah
|
An End-to-end 3D Convolutional Neural Network for Action Detection and
Segmentation in Videos
|
arXiv admin note: substantial text overlap with arXiv:1703.10664
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an end-to-end 3D CNN for action detection and
segmentation in videos. The proposed architecture is a unified deep network
that is able to recognize and localize action based on 3D convolution features.
A video is first divided into equal length clips and next for each clip a set
of tube proposals are generated based on 3D CNN features. Finally, the tube
proposals of different clips are linked together and spatio-temporal action
detection is performed using these linked video proposals. This top-down action
detection approach explicitly relies on a set of good tube proposals to perform
well and training the bounding box regression usually requires a large number
of annotated samples. To remedy this, we further extend the 3D CNN to an
encoder-decoder structure and formulate the localization problem as action
segmentation. The foreground regions (i.e. action regions) for each frame are
segmented first then the segmented foreground maps are used to generate the
bounding boxes. This bottom-up approach effectively avoids tube proposal
generation by leveraging the pixel-wise annotations of segmentation. The
segmentation framework also can be readily applied to a general problem of
video object segmentation. Extensive experiments on several video datasets
demonstrate the superior performance of our approach for action detection and
video object segmentation compared to the state-of-the-arts.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 19:26:49 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Hou",
"Rui",
""
],
[
"Chen",
"Chen",
""
],
[
"Shah",
"Mubarak",
""
]
] |
new_dataset
| 0.972141 |
1712.01235
|
Abhinav Jauhri
|
Abhinav Jauhri, Carlee Joe-Wong, John Paul Shen
|
On the Real-time Vehicle Placement Problem
|
Presented at NIPS Workshop on Machine Learning for Intelligent
Transportation Systems, 2017
| null | null | null |
cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by ride-sharing platforms' efforts to reduce their riders' wait
times for a vehicle, this paper introduces a novel problem of placing vehicles
to fulfill real-time pickup requests in a spatially and temporally changing
environment. The real-time nature of this problem makes it fundamentally
different from other placement and scheduling problems, as it requires not only
real-time placement decisions but also handling real-time request dynamics,
which are influenced by human mobility patterns. We use a dataset of ten
million ride requests from four major U.S. cities to show that the requests
exhibit significant self-similarity. We then propose distributed online
learning algorithms for the real-time vehicle placement problem and bound their
expected performance under this observed self-similarity.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 18:21:38 GMT"
}
] | 2017-12-05T00:00:00 |
[
[
"Jauhri",
"Abhinav",
""
],
[
"Joe-Wong",
"Carlee",
""
],
[
"Shen",
"John Paul",
""
]
] |
new_dataset
| 0.999637 |
1608.00059
|
Shervin Minaee
|
Shervin Minaee, Amirali Abdolrashidi and Yao Wang
|
Face Recognition Using Scattering Convolutional Network
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face recognition has been an active research area in the past few decades. In
general, face recognition can be very challenging due to variations in
viewpoint, illumination, facial expression, etc. Therefore it is essential to
extract features which are invariant to some or all of these variations. Here a
new image representation, called scattering transform/network, has been used to
extract features from faces. The scattering transform is a kind of
convolutional network which provides a powerful multi-layer representation for
signals. After extraction of scattering features, PCA is applied to reduce the
dimensionality of the data and then a multi-class support vector machine is
used to perform recognition. The proposed algorithm has been tested on three
face datasets and achieved a very high recognition rate.
|
[
{
"version": "v1",
"created": "Sat, 30 Jul 2016 01:39:04 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Nov 2017 22:38:09 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Minaee",
"Shervin",
""
],
[
"Abdolrashidi",
"Amirali",
""
],
[
"Wang",
"Yao",
""
]
] |
new_dataset
| 0.966889 |
1608.03445
|
Thomas Maillart
|
Thomas Maillart, Mingyi Zhao, Jens Grossklags, and John Chuang
|
Given Enough Eyeballs, All Bugs Are Shallow? Revisiting Eric Raymond
with Bug Bounty Programs
|
19 pages, 3 figures, 1 table, forthcoming at Journal of Cybersecurity
(2017)
|
Journal of Cybersecurity, 2017
|
10.1093/cybsec/tyx008
|
tyx008
|
cs.CR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bug bounty programs offer a modern platform for organizations to crowdsource
their software security and for security researchers to be fairly rewarded for
the vulnerabilities they find. Little is known however on the incentives set by
bug bounty programs: How they drive new bug discoveries, and how they
supposedly improve security through the progressive exhaustion of discoverable
vulnerabilities. Here, we recognize that bug bounty programs create tensions,
for organizations running them on the one hand, and for security researchers on
the other hand. At the level of one bug bounty program, security researchers
face a sort of St-Petersburg paradox: The probability of finding additional
bugs decays fast, and thus can hardly be matched with a sufficient increase of
monetary rewards. Furthermore, bug bounty program managers have an incentive to
gather the largest possible crowd to ensure a larger pool of expertise, which
in turn increases competition among security researchers. As a result, we find
that researchers have high incentives to switch to newly launched programs, for
which a reserve of low-hanging fruit vulnerabilities is still available. Our
results inform on the technical and economic mechanisms underlying the dynamics
of bug bounty program contributions, and may in turn help improve the mechanism
design of bug bounty programs that get increasingly adopted by cybersecurity
savvy organizations.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 13:00:52 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Aug 2017 13:32:17 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Maillart",
"Thomas",
""
],
[
"Zhao",
"Mingyi",
""
],
[
"Grossklags",
"Jens",
""
],
[
"Chuang",
"John",
""
]
] |
new_dataset
| 0.987157 |
1702.05812
|
Andrew Miller
|
Andrew Miller and Iddo Bentov and Ranjit Kumaresan and Christopher
Cordi and Patrick McCorry
|
Sprites and State Channels: Payment Networks that Go Faster than
Lightning
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitcoin, Ethereum and other blockchain-based cryptocurrencies, as deployed
today, cannot scale for wide-spread use. A leading approach for cryptocurrency
scaling is a smart contract mechanism called a payment channel which enables
two mutually distrustful parties to transact efficiently (and only requires a
single transaction in the blockchain to set-up). Payment channels can be linked
together to form a payment network, such that payments between any two parties
can (usually) be routed through the network along a path that connects them.
Crucially, both parties can transact without trusting hops along the route.
In this paper, we propose a novel variant of payment channels, called
Sprites, that reduces the worst-case "collateral cost" that each hop along the
route may incur. The benefits of Sprites are two-fold. 1) In Lightning Network,
a payment across a path of $\ell$ channels requires locking up collateral for
$\Theta(\ell\Delta)$ time, where $\Delta$ is the time to commit an on-chain
transaction. Sprites reduces this cost to $O(\ell + \Delta)$. 2) Unlike prior
work, Sprites supports partial withdrawals and deposits, during which the
channel can continue to operate without interruption.
In evaluating Sprites we make several additional contributions. First, our
simulation-based security model is the first formalism to model timing
guarantees in payment channels. Our construction is also modular, making use of
a generic abstraction from folklore, called the "state channel," which we are
the first to formalize. We also provide a simulation framework for payment
network protocols, which we use to confirm that the Sprites construction
mitigates against throughput-reducing attacks.
|
[
{
"version": "v1",
"created": "Sun, 19 Feb 2017 22:29:09 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Nov 2017 22:59:07 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Miller",
"Andrew",
""
],
[
"Bentov",
"Iddo",
""
],
[
"Kumaresan",
"Ranjit",
""
],
[
"Cordi",
"Christopher",
""
],
[
"McCorry",
"Patrick",
""
]
] |
new_dataset
| 0.999504 |
1707.06325
|
Joohyung Lee
|
Joohyung Lee, Samidh Talsania, Yi Wang
|
Computing LPMLN Using ASP and MLN Solvers
|
Paper presented at the 33nd International Conference on Logic
Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017
16 pages, LaTeX, 3 PDF figures (arXiv:YYMM.NNNNN)
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LPMLN is a recent addition to probabilistic logic programming languages. Its
main idea is to overcome the rigid nature of the stable model semantics by
assigning a weight to each rule in a way similar to Markov Logic is defined. We
present two implementations of LPMLN, $\text{LPMLN2ASP}$ and
$\text{LPMLN2MLN}$. System $\text{LPMLN2ASP}$ translates LPMLN programs into
the input language of answer set solver $\text{CLINGO}$, and using weak
constraints and stable model enumeration, it can compute most probable stable
models as well as exact conditional and marginal probabilities. System
$\text{LPMLN2MLN}$ translates LPMLN programs into the input language of Markov
Logic solvers, such as $\text{ALCHEMY}$, $\text{TUFFY}$, and $\text{ROCKIT}$,
and allows for performing approximate probabilistic inference on LPMLN
programs. We also demonstrate the usefulness of the LPMLN systems for computing
other languages, such as ProbLog and Pearl's Causal Models, that are shown to
be translatable into LPMLN. (Under consideration for acceptance in TPLP)
|
[
{
"version": "v1",
"created": "Wed, 19 Jul 2017 23:38:47 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Jul 2017 20:04:27 GMT"
},
{
"version": "v3",
"created": "Thu, 30 Nov 2017 23:10:25 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Lee",
"Joohyung",
""
],
[
"Talsania",
"Samidh",
""
],
[
"Wang",
"Yi",
""
]
] |
new_dataset
| 0.992586 |
1711.08040
|
Sachin Mehta
|
Sachin Mehta, Hannaneh Hajishirzi, and Linda Shapiro
|
Identifying Most Walkable Direction for Navigation in an Outdoor
Environment
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an approach for identifying the most walkable direction for
navigation using a hand-held camera. Our approach extracts semantically rich
contextual information from the scene using a custom encoder-decoder
architecture for semantic segmentation and models the spatial and temporal
behavior of objects in the scene using a spatio-temporal graph. The system
learns to minimize a cost function over the spatial and temporal object
attributes to identify the most walkable direction. We construct a new
annotated navigation dataset collected using a hand-held mobile camera in an
unconstrained outdoor environment, which includes challenging settings such as
highly dynamic scenes, occlusion between objects, and distortions. Our system
achieves an accuracy of 84% on predicting a safe direction. We also show that
our custom segmentation network is both fast and accurate, achieving mIOU (mean
intersection over union) scores of 81 and 44.7 on the PASCAL VOC and the PASCAL
Context datasets, respectively, while running at about 21 frames per second.
|
[
{
"version": "v1",
"created": "Tue, 21 Nov 2017 21:15:33 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Dec 2017 03:18:52 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Mehta",
"Sachin",
""
],
[
"Hajishirzi",
"Hannaneh",
""
],
[
"Shapiro",
"Linda",
""
]
] |
new_dataset
| 0.999261 |
1711.09368
|
Siyu Zhou
|
Siyu Zhou, Weiqiang Zhao, Jiashi Feng, Hanjiang Lai, Yan Pan, Jian
Yin, Shuicheng Yan
|
Personalized and Occupational-aware Age Progression by Generative
Adversarial Networks
|
9 pages, 10 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face age progression, which aims to predict the future looks, is important
for various applications and has been received considerable attentions.
Existing methods and datasets are limited in exploring the effects of
occupations which may influence the personal appearances. In this paper, we
firstly introduce an occupational face aging dataset for studying the
influences of occupations on the appearances. It includes five occupations,
which enables the development of new algorithms for age progression and
facilitate future researches. Second, we propose a new occupational-aware
adversarial face aging network, which learns human aging process under
different occupations. Two factors are taken into consideration in our aging
process: personality-preserving and visually plausible texture change for
different occupations. We propose personalized network with personalized loss
in deep autoencoder network for keeping personalized facial characteristics,
and occupational-aware adversarial network with occupational-aware adversarial
loss for obtaining more realistic texture changes. Experimental results well
demonstrate the advantages of the proposed method by comparing with other
state-of-the-arts age progression methods.
|
[
{
"version": "v1",
"created": "Sun, 26 Nov 2017 10:50:56 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Dec 2017 06:58:03 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Zhou",
"Siyu",
""
],
[
"Zhao",
"Weiqiang",
""
],
[
"Feng",
"Jiashi",
""
],
[
"Lai",
"Hanjiang",
""
],
[
"Pan",
"Yan",
""
],
[
"Yin",
"Jian",
""
],
[
"Yan",
"Shuicheng",
""
]
] |
new_dataset
| 0.998267 |
1711.11543
|
Abhishek Das
|
Abhishek Das, Samyak Datta, Georgia Gkioxari, Stefan Lee, Devi Parikh,
Dhruv Batra
|
Embodied Question Answering
|
20 pages, 13 figures, Webpage: https://embodiedqa.org/
| null | null | null |
cs.CV cs.AI cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new AI task -- Embodied Question Answering (EmbodiedQA) -- where
an agent is spawned at a random location in a 3D environment and asked a
question ("What color is the car?"). In order to answer, the agent must first
intelligently navigate to explore the environment, gather information through
first-person (egocentric) vision, and then answer the question ("orange").
This challenging task requires a range of AI skills -- active perception,
language understanding, goal-driven navigation, commonsense reasoning, and
grounding of language into actions. In this work, we develop the environments,
end-to-end-trained reinforcement learning agents, and evaluation protocols for
EmbodiedQA.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 18:06:47 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Dec 2017 16:55:05 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Das",
"Abhishek",
""
],
[
"Datta",
"Samyak",
""
],
[
"Gkioxari",
"Georgia",
""
],
[
"Lee",
"Stefan",
""
],
[
"Parikh",
"Devi",
""
],
[
"Batra",
"Dhruv",
""
]
] |
new_dataset
| 0.986444 |
1712.00049
|
Shuai Sun
|
Jiaxin Peng, Shuai Sun, Vikram K. Narayana, Volker J. Sorger, Tarek
El-Ghazawi
|
Integrated Nanophotonics Architecture for Residue Number System
Arithmetic
|
7 pages, 5 figures
| null | null | null |
cs.ET physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Residue number system (RNS) enables dimensionality reduction of an arithmetic
problem by representing a large number as a set of smaller integers, where the
number is decomposed by prime number factorization using the moduli as basic
functions. These reduced problem sets can then be processed independently and
in parallel, thus improving computational efficiency and speed. Here we show an
optical RNS hardware representation based on integrated nanophotonics. The
digit-wise shifting in RNS arithmetic is expressed as spatial routing of an
optical signal in 2x2 hybrid photonic-plasmonic switches. Here the residue is
represented by spatially shifting the input waveguides relative to the routers
outputs, where the moduli are represented by the number of waveguides. By
cascading the photonic 2x2 switches, we design a photonic RNS adder and a
multiplier forming an all-to-all sparse directional network. The advantage of
this photonic arithmetic processor is the short (10's ps) computational
execution time given by the optical propagation delay through the integrated
nanophotonic router. Furthermore, we show how photonic processing
in-the-network leverages the natural parallelism of optics such as
wavelength-division-multiplexing or optical angular momentum in this RNS
processor. A key application for photonic RNS is the functional analysis
convolution with widespread usage in numerical linear algebra, computer vision,
language- image- and signal processing, and neural networks.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 19:46:57 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Peng",
"Jiaxin",
""
],
[
"Sun",
"Shuai",
""
],
[
"Narayana",
"Vikram K.",
""
],
[
"Sorger",
"Volker J.",
""
],
[
"El-Ghazawi",
"Tarek",
""
]
] |
new_dataset
| 0.963981 |
1712.00184
|
Chang-Ryeol Lee
|
Chang-Ryeol Lee, Kuk-Jin Yoon
|
Inertial-aided Rolling Shutter Relative Pose Estimation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Relative pose estimation is a fundamental problem in computer vision and it
has been studied for conventional global shutter cameras for decades. However,
recently, a rolling shutter camera has been widely used due to its low cost
imaging capability and, since the rolling shutter camera captures the image
line-by-line, the relative pose estimation of a rolling shutter camera is more
difficult than that of a global shutter camera. In this paper, we propose to
exploit inertial measurements (gravity and angular velocity) for the rolling
shutter relative pose estimation problem. The inertial measurements provide
information about the partial relative rotation between two views (cameras) and
the instantaneous motion that causes the rolling shutter distortion. Based on
this information, we simplify the rolling shutter relative pose estimation
problem and propose effective methods to solve it. Unlike the previous methods,
which require 44 (linear) or 17 (nonlinear) points with the uniform rolling
shutter camera model, the proposed methods require at most 9 or 11 points to
estimate the relative pose between the rolling shutter cameras. Experimental
results on synthetic data and the public PennCOSYVIO dataset show that the
proposed methods outperform the existing methods.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 04:16:36 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Lee",
"Chang-Ryeol",
""
],
[
"Yoon",
"Kuk-Jin",
""
]
] |
new_dataset
| 0.987087 |
1712.00206
|
Alessandro De Palma
|
Alessandro De Palma, Erik Hemberg, Una-May O'Reilly
|
Distributed Stratified Locality Sensitive Hashing for Critical Event
Prediction in the Cloud
|
Accepted poster at NIPS 2017 Workshop on Machine Learning for Health
(https://ml4health.github.io/2017/)
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The availability of massive healthcare data repositories calls for efficient
tools for data-driven medicine. We introduce a distributed system for
Stratified Locality Sensitive Hashing to perform fast similarity-based
prediction on large medical waveform datasets. Our implementation, for an ICU
use case, prioritizes latency over throughput and is targeted at a cloud
environment. We demonstrate our system on Acute Hypotensive Episode prediction
from Arterial Blood Pressure waveforms. On a dataset of $1.37$ million points,
we show scaling up to $40$ processors and a $21\times$ speedup in number of
comparisons to parallel exhaustive search at the price of a $10\%$ Matthews
correlation coefficient (MCC) loss. Furthermore, if additional MCC loss can be
tolerated, our system achieves speedups up to two orders of magnitude.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 06:23:22 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"De Palma",
"Alessandro",
""
],
[
"Hemberg",
"Erik",
""
],
[
"O'Reilly",
"Una-May",
""
]
] |
new_dataset
| 0.961971 |
1712.00282
|
Abhinav Kumar
|
Abhinav Kumar, Shantanu Gupta, Vladimir Kozitsky and Sriganesh
Madhvanath
|
Neural Signatures for Licence Plate Re-identification
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of vehicle licence plate re-identification is generally
considered as a one-shot image retrieval problem. The objective of this task is
to learn a feature representation (called a "signature") for licence plates.
Incoming licence plate images are converted to signatures and matched to a
previously collected template database through a distance measure. Then, the
input image is recognized as the template whose signature is "nearest" to the
input signature. The template database is restricted to contain only a single
signature per unique licence plate for our problem.
We measure the performance of deep convolutional net-based features adapted
from face recognition on this task. In addition, we also test a hybrid approach
combining the Fisher vector with a neural network-based embedding called "f2nn"
trained with the Triplet loss function. We find that the hybrid approach
performs comparably while providing computational benefits. The signature
generated by the hybrid approach also shows higher generalizability to datasets
more dissimilar to the training corpus.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 11:36:15 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Kumar",
"Abhinav",
""
],
[
"Gupta",
"Shantanu",
""
],
[
"Kozitsky",
"Vladimir",
""
],
[
"Madhvanath",
"Sriganesh",
""
]
] |
new_dataset
| 0.950775 |
1712.00375
|
Arpita Baral
|
Arpita Baral, Abhilash Gondane, Sanjib Sadhu, Priya Ranjan Sinha
Mahapatra
|
Maximum-width Axis-Parallel Empty Rectangular Annulus
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a set $P$ of $n$ points on $\mathbb R^{2}$, we address the problem of
computing an axis-parallel empty rectangular annulus $A$ of maximum-width such
that no point of $P$ lies inside $A$ but all points of $P$ must lie inside,
outside and on the boundaries of two parallel rectangles forming the annulus
$A$. We propose an $O(n^3)$ time and $O(n)$ space algorithm to solve the
problem. In a particular case when the inner rectangle of an axis-parallel
empty rectangular annulus reduces to an input point we can solve the problem in
$O(n \log n)$ time and $O(n)$ space.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 15:48:23 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Baral",
"Arpita",
""
],
[
"Gondane",
"Abhilash",
""
],
[
"Sadhu",
"Sanjib",
""
],
[
"Mahapatra",
"Priya Ranjan Sinha",
""
]
] |
new_dataset
| 0.998828 |
1712.00414
|
Andrew Adamatzky
|
Jordi Vallverdu, Oscar Castro, Richard Mayne, Max Talanov, Michael
Levin, Frantisek Baluska, Yukio Gunji, Audrey Dussutour, Hector Zenil, Andrew
Adamatzky
|
Slime mould: the fundamental mechanisms of cognition
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The slime mould Physarum polycephalum has been used in developing
unconventional computing devices for in which the slime mould played a role of
a sensing, actuating, and computing device. These devices treated the slime
mould rather as an active living substrate yet the slime mould is a
self-consistent living creature which evolved for millions of years and
occupied most part of the world, but in any case, that living entity did not
own true cognition, just automated biochemical mechanisms. To "rehabilitate"
the slime mould from the rank of a purely living electronics element to a
"creature of thoughts" we are analyzing the cognitive potential of P.
polycephalum. We base our theory of minimal cognition of the slime mould on a
bottom-up approach, from the biological and biophysical nature of the slime
mould and its regulatory systems using frameworks suh as Lyon's biogenic
cognition, Muller, di Primio-Lengeler\'s modifiable pathways, Bateson's
"patterns that connect" framework, Maturana's autopoetic network, or
proto-consciousness and Morgan's Canon.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 17:23:34 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Vallverdu",
"Jordi",
""
],
[
"Castro",
"Oscar",
""
],
[
"Mayne",
"Richard",
""
],
[
"Talanov",
"Max",
""
],
[
"Levin",
"Michael",
""
],
[
"Baluska",
"Frantisek",
""
],
[
"Gunji",
"Yukio",
""
],
[
"Dussutour",
"Audrey",
""
],
[
"Zenil",
"Hector",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.99745 |
1712.00423
|
Jerome Soumagne
|
M. Scot Breitenfeld, Neil Fortner, Jordan Henderson, Jerome Soumagne,
Mohamad Chaarawi, Johann Lombardi, Quincey Koziol
|
DAOS for Extreme-scale Systems in Scientific Applications
|
Submitted to HiPC-2017 on Jun 30 2017, accepted for publication on
Sep 8 2017, withdrawn on Oct 20 2017 b/c no author was able to present
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exascale I/O initiatives will require new and fully integrated I/O models
which are capable of providing straightforward functionality, fault tolerance
and efficiency. One solution is the Distributed Asynchronous Object Storage
(DAOS) technology, which is primarily designed to handle the next generation
NVRAM and NVMe technologies envisioned for providing a high bandwidth/IOPS
storage tier close to the compute nodes in an HPC system. In conjunction with
DAOS, the HDF5 library, an I/O library for scientific applications, will
support end-to-end data integrity, fault tolerance, object mapping, index
building and querying. This paper details the implementation and performance of
the HDF5 library built over DAOS by using three representative scientific
application codes.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 17:31:50 GMT"
}
] | 2017-12-04T00:00:00 |
[
[
"Breitenfeld",
"M. Scot",
""
],
[
"Fortner",
"Neil",
""
],
[
"Henderson",
"Jordan",
""
],
[
"Soumagne",
"Jerome",
""
],
[
"Chaarawi",
"Mohamad",
""
],
[
"Lombardi",
"Johann",
""
],
[
"Koziol",
"Quincey",
""
]
] |
new_dataset
| 0.998839 |
1711.11073
|
Sufian Hameed
|
Sufian Hameed, Sameet Farooq
|
The Art of Crypto Currencies: A Comprehensive Analysis of Popular Crypto
Currencies
|
10 pages, 8 figures
|
International Journal of Advanced Computer Science and
Applications(ijacsa), 7(12), 2016.
http://dx.doi.org/10.14569/IJACSA.2016.071255
|
10.14569/IJACSA.2016.071255
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crypto Currencies have recently gained enormous popularity amongst the
general public. With each passing day, more and more companies are radically
accepting crypto cur-rencies in their payment systems, paving way for an
economic revolution. Currently more than 700 crypto-currencies are avail-able
at Coindesk alone for trade purposes. As of November 2016, the Crypto
currencies hold a total market share of over 14 Billion USD1 [5]. With no
centralized institution to monitor the movement of funds, Crypto currencies and
their users are susceptible to multiple threats. In this paper we present an
effort to explain the functionality of some of the most popular crypto
currencies available in the online market. We present an analysis of the mining
methodologies employed by these currencies to induce new currency into the
market and how they compete with each other to provide fast, decentralized
transactions to the users. We also share, some of the most dangerous attacks
that can be placed on these crypto currencies and how the overall model of the
crypto currencies mitigates these attacks. Towards the end, we will present
taxonomy of the five highly popular crypto currencies and compare their
features.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 19:34:58 GMT"
}
] | 2017-12-01T00:00:00 |
[
[
"Hameed",
"Sufian",
""
],
[
"Farooq",
"Sameet",
""
]
] |
new_dataset
| 0.997587 |
1711.11403
|
Jose N. Franco-Riquelme
|
Jos\'e N. Franco-Riquelme, Isaac Lemus-Aguilar, Joaqu\'in
Ordieres-Mer\'e
|
KIBS Innovative Entrepreneurship Networks on Social Media
|
This paper was presented on the EU-SPRI Early Career Researcher
Conference (ECC) on Innovative Entrepreneurship. Politecnico di Milano
(POLIMI). Milan, Italy. November 23rd and 24th, 2017
| null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The analysis of the use of social media for innovative entrepreneurship in
the context has received little attention in the literature, especially in the
context of Knowledge Intensive Business Services (KIBS). Therefore, this paper
focuses on bridging this gap by applying text mining and sentiment analysis
techniques to identify the innovative entrepreneurship reflected by these
companies in their social media. Finally, we present and analyze the results of
our quantitative analysis of 23.483 posts based on eleven Spanish and Italian
consultancy KIBS Twitter Usernames and Keywords using data interpretation
techniques such as clustering and topic modeling. This paper suggests that
there is a significant gap between the perceived potential of social media and
the entrepreneurial behaviors at the social context in business-to-business
(B2B) companies.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 14:08:19 GMT"
}
] | 2017-12-01T00:00:00 |
[
[
"Franco-Riquelme",
"José N.",
""
],
[
"Lemus-Aguilar",
"Isaac",
""
],
[
"Ordieres-Meré",
"Joaquín",
""
]
] |
new_dataset
| 0.984075 |
1711.11438
|
EPTCS
|
Rajeev Alur (1), Dana Fisman (2), Rishabh Singh (3), Armando
Solar-Lezama (4) ((1) University of Pennsylvania, (2) Ben-Gurion University,
(3) Microsoft Research, Redmond, (4) Massachusetts Institute of Technology)
|
SyGuS-Comp 2017: Results and Analysis
|
In Proceedings SYNT 2017, arXiv:1711.10224. arXiv admin note: text
overlap with arXiv:1611.07627, arXiv:1602.01170
|
EPTCS 260, 2017, pp. 97-115
|
10.4204/EPTCS.260.9
| null |
cs.SE cs.LG cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an
implementation f that meets both a semantic constraint given by a logical
formula phi in a background theory T, and a syntactic constraint given by a
grammar G, which specifies the allowed set of candidate implementations. Such a
synthesis problem can be formally defined in SyGuS-IF, a language that is built
on top of SMT-LIB.
The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to
facilitate, bring together and accelerate research and development of efficient
solvers for SyGuS by providing a platform for evaluating different synthesis
techniques on a comprehensive set of benchmarks. In this year's competition six
new solvers competed on over 1500 benchmarks. This paper presents and analyses
the results of SyGuS-Comp'17.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 01:31:10 GMT"
}
] | 2017-12-01T00:00:00 |
[
[
"Alur",
"Rajeev",
""
],
[
"Fisman",
"Dana",
""
],
[
"Singh",
"Rishabh",
""
],
[
"Solar-Lezama",
"Armando",
""
]
] |
new_dataset
| 0.999108 |
1711.11439
|
EPTCS
|
Swen Jacobs (1), Nicolas Basset (2), Roderick Bloem (3), Romain
Brenguier (4), Maximilien Colange (5), Peter Faymonville (1), Bernd
Finkbeiner (1), Ayrat Khalimov (3), Felix Klein (1), Thibaud Michaud (5),
Guillermo A. P\'erez (2), Jean-Fran\c{c}ois Raskin (2), Ocan Sankur (6),
Leander Tentrup (1) ((1) Saarland University, (2) Universit\'e Libre de
Bruxelles, (3) Graz University of Technology, (4) University of Oxford, (5)
LRDE, EPITA, (6) CNRS, Irisa)
|
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks,
Participants & Results
|
In Proceedings SYNT 2017, arXiv:1711.10224. arXiv admin note: text
overlap with arXiv:1609.00507
|
EPTCS 260, 2017, pp. 116-143
|
10.4204/EPTCS.260.10
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We
introduce two new benchmark classes that have been added to the SYNTCOMP
library, and briefly describe the benchmark selection, evaluation scheme and
the experimental setup of SYNTCOMP 2017. We present the participants of
SYNTCOMP 2017, with a focus on changes with respect to the previous years and
on the two completely new tools that have entered the competition. Finally, we
present and analyze the results of our experimental evaluation, including a
ranking of tools with respect to quantity and quality of solutions.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 04:02:14 GMT"
}
] | 2017-12-01T00:00:00 |
[
[
"Jacobs",
"Swen",
""
],
[
"Basset",
"Nicolas",
""
],
[
"Bloem",
"Roderick",
""
],
[
"Brenguier",
"Romain",
""
],
[
"Colange",
"Maximilien",
""
],
[
"Faymonville",
"Peter",
""
],
[
"Finkbeiner",
"Bernd",
""
],
[
"Khalimov",
"Ayrat",
""
],
[
"Klein",
"Felix",
""
],
[
"Michaud",
"Thibaud",
""
],
[
"Pérez",
"Guillermo A.",
""
],
[
"Raskin",
"Jean-François",
""
],
[
"Sankur",
"Ocan",
""
],
[
"Tentrup",
"Leander",
""
]
] |
new_dataset
| 0.99815 |
1711.11460
|
Jianwei Qian
|
Jianwei Qian, Haohua Du, Jiahui Hou, Linlin Chen, Taeho Jung,
Xiang-Yang Li, Yu Wang, Yanbo Deng
|
VoiceMask: Anonymize and Sanitize Voice Input on Mobile Devices
| null | null | null | null |
cs.CR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice input has been tremendously improving the user experience of mobile
devices by freeing our hands from typing on the small screen. Speech
recognition is the key technology that powers voice input, and it is usually
outsourced to the cloud for the best performance. However, the cloud might
compromise users' privacy by identifying their identities by voice, learning
their sensitive input content via speech recognition, and then profiling the
mobile users based on the content. In this paper, we design an intermediate
between users and the cloud, named VoiceMask, to sanitize users' voice data
before sending it to the cloud for speech recognition. We analyze the potential
privacy risks and aim to protect users' identities and sensitive input content
from being disclosed to the cloud. VoiceMask adopts a carefully designed voice
conversion mechanism that is resistant to several attacks. Meanwhile, it
utilizes an evolution-based keyword substitution technique to sanitize the
voice input content. The two sanitization phases are all performed in the
resource-limited mobile device while still maintaining the usability and
accuracy of the cloud-supported speech recognition service. We implement the
voice sanitizer on Android systems and present extensive experimental results
that validate the effectiveness and efficiency of our app. It is demonstrated
that we are able to reduce the chance of a user's voice being identified from
50 people by 84% while keeping the drop of speech recognition accuracy within
14.2%.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 15:18:07 GMT"
}
] | 2017-12-01T00:00:00 |
[
[
"Qian",
"Jianwei",
""
],
[
"Du",
"Haohua",
""
],
[
"Hou",
"Jiahui",
""
],
[
"Chen",
"Linlin",
""
],
[
"Jung",
"Taeho",
""
],
[
"Li",
"Xiang-Yang",
""
],
[
"Wang",
"Yu",
""
],
[
"Deng",
"Yanbo",
""
]
] |
new_dataset
| 0.997989 |
1711.11487
|
Xueyuan Han
|
Xueyuan Han, Thomas Pasquier, Tanvi Ranjan, Mark Goldstein, Margo
Seltzer
|
FRAPpuccino: Fault-detection through Runtime Analysis of Provenance
|
7 pages, 2 figures, 1 table
|
Han, X., Pasquier, T., Ranjan, T., Goldstein, M. and Seltzer, M.,
2017. FRAPpuccino: Fault-detection through Runtime Analysis of Provenance
| null | null |
cs.SY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present FRAPpuccino (or FRAP), a provenance-based fault detection
mechanism for Platform as a Service (PaaS) users, who run many instances of an
application on a large cluster of machines. FRAP models, records, and analyzes
the behavior of an application and its impact on the system as a directed
acyclic provenance graph. It assumes that most instances behave normally and
uses their behavior to construct a model of legitimate behavior. Given a model
of legitimate behavior, FRAP uses a dynamic sliding window algorithm to compare
a new instance's execution to that of the model. Any instance that does not
conform to the model is identified as an anomaly. We present the FRAP prototype
and experimental results showing that it can accurately detect application
anomalies.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 16:09:17 GMT"
}
] | 2017-12-01T00:00:00 |
[
[
"Han",
"Xueyuan",
""
],
[
"Pasquier",
"Thomas",
""
],
[
"Ranjan",
"Tanvi",
""
],
[
"Goldstein",
"Mark",
""
],
[
"Seltzer",
"Margo",
""
]
] |
new_dataset
| 0.998085 |
1605.05850
|
Sevil Dr\"axler
|
Sevil Dr\"axler, Manuel Peuster, Holger Karl, Michael Bredel, Johannes
Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin, George
Xilouris
|
SONATA: Service Programming and Orchestration for Virtualized Software
Networks
| null | null |
10.1109/ICCW.2017.7962785
| null |
cs.SE cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In conventional large-scale networks, creation and management of network
services are costly and complex tasks that often consume a lot of resources,
including time and manpower. Network softwarization and network function
virtualization have been introduced to tackle these problems. They replace the
hardware-based network service components and network control mechanisms with
software components running on general-purpose hardware, aiming at decreasing
costs and complexity of implementing new services, maintaining the implemented
services, and managing available resources in service provisioning platforms
and underlying infrastructures. To experience the full potential of these
approaches, innovative development support tools and service provisioning
environments are needed. To answer these needs, we introduce the SONATA
architecture, a service programming, orchestration, and management framework.
We present a development toolchain for virtualized network services, fully
integrated with a service platform and orchestration system. We motivate the
modular and flexible architecture of our system and discuss its main components
and features, such as function- and service-specific managers that allow fine-
grained service management, slicing support to facilitate multi-tenancy,
recursiveness for improved scalability, and full-featured DevOps support.
|
[
{
"version": "v1",
"created": "Thu, 19 May 2016 08:45:23 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Dräxler",
"Sevil",
""
],
[
"Peuster",
"Manuel",
""
],
[
"Karl",
"Holger",
""
],
[
"Bredel",
"Michael",
""
],
[
"Lessmann",
"Johannes",
""
],
[
"Soenen",
"Thomas",
""
],
[
"Tavernier",
"Wouter",
""
],
[
"Mendel-Brin",
"Sharon",
""
],
[
"Xilouris",
"George",
""
]
] |
new_dataset
| 0.996648 |
1612.04631
|
Romain Bregier
|
Romain Br\'egier, Fr\'ed\'eric Devernay, Laetitia Leyrit, James
Crowley
|
Defining the Pose of any 3D Rigid Object and an Associated Distance
| null |
International Journal of Computer Vision, Springer Verlag, 2017
|
10.1007/s11263-017-1052-4
| null |
cs.CV math.MG physics.class-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The pose of a rigid object is usually regarded as a rigid transformation,
described by a translation and a rotation. However, equating the pose space
with the space of rigid transformations is in general abusive, as it does not
account for objects with proper symmetries -- which are common among man-made
objects.In this article, we define pose as a distinguishable static state of an
object, and equate a pose with a set of rigid transformations. Based solely on
geometric considerations, we propose a frame-invariant metric on the space of
possible poses, valid for any physical rigid object, and requiring no arbitrary
tuning. This distance can be evaluated efficiently using a representation of
poses within an Euclidean space of at most 12 dimensions depending on the
object's symmetries. This makes it possible to efficiently perform neighborhood
queries such as radius searches or k-nearest neighbor searches within a large
set of poses using off-the-shelf methods. Pose averaging considering this
metric can similarly be performed easily, using a projection function from the
Euclidean space onto the pose space. The practical value of those theoretical
developments is illustrated with an application of pose estimation of instances
of a 3D rigid object given an input depth map, via a Mean Shift procedure.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 13:46:55 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Aug 2017 09:24:46 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Nov 2017 14:10:04 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Brégier",
"Romain",
""
],
[
"Devernay",
"Frédéric",
""
],
[
"Leyrit",
"Laetitia",
""
],
[
"Crowley",
"James",
""
]
] |
new_dataset
| 0.999449 |
1704.00693
|
Istv\'an Z Reguly
|
Istvan Z Reguly, Gihan R Mudalige, Mike B Giles
|
Loop Tiling in Large-Scale Stencil Codes at Run-time with OPS
| null | null |
10.1109/TPDS.2017.2778161
| null |
cs.PF cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The key common bottleneck in most stencil codes is data movement, and prior
research has shown that improving data locality through optimisations that
schedule across loops do particularly well. However, in many large PDE
applications it is not possible to apply such optimisations through compilers
because there are many options, execution paths and data per grid point, many
dependent on run-time parameters, and the code is distributed across different
compilation units. In this paper, we adapt the data locality improving
optimisation called iteration space slicing for use in large OPS applications
both in shared-memory and distributed-memory systems, relying on run-time
analysis and delayed execution. We evaluate our approach on a number of
applications, observing speedups of 2$\times$ on the Cloverleaf 2D/3D proxy
application, which contain 83/141 loops respectively, $3.5\times$ on the linear
solver TeaLeaf, and $1.7\times$ on the compressible Navier-Stokes solver
OpenSBLI. We demonstrate strong and weak scalability up to 4608 cores of
CINECA's Marconi supercomputer. We also evaluate our algorithms on Intel's
Knights Landing, demonstrating maintained throughput as the problem size grows
beyond 16GB, and we do scaling studies up to 8704 cores. The approach is
generally applicable to any stencil DSL that provides per loop data access
information.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 17:16:39 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jun 2017 14:57:19 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Reguly",
"Istvan Z",
""
],
[
"Mudalige",
"Gihan R",
""
],
[
"Giles",
"Mike B",
""
]
] |
new_dataset
| 0.99868 |
1709.08767
|
Eliu Huerta
|
E. A. Huerta, Roland Haas, Edgar Fajardo, Daniel S. Katz, Stuart
Anderson, Peter Couvares, Josh Willis, Timothy Bouvet, Jeremy Enos, William
T. C. Kramer, Hon Wai Leong and David Wheeler
|
BOSS-LDG: A Novel Computational Framework that Brings Together Blue
Waters, Open Science Grid, Shifter and the LIGO Data Grid to Accelerate
Gravitational Wave Discovery
|
10 pages, 10 figures. Accepted as a Full Research Paper to the 13th
IEEE International Conference on eScience
|
2017 IEEE 13th International Conference on e-Science
|
10.1109/eScience.2017.47
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel computational framework that connects Blue Waters, the
NSF-supported, leadership-class supercomputer operated by NCSA, to the Laser
Interferometer Gravitational-Wave Observatory (LIGO) Data Grid via Open Science
Grid technology. To enable this computational infrastructure, we configured,
for the first time, a LIGO Data Grid Tier-1 Center that can submit
heterogeneous LIGO workflows using Open Science Grid facilities. In order to
enable a seamless connection between the LIGO Data Grid and Blue Waters via
Open Science Grid, we utilize Shifter to containerize LIGO's workflow software.
This work represents the first time Open Science Grid, Shifter, and Blue Waters
are unified to tackle a scientific problem and, in particular, it is the first
time a framework of this nature is used in the context of large scale
gravitational wave data analysis. This new framework has been used in the last
several weeks of LIGO's second discovery campaign to run the most
computationally demanding gravitational wave search workflows on Blue Waters,
and accelerate discovery in the emergent field of gravitational wave
astrophysics. We discuss the implications of this novel framework for a wider
ecosystem of Higher Performance Computing users.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2017 00:49:21 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Huerta",
"E. A.",
""
],
[
"Haas",
"Roland",
""
],
[
"Fajardo",
"Edgar",
""
],
[
"Katz",
"Daniel S.",
""
],
[
"Anderson",
"Stuart",
""
],
[
"Couvares",
"Peter",
""
],
[
"Willis",
"Josh",
""
],
[
"Bouvet",
"Timothy",
""
],
[
"Enos",
"Jeremy",
""
],
[
"Kramer",
"William T. C.",
""
],
[
"Leong",
"Hon Wai",
""
],
[
"Wheeler",
"David",
""
]
] |
new_dataset
| 0.995926 |
1710.06924
|
Xingchao Peng
|
Xingchao Peng, Ben Usman, Neela Kaushik, Judy Hoffman, Dequan Wang,
Kate Saenko
|
VisDA: The Visual Domain Adaptation Challenge
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the 2017 Visual Domain Adaptation (VisDA) dataset and challenge, a
large-scale testbed for unsupervised domain adaptation across visual domains.
Unsupervised domain adaptation aims to solve the real-world problem of domain
shift, where machine learning models trained on one domain must be transferred
and adapted to a novel visual domain without additional supervision. The
VisDA2017 challenge is focused on the simulation-to-reality shift and has two
associated tasks: image classification and image segmentation. The goal in both
tracks is to first train a model on simulated, synthetic data in the source
domain and then adapt it to perform well on real image data in the unlabeled
test domain. Our dataset is the largest one to date for cross-domain object
classification, with over 280K images across 12 categories in the combined
training, validation and testing domains. The image segmentation dataset is
also large-scale with over 30K images across 18 categories in the three
domains. We compare VisDA to existing cross-domain adaptation datasets and
provide a baseline performance analysis using various domain adaptation models
that are currently popular in the field.
|
[
{
"version": "v1",
"created": "Wed, 18 Oct 2017 20:20:49 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Nov 2017 04:04:18 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Peng",
"Xingchao",
""
],
[
"Usman",
"Ben",
""
],
[
"Kaushik",
"Neela",
""
],
[
"Hoffman",
"Judy",
""
],
[
"Wang",
"Dequan",
""
],
[
"Saenko",
"Kate",
""
]
] |
new_dataset
| 0.999398 |
1711.02293
|
Seokseong Jeon
|
Seokseong Jeon, Chansu Yu, Young-Joo Suh
|
Pre-shared Key Agreement for Secure Public Wi-Fi
| null | null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel pre-shared key (PSK) agreement scheme to
establish a secure connection between a Wi-Fi client and access point (AP)
without prior knowledge of a password. The standard IEEE 802.11 security
method, Robust Security Network Association, widely known as Wi-Fi Protected
Access (WPA) and WPA2, derives a shared cryptographic key if and only if a user
provides an identical password which an AP possesses, causing ofinconvenience
of obtaining and entering the password. In this paper, a proposed scheme,
Secure Open AP (SOAP), adopts two public key algorithms, the elliptic curve
Diffie-Hellman key exchange algorithm (ECDH) and digital signature algorithm
(ECDSA) to establish a secure connection between a client and an AP without
having prior knowledge of a password. Implementation and experiment results
demonstrate the viability of the proposed scheme.
|
[
{
"version": "v1",
"created": "Tue, 7 Nov 2017 05:34:46 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Nov 2017 06:31:48 GMT"
},
{
"version": "v3",
"created": "Sun, 26 Nov 2017 11:21:47 GMT"
},
{
"version": "v4",
"created": "Wed, 29 Nov 2017 11:47:45 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Jeon",
"Seokseong",
""
],
[
"Yu",
"Chansu",
""
],
[
"Suh",
"Young-Joo",
""
]
] |
new_dataset
| 0.998322 |
1711.10485
|
Xiaodong He
|
Tao Xu, Pengchuan Zhang, Qiuyuan Huang, Han Zhang, Zhe Gan, Xiaolei
Huang, and Xiaodong He
|
AttnGAN: Fine-Grained Text to Image Generation with Attentional
Generative Adversarial Networks
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an Attentional Generative Adversarial Network
(AttnGAN) that allows attention-driven, multi-stage refinement for fine-grained
text-to-image generation. With a novel attentional generative network, the
AttnGAN can synthesize fine-grained details at different subregions of the
image by paying attentions to the relevant words in the natural language
description. In addition, a deep attentional multimodal similarity model is
proposed to compute a fine-grained image-text matching loss for training the
generator. The proposed AttnGAN significantly outperforms the previous state of
the art, boosting the best reported inception score by 14.14% on the CUB
dataset and 170.25% on the more challenging COCO dataset. A detailed analysis
is also performed by visualizing the attention layers of the AttnGAN. It for
the first time shows that the layered attentional GAN is able to automatically
select the condition at the word level for generating different parts of the
image.
|
[
{
"version": "v1",
"created": "Tue, 28 Nov 2017 18:59:50 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Xu",
"Tao",
""
],
[
"Zhang",
"Pengchuan",
""
],
[
"Huang",
"Qiuyuan",
""
],
[
"Zhang",
"Han",
""
],
[
"Gan",
"Zhe",
""
],
[
"Huang",
"Xiaolei",
""
],
[
"He",
"Xiaodong",
""
]
] |
new_dataset
| 0.986041 |
1711.10579
|
Bin Wang
|
Bin Wang, John Bachan, Cy Chan
|
ExaGridPF: A Parallel Power Flow Solver for Transmission and Unbalanced
Distribution Systems
| null | null | null | null |
cs.CE cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates parallelization strategies for solving power flow
problems in both transmission and unbalanced, three-phase distribution systems
by developing a scalable power flow solver, ExaGridPF, which is compatible with
existing high-performance computing platforms. Newton-Raphson (NR) and
Newton-Krylov (NK) algorithms have been implemented to verify the performance
improvement over both standard IEEE test cases and synthesized grid topologies.
For three-phase, unbalanced system, we adapt the current injection method (CIM)
to model the power flow and utilize SuperLU to parallelize the computing load
across multiple threads. The experimental results indicate that more than 5
times speedup ratio can be achieved for synthesized large-scale transmission
topologies, and significant efficiency improvements are observed over existing
methods for the distribution networks.
|
[
{
"version": "v1",
"created": "Tue, 28 Nov 2017 21:57:14 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Wang",
"Bin",
""
],
[
"Bachan",
"John",
""
],
[
"Chan",
"Cy",
""
]
] |
new_dataset
| 0.997412 |
1711.10636
|
EPTCS
|
Roderick Bloem, Sven Schewe, Ayrat Khalimov
|
CTL* synthesis via LTL synthesis
|
In Proceedings SYNT 2017, arXiv:1711.10224
|
EPTCS 260, 2017, pp. 4-22
|
10.4204/EPTCS.260.4
| null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We reduce synthesis for CTL* properties to synthesis for LTL. In the context
of model checking this is impossible - CTL* is more expressive than LTL. Yet,
in synthesis we have knowledge of the system structure and we can add new
outputs. These outputs can be used to encode witnesses of the satisfaction of
CTL* subformulas directly into the system. This way, we construct an LTL
formula, over old and new outputs and original inputs, which is realisable if,
and only if, the original CTL* formula is realisable. The CTL*-via-LTL
synthesis approach preserves the problem complexity, although it might increase
the minimal system size. We implemented the reduction, and evaluated the
CTL*-via-LTL synthesiser on several examples.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 01:23:10 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Bloem",
"Roderick",
""
],
[
"Schewe",
"Sven",
""
],
[
"Khalimov",
"Ayrat",
""
]
] |
new_dataset
| 0.999449 |
1711.10651
|
Mhafuzul Islam
|
Mhafuzul Islam, Mashrur Chowdhury, Hongda Li, Hongxin Hu
|
Cybersecurity Attacks in Vehicle-to-Infrastructure (V2I) Applications
and their Prevention
|
22 pages, 4 figures, Will be published in the "2018 Transportation
Research Board Conference Proceedings
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A connected vehicle (CV) environment is composed of a diverse data
collection, data communication and dissemination, and computing infrastructure
systems that are vulnerable to the same cyberattacks as all traditional
computing environments. Cyberattacks can jeopardize the expected safety,
mobility, energy, and environmental benefits from connected vehicle
applications. As cyberattacks can lead to severe traffic incidents, it has
become one of the primary concerns in connected vehicle applications. In this
paper, we investigate the impact of cyberattacks on the
vehicle-to-infrastructure (V2I) network from a V2I application point of view.
Then, we develop a novel V2I cybersecurity architecture, named CVGuard, which
can detect and prevent cyberattacks on the V2I environment. In designing
CVGuard, key challenges, such as scalability, resiliency and future usability
were considered. A case study using a distributed denial of service (DDoS) on a
V2I application, i.e., the Stop Sign Gap Assist (SSGA) application, shows that
CVGuard was effective in mitigating the adverse effects created by a DDoS
attack. In our case study, because of the DDoS attack, conflicts between the
minor and major road vehicles occurred in an unsignalized intersection, which
could have caused potential crashes. A reduction of conflicts between vehicles
occurred because CVGuard was in operation. The reduction of conflicts was
compared based on the number of conflicts before and after the implementation
and operation of the CVGuard security platform. Analysis revealed that the
strategies adopted by the CVGuard were successful in reducing the inter-vehicle
conflicts by 60% where a DDoS attack compromised the SSGA application at an
unsignalized intersection.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 02:39:52 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Islam",
"Mhafuzul",
""
],
[
"Chowdhury",
"Mashrur",
""
],
[
"Li",
"Hongda",
""
],
[
"Hu",
"Hongxin",
""
]
] |
new_dataset
| 0.995289 |
1711.10693
|
Anthony Ortiz
|
Dalton Rosario, Christoph Borel, Damon Conover, Ryan McAlinden,
Anthony Ortiz, Sarah Shiver, Blair Simon
|
Small Drone Field Experiment: Data Collection & Processing
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Following an initiative formalized in April 2016 formally known as ARL West
between the U.S. Army Research Laboratory (ARL) and University of Southern
California's Institute for Creative Technologies (USC ICT), a field experiment
was coordinated and executed in the summer of 2016 by ARL, USC ICT, and
Headwall Photonics. The purpose was to image part of the USC main campus in Los
Angeles, USA, using two portable COTS (commercial off the shelf) aerial drone
solutions for data acquisition, for photogrammetry (3D reconstruction from
images), and fusion of hyperspectral data with the recovered set of 3D point
clouds representing the target area. The research aims for determining the
viability of having a machine capable of segmenting the target area into key
material classes (e.g., manmade structures, live vegetation, water) for use in
multiple purposes, to include providing the user with a more accurate scene
understanding and enabling the unsupervised automatic sampling of meaningful
material classes from the target area for adaptive semi-supervised machine
learning. In the latter, a target set library may be used for automatic machine
training with data of local material classes, as an example, to increase the
prediction chances of machines recognizing targets. The field experiment and
associated data post processing approach to correct for reflectance,
geo-rectify, recover the area's dense point clouds from images, register
spectral with elevation properties of scene surfaces from the independently
collected datasets, and generate the desired scene segmented maps are
discussed. Lessons learned from the experience are also highlighted throughout
the paper.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 06:08:16 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Rosario",
"Dalton",
""
],
[
"Borel",
"Christoph",
""
],
[
"Conover",
"Damon",
""
],
[
"McAlinden",
"Ryan",
""
],
[
"Ortiz",
"Anthony",
""
],
[
"Shiver",
"Sarah",
""
],
[
"Simon",
"Blair",
""
]
] |
new_dataset
| 0.980307 |
1711.10694
|
Wanchun Liu
|
Wanchun Liu, Ying-Chang Liang, Yonghui Li and Branka Vucetic
|
Backscatter Multiplicative Multiple-Access Systems: Fundamental Limits
and Practical Design
|
This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider a novel ambient backscatter multiple-access
system, where a receiver (Rx) simultaneously detects the signals transmitted
from an active transmitter (Tx) and a backscatter Tag. Specifically, the
information-carrying signal sent by the Tx arrives at the Rx through two
wireless channels: the direct channel from the Tx to the Rx, and the
backscatter channel from the Tx to the Tag and then to the Rx. The received
signal from the backscatter channel also carries the Tag's information because
of the multiplicative backscatter operation at the Tag. This multiple-access
system introduces a new channel model, referred to as multiplicative
multiple-access channel (M-MAC). We analyze the achievable rate region of the
M-MAC, and prove that its region is strictly larger than that of the
conventional time-division multiple-access scheme in many cases, including,
e.g., the high SNR regime and the case when the direct channel is much stronger
than the backscatter channel. Hence, the multiplicative multiple-access scheme
is an attractive technique to improve the throughput for ambient backscatter
communication systems. Moreover, we analyze the detection error rates for
coherent and noncoherent modulation schemes adopted by the Tx and the Tag,
respectively, in both synchronous and asynchronous scenarios, which further
bring interesting insights for practical system design.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 06:12:37 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Liu",
"Wanchun",
""
],
[
"Liang",
"Ying-Chang",
""
],
[
"Li",
"Yonghui",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.996071 |
1711.10703
|
Ying Tai
|
Yu Chen, Ying Tai, Xiaoming Liu, Chunhua Shen, Jian Yang
|
FSRNet: End-to-End Learning Face Super-Resolution with Facial Priors
|
Chen and Tai contributed equally to this paper
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face Super-Resolution (SR) is a domain-specific super-resolution problem. The
specific facial prior knowledge could be leveraged for better super-resolving
face images. We present a novel deep end-to-end trainable Face Super-Resolution
Network (FSRNet), which makes full use of the geometry prior, i.e., facial
landmark heatmaps and parsing maps, to super-resolve very low-resolution (LR)
face images without well-aligned requirement. Specifically, we first construct
a coarse SR network to recover a coarse high-resolution (HR) image. Then, the
coarse HR image is sent to two branches: a fine SR encoder and a prior
information estimation network, which extracts the image features, and
estimates landmark heatmaps/parsing maps respectively. Both image features and
prior information are sent to a fine SR decoder to recover the HR image. To
further generate realistic faces, we propose the Face Super-Resolution
Generative Adversarial Network (FSRGAN) to incorporate the adversarial loss
into FSRNet. Moreover, we introduce two related tasks, face alignment and
parsing, as the new evaluation metrics for face SR, which address the
inconsistency of classic metrics w.r.t. visual perception. Extensive benchmark
experiments show that FSRNet and FSRGAN significantly outperforms state of the
arts for very LR face SR, both quantitatively and qualitatively. Code will be
made available upon publication.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 06:47:04 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Chen",
"Yu",
""
],
[
"Tai",
"Ying",
""
],
[
"Liu",
"Xiaoming",
""
],
[
"Shen",
"Chunhua",
""
],
[
"Yang",
"Jian",
""
]
] |
new_dataset
| 0.973346 |
1711.10738
|
Guoru Ding Dr.
|
Guoru Ding, Qihui Wu, Linyuan Zhang, Yun Lin, Theodoros A. Tsiftsis,
and Yu-Dong Yao
|
An Amateur Drone Surveillance System Based on Cognitive Internet of
Things
| null |
IEEE Communications Magazine, 2018
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Drones, also known as mini-unmanned aerial vehicles, have attracted
increasing attention due to their boundless applications in communications,
photography, agriculture, surveillance and numerous public services. However,
the deployment of amateur drones poses various safety, security and privacy
threats. To cope with these challenges, amateur drone surveillance becomes a
very important but largely unexplored topic. In this article, we firstly
present a brief survey to show the state-of-the-art studies on amateur drone
surveillance. Then, we propose a vision, named Dragnet, by tailoring the recent
emerging cognitive internet of things framework for amateur drone surveillance.
Next, we discuss the key enabling techniques for Dragnet in details,
accompanied with the technical challenges and open issues. Furthermore, we
provide an exemplary case study on the detection and classification of
authorized and unauthorized amateur drones, where, for example, an important
event is being held and only authorized drones are allowed to fly over.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 09:21:29 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Ding",
"Guoru",
""
],
[
"Wu",
"Qihui",
""
],
[
"Zhang",
"Linyuan",
""
],
[
"Lin",
"Yun",
""
],
[
"Tsiftsis",
"Theodoros A.",
""
],
[
"Yao",
"Yu-Dong",
""
]
] |
new_dataset
| 0.998127 |
1711.10862
|
Tamas Madl
|
Tamas Madl, David Madl
|
Smartphone-based paroxysmal atrial fibrillation monitoring with robust
generalization
|
Accepted at NIPS ML4H 2017
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Atrial fibrillation is increasingly prevalent, especially in the elderly, and
challenging to detect due paroxysmal nature. Here, we propose novel
computational methods based on heart beat intervals to facilitate rapid and
robust discrimination between atrial fibrillation and sinus rhythm. We used
low-cost Android smartphones, and recorded short, 30 second waveform data from
194 participants. In addition, we evaluated our approach on 8528 hand-held ECG
recordings to show generalization.
Our approach achieves a sensitivity of 93% and specificity of 94% on 30
second waveforms, significantly outperforming previously proposed heart rate
variability features and smartphone-based AFib detection methods, and
substantiates the feasibility of real-world application on low-cost hardware.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 14:11:22 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Madl",
"Tamas",
""
],
[
"Madl",
"David",
""
]
] |
new_dataset
| 0.95602 |
1711.10886
|
M. Saquib Sarfraz
|
M. Saquib Sarfraz, Angela Constantinescu, Melanie Zuzej, Rainer
Stiefelhagen
|
A Multimodal Assistive System for Helping Visually Impaired in Social
Interactions
| null |
Informatik Spectrum, Springer volume 40,No. 6. 2017
|
10.1007/s00287-017-1077-7
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Access to non-verbal cues in social interactions is vital for people with
visual impairment. It has been shown that non-verbal cues such as eye contact,
number of people, their names and positions are helpful for individuals who are
blind. While there is an increasing interest in developing systems to provide
these cues less emphasis has been put in evaluating its impact on the visually
impaired users. In this paper, we provide this analysis by conducting a user
study with 12 visually impaired participants in a typical social interaction
setting. We design a real time multi-modal system that provides such non-verbal
cues via audio and haptic interfaces. The study shows that such systems are
generally perceived as useful in social interaction and brings forward some
concerns that are not being addressed in its usability aspects. The study
provides important insight about developing such technology for this
significant part of society.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 14:49:24 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Sarfraz",
"M. Saquib",
""
],
[
"Constantinescu",
"Angela",
""
],
[
"Zuzej",
"Melanie",
""
],
[
"Stiefelhagen",
"Rainer",
""
]
] |
new_dataset
| 0.998772 |
1711.10912
|
Cem Bassoy
|
Cem Bassoy
|
TLib: A Flexible C++ Tensor Framework for Numerical Tensor Calculus
|
29 pages
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Numerical tensor calculus comprise basic tensor operations such as the
entrywise addition and contraction of higher-order tensors. We present, TLib,
flexible tensor framework with generic tensor functions and tensor classes that
assists users to implement generic and flexible tensor algorithms in C++. The
number of dimensions, the extents of the dimensions of the tensors and the
contraction modes of the tensor operations can be runtime variable. Our
framework provides tensor classes that simplify the management of
multidimensional data and utilization of tensor operations using
object-oriented and generic programming techniques. Additional stream classes
help the user to verify and compare of numerical results with MATLAB. Tensor
operations are implemented with generic tensor functions and in terms of
multidimensional iterator types only, decoupling data storage representation
and computation. The user can combine tensor functions with different tensor
types and extend the framework without further modification of the classes or
functions. We discuss the design and implementation of the framework and
demonstrate its usage with examples that have been discussed in the literature.
|
[
{
"version": "v1",
"created": "Tue, 28 Nov 2017 14:36:59 GMT"
}
] | 2017-11-30T00:00:00 |
[
[
"Bassoy",
"Cem",
""
]
] |
new_dataset
| 0.998631 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.