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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1407.1471
|
Shashi Kant V
|
Shashi Kant, Fredrik Rusek, and Basuki E. Priyanto
|
A Robust Low-Complexity MIMO Detector for Rank 4 LTE/LTE-A Systems
|
Accepted for publication in PIMRC-2014, Washington DC, USA
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with MIMO detection for rank 4 LTE systems. The paper
revolves around a previously known detector [1, by Inkyu Lee, TCOM'2010] which
we shall refer to as RCSMLD
(Reduced-Constellation-Size-Maximum-Likelihood-Detector). However, a direct
application of the scheme in [1, by Inkyu Lee, TCOM'2010] to LTE/LTE-A rank 4
test cases results in unsatisfactory performance. The first contribution of the
paper is to introduce several modifications that can jointly be applied to the
basic RCSMLD scheme which, taken together, result in excellent performance. Our
second contribution is the development of a highly efficient hardware structure
for RCSMLD that allows for an implementation with very few multiplications.
|
[
{
"version": "v1",
"created": "Sun, 6 Jul 2014 08:38:17 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Kant",
"Shashi",
""
],
[
"Rusek",
"Fredrik",
""
],
[
"Priyanto",
"Basuki E.",
""
]
] |
new_dataset
| 0.982465 |
1407.1487
|
Ananthanarayanan Chockalingam
|
T. Lakshmi Narasimhan and A. Chockalingam
|
Precoder Index Modulation
|
arXiv admin note: substantial text overlap with arXiv:1401.6543
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Index modulation, where information bits are conveyed through antenna indices
(spatial modulation) and subcarrier indices (subcarrier index modulation) in
addition to information bits conveyed through conventional modulation symbols,
is getting increased research attention. In this paper, we introduce {\em
precoder index modulation}, where information bits are conveyed through the
choice of a precoder matrix at the transmitter from a set of pre-determined
pseudo-random phase precoder (PRPP) matrices. Combining precoder index
modulation (PIM) and spatial modulation (SM), we introduce a PIM-SM scheme
which conveys information bits through both antenna index as well as precoder
index. Spectral efficiency (in bits per channel use) and bit error performance
of these index modulation schemes are presented.
|
[
{
"version": "v1",
"created": "Sun, 6 Jul 2014 11:51:06 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Narasimhan",
"T. Lakshmi",
""
],
[
"Chockalingam",
"A.",
""
]
] |
new_dataset
| 0.991425 |
1407.1640
|
Bin Gao
|
Bin Gao, Jiang Bian, and Tie-Yan Liu
|
WordRep: A Benchmark for Research on Learning Word Representations
| null | null | null | null |
cs.CL cs.LG
|
http://creativecommons.org/licenses/by/3.0/
|
WordRep is a benchmark collection for the research on learning distributed
word representations (or word embeddings), released by Microsoft Research. In
this paper, we describe the details of the WordRep collection and show how to
use it in different types of machine learning research related to word
embedding. Specifically, we describe how the evaluation tasks in WordRep are
selected, how the data are sampled, and how the evaluation tool is built. We
then compare several state-of-the-art word representations on WordRep, report
their evaluation performance, and make discussions on the results. After that,
we discuss new potential research topics that can be supported by WordRep, in
addition to algorithm comparison. We hope that this paper can help people gain
deeper understanding of WordRep, and enable more interesting research on
learning distributed word representations and related topics.
|
[
{
"version": "v1",
"created": "Mon, 7 Jul 2014 09:31:21 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Gao",
"Bin",
""
],
[
"Bian",
"Jiang",
""
],
[
"Liu",
"Tie-Yan",
""
]
] |
new_dataset
| 0.99956 |
1407.1232
|
Abdullah Dertli Mr.
|
Abdullah Dertli, Yasemin Cengellenmis, Senol Eren
|
On Quantum Codes Obtained From Cyclic Codes Over F_2+vF_2+v^2F_2
| null | null | null | null |
cs.IT math.IT math.RA quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new Gray map which is both an isometry and a weight preserving map from
R=F_2+vF_2+v^2F_2 to (F_2)^3 is defined. A construction for quantum error
correcting codes from cyclic codes over finite ring R=F_2+vF_2+v^2F_2, v^3=v is
given. The parameters of quantum codes which are obtained from cyclic codes
over R are determined.
|
[
{
"version": "v1",
"created": "Thu, 19 Jun 2014 08:12:51 GMT"
}
] | 2014-07-07T00:00:00 |
[
[
"Dertli",
"Abdullah",
""
],
[
"Cengellenmis",
"Yasemin",
""
],
[
"Eren",
"Senol",
""
]
] |
new_dataset
| 0.9925 |
1407.1237
|
Vinit Kumar
|
Vinit Kumar and Ajay Agarwal
|
HT-Paxos: High Throughput State-Machine Replication Protocol for Large
Clustered Data Centers
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Paxos is a prominent theory of state machine replication. Recent data
intensive Systems those implement state machine replication generally require
high throughput. Earlier versions of Paxos as few of them are classical Paxos,
fast Paxos and generalized Paxos have a major focus on fault tolerance and
latency but lacking in terms of throughput and scalability. A major reason for
this is the heavyweight leader. Through offloading the leader, we can further
increase throughput of the system. Ring Paxos, Multi Ring Paxos and S-Paxos are
few prominent attempts in this direction for clustered data centers. In this
paper, we are proposing HT-Paxos, a variant of Paxos that one is the best
suitable for any large clustered data center. HT-Paxos further offloads the
leader very significantly and hence increases the throughput and scalability of
the system. While at the same time, among high throughput state-machine
replication protocols, HT-Paxos provides reasonably low latency and response
time.
|
[
{
"version": "v1",
"created": "Fri, 4 Jul 2014 13:58:50 GMT"
}
] | 2014-07-07T00:00:00 |
[
[
"Kumar",
"Vinit",
""
],
[
"Agarwal",
"Ajay",
""
]
] |
new_dataset
| 0.983777 |
1407.1307
|
Yang Guan
|
Yang Guan, Yao Xiao, Hao Feng, Chien-Chung Shen, Leonard J. Cimini Jr
|
MobiCacher: Mobility-Aware Content Caching in Small-Cell Networks
|
Accepted by Globecom 2014
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Small-cell networks have been proposed to meet the demand of ever growing
mobile data traffic. One of the prominent challenges faced by small-cell
networks is the lack of sufficient backhaul capacity to connect small-cell base
stations (small-BSs) to the core network. We exploit the effective application
layer semantics of both spatial and temporal locality to reduce the backhaul
traffic. Specifically, small-BSs are equipped with storage facility to cache
contents requested by users. As the {\em cache hit ratio} increases, most of
the users' requests can be satisfied locally without incurring traffic over the
backhaul. To make informed caching decisions, the mobility patterns of users
must be carefully considered as users might frequently migrate from one small
cell to another. We study the issue of mobility-aware content caching, which is
formulated into an optimization problem with the objective to maximize the
caching utility. As the problem is NP-complete, we develop a polynomial-time
heuristic solution termed {\em MobiCacher} with bounded approximation ratio. We
also conduct trace-based simulations to evaluate the performance of {\em
MobiCacher}, which show that {\em MobiCacher} yields better caching utility
than existing solutions.
|
[
{
"version": "v1",
"created": "Fri, 4 Jul 2014 19:47:03 GMT"
}
] | 2014-07-07T00:00:00 |
[
[
"Guan",
"Yang",
""
],
[
"Xiao",
"Yao",
""
],
[
"Feng",
"Hao",
""
],
[
"Shen",
"Chien-Chung",
""
],
[
"Cimini",
"Leonard J.",
"Jr"
]
] |
new_dataset
| 0.995744 |
1407.0697
|
Anuradha Rana
|
Anuradha Rana, Pratima Sharma
|
How to Track Online SLA
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SLA (Service level agreement) is defined by an organization to fulfil its
client requirements, the time within which the deliverables should be turned
over to the clients. Tracking of SLA can be done manually by checking the
status, priority of any particular task. Manual SLA tracking takes time as one
has to go over each and every task that needs to be completed. For instance,
you ordered a product from a website and you are not happy with the quality of
the product and want to replace the same on urgent basis, You send mail to the
customer support department, the query/complaint will be submitted in a queue
and will be processed basis of its priority and urgency (The SLA for responding
back to customers concern are listed in the policy). This online SLA tracking
system will ensure that no queries/complaints are missed and are processed in
an organized manner as per their priority and the date by when it should be
handled. The portal will provide the status of the complaints for that
particular day and the ones which have been pending since last week. The
information can be refreshed as per the client need (within what time frame the
complaint should be addressed).
|
[
{
"version": "v1",
"created": "Wed, 2 Jul 2014 16:37:18 GMT"
}
] | 2014-07-04T00:00:00 |
[
[
"Rana",
"Anuradha",
""
],
[
"Sharma",
"Pratima",
""
]
] |
new_dataset
| 0.982522 |
1407.0713
|
Hulya Seferoglu
|
Hulya Seferoglu and Yuxuan Xing
|
Device-Centric Cooperation in Mobile Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The increasing popularity of applications such as video streaming in today's
mobile devices introduces higher demand for throughput, and puts a strain
especially on cellular links. Cooperation among mobile devices by exploiting
both cellular and local area connections is a promising approach to meet the
increasing demand. In this paper, we consider that a group of cooperative
mobile devices, exploiting both cellular and local area links and within
proximity of each other, are interested in the same video content. Traditional
network control algorithms introduce high overhead and delay in this setup as
the network control and cooperation decisions are made in a source-centric
manner. Instead, we develop a device-centric stochastic cooperation scheme. Our
device-centric scheme; DcC allows mobile devices to make control decisions such
as flow control, scheduling, and cooperation without loss of optimality. Thanks
to being device-centric, DcC reduces; (i) overhead; i.e., the number of control
packets that should be transmitted over cellular links, so cellular links are
used more efficiently, and (ii) the amount of delay that each packet
experiences, which improves quality of service. The simulation results
demonstrate the benefits of DcC.
|
[
{
"version": "v1",
"created": "Wed, 2 Jul 2014 20:10:48 GMT"
}
] | 2014-07-04T00:00:00 |
[
[
"Seferoglu",
"Hulya",
""
],
[
"Xing",
"Yuxuan",
""
]
] |
new_dataset
| 0.995092 |
1407.1031
|
Rossano Schifanella
|
Daniele Quercia, Rossano Schifanella, Luca Maria Aiello
|
The Shortest Path to Happiness: Recommending Beautiful, Quiet, and Happy
Routes in the City
|
11 pages, 7 figures, Proceedings of ACM Hypertext 2014
| null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When providing directions to a place, web and mobile mapping services are all
able to suggest the shortest route. The goal of this work is to automatically
suggest routes that are not only short but also emotionally pleasant. To
quantify the extent to which urban locations are pleasant, we use data from a
crowd-sourcing platform that shows two street scenes in London (out of
hundreds), and a user votes on which one looks more beautiful, quiet, and
happy. We consider votes from more than 3.3K individuals and translate them
into quantitative measures of location perceptions. We arrange those locations
into a graph upon which we learn pleasant routes. Based on a quantitative
validation, we find that, compared to the shortest routes, the recommended ones
add just a few extra walking minutes and are indeed perceived to be more
beautiful, quiet, and happy. To test the generality of our approach, we
consider Flickr metadata of more than 3.7M pictures in London and 1.3M in
Boston, compute proxies for the crowdsourced beauty dimension (the one for
which we have collected the most votes), and evaluate those proxies with 30
participants in London and 54 in Boston. These participants have not only rated
our recommendations but have also carefully motivated their choices, providing
insights for future work.
|
[
{
"version": "v1",
"created": "Thu, 3 Jul 2014 19:47:19 GMT"
}
] | 2014-07-04T00:00:00 |
[
[
"Quercia",
"Daniele",
""
],
[
"Schifanella",
"Rossano",
""
],
[
"Aiello",
"Luca Maria",
""
]
] |
new_dataset
| 0.995051 |
1407.0454
|
Yingyi Bu
|
Sattam Alsubaiee, Yasser Altowim, Hotham Altwaijry, Alexander Behm,
Vinayak Borkar, Yingyi Bu, Michael Carey, Inci Cetindil, Madhusudan
Cheelangi, Khurram Faraaz, Eugenia Gabrielova, Raman Grover, Zachary
Heilbron, Young-Seok Kim, Chen Li, Guangqiang Li, Ji Mahn Ok, Nicola Onose,
Pouria Pirzadeh, Vassilis Tsotras, Rares Vernica, Jian Wen, Till Westmann
|
AsterixDB: A Scalable, Open Source BDMS
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
AsterixDB is a new, full-function BDMS (Big Data Management System) with a
feature set that distinguishes it from other platforms in today's open source
Big Data ecosystem. Its features make it well-suited to applications like web
data warehousing, social data storage and analysis, and other use cases related
to Big Data. AsterixDB has a flexible NoSQL style data model; a query language
that supports a wide range of queries; a scalable runtime; partitioned,
LSM-based data storage and indexing (including B+-tree, R-tree, and text
indexes); support for external as well as natively stored data; a rich set of
built-in types; support for fuzzy, spatial, and temporal types and queries; a
built-in notion of data feeds for ingestion of data; and transaction support
akin to that of a NoSQL store.
Development of AsterixDB began in 2009 and led to a mid-2013 initial open
source release. This paper is the first complete description of the resulting
open source AsterixDB system. Covered herein are the system's data model, its
query language, and its software architecture. Also included are a summary of
the current status of the project and a first glimpse into how AsterixDB
performs when compared to alternative technologies, including a parallel
relational DBMS, a popular NoSQL store, and a popular Hadoop-based SQL data
analytics platform, for things that both technologies can do. Also included is
a brief description of some initial trials that the system has undergone and
the lessons learned (and plans laid) based on those early "customer"
engagements.
|
[
{
"version": "v1",
"created": "Wed, 2 Jul 2014 04:29:54 GMT"
}
] | 2014-07-03T00:00:00 |
[
[
"Alsubaiee",
"Sattam",
""
],
[
"Altowim",
"Yasser",
""
],
[
"Altwaijry",
"Hotham",
""
],
[
"Behm",
"Alexander",
""
],
[
"Borkar",
"Vinayak",
""
],
[
"Bu",
"Yingyi",
""
],
[
"Carey",
"Michael",
""
],
[
"Cetindil",
"Inci",
""
],
[
"Cheelangi",
"Madhusudan",
""
],
[
"Faraaz",
"Khurram",
""
],
[
"Gabrielova",
"Eugenia",
""
],
[
"Grover",
"Raman",
""
],
[
"Heilbron",
"Zachary",
""
],
[
"Kim",
"Young-Seok",
""
],
[
"Li",
"Chen",
""
],
[
"Li",
"Guangqiang",
""
],
[
"Ok",
"Ji Mahn",
""
],
[
"Onose",
"Nicola",
""
],
[
"Pirzadeh",
"Pouria",
""
],
[
"Tsotras",
"Vassilis",
""
],
[
"Vernica",
"Rares",
""
],
[
"Wen",
"Jian",
""
],
[
"Westmann",
"Till",
""
]
] |
new_dataset
| 0.997104 |
1407.0466
|
Tingshao Zhu
|
Li Guan, Bibo Hao, and Tingshao Zhu
|
How did the Suicide Act and Speak Differently Online? Behavioral and
Linguistic Features of China's Suicide Microblog Users
|
17 pages, 5 tables
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Background: Suicide issue is of great concern in China. Social media provides
an active approach to understanding suicide individuals in terms of their
behavior and language use. Aims: This study investigates how suicide Microblog
users in China act and speak differently on social media from others. Methods:
Hypothesis testing in behavioral and linguistic features was performed between
a target group of 33 Chinese Microblog users who have committed suicide and a
control group of 30 active users without suicidal ideation. Results: Suicide
group significantly outnumbered control group in the extent of openly published
posts and self-reference, and the intensity of using 7 word categories:
negative words/social process words/cognitive process words/emotion process
words/negative emotion words/exclusive words/physiological process words.
Limitations: Information collection and confirmation of suicide users remain
difficult. Conclusions: It is revealed that suicide people vary from others in
certain behavioral and linguistic features in social media. This study fills
the niche of suicide studies by noting specified indicators of suicide ideation
for Chinese individuals online, providing insights of constructing an online
alarm system for early detection and intervention of suicidal individuals.
|
[
{
"version": "v1",
"created": "Wed, 2 Jul 2014 06:49:11 GMT"
}
] | 2014-07-03T00:00:00 |
[
[
"Guan",
"Li",
""
],
[
"Hao",
"Bibo",
""
],
[
"Zhu",
"Tingshao",
""
]
] |
new_dataset
| 0.995685 |
1407.0549
|
Antonio Barresi
|
Mathias Payer, Antonio Barresi, Thomas R. Gross
|
Lockdown: Dynamic Control-Flow Integrity
|
ETH Technical Report
| null |
10.3929/ethz-a-010171214
| null |
cs.CR cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Applications written in low-level languages without type or memory safety are
especially prone to memory corruption. Attackers gain code execution
capabilities through such applications despite all currently deployed defenses
by exploiting memory corruption vulnerabilities. Control-Flow Integrity (CFI)
is a promising defense mechanism that restricts open control-flow transfers to
a static set of well-known locations. We present Lockdown, an approach to
dynamic CFI that protects legacy, binary-only executables and libraries.
Lockdown adaptively learns the control-flow graph of a running process using
information from a trusted dynamic loader. The sandbox component of Lockdown
restricts interactions between different shared objects to imported and
exported functions by enforcing fine-grained CFI checks. Our prototype
implementation shows that dynamic CFI results in low performance overhead.
|
[
{
"version": "v1",
"created": "Wed, 2 Jul 2014 13:10:37 GMT"
}
] | 2014-07-03T00:00:00 |
[
[
"Payer",
"Mathias",
""
],
[
"Barresi",
"Antonio",
""
],
[
"Gross",
"Thomas R.",
""
]
] |
new_dataset
| 0.981924 |
1401.2818
|
Alan Brunton
|
Alan Brunton, Timo Bolkart, Stefanie Wuhrer
|
Multilinear Wavelets: A Statistical Shape Space for Human Faces
|
10 pages, 7 figures; accepted to ECCV 2014
| null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a statistical model for $3$D human faces in varying expression,
which decomposes the surface of the face using a wavelet transform, and learns
many localized, decorrelated multilinear models on the resulting coefficients.
Using this model we are able to reconstruct faces from noisy and occluded $3$D
face scans, and facial motion sequences. Accurate reconstruction of face shape
is important for applications such as tele-presence and gaming. The localized
and multi-scale nature of our model allows for recovery of fine-scale detail
while retaining robustness to severe noise and occlusion, and is
computationally efficient and scalable. We validate these properties
experimentally on challenging data in the form of static scans and motion
sequences. We show that in comparison to a global multilinear model, our model
better preserves fine detail and is computationally faster, while in comparison
to a localized PCA model, our model better handles variation in expression, is
faster, and allows us to fix identity parameters for a given subject.
|
[
{
"version": "v1",
"created": "Mon, 13 Jan 2014 12:48:39 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Jul 2014 09:26:10 GMT"
}
] | 2014-07-02T00:00:00 |
[
[
"Brunton",
"Alan",
""
],
[
"Bolkart",
"Timo",
""
],
[
"Wuhrer",
"Stefanie",
""
]
] |
new_dataset
| 0.999405 |
1404.6055
|
Ziqiang Chen
|
Feng Lu and Ziqiang Chen
|
A General Homogeneous Matrix Formulation to 3D Rotation Geometric
Transformations
|
8 pages, 13 references, 1 table. arXiv admin note: substantial text
overlap with arXiv:1307.0998
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present algebraic projective geometry definitions of 3D rotations so as to
bridge a small gap between the applications and the definitions of 3D rotations
in homogeneous matrix form. A general homogeneous matrix formulation to 3D
rotation geometric transformations is proposed which suits for the cases when
the rotation axis is unnecessarily through the coordinate system origin given
their rotation axes and rotation angles.
|
[
{
"version": "v1",
"created": "Thu, 24 Apr 2014 08:49:52 GMT"
},
{
"version": "v2",
"created": "Wed, 14 May 2014 03:50:17 GMT"
}
] | 2014-07-02T00:00:00 |
[
[
"Lu",
"Feng",
""
],
[
"Chen",
"Ziqiang",
""
]
] |
new_dataset
| 0.999495 |
1407.0039
|
Edinah Gnang K
|
Edinah K. Gnang
|
Integer formula encoding SageTeX package
| null | null | null | null |
cs.MS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper describes a SageTeX implementation of an integer encoding
procedures.
|
[
{
"version": "v1",
"created": "Fri, 27 Jun 2014 00:13:14 GMT"
}
] | 2014-07-02T00:00:00 |
[
[
"Gnang",
"Edinah K.",
""
]
] |
new_dataset
| 0.964646 |
1407.0049
|
Erik Cuevas
|
Erik Cuevas, Daniel Zaldivar and Marco Perez
|
Low-cost commercial LEGO platform for mobile robotics
|
10 Pages
|
International Journal of Electrical Engineering Education 47 (2),
(2010), pp. 132-150
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper shows the potential of a Lego\c{opyright} based low-cost
commercial robotic platform for learning and testing prototypes in higher
education and research. The overall setup aims to explain mobile robotic issues
strongly related to several fields such as Mechatronics, Robotics, and
Automatic Control theory. The capabilities and limitations of LEGO robots are
studied within two projects. The first one involves a robotic vehicle which is
able to follow several predefined paths. The second project concerns to the
classical problem of position control. Algorithms and additional tools have
been fully designed, applied and documented with results shown throughout the
paper. The platform is found to be suitable for teaching and researching on key
issues related to the aforementioned fields.
|
[
{
"version": "v1",
"created": "Mon, 30 Jun 2014 20:33:08 GMT"
}
] | 2014-07-02T00:00:00 |
[
[
"Cuevas",
"Erik",
""
],
[
"Zaldivar",
"Daniel",
""
],
[
"Perez",
"Marco",
""
]
] |
new_dataset
| 0.997693 |
1407.0114
|
Travis Gagie
|
Travis Gagie
|
Suffix Arrays for Spaced-SNP Databases
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single-nucleotide polymorphisms (SNPs) account for most variations between
human genomes. We show how, if the genomes in a database differ only by a
reasonable number of SNPs and the substrings between those SNPs are unique,
then we can store a fast compressed suffix array for that database.
|
[
{
"version": "v1",
"created": "Tue, 1 Jul 2014 06:38:45 GMT"
}
] | 2014-07-02T00:00:00 |
[
[
"Gagie",
"Travis",
""
]
] |
new_dataset
| 0.997051 |
1403.6230
|
Alexey Sorokin
|
Alexey Sorokin
|
Pumping lemma and Ogden lemma for displacement context-free grammars
|
Shortened version accepted to DLT 2014 conference
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The pumping lemma and Ogden lemma offer a powerful method to prove that a
particular language is not context-free. In 2008 Kanazawa proved an analogue of
pumping lemma for well-nested multiple-context free languages. However, the
statement of lemma is too weak for practical usage. We prove a stronger variant
of pumping lemma and an analogue of Ogden lemma for this language family. We
also use these statements to prove that some natural context-sensitive
languages cannot be generated by tree-adjoining grammars.
|
[
{
"version": "v1",
"created": "Tue, 25 Mar 2014 04:43:21 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Apr 2014 16:43:10 GMT"
},
{
"version": "v3",
"created": "Mon, 30 Jun 2014 18:25:54 GMT"
}
] | 2014-07-01T00:00:00 |
[
[
"Sorokin",
"Alexey",
""
]
] |
new_dataset
| 0.996254 |
1405.1861
|
{\L}ukasz Mazurek
|
Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski and
{\L}ukasz Mazurek
|
Modeling Bitcoin Contracts by Timed Automata
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitcoin is a peer-to-peer cryptographic currency system. Since its
introduction in 2008, Bitcoin has gained noticeable popularity, mostly due to
its following properties: (1) the transaction fees are very low, and (2) it is
not controlled by any central authority, which in particular means that nobody
can "print" the money to generate inflation. Moreover, the transaction syntax
allows to create the so-called contracts, where a number of
mutually-distrusting parties engage in a protocol to jointly perform some
financial task, and the fairness of this process is guaranteed by the
properties of Bitcoin. Although the Bitcoin contracts have several potential
applications in the digital economy, so far they have not been widely used in
real life. This is partly due to the fact that they are cumbersome to create
and analyze, and hence risky to use.
In this paper we propose to remedy this problem by using the methods
originally developed for the computer-aided analysis for hardware and software
systems, in particular those based on the timed automata. More concretely, we
propose a framework for modeling the Bitcoin contracts using the timed automata
in the UPPAAL model checker. Our method is general and can be used to model
several contracts. As a proof-of-concept we use this framework to model some of
the Bitcoin contracts from our recent previous work. We then automatically
verify their security in UPPAAL, finding (and correcting) some subtle errors
that were difficult to spot by the manual analysis. We hope that our work can
draw the attention of the researchers working on formal modeling to the problem
of the Bitcoin contract verification, and spark off more research on this
topic.
|
[
{
"version": "v1",
"created": "Thu, 8 May 2014 10:01:28 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Jun 2014 21:22:33 GMT"
}
] | 2014-07-01T00:00:00 |
[
[
"Andrychowicz",
"Marcin",
""
],
[
"Dziembowski",
"Stefan",
""
],
[
"Malinowski",
"Daniel",
""
],
[
"Mazurek",
"Łukasz",
""
]
] |
new_dataset
| 0.999627 |
1406.7338
|
Li-Yi Wei
|
Li-Yi Wei and Marc Levoy
|
Order-Independent Texture Synthesis
|
This is a combination of Stanford Computer Science Department
Technical Report 2002-01 and a subsequent submission to SIGGRAPH 2003
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Search-based texture synthesis algorithms are sensitive to the order in which
texture samples are generated; different synthesis orders yield different
textures. Unfortunately, most polygon rasterizers and ray tracers do not
guarantee the order with which surfaces are sampled. To circumvent this
problem, textures are synthesized beforehand at some maximum resolution and
rendered using texture mapping.
We describe a search-based texture synthesis algorithm in which samples can
be generated in arbitrary order, yet the resulting texture remains identical.
The key to our algorithm is a pyramidal representation in which each texture
sample depends only on a fixed number of neighboring samples at each level of
the pyramid. The bottom (coarsest) level of the pyramid consists of a noise
image, which is small and predetermined. When a sample is requested by the
renderer, all samples on which it depends are generated at once. Using this
approach, samples can be generated in any order. To make the algorithm
efficient, we propose storing texture samples and their dependents in a
pyramidal cache. Although the first few samples are expensive to generate,
there is substantial reuse, so subsequent samples cost less. Fortunately, most
rendering algorithms exhibit good coherence, so cache reuse is high.
|
[
{
"version": "v1",
"created": "Sat, 28 Jun 2014 00:47:30 GMT"
}
] | 2014-07-01T00:00:00 |
[
[
"Wei",
"Li-Yi",
""
],
[
"Levoy",
"Marc",
""
]
] |
new_dataset
| 0.999098 |
1406.7399
|
Ghassan Samara
|
Ghassan Samara, Tareq Alhmiedat
|
Intelligent Emergency Message Broadcasting in VANET Using PSO
|
11 pages
|
World of Computer Science and Information Technology Journal
(WCSIT) ISSN: 2221-0741 Vol. 4, No. 7, 90-100, 2014
| null | null |
cs.NI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The new type of Mobile Ad hoc Network which is called Vehicular Ad hoc
Networks (VANET) created a fertile environment for research. In this research,
a protocol Particle Swarm Optimization Contention Based Broadcast (PCBB) is
proposed, for fast andeffective dissemination of emergency messages within a
geographical area to distribute the emergency message and achieve the safety
system, this research will help the VANET system to achieve its safety goals in
intelligent and efficient way.
|
[
{
"version": "v1",
"created": "Sat, 28 Jun 2014 13:31:17 GMT"
}
] | 2014-07-01T00:00:00 |
[
[
"Samara",
"Ghassan",
""
],
[
"Alhmiedat",
"Tareq",
""
]
] |
new_dataset
| 0.998958 |
1406.7483
|
Alicia Gonz\'alez Mart\'inez
|
Alicia Gonzalez Martinez, Susana Lopez Hervas, Doaa Samy, Carlos G.
Arques, Antonio Moreno Sandoval
|
Jabalin: a Comprehensive Computational Model of Modern Standard Arabic
Verbal Morphology Based on Traditional Arabic Prosody
|
Jabalin implementation is available at
http://sourceforge.net/projects/jabalin/
|
Systems and Frameworks for Computational Morphology, Springer
Berlin Heidelberg, (2013) pp. 35-52
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The computational handling of Modern Standard Arabic is a challenge in the
field of natural language processing due to its highly rich morphology.
However, several authors have pointed out that the Arabic morphological system
is in fact extremely regular. The existing Arabic morphological analyzers have
exploited this regularity to variable extent, yet we believe there is still
some scope for improvement. Taking inspiration in traditional Arabic prosody,
we have designed and implemented a compact and simple morphological system
which in our opinion takes further advantage of the regularities encountered in
the Arabic morphological system. The output of the system is a large-scale
lexicon of inflected forms that has subsequently been used to create an Online
Interface for a morphological analyzer of Arabic verbs. The Jabalin Online
Interface is available at http://elvira.lllf.uam.es/jabalin/, hosted at the
LLI-UAM lab. The generation system is also available under a GNU GPL 3 license.
|
[
{
"version": "v1",
"created": "Sun, 29 Jun 2014 10:08:54 GMT"
}
] | 2014-07-01T00:00:00 |
[
[
"Martinez",
"Alicia Gonzalez",
""
],
[
"Hervas",
"Susana Lopez",
""
],
[
"Samy",
"Doaa",
""
],
[
"Arques",
"Carlos G.",
""
],
[
"Sandoval",
"Antonio Moreno",
""
]
] |
new_dataset
| 0.999434 |
1406.7662
|
Harish M Kittur
|
Mohammed Zackriya. V, Harish M Kittur
|
Selective Match-Line Energizer Content Addressable Memory(SMLE -CAM)
|
6 pages, 12 figures. Accepted for publication, International Journal
of applied Engineering Research,Vol. 8 No. 19, 2013
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Content Addressable Memory (CAM) is a memory primarily designed for high
speed search operation. Parallel search scheme forms the basis of CAM, thus
power reduction is the challenge associated with a large amount of parallel
active circuits. We are presenting a novel algorithm and architecture described
as Selective Match-Line Energizer Content Addressable Memory (SMLE-CAM) which
energizes only those MLs (Match-Line) whose first three bits are conditionally
matched with corresponding first three search bit using special architecture
which comprises of novel XNOR-CAM cell and novel XOR-CAM cell. The rest of the
CAM chain is followed by NOR-CAM cell. The 256 X 144 bit SMLE-CAM is
implemented in TSMC 90 nm technology and its robustness across PVT variation is
verified. The post-layout simulation result shows, it has energy metric of
0.115 fJ/bit/search with search time 361.6 ps, the best reported so far. The
maximum operating frequency is 1GHz.
|
[
{
"version": "v1",
"created": "Mon, 30 Jun 2014 10:46:50 GMT"
}
] | 2014-07-01T00:00:00 |
[
[
"Zackriya.",
"Mohammed",
"V"
],
[
"Kittur",
"Harish M",
""
]
] |
new_dataset
| 0.967734 |
1301.2474
|
Aur\'elie Lagoutte
|
Nicolas Bousquet, Aur\'elie Lagoutte and St\'ephan Thomass\'e
|
Clique versus Independent Set
| null |
European Journal of Combinatorics, 40:73-92, 2014
|
10.1016/j.ejc.2014.02.003
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Yannakakis' Clique versus Independent Set problem (CL-IS) in communication
complexity asks for the minimum number of cuts separating cliques from stable
sets in a graph, called CS-separator. Yannakakis provides a quasi-polynomial
CS-separator, i.e. of size $O(n^{\log n})$, and addresses the problem of
finding a polynomial CS-separator. This question is still open even for perfect
graphs. We show that a polynomial CS-separator almost surely exists for random
graphs. Besides, if H is a split graph (i.e. has a vertex-partition into a
clique and a stable set) then there exists a constant $c_H$ for which we find a
$O(n^{c_H})$ CS-separator on the class of H-free graphs. This generalizes a
result of Yannakakis on comparability graphs. We also provide a $O(n^{c_k})$
CS-separator on the class of graphs without induced path of length k and its
complement. Observe that on one side, $c_H$ is of order $O(|H| \log |H|)$
resulting from Vapnik-Chervonenkis dimension, and on the other side, $c_k$ is
exponential.
One of the main reason why Yannakakis' CL-IS problem is fascinating is that
it admits equivalent formulations. Our main result in this respect is to show
that a polynomial CS-separator is equivalent to the polynomial
Alon-Saks-Seymour Conjecture, asserting that if a graph has an edge-partition
into k complete bipartite graphs, then its chromatic number is polynomially
bounded in terms of k. We also show that the classical approach to the stubborn
problem (arising in CSP) which consists in covering the set of all solutions by
$O(n^{\log n})$ instances of 2-SAT is again equivalent to the existence of a
polynomial CS-separator.
|
[
{
"version": "v1",
"created": "Fri, 11 Jan 2013 12:22:54 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Mar 2013 12:48:43 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Jun 2014 08:04:22 GMT"
}
] | 2014-06-30T00:00:00 |
[
[
"Bousquet",
"Nicolas",
""
],
[
"Lagoutte",
"Aurélie",
""
],
[
"Thomassé",
"Stéphan",
""
]
] |
new_dataset
| 0.99111 |
1307.1662
|
Rami Al-Rfou
|
Rami Al-Rfou, Bryan Perozzi, Steven Skiena
|
Polyglot: Distributed Word Representations for Multilingual NLP
|
10 pages, 2 figures, Proceedings of Conference on Computational
Natural Language Learning CoNLL'2013
| null | null | null |
cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed word representations (word embeddings) have recently contributed
to competitive performance in language modeling and several NLP tasks. In this
work, we train word embeddings for more than 100 languages using their
corresponding Wikipedias. We quantitatively demonstrate the utility of our word
embeddings by using them as the sole features for training a part of speech
tagger for a subset of these languages. We find their performance to be
competitive with near state-of-art methods in English, Danish and Swedish.
Moreover, we investigate the semantic features captured by these embeddings
through the proximity of word groupings. We will release these embeddings
publicly to help researchers in the development and enhancement of multilingual
applications.
|
[
{
"version": "v1",
"created": "Fri, 5 Jul 2013 16:52:09 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Jun 2014 17:31:33 GMT"
}
] | 2014-06-30T00:00:00 |
[
[
"Al-Rfou",
"Rami",
""
],
[
"Perozzi",
"Bryan",
""
],
[
"Skiena",
"Steven",
""
]
] |
new_dataset
| 0.99661 |
1307.4538
|
Federico Polito
|
Laura Sacerdote, Michele Garetto, Federico Polito, Matteo Sereno
|
Superprocesses as models for information dissemination in the Future
Internet
| null |
Proceedings of Mathematical Models and Methods for Planet Earth,
157-170, Springer, 2014
|
10.1007/978-3-319-02657-2_13
| null |
cs.NI math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Future Internet will be composed by a tremendous number of potentially
interconnected people and devices, offering a variety of services, applications
and communication opportunities. In particular, short-range wireless
communications, which are available on almost all portable devices, will enable
the formation of the largest cloud of interconnected, smart computing devices
mankind has ever dreamed about: the Proximate Internet. In this paper, we
consider superprocesses, more specifically super Brownian motion, as a suitable
mathematical model to analyse a basic problem of information dissemination
arising in the context of Proximate Internet. The proposed model provides a
promising analytical framework to both study theoretical properties related to
the information dissemination process and to devise efficient and reliable
simulation schemes for very large systems.
|
[
{
"version": "v1",
"created": "Wed, 17 Jul 2013 08:45:29 GMT"
}
] | 2014-06-30T00:00:00 |
[
[
"Sacerdote",
"Laura",
""
],
[
"Garetto",
"Michele",
""
],
[
"Polito",
"Federico",
""
],
[
"Sereno",
"Matteo",
""
]
] |
new_dataset
| 0.971049 |
1406.6786
|
Eric Mootz
|
Eric Mootz
|
3D Texture Coordinates on Polygon Mesh Sequences
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A method for creating 3D texture coordinates for a sequence of polygon meshes
with changing topology and vertex motion vectors.
|
[
{
"version": "v1",
"created": "Thu, 26 Jun 2014 07:02:33 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Jun 2014 07:51:43 GMT"
}
] | 2014-06-30T00:00:00 |
[
[
"Mootz",
"Eric",
""
]
] |
new_dataset
| 0.999521 |
1406.7112
|
Vasileios Zografos
|
Vasileios Zografos
|
3D planar patch extraction from stereo using probabilistic region
growing
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents a novel 3D planar patch extraction method using a
probabilistic region growing algorithm. Our method works by simultaneously
initiating multiple planar patches from seed points, the latter determined by
an intensity-based 2D segmentation algorithm in the stereo-pair images. The
patches are grown incrementally and in parallel as 3D scene points are
considered for membership, using a probabilistic distance likelihood measure.
In addition, we have incorporated prior information based on the noise model in
the 2D images and the scene configuration but also include the intensity
information resulting from the initial segmentation. This method works well
across many different data-sets, involving real and synthetic examples of both
regularly and non-regularly sampled data, and is fast enough that may be used
for robot navigation tasks of path detection and obstacle avoidance.
|
[
{
"version": "v1",
"created": "Fri, 27 Jun 2014 08:52:54 GMT"
}
] | 2014-06-30T00:00:00 |
[
[
"Zografos",
"Vasileios",
""
]
] |
new_dataset
| 0.998144 |
1406.7124
|
Yiyin Wang
|
Yiyin Wang, Xiaoli Ma, Cailian Chen, Xinping Guan
|
UWB Signal Detection by Cyclic Features
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Ultra-wideband (UWB) impulse radio (IR) systems are well known for low
transmission power, low probability of detection, and overlaying with
narrowband (NB) systems. These merits in fact make UWB signal detection
challenging, since several high-power wireless communication systems coexist
with UWB signals. In the literature, cyclic features are exploited for signal
detection. However, the high computational complexity of conventional cyclic
feature based detectors burdens the receivers. In this paper, we propose
computationally efficient detectors using the specific cyclic features of UWB
signals. The closed-form relationships between the cyclic features and the
system parameters are revealed. Then, some constant false alarm rate detectors
are proposed based on the estimated cyclic autocorrelation functions (CAFs).
The proposed detectors have low complexities compared to the existing ones.
Extensive simulation results indicate that the proposed detectors achieve a
good balance between the detection performance and the computational complexity
in various scenarios, such as multipath environments, colored noise, and NB
interferences.
|
[
{
"version": "v1",
"created": "Fri, 27 Jun 2014 09:32:50 GMT"
}
] | 2014-06-30T00:00:00 |
[
[
"Wang",
"Yiyin",
""
],
[
"Ma",
"Xiaoli",
""
],
[
"Chen",
"Cailian",
""
],
[
"Guan",
"Xinping",
""
]
] |
new_dataset
| 0.997899 |
1406.6494
|
Nicola Apollonio
|
N. Apollonio, A. Galluccio
|
Minimally unbalanced diamond-free graphs and Dyck-paths
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $\{0,1\}$-matrix $\mathsf{A}$ is balanced if it does not contain a
submatrix of odd order having exactly two 1's per row and per column. A graph
is balanced if its clique-matrix is balanced. No characterization of minimally
unbalanced graphs is known, and even no conjecture on the structure of such
graphs has been posed, contrarily to what happened for perfect graphs. In this
paper, we provide such a characterization for the class of diamond-free graphs
and establish a connection between minimally unbalanced diamond-free graphs and
Dyck-paths.
|
[
{
"version": "v1",
"created": "Wed, 25 Jun 2014 08:26:29 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Jun 2014 08:11:30 GMT"
}
] | 2014-06-27T00:00:00 |
[
[
"Apollonio",
"N.",
""
],
[
"Galluccio",
"A.",
""
]
] |
new_dataset
| 0.971511 |
1301.6809
|
Andrea Tagliasacchi
|
Andrea Tagliasacchi
|
Skeletal Representations and Applications
|
42 pages, SFU Depth Exam
| null | null |
SFU-CMPT TR 2012-55-1
|
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When representing a solid object there are alternatives to the use of
traditional explicit (surface meshes) or implicit (zero crossing of implicit
functions) methods. Skeletal representations encode shape information in a
mixed fashion: they are composed of a set of explicit primitives, yet they are
able to efficiently encode the shape's volume as well as its topology. I will
discuss, in two dimensions, how symmetry can be used to reduce the
dimensionality of the data (from a 2D solid to a 1D curve), and how this
relates to the classical definition of skeletons by Medial Axis Transform.
While the medial axis of a 2D shape is composed of a set of curves, in 3D it
results in a set of sheets connected in a complex fashion. Because of this
complexity, medial skeletons are difficult to use in practical applications.
Curve skeletons address this problem by strictly requiring their geometry to be
one dimensional, resulting in an intuitive yet powerful shape representation.
In this report I will define both medial and curve skeletons and discuss their
mutual relationship. I will also present several algorithms for their
computation and a variety of scenarios where skeletons are employed, with a
special focus on geometry processing and shape analysis.
|
[
{
"version": "v1",
"created": "Tue, 29 Jan 2013 00:18:00 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Jun 2014 14:49:18 GMT"
}
] | 2014-06-26T00:00:00 |
[
[
"Tagliasacchi",
"Andrea",
""
]
] |
new_dataset
| 0.990931 |
1304.0193
|
Zhenhua Yu
|
Z. Yu, R. J. Baxley, and G. T. Zhou
|
Brightness Control in Dynamic Range Constrained Visible Light OFDM
Systems
| null | null |
10.1109/WOCC.2014.6839941
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visible light communication (VLC) systems can provide illumination and
communication simultaneously via light emitting diodes (LEDs). Orthogonal
frequency division multiplexing (OFDM) waveforms transmitted in a VLC system
will have high peak-to-average power ratios (PAPRs). Since the transmitting LED
is dynamic-range limited, OFDM signal has to be scaled and biased to avoid
nonlinear distortion. Brightness control is an essential feature for the
illumination function. In this paper, we will analyze the performance of
dynamic range constrained visible light OFDM systems with biasing adjustment
and pulse width modulation (PWM) methods. We will investigate the trade-off
between duty cycle and forward ratio of PWM and find the optimum forward ratio
to maximize the achievable ergodic rates.
|
[
{
"version": "v1",
"created": "Sun, 31 Mar 2013 12:07:18 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Jan 2014 19:16:13 GMT"
}
] | 2014-06-25T00:00:00 |
[
[
"Yu",
"Z.",
""
],
[
"Baxley",
"R. J.",
""
],
[
"Zhou",
"G. T.",
""
]
] |
new_dataset
| 0.993498 |
1406.6170
|
Tuvi Etzion
|
Netanel Raviv and Tuvi Etzion
|
Distributed Storage Systems based on Equidistant Subspace Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems based on equidistant constant dimension codes are
presented. These equidistant codes are based on the Pl\"{u}cker embedding,
which is essential in the repair and the reconstruction algorithms. These
systems posses several useful properties such as high failure resilience,
minimum bandwidth, low storage, simple algebraic repair and reconstruction
algorithms, good locality, and compatibility with small fields.
|
[
{
"version": "v1",
"created": "Tue, 24 Jun 2014 08:47:16 GMT"
}
] | 2014-06-25T00:00:00 |
[
[
"Raviv",
"Netanel",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.99776 |
1406.6201
|
Reiner Lenz
|
Reiner Lenz
|
Saccadic Eye Movements and the Generalized Pareto Distribution
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a statistical analysis of the eye tracker measurements in a
database with 15 observers viewing 1003 images under free-viewing conditions.
In contrast to the common approach of investigating the properties of the
fixation points we analyze the properties of the transition phases between
fixations. We introduce hyperbolic geometry as a tool to measure the step
length between consecutive eye positions. We show that the step lengths,
measured in hyperbolic and euclidean geometry, follow a generalized Pareto
distribution. The results based on the hyperbolic distance are more robust than
those based on euclidean geometry. We show how the structure of the space of
generalized Pareto distributions can be used to characterize and identify
individual observers.
|
[
{
"version": "v1",
"created": "Tue, 24 Jun 2014 10:57:50 GMT"
}
] | 2014-06-25T00:00:00 |
[
[
"Lenz",
"Reiner",
""
]
] |
new_dataset
| 0.994689 |
1210.6963
|
Lane A. Hemaspaandra
|
Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton
|
Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe,
Manipulate, and Control
| null | null | null |
URCS-TR-2012-982
|
cs.GT cs.DS cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Schulze and ranked-pairs elections have received much attention recently, and
the former has quickly become a quite widely used election system. For many
cases these systems have been proven resistant to bribery, control, or
manipulation, with ranked pairs being particularly praised for being NP-hard
for all three of those. Nonetheless, the present paper shows that with respect
to the number of candidates, Schulze and ranked-pairs elections are
fixed-parameter tractable to bribe, control, and manipulate: we obtain uniform,
polynomial-time algorithms whose degree does not depend on the number of
candidates. We also provide such algorithms for some weighted variants of these
problems.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2012 19:37:24 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Dec 2012 03:56:20 GMT"
},
{
"version": "v3",
"created": "Fri, 14 Jun 2013 19:34:00 GMT"
},
{
"version": "v4",
"created": "Tue, 16 Jul 2013 20:46:52 GMT"
},
{
"version": "v5",
"created": "Sat, 21 Jun 2014 18:44:21 GMT"
}
] | 2014-06-24T00:00:00 |
[
[
"Hemaspaandra",
"Lane A.",
""
],
[
"Lavaee",
"Rahman",
""
],
[
"Menton",
"Curtis",
""
]
] |
new_dataset
| 0.99977 |
1406.5282
|
Mingqiang Li
|
Mingqiang Li and Patrick P. C. Lee
|
STAIR Codes: A General Family of Erasure Codes for Tolerating Device and
Sector Failures
|
An earlier version of this work was presented at USENIX FAST '14.
This extended version presents new reliability analysis for STAIR codes and
is submitted for journal review
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Practical storage systems often adopt erasure codes to tolerate device
failures and sector failures, both of which are prevalent in the field.
However, traditional erasure codes employ device-level redundancy to protect
against sector failures, and hence incur significant space overhead. Recent
sector-disk (SD) codes are available only for limited configurations. By making
a relaxed but practical assumption, we construct a general family of erasure
codes called \emph{STAIR codes}, which efficiently and provably tolerate both
device and sector failures without any restriction on the size of a storage
array and the numbers of tolerable device failures and sector failures. We
propose the \emph{upstairs encoding} and \emph{downstairs encoding} methods,
which provide complementary performance advantages for different
configurations. We conduct extensive experiments on STAIR codes in terms of
space saving, encoding/decoding speed, and update cost. We demonstrate that
STAIR codes not only improve space efficiency over traditional erasure codes,
but also provide better computational efficiency than SD codes based on our
special code construction. Finally, we present analytical models that
characterize the reliability of STAIR codes, and show that the support of a
wider range of configurations by STAIR codes is critical for tolerating sector
failure bursts discovered in the field.
|
[
{
"version": "v1",
"created": "Fri, 20 Jun 2014 06:07:59 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jun 2014 08:47:39 GMT"
}
] | 2014-06-24T00:00:00 |
[
[
"Li",
"Mingqiang",
""
],
[
"Lee",
"Patrick P. C.",
""
]
] |
new_dataset
| 0.999375 |
1406.5569
|
Ashkan Rahimian
|
Ashkan Rahimian, Raha Ziarati, Stere Preda, Mourad Debbabi
|
On the Reverse Engineering of the Citadel Botnet
|
10 pages, 17 figures. This is an updated / edited version of a paper
appeared in FPS 2013
|
LNCS 8352, 2014, pp 408-425
|
10.1007/978-3-319-05302-8_25
| null |
cs.CR cs.NI cs.OS cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Citadel is an advanced information-stealing malware which targets financial
information. This malware poses a real threat against the confidentiality and
integrity of personal and business data. A joint operation was recently
conducted by the FBI and the Microsoft Digital Crimes Unit in order to take
down Citadel command-and-control servers. The operation caused some disruption
in the botnet but has not stopped it completely. Due to the complex structure
and advanced anti-reverse engineering techniques, the Citadel malware analysis
process is both challenging and time-consuming. This allows cyber criminals to
carry on with their attacks while the analysis is still in progress. In this
paper, we present the results of the Citadel reverse engineering and provide
additional insight into the functionality, inner workings, and open source
components of the malware. In order to accelerate the reverse engineering
process, we propose a clone-based analysis methodology. Citadel is an offspring
of a previously analyzed malware called Zeus; thus, using the former as a
reference, we can measure and quantify the similarities and differences of the
new variant. Two types of code analysis techniques are provided in the
methodology, namely assembly to source code matching and binary clone
detection. The methodology can help reduce the number of functions requiring
manual analysis. The analysis results prove that the approach is promising in
Citadel malware analysis. Furthermore, the same approach is applicable to
similar malware analysis scenarios.
|
[
{
"version": "v1",
"created": "Sat, 21 Jun 2014 02:04:56 GMT"
}
] | 2014-06-24T00:00:00 |
[
[
"Rahimian",
"Ashkan",
""
],
[
"Ziarati",
"Raha",
""
],
[
"Preda",
"Stere",
""
],
[
"Debbabi",
"Mourad",
""
]
] |
new_dataset
| 0.987272 |
1406.5691
|
John J. Camilleri
|
John J. Camilleri, Gabriele Paganelli, Gerardo Schneider
|
A CNL for Contract-Oriented Diagrams
| null | null | null | null |
cs.CL cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a first step towards a framework for defining and manipulating
normative documents or contracts described as Contract-Oriented (C-O) Diagrams.
These diagrams provide a visual representation for such texts, giving the
possibility to express a signatory's obligations, permissions and prohibitions,
with or without timing constraints, as well as the penalties resulting from the
non-fulfilment of a contract. This work presents a CNL for verbalising C-O
Diagrams, a web-based tool allowing editing in this CNL, and another for
visualising and manipulating the diagrams interactively. We then show how these
proof-of-concept tools can be used by applying them to a small example.
|
[
{
"version": "v1",
"created": "Sun, 22 Jun 2014 09:41:24 GMT"
}
] | 2014-06-24T00:00:00 |
[
[
"Camilleri",
"John J.",
""
],
[
"Paganelli",
"Gabriele",
""
],
[
"Schneider",
"Gerardo",
""
]
] |
new_dataset
| 0.999412 |
1406.6035
|
Viorel Preoteasa
|
Viorel Preoteasa and Stavros Tripakis
|
Refinement Calculus of Reactive Systems
| null | null | null | null |
cs.SE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Refinement calculus is a powerful and expressive tool for reasoning about
sequential programs in a compositional manner. In this paper we present an
extension of refinement calculus for reactive systems. Refinement calculus is
based on monotonic predicate transformers, which transform sets of post-states
into sets of pre-states. To model reactive systems, we introduce monotonic
property transformers, which transform sets of output traces into sets of input
traces. We show how to model in this semantics refinement, sequential
composition, demonic choice, and other semantic operations on reactive systems.
We use primarily higher order logic to express our results, but we also show
how property transformers can be defined using other formalisms more amenable
to automation, such as linear temporal logic (suitable for specifications) and
symbolic transition systems (suitable for implementations). Finally, we show
how this framework generalizes previous work on relational interfaces so as to
be able to express systems with infinite behaviors and liveness properties.
|
[
{
"version": "v1",
"created": "Mon, 23 Jun 2014 19:38:05 GMT"
}
] | 2014-06-24T00:00:00 |
[
[
"Preoteasa",
"Viorel",
""
],
[
"Tripakis",
"Stavros",
""
]
] |
new_dataset
| 0.993957 |
1406.1501
|
Daniele de Rigo
|
Christine Estreguil, Giovanni Caudullo, Daniele de Rigo
|
Connectivity of Natura 2000 forest sites in Europe
|
9 pages, from a poster published in F1000Posters 2014, 5: 485
|
F1000Posters 2014, 5: 485
|
10.6084/m9.figshare.1063300
| null |
cs.CE q-bio.PE
|
http://creativecommons.org/licenses/by/3.0/
|
Background/Purpose: In the context of the European Biodiversity policy, the
Green Infrastructure Strategy is one supporting tool to mitigate fragmentation,
inter-alia to increase the spatial and functional connectivity between
protected and unprotected areas. The Joint Research Centre has developed an
integrated model to provide a macro-scale set of indices to evaluate the
connectivity of the Natura 2000 network, which forms the backbone of a Green
Infrastructure for Europe. The model allows a wide assessment and comparison to
be performed across countries in terms of structural (spatially connected or
isolated sites) and functional connectivity (least-cost distances between sites
influenced by distribution, distance and land cover).
Main conclusion: The Natura 2000 network in Europe shows differences among
countries in terms of the sizes and numbers of sites, their distribution as
well as distances between sites. Connectivity has been assessed on the basis of
a 500 m average inter-site distance, roads and intensive land use as barrier
effects as well as the presence of "green" corridors. In all countries the
Natura 2000 network is mostly made of sites which are not physically connected.
Highest functional connectivity values are found for Spain, Slovakia, Romania
and Bulgaria. The more natural landscape in Sweden and Finland does not result
in high inter-site network connectivity due to large inter-site distances. The
distribution of subnets with respect to roads explains the higher share of
isolated subnets in Portugal than in Belgium.
|
[
{
"version": "v1",
"created": "Thu, 5 Jun 2014 10:13:04 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Jun 2014 12:17:28 GMT"
}
] | 2014-06-23T00:00:00 |
[
[
"Estreguil",
"Christine",
""
],
[
"Caudullo",
"Giovanni",
""
],
[
"de Rigo",
"Daniele",
""
]
] |
new_dataset
| 0.999546 |
1406.5369
|
Harald Koestler Dr.
|
Harald Koestler, Christian Schmitt, Sebastian Kuckuk, Frank Hannig,
Juergen Teich, Ulrich Ruede
|
A Scala Prototype to Generate Multigrid Solver Implementations for
Different Problems and Target Multi-Core Platforms
| null | null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many problems in computational science and engineering involve partial
differential equations and thus require the numerical solution of large, sparse
(non)linear systems of equations. Multigrid is known to be one of the most
efficient methods for this purpose. However, the concrete multigrid algorithm
and its implementation highly depend on the underlying problem and hardware.
Therefore, changes in the code or many different variants are necessary to
cover all relevant cases. In this article we provide a prototype implementation
in Scala for a framework that allows abstract descriptions of PDEs, their
discretization, and their numerical solution via multigrid algorithms. From
these, one is able to generate data structures and implementations of multigrid
components required to solve elliptic PDEs on structured grids. Two different
test problems showcase our proposed automatic generation of multigrid solvers
for both CPU and GPU target platforms.
|
[
{
"version": "v1",
"created": "Fri, 20 Jun 2014 12:46:27 GMT"
}
] | 2014-06-23T00:00:00 |
[
[
"Koestler",
"Harald",
""
],
[
"Schmitt",
"Christian",
""
],
[
"Kuckuk",
"Sebastian",
""
],
[
"Hannig",
"Frank",
""
],
[
"Teich",
"Juergen",
""
],
[
"Ruede",
"Ulrich",
""
]
] |
new_dataset
| 0.951777 |
1406.5376
|
Leandro Montero
|
Raquel \'Agueda, Valentin Borozan, Marina Groshaus, Yannis
Manoussakis, Gervais Mendy, Leandro Montero
|
Proper Hamiltonian Paths in Edge-Coloured Multigraphs
|
21 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path
that contains all the vertices of the multigraph such that no two adjacent
edges have the same colour. In this work we establish sufficient conditions for
an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian
path, involving various parameters as the number of edges, the number of
colours, the rainbow degree and the connectivity.
|
[
{
"version": "v1",
"created": "Fri, 20 Jun 2014 13:21:58 GMT"
}
] | 2014-06-23T00:00:00 |
[
[
"Águeda",
"Raquel",
""
],
[
"Borozan",
"Valentin",
""
],
[
"Groshaus",
"Marina",
""
],
[
"Manoussakis",
"Yannis",
""
],
[
"Mendy",
"Gervais",
""
],
[
"Montero",
"Leandro",
""
]
] |
new_dataset
| 0.999577 |
1102.3350
|
Felice Manganiello
|
Felice Manganiello, Anna-Lena Trautmann and Joachim Rosenthal
|
On conjugacy classes of subgroups of the general linear group and cyclic
orbit codes
|
5 pages; Submitted to IEEE International Symposium on Information
Theory (ISIT) 2011
| null |
10.1109/ISIT.2011.6033885
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Orbit codes are a family of codes employable for communications on a random
linear network coding channel. The paper focuses on the classification of these
codes. We start by classifying the conjugacy classes of cyclic subgroups of the
general linear group. As a result, we are able to focus the study of cyclic
orbit codes to a restricted family of them.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 14:43:08 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jul 2011 16:37:58 GMT"
}
] | 2014-06-20T00:00:00 |
[
[
"Manganiello",
"Felice",
""
],
[
"Trautmann",
"Anna-Lena",
""
],
[
"Rosenthal",
"Joachim",
""
]
] |
new_dataset
| 0.999003 |
1112.1238
|
Anna-Lena Trautmann
|
Anna-Lena Trautmann, Felice Manganiello, Michael Braun and Joachim
Rosenthal
|
Cyclic Orbit Codes
|
submitted to IEEE Transactions on Information Theory
|
IEEE Transactions on Information Theory, volume 59, number 11,
pages 7386-7404, 2013
|
10.1109/TIT.2013.2274266
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In network coding a constant dimension code consists of a set of
k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes
which are defined as orbits of a subgroup of the general linear group, acting
on the set of all subspaces of F_q^n. If the acting group is cyclic, the
corresponding orbit codes are called cyclic orbit codes. In this paper we give
a classification of cyclic orbit codes and propose a decoding procedure for a
particular subclass of cyclic orbit codes.
|
[
{
"version": "v1",
"created": "Tue, 6 Dec 2011 11:30:21 GMT"
}
] | 2014-06-20T00:00:00 |
[
[
"Trautmann",
"Anna-Lena",
""
],
[
"Manganiello",
"Felice",
""
],
[
"Braun",
"Michael",
""
],
[
"Rosenthal",
"Joachim",
""
]
] |
new_dataset
| 0.998938 |
1406.5038
|
Md Shakir Hossain
|
Sakir Hossain
|
Rain Attenuation Prediction for Terrestrial Microwave Link in Bangladesh
|
Journal of Electrical and Electronics Engineering (volume: 7, Issue:
1)
http://electroinf.uoradea.ro/images/articles/CERCETARE/Reviste/JEEE/JEEE_V7_N1_MAY_2014/Hossain_may2014.pdf
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rain attenuation is a major shortcoming of microwave transmission. As a
subtropical country, Bangladesh is one of the highest rainy areas of the world.
Thus, designing a terrestrial microwave link is a serious challenge to the
engineers. In this paper, the annual rain rate and monthly variation of rate
are predicted for different percentage of time of the year from the measured
rainfall data. Using ITU rain model for terrestrial microwave communication,
the rain attenuation is predicted for five major cities of Bangladesh, namely
Dhaka, Chittagong, Rajshahi, Sylhet, and Khulna. It is found that rain
attenuation is the most severe in Sylhet and least in Rajshahi. The attenuation
is estimated for different frequency and polarization. A horizontally polarized
signal encounters 15% more rain attenuation than that of vertically polarized
signal. It is also found that attenuation in Rajshahi is about 20% lesser than
that in Sylhet. Thus, the horizontally polarized transmission in Rajshahi
experiences about 5% less attenuation than the vertically polarized
transmission in Sylhet.
|
[
{
"version": "v1",
"created": "Thu, 19 Jun 2014 13:33:18 GMT"
}
] | 2014-06-20T00:00:00 |
[
[
"Hossain",
"Sakir",
""
]
] |
new_dataset
| 0.974761 |
1406.5073
|
Sadi Seker E
|
Sadi Evren Seker, Bilal Cankir, and Mehmet Lutfi Arslan
|
Information and Communication Technology Reputation for XU030 Quote
Companies
|
5 pages 2 figure 1 table 21 refs. arXiv admin note: text overlap with
arXiv:1401.7547
|
International Journal of Innovation, Management and Technology,
Vol. 5, No. 3, June 2014 ISSN: 2010-0248
|
10.7763/IJIMT.2014.V5.517
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By the increasing spread of information technology and Internet improvements,
most of the large-scale companies are paying special attention to their
reputation on many types of the information and communication technology. The
increasing developments and penetration of new technologies into daily life,
brings out paradigm shift on the perception of reputation and creates new
concepts like esocieties, techno-culture and new media. Contemporary companies
are trying to control their reputation over the new communities who are mostly
interacting with social networks, web pages and electronic communication
technologies. In this study, the reputation of top 30 Turkish companies, quoted
to the Istanbul Stock Market, is studied, based on the information technology
interfaces between company and society, such as social networks, blogs, wikis
and web pages. The web reputation is gathered through 17 different parameters,
collected from Google, Facebook, Twitter, Bing, Alexa, etc. The reputation
index is calculated by z-index and fscoring formulations after the min-max
normalization of each web reputation parameter.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2014 03:27:39 GMT"
}
] | 2014-06-20T00:00:00 |
[
[
"Seker",
"Sadi Evren",
""
],
[
"Cankir",
"Bilal",
""
],
[
"Arslan",
"Mehmet Lutfi",
""
]
] |
new_dataset
| 0.982444 |
1406.5151
|
Martha Rosa Cordero L\'opez
|
Martha Rosa Cordero Lopez and Marco Antonio Dorantes Gonzalez
|
Tollan-Xicocotitlan: A reconstructed City by augmented reality
|
15 pages, 12 figures, Fourth International Conference on Advances in
Computing and Information technology (ACITY 2014)
| null | null | null |
cs.CE cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This project presents the analysis, design, implementation and results of
Reconstruction Xicocotitlan Tollan-through augmented reality, which will
release information about the Toltec culture supplemented by presenting an
overview of the main premises of the Xicocotitlan Tollan city supported
dimensional models based on the augmented reality technique showing the user a
virtual representation of buildings in Tollan.
|
[
{
"version": "v1",
"created": "Thu, 19 Jun 2014 18:57:03 GMT"
}
] | 2014-06-20T00:00:00 |
[
[
"Lopez",
"Martha Rosa Cordero",
""
],
[
"Gonzalez",
"Marco Antonio Dorantes",
""
]
] |
new_dataset
| 0.998275 |
1406.4547
|
Patrick Sol\'e
|
Claude Carlet, Finley Freibert, Sylvain Guilley, Michael Kiermaier,
Jon-Lark Kim, Patrick Sol\'e
|
Higher-order CIS codes
|
13 pages; 1 figure
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce {\bf complementary information set codes} of higher-order. A
binary linear code of length $tk$ and dimension $k$ is called a complementary
information set code of order $t$ ($t$-CIS code for short) if it has $t$
pairwise disjoint information sets. The duals of such codes permit to reduce
the cost of masking cryptographic algorithms against side-channel attacks. As
in the case of codes for error correction, given the length and the dimension
of a $t$-CIS code, we look for the highest possible minimum distance. In this
paper, this new class of codes is investigated. The existence of good long CIS
codes of order $3$ is derived by a counting argument. General constructions
based on cyclic and quasi-cyclic codes and on the building up construction are
given. A formula similar to a mass formula is given. A classification of 3-CIS
codes of length $\le 12$ is given. Nonlinear codes better than linear codes are
derived by taking binary images of $\Z_4$-codes. A general algorithm based on
Edmonds' basis packing algorithm from matroid theory is developed with the
following property: given a binary linear code of rate $1/t$ it either provides
$t$ disjoint information sets or proves that the code is not $t$-CIS. Using
this algorithm, all optimal or best known $[tk, k]$ codes where $t=3, 4, \dots,
256$ and $1 \le k \le \lfloor 256/t \rfloor$ are shown to be $t$-CIS for all
such $k$ and $t$, except for $t=3$ with $k=44$ and $t=4$ with $k=37$.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2014 21:53:21 GMT"
}
] | 2014-06-19T00:00:00 |
[
[
"Carlet",
"Claude",
""
],
[
"Freibert",
"Finley",
""
],
[
"Guilley",
"Sylvain",
""
],
[
"Kiermaier",
"Michael",
""
],
[
"Kim",
"Jon-Lark",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.981442 |
1406.4690
|
Mehrnoosh Sadrzadeh
|
Mehrnoosh Sadrzadeh and Stephen Clark and Bob Coecke
|
The Frobenius anatomy of word meanings II: possessive relative pronouns
|
40 pages, Journal of Logic and Computation, Essays dedicated to Roy
Dyckhoff on the occasion of his retirement, S. Graham-Lengrand and D.
Galmiche (eds.), 2014
| null |
10.1093/logcom/exu027
| null |
cs.CL math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Within the categorical compositional distributional model of meaning, we
provide semantic interpretations for the subject and object roles of the
possessive relative pronoun `whose'. This is done in terms of Frobenius
algebras over compact closed categories. These algebras and their diagrammatic
language expose how meanings of words in relative clauses interact with each
other. We show how our interpretation is related to Montague-style semantics
and provide a truth-theoretic interpretation. We also show how vector spaces
provide a concrete interpretation and provide preliminary corpus-based
experimental evidence. In a prequel to this paper, we used similar methods and
dealt with the case of subject and object relative pronouns.
|
[
{
"version": "v1",
"created": "Wed, 18 Jun 2014 11:54:13 GMT"
}
] | 2014-06-19T00:00:00 |
[
[
"Sadrzadeh",
"Mehrnoosh",
""
],
[
"Clark",
"Stephen",
""
],
[
"Coecke",
"Bob",
""
]
] |
new_dataset
| 0.999404 |
1406.4852
|
Iwan M. Duursma
|
Iwan M. Duursma
|
Outer bounds for exact repair codes
|
14 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the open problem of establishing the rate region for exact-repair
regenerating codes for given parameters (n,k,d). Tian determined the rate
region for a (4,3,3) code and found that it lies strictly within the
functional-repair rate region. Using different methods, Sasidharan, Senthoor
and Kumar proved a non-vanishing gap between the functional-repair outer bound
and the exact-repair outer bound for codes with k>=3. Our main results are two
improved outer bounds for exact-repair regenerating codes. They capture and
then extend essential parts in the proofs by Tian and by Sasidharan, Senthoor
and Kumar. We show that the bounds can be combined for further improvements.
|
[
{
"version": "v1",
"created": "Wed, 18 Jun 2014 19:40:13 GMT"
}
] | 2014-06-19T00:00:00 |
[
[
"Duursma",
"Iwan M.",
""
]
] |
new_dataset
| 0.969123 |
1405.6483
|
Yi Wen tan
|
Wentan Yi and Shaozhen Chen
|
Integral Cryptanalysis of the Block Cipher E2
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Block cipher E2, designed and submitted by Nippon Telegraph and Telephone
Corporation, is a first-round Advanced Encryption Standard candidate. It
employs a Feistel structure as global structure and two-layer
substitution-permutation network structure in round function with initial
transformation IT function before the first round and final transformation FT
function after the last round. The design principles influences several more
recent block ciphers including Camellia, an ISO/IEC standard cipher. In this
paper, we focus on the key-recovery attacks on reduced-round E2-128/192 taking
both IT and FT functions in consideration with integral cryptanalysis. We first
improve the relations between zero-correlation linear approximations and
integral distinguishers, and then deduce some integral distinguishers from
zero-correlation linear approximations over 6 rounds of E2. Furthermore, we
apply these integral distinguishers to break 6-round E2-128 with 2^{120} known
plaintexts (KPs), 2^{115.4} encryptions and 2^{28} bytes memory. In addition,
the attack on 7-round E2-192 requires 2^{120} KPs, 2^{167.2} encryptions and
2^{60} bytes memory.
|
[
{
"version": "v1",
"created": "Mon, 26 May 2014 07:25:10 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Jun 2014 00:03:22 GMT"
}
] | 2014-06-18T00:00:00 |
[
[
"Yi",
"Wentan",
""
],
[
"Chen",
"Shaozhen",
""
]
] |
new_dataset
| 0.993905 |
1406.4162
|
Ahmed Alaa
|
Ahmed M. Alaa
|
Band-Sweeping M-ary PSK (BS-M-PSK) Modulation and Transceiver Design
|
To appear in IEEE Potentials Magazine
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel Estimation is a major problem encountered by receiver designers for
wireless communications systems. The fading channels encountered by the system
are usually time variant for a mobile receiver. Besides, the frequency response
of the channel is frequency selective for urban environments where the delay
spread is quite large compared to the symbol duration. Estimating the channel
is essential for equalizing the received data and removing the Inter-Symbol
Interference (ISI) resulting from the dispersive channel. Hence, conventional
transceivers insert pilot symbols of known values and detect the changes in it
in order to deduce the channel response. Because these pilots carry no
information, the throughput of the system is reduced. A Novel modulation scheme
is presented in this work. The technique depends on using a carrier signal that
has no fixed frequency, the carrier tone sweeps the band dedicated for
transmission and detects the transfer function gain within the band. A carrier
signal that is Frequency Modulated (FM) by a periodic ramp signal becomes
Amplitude Modulated (AM) by the channel transfer function, and thus, the
receiver obtains an estimate for the channel response without using pilots that
decrease the systems throughput or data rate. The carrier signal itself acts as
a dynamic frequency domain pilot. The technique only works for constant energy
systems, and thus it is applied to PSK transceivers. Mathematical formulation,
transceiver design and performance analysis of the proposed modulation
technique are presented.
|
[
{
"version": "v1",
"created": "Thu, 30 Jan 2014 14:35:44 GMT"
}
] | 2014-06-18T00:00:00 |
[
[
"Alaa",
"Ahmed M.",
""
]
] |
new_dataset
| 0.981219 |
1406.4197
|
Scott Summers
|
David Furcy and Scott M. Summers
|
Scaled pier fractals do not strictly self-assemble
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A \emph{pier fractal} is a discrete self-similar fractal whose generator
contains at least one \emph{pier}, that is, a member of the generator with
exactly one adjacent point. Tree fractals and pinch-point fractals are special
cases of pier fractals. In this paper, we study \emph{scaled pier fractals},
where a \emph{scaled fractal} is the shape obtained by replacing each point in
the original fractal by a $c \times c$ block of points, for some $c \in
\mathbb{Z}^+$. We prove that no scaled discrete self-similar pier fractal
strictly self-assembles, at any temperature, in Winfree's abstract Tile
Assembly Model.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2014 00:34:42 GMT"
}
] | 2014-06-18T00:00:00 |
[
[
"Furcy",
"David",
""
],
[
"Summers",
"Scott M.",
""
]
] |
new_dataset
| 0.998534 |
1406.4212
|
Fabio Brochero Martinez
|
F.E. Brochero Mart\'inez
|
Number of minimal cyclic codes with given length and dimension
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we count the quantity of minimal cyclic codes of length $n$
and dimension $k$ over a finite field $\mathbb F_q$, in the case when the prime
factors of $n$ satisfy a special condition. This problem is equivalent to count
the quantity of irreducible factors of $x^n-1\in \mathbb F_q[x]$ of degree $k$.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2014 01:36:05 GMT"
}
] | 2014-06-18T00:00:00 |
[
[
"Martínez",
"F. E. Brochero",
""
]
] |
new_dataset
| 0.999073 |
1406.4395
|
Morgane Esti\'evenart
|
Thomas Brihaye, Morgane Esti\'evenart, Gilles Geeraerts
|
On MITL and alternating timed automata over infinite words
| null | null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One clock alternating timed automata (OCATA) have been introduced as natural
extension of (one clock) timed automata to express the semantics of MTL. In
this paper, we consider the application of OCATA to the problems of
model-checking and satisfiability for MITL (a syntactic fragment of MTL),
interpreted over infinite words. Our approach is based on the interval
semantics (recently introduced in [BEG13] in the case of finite words) extended
to infinite words. We propose region-based and zone-based algorithms, based on
this semantics, for MITL model-checking and satisfiability. We report on the
performance of a prototype tool implementing those algorithms.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2014 15:03:23 GMT"
}
] | 2014-06-18T00:00:00 |
[
[
"Brihaye",
"Thomas",
""
],
[
"Estiévenart",
"Morgane",
""
],
[
"Geeraerts",
"Gilles",
""
]
] |
new_dataset
| 0.998373 |
1404.2505
|
Loet Leydesdorff
|
Loet Leydesdorff, F\'elix de Moya-Aneg\'on, and Wouter de Nooy
|
Aggregated journal-journal citation relations in Scopus and
Web-of-Science matched and compared in terms of networks, maps, and
interactive overlays
|
the paper is accepted for publication in the Journal of the
Association for Information Science and Technology (JASIST)
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We compare the network of aggregated journal-journal citation relations
provided by the Journal Citation Reports (JCR) 2012 of the Science and Social
Science Citation Indexes (SCI and SSCI) with similar data based on Scopus 2012.
First, global maps were developed for the two sets separately; sets of
documents can then be compared using overlays to both maps. Using fuzzy-string
matching and ISSN numbers, we were able to match 10,524 journal names between
the two sets; that is, 96.4% of the 10,936 journals contained in JCR or 51.2%
of the 20,554 journals covered by Scopus. Network analysis was then pursued on
the set of journals shared between the two databases and the two sets of unique
journals. Citations among the shared journals are more comprehensively covered
in JCR than Scopus, so the network in JCR is denser and more connected than in
Scopus. The ranking of shared journals in terms of indegree (that is, numbers
of citing journals) or total citations is similar in both databases overall
(Spearman's \r{ho} > 0.97), but some individual journals rank very differently.
Journals that are unique to Scopus seem to be less important--they are citing
shared journals rather than being cited by them--but the humanities are covered
better in Scopus than in JCR.
|
[
{
"version": "v1",
"created": "Wed, 9 Apr 2014 14:47:57 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Apr 2014 06:57:34 GMT"
},
{
"version": "v3",
"created": "Sat, 14 Jun 2014 11:44:31 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
],
[
"de Moya-Anegón",
"Félix",
""
],
[
"de Nooy",
"Wouter",
""
]
] |
new_dataset
| 0.955712 |
1405.7102
|
Tim Althoff
|
Tim Althoff, Hyun Oh Song, Trevor Darrell
|
Detection Bank: An Object Detection Based Video Representation for
Multimedia Event Recognition
|
ACM Multimedia 2012
| null | null | null |
cs.MM cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While low-level image features have proven to be effective representations
for visual recognition tasks such as object recognition and scene
classification, they are inadequate to capture complex semantic meaning
required to solve high-level visual tasks such as multimedia event detection
and recognition. Recognition or retrieval of events and activities can be
improved if specific discriminative objects are detected in a video sequence.
In this paper, we propose an image representation, called Detection Bank, based
on the detection images from a large number of windowed object detectors where
an image is represented by different statistics derived from these detections.
This representation is extended to video by aggregating the key frame level
image representations through mean and max pooling. We empirically show that it
captures complementary information to state-of-the-art representations such as
Spatial Pyramid Matching and Object Bank. These descriptors combined with our
Detection Bank representation significantly outperforms any of the
representations alone on TRECVID MED 2011 data.
|
[
{
"version": "v1",
"created": "Wed, 28 May 2014 02:07:29 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Jun 2014 20:17:48 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Althoff",
"Tim",
""
],
[
"Song",
"Hyun Oh",
""
],
[
"Darrell",
"Trevor",
""
]
] |
new_dataset
| 0.988164 |
1406.3812
|
Petr Golovach
|
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, and Christophe Paul
|
Hadwiger number of graphs with small chordality
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Hadwiger number of a graph G is the largest integer h such that G has the
complete graph K_h as a minor. We show that the problem of determining the
Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved
in polynomial time on cographs and on bipartite permutation graphs. We also
consider a natural generalization of this problem that asks for the largest
integer h such that G has a minor with h vertices and diameter at most $s$. We
show that this problem can be solved in polynomial time on AT-free graphs when
s>=2, but is NP-hard on chordal graphs for every fixed s>=2.
|
[
{
"version": "v1",
"created": "Sun, 15 Jun 2014 13:08:56 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Golovach",
"Petr A.",
""
],
[
"Heggernes",
"Pinar",
""
],
[
"Hof",
"Pim van 't",
""
],
[
"Paul",
"Christophe",
""
]
] |
new_dataset
| 0.997491 |
1406.3860
|
Taylor Gordon
|
Taylor Gordon
|
The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations
|
12 pages, 5 figures
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider embeddings of planar graphs in $R^2$ where vertices map to points
and edges map to polylines. We refer to such an embedding as a polyline
drawing, and ask how few bends are required to form such a drawing for an
arbitrary planar graph. It has long been known that even when the vertex
locations are completely fixed, a planar graph admits a polyline drawing where
edges bend a total of $O(n^2)$ times. Our results show that this number of
bends is optimal. In particular, we show that $\Omega(n^2)$ total bends is
required to form a polyline drawing on any set of fixed vertex locations for
almost all planar graphs. This result generalizes all previously known lower
bounds, which only applied to convex point sets, and settles 2 open problems.
|
[
{
"version": "v1",
"created": "Sun, 15 Jun 2014 21:16:45 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Gordon",
"Taylor",
""
]
] |
new_dataset
| 0.998263 |
1406.3876
|
Shawn Jones
|
Shawn M. Jones, Michael L. Nelson, Harihar Shankar, Herbert Van de
Sompel
|
Bringing Web Time Travel to MediaWiki: An Assessment of the Memento
MediaWiki Extension
|
23 pages, 18 figures, 9 tables, 17 listings
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have implemented the Memento MediaWiki Extension Version 2.0, which brings
the Memento Protocol to MediaWiki, used by Wikipedia and the Wikimedia
Foundation. Test results show that the extension has a negligible impact on
performance. Two 302 status code datetime negotiation patterns, as defined by
Memento, have been examined for the extension: Pattern 1.1, which requires 2
requests, versus Pattern 2.1, which requires 3 requests. Our test results and
mathematical review find that, contrary to intuition, Pattern 2.1 performs
better than Pattern 1.1 due to idiosyncrasies in MediaWiki. In addition to
implementing Memento, Version 2.0 allows administrators to choose the optional
200-style datetime negotiation Pattern 1.2 instead of Pattern 2.1. It also
permits administrators the ability to have the Memento MediaWiki Extension
return full HTTP 400 and 500 status codes rather than using standard MediaWiki
error pages. Finally, version 2.0 permits administrators to turn off
recommended Memento headers if desired. Seeing as much of our work focuses on
producing the correct revision of a wiki page in response to a user's datetime
input, we also examine the problem of finding the correct revisions of the
embedded resources, including images, stylesheets, and JavaScript; identifying
the issues and discussing whether or not MediaWiki must be changed to support
this functionality.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2014 01:01:54 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Jones",
"Shawn M.",
""
],
[
"Nelson",
"Michael L.",
""
],
[
"Shankar",
"Harihar",
""
],
[
"Van de Sompel",
"Herbert",
""
]
] |
new_dataset
| 0.99914 |
1406.4048
|
Abuzer Yakaryilmaz
|
A. C. Cem Say and Abuzer Yakaryilmaz
|
Quantum finite automata: A modern introduction
|
15 pages
| null | null | null |
cs.FL cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present five examples where quantum finite automata (QFAs) outperform
their classical counterparts. This may be useful as a relatively simple
technique to introduce quantum computation concepts to computer scientists. We
also describe a modern QFA model involving superoperators that is able to
simulate all known QFA and classical finite automaton variants.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2014 15:33:18 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Say",
"A. C. Cem",
""
],
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.998581 |
1406.4057
|
Aarne Ranta
|
Aarne Ranta
|
Embedded Controlled Languages
|
7 pages, extended abstract, preprint for CNL 2014 in Galway
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by embedded programming languages, an embedded CNL (controlled
natural language) is a proper fragment of an entire natural language (its host
language), but it has a parser that recognizes the entire host language. This
makes it possible to process out-of-CNL input and give useful feedback to
users, instead of just reporting syntax errors. This extended abstract explains
the main concepts of embedded CNL implementation in GF (Grammatical Framework),
with examples from machine translation and some other ongoing work.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2014 16:11:32 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Ranta",
"Aarne",
""
]
] |
new_dataset
| 0.996896 |
1406.4086
|
Leon Abdillah
|
Leon Andretti Abdillah
|
Social media as political party campaign in Indonesia
|
10 pages
|
Jurnal Ilmiah MATRIK, vol. 16, pp. 1-10, 2014
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media as a trend in the Internet is now used as a medium for political
campaigns. Author explores the advantages and social media implementation of
any political party in Indonesia legislative elections 2014. Author visited and
analyzed social media used by the contestants, such as: Facebook, and Twitter.
Author collected data from social media until the end of April 2014. This
article discusses the use of social media by political parties and their
features. The results of this study indicate that social media are: 1)
effective tool for current and future political campaigns, 2) reach the voters
and supporters instantly, 3) used by Political parties to show their logo/icon,
and 4) last but not least quick count results also show that political parties
which using social media as part of their campaigns won the legislative
elections.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2014 17:58:18 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Abdillah",
"Leon Andretti",
""
]
] |
new_dataset
| 0.996868 |
1406.4110
|
Bernardo Cuenca Grau
|
Bernardo Cuenca Grau, Ian Horrocks, Markus Kr\"otzsch, Clemens Kupke,
Despoina Magka, Boris Motik, Zhe Wang
|
Acyclicity Notions for Existential Rules and Their Application to Query
Answering in Ontologies
| null |
Journal Of Artificial Intelligence Research, Volume 47, pages
741-808, 2013
|
10.1613/jair.3949
| null |
cs.DB cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Answering conjunctive queries (CQs) over a set of facts extended with
existential rules is a prominent problem in knowledge representation and
databases. This problem can be solved using the chase algorithm, which extends
the given set of facts with fresh facts in order to satisfy the rules. If the
chase terminates, then CQs can be evaluated directly in the resulting set of
facts. The chase, however, does not terminate necessarily, and checking whether
the chase terminates on a given set of rules and facts is undecidable. Numerous
acyclicity notions were proposed as sufficient conditions for chase
termination. In this paper, we present two new acyclicity notions called
model-faithful acyclicity (MFA) and model-summarising acyclicity (MSA).
Furthermore, we investigate the landscape of the known acyclicity notions and
establish a complete taxonomy of all notions known to us. Finally, we show that
MFA and MSA generalise most of these notions.
Existential rules are closely related to the Horn fragments of the OWL 2
ontology language; furthermore, several prominent OWL 2 reasoners implement CQ
answering by using the chase to materialise all relevant facts. In order to
avoid termination problems, many of these systems handle only the OWL 2 RL
profile of OWL 2; furthermore, some systems go beyond OWL 2 RL, but without any
termination guarantees. In this paper we also investigate whether various
acyclicity notions can provide a principled and practical solution to these
problems. On the theoretical side, we show that query answering for acyclic
ontologies is of lower complexity than for general ontologies. On the practical
side, we show that many of the commonly used OWL 2 ontologies are MSA, and that
the number of facts obtained by materialisation is not too large. Our results
thus suggest that principled development of materialisation-based OWL 2
reasoners is practically feasible.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 01:44:16 GMT"
}
] | 2014-06-17T00:00:00 |
[
[
"Grau",
"Bernardo Cuenca",
""
],
[
"Horrocks",
"Ian",
""
],
[
"Krötzsch",
"Markus",
""
],
[
"Kupke",
"Clemens",
""
],
[
"Magka",
"Despoina",
""
],
[
"Motik",
"Boris",
""
],
[
"Wang",
"Zhe",
""
]
] |
new_dataset
| 0.972572 |
1405.2736
|
Elisa Gorla
|
Elisa Gorla, Alberto Ravagnani
|
Subspace codes from Ferrers diagrams
|
minor edits
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we give new constructions of Ferrer diagram rank metric codes,
which achieve the largest possible dimension. In particular, we prove several
cases of a conjecture by T. Etzion and N. Silberstein. We also establish a
sharp lower bound on the dimension of linear rank metric anticodes with a given
profile. Combining our results with the multilevel construction, we produce
examples of subspace codes with the largest known cardinality for the given
parameters.
|
[
{
"version": "v1",
"created": "Mon, 12 May 2014 13:01:37 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Jun 2014 09:03:54 GMT"
}
] | 2014-06-16T00:00:00 |
[
[
"Gorla",
"Elisa",
""
],
[
"Ravagnani",
"Alberto",
""
]
] |
new_dataset
| 0.993708 |
1406.3400
|
Petr Novikov
|
Sasa Jokic, Petr Novikov, Stuart Maggs, Dori Sadan, Shihui Jin,
Cristina Nan
|
Robotic positioning device for three-dimensional printing
|
14 pages, 9 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Additive manufacturing brings a variety of new possibilities to the
construction industry, extending the capabilities of existing fabrication
methods whilst also creating new possibilities. Currently three-dimensional
printing is used to produce small-scale objects; large-scale three-dimensional
printing is difficult due to the size of positioning devices and machine
elements. Presently fixed Computer Numerically Controlled (CNC) routers and
robotic arms are used to position print-heads. Fixed machines have work
envelope limitations and can't produce objects outside of these limits.
Large-scale three-dimensional printing requires large machines that are costly
to build and hard to transport. This paper presents a compact print-head
positioning device for Fused Deposition Modeling (FDM) a method of
three-dimensional printing independent from the size of the object it prints.
|
[
{
"version": "v1",
"created": "Fri, 13 Jun 2014 01:09:16 GMT"
}
] | 2014-06-16T00:00:00 |
[
[
"Jokic",
"Sasa",
""
],
[
"Novikov",
"Petr",
""
],
[
"Maggs",
"Stuart",
""
],
[
"Sadan",
"Dori",
""
],
[
"Jin",
"Shihui",
""
],
[
"Nan",
"Cristina",
""
]
] |
new_dataset
| 0.997323 |
1406.3405
|
Sanguthevar Rajasekaran
|
Sanguthevar Rajasekaran and Marius Nicolae
|
An error correcting parser for context free grammars that takes less
than cubic time
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of parsing has been studied extensively for various formal
grammars. Given an input string and a grammar, the parsing problem is to check
if the input string belongs to the language generated by the grammar. A closely
related problem of great importance is one where the input are a string ${\cal
I}$ and a grammar $G$ and the task is to produce a string ${\cal I}'$ that
belongs to the language generated by $G$ and the `distance' between ${\cal I}$
and ${\cal I}'$ is the smallest (from among all the strings in the language).
Specifically, if ${\cal I}$ is in the language generated by $G$, then the
output should be ${\cal I}$. Any parser that solves this version of the problem
is called an {\em error correcting parser}. In 1972 Aho and Peterson presented
a cubic time error correcting parser for context free grammars. Since then this
asymptotic time bound has not been improved under the (standard) assumption
that the grammar size is a constant. In this paper we present an error
correcting parser for context free grammars that runs in $O(T(n))$ time, where
$n$ is the length of the input string and $T(n)$ is the time needed to compute
the tropical product of two $n\times n$ matrices.
In this paper we also present an $\frac{n}{M}$-approximation algorithm for
the {\em language edit distance problem} that has a run time of $O(Mn^\omega)$,
where $O(n^\omega)$ is the time taken to multiply two $n\times n$ matrices. To
the best of our knowledge, no approximation algorithms have been proposed for
error correcting parsing for general context free grammars.
|
[
{
"version": "v1",
"created": "Fri, 13 Jun 2014 02:05:37 GMT"
}
] | 2014-06-16T00:00:00 |
[
[
"Rajasekaran",
"Sanguthevar",
""
],
[
"Nicolae",
"Marius",
""
]
] |
new_dataset
| 0.984926 |
1406.3567
|
Siamak Sarmady
|
Siamak Sarmady, Fazilah Haron and Abdullah Zawawi Talib
|
Simulation of Pedestrian Movements Using Fine Grid Cellular Automata
Model
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crowd simulation is used for evacuation and crowd safety inspections, study
of performance in crowd systems and animations. Cellular automata has been
extensively used in modelling the crowd. In regular cellular automata models,
each pedestrian occupies a single cell with the size of a pedestrian body.
Since the space is divided into relatively large cells, the movements of
pedestrians look like the movements of pieces on a chess board. Furthermore,
all pedestrians have the same body size and speed. In this paper, a method
called fine grid cellular automata is proposed in which smaller cells are used
and pedestrian body may occupy several cells. The model allows the use of
different body sizes, shapes and speeds for pedestrian.
The proposed model is used for simulating movements of pedestrians toward a
target. A typical walkway scenario is used to test and evaluate the model. The
movements of pedestrians are smoother because of the finer grain discretization
of movements and the simulation results match empirical speed-density graphs
with good accuracy.
|
[
{
"version": "v1",
"created": "Fri, 13 Jun 2014 15:25:32 GMT"
}
] | 2014-06-16T00:00:00 |
[
[
"Sarmady",
"Siamak",
""
],
[
"Haron",
"Fazilah",
""
],
[
"Talib",
"Abdullah Zawawi",
""
]
] |
new_dataset
| 0.998893 |
1406.2807
|
Yin Li
|
Yin Li, Xiaodi Hou, Christof Koch, James M. Rehg, Alan L. Yuille
|
The Secrets of Salient Object Segmentation
|
15 pages, 8 figures. Conference version was accepted by CVPR 2014
| null | null |
CBMM Memmo #14
|
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper we provide an extensive evaluation of fixation prediction and
salient object segmentation algorithms as well as statistics of major datasets.
Our analysis identifies serious design flaws of existing salient object
benchmarks, called the dataset design bias, by over emphasizing the
stereotypical concepts of saliency. The dataset design bias does not only
create the discomforting disconnection between fixations and salient object
segmentation, but also misleads the algorithm designing. Based on our analysis,
we propose a new high quality dataset that offers both fixation and salient
object segmentation ground-truth. With fixations and salient object being
presented simultaneously, we are able to bridge the gap between fixations and
salient objects, and propose a novel method for salient object segmentation.
Finally, we report significant benchmark progress on three existing datasets of
segmenting salient objects
|
[
{
"version": "v1",
"created": "Wed, 11 Jun 2014 07:46:03 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Jun 2014 17:35:08 GMT"
}
] | 2014-06-13T00:00:00 |
[
[
"Li",
"Yin",
""
],
[
"Hou",
"Xiaodi",
""
],
[
"Koch",
"Christof",
""
],
[
"Rehg",
"James M.",
""
],
[
"Yuille",
"Alan L.",
""
]
] |
new_dataset
| 0.990202 |
1406.3117
|
Anh Nguyen
|
Anh Nguyen, Amy Banic
|
Low-cost Augmented Reality prototype for controlling network devices
| null | null | null | null |
cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the evolution of mobile devices, and smart-phones in particular, comes
the ability to create new experiences that enhance the way we see, interact,
and manipulate objects, within the world that surrounds us. It is now possible
to blend data from our senses and our devices in numerous ways that simply were
not possible before using Augmented Reality technology. In a near future, when
all of the office devices as well as your personal electronic gadgets are on a
common wireless network, operating them using a universal remote controller
would be possible. This paper presents an off-the-shelf, low-cost prototype
that leverages the Augmented Reality technology to deliver a novel and
interactive way of operating office network devices around using a mobile
device. We believe this type of system may provide benefits to controlling
multiple integrated devices and visualizing interconnectivity or utilizing
visual elements to pass information from one device to another, or may be
especially beneficial to control devices when interacting with them physically
may be difficult or pose danger or harm.
|
[
{
"version": "v1",
"created": "Thu, 12 Jun 2014 04:46:32 GMT"
}
] | 2014-06-13T00:00:00 |
[
[
"Nguyen",
"Anh",
""
],
[
"Banic",
"Amy",
""
]
] |
new_dataset
| 0.999415 |
1406.3149
|
Christian Napoli
|
Francesco Bonanno, Giacomo Capizzi, Grazia Lo Sciuto, Christian
Napoli, Giuseppe Pappalardo, Emiliano Tramontana
|
A Cascade Neural Network Architecture investigating Surface Plasmon
Polaritons propagation for thin metals in OpenMP
| null |
International conference on Artificial Intelligence and Soft
Computing (ICAISC 2014), Vol I, 22-33 (2014)
| null | null |
cs.NE cond-mat.mes-hall cond-mat.mtrl-sci cs.DC cs.LG
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Surface plasmon polaritons (SPPs) confined along metal-dielectric interface
have attracted a relevant interest in the area of ultracompact photonic
circuits, photovoltaic devices and other applications due to their strong field
confinement and enhancement. This paper investigates a novel cascade neural
network (NN) architecture to find the dependance of metal thickness on the SPP
propagation. Additionally, a novel training procedure for the proposed cascade
NN has been developed using an OpenMP-based framework, thus greatly reducing
training time. The performed experiments confirm the effectiveness of the
proposed NN architecture for the problem at hand.
|
[
{
"version": "v1",
"created": "Thu, 12 Jun 2014 08:40:04 GMT"
}
] | 2014-06-13T00:00:00 |
[
[
"Bonanno",
"Francesco",
""
],
[
"Capizzi",
"Giacomo",
""
],
[
"Sciuto",
"Grazia Lo",
""
],
[
"Napoli",
"Christian",
""
],
[
"Pappalardo",
"Giuseppe",
""
],
[
"Tramontana",
"Emiliano",
""
]
] |
new_dataset
| 0.966442 |
1406.2795
|
Adrian Kosowski
|
Shantanu Das (LIF), Dariusz Dereniowski, Adrian Kosowski (INRIA
Rocquencourt, LIAFA), Przemyslaw Uznanski (LIF)
|
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of rendezvous of two mobile agents starting at distinct
locations in an unknown graph. The agents have distinct labels and walk in
synchronous steps. However the graph is unlabelled and the agents have no means
of marking the nodes of the graph and cannot communicate with or see each other
until they meet at a node. When the graph is very large we want the time to
rendezvous to be independent of the graph size and to depend only on the
initial distance between the agents and some local parameters such as the
degree of the vertices, and the size of the agent's label. It is well known
that even for simple graphs of degree $\Delta$, the rendezvous time can be
exponential in $\Delta$ in the worst case. In this paper, we introduce a new
version of the rendezvous problem where the agents are equipped with a device
that measures its distance to the other agent after every step. We show that
these \emph{distance-aware} agents are able to rendezvous in any unknown graph,
in time polynomial in all the local parameters such the degree of the nodes,
the initial distance $D$ and the size of the smaller of the two agent labels $l
= \min(l_1, l_2)$. Our algorithm has a time complexity of
$O(\Delta(D+\log{l}))$ and we show an almost matching lower bound of
$\Omega(\Delta(D+\log{l}/\log{\Delta}))$ on the time complexity of any
rendezvous algorithm in our scenario. Further, this lower bound extends
existing lower bounds for the general rendezvous problem without distance
awareness.
|
[
{
"version": "v1",
"created": "Wed, 11 Jun 2014 07:01:42 GMT"
}
] | 2014-06-12T00:00:00 |
[
[
"Das",
"Shantanu",
"",
"LIF"
],
[
"Dereniowski",
"Dariusz",
"",
"INRIA\n Rocquencourt, LIAFA"
],
[
"Kosowski",
"Adrian",
"",
"INRIA\n Rocquencourt, LIAFA"
],
[
"Uznanski",
"Przemyslaw",
"",
"LIF"
]
] |
new_dataset
| 0.998844 |
1406.2823
|
Roberto Lopez-Herrejon
|
Roberto E. Lopez-Herrejon and Javier Ferrer and Francisco Chicano and
Lukas Linsbauer and Alexander Egyed and Enrique Alba
|
A Hitchhiker's Guide to Search-Based Software Engineering for Software
Product Lines
| null | null | null | null |
cs.SE cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Search Based Software Engineering (SBSE) is an emerging discipline that
focuses on the application of search-based optimization techniques to software
engineering problems. The capacity of SBSE techniques to tackle problems
involving large search spaces make their application attractive for Software
Product Lines (SPLs). In recent years, several publications have appeared that
apply SBSE techniques to SPL problems. In this paper, we present the results of
a systematic mapping study of such publications. We identified the stages of
the SPL life cycle where SBSE techniques have been used, what case studies have
been employed and how they have been analysed. This mapping study revealed
potential venues for further research as well as common misunderstanding and
pitfalls when applying SBSE techniques that we address by providing a guideline
for researchers and practitioners interested in exploiting these techniques.
|
[
{
"version": "v1",
"created": "Wed, 11 Jun 2014 08:43:51 GMT"
}
] | 2014-06-12T00:00:00 |
[
[
"Lopez-Herrejon",
"Roberto E.",
""
],
[
"Ferrer",
"Javier",
""
],
[
"Chicano",
"Francisco",
""
],
[
"Linsbauer",
"Lukas",
""
],
[
"Egyed",
"Alexander",
""
],
[
"Alba",
"Enrique",
""
]
] |
new_dataset
| 0.986053 |
1402.2143
|
Uli Fahrenberg
|
Uli Fahrenberg and Axel Legay and Louis-Marie Traonouez
|
Structural Refinement for the Modal nu-Calculus
|
Accepted at ICTAC 2014
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new notion of structural refinement, a sound abstraction of
logical implication, for the modal nu-calculus. Using new translations between
the modal nu-calculus and disjunctive modal transition systems, we show that
these two specification formalisms are structurally equivalent.
Using our translations, we also transfer the structural operations of
composition and quotient from disjunctive modal transition systems to the modal
nu-calculus. This shows that the modal nu-calculus supports composition and
decomposition of specifications.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 13:46:55 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Jun 2014 12:53:50 GMT"
}
] | 2014-06-11T00:00:00 |
[
[
"Fahrenberg",
"Uli",
""
],
[
"Legay",
"Axel",
""
],
[
"Traonouez",
"Louis-Marie",
""
]
] |
new_dataset
| 0.971879 |
1404.5034
|
Musheer Ahmad
|
Parvez Mahmood Khan, M M Sufyan Beg, Musheer Ahmad
|
Sustaining IT PMOs during Cycles of Global Recession
| null |
European Journal of Scientific Research, vol. 114, no. 3, pp.
376-385, November 2013
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Growth in the number of PMOs established by the industry over last decade and
ever growing body of literature on PMO related research in academia is a clear
indication that there is very clear interest of researchers, practitioners and
industries across the globe to understand and explore value propositions of
PMO. However, there is still a lack of consensus on many critical aspects of
PMOs. While there are many PMOs being established, but there are also many
being closed and disbanded, which is definitely a matter of concern. In
industry environment, a narrow majority of PMOs are well-regarded by their
organizations and are seen as contributing business value, many of the others
are still struggling to show value for money and some are failing, causing a
high mortality rate among PMOs. This paper is the result of a study undertaken
to get a deeper understanding of factors that may be causing mortality and
failure of PMOs. Post Implementation Reviews of 4-failed & 3-challenged PMOs in
IT-Industry were carried out with concerned Project Managers & PMO-staff, using
grounded theory research method, with support from the concerned enterprise
from IT-Industry.
|
[
{
"version": "v1",
"created": "Sun, 20 Apr 2014 12:03:08 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Jun 2014 13:17:46 GMT"
}
] | 2014-06-11T00:00:00 |
[
[
"Khan",
"Parvez Mahmood",
""
],
[
"Beg",
"M M Sufyan",
""
],
[
"Ahmad",
"Musheer",
""
]
] |
new_dataset
| 0.998858 |
1406.2495
|
Paolo Missier
|
Hugo Firth and Paolo Missier
|
ProvGen: generating synthetic PROV graphs with predictable structure
|
IPAW'14 paper, In Procs. IPAW 2014 (Provenance and Annotations).
Koln, Germany: Springer, 2014
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces provGen, a generator aimed at producing large synthetic
provenance graphs with predictable properties and of arbitrary size. Synthetic
provenance graphs serve two main purposes. Firstly, they provide a variety of
controlled workloads that can be used to test storage and query capabilities of
provenance management systems at scale. Secondly, they provide challenging
testbeds for experimenting with graph algorithms for provenance analytics, an
area of increasing research interest. provGen produces PROV graphs and stores
them in a graph DBMS (Neo4J). A key feature is to let users control the
relationship makeup and topological features of the graph, by providing a seed
provenance pattern along with a set of constraints, expressed using a custom
Domain Specific Language. We also propose a simple method for evaluating the
quality of the generated graphs, by measuring how realistically they simulate
the structure of real-world patterns.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2014 10:20:33 GMT"
}
] | 2014-06-11T00:00:00 |
[
[
"Firth",
"Hugo",
""
],
[
"Missier",
"Paolo",
""
]
] |
new_dataset
| 0.997471 |
1406.2538
|
Guntis Barzdins
|
Guntis Barzdins
|
FrameNet CNL: a Knowledge Representation and Information Extraction
Language
|
CNL-2014 camera-ready version. The final publication is available at
link.springer.com
| null | null | null |
cs.CL cs.AI cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a FrameNet-based information extraction and knowledge
representation framework, called FrameNet-CNL. The framework is used on natural
language documents and represents the extracted knowledge in a tailor-made
Frame-ontology from which unambiguous FrameNet-CNL paraphrase text can be
generated automatically in multiple languages. This approach brings together
the fields of information extraction and CNL, because a source text can be
considered belonging to FrameNet-CNL, if information extraction parser produces
the correct knowledge representation as a result. We describe a
state-of-the-art information extraction parser used by a national news agency
and speculate that FrameNet-CNL eventually could shape the natural language
subset used for writing the newswire articles.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2014 13:16:36 GMT"
}
] | 2014-06-11T00:00:00 |
[
[
"Barzdins",
"Guntis",
""
]
] |
new_dataset
| 0.999095 |
1406.2544
|
Thomas Nowak
|
Matthias F\"ugger and Robert Najvirt and Thomas Nowak and Ulrich
Schmid
|
Faithful Glitch Propagation in Binary Circuit Models
|
18 pages, 7 figures
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern digital circuit design relies on fast digital timing simulation tools
and, hence, on accurate binary-valued circuit models that faithfully model
signal propagation, even throughout a complex design. Unfortunately, it was
recently proved [F\"ugger et al., ASYNC'13] that no existing binary-valued
circuit model proposed so far, including the two most commonly used pure and
inertial delay channels, faithfully captures glitch propagation: For the simple
Short-Pulse Filtration (SPF) problem, which is related to a circuit's ability
to suppress a single glitch, we showed that the quite broad class of bounded
single-history channels either contradict the unsolvability of SPF in bounded
time or the solvability of SPF in unbounded time in physical circuits.
In this paper, we propose a class of binary circuit models that do not suffer
from this deficiency: Like bounded single-history channels, our involution
channels involve delays that may depend on the time of the previous output
transition. Their characteristic property are delay functions which are based
on involutions, i.e., functions that form their own inverse. A concrete example
of such a delay function, which is derived from a generalized first-order
analog circuit model, reveals that this is not an unrealistic assumption. We
prove that, in sharp contrast to what is possible with bounded single-history
channels, SPF cannot be solved in bounded time due to the nonexistence of a
lower bound on the delay of involution channels, whereas it is easy to provide
an unbounded SPF implementation. It hence follows that binary-valued circuit
models based on involution channels allow to solve SPF precisely when this is
possible in physical circuits. To the best of our knowledge, our model is hence
the very first candidate for a model that indeed guarantees faithful glitch
propagation.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2014 13:37:19 GMT"
}
] | 2014-06-11T00:00:00 |
[
[
"Függer",
"Matthias",
""
],
[
"Najvirt",
"Robert",
""
],
[
"Nowak",
"Thomas",
""
],
[
"Schmid",
"Ulrich",
""
]
] |
new_dataset
| 0.967399 |
1201.4342
|
Tobias Buer
|
Tobias Buer and Herbert Kopfer
|
A Pareto-metaheuristic for a bi-objective winner determination problem
in a combinatorial reverse auction
|
Accepted for publication in Computers & Operations Research,
available online, Computers & Operations Research, 2013
|
Computers & Operations Research 41 (2014), 208-220
|
10.1016/j.cor.2013.04.004
| null |
cs.GT cs.AI math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The bi-objective winner determination problem (2WDP-SC) of a combinatorial
procurement auction for transport contracts is characterized by a set B of
bundle bids, with each bundle bid b in B consisting of a bidding carrier c_b, a
bid price p_b, and a set tau_b transport contracts which is a subset of the set
T of tendered transport contracts. Additionally, the transport quality
q_{t,c_b} is given which is expected to be realized when a transport contract t
is executed by a carrier c_b. The task of the auctioneer is to find a set X of
winning bids (X subset B), such that each transport contract is part of at
least one winning bid, the total procurement costs are minimized, and the total
transport quality is maximized. This article presents a metaheuristic approach
for the 2WDP-SC which integrates the greedy randomized adaptive search
procedure with a two-stage candidate component selection procedure, large
neighborhood search, and self-adaptive parameter setting in order to find a
competitive set of non-dominated solutions. The heuristic outperforms all
existing approaches. For seven small benchmark instances, the heuristic is the
sole approach that finds all Pareto-optimal solutions. For 28 out of 30 large
instances, none of the existing approaches is able to compute a solution that
dominates a solution found by the proposed heuristic.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2012 17:09:22 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Apr 2013 12:25:42 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Buer",
"Tobias",
""
],
[
"Kopfer",
"Herbert",
""
]
] |
new_dataset
| 0.993463 |
1312.1411
|
Vincent Nimal
|
Jade Alglave, Daniel Kroening, Vincent Nimal, Daniel Poetzl
|
Don't sit on the fence: A static analysis approach to automatic fence
insertion
|
19 pages, 19 figures
| null | null | null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern architectures rely on memory fences to prevent undesired weakenings of
memory consistency. As the fences' semantics may be subtle, the automation of
their placement is highly desirable. But precise methods for restoring
consistency do not scale to deployed systems code. We choose to trade some
precision for genuine scalability: our technique is suitable for large code
bases. We implement it in our new musketeer tool, and detail experiments on
more than 350 executables of packages found in Debian Linux 7.1, e.g. memcached
(about 10000 LoC).
|
[
{
"version": "v1",
"created": "Thu, 5 Dec 2013 02:11:11 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Jun 2014 17:54:46 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Alglave",
"Jade",
""
],
[
"Kroening",
"Daniel",
""
],
[
"Nimal",
"Vincent",
""
],
[
"Poetzl",
"Daniel",
""
]
] |
new_dataset
| 0.996448 |
1405.7143
|
Vimalkumar Jeyakumar
|
Vimalkumar Jeyakumar, Mohammad Alizadeh, Yilong Geng, Changhoon Kim,
and David Mazi\`eres
|
Millions of Little Minions: Using Packets for Low Latency Network
Programming and Visibility (Extended Version)
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a practical approach to rapidly introduce new dataplane
functionality into networks: End-hosts embed tiny programs into packets to
actively query and manipulate a network's internal state. We show how this
"tiny packet program" (TPP) interface gives end-hosts unprecedented visibility
into network behavior, enabling them to work with the network to achieve a
common goal. Our design leverages what each component does best: (a) switches
forward and execute tiny packet programs (at most 5 instructions) at line rate,
and (b) end-hosts perform arbitrary computation on network state, which are
easy to evolve. Using a hardware prototype on a NetFPGA, we show our design is
feasible, at a reasonable cost. By implementing three different research
proposals, we show that TPPs are also useful. And finally, we present an
architecture in which they can be made secure.
|
[
{
"version": "v1",
"created": "Wed, 28 May 2014 07:22:23 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Jun 2014 08:00:30 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Jun 2014 01:59:56 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Jeyakumar",
"Vimalkumar",
""
],
[
"Alizadeh",
"Mohammad",
""
],
[
"Geng",
"Yilong",
""
],
[
"Kim",
"Changhoon",
""
],
[
"Mazières",
"David",
""
]
] |
new_dataset
| 0.999512 |
1406.1794
|
Anita Bommegowda
|
Anita B, Beena Sheril, Ramesh B. E
|
Advanced vehicle safety and content distribution system
|
4 pages, 2 figures, Published with International Journal of
Engineering Trends and Technology (IJETT)
|
Volume 11 Number 9 - May 2014, IJETT-V11P284
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advanced vehicle content distribution system (ACDS)is complemented by
improved network connectivity with Mobile Network 3G, 4G network. Advanced
content distribution system uses Access Points deployed along roadside. APs
co-ordinate and collaborate to distribute content to vehicles in mobility. The
infrastructure of deployed APs solves real time issues like predicting errors
in movement, limited information shared to vehicles on movement due to limited
resources. The advances vehicle content distribution system structures APs in
to form a map which is considering the vehicle contact pattern which is
analyzed by APs. The system is more effective by optimizing the network
consumption by sharing prefectched data between APs. The process depends on APs
storage, bandwidth and load on the origin APs which is connected to internet.
With the features Advanced System to distribute the content the system takes
care of improving road safety, delivery accuracy and important content
distribution.
|
[
{
"version": "v1",
"created": "Sat, 7 Jun 2014 09:06:33 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"B",
"Anita",
""
],
[
"Sheril",
"Beena",
""
],
[
"E",
"Ramesh B.",
""
]
] |
new_dataset
| 0.99837 |
1406.1848
|
Bocong Chen
|
Bocong Chen, Hai Q. Dinh, Hongwei Liu
|
Repeated-root constacyclic codes of length $2\ell^mp^n$
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any different odd primes $\ell$ and $p$, structure of constacyclic codes
of length $2\ell^mp^n$ over a finite field $\mathbb F_q$ of characteritic $p$
and their duals is established in term of their generator polynomials. Among
other results, all linear complimentary dual and self-dual constacyclic codes
of length $2\ell^mp^n$ over $\mathbb F_q$ are obtained.
|
[
{
"version": "v1",
"created": "Sat, 7 Jun 2014 02:04:50 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Chen",
"Bocong",
""
],
[
"Dinh",
"Hai Q.",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.999412 |
1406.1886
|
Raul Rojas Prof.
|
Raul Rojas
|
The Z1: Architecture and Algorithms of Konrad Zuse's First Computer
|
24 pages, 20 figures
| null | null |
DCIS-14-1
|
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides the first comprehensive description of the Z1, the
mechanical computer built by the German inventor Konrad Zuse in Berlin from
1936 to 1938. The paper describes the main structural elements of the machine,
the high-level architecture, and the dataflow between components. The computer
could perform the four basic arithmetic operations using floating-point
numbers. Instructions were read from punched tape. A program consisted of a
sequence of arithmetical operations, intermixed with memory store and load
instructions, interrupted possibly by input and output operations. Numbers were
stored in a mechanical memory. The machine did not include conditional
branching in the instruction set. While the architecture of the Z1 is similar
to the relay computer Zuse finished in 1941 (the Z3) there are some significant
differences. The Z1 implements operations as sequences of microinstructions, as
in the Z3, but does not use rotary switches as micro-steppers. The Z1 uses a
digital incrementer and a set of conditions which are translated into
microinstructions for the exponent and mantissa units, as well as for the
memory blocks. Microinstructions select one out of 12 layers in a machine with
a 3D mechanical structure of binary mechanical elements. The exception circuits
for mantissa zero, necessary for normalized floating-point, were lacking; they
were first implemented in the Z3. The information for this article was
extracted from careful study of the blueprints drawn by Zuse for the
reconstruction of the Z1 for the German Technology Museum in Berlin, from some
letters, and from sketches in notebooks. Although the machine has been in
exhibition since 1989 (non-operational), no detailed high-level description of
the machine's architecture had been available. This paper fills that gap.
|
[
{
"version": "v1",
"created": "Sat, 7 Jun 2014 11:23:31 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Rojas",
"Raul",
""
]
] |
new_dataset
| 0.998033 |
1406.1998
|
Paolo Missier
|
Paolo Missier and Jeremy Bryans and Carl Gamble and Vasa Curcin and
Roxana Danger
|
ProvAbs: model, policy, and tooling for abstracting PROV graphs
|
In Procs. IPAW 2014 (Provenance and Annotations). Koln, Germany:
Springer, 2014
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Provenance metadata can be valuable in data sharing settings, where it can be
used to help data consumers form judgements regarding the reliability of the
data produced by third parties. However, some parts of provenance may be
sensitive, requiring access control, or they may need to be simplified for the
intended audience. Both these issues can be addressed by a single mechanism for
creating abstractions over provenance, coupled with a policy model to drive the
abstraction. Such mechanism, which we refer to as abstraction by grouping,
simultaneously achieves partial disclosure of provenance, and facilitates its
consumption. In this paper we introduce a formal foundation for this type of
abstraction, grounded in the W3C PROV model; describe the associated policy
model; and briefly present its implementation, the Provabs tool for interactive
experimentation with policies and abstractions.
|
[
{
"version": "v1",
"created": "Sun, 8 Jun 2014 16:26:53 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Missier",
"Paolo",
""
],
[
"Bryans",
"Jeremy",
""
],
[
"Gamble",
"Carl",
""
],
[
"Curcin",
"Vasa",
""
],
[
"Danger",
"Roxana",
""
]
] |
new_dataset
| 0.95391 |
1406.2015
|
Kalyan Veeramachaneni
|
Kalyan Veeramachaneni, Sherif Halawa, Franck Dernoncourt, Una-May
O'Reilly, Colin Taylor, Chuong Do
|
MOOCdb: Developing Standards and Systems to Support MOOC Data Science
| null | null | null | null |
cs.IR cs.CY cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a shared data model for enabling data science in Massive Open
Online Courses (MOOCs). The model captures students interactions with the
online platform. The data model is platform agnostic and is based on some basic
core actions that students take on an online learning platform. Students
usually interact with the platform in four different modes: Observing,
Submitting, Collaborating and giving feedback. In observing mode students are
simply browsing the online platform, watching videos, reading material, reading
book or watching forums. In submitting mode, students submit information to the
platform. This includes submissions towards quizzes, homeworks, or any
assessment modules. In collaborating mode students interact with other students
or instructors on forums, collaboratively editing wiki or chatting on google
hangout or other hangout venues. With this basic definitions of activities, and
a data model to store events pertaining to these activities, we then create a
common terminology to map Coursera and edX data into this shared data model.
This shared data model called MOOCdb becomes the foundation for a number of
collaborative frameworks that enable progress in data science without the need
to share the data.
|
[
{
"version": "v1",
"created": "Sun, 8 Jun 2014 19:19:45 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Veeramachaneni",
"Kalyan",
""
],
[
"Halawa",
"Sherif",
""
],
[
"Dernoncourt",
"Franck",
""
],
[
"O'Reilly",
"Una-May",
""
],
[
"Taylor",
"Colin",
""
],
[
"Do",
"Chuong",
""
]
] |
new_dataset
| 0.993817 |
1406.2021
|
James Whiting
|
James G.H. Whiting, Ben P.J. de Lacy Costello and Andrew Adamatzky
|
Slime Mould Logic Gates Based on Frequency Changes of Electrical
Potential Oscillation
|
10 Pages, 3 Figures, 4 Tables
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physarum polycephalum is a large single amoeba cell, which in its plasmodial
phase,forages and connects nearby food sources with protoplasmic tubes. The
organism forages for food by growing these tubes towards detected food stuffs,
this foraging behaviour is governed by simple rules of photoavoidance and
chemotaxis. The electrical activity of the tubes oscillates, creating a
peristaltic like action within the tubes, forcing cytoplasm along the lumen;
the frequency of this oscillation controls the speed and direction of growth.
External stimuli such as light and food cause changes in the oscillation
frequency. We demonstrate that using these stimuli as logical inputs we can
approximate logic gates using these tubes and derive combinational logic
circuits by cascading the gates, with software analysis providing the output of
each gate and determining the input of the following gate. Basic gates OR, AND
and NOT were correct 90%, 77.8% and 91.7% of the time respectively. Derived
logic circuits XOR, Half Adder and Full Adder were 70.8%, 65% and 58.8%
accurate respectively. Accuracy of the combinational logic decreases as the
number of gates is increased, however they are at least as accurate as previous
logic approximations using spatial growth of Physarum polycephalum and up to 30
times as fast at computing the logical output. The results shown here
demonstrate a significant advancement in organism-based computing, providing a
solid basis for hybrid computers of the future.
|
[
{
"version": "v1",
"created": "Sun, 8 Jun 2014 19:54:01 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Whiting",
"James G. H.",
""
],
[
"Costello",
"Ben P. J. de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999596 |
1406.2023
|
Gian Luca Pozzato
|
Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato
|
Rational Closure in SHIQ
|
30 pages, extended version of paper accepted to DL2014
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a notion of rational closure for the logic SHIQ, which does not
enjoys the finite model property, building on the notion of rational closure
introduced by Lehmann and Magidor in [23]. We provide a semantic
characterization of rational closure in SHIQ in terms of a preferential
semantics, based on a finite rank characterization of minimal models. We show
that the rational closure of a TBox can be computed in EXPTIME using entailment
in SHIQ.
|
[
{
"version": "v1",
"created": "Sun, 8 Jun 2014 20:16:30 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Giordano",
"Laura",
""
],
[
"Gliozzi",
"Valentina",
""
],
[
"Olivetti",
"Nicola",
""
],
[
"Pozzato",
"Gian Luca",
""
]
] |
new_dataset
| 0.997452 |
1406.2060
|
EPTCS
|
Michael Hicks (University of Maryland, College Park), Gavin Bierman
(Microsoft Research), Nataliya Guts (University of Maryland, College Park),
Daan Leijen (Microsoft Research), Nikhil Swamy (Microsoft Research)
|
Polymonadic Programming
|
In Proceedings MSFP 2014, arXiv:1406.1534
|
EPTCS 153, 2014, pp. 79-99
|
10.4204/EPTCS.153.7
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Monads are a popular tool for the working functional programmer to structure
effectful computations. This paper presents polymonads, a generalization of
monads. Polymonads give the familiar monadic bind the more general type forall
a,b. L a -> (a -> M b) -> N b, to compose computations with three different
kinds of effects, rather than just one. Polymonads subsume monads and
parameterized monads, and can express other constructions, including precise
type-and-effect systems and information flow tracking; more generally,
polymonads correspond to Tate's productoid semantic model. We show how to equip
a core language (called lambda-PM) with syntactic support for programming with
polymonads. Type inference and elaboration in lambda-PM allows programmers to
write polymonadic code directly in an ML-like syntax--our algorithms compute
principal types and produce elaborated programs wherein the binds appear
explicitly. Furthermore, we prove that the elaboration is coherent: no matter
which (type-correct) binds are chosen, the elaborated program's semantics will
be the same. Pleasingly, the inferred types are easy to read: the polymonad
laws justify (sometimes dramatic) simplifications, but with no effect on a
type's generality.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 03:30:05 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Hicks",
"Michael",
"",
"University of Maryland, College Park"
],
[
"Bierman",
"Gavin",
"",
"Microsoft Research"
],
[
"Guts",
"Nataliya",
"",
"University of Maryland, College Park"
],
[
"Leijen",
"Daan",
"",
"Microsoft Research"
],
[
"Swamy",
"Nikhil",
"",
"Microsoft Research"
]
] |
new_dataset
| 0.997635 |
1406.2068
|
EPTCS
|
Bettina Braitling, Luis Mar\'ia Ferrer Fioriti, Hassan Hatefi, Ralf
Wimmer, Bernd Becker, Holger Hermanns
|
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov
Automata
|
In Proceedings QAPL 2014, arXiv:1406.1567
|
EPTCS 154, 2014, pp. 48-63
|
10.4204/EPTCS.154.4
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Markov automata combine continuous time, probabilistic transitions, and
nondeterminism in a single model. They represent an important and powerful way
to model a wide range of complex real-life systems. However, such models tend
to be large and difficult to handle, making abstraction and abstraction
refinement necessary. In this paper we present an abstraction and abstraction
refinement technique for Markov automata, based on the game-based and
menu-based abstraction of probabilistic automata. First experiments show that a
significant reduction in size is possible using abstraction.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 03:48:05 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Braitling",
"Bettina",
""
],
[
"Fioriti",
"Luis María Ferrer",
""
],
[
"Hatefi",
"Hassan",
""
],
[
"Wimmer",
"Ralf",
""
],
[
"Becker",
"Bernd",
""
],
[
"Hermanns",
"Holger",
""
]
] |
new_dataset
| 0.995541 |
1406.2096
|
Paul Brillant Feuto Njonko
|
Paul Brillant Feuto Njonko, Sylviane Cardey, Peter Greenfield, and
Walid El Abed
|
RuleCNL: A Controlled Natural Language for Business Rule Specifications
|
12 pages, 7 figures, Fourth Workshop on Controlled Natural Language
(CNL 2014) Proceedings
| null | null | null |
cs.SE cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Business rules represent the primary means by which companies define their
business, perform their actions in order to reach their objectives. Thus, they
need to be expressed unambiguously to avoid inconsistencies between business
stakeholders and formally in order to be machine-processed. A promising
solution is the use of a controlled natural language (CNL) which is a good
mediator between natural and formal languages. This paper presents RuleCNL,
which is a CNL for defining business rules. Its core feature is the alignment
of the business rule definition with the business vocabulary which ensures
traceability and consistency with the business domain. The RuleCNL tool
provides editors that assist end-users in the writing process and automatic
mappings into the Semantics of Business Vocabulary and Business Rules (SBVR)
standard. SBVR is grounded in first order logic and includes constructs called
semantic formulations that structure the meaning of rules.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 07:19:53 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Njonko",
"Paul Brillant Feuto",
""
],
[
"Cardey",
"Sylviane",
""
],
[
"Greenfield",
"Peter",
""
],
[
"Abed",
"Walid El",
""
]
] |
new_dataset
| 0.998523 |
1406.2103
|
James Hales
|
Tim French, James Hales and Edwin Tay
|
A composable language for action models
|
Extended version of a paper to appear in the 10th International
Conference on Advances in Modal Logic (AiML)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Action models are semantic structures similar to Kripke models that represent
a change in knowledge in an epistemic setting. Whereas the language of action
model logic embeds the semantic structure of an action model directly within
the language, this paper introduces a language that represents action models
using syntactic operators inspired by relational actions. This language admits
an intuitive description of the action models it represents, and we show in
several settings that it is sufficient to represent any action model up to a
given modal depth and to represent the results of action model synthesis, and
give a sound and complete axiomatisation in some of these settings.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 08:12:07 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"French",
"Tim",
""
],
[
"Hales",
"James",
""
],
[
"Tay",
"Edwin",
""
]
] |
new_dataset
| 0.993135 |
1406.2110
|
Marc Bagnol
|
Cl\'ement Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller
|
Logic Programming and Logarithmic Space
| null | null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We present an algebraic view on logic programming, related to proof theory
and more specifically linear logic and geometry of interaction. Within this
construction, a characterization of logspace (deterministic and
non-deterministic) computation is given via a synctactic restriction, using an
encoding of words that derives from proof theory.
We show that the acceptance of a word by an observation (the counterpart of a
program in the encoding) can be decided within logarithmic space, by reducing
this problem to the acyclicity of a graph. We show moreover that observations
are as expressive as two-ways multi-heads finite automata, a kind of pointer
machines that is a standard model of logarithmic space computation.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 08:58:59 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Aubert",
"Clément",
""
],
[
"Bagnol",
"Marc",
""
],
[
"Pistone",
"Paolo",
""
],
[
"Seiller",
"Thomas",
""
]
] |
new_dataset
| 0.987603 |
1406.2125
|
Remy Haemmerle
|
Falco Nogatz and Thom Fr\"uhwirth
|
From XML Schema to JSON Schema: Translation with CHR
|
Part of CHR 2014 proceedings (arXiv:1406.1510)
| null | null |
CHR/2014/2
|
cs.DB cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite its rising popularity as data format especially for web services, the
software ecosystem around the JavaScript Object Notation (JSON) is not as
widely distributed as that of XML. For both data formats there exist schema
languages to specify the structure of instance documents, but there is
currently no opportunity to translate already existing XML Schema documents
into equivalent JSON Schemas.
In this paper we introduce an implementation of a language translator. It
takes an XML Schema and creates its equivalent JSON Schema document. Our
approach is based on Prolog and CHR. By unfolding the XML Schema document into
CHR constraints, it is possible to specify the concrete translation rules in a
declarative way.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 10:33:41 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Nogatz",
"Falco",
""
],
[
"Frühwirth",
"Thom",
""
]
] |
new_dataset
| 0.998662 |
1406.2161
|
Tiago de Lima
|
Tiago de Lima and Andreas Herzig
|
Tableaux for Dynamic Logic of Propositional Assignments
|
20 pages
| null | null | null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Dynamic Logic for Propositional Assignments (DL-PA) has recently been
studied as an alternative to Propositional Dynamic Logic (PDL). In DL-PA, the
abstract atomic programs of PDL are replaced by assignments of propositional
variables to truth values. This makes DL-PA enjoy some interesting meta-logical
properties that PDL does not, such as eliminability of the Kleene star,
compactness and interpolation. We define and analytic tableaux calculus for
DL-PA and show that it matches the known complexity results.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 12:54:41 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"de Lima",
"Tiago",
""
],
[
"Herzig",
"Andreas",
""
]
] |
new_dataset
| 0.998359 |
1406.2204
|
Sandra Williams
|
Sandra Williams, Richard Power and Allan Third
|
How Easy is it to Learn a Controlled Natural Language for Building a
Knowledge Base?
|
CNL 2014 : Fourth Workshop on Controlled Natural Language
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent developments in controlled natural language editors for knowledge
engineering (KE) have given rise to expectations that they will make KE tasks
more accessible and perhaps even enable non-engineers to build knowledge bases.
This exploratory research focussed on novices and experts in knowledge
engineering during their attempts to learn a controlled natural language (CNL)
known as OWL Simplified English and use it to build a small knowledge base.
Participants' behaviours during the task were observed through eye-tracking and
screen recordings. This was an attempt at a more ambitious user study than in
previous research because we used a naturally occurring text as the source of
domain knowledge, and left them without guidance on which information to
select, or how to encode it. We have identified a number of skills
(competencies) required for this difficult task and key problems that authors
face.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 14:54:22 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Williams",
"Sandra",
""
],
[
"Power",
"Richard",
""
],
[
"Third",
"Allan",
""
]
] |
new_dataset
| 0.997898 |
1406.2285
|
Navya Chodisetti
|
Navya Chodisetti
|
A Piggybank Protocol for Quantum Cryptography
|
6 pages, 2 figures, 1 table
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a quantum mechanical version of the piggy-bank
cryptography protocol. The basic piggybank cryptography idea is to use two
communications: one with the encrypted message, and the other regarding the
encryption transformation which the receiver must decipher first. In the
quantum mechanical version of the protocol, the encrypting unitary
transformation information is sent separately but just deciphering it is not
enough to break the system. The proposed quantum protocol consists of two
stages.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 19:07:01 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Chodisetti",
"Navya",
""
]
] |
new_dataset
| 0.998173 |
1406.2294
|
John Lamping
|
John Lamping, Eric Veach
|
A Fast, Minimal Memory, Consistent Hash Algorithm
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present jump consistent hash, a fast, minimal memory, consistent hash
algorithm that can be expressed in about 5 lines of code. In comparison to the
algorithm of Karger et al., jump consistent hash requires no storage, is
faster, and does a better job of evenly dividing the key space among the
buckets and of evenly dividing the workload when the number of buckets changes.
Its main limitation is that the buckets must be numbered sequentially, which
makes it more suitable for data storage applications than for distributed web
caching.
|
[
{
"version": "v1",
"created": "Mon, 9 Jun 2014 19:30:12 GMT"
}
] | 2014-06-10T00:00:00 |
[
[
"Lamping",
"John",
""
],
[
"Veach",
"Eric",
""
]
] |
new_dataset
| 0.971213 |
1404.3034
|
EPTCS
|
J\'onathan Heras (School of Computing, University of Dundee, UK),
Ekaterina Komendantskaya (School of Computing, University of Dundee, UK)
|
ACL2(ml): Machine-Learning for ACL2
|
In Proceedings ACL2 2014, arXiv:1406.1238
|
EPTCS 152, 2014, pp. 61-75
|
10.4204/EPTCS.152.5
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ACL2(ml) is an extension for the Emacs interface of ACL2. This tool uses
machine-learning to help the ACL2 user during the proof-development. Namely,
ACL2(ml) gives hints to the user in the form of families of similar theorems,
and generates auxiliary lemmas automatically. In this paper, we present the two
most recent extensions for ACL2(ml). First, ACL2(ml) can suggest now families
of similar function definitions, in addition to the families of similar
theorems. Second, the lemma generation tool implemented in ACL2(ml) has been
improved with a method to generate preconditions using the guard mechanism of
ACL2. The user of ACL2(ml) can also invoke directly the latter extension to
obtain preconditions for his own conjectures.
|
[
{
"version": "v1",
"created": "Fri, 11 Apr 2014 08:49:03 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Jun 2014 01:47:42 GMT"
}
] | 2014-06-09T00:00:00 |
[
[
"Heras",
"Jónathan",
"",
"School of Computing, University of Dundee, UK"
],
[
"Komendantskaya",
"Ekaterina",
"",
"School of Computing, University of Dundee, UK"
]
] |
new_dataset
| 0.993085 |
1406.1558
|
EPTCS
|
Benjamin Selfridge (University of Texas at Austin), Eric Smith
(Kestrel Institute)
|
Polymorphic Types in ACL2
|
In Proceedings ACL2 2014, arXiv:1406.1238
|
EPTCS 152, 2014, pp. 49-59
|
10.4204/EPTCS.152.4
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a tool suite for the ACL2 programming language which
incorporates certain ideas from the Hindley-Milner paradigm of functional
programming (as exemplified in popular languages like ML and Haskell),
including a "typed" style of programming with the ability to define polymorphic
types. These ideas are introduced via macros into the language of ACL2, taking
advantage of ACL2's guard-checking mechanism to perform type checking on both
function definitions and theorems. Finally, we discuss how these macros were
used to implement features of Specware, a software specification and
implementation system.
|
[
{
"version": "v1",
"created": "Fri, 6 Jun 2014 01:47:31 GMT"
}
] | 2014-06-09T00:00:00 |
[
[
"Selfridge",
"Benjamin",
"",
"University of Texas at Austin"
],
[
"Smith",
"Eric",
"",
"Kestrel Institute"
]
] |
new_dataset
| 0.990737 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.