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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1011.0835
|
Ziheng Lin
|
Ziheng Lin, Hwee Tou Ng, and Min-Yen Kan
|
A PDTB-Styled End-to-End Discourse Parser
|
15 pages, 5 figures, 7 tables
|
Natural Language Engineering 20 (02), 151 - 184, 2014
| null |
TRB8/10
|
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have developed a full discourse parser in the Penn Discourse Treebank
(PDTB) style. Our trained parser first identifies all discourse and
non-discourse relations, locates and labels their arguments, and then
classifies their relation types. When appropriate, the attribution spans to
these relations are also determined. We present a comprehensive evaluation from
both component-wise and error-cascading perspectives.
|
[
{
"version": "v1",
"created": "Wed, 3 Nov 2010 10:05:15 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Lin",
"Ziheng",
""
],
[
"Ng",
"Hwee Tou",
""
],
[
"Kan",
"Min-Yen",
""
]
] |
new_dataset
| 0.999437 |
1403.2779
|
Margreta Kuijper
|
Margreta Kuijper and Diego Napp
|
Erasure codes with simplex locality
|
submitted in December 2013 to Mathematical Theory of Networks and
Systems (MTNS) International Symposium 2014
|
Proceedings of MTNS 2014 (21st International Symposium on
Mathematical Theory of Networks and Systems, July 2014, Groningen, the
Netherlands), pp.1606-1609
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We focus on erasure codes for distributed storage. The distributed storage
setting imposes locality requirements because of easy repair demands on the
decoder. We first establish the characterization of various locality properties
in terms of the generator matrix of the code. These lead to bounds on locality
and notions of optimality. We then examine the locality properties of a family
of non-binary codes with simplex structure. We investigate their optimality and
design several easy repair decoding methods. In particular, we show that any
correctable erasure pattern can be solved by easy repair.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2014 00:15:39 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Kuijper",
"Margreta",
""
],
[
"Napp",
"Diego",
""
]
] |
new_dataset
| 0.977365 |
1512.06566
|
Marta Favali
|
Marta Favali, Giovanna Citti, Alessandro Sarti
|
Local and global gestalt laws: A neurally based spectral approach
|
submitted to Neural Computation
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mathematical model of figure-ground articulation is presented, taking into
account both local and global gestalt laws. The model is compatible with the
functional architecture of the primary visual cortex (V1). Particularly the
local gestalt law of good continuity is described by means of suitable
connectivity kernels, that are derived from Lie group theory and are neurally
implemented in long range connectivity in V1. Different kernels are compatible
with the geometric structure of cortical connectivity and they are derived as
the fundamental solutions of the Fokker Planck, the Sub-Riemannian Laplacian
and the isotropic Laplacian equations. The kernels are used to construct
matrices of connectivity among the features present in a visual stimulus.
Global gestalt constraints are then introduced in terms of spectral analysis of
the connectivity matrix, showing that this processing can be cortically
implemented in V1 by mean field neural equations. This analysis performs
grouping of local features and individuates perceptual units with the highest
saliency. Numerical simulations are performed and results are obtained applying
the technique to a number of stimuli.
|
[
{
"version": "v1",
"created": "Mon, 21 Dec 2015 10:27:58 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Aug 2016 15:20:45 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Favali",
"Marta",
""
],
[
"Citti",
"Giovanna",
""
],
[
"Sarti",
"Alessandro",
""
]
] |
new_dataset
| 0.955241 |
1601.06579
|
Dong Nguyen
|
Dong Nguyen, Jacob Eisenstein
|
A Kernel Independence Test for Geographical Language Variation
|
In submission. 26 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantifying the degree of spatial dependence for linguistic variables is a
key task for analyzing dialectal variation. However, existing approaches have
important drawbacks. First, they are based on parametric models of dependence,
which limits their power in cases where the underlying parametric assumptions
are violated. Second, they are not applicable to all types of linguistic data:
some approaches apply only to frequencies, others to boolean indicators of
whether a linguistic variable is present. We present a new method for measuring
geographical language variation, which solves both of these problems. Our
approach builds on Reproducing Kernel Hilbert space (RKHS) representations for
nonparametric statistics, and takes the form of a test statistic that is
computed from pairs of individual geotagged observations without aggregation
into predefined geographical bins. We compare this test with prior work using
synthetic data as well as a diverse set of real datasets: a corpus of Dutch
tweets, a Dutch syntactic atlas, and a dataset of letters to the editor in
North American newspapers. Our proposed test is shown to support robust
inferences across a broad range of scenarios and types of data.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2016 12:45:59 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Aug 2016 13:16:42 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Nguyen",
"Dong",
""
],
[
"Eisenstein",
"Jacob",
""
]
] |
new_dataset
| 0.980839 |
1605.07577
|
Bohua Zhan
|
Bohua Zhan
|
AUTO2, a saturation-based heuristic prover for higher-order logic
|
16 pages, accepted for ITP 2016
|
ITP 2016, LNCS 9807, pp. 441--456, 2016
|
10.1007/978-3-319-43144-4_27
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new theorem prover for classical higher-order logic named
auto2. The prover is designed to make use of human-specified heuristics when
searching for proofs. The core algorithm is a best-first search through the
space of propositions derivable from the initial assumptions, where new
propositions are added by user-defined functions called proof steps. We
implemented the prover in Isabelle/HOL, and applied it to several formalization
projects in mathematics and computer science, demonstrating the high level of
automation it can provide in a variety of possible proof tasks.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2016 18:34:01 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Zhan",
"Bohua",
""
]
] |
new_dataset
| 0.995615 |
1607.00880
|
Amina Piemontese Ph.D
|
Amina Piemontese and Alexandre Graell i Amat
|
MDS-Coded Distributed Storage for Low Delay Wireless Content Delivery
|
5 pages, 3 figures, accepted to the International Symposium on Turbo
Codes & Iterative Information Processing, September 2016 in Brest, France
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the use of maximum distance separable (MDS) codes for distributed
storage (DS) to enable efficient content delivery in wireless networks. Content
is stored in a number of the mobile devices and can be retrieved from them
using device-to-device communication or, alternatively, from the base station
(BS). We derive an analytical expression for the download delay in the
hypothesis that the reliability state of the network is periodically restored.
Our analysis shows that MDS-coded DS can dramatically reduce the download time
with respect to the reference scenario where content is always downloaded from
the BS.
|
[
{
"version": "v1",
"created": "Mon, 4 Jul 2016 13:29:21 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Aug 2016 09:18:06 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Piemontese",
"Amina",
""
],
[
"Amat",
"Alexandre Graell i",
""
]
] |
new_dataset
| 0.995561 |
1608.06142
|
Petr Golovach
|
Manfred Cochefert, Jean-Fran\c{c}ois Couturier, Petr A. Golovach,
Dieter Kratsch, Dani\"el Paulusma, and Anthony Stewart
|
Squares of Low Maximum Degree
| null | null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph H is a square root of a graph G if G can be obtained from H by adding
an edge between any two vertices in H that are of distance 2. The Square Root
problem is that of deciding whether a given graph admits a square root. This
problem is only known to be NP-complete for chordal graphs and polynomial-time
solvable for non-trivial minor-closed graph classes and a very limited number
of other graph classes. We prove that Square Root is O(n)-time solvable for
graphs of maximum degree 5 and O(n^4)-time solvable for graphs of maximum
degree at most 6.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2016 12:18:30 GMT"
},
{
"version": "v2",
"created": "Sat, 27 Aug 2016 18:01:44 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Cochefert",
"Manfred",
""
],
[
"Couturier",
"Jean-François",
""
],
[
"Golovach",
"Petr A.",
""
],
[
"Kratsch",
"Dieter",
""
],
[
"Paulusma",
"Daniël",
""
],
[
"Stewart",
"Anthony",
""
]
] |
new_dataset
| 0.997456 |
1608.06148
|
Chandrajit M
|
Chandrajit M, Girisha R and Vasudev T
|
Multiple objects tracking in surveillance video using color and Hu
moments
|
13 pages, Signal & Image Processing : An International Journal
(SIPIJ) Vol.7, No.3, June 2016
| null |
10.5121/sipij.2016.7302
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple objects tracking finds its applications in many high level vision
analysis like object behaviour interpretation and gait recognition. In this
paper, a feature based method to track the multiple moving objects in
surveillance video sequence is proposed. Object tracking is done by extracting
the color and Hu moments features from the motion segmented object blob and
establishing the association of objects in the successive frames of the video
sequence based on Chi-Square dissimilarity measure and nearest neighbor
classifier. The benchmark IEEE PETS and IEEE Change Detection datasets has been
used to show the robustness of the proposed method. The proposed method is
assessed quantitatively using the precision and recall accuracy metrics.
Further, comparative evaluation with related works has been carried out to
exhibit the efficacy of the proposed method.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2016 12:42:46 GMT"
},
{
"version": "v2",
"created": "Sun, 28 Aug 2016 13:11:35 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"M",
"Chandrajit",
""
],
[
"R",
"Girisha",
""
],
[
"T",
"Vasudev",
""
]
] |
new_dataset
| 0.965223 |
1608.07616
|
Fausto Milletari
|
Gerda Bortsova, Michael Sterr, Lichao Wang, Fausto Milletari, Nassir
Navab, Anika B\"ottcher, Heiko Lickert, Fabian Theis and Tingying Peng
|
Mitosis Detection in Intestinal Crypt Images with Hough Forest and
Conditional Random Fields
|
Accepted at the 7th International Conference on Machine Learning in
Medical Imaging
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intestinal enteroendocrine cells secrete hormones that are vital for the
regulation of glucose metabolism but their differentiation from intestinal stem
cells is not fully understood. Asymmetric stem cell divisions have been linked
to intestinal stem cell homeostasis and secretory fate commitment. We monitored
cell divisions using 4D live cell imaging of cultured intestinal crypts to
characterize division modes by means of measurable features such as orientation
or shape. A statistical analysis of these measurements requires annotation of
mitosis events, which is currently a tedious and time-consuming task that has
to be performed manually. To assist data processing, we developed a learning
based method to automatically detect mitosis events. The method contains a
dual-phase framework for joint detection of dividing cells (mothers) and their
progeny (daughters). In the first phase we detect mother and daughters
independently using Hough Forest whilst in the second phase we associate mother
and daughters by modelling their joint probability as Conditional Random Field
(CRF). The method has been evaluated on 32 movies and has achieved an AUC of
72%, which can be used in conjunction with manual correction and dramatically
speed up the processing pipeline.
|
[
{
"version": "v1",
"created": "Fri, 26 Aug 2016 21:53:30 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Bortsova",
"Gerda",
""
],
[
"Sterr",
"Michael",
""
],
[
"Wang",
"Lichao",
""
],
[
"Milletari",
"Fausto",
""
],
[
"Navab",
"Nassir",
""
],
[
"Böttcher",
"Anika",
""
],
[
"Lickert",
"Heiko",
""
],
[
"Theis",
"Fabian",
""
],
[
"Peng",
"Tingying",
""
]
] |
new_dataset
| 0.999035 |
1608.07666
|
Ruijin Sun
|
Ruijin Sun, Ying Wang, Zhongyu Miao, Xinshui Wang
|
Destination-aided Wireless Power Transfer in Energy-limited Cognitive
Relay Systems
|
12 pages, 9 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers an energy-limited cognitive relay network where a
secondary transmitter (ST) assists to forward the traffic from a primary
transmitter (PT) to a primary receiver (PR), in exchange for serving its own
secondary receiver (SR) in the same frequency. The multiple-antenna ST is
assumed to be energy-constrained and powered by both information flow from
source (PT) and dedicated energy streams from destinations (PR and SR), which
is called destination-aided wireless power transfer (DWPT) scheme. Then, the
relay processing matrix, cognitive beamforming vector and power splitter are
jointly de- signed to maximize the rate of secondary users under the energy
causality constraint and the constraint that the demanded rate of primary users
is satisfied. For the perfect channel information state (CSI) case, by adopting
semi-definite relax (SDR) technique and Charnes-Cooper transformation, the
global optimal solution is given. To reduce the complexity, matrix
decomposition, zero forcing (ZF) scheme, and dual method are jointly employed
to derive a suboptimal solution. For the imperfect CSI case, S- procedure is
used to transform the worst-case robust problem into a tractable semi-definite
program (SDP). Simulation results reveal that our proposed DWPT scheme is
greatly preferred for both perfect and imperfect CSI cases when ST is close to
PR/SR.
|
[
{
"version": "v1",
"created": "Sat, 27 Aug 2016 07:01:58 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Sun",
"Ruijin",
""
],
[
"Wang",
"Ying",
""
],
[
"Miao",
"Zhongyu",
""
],
[
"Wang",
"Xinshui",
""
]
] |
new_dataset
| 0.997764 |
1608.07670
|
Snehanshu Saha
|
Sobin CC, Snehanshu Saha, Vaskar Raychoudhury, Hategekimana Fidele and
Sumana Sinha
|
CISER: An Amoebiasis inspired Model for Epidemic Message Propagation in
DTN
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Delay Tolerant Networks (DTNs) are sparse mobile networks, which experiences
frequent disruptions in connectivity among nodes. Usually, DTN follows
store-carry-and forward mechanism for message forwarding, in which a node store
and carry the message until it finds an appropriate relay node to forward
further in the network. So, The efficiency of DTN routing protocol relies on
the intelligent selection of a relay node from a set of encountered nodes.
Although there are plenty of DTN routing schemes proposed in the literature
based on different strategies of relay selection, there are not many
mathematical models proposed to study the behavior of message forwarding in
DTN. In this paper, we have proposed a novel epidemic model, called as CISER
model, for message propagation in DTN, based on Amoebiasis disease propagation
in human population. The proposed CISER model is an extension of SIR epidemic
model with additional states to represent the resource constrained behavior of
nodes in DTN. Experimental results using both synthetic and real-world traces
show that the proposed model improves the routing performance metrics, such as
delivery ratio, overhead ratio and delivery delay compared to SIR model.
|
[
{
"version": "v1",
"created": "Sat, 27 Aug 2016 07:20:39 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"CC",
"Sobin",
""
],
[
"Saha",
"Snehanshu",
""
],
[
"Raychoudhury",
"Vaskar",
""
],
[
"Fidele",
"Hategekimana",
""
],
[
"Sinha",
"Sumana",
""
]
] |
new_dataset
| 0.99452 |
1608.07713
|
Archontis Politis
|
Archontis Politis
|
Diffuse-field coherence of sensors with arbitrary directional responses
|
5 pages
| null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Knowledge of the diffuse-field coherence between array sensors is a basic
assumption for a wide range of array processing applications. Explicit
relations previously existed only for omnidirectional and first-order
directional sensors, or a restricted arrangement of differential patterns. We
present a closed-form formulation of the theoretical coherence function between
arbitrary directionally band-limited sensors for the general cases that a) the
responses of the individual sensors are known or estimated, and the coherence
needs to be known for an arbitrary arrangement, and b) that no information on
the sensor directionality or on array geometry exists, but calibration
measurements around the array are available.
|
[
{
"version": "v1",
"created": "Sat, 27 Aug 2016 14:23:51 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Politis",
"Archontis",
""
]
] |
new_dataset
| 0.986066 |
1608.07989
|
Lam Thanh Tu
|
Lam Thanh Tu, Marco Di Renzo, and Justin P. Coon
|
MIMO Cellular Networks with Simultaneous Wireless Information and Power
Transfer
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In this paper, we introduce a mathematical approach for system-level analysis
and optimization of densely deployed multiple-antenna cellular networks, where
low-energy devices are capable of decoding information data and harvesting
power simultaneously. The base stations are assumed to be deployed according to
a Poisson point process and tools from stochastic geometry are exploited to
quantify the trade-off in terms of information rate and harvested power. It is
shown that multiple-antenna transmission is capable of increasing information
rate and harvested power at the same time.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2016 10:50:58 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Tu",
"Lam Thanh",
""
],
[
"Di Renzo",
"Marco",
""
],
[
"Coon",
"Justin P.",
""
]
] |
new_dataset
| 0.987724 |
1608.08149
|
Nader Mahmoud
|
Nader Mahmoud, I\~nigo Cirauqui, Alexandre Hostettler, Christophe
Doignon, Luc Soler, Jacques Marescaux, and J.M.M. Montiel
|
ORBSLAM-based Endoscope Tracking and 3D Reconstruction
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We aim to track the endoscope location inside the surgical scene and provide
3D reconstruction, in real-time, from the sole input of the image sequence
captured by the monocular endoscope. This information offers new possibilities
for developing surgical navigation and augmented reality applications. The main
benefit of this approach is the lack of extra tracking elements which can
disturb the surgeon performance in the clinical routine. It is our first
contribution to exploit ORBSLAM, one of the best performing monocular SLAM
algorithms, to estimate both of the endoscope location, and 3D structure of the
surgical scene. However, the reconstructed 3D map poorly describe textureless
soft organ surfaces such as liver. It is our second contribution to extend
ORBSLAM to be able to reconstruct a semi-dense map of soft organs. Experimental
results on in-vivo pigs, shows a robust endoscope tracking even with organs
deformations and partial instrument occlusions. It also shows the
reconstruction density, and accuracy against ground truth surface obtained from
CT.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2016 17:10:26 GMT"
}
] | 2016-08-30T00:00:00 |
[
[
"Mahmoud",
"Nader",
""
],
[
"Cirauqui",
"Iñigo",
""
],
[
"Hostettler",
"Alexandre",
""
],
[
"Doignon",
"Christophe",
""
],
[
"Soler",
"Luc",
""
],
[
"Marescaux",
"Jacques",
""
],
[
"Montiel",
"J. M. M.",
""
]
] |
new_dataset
| 0.99664 |
1603.05273
|
Pascal Giard
|
Pascal Giard, Alexios Balatsoukas-Stimming, Gabi Sarkis, Claude
Thibeault, and Warren J. Gross
|
Fast Low-Complexity Decoders for Low-Rate Polar Codes
|
8 pages, 10 figures, submitted to Springer J. Signal Process. Syst
| null |
10.1007/s11265-016-1173-y
| null |
cs.IT cs.AR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are capacity-achieving error-correcting codes with an explicit
construction that can be decoded with low-complexity algorithms. In this work,
we show how the state-of-the-art low-complexity decoding algorithm can be
improved to better accommodate low-rate codes. More constituent codes are
recognized in the updated algorithm and dedicated hardware is added to
efficiently decode these new constituent codes. We also alter the polar code
construction to further decrease the latency and increase the throughput with
little to no noticeable effect on error-correction performance. Rate-flexible
decoders for polar codes of length 1024 and 2048 are implemented on FPGA. Over
the previous work, they are shown to have from 22% to 28% lower latency and 26%
to 34% greater throughput when decoding low-rate codes. On 65 nm ASIC CMOS
technology, the proposed decoder for a (1024, 512) polar code is shown to
compare favorably against the state-of-the-art ASIC decoders. With a clock
frequency of 400 MHz and a supply voltage of 0.8 V, it has a latency of 0.41
$\mu$s and an area efficiency of 1.8 Gbps/mm$^2$ for an energy efficiency of 77
pJ/info. bit. At 600 MHz with a supply of 1 V, the latency is reduced to 0.27
$\mu$s and the area efficiency increased to 2.7 Gbps/mm$^2$ at 115 pJ/info.
bit.
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2016 20:49:30 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Mar 2016 02:47:46 GMT"
}
] | 2016-08-29T00:00:00 |
[
[
"Giard",
"Pascal",
""
],
[
"Balatsoukas-Stimming",
"Alexios",
""
],
[
"Sarkis",
"Gabi",
""
],
[
"Thibeault",
"Claude",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.998995 |
1407.5197
|
arXiv Admin
|
Karan Vaish, Shah Mihir Rajesh, K. Pasupatheeswaran, Anubha Parashar,
Jyoti Chaturvedi
|
Design and Autonomous Control of the Active Adaptive Suspension System
Rudra Mars Rover
|
This article has been withdrawn by arXiv administrators due to
disputed authorship
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Semi or completely autonomous unmanned vehicles, remotely driven or
controlled through artificial intelligence, are instrumental to foster space
exploration. One of the most essential tasks of a rover is terrain traversing
which requires the need of efficient suspension systems. This communication
presents a suspension system giving degrees of freedom to every wheel with the
help of linear actuators connected through bell crank levers. The actuation of
linear actuators directly varies the height of every wheel from the chassis
hence offering articulation to the rover. A control system is developed
offering an algorithm for its autonomous actuation. This system proves
instrumental for leveling of the chassis where any kind of slope, roll or
pitch, may impute abstaining of payloads from efficient working. This was tried
and tested successfully as a part of the rover developed by Team RUDRA from SRM
University, INDIA (first Team from Asia and finishing at the fifth position) at
University Rover Challenge 2013, held at UTAH, USA in May-June.
|
[
{
"version": "v1",
"created": "Sat, 19 Jul 2014 15:04:44 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Aug 2016 16:24:26 GMT"
}
] | 2016-08-26T00:00:00 |
[
[
"Vaish",
"Karan",
""
],
[
"Rajesh",
"Shah Mihir",
""
],
[
"Pasupatheeswaran",
"K.",
""
],
[
"Parashar",
"Anubha",
""
],
[
"Chaturvedi",
"Jyoti",
""
]
] |
new_dataset
| 0.998037 |
1608.06985
|
Ting-Chun Wang
|
Ting-Chun Wang, Jun-Yan Zhu, Ebi Hiroaki, Manmohan Chandraker, Alexei
A. Efros, Ravi Ramamoorthi
|
A 4D Light-Field Dataset and CNN Architectures for Material Recognition
|
European Conference on Computer Vision (ECCV) 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new light-field dataset of materials, and take advantage of
the recent success of deep learning to perform material recognition on the 4D
light-field. Our dataset contains 12 material categories, each with 100 images
taken with a Lytro Illum, from which we extract about 30,000 patches in total.
To the best of our knowledge, this is the first mid-size dataset for
light-field images. Our main goal is to investigate whether the additional
information in a light-field (such as multiple sub-aperture views and
view-dependent reflectance effects) can aid material recognition. Since
recognition networks have not been trained on 4D images before, we propose and
compare several novel CNN architectures to train on light-field images. In our
experiments, the best performing CNN architecture achieves a 7% boost compared
with 2D image classification (70% to 77%). These results constitute important
baselines that can spur further research in the use of CNNs for light-field
applications. Upon publication, our dataset also enables other novel
applications of light-fields, including object detection, image segmentation
and view interpolation.
|
[
{
"version": "v1",
"created": "Wed, 24 Aug 2016 23:30:22 GMT"
}
] | 2016-08-26T00:00:00 |
[
[
"Wang",
"Ting-Chun",
""
],
[
"Zhu",
"Jun-Yan",
""
],
[
"Hiroaki",
"Ebi",
""
],
[
"Chandraker",
"Manmohan",
""
],
[
"Efros",
"Alexei A.",
""
],
[
"Ramamoorthi",
"Ravi",
""
]
] |
new_dataset
| 0.999366 |
1608.07206
|
Jeffrey Murphy
|
Jeffrey Murphy, Bhargav Shivkumar, Lukasz Ziarek
|
Embedded SML using the MLton compiler
|
IFL 2016
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this extended abstract we present our current work on leveraging Standard
ML for developing embedded and real-time systems. Specifically we detail our
experiences in modifying MLton, a whole program, optimizing compiler for
Standard ML, for use in such contexts. We focus primarily on the language
runtime, re-working the threading subsystem and garbage collector, as well as
necessary changes for integrating MLton generated programs into a light weight
operating system kernel. We compare and contrast these changes to our previous
work on extending MLton for multicore systems, which focused around acheiving
scalability.
|
[
{
"version": "v1",
"created": "Thu, 25 Aug 2016 16:17:29 GMT"
}
] | 2016-08-26T00:00:00 |
[
[
"Murphy",
"Jeffrey",
""
],
[
"Shivkumar",
"Bhargav",
""
],
[
"Ziarek",
"Lukasz",
""
]
] |
new_dataset
| 0.980096 |
1302.2529
|
Riccardo Murri
|
Tyanko Aleksiev, Simon Barkow, Peter Kunszt, Sergio Maffioletti,
Riccardo Murri, Christian Panse
|
VM-MAD: a cloud/cluster software for service-oriented academic
environments
|
16 pages, 5 figures. Accepted at the International Supercomputing
Conference ISC13, June 17--20 Leipzig, Germany
|
Supercomputing, Volume 7905 of the series Lecture Notes in
Computer Science (2013) pp 447-461
|
10.1007/978-3-642-38750-0_34
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The availability of powerful computing hardware in IaaS clouds makes cloud
computing attractive also for computational workloads that were up to now
almost exclusively run on HPC clusters.
In this paper we present the VM-MAD Orchestrator software: an open source
framework for cloudbursting Linux-based HPC clusters into IaaS clouds but also
computational grids. The Orchestrator is completely modular, allowing flexible
configurations of cloudbursting policies. It can be used with any batch system
or cloud infrastructure, dynamically extending the cluster when needed. A
distinctive feature of our framework is that the policies can be tested and
tuned in a simulation mode based on historical or synthetic cluster accounting
data.
In the paper we also describe how the VM-MAD Orchestrator was used in a
production environment at the FGCZ to speed up the analysis of mass
spectrometry-based protein data by cloudbursting to the Amazon EC2. The
advantages of this hybrid system are shown with a large evaluation run using
about hundred large EC2 nodes.
|
[
{
"version": "v1",
"created": "Mon, 11 Feb 2013 16:49:49 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Mar 2013 11:21:31 GMT"
}
] | 2016-08-25T00:00:00 |
[
[
"Aleksiev",
"Tyanko",
""
],
[
"Barkow",
"Simon",
""
],
[
"Kunszt",
"Peter",
""
],
[
"Maffioletti",
"Sergio",
""
],
[
"Murri",
"Riccardo",
""
],
[
"Panse",
"Christian",
""
]
] |
new_dataset
| 0.992947 |
1603.07926
|
Alexander Chepurnoy Mr.
|
Alexander Chepurnoy, Mario Larangeira, Alexander Ojiganov
|
Rollerchain, a Blockchain With Safely Pruneable Full Blocks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitcoin is the first successful decentralized global digital cash system. Its
mining process requires intense computational resources, therefore its
usefulness remains a disputable topic. We aim to solve three problems with
Bitcoin and other blockchain systems of today by repurposing their work. First,
space to store a blockchain is growing linearly with number of transactions.
Second, a honest node is forced to be irrational regarding storing full blocks
by a way implementations are done. Third, a trustless bootstrapping process for
a new node involves downloading and processing all the transactions ever
written into a blockchain.
In this paper we present a new consensus protocol for Bitcoin-like
peer-to-peer systems where a right to generate a block is given to a party
providing non-interactive proofs of storing a subset of the past state
snapshots. Unlike the blockchain systems in use today, a network using our
protocol is safe if the nodes prune full blocks not needed for mining.
We extend the GKL model to describe our Proof-of-Work scheme and a
transactional model modifications needed for it. We provide a detailed analysis
of our protocol and proofs of its security.
|
[
{
"version": "v1",
"created": "Fri, 25 Mar 2016 14:38:17 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2016 09:33:42 GMT"
},
{
"version": "v3",
"created": "Tue, 23 Aug 2016 22:19:26 GMT"
}
] | 2016-08-25T00:00:00 |
[
[
"Chepurnoy",
"Alexander",
""
],
[
"Larangeira",
"Mario",
""
],
[
"Ojiganov",
"Alexander",
""
]
] |
new_dataset
| 0.998082 |
1608.06674
|
Yongsheng Tang
|
Yongsheng Tang, Shixin Zhu, Xiaoshan Kai, Jian Ding
|
New quantum codes from dual-containing cyclic codes over finite rings
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
Let $R=\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}+\cdots+u^{k}\mathbb{F}_{2^{m}}$
, where $\mathbb{F}_{2^{m}}$ is a finite field with $2^{m}$ elements, $m$ is a
positive integer, $u$ is an indeterminate with $u^{k+1}=0.$ In this paper, we
propose the constructions of two new families of quantum codes obtained from
dual-containing cyclic codes of odd length over $R$. A new Gray map over $R$ is
defined and a sufficient and necessary condition for the existence of
dual-containing cyclic codes over $R$ is given. A new family of $2^{m}$-ary
quantum codes is obtained via the Gray map and the Calderbank-Shor-Steane
construction from dual-containing cyclic codes over $R.$ Furthermore, a new
family of binary quantum codes is obtained via the Gray map, the trace map and
the Calderbank-Shor-Steane construction from dual-containing cyclic codes over
$R.$
|
[
{
"version": "v1",
"created": "Wed, 24 Aug 2016 00:44:03 GMT"
}
] | 2016-08-25T00:00:00 |
[
[
"Tang",
"Yongsheng",
""
],
[
"Zhu",
"Shixin",
""
],
[
"Kai",
"Xiaoshan",
""
],
[
"Ding",
"Jian",
""
]
] |
new_dataset
| 0.999776 |
1608.06748
|
Chunming Tang
|
Sihem Mesnager, Chunming Tang, Yanfeng Qi
|
Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields
|
arXiv admin note: text overlap with arXiv:1412.5797 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes
for radius $t=1$ or dimension $n=1, 2$. It is admitted that the existence and
the construction of quasi-perfect Lee codes have to be studied since they are
the best alternative to the perfect codes. In this paper we firstly highlight
the relationships between subset sums, Cayley graphs, and Lee linear codes and
present some results. Next, we present a new constructive method for
constructing quasi-perfect Lee codes. Our approach uses subsets derived from
some quadratic curves over finite fields (in odd characteristic) to derive two
classes of $2$-quasi-perfect Lee codes are given over the space
$\mathbb{Z}_p^n$ for $n=\frac{p^k+1}{2}$ $(\text{with} ~p\equiv 1, -5 \mod 12
\text{and} k \text{is any integer}, \text{or} p\equiv -1, 5 \mod 12 \text{and}
k \text{is an even integer})$ and $n=\frac{p^k-1}{2}$ $(\text{with}p\equiv -1,
5 \mod 12, k \text{is an odd integer} \text{and} p^k>12)$, where $p$ is an odd
prime. Our codes encompass the quasi-perfect Lee codes constructed recently by
Camarero and Mart\'inez. Furthermore, we solve a conjecture proposed by
Camarero and Mart\'inez (in "quasi-perfect Lee codes of radius $2$ and
arbitrarily large dimension", IEEE Trans. Inf. Theory, vol. 62, no. 3, 2016) by
proving that the related Cayley graphs are Ramanujan or almost Ramanujan. The
Lee codes presented in this paper have applications to constrained and
partial-response channels, in flash memories and decision diagrams.
|
[
{
"version": "v1",
"created": "Wed, 24 Aug 2016 08:32:23 GMT"
}
] | 2016-08-25T00:00:00 |
[
[
"Mesnager",
"Sihem",
""
],
[
"Tang",
"Chunming",
""
],
[
"Qi",
"Yanfeng",
""
]
] |
new_dataset
| 0.987345 |
1608.06797
|
Corinna Gottschalk
|
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen K\"onemann,
Britta Peis, Daniel Schmand, Andreas Wierz
|
Additive Stabilizers for Unstable Graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stabilization of graphs has received substantial attention in recent years
due to its connection to game theory. Stable graphs are exactly the graphs
inducing a matching game with non-empty core. They are also the graphs that
induce a network bargaining game with a balanced solution. A graph with
weighted edges is called stable if the maximum weight of an integral matching
equals the cost of a minimum fractional weighted vertex cover. If a graph is
not stable, it can be stabilized in different ways. Recent papers have
considered the deletion or addition of edges and vertices in order to stabilize
a graph. In this work, we focus on a fine-grained stabilization strategy,
namely stabilization of graphs by fractionally increasing edge weights. We show
the following results for stabilization by minimum weight increase in edge
weights (min additive stabilizer): (i) Any approximation algorithm for min
additive stabilizer that achieves a factor of $O(|V|^{1/24-\epsilon})$ for
$\epsilon>0$ would lead to improvements in the approximability of
densest-$k$-subgraph. (ii) Min additive stabilizer has no $o(\log{|V|})$
approximation unless NP=P. Results (i) and (ii) together provide the first
super-constant hardness results for any graph stabilization problem. On the
algorithmic side, we present (iii) an algorithm to solve min additive
stabilizer in factor-critical graphs exactly in poly-time, (iv) an algorithm to
solve min additive stabilizer in arbitrary-graphs exactly in time exponential
in the size of the Tutte set, and (v) a poly-time algorithm with approximation
factor at most $\sqrt{|V|}$ for a super-class of the instances generated in our
hardness proofs.
|
[
{
"version": "v1",
"created": "Wed, 24 Aug 2016 12:50:52 GMT"
}
] | 2016-08-25T00:00:00 |
[
[
"Chandrasekaran",
"Karthekeyan",
""
],
[
"Gottschalk",
"Corinna",
""
],
[
"Könemann",
"Jochen",
""
],
[
"Peis",
"Britta",
""
],
[
"Schmand",
"Daniel",
""
],
[
"Wierz",
"Andreas",
""
]
] |
new_dataset
| 0.988142 |
1608.06800
|
Javier Alejandro Aldana Iuit
|
Javier Aldana-Iuit, Dmytro Mishkin, Ondrej Chum, Jiri Matas
|
In the Saddle: Chasing Fast and Repeatable Features
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel similarity-covariant feature detector that extracts points whose
neighbourhoods, when treated as a 3D intensity surface, have a saddle-like
intensity profile. The saddle condition is verified efficiently by intensity
comparisons on two concentric rings that must have exactly two dark-to-bright
and two bright-to-dark transitions satisfying certain geometric constraints.
Experiments show that the Saddle features are general, evenly spread and
appearing in high density in a range of images. The Saddle detector is among
the fastest proposed. In comparison with detector with similar speed, the
Saddle features show superior matching performance on number of challenging
datasets.
|
[
{
"version": "v1",
"created": "Wed, 24 Aug 2016 12:57:34 GMT"
}
] | 2016-08-25T00:00:00 |
[
[
"Aldana-Iuit",
"Javier",
""
],
[
"Mishkin",
"Dmytro",
""
],
[
"Chum",
"Ondrej",
""
],
[
"Matas",
"Jiri",
""
]
] |
new_dataset
| 0.999024 |
1608.06876
|
Giacomo Berardi
|
Ugo Scaiella, Giacomo Berardi, Giuliano Mega, Roberto Santoro
|
Sedano: A News Stream Processor for Business
|
2 pages, 1 figure. SIGIR '16 July 17-21, 2016, Pisa, Italy
|
Proceedings of the 39th International ACM SIGIR Conference on
Research and Development in Information Retrieval (SIGIR 2016). pp 525-526.
Pisa, IT, 2016
|
10.1145/2911451.2926730
| null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Sedano, a system for processing and indexing a continuous stream
of business-related news. Sedano defines pipelines whose stages analyze and
enrich news items (e.g., newspaper articles and press releases). News data
coming from several content sources are stored, processed and then indexed in
order to be consumed by Atoka, our business intelligence product. Atoka users
can retrieve news about specific companies, filtering according to various
facets. Sedano features both an entity-linking phase, which finds mentions of
companies in news, and a classification phase, which classifies news according
to a set of business events. Its flexible architecture allows Sedano to be
deployed on commodity machines while being scalable and fault-tolerant.
|
[
{
"version": "v1",
"created": "Wed, 24 Aug 2016 15:52:19 GMT"
}
] | 2016-08-25T00:00:00 |
[
[
"Scaiella",
"Ugo",
""
],
[
"Berardi",
"Giacomo",
""
],
[
"Mega",
"Giuliano",
""
],
[
"Santoro",
"Roberto",
""
]
] |
new_dataset
| 0.999074 |
1506.06096
|
Dorina Thanou
|
Dorina Thanou, Philip A. Chou, and Pascal Frossard
|
Graph-based compression of dynamic 3D point cloud sequences
| null | null |
10.1109/TIP.2016.2529506
| null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the problem of compression of 3D point cloud sequences
that are characterized by moving 3D positions and color attributes. As
temporally successive point cloud frames are similar, motion estimation is key
to effective compression of these sequences. It however remains a challenging
problem as the point cloud frames have varying numbers of points without
explicit correspondence information. We represent the time-varying geometry of
these sequences with a set of graphs, and consider 3D positions and color
attributes of the points clouds as signals on the vertices of the graphs. We
then cast motion estimation as a feature matching problem between successive
graphs. The motion is estimated on a sparse set of representative vertices
using new spectral graph wavelet descriptors. A dense motion field is
eventually interpolated by solving a graph-based regularization problem. The
estimated motion is finally used for removing the temporal redundancy in the
predictive coding of the 3D positions and the color characteristics of the
point cloud sequences. Experimental results demonstrate that our method is able
to accurately estimate the motion between consecutive frames. Moreover, motion
estimation is shown to bring significant improvement in terms of the overall
compression performance of the sequence. To the best of our knowledge, this is
the first paper that exploits both the spatial correlation inside each frame
(through the graph) and the temporal correlation between the frames (through
the motion estimation) to compress the color and the geometry of 3D point cloud
sequences in an efficient way.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 17:31:34 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Thanou",
"Dorina",
""
],
[
"Chou",
"Philip A.",
""
],
[
"Frossard",
"Pascal",
""
]
] |
new_dataset
| 0.968949 |
1510.06767
|
E. M. De La Calleja Mora
|
E. M. De la Calleja, F. Cervantes, J. De la Calleja
|
Order-Fractal transition in abstract paintings
| null | null |
10.1016/j.aop.2016.04.007
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report the degree of order of twenty-two Jackson Pollock's paintings using
\emph{Hausdorff-Besicovitch fractal dimension}. Through the maximum value of
each multi-fractal spectrum, the artworks are classify by the year in which
they were painted. It has been reported that Pollock's paintings are fractal
and it increased on his latest works. However our results show that fractal
dimension of the paintings are on a range of fractal dimension with values
close to two. We identify this behavior as a fractal-order transition. Based on
the study of disorder-order transition in physical systems, we interpreted the
fractal-order transition through its dark paint strokes in Pollocks' paintings,
as structured lines following a power law measured by fractal dimension. We
obtain self-similarity in some specific Pollock's paintings, that reveal an
important dependence on the scale of observation. We also characterize by its
fractal spectrum, the called \emph{Teri's Find}. We obtained similar spectrums
between \emph{Teri's Find} and \emph{Number 5} from Pollock, suggesting that
fractal dimension cannot be completely rejected as a quantitative parameter to
authenticate this kind of artworks.
|
[
{
"version": "v1",
"created": "Thu, 22 Oct 2015 21:03:50 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Oct 2015 17:35:42 GMT"
},
{
"version": "v3",
"created": "Tue, 12 Apr 2016 12:28:31 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"De la Calleja",
"E. M.",
""
],
[
"Cervantes",
"F.",
""
],
[
"De la Calleja",
"J.",
""
]
] |
new_dataset
| 0.981093 |
1511.04207
|
Anna Fiedorowicz
|
Anna Fiedorowicz, El\.zbieta Sidorowicz
|
Acyclic colourings of graphs with bounded degree
|
14 pages
| null |
10.1007/s11425-016-5126-5
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $k$-colouring (not necessarily proper) of vertices of a graph is called
{\it acyclic}, if for every pair of distinct colours $i$ and $j$ the subgraph
induced by the edges whose endpoints have colours $i$ and $j$ is acyclic. In
the paper we consider some generalised acyclic $k$-colourings, namely, we
require that each colour class induces an acyclic or bounded degree graph.
Mainly we focus on graphs with maximum degree 5. We prove that any such graph
has an acyclic $5$-colouring such that each colour class induces an acyclic
graph with maximum degree at most 4. We prove that the problem of deciding
whether a graph $G$ has an acyclic 2-colouring in which each colour class
induces a graph with maximum degree at most 3 is NP-complete, even for graphs
with maximum degree 5. We also give a linear-time algorithm for an acyclic
$t$-improper colouring of any graph with maximum degree $d$ assuming that the
number of colors is large enough.
|
[
{
"version": "v1",
"created": "Fri, 13 Nov 2015 09:17:14 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Fiedorowicz",
"Anna",
""
],
[
"Sidorowicz",
"Elżbieta",
""
]
] |
new_dataset
| 0.997847 |
1601.06005
|
Bin Xu
|
Jiajun Shen, Bin Xu, Mingtao Pei, Yunde Jia
|
A Low-Cost Tele-Presence Wheelchair System
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the architecture and implementation of a tele-presence
wheelchair system based on tele-presence robot, intelligent wheelchair, and
touch screen technologies. The tele-presence wheelchair system consists of a
commercial electric wheelchair, an add-on tele-presence interaction module, and
a touchable live video image based user interface (called TIUI). The
tele-presence interaction module is used to provide video-chatting for an
elderly or disabled person with the family members or caregivers, and also
captures the live video of an environment for tele-operation and
semi-autonomous navigation. The user interface developed in our lab allows an
operator to access the system anywhere and directly touch the live video image
of the wheelchair to push it as if he/she did it in the presence. This paper
also discusses the evaluation of the user experience.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 14:02:47 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Aug 2016 10:37:41 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Shen",
"Jiajun",
""
],
[
"Xu",
"Bin",
""
],
[
"Pei",
"Mingtao",
""
],
[
"Jia",
"Yunde",
""
]
] |
new_dataset
| 0.99778 |
1603.06812
|
Yaniv Romano
|
Yaniv Romano and Michael Elad
|
Con-Patch: When a Patch Meets its Context
|
Accepted to IEEE Transactions on Image Processing
| null |
10.1109/TIP.2016.2576402
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Measuring the similarity between patches in images is a fundamental building
block in various tasks. Naturally, the patch-size has a major impact on the
matching quality, and on the consequent application performance. Under the
assumption that our patch database is sufficiently sampled, using large patches
(e.g. 21-by-21) should be preferred over small ones (e.g. 7-by-7). However,
this "dense-sampling" assumption is rarely true; in most cases large patches
cannot find relevant nearby examples. This phenomenon is a consequence of the
curse of dimensionality, stating that the database-size should grow
exponentially with the patch-size to ensure proper matches. This explains the
favored choice of small patch-size in most applications.
Is there a way to keep the simplicity and work with small patches while
getting some of the benefits that large patches provide? In this work we offer
such an approach. We propose to concatenate the regular content of a
conventional (small) patch with a compact representation of its (large)
surroundings - its context. Therefore, with a minor increase of the dimensions
(e.g. with additional 10 values to the patch representation), we
implicitly/softly describe the information of a large patch. The additional
descriptors are computed based on a self-similarity behavior of the patch
surrounding.
We show that this approach achieves better matches, compared to the use of
conventional-size patches, without the need to increase the database-size.
Also, the effectiveness of the proposed method is tested on three distinct
problems: (i) External natural image denoising, (ii) Depth image
super-resolution, and (iii) Motion-compensated frame-rate up-conversion.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 14:44:28 GMT"
},
{
"version": "v2",
"created": "Mon, 16 May 2016 14:28:01 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Jun 2016 14:14:58 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Romano",
"Yaniv",
""
],
[
"Elad",
"Michael",
""
]
] |
new_dataset
| 0.998796 |
1608.06325
|
T-H. Hubert Chan
|
T-H. Hubert Chan and Shuguang Hu and Shaofeng H.-C. Jiang
|
A PTAS for the Steiner Forest Problem in Doubling Metrics
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We achieve a (randomized) polynomial-time approximation scheme (PTAS) for the
Steiner Forest Problem in doubling metrics. Before our work, a PTAS is given
only for the Euclidean plane in [FOCS 2008: Borradaile, Klein and Mathieu]. Our
PTAS also shares similarities with the dynamic programming for sparse instances
used in [STOC 2012: Bartal, Gottlieb and Krauthgamer] and [SODA 2016: Chan and
Jiang]. However, extending previous approaches requires overcoming several
non-trivial hurdles, and we make the following technical contributions.
(1) We prove a technical lemma showing that Steiner points have to be "near"
the terminals in an optimal Steiner tree. This enables us to define a heuristic
to estimate the local behavior of the optimal solution, even though the Steiner
points are unknown in advance. This lemma also generalizes previous results in
the Euclidean plane, and may be of independent interest for related problems
involving Steiner points.
(2) We develop a novel algorithmic technique known as "adaptive cells" to
overcome the difficulty of keeping track of multiple components in a solution.
Our idea is based on but significantly different from the previously proposed
"uniform cells" in the FOCS 2008 paper, whose techniques cannot be readily
applied to doubling metrics.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2016 21:50:07 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Chan",
"T-H. Hubert",
""
],
[
"Hu",
"Shuguang",
""
],
[
"Jiang",
"Shaofeng H. -C.",
""
]
] |
new_dataset
| 0.969278 |
1608.06458
|
Fabrizio Frati
|
Vida Dujmovi\'c and Fabrizio Frati
|
Stack and Queue Layouts via Layered Separators
|
Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.CG cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that every proper minor-closed class of graphs has bounded
stack-number (a.k.a. book thickness and page number). While this includes
notable graph families such as planar graphs and graphs of bounded genus, many
other graph families are not closed under taking minors. For fixed $g$ and $k$,
we show that every $n$-vertex graph that can be embedded on a surface of genus
$g$ with at most $k$ crossings per edge has stack-number $\mathcal{O}(\log n)$;
this includes $k$-planar graphs. The previously best known bound for the
stack-number of these families was $\mathcal{O}(\sqrt{n})$, except in the case
of $1$-planar graphs. Analogous results are proved for map graphs that can be
embedded on a surface of fixed genus. None of these families is closed under
taking minors. The main ingredient in the proof of these results is a
construction proving that $n$-vertex graphs that admit constant layered
separators have $\mathcal{O}(\log n)$ stack-number.
|
[
{
"version": "v1",
"created": "Tue, 23 Aug 2016 10:48:18 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Dujmović",
"Vida",
""
],
[
"Frati",
"Fabrizio",
""
]
] |
new_dataset
| 0.986237 |
1608.06459
|
James P. Cross
|
Henrik Hermansson and James P. Cross
|
Tracking Amendments to Legislation and Other Political Texts with a
Novel Minimum-Edit-Distance Algorithm: DocuToads
| null | null | null | null |
cs.CL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Political scientists often find themselves tracking amendments to political
texts. As different actors weigh in, texts change as they are drafted and
redrafted, reflecting political preferences and power. This study provides a
novel solution to the prob- lem of detecting amendments to political text based
upon minimum edit distances. We demonstrate the usefulness of two
language-insensitive, transparent, and efficient minimum-edit-distance
algorithms suited for the task. These algorithms are capable of providing an
account of the types (insertions, deletions, substitutions, and trans-
positions) and substantive amount of amendments made between version of texts.
To illustrate the usefulness and efficiency of the approach we replicate two
existing stud- ies from the field of legislative studies. Our results
demonstrate that minimum edit distance methods can produce superior measures of
text amendments to hand-coded efforts in a fraction of the time and resource
costs.
|
[
{
"version": "v1",
"created": "Tue, 23 Aug 2016 10:55:23 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Hermansson",
"Henrik",
""
],
[
"Cross",
"James P.",
""
]
] |
new_dataset
| 0.996948 |
1608.06606
|
Bartosz Musznicki
|
Bartosz Musznicki, Karol Kowalik, Piotr Ko{\l}odziejski, Eugeniusz
Grzybek
|
Mobile and Residential INEA Wi-Fi Hotspot Network
|
8 pages, invited to ISWCS 2016, Thirteenth International Symposium on
Wireless Communication Systems 2016, 20-23 September 2016, Pozna\'n, Poland
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since 2012 INEA has been developing and expanding the network of IEEE 802.11
compliant Wi-Fi hotspots (access points) located across the Greater Poland
region. This network consists of 330 mobile (vehicular) access points carried
by public buses and trams and over 20,000 fixed residential hotspots
distributed throughout the homes of INEA customers to provide Internet access
via the "community Wi-Fi" service. Therefore, this paper is aimed at sharing
the insights gathered by INEA throughout 4 years of experience in providing
hotspot-based Internet access. The emphasis is put on daily and hourly trends
in order to evaluate user experience, to determine key patterns, and to
investigate the influences such as public transportation trends, user location
and mobility, as well as, radio frequency noise and interference.
|
[
{
"version": "v1",
"created": "Tue, 23 Aug 2016 19:08:47 GMT"
}
] | 2016-08-24T00:00:00 |
[
[
"Musznicki",
"Bartosz",
""
],
[
"Kowalik",
"Karol",
""
],
[
"Kołodziejski",
"Piotr",
""
],
[
"Grzybek",
"Eugeniusz",
""
]
] |
new_dataset
| 0.999499 |
1512.05691
|
Sourjya Dutta
|
Sourjya Dutta, Marco Mezzavilla, Russell Ford, Menglei Zhang, Sundeep
Rangan and Michele Zorzi
|
Frame Structure Design and Analysis for Millimeter Wave Cellular Systems
|
Submitted to IEEE Transactions for Wireless Communications
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The millimeter-wave (mmWave) frequencies have attracted considerable
attention for fifth generation (5G) cellular communication as they offer orders
of magnitude greater bandwidth than current cellular systems. However, the
medium access control (MAC) layer may need to be significantly redesigned to
support the highly directional transmissions, ultra-low latencies and high peak
rates expected in mmWave communication. To address these challenges, we present
a novel mmWave MAC layer frame structure with a number of enhancements
including flexible, highly granular transmission times, dynamic control signal
locations, extended messaging and ability to efficiently multiplex directional
control signals. Analytic formulae are derived for the utilization and control
overhead as a function of control periodicity, number of users, traffic
statistics, signal-to-noise ratio and antenna gains. Importantly, the analysis
can incorporate various front-end MIMO capability assumptions -- a critical
feature of mmWave. Under realistic system and traffic assumptions, the analysis
reveals that the proposed flexible frame structure design offers significant
benefits over designs with fixed frame structures similar to current 4G
long-term evolution (LTE). It is also shown that fully digital beamforming
architectures offer significantly lower overhead compared to analog and hybrid
beamforming under equivalent power budgets.
|
[
{
"version": "v1",
"created": "Thu, 17 Dec 2015 17:44:28 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Aug 2016 17:30:20 GMT"
}
] | 2016-08-23T00:00:00 |
[
[
"Dutta",
"Sourjya",
""
],
[
"Mezzavilla",
"Marco",
""
],
[
"Ford",
"Russell",
""
],
[
"Zhang",
"Menglei",
""
],
[
"Rangan",
"Sundeep",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.992328 |
1608.05786
|
Carlos Luis
|
Carlos Luis, J\'er\^ome Le Ny
|
Design of a Trajectory Tracking Controller for a Nanoquadcopter
|
Complete Technical Report
| null | null | null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The primary purpose of this study is to investigate the system modeling of a
nanoquadcopter as well as designing position and trajectory control algorithms,
with the ultimate goal of testing the system both in simulation and on a real
platform.
The open source nanoquadcopter platform named Crazyflie 2.0 was chosen for
the project. The first phase consisted in the development of a mathematical
model that describes the dynamics of the quadcopter. Secondly, a simulation
environment was created to design two different control architectures: cascaded
PID position tracker and LQT trajectory tracker. Finally, the implementation
phase consisted in testing the controllers on the chosen platform and comparing
their performance in trajectory tracking.
Our simulations agreed with the experimental results, and further refinement
of the model is proposed as future work through closed-loop model
identification techniques. The results show that the LQT controller performed
better at tracking trajectories, with RMS errors in position up to four times
smaller than those obtained with the PID. LQT control effort was greater, but
eliminated the high control peaks that induced motor saturation in the PID
controller. The LQT controller was also tested using an ultra-wide band two-way
ranging system, and comparisons with the more precise VICON system indicate
that the controller could track a trajectory in both cases despise the
difference in noise levels between the two systems.
|
[
{
"version": "v1",
"created": "Sat, 20 Aug 2016 06:12:41 GMT"
}
] | 2016-08-23T00:00:00 |
[
[
"Luis",
"Carlos",
""
],
[
"Ny",
"Jérôme Le",
""
]
] |
new_dataset
| 0.971774 |
1608.05966
|
Rishabh Kaushal
|
Rishabh Kaushal, Srishty Saha, Payal Bajaj and Ponnurangam Kumaraguru
|
KidsTube: Detection, Characterization and Analysis of Child Unsafe
Content & Promoters on YouTube
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
YouTube draws large number of users who contribute actively by uploading
videos or commenting on existing videos. However, being a crowd sourced and
large content pushed onto it, there is limited control over the content. This
makes malicious users push content (videos and comments) which is inappropriate
(unsafe), particularly when such content is placed around cartoon videos which
are typically watched by kids. In this paper, we focus on presence of unsafe
content for children and users who promote it. For detection of child unsafe
content and its promoters, we perform two approaches, one based on supervised
classification which uses an extensive set of video-level, user-level and
comment-level features and another based Convolutional Neural Network using
video frames. Detection accuracy of 85.7% is achieved which can be leveraged to
build a system to provide a safe YouTube experience for kids. Through detailed
characterization studies, we are able to successfully conclude that unsafe
content promoters are less popular and engage less as compared with other
users. Finally, using a network of unsafe content promoters and other users
based on their engagements (likes, subscription and playlist addition) and
other factors, we find that unsafe content is present very close to safe
content and unsafe content promoters form very close knit communities with
other users, thereby further increasing the likelihood of a child getting
getting exposed to unsafe content.
|
[
{
"version": "v1",
"created": "Sun, 21 Aug 2016 17:09:19 GMT"
}
] | 2016-08-23T00:00:00 |
[
[
"Kaushal",
"Rishabh",
""
],
[
"Saha",
"Srishty",
""
],
[
"Bajaj",
"Payal",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.999594 |
1608.06009
|
Matthew Hammer
|
Kyle Headley, Matthew A. Hammer
|
The Random Access Zipper: Simple, Purely-Functional Sequences
| null | null | null | null |
cs.DS cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Random Access Zipper (RAZ), a simple, purely-functional data
structure for editable sequences. A RAZ combines the structure of a zipper with
that of a tree: like a zipper, edits at the cursor require constant time; by
leveraging tree structure, relocating the edit cursor in the sequence requires
logarithmic time. While existing data structures provide these time bounds,
none do so with the same simplicity and brevity of code as the RAZ. The
simplicity of the RAZ provides the opportunity for more programmers to extend
the structure to their own needs, and we provide some suggestions for how to do
so.
|
[
{
"version": "v1",
"created": "Sun, 21 Aug 2016 23:15:40 GMT"
}
] | 2016-08-23T00:00:00 |
[
[
"Headley",
"Kyle",
""
],
[
"Hammer",
"Matthew A.",
""
]
] |
new_dataset
| 0.997741 |
1608.06091
|
Veit Wiechert
|
Veit Wiechert
|
On the queue-number of graphs with bounded tree-width
|
14 pages
| null | null | null |
cs.DM cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A queue layout of a graph consists of a linear order on the vertices and an
assignment of the edges to queues, such that no two edges in a single queue are
nested. The minimum number of queues needed in a queue layout of a graph is
called its queue-number.
We show that for each $k\geq1$, graphs with tree-width at most $k$ have
queue-number at most $2^k-1$. This improves upon double exponential upper
bounds due to Dujmovi\'c et al. and Giacomo et al. As a consequence we obtain
that these graphs have track-number at most $2^{O(k^2)}$.
We complement these results by a construction of $k$-trees that have
queue-number at least $k+1$. Already in the case $k=2$ this is an improvement
to existing results and solves a problem of Rengarajan and Veni Madhavan,
namely, that the maximal queue-number of $2$-trees is equal to $3$.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2016 09:03:37 GMT"
}
] | 2016-08-23T00:00:00 |
[
[
"Wiechert",
"Veit",
""
]
] |
new_dataset
| 0.998687 |
1608.06136
|
Petr Golovach
|
Petr A. Golovach, Dieter Kratsch, Dani\"el Paulusma, and Anthony
Stewart
|
A Linear Kernel for Finding Square Roots of Almost Planar Graphs
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph H is a square root of a graph G if G can be obtained from H by the
addition of edges between any two vertices in H that are of distance 2 from
each other. The Square Root problem is that of deciding whether a given graph
admits a square root. We consider this problem for planar graphs in the context
of the "distance from triviality" framework. For an integer k, a planar+kv
graph (or k-apex graph) is a graph that can be made planar by the removal of at
most k vertices. We prove that a generalization of Square Root, in which some
edges are prescribed to be either in or out of any solution, has a kernel of
size O(k) for planar+kv graphs, when parameterized by k. Our result is based on
a new edge reduction rule which, as we shall also show, has a wider
applicability for the Square Root problem.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2016 12:03:53 GMT"
}
] | 2016-08-23T00:00:00 |
[
[
"Golovach",
"Petr A.",
""
],
[
"Kratsch",
"Dieter",
""
],
[
"Paulusma",
"Daniël",
""
],
[
"Stewart",
"Anthony",
""
]
] |
new_dataset
| 0.984793 |
1311.0750
|
Jens M. Schmidt
|
Jens M. Schmidt
|
Mondshein Sequences (a.k.a. (2,1)-Orders)
|
to appear in SIAM Journal on Computing
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Canonical orderings [STOC'88, FOCS'92] have been used as a key tool in graph
drawing, graph encoding and visibility representations for the last decades. We
study a far-reaching generalization of canonical orderings to non-planar graphs
that was published by Lee Mondshein in a PhD-thesis at M.I.T. as early as 1971.
Mondshein proposed to order the vertices of a graph in a sequence such that,
for any i, the vertices from 1 to i induce essentially a 2-connected graph
while the remaining vertices from i+1 to n induce a connected graph.
Mondshein's sequence generalizes canonical orderings and became later and
independently known under the name non-separating ear decomposition.
Surprisingly, this fundamental link between canonical orderings and
non-separating ear decomposition has not been established before. Currently,
the fastest known algorithm for computing a Mondshein sequence achieves a
running time of O(nm); the main open problem in Mondshein's and follow-up work
is to improve this running time to subquadratic time.
After putting Mondshein's work into context, we present an algorithm that
computes a Mondshein sequence in optimal time and space O(m). This improves the
previous best running time by a factor of n. We illustrate the impact of this
result by deducing linear-time algorithms for five other problems, for four out
of which the previous best running times have been quadratic. In particular, we
show how to - compute three independent spanning trees of a 3-connected graph
in time O(m), - improve the preprocessing time from O(n^2) to O(m) for a data
structure reporting 3 internally disjoint paths between any given vertex pair,
- derive a very simple O(n)-time planarity test once a Mondshein sequence has
been computed, - compute a nested family of contractible subgraphs of
3-connected graphs in time O(m), - compute a 3-partition in time O(m).
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 16:16:33 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Feb 2014 10:36:06 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Jul 2015 12:49:58 GMT"
},
{
"version": "v4",
"created": "Fri, 19 Aug 2016 17:19:23 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Schmidt",
"Jens M.",
""
]
] |
new_dataset
| 0.996943 |
1503.03964
|
Shintaro Mori
|
Shunsuke Yoshida, Masato Hisakado and Shintaro Mori
|
Interactive Restless Multi-armed Bandit Game and Swarm Intelligence
Effect
|
18 pages, 4 figures
|
New generation computing, vol.34, No. 3, 291-306, 2016
|
10.1007/s00354-016-0306-y
| null |
cs.AI cs.LG physics.data-an stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We obtain the conditions for the emergence of the swarm intelligence effect
in an interactive game of restless multi-armed bandit (rMAB). A player competes
with multiple agents. Each bandit has a payoff that changes with a probability
$p_{c}$ per round. The agents and player choose one of three options: (1)
Exploit (a good bandit), (2) Innovate (asocial learning for a good bandit among
$n_{I}$ randomly chosen bandits), and (3) Observe (social learning for a good
bandit). Each agent has two parameters $(c,p_{obs})$ to specify the decision:
(i) $c$, the threshold value for Exploit, and (ii) $p_{obs}$, the probability
for Observe in learning. The parameters $(c,p_{obs})$ are uniformly
distributed. We determine the optimal strategies for the player using complete
knowledge about the rMAB. We show whether or not social or asocial learning is
more optimal in the $(p_{c},n_{I})$ space and define the swarm intelligence
effect. We conduct a laboratory experiment (67 subjects) and observe the swarm
intelligence effect only if $(p_{c},n_{I})$ are chosen so that social learning
is far more optimal than asocial learning.
|
[
{
"version": "v1",
"created": "Fri, 13 Mar 2015 06:53:01 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Yoshida",
"Shunsuke",
""
],
[
"Hisakado",
"Masato",
""
],
[
"Mori",
"Shintaro",
""
]
] |
new_dataset
| 0.996711 |
1505.01326
|
EPTCS
|
Satoshi Matsuoka (National Institute of Advanced Industrial Science
and Technology)
|
Strong Typed B\"ohm Theorem and Functional Completeness on the Linear
Lambda Calculus
|
In Proceedings MSFP 2016, arXiv:1604.00384
|
EPTCS 207, 2016, pp. 1-22
|
10.4204/EPTCS.207.1
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we prove a version of the typed B\"ohm theorem on the linear
lambda calculus, which says, for any given types A and B, when two different
closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given,
there is a term t such that t s1 is convertible to u1 and t s2 is convertible
to u2. Several years ago, a weaker version of this theorem was proved, but the
stronger version was open. As a corollary of this theorem, we prove that if A
has two different closed terms s1 and s2, then A is functionally complete with
regard to s1 and s2. So far, it was only known that a few types are
functionally complete.
|
[
{
"version": "v1",
"created": "Wed, 6 May 2015 11:49:06 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Apr 2016 09:03:37 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Matsuoka",
"Satoshi",
"",
"National Institute of Advanced Industrial Science\n and Technology"
]
] |
new_dataset
| 0.990858 |
1507.00255
|
Jingjing Ren
|
Jingjing Ren, Ashwin Rao, Martina Lindorfer, Arnaud Legout, David
Choffnes
|
ReCon: Revealing and Controlling PII Leaks in Mobile Network Traffic
|
Please use MobiSys version when referencing this work:
http://dl.acm.org/citation.cfm?id=2906392. 18 pages, recon.meddle.mobi
| null |
10.1145/2906388.2906392
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that apps running on mobile devices extensively track and
leak users' personally identifiable information (PII); however, these users
have little visibility into PII leaked through the network traffic generated by
their devices, and have poor control over how, when and where that traffic is
sent and handled by third parties. In this paper, we present the design,
implementation, and evaluation of ReCon: a cross-platform system that reveals
PII leaks and gives users control over them without requiring any special
privileges or custom OSes. ReCon leverages machine learning to reveal potential
PII leaks by inspecting network traffic, and provides a visualization tool to
empower users with the ability to control these leaks via blocking or
substitution of PII. We evaluate ReCon's effectiveness with measurements from
controlled experiments using leaks from the 100 most popular iOS, Android, and
Windows Phone apps, and via an IRB-approved user study with 92 participants. We
show that ReCon is accurate, efficient, and identifies a wider range of PII
than previous approaches.
|
[
{
"version": "v1",
"created": "Wed, 1 Jul 2015 15:08:26 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Oct 2015 23:46:14 GMT"
},
{
"version": "v3",
"created": "Fri, 19 Aug 2016 08:50:20 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Ren",
"Jingjing",
""
],
[
"Rao",
"Ashwin",
""
],
[
"Lindorfer",
"Martina",
""
],
[
"Legout",
"Arnaud",
""
],
[
"Choffnes",
"David",
""
]
] |
new_dataset
| 0.999129 |
1602.08805
|
Xiaojing Chen
|
Xin Wang, Xiaojing Chen, Tianyi Chen, Longbo Huang, and Georgios B.
Giannakis
|
Two-Scale Stochastic Control for Multipoint Communication Systems with
Renewables
|
10 pages, 7 figures
| null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increasing threats of global warming and climate changes call for an
energy-efficient and sustainable design of future wireless communication
systems. To this end, a novel two-scale stochastic control framework is put
forth for smart-grid powered coordinated multi-point (CoMP) systems. Taking
into account renewable energy sources (RES), dynamic pricing, two-way energy
trading facilities and imperfect energy storage devices, the energy management
task is formulated as an infinite-horizon optimization problem minimizing the
time-average energy transaction cost, subject to the users' quality of service
(QoS) requirements. Leveraging the Lyapunov optimization approach as well as
the stochastic subgradient method, a two-scale online control (TS-OC) approach
is developed for the resultant smart-grid powered CoMP systems. Using only
historical data, the proposed TS-OC makes online control decisions at two
timescales, and features a provably feasible and asymptotically near-optimal
solution. Numerical tests further corroborate the theoretical analysis, and
demonstrate the merits of the proposed approach.
|
[
{
"version": "v1",
"created": "Mon, 29 Feb 2016 03:12:43 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Aug 2016 06:37:44 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Wang",
"Xin",
""
],
[
"Chen",
"Xiaojing",
""
],
[
"Chen",
"Tianyi",
""
],
[
"Huang",
"Longbo",
""
],
[
"Giannakis",
"Georgios B.",
""
]
] |
new_dataset
| 0.997427 |
1608.05384
|
George MacCartney Jr
|
George R. MacCartney Jr., Shu Sun, Theodore S. Rappaport, Yunchou
Xing, Hangsong Yan, Jeton Koka, Ruichen Wang, and Dian Yu
|
Millimeter Wave Wireless Communications: New Results for Rural
Connectivity
|
to appear in All Things Cellular'16, in conjunction with ACM MobiCom,
Oct. 7, 2016
| null |
10.1145/2980055.2987353
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
This paper shows the remarkable distances that can be achieved using
millimeter wave communications, and presents a new rural macrocell (RMa) path
loss model for millimeter wave frequencies, based on measurements at 73 GHz in
rural Virginia. Path loss models are needed to estimate signal coverage and
interference for wireless network design, yet little is known about rural
propagation at millimeter waves. This work identifies problems with the RMa
model used by the 3rd Generation Partnership Project (3GPP) TR 38.900 Release
14, and offers a close-in (CI) reference distance model that has improved
accuracy, fewer parameters, and better stability as compared with the existing
3GPP RMa path loss model. The measurements and models presented here are the
first to validate rural millimeter wave path loss models.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 19:36:41 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Aug 2016 01:10:22 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"MacCartney",
"George R.",
"Jr."
],
[
"Sun",
"Shu",
""
],
[
"Rappaport",
"Theodore S.",
""
],
[
"Xing",
"Yunchou",
""
],
[
"Yan",
"Hangsong",
""
],
[
"Koka",
"Jeton",
""
],
[
"Wang",
"Ruichen",
""
],
[
"Yu",
"Dian",
""
]
] |
new_dataset
| 0.999725 |
1608.05440
|
Manuel Carro
|
Manuel Carro and Andy King (Eds.)
|
Papers presented at the 32nd International Conference on Logic
Programming (ICLP 2016)
|
To be published at Theory and Practive of Logic Programming
|
Theory and Practice of Logic Programming, Vol. 16, 2016
| null | null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the list of the full papers accepted for presentation at the 32nd
International Conference on Logic Programming, New York City, USA, October
18-21, 2016.
In addition to the main conference itself, ICLP hosted four pre-conference
workshops, the Autumn School on Logic Programing, and a Doctoral Consortium.
The final versions of the full papers will be published in a special issue of
the journal Theory and Practice of Logic Programming (TPLP). We received eighty
eight abstract submissions, of which twenty seven papers were accepted for
publication as TPLP rapid communications.
Papers deemed of sufficiently high quality to be presented as the conference,
but not enough to be appear in TPLP, will be published as Technical
Communications in the OASIcs series. Fifteen papers fell into this category.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 21:58:34 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Carro",
"Manuel",
"",
"Eds."
],
[
"King",
"Andy",
"",
"Eds."
]
] |
new_dataset
| 0.99715 |
1608.05445
|
Farnood Merrikh-Bayat
|
F. Merrikh Bayat, F. Alibart, L. Gao, and D.B. Strukov
|
A Reconfigurable FIR Filter with Memristor-Based Weights
|
4 pages
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on experimental demonstration of a mixed-signal 6-tap
finite-impulse response (FIR) filter in which weights are implemented with
titanium dioxide memristive devices. In the proposed design weight of a tap is
stored with a relatively high precision in a memristive device that can be
configured in field. Such approach enables efficient implementation of the most
critical operation of an FIR filter, i.e. multiplication of the input signal
with the tap weights and summation of the products from taps, in analog domain.
As a result, the proposed design, when implemented with fully integrated hybrid
CMOS/memristor circuit, is expected to be much more compact and energy
efficient as compared to the state-of-the-art approaches.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 22:37:15 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Bayat",
"F. Merrikh",
""
],
[
"Alibart",
"F.",
""
],
[
"Gao",
"L.",
""
],
[
"Strukov",
"D. B.",
""
]
] |
new_dataset
| 0.98457 |
1608.05457
|
Takeshi Onishi
|
Takeshi Onishi, Hai Wang, Mohit Bansal, Kevin Gimpel and David
McAllester
|
Who did What: A Large-Scale Person-Centered Cloze Dataset
|
To appear at EMNLP 2016. Our dataset is available at
tticnlp.github.io/who_did_what
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have constructed a new "Who-did-What" dataset of over 200,000
fill-in-the-gap (cloze) multiple choice reading comprehension problems
constructed from the LDC English Gigaword newswire corpus. The WDW dataset has
a variety of novel features. First, in contrast with the CNN and Daily Mail
datasets (Hermann et al., 2015) we avoid using article summaries for question
formation. Instead, each problem is formed from two independent articles --- an
article given as the passage to be read and a separate article on the same
events used to form the question. Second, we avoid anonymization --- each
choice is a person named entity. Third, the problems have been filtered to
remove a fraction that are easily solved by simple baselines, while remaining
84% solvable by humans. We report performance benchmarks of standard systems
and propose the WDW dataset as a challenge task for the community.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2016 00:13:10 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Onishi",
"Takeshi",
""
],
[
"Wang",
"Hai",
""
],
[
"Bansal",
"Mohit",
""
],
[
"Gimpel",
"Kevin",
""
],
[
"McAllester",
"David",
""
]
] |
new_dataset
| 0.999813 |
1608.05619
|
Alicia Villanueva
|
Mar\'ia Alpuente, Daniel Pardo, Alicia Villanueva
|
Symbolic Abstract Contract Synthesis in a Rewriting Framework
|
Pre-proceedings paper presented at the 26th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh,
Scotland UK, 6-8 September 2016 (arXiv:1608.02534)
| null | null |
LOPSTR/2016/1
|
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an automated technique for inferring software contracts from
programs that are written in a non-trivial fragment of C, called KernelC, that
supports pointer-based structures and heap manipulation. Starting from the
semantic definition of KernelC in the K framework, we enrich the symbolic
execution facilities recently provided by K with novel capabilities for
assertion synthesis that are based on abstract subsumption. Roughly speaking,
we define an abstract symbolic technique that explains the execution of a
(modifier) C function by using other (observer) routines in the same program.
We implemented our technique in the automated tool KindSpec 2.0, which
generates logical axioms that express pre- and post-condition assertions by
defining the precise input/output behaviour of the C routines.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2016 14:43:25 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Alpuente",
"María",
""
],
[
"Pardo",
"Daniel",
""
],
[
"Villanueva",
"Alicia",
""
]
] |
new_dataset
| 0.994977 |
1608.05634
|
Timo Bingmann
|
Timo Bingmann, Michael Axtmann, Emanuel J\"obstl, Sebastian Lamm,
Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias
Sturm, and Peter Sanders
|
Thrill: High-Performance Algorithmic Distributed Batch Data Processing
with C++
| null | null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design and a first performance evaluation of Thrill -- a
prototype of a general purpose big data processing framework with a convenient
data-flow style programming interface. Thrill is somewhat similar to Apache
Spark and Apache Flink with at least two main differences. First, Thrill is
based on C++ which enables performance advantages due to direct native code
compilation, a more cache-friendly memory layout, and explicit memory
management. In particular, Thrill uses template meta-programming to compile
chains of subsequent local operations into a single binary routine without
intermediate buffering and with minimal indirections. Second, Thrill uses
arrays rather than multisets as its primary data structure which enables
additional operations like sorting, prefix sums, window scans, or combining
corresponding fields of several arrays (zipping). We compare Thrill with Apache
Spark and Apache Flink using five kernels from the HiBench suite. Thrill is
consistently faster and often several times faster than the other frameworks.
At the same time, the source codes have a similar level of simplicity and
abstraction
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2016 15:13:31 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Bingmann",
"Timo",
""
],
[
"Axtmann",
"Michael",
""
],
[
"Jöbstl",
"Emanuel",
""
],
[
"Lamm",
"Sebastian",
""
],
[
"Nguyen",
"Huyen Chau",
""
],
[
"Noe",
"Alexander",
""
],
[
"Schlag",
"Sebastian",
""
],
[
"Stumpp",
"Matthias",
""
],
[
"Sturm",
"Tobias",
""
],
[
"Sanders",
"Peter",
""
]
] |
new_dataset
| 0.999166 |
1608.05664
|
Fei Li
|
Yang Yan, Fei Li and Qiuyan Wang
|
A family of linear codes with three weights
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, linear codes constructed by defining sets have attracted a lot of
study, and many optimal linear codes with a few weights have been produced. The
objective of this paper is to present a class of binary linear codes with three
weights.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2016 16:34:10 GMT"
}
] | 2016-08-22T00:00:00 |
[
[
"Yan",
"Yang",
""
],
[
"Li",
"Fei",
""
],
[
"Wang",
"Qiuyan",
""
]
] |
new_dataset
| 0.997718 |
1608.05168
|
Cory James Kleinheksel
|
Cory J. Kleinheksel and Arun K. Somani
|
Optical quorum cycles for efficient communication
|
arXiv admin note: substantial text overlap with arXiv:1608.05170,
arXiv:1608.05172
|
Photon Netw Commun (2016) 31: 196
|
10.1007/s11107-015-0561-8
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many optical networks face heterogeneous communication requests requiring
topologies to be efficient and fault tolerant. For efficiency and distributed
control, it is common in distributed systems and algorithms to group nodes into
intersecting sets referred to as quorum sets. We show efficiency and
distributed control can also be accomplished in optical network routing by
applying the same established quorum set theory. Cycle-based optical network
routing, whether using SONET rings or p-cycles, provides the sufficient
reliability in the network. Light-trails forming a cycle allow broadcasts
within a cycle to be used for efficient multicasts. Cyclic quorum sets also
have all pairs of nodes occurring in one or more quorums, so efficient,
arbitrary unicast communication can occur between any two nodes. Efficient
broadcasts to all network nodes are possible by a node broadcasting to all
quorum cycles to which it belongs (O(sqrt(N))). In this paper, we propose
applying the distributed efficiency of the quorum sets to routing optical
cycles based on light-trails. With this new method of topology construction,
unicast and multicast communication requests do not need to be known or even
modeled a priori. Additionally, in the presence of network link faults, greater
than 99 % average coverage enables the continued operation of nearly all
arbitrary unicast and multicast requests in the network. Finally, to further
improve the fault coverage, an augmentation to the ECBRA cycle finding
algorithm is proposed.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 04:28:47 GMT"
}
] | 2016-08-20T00:00:00 |
[
[
"Kleinheksel",
"Cory J.",
""
],
[
"Somani",
"Arun K.",
""
]
] |
new_dataset
| 0.990242 |
1608.05097
|
Adnan Memon
|
Adnan Memon
|
Secret Sharing With Trusted Third Parties Using Piggy Bank Protocol
|
10 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new scheme to distribute secret shares using two
trusted third parties to increase security and eliminate the dependency on
single trusted third party. This protocol for communication between a device
and two trusted third parties uses the piggy bank cryptographic paradigm. We
also present a protocol to give law enforcing agencies access to sensitive
information present on a cell phone or a device using secret sharing scheme.
The ideas for classical systems may also be applied to quantum schemes.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2016 20:48:51 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Memon",
"Adnan",
""
]
] |
new_dataset
| 0.996018 |
1608.05129
|
Liang Wu
|
Liang Wu, Fred Morstatter, Huan Liu
|
SlangSD: Building and Using a Sentiment Dictionary of Slang Words for
Short-Text Sentiment Classification
|
15 pages, 2 figures
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sentiment in social media is increasingly considered as an important resource
for customer segmentation, market understanding, and tackling other
socio-economic issues. However, sentiment in social media is difficult to
measure since user-generated content is usually short and informal. Although
many traditional sentiment analysis methods have been proposed, identifying
slang sentiment words remains untackled. One of the reasons is that slang
sentiment words are not available in existing dictionaries or sentiment
lexicons. To this end, we propose to build the first sentiment dictionary of
slang words to aid sentiment analysis of social media content. It is laborious
and time-consuming to collect and label the sentiment polarity of a
comprehensive list of slang words. We present an approach to leverage web
resources to construct an extensive Slang Sentiment word Dictionary (SlangSD)
that is easy to maintain and extend. SlangSD is publicly available for research
purposes. We empirically show the advantages of using SlangSD, the newly-built
slang sentiment word dictionary for sentiment classification, and provide
examples demonstrating its ease of use with an existing sentiment system.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2016 23:32:57 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Wu",
"Liang",
""
],
[
"Morstatter",
"Fred",
""
],
[
"Liu",
"Huan",
""
]
] |
new_dataset
| 0.999467 |
1608.05140
|
Guillaume Jourjon
|
Stephen Mallon, Vincent Gramoli and Guillaume Jourjon
|
Are Today's SDN Controllers Ready for Primetime?
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SDN efficiency is driven by the ability of controllers to process small
packets based on a global view of the network. The goal of such controllers is
thus to treat new flows coming from hundreds of switches in a timely fashion.
In this paper, we show this ideal remains impossible through the most extensive
evaluation of SDN controllers. We evaluated five state-of-the-art SDN
controllers and discovered that the most efficient one spends a fifth of his
time in packet serialization. More dramatically, we show that this limitation
is inherent to the object oriented design principle of these controllers. They
all treat each single packet as an individual object, a limitation that induces
an unaffordable per-packet overhead. To eliminate the responsibility of the
hardware from our results, we ported these controllers on a network-efficient
architecture, Tilera, and showed even worse performance. We thus argue for an
in-depth rethinking of the design of the SDN controller into a lower level
software that leverages both operating system optimizations and modern hardware
features.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 00:41:25 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Mallon",
"Stephen",
""
],
[
"Gramoli",
"Vincent",
""
],
[
"Jourjon",
"Guillaume",
""
]
] |
new_dataset
| 0.994928 |
1608.05169
|
Hsiang-Hsuan Liu
|
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang
|
P_3-Games
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Without further ado, we present the P_3-game. The P_3-game is decidable for
elementary classes of graphs such as paths and cycles. From an algorithmic
point of view, the connected P_3-game is fascinating. We show that the
connected P_3-game is polynomially decidable for classes such as trees, chordal
graphs, ladders, cacti, outerplanar graphs and circular arc graphs.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 04:31:00 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Hon",
"Wing-Kai",
""
],
[
"Kloks",
"Ton",
""
],
[
"Liu",
"Fu-Hong",
""
],
[
"Liu",
"Hsiang-Hsuan",
""
],
[
"Wang",
"Tao-Ming",
""
]
] |
new_dataset
| 0.996502 |
1608.05186
|
Youbao Tang
|
Youbao Tang, Xiangqian Wu
|
Saliency Detection via Combining Region-Level and Pixel-Level
Predictions with CNNs
|
18 pages, 9 figures, accepted by ECCV 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a novel saliency detection method by combining
region-level saliency estimation and pixel-level saliency prediction with CNNs
(denoted as CRPSD). For pixel-level saliency prediction, a fully convolutional
neural network (called pixel-level CNN) is constructed by modifying the VGGNet
architecture to perform multi-scale feature learning, based on which an
image-to-image prediction is conducted to accomplish the pixel-level saliency
detection. For region-level saliency estimation, an adaptive superpixel based
region generation technique is first designed to partition an image into
regions, based on which the region-level saliency is estimated by using a CNN
model (called region-level CNN). The pixel-level and region-level saliencies
are fused to form the final salient map by using another CNN (called fusion
CNN). And the pixel-level CNN and fusion CNN are jointly learned. Extensive
quantitative and qualitative experiments on four public benchmark datasets
demonstrate that the proposed method greatly outperforms the state-of-the-art
saliency detection approaches.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 06:00:18 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Tang",
"Youbao",
""
],
[
"Wu",
"Xiangqian",
""
]
] |
new_dataset
| 0.993137 |
1608.05243
|
Ana Marasovi\'c
|
Ana Marasovi\'c and Anette Frank
|
Multilingual Modal Sense Classification using a Convolutional Neural
Network
|
Final version, accepted at the 1st Workshop on Representation
Learning for NLP, held in conjunction with ACL 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modal sense classification (MSC) is a special WSD task that depends on the
meaning of the proposition in the modal's scope. We explore a CNN architecture
for classifying modal sense in English and German. We show that CNNs are
superior to manually designed feature-based classifiers and a standard NN
classifier. We analyze the feature maps learned by the CNN and identify known
and previously unattested linguistic features. We benchmark the CNN on a
standard WSD task, where it compares favorably to models using
sense-disambiguated target vectors.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 11:41:45 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Marasović",
"Ana",
""
],
[
"Frank",
"Anette",
""
]
] |
new_dataset
| 0.976155 |
1608.05308
|
Sidi Ahmed Ezzahidi
|
Sidi Ahmed Ezzahidi, Essaid Sabir, Mounir Ghogho
|
A Distributed Satisfactory Content Delivery Scheme for QoS Provisioning
in Delay Tolerant Networks
| null | null | null | null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We deal in this paper with the content forwarding problem in Delay Tolerant
Networks (DTNs). We first formulate the content delivery interaction as a
non-cooperative satisfaction game. On one hand, the source node seeks to ensure
a delivery probability above some given threshold. On the other hand, the relay
nodes seek to maximize their own payoffs. The source node offers a reward
(virtual coins) to the relay which caches and forwards the file to the final
destination. Each relay faces the dilemma of accepting/rejecting to cache the
source's file. Cooperation incurs energy cost due to caching, carrying and
forwarding the source's file. Yet, when a relay accepts to cooperate, it may
receive some reward if it succeeds to be the first relay to forward the content
to the destination. Otherwise, the relay may receive some penalty in the form
of a constant regret; the latter parameter is introduced to make incentive for
cooperation. Next, we introduce the concept of Satisfaction Equilibrium (SE) as
a solution concept to the induced game. Now, the source node is solely
interested in reaching a file delivery probability greater than some given
threshold, while the relays behave rationally to maximize their respective
payoffs. Full characterizations of the SEs for both pure and mixed strategies
are derived. Furthermore, we propose two learning algorithms allowing the
players (source/relays) to reach the SE strategies. Finally, extensive
numerical investigations and some learning simulations are carried out to
illustrate the behaviour of the interacting nodes.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 15:52:37 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Ezzahidi",
"Sidi Ahmed",
""
],
[
"Sabir",
"Essaid",
""
],
[
"Ghogho",
"Mounir",
""
]
] |
new_dataset
| 0.996297 |
1608.05374
|
Srikanth Ronanki
|
Srikanth Ronanki and Siva Reddy and Bajibabu Bollepalli and Simon King
|
DNN-based Speech Synthesis for Indian Languages from ASCII text
|
6 pages, 5 figures -- Accepted in 9th ISCA Speech Synthesis Workshop
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
Text-to-Speech synthesis in Indian languages has a seen lot of progress over
the decade partly due to the annual Blizzard challenges. These systems assume
the text to be written in Devanagari or Dravidian scripts which are nearly
phonemic orthography scripts. However, the most common form of computer
interaction among Indians is ASCII written transliterated text. Such text is
generally noisy with many variations in spelling for the same word. In this
paper we evaluate three approaches to synthesize speech from such noisy ASCII
text: a naive Uni-Grapheme approach, a Multi-Grapheme approach, and a
supervised Grapheme-to-Phoneme (G2P) approach. These methods first convert the
ASCII text to a phonetic script, and then learn a Deep Neural Network to
synthesize speech from that. We train and test our models on Blizzard Challenge
datasets that were transliterated to ASCII using crowdsourcing. Our experiments
on Hindi, Tamil and Telugu demonstrate that our models generate speech of
competetive quality from ASCII text compared to the speech synthesized from the
native scripts. All the accompanying transliterated datasets are released for
public access.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 18:58:39 GMT"
}
] | 2016-08-19T00:00:00 |
[
[
"Ronanki",
"Srikanth",
""
],
[
"Reddy",
"Siva",
""
],
[
"Bollepalli",
"Bajibabu",
""
],
[
"King",
"Simon",
""
]
] |
new_dataset
| 0.99937 |
1404.5012
|
Ching-Yi Lai
|
Ching-Yi Lai and Min-Hsiu Hsieh and Hsiao-feng Lu
|
On the MacWilliams Identity for Classical and Quantum Convolutional
Codes
|
Part of this work was in Proceedings of IEEE Intl. Symp. Inf. Theory
2014, and part of this work was in Proceedings of IEEE Information Theory
Workshop 2014. 11 pages, 4 figures
|
IEEE Transactions on Communications, vol. 64, no. 8, pp.
3148-3159, Aug 2016
|
10.1109/TCOMM.2016.2585641
| null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The weight generating functions associated with convolutional codes (CCs) are
based on state space realizations or the weight adjacency matrices (WAMs). The
MacWilliams identity for CCs on the WAMs was first established by Gluesing-
Luerssen and Schneider in the case of minimal encoders, and generalized by
Forney. We consider this problem in the viewpoint of constraint codes and
obtain a simple and direct proof of this MacWilliams identity in the case of
minimal encoders. For our purpose, we choose a different representation for the
exact weight generating function (EWGF) of a block code, by defining it as a
linear combination of orthonormal vectors in Dirac bra-ket notation. This
representation provides great flexibility so that general split weight
generating functions and their MacWilliams identities can be easily obtained
from the MacWilliams identity for EWGFs. As a result, we also obtain the
MacWilliams identity for the input-parity weight adjacency matrices of a
systematic convolutional code and its dual. Finally, paralleling the
development of the classical case, we establish the MacWilliams identity for
quantum convolutional codes.
|
[
{
"version": "v1",
"created": "Sun, 20 Apr 2014 04:52:44 GMT"
},
{
"version": "v2",
"created": "Tue, 6 May 2014 10:21:58 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Jun 2016 07:49:26 GMT"
}
] | 2016-08-18T00:00:00 |
[
[
"Lai",
"Ching-Yi",
""
],
[
"Hsieh",
"Min-Hsiu",
""
],
[
"Lu",
"Hsiao-feng",
""
]
] |
new_dataset
| 0.972634 |
1503.04702
|
Simon Perdrix
|
David Cattan\'eo, Simon Perdrix
|
Minimum Degree up to Local Complementation: Bounds, Parameterized
Complexity, and Exact Algorithms
| null |
ISAAC 2015
|
10.1007/978-3-662-48971-0_23
| null |
cs.DM math.CO quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The local minimum degree of a graph is the minimum degree that can be reached
by means of local complementation. For any n, there exist graphs of order n
which have a local minimum degree at least 0.189n, or at least 0.110n when
restricted to bipartite graphs. Regarding the upper bound, we show that for any
graph of order n, its local minimum degree is at most 3n/8+o(n) and n/4+o(n)
for bipartite graphs, improving the known n/2 upper bound. We also prove that
the local minimum degree is smaller than half of the vertex cover number (up to
a logarithmic term). The local minimum degree problem is NP-Complete and hard
to approximate. We show that this problem, even when restricted to bipartite
graphs, is in W[2] and FPT-equivalent to the EvenSet problem, which
W[1]-hardness is a long standing open question. Finally, we show that the local
minimum degree is computed by a O*(1.938^n)-algorithm, and a
O*(1.466^n)-algorithm for the bipartite graphs.
|
[
{
"version": "v1",
"created": "Mon, 16 Mar 2015 16:04:33 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Aug 2016 13:21:12 GMT"
}
] | 2016-08-18T00:00:00 |
[
[
"Cattanéo",
"David",
""
],
[
"Perdrix",
"Simon",
""
]
] |
new_dataset
| 0.984701 |
1605.09474
|
Huseyin Birkan Yilmaz
|
Weisi Guo, Yansha Deng, H. Birkan Yilmaz, Nariman Farsad, Maged
Elkashlan, Chan-Byoung Chae, Andrew Eckford, Arumugam Nallanathan
|
SMIET: Simultaneous Molecular Information and Energy Transfer
| null | null | null | null |
cs.ET cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The performance of communication systems is fundamentally limited by the loss
of energy through propagation and circuit inefficiencies. In this article, we
show that it is possible to achieve ultra low energy communications at the
nano-scale, if diffusive molecules are used for carrying data. Whilst the
energy of electromagnetic waves will inevitably decay as a function of
transmission distance and time, the energy in individual molecules does not.
Over time, the receiver has an opportunity to recover some, if not all of the
molecular energy transmitted. The article demonstrates the potential of
ultra-low energy simultaneous molecular information and energy transfer (SMIET)
through the design of two different nano-relay systems, and the discusses how
molecular communications can benefit more from crowd energy harvesting than
traditional wave-based systems.
|
[
{
"version": "v1",
"created": "Tue, 31 May 2016 02:54:55 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Aug 2016 18:05:08 GMT"
}
] | 2016-08-18T00:00:00 |
[
[
"Guo",
"Weisi",
""
],
[
"Deng",
"Yansha",
""
],
[
"Yilmaz",
"H. Birkan",
""
],
[
"Farsad",
"Nariman",
""
],
[
"Elkashlan",
"Maged",
""
],
[
"Chae",
"Chan-Byoung",
""
],
[
"Eckford",
"Andrew",
""
],
[
"Nallanathan",
"Arumugam",
""
]
] |
new_dataset
| 0.99018 |
1608.04953
|
Kapil Dev
|
Kapil Dev, Manfred Lau, Ligang Liu
|
A Perceptual Aesthetics Measure for 3D Shapes
|
12 Pages, 8 Figures, Conference
| null | null | null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While the problem of image aesthetics has been well explored, the study of 3D
shape aesthetics has focused on specific manually defined features. In this
paper, we learn an aesthetics measure for 3D shapes autonomously from raw voxel
data and without manually-crafted features by leveraging the strength of deep
learning. We collect data from humans on their aesthetics preferences for
various 3D shape classes. We take a deep convolutional 3D shape ranking
approach to compute a measure that gives an aesthetics score for a 3D shape. We
demonstrate our approach with various types of shapes and for applications such
as aesthetics-based visualization, search, and scene composition.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2016 13:07:27 GMT"
}
] | 2016-08-18T00:00:00 |
[
[
"Dev",
"Kapil",
""
],
[
"Lau",
"Manfred",
""
],
[
"Liu",
"Ligang",
""
]
] |
new_dataset
| 0.998388 |
1608.04967
|
Manuel Mazzara
|
Lukas Breitwieser, Roman Bauer, Alberto Di Meglio, Leonard Johard,
Marcus Kaiser, Marco Manca, Manuel Mazzara, Fons Rademakers, Max Talanov
|
The BioDynaMo Project: Creating a Platform for Large-Scale Reproducible
Biological Simulations
|
4th Workshop on Sustainable Software for Science: Practice and
Experiences (WSSSPE4), 2016
| null | null | null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer simulations have become a very powerful tool for scientific
research. In order to facilitate research in computational biology, the
BioDynaMo project aims at a general platform for biological computer
simulations, which should be executable on hybrid cloud computing systems. This
paper describes challenges and lessons learnt during the early stages of the
software development process, in the context of implementation issues and the
international nature of the collaboration.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2016 13:55:43 GMT"
}
] | 2016-08-18T00:00:00 |
[
[
"Breitwieser",
"Lukas",
""
],
[
"Bauer",
"Roman",
""
],
[
"Di Meglio",
"Alberto",
""
],
[
"Johard",
"Leonard",
""
],
[
"Kaiser",
"Marcus",
""
],
[
"Manca",
"Marco",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Rademakers",
"Fons",
""
],
[
"Talanov",
"Max",
""
]
] |
new_dataset
| 0.994636 |
1608.05045
|
Yong Khoo
|
Hugo Martin, Raphael Fernandez, Yong Khoo
|
Large Angle based Skeleton Extraction for 3D Animation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a solution for arbitrary 3D character deformation
by investigating rotation angle of decomposition and preserving the mesh
topology structure. In computer graphics, skeleton extraction and
skeleton-driven animation is an active areas and gains increasing interests
from researchers. The accuracy is critical for realistic animation and related
applications. There have been extensive studies on skeleton based 3D
deformation. However for the scenarios of large angle rotation of different
body parts, it has been relatively less addressed by the state-of-the-art,
which often yield unsatisfactory results. Besides 3D animation problems, we
also notice for many 3D skeleton detection or tracking applications from a
video or depth streams, large angle rotation is also a critical factor in the
regression accuracy and robustness. We introduced a distortion metric function
to quantify the surface curviness before and after deformation, which is a
major clue for large angle rotation detection. The intensive experimental
results show that our method is suitable for 3D modeling, animation, skeleton
based tracking applications.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2016 18:53:50 GMT"
}
] | 2016-08-18T00:00:00 |
[
[
"Martin",
"Hugo",
""
],
[
"Fernandez",
"Raphael",
""
],
[
"Khoo",
"Yong",
""
]
] |
new_dataset
| 0.99475 |
1608.05054
|
Muhammet Bastan
|
Muhammet Bastan and Hilal Kandemir and Busra Canturk
|
MT3S: Mobile Turkish Scene Text-to-Speech System for the Visually
Impaired
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reading text is one of the essential needs of the visually impaired people.
We developed a mobile system that can read Turkish scene and book text, using a
fast gradient-based multi-scale text detection algorithm for real-time
operation and Tesseract OCR engine for character recognition. We evaluated the
OCR accuracy and running time of our system on a new, publicly available mobile
Turkish scene text dataset we constructed and also compared with
state-of-the-art systems. Our system proved to be much faster, able to run on a
mobile device, with OCR accuracy comparable to the state-of-the-art.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2016 19:24:23 GMT"
}
] | 2016-08-18T00:00:00 |
[
[
"Bastan",
"Muhammet",
""
],
[
"Kandemir",
"Hilal",
""
],
[
"Canturk",
"Busra",
""
]
] |
new_dataset
| 0.999699 |
1604.02129
|
Scott Workman
|
Scott Workman, Menghua Zhai, Nathan Jacobs
|
Horizon Lines in the Wild
|
British Machine Vision Conference (BMVC) 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The horizon line is an important contextual attribute for a wide variety of
image understanding tasks. As such, many methods have been proposed to estimate
its location from a single image. These methods typically require the image to
contain specific cues, such as vanishing points, coplanar circles, and regular
textures, thus limiting their real-world applicability. We introduce a large,
realistic evaluation dataset, Horizon Lines in the Wild (HLW), containing
natural images with labeled horizon lines. Using this dataset, we investigate
the application of convolutional neural networks for directly estimating the
horizon line, without requiring any explicit geometric constraints or other
special cues. An extensive evaluation shows that using our CNNs, either in
isolation or in conjunction with a previous geometric approach, we achieve
state-of-the-art results on the challenging HLW dataset and two existing
benchmark datasets.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2016 19:38:24 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Aug 2016 18:48:57 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Workman",
"Scott",
""
],
[
"Zhai",
"Menghua",
""
],
[
"Jacobs",
"Nathan",
""
]
] |
new_dataset
| 0.999499 |
1608.04428
|
Alexander Gaunt
|
Alexander L. Gaunt, Marc Brockschmidt, Rishabh Singh, Nate Kushman,
Pushmeet Kohli, Jonathan Taylor, Daniel Tarlow
|
TerpreT: A Probabilistic Programming Language for Program Induction
|
50 pages, 20 figures, 4 tables
| null | null | null |
cs.LG cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study machine learning formulations of inductive program synthesis; given
input-output examples, we try to synthesize source code that maps inputs to
corresponding outputs. Our aims are to develop new machine learning approaches
based on neural networks and graphical models, and to understand the
capabilities of machine learning techniques relative to traditional
alternatives, such as those based on constraint solving from the programming
languages community.
Our key contribution is the proposal of TerpreT, a domain-specific language
for expressing program synthesis problems. TerpreT is similar to a
probabilistic programming language: a model is composed of a specification of a
program representation (declarations of random variables) and an interpreter
describing how programs map inputs to outputs (a model connecting unknowns to
observations). The inference task is to observe a set of input-output examples
and infer the underlying program. TerpreT has two main benefits. First, it
enables rapid exploration of a range of domains, program representations, and
interpreter models. Second, it separates the model specification from the
inference algorithm, allowing like-to-like comparisons between different
approaches to inference. From a single TerpreT specification we automatically
perform inference using four different back-ends. These are based on gradient
descent, linear program (LP) relaxations for graphical models, discrete
satisfiability solving, and the Sketch program synthesis system.
We illustrate the value of TerpreT by developing several interpreter models
and performing an empirical comparison between alternative inference
algorithms. Our key empirical finding is that constraint solvers dominate the
gradient descent and LP-based formulations. We conclude with suggestions for
the machine learning community to make progress on program synthesis.
|
[
{
"version": "v1",
"created": "Mon, 15 Aug 2016 22:34:50 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Gaunt",
"Alexander L.",
""
],
[
"Brockschmidt",
"Marc",
""
],
[
"Singh",
"Rishabh",
""
],
[
"Kushman",
"Nate",
""
],
[
"Kohli",
"Pushmeet",
""
],
[
"Taylor",
"Jonathan",
""
],
[
"Tarlow",
"Daniel",
""
]
] |
new_dataset
| 0.988018 |
1608.04437
|
Mayank Kejriwal
|
Mayank Kejriwal, Daniel P. Miranker
|
Self-contained NoSQL Resources for Cross-Domain RDF
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cross-domain knowledge bases such as DBpedia, Freebase and YAGO have emerged
as encyclopedic hubs in the Web of Linked Data. Despite enabling several
practical applications in the Semantic Web, the large-scale, schema-free nature
of such graphs often precludes research groups from employing them widely as
evaluation test cases for entity resolution and instance-based ontology
alignment applications. Although the ground-truth linkages between the three
knowledge bases above are available, they are not amenable to resource-limited
applications. One reason is that the ground-truth files are not self-contained,
meaning that a researcher must usually perform a series of expensive joins
(typically in MapReduce) to obtain usable information sets. In this paper, we
upload several publicly licensed data resources to the public cloud and use
simple Hadoop clusters to compile, and make accessible, three cross-domain
self-contained test cases involving linked instances from DBpedia, Freebase and
YAGO. Self-containment is enabled by virtue of a simple NoSQL JSON-like
serialization format. Potential applications for these resources, particularly
related to testing transfer learning research hypotheses, are also briefly
described.
|
[
{
"version": "v1",
"created": "Mon, 15 Aug 2016 23:32:31 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Kejriwal",
"Mayank",
""
],
[
"Miranker",
"Daniel P.",
""
]
] |
new_dataset
| 0.962063 |
1608.04466
|
Suzhi Bi
|
Suzhi Bi and Rui Zhang
|
Distributed Charging Control in Broadband Wireless Power Transfer
Networks
|
This paper has been accepted for publication in Journal on Selected
Areas in Communications - Series on Communications and Networking (Dec. 2016
issue)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless power transfer (WPT) technology provides a cost-effective solution
to achieve sustainable energy supply in wireless networks, where WPT-enabled
energy nodes (ENs) can charge wireless devices (WDs) remotely without
interruption to the use. However, in a heterogeneous WPT network with
distributed ENs and WDs, some WDs may quickly deplete their batteries due to
the lack of timely wireless power supply by the ENs, thus resulting in short
network operating lifetime. In this paper, we exploit frequency diversity in a
broadband WPT network and study the distributed charging control by ENs to
maximize network lifetime. In particular, we propose a practical voting-based
distributed charging control framework where each WD simply estimates the
broadband channel, casts its vote(s) for some strong sub-channel(s) and sends
to the ENs along with its battery state information, based on which the ENs
independently allocate their transmit power over the sub-channels without the
need of centralized control. Under this framework, we aim to design
lifetime-maximizing power allocation and efficient voting-based feedback
methods. Towards this end, we first derive the general expression of the
expected lifetime of a WPT network and draw the general design principles for
lifetime-maximizing charging control. Based on the analysis, we then propose a
distributed charging control protocol with voting-based feedback, where the
power allocated to sub-channels at each EN is a function of the weighted sum
vote received from all WDs. Besides, the number of votes cast by a WD and the
weight of each vote are related to its current battery state. Simulation
results show that the proposed distributed charging control protocol could
significantly increase the network lifetime under stringent transmit power
constraint in a broadband WPT network.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2016 02:44:06 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Bi",
"Suzhi",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.983145 |
1608.04509
|
Zhe Ji
|
Chunping Zhang, Zhe Ji, Qing Wang
|
Unconstrained Two-parallel-plane Model for Focused Plenoptic Cameras
Calibration
|
20 pages, 10 figures, 1 table
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The plenoptic camera can capture both angular and spatial information of the
rays, enabling 3D reconstruction by single exposure. The geometry of the
recovered scene structure is affected by the calibration of the plenoptic
camera significantly. In this paper, we propose a novel unconstrained
two-parallel-plane (TPP) model with 7 parameters to describe a 4D light field.
By reconstructing scene points from ray-ray association, a 3D projective
transformation is deduced to establish the relationship between the scene
structure and the TPP parameters. Based on the transformation, we simplify the
focused plenoptic camera as a TPP model and calibrate its intrinsic parameters.
Our calibration method includes a close-form solution and a nonlinear
optimization by minimizing re-projection error. Experiments on both simulated
data and real scene data verify the performance of the calibration on the
focused plenoptic camera.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2016 08:02:55 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Zhang",
"Chunping",
""
],
[
"Ji",
"Zhe",
""
],
[
"Wang",
"Qing",
""
]
] |
new_dataset
| 0.981255 |
1608.04511
|
Gidi Elazar
|
Gidi Elazar and Alfred M. Bruckstein
|
AntPaP: Patrolling and Fair Partitioning of Graphs by A(ge)nts Leaving
Pheromone Traces
|
74 pages
| null | null |
CIS-2016-04
|
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A team of identical and oblivious ant-like agents - a(ge)nts - leaving
pheromone traces, are programmed to jointly patrol an area modeled as a graph.
They perform this task using simple local interactions, while also achieving
the important byproduct of partitioning the graph into roughly equal-sized
disjoint sub-graphs. Each a(ge)nt begins to operate at an arbitrary initial
location, and throughout its work does not acquire any information on either
the shape or size of the graph, or the number or whereabouts of other a(ge)nts.
Graph partitioning occurs spontaneously, as each of the a(ge)nts patrols and
expands its own pheromone-marked sub-graph, or region. This graph partitioning
algorithm is inspired by molecules hitting the borders of air filled elastic
balloons: an a(ge)nt that hits a border edge from the interior of its region
more frequently than an external a(ge)nt hits the same edge from an adjacent
vertex in the neighboring region, may conquer that adjacent vertex, expanding
its region at the expense of the neighbor. Since the rule of patrolling a
region ensures that each vertex is visited with a frequency inversely
proportional to the size of the region, in terms of vertex count, a smaller
region will effectively exert higher "pressure" at its borders, and conquer
adjacent vertices from a larger region, thereby increasing the smaller region
and shrinking the larger. The algorithm, therefore, tends to equalize the sizes
of the regions patrolled, resembling a set of perfectly elastic physical
balloons, confined to a closed volume and filled with an equal amount of air.
The pheromone based local interactions of agents eventually cause the system to
evolve into a partition that is close to balanced rather quickly, and if the
graph and the number of a(ge)nts remain unchanged, it is guaranteed that the
system settles into a stable and balanced partition.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2016 08:07:41 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Elazar",
"Gidi",
""
],
[
"Bruckstein",
"Alfred M.",
""
]
] |
new_dataset
| 0.997926 |
1608.04563
|
Der-Yeuan Yu
|
Der-Yeuan Yu, Aanjhan Ranganathan, Ramya Jayaram Masti, Claudio
Soriente, Srdjan Capkun
|
SALVE: Server Authentication with Location VErification
|
14 pages. This paper will be presented at the 22nd ACM International
Conference on Mobile Computing and Networking (MobiCom 2016). Related paper:
https://eprint.iacr.org/2015/230
| null |
10.1145/2973750.2973766
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Location Service (LCS) proposed by the telecommunication industry is an
architecture that allows the location of mobile devices to be accessed in
various applications. We explore the use of LCS in location-enhanced server
authentication, which traditionally relies on certificates. Given recent
incidents involving certificate authorities, various techniques to strengthen
server authentication were proposed. They focus on improving the certificate
validation process, such as pinning, revocation, or multi-path probing. In this
paper, we propose using the server's geographic location as a second factor of
its authenticity. Our solution, SALVE, achieves location-based server
authentication by using secure DNS resolution and by leveraging LCS for
location measurements. We develop a TLS extension that enables the client to
verify the server's location in addition to its certificate. Successful server
authentication therefore requires a valid certificate and the server's presence
at a legitimate geographic location, e.g., on the premises of a data center.
SALVE prevents server impersonation by remote adversaries with mis-issued
certificates or stolen private keys of the legitimate server. We develop a
prototype implementation and our evaluation in real-world settings shows that
it incurs minimal impact to the average server throughput. Our solution is
backward compatible and can be integrated with existing approaches for
improving server authentication in TLS.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2016 12:10:57 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Yu",
"Der-Yeuan",
""
],
[
"Ranganathan",
"Aanjhan",
""
],
[
"Masti",
"Ramya Jayaram",
""
],
[
"Soriente",
"Claudio",
""
],
[
"Capkun",
"Srdjan",
""
]
] |
new_dataset
| 0.999826 |
1608.04579
|
Ralph Holz
|
Dario Banfi and Olivier Mehani and Guillaume Jourjon and Lukas
Schwaighofer and Ralph Holz
|
Endpoint-transparent Multipath Transport with Software-defined Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multipath forwarding consists of using multiple paths simultaneously to
transport data over the network. While most such techniques require endpoint
modifications, we investigate how multipath forwarding can be done inside the
network, transparently to endpoint hosts. With such a network-centric approach,
packet reordering becomes a critical issue as it may cause critical performance
degradation.
We present a Software Defined Network architecture which automatically sets
up multipath forwarding, including solutions for reordering and performance
improvement, both at the sending side through multipath scheduling algorithms,
and the receiver side, by resequencing out-of-order packets in a dedicated
in-network buffer.
We implemented a prototype with commonly available technology and evaluated
it in both emulated and real networks. Our results show consistent throughput
improvements, thanks to the use of aggregated path capacity. We give
comparisons to Multipath TCP, where we show our approach can achieve a similar
performance while offering the advantage of endpoint transparency.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2016 12:59:13 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Banfi",
"Dario",
""
],
[
"Mehani",
"Olivier",
""
],
[
"Jourjon",
"Guillaume",
""
],
[
"Schwaighofer",
"Lukas",
""
],
[
"Holz",
"Ralph",
""
]
] |
new_dataset
| 0.993866 |
1608.04720
|
Saeed Nejati
|
Saeed Nejati, Jia Hui Liang, Vijay Ganesh, Catherine Gebotys,
Krzysztof Czarnecki
|
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash
Functions
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SAT solvers are increasingly being used for cryptanalysis of hash functions
and symmetric encryption schemes. Inspired by this trend, we present MapleCrypt
which is a SAT solver-based cryptanalysis tool for inverting hash functions. We
reduce the hash function inversion problem for fixed targets into the
satisfiability problem for Boolean logic, and use MapleCrypt to construct
preimages for these targets. MapleCrypt has two key features, namely, a
multi-armed bandit based adaptive restart (MABR) policy and a
counterexample-guided abstraction refinement (CEGAR) technique. The MABR
technique uses reinforcement learning to adaptively choose between different
restart policies during the run of the solver. The CEGAR technique abstracts
away certain steps of the input hash function, replacing them with the identity
function, and verifies whether the solution constructed by MapleCrypt indeed
hashes to the previously fixed targets. If it is determined that the solution
produced is spurious, the abstraction is refined until a correct inversion to
the input hash target is produced. We show that the resultant system is faster
for inverting the SHA-1 hash function than state-of-the-art inversion tools.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2016 19:33:04 GMT"
}
] | 2016-08-17T00:00:00 |
[
[
"Nejati",
"Saeed",
""
],
[
"Liang",
"Jia Hui",
""
],
[
"Ganesh",
"Vijay",
""
],
[
"Gebotys",
"Catherine",
""
],
[
"Czarnecki",
"Krzysztof",
""
]
] |
new_dataset
| 0.991608 |
1303.1870
|
Kenza Guenda
|
Aicha Batoul, Kenza Guenda, T. Aaron Gulliver and Nuh Aydin
|
On Isodual Cyclic Codes over Finite Fields and Finite Chain Rings:
Monomial Equivalence
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper present the construction cyclic isodual codes over finite fields
and finite chain rings. These codes are monomially equivalent to their dual.
Conditions are given for the existence of cyclic isodual codes. In addition,
the concept of duadic codes over finite fields is extended to finite chain
rings. Several constructions of isodual cyclic codes and self-dual codes are
given.
|
[
{
"version": "v1",
"created": "Fri, 8 Mar 2013 01:45:25 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Aug 2016 15:24:42 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Batoul",
"Aicha",
""
],
[
"Guenda",
"Kenza",
""
],
[
"Gulliver",
"T. Aaron",
""
],
[
"Aydin",
"Nuh",
""
]
] |
new_dataset
| 0.999321 |
1602.00328
|
Konstantinos Rematas
|
Konstantinos Rematas, Chuong Nguyen, Tobias Ritschel, Mario Fritz and
Tinne Tuytelaars
|
Novel Views of Objects from a Single Image
|
to appear in PAMI 2016
| null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Taking an image of an object is at its core a lossy process. The rich
information about the three-dimensional structure of the world is flattened to
an image plane and decisions such as viewpoint and camera parameters are final
and not easily revertible. As a consequence, possibilities of changing
viewpoint are limited. Given a single image depicting an object, novel-view
synthesis is the task of generating new images that render the object from a
different viewpoint than the one given. The main difficulty is to synthesize
the parts that are disoccluded; disocclusion occurs when parts of an object are
hidden by the object itself under a specific viewpoint. In this work, we show
how to improve novel-view synthesis by making use of the correlations observed
in 3D models and applying them to new image instances. We propose a technique
to use the structural information extracted from a 3D model that matches the
image object in terms of viewpoint and shape. For the latter part, we propose
an efficient 2D-to-3D alignment method that associates precisely the image
appearance with the 3D model geometry with minimal user interaction. Our
technique is able to simulate plausible viewpoint changes for a variety of
object classes within seconds. Additionally, we show that our synthesized
images can be used as additional training data that improves the performance of
standard object detectors.
|
[
{
"version": "v1",
"created": "Sun, 31 Jan 2016 21:43:13 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Aug 2016 03:03:50 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Rematas",
"Konstantinos",
""
],
[
"Nguyen",
"Chuong",
""
],
[
"Ritschel",
"Tobias",
""
],
[
"Fritz",
"Mario",
""
],
[
"Tuytelaars",
"Tinne",
""
]
] |
new_dataset
| 0.983633 |
1602.08406
|
Nikos Tzevelekos
|
Guilhem Jaber, Nikos Tzevelekos
|
Trace semantics for polymorphic references
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a trace semantics for a call-by-value language with full
polymorphism and higher-order references. This is an operational game semantics
model based on a nominal interpretation of parametricity whereby polymorphic
values are abstracted with special kinds of names. The use of polymorphic
references leads to violations of parametricity which we counter by closely
recoding the disclosure of typing information in the semantics. We prove the
model sound for the full language and strengthen our result to full abstraction
for a large fragment where polymorphic references obey specific inhabitation
conditions.
|
[
{
"version": "v1",
"created": "Fri, 26 Feb 2016 17:14:18 GMT"
},
{
"version": "v2",
"created": "Sun, 14 Aug 2016 15:28:05 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Jaber",
"Guilhem",
""
],
[
"Tzevelekos",
"Nikos",
""
]
] |
new_dataset
| 0.954196 |
1607.05654
|
Tommy Nilsson
|
Tommy Nilsson, Alan Blackwell, Carl Hogsden, David Scruton
|
Ghosts! A Location-Based Bluetooth LE Mobile Game for Museum Exploration
|
10 pages, 6th Global Conference: Videogame Cultures and the Future of
Interactive Entertainment. 2016. In Lindsey Joyce and Brian Quinn (Eds.)
Mapping the Digital: Cultures and Territories of Play, Oxford,
Inter-Disciplinary Press, pp. 129-138
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BLE (Bluetooth Low Energy) is a new wireless communication technology that,
thanks to reduced power consumption, promises to facilitate communication
between computing devices and help us harness their power in environments and
contexts previously untouched by information technology. Museums and other
facilities housing various cultural content are a particularly interesting area
of application. The University of Cambridge Museums consortium has put
considerable effort into researching the potential uses of emerging
technologies such as BLE to unlock new experiences enriching the way we engage
with cultural information. As a part of this research initiative, our ambition
has been to examine the challenges and opportunities introduced by the
introduction of a BLE-centred system into the museum context. We present an
assessment of the potential offered by this technology and of the design
approaches that might yield the best results when developing BLE-centred
experiences for museum environments. A pivotal part of our project consisted of
designing, developing and evaluating a prototype mobile location-based
BLE-centred game. A number of technical problems, such as unstable and
fluctuating signal strength, were encountered throughout the project lifecycle.
Instead of attempting to eliminate such problems, we argued in favour of
embracing them and turning them into a cornerstone of the gameplay. Our study
suggested that this alternative seamful design approach yields particularly
good results when deploying the technology in public environments. The project
outcome also demonstrated the potential of BLE-centred solutions to reach out
and engage new demographics, especially children, extending their interest in
museum visits.
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2016 16:47:55 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Nilsson",
"Tommy",
""
],
[
"Blackwell",
"Alan",
""
],
[
"Hogsden",
"Carl",
""
],
[
"Scruton",
"David",
""
]
] |
new_dataset
| 0.999245 |
1607.06986
|
Shervin Ardeshir
|
Shervin Ardeshir, Ali Borji
|
Ego2Top: Matching Viewers in Egocentric and Top-view Videos
|
European Conference on Computer Vision (ECCV) 2016. Amsterdam, the
Netherlands
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Egocentric cameras are becoming increasingly popular and provide us with
large amounts of videos, captured from the first person perspective. At the
same time, surveillance cameras and drones offer an abundance of visual
information, often captured from top-view. Although these two sources of
information have been separately studied in the past, they have not been
collectively studied and related. Having a set of egocentric cameras and a
top-view camera capturing the same area, we propose a framework to identify the
egocentric viewers in the top-view video. We utilize two types of features for
our assignment procedure. Unary features encode what a viewer (seen from
top-view or recording an egocentric video) visually experiences over time.
Pairwise features encode the relationship between the visual content of a pair
of viewers. Modeling each view (egocentric or top) by a graph, the assignment
process is formulated as spectral graph matching. Evaluating our method over a
dataset of 50 top-view and 188 egocentric videos taken in different scenarios
demonstrates the efficiency of the proposed approach in assigning egocentric
viewers to identities present in top-view camera. We also study the effect of
different parameters such as the number of egocentric viewers and visual
features.
|
[
{
"version": "v1",
"created": "Sun, 24 Jul 2016 00:28:01 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Aug 2016 21:49:56 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Ardeshir",
"Shervin",
""
],
[
"Borji",
"Ali",
""
]
] |
new_dataset
| 0.978713 |
1608.01820
|
Andreas Brandstadt
|
Andreas Brandstadt, Suhail Mahfud, Raffaele Mosca
|
Bounded Clique-Width of ($S_{1,2,2}$,Triangle)-Free Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If a graph has no induced subgraph isomorphic to $H_1$ or $H_2$ then it is
said to be ($H_1,H_2$)-free. Dabrowski and Paulusma found 13 open cases for the
question whether the clique-width of ($H_1,H_2$)-free graphs is bounded. One of
them is the class of ($S_{1,2,2}$,triangle)-free graphs. In this paper we show
that these graphs have bounded clique-width. Thus, also
($P_1+2P_2$,triangle)-free graphs have bounded clique-width which solves
another open problem of Dabrowski and Paulusma. Meanwhile we were informed by
Paulusma that in December 2015, Dabrowski, Dross and Paulusma showed that
($S_{1,2,2}$,triangle)-free graphs (and some other graph classes) have bounded
clique-width.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2016 09:59:24 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Aug 2016 08:46:34 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Brandstadt",
"Andreas",
""
],
[
"Mahfud",
"Suhail",
""
],
[
"Mosca",
"Raffaele",
""
]
] |
new_dataset
| 0.989328 |
1608.03961
|
Antonios Argyriou
|
Polykarpos Thomadakis, Antonios Argyriou
|
Reed-Solomon and Concatenated Codes with Applications in Space
Communication
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we provide a detailed description of Reed-Solomon (RS) codes,
the most important algorithms for decoding them, and their use in concatenated
coding systems for space applications. In the current literature there is
scattered information regarding the bit-level implementation of such codes for
either space systems or any other type of application. Consequently, we start
with a general overview of the channel coding systems used in space
communications and then we focus in the finest details. We first present a
detailed description of the required algebra of RS codes with detailed
examples. Next, the steps of the encoding and decoding algorithms are described
with detail and again with additional examples. Next, we focus on a
particularly important class of concatenated encoders/decoders namely the
Consultative Committee for Space Data Systems (CCSDS) concatenated coding
system that uses RS as the outer code, and a convolutional inner code. Finally,
we perform a thorough performance evaluation of the presented codes under the
AWGN channel model.
|
[
{
"version": "v1",
"created": "Sat, 13 Aug 2016 09:51:13 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Thomadakis",
"Polykarpos",
""
],
[
"Argyriou",
"Antonios",
""
]
] |
new_dataset
| 0.99863 |
1608.04016
|
Sergio Antoy
|
Sergio Antoy and Andy Jost
|
A New Functional-Logic Compiler for Curry: Sprite
|
Pre-proceedings paper presented at the 26th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh,
Scotland UK, 6-8 September 2016 (arXiv:1608.02534)
| null | null |
LOPSTR/2016/17
|
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new native code compiler for Curry codenamed Sprite. Sprite is
based on the Fair Scheme, a compilation strategy that provides instructions for
transforming declarative, non-deterministic programs of a certain class into
imperative, deterministic code. We outline salient features of Sprite, discuss
its implementation of Curry programs, and present benchmarking results. Sprite
is the first-to-date operationally complete implementation of Curry.
Preliminary results show that ensuring this property does not incur a
significant penalty.
|
[
{
"version": "v1",
"created": "Sat, 13 Aug 2016 18:41:11 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Antoy",
"Sergio",
""
],
[
"Jost",
"Andy",
""
]
] |
new_dataset
| 0.999401 |
1608.04080
|
Sungho Shin
|
Sungho Shin and Wonyong Sung
|
Dynamic Hand Gesture Recognition for Wearable Devices with Low
Complexity Recurrent Neural Networks
|
This paper was accepted in ISCAS 2016
| null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gesture recognition is a very essential technology for many wearable devices.
While previous algorithms are mostly based on statistical methods including the
hidden Markov model, we develop two dynamic hand gesture recognition techniques
using low complexity recurrent neural network (RNN) algorithms. One is based on
video signal and employs a combined structure of a convolutional neural network
(CNN) and an RNN. The other uses accelerometer data and only requires an RNN.
Fixed-point optimization that quantizes most of the weights into two bits is
conducted to optimize the amount of memory size for weight storage and reduce
the power consumption in hardware and software based implementations.
|
[
{
"version": "v1",
"created": "Sun, 14 Aug 2016 09:32:17 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Shin",
"Sungho",
""
],
[
"Sung",
"Wonyong",
""
]
] |
new_dataset
| 0.993148 |
1608.04295
|
Jiahao Chen
|
Jiahao Chen and Jarrett Revels
|
Robust benchmarking in noisy environments
|
7 pages, 5 figures, Proceedings of the 20th Annual IEEE High
Performance Extreme Computing Conference, 2016
| null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a benchmarking strategy that is robust in the presence of timer
error, OS jitter and other environmental fluctuations, and is insensitive to
the highly nonideal statistics produced by timing measurements. We construct a
model that explains how these strongly nonideal statistics can arise from
environmental fluctuations, and also justifies our proposed strategy. We
implement this strategy in the BenchmarkTools Julia package, where it is used
in production continuous integration (CI) pipelines for developing the Julia
language and its ecosystem.
|
[
{
"version": "v1",
"created": "Mon, 15 Aug 2016 15:02:13 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Chen",
"Jiahao",
""
],
[
"Revels",
"Jarrett",
""
]
] |
new_dataset
| 0.956413 |
1608.04303
|
R\u{a}zvan Deaconescu
|
R\u{a}zvan Deaconescu, Luke Deshotels, Mihai Bucicoiu, William Enck,
Lucas Davi, Ahmad-Reza Sadeghi
|
SandBlaster: Reversing the Apple Sandbox
|
25 pages, 9 figures, 14 listings This report is an auxiliary document
to the paper "SandScout: Automatic Detection of Flaws in iOS Sandbox
Profiles", to be presented at the ACM Conference on Computer and
Communications Security (CCS) 2016
| null | null | null |
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to limit the damage of malware on Mac OS X and iOS, Apple uses
sandboxing, a kernel-level security layer that provides tight constraints for
system calls. Particularly used for Apple iOS, sandboxing prevents apps from
executing potentially dangerous actions, by defining rules in a sandbox
profile. Investigating Apple's built-in sandbox profiles is difficult as they
are compiled and stored in binary format. We present SandBlaster, a software
bundle that is able to reverse/decompile Apple binary sandbox profiles to their
original human readable SBPL (SandBox Profile Language) format. We use
SandBlaster to reverse all built-in Apple iOS binary sandbox profiles for iOS
7, 8 and 9. Our tool is, to the best of our knowledge, the first to provide a
full reversing of the Apple sandbox, shedding light into the inner workings of
Apple sandbox profiles and providing essential support for security researchers
and professionals interested in Apple security mechanisms.
|
[
{
"version": "v1",
"created": "Mon, 15 Aug 2016 15:26:22 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Deaconescu",
"Răzvan",
""
],
[
"Deshotels",
"Luke",
""
],
[
"Bucicoiu",
"Mihai",
""
],
[
"Enck",
"William",
""
],
[
"Davi",
"Lucas",
""
],
[
"Sadeghi",
"Ahmad-Reza",
""
]
] |
new_dataset
| 0.999508 |
1608.04319
|
Nilanjan De
|
Nilanjan De
|
Narumi-Katayama Index of Total Transformation Graphs
|
15 Pages. arXiv admin note: text overlap with arXiv:1606.05989
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Narumi-Katayama index of a graph was introduced in 1984 for representing
the carbon skeleton of a saturated hydrocarbons and is defined as the product
of degrees of all the vertices of the graph. In this paper, we examine the
Narumi-Katayama index of different total transformation graphs.
|
[
{
"version": "v1",
"created": "Mon, 15 Aug 2016 16:28:14 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"De",
"Nilanjan",
""
]
] |
new_dataset
| 0.998931 |
cs/0405059
|
M. Benjamin Leveque
|
Benjamin L\'ev\^eque (Leibniz - IMAG), Fr\'ed\'eric Maffray (Leibniz -
IMAG)
|
Erratum : MCColor is not optimal on Meyniel graphs
| null | null | null | null |
cs.DM math.CO
| null |
A Meyniel graph is a graph in which every odd cycle of length at least five
has two chords. In the manuscript "Coloring Meyniel graphs in linear time" we
claimed that our algorithm MCColor produces an optimal coloring for every
Meyniel graph. But later we found a mistake in the proof and a couterexample to
the optimality, which we present here. MCColor can still be used to find a
stable set that intersects all maximal cliques of a Meyniel graph in linear
time. Consequently it can be used to find an optimal coloring in time O(nm),
and the same holds for Algorithm MCS+Color. This is explained in the manuscript
"A linear algorithm to find a strong stable set in a Meyniel graph" but this is
equivalent to Hertz's algorithm. The current best algorithm for coloring
Meyniel graphs is the O(n^2) algorithm LexColor due to Roussel and Rusu. The
question of finding a linear-time algorithm to color Meyniel graphs is still
open.
|
[
{
"version": "v1",
"created": "Mon, 17 May 2004 14:04:47 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Apr 2005 05:40:46 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Dec 2005 09:33:50 GMT"
},
{
"version": "v4",
"created": "Mon, 9 Jan 2006 20:03:23 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Lévêque",
"Benjamin",
"",
"Leibniz - IMAG"
],
[
"Maffray",
"Frédéric",
"",
"Leibniz -\n IMAG"
]
] |
new_dataset
| 0.985886 |
cs/0506006
|
Guillaume Huard
|
Nicolas Capit (ID - Imag, Inria Rh\^one-Alpes / Id-Imag), Georges Da
Costa (ID - Imag, Inria Rh\^one-Alpes / Id-Imag), Yiannis Georgiou (ID -
Imag, Inria Rh\^one-Alpes / Id-Imag), Guillaume Huard (ID - Imag, Inria
Rh\^one-Alpes / Id-Imag), Cyrille Martin (ID - Imag), Gr\'egory Mouni\'e (ID
- Imag, Inria Rh\^one-Alpes / Id-Imag), Pierre Neyron (ID - Imag), Olivier
Richard (ID - Imag, Inria Rh\^one-Alpes / Id-Imag)
|
A batch scheduler with high level components
| null |
Cluster computing and Grid 2005 (CCGrid05), Royaume-Uni (2005)
| null | null |
cs.DC
| null |
In this article we present the design choices and the evaluation of a batch
scheduler for large clusters, named OAR. This batch scheduler is based upon an
original design that emphasizes on low software complexity by using high level
tools. The global architecture is built upon the scripting language Perl and
the relational database engine Mysql. The goal of the project OAR is to prove
that it is possible today to build a complex system for ressource management
using such tools without sacrificing efficiency and scalability. Currently, our
system offers most of the important features implemented by other batch
schedulers such as priority scheduling (by queues), reservations, backfilling
and some global computing support. Despite the use of high level tools, our
experiments show that our system has performances close to other systems.
Furthermore, OAR is currently exploited for the management of 700 nodes (a
metropolitan GRID) and has shown good efficiency and robustness.
|
[
{
"version": "v1",
"created": "Thu, 2 Jun 2005 13:04:14 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Capit",
"Nicolas",
"",
"ID - Imag, Inria Rhône-Alpes / Id-Imag"
],
[
"Da Costa",
"Georges",
"",
"ID - Imag, Inria Rhône-Alpes / Id-Imag"
],
[
"Georgiou",
"Yiannis",
"",
"ID -\n Imag, Inria Rhône-Alpes / Id-Imag"
],
[
"Huard",
"Guillaume",
"",
"ID - Imag, Inria\n Rhône-Alpes / Id-Imag"
],
[
"Martin",
"Cyrille",
"",
"ID - Imag"
],
[
"Mounié",
"Grégory",
"",
"ID\n - Imag, Inria Rhône-Alpes / Id-Imag"
],
[
"Neyron",
"Pierre",
"",
"ID - Imag"
],
[
"Richard",
"Olivier",
"",
"ID - Imag, Inria Rhône-Alpes / Id-Imag"
]
] |
new_dataset
| 0.983046 |
cs/0510041
|
Gerard Henry Edmond Duchamp
|
G\'erard Henry Edmond Duchamp (LIPN), Pawel Blasiak (LPTL), Andrzej
Horzela (LPTL), Karol A. Penson (LPTL), Allan I. Solomon (LPTL)
|
Feynman graphs and related Hopf algebras
| null | null |
10.1088/1742-6596/30/1/014
| null |
cs.SC cs.DM math-ph math.CO math.MP quant-ph
| null |
In a recent series of communications we have shown that the reordering
problem of bosons leads to certain combinatorial structures. These structures
may be associated with a certain graphical description. In this paper, we show
that there is a Hopf Algebra structure associated with this problem which is,
in a certain sense, unique.
|
[
{
"version": "v1",
"created": "Sat, 15 Oct 2005 06:11:56 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Duchamp",
"Gérard Henry Edmond",
"",
"LIPN"
],
[
"Blasiak",
"Pawel",
"",
"LPTL"
],
[
"Horzela",
"Andrzej",
"",
"LPTL"
],
[
"Penson",
"Karol A.",
"",
"LPTL"
],
[
"Solomon",
"Allan I.",
"",
"LPTL"
]
] |
new_dataset
| 0.97497 |
cs/0601025
|
Michael Ortega
|
Michael Ortega (INRIA Rh\^one-Alpes), Sabine Coquillart (INRIA
Rh\^one-Alpes)
|
Prop-Based Haptic Interaction with Co-location and Immersion: an
Automotive Application
| null |
Dans HAVE 2005 - IEEE International Workshop on Haptic Audio
Visual Environments and their Applications
| null | null |
cs.HC
| null |
Most research on 3D user interfaces aims at providing only a single sensory
modality. One challenge is to integrate several sensory modalities into a
seamless system while preserving each modality's immersion and performance
factors. This paper concerns manipulation tasks and proposes a visuo-haptic
system integrating immersive visualization, tactile force and tactile feedback
with co-location. An industrial application is presented.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2006 13:52:32 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Ortega",
"Michael",
"",
"INRIA Rhône-Alpes"
],
[
"Coquillart",
"Sabine",
"",
"INRIA\n Rhône-Alpes"
]
] |
new_dataset
| 0.975516 |
cs/0605096
|
Franck Petit
|
Yoann Dieudonn\'e (LaRIA), Franck Petit (LaRIA)
|
Circle Formation of Weak Robots and Lyndon Words
|
13 pages
| null | null |
LaRIA-2006-05
|
cs.DC cs.RO
| null |
A Lyndon word is a non-empty word strictly smaller in the lexicographic order
than any of its suffixes, except itself and the empty word. In this paper, we
show how Lyndon words can be used in the distributed control of a set of n weak
mobile robots. By weak, we mean that the robots are anonymous, memoryless,
without any common sense of direction, and unable to communicate in an other
way than observation. An efficient and simple deterministic protocol to form a
regular n-gon is presented and proven for n prime.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2006 12:09:33 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Dieudonné",
"Yoann",
"",
"LaRIA"
],
[
"Petit",
"Franck",
"",
"LaRIA"
]
] |
new_dataset
| 0.997267 |
cs/0606005
|
Marine Minier
|
Samuel Galice (INRIA Rh\^one-Alpes), V\'eronique Legrand (INRIA
Rh\^one-Alpes), Marine Minier (INRIA Rh\^one-Alpes), John Mullins (INRIA
Rh\^one-Alpes), St\'ephane Ub\'eda (INRIA Rh\^one-Alpes)
|
The KAA project: a trust policy point of view
| null | null | null | null |
cs.NI
| null |
In the context of ambient networks where each small device must trust its
neighborhood rather than a fixed network, we propose in this paper a
\textit{trust management framework} inspired by known social patterns and based
on the following statements: each mobile constructs itself a local level of
trust what means that it does not accept recommendation by other peers, and the
only relevant parameter, beyond some special cases discussed later, to evaluate
the level of trust is the number of common trusted mobiles. These trusted
mobiles are considered as entries in a local database called history for each
device and we use identity-based cryptography to ensure strong security:
history must be a non-tansferable object.
|
[
{
"version": "v1",
"created": "Thu, 1 Jun 2006 07:00:41 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Galice",
"Samuel",
"",
"INRIA Rhône-Alpes"
],
[
"Legrand",
"Véronique",
"",
"INRIA\n Rhône-Alpes"
],
[
"Minier",
"Marine",
"",
"INRIA Rhône-Alpes"
],
[
"Mullins",
"John",
"",
"INRIA\n Rhône-Alpes"
],
[
"Ubéda",
"Stéphane",
"",
"INRIA Rhône-Alpes"
]
] |
new_dataset
| 0.99253 |
cs/0606112
|
Salah Baina
|
Salah Baina (CRAN), G\'erard Morel (CRAN)
|
Product Centric Holons for Synchronisation and Interoperability in
Manufacturing Environments
| null |
12th IFAC Symposium on Information Control Problems in
Manufacturing, INCOM'2006, St-Etienne, France (17/05/2006) CDROM
| null | null |
cs.SE
| null |
In the last few years, lot of work has been done in order to ensure
enterprise applications interoperability; however, proposed solutions focus
mainly on enterprise processes. Indeed, throughout product lifecycle
coordination needs to be established between reality in the physical world
(physical view) and the virtual world handled by manufacturing information
systems (informational view). This paper presents a holonic approach that
enables synchronisation of both physical and informational views. A model
driven approach for interoperability is proposed to ensure interoperability of
holon based models with other applications in the enterprise.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2006 11:21:23 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Baina",
"Salah",
"",
"CRAN"
],
[
"Morel",
"Gérard",
"",
"CRAN"
]
] |
new_dataset
| 0.964993 |
cs/0607008
|
Jean-Sebastien Sereni
|
F\'ed\'eric Havet (INRIA Sophia Antipolis), Jean-S\'ebastien Sereni
(INRIA Sophia Antipolis), Riste Skrekovski
|
3-facial colouring of plane graphs
| null | null | null | null |
cs.DM
| null |
A plane graph is l-facially k-colourable if its vertices can be coloured with
k colours such that any two distinct vertices on a facial segment of length at
most l are coloured differently. We prove that every plane graph is 3-facially
11-colourable. As a consequence, we derive that every 2-connected plane graph
with maximum face-size at most 7 is cyclically 11-colourable. These two bounds
are for one off from those that are proposed by the (3l+1)-Conjecture and the
Cyclic Conjecture.
|
[
{
"version": "v1",
"created": "Mon, 3 Jul 2006 06:38:48 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Havet",
"Fédéric",
"",
"INRIA Sophia Antipolis"
],
[
"Sereni",
"Jean-Sébastien",
"",
"INRIA Sophia Antipolis"
],
[
"Skrekovski",
"Riste",
""
]
] |
new_dataset
| 0.998913 |
cs/0607049
|
Pierre Parrend
|
Pierre Parrend (INRIA Rh\^one-Alpes), St\'ephane Fr\'enot (INRIA
Rh\^one-Alpes)
|
Secure Component Deployment in the OSGi(tm) Release 4 Platform
| null | null | null | null |
cs.CR cs.OS
| null |
Last years have seen a dramatic increase in the use of component platforms,
not only in classical application servers, but also more and more in the domain
of Embedded Systems. The OSGi(tm) platform is one of these platforms dedicated
to lightweight execution environments, and one of the most prominent. However,
new platforms also imply new security flaws, and a lack of both knowledge and
tools for protecting the exposed systems. This technical report aims at
fostering the understanding of security mechanisms in component deployment. It
focuses on securing the deployment of components. It presents the cryptographic
mechanisms necessary for signing OSGi(tm) bundles, as well as the detailed
process of bundle signature and validation. We also present the SFelix
platform, which is a secure extension to Felix OSGi(tm) framework
implementation. It includes our implementation of the bundle signature process,
as specified by OSGi(tm) Release 4 Security Layer. Moreover, a tool for signing
and publishing bundles, SFelix JarSigner, has been developed to conveniently
integrate bundle signature in the bundle deployment process.
|
[
{
"version": "v1",
"created": "Tue, 11 Jul 2006 18:54:21 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Aug 2006 07:04:20 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Parrend",
"Pierre",
"",
"INRIA Rhône-Alpes"
],
[
"Frénot",
"Stéphane",
"",
"INRIA\n Rhône-Alpes"
]
] |
new_dataset
| 0.975924 |
cs/0609107
|
Gerard Henry Edmond Duchamp
|
G\'erard Henry Edmond Duchamp (LIPN), Allan I. Solomon (LPTMC), Pawel
Blasiak (LPTMC), Karol A. Penson (LPTMC), Andrzej Horzela (LPTMC)
|
A multipurpose Hopf deformation of the Algebra of Feynman-like Diagrams
|
5 pages
| null | null | null |
cs.OH math-ph math.MP
| null |
We construct a three parameter deformation of the Hopf algebra
$\mathbf{LDIAG}$. This new algebra is a true Hopf deformation which reduces to
$\mathbf{LDIAG}$ on one hand and to $\mathbf{MQSym}$ on the other, relating
$\mathbf{LDIAG}$ to other Hopf algebras of interest in contemporary physics.
Further, its product law reproduces that of the algebra of polyzeta functions.
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2006 09:08:45 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Oct 2006 05:41:51 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Duchamp",
"Gérard Henry Edmond",
"",
"LIPN"
],
[
"Solomon",
"Allan I.",
"",
"LPTMC"
],
[
"Blasiak",
"Pawel",
"",
"LPTMC"
],
[
"Penson",
"Karol A.",
"",
"LPTMC"
],
[
"Horzela",
"Andrzej",
"",
"LPTMC"
]
] |
new_dataset
| 0.996663 |
cs/0609136
|
Adeline Nazarenko
|
Adeline Nazarenko (LIPN), Erick Alphonse (LIPN), Julien Derivi\`ere
(LIPN), Thierry Hamon (LIPN), Guillaume Vauvert (LIPN), Davy Weissenbacher
(LIPN)
|
The ALVIS Format for Linguistically Annotated Documents
| null |
Proceedings of the fifth international conference on Language
Resources and Evaluation, LREC 2006 (2006) 1782-1786
| null | null |
cs.AI
| null |
The paper describes the ALVIS annotation format designed for the indexing of
large collections of documents in topic-specific search engines. This paper is
exemplified on the biological domain and on MedLine abstracts, as developing a
specialized search engine for biologists is one of the ALVIS case studies. The
ALVIS principle for linguistic annotations is based on existing works and
standard propositions. We made the choice of stand-off annotations rather than
inserted mark-up. Annotations are encoded as XML elements which form the
linguistic subsection of the document record.
|
[
{
"version": "v1",
"created": "Sun, 24 Sep 2006 20:04:01 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Nazarenko",
"Adeline",
"",
"LIPN"
],
[
"Alphonse",
"Erick",
"",
"LIPN"
],
[
"Derivière",
"Julien",
"",
"LIPN"
],
[
"Hamon",
"Thierry",
"",
"LIPN"
],
[
"Vauvert",
"Guillaume",
"",
"LIPN"
],
[
"Weissenbacher",
"Davy",
"",
"LIPN"
]
] |
new_dataset
| 0.990026 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.