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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1508.04515
|
Wei Zhang
|
Wei Zhang, Judith Gelernter
|
Exploring Metaphorical Senses and Word Representations for Identifying
Metonyms
|
9 pages, 8 pages content
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A metonym is a word with a figurative meaning, similar to a metaphor. Because
metonyms are closely related to metaphors, we apply features that are used
successfully for metaphor recognition to the task of detecting metonyms. On the
ACL SemEval 2007 Task 8 data with gold standard metonym annotations, our system
achieved 86.45% accuracy on the location metonyms. Our code can be found on
GitHub.
|
[
{
"version": "v1",
"created": "Wed, 19 Aug 2015 03:26:05 GMT"
}
] | 2015-08-20T00:00:00 |
[
[
"Zhang",
"Wei",
""
],
[
"Gelernter",
"Judith",
""
]
] |
new_dataset
| 0.997076 |
1508.04586
|
Veronica Vilaplana
|
Ver\'onica Vilaplana
|
Saliency maps on image hierarchies
|
Accepted for publication in Signal Processing: Image Communications,
2015
| null |
10.1016/j.image.2015.07.012
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose two saliency models for salient object segmentation
based on a hierarchical image segmentation, a tree-like structure that
represents regions at different scales from the details to the whole image
(e.g. gPb-UCM, BPT). The first model is based on a hierarchy of image
partitions. The saliency at each level is computed on a region basis, taking
into account the contrast between regions. The maps obtained for the different
partitions are then integrated into a final saliency map. The second model
directly works on the structure created by the segmentation algorithm,
computing saliency at each node and integrating these cues in a straightforward
manner into a single saliency map. We show that the proposed models produce
high quality saliency maps. Objective evaluation demonstrates that the two
methods achieve state-of-the-art performance in several benchmark datasets.
|
[
{
"version": "v1",
"created": "Wed, 19 Aug 2015 10:07:07 GMT"
}
] | 2015-08-20T00:00:00 |
[
[
"Vilaplana",
"Verónica",
""
]
] |
new_dataset
| 0.987556 |
1508.04753
|
Gerhard Dueck
|
Kim T. Briggs, Baoguo Zhou, Gerhard W. Dueck
|
Cold Object Identification in the Java Virtual Machine
|
For submission to `Software: Practice and Experience'
| null | null | null |
cs.PL cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many Java applications instantiate objects within the Java heap that are
persistent but seldom if ever referenced by the application. Examples include
strings, such as error messages, and collections of value objects that are
preloaded for fast access but they may include objects that are seldom
referenced. This paper describes a stack-based framework for detecting these
"cold" objects at runtime, with a view to marshaling and sequestering them in
designated regions of the heap where they may be preferentially paged out to a
backing store, thereby freeing physical memory pages for occupation by more
active objects. Furthermore, we evaluate the correctness and efficiency of
stack-based approach with an Access Barrier. The experimental results from a
series of SPECjvm2008 benchmarks are presented.
|
[
{
"version": "v1",
"created": "Tue, 18 Aug 2015 19:50:17 GMT"
}
] | 2015-08-20T00:00:00 |
[
[
"Briggs",
"Kim T.",
""
],
[
"Zhou",
"Baoguo",
""
],
[
"Dueck",
"Gerhard W.",
""
]
] |
new_dataset
| 0.967678 |
1405.1359
|
Michael Kai Petersen
|
Michael Kai Petersen
|
Latent semantics of action verbs reflect phonetic parameters of
intensity and emotional content
|
15 pages
| null |
10.1371/journal.pone.0121575
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conjuring up our thoughts, language reflects statistical patterns of word
co-occurrences which in turn come to describe how we perceive the world.
Whether counting how frequently nouns and verbs combine in Google search
queries, or extracting eigenvectors from term document matrices made up of
Wikipedia lines and Shakespeare plots, the resulting latent semantics capture
not only the associative links which form concepts, but also spatial dimensions
embedded within the surface structure of language. As both the shape and
movements of objects have been found to be associated with phonetic contrasts
already in toddlers, this study explores whether articulatory and acoustic
parameters may likewise differentiate the latent semantics of action verbs.
Selecting 3 x 20 emotion, face, and hand related verbs known to activate
premotor areas in the brain, their mutual cosine similarities were computed
using latent semantic analysis LSA, and the resulting adjacency matrices were
compared based on two different large scale text corpora; HAWIK and TASA.
Applying hierarchical clustering to identify common structures across the two
text corpora, the verbs largely divide into combined mouth and hand movements
versus emotional expressions. Transforming the verbs into their constituent
phonemes, the clustered small and large size movements appear differentiated by
front versus back vowels corresponding to increasing levels of arousal. Whereas
the clustered emotional verbs seem characterized by sequences of close versus
open jaw produced phonemes, generating up- or downwards shifts in formant
frequencies that may influence their perceived valence. Suggesting, that the
latent semantics of action verbs reflect parameters of intensity and emotional
polarity that appear correlated with the articulatory contrasts and acoustic
characteristics of phonemes
|
[
{
"version": "v1",
"created": "Tue, 6 May 2014 16:52:34 GMT"
},
{
"version": "v2",
"created": "Sun, 31 Aug 2014 14:21:10 GMT"
},
{
"version": "v3",
"created": "Sat, 29 Nov 2014 21:14:29 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Petersen",
"Michael Kai",
""
]
] |
new_dataset
| 0.95209 |
1409.0926
|
Yaar Solomon
|
David Simmons and Yaar Solomon
|
A Danzer set for Axis Parallel Boxes
| null | null | null | null |
cs.CG cs.DM math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present concrete constructions of discrete sets in $\mathbb{R}^d$ ($d\ge
2$) that intersect every aligned box of volume $1$ in $\mathbb{R}^d$, and which
have optimal growth rate $O(T^d)$.
|
[
{
"version": "v1",
"created": "Wed, 3 Sep 2014 00:06:34 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jan 2015 17:54:44 GMT"
},
{
"version": "v3",
"created": "Tue, 18 Aug 2015 14:41:44 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Simmons",
"David",
""
],
[
"Solomon",
"Yaar",
""
]
] |
new_dataset
| 0.999268 |
1411.0001
|
Abhijit Chandra
|
Abhijit Chandra, Oliva Kar, Kuan-Chuen Wu, Michelle Hall and Jason
Gillette
|
Prognosis of Anterior Cruciate Ligament (ACL) Reconstruction: A Data
Driven Approach
|
arXiv admin note: substantial text overlap with arXiv:1410.8616
| null |
10.1098/rspa.2014.0526
| null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Individuals who suffer anterior cruciate ligament (ACL) injury are at higher
risk of developing knee osteoarthritis (OA) and almost 50% display symptoms 10
to 20 years post injury. Anterior cruciate ligament reconstruction (ACLR) often
does not protect against knee OA development. Accordingly, a multiscale
formulation for Data Driven Prognosis (DDP) of post ACLR is developed. Unlike
traditional predictive strategies that require controlled off-line measurements
or training for determination of constitutive parameters to derive the
transitional statistics, the proposed DDP algorithm relies solely on in situ
measurements. The proposed DDP scheme is capable of predicting onset of
instabilities. Since the need for off line testing (or training) is obviated,
it can be easily implemented for ACLR, where such controlled a priori testing
is almost impossible to conduct. The DDP algorithm facilitates hierarchical
handling of the large data set, and can assess the state of recovery in post
ACLR conditions based on data collected from stair ascent and descent exercises
of subjects. The DDP algorithm identifies inefficient knee varus motion and
knee rotation as primary difficulties experienced by some of the post ACLR
population. In such cases, levels of energy dissipation rate at the knee, and
its fluctuation may be used as measures for assessing progress after ACL
reconstruction.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 22:54:07 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Chandra",
"Abhijit",
""
],
[
"Kar",
"Oliva",
""
],
[
"Wu",
"Kuan-Chuen",
""
],
[
"Hall",
"Michelle",
""
],
[
"Gillette",
"Jason",
""
]
] |
new_dataset
| 0.995308 |
1502.03182
|
Yan Michalevsky
|
Yan Michalevsky, Gabi Nakibly, Aaron Schulman, Gunaa Arumugam
Veerapandian and Dan Boneh
|
PowerSpy: Location Tracking using Mobile Device Power Analysis
|
Usenix Security 2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern mobile platforms like Android enable applications to read aggregate
power usage on the phone. This information is considered harmless and reading
it requires no user permission or notification. We show that by simply reading
the phone's aggregate power consumption over a period of a few minutes an
application can learn information about the user's location. Aggregate phone
power consumption data is extremely noisy due to the multitude of components
and applications that simultaneously consume power. Nevertheless, by using
machine learning algorithms we are able to successfully infer the phone's
location. We discuss several ways in which this privacy leak can be remedied.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 02:46:50 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Feb 2015 22:17:04 GMT"
},
{
"version": "v3",
"created": "Sat, 15 Aug 2015 07:50:24 GMT"
},
{
"version": "v4",
"created": "Tue, 18 Aug 2015 01:02:34 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Michalevsky",
"Yan",
""
],
[
"Nakibly",
"Gabi",
""
],
[
"Schulman",
"Aaron",
""
],
[
"Veerapandian",
"Gunaa Arumugam",
""
],
[
"Boneh",
"Dan",
""
]
] |
new_dataset
| 0.986219 |
1505.06494
|
Serap Savari
|
Narendra Chaudhary, Yao Luo, Serap A. Savari, and Roger McCay
|
Lossless Layout Image Compression Algorithms for Electron-Beam
Direct-Write Lithography
|
This is the source file for the paper which was published in the
Journal of Vacuum Science & Technology B (volume 33, 06FD01) on 5 August 2015
|
Journal of Vacuum Science & Technology B (Vol.33, Issue 6), 06FD01
(2015)
|
10.1116/1.4927639
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Electron-beam direct-write (EBDW) lithography systems must in the future
transmit terabits of information per second to be viable for commercial
semiconductor manufacturing. Lossless layout image compression algorithms with
high decoding throughputs and modest decoding resources are tools to address
the data transfer portion of the throughput problem. The earlier lossless
layout image compression algorithm Corner2 is designed for binary layout images
on raster-scanning systems. We propose variations of Corner2 collectively
called Corner2-EPC and Paeth-EPC which apply to electron-beam proximity
corrected layout images and offer interesting trade-offs between compression
ratios and decoding speeds. Most of our algorithms achieve better overall
compression performance than PNG, Block C4 and LineDiffEntropy while having low
decoding times and resources.
|
[
{
"version": "v1",
"created": "Sun, 24 May 2015 22:48:00 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Aug 2015 15:40:19 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Chaudhary",
"Narendra",
""
],
[
"Luo",
"Yao",
""
],
[
"Savari",
"Serap A.",
""
],
[
"McCay",
"Roger",
""
]
] |
new_dataset
| 0.991321 |
1506.01792
|
Philipp Sommer
|
Philipp Sommer, Branislav Kusy, Philip Valencia, Ross Dungavell, Raja
Jurdak
|
Delay-Tolerant Networking for Long-Term Animal Tracking
|
14 pages, 5 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Enabling Internet connectivity for mobile objects that do not have a
permanent home or regular movements is a challenge due to their varying energy
budget, intermittent wireless connectivity, and inaccessibility. We present a
hardware and software framework that offers robust data collection, adaptive
execution of sensing tasks, and flexible remote reconfiguration of devices
deployed on nomadic mobile objects such as animals. The framework addresses the
overall complexity through a multi-tier architecture with low tier devices
operating on a tight energy harvesting budget and high tier cloud services
offering seamless delay-tolerant presentation of data to end users. Based on
our multi-year experience of applying this framework to animal tracking and
monitoring applications, we present the main challenges that we have
encountered, the design of software building blocks that address these
challenges, and examples of the data we collected on flying foxes.
|
[
{
"version": "v1",
"created": "Fri, 5 Jun 2015 06:37:23 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Aug 2015 19:31:46 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Sommer",
"Philipp",
""
],
[
"Kusy",
"Branislav",
""
],
[
"Valencia",
"Philip",
""
],
[
"Dungavell",
"Ross",
""
],
[
"Jurdak",
"Raja",
""
]
] |
new_dataset
| 0.97734 |
1507.08094
|
Sebastian E. Schmittner
|
Sebastian E. Schmittner
|
A SAT-based Public Key Cryptography Scheme
|
7 pages + appendix, 1 figure + 6 in appendix
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A homomorphic public key crypto-scheme based on the Boolean Satisfiability
Problem is proposed. The public key is a SAT formula satisfied by the private
key. Probabilistic encryption generates functions implied to be false by the
public key XOR the message bits. A zero-knowledge proof is used to provide
signatures.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2015 10:24:59 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Aug 2015 18:36:36 GMT"
},
{
"version": "v3",
"created": "Tue, 18 Aug 2015 08:55:28 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Schmittner",
"Sebastian E.",
""
]
] |
new_dataset
| 0.998183 |
1508.04234
|
Amitabh Trehan
|
Armando Castaneda, Danny Dolev and Amitabh Trehan
|
Compact Routing Messages in Self-Healing Trees
|
Under Submission
| null | null | null |
cs.DC cs.DS cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and
Chechik [PODC 2013], often have no means to tolerate failures, once the system
has been setup and started. This paper presents, to our knowledge, the first
self-healing compact routing scheme. Besides, our schemes are developed for low
memory nodes, i.e., nodes need only $O(\log^2 n)$ memory, and are thus, compact
schemes.
We introduce two algorithms of independent interest: The first is CompactFT,
a novel compact version (using only $O(\log n)$ local memory) of the
self-healing algorithm Forgiving Tree of Hayes et al. [PODC 2008]. The second
algorithm (CompactFTZ) combines CompactFT with Thorup-Zwick's tree-based
compact routing scheme [SPAA 2001] to produce a fully compact self-healing
routing scheme. In the self-healing model, the adversary deletes nodes one at a
time with the affected nodes self-healing locally by adding few edges.
CompactFT recovers from each attack in only $O(1)$ time and $\Delta$ messages,
with only +3 degree increase and $O(log \Delta)$ graph diameter increase, over
any sequence of deletions ($\Delta$ is the initial maximum degree).
Additionally, CompactFTZ guarantees delivery of a packet sent from sender s
as long as the receiver t has not been deleted, with only an additional $O(y
\log \Delta)$ latency, where $y$ is the number of nodes that have been deleted
on the path between $s$ and $t$. If $t$ has been deleted, $s$ gets informed and
the packet removed from the network.
|
[
{
"version": "v1",
"created": "Tue, 18 Aug 2015 07:47:55 GMT"
}
] | 2015-08-19T00:00:00 |
[
[
"Castaneda",
"Armando",
""
],
[
"Dolev",
"Danny",
""
],
[
"Trehan",
"Amitabh",
""
]
] |
new_dataset
| 0.999255 |
1210.1935
|
Chung-Chieh Fang
|
Chung-Chieh Fang
|
Saddle-Node Bifurcation Associated with Parasitic Inductor Resistance in
Boost Converters
|
Minor revision from a manuscript dated in 2010
|
Some parts of this manuscript are published in International
Journal of Electronics, 100(8), pp. 1147-1174, Aug. 2013
|
10.1080/00207217.2012.743072
| null |
cs.SY math.DS nlin.CD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Saddle-node bifurcation occurs in a boost converter when parasitic inductor
resistance is modeled. Closed-form critical conditions of the bifurcation are
derived. If the parasitic inductor resistance is modeled, the saddle-node
bifurcation occurs in the voltage mode control or in the current mode control
with the voltage loop closed, but not in the current mode control with the
voltage loop open. If the parasitic inductor resistance is not modeled, the
saddle-node bifurcation does not occur, and one may be misled by the wrong
dynamics and the wrong steady-state solutions. The saddle-node bifurcation
still exists even in a boost converter with a popular type-III compensator.
When the saddle-node bifurcation occurs, multiple steady-state solutions may
coexist. The converter may operate with a voltage jump from one solution to
another. Care should be taken in the compensator design to ensure that only the
desired solution is stabilized. In industry practice, the solution with a
higher duty cycle (and thus the saddle-node bifurcation) may be prevented by
placing a limitation on the maximum duty cycle.
|
[
{
"version": "v1",
"created": "Sat, 6 Oct 2012 08:56:46 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Fang",
"Chung-Chieh",
""
]
] |
new_dataset
| 0.99935 |
1407.6954
|
Robert Kl\"ofkorn
|
Martin Alk\"amper, Andreas Dedner, Robert Kl\"ofkorn, and Martin Nolte
|
The DUNE-ALUGrid Module
|
25 pages, 11 figures
| null | null | null |
cs.MS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the new DUNE-ALUGrid module. This module contains a
major overhaul of the sources from the ALUgrid library and the binding to the
DUNE software framework. The main changes include user defined load balancing,
parallel grid construction, and an redesign of the 2d grid which can now also
be used for parallel computations. In addition many improvements have been
introduced into the code to increase the parallel efficiency and to decrease
the memory footprint.
The original ALUGrid library is widely used within the DUNE community due to
its good parallel performance for problems requiring local adaptivity and
dynamic load balancing. Therefore, this new model will benefit a number of DUNE
users. In addition we have added features to increase the range of problems for
which the grid manager can be used, for example, introducing a 3d tetrahedral
grid using a parallel newest vertex bisection algorithm for conforming grid
refinement. In this paper we will discuss the new features, extensions to the
DUNE interface, and explain for various examples how the code is used in
parallel environments.
|
[
{
"version": "v1",
"created": "Fri, 25 Jul 2014 16:12:26 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Jul 2014 08:02:59 GMT"
},
{
"version": "v3",
"created": "Sat, 15 Aug 2015 11:23:22 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Alkämper",
"Martin",
""
],
[
"Dedner",
"Andreas",
""
],
[
"Klöfkorn",
"Robert",
""
],
[
"Nolte",
"Martin",
""
]
] |
new_dataset
| 0.998449 |
1508.03649
|
Hokky Situngkir
|
Hokky Situngkir
|
Borobudur was Built Algorithmically
|
9 pages, 6 figures
| null | null |
BFI Working Paper Series, WP082010
|
cs.CY cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The self-similarity of Indonesian Borobudur Temple is observed through the
dimensionality of stupa that is hypothetically closely related to whole
architectural body. Fractal dimension is calculated by using the cube counting
method and found that the dimension is 2.325, which is laid between the
two-dimensional plane and three dimensional space. The applied fractal geometry
and self-similarity of the building is emerged as the building process
implement the metric rules, since there is no universal metric standard known
in ancient traditional Javanese culture thus the architecture is not based on
final master plan. The paper also proposes how the hypothetical algorithmic
architecture might be applied computationally in order to see some experimental
generations of similar building. The paper ends with some conjectures for
further challenge and insights related to fractal geometry in Javanese
traditional cultural heritages.
|
[
{
"version": "v1",
"created": "Thu, 13 Aug 2015 04:08:27 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Situngkir",
"Hokky",
""
]
] |
new_dataset
| 0.995834 |
1508.03653
|
Kazutaka Kurihara
|
Koji Tsukada, Maho Oki, Kazutaka Kurihara, Yuko Furudate
|
AnimalCatcher: a digital camera to capture various reactions of animals
|
Written in Japanese, 6 pages
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People often have difficulty to take pictures of animals, since animals
usually do not react with cameras nor understand verbal directions. To solve
this problem, we developed a new interaction technique, AnimalCatcher, which
can attract animals' attention easily. The AnimalCatcher shoots various sounds
using directional speaker to capture various reactions of animals. This paper
describes concepts, implementation, and example pictures taken in a zoo.
|
[
{
"version": "v1",
"created": "Sat, 25 Apr 2015 01:08:32 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Tsukada",
"Koji",
""
],
[
"Oki",
"Maho",
""
],
[
"Kurihara",
"Kazutaka",
""
],
[
"Furudate",
"Yuko",
""
]
] |
new_dataset
| 0.96575 |
1508.03755
|
Team Lear
|
Danila Potapov (LEAR), Matthijs Douze (LEAR), Jerome Revaud (LEAR),
Zaid Harchaoui (LEAR, CIMS), Cordelia Schmid (LEAR)
|
Beat-Event Detection in Action Movie Franchises
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While important advances were recently made towards temporally localizing and
recognizing specific human actions or activities in videos, efficient detection
and classification of long video chunks belonging to semantically defined
categories such as "pursuit" or "romance" remains challenging.We introduce a
new dataset, Action Movie Franchises, consisting of a collection of Hollywood
action movie franchises. We define 11 non-exclusive semantic categories -
called beat-categories - that are broad enough to cover most of the movie
footage. The corresponding beat-events are annotated as groups of video shots,
possibly overlapping.We propose an approach for localizing beat-events based on
classifying shots into beat-categories and learning the temporal constraints
between shots. We show that temporal constraints significantly improve the
classification performance. We set up an evaluation protocol for beat-event
localization as well as for shot classification, depending on whether movies
from the same franchise are present or not in the training data.
|
[
{
"version": "v1",
"created": "Sat, 15 Aug 2015 17:04:50 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Potapov",
"Danila",
"",
"LEAR"
],
[
"Douze",
"Matthijs",
"",
"LEAR"
],
[
"Revaud",
"Jerome",
"",
"LEAR"
],
[
"Harchaoui",
"Zaid",
"",
"LEAR, CIMS"
],
[
"Schmid",
"Cordelia",
"",
"LEAR"
]
] |
new_dataset
| 0.993059 |
1508.03838
|
Hern\'an Vanzetto
|
Stephan Merz and Hern\'an Vanzetto
|
Encoding TLA+ set theory into many-sorted first-order logic
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an encoding of Zermelo-Fraenkel set theory into many-sorted
first-order logic, the input language of state-of-the-art SMT solvers. This
translation is the main component of a back-end prover based on SMT solvers in
the TLA+ Proof System.
|
[
{
"version": "v1",
"created": "Sun, 16 Aug 2015 15:47:07 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Merz",
"Stephan",
""
],
[
"Vanzetto",
"Hernán",
""
]
] |
new_dataset
| 0.972264 |
1508.03840
|
Ibrahim Adeyanju
|
Ibrahim Adeyanju and Comfort Babalola and Kareemat Salaudeen and Biola
Oyediran
|
3D-Computer Animation for a Yoruba Native Folktale
|
9 pages
|
International Journal of Computer Graphics & Animation (IJCGA)
Vol.5, No.3, July 2015
|
10.5121/ijcga.2015.5302
| null |
cs.GR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer graphics has wide range of applications which are implemented into
computer animation, computer modeling among others. Since the invention of
computer graphics researchers have not paid much of attentions toward the
possibility of converting oral tales otherwise known as folktales into possible
cartoon animated videos. This paper is based on how to develop cartoons of
local folktales that will be of huge benefits to Nigerians. The activities were
divided into 5 stages; analysis, design, development, implementation and
evaluation which involved various processes and use of various specialized
software and hardware. After the implementation of this project, the video
characteristics were evaluated using likert scale. Analysis of 30 user
responses indicated that 17 users (56.7 percent) rated the image quality as
excellent, the video and image synchronization was rated as excellent by 9
users (30 percent), the Background noise was rated excellent by 18 users (60
percent), the Character Impression was rated Excellent by 11 users (36.67
percent), the general assessment of the storyline was rated excellent by 17
users (56.7 percent), the video Impression was rated excellent by 11 users
(36.67 percent) and the voice quality was rated by 10 users (33.33 percent) as
excellent.
|
[
{
"version": "v1",
"created": "Sun, 16 Aug 2015 15:58:11 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Adeyanju",
"Ibrahim",
""
],
[
"Babalola",
"Comfort",
""
],
[
"Salaudeen",
"Kareemat",
""
],
[
"Oyediran",
"Biola",
""
]
] |
new_dataset
| 0.99898 |
1508.03863
|
Mark Levin
|
Mark Sh. Levin
|
Discrete Route/Trajectory Decision Making Problems
|
25 pages, 34 figures, 16 tables
| null | null | null |
cs.AI cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper focuses on composite multistage decision making problems which are
targeted to design a route/trajectory from an initial decision situation
(origin) to goal (destination) decision situation(s). Automobile routing
problem is considered as a basic physical metaphor. The problems are based on a
discrete (combinatorial) operations/states design/solving space (e.g.,
digraph). The described types of discrete decision making problems can be
considered as intelligent design of a route (trajectory, strategy) and can be
used in many domains: (a) education (planning of student educational
trajectory), (b) medicine (medical treatment), (c) economics (trajectory of
start-up development). Several types of the route decision making problems are
described: (i) basic route decision making, (ii) multi-goal route decision
making, (iii) multi-route decision making, (iv) multi-route decision making
with route/trajectory change(s), (v) composite multi-route decision making
(solution is a composition of several routes/trajectories at several
corresponding domains), and (vi) composite multi-route decision making with
coordinated routes/trajectories. In addition, problems of modeling and building
the design spaces are considered. Numerical examples illustrate the suggested
approach. Three applications are considered: educational trajectory
(orienteering problem), plan of start-up company (modular three-stage design),
and plan of medical treatment (planning over digraph with two-component
vertices).
|
[
{
"version": "v1",
"created": "Sun, 16 Aug 2015 20:37:35 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Levin",
"Mark Sh.",
""
]
] |
new_dataset
| 0.974517 |
1508.03908
|
EPTCS
|
Nosheen Gul (University of Leicester, England)
|
A Calculus of Mobility and Communication for Ubiquitous Computing
|
In Proceedings WWV 2015, arXiv:1508.03389
|
EPTCS 188, 2015, pp. 6-22
|
10.4204/EPTCS.188.3
| null |
cs.DC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a Calculus of Mobility and Communication (CMC) for the modelling
of mobility, communication and context-awareness in the setting of ubiquitous
computing. CMC is an ambient calculus with the in and out capabilities of
Cardelli and Gordon's Mobile Ambients. The calculus has a new form of global
communication similar to that in Milner's CCS. In CMC an ambient is tagged with
a set of ports that agents executing inside the ambient are allowed to
communicate on. It also has a new context-awareness feature that allows
ambients to query their location. We present reduction semantics and labelled
transition system semantics of CMC and prove that the semantics coincide. A new
notion of behavioural equivalence is given by defining capability barbed
bisimulation and congruence which is proved to coincide with barbed
bisimulation congruence. The expressiveness of the calculus is illustrated by
two case studies.
|
[
{
"version": "v1",
"created": "Mon, 17 Aug 2015 01:59:25 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Gul",
"Nosheen",
"",
"University of Leicester, England"
]
] |
new_dataset
| 0.999303 |
1508.03931
|
Michael Goodrich
|
Michael T. Goodrich and Timothy Johnson and Manuel Torres
|
Knuthian Drawings of Series-Parallel Flowcharts
|
Full version
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by a classic paper by Knuth, we revisit the problem of drawing
flowcharts of loop-free algorithms, that is, degree-three series-parallel
digraphs. Our drawing algorithms show that it is possible to produce Knuthian
drawings of degree-three series-parallel digraphs with good aspect ratios and
small numbers of edge bends.
|
[
{
"version": "v1",
"created": "Mon, 17 Aug 2015 05:59:27 GMT"
}
] | 2015-08-18T00:00:00 |
[
[
"Goodrich",
"Michael T.",
""
],
[
"Johnson",
"Timothy",
""
],
[
"Torres",
"Manuel",
""
]
] |
new_dataset
| 0.997808 |
1407.1386
|
Agi Kurucz
|
Christopher Hampson and Agi Kurucz
|
Undecidable propositional bimodal logics and one-variable first-order
linear temporal logics with counting
| null |
ACM TOCL vol. 16(3) (2015), 27:1-27:36
|
10.1145/2757285
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First-order temporal logics are notorious for their bad computational
behaviour. It is known that even the two-variable monadic fragment is highly
undecidable over various linear timelines, and over branching time even
one-variable fragments might be undecidable. However, there have been several
attempts on finding well-behaved fragments of first-order temporal logics and
related temporal description logics, mostly either by restricting the available
quantifier patterns, or considering sub-Boolean languages. Here we analyse
seemingly `mild' extensions of decidable one-variable fragments with counting
capabilities, interpreted in models with constant, decreasing, and expanding
first-order domains. We show that over most classes of linear orders these
logics are (sometimes highly) undecidable, even without constant and function
symbols, and with the sole temporal operator `eventually'.
We establish connections with bimodal logics over 2D product structures
having linear and `difference' (inequality) component relations, and prove our
results in this bimodal setting. We show a general result saying that
satisfiability over many classes of bimodal models with commuting linear and
difference relations is undecidable. As a by-product, we also obtain new
examples of finitely axiomatisable but Kripke incomplete bimodal logics. Our
results generalise similar lower bounds on bimodal logics over products of two
linear relations, and our proof methods are quite different from the proofs of
these results. Unlike previous proofs that first `diagonally encode' an
infinite grid, and then use reductions of tiling or Turing machine problems,
here we make direct use of the grid-like structure of product frames and obtain
undecidability by reductions of counter (Minsky) machine problems.
|
[
{
"version": "v1",
"created": "Sat, 5 Jul 2014 10:45:41 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Feb 2015 10:55:40 GMT"
},
{
"version": "v3",
"created": "Mon, 8 Jun 2015 16:11:17 GMT"
}
] | 2015-08-17T00:00:00 |
[
[
"Hampson",
"Christopher",
""
],
[
"Kurucz",
"Agi",
""
]
] |
new_dataset
| 0.950942 |
1507.06148
|
Chunming Tang
|
Chunming Tang, Nian Li, Yanfeng Qi, Zhengchun Zhou, Tor Helleseth
|
Linear codes with two or three weights from weakly regular bent
functions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes with few weights have applications in consumer electronics,
communication, data storage system, secret sharing, authentication codes,
association schemes, and strongly regular graphs. This paper first generalizes
the method of constructing two-weight and three-weight linear codes of Ding et
al. \cite{DD2015} and Zhou et al. \cite{ZLFH2015} to general weakly regular
bent functions and determines the weight distributions of these linear codes.
It solves the open problem of Ding et al. \cite{DD2015}. Further, this paper
constructs new linear codes with two or three weights and presents the weight
distributions of these codes. They contains some optimal codes meeting certain
bound on linear codes.
|
[
{
"version": "v1",
"created": "Wed, 22 Jul 2015 12:16:58 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Aug 2015 14:12:31 GMT"
},
{
"version": "v3",
"created": "Fri, 14 Aug 2015 00:25:28 GMT"
}
] | 2015-08-17T00:00:00 |
[
[
"Tang",
"Chunming",
""
],
[
"Li",
"Nian",
""
],
[
"Qi",
"Yanfeng",
""
],
[
"Zhou",
"Zhengchun",
""
],
[
"Helleseth",
"Tor",
""
]
] |
new_dataset
| 0.980006 |
1508.03374
|
Vida Vakilian
|
Vida Vakilian, Jean-Francois Frigon, and Sebastien Roy
|
Space-Frequency Block Code for MIMO-OFDM Communication Systems with
Reconfigurable Antennas
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a space-frequency (SF) block coding scheme for a multiple-input
multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) system
using antennas with reconfigurable radiation patterns. In this system, each
element of the antenna array at the transmitter side is assumed to be
reconfigurable so that it can independently change the physical characteristics
of its radiation pattern. The proposed block code is full rate and benefits
from spatial, frequency, and reconfigurable radiation pattern state diversity
over frequency-selective fading channels. We provide simulation results to
demonstrate the performance of the proposed block coding technique and make
comparisons with that of the previous SF coding schemes in MIMO-OFDM systems.
The results indicate that the proposed code achieves higher diversity and
coding gain compared to other available SF codes.
|
[
{
"version": "v1",
"created": "Thu, 13 Aug 2015 22:14:33 GMT"
}
] | 2015-08-17T00:00:00 |
[
[
"Vakilian",
"Vida",
""
],
[
"Frigon",
"Jean-Francois",
""
],
[
"Roy",
"Sebastien",
""
]
] |
new_dataset
| 0.999229 |
1508.03479
|
Vibhutesh Kumar Singh Mr.
|
Manish Kumar, Shubham Kaul, Vibhutesh Kumar Singh, Vivek Ashok Bohara
|
iDART-Intruder Detection and Alert in Real Time
|
Submitted as an entry to India Innovation Initiative - i3, 2015. 2
Page demo paper
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we design and develop a smart intruder detection and alert
system which aims to elevate the security as well as the likelihood of true
positive identification of trespassers and intruders as compared to other
commonly deployed electronic security systems. Using multiple sensors, this
system can gauge the extent of danger exhibited by a person or animal in or
around the home premises, and can forward various critical information
regarding the event to home owners as well as other specified entities, such as
relevant security authorities.
|
[
{
"version": "v1",
"created": "Fri, 14 Aug 2015 12:32:49 GMT"
}
] | 2015-08-17T00:00:00 |
[
[
"Kumar",
"Manish",
""
],
[
"Kaul",
"Shubham",
""
],
[
"Singh",
"Vibhutesh Kumar",
""
],
[
"Bohara",
"Vivek Ashok",
""
]
] |
new_dataset
| 0.999095 |
1508.03583
|
Timothy Barker Mr
|
Timothy Barker, Chao Zhai, Mario di Bernardo
|
A Coverage Based Decentralised Routing Algorithm for Vehicular Traffic
Networks
|
8 Pages, 10 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a simple yet effective routing strategy inspired by coverage
control, which delays the onset of congestion on traffic networks, by
introducing a control parameter. The routing algorithm allows a trade-off
between the congestion level and the distance to the destination. Numerical
verification of the strategy is provided on a number of representative examples
in SUMO, a well known micro agent simulator used for the analysis of traffic
networks. We find that it is crucial in many cases to tune the given control
parameters to some optimal value in order to reduce congestion in the most
effective way. The effects of different network structural properties are
connected to the level of congestion and the optimal range for setting the
control parameters.
|
[
{
"version": "v1",
"created": "Fri, 14 Aug 2015 18:01:39 GMT"
}
] | 2015-08-17T00:00:00 |
[
[
"Barker",
"Timothy",
""
],
[
"Zhai",
"Chao",
""
],
[
"di Bernardo",
"Mario",
""
]
] |
new_dataset
| 0.979149 |
1508.03592
|
O\u{g}uz Sunay
|
Kyoomars Alizadeh Noghani, M. Oguz Sunay
|
Streaming Multicast Video over Software-Defined Networks
|
6 pages, 5 figures, 1 table, First Workshop on Software-Defined
Internets of the Future - WSDIF 2014. Proceedings of the 11th IEEE
International Conference on Mobile Ad hoc and Sensor Systems (MASS) 2014 -
Philadelphia, Pennsylvania - October 28 - 30, 2014
| null |
10.1109/MASS.2014.125
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many of the video streaming applications in today's Internet involve the
distribution of content from a CDN source to a large population of interested
clients. However, widespread support of IP multicast is unavailable due to
technical and economical reasons, leaving the floor to application layer
multicast which introduces excessive delays for the clients and increased
traffic load for the network. This paper is concerned with the introduction of
an SDN-based framework that allows the network controller to not only deploy IP
multicast between a source and subscribers, but also control, via a simple
northbound interface, the distributed set of sources where multiple-
description coded (MDC) video content is available. We observe that for medium
to heavy network loads, relative to the state-of-the-art, the SDN-based
streaming multicast video framework increases the PSNR of the received video
significantly, from a level that is practically unwatchable to one that has
good quality.
|
[
{
"version": "v1",
"created": "Fri, 14 Aug 2015 18:18:57 GMT"
}
] | 2015-08-17T00:00:00 |
[
[
"Noghani",
"Kyoomars Alizadeh",
""
],
[
"Sunay",
"M. Oguz",
""
]
] |
new_dataset
| 0.978337 |
1505.06506
|
Edward Haeusler
|
Edward Hermann Haeusler
|
Every super-polynomial proof in purely implicational minimal logic has a
polynomially sized proof in classical implicational propositional logic
|
This paper has been withdrawn by the author due to a fatal error in
the general form of the deduction used for proved the main proposition
| null | null | null |
cs.CC cs.LO
|
http://creativecommons.org/licenses/by/3.0/
|
In this article we show how any formula A with a proof in minimal
implicational logic that is super-polynomially sized has a polynomially-sized
proof in classical implicational propositional logic . This fact provides an
argument in favor that any classical propositional tautology has short proofs,
i.e., NP=CoNP.
|
[
{
"version": "v1",
"created": "Mon, 25 May 2015 01:02:14 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jun 2015 01:16:00 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Aug 2015 16:55:32 GMT"
}
] | 2015-08-14T00:00:00 |
[
[
"Haeusler",
"Edward Hermann",
""
]
] |
new_dataset
| 0.997582 |
1508.03174
|
Victor Hernandez-Urbina
|
Victor Hernandez-Urbina
|
Logical N-AND Gate on a Molecular Turing Machine
| null | null | null | null |
cs.ET cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Boolean algebra, it is known that the logical function that corresponds to
the negation of the conjunction --NAND-- is universal in the sense that any
other logical function can be built based on it. This property makes it
essential to modern digital electronics and computer processor design. Here, we
design a molecular Turing machine that computes the NAND function over binary
strings of arbitrary length. For this purpose, we will perform a mathematical
abstraction of the kind of operations that can be done over a double-stranded
DNA molecule, as well as presenting a molecular encoding of the input symbols
for such a machine.
|
[
{
"version": "v1",
"created": "Thu, 13 Aug 2015 11:08:28 GMT"
}
] | 2015-08-14T00:00:00 |
[
[
"Hernandez-Urbina",
"Victor",
""
]
] |
new_dataset
| 0.99929 |
1508.02868
|
Hokky Situngkir
|
Hokky Situngkir
|
Cellular-Automata and Innovation within Indonesian Traditional Weaving
Crafts: A Discourse of Human-Computer Interaction
|
8 pages, 5 figures
| null | null |
BFI Working Paper Series WP-2013-03
|
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper reports the possibility of Indonesian traditional artisans of
weaving designs and crafts to explore the cellular automata, a dynamical model
in computation that may yield similar patterns. The reviews of the cellular
automata due to the perspective of weaving process reveals that the latter
would focus on macro-properties, i.e.: the strength of structural construction
beside the aesthetic patterns and designs. The meeting of traditional weaving
practice and the computational model is delivered and open the door for
interesting discourse of computer-aided designs for the traditional artists and
designers to come.
|
[
{
"version": "v1",
"created": "Wed, 12 Aug 2015 10:20:56 GMT"
}
] | 2015-08-13T00:00:00 |
[
[
"Situngkir",
"Hokky",
""
]
] |
new_dataset
| 0.999566 |
1508.02383
|
Farooq Khan
|
Farooq Khan
|
Mobile Internet from the Heavens
|
arXiv admin note: substantial text overlap with arXiv:1508.02063
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Almost two-thirds of the humankind currently does not have access to the
Internet, wired or wireless. We present a Space Internet proposal capable of
providing Zetabyte/ month capacity which is equivalent to 200GB/month for 5
Billion users Worldwide. Our proposal is based on deploying thousands of
low-cost micro-satellites in Low-Earth Orbit (LEO), each capable of providing
Terabit/s data rates with signal latencies better than or equal to ground based
systems.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2015 18:28:50 GMT"
}
] | 2015-08-12T00:00:00 |
[
[
"Khan",
"Farooq",
""
]
] |
new_dataset
| 0.991424 |
1508.02495
|
Hamidreza Arjmandi
|
Hamidreza Arjmandi, Mohammad Movahednasab, Amin Gohari, Mahtab
Mirmohseni, Masoumeh Nasiri Kenari, Faramarz Fekri
|
On ISI-free Modulations for Diffusion based Molecular Communication
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A diffusion molecular channel is a channel with memory, as molecules released
into the medium hit the receptors after a random delay. Coding over the
diffusion channel is performed by choosing the type, intensity, or the released
time of molecules diffused in the environment over time. To avoid intersymbol
interference (ISI), molecules of the same type should be released at time
instances that are sufficiently far apart. This ensures that molecules of a
previous transmission are faded in the environment, before molecules of the
same type are reused for signaling. In this paper, we consider ISI-free
time-slotted modulation schemes. The maximum reliable transmission rate for
these modulations is given by the constrained coding capacity of the graph that
represents the permissible transmission sequences. However, achieving the
constrained coding capacity requires long blocklengths and delays at the
decoder, making it impractical for simple nanomachines. The main contribution
of this paper is to consider modulations with small delay (short blocklength)
and show that they get very close to constrained coding capacity.
|
[
{
"version": "v1",
"created": "Tue, 11 Aug 2015 06:29:11 GMT"
}
] | 2015-08-12T00:00:00 |
[
[
"Arjmandi",
"Hamidreza",
""
],
[
"Movahednasab",
"Mohammad",
""
],
[
"Gohari",
"Amin",
""
],
[
"Mirmohseni",
"Mahtab",
""
],
[
"Kenari",
"Masoumeh Nasiri",
""
],
[
"Fekri",
"Faramarz",
""
]
] |
new_dataset
| 0.969506 |
1508.02557
|
Sanjay Chakraborty
|
Neha Bothra, Kritika Jain, Sanjay Chakraborty
|
Can JSP Code be Generated Using XML Tags?
| null | null |
10.15864/ajac.v2i3.138
| null |
cs.OH
|
http://creativecommons.org/licenses/by/4.0/
|
Over the years, a variety of web services have started using server-side
scripting to deliver results back to a client as a paid or free service; one
such server-side scripting language is Java Server Pages (JSP). Also Extensible
markup language (XML), is being adopted by most web developers as a tool to
describe data.Therefore, we present a conversion method which uses predefined
XML tags as input and generates the corresponding JSP code. However, the end
users are required to have a basic experience with web pages. This conversion
method aims to reduce the time and effort spent by the user (web developer) to
get acquainted with JSP. The conversion process abstracts the user from the
intricacies of JSP and enables him to focus on the business logic.
|
[
{
"version": "v1",
"created": "Tue, 11 Aug 2015 11:16:31 GMT"
}
] | 2015-08-12T00:00:00 |
[
[
"Bothra",
"Neha",
""
],
[
"Jain",
"Kritika",
""
],
[
"Chakraborty",
"Sanjay",
""
]
] |
new_dataset
| 0.999847 |
1508.02606
|
Hainan Cui
|
Hao Hu, Hainan Cui
|
InAR:Inverse Augmented Reality
|
2 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Augmented reality is the art to seamlessly fuse virtual objects into real
ones. In this short note, we address the opposite problem, the inverse
augmented reality, that is, given a perfectly augmented reality scene where
human is unable to distinguish real objects from virtual ones, how the machine
could help do the job. We show by structure from motion (SFM), a simple 3D
reconstruction technique from images in computer vision, the real and virtual
objects can be easily separated in the reconstructed 3D scene.
|
[
{
"version": "v1",
"created": "Tue, 11 Aug 2015 14:17:28 GMT"
}
] | 2015-08-12T00:00:00 |
[
[
"Hu",
"Hao",
""
],
[
"Cui",
"Hainan",
""
]
] |
new_dataset
| 0.997481 |
1202.4232
|
Chung-Chieh Fang
|
Chung-Chieh Fang
|
Boundary Conditions of Subharmonic Oscillations in
Fixed-Switching-Frequency DC-DC Converters
|
Title changed. Submitted to a journal on 2/24/11, and resubmitted to
IJCTA on 8/10/11. Added: S-plot to determine the required ramp slope, V2
control, a counterexample (Example 5) of the ripple index hypothesis. The key
results traced back from my 1997 PhD thesis, available:
http://www.lib.umd.edu/drum/. My five IJCTA papers in arXiv have two common
reviewers
|
Nonlinear Dynamics, 77(1-2), pp. 185-208, Jul. 2014
|
10.1007/s11071-014-1283-7
| null |
cs.SY math.DS nlin.CD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Design-oriented boundary conditions for subharmonic oscillations are of great
interest recently. Based on a subharmonic oscillation boundary condition
reported in a PhD thesis more than a decade ago, extended new boundary
conditions are derived in closed forms for general switching DC-DC converters.
Sampled-data and harmonic balance analyses are applied and generate equivalent
results. It is shown that equivalent series resistance causes the boundary
conditions for voltage/current mode control to have similar forms. Some
recently reported boundary conditions become special cases in view of the
general boundary conditions derived. New Nyquist-like design-oriented plots are
proposed to predict or prevent the occurrence of the subharmonic oscillation.
The relation between the crossover frequency and the subharmonic oscillation is
also analyzed.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2012 06:03:06 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Mar 2012 06:10:40 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Fang",
"Chung-Chieh",
""
]
] |
new_dataset
| 0.977157 |
1407.5068
|
Marek Szyku{\l}a
|
Marek Szyku{\l}a
|
Checking Whether an Automaton Is Monotonic Is NP-complete
|
13 pages, 4 figures. CIAA 2015. The final publication is available at
http://link.springer.com/chapter/10.1007/978-3-319-22360-5_23
|
In Implementation and Application of Automata, volume 9223 of
LNCS, pages 279-291, Springer, 2015
|
10.1007/978-3-319-22360-5_23
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An automaton is monotonic if its states can be arranged in a linear order
that is preserved by the action of every letter. We prove that the problem of
deciding whether a given automaton is monotonic is NP-complete. The same result
is obtained for oriented automata, whose states can be arranged in a cyclic
order. Moreover, both problems remain hard under the restriction to binary
input alphabets.
|
[
{
"version": "v1",
"created": "Fri, 18 Jul 2014 17:40:44 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Nov 2014 17:58:51 GMT"
},
{
"version": "v3",
"created": "Mon, 10 Aug 2015 06:04:19 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Szykuła",
"Marek",
""
]
] |
new_dataset
| 0.957711 |
1502.03426
|
Murray Elder
|
Laura Ciobanu and Volker Diekert and Murray Elder
|
Solution sets for equations over free groups are EDT0L languages --
ICALP 2015 version
|
37 pages, 2 figures
| null | null | null |
cs.LO cs.DM cs.FL math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that, given a word equation over a finitely generated free group, the
set of all solutions in reduced words forms an EDT0L language. In particular,
it is an indexed language in the sense of Aho. The question of whether a
description of solution sets in reduced words as an indexed language is
possible has been been open for some years, apparently without much hope that a
positive answer could hold. Nevertheless, our answer goes far beyond: they are
EDT0L, which is a proper subclass of indexed languages. We can additionally
handle the existential theory of equations with rational constraints in free
products $\star_{1 \leq i \leq s}F_i$, where each $F_i$ is either a free or
finite group, or a free monoid with involution. In all cases the result is the
same: the set of all solutions in reduced words is EDT0L. This was known only
for quadratic word equations by Fert\'e, Marin and S\'enizergues (ToCS 2014),
which is a very restricted case. Our general result became possible due to the
recent recompression technique of Je\.z. In this paper we use a new method to
integrate solutions of linear Diophantine equations into the process and obtain
more general results than in the related paper (arXiv 1405.5133). For example,
we improve the complexity from quadratic nondeterministic space in (arXiv
1405.5133) to quasi-linear nondeterministic space here. This implies an
improved complexity for deciding the existential theory of non-abelian free
groups: NSPACE($n\log n$). The conjectured complexity is NP, however, we
believe that our results are optimal with respect to space complexity,
independent of the conjectured NP.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 20:23:41 GMT"
},
{
"version": "v2",
"created": "Mon, 4 May 2015 03:24:25 GMT"
},
{
"version": "v3",
"created": "Sat, 8 Aug 2015 09:11:26 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Ciobanu",
"Laura",
""
],
[
"Diekert",
"Volker",
""
],
[
"Elder",
"Murray",
""
]
] |
new_dataset
| 0.973609 |
1505.06524
|
Hao Chen
|
Liqing Xu and Hao Chen
|
New Explicit Binary Constant Weight Codes from Reed-Solomon Codes
|
15 pages, submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary constant weight codes have important applications and have been
studied for many years. Optimal or near-optimal binary constant weight codes of
small lengths have been determined. In this paper we propose a new construction
of explicit binary constant weight codes from $q$-ary Reed-Solomon codes. Some
of our binary constant weight codes are optimal or new. In particular new
binary constant weight codes $A(64, 10, 8) \geq 4108$ and $A(64, 12, 8) \geq
522$ are constructed. We also give explicitly constructed binary constant
weight codes which improve Gilbert and Graham-Sloane lower bounds in some range
of parameters. An extension to algebraic geometric codes is also presented.
|
[
{
"version": "v1",
"created": "Mon, 25 May 2015 02:14:47 GMT"
},
{
"version": "v2",
"created": "Sat, 30 May 2015 00:58:20 GMT"
},
{
"version": "v3",
"created": "Sat, 25 Jul 2015 11:47:29 GMT"
},
{
"version": "v4",
"created": "Fri, 7 Aug 2015 22:11:14 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Xu",
"Liqing",
""
],
[
"Chen",
"Hao",
""
]
] |
new_dataset
| 0.99981 |
1508.00375
|
Hamed Haddadi
|
Hamed Haddadi, Ferda Ofli, Yelena Mejova, Ingmar Weber, Jaideep
Srivastava
|
360 Quantified Self
|
QCRI Technical Report
| null | null |
QCRI-TR-2015-004
|
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wearable devices with a wide range of sensors have contributed to the rise of
the Quantified Self movement, where individuals log everything ranging from the
number of steps they have taken, to their heart rate, to their sleeping
patterns. Sensors do not, however, typically sense the social and ambient
environment of the users, such as general life style attributes or information
about their social network. This means that the users themselves, and the
medical practitioners, privy to the wearable sensor data, only have a narrow
view of the individual, limited mainly to certain aspects of their physical
condition.
In this paper we describe a number of use cases for how social media can be
used to complement the check-up data and those from sensors to gain a more
holistic view on individuals' health, a perspective we call the 360 Quantified
Self. Health-related information can be obtained from sources as diverse as
food photo sharing, location check-ins, or profile pictures. Additionally,
information from a person's ego network can shed light on the social dimension
of wellbeing which is widely acknowledged to be of utmost importance, even
though they are currently rarely used for medical diagnosis. We articulate a
long-term vision describing the desirable list of technical advances and
variety of data to achieve an integrated system encompassing Electronic Health
Records (EHR), data from wearable devices, alongside information derived from
social media data.
|
[
{
"version": "v1",
"created": "Mon, 3 Aug 2015 11:11:15 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Aug 2015 08:22:10 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Haddadi",
"Hamed",
""
],
[
"Ofli",
"Ferda",
""
],
[
"Mejova",
"Yelena",
""
],
[
"Weber",
"Ingmar",
""
],
[
"Srivastava",
"Jaideep",
""
]
] |
new_dataset
| 0.985565 |
1508.01813
|
Kaarthik Sundar
|
Kaarthik Sundar and Sivakumar Rathinam
|
Generalized multiple depot traveling salesmen problem - polyhedral study
and exact algorithm
|
26 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The generalized multiple depot traveling salesmen problem (GMDTSP) is a
variant of the multiple depot traveling salesmen problem (MDTSP), where each
salesman starts at a distinct depot, the targets are partitioned into clusters
and at least one target in each cluster is visited by some salesman. The GMDTSP
is an NP-hard problem as it generalizes the MDTSP and has practical
applications in design of ring networks, vehicle routing, flexible
manufacturing scheduling and postal routing. We present an integer programming
formulation for the GMDTSP and valid inequalities to strengthen the linear
programming relaxation. Furthermore, we present a polyhedral analysis of the
convex hull of feasible solutions to the GMDTSP and derive facet-defining
inequalities that strengthen the linear programming relaxation of the GMDTSP.
All these results are then used to develop a branch-and-cut algorithm to obtain
optimal solutions to the problem. The performance of the algorithm is evaluated
through extensive computational experiments on several benchmark instances.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 20:42:18 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Sundar",
"Kaarthik",
""
],
[
"Rathinam",
"Sivakumar",
""
]
] |
new_dataset
| 0.997534 |
1508.02015
|
Abhay Kumar Singh
|
Sukhamoy Pattanayak and Abhay Kumar Singh
|
On cyclic DNA codes over the Ring $\Z_4 + u \Z_4$
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the theory for constructing DNA cyclic codes of odd
length over $\Z_4[u]/\langle u^2 \rangle$ which play an important role in DNA
computing. Cyclic codes of odd length over $\Z_4 + u \Z_4$ satisfy the reverse
constraint and the reverse-complement constraint are studied in this paper. The
structure and existence of such codes are also studied. The paper concludes
with some DNA example obtained via the family of cyclic codes.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2015 12:13:51 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Pattanayak",
"Sukhamoy",
""
],
[
"Singh",
"Abhay Kumar",
""
]
] |
new_dataset
| 0.989418 |
1508.02027
|
Oliver Knill
|
Oliver Knill
|
The graph spectrum of barycentric refinements
|
20 pages 12 figures
| null | null | null |
cs.DM math.CO math.SP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a finite simple graph G, let G' be its barycentric refinement: it is
the graph in which the vertices are the complete subgraphs of G and in which
two such subgraphs are connected, if one is contained into the other. If
L(0)=0<L(1) <= L(2) ... <= L(n) are the eigenvalues of the Laplacian of G,
define the spectral function F(x) as the function F(x) = L([n x]) on the
interval [0,1], where [r] is the floor function giving the largest integer
smaller or equal than r. The graph G' is known to be homotopic to G with Euler
characteristic chi(G')=chi(G) and dim(G') >= dim(G). Let G(m) be the sequence
of barycentric refinements of G=G(0). We prove that for any finite simple graph
G, the spectral functions F(G(m)) of successive refinements converge for m to
infinity uniformly on compact subsets of (0,1) and exponentially fast to a
universal limiting eigenvalue distribution function F which only depends on the
clique number respectively the dimension d of the largest complete subgraph of
G and not on the starting graph G. In the case d=1, where we deal with graphs
without triangles, the limiting distribution is the smooth function F(x) = 4
sin^2(pi x/2). This is related to the Julia set of the quadratic map T(z) =
4z-z^2 which has the one dimensional Julia set [0,4] and F satisfies
T(F(k/n))=F(2k/n) as the Laplacians satisfy such a renormalization recursion.
The spectral density in the d=1 case is then the arc-sin distribution which is
the equilibrium measure on the Julia set. In higher dimensions, where the
limiting function F still remains unidentified, F' appears to have a discrete
or singular component.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2015 14:20:48 GMT"
}
] | 2015-08-11T00:00:00 |
[
[
"Knill",
"Oliver",
""
]
] |
new_dataset
| 0.997305 |
1305.3021
|
Ijaz Bukhari ijaz bukhari
|
Ijaz Bukhari, Nuhman-ul-Haq and Khizar Hyat
|
Wave Atom Based Watermarking
|
I want to withdraw the paper due to serious error
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Watermarking helps in ensuring originality, ownership and copyrights of a
digital image. This paper aims at embedding a Watermark in an image using Wave
Atom Transform. Preference of Wave Atoms on other transformations has been due
to its sparser expansion, adaptability to the direction of local pattern, and
sharp frequency localization. In this scheme, we had tried to spread the
watermark in an image so that the information at one place is very small and
undetectable. In order to extract the watermark and verify ownership of an
image, one would have the advantage of prior knowledge of embedded locations. A
noise of high amplitude will be needed to be added to the image for watermark
distortion. Furthermore, the information spread will ensure the robustness of
the watermark data. The proposed scheme has the ability to withstand malicious
operations and attacks.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 05:27:52 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Aug 2015 13:06:09 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Bukhari",
"Ijaz",
""
],
[
"Nuhman-ul-Haq",
"",
""
],
[
"Hyat",
"Khizar",
""
]
] |
new_dataset
| 0.997635 |
1508.01571
|
Humberto Corona
|
Humberto Corona, Michael P. O'Mahony
|
A Mood-based Genre Classification of Television Content
|
in ACM Workshop on Recommendation Systems for Television and Online
Video 2014 Foster City, California USA
| null | null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The classification of television content helps users organise and navigate
through the large list of channels and programs now available. In this paper,
we address the problem of television content classification by exploiting text
information extracted from program transcriptions. We present an analysis which
adapts a model for sentiment that has been widely and successfully applied in
other fields such as music or blog posts. We use a real-world dataset obtained
from the Boxfish API to compare the performance of classifiers trained on a
number of different feature sets. Our experiments show that, over a large
collection of television content, program genres can be represented in a
three-dimensional space of valence, arousal and dominance, and that promising
classification results can be achieved using features based on this
representation. This finding supports the use of the proposed representation of
television content as a feature space for similarity computation and
recommendation generation.
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2015 23:53:30 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Corona",
"Humberto",
""
],
[
"O'Mahony",
"Michael P.",
""
]
] |
new_dataset
| 0.997458 |
1508.01575
|
Lei Zhang
|
Lei Zhang, Chuanyan Hu, Qianhong Wu, Josep Domingo-Ferrer, Bo Qin
|
On the Security of Privacy-Preserving Vehicular Communication
Authentication with Hierarchical Aggregation and Fast Response
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In [3], the authors proposed a highly efficient secure and privacy-preserving
scheme for secure vehicular communications. The proposed scheme consists of
four protocols: system setup, protocol for STP and STK distribution, protocol
for common string synchronization, and protocol for vehicular communications.
Here we define the security models for the protocol for STP and STK
distribution, and the protocol for vehicular communications,respectively. We
then prove that these two protocols are secure in our models.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 00:30:17 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Zhang",
"Lei",
""
],
[
"Hu",
"Chuanyan",
""
],
[
"Wu",
"Qianhong",
""
],
[
"Domingo-Ferrer",
"Josep",
""
],
[
"Qin",
"Bo",
""
]
] |
new_dataset
| 0.98113 |
1508.01667
|
Limin Wang
|
Limin Wang, Sheng Guo, Weilin Huang, Yu Qiao
|
Places205-VGGNet Models for Scene Recognition
|
2 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
VGGNets have turned out to be effective for object recognition in still
images. However, it is unable to yield good performance by directly adapting
the VGGNet models trained on the ImageNet dataset for scene recognition. This
report describes our implementation of training the VGGNets on the large-scale
Places205 dataset. Specifically, we train three VGGNet models, namely
VGGNet-11, VGGNet-13, and VGGNet-16, by using a Multi-GPU extension of Caffe
toolbox with high computational efficiency. We verify the performance of
trained Places205-VGGNet models on three datasets: MIT67, SUN397, and
Places205. Our trained models achieve the state-of-the-art performance on these
datasets and are made public available.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 12:11:06 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Wang",
"Limin",
""
],
[
"Guo",
"Sheng",
""
],
[
"Huang",
"Weilin",
""
],
[
"Qiao",
"Yu",
""
]
] |
new_dataset
| 0.998857 |
1508.01668
|
Natarajan Meghanathan
|
Natarajan Meghanathan
|
Distribution of maximal clique size of the vertices for theoretical
small-world networks and real-world networks
|
20 pages, 13 figures, 3 tables
|
International Journal of Computer Networks and Communications,
vol. 7, no. 4, pp. 21-41, July 2015
|
10.5121/ijcnc.2015.7402
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our primary objective in this paper is to study the distribution of the
maximal clique size of the vertices in complex networks. We define the maximal
clique size for a vertex as the maximum size of the clique that the vertex is
part of and such a clique need not be the maximum size clique for the entire
network. We determine the maximal clique size of the vertices using a modified
version of a branch-and-bound based exact algorithm that has been originally
proposed to determine the maximum size clique for an entire network graph. We
then run this algorithm on two categories of complex networks: One category of
networks capture the evolution of small-world networks from regular network
(according to the wellknown Watts-Strogatz model) and their subsequent
evolution to random networks; we show that the distribution of the maximal
clique size of the vertices follows a Poisson-style distribution at different
stages of the evolution of the small-world network to a random network; on the
other hand, the maximal clique size of the vertices is observed to be
in-variant and to be very close to that of the maximum clique size for the
entire network graph as the regular network is transformed to a small-world
network. The second category of complex networks studied are real-world
networks (ranging from random networks to scale-free networks) and we observe
the maximal clique size of the vertices in five of the six real-world networks
to follow a Poisson-style distribution. In addition to the above case studies,
we also analyze the correlation between the maximal clique size and clustering
coefficient as well as analyze the assortativity index of the vertices with
respect to maximal clique size and node degree.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 12:19:04 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Meghanathan",
"Natarajan",
""
]
] |
new_dataset
| 0.995546 |
1508.01703
|
Kasra Madadipouya
|
Mohammad Ahmadi, Mostafa Vali, Farez Moghaddam, Aida Hakemi, Kasra
Madadipouya
|
A Reliable User Authentication and Data Protection Model in Cloud
Computing Environments
|
4 pages in International Conference on Information, System and
Convergence Applications June 24-27, 2015 in Kuala Lumpur, Malaysia
| null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security issues are the most challenging problems in cloud computing
environments as an emerging technology. Regarding to this importance, an
efficient and reliable user authentication and data protection model has been
presented in this paper to increase the rate of reliability cloud-based
environments. Accordingly, two encryption procedures have been established in
an independent middleware (Agent) to perform the process of user
authentication, access control, and data protection in cloud servers. AES has
been used as a symmetric cryptography algorithm in cloud servers and RSA has
been used as an asymmetric cryptography algorithm in Agent servers. The
theoretical evaluation of the proposed model shows that the ability of
resistance in face with possible attacks and unpredictable events has been
enhanced considerably in comparison with similar models because of using dual
encryption and an independent middleware during user authentication and data
protection procedures.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 14:24:14 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Ahmadi",
"Mohammad",
""
],
[
"Vali",
"Mostafa",
""
],
[
"Moghaddam",
"Farez",
""
],
[
"Hakemi",
"Aida",
""
],
[
"Madadipouya",
"Kasra",
""
]
] |
new_dataset
| 0.998225 |
1508.01719
|
Daniel Fett
|
Daniel Fett and Ralf Kuesters and Guido Schmitz
|
SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web
|
Parts of this work extend the web model presented in arXiv:1411.7210
and arXiv:1403.1866
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single sign-on (SSO) systems, such as OpenID and OAuth, allow web sites,
so-called relying parties (RPs), to delegate user authentication to identity
providers (IdPs), such as Facebook or Google. These systems are very popular,
as they provide a convenient means for users to log in at RPs and move much of
the burden of user authentication from RPs to IdPs.
There is, however, a downside to current systems, as they do not respect
users' privacy: IdPs learn at which RP a user logs in. With one exception,
namely Mozilla's BrowserID system (a.k.a. Mozilla Persona), current SSO systems
were not even designed with user privacy in mind. Unfortunately, recently
discovered attacks, which exploit design flaws of BrowserID, show that
BrowserID does not provide user privacy either.
In this paper, we therefore propose the first privacy-respecting SSO system
for the web, called SPRESSO (for Secure Privacy-REspecting Single Sign-On). The
system is easy to use, decentralized, and platform independent. It is based
solely on standard HTML5 and web features and uses no browser extensions,
plug-ins, or other executables.
Existing SSO systems and the numerous attacks on such systems illustrate that
the design of secure SSO systems is highly non-trivial. We therefore also carry
out a formal analysis of SPRESSO based on an expressive model of the web in
order to formally prove that SPRESSO enjoys strong authentication and privacy
properties.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 15:12:53 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Fett",
"Daniel",
""
],
[
"Kuesters",
"Ralf",
""
],
[
"Schmitz",
"Guido",
""
]
] |
new_dataset
| 0.999665 |
1508.01727
|
Daniele Bartoli
|
Daniele Bartoli and Matteo Bonini and Massimo Giulietti
|
Constant dimension codes from Riemann-Roch spaces
|
10 pages
| null | null | null |
cs.IT math.AG math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some families of constant dimension codes arising from Riemann-Roch spaces
associated to particular divisors of a curve $\X$ are constructed. These
families are generalizations of the one constructed by Hansen
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2015 07:29:07 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Bartoli",
"Daniele",
""
],
[
"Bonini",
"Matteo",
""
],
[
"Giulietti",
"Massimo",
""
]
] |
new_dataset
| 0.951885 |
1508.01761
|
Gerardo Vega
|
Gerardo Vega
|
Reducible Cyclic Codes Constructed as the Direct Sum of Two
Semiprimitive Cyclic Codes
|
13 pages, 4 weight distribution tables. Creation date April 10, 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a family of reducible cyclic codes constructed as the direct sum
of two different semiprimitive two-weight irreducible cyclic codes. This family
generalizes the class of reducible cyclic codes that was reported in the main
result of B. Wang, {\em et al.} \cite{once}. Moreover, despite of what was
stated therein, we show that, at least for the codes studied here, it is still
possible to compute the frequencies of their weight distributions through the
cyclotomic numbers in a very easy way.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 17:04:25 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Vega",
"Gerardo",
""
]
] |
new_dataset
| 0.980745 |
1508.01786
|
Daniel Romero
|
Daniel M. Romero, Roderick I. Swaab, Brian Uzzi, and Adam D. Galinsky
|
Mimicry Is Presidential: Linguistic Style Matching in Presidential
Debates and Improved Polling Numbers
|
in the Personality and Social Psychology Bulletin (2015)
| null |
10.1177/0146167215591168
| null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The current research used the contexts of U.S. presidential debates and
negotiations to examine whether matching the linguistic style of an opponent in
a two-party exchange affects the reactions of third-party observers. Building
off communication accommodation theory (CAT), interaction alignment theory
(IAT), and processing fluency, we propose that language style matching (LSM)
will improve subsequent third-party evaluations because matching an opponent's
linguistic style reflects greater perspective taking and will make one's
arguments easier to process. In contrast, research on status inferences
predicts that LSM will negatively impact third-party evaluations because LSM
implies followership. We conduct two studies to test these competing
hypotheses. Study 1 analyzed transcripts of U.S. presidential debates between
1976 and 2012 and found that candidates who matched their opponent's linguistic
style increased their standing in the polls. Study 2 demonstrated a causal
relationship between LSM and third-party observer evaluations using negotiation
transcripts.
|
[
{
"version": "v1",
"created": "Fri, 7 Aug 2015 19:35:52 GMT"
}
] | 2015-08-10T00:00:00 |
[
[
"Romero",
"Daniel M.",
""
],
[
"Swaab",
"Roderick I.",
""
],
[
"Uzzi",
"Brian",
""
],
[
"Galinsky",
"Adam D.",
""
]
] |
new_dataset
| 0.951078 |
1401.5311
|
Dacheng Tao
|
Changxing Ding, Jonghyun Choi, Dacheng Tao and Larry S. Davis
|
Multi-Directional Multi-Level Dual-Cross Patterns for Robust Face
Recognition
|
accepted version to IEEE TPAMI
| null |
10.1109/TPAMI.2015.2462338
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To perform unconstrained face recognition robust to variations in
illumination, pose and expression, this paper presents a new scheme to extract
"Multi-Directional Multi-Level Dual-Cross Patterns" (MDML-DCPs) from face
images. Specifically, the MDMLDCPs scheme exploits the first derivative of
Gaussian operator to reduce the impact of differences in illumination and then
computes the DCP feature at both the holistic and component levels. DCP is a
novel face image descriptor inspired by the unique textural structure of human
faces. It is computationally efficient and only doubles the cost of computing
local binary patterns, yet is extremely robust to pose and expression
variations. MDML-DCPs comprehensively yet efficiently encodes the invariant
characteristics of a face image from multiple levels into patterns that are
highly discriminative of inter-personal differences but robust to
intra-personal variations. Experimental results on the FERET, CAS-PERL-R1, FRGC
2.0, and LFW databases indicate that DCP outperforms the state-of-the-art local
descriptors (e.g. LBP, LTP, LPQ, POEM, tLBP, and LGXP) for both face
identification and face verification tasks. More impressively, the best
performance is achieved on the challenging LFW and FRGC 2.0 databases by
deploying MDML-DCPs in a simple recognition scheme.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2014 13:24:16 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Aug 2015 02:28:49 GMT"
}
] | 2015-08-07T00:00:00 |
[
[
"Ding",
"Changxing",
""
],
[
"Choi",
"Jonghyun",
""
],
[
"Tao",
"Dacheng",
""
],
[
"Davis",
"Larry S.",
""
]
] |
new_dataset
| 0.95509 |
1410.6122
|
Matteo Dell'Amico Ph.D.
|
Matteo Dell'Amico, Damiano Carra, Pietro Michiardi
|
PSBS: Practical Size-Based Scheduling
|
arXiv admin note: substantial text overlap with arXiv:1403.5996
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Size-based schedulers have very desirable performance properties: optimal or
near-optimal response time can be coupled with strong fairness guarantees.
Despite this, such systems are very rarely implemented in practical settings,
because they require knowing a priori the amount of work needed to complete
jobs: this assumption is very difficult to satisfy in concrete systems. It is
definitely more likely to inform the system with an estimate of the job sizes,
but existing studies point to somewhat pessimistic results if existing
scheduler policies are used based on imprecise job size estimations. We take
the goal of designing scheduling policies that are explicitly designed to deal
with inexact job sizes: first, we show that existing size-based schedulers can
have bad performance with inexact job size information when job sizes are
heavily skewed; we show that this issue, and the pessimistic results shown in
the literature, are due to problematic behavior when large jobs are
underestimated. Once the problem is identified, it is possible to amend
existing size-based schedulers to solve the issue. We generalize FSP -- a fair
and efficient size-based scheduling policy -- in order to solve the problem
highlighted above; in addition, our solution deals with different job weights
(that can be assigned to a job independently from its size). We provide an
efficient implementation of the resulting protocol, which we call Practical
Size-Based Scheduler (PSBS). Through simulations evaluated on synthetic and
real workloads, we show that PSBS has near-optimal performance in a large
variety of cases with inaccurate size information, that it performs fairly and
it handles correctly job weights. We believe that this work shows that PSBS is
indeed pratical, and we maintain that it could inspire the design of schedulers
in a wide array of real-world use cases.
|
[
{
"version": "v1",
"created": "Wed, 22 Oct 2014 17:57:22 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Oct 2014 14:25:56 GMT"
},
{
"version": "v3",
"created": "Mon, 23 Mar 2015 17:47:46 GMT"
},
{
"version": "v4",
"created": "Thu, 6 Aug 2015 16:09:04 GMT"
}
] | 2015-08-07T00:00:00 |
[
[
"Dell'Amico",
"Matteo",
""
],
[
"Carra",
"Damiano",
""
],
[
"Michiardi",
"Pietro",
""
]
] |
new_dataset
| 0.998334 |
1508.01321
|
Jaderick Pabico
|
Fatima M. Moncada and Jaderick P. Pabico
|
On Gobbledygook and Mood of the Philippine Senate: An Exploratory Study
on the Readability and Sentiment of Selected Philippine Senators' Microposts
|
13 pages, 6 figures, submitted to the Asia Pacific Journal on
Education, Arts, and Sciences
| null | null | null |
cs.CL cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper presents the findings of a readability assessment and sentiment
analysis of selected six Philippine senators' microposts over the popular
Twitter microblog. Using the Simple Measure of Gobbledygook (SMOG), tweets of
Senators Cayetano, Defensor-Santiago, Pangilinan, Marcos, Guingona, and
Escudero were assessed. A sentiment analysis was also done to determine the
polarity of the senators' respective microposts. Results showed that on the
average, the six senators are tweeting at an eight to ten SMOG level. This
means that, at least a sixth grader will be able to understand the senators'
tweets. Moreover, their tweets are mostly neutral and their sentiments vary in
unison at some period of time. This could mean that a senator's tweet sentiment
is affected by specific Philippine-based events.
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2015 08:39:20 GMT"
}
] | 2015-08-07T00:00:00 |
[
[
"Moncada",
"Fatima M.",
""
],
[
"Pabico",
"Jaderick P.",
""
]
] |
new_dataset
| 0.99597 |
1508.01324
|
Nisha Panwar
|
Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal
|
Vehicle to Vehicle Authentication
|
This is a version that appeared as a brief announcement in 17th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS, 2015)
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent future, vehicles will establish a spontaneous connection over a
wireless radio channel, coordinating actions and information. Vehicles will
exchange warning messages over the wireless radio channel through Dedicated
Short Range Communication (IEEE 1609) over the Wireless Access in Vehicular
Environment (802.11p). Unfortunately, the wireless communication among vehicles
is vulnerable to security threats that may lead to very serious safety hazards.
Therefore, the warning messages being exchanged must incorporate an authentic
factor such that recipient is willing to verify and accept the message in a
timely manner
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2015 08:49:28 GMT"
}
] | 2015-08-07T00:00:00 |
[
[
"Dolev",
"Shlomi",
""
],
[
"Krzywiecki",
"Lukasz",
""
],
[
"Panwar",
"Nisha",
""
],
[
"Segal",
"Michael",
""
]
] |
new_dataset
| 0.999741 |
1508.01360
|
Anatoly Anisimov
|
Anatoly V. Anisimov, Igor O. Zavadskyi
|
Variable-length Splittable Codes with Multiple Delimiters
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Variable-length splittable codes are derived from encoding sequences of
ordered integer pairs, where one of the pair's components is upper bounded by
some constant, and the other one is any positive integer. Each pair is encoded
by the concatenation of two fixed independent prefix encoding functions applied
to the corresponding components of a pair. The codeword of such a sequence of
pairs consists of the sequential concatenation of corresponding pair's
encodings. We call such codes splittable. We show that Fibonacci codes of
higher orders and codes with multiple delimiters of the form 011...10 are
splittable. Completeness and universality of multi-delimiter codes are proved.
Encoding of integers by multi-delimiter codes is considered in detail. For
these codes, a fast byte aligned decoding algorithm is constructed. The
comparative compression performance of Fibonacci codes and different
multi-delimiter codes is presented. By many useful properties, multi-delimiter
codes are superior to Fibonacci codes.
|
[
{
"version": "v1",
"created": "Thu, 6 Aug 2015 11:02:56 GMT"
}
] | 2015-08-07T00:00:00 |
[
[
"Anisimov",
"Anatoly V.",
""
],
[
"Zavadskyi",
"Igor O.",
""
]
] |
new_dataset
| 0.999548 |
1508.00974
|
Tao Zhang
|
Tao Zhang and Gennian Ge
|
Quantum Block and Synchronizable Codes Derived from Certain Classes of
Polynomials
|
9 pages. arXiv admin note: text overlap with arXiv:1403.6192,
arXiv:1311.3416 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One central theme in quantum error-correction is to construct quantum codes
that have a large minimum distance. In this paper, we first present a
construction of classical codes based on certain class of polynomials. Through
these classical codes, we are able to obtain some new quantum codes. It turns
out that some of quantum codes exhibited here have better parameters than the
ones available in the literature. Meanwhile, we give a new class of quantum
synchronizable codes with highest possible tolerance against misalignment from
duadic codes.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2015 05:18:02 GMT"
}
] | 2015-08-06T00:00:00 |
[
[
"Zhang",
"Tao",
""
],
[
"Ge",
"Gennian",
""
]
] |
new_dataset
| 0.999764 |
1508.00978
|
Tao Zhang
|
Tao Zhang and Gennian Ge
|
Quantum Codes from Generalized Reed-Solomon Codes and Matrix-Product
Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the central tasks in quantum error-correction is to construct quantum
codes that have good parameters. In this paper, we construct three new classes
of quantum MDS codes from classical Hermitian self-orthogonal generalized
Reed-Solomon codes. We also present some classes of quantum codes from
matrix-product codes. It turns out that many of our quantum codes are new in
the sense that the parameters of quantum codes cannot be obtained from all
previous constructions.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2015 05:39:43 GMT"
}
] | 2015-08-06T00:00:00 |
[
[
"Zhang",
"Tao",
""
],
[
"Ge",
"Gennian",
""
]
] |
new_dataset
| 0.999802 |
1508.01076
|
Peter Palfrader
|
Oswin Aichholzer and Therese Biedl and Thomas Hackl and Martin Held
and Stefan Huber and Peter Palfrader and Birgit Vogtenhuber
|
Representing Directed Trees as Straight Skeletons
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The straight skeleton of a polygon is the geometric graph obtained by tracing
the vertices during a mitered offsetting process. It is known that the straight
skeleton of a simple polygon is a tree, and one can naturally derive directions
on the edges of the tree from the propagation of the shrinking process.
In this paper, we ask the reverse question: Given a tree with directed edges,
can it be the straight skeleton of a polygon? And if so, can we find a suitable
simple polygon? We answer these questions for all directed trees where the
order of edges around each node is fixed.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2015 13:58:59 GMT"
}
] | 2015-08-06T00:00:00 |
[
[
"Aichholzer",
"Oswin",
""
],
[
"Biedl",
"Therese",
""
],
[
"Hackl",
"Thomas",
""
],
[
"Held",
"Martin",
""
],
[
"Huber",
"Stefan",
""
],
[
"Palfrader",
"Peter",
""
],
[
"Vogtenhuber",
"Birgit",
""
]
] |
new_dataset
| 0.993234 |
1508.01177
|
Melanie JI M\"uller
|
Lucas Bernardi and Jaap Kamps and Julia Kiseleva and Melanie JI
M\"uller
|
The Continuous Cold Start Problem in e-Commerce Recommender Systems
|
6 pages, 3 figures. 2nd Workshop on New Trends in Content-Based
Recommender Systems, RecSys 2015
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many e-commerce websites use recommender systems to recommend items to users.
When a user or item is new, the system may fail because not enough information
is available on this user or item. Various solutions to this `cold-start
problem' have been proposed in the literature. However, many real-life
e-commerce applications suffer from an aggravated, recurring version of
cold-start even for known users or items, since many users visit the website
rarely, change their interests over time, or exhibit different personas. This
paper exposes the `Continuous Cold Start' (CoCoS) problem and its consequences
for content- and context-based recommendation from the viewpoint of typical
e-commerce applications, illustrated with examples from a major travel
recommendation website, Booking.com.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2015 19:03:49 GMT"
}
] | 2015-08-06T00:00:00 |
[
[
"Bernardi",
"Lucas",
""
],
[
"Kamps",
"Jaap",
""
],
[
"Kiseleva",
"Julia",
""
],
[
"Müller",
"Melanie JI",
""
]
] |
new_dataset
| 0.99158 |
1306.2068
|
Steffen Lewitzka
|
Steffen Lewitzka
|
A modal logic amalgam of classical and intuitionistic propositional
logic
|
18 pages
| null |
10.1093/logcom/exv048
| null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and
Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic
propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of
modal logic S4. In this paper, we extend an intuitionistic version of modal
logic S1+SP, introduced in our previous paper (S. Lewitzka, Algebraic semantics
for a modal logic close to S1, J. Logic and Comp., doi:10.1093/logcom/exu067)
to a classical modal logic L and prove the following: a propositional formula
$\varphi$ is a theorem of IPC iff $\square\varphi$ is a theorem of L (actually,
we show: $\Phi\vdash_{IPC}\varphi$ iff $\square\Phi\vdash_L\square\varphi$, for
propositional $\Phi,\varphi$). Thus, the map $\varphi\mapsto\square\varphi$ is
an embedding of IPC into L, i.e. L contains a copy of IPC. Moreover, L is a
conservative extension of classical propositional logic CPC. In this sense, L
is an amalgam of CPC and IPC. We show that L is sound and complete w.r.t. a
class of special Heyting algebras with a (non-normal) modal operator.
|
[
{
"version": "v1",
"created": "Sun, 9 Jun 2013 22:27:04 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Jun 2015 23:01:42 GMT"
}
] | 2015-08-05T00:00:00 |
[
[
"Lewitzka",
"Steffen",
""
]
] |
new_dataset
| 0.990296 |
1507.07969
|
Rogerio de Carvalho A
|
Rogerio Atem de Carvalho, Hudson Silva, Rafael Ferreira Toledo, Milena
Silveira de Azevedo
|
TDD for Embedded Systems: A Basic Approach and Toolset
|
07 pages, 05 figures, work in progress
| null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by-sa/4.0/
|
The evolution of information technology and electronics in general has been
consistently increasing the use of embedded systems. While hardware development
for these systems is already consistent, software development for embedded
systems still lacks a consolidated methodology. This paper describes a process
and toolset for Embedded Systems Validation and Verification using FSM (Finite
State Machines) and TDD (Test Driven Development).
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 21:50:06 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Aug 2015 21:37:56 GMT"
}
] | 2015-08-05T00:00:00 |
[
[
"de Carvalho",
"Rogerio Atem",
""
],
[
"Silva",
"Hudson",
""
],
[
"Toledo",
"Rafael Ferreira",
""
],
[
"de Azevedo",
"Milena Silveira",
""
]
] |
new_dataset
| 0.971039 |
1503.03790
|
Nikolaos Karapanos
|
Nikolaos Karapanos, Claudio Marforio, Claudio Soriente and Srdjan
Capkun
|
Sound-Proof: Usable Two-Factor Authentication Based on Ambient Sound
|
16 pages
| null | null | null |
cs.CR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two-factor authentication protects online accounts even if passwords are
leaked. Most users, however, prefer password-only authentication. One reason
why two-factor authentication is so unpopular is the extra steps that the user
must complete in order to log in. Currently deployed two-factor authentication
mechanisms require the user to interact with his phone to, for example, copy a
verification code to the browser. Two-factor authentication schemes that
eliminate user-phone interaction exist, but require additional software to be
deployed.
In this paper we propose Sound-Proof, a usable and deployable two-factor
authentication mechanism. Sound-Proof does not require interaction between the
user and his phone. In Sound-Proof the second authentication factor is the
proximity of the user's phone to the device being used to log in. The proximity
of the two devices is verified by comparing the ambient noise recorded by their
microphones. Audio recording and comparison are transparent to the user, so
that the user experience is similar to the one of password-only authentication.
Sound-Proof can be easily deployed as it works with current phones and major
browsers without plugins. We build a prototype for both Android and iOS. We
provide empirical evidence that ambient noise is a robust discriminant to
determine the proximity of two devices both indoors and outdoors, and even if
the phone is in a pocket or purse. We conduct a user study designed to compare
the perceived usability of Sound-Proof with Google 2-Step Verification.
Participants ranked Sound-Proof as more usable and the majority would be
willing to use Sound-Proof even for scenarios in which two-factor
authentication is optional.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 16:06:59 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Mar 2015 13:23:25 GMT"
},
{
"version": "v3",
"created": "Mon, 3 Aug 2015 11:52:39 GMT"
}
] | 2015-08-04T00:00:00 |
[
[
"Karapanos",
"Nikolaos",
""
],
[
"Marforio",
"Claudio",
""
],
[
"Soriente",
"Claudio",
""
],
[
"Capkun",
"Srdjan",
""
]
] |
new_dataset
| 0.99815 |
1505.03340
|
Tomas Balyo
|
Tomas Balyo, Peter Sanders, Carsten Sinz
|
HordeSat: A Massively Parallel Portfolio SAT Solver
|
Accepted for SAT 2015
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A simple yet successful approach to parallel satisfiability (SAT) solving is
to run several different (a portfolio of) SAT solvers on the input problem at
the same time until one solver finds a solution. The SAT solvers in the
portfolio can be instances of a single solver with different configuration
settings. Additionally the solvers can exchange information usually in the form
of clauses. In this paper we investigate whether this approach is applicable in
the case of massively parallel SAT solving. Our solver is intended to run on
clusters with thousands of processors, hence the name HordeSat. HordeSat is a
fully distributed portfolio-based SAT solver with a modular design that allows
it to use any SAT solver that implements a given interface. HordeSat has a
decentralized design and features hierarchical parallelism with interleaved
communication and search. We experimentally evaluated it using all the
benchmark problems from the application tracks of the 2011 and 2014
International SAT Competitions. The experiments demonstrate that HordeSat is
scalable up to hundreds or even thousands of processors achieving significant
speedups especially for hard instances.
|
[
{
"version": "v1",
"created": "Wed, 13 May 2015 11:52:25 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Aug 2015 14:01:14 GMT"
}
] | 2015-08-04T00:00:00 |
[
[
"Balyo",
"Tomas",
""
],
[
"Sanders",
"Peter",
""
],
[
"Sinz",
"Carsten",
""
]
] |
new_dataset
| 0.98558 |
1507.07246
|
Georg Struth
|
Georg Struth
|
On the Expressive Power of Kleene Algebra with Domain
|
Typos have been corrected
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that antidomain semirings are more expressive than test semirings
and that Kleene algebras with domain are more expressive than Kleene algebras
with tests. It is also shown that Kleene algebras with domain are expressive
for propositional Hoare logic whereas Kleene algebras with tests are not.
|
[
{
"version": "v1",
"created": "Sun, 26 Jul 2015 20:25:52 GMT"
},
{
"version": "v2",
"created": "Sun, 2 Aug 2015 15:17:09 GMT"
}
] | 2015-08-04T00:00:00 |
[
[
"Struth",
"Georg",
""
]
] |
new_dataset
| 0.993041 |
1508.00055
|
Peter Gloor
|
Peter A. Gloor, Joao Marcos, Patrick M. de Boer, Hauke Fuehres, Wei
Lo, Keiichi Nemoto
|
Cultural Anthropology through the Lens of Wikipedia: Historical Leader
Networks, Gender Bias, and News-based Sentiment
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study the differences in historical World View between
Western and Eastern cultures, represented through the English, the Chinese,
Japanese, and German Wikipedia. In particular, we analyze the historical
networks of the World's leaders since the beginning of written history,
comparing them in the different Wikipedias and assessing cultural chauvinism.
We also identify the most influential female leaders of all times in the
English, German, Spanish, and Portuguese Wikipedia. As an additional lens into
the soul of a culture we compare top terms, sentiment, emotionality, and
complexity of the English, Portuguese, Spanish, and German Wikinews.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 23:46:30 GMT"
}
] | 2015-08-04T00:00:00 |
[
[
"Gloor",
"Peter A.",
""
],
[
"Marcos",
"Joao",
""
],
[
"de Boer",
"Patrick M.",
""
],
[
"Fuehres",
"Hauke",
""
],
[
"Lo",
"Wei",
""
],
[
"Nemoto",
"Keiichi",
""
]
] |
new_dataset
| 0.986356 |
1508.00068
|
Heping Jiang
|
Heping Jiang
|
A New Property of Hamilton Graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is
called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem
is to find the sufficient and necessary condition that a graph is Hamiltonian.
In this paper, we give out some new kind of definitions of the subgraphs and
determine the Hamiltoncity of edges according to the existence of the subgraphs
in a graph, and then obtain a new property of Hamilton graphs as being a
necessary and sufficient condition characterized in the connectivity of the
subgraph that induced from the cycle structure of a given graph.
|
[
{
"version": "v1",
"created": "Sat, 1 Aug 2015 01:56:14 GMT"
}
] | 2015-08-04T00:00:00 |
[
[
"Jiang",
"Heping",
""
]
] |
new_dataset
| 0.999119 |
1508.00307
|
Weilin Huang
|
Sheng Guo and Weilin Huang and Yu Qiao
|
Local Color Contrastive Descriptor for Image Classification
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image representation and classification are two fundamental tasks towards
multimedia content retrieval and understanding. The idea that shape and texture
information (e.g. edge or orientation) are the key features for visual
representation is ingrained and dominated in current multimedia and computer
vision communities. A number of low-level features have been proposed by
computing local gradients (e.g. SIFT, LBP and HOG), and have achieved great
successes on numerous multimedia applications. In this paper, we present a
simple yet efficient local descriptor for image classification, referred as
Local Color Contrastive Descriptor (LCCD), by leveraging the neural mechanisms
of color contrast. The idea originates from the observation in neural science
that color and shape information are linked inextricably in visual cortical
processing. The color contrast yields key information for visual color
perception and provides strong linkage between color and shape. We propose a
novel contrastive mechanism to compute the color contrast in both spatial
location and multiple channels. The color contrast is computed by measuring
\emph{f}-divergence between the color distributions of two regions. Our
descriptor enriches local image representation with both color and contrast
information. We verified experimentally that it can compensate strongly for the
shape based descriptor (e.g. SIFT), while keeping computationally simple.
Extensive experimental results on image classification show that our descriptor
improves the performance of SIFT substantially by combinations, and achieves
the state-of-the-art performance on three challenging benchmark datasets. It
improves recent Deep Learning model (DeCAF) [1] largely from the accuracy of
40.94% to 49.68% in the large scale SUN397 database. Codes for the LCCD will be
available.
|
[
{
"version": "v1",
"created": "Mon, 3 Aug 2015 03:29:50 GMT"
}
] | 2015-08-04T00:00:00 |
[
[
"Guo",
"Sheng",
""
],
[
"Huang",
"Weilin",
""
],
[
"Qiao",
"Yu",
""
]
] |
new_dataset
| 0.956921 |
1508.00504
|
Matilde Marcolli
|
Karthik Siva, Jim Tao, Matilde Marcolli
|
Spin Glass Models of Syntax and Language Evolution
|
19 pages, LaTeX, 20 png figures
| null | null | null |
cs.CL cond-mat.dis-nn physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using the SSWL database of syntactic parameters of world languages, and the
MIT Media Lab data on language interactions, we construct a spin glass model of
language evolution. We treat binary syntactic parameters as spin states, with
languages as vertices of a graph, and assigned interaction energies along the
edges. We study a rough model of syntax evolution, under the assumption that a
strong interaction energy tends to cause parameters to align, as in the case of
ferromagnetic materials. We also study how the spin glass model needs to be
modified to account for entailment relations between syntactic parameters. This
modification leads naturally to a generalization of Potts models with external
magnetic field, which consists of a coupling at the vertices of an Ising model
and a Potts model with q=3, that have the same edge interactions. We describe
the results of simulations of the dynamics of these models, in different
temperature and energy regimes. We discuss the linguistic interpretation of the
parameters of the physical model.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 16:21:17 GMT"
}
] | 2015-08-04T00:00:00 |
[
[
"Siva",
"Karthik",
""
],
[
"Tao",
"Jim",
""
],
[
"Marcolli",
"Matilde",
""
]
] |
new_dataset
| 0.966509 |
1402.6779
|
Aleksandrs Slivkins
|
Ashwinkumar Badanidiyuru and John Langford and Aleksandrs Slivkins
|
Resourceful Contextual Bandits
|
This is the full version of a paper in COLT 2014. Version history:
(v2) Added some details to one of the proofs, (v3) a big revision following
comments from COLT reviewers (but no new results), (v4) edits in related
work, minor edits elsewhere. (v6) A correction for Theorem 3, corollary for
contextual dynamic pricing with discretization; updated follow-up work & open
questions
| null | null | null |
cs.LG cs.DS cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study contextual bandits with ancillary constraints on resources, which
are common in real-world applications such as choosing ads or dynamic pricing
of items. We design the first algorithm for solving these problems that handles
constrained resources other than time, and improves over a trivial reduction to
the non-contextual case. We consider very general settings for both contextual
bandits (arbitrary policy sets, e.g. Dudik et al. (UAI'11)) and bandits with
resource constraints (bandits with knapsacks, Badanidiyuru et al. (FOCS'13)),
and prove a regret guarantee with near-optimal statistical properties.
|
[
{
"version": "v1",
"created": "Thu, 27 Feb 2014 03:17:19 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Apr 2014 22:00:13 GMT"
},
{
"version": "v3",
"created": "Mon, 19 May 2014 23:01:03 GMT"
},
{
"version": "v4",
"created": "Tue, 1 Jul 2014 14:55:01 GMT"
},
{
"version": "v5",
"created": "Mon, 13 Jul 2015 00:12:19 GMT"
},
{
"version": "v6",
"created": "Fri, 31 Jul 2015 18:31:27 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Badanidiyuru",
"Ashwinkumar",
""
],
[
"Langford",
"John",
""
],
[
"Slivkins",
"Aleksandrs",
""
]
] |
new_dataset
| 0.95438 |
1507.08495
|
Maurice Margenstern
|
Maurice Margenstern
|
About embedded quarters and points at infinity in the hyperbolic plane
|
17 pages, 5 figures
| null | null | null |
cs.CG math.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we prove two results. First, there is a family of sequences of
embedded quarters of the hyperbolic plane such that any sequence converges to a
limit which is an end of the hyperbolic plane. Second, there is no algorithm
which would allow us to check whether two given ends are equal or not.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 13:33:05 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Margenstern",
"Maurice",
""
]
] |
new_dataset
| 0.992013 |
1507.08599
|
Pablo Arag\'on
|
Pablo Arag\'on, Yana Volkovich, David Laniado, Andreas Kaltenbrunner
|
When a Movement Becomes a Party: The 2015 Barcelona City Council
Election
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Barcelona en Com\'u, an emerging grassroots movement-party, won the 2015
Barcelona City Council election. This candidacy was devised by activists
involved in the 15M movement in order to turn citizen outrage into political
change. On the one hand, the 15M movement is based on a decentralized
structure. On the other hand, political science literature postulates that
parties historically develop oligarchical leadership structures. This tension
motivates us to examine whether Barcelona en Com\'u preserved a decentralizated
structure or adopted a conventional centralized organization. In this article
we analyse the Twitter networks of the parties that ran for this election by
measuring their hierarchical structure, information efficiency and social
resilience. Our results show that in Barcelona en Com\'u two well-defined
groups co-exist: a cluster dominated by the leader and the collective accounts,
and another cluster formed by the movement activists. While the former group is
highly centralized like the other major parties, the latter one stands out for
its decentralized, cohesive and resilient structure.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 17:54:29 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Aragón",
"Pablo",
""
],
[
"Volkovich",
"Yana",
""
],
[
"Laniado",
"David",
""
],
[
"Kaltenbrunner",
"Andreas",
""
]
] |
new_dataset
| 0.999438 |
1507.08694
|
Lim Binjie Benjamin
|
Benjamin Lim
|
Android Tapjacking Vulnerability
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Android is an open source mobile operating system that is developed mainly by
Google. It is used on a significant portion of mobile devices worldwide. In
this paper, I will be looking at an attack commonly known as tapjacking. I will
be taking the attack apart and walking through each individual step required to
implement the attack. I will then explore the various payload options available
to an attacker. Lastly, I will touch on the feasibility of the attack as well
as mitigation strategies.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 21:28:03 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Lim",
"Benjamin",
""
]
] |
new_dataset
| 0.991792 |
1507.08718
|
EPTCS
|
Mark Adams (Proof Technologies Ltd, UK and Radboud University,
Nijmegen, The Netherlands)
|
The Common HOL Platform
|
In Proceedings PxTP 2015, arXiv:1507.08375
|
EPTCS 186, 2015, pp. 42-56
|
10.4204/EPTCS.186.6
| null |
cs.LO cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Common HOL project aims to facilitate porting source code and proofs
between members of the HOL family of theorem provers. At the heart of the
project is the Common HOL Platform, which defines a standard HOL theory and API
that aims to be compatible with all HOL systems. So far, HOL Light and hol90
have been adapted for conformance, and HOL Zero was originally developed to
conform. In this paper we provide motivation for a platform, give an overview
of the Common HOL Platform's theory and API components, and show how to adapt
legacy systems. We also report on the platform's successful application in the
hand-translation of a few thousand lines of source code from HOL Light to HOL
Zero.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 00:58:52 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Adams",
"Mark",
"",
"Proof Technologies Ltd, UK and Radboud University,\n Nijmegen, The Netherlands"
]
] |
new_dataset
| 0.992988 |
1507.08719
|
EPTCS
|
Rapha\"el Cauderlier (Inria), Pierre Halmagrand (Inria)
|
Checking Zenon Modulo Proofs in Dedukti
|
In Proceedings PxTP 2015, arXiv:1507.08375
|
EPTCS 186, 2015, pp. 57-73
|
10.4204/EPTCS.186.7
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dedukti has been proposed as a universal proof checker. It is a logical
framework based on the lambda Pi calculus modulo that is used as a backend to
verify proofs coming from theorem provers, especially those implementing some
form of rewriting. We present a shallow embedding into Dedukti of proofs
produced by Zenon Modulo, an extension of the tableau-based first-order theorem
prover Zenon to deduction modulo and typing. Zenon Modulo is applied to the
verification of programs in both academic and industrial projects. The purpose
of our embedding is to increase the confidence in automatically generated
proofs by separating untrusted proof search from trusted proof verification.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 00:59:08 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Cauderlier",
"Raphaël",
"",
"Inria"
],
[
"Halmagrand",
"Pierre",
"",
"Inria"
]
] |
new_dataset
| 0.997157 |
1507.08720
|
EPTCS
|
Ali Assaf (Inria, Ecole Polytechnique), Guillaume Burel
(ENSIIE/C\'edric)
|
Translating HOL to Dedukti
|
In Proceedings PxTP 2015, arXiv:1507.08375
|
EPTCS 186, 2015, pp. 74-88
|
10.4204/EPTCS.186.8
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dedukti is a logical framework based on the lambda-Pi-calculus modulo
rewriting, which extends the lambda-Pi-calculus with rewrite rules. In this
paper, we show how to translate the proofs of a family of HOL proof assistants
to Dedukti. The translation preserves binding, typing, and reduction. We
implemented this translation in an automated tool and used it to successfully
translate the OpenTheory standard library.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 00:59:11 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Assaf",
"Ali",
"",
"Inria, Ecole Polytechnique"
],
[
"Burel",
"Guillaume",
"",
"ENSIIE/Cédric"
]
] |
new_dataset
| 0.99217 |
1507.08721
|
EPTCS
|
Ali Assaf (Inria, Ecole Polytechnique), Rapha\"el Cauderlier (Inria,
CNAM)
|
Mixing HOL and Coq in Dedukti (Extended Abstract)
|
In Proceedings PxTP 2015, arXiv:1507.08375
|
EPTCS 186, 2015, pp. 89-96
|
10.4204/EPTCS.186.9
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use Dedukti as a logical framework for interoperability. We use automated
tools to translate different developments made in HOL and in Coq to Dedukti,
and we combine them to prove new results. We illustrate our approach with a
concrete example where we instantiate a sorting algorithm written in Coq with
the natural numbers of HOL.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 00:59:19 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Assaf",
"Ali",
"",
"Inria, Ecole Polytechnique"
],
[
"Cauderlier",
"Raphaël",
"",
"Inria,\n CNAM"
]
] |
new_dataset
| 0.981749 |
1507.08733
|
Hirosuke Yamamoto
|
Hirosuke Yamamoto, Masato Tsuchihashi, and Junya Honda
|
Almost Instantaneous Fix-to-Variable Length Codes
|
Submitted to the IEEE Transactions on Information Theory in October
2014, and revised in July 205
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose almost instantaneous fixed-to-variable-length (AIFV) codes such
that two (resp. $K-1$) code trees are used if code symbols are binary (resp.
$K$-ary for $K \geq 3$), and source symbols are assigned to incomplete internal
nodes in addition to leaves. Although the AIFV codes are not instantaneous
codes, they are devised such that the decoding delay is at most two bits (resp.
one code symbol) in the case of binary (resp. $K$-ary) code alphabet. The AIFV
code can attain better average compression rate than the Huffman code at the
expenses of a little decoding delay and a little large memory size to store
multiple code trees. We also show for the binary and ternary AIFV codes that
the optimal AIFV code can be obtained by solving 0-1 integer programming
problems.
|
[
{
"version": "v1",
"created": "Fri, 31 Jul 2015 02:42:08 GMT"
}
] | 2015-08-03T00:00:00 |
[
[
"Yamamoto",
"Hirosuke",
""
],
[
"Tsuchihashi",
"Masato",
""
],
[
"Honda",
"Junya",
""
]
] |
new_dataset
| 0.999442 |
1503.01981
|
Andr\'e Platzer
|
Andr\'e Platzer
|
A Uniform Substitution Calculus for Differential Dynamic Logic
| null | null |
10.1007/978-3-319-21401-6_32
| null |
cs.LO cs.PL math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new proof calculus for differential dynamic logic
(dL) that is entirely based on uniform substitution, a proof rule that
substitutes a formula for a predicate symbol everywhere. Uniform substitutions
make it possible to rely on axioms rather than axiom schemata, substantially
simplifying implementations. Instead of nontrivial schema variables and
soundness-critical side conditions on the occurrence patterns of variables, the
resulting calculus adopts only a finite number of ordinary dL formulas as
axioms. The static semantics of differential dynamic logic is captured
exclusively in uniform substitutions and bound variable renamings as opposed to
being spread in delicate ways across the prover implementation. In addition to
sound uniform substitutions, this paper introduces differential forms for
differential dynamic logic that make it possible to internalize differential
invariants, differential substitutions, and derivations as first-class axioms
in dL.
|
[
{
"version": "v1",
"created": "Fri, 6 Mar 2015 15:05:30 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Mar 2015 15:23:32 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Apr 2015 19:53:19 GMT"
},
{
"version": "v4",
"created": "Fri, 15 May 2015 02:22:37 GMT"
},
{
"version": "v5",
"created": "Thu, 30 Jul 2015 19:18:02 GMT"
}
] | 2015-07-31T00:00:00 |
[
[
"Platzer",
"André",
""
]
] |
new_dataset
| 0.956702 |
1504.01379
|
Zhihan Lv
|
Zhihan Lv and Xiaoming Li and Baoyun Zhang and Weixi Wang and
Shengzhong Feng and Jinxing Hu
|
Preprint Big City 3D Visual Analysis
|
This is the preprint version of our paper on EUROGRAPHICS 2015
| null | null | null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the preprint version of our paper on EUROGRAPHICS 2015. A big city
visual analysis platform based on Web Virtual Reality Geographical Information
System (WEBVRGIS) is presented. Extensive model editing functions and spatial
analysis functions are available, including terrain analysis, spatial analysis,
sunlight analysis, traffic analysis, population analysis and community
analysis.
|
[
{
"version": "v1",
"created": "Mon, 6 Apr 2015 15:53:09 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Jul 2015 20:57:06 GMT"
}
] | 2015-07-31T00:00:00 |
[
[
"Lv",
"Zhihan",
""
],
[
"Li",
"Xiaoming",
""
],
[
"Zhang",
"Baoyun",
""
],
[
"Wang",
"Weixi",
""
],
[
"Feng",
"Shengzhong",
""
],
[
"Hu",
"Jinxing",
""
]
] |
new_dataset
| 0.996192 |
1507.08447
|
Minati Mishra Dr.
|
Minati Mishra
|
Ethical, Legal and Social aspects of Information and Communication
Technology
|
Proceedings of UGC sponsored Seminar on Ethics and Human Values,Sept
2007, 66-71
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this era of computers and communication technology where computers and
internet have made their ways to every sphere of life from offices to
residences, reservation counters to banks to post offices, small retail shops
to big organizations, health care units to entertainment industries etc., there
emerged numerous questions regarding the ethical and legal uses of Information
and Communication Technology (ICT). Like any other technological inventions ICT
too has created both positive and negative impacts on the society. This paper
aims at exploring some of these issues in brief.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 10:48:59 GMT"
}
] | 2015-07-31T00:00:00 |
[
[
"Mishra",
"Minati",
""
]
] |
new_dataset
| 0.998052 |
1507.08475
|
Ana Barroso
|
Ana Barroso
|
aDTN - Undetectable Communication in Wireless Delay-tolerant Networks
(Working Draft)
| null | null | null | null |
cs.CR cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This document describes a best-effort delay-tolerant communication system
that protects the privacy of users in wireless ad-hoc networks by making their
communication undetectable. The proposed system is a wireless broadcast-based
adaptation of mix networks where each user belongs to at least one group it
trusts, and each group acts as a mix node. Assuming encryption is not broken,
it provides undetectability of all users and messages against external
adversaries, as well as undetectability of users and messages in
non-compromised groups against internal adversaries.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 12:22:38 GMT"
}
] | 2015-07-31T00:00:00 |
[
[
"Barroso",
"Ana",
""
]
] |
new_dataset
| 0.98814 |
1507.08569
|
Mohsen Yaghoubi Suraki
|
Mohsen Yaghoubi Suraki, Morteza Yaghoubi Suraki, Leila SourakiAzad
|
HMIoT: A New Healthcare Model Based on Internet of Things
|
8 pages, 9 figures, Journal
|
IJCSI International Journal of Computer Science Issues, Volume 12,
Issue 1, No 1, January 2015 ISSN (Print): 1694-0814 | ISSN (Online):
1694-0784 www.IJCSI.org
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent century, with developing of equipment, using of the internet and
things connected to the internet is growing. Therefore, the need for informing
in the process of expanding the scope of its application is very necessary and
important. These days, using intelligent and autonomous devices in our daily
lives has become commonplace and the Internet is the most important part of the
relationship between these tools and even at close distances also. Things
connected to the Internet that are currently in use and can be inclusive of all
the sciences as a step to develop and coordinate of them. In this paper we
investigate application and using of Internet of things from the perspective of
various sciences. We show that how this phenomenon can influence on future
health of people.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 20:18:18 GMT"
}
] | 2015-07-31T00:00:00 |
[
[
"Suraki",
"Mohsen Yaghoubi",
""
],
[
"Suraki",
"Morteza Yaghoubi",
""
],
[
"SourakiAzad",
"Leila",
""
]
] |
new_dataset
| 0.970432 |
1507.08582
|
Giovanni Pighizzini
|
Giovanni Pighizzini
|
One-Tape Turing Machine Variants and Language Recognition
|
20 pages. This article will appear in the Complexity Theory Column of
the September 2015 issue of SIGACT News
| null | null | null |
cs.FL cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present two restricted versions of one-tape Turing machines. Both
characterize the class of context-free languages. In the first version,
proposed by Hibbard in 1967 and called limited automata, each tape cell can be
rewritten only in the first $d$ visits, for a fixed constant $d\geq 2$.
Furthermore, for $d=2$ deterministic limited automata are equivalent to
deterministic pushdown automata, namely they characterize deterministic
context-free languages. Further restricting the possible operations, we
consider strongly limited automata. These models still characterize
context-free languages. However, the deterministic version is less powerful
than the deterministic version of limited automata. In fact, there exist
deterministic context-free languages that are not accepted by any deterministic
strongly limited automaton.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2015 16:58:23 GMT"
}
] | 2015-07-31T00:00:00 |
[
[
"Pighizzini",
"Giovanni",
""
]
] |
new_dataset
| 0.980252 |
1504.01030
|
Zhihan Lv
|
Zhihan Lv, Chantal Esteve, Javier Chirivella, Pablo Gagliardo
|
Preprint A Game Based Assistive Tool for Rehabilitation of Dysphonic
Patients
|
This is the preprint version of our paper on 3rd International
Workshop on Virtual and Augmented Assistive Technology (VAAT) at IEEE Virtual
Reality 2015 (VR2015)
| null | null | null |
cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the preprint version of our paper on 3rd International Workshop on
Virtual and Augmented Assistive Technology (VAAT) at IEEE Virtual Reality 2015
(VR2015). An assistive training tool for rehabilitation of dysphonic patients
is designed and developed according to the practical clinical needs. The
assistive tool employs a space flight game as the attractive logic part, and
microphone arrays as input device, which is getting rid of ambient noise by
setting a specific orientation. The therapist can guide the patient to play the
game as well as the voice training simultaneously side by side, while not
interfere the patient voice. The voice information can be recorded and
extracted for evaluating the long-time rehabilitation progress. This paper
outlines a design science approach for the development of an initial useful
software prototype of such a tool, considering 'Intuitive', 'Entertainment',
'Incentive' as main design factors.
|
[
{
"version": "v1",
"created": "Sat, 4 Apr 2015 17:43:54 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Jul 2015 08:47:30 GMT"
}
] | 2015-07-30T00:00:00 |
[
[
"Lv",
"Zhihan",
""
],
[
"Esteve",
"Chantal",
""
],
[
"Chirivella",
"Javier",
""
],
[
"Gagliardo",
"Pablo",
""
]
] |
new_dataset
| 0.995021 |
1505.01056
|
Zhihan Lv
|
Xiaoming Li, Zhihan Lv, Weixi Wang, Chen Wu, Jinxing Hu
|
Preprint Virtual Reality GIS and Cloud Service Based Traffic Analysis
Platform
|
This is the preprint version of our paper on The 23rd International
Conference on Geoinformatics (Geoinformatics2015)
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the preprint version of our paper on The 23rd International
Conference on Geoinformatics (Geoinformatics2015). City traffic data has
several characteristics, such as large scale, diverse predictable and
real-time, which falls in the range of definition of Big Data. This paper
proposed a cloud service platform which targets for wise transportation is to
carry out unified management and mining analysis of the huge number of the
multivariate and heterogeneous dynamic transportation information, provides
real-time transportation information, increase the utilization efficiency of
transportation, promote transportation management and service level of travel
information and provide decision support of transportation management by
virtual reality as visual.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 15:57:36 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Jul 2015 08:32:30 GMT"
}
] | 2015-07-30T00:00:00 |
[
[
"Li",
"Xiaoming",
""
],
[
"Lv",
"Zhihan",
""
],
[
"Wang",
"Weixi",
""
],
[
"Wu",
"Chen",
""
],
[
"Hu",
"Jinxing",
""
]
] |
new_dataset
| 0.969282 |
1507.06711
|
Shitao Weng
|
Shitao Weng, Shushan Chen, Lei Yu, Xuewei Wu, Weicheng Cai, Zhi Liu,
Ming Li
|
The SYSU System for the Interspeech 2015 Automatic Speaker Verification
Spoofing and Countermeasures Challenge
|
5 pages, 1 figure
| null | null | null |
cs.SD cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many existing speaker verification systems are reported to be vulnerable
against different spoofing attacks, for example speaker-adapted speech
synthesis, voice conversion, play back, etc. In order to detect these spoofed
speech signals as a countermeasure, we propose a score level fusion approach
with several different i-vector subsystems. We show that the acoustic level
Mel-frequency cepstral coefficients (MFCC) features, the phase level modified
group delay cepstral coefficients (MGDCC) and the phonetic level phoneme
posterior probability (PPP) tandem features are effective for the
countermeasure. Furthermore, feature level fusion of these features before
i-vector modeling also enhance the performance. A polynomial kernel support
vector machine is adopted as the supervised classifier. In order to enhance the
generalizability of the countermeasure, we also adopted the cosine similarity
and PLDA scoring as one-class classifications methods. By combining the
proposed i-vector subsystems with the OpenSMILE baseline which covers the
acoustic and prosodic information further improves the final performance. The
proposed fusion system achieves 0.29% and 3.26% EER on the development and test
set of the database provided by the INTERSPEECH 2015 automatic speaker
verification spoofing and countermeasures challenge.
|
[
{
"version": "v1",
"created": "Fri, 24 Jul 2015 00:36:01 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Jul 2015 15:41:04 GMT"
}
] | 2015-07-30T00:00:00 |
[
[
"Weng",
"Shitao",
""
],
[
"Chen",
"Shushan",
""
],
[
"Yu",
"Lei",
""
],
[
"Wu",
"Xuewei",
""
],
[
"Cai",
"Weicheng",
""
],
[
"Liu",
"Zhi",
""
],
[
"Li",
"Ming",
""
]
] |
new_dataset
| 0.983652 |
1507.08052
|
EPTCS
|
Amy Felty (University of Ottawa), Alberto Momigliano (Universita degli
Studi di Milano), Brigitte Pientka (McGill University)
|
An Open Challenge Problem Repository for Systems Supporting Binders
|
In Proceedings LFMTP 2015, arXiv:1507.07597
|
EPTCS 185, 2015, pp. 18-32
|
10.4204/EPTCS.185.2
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A variety of logical frameworks support the use of higher-order abstract
syntax in representing formal systems; however, each system has its own set of
benchmarks. Even worse, general proof assistants that provide special libraries
for dealing with binders offer a very limited evaluation of such libraries, and
the examples given often do not exercise and stress-test key aspects that arise
in the presence of binders. In this paper we design an open repository ORBI
(Open challenge problem Repository for systems supporting reasoning with
BInders). We believe the field of reasoning about languages with binders has
matured, and a common set of benchmarks provides an important basis for
evaluation and qualitative comparison of different systems and libraries that
support binders, and it will help to advance the field.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2015 08:20:55 GMT"
}
] | 2015-07-30T00:00:00 |
[
[
"Felty",
"Amy",
"",
"University of Ottawa"
],
[
"Momigliano",
"Alberto",
"",
"Universita degli\n Studi di Milano"
],
[
"Pientka",
"Brigitte",
"",
"McGill University"
]
] |
new_dataset
| 0.988022 |
1507.08055
|
EPTCS
|
Ronan Saillard (MINES ParisTech, PSL Research University, France)
|
Rewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
|
In Proceedings LFMTP 2015, arXiv:1507.07597
|
EPTCS 185, 2015, pp. 87-101
|
10.4204/EPTCS.185.6
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with
dependent types where beta-conversion is extended with user-defined rewrite
rules. It is an expressive logical framework and has been used to encode logics
and type systems in a shallow way. Basic properties such as subject reduction
or uniqueness of types do not hold in general in the lambda-Pi-calculus Modulo.
However, they hold if the rewrite system generated by the rewrite rules
together with beta-reduction is confluent. But this is too restrictive. To
handle the case where non confluence comes from the interference between the
beta-reduction and rewrite rules with lambda-abstraction on their left-hand
side, we introduce a notion of rewriting modulo beta for the lambda-Pi-calculus
Modulo. We prove that confluence of rewriting modulo beta is enough to ensure
subject reduction and uniqueness of types. We achieve our goal by encoding the
lambda-Pi-calculus Modulo into Higher-Order Rewrite System (HRS). As a
consequence, we also make the confluence results for HRSs available for the
lambda-Pi-calculus Modulo.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2015 08:21:36 GMT"
}
] | 2015-07-30T00:00:00 |
[
[
"Saillard",
"Ronan",
"",
"MINES ParisTech, PSL Research University, France"
]
] |
new_dataset
| 0.98947 |
1507.08109
|
Alexander Evako V
|
Alexander V. Evako
|
Parabolic equations on digital spaces. Solutions on the digital Moebius
strip and the digital projective plane
|
10 pages, 6 figures
| null | null | null |
cs.DM math.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we define a parabolic equation on digital spaces and study its
properties. The equation can be used in investigation of mechanical,
aerodynamic, structural and technological properties of a Moebius strip, which
is used as a basic element of a new configuration of an airplane wing.
Condition for existence of exact solutions by a matrix method and a method of
separation of variables are studied and determined. As examples, numerical
solutions on Moebius strip and projective plane are presented.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2015 12:02:48 GMT"
}
] | 2015-07-30T00:00:00 |
[
[
"Evako",
"Alexander V.",
""
]
] |
new_dataset
| 0.994482 |
1507.08233
|
Marc-Olivier Arsenault
|
Marc-Olivier Arsenault, Hanen Garcia Gamardo, Kim-Khoa Nguyen, Mohamed
Cheriet
|
Session-based Communication for Vital Machine-to-Machine Applications
|
12 pages, S2CT
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although the machine to machine (M2M) communication has been emerging in
recent years, many vendors' specific proprietary solutions are not suitable for
vital M2M applications. While the main focus of those solutions is management
and provisioning of machines, real-time monitoring and communication control
are also required to handle a variety of access technologies, like WiFi and
LTE, and unleash machine deployment. In this paper, we present a new
architecture addressing these issues by leveraging the IP Multimedia Subsystem
(IMS) deployed in operator's networks for RCS and VoLTE.
|
[
{
"version": "v1",
"created": "Wed, 29 Jul 2015 17:37:29 GMT"
}
] | 2015-07-30T00:00:00 |
[
[
"Arsenault",
"Marc-Olivier",
""
],
[
"Gamardo",
"Hanen Garcia",
""
],
[
"Nguyen",
"Kim-Khoa",
""
],
[
"Cheriet",
"Mohamed",
""
]
] |
new_dataset
| 0.98677 |
1409.5141
|
Xishuo Liu
|
Xishuo Liu, Stark C. Draper
|
ADMM LP decoding of non-binary LDPC codes in $\mathbb{F}_{2^m}$
|
This work was supported by the National Science Foundation (NSF)
under Grants CCF-1217058 and by a Natural Sciences and Engineering Research
Council of Canada (NSERC) Discovery Research Grant. This paper was submitted
to IEEE Trans. Inf. Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we develop efficient decoders for non-binary low-density
parity-check (LDPC) codes using the alternating direction method of multipliers
(ADMM). We apply ADMM to two decoding problems. The first problem is linear
programming (LP) decoding. In order to develop an efficient algorithm, we focus
on non-binary codes in fields of characteristic two. This allows us to
transform each constraint in $\mathbb{F}_{2^m}$ to a set of constraints in
$\mathbb{F}_{2}$ that has a factor graph representation. Applying ADMM to the
LP decoding problem results in two types of non-trivial sub-routines. The first
type requires us to solve an unconstrained quadratic program. We solve this
problem efficiently by leveraging new results obtained from studying the above
factor graphs. The second type requires Euclidean projection onto polytopes
that are studied in the literature, a projection that can be solved efficiently
using off-the-shelf techniques, which scale linearly in the dimension of the
vector to project. ADMM LP decoding scales linearly with block length, linearly
with check degree, and quadratically with field size. The second problem we
consider is a penalized LP decoding problem. This problem is obtained by
incorporating a penalty term into the LP decoding objective. The purpose of the
penalty term is to make non-integer solutions (pseudocodewords) more expensive
and hence to improve decoding performance. The ADMM algorithm for the penalized
LP problem requires Euclidean projection onto a polytope formed by embedding
the constraints specified by the non-binary single parity-check code, which can
be solved by applying the ADMM technique to the resulting quadratic program.
Empirically, this decoder achieves a much reduced error rate than LP decoding
at low signal-to-noise ratios.
|
[
{
"version": "v1",
"created": "Wed, 17 Sep 2014 20:40:47 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jul 2015 03:10:00 GMT"
}
] | 2015-07-29T00:00:00 |
[
[
"Liu",
"Xishuo",
""
],
[
"Draper",
"Stark C.",
""
]
] |
new_dataset
| 0.973394 |
1507.07628
|
Xishuo Liu
|
Xishuo Liu, Stark C. Draper
|
LP-decodable multipermutation codes
|
This work was supported by the National Science Foundation (NSF)
under Grants CCF-1217058 and by a Natural Sciences and Engineering Research
Council of Canada (NSERC) Discovery Research Grant. This paper was submitted
to IEEE Trans. Inf. Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new way of constructing and decoding
multipermutation codes. Multipermutations are permutations of a multiset that
generally consist of duplicate entries. We first introduce a class of binary
matrices called multipermutation matrices, each of which corresponds to a
unique and distinct multipermutation. By enforcing a set of linear constraints
on these matrices, we define a new class of codes that we term LP-decodable
multipermutation codes. In order to decode these codes using a linear program
(LP), thereby enabling soft decoding, we characterize the convex hull of
multipermutation matrices. This characterization allows us to relax the coding
constraints to a polytope and to derive two LP decoding problems. These two
problems are respectively formulated by relaxing the maximum likelihood
decoding problem and the minimum Chebyshev distance decoding problem.
Because these codes are non-linear, we also study efficient encoding and
decoding algorithms. We first describe an algorithm that maps consecutive
integers, one by one, to an ordered list of multipermutations. Based on this
algorithm, we develop an encoding algorithm for a code proposed by Shieh and
Tsai, a code that falls into our class of LP-decodable multipermutation codes.
Regarding decoding algorithms, we propose an efficient distributed decoding
algorithm based on the alternating direction method of multipliers (ADMM).
Finally, we observe from simulation results that the soft decoding techniques
we introduce can significantly outperform hard decoding techniques that are
based on quantized channel outputs.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 03:22:48 GMT"
}
] | 2015-07-29T00:00:00 |
[
[
"Liu",
"Xishuo",
""
],
[
"Draper",
"Stark C.",
""
]
] |
new_dataset
| 0.998838 |
1507.07632
|
Kristina Lerman
|
Luciano Gallegos, Kristina Lerman, Arthur Huang and David Garcia
|
Geography of Emotion: Where in a City are People Happier?
|
submitted to WSDM
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Location-sharing services were built upon people's desire to share their
activities and locations with others. By "checking-in" to a place, such as a
restaurant, a park, gym, or train station, people disclose where they are,
thereby providing valuable information about land use and utilization of
services in urban areas. This information may, in turn, be used to design
smarter, happier, more equitable cities. We use data from Foursquare
location-sharing service to identify areas within a major US metropolitan area
with many check-ins, i.e., areas that people like to use. We then use data from
the Twitter microblogging platform to analyze the properties of these areas.
Specifically, we have extracted a large corpus of geo-tagged messages, called
tweets, from a major metropolitan area and linked them US Census data through
their locations. This allows us to measure the sentiment expressed in tweets
that are posted from a specific area, and also use that area's demographic
properties in analysis. Our results reveal that areas with many check-ins are
different from other areas within the metropolitan region. In particular, these
areas have happier tweets, which also encourage people from other areas to
commute longer distances to these places. These findings shed light on human
mobility patterns, as well as how physical environment influences human
emotions.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 03:46:21 GMT"
}
] | 2015-07-29T00:00:00 |
[
[
"Gallegos",
"Luciano",
""
],
[
"Lerman",
"Kristina",
""
],
[
"Huang",
"Arthur",
""
],
[
"Garcia",
"David",
""
]
] |
new_dataset
| 0.998894 |
1507.07662
|
Chandrashekhar Pomu Chavan cPc
|
Chandrashekhar Pomu Chavan and Pallapa Venkataram
|
Designing a Routing Protocol for Ubiquitous Networks Using ECA Scheme
|
18 pages, 13 figures, Fifth International Conference on Advances in
Computing and Information Technology (ACITY 2015), July 25-26-2015, Chennai,
India
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have designed a novel Event-Condition-Action(ECA) scheme based Ad hoc
On-demand Distance Vector(ECA-AODV) routing protocol for a Ubiquitous
Network(UbiNet). ECA-AODV is designed to make routing decision dynamically and
quicker response to dynamic network conditions as and when event occur. ECA
scheme essentially consists of three modules to make runtime routing decision
quicker. First, event module receive event that occur in a UbiNet and split up
event into event type and event attributes. Second, condition module obtain
event details from event module split up each condition into condition
attributes that matches event and fire the rule as soon as condition hold.
Third, action module make runtime decisions based on event obtained and
condition applied. We have simulated and tested the designed ECA scheme by
considering ubiquitous museum environment as a case study with nodes range from
10 to 100. The simulation results show the time efficient with minimal
operations
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 06:37:13 GMT"
}
] | 2015-07-29T00:00:00 |
[
[
"Chavan",
"Chandrashekhar Pomu",
""
],
[
"Venkataram",
"Pallapa",
""
]
] |
new_dataset
| 0.99195 |
1507.07815
|
Svebor Karaman
|
Giuseppe Lisanti and Svebor Karaman and Daniele Pezzatini and Alberto
Del Bimbo
|
A Multi-Camera Image Processing and Visualization System for Train
Safety Assessment
|
11 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a machine vision system to efficiently monitor,
analyze and present visual data acquired with a railway overhead gantry
equipped with multiple cameras. This solution aims to improve the safety of
daily life railway transportation in a two- fold manner: (1) by providing
automatic algorithms that can process large imagery of trains (2) by helping
train operators to keep attention on any possible malfunction. The system is
designed with the latest cutting edge, high-rate visible and thermal cameras
that ob- serve a train passing under an railway overhead gantry. The machine
vision system is composed of three principal modules: (1) an automatic wagon
identification system, recognizing the wagon ID according to the UIC
classification of railway coaches; (2) a temperature monitoring system; (3) a
system for the detection, localization and visualization of the pantograph of
the train. These three machine vision modules process batch trains sequences
and their resulting analysis are presented to an operator using a multitouch
user interface. We detail all technical aspects of our multi-camera portal: the
hardware requirements, the software developed to deal with the high-frame rate
cameras and ensure reliable acquisition, the algorithms proposed to solve each
computer vision task, and the multitouch interaction and visualization
interface. We evaluate each component of our system on a dataset recorded in an
ad-hoc railway test-bed, showing the potential of our proposed portal for train
safety assessment.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 15:36:24 GMT"
}
] | 2015-07-29T00:00:00 |
[
[
"Lisanti",
"Giuseppe",
""
],
[
"Karaman",
"Svebor",
""
],
[
"Pezzatini",
"Daniele",
""
],
[
"Del Bimbo",
"Alberto",
""
]
] |
new_dataset
| 0.989626 |
1507.07888
|
Randall Berry
|
Thanh Nguyen, Hang Zhou, Randall A. Berry, Michael L. Honig, and
Rakesh Vohra
|
The Cost of Free Spectrum
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been growing interest in increasing the amount of radio spectrum
available for unlicensed broad-band wireless access. That includes "prime"
spectrum at lower frequencies, which is also suitable for wide area coverage by
licensed cellular providers. While additional unlicensed spectrum would allow
for market expansion, it could influence competition among providers and
increase congestion (interference) among consumers of wireless services. We
study the value (social welfare and consumer surplus) obtained by adding
unlicensed spectrum to an existing allocation of licensed spectrum among
incumbent service providers. We assume a population of customers who choose a
provider based on the minimum delivered price, given by the weighted sum of the
price of the service and a congestion cost, which depends on the number of
subscribers in a band. We consider models in which this weighting is uniform
across the customer population and where the weighting is either high or low,
reflecting different sensitivities to latency. For the models considered, we
find that the social welfare depends on the amount of additional unlicensed
spectrum, and can actually decrease over a significant range of unlicensed
bandwidths. Furthermore, with nonuniform weighting, introducing unlicensed
spectrum can also reduce consumer welfare.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 18:32:29 GMT"
}
] | 2015-07-29T00:00:00 |
[
[
"Nguyen",
"Thanh",
""
],
[
"Zhou",
"Hang",
""
],
[
"Berry",
"Randall A.",
""
],
[
"Honig",
"Michael L.",
""
],
[
"Vohra",
"Rakesh",
""
]
] |
new_dataset
| 0.991118 |
1307.7867
|
Daniel Ruprecht
|
Robert Speck, Daniel Ruprecht, Matthew Emmett, Matthias Bolten, Rolf
Krause
|
A space-time parallel solver for the three-dimensional heat equation
|
10 pages
|
Advances in Parallel Computing 25, IOS Press, pages 263 - 272,
2014
|
10.3233/978-1-61499-381-0-263
| null |
cs.NA cs.DC math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a combination of the time-parallel "parallel full
approximation scheme in space and time" (PFASST) with a parallel multigrid
method (PMG) in space, resulting in a mesh-based solver for the
three-dimensional heat equation with a uniquely high degree of efficient
concurrency. Parallel scaling tests are reported on the Cray XE6 machine "Monte
Rosa" on up to 16,384 cores and on the IBM Blue Gene/Q system "JUQUEEN" on up
to 65,536 cores. The efficacy of the combined spatial- and temporal
parallelization is shown by demonstrating that using PFASST in addition to PMG
significantly extends the strong-scaling limit. Implications of using spatial
coarsening strategies in PFASST's multi-level hierarchy in large-scale parallel
simulations are discussed.
|
[
{
"version": "v1",
"created": "Tue, 30 Jul 2013 08:21:13 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jul 2014 14:19:53 GMT"
}
] | 2015-07-28T00:00:00 |
[
[
"Speck",
"Robert",
""
],
[
"Ruprecht",
"Daniel",
""
],
[
"Emmett",
"Matthew",
""
],
[
"Bolten",
"Matthias",
""
],
[
"Krause",
"Rolf",
""
]
] |
new_dataset
| 0.977806 |
1504.03632
|
Kyatsandra Nagananda
|
B. N. Bharath and K. G. Nagananda
|
Caching with Unknown Popularity Profiles in Small Cell Networks
|
6 pages, Proceedings of IEEE Global Communications Conference, 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A heterogenous network is considered where the base stations (BSs), small
base stations (SBSs) and users are distributed according to independent Poisson
point processes (PPPs). We let the SBS nodes to posses high storage capacity
and are assumed to form a distributed caching network. Popular data files are
stored in the local cache of SBS, so that users can download the desired files
from one of the SBS in the vicinity subject to availability. The
offloading-loss is captured via a cost function that depends on a random
caching strategy proposed in this paper. The cost function depends on the
popularity profile, which is, in general, unknown. In this work, the popularity
profile is estimated at the BS using the available instantaneous demands from
the users in a time interval $[0,\tau]$. This is then used to find an estimate
of the cost function from which the optimal random caching strategy is devised.
The main results of this work are the following: First it is shown that the
waiting time $\tau$ to achieve an $\epsilon>0$ difference between the achieved
and optimal costs is finite, provided the user density is greater than a
predefined threshold. In this case, $\tau$ is shown to scale as $N^2$, where
$N$ is the support of the popularity profile. Secondly, a transfer
learning-based approach is proposed to obtain an estimate of the popularity
profile used to compute the empirical cost function. A condition is derived
under which the proposed transfer learning-based approach performs better than
the random caching strategy.
|
[
{
"version": "v1",
"created": "Tue, 14 Apr 2015 17:29:27 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Jul 2015 11:52:35 GMT"
}
] | 2015-07-28T00:00:00 |
[
[
"Bharath",
"B. N.",
""
],
[
"Nagananda",
"K. G.",
""
]
] |
new_dataset
| 0.971263 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.