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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1405.2013
|
Ahmed Hamdi Sakr
|
Ahmed Hamdi Sakr and Ekram Hossain
|
Cognitive and Energy Harvesting-Based D2D Communication in Cellular
Networks: Stochastic Geometry Modeling and Analysis
|
IEEE Transactions on Communications, to appear
| null | null | null |
cs.NI math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While cognitive radio enables spectrum-efficient wireless communication,
radio frequency (RF) energy harvesting from ambient interference is an enabler
for energy-efficient wireless communication. In this paper, we model and
analyze cognitive and energy harvesting-based D2D communication in cellular
networks. The cognitive D2D transmitters harvest energy from ambient
interference and use one of the channels allocated to cellular users (in uplink
or downlink), which is referred to as the D2D channel, to communicate with the
corresponding receivers. We investigate two spectrum access policies for
cellular communication in the uplink or downlink, namely, random spectrum
access (RSA) policy and prioritized spectrum access (PSA) policy. In RSA, any
of the available channels including the channel used by the D2D transmitters
can be selected randomly for cellular communication, while in PSA the D2D
channel is used only when all of the other channels are occupied. A D2D
transmitter can communicate successfully with its receiver only when it
harvests enough energy to perform channel inversion toward the receiver, the
D2D channel is free, and the $\mathsf{SINR}$ at the receiver is above the
required threshold; otherwise, an outage occurs for the D2D communication. We
use tools from stochastic geometry to evaluate the performance of the proposed
communication system model with general path-loss exponent in terms of outage
probability for D2D and cellular users. We show that energy harvesting can be a
reliable alternative to power cognitive D2D transmitters while achieving
acceptable performance. Under the same $\mathsf{SINR}$ outage requirements as
for the non-cognitive case, cognitive channel access improves the outage
probability for D2D users for both the spectrum access policies.
|
[
{
"version": "v1",
"created": "Thu, 8 May 2014 16:50:44 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Apr 2015 17:12:46 GMT"
}
] | 2015-04-17T00:00:00 |
[
[
"Sakr",
"Ahmed Hamdi",
""
],
[
"Hossain",
"Ekram",
""
]
] |
new_dataset
| 0.969713 |
1412.6249
|
Min Lin
|
Min Lin, Shuo Li, Xuan Luo, Shuicheng Yan
|
Purine: A bi-graph based deep learning framework
|
Submitted to ICLR 2015 workshop
| null | null | null |
cs.NE cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a novel deep learning framework, termed Purine.
In Purine, a deep network is expressed as a bipartite graph (bi-graph), which
is composed of interconnected operators and data tensors. With the bi-graph
abstraction, networks are easily solvable with event-driven task dispatcher. We
then demonstrate that different parallelism schemes over GPUs and/or CPUs on
single or multiple PCs can be universally implemented by graph composition.
This eases researchers from coding for various parallelization schemes, and the
same dispatcher can be used for solving variant graphs. Scheduled by the task
dispatcher, memory transfers are fully overlapped with other computations,
which greatly reduce the communication overhead and help us achieve approximate
linear acceleration.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2014 08:20:10 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Dec 2014 03:18:46 GMT"
},
{
"version": "v3",
"created": "Tue, 20 Jan 2015 02:17:39 GMT"
},
{
"version": "v4",
"created": "Mon, 16 Mar 2015 16:13:46 GMT"
},
{
"version": "v5",
"created": "Thu, 16 Apr 2015 13:09:33 GMT"
}
] | 2015-04-17T00:00:00 |
[
[
"Lin",
"Min",
""
],
[
"Li",
"Shuo",
""
],
[
"Luo",
"Xuan",
""
],
[
"Yan",
"Shuicheng",
""
]
] |
new_dataset
| 0.988655 |
1502.04569
|
Mainak Jas
|
Mainak Jas and Devi Parikh
|
Image Specificity
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For some images, descriptions written by multiple people are consistent with
each other. But for other images, descriptions across people vary considerably.
In other words, some images are specific $-$ they elicit consistent
descriptions from different people $-$ while other images are ambiguous.
Applications involving images and text can benefit from an understanding of
which images are specific and which ones are ambiguous. For instance, consider
text-based image retrieval. If a query description is moderately similar to the
caption (or reference description) of an ambiguous image, that query may be
considered a decent match to the image. But if the image is very specific, a
moderate similarity between the query and the reference description may not be
sufficient to retrieve the image.
In this paper, we introduce the notion of image specificity. We present two
mechanisms to measure specificity given multiple descriptions of an image: an
automated measure and a measure that relies on human judgement. We analyze
image specificity with respect to image content and properties to better
understand what makes an image specific. We then train models to automatically
predict the specificity of an image from image features alone without requiring
textual descriptions of the image. Finally, we show that modeling image
specificity leads to improvements in a text-based image retrieval application.
|
[
{
"version": "v1",
"created": "Mon, 16 Feb 2015 15:16:25 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Apr 2015 13:13:46 GMT"
}
] | 2015-04-17T00:00:00 |
[
[
"Jas",
"Mainak",
""
],
[
"Parikh",
"Devi",
""
]
] |
new_dataset
| 0.960905 |
1504.04074
|
Xiaohan Wei
|
Xiaohan Wei and Michael J. Neely
|
Power Aware Wireless File Downloading: A Lyapunov Indexing Approach to A
Constrained Restless Bandit Problem
|
Extended version submitted to IEEE Trans. Network. arXiv admin note:
substantial text overlap with arXiv:1401.3824
| null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper treats power-aware throughput maxi-mization in a multi-user file
downloading system. Each user can receive a new file only after its previous
file is finished. The file state processes for each user act as coupled Markov
chains that form a generalized restless bandit system. First, an optimal
algorithm is derived for the case of one user. The algorithm maximizes
throughput subject to an average power constraint. Next, the one-user algorithm
is extended to a low complexity heuristic for the multi-user problem. The
heuristic uses a simple online index policy. In a special case with no
power-constraint, the multi-user heuristic is shown to be throughput optimal.
Simulations are used to demonstrate effectiveness of the heuristic in the
general case. For simple cases where the optimal solution can be computed
offline, the heuristic is shown to be near-optimal for a wide range of
parameters.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 00:43:27 GMT"
}
] | 2015-04-17T00:00:00 |
[
[
"Wei",
"Xiaohan",
""
],
[
"Neely",
"Michael J.",
""
]
] |
new_dataset
| 0.950822 |
1504.04085
|
Aswin Sankaranarayanan
|
Huaijin Chen, M. Salman Asif, Aswin C. Sankaranarayanan, and Ashok
Veeraraghavan
|
FPA-CS: Focal Plane Array-based Compressive Imaging in Short-wave
Infrared
|
appears in IEEE Conf. Computer Vision and Pattern Recognition, 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cameras for imaging in short and mid-wave infrared spectra are significantly
more expensive than their counterparts in visible imaging. As a result,
high-resolution imaging in those spectrum remains beyond the reach of most
consumers. Over the last decade, compressive sensing (CS) has emerged as a
potential means to realize inexpensive short-wave infrared cameras. One
approach for doing this is the single-pixel camera (SPC) where a single
detector acquires coded measurements of a high-resolution image. A
computational reconstruction algorithm is then used to recover the image from
these coded measurements. Unfortunately, the measurement rate of a SPC is
insufficient to enable imaging at high spatial and temporal resolutions.
We present a focal plane array-based compressive sensing (FPA-CS)
architecture that achieves high spatial and temporal resolutions. The idea is
to use an array of SPCs that sense in parallel to increase the measurement
rate, and consequently, the achievable spatio-temporal resolution of the
camera. We develop a proof-of-concept prototype in the short-wave infrared
using a sensor with 64$\times$ 64 pixels; the prototype provides a 4096$\times$
increase in the measurement rate compared to the SPC and achieves a megapixel
resolution at video rate using CS techniques.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 02:29:20 GMT"
}
] | 2015-04-17T00:00:00 |
[
[
"Chen",
"Huaijin",
""
],
[
"Asif",
"M. Salman",
""
],
[
"Sankaranarayanan",
"Aswin C.",
""
],
[
"Veeraraghavan",
"Ashok",
""
]
] |
new_dataset
| 0.999622 |
1504.04111
|
Bahattin Yildiz
|
Bahattin Yildiz and Ismail G. Kelebek
|
The homogeneous weight for $R_k$, related Gray map and new binary
quasicyclic codes
|
Submitted to be published
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using theoretical results about the homogeneous weights for Frobenius rings,
we describe the homogeneous weight for the ring family $R_k$, a recently
introduced family of Frobenius rings which have been used extensively in coding
theory. We find an associated Gray map for the homogeneous weight using first
order Reed-Muller codes and we describe some of the general properties of the
images of codes over $R_k$ under this Gray map. We then discuss quasitwisted
codes over $R_k$ and their binary images under the homogeneous Gray map. In
this way, we find many optimal binary codes which are self-orthogonal and
quasicyclic. In particular, we find a substantial number of optimal binary
codes that are quasicyclic of index 8, 16 and 24, nearly all of which are new
additions to the database of quasicyclic codes kept by Chen.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 07:07:20 GMT"
}
] | 2015-04-17T00:00:00 |
[
[
"Yildiz",
"Bahattin",
""
],
[
"Kelebek",
"Ismail G.",
""
]
] |
new_dataset
| 0.998131 |
1504.04133
|
Liping Li
|
Liping Li, Wenyi Zhang, Yanjun Hu
|
On the Error Performance of Systematic Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Systematic polar codes are shown to outperform non-systematic polar codes in
terms of the bit-error-rate (BER) performance. However theoretically the
mechanism behind the better performance of systematic polar codes is not yet
clear. In this paper, we set the theoretical framework to analyze the
performance of systematic polar codes. The exact evaluation of the BER of
systematic polar codes conditioned on the BER of non-systematic polar codes
involves in $2^{NR}$ terms where $N$ is the code block length and $R$ is the
code rate, resulting in a prohibitive number of computations for large block
lengths. By analyzing the polar code construction and the
successive-cancellation (SC) decoding process, we use a statistical model to
quantify the advantage of systematic polar codes over non-systematic polar
codes, so called the systematic gain in this paper. A composite model is
proposed to approximate the dominant error cases in the SC decoding process.
This composite model divides the errors into independent regions and coupled
regions, controlled by a coupling coefficient. Based on this model, the
systematic gain can be conveniently calculated. Numerical simulations are
provided in the paper showing very close approximations of the proposed model
in quantifying the systematic gain.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 08:26:55 GMT"
}
] | 2015-04-17T00:00:00 |
[
[
"Li",
"Liping",
""
],
[
"Zhang",
"Wenyi",
""
],
[
"Hu",
"Yanjun",
""
]
] |
new_dataset
| 0.998026 |
1406.5670
|
Zhirong Wu
|
Zhirong Wu, Shuran Song, Aditya Khosla, Fisher Yu, Linguang Zhang,
Xiaoou Tang, Jianxiong Xiao
|
3D ShapeNets: A Deep Representation for Volumetric Shapes
|
to be appeared in CVPR 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3D shape is a crucial but heavily underutilized cue in today's computer
vision systems, mostly due to the lack of a good generic shape representation.
With the recent availability of inexpensive 2.5D depth sensors (e.g. Microsoft
Kinect), it is becoming increasingly important to have a powerful 3D shape
representation in the loop. Apart from category recognition, recovering full 3D
shapes from view-based 2.5D depth maps is also a critical part of visual
understanding. To this end, we propose to represent a geometric 3D shape as a
probability distribution of binary variables on a 3D voxel grid, using a
Convolutional Deep Belief Network. Our model, 3D ShapeNets, learns the
distribution of complex 3D shapes across different object categories and
arbitrary poses from raw CAD data, and discovers hierarchical compositional
part representations automatically. It naturally supports joint object
recognition and shape completion from 2.5D depth maps, and it enables active
object recognition through view planning. To train our 3D deep learning model,
we construct ModelNet -- a large-scale 3D CAD model dataset. Extensive
experiments show that our 3D deep representation enables significant
performance improvement over the-state-of-the-arts in a variety of tasks.
|
[
{
"version": "v1",
"created": "Sun, 22 Jun 2014 03:31:52 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Sep 2014 04:59:49 GMT"
},
{
"version": "v3",
"created": "Wed, 15 Apr 2015 16:46:05 GMT"
}
] | 2015-04-16T00:00:00 |
[
[
"Wu",
"Zhirong",
""
],
[
"Song",
"Shuran",
""
],
[
"Khosla",
"Aditya",
""
],
[
"Yu",
"Fisher",
""
],
[
"Zhang",
"Linguang",
""
],
[
"Tang",
"Xiaoou",
""
],
[
"Xiao",
"Jianxiong",
""
]
] |
new_dataset
| 0.999019 |
1504.03965
|
Simon Lentner
|
Elisabeth Kraus and Simon D. Lentner
|
Nash Equilibria And Partition Functions Of Games With Many Dependent
Players
|
14 pages
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss and solve a model for a game with many players, where a subset of
truely deciding players is embedded into a hierarchy of dependent agents.
These interdependencies modify the game matrix and the Nash equilibria for
the deciding players. In a concrete example, we recognize the partition
function of the Ising model and for high dependency we observe a phase
transition to a new Nash equilibrium, which is the Pareto-efficient outcome.
An example we have in mind is the game theory for major shareholders in a
stock market, where intermediate companies decide according to a majority vote
of their owners and compete for the final profit. In our model, these
interdependency eventually forces cooperation.
|
[
{
"version": "v1",
"created": "Wed, 15 Apr 2015 16:54:29 GMT"
}
] | 2015-04-16T00:00:00 |
[
[
"Kraus",
"Elisabeth",
""
],
[
"Lentner",
"Simon D.",
""
]
] |
new_dataset
| 0.991365 |
1301.6150
|
Naveen Goela
|
Naveen Goela, Emmanuel Abbe, Michael Gastpar
|
Polar Codes For Broadcast Channels
|
25 pages, double-column, 7 figures
|
IEEE Transactions on Information Theory, vol. 61, no. 2, pp.
758-782, Feb. 2015
|
10.1109/TIT.2014.2378172
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are introduced for discrete memoryless broadcast channels. For
$m$-user deterministic broadcast channels, polarization is applied to map
uniformly random message bits from $m$ independent messages to one codeword
while satisfying broadcast constraints. The polarization-based codes achieve
rates on the boundary of the private-message capacity region. For two-user
noisy broadcast channels, polar implementations are presented for two
information-theoretic schemes: i) Cover's superposition codes; ii) Marton's
codes. Due to the structure of polarization, constraints on the auxiliary and
channel-input distributions are identified to ensure proper alignment of
polarization indices in the multi-user setting. The codes achieve rates on the
capacity boundary of a few classes of broadcast channels (e.g., binary-input
stochastically degraded). The complexity of encoding and decoding is $O(n*log
n)$ where $n$ is the block length. In addition, polar code sequences obtain a
stretched-exponential decay of $O(2^{-n^{\beta}})$ of the average block error
probability where $0 < \beta < 0.5$.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2013 20:10:58 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Goela",
"Naveen",
""
],
[
"Abbe",
"Emmanuel",
""
],
[
"Gastpar",
"Michael",
""
]
] |
new_dataset
| 0.99984 |
1310.7536
|
Bei Zeng
|
Markus Grassl, Peter Shor, Graeme Smith, John Smolin, Bei Zeng
|
New Constructions of Codes for Asymmetric Channels via Concatenation
|
9 pages, 3 figures, 4 tables
|
IEEE Transactions on Information Theory, vol. 61, no. 4, pp.
1879-1886, 2015
|
10.1109/TIT.2015.2401567
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present new constructions of codes for asymmetric channels for both binary
and nonbinary alphabets, based on methods of generalized code concatenation.
For the binary asymmetric channel, our methods construct nonlinear
single-error-correcting codes from ternary outer codes. We show that some of
the Varshamov-Tenengol'ts-Constantin-Rao codes, a class of binary nonlinear
codes for this channel, have a nice structure when viewed as ternary codes. In
many cases, our ternary construction yields even better codes. For the
nonbinary asymmetric channel, our methods construct linear codes for many
lengths and distances which are superior to the linear codes of the same length
capable of correcting the same number of symmetric errors.
In the binary case, Varshamov has shown that almost all good linear codes for
the asymmetric channel are also good for the symmetric channel. Our results
indicate that Varshamov's argument does not extend to the nonbinary case, i.e.,
one can find better linear codes for asymmetric channels than for symmetric
ones.
|
[
{
"version": "v1",
"created": "Mon, 28 Oct 2013 19:03:20 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Grassl",
"Markus",
""
],
[
"Shor",
"Peter",
""
],
[
"Smith",
"Graeme",
""
],
[
"Smolin",
"John",
""
],
[
"Zeng",
"Bei",
""
]
] |
new_dataset
| 0.996895 |
1403.5045
|
Branislav Kveton
|
Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, Brian Eriksson
|
Matroid Bandits: Fast Combinatorial Optimization with Learning
| null | null | null | null |
cs.LG cs.AI cs.SY stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A matroid is a notion of independence in combinatorial optimization which is
closely related to computational efficiency. In particular, it is well known
that the maximum of a constrained modular function can be found greedily if and
only if the constraints are associated with a matroid. In this paper, we bring
together the ideas of bandits and matroids, and propose a new class of
combinatorial bandits, matroid bandits. The objective in these problems is to
learn how to maximize a modular function on a matroid. This function is
stochastic and initially unknown. We propose a practical algorithm for solving
our problem, Optimistic Matroid Maximization (OMM); and prove two upper bounds,
gap-dependent and gap-free, on its regret. Both bounds are sublinear in time
and at most linear in all other quantities of interest. The gap-dependent upper
bound is tight and we prove a matching lower bound on a partition matroid
bandit. Finally, we evaluate our method on three real-world problems and show
that it is practical.
|
[
{
"version": "v1",
"created": "Thu, 20 Mar 2014 05:52:43 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Apr 2014 06:25:22 GMT"
},
{
"version": "v3",
"created": "Mon, 16 Jun 2014 20:23:34 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Kveton",
"Branislav",
""
],
[
"Wen",
"Zheng",
""
],
[
"Ashkan",
"Azin",
""
],
[
"Eydgahi",
"Hoda",
""
],
[
"Eriksson",
"Brian",
""
]
] |
new_dataset
| 0.97477 |
1403.5735
|
Jie Xu Dr.
|
Jie Xu and Rui Zhang
|
Cooperative Energy Trading in CoMP Systems Powered by Smart Grids
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the energy management in the coordinated multi-point
(CoMP) systems powered by smart grids, where each base station (BS) with local
renewable energy generation is allowed to implement the two-way energy trading
with the grid. Due to the uneven renewable energy supply and communication
energy demand over distributed BSs as well as the difference in the prices for
their buying/selling energy from/to the gird, it is beneficial for the
cooperative BSs to jointly manage their energy trading with the grid and energy
consumption in CoMP based communication for reducing the total energy cost.
Specifically, we consider the downlink transmission in one CoMP cluster by
jointly optimizing the BSs' purchased/sold energy units from/to the grid and
their cooperative transmit precoding, so as to minimize the total energy cost
subject to the given quality of service (QoS) constraints for the users. First,
we obtain the optimal solution to this problem by developing an algorithm based
on techniques from convex optimization and the uplink-downlink duality. Next,
we propose a sub-optimal solution of lower complexity than the optimal
solution, where zero-forcing (ZF) based precoding is implemented at the BSs.
Finally, through extensive simulations, we show the performance gain achieved
by our proposed joint energy trading and communication cooperation schemes in
terms of energy cost reduction, as compared to conventional schemes that
separately design communication cooperation and energy trading.
|
[
{
"version": "v1",
"created": "Sun, 23 Mar 2014 09:54:17 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Apr 2015 06:38:29 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Xu",
"Jie",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.995493 |
1408.1119
|
Jonathan Scarlett
|
Jonathan Scarlett and Vincent Y. F. Tan
|
Second-Order Asymptotics for the Discrete Memoryless MAC with Degraded
Message Sets
|
5 Pages, 1 Figure. Follow-up paper of http://arxiv.org/abs/1310.1197.
Accepted to ISIT 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the second-order asymptotics of the discrete memoryless
multiple-access channel with degraded message sets. For a fixed average error
probability $\epsilon\in(0,1)$ and an arbitrary point on the boundary of the
capacity region, we characterize the speed of convergence of rate pairs that
converge to that point for codes that have asymptotic error probability no
larger than $\epsilon$, thus complementing an analogous result given previously
for the Gaussian setting.
|
[
{
"version": "v1",
"created": "Tue, 5 Aug 2014 21:28:02 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Sep 2014 16:48:15 GMT"
},
{
"version": "v3",
"created": "Tue, 14 Apr 2015 03:11:13 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Scarlett",
"Jonathan",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.970636 |
1412.0623
|
Sean Bell
|
Sean Bell and Paul Upchurch and Noah Snavely and Kavita Bala
|
Material Recognition in the Wild with the Materials in Context Database
|
CVPR 2015. Sean Bell and Paul Upchurch contributed equally
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recognizing materials in real-world images is a challenging task. Real-world
materials have rich surface texture, geometry, lighting conditions, and
clutter, which combine to make the problem particularly difficult. In this
paper, we introduce a new, large-scale, open dataset of materials in the wild,
the Materials in Context Database (MINC), and combine this dataset with deep
learning to achieve material recognition and segmentation of images in the
wild.
MINC is an order of magnitude larger than previous material databases, while
being more diverse and well-sampled across its 23 categories. Using MINC, we
train convolutional neural networks (CNNs) for two tasks: classifying materials
from patches, and simultaneous material recognition and segmentation in full
images. For patch-based classification on MINC we found that the best
performing CNN architectures can achieve 85.2% mean class accuracy. We convert
these trained CNN classifiers into an efficient fully convolutional framework
combined with a fully connected conditional random field (CRF) to predict the
material at every pixel in an image, achieving 73.1% mean class accuracy. Our
experiments demonstrate that having a large, well-sampled dataset such as MINC
is crucial for real-world material recognition and segmentation.
|
[
{
"version": "v1",
"created": "Mon, 1 Dec 2014 20:11:44 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Apr 2015 05:29:32 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Bell",
"Sean",
""
],
[
"Upchurch",
"Paul",
""
],
[
"Snavely",
"Noah",
""
],
[
"Bala",
"Kavita",
""
]
] |
new_dataset
| 0.999852 |
1504.03553
|
EPTCS
|
Natallia Kokash (Leiden Institute of Advanced Computer Science
(LIACS))
|
Handshaking Protocol for Distributed Implementation of Reo
|
In Proceedings FOCLASA 2014, arXiv:1502.03157
|
EPTCS 175, 2015, pp. 1-17
|
10.4204/EPTCS.175.1
| null |
cs.DC cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reo, an exogenous channel-based coordination language, is a model for service
coordination wherein services communicate through connectors formed by joining
binary communication channels. In order to establish transactional
communication among services as prescribed by connector semantics, distributed
ports exchange handshaking messages signalling which parties are ready to
provide or consume data. In this paper, we present a formal implementation
model for distributed Reo with communication delays and outline ideas for its
proof of correctness. To reason about Reo implementation formally, we introduce
Timed Action Constraint Automata (TACA) and explain how to compare TACA with
existing automata-based semantics for Reo. We use TACA to describe handshaking
behavior of Reo modeling primitives and argue that in any distributed circuit
remote Reo nodes and channels exposing such behavior commit to perform
transitions envisaged by the network semantics.
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2015 02:14:37 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Kokash",
"Natallia",
"",
"Leiden Institute of Advanced Computer Science"
]
] |
new_dataset
| 0.959178 |
1504.03564
|
Sadeque Khan
|
Sadeque Reza Khan and Farzana Sultana Dristy
|
Android based security and home automation system
|
10 pages,17 figures, Journal, International Journal of Ambient
Systems and Applications, Volume 3, 2015
| null |
10.5121/ijasa.2014.3102
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The smart mobile terminal operator platform Android is getting popular all
over the world with its wide variety of applications and enormous use in
numerous spheres of our daily life. Considering the fact of increasing demand
of home security and automation, an Android based control system is presented
in this paper where the proposed system can maintain the security of home main
entrance and also the car door lock. Another important feature of the designed
system is that it can control the overall appliances in a room. The mobile to
security system or home automation system interface is established through
Bluetooth. The hardware part is designed with the PIC microcontroller.
|
[
{
"version": "v1",
"created": "Sat, 28 Mar 2015 06:06:55 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Khan",
"Sadeque Reza",
""
],
[
"Dristy",
"Farzana Sultana",
""
]
] |
new_dataset
| 0.998212 |
1504.03628
|
Fabian Steiner
|
Fabian Steiner, Georg B\"ocherer, Gianluigi Liva
|
Protograph-Based LDPC Code Design for Shaped Bit-Metric Decoding
|
9 pages, 10 figures. arXiv admin note: substantial text overlap with
arXiv:1501.05595
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A protograph-based low-density parity-check (LDPC) code design technique for
bandwidth-efficient coded modulation is presented. The approach jointly
optimizes the LDPC code node degrees and the mapping of the coded bits to the
bit-interleaved coded modulation (BICM) bit-channels. For BICM with uniform
input and for BICM with probabilistic shaping, binary-input symmetric-output
surrogate channels for the code design are used. The constructed codes for
uniform inputs perform as good as the multi-edge type codes of Zhang and
Kschischang (2013). For 8-ASK and 64-ASK with probabilistic shaping, codes of
rates 2/3 and 5/6 with blocklength 64800 are designed, which operate within
0.63dB and 0.69dB of continuous AWGN capacity for a target frame error rate of
1e-3 at spectral efficiencies of 1.38 and 4.25 bits/channel use, respectively.
|
[
{
"version": "v1",
"created": "Tue, 14 Apr 2015 17:03:55 GMT"
}
] | 2015-04-15T00:00:00 |
[
[
"Steiner",
"Fabian",
""
],
[
"Böcherer",
"Georg",
""
],
[
"Liva",
"Gianluigi",
""
]
] |
new_dataset
| 0.997639 |
1311.4964
|
Su Hu
|
Su H, Guoan Bi, Yong Liang Guan, Shaoqian Li
|
TDCS-based Cognitive Radio Networks with Multiuser Interference
Avoidance
|
to be appeared in IEEE Transaction on Communications, 2014
|
IEEE Transactions on Communications 61(12): 4828-4835, 2013
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For overlay cognitive radio networks (CRNs), transform domain communication
system (TDCS) has been proposed to support multiuser communications through
spectrum bin nulling and frequency domain spreading. In TDCS-based CRNs, each
user is assigned a specific pseudorandom spreading sequence. However, the
existence of multiuser interference (MUI) is one of main concerns, due to the
non-zero cross-correlations between any pair of TDCS signals. In this paper, a
novel framework of TDCS-based CRNs with the joint design of sequences and
modulation schemes is presented to realize MUI avoidance. With the uncertainty
of spectrum sensing results in CRNs, we first introduce a unique sequence
design through two-dimensional time-frequency synthesis and obtain a class of
almost perfect sequences. That is, periodic auto-correlation and
cross-correlations are identically zero for most circular shifts. These
correlation properties are further exploited in conjunction with a
specially-designed cyclic code shift keying in order to achieve the advantage
of MUI avoidance. Numerical results demonstrate that the proposed TDCS-based
CRNs are considered as preferable candidates for decentralized networks against
the near-far problem.
|
[
{
"version": "v1",
"created": "Wed, 20 Nov 2013 06:42:18 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"H",
"Su",
""
],
[
"Bi",
"Guoan",
""
],
[
"Guan",
"Yong Liang",
""
],
[
"Li",
"Shaoqian",
""
]
] |
new_dataset
| 0.999251 |
1404.7739
|
Tuvi Etzion
|
Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, and Netanel Raviv
|
Subspace Polynomials and Cyclic Subspace Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Subspace codes have received an increasing interest recently due to their
application in error-correction for random network coding. In particular,
cyclic subspace codes are possible candidates for large codes with efficient
encoding and decoding algorithms. In this paper we consider such cyclic codes
and provide constructions of optimal codes for which their codewords do not
have full orbits. We further introduce a new way to represent subspace codes by
a class of polynomials called subspace polynomials. We present some
constructions of such codes which are cyclic and analyze their parameters.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 14:37:26 GMT"
},
{
"version": "v2",
"created": "Sun, 18 Jan 2015 11:19:13 GMT"
},
{
"version": "v3",
"created": "Sun, 12 Apr 2015 12:48:30 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Ben-Sasson",
"Eli",
""
],
[
"Etzion",
"Tuvi",
""
],
[
"Gabizon",
"Ariel",
""
],
[
"Raviv",
"Netanel",
""
]
] |
new_dataset
| 0.99956 |
1412.0691
|
Hema Swetha Koppula
|
Ashutosh Saxena, Ashesh Jain, Ozan Sener, Aditya Jami, Dipendra K.
Misra, Hema S. Koppula
|
RoboBrain: Large-Scale Knowledge Engine for Robots
|
10 pages, 9 figures
| null | null | null |
cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a knowledge engine, which learns and shares
knowledge representations, for robots to carry out a variety of tasks. Building
such an engine brings with it the challenge of dealing with multiple data
modalities including symbols, natural language, haptic senses, robot
trajectories, visual features and many others. The \textit{knowledge} stored in
the engine comes from multiple sources including physical interactions that
robots have while performing tasks (perception, planning and control),
knowledge bases from the Internet and learned representations from several
robotics research groups.
We discuss various technical aspects and associated challenges such as
modeling the correctness of knowledge, inferring latent information and
formulating different robotic tasks as queries to the knowledge engine. We
describe the system architecture and how it supports different mechanisms for
users and robots to interact with the engine. Finally, we demonstrate its use
in three important research areas: grounding natural language, perception, and
planning, which are the key building blocks for many robotic tasks. This
knowledge engine is a collaborative effort and we call it RoboBrain.
|
[
{
"version": "v1",
"created": "Mon, 1 Dec 2014 21:22:46 GMT"
},
{
"version": "v2",
"created": "Sun, 12 Apr 2015 06:16:39 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Saxena",
"Ashutosh",
""
],
[
"Jain",
"Ashesh",
""
],
[
"Sener",
"Ozan",
""
],
[
"Jami",
"Aditya",
""
],
[
"Misra",
"Dipendra K.",
""
],
[
"Koppula",
"Hema S.",
""
]
] |
new_dataset
| 0.999609 |
1504.02840
|
Ahmad Pahlavan Tafti
|
Ahmad Pahlavan Tafti, Hamid Hassannia, Zeyun Yu
|
siftservice.com - Turning a Computer Vision algorithm into a World Wide
Web Service
|
8 pages, 7 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image features detection and description is a longstanding topic in computer
vision and pattern recognition areas. The Scale Invariant Feature Transform
(SIFT) is probably the most popular and widely demanded feature descriptor
which facilitates a variety of computer vision applications such as image
registration, object tracking, image forgery detection, and 3D surface
reconstruction. This work introduces a Software as a Service (SaaS) based
implementation of the SIFT algorithm which is freely available at
http://siftservice.com for any academic, educational and research purposes. The
service provides application-to-application interaction and aims Rapid
Application Development (RAD) and also fast prototyping for computer vision
students and researchers all around the world. An Internet connection is all
they need!
|
[
{
"version": "v1",
"created": "Sat, 11 Apr 2015 05:47:09 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Tafti",
"Ahmad Pahlavan",
""
],
[
"Hassannia",
"Hamid",
""
],
[
"Yu",
"Zeyun",
""
]
] |
new_dataset
| 0.999118 |
1504.02866
|
Bhaskar Bhuyan
|
Bhaskar Bhuyan and Nityananda Sarma
|
A Delay Aware Routing Protocol for Wireless Sensor Networks
|
6 Pages, 8 Figures, journal
|
IJCSI International Journal of Computer Science Issues, Volume 11,
Issue 6, No 2, November 2014
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks (WSNs) consist of sensor nodes which can be deployed
for various operations such as agriculture and environmental sensing, wild life
monitoring, health care, military surveillance, industrial control, home
automation, security etc. Quality of Service (QoS) is an important issue in
wireless sensor networks (WSNs) and providing QoS support in WSNs is an
emerging area of research. Due to resource constraints nature of sensor
networks like processing power, memory, bandwidth, energy etc. providing QoS
support in WSNs is a challenging task. Delay is an important QoS parameter for
forwarding data in a time constraint WSNs environment. In this paper we propose
a delay aware routing protocol for transmission of time critical event
information to the Sink of WSNs. The performance of the proposed protocol is
evaluated by NS2 simulations under different scenarios.
|
[
{
"version": "v1",
"created": "Sat, 11 Apr 2015 12:37:09 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Bhuyan",
"Bhaskar",
""
],
[
"Sarma",
"Nityananda",
""
]
] |
new_dataset
| 0.974159 |
1504.03013
|
EPTCS
|
Nachum Dershowitz, Evgenia Falkovich
|
Cellular Automata are Generic
|
In Proceedings DCM 2014, arXiv:1504.01927
|
EPTCS 179, 2015, pp. 17-32
|
10.4204/EPTCS.179.2
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Any algorithm (in the sense of Gurevich's abstract-state-machine
axiomatization of classical algorithms) operating over any arbitrary unordered
domain can be simulated by a dynamic cellular automaton, that is, by a
pattern-directed cellular automaton with unconstrained topology and with the
power to create new cells. The advantage is that the latter is closer to
physical reality. The overhead of our simulation is quadratic.
|
[
{
"version": "v1",
"created": "Sun, 12 Apr 2015 20:27:58 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Dershowitz",
"Nachum",
""
],
[
"Falkovich",
"Evgenia",
""
]
] |
new_dataset
| 0.995966 |
1504.03016
|
Marko Angjelichinoski
|
Marko Angjelichinoski, Cedomir Stefanovic, Petar Popovski, Hongpeng
Liu, Poh Chiang Loh, Frede Blaabjerg
|
Power Talk: How to Modulate Data over a DC Micro Grid Bus using Power
Electronics
|
IEEE GLOBECOM 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a novel communication strategy for DC Micro Grids (MGs), termed
power talk, in which the devices communicate by modulating the power levels in
the DC bus. The information is transmitted by varying the parameters that the
MG units use to control the level of the common bus voltage, while it is
received by processing the bus measurements that units perform. This
communication is challenged by the fact that the voltage level is subject to
random disturbances, as the state of the MG changes with random load
variations. We develop a corresponding communication model and address the
random voltage fluctuations by using coding strategies that transform the MG
into some well-known communication channels. The performance analysis shows
that it is possible to mitigate the random voltage level variations and
communicate reliably over the MG bus.
|
[
{
"version": "v1",
"created": "Sun, 12 Apr 2015 20:46:38 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Angjelichinoski",
"Marko",
""
],
[
"Stefanovic",
"Cedomir",
""
],
[
"Popovski",
"Petar",
""
],
[
"Liu",
"Hongpeng",
""
],
[
"Loh",
"Poh Chiang",
""
],
[
"Blaabjerg",
"Frede",
""
]
] |
new_dataset
| 0.998992 |
1504.03161
|
Jun Zhao
|
Jun Zhao, Osman Ya\u{g}an, Virgil Gligor
|
Random intersection graphs and their applications in security, wireless
communication, and social networks
|
This is an invited paper in Information Theory and Applications
Workshop (ITA) 2015
| null | null | null |
cs.DM cs.CR cs.SI math.CO physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Random intersection graphs have received much interest and been used in
diverse applications. They are naturally induced in modeling secure sensor
networks under random key predistribution schemes, as well as in modeling the
topologies of social networks including common-interest networks, collaboration
networks, and actor networks. Simply put, a random intersection graph is
constructed by assigning each node a set of items in some random manner and
then putting an edge between any two nodes that share a certain number of
items.
Broadly speaking, our work is about analyzing random intersection graphs, and
models generated by composing it with other random graph models including
random geometric graphs and Erd\H{o}s-R\'enyi graphs. These compositional
models are introduced to capture the characteristics of various complex natural
or man-made networks more accurately than the existing models in the
literature. For random intersection graphs and their compositions with other
random graphs, we study properties such as ($k$-)connectivity,
($k$-)robustness, and containment of perfect matchings and Hamilton cycles. Our
results are typically given in the form of asymptotically exact probabilities
or zero-one laws specifying critical scalings, and provide key insights into
the design and analysis of various real-world networks.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 09:37:09 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Zhao",
"Jun",
""
],
[
"Yağan",
"Osman",
""
],
[
"Gligor",
"Virgil",
""
]
] |
new_dataset
| 0.999107 |
1504.03184
|
Tslil Clingman
|
T. Clingman, Jeff Murugan, Jonathan P. Shock
|
Probability Density Functions from the Fisher Information Metric
|
16 pages, no figures
| null | null |
QGaSLAB-15-02
|
cs.IT math.DG math.IT math.ST physics.data-an stat.TH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show a general relation between the spatially disjoint product of
probability density functions and the sum of their Fisher information metric
tensors. We then utilise this result to give a method for constructing the
probability density functions for an arbitrary Riemannian Fisher information
metric tensor. We note further that this construction is extremely
unconstrained, depending only on certain continuity properties of the
probability density functions and a select symmetry of their domains.
|
[
{
"version": "v1",
"created": "Mon, 13 Apr 2015 13:53:37 GMT"
}
] | 2015-04-14T00:00:00 |
[
[
"Clingman",
"T.",
""
],
[
"Murugan",
"Jeff",
""
],
[
"Shock",
"Jonathan P.",
""
]
] |
new_dataset
| 0.955849 |
1503.08663
|
Guanbin Li
|
Guanbin Li and Yizhou Yu
|
Visual Saliency Based on Multiscale Deep Features
|
To appear in CVPR 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual saliency is a fundamental problem in both cognitive and computational
sciences, including computer vision. In this CVPR 2015 paper, we discover that
a high-quality visual saliency model can be trained with multiscale features
extracted using a popular deep learning architecture, convolutional neural
networks (CNNs), which have had many successes in visual recognition tasks. For
learning such saliency models, we introduce a neural network architecture,
which has fully connected layers on top of CNNs responsible for extracting
features at three different scales. We then propose a refinement method to
enhance the spatial coherence of our saliency results. Finally, aggregating
multiple saliency maps computed for different levels of image segmentation can
further boost the performance, yielding saliency maps better than those
generated from a single segmentation. To promote further research and
evaluation of visual saliency models, we also construct a new large database of
4447 challenging images and their pixelwise saliency annotation. Experimental
results demonstrate that our proposed method is capable of achieving
state-of-the-art performance on all public benchmarks, improving the F-Measure
by 5.0% and 13.2% respectively on the MSRA-B dataset and our new dataset
(HKU-IS), and lowering the mean absolute error by 5.7% and 35.1% respectively
on these two datasets.
|
[
{
"version": "v1",
"created": "Mon, 30 Mar 2015 13:21:09 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Mar 2015 05:21:02 GMT"
},
{
"version": "v3",
"created": "Fri, 10 Apr 2015 06:40:46 GMT"
}
] | 2015-04-13T00:00:00 |
[
[
"Li",
"Guanbin",
""
],
[
"Yu",
"Yizhou",
""
]
] |
new_dataset
| 0.993982 |
1504.02491
|
Revital Hollander shabtai
|
Revital Hollander Shabtai and Yehuda Roditty
|
Line-Broadcasting in Complete k-Trees
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A line-broadcasting model in a connected graph $G=(V,E)$, $|V|=n$, is a model
in which one vertex, called the {\it originator} of the broadcast holds a
message that has to be transmitted to all vertices of the graph through
placement of a series of calls over the graph. In this model, an informed
vertex can transmit a message through a path of any length in a single time
unit, as long as two transmissions do not use the same edge at the same time.
Farley \cite{f} has shown that the process is completed within at most $\lceil
\log_{2}n \rceil$ time units from any originator in a tree (and thus in any
connected undirected graph). and that the cost of broadcasting one message from
any vertex is at most $(n-1) \lceil \log_{2}n \rceil$.
In this paper, we present lower and upper bounds for the cost to broadcast
one message in a complete $k-$tree, from any vertex using the line-broadcasting
model. We prove that if $B(u)$ is the minimum cost to broadcast in a graph
$G=(V,E)$ from a vertex $u \in V$ using the line-broadcasting model, then
$(1+o(1))n \le B(u) \le (2+o(1))n$, where $u$ is any vertex in a complete
$k$-tree. Furthermore, for certain conditions, $B(u) \le (2-o(1))n$.
|
[
{
"version": "v1",
"created": "Thu, 9 Apr 2015 20:29:22 GMT"
}
] | 2015-04-13T00:00:00 |
[
[
"Shabtai",
"Revital Hollander",
""
],
[
"Roditty",
"Yehuda",
""
]
] |
new_dataset
| 0.995563 |
1504.02576
|
Loet Leydesdorff
|
Johann Bauer, Loet Leydesdorff and Lutz Bornmann
|
Highly-cited papers in Library and Information Science (LIS): Authors,
institutions, and network structures
|
accepted for publication in the Journal of the Association for
Information Science and Technology (JASIST)
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a follow-up to the highly-cited authors list published by Thomson Reuters
in June 2014, we analyze the top-1% most frequently cited papers published
between 2002 and 2012 included in the Web of Science (WoS) subject category
"Information Science & Library Science." 798 authors contributed to 305 top-1%
publications; these authors were employed at 275 institutions. The authors at
Harvard University contributed the largest number of papers, when the addresses
are whole-number counted. However, Leiden University leads the ranking, if
fractional counting is used.
Twenty-three of the 798 authors were also listed as most highly-cited authors
by Thomson Reuters in June 2014 (http://highlycited.com/). Twelve of these 23
authors were involved in publishing four or more of the 305 papers under study.
Analysis of co-authorship relations among the 798 highly-cited scientists shows
that co-authorships are based on common interests in a specific topic. Three
topics were important between 2002 and 2012: (1) collection and exploitation of
information in clinical practices, (2) the use of internet in public
communication and commerce, and (3) scientometrics.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2015 08:00:29 GMT"
}
] | 2015-04-13T00:00:00 |
[
[
"Bauer",
"Johann",
""
],
[
"Leydesdorff",
"Loet",
""
],
[
"Bornmann",
"Lutz",
""
]
] |
new_dataset
| 0.978979 |
1504.02578
|
David Terei
|
David Terei, Amit Levy
|
Blade: A Data Center Garbage Collector
|
14 pages, 9 figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An increasing number of high-performance distributed systems are written in
garbage collected languages. This removes a large class of harmful bugs from
these systems. However, it also introduces high tail-latency do to garbage
collection pause times. We address this problem through a new technique of
garbage collection avoidance which we call Blade. Blade is an API between the
collector and application developer that allows developers to leverage existing
failure recovery mechanisms in distributed systems to coordinate collection and
bound the latency impact. We describe Blade and implement it for the Go
programming language. We also investigate two different systems that utilize
Blade, a HTTP load-balancer and the Raft consensus algorithm. For the
load-balancer, we eliminate any latency introduced by the garbage collector,
for Raft, we bound the latency impact to a single network round-trip, (48
{\mu}s in our setup). In both cases, latency at the tail using Blade is up to
three orders of magnitude better.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2015 08:05:40 GMT"
}
] | 2015-04-13T00:00:00 |
[
[
"Terei",
"David",
""
],
[
"Levy",
"Amit",
""
]
] |
new_dataset
| 0.987749 |
1504.02621
|
EPTCS
|
Christopher Bak, Glyn Faulkner, Detlef Plump, Colin Runciman
|
A Reference Interpreter for the Graph Programming Language GP 2
|
In Proceedings GaM 2015, arXiv:1504.02448
|
EPTCS 181, 2015, pp. 48-64
|
10.4204/EPTCS.181.4
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GP 2 is an experimental programming language for computing by graph
transformation. An initial interpreter for GP 2, written in the functional
language Haskell, provides a concise and simply structured reference
implementation. Despite its simplicity, the performance of the interpreter is
sufficient for the comparative investigation of a range of test programs. It
also provides a platform for the development of more sophisticated
implementations.
|
[
{
"version": "v1",
"created": "Fri, 10 Apr 2015 09:50:23 GMT"
}
] | 2015-04-13T00:00:00 |
[
[
"Bak",
"Christopher",
""
],
[
"Faulkner",
"Glyn",
""
],
[
"Plump",
"Detlef",
""
],
[
"Runciman",
"Colin",
""
]
] |
new_dataset
| 0.999211 |
1504.02148
|
Chao-Lin Liu
|
Peter K. Bol and Chao-Lin Liu and Hongsu Wang
|
Mining and discovering biographical information in Difangzhi with a
language-model-based approach
|
6 pages, 4 figures, 1 table, 2015 International Conference on Digital
Humanities. in Proceedings of the 2015 International Conference on Digital
Humanities (DH 2015). July 2015
| null | null | null |
cs.CL cs.CY cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present results of expanding the contents of the China Biographical
Database by text mining historical local gazetteers, difangzhi. The goal of the
database is to see how people are connected together, through kinship, social
connections, and the places and offices in which they served. The gazetteers
are the single most important collection of names and offices covering the Song
through Qing periods. Although we begin with local officials we shall
eventually include lists of local examination candidates, people from the
locality who served in government, and notable local figures with biographies.
The more data we collect the more connections emerge. The value of doing
systematic text mining work is that we can identify relevant connections that
are either directly informative or can become useful without deep historical
research. Academia Sinica is developing a name database for officials in the
central governments of the Ming and Qing dynasties.
|
[
{
"version": "v1",
"created": "Wed, 8 Apr 2015 22:38:35 GMT"
}
] | 2015-04-10T00:00:00 |
[
[
"Bol",
"Peter K.",
""
],
[
"Liu",
"Chao-Lin",
""
],
[
"Wang",
"Hongsu",
""
]
] |
new_dataset
| 0.959811 |
1504.02398
|
Dorian Galvez-Lopez
|
Dorian G\'alvez-L\'opez, Marta Salas, Juan D. Tard\'os, J. M. M.
Montiel
|
Real-time Monocular Object SLAM
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a real-time object-based SLAM system that leverages the largest
object database to date. Our approach comprises two main components: 1) a
monocular SLAM algorithm that exploits object rigidity constraints to improve
the map and find its real scale, and 2) a novel object recognition algorithm
based on bags of binary words, which provides live detections with a database
of 500 3D objects. The two components work together and benefit each other: the
SLAM algorithm accumulates information from the observations of the objects,
anchors object features to especial map landmarks and sets constrains on the
optimization. At the same time, objects partially or fully located within the
map are used as a prior to guide the recognition algorithm, achieving higher
recall. We evaluate our proposal on five real environments showing improvements
on the accuracy of the map and efficiency with respect to other
state-of-the-art techniques.
|
[
{
"version": "v1",
"created": "Thu, 9 Apr 2015 17:46:19 GMT"
}
] | 2015-04-10T00:00:00 |
[
[
"Gálvez-López",
"Dorian",
""
],
[
"Salas",
"Marta",
""
],
[
"Tardós",
"Juan D.",
""
],
[
"Montiel",
"J. M. M.",
""
]
] |
new_dataset
| 0.9971 |
1504.02443
|
EPTCS
|
Hartmut Lackner (Humboldt-Universit\"at zu Berlin), Martin Schmidt
(Humboldt-Universit\"at zu Berlin)
|
Potential Errors and Test Assessment in Software Product Line
Engineering
|
In Proceedings MBT 2015, arXiv:1504.01928
|
EPTCS 180, 2015, pp. 57-72
|
10.4204/EPTCS.180.4
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software product lines (SPL) are a method for the development of variant-rich
software systems. Compared to non-variable systems, testing SPLs is extensive
due to an increasingly amount of possible products. Different approaches exist
for testing SPLs, but there is less research for assessing the quality of these
tests by means of error detection capability. Such test assessment is based on
error injection into correct version of the system under test. However to our
knowledge, potential errors in SPL engineering have never been systematically
identified before. This article presents an overview over existing paradigms
for specifying software product lines and the errors that can occur during the
respective specification processes. For assessment of test quality, we leverage
mutation testing techniques to SPL engineering and implement the identified
errors as mutation operators. This allows us to run existing tests against
defective products for the purpose of test assessment. From the results, we
draw conclusions about the error-proneness of the surveyed SPL design paradigms
and how quality of SPL tests can be improved.
|
[
{
"version": "v1",
"created": "Thu, 9 Apr 2015 19:30:50 GMT"
}
] | 2015-04-10T00:00:00 |
[
[
"Lackner",
"Hartmut",
"",
"Humboldt-Universität zu Berlin"
],
[
"Schmidt",
"Martin",
"",
"Humboldt-Universität zu Berlin"
]
] |
new_dataset
| 0.989466 |
1306.4934
|
Igal Sason
|
Igal Sason
|
On the Corner Points of the Capacity Region of a Two-User Gaussian
Interference Channel
|
Submitted to the IEEE Trans. on Information Theory in July 17, 2014,
and revised in April 5, 2015. Presented in part at Allerton 2013, and also
presented in part with improved results at ISIT 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work considers the corner points of the capacity region of a two-user
Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where
one user transmits its data at the single-user capacity (without interference),
and the other at the largest rate for which reliable communication is still
possible are called corner points. This paper relies on existing outer bounds
on the capacity region of a two-user GIC that are used to derive informative
bounds on the corner points of the capacity region. The new bounds refer to a
weak two-user GIC (i.e., when both cross-link gains in standard form are
positive and below 1), and a refinement of these bounds is obtained for the
case where the transmission rate of one user is within $\varepsilon > 0$ of the
single-user capacity. The bounds on the corner points are asymptotically tight
as the transmitted powers tend to infinity, and they are also useful for the
case of moderate SNR and INR. Upper and lower bounds on the gap (denoted by
$\Delta$) between the sum-rate and the maximal achievable total rate at the two
corner points are derived. This is followed by an asymptotic analysis analogous
to the study of the generalized degrees of freedom (where the SNR and INR
scalings are coupled such that $\frac{\log(\text{INR})}{\log(\text{SNR})} =
\alpha \geq 0$), leading to an asymptotic characterization of this gap which is
exact for the whole range of $\alpha$. The upper and lower bounds on $\Delta$
are asymptotically tight in the sense that they achieve the exact asymptotic
characterization. Improved bounds on $\Delta$ are derived for finite SNR and
INR, and their improved tightness is exemplified numerically.
|
[
{
"version": "v1",
"created": "Thu, 20 Jun 2013 16:42:39 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Jun 2013 22:06:09 GMT"
},
{
"version": "v3",
"created": "Thu, 27 Jun 2013 14:04:13 GMT"
},
{
"version": "v4",
"created": "Tue, 6 Aug 2013 12:09:43 GMT"
},
{
"version": "v5",
"created": "Wed, 14 Aug 2013 20:52:56 GMT"
},
{
"version": "v6",
"created": "Wed, 9 Oct 2013 15:44:48 GMT"
},
{
"version": "v7",
"created": "Sun, 8 Dec 2013 09:58:03 GMT"
},
{
"version": "v8",
"created": "Thu, 19 Dec 2013 20:19:53 GMT"
},
{
"version": "v9",
"created": "Tue, 7 Apr 2015 20:14:47 GMT"
}
] | 2015-04-09T00:00:00 |
[
[
"Sason",
"Igal",
""
]
] |
new_dataset
| 0.974526 |
1504.01747
|
Hosein Nikopour
|
Usa Vilaipornsawai, Hosein Nikopour, Alireza Bayesteh, and Jianglie Ma
|
SCMA for Open-Loop Joint Transmission CoMP
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sparse Code Multiple Access (SCMA), a non-orthogonal multiple access scheme,
has been introduced as a key 5G technology to improve spectral efficiency. In
this work, we propose SCMA to enable open-loop coordinated multipoint (CoMP)
joint transmission (JT). The scheme combines CoMP techniques with multi-user
SCMA (MU-SCMA) in downlink. This scheme provides open-loop user multiplexing
and JT in power and code domains, with robustness to mobility and low overhead
of channel state information (CSI) acquisition. The combined scheme is called
MU-SCMA-CoMP, in which SCMA layers and transmit power of multiple transmit
points (TPs) are shared among multiple users while a user may receive multiple
SCMA layers from multiple TPs within a CoMP cluster. The benefits of the
proposed scheme includes: i) drastic overhead reduction of CSI acquisition, ii)
significant increase in throughput and coverage, and iii) robustness to channel
aging. Various algorithms of MU-SCMA-CoMP are presented, including the
detection strategy, power sharing optimization, and scheduling. System level
evaluation shows that the proposed schemes provide significant throughput and
coverage gains over OFDMA for both pedestrian and vehicular users.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 20:17:10 GMT"
}
] | 2015-04-09T00:00:00 |
[
[
"Vilaipornsawai",
"Usa",
""
],
[
"Nikopour",
"Hosein",
""
],
[
"Bayesteh",
"Alireza",
""
],
[
"Ma",
"Jianglie",
""
]
] |
new_dataset
| 0.999342 |
1504.01771
|
Andrey Gushchin
|
Andrey Gushchin, Anwar Walid, Ao Tang
|
Scalable Routing in SDN-enabled Networks with Consolidated Middleboxes
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Middleboxes are special network devices that perform various functions such
as enabling security and efficiency. SDN-based routing approaches in networks
with middleboxes need to address resource constraints, such as memory in the
switches and processing power of middleboxes, and traversal constraint where a
flow must visit the required middleboxes in a specific order. In this work we
propose a solution based on MultiPoint-To-Point Trees (MPTPT) for routing
traffic in SDN-enabled networks with consolidated middleboxes. We show both
theoretically and via simulations that our solution significantly reduces the
number of routing rules in the switches, while guaranteeing optimum throughput
and meeting processing requirements. Additionally, the underlying algorithm has
low complexity making it suitable in dynamic network environment.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 22:39:45 GMT"
}
] | 2015-04-09T00:00:00 |
[
[
"Gushchin",
"Andrey",
""
],
[
"Walid",
"Anwar",
""
],
[
"Tang",
"Ao",
""
]
] |
new_dataset
| 0.990134 |
1504.01942
|
Laura Leal Taix\'e
|
Laura Leal-Taix\'e and Anton Milan and Ian Reid and Stefan Roth and
Konrad Schindler
|
MOTChallenge 2015: Towards a Benchmark for Multi-Target Tracking
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the recent past, the computer vision community has developed centralized
benchmarks for the performance evaluation of a variety of tasks, including
generic object and pedestrian detection, 3D reconstruction, optical flow,
single-object short-term tracking, and stereo estimation. Despite potential
pitfalls of such benchmarks, they have proved to be extremely helpful to
advance the state of the art in the respective area. Interestingly, there has
been rather limited work on the standardization of quantitative benchmarks for
multiple target tracking. One of the few exceptions is the well-known PETS
dataset, targeted primarily at surveillance applications. Despite being widely
used, it is often applied inconsistently, for example involving using different
subsets of the available data, different ways of training the models, or
differing evaluation scripts. This paper describes our work toward a novel
multiple object tracking benchmark aimed to address such issues. We discuss the
challenges of creating such a framework, collecting existing and new data,
gathering state-of-the-art methods to be tested on the datasets, and finally
creating a unified evaluation system. With MOTChallenge we aim to pave the way
toward a unified evaluation framework for a more meaningful quantification of
multi-target tracking.
|
[
{
"version": "v1",
"created": "Wed, 8 Apr 2015 12:56:38 GMT"
}
] | 2015-04-09T00:00:00 |
[
[
"Leal-Taixé",
"Laura",
""
],
[
"Milan",
"Anton",
""
],
[
"Reid",
"Ian",
""
],
[
"Roth",
"Stefan",
""
],
[
"Schindler",
"Konrad",
""
]
] |
new_dataset
| 0.985417 |
1411.3715
|
Daniele Barchiesi
|
Daniele Barchiesi, Dimitrios Giannoulis, Dan Stowell, Mark D. Plumbley
|
Acoustic Scene Classification
| null |
IEEE Signal Processing Magazine 32(3) (May 2015) 16-34
|
10.1109/MSP.2014.2326181
| null |
cs.SD cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we present an account of the state-of-the-art in acoustic
scene classification (ASC), the task of classifying environments from the
sounds they produce. Starting from a historical review of previous research in
this area, we define a general framework for ASC and present different imple-
mentations of its components. We then describe a range of different algorithms
submitted for a data challenge that was held to provide a general and fair
benchmark for ASC techniques. The dataset recorded for this purpose is
presented, along with the performance metrics that are used to evaluate the
algorithms and statistical significance tests to compare the submitted methods.
We use a baseline method that employs MFCCS, GMMS and a maximum likelihood
criterion as a benchmark, and only find sufficient evidence to conclude that
three algorithms significantly outperform it. We also evaluate the human
classification accuracy in performing a similar classification task. The best
performing algorithm achieves a mean accuracy that matches the median accuracy
obtained by humans, and common pairs of classes are misclassified by both
computers and humans. However, all acoustic scenes are correctly classified by
at least some individuals, while there are scenes that are misclassified by all
algorithms.
|
[
{
"version": "v1",
"created": "Thu, 13 Nov 2014 16:03:09 GMT"
}
] | 2015-04-08T00:00:00 |
[
[
"Barchiesi",
"Daniele",
""
],
[
"Giannoulis",
"Dimitrios",
""
],
[
"Stowell",
"Dan",
""
],
[
"Plumbley",
"Mark D.",
""
]
] |
new_dataset
| 0.999192 |
1502.06152
|
Graham H. Norton
|
Graham H. Norton
|
On Sequences, Rational Functions and Decomposition
|
Several more typos corrected. To appear in J. Applied Algebra in
Engineering, Communication and Computing. The final publication version is
available at Springer via http://dx.doi.org/10.1007/s00200-015-0256-5
| null |
10.1007/s00200-015-0256-5
| null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our overall goal is to unify and extend some results in the literature
related to the approximation of generating functions of finite and infinite
sequences over a field by rational functions. In our approach, numerators play
a significant role. We revisit a theorem of Niederreiter on (i) linear
complexities and (ii) '$n^{th}$ minimal polynomials' of an infinite sequence,
proved using partial quotients. We prove (i) and its converse from first
principles and generalise (ii) to rational functions where the denominator need
not have minimal degree. We prove (ii) in two parts: firstly for geometric
sequences and then for sequences with a jump in linear complexity. The basic
idea is to decompose the denominator as a sum of polynomial multiples of two
polynomials of minimal degree; there is a similar decomposition for the
numerators. The decomposition is unique when the denominator has degree at most
the length of the sequence. The proof also applies to rational functions
related to finite sequences, generalising a result of Massey. We give a number
of applications to rational functions associated to sequences.
|
[
{
"version": "v1",
"created": "Sat, 21 Feb 2015 23:29:58 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Mar 2015 20:38:35 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Apr 2015 07:16:07 GMT"
}
] | 2015-04-08T00:00:00 |
[
[
"Norton",
"Graham H.",
""
]
] |
new_dataset
| 0.964067 |
1504.01476
|
Sunil Kumar Kopparapu Dr
|
Lajish V. L. and Sunil Kumar Kopparapu
|
Mobile Phone Based Vehicle License Plate Recognition for Road Policing
|
7 pages; PReMI Experiential Workshop, Delhi
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Identity of a vehicle is done through the vehicle license plate by traffic
police in general. Au- tomatic vehicle license plate recognition has several
applications in intelligent traffic management systems. The security situation
across the globe and particularly in India demands a need to equip the traffic
police with a system that enables them to get instant details of a vehicle. The
system should be easy to use, should be mobile, and work 24 x 7. In this paper,
we describe a mobile phone based, client-server architected, license plate
recognition system. While we use the state of the art image processing and
pattern recognition algorithms tuned for Indian conditions to automatically
recognize non-uniform license plates, the main contribution is in creating an
end to end usable solution. The client application runs on a mobile device and
a server application, with access to vehicle information database, is hosted
centrally. The solution enables capture of license plate image captured by the
phone camera and passes to the server; on the server the license plate number
is recognized; the data associated with the number plate is then sent back to
the mobile device, instantaneously. We describe the end to end system
architecture in detail. A working prototype of the proposed system has been
implemented in the lab environment.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 05:25:42 GMT"
}
] | 2015-04-08T00:00:00 |
[
[
"L.",
"Lajish V.",
""
],
[
"Kopparapu",
"Sunil Kumar",
""
]
] |
new_dataset
| 0.999753 |
1504.01488
|
Sunil Kumar Kopparapu Dr
|
Sunil Kumar Kopparapu, Lajish VL
|
On-line Handwritten Devanagari Character Recognition using Fuzzy
Directional Features
|
6 pages; 2009
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a new feature set for use in the recognition of on-line
handwritten Devanagari script based on Fuzzy Directional Features. Experiments
are conducted for the automatic recognition of isolated handwritten character
primitives (sub-character units). Initially we describe the proposed feature
set, called the Fuzzy Directional Features (FDF) and then show how these
features can be effectively utilized for writer independent character
recognition. Experimental results show that FDF set perform well for writer
independent data set at stroke level recognition. The main contribution of this
paper is the introduction of a novel feature set and establish experimentally
its ability in recognition of handwritten Devanagari script.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 06:31:58 GMT"
}
] | 2015-04-08T00:00:00 |
[
[
"Kopparapu",
"Sunil Kumar",
""
],
[
"VL",
"Lajish",
""
]
] |
new_dataset
| 0.995868 |
1504.01526
|
MM Aftab Hossain
|
M. M. Aftab Hossain, Riku J\"antti, Cicek Cavdar
|
Energy saving market for mobile operators
|
6 pages, 2 figures, to be published in ICC 2015 workshop on Next
Generation Green ICT
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ensuring seamless coverage accounts for the lion's share of the energy
consumed in a mobile network. Overlapping coverage of three to five mobile
network operators (MNOs) results in enormous amount of energy waste which is
avoidable. The traffic demands of the mobile networks vary significantly
throughout the day. As the offered load for all networks are not same at a
given time and the differences in energy consumption at different loads are
significant, multi-MNO capacity/coverage sharing can dramatically reduce energy
consumption of mobile networks and provide the MNOs a cost effective means to
cope with the exponential growth of traffic. In this paper, we propose an
energy saving market for a multi-MNO network scenario. As the competing MNOs
are not comfortable with information sharing, we propose a double auction
clearinghouse market mechanism where MNOs sell and buy capacity in order to
minimize energy consumption. In our setting, each MNO proposes its bids and
asks simultaneously for buying and selling multi-unit capacities respectively
to an independent auctioneer, i.e., clearinghouse and ends up either as a buyer
or as a seller in each round. We show that the mechanism allows the MNOs to
save significant percentage of energy cost throughout a wide range of network
load. Different than other energy saving features such as cell sleep or antenna
muting which can not be enabled at heavy traffic load, dynamic capacity sharing
allows MNOs to handle traffic bursts with energy saving opportunity.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 09:21:49 GMT"
}
] | 2015-04-08T00:00:00 |
[
[
"Hossain",
"M. M. Aftab",
""
],
[
"Jäntti",
"Riku",
""
],
[
"Cavdar",
"Cicek",
""
]
] |
new_dataset
| 0.988179 |
1504.00325
|
C. Lawrence Zitnick
|
Xinlei Chen, Hao Fang, Tsung-Yi Lin, Ramakrishna Vedantam, Saurabh
Gupta, Piotr Dollar, C. Lawrence Zitnick
|
Microsoft COCO Captions: Data Collection and Evaluation Server
|
arXiv admin note: text overlap with arXiv:1411.4952
| null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe the Microsoft COCO Caption dataset and evaluation
server. When completed, the dataset will contain over one and a half million
captions describing over 330,000 images. For the training and validation
images, five independent human generated captions will be provided. To ensure
consistency in evaluation of automatic caption generation algorithms, an
evaluation server is used. The evaluation server receives candidate captions
and scores them using several popular metrics, including BLEU, METEOR, ROUGE
and CIDEr. Instructions for using the evaluation server are provided.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2015 18:13:43 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Apr 2015 20:21:16 GMT"
}
] | 2015-04-07T00:00:00 |
[
[
"Chen",
"Xinlei",
""
],
[
"Fang",
"Hao",
""
],
[
"Lin",
"Tsung-Yi",
""
],
[
"Vedantam",
"Ramakrishna",
""
],
[
"Gupta",
"Saurabh",
""
],
[
"Dollar",
"Piotr",
""
],
[
"Zitnick",
"C. Lawrence",
""
]
] |
new_dataset
| 0.999288 |
1504.01027
|
Marco Aurelio dos Santos
|
Marco Santos
|
Mapeamento Sistematico
|
in Portuguese
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A systematic mapping is a way to identify, evaluate and interpret all
relevant research available to a matter of particular research. One of the
reasons for conducting systematic reviews is that it summarizes the existing
evidence regarding treatment or technology [Kitchenham, 2004].
|
[
{
"version": "v1",
"created": "Sat, 4 Apr 2015 17:14:33 GMT"
}
] | 2015-04-07T00:00:00 |
[
[
"Santos",
"Marco",
""
]
] |
new_dataset
| 0.984004 |
1504.01182
|
Nayan Jyoti Kalita
|
Nayan Jyoti Kalita, Baharul Islam
|
Bengali to Assamese Statistical Machine Translation using Moses (Corpus
Based)
|
6 pages, International Conference on Cognitive Computing and
Information Processing (CCIP-15), 3-4 March 2015, Noida (India)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine dialect interpretation assumes a real part in encouraging man-machine
correspondence and in addition men-men correspondence in Natural Language
Processing (NLP). Machine Translation (MT) alludes to utilizing machine to
change one dialect to an alternate. Statistical Machine Translation is a type
of MT consisting of Language Model (LM), Translation Model (TM) and decoder. In
this paper, Bengali to Assamese Statistical Machine Translation Model has been
created by utilizing Moses. Other translation tools like IRSTLM for Language
Model and GIZA-PP-V1.0.7 for Translation model are utilized within this
framework which is accessible in Linux situations. The purpose of the LM is to
encourage fluent output and the purpose of TM is to encourage similarity
between input and output, the decoder increases the probability of translated
text in target language. A parallel corpus of 17100 sentences in Bengali and
Assamese has been utilized for preparing within this framework. Measurable MT
procedures have not so far been generally investigated for Indian dialects. It
might be intriguing to discover to what degree these models can help the
immense continuous MT deliberations in the nation.
|
[
{
"version": "v1",
"created": "Mon, 6 Apr 2015 01:18:24 GMT"
}
] | 2015-04-07T00:00:00 |
[
[
"Kalita",
"Nayan Jyoti",
""
],
[
"Islam",
"Baharul",
""
]
] |
new_dataset
| 0.994714 |
1306.3914
|
Thomas Zemen
|
Laura Bernad\'o and Thomas Zemen and Fredrik Tufvesson and Andreas F.
Molisch and Christoph F. Mecklenbr\"auker
|
Time- and Frequency-Varying $K$-Factor of Non-Stationary Vehicular
Channels for Safety Relevant Scenarios
|
26 pages, 12 figures, submitted to IEEE Transactions on Intelligent
Transportation Systems for possible publication
|
IEEE Transactions on Intelligent Transportation Systems, vol. 16,
no. 2, April 2015
|
10.1109/TITS.2014.2349364
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular communication channels are characterized by a non-stationary time-
and frequency-selective fading process due to fast changes in the environment.
We characterize the distribution of the envelope of the first delay bin in
vehicle-to-vehicle channels by means of its Rician $K$-factor. We analyze the
time-frequency variability of this channel parameter using vehicular channel
measurements at 5.6 GHz with a bandwidth of 240 MHz for safety-relevant
scenarios in intelligent transportation systems (ITS). This data enables a
frequency-variability analysis from an IEEE 802.11p system point of view, which
uses 10 MHz channels. We show that the small-scale fading of the envelope of
the first delay bin is Ricean distributed with a varying $K$-factor. The later
delay bins are Rayleigh distributed. We demonstrate that the $K$-factor cannot
be assumed to be constant in time and frequency. The causes of these variations
are the frequency-varying antenna radiation patterns as well as the
time-varying number of active scatterers, and the effects of vegetation. We
also present a simple but accurate bi-modal Gaussian mixture model, that allows
to capture the $K$-factor variability in time for safety-relevant ITS
scenarios.
|
[
{
"version": "v1",
"created": "Mon, 17 Jun 2013 16:12:50 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Jan 2014 19:57:20 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Apr 2014 17:44:25 GMT"
}
] | 2015-04-06T00:00:00 |
[
[
"Bernadó",
"Laura",
""
],
[
"Zemen",
"Thomas",
""
],
[
"Tufvesson",
"Fredrik",
""
],
[
"Molisch",
"Andreas F.",
""
],
[
"Mecklenbräuker",
"Christoph F.",
""
]
] |
new_dataset
| 0.963312 |
1504.00847
|
Walid Hachem
|
Walid Hachem, Aris Moustakas and Leonid Pastur
|
The Shannon's mutual information of a multiple antenna time and
frequency dependent channel: an ergodic operator approach
| null | null | null | null |
cs.IT math-ph math.IT math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider a random non-centered multiple antenna radio transmission channel.
Assume that the deterministic part of the channel is itself frequency
selective, and that the random multipath part is represented by an ergodic
stationary vector process. In the Hilbert space $l^2({\mathbb Z})$, one can
associate to this channel a random ergodic self-adjoint operator having a
so-called Integrated Density of States (IDS). Shannon's mutual information per
receive antenna of this channel coincides then with the integral of a $\log$
function with respect to the IDS. In this paper, it is shown that when the
numbers of antennas at the transmitter and at the receiver tend to infinity at
the same rate, the mutual information per receive antenna tends to a quantity
that can be identified and, in fact, is closely related to that obtained within
the random matrix approach. This result can be obtained by analyzing the
behavior of the Stieltjes transform of the IDS in the regime of the large
numbers of antennas.
|
[
{
"version": "v1",
"created": "Fri, 3 Apr 2015 14:00:35 GMT"
}
] | 2015-04-06T00:00:00 |
[
[
"Hachem",
"Walid",
""
],
[
"Moustakas",
"Aris",
""
],
[
"Pastur",
"Leonid",
""
]
] |
new_dataset
| 0.950707 |
1404.0284
|
Jack Kelly
|
Jack Kelly and William Knottenbelt
|
The UK-DALE dataset, domestic appliance-level electricity demand and
whole-house demand from five UK homes
| null |
Scientific Data 2 (2015) Article number: 150007 (2015)
|
10.1038/sdata.2015.7
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many countries are rolling out smart electricity meters. These measure a
home's total power demand. However, research into consumer behaviour suggests
that consumers are best able to improve their energy efficiency when provided
with itemised, appliance-by-appliance consumption information. Energy
disaggregation is a computational technique for estimating
appliance-by-appliance energy consumption from a whole-house meter signal.
To conduct research on disaggregation algorithms, researchers require data
describing not just the aggregate demand per building but also the `ground
truth' demand of individual appliances. In this context, we present UK-DALE: an
open-access dataset from the UK recording Domestic Appliance-Level Electricity
at a sample rate of 16 kHz for the whole-house and at 1/6 Hz for individual
appliances. This is the first open access UK dataset at this temporal
resolution. We recorded from five houses, one of which was recorded for 655
days, the longest duration we are aware of for any energy dataset at this
sample rate. We also describe the low-cost, open-source, wireless system we
built for collecting our dataset.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 15:49:00 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Jan 2015 14:29:00 GMT"
},
{
"version": "v3",
"created": "Thu, 19 Mar 2015 10:45:57 GMT"
}
] | 2015-04-02T00:00:00 |
[
[
"Kelly",
"Jack",
""
],
[
"Knottenbelt",
"William",
""
]
] |
new_dataset
| 0.99955 |
1504.00331
|
Eldon Carman Jr
|
E. Preston Carman Jr. (1), Till Westmann (2), Vinayak R. Borkar (3),
Michael J. Carey (3) and Vassilis J. Tsotras (1) ((1) UC Riverside, (2)
Oracle Labs, (3) UC Irvine)
|
Apache VXQuery: A Scalable XQuery Implementation
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The wide use of XML for document management and data exchange has created the
need to query large repositories of XML data. To efficiently query such large
data collections and take advantage of parallelism, we have implemented Apache
VXQuery, an open-source scalable XQuery processor. The system builds upon two
other open-source frameworks -- Hyracks, a parallel execution engine, and
Algebricks, a language agnostic compiler toolbox. Apache VXQuery extends these
two frameworks and provides an implementation of the XQuery specifics (data
model, data-model dependent functions and optimizations, and a parser). We
describe the architecture of Apache VXQuery, its integration with Hyracks and
Algebricks, and the XQuery optimization rules applied to the query plan to
improve path expression efficiency and to enable query parallelism. An
experimental evaluation using a real 500GB dataset with various selection,
aggregation and join XML queries shows that Apache VXQuery performs well both
in terms of scale-up and speed-up. Our experiments show that it is about 3x
faster than Saxon (an open-source and commercial XQuery processor) on a 4-core,
single node implementation, and around 2.5x faster than Apache MRQL (a
MapReduce-based parallel query processor) on an eight (4-core) node cluster.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2015 18:27:23 GMT"
}
] | 2015-04-02T00:00:00 |
[
[
"Carman",
"E. Preston",
"Jr."
],
[
"Westmann",
"Till",
""
],
[
"Borkar",
"Vinayak R.",
""
],
[
"Carey",
"Michael J.",
""
],
[
"Tsotras",
"Vassilis J.",
""
]
] |
new_dataset
| 0.992282 |
1404.5244
|
Dmitry Kosolobov
|
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
|
$\mathrm{Pal}^k$ Is Linear Recognizable Online
|
18 pages, 5 figures, presented in SOFSEM 2015
|
Proc. SOFSEM 2015. Springer, 2015. LNCS Vol. 8939, 289-301
| null | null |
cs.FL cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a language $L$ that is online recognizable in linear time and space, we
construct a linear time and space online recognition algorithm for the language
$L\cdot\mathrm{Pal}$, where $\mathrm{Pal}$ is the language of all nonempty
palindromes. Hence for every fixed positive $k$, $\mathrm{Pal}^k$ is online
recognizable in linear time and space. Thus we solve an open problem posed by
Galil and Seiferas in 1978.
|
[
{
"version": "v1",
"created": "Mon, 21 Apr 2014 17:07:52 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Aug 2014 19:17:25 GMT"
},
{
"version": "v3",
"created": "Wed, 10 Sep 2014 18:36:41 GMT"
},
{
"version": "v4",
"created": "Fri, 30 Jan 2015 14:34:02 GMT"
}
] | 2015-04-01T00:00:00 |
[
[
"Kosolobov",
"Dmitry",
""
],
[
"Rubinchik",
"Mikhail",
""
],
[
"Shur",
"Arseny M.",
""
]
] |
new_dataset
| 0.978543 |
1407.0970
|
Saverio Giallorenzo
|
Mila Dalla Preda, Maurizio Gabbrielli, Saverio Giallorenzo, Ivan
Lanese, and Jacopo Mauro
|
Dynamic Choreographies - Safe Runtime Updates of Distributed
Applications
|
Technical Report
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Programming distributed applications free from communication deadlocks and
races is complex. Preserving these properties when applications are updated at
runtime is even harder. We present DIOC, a language for programming distributed
applications that are free from deadlocks and races by construction. A DIOC
program describes a whole distributed application as a unique entity
(choreography). DIOC allows the programmer to specify which parts of the
application can be updated. At runtime, these parts may be replaced by new DIOC
fragments from outside the application. DIOC programs are compiled, generating
code for each site, in a lower-level language called DPOC. We formalise both
DIOC and DPOC semantics as labelled transition systems and prove the
correctness of the compilation as a trace equivalence result. As corollaries,
DPOC applications are free from communication deadlocks and races, even in
presence of runtime updates.
|
[
{
"version": "v1",
"created": "Thu, 3 Jul 2014 16:12:12 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Jan 2015 08:46:47 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Mar 2015 13:07:40 GMT"
},
{
"version": "v4",
"created": "Tue, 31 Mar 2015 06:48:05 GMT"
}
] | 2015-04-01T00:00:00 |
[
[
"Preda",
"Mila Dalla",
""
],
[
"Gabbrielli",
"Maurizio",
""
],
[
"Giallorenzo",
"Saverio",
""
],
[
"Lanese",
"Ivan",
""
],
[
"Mauro",
"Jacopo",
""
]
] |
new_dataset
| 0.990265 |
1412.7210
|
Antti Rasmus
|
Antti Rasmus, Tapani Raiko, Harri Valpola
|
Denoising autoencoder with modulated lateral connections learns
invariant representations of natural images
|
Presentation at ICLR 2015 workshop
| null | null | null |
cs.NE cs.CV cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suitable lateral connections between encoder and decoder are shown to allow
higher layers of a denoising autoencoder (dAE) to focus on invariant
representations. In regular autoencoders, detailed information needs to be
carried through the highest layers but lateral connections from encoder to
decoder relieve this pressure. It is shown that abstract invariant features can
be translated to detailed reconstructions when invariant features are allowed
to modulate the strength of the lateral connection. Three dAE structures with
modulated and additive lateral connections, and without lateral connections
were compared in experiments using real-world images. The experiments verify
that adding modulated lateral connections to the model 1) improves the accuracy
of the probability model for inputs, as measured by denoising performance; 2)
results in representations whose degree of invariance grows faster towards the
higher layers; and 3) supports the formation of diverse invariant poolings.
|
[
{
"version": "v1",
"created": "Mon, 22 Dec 2014 23:36:15 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Dec 2014 12:17:51 GMT"
},
{
"version": "v3",
"created": "Wed, 25 Feb 2015 20:56:43 GMT"
},
{
"version": "v4",
"created": "Tue, 31 Mar 2015 15:49:16 GMT"
}
] | 2015-04-01T00:00:00 |
[
[
"Rasmus",
"Antti",
""
],
[
"Raiko",
"Tapani",
""
],
[
"Valpola",
"Harri",
""
]
] |
new_dataset
| 0.995331 |
1503.08818
|
Zimu Yuan
|
Zimu Yuan, Zhiwei Xu
|
Founding Digital Currency on Imprecise Commodity
|
arXiv admin note: text overlap with arXiv:1503.08407
| null | null | null |
cs.CY cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current digital currency schemes provide instantaneous exchange on precise
commodity, in which "precise" means a buyer can possibly verify the function of
the commodity without error. However, imprecise commodities, e.g. statistical
data, with error existing are abundant in digital world. Existing digital
currency schemes do not offer a mechanism to help the buyer for payment
decision on precision of commodity, which may lead the buyer to a dilemma
between having to buy and being unconfident. In this paper, we design a
currency schemes IDCS for imprecise digital commodity. IDCS completes a trade
in three stages of handshake between a buyer and providers. We present an IDCS
prototype implementation that assigns weights on the trustworthy of the
providers, and calculates a confidence level for the buyer to decide the
quality of a imprecise commodity. In experiment, we characterize the
performance of IDCS prototype under varying impact factors.
|
[
{
"version": "v1",
"created": "Sun, 29 Mar 2015 09:35:17 GMT"
}
] | 2015-04-01T00:00:00 |
[
[
"Yuan",
"Zimu",
""
],
[
"Xu",
"Zhiwei",
""
]
] |
new_dataset
| 0.996321 |
1503.08853
|
Ali Borji
|
Ali Borji and James Tanner
|
Reconciling saliency and object center-bias hypotheses in explaining
free-viewing fixations
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Predicting where people look in natural scenes has attracted a lot of
interest in computer vision and computational neuroscience over the past two
decades. Two seemingly contrasting categories of cues have been proposed to
influence where people look: \textit{low-level image saliency} and
\textit{high-level semantic information}. Our first contribution is to take a
detailed look at these cues to confirm the hypothesis proposed by
Henderson~\cite{henderson1993eye} and Nuthmann \&
Henderson~\cite{nuthmann2010object} that observers tend to look at the center
of objects. We analyzed fixation data for scene free-viewing over 17 observers
on 60 fully annotated images with various types of objects. Images contained
different types of scenes, such as natural scenes, line drawings, and 3D
rendered scenes. Our second contribution is to propose a simple combined model
of low-level saliency and object center-bias that outperforms each individual
component significantly over our data, as well as on the OSIE dataset by Xu et
al.~\cite{xu2014predicting}. The results reconcile saliency with object
center-bias hypotheses and highlight that both types of cues are important in
guiding fixations. Our work opens new directions to understand strategies that
humans use in observing scenes and objects, and demonstrates the construction
of combined models of low-level saliency and high-level object-based
information.
|
[
{
"version": "v1",
"created": "Mon, 30 Mar 2015 21:07:53 GMT"
}
] | 2015-04-01T00:00:00 |
[
[
"Borji",
"Ali",
""
],
[
"Tanner",
"James",
""
]
] |
new_dataset
| 0.991453 |
1503.08934
|
Tadashi Wadayama
|
Takahiro Oshima and Tadashi Wadayama
|
Index ARQ Protocol for Reliable Contents Distribution over Broadcast
Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the present paper, we propose a broadcast ARQ protocol based on the
concept of index coding. In the proposed scenario, a server wishes to transmit
a finite sequence of packets to multiple receivers via a broadcast channel with
packet erasures until all of the receivers successfully receive all of the
packets. In the retransmission phase, the server produces a coded packet as a
retransmitted packet based on the side-information sent from the receivers via
feedback channels. A notable feature of the proposed protocol is that the
decoding process at the receiver side has low decoding complexity because only
a small number of addition operations are needed in order to recover an
intended packet. This feature may be preferable for reducing the power
consumption of receivers. The throughput performance of the proposed protocol
is close to that of the ideal FEC throughput performance when the erasure
probability is less than $0.1$. This implies that the proposed protocol
provides almost optimal throughput performance in such a regime.
|
[
{
"version": "v1",
"created": "Tue, 31 Mar 2015 07:08:34 GMT"
}
] | 2015-04-01T00:00:00 |
[
[
"Oshima",
"Takahiro",
""
],
[
"Wadayama",
"Tadashi",
""
]
] |
new_dataset
| 0.998586 |
1403.0445
|
Matthieu Boutier
|
Matthieu Boutier (PPS), Juliusz Chroboczek (PPS)
|
Source-specific routing
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Source-specific routing (not to be confused with source routing) is a routing
technique where routing decisions depend on both the source and the destination
address of a packet. Source-specific routing solves some difficult problems
related to multihoming, notably in edge networks, and is therefore a useful
addition to the multihoming toolbox. In this paper, we describe the semantics
of source-specific packet forwarding, and describe the design and
implementation of a source-specific extension to the Babel routing protocol as
well as its implementation - to our knowledge, the first complete
implementation of a source-specific dynamic routing protocol, including a
disambiguation algorithm that makes our implementation work over widely
available networking APIs. We further discuss interoperability between ordinary
next-hop and source-specific dynamic routing protocols. Our implementation has
seen a moderate amount of deployment, notably as a testbed for the IETF Homenet
working group.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2014 14:38:07 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Dec 2014 08:17:08 GMT"
},
{
"version": "v3",
"created": "Tue, 16 Dec 2014 14:48:55 GMT"
},
{
"version": "v4",
"created": "Mon, 30 Mar 2015 08:46:28 GMT"
}
] | 2015-03-31T00:00:00 |
[
[
"Boutier",
"Matthieu",
"",
"PPS"
],
[
"Chroboczek",
"Juliusz",
"",
"PPS"
]
] |
new_dataset
| 0.999643 |
1408.4077
|
Laszlo Kish
|
Laszlo B. Kish, Claes-Goran Granqvist, Sergey M. Bezrukov and Tamas
Horvath
|
Brain: Biological noise-based logic
|
paper in press
|
Advances in Cognitive Neurodynamics 2015, pp 319-322
|
10.1007/978-94-017-9548-7_45
| null |
cs.NE cs.ET
|
http://creativecommons.org/licenses/by/3.0/
|
Neural spikes in the brain form stochastic sequences, i.e., belong to the
class of pulse noises. This stochasticity is a counterintuitive feature because
extracting information - such as the commonly supposed neural information of
mean spike frequency - requires long times for reasonably low error
probability. The mystery could be solved by noise-based logic, wherein
randomness has an important function and allows large speed enhancements for
special-purpose tasks, and the same mechanism is at work for the brain logic
version of this concept.
|
[
{
"version": "v1",
"created": "Mon, 18 Aug 2014 17:49:28 GMT"
}
] | 2015-03-31T00:00:00 |
[
[
"Kish",
"Laszlo B.",
""
],
[
"Granqvist",
"Claes-Goran",
""
],
[
"Bezrukov",
"Sergey M.",
""
],
[
"Horvath",
"Tamas",
""
]
] |
new_dataset
| 0.983111 |
1411.5847
|
Pierre-Lo\"ic Garoche
|
Assal\'e Adj\'e and Pierre-Lo\"ic Garoche and Alexis Werey
|
Quadratic Zonotopes:An extension of Zonotopes to Quadratic Arithmetics
|
17 pages, 5 figures, 1 table
| null | null | null |
cs.LO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Affine forms are a common way to represent convex sets of $\mathbb{R}$ using
a base of error terms $\epsilon \in [-1, 1]^m$. Quadratic forms are an
extension of affine forms enabling the use of quadratic error terms $\epsilon_i
\epsilon_j$.
In static analysis, the zonotope domain, a relational abstract domain based
on affine forms has been used in a wide set of settings, e.g. set-based
simulation for hybrid systems, or floating point analysis, providing relational
abstraction of functions with a cost linear in the number of errors terms.
In this paper, we propose a quadratic version of zonotopes. We also present a
new algorithm based on semi-definite programming to project a quadratic
zonotope, and therefore quadratic forms, to intervals. All presented material
has been implemented and applied on representative examples.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2014 12:43:01 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Mar 2015 20:26:26 GMT"
}
] | 2015-03-31T00:00:00 |
[
[
"Adjé",
"Assalé",
""
],
[
"Garoche",
"Pierre-Loïc",
""
],
[
"Werey",
"Alexis",
""
]
] |
new_dataset
| 0.986073 |
1503.04990
|
Michael Bekos
|
Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N.
Raftopoulou
|
The Book Thickness of 1-Planar Graphs is Constant
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a book embedding, the vertices of a graph are placed on the spine of a
book and the edges are assigned to pages, so that edges on the same page do not
cross. In this paper, we prove that every $1$-planar graph (that is, a graph
that can be drawn on the plane such that no edge is crossed more than once)
admits an embedding in a book with constant number of pages. To the best of our
knowledge, the best non-trivial previous upper-bound is $O(\sqrt{n})$, where
$n$ is the number of vertices of the graph.
|
[
{
"version": "v1",
"created": "Tue, 17 Mar 2015 10:49:36 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Mar 2015 09:45:16 GMT"
}
] | 2015-03-31T00:00:00 |
[
[
"Bekos",
"Michael A.",
""
],
[
"Bruckdorfer",
"Till",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Raftopoulou",
"Chrysanthi N.",
""
]
] |
new_dataset
| 0.981794 |
1503.08558
|
Konstantin Avrachenkov
|
Konstantin Avrachenkov (INRIA Sophia Antipolis), Vivek Borkar (EE-IIT)
|
Whittle Index Policy for Crawling Ephemeral Content
| null | null | null | null |
cs.IR cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a task of scheduling a crawler to retrieve content from several
sites with ephemeral content. A user typically loses interest in ephemeral
content, like news or posts at social network groups, after several days or
hours. Thus, development of timely crawling policy for such ephemeral
information sources is very important. We first formulate this problem as an
optimal control problem with average reward. The reward can be measured in the
number of clicks or relevant search requests. The problem in its initial
formulation suffers from the curse of dimensionality and quickly becomes
intractable even with moderate number of information sources. Fortunately, this
problem admits a Whittle index, which leads to problem decomposition and to a
very simple and efficient crawling policy. We derive the Whittle index and
provide its theoretical justification.
|
[
{
"version": "v1",
"created": "Mon, 30 Mar 2015 06:45:31 GMT"
}
] | 2015-03-31T00:00:00 |
[
[
"Avrachenkov",
"Konstantin",
"",
"INRIA Sophia Antipolis"
],
[
"Borkar",
"Vivek",
"",
"EE-IIT"
]
] |
new_dataset
| 0.95656 |
1503.08581
|
Ioannis Partalas
|
Ioannis Partalas, Aris Kosmopoulos, Nicolas Baskiotis, Thierry
Artieres, George Paliouras, Eric Gaussier, Ion Androutsopoulos, Massih-Reza
Amini, Patrick Galinari
|
LSHTC: A Benchmark for Large-Scale Text Classification
| null | null | null | null |
cs.IR cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LSHTC is a series of challenges which aims to assess the performance of
classification systems in large-scale classification in a a large number of
classes (up to hundreds of thousands). This paper describes the dataset that
have been released along the LSHTC series. The paper details the construction
of the datsets and the design of the tracks as well as the evaluation measures
that we implemented and a quick overview of the results. All of these datasets
are available online and runs may still be submitted on the online server of
the challenges.
|
[
{
"version": "v1",
"created": "Mon, 30 Mar 2015 08:03:47 GMT"
}
] | 2015-03-31T00:00:00 |
[
[
"Partalas",
"Ioannis",
""
],
[
"Kosmopoulos",
"Aris",
""
],
[
"Baskiotis",
"Nicolas",
""
],
[
"Artieres",
"Thierry",
""
],
[
"Paliouras",
"George",
""
],
[
"Gaussier",
"Eric",
""
],
[
"Androutsopoulos",
"Ion",
""
],
[
"Amini",
"Massih-Reza",
""
],
[
"Galinari",
"Patrick",
""
]
] |
new_dataset
| 0.99987 |
1412.6937
|
Xudong Chen
|
Xudong Chen, M.-A. Belabbas and Tamer Basar
|
Formation Control with Triangulated Laman Graphs
| null | null | null | null |
cs.SY math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Formation control deals with the design of decentralized control laws that
stabilize agents at prescribed distances from each other. We call any
configuration that satisfies the inter-agent distance conditions a target
configuration. It is well known that when the distance conditions are defined
via a rigid graph, there is a finite number of target configurations modulo
rotations and translations. We can thus recast the objective of formation
control as stabilizing one or many of the target configurations. A major issue
is that such control laws will also have equilibria corresponding to
configurations which do not meet the desired inter-agent distance conditions;
we refer to these as undesired equilibria. The undesired equilibria become
problematic if they are also stable. Designing decentralized control laws whose
stable equilibria are all target configurations in the case of a general rigid
graph is still an open problem. We propose here a partial solution to this
problem by exhibiting a class of rigid graphs and control laws for which all
stable equilibria are target configurations.
|
[
{
"version": "v1",
"created": "Mon, 22 Dec 2014 11:40:14 GMT"
},
{
"version": "v2",
"created": "Sun, 28 Dec 2014 13:18:58 GMT"
},
{
"version": "v3",
"created": "Wed, 4 Feb 2015 01:50:49 GMT"
},
{
"version": "v4",
"created": "Fri, 27 Mar 2015 18:06:52 GMT"
}
] | 2015-03-30T00:00:00 |
[
[
"Chen",
"Xudong",
""
],
[
"Belabbas",
"M. -A.",
""
],
[
"Basar",
"Tamer",
""
]
] |
new_dataset
| 0.998034 |
1503.07881
|
Yonathan Perez
|
Yonathan Perez, Rok Sosic, Arijit Banerjee, Rohan Puttagunta, Martin
Raison, Pararth Shah, Jure Leskovec
|
Ringo: Interactive Graph Analytics on Big-Memory Machines
|
6 pages, 2 figures
| null |
10.1145/2723372.2735369
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Ringo, a system for analysis of large graphs. Graphs provide a way
to represent and analyze systems of interacting objects (people, proteins,
webpages) with edges between the objects denoting interactions (friendships,
physical interactions, links). Mining graphs provides valuable insights about
individual objects as well as the relationships among them.
In building Ringo, we take advantage of the fact that machines with large
memory and many cores are widely available and also relatively affordable. This
allows us to build an easy-to-use interactive high-performance graph analytics
system. Graphs also need to be built from input data, which often resides in
the form of relational tables. Thus, Ringo provides rich functionality for
manipulating raw input data tables into various kinds of graphs. Furthermore,
Ringo also provides over 200 graph analytics functions that can then be applied
to constructed graphs.
We show that a single big-memory machine provides a very attractive platform
for performing analytics on all but the largest graphs as it offers excellent
performance and ease of use as compared to alternative approaches. With Ringo,
we also demonstrate how to integrate graph analytics with an iterative process
of trial-and-error data exploration and rapid experimentation, common in data
mining workloads.
|
[
{
"version": "v1",
"created": "Thu, 26 Mar 2015 20:01:55 GMT"
}
] | 2015-03-30T00:00:00 |
[
[
"Perez",
"Yonathan",
""
],
[
"Sosic",
"Rok",
""
],
[
"Banerjee",
"Arijit",
""
],
[
"Puttagunta",
"Rohan",
""
],
[
"Raison",
"Martin",
""
],
[
"Shah",
"Pararth",
""
],
[
"Leskovec",
"Jure",
""
]
] |
new_dataset
| 0.999509 |
1503.07903
|
Safia Haloui
|
Safia Haloui
|
Codes from Jacobian surfaces
| null | null | null | null |
cs.IT math.AG math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with some Algebraic Geometry codes on Jacobians of
genus 2 curves. We derive a lower bound for the minimum distance of these codes
from an upper "Weil type" bound for the number of rational points on
irreducible (possibly singular or non-absolutely irreducible) curves lying on
an abelian surface over a finite field.
|
[
{
"version": "v1",
"created": "Thu, 26 Mar 2015 21:12:08 GMT"
}
] | 2015-03-30T00:00:00 |
[
[
"Haloui",
"Safia",
""
]
] |
new_dataset
| 0.985982 |
1503.07919
|
Mordechai Guri
|
Mordechai Guri, Matan Monitz, Yisroel Mirski, Yuval Elovici
|
BitWhisper: Covert Signaling Channel between Air-Gapped Computers using
Thermal Manipulations
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It has been assumed that the physical separation (air-gap) of computers
provides a reliable level of security, such that should two adjacent computers
become compromised, the covert exchange of data between them would be
impossible. In this paper, we demonstrate BitWhisper, a method of bridging the
air-gap between adjacent compromised computers by using their heat emissions
and built-in thermal sensors to create a covert communication channel. Our
method is unique in two respects: it supports bidirectional communication, and
it requires no additional dedicated peripheral hardware. We provide
experimental results based on implementation of BitWhisper prototype, and
examine the channel properties and limitations. Our experiments included
different layouts, with computers positioned at varying distances from one
another, and several sensor types and CPU configurations (e.g., Virtual
Machines). We also discuss signal modulation and communication protocols,
showing how BitWhisper can be used for the exchange of data between two
computers in a close proximity (at distance of 0-40cm) at an effective rate of
1-8 bits per hour, a rate which makes it possible to infiltrate brief commands
and exfiltrate small amount of data (e.g., passwords) over the covert channel.
|
[
{
"version": "v1",
"created": "Thu, 26 Mar 2015 22:14:07 GMT"
}
] | 2015-03-30T00:00:00 |
[
[
"Guri",
"Mordechai",
""
],
[
"Monitz",
"Matan",
""
],
[
"Mirski",
"Yisroel",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.995008 |
1503.07932
|
Jingchao Sun
|
Jingchao Sun and Rui Zhang and Xiaocong Jin and Yanchao Zhang
|
SecureFind: Secure and Privacy-Preserving Object Finding via Mobile
Crowdsourcing
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
The plummeting cost of Bluetooth tags and the ubiquity of mobile devices are
revolutionizing the traditional lost-and-found service. This paper presents
SecureFind, a secure and privacy-preserving object-finding system via mobile
crowdsourcing. In SecureFind, a unique Bluetooth tag is attached to every
valuable object, and the owner of a lost object submits an object-finding
request to many mobile users via the SecureFind service provider. Each mobile
user involved searches his vicinity for the lost object on behalf of the object
owner who can infer the location of his lost object based on the responses from
mobile users. SecureFind is designed to ensure strong object security such that
only the object owner can discover the location of his lost object as well as
offering strong location privacy to mobile users involved. The high efficacy
and efficiency of SecureFind are confirmed by extensive simulations.
|
[
{
"version": "v1",
"created": "Fri, 27 Mar 2015 00:23:23 GMT"
}
] | 2015-03-30T00:00:00 |
[
[
"Sun",
"Jingchao",
""
],
[
"Zhang",
"Rui",
""
],
[
"Jin",
"Xiaocong",
""
],
[
"Zhang",
"Yanchao",
""
]
] |
new_dataset
| 0.996324 |
1503.06782
|
Changchun Zhang
|
Changchun Zhang, Robert Caiming Qiu
|
Massive MIMO as a Big Data System: Random Matrix Models and Testbed
|
arXiv admin note: text overlap with arXiv:1402.6419 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper has two parts. The first one deals with how to use large random
matrices as building blocks to model the massive data arising from the massive
(or large-scale) MIMO system. As a result, we apply this model for distributed
spectrum sensing and network monitoring. The part boils down to the streaming,
distributed massive data, for which a new algorithm is obtained and its
performance is derived using the central limit theorem that is recently
obtained in the literature. The second part deals with the large-scale testbed
using software-defined radios (particularly USRP) that takes us more than four
years to develop this 70-node network testbed. To demonstrate the power of the
software defined radio, we reconfigure our testbed quickly into a testbed for
massive MIMO. The massive data of this testbed is of central interest in this
paper. It is for the first time for us to model the experimental data arising
from this testbed. To our best knowledge, we are not aware of other similar
work.
|
[
{
"version": "v1",
"created": "Mon, 23 Mar 2015 19:51:22 GMT"
}
] | 2015-03-29T00:00:00 |
[
[
"Zhang",
"Changchun",
""
],
[
"Qiu",
"Robert Caiming",
""
]
] |
new_dataset
| 0.999289 |
1307.5664
|
Baoliu Ye Prof.
|
Bin Tang, Shenghao Yang, Baoliu Ye, Yitong Yin and Sanglu Lu
|
Expander Chunked Codes
|
26 pages, 3 figures, submitted for journal publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chunked codes are efficient random linear network coding (RLNC) schemes with
low computational cost, where the input packets are encoded into small chunks
(i.e., subsets of the coded packets). During the network transmission, RLNC is
performed within each chunk. In this paper, we first introduce a simple
transfer matrix model to characterize the transmission of chunks, and derive
some basic properties of the model to facilitate the performance analysis. We
then focus on the design of overlapped chunked codes, a class of chunked codes
whose chunks are non-disjoint subsets of input packets, which are of special
interest since they can be encoded with negligible computational cost and in a
causal fashion. We propose expander chunked (EC) codes, the first class of
overlapped chunked codes that have an analyzable performance,where the
construction of the chunks makes use of regular graphs. Numerical and
simulation results show that in some practical settings, EC codes can achieve
rates within 91 to 97 percent of the optimum and outperform the
state-of-the-art overlapped chunked codes significantly.
|
[
{
"version": "v1",
"created": "Mon, 22 Jul 2013 11:56:13 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Apr 2014 10:31:25 GMT"
},
{
"version": "v3",
"created": "Thu, 26 Mar 2015 12:06:50 GMT"
}
] | 2015-03-27T00:00:00 |
[
[
"Tang",
"Bin",
""
],
[
"Yang",
"Shenghao",
""
],
[
"Ye",
"Baoliu",
""
],
[
"Yin",
"Yitong",
""
],
[
"Lu",
"Sanglu",
""
]
] |
new_dataset
| 0.968579 |
1503.07551
|
Helio M. de Oliveira
|
P. Carrion, H.M. de Oliveira and R.M. Campello de Souza
|
A Low-throughput Wavelet-based Steganography Audio Scheme
|
2 pages, 1 figure, conference: 8th Brazilian Symposium on Information
and Computer System Security, 2008, Gramado, RS, Brazil
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the preliminary of a novel scheme of steganography, and
introduces the idea of combining two secret keys in the operation. The first
secret key encrypts the text using a standard cryptographic scheme (e.g. IDEA,
SAFER+, etc.) prior to the wavelet audio decomposition. The way in which the
cipher text is embedded in the file requires another key, namely a stego-key,
which is associated with features of the audio wavelet analysis.
|
[
{
"version": "v1",
"created": "Thu, 5 Feb 2015 03:15:25 GMT"
}
] | 2015-03-27T00:00:00 |
[
[
"Carrion",
"P.",
""
],
[
"de Oliveira",
"H. M.",
""
],
[
"de Souza",
"R. M. Campello",
""
]
] |
new_dataset
| 0.99873 |
1503.07626
|
Alexander Shumilov
|
Igor Bychkov, Gennady Ruzhnikov, Roman Fedorov, Alexander Shumilov
|
Building the distributed WPS-services execution environment
|
17 pages
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The article describes the environment of WPS-based (Web Processing Service)
distributed services, that uses scenarios in JavaScript programming language in
order to integrate services with each other. The environment standardizes data
processing procedures, stores all services-related information and offers the
set of basic WPS-services.
|
[
{
"version": "v1",
"created": "Thu, 26 Mar 2015 05:21:28 GMT"
}
] | 2015-03-27T00:00:00 |
[
[
"Bychkov",
"Igor",
""
],
[
"Ruzhnikov",
"Gennady",
""
],
[
"Fedorov",
"Roman",
""
],
[
"Shumilov",
"Alexander",
""
]
] |
new_dataset
| 0.998818 |
1503.07640
|
Qinqin Chen
|
Qinqin Chen, Hui Zhao, Lin Li, Hang Long, Jianquan Wang, Xiaoyue Hou
|
A Closed-Loop UL Power Control Scheme for Interference Mitigation in
Dynamic TD-LTE Systems
|
5 pages, 4 figures,conference
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The TD-LTE system is envisaged to adopt dynamic time division duplexing (TDD)
transmissions for small cells to adapt their communication service to the fast
variation of downlink (DL) and uplink (UL) traffic demands. However, different
DL/UL directions for the same subframe in adjacent cells will result in new
destructive interference components, i.e., eNB-to-eNB and UE-to-UE, with levels
that can significantly differ from one subframe to another. In this paper, a
feasible UL power control mechanism is proposed to manage eNB-to-eNB
interference, where different UL power control parameters are set based on
different interference level. We consider the geometric location information
and the subframe set selection process about adjacent eNBs when the
interference level is estimated. The performance of the proposed scheme is
evaluated through system level simulations and it is shown that the scheme can
achieve preferable improvement in terms of UL average and 5%-ile packet
throughputs compared with the original scheme without power control. Also, the
UE-to-UE interference is not worse when the UE transmit power become higher.
|
[
{
"version": "v1",
"created": "Thu, 26 Mar 2015 07:52:57 GMT"
}
] | 2015-03-27T00:00:00 |
[
[
"Chen",
"Qinqin",
""
],
[
"Zhao",
"Hui",
""
],
[
"Li",
"Lin",
""
],
[
"Long",
"Hang",
""
],
[
"Wang",
"Jianquan",
""
],
[
"Hou",
"Xiaoyue",
""
]
] |
new_dataset
| 0.997431 |
1503.07768
|
Kourosh Davarpanah
|
Kourosh Davarpanah, Dan Kaufman, Ophelie Pubellier
|
NeuCoin: the First Secure, Cost-efficient and Decentralized
Cryptocurrency
|
39 pages, 10 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
NeuCoin is a decentralized peer-to-peer cryptocurrency derived from Sunny
King's Peercoin, which itself was derived from Satoshi Nakamoto's Bitcoin. As
with Peercoin, proof-of-stake replaces proof-of-work as NeuCoin's security
model, effectively replacing the operating costs of Bitcoin miners
(electricity, computers) with the capital costs of holding the currency.
Proof-of-stake also avoids proof-of-work's inherent tendency towards
centralization resulting from competition for coinbase rewards among miners
based on lowest cost electricity and hash power.
NeuCoin increases security relative to Peercoin and other existing
proof-of-stake currencies in numerous ways, including: (1) incentivizing nodes
to continuously stake coins over time through substantially higher mining
rewards and lower minimum stake age; (2) abandoning the use of coin age in the
mining formula; (3) causing the stake modifier parameter to change over time
for each stake; and (4) utilizing a client that punishes nodes that attempt to
mine on multiple branches with duplicate stakes.
This paper demonstrates how NeuCoin's proof-of-stake implementation addresses
all commonly raised "nothing at stake" objections to generic proof-of-stake
systems. It also reviews many of the flaws of proof-of-work designs to
highlight the potential for an alternate cryptocurrency that solves these
flaws.
|
[
{
"version": "v1",
"created": "Thu, 26 Mar 2015 15:46:22 GMT"
}
] | 2015-03-27T00:00:00 |
[
[
"Davarpanah",
"Kourosh",
""
],
[
"Kaufman",
"Dan",
""
],
[
"Pubellier",
"Ophelie",
""
]
] |
new_dataset
| 0.997433 |
1008.2748
|
Carl Hewitt
|
Carl Hewitt
|
ActorScript(TM) extension of C sharp (TM), Java(TM), and Objective
C(TM): iAdaptive(TM) concurrency for antiCloud(TM) privacy and security
|
Added explanation of facets of an Actor. Admin note: text overlap
with arXiv:1008.1459
| null | null | null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ActorScript(TM) is a general purpose programming language for implementing
discretionary, adaptive concurrency that manages resources and demand.
It is differentiated from previous languages by the following:
- Universality
*** Ability to specify what Actors can do
*** Specify interface between hardware and software
*** Everything in the language is accomplished using message passing
including the very definition of ActorScript itself
*** Functional, Imperative, Logic, and Concurrent programming are integrated.
*** Concurrency dynamically adapts to resources available and current load.
*** Programs do not expose low-level implementation mechanisms such as
threads, tasks, locks, cores, etc.
*** Messages can be directly communicated without requiring indirection
through brokers, channels, class hierarchies, mailboxes, pipes, ports, queues
etc.
*** Variable races are eliminated.
*** Binary XML and JSON are data types.
*** Application binary interfaces are afforded so that no identifier symbol
need be looked up at runtime.
- Safety and Security
*** Programs are extension invariant, i.e., extending a program does not
change its meaning.
*** Applications cannot directly harm each other.
- Performance
*** Impose no overhead on implementation of Actor systems
*** Message passing has essentially same overhead as procedure calling and
looping.
*** Allow execution to be dynamically adjusted for system load and capacity
(e.g. cores)
*** Locality because execution is not bound by a sequential global memory
model
*** Inherent concurrency because execution is not bound by communicating
sequential processes
*** Minimize latency along critical paths
|
[
{
"version": "v1",
"created": "Mon, 16 Aug 2010 19:45:20 GMT"
},
{
"version": "v10",
"created": "Wed, 29 Dec 2010 13:23:33 GMT"
},
{
"version": "v11",
"created": "Wed, 16 Feb 2011 18:58:22 GMT"
},
{
"version": "v12",
"created": "Sun, 6 Mar 2011 23:51:16 GMT"
},
{
"version": "v13",
"created": "Mon, 2 May 2011 14:11:43 GMT"
},
{
"version": "v14",
"created": "Sat, 18 Jun 2011 08:36:20 GMT"
},
{
"version": "v15",
"created": "Wed, 6 Jul 2011 14:09:24 GMT"
},
{
"version": "v16",
"created": "Mon, 18 Jul 2011 10:39:23 GMT"
},
{
"version": "v17",
"created": "Mon, 1 Aug 2011 19:28:08 GMT"
},
{
"version": "v18",
"created": "Mon, 7 Nov 2011 12:08:56 GMT"
},
{
"version": "v19",
"created": "Tue, 15 Nov 2011 14:29:38 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Aug 2010 17:24:47 GMT"
},
{
"version": "v20",
"created": "Mon, 21 Nov 2011 17:26:53 GMT"
},
{
"version": "v21",
"created": "Tue, 13 Dec 2011 23:20:19 GMT"
},
{
"version": "v22",
"created": "Tue, 3 Jan 2012 15:49:33 GMT"
},
{
"version": "v23",
"created": "Wed, 11 Jan 2012 14:16:14 GMT"
},
{
"version": "v24",
"created": "Sat, 14 Jan 2012 19:18:33 GMT"
},
{
"version": "v25",
"created": "Fri, 9 Mar 2012 18:12:55 GMT"
},
{
"version": "v26",
"created": "Mon, 25 Jun 2012 16:22:05 GMT"
},
{
"version": "v27",
"created": "Thu, 2 Aug 2012 18:56:07 GMT"
},
{
"version": "v28",
"created": "Tue, 28 Aug 2012 05:28:57 GMT"
},
{
"version": "v29",
"created": "Fri, 19 Oct 2012 05:40:28 GMT"
},
{
"version": "v3",
"created": "Mon, 23 Aug 2010 14:45:26 GMT"
},
{
"version": "v30",
"created": "Wed, 7 Nov 2012 18:03:34 GMT"
},
{
"version": "v31",
"created": "Tue, 4 Dec 2012 18:24:08 GMT"
},
{
"version": "v32",
"created": "Tue, 8 Jan 2013 18:36:23 GMT"
},
{
"version": "v33",
"created": "Wed, 27 Feb 2013 19:45:06 GMT"
},
{
"version": "v34",
"created": "Tue, 26 Mar 2013 15:36:01 GMT"
},
{
"version": "v35",
"created": "Tue, 23 Apr 2013 05:42:37 GMT"
},
{
"version": "v36",
"created": "Mon, 29 Apr 2013 16:05:46 GMT"
},
{
"version": "v37",
"created": "Tue, 7 May 2013 17:40:13 GMT"
},
{
"version": "v38",
"created": "Tue, 25 Jun 2013 18:43:01 GMT"
},
{
"version": "v39",
"created": "Mon, 15 Jul 2013 16:17:05 GMT"
},
{
"version": "v4",
"created": "Tue, 31 Aug 2010 17:25:04 GMT"
},
{
"version": "v40",
"created": "Mon, 19 Aug 2013 16:41:30 GMT"
},
{
"version": "v41",
"created": "Tue, 24 Sep 2013 19:03:29 GMT"
},
{
"version": "v42",
"created": "Tue, 15 Oct 2013 23:52:45 GMT"
},
{
"version": "v43",
"created": "Mon, 16 Dec 2013 20:23:22 GMT"
},
{
"version": "v44",
"created": "Wed, 1 Jan 2014 02:22:43 GMT"
},
{
"version": "v45",
"created": "Fri, 14 Feb 2014 20:49:29 GMT"
},
{
"version": "v46",
"created": "Mon, 21 Apr 2014 13:58:04 GMT"
},
{
"version": "v47",
"created": "Wed, 14 May 2014 15:55:52 GMT"
},
{
"version": "v48",
"created": "Wed, 11 Jun 2014 06:39:04 GMT"
},
{
"version": "v49",
"created": "Mon, 16 Jun 2014 19:33:48 GMT"
},
{
"version": "v5",
"created": "Thu, 9 Sep 2010 18:41:02 GMT"
},
{
"version": "v50",
"created": "Tue, 14 Oct 2014 15:10:41 GMT"
},
{
"version": "v51",
"created": "Wed, 15 Oct 2014 16:52:06 GMT"
},
{
"version": "v52",
"created": "Wed, 5 Nov 2014 15:03:16 GMT"
},
{
"version": "v53",
"created": "Mon, 24 Nov 2014 00:33:38 GMT"
},
{
"version": "v54",
"created": "Mon, 29 Dec 2014 19:30:07 GMT"
},
{
"version": "v55",
"created": "Sun, 11 Jan 2015 00:03:38 GMT"
},
{
"version": "v56",
"created": "Mon, 19 Jan 2015 17:13:01 GMT"
},
{
"version": "v57",
"created": "Sun, 25 Jan 2015 23:31:03 GMT"
},
{
"version": "v58",
"created": "Mon, 9 Feb 2015 18:06:24 GMT"
},
{
"version": "v59",
"created": "Tue, 17 Feb 2015 18:23:20 GMT"
},
{
"version": "v6",
"created": "Mon, 4 Oct 2010 19:15:10 GMT"
},
{
"version": "v60",
"created": "Wed, 4 Mar 2015 21:46:30 GMT"
},
{
"version": "v7",
"created": "Sat, 6 Nov 2010 21:38:29 GMT"
},
{
"version": "v8",
"created": "Mon, 29 Nov 2010 15:58:31 GMT"
},
{
"version": "v9",
"created": "Mon, 6 Dec 2010 20:50:18 GMT"
}
] | 2015-03-26T00:00:00 |
[
[
"Hewitt",
"Carl",
""
]
] |
new_dataset
| 0.991908 |
1410.8566
|
Nikita Polyanskii
|
Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav
Shchukin
|
Almost Cover-Free Codes and Designs
|
18 pages, conference paper
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An $s$-subset of codewords of a binary code $X$ is said to be an {\em
$(s,\ell)$-bad} in $X$ if the code $X$ contains a subset of other $\ell$
codewords such that the conjunction of the $\ell$ codewords is covered by the
disjunctive sum of the $s$ codewords. Otherwise, the $s$-subset of codewords of
$X$ is said to be an {\em $(s,\ell)$-good} in~$X$.mA binary code $X$ is said to
be a cover-free $(s,\ell)$-code if the code $X$ does not contain $(s,\ell)$-bad
subsets. In this paper, we introduce a natural {\em probabilistic}
generalization of cover-free $(s,\ell)$-codes, namely: a binary code is said to
be an almost cover-free $(s,\ell)$-code if {\em almost all} $s$-subsets of its
codewords are $(s,\ell)$-good. We discuss the concept of almost cover-free
$(s,\ell)$-codes arising in combinatorial group testing problems connected with
the nonadaptive search of defective supersets (complexes). We develop a random
coding method based on the ensemble of binary constant weight codes to obtain
lower bounds on the capacity of such codes.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 21:30:42 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Nov 2014 19:20:19 GMT"
},
{
"version": "v3",
"created": "Mon, 15 Dec 2014 01:32:07 GMT"
},
{
"version": "v4",
"created": "Sun, 18 Jan 2015 01:19:56 GMT"
},
{
"version": "v5",
"created": "Wed, 25 Mar 2015 09:26:07 GMT"
}
] | 2015-03-26T00:00:00 |
[
[
"D'yachkov",
"Arkadii",
""
],
[
"Vorobyev",
"Ilya",
""
],
[
"Polyanskii",
"Nikita",
""
],
[
"Shchukin",
"Vladislav",
""
]
] |
new_dataset
| 0.991092 |
1503.01546
|
Yelena Mejova
|
Yelena Mejova, Hamed Haddadi, Anastasios Noulas, Ingmar Weber
|
#FoodPorn: Obesity Patterns in Culinary Interactions
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a large-scale analysis of Instagram pictures taken at 164,753
restaurants by millions of users. Motivated by the obesity epidemic in the
United States, our aim is three-fold: (i) to assess the relationship between
fast food and chain restaurants and obesity, (ii) to better understand people's
thoughts on and perceptions of their daily dining experiences, and (iii) to
reveal the nature of social reinforcement and approval in the context of
dietary health on social media. When we correlate the prominence of fast food
restaurants in US counties with obesity, we find the Foursquare data to show a
greater correlation at 0.424 than official survey data from the County Health
Rankings would show. Our analysis further reveals a relationship between small
businesses and local foods with better dietary health, with such restaurants
getting more attention in areas of lower obesity. However, even in such areas,
social approval favors the unhealthy foods high in sugar, with donut shops
producing the most liked photos. Thus, the dietary landscape our study reveals
is a complex ecosystem, with fast food playing a role alongside social
interactions and personal perceptions, which often may be at odds.
|
[
{
"version": "v1",
"created": "Thu, 5 Mar 2015 06:03:53 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Mar 2015 06:32:52 GMT"
},
{
"version": "v3",
"created": "Wed, 25 Mar 2015 11:59:33 GMT"
}
] | 2015-03-26T00:00:00 |
[
[
"Mejova",
"Yelena",
""
],
[
"Haddadi",
"Hamed",
""
],
[
"Noulas",
"Anastasios",
""
],
[
"Weber",
"Ingmar",
""
]
] |
new_dataset
| 0.99919 |
1503.07284
|
Sunil Kumar Kopparapu Dr
|
Arijit De and Sunil Kumar Kopparapu
|
A Rule-Based Short Query Intent Identification System
|
5 pages, 2010 International Conference on Signal and Image Processing
(ICSIP)
| null |
10.1109/ICSIP.2010.5697471
| null |
cs.IR cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using SMS (Short Message System), cell phones can be used to query for
information about various topics. In an SMS based search system, one of the key
problems is to identify a domain (broad topic) associated with the user query;
so that a more comprehensive search can be carried out by the domain specific
search engine. In this paper we use a rule based approach, to identify the
domain, called Short Query Intent Identification System (SQIIS). We construct
two different rule-bases using different strategies to suit query intent
identification. We evaluate the two rule-bases experimentally.
|
[
{
"version": "v1",
"created": "Wed, 25 Mar 2015 05:35:05 GMT"
}
] | 2015-03-26T00:00:00 |
[
[
"De",
"Arijit",
""
],
[
"Kopparapu",
"Sunil Kumar",
""
]
] |
new_dataset
| 0.976709 |
1107.0478
|
Noam Presman
|
Noam Presman, Ofer Shapira and Simon Litsyn
|
Polar Codes with Mixed-Kernels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A generalization of the polar coding scheme called mixed-kernels is
introduced. This generalization exploits several homogeneous kernels over
alphabets of different sizes. An asymptotic analysis of the proposed scheme
shows that its polarization properties are strongly related to the ones of the
constituent kernels. Simulation of finite length instances of the scheme
indicate their advantages both in error correction performance and complexity
compared to the known polar coding structures.
|
[
{
"version": "v1",
"created": "Sun, 3 Jul 2011 17:45:57 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Feb 2015 13:47:11 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Mar 2015 17:51:54 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Presman",
"Noam",
""
],
[
"Shapira",
"Ofer",
""
],
[
"Litsyn",
"Simon",
""
]
] |
new_dataset
| 0.996197 |
1204.1990
|
Martin Grohe
|
Martin Grohe and Martin Otto
|
Pebble Games and Linear Equations
| null | null | null | null |
cs.LO cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a new, simplified and detailed account of the correspondence between
levels of the Sherali-Adams relaxation of graph isomorphism and levels of
pebble-game equivalence with counting (higher-dimensional Weisfeiler-Lehman
colour refinement). The correspondence between basic colour refinement and
fractional isomorphism, due to Tinhofer (1986, 1991) and Ramana, Scheinerman
and Ullman (1994), is re-interpreted as the base level of Sherali-Adams and
generalised to higher levels in this sense by Atserias and Maneva (2012) and
Malkin (2014), who prove that the two resulting hierarchies interleave.
In carrying this analysis further, we here give
(a) a precise characterisation of the level-k Sherali-Adams relaxation in
terms of a modified counting pebble game;
(b) a variant of the Sherali-Adams levels that precisely match the k-pebble
counting game;
(c) a proof that the interleaving between these two hierarchies is strict.
We also investigate the variation based on boolean arithmetic instead of
real/rational arithmetic and obtain analogous correspondences and separations
for plain k-pebble equivalence (without counting). Our results are driven by
considerably simplified accounts of the underlying combinatorics and linear
algebra.
|
[
{
"version": "v1",
"created": "Mon, 9 Apr 2012 21:00:07 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Oct 2012 22:06:55 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Mar 2015 13:23:31 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Grohe",
"Martin",
""
],
[
"Otto",
"Martin",
""
]
] |
new_dataset
| 0.998819 |
1502.08040
|
Mayank Kumar
|
Mayank Kumar, Ashok Veeraraghavan, Ashutosh Sabharval
|
DistancePPG: Robust non-contact vital signs monitoring using a camera
|
24 pages, 11 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vital signs such as pulse rate and breathing rate are currently measured
using contact probes. But, non-contact methods for measuring vital signs are
desirable both in hospital settings (e.g. in NICU) and for ubiquitous in-situ
health tracking (e.g. on mobile phone and computers with webcams). Recently,
camera-based non-contact vital sign monitoring have been shown to be feasible.
However, camera-based vital sign monitoring is challenging for people with
darker skin tone, under low lighting conditions, and/or during movement of an
individual in front of the camera. In this paper, we propose distancePPG, a new
camera-based vital sign estimation algorithm which addresses these challenges.
DistancePPG proposes a new method of combining skin-color change signals from
different tracked regions of the face using a weighted average, where the
weights depend on the blood perfusion and incident light intensity in the
region, to improve the signal-to-noise ratio (SNR) of camera-based estimate.
One of our key contributions is a new automatic method for determining the
weights based only on the video recording of the subject. The gains in SNR of
camera-based PPG estimated using distancePPG translate into reduction of the
error in vital sign estimation, and thus expand the scope of camera-based vital
sign monitoring to potentially challenging scenarios. Further, a dataset will
be released, comprising of synchronized video recordings of face and pulse
oximeter based ground truth recordings from the earlobe for people with
different skin tones, under different lighting conditions and for various
motion scenarios.
|
[
{
"version": "v1",
"created": "Fri, 27 Feb 2015 20:03:06 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Mar 2015 02:31:18 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Kumar",
"Mayank",
""
],
[
"Veeraraghavan",
"Ashok",
""
],
[
"Sabharval",
"Ashutosh",
""
]
] |
new_dataset
| 0.999525 |
1503.03573
|
Peter Maceli
|
Maria Chudnovsky, Peter Maceli, and Mingxian Zhong
|
Three-coloring graphs with no induced seven-vertex path II : using a
triangle
|
26 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we give a polynomial time algorithm which determines if a
given graph containing a triangle and no induced seven-vertex path is
3-colorable, and gives an explicit coloring if one exists. In previous work, we
gave a polynomial time algorithm for three-coloring triangle-free graphs with
no induced seven-vertex path. Combined, our work shows that three-coloring a
graph with no induced seven-vertex path can be done in polynomial time.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 03:46:55 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Mar 2015 21:20:19 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Chudnovsky",
"Maria",
""
],
[
"Maceli",
"Peter",
""
],
[
"Zhong",
"Mingxian",
""
]
] |
new_dataset
| 0.998772 |
1503.06733
|
Mohammad Sadegh Rasooli
|
Mohammad Sadegh Rasooli, Joel Tetreault
|
Yara Parser: A Fast and Accurate Dependency Parser
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dependency parsers are among the most crucial tools in natural language
processing as they have many important applications in downstream tasks such as
information retrieval, machine translation and knowledge acquisition. We
introduce the Yara Parser, a fast and accurate open-source dependency parser
based on the arc-eager algorithm and beam search. It achieves an unlabeled
accuracy of 93.32 on the standard WSJ test set which ranks it among the top
dependency parsers. At its fastest, Yara can parse about 4000 sentences per
second when in greedy mode (1 beam). When optimizing for accuracy (using 64
beams and Brown cluster features), Yara can parse 45 sentences per second. The
parser can be trained on any syntactic dependency treebank and different
options are provided in order to make it more flexible and tunable for specific
tasks. It is released with the Apache version 2.0 license and can be used for
both commercial and academic purposes. The parser can be found at
https://github.com/yahoo/YaraParser.
|
[
{
"version": "v1",
"created": "Mon, 23 Mar 2015 17:20:54 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Mar 2015 18:45:13 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Rasooli",
"Mohammad Sadegh",
""
],
[
"Tetreault",
"Joel",
""
]
] |
new_dataset
| 0.963291 |
1503.06870
|
Isabel Kloumann
|
Isabel Kloumann, Lada Adamic, Jon Kleinberg, Shaomei Wu
|
The Lifecycles of Apps in a Social Ecosystem
|
11 pages, 10 figures, 3 tables, International World Wide Web
Conference
| null |
10.1145/2736277.2741684
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Apps are emerging as an important form of on-line content, and they combine
aspects of Web usage in interesting ways --- they exhibit a rich temporal
structure of user adoption and long-term engagement, and they exist in a
broader social ecosystem that helps drive these patterns of adoption and
engagement. It has been difficult, however, to study apps in their natural
setting since this requires a simultaneous analysis of a large set of popular
apps and the underlying social network they inhabit.
In this work we address this challenge through an analysis of the collection
of apps on Facebook Login, developing a novel framework for analyzing both
temporal and social properties. At the temporal level, we develop a retention
model that represents a user's tendency to return to an app using a very small
parameter set. At the social level, we organize the space of apps along two
fundamental axes --- popularity and sociality --- and we show how a user's
probability of adopting an app depends both on properties of the local network
structure and on the match between the user's attributes, his or her friends'
attributes, and the dominant attributes within the app's user population. We
also develop models that show the importance of different feature sets with
strong performance in predicting app success.
|
[
{
"version": "v1",
"created": "Mon, 23 Mar 2015 22:58:45 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Kloumann",
"Isabel",
""
],
[
"Adamic",
"Lada",
""
],
[
"Kleinberg",
"Jon",
""
],
[
"Wu",
"Shaomei",
""
]
] |
new_dataset
| 0.998507 |
1503.06970
|
Nieke Aerts
|
Nieke Aerts and Stefan Felsner
|
Straight Line Triangle Representations
|
An extended abstract of this paper was presented at GD2013
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A straight line triangle representation (SLTR) of a planar graph is a
straight line drawing such that all the faces including the outer face have
triangular shape. Such a drawing can be viewed as a tiling of a triangle using
triangles with the input graph as skeletal structure. In this paper we present
a characterization of graphs that have an SLTR. The characterization is based
on flat angle assignments, i.e., selections of angles of the graph that have
size~$\pi$ in the representation. We also provide a second characterization in
terms of contact systems of pseudosegments. With the aid of discrete harmonic
functions we show that contact systems of pseudosegments that respect certain
conditions are stretchable. The stretching procedure is then used to get
straight line triangle representations. Since the discrete harmonic function
approach is quite flexible it allows further applications, we mention some of
them. The drawback of the characterization of SLTRs is that we are not able to
effectively check whether a given graph admits a flat angle assignment that
fulfills the conditions. Hence it is still open to decide whether the
recognition of graphs that admit straight line triangle representation is
polynomially tractable.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2015 10:01:28 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Aerts",
"Nieke",
""
],
[
"Felsner",
"Stefan",
""
]
] |
new_dataset
| 0.999313 |
1503.06981
|
Dimitrios Christopoulos
|
Dimitrios Christopoulos, Shree Krishna Sharma, Symeon Chatzinotas,
Jens Krauseand Bjorn Ottersten
|
Coordinated Multibeam Satellite Co-location: The Dual Satellite Paradigm
|
Submitted to the IEEE wirless. Comms. Magazine
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the present article, a new system architecture for the next generation of
satellite communication (SatComs) is presented. The key concept lies in the
collaboration between multibeam satellites that share one orbital position.
Multi-satellite constellations in unique orbital slots offer gradual deployment
to cover unpredictable traffic patterns and redundancy to hardware failure
advantages. They are also of high relevance during the satellite replacement
phases or necessitated by constraints in the maximum communications payload
that a single satellite can bear. In this context, the potential gains of
advanced architectures, that is architectures enabled by the general class of
cooperative and cognitive techniques, are exhibited via a simple paradigm. More
specifically, the scenario presented herein, involves two co-existing multibeam
satellites which illuminate overlapping coverage areas. Based on this scenario,
specific types of cooperative and cognitive techniques are herein considered as
candidate technologies that can boost the performance of multibeam satellite
constellations. These techniques are compared to conventional frequency
splitting configurations in terms of three different criteria, namely the
spectral efficiency, the power efficiency and the fairness. Consequently,
insightful guidelines for the design of future high throughput constellations
of multibeam satellites are given.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2015 10:56:13 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Christopoulos",
"Dimitrios",
""
],
[
"Sharma",
"Shree Krishna",
""
],
[
"Chatzinotas",
"Symeon",
""
],
[
"Ottersten",
"Jens Krauseand Bjorn",
""
]
] |
new_dataset
| 0.998817 |
1503.07001
|
Eug\'enio Rodrigues
|
Eug\'enio Rodrigues, Ana Rita Amaral, Ad\'elio Rodrigues Gaspar,
\'Alvaro Gomes, Manuel Carlos Gameiro da Silva, Carlos Henggeler Antunes
|
GerAPlanO - A new building design tool: design generation, thermal
assessment and performance optimization
|
6 pages, 3 figures, Proceedings of Energy for Sustainability 2015
Conference: Sustainable Cities: Designing for People and the Planet, Coimbra,
14-15 May, 2015
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Building practitioners (architects, engineers, energy managers) are showing a
growing interest in the design of more energy efficient and livable buildings.
The best way to predict how a building will behave regarding energy consumption
and thermal comfort is to use a dynamic simulation tool. However, the use of
this kind of tools is difficult on a daily basis practice due to the heuristic
and exploratory nature of the architectural design process. To deal with this
difficulty, the University of Coimbra and three companies have been working on
the development of a prototype design aiding tool, specifically devoted to the
space planning phase of building design, under the project GerAPlanO (Automatic
Generation of Architecture Floor plans with Energy Optimization). This project
aims to combine the capabilities of design generation techniques, thermal
assessment programs, and design optimization methods to provide assistance to
decision makers. This paper presents the overall concept, as well as the
current status of development of this tool.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2015 12:12:43 GMT"
}
] | 2015-03-25T00:00:00 |
[
[
"Rodrigues",
"Eugénio",
""
],
[
"Amaral",
"Ana Rita",
""
],
[
"Gaspar",
"Adélio Rodrigues",
""
],
[
"Gomes",
"Álvaro",
""
],
[
"da Silva",
"Manuel Carlos Gameiro",
""
],
[
"Antunes",
"Carlos Henggeler",
""
]
] |
new_dataset
| 0.953409 |
1308.4568
|
Cem Tekin
|
Cem Tekin and Mihaela van der Schaar
|
Distributed Online Learning via Cooperative Contextual Bandits
| null | null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a novel framework for decentralized, online learning
by many learners. At each moment of time, an instance characterized by a
certain context may arrive to each learner; based on the context, the learner
can select one of its own actions (which gives a reward and provides
information) or request assistance from another learner. In the latter case,
the requester pays a cost and receives the reward but the provider learns the
information. In our framework, learners are modeled as cooperative contextual
bandits. Each learner seeks to maximize the expected reward from its arrivals,
which involves trading off the reward received from its own actions, the
information learned from its own actions, the reward received from the actions
requested of others and the cost paid for these actions - taking into account
what it has learned about the value of assistance from each other learner. We
develop distributed online learning algorithms and provide analytic bounds to
compare the efficiency of these with algorithms with the complete knowledge
(oracle) benchmark (in which the expected reward of every action in every
context is known by every learner). Our estimates show that regret - the loss
incurred by the algorithm - is sublinear in time. Our theoretical framework can
be used in many practical applications including Big Data mining, event
detection in surveillance sensor networks and distributed online recommendation
systems.
|
[
{
"version": "v1",
"created": "Wed, 21 Aug 2013 13:28:43 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Aug 2013 14:19:28 GMT"
},
{
"version": "v3",
"created": "Sat, 19 Apr 2014 09:40:06 GMT"
},
{
"version": "v4",
"created": "Mon, 23 Mar 2015 14:06:27 GMT"
}
] | 2015-03-24T00:00:00 |
[
[
"Tekin",
"Cem",
""
],
[
"van der Schaar",
"Mihaela",
""
]
] |
new_dataset
| 0.979791 |
1503.06499
|
Luca Rossi
|
Luca Rossi, Matthew J. Williams, Christoph Stich, Mirco Musolesi
|
Privacy and the City: User Identification and Location Semantics in
Location-Based Social Networks
|
In Proceedings of 9th AAAI International Conference on Weblogs and
Social Media (ICWSM 2015)
| null | null | null |
cs.CR cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of GPS enabled smartphones, an increasing number of users is
actively sharing their location through a variety of applications and services.
Along with the continuing growth of Location-Based Social Networks (LBSNs),
security experts have increasingly warned the public of the dangers of exposing
sensitive information such as personal location data. Most importantly, in
addition to the geographical coordinates of the user's location, LBSNs allow
easy access to an additional set of characteristics of that location, such as
the venue type or popularity.
In this paper, we investigate the role of location semantics in the
identification of LBSN users. We simulate a scenario in which the attacker's
goal is to reveal the identity of a set of LBSN users by observing their
check-in activity. We then propose to answer the following question: what are
the types of venues that a malicious user has to monitor to maximize the
probability of success? Conversely, when should a user decide whether to make
his/her check-in to a location public or not? We perform our study on more than
1 million check-ins distributed over 17 urban regions of the United States. Our
analysis shows that different types of venues display different discriminative
power in terms of user identity, with most of the venues in the "Residence"
category providing the highest re-identification success across the urban
regions. Interestingly, we also find that users with a high entropy of their
check-ins distribution are not necessarily the hardest to identify, suggesting
that it is the collective behaviour of the users' population that determines
the complexity of the identification task, rather than the individual
behaviour.
|
[
{
"version": "v1",
"created": "Sun, 22 Mar 2015 23:42:25 GMT"
}
] | 2015-03-24T00:00:00 |
[
[
"Rossi",
"Luca",
""
],
[
"Williams",
"Matthew J.",
""
],
[
"Stich",
"Christoph",
""
],
[
"Musolesi",
"Mirco",
""
]
] |
new_dataset
| 0.969492 |
1503.06532
|
Kamran Karimi
|
Kamran Karimi
|
The Feasibility of Using OpenCL Instead of OpenMP for Parallel CPU
Programming
|
8 pages, 4 figures, 2 tables
| null | null | null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
OpenCL, along with CUDA, is one of the main tools used to program GPGPUs.
However, it allows running the same code on multi-core CPUs too, making it a
rival for the long-established OpenMP. In this paper we compare OpenCL and
OpenMP when developing and running compute-heavy code on a CPU. Both ease of
programming and performance aspects are considered. Since, unlike a GPU, no
memory copy operation is involved, our comparisons measure the code generation
quality, as well as thread management efficiency of OpenCL and OpenMP. We
evaluate the performance of these development tools under two conditions: a
large number of short-running compute-heavy parallel code executions, when more
thread management is performed, and a small number of long-running parallel
code executions, when less thread management is required. The results show that
OpenCL and OpenMP each win in one of the two conditions. We argue that while
using OpenMP requires less setup, OpenCL can be a viable substitute for OpenMP
from a performance point of view, especially when a high number of thread
invocations is required. We also provide a number of potential pitfalls to
watch for when moving from OpenMP to OpenCL.
|
[
{
"version": "v1",
"created": "Mon, 23 Mar 2015 05:15:00 GMT"
}
] | 2015-03-24T00:00:00 |
[
[
"Karimi",
"Kamran",
""
]
] |
new_dataset
| 0.997858 |
1503.06548
|
Debajyoti Mukhopadhyay Prof.
|
Sumitkumar Kanoje, Varsha Powar, Debajyoti Mukhopadhyay
|
Using MongoDB for Social Networking Website
|
3 pages, 2 figures
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media is a biggest successful buzzword used in the recent time. Its
success opened various opportunities for the developers. Developing any
application requires storage of large data into databases. Many databases are
available for the developers, Choosing the right one make development easier.
MongoDB is a cross platform document oriented, schema-less database eschewed
the traditional table based relational database structure in favor of JSON like
documents. This article discusses various pros and cons encountered with the
use of the MongoDB so that developers would be helped while choosing it wisely.
|
[
{
"version": "v1",
"created": "Mon, 23 Mar 2015 08:15:46 GMT"
}
] | 2015-03-24T00:00:00 |
[
[
"Kanoje",
"Sumitkumar",
""
],
[
"Powar",
"Varsha",
""
],
[
"Mukhopadhyay",
"Debajyoti",
""
]
] |
new_dataset
| 0.989502 |
1503.06643
|
Mrinal Haloi
|
Mrinal Haloi
|
A novel pLSA based Traffic Signs Classification System
|
APMediaCast-2015, Bali, Indonesia
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we developed a novel and fast traffic sign recognition system, a
very important part for advanced driver assistance system and for autonomous
driving. Traffic signs play a very vital role in safe driving and avoiding
accident. We have used image processing and topic discovery model pLSA to
tackle this challenging multiclass classification problem. Our algorithm is
consist of two parts, shape classification and sign classification for improved
accuracy. For processing and representation of image we have used bag of
features model with SIFT local descriptor. Where a visual vocabulary of size
300 words are formed using k-means codebook formation algorithm. We exploited
the concept that every image is a collection of visual topics and images having
same topics will belong to same category. Our algorithm is tested on German
traffic sign recognition benchmark (GTSRB) and gives very promising result near
to existing state of the art techniques.
|
[
{
"version": "v1",
"created": "Mon, 23 Mar 2015 14:10:44 GMT"
}
] | 2015-03-24T00:00:00 |
[
[
"Haloi",
"Mrinal",
""
]
] |
new_dataset
| 0.999677 |
1503.06072
|
Jules Hedges
|
Jules Hedges
|
String diagrams for game theory
| null | null | null | null |
cs.GT cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a monoidal category whose morphisms are games (in the
sense of game theory, not game semantics) and an associated diagrammatic
language. The two basic operations of a monoidal category, namely categorical
composition and tensor product, correspond roughly to sequential and
simultaneous composition of games. This leads to a compositional theory in
which we can reason about properties of games in terms of corresponding
properties of the component parts. In particular, we give a definition of Nash
equilibrium which is recursive on the causal structure of the game.
The key technical idea in this paper is the use of continuation passing style
for reasoning about the future consequences of players' choices, closely based
on applications of selection functions in game theory. Additionally, the clean
categorical foundation gives many opportunities for generalisation, for example
to learning agents.
|
[
{
"version": "v1",
"created": "Fri, 20 Mar 2015 13:50:05 GMT"
}
] | 2015-03-23T00:00:00 |
[
[
"Hedges",
"Jules",
""
]
] |
new_dataset
| 0.998268 |
1503.06081
|
Francesco Dolce
|
Francesco Dolce and Dominique Perrin
|
Enumeration formul{\ae} in neutral sets
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present several enumeration results holding in sets of words called
neutral and which satisfy restrictive conditions on the set of possible
extensions of nonempty words. These formulae concern return words and bifix
codes. They generalize formulae previously known for Sturmian sets or more
generally for tree sets. We also give a geometric example of this class of
sets, namely the natural coding of some interval exchange transformations.
|
[
{
"version": "v1",
"created": "Fri, 20 Mar 2015 14:12:33 GMT"
}
] | 2015-03-23T00:00:00 |
[
[
"Dolce",
"Francesco",
""
],
[
"Perrin",
"Dominique",
""
]
] |
new_dataset
| 0.998588 |
1503.06095
|
Amy Felty
|
Amy P. Felty, Alberto Momigliano and Brigitte Pientka
|
The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract
Syntax Representations: Part 1-A Common Infrastructure for Benchmarks
|
42 pages, 5 figures
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A variety of logical frameworks support the use of higher-order abstract
syntax (HOAS) in representing formal systems. Although these systems seem
superficially the same, they differ in a variety of ways; for example, how they
handle a context of assumptions and which theorems about a given formal system
can be concisely expressed and proved. Our contributions in this paper are
three-fold: 1) we develop a common infrastructure for representing benchmarks
for systems supporting reasoning with binders, 2) we present several concrete
benchmarks, which highlight a variety of different aspects of reasoning within
a context of assumptions, and 3) we design an open repository ORBI, (Open
challenge problem Repository for systems supporting reasoning with BInders).
Our work sets the stage for providing a basis for qualitative comparison of
different systems. This allows us to review and survey the state of the art,
which we do in great detail for four systems in Part 2 of this paper (Felty et
al, 2015). It also allows us to outline future fundamental research questions
regarding the design and implementation of meta-reasoning systems.
|
[
{
"version": "v1",
"created": "Fri, 20 Mar 2015 14:54:15 GMT"
}
] | 2015-03-23T00:00:00 |
[
[
"Felty",
"Amy P.",
""
],
[
"Momigliano",
"Alberto",
""
],
[
"Pientka",
"Brigitte",
""
]
] |
new_dataset
| 0.990295 |
1201.1661
|
Giang Nguyen
|
Giang T. K. Nguyen, Rachit Agarwal, Junda Liu, Matthew Caesar, P.
Brighten Godfrey, Scott Shenker
|
Slick Packets
|
This is the full version of a paper with the same title that appeared
in ACM SIGMETRICS 2011, with the inclusion of the appendix. 16 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Source-controlled routing has been proposed as a way to improve flexibility
of future network architectures, as well as simplifying the data plane.
However, if a packet specifies its path, this precludes fast local re-routing
within the network. We propose SlickPackets, a novel solution that allows
packets to slip around failures by specifying alternate paths in their headers,
in the form of compactly-encoded directed acyclic graphs. We show that this can
be accomplished with reasonably small packet headers for real network
topologies, and results in responsiveness to failures that is competitive with
past approaches that require much more state within the network. Our approach
thus enables fast failure response while preserving the benefits of
source-controlled routing.
|
[
{
"version": "v1",
"created": "Sun, 8 Jan 2012 22:21:15 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Nguyen",
"Giang T. K.",
""
],
[
"Agarwal",
"Rachit",
""
],
[
"Liu",
"Junda",
""
],
[
"Caesar",
"Matthew",
""
],
[
"Godfrey",
"P. Brighten",
""
],
[
"Shenker",
"Scott",
""
]
] |
new_dataset
| 0.998099 |
1201.1671
|
Taufik Abrao
|
D\'ecio L. Gazzoni Filho, Taufik Abr\~ao, Marcelo C. Tosin, Francisco
Granziera Jr
|
Error-Correcting Codes for Reliable Communications in Microgravity
Platforms
|
13 pages, 3 figures, paper accepted to be published in International
Journal of Satellite Communications Policy and Management (IJSCPM) ISSN
(Online): 1742-7576 - ISSN (Print): 1742-7568
| null | null | null |
cs.IT cs.SY math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The PAANDA experiment was conceived to characterize the acceleration ambient
of a rocket launched microgravity platform, specially the microgravity phase.
The recorded data was transmitted to ground stations, leading to loss of
telemetry information sent during the reentry period. Traditionally, an
error-correcting code for this channel consists of a block code with very large
block size to protect against long periods of data loss. Instead, we propose
the use of digital fountain codes along with conventional Reed-Solomon block
codes to protect against long and short burst error periods, respectively.
Aiming to use this approach for a second version of PAANDA to prevent data
corruption, we propose a model for the communication channel based on
information extracted from Cum\~a II's telemetry data, and simulate the
performance of our proposed error-correcting code under this channel model.
Simulation results show that nearly all telemetry data can be recovered,
including data from the reentry period.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2012 00:28:23 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Filho",
"Décio L. Gazzoni",
""
],
[
"Abrão",
"Taufik",
""
],
[
"Tosin",
"Marcelo C.",
""
],
[
"Granziera",
"Francisco",
"Jr"
]
] |
new_dataset
| 0.995982 |
1201.3073
|
Sylvain Martin
|
Sylvain Martin, Laurent Chiarello, Guy Leduc
|
DISco: a Distributed Information Store for network Challenges and their
Outcome
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present DISco, a storage and communication middleware designed to enable
distributed and task-centric autonomic control of networks.
DISco is designed to enable multi-agent identification of anomalous
situations -- so-called "challenges" -- and assist coordinated remediation that
maintains degraded -- but acceptable -- service level, while keeping a track of
the challenge evolution in order to enable human-assisted diagnosis of flaws in
the network. We propose to use state-of-art peer-to-peer publish/subscribe and
distributed storage as core building blocks for the DISco service.
|
[
{
"version": "v1",
"created": "Sun, 15 Jan 2012 09:37:08 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Martin",
"Sylvain",
""
],
[
"Chiarello",
"Laurent",
""
],
[
"Leduc",
"Guy",
""
]
] |
new_dataset
| 0.999225 |
1202.0859
|
Fan Cheng
|
Fan Cheng, Raymond W. Yeung, and Kenneth W. Shum
|
Imperfect Secrecy in Wiretap Channel II
|
Submitted to the IEEE Transactions on Information Theory
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a point-to-point communication system which consists of a sender, a
receiver and a set of noiseless channels, the sender wishes to transmit a
private message to the receiver through the channels which may be eavesdropped
by a wiretapper. The set of wiretap sets is arbitrary. The wiretapper can
access any one but not more than one wiretap set. From each wiretap set, the
wiretapper can obtain some partial information about the private message which
is measured by the equivocation of the message given the symbols obtained by
the wiretapper. The security strategy is to encode the message with some random
key at the sender. Only the message is required to be recovered at the
receiver. Under this setting, we define an achievable rate tuple consisting of
the size of the message, the size of the key, and the equivocation for each
wiretap set. We first prove a tight rate region when both the message and the
key are required to be recovered at the receiver. Then we extend the result to
the general case when only the message is required to be recovered at the
receiver. Moreover, we show that even if stochastic encoding is employed at the
sender, the message rate cannot be increased.
|
[
{
"version": "v1",
"created": "Sat, 4 Feb 2012 02:11:46 GMT"
},
{
"version": "v2",
"created": "Sat, 1 Dec 2012 11:58:00 GMT"
},
{
"version": "v3",
"created": "Sun, 12 Oct 2014 06:14:01 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Cheng",
"Fan",
""
],
[
"Yeung",
"Raymond W.",
""
],
[
"Shum",
"Kenneth W.",
""
]
] |
new_dataset
| 0.974052 |
1202.5012
|
Matthew Patitz
|
Jennifer E. Padilla and Matthew J. Patitz and Raul Pena and Robert T.
Schweller and Nadrian C. Seeman and Robert Sheline and Scott M. Summers and
Xingsi Zhong
|
Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient
Computation and Efficient Assembly of Shapes
|
This version contains the appendices omitted from the version
appearing in the UCNC 2013 proceedings
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we demonstrate the power of a model of tile self-assembly based
on active glues which can dynamically change state. We formulate the
Signal-passing Tile Assembly Model (STAM), based on the model of Padilla, Liu,
and Seeman to be asynchronous, allowing any action of turning a glue on or off,
attaching a new tile, or breaking apart an assembly to happen in any order.
Within this highly generalized model we provide three new solutions to tile
self-assembly problems that have been addressed within the abstract Tile
Assembly Model and its variants, showing that signal passing tiles allow for
substantial improvement across multiple complexity metrics. Our first result
utilizes a recursive assembly process to achieve tile-type efficient assembly
of linear structures, using provably fewer tile types than what is possible in
standard tile assembly models. Our second system of signal-passing tiles
simulates any Turing machine with high fuel efficiency by using only a constant
number of tiles per computation step. Our third system assembles the discrete
Sierpinski triangle, demonstrating that this pattern can be strictly
self-assembled within the STAM. This result is of particular interest in that
it is known that this pattern cannot self-assemble within a number of well
studied tile self-assembly models. Notably, all of our constructions are at
temperature 1, further demonstrating that signal-passing confers the power to
bypass many restrictions found in standard tile assembly models.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2012 19:16:38 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Oct 2012 06:18:58 GMT"
},
{
"version": "v3",
"created": "Thu, 14 Nov 2013 01:15:06 GMT"
}
] | 2015-03-20T00:00:00 |
[
[
"Padilla",
"Jennifer E.",
""
],
[
"Patitz",
"Matthew J.",
""
],
[
"Pena",
"Raul",
""
],
[
"Schweller",
"Robert T.",
""
],
[
"Seeman",
"Nadrian C.",
""
],
[
"Sheline",
"Robert",
""
],
[
"Summers",
"Scott M.",
""
],
[
"Zhong",
"Xingsi",
""
]
] |
new_dataset
| 0.991164 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.