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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1507.00133
|
Simone Faro
|
Valeria Borz\`i, Simone Faro, Arianna Pavone and Sabrina Sansone
|
Prior Polarity Lexical Resources for the Italian Language
|
10 pages, Accepted to NLPCS 2015, the 12th International Workshop on
Natural Language Processing and Cognitive Science
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present SABRINA (Sentiment Analysis: a Broad Resource for
Italian Natural language Applications) a manually annotated prior polarity
lexical resource for Italian natural language applications in the field of
opinion mining and sentiment induction. The resource consists in two different
sets, an Italian dictionary of more than 277.000 words tagged with their prior
polarity value, and a set of polarity modifiers, containing more than 200
words, which can be used in combination with non neutral terms of the
dictionary in order to induce the sentiment of Italian compound terms. To the
best of our knowledge this is the first prior polarity manually annotated
resource which has been developed for the Italian natural language.
|
[
{
"version": "v1",
"created": "Wed, 1 Jul 2015 07:29:12 GMT"
}
] | 2015-07-02T00:00:00 |
[
[
"Borzì",
"Valeria",
""
],
[
"Faro",
"Simone",
""
],
[
"Pavone",
"Arianna",
""
],
[
"Sansone",
"Sabrina",
""
]
] |
new_dataset
| 0.984849 |
1507.00270
|
Joaquin Garcia-Alfaro
|
Michel Barbeau, Steve R. Cloutier, Joaquin Garcia-Alfaro
|
Quantum Computing Assisted Medium Access Control for Multiple Client
Station Networks
|
18 pages, 12 figures, 3 tables; manuscript under review
| null | null | null |
cs.ET quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A medium access control protocol based on quantum entanglement has been
introduced by Berces and Imre (2006) and Van Meter (2012). This protocol
entirely avoids collisions. It is assumed that the network consists of one
access point and two client stations. We extend this scheme to a network with
an arbitrary number of client stations. We propose three approaches, namely,
the qubit distribution, transmit first election and temporal ordering
protocols. The qubit distribution protocol leverages the concepts of Bell-EPR
pair or W state triad. It works for networks of up to four CSs. With up to
three CSs, there is no probability of collision. In a four-CS network, there is
a low probability of collision. The transmit first election protocol and
temporal ordering protocols work for a network with any number of CSs. The
transmit first election builds upon the concept of W state of size
corresponding to the number of client stations. It is fair and collision free.
The temporal ordering protocol employs the concepts of Lehmer code and quantum
oracle. It is collision free, has a normalized throughput of 100% and achieves
quasi-fairness.
|
[
{
"version": "v1",
"created": "Wed, 1 Jul 2015 15:58:25 GMT"
}
] | 2015-07-02T00:00:00 |
[
[
"Barbeau",
"Michel",
""
],
[
"Cloutier",
"Steve R.",
""
],
[
"Garcia-Alfaro",
"Joaquin",
""
]
] |
new_dataset
| 0.982206 |
0708.3477
|
Alexander Rabinovich
|
Alexander Rabinovich
|
The Church Synthesis Problem with Parameters
| null |
Logical Methods in Computer Science, Volume 3, Issue 4 (November
14, 2007) lmcs:1233
|
10.2168/LMCS-3(4:9)2007
| null |
cs.LO
| null |
For a two-variable formula ψ(X,Y) of Monadic Logic of Order (MLO) the
Church Synthesis Problem concerns the existence and construction of an operator
Y=F(X) such that ψ(X,F(X)) is universally valid over Nat.
B\"{u}chi and Landweber proved that the Church synthesis problem is
decidable; moreover, they showed that if there is an operator F that solves the
Church Synthesis Problem, then it can also be solved by an operator defined by
a finite state automaton or equivalently by an MLO formula. We investigate a
parameterized version of the Church synthesis problem. In this version ψ
might contain as a parameter a unary predicate P. We show that the Church
synthesis problem for P is computable if and only if the monadic theory of
<Nat,<,P> is decidable. We prove that the B\"{u}chi-Landweber theorem can be
extended only to ultimately periodic parameters. However, the MLO-definability
part of the B\"{u}chi-Landweber theorem holds for the parameterized version of
the Church synthesis problem.
|
[
{
"version": "v1",
"created": "Sun, 26 Aug 2007 12:08:30 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Nov 2007 12:01:15 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Rabinovich",
"Alexander",
""
]
] |
new_dataset
| 0.968169 |
0901.4430
|
Helle Hvid Hansen
|
Helle Hvid Hansen and Clemens Kupke and Eric Pacuit
|
Neighbourhood Structures: Bisimilarity and Basic Model Theory
|
uses LMCS.cls (included), 2 figures (both ps and pdf)
|
Logical Methods in Computer Science, Volume 5, Issue 2 (April 9,
2009) lmcs:1167
|
10.2168/LMCS-5(2:2)2009
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neighbourhood structures are the standard semantic tool used to reason about
non-normal modal logics. The logic of all neighbourhood models is called
classical modal logic. In coalgebraic terms, a neighbourhood frame is a
coalgebra for the contravariant powerset functor composed with itself, denoted
by 2^2. We use this coalgebraic modelling to derive notions of equivalence
between neighbourhood structures. 2^2-bisimilarity and behavioural equivalence
are well known coalgebraic concepts, and they are distinct, since 2^2 does not
preserve weak pullbacks. We introduce a third, intermediate notion whose
witnessing relations we call precocongruences (based on pushouts). We give
back-and-forth style characterisations for 2^2-bisimulations and
precocongruences, we show that on a single coalgebra, precocongruences capture
behavioural equivalence, and that between neighbourhood structures,
precocongruences are a better approximation of behavioural equivalence than
2^2-bisimulations. We also introduce a notion of modal saturation for
neighbourhood models, and investigate its relationship with definability and
image-finiteness. We prove a Hennessy-Milner theorem for modally saturated and
for image-finite neighbourhood models. Our main results are an analogue of Van
Benthem's characterisation theorem and a model-theoretic proof of Craig
interpolation for classical modal logic.
|
[
{
"version": "v1",
"created": "Wed, 28 Jan 2009 10:29:44 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Mar 2009 15:52:29 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Apr 2009 00:16:59 GMT"
},
{
"version": "v4",
"created": "Mon, 20 Apr 2009 12:09:16 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Hansen",
"Helle Hvid",
""
],
[
"Kupke",
"Clemens",
""
],
[
"Pacuit",
"Eric",
""
]
] |
new_dataset
| 0.995432 |
0903.1032
|
Mohammad Raza
|
Mohammad Raza and Philippa Gardner
|
Footprints in Local Reasoning
|
LMCS 2009 (FOSSACS 2008 special issue)
|
Logical Methods in Computer Science, Volume 5, Issue 2 (April 24,
2009) lmcs:1118
|
10.2168/LMCS-5(2:4)2009
| null |
cs.SE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Local reasoning about programs exploits the natural local behaviour common in
programs by focussing on the footprint - that part of the resource accessed by
the program. We address the problem of formally characterising and analysing
the footprint notion for abstract local functions introduced by Calcagno, O
Hearn and Yang. With our definition, we prove that the footprints are the only
essential elements required for a complete specification of a local function.
We formalise the notion of small specifications in local reasoning and show
that for well-founded resource models, a smallest specification always exists
that only includes the footprints, and also present results for the
non-well-founded case. Finally, we use this theory of footprints to investigate
the conditions under which the footprints correspond to the smallest safe
states. We present a new model of RAM in which, unlike the standard model, the
footprints of every program correspond to the smallest safe states, and we also
identify a general condition on the primitive commands of a programming
language which guarantees this property for arbitrary models.
|
[
{
"version": "v1",
"created": "Thu, 5 Mar 2009 17:06:05 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Apr 2009 17:59:14 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Raza",
"Mohammad",
""
],
[
"Gardner",
"Philippa",
""
]
] |
new_dataset
| 0.984142 |
0912.0931
|
Bart Jacobs
|
Bart Jacobs
|
Orthomodular lattices, Foulis Semigroups and Dagger Kernel Categories
| null |
Logical Methods in Computer Science, Volume 6, Issue 2 (June 18,
2010) lmcs:1083
|
10.2168/LMCS-6(2:1)2010
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is a sequel to arXiv:0902.2355 and continues the study of quantum
logic via dagger kernel categories. It develops the relation between these
categories and both orthomodular lattices and Foulis semigroups. The relation
between the latter two notions has been uncovered in the 1960s. The current
categorical perspective gives a broader context and reconstructs this
relationship between orthomodular lattices and Foulis semigroups as special
instance.
|
[
{
"version": "v1",
"created": "Fri, 4 Dec 2009 20:36:49 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jun 2010 08:39:53 GMT"
},
{
"version": "v3",
"created": "Fri, 18 Jun 2010 11:53:26 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Jacobs",
"Bart",
""
]
] |
new_dataset
| 0.97983 |
1004.3808
|
Chris Hawblitzel
|
Chris Hawblitzel (Microsoft), Erez Petrank (Technion)
|
Automated Verification of Practical Garbage Collectors
| null |
Logical Methods in Computer Science, Volume 6, Issue 3 (August 18,
2010) lmcs:1039
|
10.2168/LMCS-6(3:6)2010
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Garbage collectors are notoriously hard to verify, due to their low-level
interaction with the underlying system and the general difficulty in reasoning
about reachability in graphs. Several papers have presented verified
collectors, but either the proofs were hand-written or the collectors were too
simplistic to use on practical applications. In this work, we present two
mechanically verified garbage collectors, both practical enough to use for
real-world C# benchmarks. The collectors and their associated allocators
consist of x86 assembly language instructions and macro instructions, annotated
with preconditions, postconditions, invariants, and assertions. We used the
Boogie verification generator and the Z3 automated theorem prover to verify
this assembly language code mechanically. We provide measurements comparing the
performance of the verified collector with that of the standard Bartok
collectors on off-the-shelf C# benchmarks, demonstrating their competitiveness.
|
[
{
"version": "v1",
"created": "Wed, 21 Apr 2010 21:14:34 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Aug 2010 08:11:21 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Oct 2010 11:57:59 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Hawblitzel",
"Chris",
"",
"Microsoft"
],
[
"Petrank",
"Erez",
"",
"Technion"
]
] |
new_dataset
| 0.964461 |
1005.5278
|
Peter A Jonsson
|
Peter A. Jonsson and Johan Nordlander
|
Positive Supercompilation for a Higher-Order Call-By-Value Language
| null |
Logical Methods in Computer Science, Volume 6, Issue 3 (August 18,
2010) lmcs:1038
|
10.2168/LMCS-6(3:5)2010
| null |
cs.PL
|
http://creativecommons.org/licenses/by/3.0/
|
Previous deforestation and supercompilation algorithms may introduce
accidental termination when applied to call-by-value programs. This hides
looping bugs from the programmer, and changes the behavior of a program
depending on whether it is optimized or not. We present a supercompilation
algorithm for a higher-order call-by-value language and prove that the
algorithm both terminates and preserves termination properties. This algorithm
utilizes strictness information to decide whether to substitute or not and
compares favorably with previous call-by-name transformations.
|
[
{
"version": "v1",
"created": "Fri, 28 May 2010 12:33:37 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Aug 2010 08:05:55 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Jonsson",
"Peter A.",
""
],
[
"Nordlander",
"Johan",
""
]
] |
new_dataset
| 0.990079 |
1007.4764
|
Benedikt Bollig
|
Benedikt Bollig (LSV, ENS Cachan, CNRS), Dietrich Kuske (Institut
f\"ur Informatik, Universit\"at Leipzig), Ingmar Meinecke (Institut f\"ur
Informatik, Universit\"at Leipzig)
|
Propositional Dynamic Logic for Message-Passing Systems
| null |
Logical Methods in Computer Science, Volume 6, Issue 3 (September
4, 2010) lmcs:1057
|
10.2168/LMCS-6(3:16)2010
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We examine a bidirectional propositional dynamic logic (PDL) for finite and
infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of
multi-modal logic we can express properties both in the entire future and in
the past of an event. Path expressions strengthen the classical until operator
of temporal logic. For every formula defining an MSC language, we construct a
communicating finite-state machine (CFM) accepting the same language. The CFM
obtained has size exponential in the size of the formula. This synthesis
problem is solved in full generality, i.e., also for MSCs with unbounded
channels. The model checking problem for CFMs and HMSCs turns out to be in
PSPACE for existentially bounded MSCs. Finally, we show that, for PDL with
intersection, the semantics of a formula cannot be captured by a CFM anymore.
|
[
{
"version": "v1",
"created": "Tue, 27 Jul 2010 16:11:01 GMT"
},
{
"version": "v2",
"created": "Sat, 4 Sep 2010 09:38:32 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Sep 2010 09:58:54 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Bollig",
"Benedikt",
"",
"LSV, ENS Cachan, CNRS"
],
[
"Kuske",
"Dietrich",
"",
"Institut\n für Informatik, Universität Leipzig"
],
[
"Meinecke",
"Ingmar",
"",
"Institut für\n Informatik, Universität Leipzig"
]
] |
new_dataset
| 0.995047 |
1011.1625
|
Michele Basaldella
|
Michele Basaldella (RIMS, Kyoto University, Japan), Kazushige Terui
(RIMS, Kyoto University, Japan)
|
On the meaning of logical completeness
| null |
Logical Methods in Computer Science, Volume 6, Issue 4 (December
22, 2010) lmcs:1066
|
10.2168/LMCS-6(4:11)2010
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Goedel's completeness theorem is concerned with provability, while Girard's
theorem in ludics (as well as full completeness theorems in game semantics) are
concerned with proofs. Our purpose is to look for a connection between these
two disciplines. Following a previous work [3], we consider an extension of the
original ludics with contraction and universal nondeterminism, which play dual
roles, in order to capture a polarized fragment of linear logic and thus a
constructive variant of classical propositional logic. We then prove a
completeness theorem for proofs in this extended setting: for any behaviour
(formula) A and any design (proof attempt) P, either P is a proof of A or there
is a model M of the orthogonal of A which defeats P. Compared with proofs of
full completeness in game semantics, ours exhibits a striking similarity with
proofs of Goedel's completeness, in that it explicitly constructs a
countermodel essentially using Koenig's lemma, proceeds by induction on
formulas, and implies an analogue of Loewenheim-Skolem theorem.
|
[
{
"version": "v1",
"created": "Sun, 7 Nov 2010 09:01:17 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Dec 2010 20:44:18 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Basaldella",
"Michele",
"",
"RIMS, Kyoto University, Japan"
],
[
"Terui",
"Kazushige",
"",
"RIMS, Kyoto University, Japan"
]
] |
new_dataset
| 0.998305 |
1102.3676
|
Dimitrios Vardoulakis
|
Dimitrios Vardoulakis (Northeastern University), Olin Shivers
(Northeastern University)
|
CFA2: a Context-Free Approach to Control-Flow Analysis
|
LMCS 7 (2:3) 2011
|
Logical Methods in Computer Science, Volume 7, Issue 2 (May 1,
2011) lmcs:684
|
10.2168/LMCS-7(2:3)2011
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a functional language, the dominant control-flow mechanism is function
call and return. Most higher-order flow analyses, including k-CFA, do not
handle call and return well: they remember only a bounded number of pending
calls because they approximate programs with control-flow graphs. Call/return
mismatch introduces precision-degrading spurious control-flow paths and
increases the analysis time. We describe CFA2, the first flow analysis with
precise call/return matching in the presence of higher-order functions and tail
calls. We formulate CFA2 as an abstract interpretation of programs in
continuation-passing style and describe a sound and complete summarization
algorithm for our abstract semantics. A preliminary evaluation shows that CFA2
gives more accurate data-flow information than 0CFA and 1CFA.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 19:59:51 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Mar 2011 18:33:31 GMT"
},
{
"version": "v3",
"created": "Fri, 22 Apr 2011 07:37:22 GMT"
},
{
"version": "v4",
"created": "Wed, 4 May 2011 16:56:52 GMT"
},
{
"version": "v5",
"created": "Thu, 5 May 2011 09:05:54 GMT"
},
{
"version": "v6",
"created": "Mon, 23 Apr 2012 18:47:23 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Vardoulakis",
"Dimitrios",
"",
"Northeastern University"
],
[
"Shivers",
"Olin",
"",
"Northeastern University"
]
] |
new_dataset
| 0.96201 |
1104.4131
|
Dmitry Tishkovsky
|
Renate A. Schmidt (University of Manchester), Dmitry Tishkovsky
(University of Manchester)
|
Automated Synthesis of Tableau Calculi
|
32 pages
|
Logical Methods in Computer Science, Volume 7, Issue 2 (May 7,
2011) lmcs:970
|
10.2168/LMCS-7(2:6)2011
| null |
cs.LO cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a method for synthesising sound and complete tableau
calculi. Given a specification of the formal semantics of a logic, the method
generates a set of tableau inference rules that can then be used to reason
within the logic. The method guarantees that the generated rules form a
calculus which is sound and constructively complete. If the logic can be shown
to admit finite filtration with respect to a well-defined first-order semantics
then adding a general blocking mechanism provides a terminating tableau
calculus. The process of generating tableau rules can be completely automated
and produces, together with the blocking mechanism, an automated procedure for
generating tableau decision procedures. For illustration we show the
workability of the approach for a description logic with transitive roles and
propositional intuitionistic logic.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2011 21:22:43 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Apr 2011 09:05:57 GMT"
},
{
"version": "v3",
"created": "Wed, 4 May 2011 20:22:46 GMT"
},
{
"version": "v4",
"created": "Mon, 23 Apr 2012 19:34:29 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Schmidt",
"Renate A.",
"",
"University of Manchester"
],
[
"Tishkovsky",
"Dmitry",
"",
"University of Manchester"
]
] |
new_dataset
| 0.989904 |
1106.2769
|
Zvonko Iljazovic
|
Zvonko Iljazovic (University of Zagreb, Croatia)
|
Co-c.e. spheres and cells in computable metric spaces
| null |
Logical Methods in Computer Science, Volume 7, Issue 3 (August 25,
2011) lmcs:885
|
10.2168/LMCS-7(3:5)2011
| null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate conditions under which a co-computably enumerable set in a
computable metric space is computable. Using higher-dimensional chains and
spherical chains we prove that in each computable metric space which is locally
computable each co-computably enumerable sphere is computable and each co-c.e.
cell with co-c.e. boundary sphere is computable.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2011 17:46:06 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Aug 2011 20:55:00 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Iljazovic",
"Zvonko",
"",
"University of Zagreb, Croatia"
]
] |
new_dataset
| 0.996444 |
1107.3031
|
Marcelo Fiore
|
Marcelo Fiore (University of Cambridge, Computer Laboratory),
Chung-Kil Hur (Universite Paris Diderot - Paris 7, Laboratoire PPS)
|
On the mathematical synthesis of equational logics
|
Final version for publication in Logical Methods in Computer Science
|
Logical Methods in Computer Science, Volume 7, Issue 3 (September
8, 2011) lmcs:1071
|
10.2168/LMCS-7(3:12)2011
| null |
cs.LO math.CT math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide a mathematical theory and methodology for synthesising equational
logics from algebraic metatheories. We illustrate our methodology by means of
two applications: a rational reconstruction of Birkhoff's Equational Logic and
a new equational logic for reasoning about algebraic structure with
name-binding operators.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2011 10:04:12 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jul 2011 12:56:07 GMT"
},
{
"version": "v3",
"created": "Wed, 7 Sep 2011 08:43:53 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Fiore",
"Marcelo",
"",
"University of Cambridge, Computer Laboratory"
],
[
"Hur",
"Chung-Kil",
"",
"Universite Paris Diderot - Paris 7, Laboratoire PPS"
]
] |
new_dataset
| 0.983545 |
1108.0556
|
Fritz Mueller
|
Fritz M\"uller (Saarland University)
|
On Berry's conjectures about the stable order in PCF
|
submitted to LMCS, 39 pages, 23 pstricks/pst-tree figures, main
changes for this version: 4.1: proof of game term theorem corrected, 7.: the
improved chain conjecture is made precise, more references added
|
Logical Methods in Computer Science, Volume 8, Issue 4 (October
12, 2012) lmcs:925
|
10.2168/LMCS-8(4:7)2012
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PCF is a sequential simply typed lambda calculus language. There is a unique
order-extensional fully abstract cpo model of PCF, built up from equivalence
classes of terms. In 1979, G\'erard Berry defined the stable order in this
model and proved that the extensional and the stable order together form a
bicpo. He made the following two conjectures: 1) "Extensional and stable order
form not only a bicpo, but a bidomain." We refute this conjecture by showing
that the stable order is not bounded complete, already for finitary PCF of
second-order types. 2) "The stable order of the model has the syntactic order
as its image: If a is less than b in the stable order of the model, for finite
a and b, then there are normal form terms A and B with the semantics a, resp.
b, such that A is less than B in the syntactic order." We give counter-examples
to this conjecture, again in finitary PCF of second-order types, and also
refute an improved conjecture: There seems to be no simple syntactic
characterization of the stable order. But we show that Berry's conjecture is
true for unary PCF. For the preliminaries, we explain the basic fully abstract
semantics of PCF in the general setting of (not-necessarily complete) partial
order models (f-models.) And we restrict the syntax to "game terms", with a
graphical representation.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2011 12:12:11 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Sep 2012 12:44:38 GMT"
},
{
"version": "v3",
"created": "Thu, 11 Oct 2012 12:28:18 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Müller",
"Fritz",
"",
"Saarland University"
]
] |
new_dataset
| 0.971052 |
1202.3957
|
Diego Figueira
|
Diego Figueira (INRIA & ENS Cachan, LSV)
|
Alternating register automata on finite words and trees
| null |
Logical Methods in Computer Science, Volume 8, Issue 1 (March 9,
2012) lmcs:907
|
10.2168/LMCS-8(1:22)2012
| null |
cs.DB cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study alternating register automata on data words and data trees in
relation to logics. A data word (resp. data tree) is a word (resp. tree) whose
every position carries a label from a finite alphabet and a data value from an
infinite domain. We investigate one-way automata with alternating control over
data words or trees, with one register for storing data and comparing them for
equality. This is a continuation of the study started by Demri, Lazic and
Jurdzinski. From the standpoint of register automata models, this work aims at
two objectives: (1) simplifying the existent decidability proofs for the
emptiness problem for alternating register automata; and (2) exhibiting
decidable extensions for these models. From the logical perspective, we show
that (a) in the case of data words, satisfiability of LTL with one register and
quantification over data values is decidable; and (b) the satisfiability
problem for the so-called forward fragment of XPath on XML documents is
decidable, even in the presence of DTDs and even of key constraints. The
decidability is obtained through a reduction to the automata model introduced.
This fragment contains the child, descendant, next-sibling and
following-sibling axes, as well as data equality and inequality tests.
|
[
{
"version": "v1",
"created": "Fri, 17 Feb 2012 16:38:10 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Mar 2012 23:57:49 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Figueira",
"Diego",
"",
"INRIA & ENS Cachan, LSV"
]
] |
new_dataset
| 0.982311 |
1206.3182
|
Marco Roveri
|
Alessandro Cimatti (Fondazione Bruno Kessler), Iman Narasamdya
(Fondazione Bruno Kessler), Marco Roveri (Fondazione Bruno Kessler)
|
Software Model Checking with Explicit Scheduler and Symbolic Threads
|
40 pages, 10 figures, accepted for publication in journal of logical
methods in computer science
|
Logical Methods in Computer Science, Volume 8, Issue 2 (August 5,
2012) lmcs:1032
|
10.2168/LMCS-8(2:18)2012
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many practical application domains, the software is organized into a set
of threads, whose activation is exclusive and controlled by a cooperative
scheduling policy: threads execute, without any interruption, until they either
terminate or yield the control explicitly to the scheduler. The formal
verification of such software poses significant challenges. On the one side,
each thread may have infinite state space, and might call for abstraction. On
the other side, the scheduling policy is often important for correctness, and
an approach based on abstracting the scheduler may result in loss of precision
and false positives. Unfortunately, the translation of the problem into a
purely sequential software model checking problem turns out to be highly
inefficient for the available technologies. We propose a software model
checking technique that exploits the intrinsic structure of these programs.
Each thread is translated into a separate sequential program and explored
symbolically with lazy abstraction, while the overall verification is
orchestrated by the direct execution of the scheduler. The approach is
optimized by filtering the exploration of the scheduler with the integration of
partial-order reduction. The technique, called ESST (Explicit Scheduler,
Symbolic Threads) has been implemented and experimentally evaluated on a
significant set of benchmarks. The results demonstrate that ESST technique is
way more effective than software model checking applied to the sequentialized
programs, and that partial-order reduction can lead to further performance
improvements.
|
[
{
"version": "v1",
"created": "Thu, 14 Jun 2012 17:07:19 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Jul 2012 07:04:37 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Cimatti",
"Alessandro",
"",
"Fondazione Bruno Kessler"
],
[
"Narasamdya",
"Iman",
"",
"Fondazione Bruno Kessler"
],
[
"Roveri",
"Marco",
"",
"Fondazione Bruno Kessler"
]
] |
new_dataset
| 0.966033 |
1208.5129
|
Luc Segoufin
|
Miko{\l}aj Boja\'nczyk (University of Warsaw), Luc Segoufin (INRIA),
Howard Straubing (Boston college)
|
Piecewise testable tree languages
| null |
Logical Methods in Computer Science, Volume 8, Issue 3 (September
29, 2012) lmcs:1216
|
10.2168/LMCS-8(3:26)2012
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a decidable characterization of tree languages that can
be defined by a boolean combination of Sigma_1 sentences. This is a tree
extension of the Simon theorem, which says that a string language can be
defined by a boolean combination of Sigma_1 sentences if and only if its
syntactic monoid is J-trivial.
|
[
{
"version": "v1",
"created": "Sat, 25 Aug 2012 12:09:02 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Sep 2012 11:09:22 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Bojańczyk",
"Mikołaj",
"",
"University of Warsaw"
],
[
"Segoufin",
"Luc",
"",
"INRIA"
],
[
"Straubing",
"Howard",
"",
"Boston college"
]
] |
new_dataset
| 0.989582 |
1208.5909
|
Igor Walukiewicz
|
Pawel Parys (Warsaw University), Igor Walukiewicz (LaBRI)
|
Weak Alternating Timed Automata
| null |
Logical Methods in Computer Science, Volume 8, Issue 3 (September
19, 2012) lmcs:1214
|
10.2168/LMCS-8(3:18)2012
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Alternating timed automata on infinite words are considered. The main result
is a characterization of acceptance conditions for which the emptiness problem
for these automata is decidable. This result implies new decidability results
for fragments of timed temporal logics. It is also shown that, unlike for MITL,
the characterisation remains the same even if no punctual constraints are
allowed.
|
[
{
"version": "v1",
"created": "Wed, 29 Aug 2012 13:22:29 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Sep 2012 15:20:36 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Parys",
"Pawel",
"",
"Warsaw University"
],
[
"Walukiewicz",
"Igor",
"",
"LaBRI"
]
] |
new_dataset
| 0.98971 |
1209.1916
|
Mohamed Faouzi Atig
|
Mohamed Faouzi Atig (Uppsala University)
|
Model-Checking of Ordered Multi-Pushdown Automata
|
31 pages
|
Logical Methods in Computer Science, Volume 8, Issue 3 (September
20, 2012) lmcs:871
|
10.2168/LMCS-8(3:20)2012
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the verification problem of ordered multi-pushdown automata: A
multi-stack extension of pushdown automata that comes with a constraint on
stack transitions such that a pop can only be performed on the first non-empty
stack. First, we show that the emptiness problem for ordered multi-pushdown
automata is in 2ETIME. Then, we prove that, for an ordered multi-pushdown
automata, the set of all predecessors of a regular set of configurations is an
effectively constructible regular set. We exploit this result to solve the
global model-checking which consists in computing the set of all configurations
of an ordered multi-pushdown automaton that satisfy a given w-regular property
(expressible in linear-time temporal logics or the linear-time \mu-calculus).
As an immediate consequence, we obtain an 2ETIME upper bound for the
model-checking problem of w-regular properties for ordered multi-pushdown
automata (matching its lower-bound).
|
[
{
"version": "v1",
"created": "Mon, 10 Sep 2012 09:33:02 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Sep 2012 09:04:37 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Atig",
"Mohamed Faouzi",
"",
"Uppsala University"
]
] |
new_dataset
| 0.985111 |
1211.1511
|
Matteo Mio
|
Matteo Mio (LIX, Ecole Polytechnique)
|
Probabilistic modal {\mu}-calculus with independent product
| null |
Logical Methods in Computer Science, Volume 8, Issue 4 (November
27, 2012) lmcs:789
|
10.2168/LMCS-8(4:18)2012
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for
expressing properties of probabilistic labeled transition systems (PLTS's). Two
equivalent semantics have been studied for this logic, both assigning to each
state a value in the interval [0,1] representing the probability that the
property expressed by the formula holds at the state. One semantics is
denotational and the other is a game semantics, specified in terms of
two-player stochastic parity games. A shortcoming of the probabilistic modal
{\mu}-calculus is the lack of expressiveness required to encode other important
temporal logics for PLTS's such as Probabilistic Computation Tree Logic (PCTL).
To address this limitation we extend the logic with a new pair of operators:
independent product and coproduct. The resulting logic, called probabilistic
modal {\mu}-calculus with independent product, can encode many properties of
interest and subsumes the qualitative fragment of PCTL. The main contribution
of this paper is the definition of an appropriate game semantics for this
extended probabilistic {\mu}-calculus. This relies on the definition of a new
class of games which generalize standard two-player stochastic (parity) games
by allowing a play to be split into concurrent subplays, each continuing their
evolution independently. Our main technical result is the equivalence of the
two semantics. The proof is carried out in ZFC set theory extended with
Martin's Axiom at an uncountable cardinal.
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2012 10:50:03 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Nov 2012 09:13:32 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Mio",
"Matteo",
"",
"LIX, Ecole Polytechnique"
]
] |
new_dataset
| 0.988987 |
1212.6567
|
Andr
|
Martin Grohe (RWTH Aachen University, Germany), Berit Gru{\ss}ien
(Humboldt-Universit\"at zu Berlin), Andr\'e Hernich (Humboldt-Universit\"at
zu Berlin), Bastian Laubner (Humboldt-Universit\"at zu Berlin)
|
L-Recursion and a new Logic for Logarithmic Space
|
44 pages, 10 figures. A preliminary version of this article appeared
in the Proceedings of the 25th International Workshop on Computer Science
Logic (CSL '11)
|
Logical Methods in Computer Science, Volume 9, Issue 1 (March 13,
2013) lmcs:938
|
10.2168/LMCS-9(1:11)2013
| null |
cs.LO cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We extend first-order logic with counting by a new operator that allows it to
formalise a limited form of recursion which can be evaluated in logarithmic
space. The resulting logic LREC has a data complexity in LOGSPACE, and it
defines LOGSPACE-complete problems like deterministic reachability and Boolean
formula evaluation. We prove that LREC is strictly more expressive than
deterministic transitive closure logic with counting and incomparable in
expressive power with symmetric transitive closure logic STC and transitive
closure logic (with or without counting). LREC is strictly contained in
fixed-point logic with counting FPC. We also study an extension LREC= of LREC
that has nicer closure properties and is more expressive than both LREC and
STC, but is still contained in FPC and has a data complexity in LOGSPACE. Our
main results are that LREC captures LOGSPACE on the class of directed trees and
that LREC= captures LOGSPACE on the class of interval graphs.
|
[
{
"version": "v1",
"created": "Fri, 28 Dec 2012 21:37:58 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Mar 2013 01:56:53 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Mar 2013 09:51:53 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Grohe",
"Martin",
"",
"RWTH Aachen University, Germany"
],
[
"Grußien",
"Berit",
"",
"Humboldt-Universität zu Berlin"
],
[
"Hernich",
"André",
"",
"Humboldt-Universität\n zu Berlin"
],
[
"Laubner",
"Bastian",
"",
"Humboldt-Universität zu Berlin"
]
] |
new_dataset
| 0.998392 |
1302.2762
|
Radu Iosif
|
Radu Iosif (Verimag/CNRS), Filip Konecny (Verimag/CNRS and FIT/BUT),
Marius Bozga (Verimag/CNRS)
|
Deciding Conditional Termination
|
61 pages, 6 figures, 2 tables
|
Logical Methods in Computer Science, Volume 10, Issue 3 (August
21, 2014) lmcs:737
|
10.2168/LMCS-10(3:8)2014
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of conditional termination, which is that of defining
the set of initial configurations from which a given program always terminates.
First we define the dual set, of initial configurations from which a
non-terminating execution exists, as the greatest fixpoint of the function that
maps a set of states into its pre-image with respect to the transition
relation. This definition allows to compute the weakest non-termination
precondition if at least one of the following holds: (i) the transition
relation is deterministic, (ii) the descending Kleene sequence
overapproximating the greatest fixpoint converges in finitely many steps, or
(iii) the transition relation is well founded. We show that this is the case
for two classes of relations, namely octagonal and finite monoid affine
relations. Moreover, since the closed forms of these relations can be defined
in Presburger arithmetic, we obtain the decidability of the termination problem
for such loops.
|
[
{
"version": "v1",
"created": "Tue, 12 Feb 2013 11:33:33 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Jan 2014 20:26:09 GMT"
},
{
"version": "v3",
"created": "Mon, 30 Jun 2014 10:35:01 GMT"
},
{
"version": "v4",
"created": "Wed, 20 Aug 2014 08:37:57 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Iosif",
"Radu",
"",
"Verimag/CNRS"
],
[
"Konecny",
"Filip",
"",
"Verimag/CNRS and FIT/BUT"
],
[
"Bozga",
"Marius",
"",
"Verimag/CNRS"
]
] |
new_dataset
| 0.979852 |
1305.0576
|
Stefan Milius
|
Ji\v{r}\'i Ad\'amek (Institut f\"ur Theoretische Informatik,
Technische Universit\"at Braunschweig, Germany), Stefan Milius (Institut
f\"ur Theoretische Informatik, Technische Universit\"ut Braunschweig,
Germany), Lawrence S Moss (Department of Mathematics, Indiana University,
Bloomington, IN, USA), Lurdes Sousa (Polytechnic Institute of Viseu and
Centre for Mathematics of the University of Coimbra, Portugal)
|
Well-Pointed Coalgebras
| null |
Logical Methods in Computer Science, Volume 9, Issue 3 (August 9,
2013) lmcs:704
|
10.2168/LMCS-9(3:2)2013
| null |
cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For endofunctors of varieties preserving intersections, a new description of
the final coalgebra and the initial algebra is presented: the former consists
of all well-pointed coalgebras. These are the pointed coalgebras having no
proper subobject and no proper quotient. The initial algebra consists of all
well-pointed coalgebras that are well-founded in the sense of Osius and Taylor.
And initial algebras are precisely the final well-founded coalgebras. Finally,
the initial iterative algebra consists of all finite well-pointed coalgebras.
Numerous examples are discussed e.g. automata, graphs, and labeled transition
systems.
|
[
{
"version": "v1",
"created": "Thu, 2 May 2013 20:41:31 GMT"
},
{
"version": "v2",
"created": "Thu, 8 Aug 2013 08:43:09 GMT"
},
{
"version": "v3",
"created": "Tue, 13 Aug 2013 12:16:17 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Adámek",
"Jiří",
"",
"Institut für Theoretische Informatik,\n Technische Universität Braunschweig, Germany"
],
[
"Milius",
"Stefan",
"",
"Institut\n für Theoretische Informatik, Technische Universitüt Braunschweig,\n Germany"
],
[
"Moss",
"Lawrence S",
"",
"Department of Mathematics, Indiana University,\n Bloomington, IN, USA"
],
[
"Sousa",
"Lurdes",
"",
"Polytechnic Institute of Viseu and\n Centre for Mathematics of the University of Coimbra, Portugal"
]
] |
new_dataset
| 0.998834 |
1306.3059
|
Roy Mennicke
|
Roy Mennicke (Ilmenau University of Technology)
|
Propositional Dynamic Logic with Converse and Repeat for Message-Passing
Systems
| null |
Logical Methods in Computer Science, Volume 9, Issue 2 (June 28,
2013) lmcs:855
|
10.2168/LMCS-9(2:12)2013
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The model checking problem for propositional dynamic logic (PDL) over message
sequence charts (MSCs) and communicating finite state machines (CFMs) asks,
given a channel bound $B$, a PDL formula $\varphi$ and a CFM $\mathcal{C}$,
whether every existentially $B$-bounded MSC $M$ accepted by $\mathcal{C}$
satisfies $\varphi$. Recently, it was shown that this problem is
PSPACE-complete.
In the present work, we consider CRPDL over MSCs which is PDL equipped with
the operators converse and repeat. The former enables one to walk back and
forth within an MSC using a single path expression whereas the latter allows to
express that a path expression can be repeated infinitely often. To solve the
model checking problem for this logic, we define message sequence chart
automata (MSCAs) which are multi-way alternating parity automata walking on
MSCs. By exploiting a new concept called concatenation states, we are able to
inductively construct, for every CRPDL formula $\varphi$, an MSCA precisely
accepting the set of models of $\varphi$. As a result, we obtain that the model
checking problem for CRPDL and CFMs is still in PSPACE.
|
[
{
"version": "v1",
"created": "Thu, 13 Jun 2013 09:06:44 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Jun 2013 05:55:47 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Mennicke",
"Roy",
"",
"Ilmenau University of Technology"
]
] |
new_dataset
| 0.989146 |
1307.3913
|
Jakob Nordstrom
|
Jakob Nordstrom (MIT)
|
Pebble Games, Proof Complexity, and Time-Space Trade-offs
| null |
Logical Methods in Computer Science, Volume 9, Issue 3 (September
13, 2013) lmcs:1111
|
10.2168/LMCS-9(3:15)2013
| null |
cs.CC cs.DM cs.LO math.CO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pebble games were extensively studied in the 1970s and 1980s in a number of
different contexts. The last decade has seen a revival of interest in pebble
games coming from the field of proof complexity. Pebbling has proven to be a
useful tool for studying resolution-based proof systems when comparing the
strength of different subsystems, showing bounds on proof space, and
establishing size-space trade-offs. This is a survey of research in proof
complexity drawing on results and tools from pebbling, with a focus on proof
space lower bounds and trade-offs between proof size and proof space.
|
[
{
"version": "v1",
"created": "Mon, 15 Jul 2013 12:44:08 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Sep 2013 19:52:11 GMT"
},
{
"version": "v3",
"created": "Fri, 20 Sep 2013 18:42:01 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Nordstrom",
"Jakob",
"",
"MIT"
]
] |
new_dataset
| 0.996156 |
1308.1228
|
Joost Winter
|
Joost Winter (CWI), Jan J.M. Rutten (CWI/Radboud University Nijmegen),
Marcello M. Bonsangue (Leiden University/CWI)
|
Coalgebraic Characterizations of Context-Free Languages
|
39 pages
|
Logical Methods in Computer Science, Volume 9, Issue 3 (September
13, 2013) lmcs:739
|
10.2168/LMCS-9(3:14)2013
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we provide three coalgebraic characterizations of the class
of context-free languages, each based on the idea of adding coalgebraic
structure to an existing algebraic structure by specifying output-derivative
pairs. Final coalgebra semantics then gives an interpretation function into the
final coalgebra of all languages with the usual output and derivative
operations. The first characterization is based on systems, where each
derivative is given as a finite language over the set of nonterminals; the
second characterization on systems where derivatives are given as elements of a
term-algebra; and the third characterization is based on adding coalgebraic
structure to a class of closed (unique) fixed point expressions. We prove
equivalences between these characterizations, discuss the generalization from
languages to formal power series, as well as the relationship to the
generalized powerset construction.
|
[
{
"version": "v1",
"created": "Tue, 6 Aug 2013 10:16:18 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Sep 2013 17:17:01 GMT"
},
{
"version": "v3",
"created": "Fri, 20 Sep 2013 18:55:10 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Winter",
"Joost",
"",
"CWI"
],
[
"Rutten",
"Jan J. M.",
"",
"CWI/Radboud University Nijmegen"
],
[
"Bonsangue",
"Marcello M.",
"",
"Leiden University/CWI"
]
] |
new_dataset
| 0.975338 |
1308.1600
|
Yuval Filmus
|
Yuval Filmus (University of Toronto)
|
Universal codes of the natural numbers
|
11 pages
|
Logical Methods in Computer Science, Volume 9, Issue 3 (August 29,
2013) lmcs:975
|
10.2168/LMCS-9(3:7)2013
| null |
cs.LO cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A code of the natural numbers is a uniquely-decodable binary code of the
natural numbers with non-decreasing codeword lengths, which satisfies Kraft's
inequality tightly. We define a natural partial order on the set of codes, and
show how to construct effectively a code better than a given sequence of codes,
in a certain precise sense. As an application, we prove that the existence of a
scale of codes (a well-ordered set of codes which contains a code better than
any given code) is independent of ZFC.
|
[
{
"version": "v1",
"created": "Wed, 7 Aug 2013 15:19:58 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Aug 2013 21:17:37 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Filmus",
"Yuval",
"",
"University of Toronto"
]
] |
new_dataset
| 0.999874 |
1310.5558
|
Thomas Chatain
|
Sandie Balaguer (LSV, ENS Cachan, Inria, CNRS), Thomas Chatain (LSV,
ENS Cachan, Inria, CNRS)
|
Avoiding Shared Clocks in Networks of Timed Automata
|
Article accepted to Logical Methods in Computer Science. Number:
LMCS-2013-837 Special issue: 23rd International Conference on Concurrency
Theory (CONCUR 2012)
|
Logical Methods in Computer Science, Volume 9, Issue 4 (November
14, 2013) lmcs:933
|
10.2168/LMCS-9(4:13)2013
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Networks of timed automata (NTA) are widely used to model distributed
real-time systems. Quite often in the literature, the automata are allowed to
share clocks, i.e. transitions of one automaton may be guarded by conditions on
the value of clocks reset by another automaton. This is a problem when one
considers implementing such model in a distributed architecture, since reading
clocks a priori requires communications which are not explicitly described in
the model. We focus on the following question: given an NTA A1 || A2 where A2
reads some clocks reset by A1, does there exist an NTA A'1 || A'2 without
shared clocks with the same behavior as the initial NTA? For this, we allow the
automata to exchange information during synchronizations only, in particular by
copying the value of their neighbor's clocks. We discuss a formalization of the
problem and define an appropriate behavioural equivalence. Then we give a
criterion using the notion of contextual timed transition system, which
represents the behavior of A2 when in parallel with A1. Finally, we effectively
build A'1 || A'2 when it exists.
|
[
{
"version": "v1",
"created": "Fri, 18 Oct 2013 12:48:50 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Nov 2013 22:08:52 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Balaguer",
"Sandie",
"",
"LSV, ENS Cachan, Inria, CNRS"
],
[
"Chatain",
"Thomas",
"",
"LSV,\n ENS Cachan, Inria, CNRS"
]
] |
new_dataset
| 0.985974 |
1310.7911
|
Zvonko Iljazovic
|
Zvonko Iljazovic (University of Zagreb)
|
Compact manifolds with computable boundaries
| null |
Logical Methods in Computer Science, Volume 9, Issue 4 (December
11, 2013) lmcs:891
|
10.2168/LMCS-9(4:19)2013
| null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate conditions under which a co-computably enumerable closed set
in a computable metric space is computable and prove that in each locally
computable computable metric space each co-computably enumerable compact
manifold with computable boundary is computable. In fact, we examine the notion
of a semi-computable compact set and we prove a more general result: in any
computable metric space each semi-computable compact manifold with computable
boundary is computable. In particular, each semi-computable compact
(boundaryless) manifold is computable.
|
[
{
"version": "v1",
"created": "Tue, 29 Oct 2013 18:29:13 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Dec 2013 21:56:24 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Iljazovic",
"Zvonko",
"",
"University of Zagreb"
]
] |
new_dataset
| 0.998079 |
1401.0445
|
Siva ANANTHARAMAN
|
Siva Anantharaman (LIFO, Universite d'Orleans (France)), Christopher
Bouchard (University at Albany - SUNY), Paliath Narendran (University at
Albany - SUNY), Micha\"el Rusinowitch (Loria-INRIA Grand Est, Nancy (France))
|
Unification modulo a 2-sorted Equational theory for Cipher-Decipher
Block Chaining
|
26 pages
|
Logical Methods in Computer Science, Volume 10, Issue 1 (February
9, 2014) lmcs:808
|
10.2168/LMCS-10(1:5)2014
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate unification problems related to the Cipher Block Chaining
(CBC) mode of encryption. We first model chaining in terms of a simple,
convergent, rewrite system over a signature with two disjoint sorts: list and
element. By interpreting a particular symbol of this signature suitably, the
rewrite system can model several practical situations of interest. An inference
procedure is presented for deciding the unification problem modulo this rewrite
system. The procedure is modular in the following sense: any given problem is
handled by a system of `list-inferences', and the set of equations thus derived
between the element-terms of the problem is then handed over to any
(`black-box') procedure which is complete for solving these element-equations.
An example of application of this unification procedure is given, as attack
detection on a Needham-Schroeder like protocol, employing the CBC encryption
mode based on the associative-commutative (AC) operator XOR. The 2-sorted
convergent rewrite system is then extended into one that fully captures a block
chaining encryption-decryption mode at an abstract level, using no AC-symbols;
and unification modulo this extended system is also shown to be decidable.
|
[
{
"version": "v1",
"created": "Thu, 2 Jan 2014 14:17:55 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Feb 2014 21:35:17 GMT"
},
{
"version": "v3",
"created": "Thu, 6 Feb 2014 13:14:05 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Anantharaman",
"Siva",
"",
"LIFO, Universite d'Orleans"
],
[
"Bouchard",
"Christopher",
"",
"University at Albany - SUNY"
],
[
"Narendran",
"Paliath",
"",
"University at\n Albany - SUNY"
],
[
"Rusinowitch",
"Michaël",
"",
"Loria-INRIA Grand Est, Nancy"
]
] |
new_dataset
| 0.996737 |
1405.1546
|
Daniele Gorla
|
Thomas Given-Wilson (NICTA (Sydney, Australia)), Daniele Gorla (Dip.
Informatica - Univ. di Roma), Barry Jay (Centre for Quantum Computation and
Intelligent Systems and School of Software)
|
A Concurrent Pattern Calculus
|
Logical Methods in Computer Science (2014)
|
Logical Methods in Computer Science, Volume 10, Issue 3 (August
23, 2014) lmcs:774
|
10.2168/LMCS-10(3:10)2014
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Concurrent pattern calculus (CPC) drives interaction between processes by
comparing data structures, just as sequential pattern calculus drives
computation. By generalising from pattern matching to pattern unification,
interaction becomes symmetrical, with information flowing in both directions.
CPC provides a natural language to express trade where information exchange is
pivotal to interaction. The unification allows some patterns to be more
discriminating than others; hence, the behavioural theory must take this aspect
into account, so that bisimulation becomes subject to compatibility of
patterns. Many popular process calculi can be encoded in CPC; this allows for a
gain in expressiveness, formalised through encodings.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2014 09:35:48 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Jun 2014 13:56:30 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Aug 2014 23:26:48 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Given-Wilson",
"Thomas",
"",
"NICTA"
],
[
"Gorla",
"Daniele",
"",
"Dip.\n Informatica - Univ. di Roma"
],
[
"Jay",
"Barry",
"",
"Centre for Quantum Computation and\n Intelligent Systems and School of Software"
]
] |
new_dataset
| 0.990273 |
1405.2738
|
St
|
Myrto Arapinis (School of Computer Science, University of Birmingham),
St\'ephanie Delaune (LSV, CNRS & ENS Cachan), Steve Kremer (INRIA Nancy -
Grand-Est)
|
Dynamic Tags for Security Protocols
|
50 pages with 30 references
|
Logical Methods in Computer Science, Volume 10, Issue 2 (June 19,
2014) lmcs:690
|
10.2168/LMCS-10(2:11)2014
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design and verification of cryptographic protocols is a notoriously
difficult task, even in symbolic models which take an abstract view of
cryptography. This is mainly due to the fact that protocols may interact with
an arbitrary attacker which yields a verification problem that has several
sources of unboundedness (size of messages, number of sessions, etc. In this
paper, we characterize a class of protocols for which deciding security for an
unbounded number of sessions is decidable. More precisely, we present a simple
transformation which maps a protocol that is secure for a bounded number of
protocol sessions (a decidable problem) to a protocol that is secure for an
unbounded number of sessions. The precise number of sessions that need to be
considered is a function of the security property and we show that for several
classical security properties a single session is sufficient. Therefore, in
many cases our results yields a design strategy for security protocols: (i)
design a protocol intended to be secure for a {single session}; and (ii) apply
our transformation to obtain a protocol which is secure for an unbounded number
of sessions.
|
[
{
"version": "v1",
"created": "Mon, 12 May 2014 13:10:33 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Jun 2014 10:09:29 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Arapinis",
"Myrto",
"",
"School of Computer Science, University of Birmingham"
],
[
"Delaune",
"Stéphanie",
"",
"LSV, CNRS & ENS Cachan"
],
[
"Kremer",
"Steve",
"",
"INRIA Nancy -\n Grand-Est"
]
] |
new_dataset
| 0.997237 |
1407.1667
|
Sumit Nain
|
Sumit Nain (Rice University), Yoad Lustig (Rice University), Moshe Y
Vardi (Rice University)
|
Synthesis from Probabilistic Components
| null |
Logical Methods in Computer Science, Volume 10, Issue 2 (June 30,
2014) lmcs:1181
|
10.2168/LMCS-10(2:17)2014
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Synthesis is the automatic construction of a system from its specification.
In classical synthesis algorithms, it is always assumed that the system is
"constructed from scratch" rather than composed from reusable components. This,
of course, rarely happens in real life, where almost every non-trivial
commercial software system relies heavily on using libraries of reusable
components. Furthermore, other contexts, such as web-service orchestration, can
be modeled as synthesis of a system from a library of components. Recently,
Lustig and Vardi introduced dataflow and control-flow synthesis from libraries
of reusable components. They proved that dataflow synthesis is undecidable,
while control-flow synthesis is decidable. In this work, we consider the
problem of control-flow synthesis from libraries of probabilistic components .
We show that this more general problem is also decidable.
|
[
{
"version": "v1",
"created": "Mon, 7 Jul 2014 11:10:16 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Jul 2014 12:52:57 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Nain",
"Sumit",
"",
"Rice University"
],
[
"Lustig",
"Yoad",
"",
"Rice University"
],
[
"Vardi",
"Moshe Y",
"",
"Rice University"
]
] |
new_dataset
| 0.986412 |
1407.4425
|
Stefan Milius
|
Ji\v{r}\'i Ad\'amek (Institut f\"ur Theoretische Informatik,
Technische Universit\"at Braunschweig, Germany), Mahdie Haddadi (Department
of Mathematics, Statistics and Computer Science, Semnan University, Iran),
Stefan Milius (Institut f\"ur Theoretische Informatik, Technische
Universita\"t Braunschweig, Germany)
|
Corecursive Algebras, Corecursive Monads and Bloom Monads
| null |
Logical Methods in Computer Science, Volume 10, Issue 3 (September
11, 2014) lmcs:707
|
10.2168/LMCS-10(3:19)2014
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An algebra is called corecursive if from every coalgebra a unique
coalgebra-to-algebra homomorphism exists into it. We prove that free
corecursive algebras are obtained as coproducts of the terminal coalgebra
(considered as an algebra) and free algebras. The monad of free corecursive
algebras is proved to be the free corecursive monad, where the concept of
corecursive monad is a generalization of Elgot's iterative monads, analogous to
corecursive algebras generalizing completely iterative algebras. We also
characterize the Eilenberg-Moore algebras for the free corecursive monad and
call them Bloom algebras.
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2014 18:54:25 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Sep 2014 15:18:23 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Adámek",
"Jiří",
"",
"Institut für Theoretische Informatik,\n Technische Universität Braunschweig, Germany"
],
[
"Haddadi",
"Mahdie",
"",
"Department\n of Mathematics, Statistics and Computer Science, Semnan University, Iran"
],
[
"Milius",
"Stefan",
"",
"Institut für Theoretische Informatik, Technische\n Universitat Braunschweig, Germany"
]
] |
new_dataset
| 0.998107 |
1410.2128
|
Nathalie Bertrand
|
Nathalie Bertrand (INRIA Rennes - Bretagne Atlantique), Patricia
Bouyer (LSV & ENS Cachan), Thomas Brihaye (Universit\'e de Mons), Quentin
Menet (Universit\'e de Mons), Christel Baier (Technische Universit\"at
Dresden), Marcus Groesser (Technische Universit\"at Dresden), Marcin
Jurdzinski (University of Warwick)
|
Stochastic Timed Automata
|
40 pages + appendix
|
Logical Methods in Computer Science, Volume 10, Issue 4 (December
9, 2014) lmcs:1092
|
10.2168/LMCS-10(4:6)2014
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A stochastic timed automaton is a purely stochastic process defined on a
timed automaton, in which both delays and discrete choices are made randomly.
We study the almost-sure model-checking problem for this model, that is, given
a stochastic timed automaton A and a property $\Phi$, we want to decide whether
A satisfies $\Phi$ with probability 1. In this paper, we identify several
classes of automata and of properties for which this can be decided. The proof
relies on the construction of a finite abstraction, called the thick graph,
that we interpret as a finite Markov chain, and for which we can decide the
almost-sure model-checking problem. Correctness of the abstraction holds when
automata are almost-surely fair, which we show, is the case for two large
classes of systems, single- clock automata and so-called weak-reactive
automata. Techniques employed in this article gather tools from real-time
verification and probabilistic verification, as well as topological games
played on timed automata.
|
[
{
"version": "v1",
"created": "Wed, 8 Oct 2014 14:15:01 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Dec 2014 21:15:14 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Bertrand",
"Nathalie",
"",
"INRIA Rennes - Bretagne Atlantique"
],
[
"Bouyer",
"Patricia",
"",
"LSV & ENS Cachan"
],
[
"Brihaye",
"Thomas",
"",
"Université de Mons"
],
[
"Menet",
"Quentin",
"",
"Université de Mons"
],
[
"Baier",
"Christel",
"",
"Technische Universität\n Dresden"
],
[
"Groesser",
"Marcus",
"",
"Technische Universität Dresden"
],
[
"Jurdzinski",
"Marcin",
"",
"University of Warwick"
]
] |
new_dataset
| 0.995896 |
1411.0851
|
Afshin Amighi
|
Christian Haack (aicas GmbH), Marieke Huisman (University of Twente),
Cl\'ement Hurlin (Prove & Run), Afshin Amighi (University of Twente)
|
Permission-Based Separation Logic for Multithreaded Java Programs
| null |
Logical Methods in Computer Science, Volume 11, Issue 1 (February
27, 2015) lmcs:998
|
10.2168/LMCS-11(1:2)2015
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a program logic for reasoning about multithreaded
Java-like programs with dynamic thread creation, thread joining and reentrant
object monitors. The logic is based on concurrent separation logic. It is the
first detailed adaptation of concurrent separation logic to a multithreaded
Java-like language. The program logic associates a unique static access
permission with each heap location, ensuring exclusive write accesses and
ruling out data races. Concurrent reads are supported through fractional
permissions. Permissions can be transferred between threads upon thread
starting, thread joining, initial monitor entrancies and final monitor exits.
In order to distinguish between initial monitor entrancies and monitor
reentrancies, auxiliary variables keep track of multisets of currently held
monitors. Data abstraction and behavioral subtyping are facilitated through
abstract predicates, which are also used to represent monitor invariants,
preconditions for thread starting and postconditions for thread joining.
Value-parametrized types allow to conveniently capture common strong global
invariants, like static object ownership relations. The program logic is
presented for a model language with Java-like classes and interfaces, the
soundness of the program logic is proven, and a number of illustrative examples
are presented.
|
[
{
"version": "v1",
"created": "Tue, 4 Nov 2014 10:32:44 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Feb 2015 13:15:50 GMT"
},
{
"version": "v3",
"created": "Sun, 1 Mar 2015 12:49:57 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Haack",
"Christian",
"",
"aicas GmbH"
],
[
"Huisman",
"Marieke",
"",
"University of Twente"
],
[
"Hurlin",
"Clément",
"",
"Prove & Run"
],
[
"Amighi",
"Afshin",
"",
"University of Twente"
]
] |
new_dataset
| 0.959006 |
1501.03691
|
Christoph Koutschan
|
Manuel Kauers, Christoph Koutschan
|
Integral D-Finite Functions
| null |
Proceedings of the International Symposium on Symbolic and
Algebraic Computation (ISSAC 2015), pages 251-258, 2015. ACM, New York, USA,
ISBN 978-1-4503-3435-8
|
10.1145/2755996.2756658
| null |
cs.SC math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a differential analog of the notion of integral closure of
algebraic function fields. We present an algorithm for computing the integral
closure of the algebra defined by a linear differential operator. Our algorithm
is a direct analog of van Hoeij's algorithm for computing integral bases of
algebraic function fields.
|
[
{
"version": "v1",
"created": "Thu, 15 Jan 2015 14:29:19 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jun 2015 07:27:48 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Kauers",
"Manuel",
""
],
[
"Koutschan",
"Christoph",
""
]
] |
new_dataset
| 0.967367 |
1502.05561
|
Fredrik Nordvall Forsberg
|
Neil Ghani (University of Strathclyde), Fredrik Nordvall Forsberg
(University of Strathclyde), Lorenzo Malatesta (University of Strathclyde)
|
Positive Inductive-Recursive Definitions
|
21 pages
|
Logical Methods in Computer Science, Volume 11, Issue 1 (March 27,
2015) lmcs:1154
|
10.2168/LMCS-11(1:13)2015
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new theory of data types which allows for the definition of types as
initial algebras of certain functors Fam(C) -> Fam(C) is presented. This
theory, which we call positive inductive-recursive definitions, is a
generalisation of Dybjer and Setzer's theory of inductive-recursive definitions
within which C had to be discrete -- our work can therefore be seen as lifting
this restriction. This is a substantial endeavour as we need to not only
introduce a type of codes for such data types (as in Dybjer and Setzer's work),
but also a type of morphisms between such codes (which was not needed in Dybjer
and Setzer's development). We show how these codes are interpreted as functors
on Fam(C) and how these morphisms of codes are interpreted as natural
transformations between such functors. We then give an application of positive
inductive-recursive definitions to the theory of nested data types and we give
concrete examples of recursive functions defined on universes by using their
elimination principle. Finally we justify the existence of positive
inductive-recursive definitions by adapting Dybjer and Setzer's set-theoretic
model to our setting.
|
[
{
"version": "v1",
"created": "Thu, 19 Feb 2015 13:19:36 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Mar 2015 19:52:35 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Ghani",
"Neil",
"",
"University of Strathclyde"
],
[
"Forsberg",
"Fredrik Nordvall",
"",
"University of Strathclyde"
],
[
"Malatesta",
"Lorenzo",
"",
"University of Strathclyde"
]
] |
new_dataset
| 0.995951 |
1506.08839
|
Julian McAuley
|
Julian McAuley and Rahul Pandey and Jure Leskovec
|
Inferring Networks of Substitutable and Complementary Products
|
12 pages, 6 figures
| null | null | null |
cs.SI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a modern recommender system, it is important to understand how products
relate to each other. For example, while a user is looking for mobile phones,
it might make sense to recommend other phones, but once they buy a phone, we
might instead want to recommend batteries, cases, or chargers. These two types
of recommendations are referred to as substitutes and complements: substitutes
are products that can be purchased instead of each other, while complements are
products that can be purchased in addition to each other.
Here we develop a method to infer networks of substitutable and complementary
products. We formulate this as a supervised link prediction task, where we
learn the semantics of substitutes and complements from data associated with
products. The primary source of data we use is the text of product reviews,
though our method also makes use of features such as ratings, specifications,
prices, and brands. Methodologically, we build topic models that are trained to
automatically discover topics from text that are successful at predicting and
explaining such relationships. Experimentally, we evaluate our system on the
Amazon product catalog, a large dataset consisting of 9 million products, 237
million links, and 144 million reviews.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2015 20:06:28 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"McAuley",
"Julian",
""
],
[
"Pandey",
"Rahul",
""
],
[
"Leskovec",
"Jure",
""
]
] |
new_dataset
| 0.953356 |
1506.09019
|
Jaderick Pabico
|
Jaderick P. Pabico
|
Artificial Catalytic Reactions in 2D for Combinatorial Optimization
|
8 pages, 2 figures, In H.N. Adorna (ed.) Proceedings of the 3rd
Symposium on Mathematical Aspects of Computer Science (SMACS 2006), Adventist
University of the Philippines, Silang, Cavite, Philippines, 19-20 October
2006 (Published by the Computing Society of the Philippines)
| null | null | null |
cs.ET cs.NE
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Presented in this paper is a derivation of a 2D catalytic reaction-based
model to solve combinatorial optimization problems (COPs). The simulated
catalytic reactions, a computational metaphor, occurs in an artificial chemical
reactor that finds near-optimal solutions to COPs. The artificial environment
is governed by catalytic reactions that can alter the structure of artificial
molecular elements. Altering the molecular structure means finding new
solutions to the COP. The molecular mass of the elements was considered as a
measure of goodness of fit of the solutions. Several data structures and
matrices were used to record the directions and locations of the molecules.
These provided the model the 2D topology. The Traveling Salesperson Problem
(TSP) was used as a working example. The performance of the model in finding a
solution for the TSP was compared to the performance of a topology-less model.
Experimental results show that the 2D model performs better than the
topology-less one.
|
[
{
"version": "v1",
"created": "Tue, 30 Jun 2015 10:16:20 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Pabico",
"Jaderick P.",
""
]
] |
new_dataset
| 0.994755 |
1506.09044
|
Andrew Adamatzky
|
Stefano Siccardi and Jack A. Tuszynski and Andrew Adamatzky
|
Boolean gates on actin filaments
| null | null | null | null |
cs.ET physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Actin is a globular protein which forms long polar filaments in the
eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and
cell motility. They have also been implicated in information transmission and
processing, memory and learning in neuronal cells. The acting filaments have
been shown to support propagation of voltage pulses. Here we apply a coupled
nonlinear transmission line model of actin filaments to study interactions
between voltage pulses. By assigning a logical {\sc Truth} to the presence of a
voltage pulses in a given location of the actin filament, and {\sc False} to
the pulse's absence we represent digital information transmission along these
filaments. When two pulses, representing Boolean values of input variables,
interact, then they can facilitate or inhibit further propagation of each
other. We explore this phenomenon to construct Boolean logical gates and a
one-bit half-adder with interacting voltage pulses. We discuss implications of
these findings on cellular process and technological applications.
|
[
{
"version": "v1",
"created": "Tue, 30 Jun 2015 11:52:17 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Siccardi",
"Stefano",
""
],
[
"Tuszynski",
"Jack A.",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.995763 |
1506.09158
|
Matteo Dell'Amico Ph.D.
|
Matteo Dell'Amico, Damiano Carra, and Pietro Michiardi
|
On Fair Size-Based Scheduling
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By executing jobs serially rather than in parallel, size-based scheduling
policies can shorten time needed to complete jobs; however, major obstacles to
their applicability are fairness guarantees and the fact that job sizes are
rarely known exactly a-priori. Here, we introduce the Pri family of size-based
scheduling policies; Pri simulates any reference scheduler and executes jobs in
the order of their simulated completion: we show that these schedulers give
strong fairness guarantees, since no job completes later in Pri than in the
reference policy. In addition, we introduce PSBS, a practical implementation of
such a scheduler: it works online (i.e., without needing knowledge of jobs
submitted in the future), it has an efficient O(log n) implementation and it
allows setting priorities to jobs. Most importantly, unlike earlier size-based
policies, the performance of PSBS degrades gracefully with errors, leading to
performances that are close to optimal in a variety of realistic use cases.
|
[
{
"version": "v1",
"created": "Tue, 30 Jun 2015 17:02:17 GMT"
}
] | 2015-07-01T00:00:00 |
[
[
"Dell'Amico",
"Matteo",
""
],
[
"Carra",
"Damiano",
""
],
[
"Michiardi",
"Pietro",
""
]
] |
new_dataset
| 0.997728 |
1501.02607
|
Facundo Carreiro
|
Facundo Carreiro
|
Characterization theorems for PDL and FO(TC)
|
Technical Report, 70 pages. arXiv admin note: text overlap with
arXiv:1401.4374
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our main contributions can be divided in three parts: (1) Fixpoint extensions
of first-order logic: we give a precise syntactic and semantic characterization
of the relationship between $\mathrm{FO(TC^1)}$ and $\mathrm{FO(LFP)}$; (2)
Automata and expressiveness on trees: we introduce a new class of parity
automata which, on trees, captures the expressive power of $\mathrm{FO(TC^1)}$
and WCL (weak chain logic). The latter logic is a variant of MSO which
quantifies over finite chains; and (3) Expressiveness modulo bisimilarity: we
show that PDL is expressively equivalent to the bisimulation-invariant fragment
of both $\mathrm{FO(TC^1)}$ and WCL. In particular, point (3) closes the open
problems of the bisimulation-invariant characterizations of PDL,
$\mathrm{FO(TC^1)}$ and WCL all at once.
|
[
{
"version": "v1",
"created": "Mon, 12 Jan 2015 11:36:21 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Jun 2015 21:24:10 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Carreiro",
"Facundo",
""
]
] |
new_dataset
| 0.988783 |
1504.05647
|
Bushra Aloraini
|
Bushra Aloraini, Daryl Johnson, Bill Stackpole, and Sumita Mishra
|
A New Covert Channel over Cellular Voice Channel in Smartphones
|
10 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Investigating network covert channels in smartphones has become increasingly
important as smartphones have recently replaced the role of traditional
computers. Smartphones are subject to traditional computer network covert
channel techniques. Smartphones also introduce new sets of covert channel
techniques as they add more capabilities and multiple network connections. This
work presents a new network covert channel in smartphones. The research studies
the ability to leak information from the smartphones applications by reaching
the cellular voice stream, and it examines the ability to employ the cellular
voice channel to be a potential medium of information leakage through carrying
modulated speech-like data covertly. To validate the theory, an Android
software audio modem has been developed and it was able to leak data
successfully through the cellular voice channel stream by carrying modulated
data with a throughput of 13 bps with 0.018% BER. Moreover, Android security
policies are investigated and broken in order to implement a user-mode rootkit
that opens the voice channels by stealthily answering an incoming voice call.
Multiple scenarios are conducted to verify the effectiveness of the proposed
covert channel. This study identifies a new potential smartphone covert
channel, and discusses some security vulnerabilities in Android OS that allow
the use of this channel demonstrating the need to set countermeasures against
this kind of breach.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 03:49:23 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Jun 2015 05:49:10 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Aloraini",
"Bushra",
""
],
[
"Johnson",
"Daryl",
""
],
[
"Stackpole",
"Bill",
""
],
[
"Mishra",
"Sumita",
""
]
] |
new_dataset
| 0.990933 |
1506.07055
|
Christoph Pohl
|
Christoph Pohl and Hans-Joachim Hof
|
The All-Seeing Eye: A Massive-Multi-Sensor Zero-Configuration Intrusion
Detection System for Web Applications
|
SECURWARE 2013 : The Seventh International Conference on Emerging
Security Information, Systems and Technologies
|
SECURWARE 2013 : The Seventh International Conference on Emerging
Security Information, Systems and Technologies,2013,66-71
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Timing attacks are a challenge for current intrusion detection solutions.
Timing attacks are dangerous for web applications because they may leak
information about side channel vulnerabilities. This paper presents a
massive-multi-sensor zero-configuration Intrusion Detection System that is
especially good at detecting timing attacks. Unlike current solutions, the
proposed Intrusion Detection System uses a huge number of sensors for attack
detection. These sensors include sensors automatically inserted into web
application or into the frameworks used to build web applications. With this
approach the Intrusion Detection System is able to detect sophisticated attacks
like timing attacks or other brute-force attacks with increased accuracy. The
proposed massive-multi-sensor zero-configuration intrusion detection system
does not need specific knowledge about the system to protect, hence it offers
zero-configuration capability.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 15:46:37 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Pohl",
"Christoph",
""
],
[
"Hof",
"Hans-Joachim",
""
]
] |
new_dataset
| 0.970509 |
1506.08251
|
Szymon Jozef Sidor
|
Jonathan Raiman and Szymon Sidor
|
Occam's Gates
|
In review at NIPS
| null | null | null |
cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
We present a complimentary objective for training recurrent neural networks
(RNN) with gating units that helps with regularization and interpretability of
the trained model. Attention-based RNN models have shown success in many
difficult sequence to sequence classification problems with long and short term
dependencies, however these models are prone to overfitting. In this paper, we
describe how to regularize these models through an L1 penalty on the activation
of the gating units, and show that this technique reduces overfitting on a
variety of tasks while also providing to us a human-interpretable visualization
of the inputs used by the network. These tasks include sentiment analysis,
paraphrase recognition, and question answering.
|
[
{
"version": "v1",
"created": "Sat, 27 Jun 2015 03:03:10 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Raiman",
"Jonathan",
""
],
[
"Sidor",
"Szymon",
""
]
] |
new_dataset
| 0.986512 |
1506.08268
|
Salvatore Iaconesi
|
Salvatore Iaconesi, Oriana Persico
|
The Third Infoscape: Data, Information and Knowledge in the city. New
paradigms for urban interaction
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
The Third Infoscape refers to the information and knowledge generated through
the myriads of micro-histories, through the progressive, emergent and
polyphonic sedimentation of the expressions of the daily lives of city
dwellers. To all effects, with the development of wireless sensors, of smart
dust1, and with the possibility to engage human beings in urban sensing
processes, the dimension of virtuality collapses. Heading towards a state which
is basically comparable to the one of telepathy (among human beings, human
beings and machines, machines and machines...), reconfiguring urban ecologies
so that mapping virtuality or physicality would not be needed anymore, and
replacing this need with the possibility to create recombinant inventories of
the telepathic migration of dusts, of the myriads of pulverized sensors which
are disseminated, diffused. We can imagine information mutating into landscape,
delineating an urban space which is not determined by distance and time, but
from the transformation of densities and presences.
|
[
{
"version": "v1",
"created": "Sat, 27 Jun 2015 08:10:44 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Iaconesi",
"Salvatore",
""
],
[
"Persico",
"Oriana",
""
]
] |
new_dataset
| 0.976844 |
1506.08370
|
Ido Tal
|
Ido Tal
|
On the Construction of Polar Codes for Channels with Moderate Input
Alphabet Sizes
|
9 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current deterministic algorithms for the construction of polar codes can only
be argued to be practical for channels with small input alphabet sizes. In this
paper, we show that any construction algorithm for channels with moderate input
alphabet size which follows the paradigm of "degrading after each polarization
step" will inherently be impractical with respect to a certain "hard"
underlying channel. This result also sheds light on why the construction of
LDPC codes using density evolution is impractical for channels with moderate
sized input alphabets.
|
[
{
"version": "v1",
"created": "Sun, 28 Jun 2015 07:34:53 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Tal",
"Ido",
""
]
] |
new_dataset
| 0.98804 |
1506.08392
|
Michael Elkin
|
Michael Elkin, Seth Pettie
|
A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for
General Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 2001 Thorup and Zwick devised a distance oracle, which given an $n$-vertex
undirected graph and a parameter $k$, has size $O(k n^{1+1/k})$. Upon a query
$(u,v)$ their oracle constructs a $(2k-1)$-approximate path $\Pi$ between $u$
and $v$. The query time of the Thorup-Zwick's oracle is $O(k)$, and it was
subsequently improved to $O(1)$ by Chechik. A major drawback of the oracle of
Thorup and Zwick is that its space is $\Omega(n \cdot \log n)$. Mendel and Naor
devised an oracle with space $O(n^{1+1/k})$ and stretch $O(k)$, but their
oracle can only report distance estimates and not actual paths. In this paper
we devise a path-reporting distance oracle with size $O(n^{1+1/k})$, stretch
$O(k)$ and query time $O(n^\epsilon)$, for an arbitrarily small $\epsilon > 0$.
In particular, our oracle can provide logarithmic stretch using linear size.
Another variant of our oracle has size $O(n \log\log n)$, polylogarithmic
stretch, and query time $O(\log\log n)$.
For unweighted graphs we devise a distance oracle with multiplicative stretch
$O(1)$, additive stretch $O(\beta(k))$, for a function $\beta(\cdot)$, space
$O(n^{1+1/k} \cdot \beta)$, and query time $O(n^\epsilon)$, for an arbitrarily
small constant $\epsilon >0$. The tradeoff between multiplicative stretch and
size in these oracles is far below girth conjecture threshold (which is stretch
$2k-1$ and size $O(n^{1+1/k})$). Breaking the girth conjecture tradeoff is
achieved by exhibiting a tradeoff of different nature between additive stretch
$\beta(k)$ and size $O(n^{1+1/k})$. A similar type of tradeoff was exhibited by
a construction of $(1+\epsilon,\beta)$-spanners due to Elkin and Peleg.
However, so far $(1+\epsilon,\beta)$-spanners had no counterpart in the
distance oracles' world.
An important novel tool that we develop on the way to these results is a
{distance-preserving path-reporting oracle}.
|
[
{
"version": "v1",
"created": "Sun, 28 Jun 2015 12:56:32 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Elkin",
"Michael",
""
],
[
"Pettie",
"Seth",
""
]
] |
new_dataset
| 0.996798 |
1506.08485
|
Shachaf Melman
|
Shachaf Melman, Yael Moses, G\'erard Medioni and Yinghao Cai
|
The Multi-Strand Graph for a PTZ Tracker
|
9 pages, 7 figures, AVSS2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-resolution images can be used to resolve matching ambiguities between
trajectory fragments (tracklets), which is one of the main challenges in
multiple target tracking. A PTZ camera, which can pan, tilt and zoom, is a
powerful and efficient tool that offers both close-up views and wide area
coverage on demand. The wide-area view makes it possible to track many targets
while the close-up view allows individuals to be identified from
high-resolution images of their faces. A central component of a PTZ tracking
system is a scheduling algorithm that determines which target to zoom in on.
In this paper we study this scheduling problem from a theoretical
perspective, where the high resolution images are also used for tracklet
matching. We propose a novel data structure, the Multi-Strand Tracking Graph
(MSG), which represents the set of tracklets computed by a tracker and the
possible associations between them. The MSG allows efficient scheduling as well
as resolving -- directly or by elimination -- matching ambiguities between
tracklets. The main feature of the MSG is the auxiliary data saved in each
vertex, which allows efficient computation while avoiding time-consuming graph
traversal. Synthetic data simulations are used to evaluate our scheduling
algorithm and to demonstrate its superiority over a na\"ive one.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2015 01:59:32 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Melman",
"Shachaf",
""
],
[
"Moses",
"Yael",
""
],
[
"Medioni",
"Gérard",
""
],
[
"Cai",
"Yinghao",
""
]
] |
new_dataset
| 0.998917 |
1506.08548
|
Lei Zhang
|
Lei Zhang, Qianhong Wu, Josep Domingo-Ferrer, Bo Qin, Chuanyan Hu
|
On the Security of MTA-OTIBASs (Multiple-TA One-Time Identity-Based
Aggregate Signatures)
|
4 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In [3] the authors proposed a new aggregate signature scheme referred to as
multiple-TA (trusted authority) one-time identity-based aggregate signature
(MTA-OTIBAS). Further, they gave a concrete MTA-OTIBAS scheme. We recall here
the definition of MTA-OTIBAS and the concrete proposed scheme. Then we prove
that our MTA-OTIBAS concrete scheme is existentially unforgeable against
adaptively chosen-message attacks in the random oracle model under the co-CDH
problem assumption.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2015 08:55:49 GMT"
}
] | 2015-06-30T00:00:00 |
[
[
"Zhang",
"Lei",
""
],
[
"Wu",
"Qianhong",
""
],
[
"Domingo-Ferrer",
"Josep",
""
],
[
"Qin",
"Bo",
""
],
[
"Hu",
"Chuanyan",
""
]
] |
new_dataset
| 0.989042 |
1506.04352
|
Zhe Wang
|
Zhe Wang, Kai Hu, Baolin Yin
|
Internet Traffic Matrix Structural Analysis Based on Multi-Resolution
RPCA
|
18 pages, in Chinese. This unpublished manuscript is an improvement
on our previous papers in references [12] and [13]
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet traffic matrix plays a significant roll in network operation and
management, therefore, the structural analysis of traffic matrix, which
decomposes different traffic components of this high-dimensional traffic
dataset, is quite valuable to some network applications. In this study, based
on the Robust Principal Component Analysis (RPCA) theory, a novel traffic
matrix structural analysis approach named Multi-Resolution RPCA is created,
which utilizes the wavelet multi-resolution analysis. Firstly, we build the
Multi-Resolution Traffic Matrix Decomposition Model (MR-TMDM), which
characterizes the smoothness of the deterministic traffic by its wavelet
coefficients. Secondly, based on this model, we improve the Stable Principal
Component Pursuit (SPCP), propose a new traffic matrix decomposition method
named SPCP-MRC with Multi-Resolution Constraints, and design its numerical
algorithm. Specifically, we give and prove the closed-form solution to a
sub-problem in the algorithm. Lastly, we evaluate different traffic
decomposition methods by multiple groups of simulated traffic matrices
containing different kinds of anomalies and distinct noise levels. It is
demonstrated that SPCP-MRC, compared with other methods, achieves more accurate
and more reasonable traffic decompositions.
|
[
{
"version": "v1",
"created": "Sun, 14 Jun 2015 05:12:56 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Jun 2015 06:43:46 GMT"
}
] | 2015-06-29T00:00:00 |
[
[
"Wang",
"Zhe",
""
],
[
"Hu",
"Kai",
""
],
[
"Yin",
"Baolin",
""
]
] |
new_dataset
| 0.964909 |
1506.07905
|
Luk\'a\v{s} Folwarczn\'y
|
Luk\'a\v{s} Folwarczn\'y and Ji\v{r}\'i Sgall
|
General Caching Is Hard: Even with Small Pages
|
19 pages, 8 figures, an extended abstract appeared in the proceedings
of MAPSP 2015 (www.mapsp2015.com), a conference version has been submitted
| null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Caching (also known as paging) is a classical problem concerning page
replacement policies in two-level memory systems. General caching is the
variant with pages of different sizes and fault costs. We give the first
NP-hardness result for general caching with small pages: General caching is
(strongly) NP-hard even when page sizes are limited to {1, 2, 3}. It holds
already in the fault model (each page has unit fault cost) as well as in the
bit model (each page has the same fault cost as size). We also give a very
short proof of the strong NP-hardness of general caching with page sizes
restricted to {1, 2, 3} and arbitrary costs.
|
[
{
"version": "v1",
"created": "Thu, 25 Jun 2015 21:45:48 GMT"
}
] | 2015-06-29T00:00:00 |
[
[
"Folwarczný",
"Lukáš",
""
],
[
"Sgall",
"Jiří",
""
]
] |
new_dataset
| 0.999282 |
1410.4876
|
Elis\^angela Silva Dias
|
Elis\^angela Silva Dias, Diane Castonguay, Humberto Longo, Walid
Abdala Rfaei Jradi, Hugo A. D. do Nascimento
|
A GPU-based parallel algorithm for enumerating all chordless cycles in
graphs
|
15 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a finite undirected simple graph, a chordless cycle is an induced subgraph
which is a cycle. We propose a GPU parallel algorithm for enumerating all
chordless cycles of such a graph. The algorithm, implemented in OpenCL, is
based on a previous sequential algorithm developed by the current authors for
the same problem. It uses a more compact data structure for solution
representation which is suitable for the memory-size limitation of a GPU.
Moreover, for graphs with a sufficiently large amount of chordless cycles, the
algorithm presents a significant improvement in execution time that outperforms
the sequential method.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 21:48:50 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Jun 2015 14:19:14 GMT"
}
] | 2015-06-26T00:00:00 |
[
[
"Dias",
"Elisângela Silva",
""
],
[
"Castonguay",
"Diane",
""
],
[
"Longo",
"Humberto",
""
],
[
"Jradi",
"Walid Abdala Rfaei",
""
],
[
"Nascimento",
"Hugo A. D. do",
""
]
] |
new_dataset
| 0.996181 |
1411.0028
|
Ivan Soprunov
|
Ivan Soprunov
|
Lattice polytopes in coding theory
|
11 pages, 3 figures
|
J. Algebra Comb. Discrete Appl., 2(2) pp.85-94 (2015)
|
10.13069/jacodesmath.75353
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we discuss combinatorial questions about lattice polytopes
motivated by recent results on minimum distance estimation for toric codes. We
also prove a new inductive bound for the minimum distance of generalized toric
codes. As an application, we give new formulas for the minimum distance of
generalized toric codes for special lattice point configurations.
|
[
{
"version": "v1",
"created": "Fri, 31 Oct 2014 21:21:05 GMT"
}
] | 2015-06-26T00:00:00 |
[
[
"Soprunov",
"Ivan",
""
]
] |
new_dataset
| 0.9857 |
1506.07632
|
Xiaoli Xu
|
Xiaoli Xu, Meenakshi Sundaram Gandhi Praveen Kumar, Yong Liang Guan
|
Reliable Broadcast to A User Group with Limited Source Transmissions
|
ICC 2015. arXiv admin note: substantial text overlap with
arXiv:1504.04464
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to reduce the number of retransmissions and save power for the
source node, we propose a two-phase coded scheme to achieve reliable broadcast
from the source to a group of users with minimal source transmissions. In the
first phase, the information packets are encoded with batched sparse (BATS)
code, which are then broadcasted by the source node until the file can be
cooperatively decoded by the user group. In the second phase, each user
broadcasts the re-encoded packets to its peers based on their respective
received packets from the first phase, so that the file can be decoded by each
individual user. The performance of the proposed scheme is analyzed and the
rank distribution at the moment of decoding is derived, which is used as input
for designing the optimal BATS code. Simulation results show that the proposed
scheme can reduce the total number of retransmissions compared with the
traditional single-phase broadcast with optimal erasure codes. Furthermore,
since a large number of transmissions are shifted from the source node to the
users, power consumptions at the source node is significantly reduced.
|
[
{
"version": "v1",
"created": "Thu, 25 Jun 2015 06:51:35 GMT"
}
] | 2015-06-26T00:00:00 |
[
[
"Xu",
"Xiaoli",
""
],
[
"Kumar",
"Meenakshi Sundaram Gandhi Praveen",
""
],
[
"Guan",
"Yong Liang",
""
]
] |
new_dataset
| 0.998754 |
1404.2862
|
Daniel Moskovich
|
Avishy Y. Carmi and Daniel Moskovich
|
Tangle Machines
|
29 pages, 37 figures. Major revision. Introduction rewritten.
Definitions simplified, with the Gauss diagram definition pushed to an
appendix. Previous appendix removed
|
Proc. R. Soc. A 2015 471 20150111
|
10.1098/rspa.2015.0111
| null |
cs.IT cs.SY math.GT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tangle machines are topologically inspired diagrammatic models. Their novel
feature is their natural notion of equivalence. Equivalent tangle machines may
differ locally, but globally they are considered to share the same information
content. The goal of tangle machine equivalence is to provide a
context-independent method to select, from among many ways to perform a task,
the `best' way to perform the task. The concept of equivalent tangle machines
is illustrated through examples in which they represent recursive computations,
networks of adiabatic quantum computations, and networks of distributed
information processing.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 16:07:23 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Mar 2015 13:19:11 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Carmi",
"Avishy Y.",
""
],
[
"Moskovich",
"Daniel",
""
]
] |
new_dataset
| 0.994274 |
1503.00879
|
Fernando Hernando
|
Carlos Galindo, Fernando Hernando and Diego Ruano
|
Stabilizer quantum codes from $J$-affine variety codes and a new
Steane-like enlargement
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New stabilizer codes with parameters better than the ones available in the
literature are provided in this work, in particular quantum codes with
parameters $[[127,63, \geq 12]]_2$ and $[[63,45, \geq 6]]_4$ that are records.
These codes are constructed with a new generalization of the Steane's
enlargement procedure and by considering orthogonal subfield-subcodes --with
respect to the Euclidean and Hermitian inner product-- of a new family of
linear codes, the $J$-affine variety codes.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 10:26:43 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Jun 2015 08:12:05 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Galindo",
"Carlos",
""
],
[
"Hernando",
"Fernando",
""
],
[
"Ruano",
"Diego",
""
]
] |
new_dataset
| 0.999763 |
1506.06863
|
Michel Galley
|
Michel Galley, Chris Brockett, Alessandro Sordoni, Yangfeng Ji,
Michael Auli, Chris Quirk, Margaret Mitchell, Jianfeng Gao, Bill Dolan
|
deltaBLEU: A Discriminative Metric for Generation Tasks with
Intrinsically Diverse Targets
|
6 pages, to appear at ACL 2015
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Discriminative BLEU (deltaBLEU), a novel metric for intrinsic
evaluation of generated text in tasks that admit a diverse range of possible
outputs. Reference strings are scored for quality by human raters on a scale of
[-1, +1] to weight multi-reference BLEU. In tasks involving generation of
conversational responses, deltaBLEU correlates reasonably with human judgments
and outperforms sentence-level and IBM BLEU in terms of both Spearman's rho and
Kendall's tau.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 05:24:53 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Jun 2015 01:09:50 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Galley",
"Michel",
""
],
[
"Brockett",
"Chris",
""
],
[
"Sordoni",
"Alessandro",
""
],
[
"Ji",
"Yangfeng",
""
],
[
"Auli",
"Michael",
""
],
[
"Quirk",
"Chris",
""
],
[
"Mitchell",
"Margaret",
""
],
[
"Gao",
"Jianfeng",
""
],
[
"Dolan",
"Bill",
""
]
] |
new_dataset
| 0.972191 |
1506.07246
|
Martin Derka
|
Therese Biedl, Martin Derka
|
$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and
Some Subclasses
|
To appear at the 27th Canadian Conference on Computational Geometry,
Kingston, Ontario, August 10--12, 2015
| null | null | null |
cs.CG cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Planar partial $3$-trees are subgraphs of those planar graphs obtained by
repeatedly inserting a vertex of degree $3$ into a face. In this paper, we show
that planar partial $3$-trees have $1$-string $B_1$-VPG representations, i.e.,
representations where every vertex is represented by an orthogonal curve with
at most one bend, every two curves intersect at most once, and intersections of
curves correspond to edges in the graph. We also that some subclasses of planar
partial 3-trees have L-representations, i.e., a $B_1$-VPG representation where
every curve has the shape of an L.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 05:12:41 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Derka",
"Martin",
""
]
] |
new_dataset
| 0.999117 |
1506.07273
|
Hojjat Mostafanasab
|
Hojjat Mostafanasab and Negin Karimi
|
$(1-2u^2)$-constacyclic codes over
$\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$
|
8 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This
article studies $(1-2u^2)$-constacyclic codes over the ring
$\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$, where $u^3=u$. We describe
generator polynomials of this kind of codes and investigate the structural
properties of these codes by a decomposition theorem.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 08:00:27 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Mostafanasab",
"Hojjat",
""
],
[
"Karimi",
"Negin",
""
]
] |
new_dataset
| 0.998957 |
1506.07327
|
Darshan Santani
|
Darshan Santani, Jidraph Njuguna, Tierra Bills, Aisha W. Bryant,
Reginald Bryant, Jonathan Ledgard, Daniel Gatica-Perez
|
CommuniSense: Crowdsourcing Road Hazards in Nairobi
|
In Proceedings of 17th International Conference on Human-Computer
Interaction with Mobile Devices and Services (MobileHCI 2015)
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nairobi is one of the fastest growing metropolitan cities and a major
business and technology powerhouse in Africa. However, Nairobi currently lacks
monitoring technologies to obtain reliable data on traffic and road
infrastructure conditions. In this paper, we investigate the use of mobile
crowdsourcing as means to gather and document Nairobi's road quality
information. We first present the key findings of a city-wide road quality
survey about the perception of existing road quality conditions in Nairobi.
Based on the survey's findings, we then developed a mobile crowdsourcing
application, called CommuniSense, to collect road quality data. The application
serves as a tool for users to locate, describe, and photograph road hazards. We
tested our application through a two-week field study amongst 30 participants
to document various forms of road hazards from different areas in Nairobi. To
verify the authenticity of user-contributed reports from our field study, we
proposed to use online crowdsourcing using Amazon's Mechanical Turk (MTurk) to
verify whether submitted reports indeed depict road hazards. We found 92% of
user-submitted reports to match the MTurkers judgements. While our prototype
was designed and tested on a specific city, our methodology is applicable to
other developing cities.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 11:42:13 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Santani",
"Darshan",
""
],
[
"Njuguna",
"Jidraph",
""
],
[
"Bills",
"Tierra",
""
],
[
"Bryant",
"Aisha W.",
""
],
[
"Bryant",
"Reginald",
""
],
[
"Ledgard",
"Jonathan",
""
],
[
"Gatica-Perez",
"Daniel",
""
]
] |
new_dataset
| 0.99067 |
1506.07363
|
Venkatesh Babu R
|
Sai Srivatsa R and R. Venkatesh Babu
|
Salient Object Detection via Objectness Measure
|
In IEEE International Conference on Image Processing (ICIP), 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Salient object detection has become an important task in many image
processing applications. The existing approaches exploit background prior and
contrast prior to attain state of the art results. In this paper, instead of
using background cues, we estimate the foreground regions in an image using
objectness proposals and utilize it to obtain smooth and accurate saliency
maps. We propose a novel saliency measure called `foreground connectivity'
which determines how tightly a pixel or a region is connected to the estimated
foreground. We use the values assigned by this measure as foreground weights
and integrate these in an optimization framework to obtain the final saliency
maps. We extensively evaluate the proposed approach on two benchmark databases
and demonstrate that the results obtained are better than the existing state of
the art approaches.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 13:44:21 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"R",
"Sai Srivatsa",
""
],
[
"Babu",
"R. Venkatesh",
""
]
] |
new_dataset
| 0.99827 |
1506.07413
|
Devashish Kulkarni
|
Devashish Kulkarni, Sagar Paldhe, Vinod Kamat
|
Speech Controlled Quadruped
|
7 pages
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The project which we have performed is based on voice recognition and we
desire to create a four legged robot that can acknowledge the given
instructions which are given through vocal commands and perform the tasks. The
main processing unit of the robot will be Arduino Uno. We are using 8 servos
for the movement of its legs while two servos will be required for each leg.
The interface between a human and the robot is generated through Python
programming and Eclipse software and it is implemented by using Bluetooth
module HC 06.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 15:09:51 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Kulkarni",
"Devashish",
""
],
[
"Paldhe",
"Sagar",
""
],
[
"Kamat",
"Vinod",
""
]
] |
new_dataset
| 0.979107 |
1506.07459
|
Pierre Minvielle
|
Pierre Minvielle, Pierre Massaloux and Jean-Fran\c{c}ois Giovannelli
|
Fast 3D Synthetic Aperture Radar Imaging from Polarization-Diverse
Measurements
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An innovative 3-D radar imaging technique is developed for fast and efficient
identification and characterization of radar backscattering components of
complex objects, when the collected scattered field is made of
polarization-diverse measurements. In this context, all the polarimetric
information seems irretrievably mixed. A direct model, derived from a simple
but original extension of the widespread "multiple scattering model" leads to a
high dimensional linear inverse problem. It is solved by a fast dedicated
imaging algorithm that performs to determine at a time three huge 3-D scatterer
maps which correspond to HH, VV and HV polarizations at emission and reception.
It is applied successfully to various mock-ups and data sets collected from an
accurate and dedicated 3D spherical experimental layout that provides
concentric polarization-diverse RCS measurements.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 16:37:45 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Minvielle",
"Pierre",
""
],
[
"Massaloux",
"Pierre",
""
],
[
"Giovannelli",
"Jean-François",
""
]
] |
new_dataset
| 0.973379 |
1506.07515
|
Dongsung Huh
|
Dongsung Huh
|
The Vector Space of Convex Curves: How to Mix Shapes
| null | null | null | null |
cs.GR cs.RO math.DG q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel, log-radius profile representation for convex curves and
define a new operation for combining the shape features of curves. Unlike the
standard, angle profile-based methods, this operation accurately combines the
shape features in a visually intuitive manner. This method have implications in
shape analysis as well as in investigating how the brain perceives and
generates curved shapes and motions.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2015 19:56:56 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Huh",
"Dongsung",
""
]
] |
new_dataset
| 0.995028 |
cs/0006047
|
Bernd R. Schlei
|
B. R. Schlei, L. Prasad, A. N. Skourikhine
|
Geometric Morphology of Granular Materials
|
6 pages, 9 figures. For more information visit
http://www.nis.lanl.gov/~bschlei/labvis/index.html
| null |
10.1117/12.404821
|
LA-UR-00-2839
|
cs.CV
| null |
We present a new method to transform the spectral pixel information of a
micrograph into an affine geometric description, which allows us to analyze the
morphology of granular materials. We use spectral and pulse-coupled neural
network based segmentation techniques to generate blobs, and a newly developed
algorithm to extract dilated contours. A constrained Delaunay tesselation of
the contour points results in a triangular mesh. This mesh is the basic
ingredient of the Chodal Axis Transform, which provides a morphological
decomposition of shapes. Such decomposition allows for grain separation and the
efficient computation of the statistical features of granular materials.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2000 22:17:42 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Schlei",
"B. R.",
""
],
[
"Prasad",
"L.",
""
],
[
"Skourikhine",
"A. N.",
""
]
] |
new_dataset
| 0.997348 |
cs/0012021
|
Neil J. Gunther
|
Neil J. Gunther, and Giordano B. Beretta
|
A Benchmark for Image Retrieval using Distributed Systems over the
Internet: BIRDS-I
|
24 pages, To appear in the Proc. SPIE Internet Imaging Conference
2001
| null |
10.1117/12.411898
|
HPL-2000-162
|
cs.IR cs.MM
| null |
The performance of CBIR algorithms is usually measured on an isolated
workstation. In a real-world environment the algorithms would only constitute a
minor component among the many interacting components. The Internet
dramati-cally changes many of the usual assumptions about measuring CBIR
performance. Any CBIR benchmark should be designed from a networked systems
standpoint. These benchmarks typically introduce communication overhead because
the real systems they model are distributed applications. We present our
implementation of a client/server benchmark called BIRDS-I to measure image
retrieval performance over the Internet. It has been designed with the trend
toward the use of small personalized wireless systems in mind. Web-based CBIR
implies the use of heteroge-neous image sets, imposing certain constraints on
how the images are organized and the type of performance metrics applicable.
BIRDS-I only requires controlled human intervention for the compilation of the
image collection and none for the generation of ground truth in the measurement
of retrieval accuracy. Benchmark image collections need to be evolved
incrementally toward the storage of millions of images and that scaleup can
only be achieved through the use of computer-aided compilation. Finally, our
scoring metric introduces a tightly optimized image-ranking window.
|
[
{
"version": "v1",
"created": "Fri, 22 Dec 2000 23:38:37 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Gunther",
"Neil J.",
""
],
[
"Beretta",
"Giordano B.",
""
]
] |
new_dataset
| 0.997766 |
cs/0111020
|
Corinne Boyer
|
C. Boyer, J. Sebag, B. Ellerbroek
|
Gemini MCAO Control System
|
3 pages, ICALPECS 2001, San Jose, California
|
eConf C011127 (2001) TUAT004
|
10.1117/12.454790
| null |
cs.OH
| null |
The Gemini Observatory is planning to implement a Multi Conjugate Adaptive
Optics (MCAO) System as a facility instrument for the Gemini-South telescope.
The system will include 5 Laser Guide Stars, 3 Natural Guide Stars, and 3
Deformable mirrors optically conjugated at different altitudes to achieve
near-uniform atmospheric compensation over a 1 arc minute square field of view.
The control of such a system will be split into 3 main functions: the control
of the opto-mechanical assemblies of the whole system (including the Laser, the
Beam Transfer Optics and the Adaptive Optics bench), the control of the
Adaptive Optics System itself at a rate of 800FPS and the control of the safety
system. The control of the Adaptive Optics System is the most critical in terms
of real time performances. The control system will be an EPICS based system. In
this paper, we will describe the requirements for the whole MCAO control
system, preliminary designs for the control of the opto-mechanical devices and
architecture options for the control of the Adaptive Optics system and the
safety system.
|
[
{
"version": "v1",
"created": "Thu, 8 Nov 2001 22:04:43 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Boyer",
"C.",
""
],
[
"Sebag",
"J.",
""
],
[
"Ellerbroek",
"B.",
""
]
] |
new_dataset
| 0.999167 |
cs/0208014
|
Jim Gray
|
Alexander S. Szalay, Tamas Budavari, Tanu Malika, Jim Gray, Ani
Thakara
|
Web Services for the Virtual Observatory
|
original documents at
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2002-85
|
SIPE Astronomy Telescopes and Instruments, 22-28 August 2002,
Waikoloa, Hawaii
|
10.1117/12.463947
|
MSR-TR-2002-85
|
cs.DC cs.DL
| null |
Web Services form a new, emerging paradigm to handle distributed access to
resources over the Internet. There are platform independent standards (SOAP,
WSDL), which make the developers? task considerably easier. This article
discusses how web services could be used in the context of the Virtual
Observatory. We envisage a multi-layer architecture, with interoperating
services. A well-designed lower layer consisting of simple, standard services
implemented by most data providers will go a long way towards establishing a
modular architecture. More complex applications can be built upon this core
layer. We present two prototype applications, the SdssCutout and the SkyQuery
as examples of this layered architecture.
|
[
{
"version": "v1",
"created": "Wed, 7 Aug 2002 22:58:37 GMT"
}
] | 2015-06-25T00:00:00 |
[
[
"Szalay",
"Alexander S.",
""
],
[
"Budavari",
"Tamas",
""
],
[
"Malika",
"Tanu",
""
],
[
"Gray",
"Jim",
""
],
[
"Thakara",
"Ani",
""
]
] |
new_dataset
| 0.97044 |
1506.06850
|
Yuan Liu Yuan Liu
|
Yuan Liu and Xiaodong Wang
|
Information and Energy Cooperation in OFDM Relaying: Protocols and
Optimization
|
to appear in IEEE TVT
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Integrating power transfer into wireless communications for supporting
simultaneous wireless information and power transfer (SWIPT) is a promising
technique in energy-constrained wireless networks. While most existing work on
SWIPT focuses on capacity-energy characterization, the benefits of cooperative
transmission for SWIPT are much less investigated. In this paper, we consider
SWIPT in an orthogonal frequency-division multiplexing (OFDM) relaying system,
where a source node transfers information and a fraction of power
simultaneously to a relay node, and the relay node uses the harvested power
from the source node to forward the source information to the destination. To
support the simultaneous information and energy cooperation, we first propose a
transmission protocol assuming that the direct link between the source and
destination does not exist, namely power splitting (PS) relaying protocol,
where the relay node splits the received signal power in the first hop into two
separate parts, one for information decoding and the other for energy
harvesting. Then, we consider the case that the direct link between the source
and destination is available, and the transmission mode adaptation (TMA)
protocol is proposed, where the transmission can be completed by cooperative
mode and direct mode simultaneously (over different subcarriers). In direct
mode, when the source transmits signal to the destination, the destination
receives the signal as information and the relay node concurrently receives the
signal for energy harvesting. Joint resource allocation problems are formulated
to maximize the system throughput. By using the Lagrangian dual method, we
develop efficient algorithms to solve the nonconvex optimization problems.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 03:33:38 GMT"
}
] | 2015-06-24T00:00:00 |
[
[
"Liu",
"Yuan",
""
],
[
"Wang",
"Xiaodong",
""
]
] |
new_dataset
| 0.95025 |
1506.06882
|
Xavier Alameda-Pineda
|
Xavier Alameda-Pineda, Jacopo Staiano, Ramanathan Subramanian, Ligia
Batrinca, Elisa Ricci, Bruno Lepri, Oswald Lanz, Nicu Sebe
|
SALSA: A Novel Dataset for Multimodal Group Behavior Analysis
|
14 pages, 11 figures
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/publicdomain/
|
Studying free-standing conversational groups (FCGs) in unstructured social
settings (e.g., cocktail party ) is gratifying due to the wealth of information
available at the group (mining social networks) and individual (recognizing
native behavioral and personality traits) levels. However, analyzing social
scenes involving FCGs is also highly challenging due to the difficulty in
extracting behavioral cues such as target locations, their speaking activity
and head/body pose due to crowdedness and presence of extreme occlusions. To
this end, we propose SALSA, a novel dataset facilitating multimodal and
Synergetic sociAL Scene Analysis, and make two main contributions to research
on automated social interaction analysis: (1) SALSA records social interactions
among 18 participants in a natural, indoor environment for over 60 minutes,
under the poster presentation and cocktail party contexts presenting
difficulties in the form of low-resolution images, lighting variations,
numerous occlusions, reverberations and interfering sound sources; (2) To
alleviate these problems we facilitate multimodal analysis by recording the
social interplay using four static surveillance cameras and sociometric badges
worn by each participant, comprising the microphone, accelerometer, bluetooth
and infrared sensors. In addition to raw data, we also provide annotations
concerning individuals' personality as well as their position, head, body
orientation and F-formation information over the entire event duration. Through
extensive experiments with state-of-the-art approaches, we show (a) the
limitations of current methods and (b) how the recorded multiple cues
synergetically aid automatic analysis of social interactions. SALSA is
available at http://tev.fbk.eu/salsa.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 07:19:24 GMT"
}
] | 2015-06-24T00:00:00 |
[
[
"Alameda-Pineda",
"Xavier",
""
],
[
"Staiano",
"Jacopo",
""
],
[
"Subramanian",
"Ramanathan",
""
],
[
"Batrinca",
"Ligia",
""
],
[
"Ricci",
"Elisa",
""
],
[
"Lepri",
"Bruno",
""
],
[
"Lanz",
"Oswald",
""
],
[
"Sebe",
"Nicu",
""
]
] |
new_dataset
| 0.999822 |
1506.06924
|
Vahan Nanumyan
|
Frank Schweitzer and Vahan Nanumyan and Claudio J. Tessone and Xi Xia
|
How do OSS projects change in number and size? A large-scale analysis to
test a model of project growth
|
22 pages, 10 figures
|
Advs. Complex Syst. 17, 1550008 (2014)
|
10.1142/S0219525915500083
| null |
cs.SE cs.SI nlin.AO physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Established Open Source Software (OSS) projects can grow in size if new
developers join, but also the number of OSS projects can grow if developers
choose to found new projects. We discuss to what extent an established model
for firm growth can be applied to the dynamics of OSS projects. Our analysis is
based on a large-scale data set from SourceForge (SF) consisting of monthly
data for 10 years, for up to 360'000 OSS projects and up to 340'000 developers.
Over this time period, we find an exponential growth both in the number of
projects and developers, with a remarkable increase of single-developer
projects after 2009. We analyze the monthly entry and exit rates for both
projects and developers, the growth rate of established projects and the
monthly project size distribution. To derive a prediction for the latter, we
use modeling assumptions of how newly entering developers choose to either
found a new project or to join existing ones. Our model applies only to
collaborative projects that are deemed to grow in size by attracting new
developers. We verify, by a thorough statistical analysis, that the Yule-Simon
distribution is a valid candidate for the size distribution of collaborative
projects except for certain time periods where the modeling assumptions no
longer hold. We detect and empirically test the reason for this limitation,
i.e., the fact that an increasing number of established developers found
additional new projects after 2009.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 09:42:57 GMT"
}
] | 2015-06-24T00:00:00 |
[
[
"Schweitzer",
"Frank",
""
],
[
"Nanumyan",
"Vahan",
""
],
[
"Tessone",
"Claudio J.",
""
],
[
"Xia",
"Xi",
""
]
] |
new_dataset
| 0.969576 |
1506.06996
|
Hans-Joachim Hof
|
Rainer Falk and Steffen Fries and Hans-Joachim Hof
|
Secure Communication Using Electronic Identity Cards for Voice over IP
Communication, Home Energy Management, and eMobility
| null |
International Journal On Advances in Security, Vol. 3, No. 3 & 4,
ISSN 1942-2636, 2011
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using communication services is a common part of everyday life in a personal
or business context. Communication services include Internet services like
voice services, chat service, and web 2.0 technologies (wikis, blogs, etc), but
other usage areas like home energy management and eMobility are will be
increasingly tackled. Such communication services typically authenticate
participants. For this identities of some kind are used to identify the
communication peer to the user of a service or to the service itself. Calling
line identification used in the Session Initiation Protocol (SIP) used for
Voice over IP (VoIP) is just one example. Authentication and identification of
eCar users for accounting during charging of the eCar is another example. Also,
further mechanisms rely on identities, e.g., whitelists defining allowed
communication peers. Trusted identities prevent identity spoofing, hence are a
basic building block for the protection of communication. However, providing
trusted identities in a practical way is still a difficult problem and too
often application specific identities are used, making identity handling a
hassle. Nowadays, many countries introduced electronic identity cards, e.g.,
the German "Elektronischer Personalausweis" (ePA). As many German citizens will
possess an ePA soon, it can be used as security token to provide trusted
identities. Especially new usage areas (like eMobility) should from the start
be based on the ubiquitous availability of trusted identities. This paper
describes how identity cards can be integrated within three domains: home
energy management, vehicle-2-grid communication, and SIP-based voice over IP
telephony. In all three domains, identity cards are used to reliably identify
users and authenticate participants. As an example for an electronic identity
card, this paper focuses on the German ePA.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 13:47:37 GMT"
}
] | 2015-06-24T00:00:00 |
[
[
"Falk",
"Rainer",
""
],
[
"Fries",
"Steffen",
""
],
[
"Hof",
"Hans-Joachim",
""
]
] |
new_dataset
| 0.980024 |
1506.07031
|
Stefan D\"uck
|
Manfred Droste and Stefan D\"uck
|
Weighted Automata and Logics for Infinite Nested Words
|
LATA 2014, 12 pages
|
Proc. of Language and Automata Theory and Applications (LATA
2014), LNCS 8370, pp. 323-334. Springer (2014)
|
10.1007/978-3-319-04921-2_26
| null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nested words introduced by Alur and Madhusudan are used to capture structures
with both linear and hierarchical order, e.g. XML documents, without losing
valuable closure properties. Furthermore, Alur and Madhusudan introduced
automata and equivalent logics for both finite and infinite nested words, thus
extending B\"uchi's theorem to nested words. Recently, average and discounted
computations of weights in quantitative systems found much interest. Here, we
will introduce and investigate weighted automata models and weighted MSO logics
for infinite nested words. As weight structures we consider valuation monoids
which incorporate average and discounted computations of weights as well as the
classical semirings. We show that under suitable assumptions, two resp. three
fragments of our weighted logics can be transformed into each other. Moreover,
we show that the logic fragments have the same expressive power as weighted
nested word automata.
|
[
{
"version": "v1",
"created": "Tue, 23 Jun 2015 14:39:21 GMT"
}
] | 2015-06-24T00:00:00 |
[
[
"Droste",
"Manfred",
""
],
[
"Dück",
"Stefan",
""
]
] |
new_dataset
| 0.96772 |
1410.1257
|
Abhronil Sengupta
|
Abhronil Sengupta, Sri Harsha Choday, Yusung Kim, and Kaushik Roy
|
Spin Orbit Torque Based Electronic Neuron
| null | null |
10.1063/1.4917011
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A device based on current-induced spin-orbit torque (SOT) that functions as
an electronic neuron is proposed in this work. The SOT device implements an
artificial neuron's thresholding (transfer) function. In the first step of a
two-step switching scheme, a charge current places the magnetization of a
nano-magnet along the hard-axis i.e. an unstable point for the magnet. In the
second step, the SOT device (neuron) receives a current (from the synapses)
which moves the magnetization from the unstable point to one of the two stable
states. The polarity of the synaptic current encodes the excitatory and
inhibitory nature of the neuron input, and determines the final orientation of
the magnetization. A resistive crossbar array, functioning as synapses,
generates a bipolar current that is a weighted sum of the inputs. The
simulation of a two layer feed-forward Artificial Neural Network (ANN) based on
the SOT electronic neuron shows that it consumes ~3X lower power than a 45nm
digital CMOS implementation, while reaching ~80% accuracy in the classification
of one hundred images of handwritten digits from the MNIST dataset.
|
[
{
"version": "v1",
"created": "Mon, 6 Oct 2014 05:36:19 GMT"
}
] | 2015-06-23T00:00:00 |
[
[
"Sengupta",
"Abhronil",
""
],
[
"Choday",
"Sri Harsha",
""
],
[
"Kim",
"Yusung",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.999376 |
1410.2561
|
Yunhe Cao
|
Yun-He Cao and Xiang-Gen Xia
|
IRCI Free MIMO OFDM SAR Using Circularly Shifted Zadoff-Chu Sequences
|
12 pages
| null |
10.1109/LGRS.2014.2385693
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Cyclic prefix (CP) based MIMO-OFDM radar has been recently proposed for
distributed transmit antennas, where there is no inter-range-cell interference
(IRCI). It can collect full spatial diversity and each transmitter transmits
signals with the same frequency band, i.e., the range resolution is not
reduced. However, it needs to transmit multiple OFDM pulses consecutively to
obtain range profiles for a single swath, which may be too long in time for a
reasonable swath width. In this letter, we propose a CP based MIMO-OFDM
synthetic aperture radar (SAR) system, where each transmitter transmits only a
single OFDM pulse to obtain range profiles for a swath and has the same
frequency band, thus the range resolution is not reduced. It is IRCI free and
can collect the full spatial diversity if the transmit antennas are
distributed. Our main idea is to use circularly shifted Zadoff-Chu sequences as
the weighting coefficients in the OFDM pulses for different transmit antennas
and apply spatial filters with multiple receive antennas to divide the whole
swath into multiple subswaths, and then each subswath is reconstructed/imaged
using our proposed IRCI free range reconstruction method.
|
[
{
"version": "v1",
"created": "Sun, 14 Sep 2014 20:47:14 GMT"
}
] | 2015-06-23T00:00:00 |
[
[
"Cao",
"Yun-He",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] |
new_dataset
| 0.998543 |
1412.5027
|
Ali Borji
|
Ali Borji
|
What is a salient object? A dataset and a baseline model for salient
object detection
|
IEEE Transactions on Image Processing, 2014
| null |
10.1109/TIP.2014.2383320
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Salient object detection or salient region detection models, diverging from
fixation prediction models, have traditionally been dealing with locating and
segmenting the most salient object or region in a scene. While the notion of
most salient object is sensible when multiple objects exist in a scene, current
datasets for evaluation of saliency detection approaches often have scenes with
only one single object. We introduce three main contributions in this paper:
First, we take an indepth look at the problem of salient object detection by
studying the relationship between where people look in scenes and what they
choose as the most salient object when they are explicitly asked. Based on the
agreement between fixations and saliency judgments, we then suggest that the
most salient object is the one that attracts the highest fraction of fixations.
Second, we provide two new less biased benchmark datasets containing scenes
with multiple objects that challenge existing saliency models. Indeed, we
observed a severe drop in performance of 8 state-of-the-art models on our
datasets (40% to 70%). Third, we propose a very simple yet powerful model based
on superpixels to be used as a baseline for model evaluation and comparison.
While on par with the best models on MSRA-5K dataset, our model wins over other
models on our data highlighting a serious drawback of existing models, which is
convoluting the processes of locating the most salient object and its
segmentation. We also provide a review and statistical analysis of some labeled
scene datasets that can be used for evaluating salient object detection models.
We believe that our work can greatly help remedy the over-fitting of models to
existing biased datasets and opens new venues for future research in this
fast-evolving field.
|
[
{
"version": "v1",
"created": "Mon, 8 Dec 2014 23:51:50 GMT"
}
] | 2015-06-23T00:00:00 |
[
[
"Borji",
"Ali",
""
]
] |
new_dataset
| 0.9997 |
1506.05313
|
Manish Gupta
|
Krishna Gopal Benerjee and Manish K. Gupta
|
On Dress Codes with Flowers
|
7 pages, updated draft, submitted to conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractional Repetition (FR) codes are well known class of Distributed
Replication-based Simple Storage (Dress) codes for the Distributed Storage
Systems (DSSs). In such systems, the replicas of data packets encoded by
Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of
the available constructions for the FR codes are based on combinatorial designs
and Graph theory. In this work, we propose an elegant sequence based approach
for the construction of the FR code. In particular, we propose a beautiful
class of codes known as Flower codes and study its basic properties.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2015 13:07:20 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Jun 2015 13:18:15 GMT"
}
] | 2015-06-23T00:00:00 |
[
[
"Benerjee",
"Krishna Gopal",
""
],
[
"Gupta",
"Manish K.",
""
]
] |
new_dataset
| 0.992164 |
1506.06440
|
Oliver Knill
|
Oliver Knill
|
The Jordan-Brouwer theorem for graphs
|
26 pages, 1 figure
| null | null | null |
cs.DM cs.CG math.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling
that a (d-1)-sphere H embedded in a d-sphere G defines two different connected
graphs A,B in G such a way that the intersection of A and B is H and the union
is G and such that the complementary graphs A,B are both d-balls. The graph
theoretic definitions are due to Evako: the unit sphere of a vertex x of a
graph G=(V,E) is the graph generated by {y | (x,y) in E} Inductively, a finite
simple graph is called contractible if there is a vertex x such that both its
unit sphere S(x) as well as the graph generated by V-{x} are contractible.
Inductively, still following Evako, a d-sphere is a finite simple graph for
which every unit sphere is a (d-1)-sphere and such that removing a single
vertex renders the graph contractible. A d-ball B is a contractible graph for
which each unit sphere S(x) is either a (d-1)-sphere in which case x is called
an interior point, or S(x) is a (d-1)-ball in which case x is called a boundary
point and such that the set of boundary point vertices generates a
(d-1)-sphere. These inductive definitions are based on the assumption that the
empty graph is the unique (-1)-sphere and that the one-point graph K_1 is the
unique 0-ball and that K_1 is contractible. The theorem needs the following
notion of embedding: a sphere H is embedded in a graph G if it is a sub-graph
of G and if any intersection with any finite set of mutually adjacent unit
spheres is a sphere. A knot of co-dimension k in G is a (d-k)-sphere H embedded
in a d-sphere G.
|
[
{
"version": "v1",
"created": "Mon, 22 Jun 2015 01:52:45 GMT"
}
] | 2015-06-23T00:00:00 |
[
[
"Knill",
"Oliver",
""
]
] |
new_dataset
| 0.998181 |
1506.06558
|
Tang Liu
|
Tang Liu, Daniela Tuninetti, Sae-Young Chung
|
On the DoF region of the two-user Interference Channel with an
Instantaneous Relay
|
Presented in ISIT 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the Degrees of Freedom (DoF) of the two-user multi-antenna
Gaussian interference channel with an {\em instantaneous relay}, or relay
without delay, where the relay transmitted signal in channel use $t$ can depend
on all received signals up to and including that at channel use $t$. It is
assumed that the two transmitters and the two receivers have $M$ antennas,
while the relay receives through $N$ antennas and transmits through $L$
antennas. An achievable DoF region is derived, for all possible values of
$(M,N,L)$, based on a memoryless linear transmission strategy at the relay that
aims to {\it neutralize} as much interference as possible at the receivers. The
proposed scheme is shown to attain the largest sum DoF among all memoryless
linear transmission strategies at the relay and to actually be optimal for
certain values of $(M,N,L)$.
|
[
{
"version": "v1",
"created": "Mon, 22 Jun 2015 11:39:47 GMT"
}
] | 2015-06-23T00:00:00 |
[
[
"Liu",
"Tang",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Chung",
"Sae-Young",
""
]
] |
new_dataset
| 0.999153 |
1506.06668
|
Yoichi Ochiai Prof.
|
Yoichi Ochiai, Kota Kumagai, Takayuki Hoshi, Jun Rekimoto, Satoshi
Hasegawa, and Yoshio Hayasaki
|
Fairy Lights in Femtoseconds: Aerial and Volumetric Graphics Rendered by
Focused Femtosecond Laser Combined with Computational Holographic Fields
| null | null | null | null |
cs.GR cs.HC physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method of rendering aerial and volumetric graphics using
femtosecond lasers. A high-intensity laser excites a physical matter to emit
light at an arbitrary 3D position. Popular applications can then be explored
especially since plasma induced by a femtosecond laser is safer than that
generated by a nanosecond laser. There are two methods of rendering graphics
with a femtosecond laser in air: Producing holograms using spatial light
modulation technology, and scanning of a laser beam by a galvano mirror. The
holograms and workspace of the system proposed here occupy a volume of up to 1
cm^3; however, this size is scalable depending on the optical devices and their
setup. This paper provides details of the principles, system setup, and
experimental evaluation, and discussions on scalability, design space, and
applications of this system. We tested two laser sources: an adjustable (30-100
fs) laser which projects up to 1,000 pulses per second at energy up to 7 mJ per
pulse, and a 269-fs laser which projects up to 200,000 pulses per second at an
energy up to 50 uJ per pulse. We confirmed that the spatiotemporal resolution
of volumetric displays, implemented with these laser sources, is 4,000 and
200,000 dots per second. Although we focus on laser-induced plasma in air, the
discussion presented here is also applicable to other rendering principles such
as fluorescence and microbubble in solid/liquid materials.
|
[
{
"version": "v1",
"created": "Mon, 22 Jun 2015 16:20:34 GMT"
}
] | 2015-06-23T00:00:00 |
[
[
"Ochiai",
"Yoichi",
""
],
[
"Kumagai",
"Kota",
""
],
[
"Hoshi",
"Takayuki",
""
],
[
"Rekimoto",
"Jun",
""
],
[
"Hasegawa",
"Satoshi",
""
],
[
"Hayasaki",
"Yoshio",
""
]
] |
new_dataset
| 0.998806 |
0801.1179
|
Bernard Jacquemin
|
Bernard Jacquemin (ISC, UMR 7044, GERIICO), Sabine Ploux (ISC)
|
Corpus sp{\'e}cialis{\'e} et ressource de sp{\'e}cialit{\'e}
|
16 pages, in French
|
Appears in Fran\c{c}ois Maniez; Pascaline Dury; Nathalie Arlin;
Claire Rougemont. Corpus et dictionnaires de langues de sp{\'e}cialit{\'e},
Presses Universitaires de Granoble, pp.197-212, 2008
| null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
"Semantic Atlas" is a mathematic and statistic model to visualise word senses
according to relations between words. The model, that has been applied to
proximity relations from a corpus, has shown its ability to distinguish word
senses as the corpus' contributors comprehend them. We propose to use the model
and a specialised corpus in order to create automatically a specialised
dictionary relative to the corpus' domain. A morpho-syntactic analysis
performed on the corpus makes it possible to create the dictionary from
syntactic relations between lexical units. The semantic resource can be used to
navigate semantically - and not only lexically - through the corpus, to create
classical dictionaries or for diachronic studies of the language.
|
[
{
"version": "v1",
"created": "Tue, 8 Jan 2008 08:21:26 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Jun 2015 12:22:39 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Jacquemin",
"Bernard",
"",
"ISC, UMR 7044, GERIICO"
],
[
"Ploux",
"Sabine",
"",
"ISC"
]
] |
new_dataset
| 0.989105 |
1406.4067
|
Jonathan Charest
|
Jonathan Charest, Jean-Fran\c{c}ois Beaudoin, Jules Cadorette, Roger
Lecomte, Charles-Antoine Brunet, R\'ejean Fontaine
|
Automatic Channel Fault Detection and Diagnosis System for a Small
Animal APD-Based Digital PET Scanner
|
Results presented at 19th IEEE Real-Time conference
| null |
10.1109/TNS.2014.2346135
| null |
cs.AI nucl-ex
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fault detection and diagnosis is critical to many applications in order to
ensure proper operation and performance over time. Positron emission tomography
(PET) systems that require regular calibrations by qualified scanner operators
are good candidates for such continuous improvements. Furthermore, for scanners
employing one-to-one coupling of crystals to photodetectors to achieve enhanced
spatial resolution and contrast, the calibration task is even more daunting
because of the large number of independent channels involved. To cope with the
additional complexity of the calibration and quality control procedures of
these scanners, an intelligent system (IS) was designed to perform fault
detection and diagnosis (FDD) of malfunctioning channels. The IS can be broken
down into four hierarchical modules: parameter extraction, channel fault
detection, fault prioritization and diagnosis. Of these modules, the first two
have previously been reported and this paper focuses on fault prioritization
and diagnosis. The purpose of the fault prioritization module is to help the
operator to zero in on the faults that need immediate attention. The fault
diagnosis module will then identify the causes of the malfunction and propose
an explanation of the reasons that lead to the diagnosis. The FDD system was
implemented on a LabPET avalanche photodiode (APD)-based digital PET scanner.
Experiments demonstrated a FDD Sensitivity of 99.3 % (with a 95% confidence
interval (CI) of: [98.7, 99.9]) for major faults. Globally, the Balanced
Accuracy of the diagnosis for varying fault severities is 92 %. This suggests
the IS can greatly benefit the operators in their maintenance task.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2014 16:55:16 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Charest",
"Jonathan",
""
],
[
"Beaudoin",
"Jean-François",
""
],
[
"Cadorette",
"Jules",
""
],
[
"Lecomte",
"Roger",
""
],
[
"Brunet",
"Charles-Antoine",
""
],
[
"Fontaine",
"Réjean",
""
]
] |
new_dataset
| 0.991356 |
1406.4748
|
Sanjay Chakraborty
|
Sanjay Majumder, Sanjay Chakraborty and Suman Das
|
A New Advanced User Authentication and Confidentiality Security Service
| null | null |
10.5120/16257-5904
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network & internet security is the burning question of today's world and they
are deeply related to each other for secure successful data transmission.
Network security approach is totally based on the concept of network security
services. In this paper, a new system of network security service is
implemented which is more secure than conventional network security services.
This technique is mainly deals with two essential network security services,
one is user authentication and other is data confidentiality. For user
authentication this paper introduces Graphical Username & Voice Password
approaches which provides better security than conventional username & password
authentication process. In data confidentiality section this paper introduces
two layer private key for both message encryption & decryption which is mainly
applicable on 8 bit plain text data. This paper also provides the hints of
introducing other two network security services (integrity and non-repudiation)
as a future work.
|
[
{
"version": "v1",
"created": "Wed, 18 Jun 2014 14:54:53 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Majumder",
"Sanjay",
""
],
[
"Chakraborty",
"Sanjay",
""
],
[
"Das",
"Suman",
""
]
] |
new_dataset
| 0.988379 |
1406.7623
|
Yongpeng Wu
|
Yongpeng Wu, Shi Jin, Xiqi Gao, Matthew R. McKay, and Chengshan Xiao
|
Transmit Designs for the MIMO Broadcast Channel with Statistical CSI
|
Accepted for IEEE Transaction on Signal Processing
| null |
10.1109/TSP.2014.2336637
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the multiple-input multiple-output broadcast channel with
statistical channel state information available at the transmitter. The
so-called linear assignment operation is employed, and necessary conditions are
derived for the optimal transmit design under general fading conditions. Based
on this, we introduce an iterative algorithm to maximize the linear assignment
weighted sum-rate by applying a gradient descent method. To reduce complexity,
we derive an upper bound of the linear assignment achievable rate of each
receiver, from which a simplified closed-form expression for a near-optimal
linear assignment matrix is derived. This reveals an interesting construction
analogous to that of dirty-paper coding. In light of this, a low complexity
transmission scheme is provided. Numerical examples illustrate the significant
performance of the proposed low complexity scheme.
|
[
{
"version": "v1",
"created": "Mon, 30 Jun 2014 07:38:24 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Wu",
"Yongpeng",
""
],
[
"Jin",
"Shi",
""
],
[
"Gao",
"Xiqi",
""
],
[
"McKay",
"Matthew R.",
""
],
[
"Xiao",
"Chengshan",
""
]
] |
new_dataset
| 0.994092 |
1408.2914
|
Surender Kumar
|
Surender Kumar, Manish Prateek, N.J. Ahuja, Bharat Bhushan
|
DE-LEACH: Distance and Energy Aware LEACH
|
7 pages, 5 figures. available online at http://ijcaonline.org/2014
| null |
10.5120/15384-4072
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Wireless sensor network consists of large number of tiny sensor nodes which
are usually deployed in a harsh environment. Self configuration and
infrastructure less are the two fundamental properties of sensor networks.
Sensor nodes are highly energy constrained devices because they are battery
operated devices and due to harsh environment deployment it is impossible to
change or recharge their battery. Energy conservation and prolonging the
network life are two major challenges in a sensor network. Communication
consumes the large portion of WSN energy. Several protocols have been proposed
to realize power- efficient communication in a wireless sensor network. Cluster
based routing protocols are best known for increasing energy efficiency,
stability and network lifetime of WSNs. Low Energy Adaptive Clustering
Hierarchy (LEACH) is an important protocol in this class. One of the
disadvantages of LEACH is that it does not consider the nodes energy and
distance for the election of cluster head. This paper proposes a new energy
efficient clustering protocol DE-LEACH for homogeneous wireless sensor network
which is an extension of LEACH. DE-LEACH elects cluster head on the basis of
distance and residual energy of the nodes. Proposed protocol increases the
network life, stability and throughput of sensor network and simulations result
shows that DE-LEACH is better than LEACH.
|
[
{
"version": "v1",
"created": "Wed, 13 Aug 2014 05:37:11 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Kumar",
"Surender",
""
],
[
"Prateek",
"Manish",
""
],
[
"Ahuja",
"N. J.",
""
],
[
"Bhushan",
"Bharat",
""
]
] |
new_dataset
| 0.983625 |
1408.3676
|
Andrew Adamatzky
|
Andrew Adamatzky and Richard Mayne
|
Actin automata: Phenomenology and localizations
| null | null |
10.1142/S0218127415500303
| null |
cs.ET nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Actin is a globular protein which forms long filaments in the eukaryotic
cytoskeleton, whose roles in cell function include structural support,
contractile activity to intracellular signalling. We model actin filaments as
two chains of one-dimensional binary-state semi-totalistic automaton arrays to
describe hypothetical signalling events therein. Each node of the actin
automaton takes state `0' (resting) or `1' (excited) and updates its state in
discrete time depending on its neighbour's states. We analyse the complete rule
space of actin automata using integral characteristics of space-time
configurations generated by these rules and compute state transition rules that
support travelling and mobile localizations. Approaches towards selection of
the localisation supporting rules using the global characteristics are
outlined. We find that some properties of actin automata rules may be predicted
using Shannon entropy, activity and incoherence of excitation between the
polymer chains. We also show that it is possible to infer whether a given rule
supports travelling or stationary localizations by looking at ratios of excited
neighbours are essential for generations of the localizations. We conclude by
applying biomolecular hypotheses to this model and discuss the significance of
our findings in context with cell signalling and emergent behaviour in cellular
computation.
|
[
{
"version": "v1",
"created": "Fri, 15 Aug 2014 23:13:54 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
],
[
"Mayne",
"Richard",
""
]
] |
new_dataset
| 0.999807 |
1408.4187
|
Fan Zhang Mr.
|
Fan Zhang, Vincent K. N. Lau
|
Closed-Form Delay-Optimal Power Control for Energy Harvesting Wireless
System with Finite Energy Storage
|
17 pages, 9 figures, 1 table. Accepted for publication in IEEE
Transactions on Signal Processing
| null |
10.1109/TSP.2014.2355777
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider delay-optimal power control for an energy
harvesting wireless system with finite energy storage. The wireless system is
powered solely by a renewable energy source with bursty data arrivals, and is
characterized by a data queue and an energy queue. We consider a delay-optimal
power control problem and formulate an infinite horizon average cost Markov
Decision Process (MDP). To deal with the curse of dimensionality, we introduce
a virtual continuous time system and derive closed-form approximate priority
functions for the discrete time MDP at various operating regimes. Based on the
approximation, we obtain an online power control solution which is adaptive to
the channel state information as well as the data and energy queue state
information. The derived power control solution has a multi-level water-filling
structure, where the water level is determined jointly by the data and energy
queue lengths. We show through simulations that the proposed scheme has
significant performance gain compared with various baselines.
|
[
{
"version": "v1",
"created": "Tue, 19 Aug 2014 01:37:51 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Zhang",
"Fan",
""
],
[
"Lau",
"Vincent K. N.",
""
]
] |
new_dataset
| 0.958222 |
1506.05969
|
Fary Diallo
|
Papa Fary Diallo (WIMMICS), Olivier Corby (WIMMICS), Isabelle Mirbel
(WIMMICS), Moussa Lo, Seydina M. Ndiaye
|
HuTO: an Human Time Ontology for Semantic Web Applications
|
in French. Ing{\'e}nierie des Connaissances 2015, Jul 2015, Rennes,
France. Association Fran\c{c}aise pour Intelligence Artificielle (AFIA)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The temporal phenomena have many facets that are studied by different
communities. In Semantic Web, large heterogeneous data are handled and
produced. These data often have informal, semi-formal or formal temporal
information which must be interpreted by software agents. In this paper we
present Human Time Ontology (HuTO) an RDFS ontology to annotate and represent
temporal data. A major contribution of HuTO is the modeling of non-convex
intervals giving the ability to write queries for this kind of interval. HuTO
also incorporates normalization and reasoning rules to explicit certain
information. HuTO also proposes an approach which associates a temporal
dimension to the knowledge base content. This facilitates information retrieval
by considering or not the temporal aspect.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 12:08:39 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Diallo",
"Papa Fary",
"",
"WIMMICS"
],
[
"Corby",
"Olivier",
"",
"WIMMICS"
],
[
"Mirbel",
"Isabelle",
"",
"WIMMICS"
],
[
"Lo",
"Moussa",
""
],
[
"Ndiaye",
"Seydina M.",
""
]
] |
new_dataset
| 0.984112 |
1506.06038
|
Vitaly Perevoshchikov
|
Manfred Droste and Vitaly Perevoshchikov
|
A Nivat Theorem for Weighted Timed Automata and Weighted Relative
Distance Logic
|
The final version appeared in the Proceedings of the 41st
International Colloquium on Automata, Languages, and Programming (ICALP 2014)
| null |
10.1007/978-3-662-43951-7_15
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Weighted timed automata (WTA) model quantitative aspects of real-time systems
like continuous consumption of memory, power or financial resources. They
accept quantitative timed languages where every timed word is mapped to a
value, e.g., a real number. In this paper, we prove a Nivat theorem for WTA
which states that recognizable quantitative timed languages are exactly those
which can be obtained from recognizable boolean timed languages with the help
of several simple operations. We also introduce a weighted extension of
relative distance logic developed by Wilke, and we show that our weighted
relative distance logic and WTA are equally expressive. The proof of this
result can be derived from our Nivat theorem and Wilke's theorem for relative
distance logic. Since the proof of our Nivat theorem is constructive, the
translation process from logic to automata and vice versa is also constructive.
This leads to decidability results for weighted relative distance logic.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 14:59:41 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Droste",
"Manfred",
""
],
[
"Perevoshchikov",
"Vitaly",
""
]
] |
new_dataset
| 0.998239 |
1506.06039
|
Alexander Dubbs
|
Alexander Dubbs, James Guevara, Darcy S. Peterka, Rafael Yuste
|
moco: Fast Motion Correction for Calcium Imaging
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion correction is the first in a pipeline of algorithms to analyze calcium
imaging videos and extract biologically relevant information, for example the
network structure of the neurons therein. Fast motion correction would be
especially critical for closed-loop activity triggered stimulation experiments,
where accurate detection and targeting of specific cells in necessary. Our
algorithm uses a Fourier-transform approach, and its efficiency derives from a
combination of judicious downsampling and the accelerated computation of many
$L_2$ norms using dynamic programming and two-dimensional, fft-accelerated
convolutions. Its accuracy is comparable to that of established community-used
algorithms, and it is more stable to large translational motions. It is
programmed in Java and is compatible with ImageJ.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 15:03:13 GMT"
}
] | 2015-06-22T00:00:00 |
[
[
"Dubbs",
"Alexander",
""
],
[
"Guevara",
"James",
""
],
[
"Peterka",
"Darcy S.",
""
],
[
"Yuste",
"Rafael",
""
]
] |
new_dataset
| 0.997857 |
1209.4818
|
Noam Presman
|
Noam Presman and Simon Litsyn
|
Recursive Descriptions of Polar Codes
| null | null | null | null |
cs.IT cs.AR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are recursive general concatenated codes. This property motivates
a recursive formalization of the known decoding algorithms: Successive
Cancellation, Successive Cancellation with Lists and Belief Propagation. Using
such description allows an easy development of these algorithms for arbitrary
polarizing kernels. Hardware architectures for these decoding algorithms are
also described in a recursive way, both for Arikan's standard polar codes and
for arbitrary polarizing kernels.
|
[
{
"version": "v1",
"created": "Fri, 21 Sep 2012 13:46:26 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Feb 2015 17:33:30 GMT"
},
{
"version": "v3",
"created": "Thu, 18 Jun 2015 17:22:42 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Presman",
"Noam",
""
],
[
"Litsyn",
"Simon",
""
]
] |
new_dataset
| 0.99781 |
1403.5711
|
Christoph Studer
|
Michael Wu, Bei Yin, Guohui Wang, Chris Dick, Joseph R. Cavallaro,
Christoph Studer
|
Large-Scale MIMO Detection for 3GPP LTE: Algorithms and FPGA
Implementations
|
To appear in the IEEE Journal of Selected Topics in Signal Processing
| null |
10.1109/JSTSP.2014.2313021
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale (or massive) multiple-input multiple-output (MIMO) is expected to
be one of the key technologies in next-generation multi-user cellular systems,
based on the upcoming 3GPP LTE Release 12 standard, for example. In this work,
we propose - to the best of our knowledge - the first VLSI design enabling
high-throughput data detection in single-carrier frequency-division multiple
access (SC-FDMA)-based large-scale MIMO systems. We propose a new approximate
matrix inversion algorithm relying on a Neumann series expansion, which
substantially reduces the complexity of linear data detection. We analyze the
associated error, and we compare its performance and complexity to those of an
exact linear detector. We present corresponding VLSI architectures, which
perform exact and approximate soft-output detection for large-scale MIMO
systems with various antenna/user configurations. Reference implementation
results for a Xilinx Virtex-7 XC7VX980T FPGA show that our designs are able to
achieve more than 600 Mb/s for a 128 antenna, 8 user 3GPP LTE-based large-scale
MIMO system. We finally provide a performance/complexity trade-off comparison
using the presented FPGA designs, which reveals that the detector circuit of
choice is determined by the ratio between BS antennas and users, as well as the
desired error-rate performance.
|
[
{
"version": "v1",
"created": "Sat, 22 Mar 2014 23:57:54 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Wu",
"Michael",
""
],
[
"Yin",
"Bei",
""
],
[
"Wang",
"Guohui",
""
],
[
"Dick",
"Chris",
""
],
[
"Cavallaro",
"Joseph R.",
""
],
[
"Studer",
"Christoph",
""
]
] |
new_dataset
| 0.999034 |
1404.4120
|
He Chen
|
He Chen, Yonghui Li, Joao Luiz Rebelatto, Bartolomeu F.
Uchoa-Filhoand, Branka Vucetic
|
Harvest-Then-Cooperate: Wireless-Powered Cooperative Communications
|
Accepted by IEEE Trans. Signal Processing
| null |
10.1109/TSP.2015.2396009
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we consider a wireless-powered cooperative communication
network consisting of one hybrid access-point (AP), one source, and one relay.
In contrast to conventional cooperative networks, the source and relay in the
considered network have no embedded energy supply. They need to rely on the
energy harvested from the signals broadcasted by the AP for their cooperative
information transmission. Based on this three-node reference model, we propose
a harvest-then-cooperate (HTC) protocol, in which the source and relay harvest
energy from the AP in the downlink and work cooperatively in the uplink for the
source's information transmission. Considering a delay-limited transmission
mode, the approximate closed-form expression for the average throughput of the
proposed protocol is derived over Rayleigh fading channels. Subsequently, this
analysis is extended to the multi-relay scenario, where the approximate
throughput of the HTC protocol with two popular relay selection schemes is
derived. The asymptotic analyses for the throughput performance of the
considered schemes at high signal-to-noise radio are also provided. All
theoretical results are validated by numerical simulations. The impacts of the
system parameters, such as time allocation, relay number, and relay position,
on the throughput performance are extensively investigated.
|
[
{
"version": "v1",
"created": "Wed, 16 Apr 2014 01:01:27 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Mar 2015 05:55:02 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Chen",
"He",
""
],
[
"Li",
"Yonghui",
""
],
[
"Rebelatto",
"Joao Luiz",
""
],
[
"Uchoa-Filhoand",
"Bartolomeu F.",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.972617 |
1404.4467
|
Jan Egger
|
Robert Schwarzenberg, Bernd Freisleben, Christopher Nimsky, Jan Egger
|
Cube-Cut: Vertebral Body Segmentation in MRI-Data through Cubic-Shaped
Divergences
|
23 figures, 2 tables, 43 references, PLoS ONE 9(4): e93389
| null |
10.1371/journal.pone.0093389
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we present a graph-based method using a cubic template for
volumetric segmentation of vertebrae in magnetic resonance imaging (MRI)
acquisitions. The user can define the degree of deviation from a regular cube
via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph
with two terminal nodes (s-t-network), where the nodes of the graph correspond
to a cubic-shaped subset of the image's voxels. The weightings of the graph's
terminal edges, which connect every node with a virtual source s or a virtual
sink t, represent the affinity of a voxel to the vertebra (source) and to the
background (sink). Furthermore, a set of infinite weighted and non-terminal
edges implements the smoothness term. After graph construction, a minimal
s-t-cut is calculated within polynomial computation time, which splits the
nodes into two disjoint units. Subsequently, the segmentation result is
determined out of the source-set. A quantitative evaluation of a C++
implementation of the algorithm resulted in an average Dice Similarity
Coefficient (DSC) of 81.33% and a running time of less than a minute.
|
[
{
"version": "v1",
"created": "Thu, 17 Apr 2014 09:58:28 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jul 2014 17:40:56 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Schwarzenberg",
"Robert",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Nimsky",
"Christopher",
""
],
[
"Egger",
"Jan",
""
]
] |
new_dataset
| 0.997946 |
1404.5916
|
Felix Heide
|
Felix Heide, James Gregson, Gordon Wetzstein, Ramesh Raskar, Wolfgang
Heidrich
|
A Compressive Multi-Mode Superresolution Display
|
Technical report
| null |
10.1364/OE.22.014981
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compressive displays are an emerging technology exploring the co-design of
new optical device configurations and compressive computation. Previously,
research has shown how to improve the dynamic range of displays and facilitate
high-quality light field or glasses-free 3D image synthesis. In this paper, we
introduce a new multi-mode compressive display architecture that supports
switching between 3D and high dynamic range (HDR) modes as well as a new
super-resolution mode. The proposed hardware consists of readily-available
components and is driven by a novel splitting algorithm that computes the pixel
states from a target high-resolution image. In effect, the display pixels
present a compressed representation of the target image that is perceived as a
single, high resolution image.
|
[
{
"version": "v1",
"created": "Wed, 23 Apr 2014 18:04:49 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Heide",
"Felix",
""
],
[
"Gregson",
"James",
""
],
[
"Wetzstein",
"Gordon",
""
],
[
"Raskar",
"Ramesh",
""
],
[
"Heidrich",
"Wolfgang",
""
]
] |
new_dataset
| 0.99122 |
1405.3230
|
Kalyana Babu Nakshatrala
|
S. Karimi, and K. B. Nakshatrala
|
A monolithic multi-time-step computational framework for first-order
transient systems with disparate scales
| null | null |
10.1016/j.cma.2014.10.003
| null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developing robust simulation tools for problems involving multiple
mathematical scales has been a subject of great interest in computational
mathematics and engineering. A desirable feature to have in a numerical
formulation for multiscale transient problems is to be able to employ different
time-steps (multi-time-step coupling), and different time integrators and
different numerical formulations (mixed methods) in different regions of the
computational domain. We present two new monolithic multi-time-step mixed
coupling methods for first-order transient systems. We shall employ unsteady
advection-diffusion-reaction equation with linear decay as the model problem,
which offers several unique challenges in terms of non-self-adjoint spatial
operator and rich features in the solutions. We shall employ the dual Schur
domain decomposition technique to handle the decomposition of domain into
subdomains. Two different methods of enforcing compatibility along the
subdomain interface will be used in the time discrete setting. A systematic
theoretical analysis (which includes numerical stability, influence of
perturbations, bounds on drift along the subdomain interface) will be
performed. The first coupling method ensures that there is no drift along the
subdomain interface but does not facilitate explicit/implicit coupling. The
second coupling method allows explicit/implicit coupling with controlled (but
non-zero) drift in the solution along the subdomain interface. Several
canonical problems will be solved to numerically verify the theoretical
predictions, and to illustrate the overall performance of the proposed coupling
methods. Finally, we shall illustrate the robustness of the proposed coupling
methods using a multi-time-step transient simulation of a fast bimolecular
advective-diffusive-reactive system.
|
[
{
"version": "v1",
"created": "Tue, 13 May 2014 16:53:01 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Aug 2014 04:44:54 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Karimi",
"S.",
""
],
[
"Nakshatrala",
"K. B.",
""
]
] |
new_dataset
| 0.988696 |
1506.05481
|
Przemys{\l}aw Dobrowolski
|
Przemys{\l}aw Dobrowolski
|
Swing-twist decomposition in Clifford algebra
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The swing-twist decomposition is a standard routine in motion planning for
humanoid limbs. In this paper the decomposition formulas are derived and
discussed in terms of Clifford algebra. With the decomposition one can express
an arbitrary spinor as a product of a twist-free spinor and a swing-free spinor
(or vice-versa) in 3-dimensional Euclidean space. It is shown that in the
derived decomposition formula the twist factor is a generalized projection of a
spinor onto a vector in Clifford algebra. As a practical application of the
introduced theory an optimized decomposition algorithm is proposed. It
favourably compares to existing swing-twist decomposition implementations.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2015 20:13:58 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Dobrowolski",
"Przemysław",
""
]
] |
new_dataset
| 0.984468 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.