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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1305.0061
|
Cunsheng Ding
|
Cunsheng Ding and Tor Helleseth
|
Optimal Ternary Cyclic Codes from Monomials
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are a subclass of linear codes and have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. Perfect nonlinear monomials were
employed to construct optimal ternary cyclic codes with parameters $[3^m-1,
3^m-1-2m, 4]$ by Carlet, Ding and Yuan in 2005. In this paper, almost perfect
nonlinear monomials, and a number of other monomials over $\gf(3^m)$ are used
to construct optimal ternary cyclic codes with the same parameters. Nine open
problems on such codes are also presented.
|
[
{
"version": "v1",
"created": "Wed, 1 May 2013 00:46:05 GMT"
}
] | 2013-05-02T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
],
[
"Helleseth",
"Tor",
""
]
] |
new_dataset
| 0.980817 |
1305.0101
|
Pierre Lescanne
|
Pierre Lescanne (LIP)
|
Bubbles are rational
|
Translation of http://hal-ens-lyon.archives-ouvertes.fr/ensl-00646546
| null | null | null |
cs.GT cs.LO q-fin.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As we show using the notion of equilibrium in the theory of infinite
sequential games, bubbles and escalations are rational for economic and
environmental agents, who believe in an infinite world. This goes against a
vision of a self regulating, wise and pacific economy in equilibrium. In other
words, in this context, equilibrium is not a synonymous of stability. We
attempt to draw from this statement methodological consequences and a new
approach to economics. To the mindware of economic agents (a concept due to
cognitive psychology) we propose to add coinduction to properly reason on
infinite games. This way we refine the notion of rationality.
|
[
{
"version": "v1",
"created": "Wed, 1 May 2013 06:24:39 GMT"
}
] | 2013-05-02T00:00:00 |
[
[
"Lescanne",
"Pierre",
"",
"LIP"
]
] |
new_dataset
| 0.994164 |
1304.7819
|
Michael Adrir Scott
|
Michael 'Adrir' Scott
|
Vocalnayno: Designing a Game-Based Intervention to Support Reading
Development in Primary Schools
|
Presented at the 6th European Conference on Games-Based Learning, Oct
4-5, 2012, Cork, Ireland
|
Proceedings of the 6th European Conference on Games-Based
Learning. ACPI: Reading, UK. 654--657
| null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Encouraging children to read frequently and helping them to develop their
reading skills as effectively as possible can be a challenge for some primary
schools. This research questions whether the use of a game-based intervention
can integrate into the existing teaching culture to aid volunteer teaching
assistants in achieving a more significant impact on pupil reading development.
A prototype based on the initial process of requirements gathering is presented
using Multimedia Fusion Developer 2. The design incorporates a game-like
exercise where a foam volcano character releases bubbles containing letters and
words. Pupils must read these aloud in order to burst them open, which is
recorded as a metric of reading ability.
|
[
{
"version": "v1",
"created": "Mon, 29 Apr 2013 23:58:35 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Scott",
"Michael 'Adrir'",
""
]
] |
new_dataset
| 0.989195 |
1304.7842
|
Gobithaasan Rudrusamy
|
R.U. Gobithaasan, J.M. Ali, Kenjiro T. Miura
|
The Logarithmic Curvature Graphs of Generalised Cornu Spirals
| null |
2012 Punjab University Journal of Mathematics, 44, Pg.1-8
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Generalized Cornu Spiral (GCS) was first proposed by Ali et al. in 1995
[9]. Due to the monotonocity of its curvature function, the surface generated
with GCS segments has been considered as a high quality surface and it has
potential applications in surface design [2]. In this paper, the analysis of
GCS segment is carried out by determining its aesthetic value using the log
curvature Graph (LCG) as proposed by Kanaya et al.[10]. The analysis of LCG
supports the claim that GCS is indeed a generalized aesthetic curve.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 03:10:31 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Gobithaasan",
"R. U.",
""
],
[
"Ali",
"J. M.",
""
],
[
"Miura",
"Kenjiro T.",
""
]
] |
new_dataset
| 0.96629 |
1304.7845
|
Gobithaasan Rudrusamy
|
Azhar Ahmad, R.Gobithasan, Jamaluddin Md.Ali
|
G2 Transition curve using Quartic Bezier Curve
| null |
2007 Computer Graphics, Imaging and Visualization CGIV 2007, Pg.
223-228
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A method to construct transition curves using a family of the quartic Bezier
spiral is described. The transition curves discussed are S-shape and C-shape of
contact, between two separated circles. A spiral is a curve of monotone
increasing or monotone decreasing curvature of one sign. Thus, a spiral cannot
have an inflection point or curvature extreme. The family of quartic Bezier
spiral form which is introduced has more degrees of freedom and will give a
better approximation. It is proved that the methods of constructing transition
curves can be simplified by the transformation process and the ratio of two
radii has no restriction, which extends the application area, and it gives a
family of transition curves that allow more flexible curve designs.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 03:28:07 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Ahmad",
"Azhar",
""
],
[
"Gobithasan",
"R.",
""
],
[
"Ali",
"Jamaluddin Md.",
""
]
] |
new_dataset
| 0.980416 |
1304.7856
|
EPTCS
|
Caleb Eggensperger
|
Proof Pad: A New Development Environment for ACL2
|
In Proceedings ACL2 2013, arXiv:1304.7123
|
EPTCS 114, 2013, pp. 13-28
|
10.4204/EPTCS.114.2
| null |
cs.SE cs.HC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most software development projects rely on Integrated Development
Environments (IDEs) based on the desktop paradigm, with an interactive,
mouse-driven user interface. The standard installation of ACL2, on the other
hand, is designed to work closely with Emacs. ACL2 experts, on the whole, like
this mode of operation, but students and other new programmers who have learned
to program with desktop IDEs often react negatively to the process of adapting
to an unfamiliar form of interaction.
This paper discusses Proof Pad, a new IDE for ACL2. Proof Pad is not the only
attempt to provide ACL2 IDEs catering to students and beginning programmers.
The ACL2 Sedan and DrACuLa systems arose from similar motivations. Proof Pad
builds on the work of those systems, while also taking into account the unique
workflow of the ACL2 theorem proving system.
The design of Proof Pad incorporated user feedback from the outset, and that
process continued through all stages of development. Feedback took the form of
direct observation of users interacting with the IDE as well as questionnaires
completed by users of Proof Pad and other ACL2 IDEs. The result is a
streamlined interface and fast, responsive system that supports using ACL2 as a
programming language and a theorem proving system. Proof Pad also provides a
property-based testing environment with random data generation and automated
interpretation of properties as ACL2 theorem definitions.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 04:14:06 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Eggensperger",
"Caleb",
""
]
] |
new_dataset
| 0.995245 |
1304.7860
|
EPTCS
|
Lucas Helms (University of Wyoming), Ruben Gamboa (University of
Wyoming)
|
An Interpreter for Quantum Circuits
|
In Proceedings ACL2 2013, arXiv:1304.7123
|
EPTCS 114, 2013, pp. 85-94
|
10.4204/EPTCS.114.7
| null |
cs.LO quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes an ACL2 interpreter for "netlists" describing quantum
circuits. Several quantum gates are implemented, including the Hadamard gate H,
which rotates vectors by 45 degrees, necessitating the use of irrational
numbers, at least at the logical level. Quantum measurement presents an
especially difficult challenge, because it requires precise comparisons of
irrational numbers and the use of random numbers. This paper does not address
computation with irrational numbers or the generation of random numbers,
although future work includes the development of pseudo-random generators for
ACL2.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 04:14:37 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Helms",
"Lucas",
"",
"University of Wyoming"
],
[
"Gamboa",
"Ruben",
"",
"University of\n Wyoming"
]
] |
new_dataset
| 0.998615 |
1304.7875
|
EPTCS
|
Sebastiaan J. C. Joosten, Bernard van Gastel, Julien Schmaltz
|
A Macro for Reusing Abstract Functions and Theorems
|
In Proceedings ACL2 2013, arXiv:1304.7123
|
EPTCS 114, 2013, pp. 29-41
|
10.4204/EPTCS.114.3
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Even though the ACL2 logic is first order, the ACL2 system offers several
mechanisms providing users with some operations akin to higher order logic
ones. In this paper, we propose a macro, named instance-of-defspec, to ease the
reuse of abstract functions and facts proven about them. Defspec is an ACL2
book allowing users to define constrained functions and their associated
properties. It contains macros facilitating the definition of such abstract
specifications and instances thereof. Currently, lemmas and theorems derived
from these abstract functions are not automatically instantiated. This is
exactly the purpose of our new macro. instance-of-defspec will not only
instantiate functions and theorems within a specification but also many more
functions and theorems built on top of the specification. As a working example,
we describe various fold functions over monoids, which we gradually built from
arbitrary functions.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 04:43:47 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Joosten",
"Sebastiaan J. C.",
""
],
[
"van Gastel",
"Bernard",
""
],
[
"Schmaltz",
"Julien",
""
]
] |
new_dataset
| 0.996862 |
1304.7881
|
Gobithaasan Rudrusamy
|
R.U. Gobithaasan
|
Various Types of Aesthetic Curves
| null |
2011 The Proceedings of Seminar Bidang Kepakaran Jabatan Matematik
2010, Cherating, Pahang. Disember 27th- 30th 2010, Pg.9-22
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The research on developing planar curves to produce visually pleasing
products (ranges from electric appliances to car body design) and
indentifying/modifying planar curves for special purposes namely for railway
design, highway design and robot trajectories have been progressing since
1970s. The pattern of research in this field of study has branched to five
major groups namely curve synthesis, fairing process, improvement in control of
natural spiral, construction of new type of planar curves and, natural spiral
fitting & approximation techniques. The purpose of is this paper is to briefly
review recent progresses in Computer Aided Geometric Design (CAGD) focusing on
the topics states above.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 05:25:31 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Gobithaasan",
"R. U.",
""
]
] |
new_dataset
| 0.981017 |
1304.7993
|
Romain Absil
|
Romain Absil and Hadrien M\'elot
|
Digenes: genetic algorithms to discover conjectures about directed and
undirected graphs
|
17 Pages, 2 Figures, 2 Tables
| null | null | null |
cs.DM cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Digenes, a new discovery system that aims to help researchers in
graph theory. While its main task is to find extremal graphs for a given
(function of) invariants, it also provides some basic support in proof
conception. This has already been proved to be very useful to find new
conjectures since the AutoGraphiX system of Caporossi and Hansen (Discrete
Math. 212-2000). However, unlike existing systems, Digenes can be used both
with directed or undirected graphs. In this paper, we present the principles
and functionality of Digenes, describe the genetic algorithms that have been
designed to achieve them, and give some computational results and open
questions. This do arise some interesting questions regarding genetic
algorithms design particular to this field, such as crossover definition.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 13:34:09 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Absil",
"Romain",
""
],
[
"Mélot",
"Hadrien",
""
]
] |
new_dataset
| 0.992628 |
1304.8028
|
Rafik Zitouni
|
Rafik Zitouni, Stefan Ataman, Marie Mathian and Laurent George
|
IEEE 802.15.4 transceiver for the 868/915 MHz band using Software
Defined Radio
|
6 pages
|
Proceedings of SDR'12-WInnComm-Europe, 27-29 June 2012
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper reports an implementation of the PHY specifications of the IEEE
802.15.4 standard for the frequency band 868 915 MHz on a Software Defined
Radio (SDR) platform. This standard is defined for low power, low data rate and
low cost wireless networks. These specifications are used by the Zigbee
technology for various applications such as home automation, industry
monitoring or medical surveillance. Several hardware PHY 868/915 MHz band IEEE
802.15.4 transceiver implementations have been already reported on ASIC and FPG
[1] [2]. SDR offers one possibility to realize a transceiver with high
flexibility and reconfigurability [3]. The whole transmitter and receiver chain
has been defined in software using the GNU Radio software project [4] and the
USRP (Universal Software Radio Peripheral) platform from Ettus Research [5].
Two new blocks have been added to the GNU Radio project, one for the Direct
Sequence Spread Spectrum and the second for the reconstruction of the packets.
The experimentations have been performed in a noisy environment and the PER,
BER and SNR have been computed. The obtained results are coherent with what can
be expected from the theory.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 15:16:10 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Zitouni",
"Rafik",
""
],
[
"Ataman",
"Stefan",
""
],
[
"Mathian",
"Marie",
""
],
[
"George",
"Laurent",
""
]
] |
new_dataset
| 0.994208 |
1304.8109
|
Ronald Petrlic
|
Ronald Petrlic and Stephan Sekula
|
Unlinkable content playbacks in a multiparty DRM system
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a solution to the problem of privacy invasion in a multiparty
digital rights management scheme. (Roaming) users buy content licenses from a
content provider and execute it at any nearby content distributor. Our
approach, which does not need any trusted third party--in contrast to most
related work on privacy-preserving DRM--is based on a re-encryption scheme that
runs on any mobile Android device. Only a minor security-critical part needs to
be performed on the device's smartcard which could, for instance, be a SIM
card.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 18:41:08 GMT"
}
] | 2013-05-01T00:00:00 |
[
[
"Petrlic",
"Ronald",
""
],
[
"Sekula",
"Stephan",
""
]
] |
new_dataset
| 0.997655 |
1107.5638
|
Igor Melatti
|
Federico Mari, Igor Melatti, Ivano Salvo, Enrico Tronci
|
Model Based Synthesis of Control Software from System Level Formal
Specifications
|
Accepted for publication by ACM Transactions on Software Engineering
and Methodology (TOSEM)
| null | null | null |
cs.SE cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many Embedded Systems are indeed Software Based Control Systems, that is
control systems whose controller consists of control software running on a
microcontroller device. This motivates investigation on Formal Model Based
Design approaches for automatic synthesis of embedded systems control software.
We present an algorithm, along with a tool QKS implementing it, that from a
formal model (as a Discrete Time Linear Hybrid System) of the controlled system
(plant), implementation specifications (that is, number of bits in the
Analog-to-Digital, AD, conversion) and System Level Formal Specifications (that
is, safety and liveness requirements for the closed loop system) returns
correct-by-construction control software that has a Worst Case Execution Time
(WCET) linear in the number of AD bits and meets the given specifications.
We show feasibility of our approach by presenting experimental results on
using it to synthesize control software for a buck DC-DC converter, a widely
used mixed-mode analog circuit, and for the inverted pendulum.
|
[
{
"version": "v1",
"created": "Thu, 28 Jul 2011 07:38:41 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Sep 2011 09:06:14 GMT"
},
{
"version": "v3",
"created": "Sat, 27 Apr 2013 14:53:09 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Mari",
"Federico",
""
],
[
"Melatti",
"Igor",
""
],
[
"Salvo",
"Ivano",
""
],
[
"Tronci",
"Enrico",
""
]
] |
new_dataset
| 0.98884 |
1206.1899
|
Rajeev Shakya PhD Scholar
|
Rajeev K. Shakya
|
TTMA: Traffic-adaptive Time-division Multiple Access Protocol Wireless
Sensor Networks
|
This paper has been withdrawn by arXiv. arXiv admin note: author list
truncated due to disputed authorship and content. This submission repeats
large portions of text from
http://www.cse.msu.edu/~lxiao/publications/TATD_MAC.pdf by other authors
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper has been withdrawn by arXiv. arXiv admin note: author list
truncated due to disputed authorship and content. This submission repeats large
portions of text from this http URL by other authors. Duty cycle mode in WSN
improves energy-efficiency, but also introduces packet delivery latency.
Several duty-cycle based MAC schemes have been proposed to reduce latency, but
throughput is limited by duty-cycled scheduling performance. In this paper, a
Traffic-adaptive Time-division Multiple Access (TTMA), a distributed TDMA-based
MAC protocol is introduced to improves the throughput by traffic-adaptive
time-slot scheduling that increases the channel utilisation efficiency. The
proposed time-slot scheduling method first avoids time-slots assigned to nodes
with no traffic through fast traffic notification. It then achieves better
channel utilisation among nodes having traffic through an ordered schedule
negotiation scheme. By decomposing traffic notification and data transmission
scheduling into two phases leads each phase to be simple and efficient. The
performance evaluation shows that the two-phase design significantly improves
the throughput and outperforms the time division multiple access (TDMA) control
with slot stealing.
|
[
{
"version": "v1",
"created": "Sat, 9 Jun 2012 02:06:59 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Jun 2012 02:04:02 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Aug 2012 06:46:12 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Shakya",
"Rajeev K.",
""
]
] |
new_dataset
| 0.998647 |
1301.0427
|
Yu. I. Manin
|
Yuri I. Manin
|
Zipf's law and L. Levin's probability distributions
|
19 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Zipf's law in its basic incarnation is an empirical probability distribution
governing the frequency of usage of words in a language. As Terence Tao
recently remarked, it still lacks a convincing and satisfactory mathematical
explanation.
In this paper I suggest that at least in certain situations, Zipf's law can
be explained as a special case of the a priori distribution introduced and
studied by L. Levin. The Zipf ranking corresponding to diminishing probability
appears then as the ordering determined by the growing Kolmogorov complexity.
One argument justifying this assertion is the appeal to a recent
interpretation by Yu. Manin and M. Marcolli of asymptotic bounds for
error--correcting codes in terms of phase transition. In the respective
partition function, Kolmogorov complexity of a code plays the role of its
energy.
This version contains minor corrections and additions.
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2013 11:47:07 GMT"
},
{
"version": "v2",
"created": "Sun, 28 Apr 2013 15:46:38 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Manin",
"Yuri I.",
""
]
] |
new_dataset
| 0.992226 |
1304.1672
|
Daniele Loiacono
|
Daniele Loiacono and Luigi Cardamone and Pier Luca Lanzi
|
Simulated Car Racing Championship: Competition Software Manual
| null | null | null | null |
cs.AI cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This manual describes the competition software for the Simulated Car Racing
Championship, an international competition held at major conferences in the
field of Evolutionary Computation and in the field of Computational
Intelligence and Games. It provides an overview of the architecture, the
instructions to install the software and to run the simple drivers provided in
the package, the description of the sensors and the actuators.
|
[
{
"version": "v1",
"created": "Fri, 5 Apr 2013 10:42:14 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Apr 2013 10:17:33 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Loiacono",
"Daniele",
""
],
[
"Cardamone",
"Luigi",
""
],
[
"Lanzi",
"Pier Luca",
""
]
] |
new_dataset
| 0.993626 |
1304.7294
|
Rushikesh Shreshtha
|
Rushikesh B. Shreshtha, Rajeswari Goudar
|
Self Configurable Re-link Establishment using Continuous Neighbor
Discovery in Asynchronous Sensor Networks
| null |
http://ijcsn.org/IJCSN-2012/1-6/IJCSN-2012-1-6-28.pdf
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Sensor network generally has a large number of sensor nodes that are
deployed at some audited site. In most sensor networks the nodes are static.
Nevertheless, node connectivity is subject to changes because of disruptions in
wireless communication, transmission power changes, or loss of synchronization
between neighbouring nodes, so there is a need to maintain synchronization
between the neighbouring nodes in order to have efficient communication. Hence
even after a sensor is aware of its immediate neighbours, it must continuously
maintain its view a process we call continuous neighbour discovery. In this
proposed work we are maintaining synchronization between neighbouring nodes so
that the sensor network will be always active.
|
[
{
"version": "v1",
"created": "Fri, 26 Apr 2013 22:10:05 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Shreshtha",
"Rushikesh B.",
""
],
[
"Goudar",
"Rajeswari",
""
]
] |
new_dataset
| 0.9914 |
1304.7399
|
Jared Glover
|
Jared Glover and Sanja Popovic
|
Bingham Procrustean Alignment for Object Detection in Clutter
|
Submitted to IROS 2013
| null | null | null |
cs.CV cs.RO stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new system for object detection in cluttered RGB-D images is presented. Our
main contribution is a new method called Bingham Procrustean Alignment (BPA) to
align models with the scene. BPA uses point correspondences between oriented
features to derive a probability distribution over possible model poses. The
orientation component of this distribution, conditioned on the position, is
shown to be a Bingham distribution. This result also applies to the classic
problem of least-squares alignment of point sets, when point features are
orientation-less, and gives a principled, probabilistic way to measure pose
uncertainty in the rigid alignment problem. Our detection system leverages BPA
to achieve more reliable object detections in clutter.
|
[
{
"version": "v1",
"created": "Sat, 27 Apr 2013 19:24:30 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Glover",
"Jared",
""
],
[
"Popovic",
"Sanja",
""
]
] |
new_dataset
| 0.994074 |
1304.7429
|
Parisa Mansourifard
|
Negin Golrezaei, Parisa Mansourifard, Andreas F. Molisch, Alexandros
G. Dimakis
|
Base-Station Assisted Device-to-Device Communications for
High-Throughput Wireless Video Networks
|
28 pages, 16 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new scheme for increasing the throughput of video files in
cellular communications systems. This scheme exploits (i) the redundancy of
user requests as well as (ii) the considerable storage capacity of smartphones
and tablets. Users cache popular video files and - after receiving requests
from other users - serve these requests via device-to-device localized
transmissions. The file placement is optimal when a central control knows a
priori the locations of wireless devices when file requests occur. However,
even a purely random caching scheme shows only a minor performance loss
compared to such a genie-aided scheme. We then analyze the optimal
collaboration distance, trading off frequency reuse with the probability of
finding a requested file within the collaboration distance. We show that an
improvement of spectral efficiency of one to two orders of magnitude is
possible, even if there is not very high redundancy in video requests.
|
[
{
"version": "v1",
"created": "Sun, 28 Apr 2013 05:23:41 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Golrezaei",
"Negin",
""
],
[
"Mansourifard",
"Parisa",
""
],
[
"Molisch",
"Andreas F.",
""
],
[
"Dimakis",
"Alexandros G.",
""
]
] |
new_dataset
| 0.999811 |
1304.7451
|
Bhavani Anantapur
|
A B Bhavani
|
Cross-site Scripting Attacks on Android WebView
| null |
Bhavani A B, Cross-site Scripting Attacks on Android WebView,IJCSN
International Journal of Computer Science and Network, Vol 2, Issue 2, April
2013, ISSN:2277-5420
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WebView is an essential component in Android and iOS. It enables applications
to display content from on-line resources. It simplifies task of performing a
network request, parsing the data and rendering it. WebView uses a number of
APIs which can interact with the web contents inside WebView. In the current
paper, Cross-site scripting attacks or XSS attacks specific to Android WebView
are discussed. Cross site scripting (XSS) is a type of vulnerability commonly
found in web applications. This vulnerability makes it possible for attackers
to run malicious code into victim's WebView,through HttpClient APIs. Using this
malicious code, the attackers can steal the victim's credentials, such as
cookies. The access control policies (that is,the same origin policy) employed
by the browser to protect those credentials can be bypassed by exploiting the
XSS vulnerability.
|
[
{
"version": "v1",
"created": "Sun, 28 Apr 2013 10:27:56 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Bhavani",
"A B",
""
]
] |
new_dataset
| 0.999575 |
1304.7576
|
Preyas Popat
|
Rina Panigrahy and Preyas Popat
|
Fractal structures in Adversarial Prediction
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractals are self-similar recursive structures that have been used in
modeling several real world processes. In this work we study how "fractal-like"
processes arise in a prediction game where an adversary is generating a
sequence of bits and an algorithm is trying to predict them. We will see that
under a certain formalization of the predictive payoff for the algorithm it is
most optimal for the adversary to produce a fractal-like sequence to minimize
the algorithm's ability to predict. Indeed it has been suggested before that
financial markets exhibit a fractal-like behavior. We prove that a fractal-like
distribution arises naturally out of an optimization from the adversary's
perspective.
In addition, we give optimal trade-offs between predictability and expected
deviation (i.e. sum of bits) for our formalization of predictive payoff. This
result is motivated by the observation that several time series data exhibit
higher deviations than expected for a completely random walk.
|
[
{
"version": "v1",
"created": "Mon, 29 Apr 2013 07:16:54 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Panigrahy",
"Rina",
""
],
[
"Popat",
"Preyas",
""
]
] |
new_dataset
| 0.986063 |
1304.7600
|
Piotr Beling
|
Piotr Beling
|
C++11 - okre\'slanie typ\'ow
|
6 pages, in Polish
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a review of some new futures introduced to C++ language
by ISO/IEC 14882:2011 standard (known as C++11). It describes new language
elements which allow to easier expressed of types of variables: auto and
decltype keywords, new function declaration syntax, and tools which are
included in type_traits header.
-----
Niniejszy artyku{\l} jest jednym z serii artyku{\l}\'ow w kt\'orych zawarto
przegl{\ka}d nowych element\'ow j{\ke}zyka C++ wprowadzonych przez standard
ISO/IEC 14882:2011, znany pod nazw{\ka} C++11. W artykule przedstawiono nowe
mo\.zliwo\'sci zwi{\ka}zane ze wskazywaniem typ\'ow zmiennych. Opisano s{\l}owa
kluczowe auto i decltype, now{\ka} sk{\l}adnie deklarowania funkcji/metod oraz
narz{\ke}dzia zawarte w pliku nag{\l}\'owkowym <type_traits>.
|
[
{
"version": "v1",
"created": "Mon, 29 Apr 2013 09:30:33 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Beling",
"Piotr",
""
]
] |
new_dataset
| 0.99946 |
1304.7615
|
Adrian Jackson
|
Adrian Jackson, Par Strand
|
MDMP: Managed Data Message Passing
|
Submitted to SC13, 10 pages, 5 figures
| null | null | null |
cs.DC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MDMP is a new parallel programming approach that aims to provide users with
an easy way to add parallelism to programs, optimise the message passing costs
of traditional scientific simulation algorithms, and enable existing MPI-based
parallel programs to be optimised and extended without requiring the whole code
to be re-written from scratch. MDMP utilises a directives based approach to
enable users to specify what communications should take place in the code, and
then implements those communications for the user in an optimal manner using
both the information provided by the user and data collected from instrumenting
the code and gathering information on the data to be communicated. This work
will present the basic concepts and functionality of MDMP and discuss the
performance that can be achieved using our prototype implementation of MDMP on
some model scientific simulation applications.
|
[
{
"version": "v1",
"created": "Mon, 29 Apr 2013 10:35:48 GMT"
}
] | 2013-04-30T00:00:00 |
[
[
"Jackson",
"Adrian",
""
],
[
"Strand",
"Par",
""
]
] |
new_dataset
| 0.989338 |
1211.4047
|
Garth Wells
|
Martin S. Alnaes and Anders Logg and Kristian B. Oelgaard and Marie E.
Rognes and Garth N. Wells
|
Unified Form Language: A domain-specific language for weak formulations
of partial differential equations
|
To appear in ACM Transactions on Mathematical Software
| null | null | null |
cs.MS cs.NA cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Unified Form Language (UFL), which is a domain-specific
language for representing weak formulations of partial differential equations
with a view to numerical approximation. Features of UFL include support for
variational forms and functionals, automatic differentiation of forms and
expressions, arbitrary function space hierarchies for multi-field problems,
general differential operators and flexible tensor algebra. With these
features, UFL has been used to effortlessly express finite element methods for
complex systems of partial differential equations in near-mathematical
notation, resulting in compact, intuitive and readable programs. We present in
this work the language and its construction. An implementation of UFL is freely
available as an open-source software library. The library generates abstract
syntax tree representations of variational problems, which are used by other
software libraries to generate concrete low-level implementations. Some
application examples are presented and libraries that support UFL are
highlighted.
|
[
{
"version": "v1",
"created": "Fri, 16 Nov 2012 21:56:02 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Apr 2013 20:18:09 GMT"
}
] | 2013-04-29T00:00:00 |
[
[
"Alnaes",
"Martin S.",
""
],
[
"Logg",
"Anders",
""
],
[
"Oelgaard",
"Kristian B.",
""
],
[
"Rognes",
"Marie E.",
""
],
[
"Wells",
"Garth N.",
""
]
] |
new_dataset
| 0.999585 |
1304.7054
|
Chetan Jhurani
|
Chetan Jhurani
|
Batched Kronecker product for 2-D matrices and 3-D arrays on NVIDIA GPUs
| null | null | null | null |
cs.MS cs.DC math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an interface and an implementation for performing Kronecker
product actions on NVIDIA GPUs for multiple small 2-D matrices and 3-D arrays
processed in parallel as a batch. This method is suited to cases where the
Kronecker product component matrices are identical but the operands in a
matrix-free application vary in the batch. Any batched GEMM (General Matrix
Multiply) implementation, for example ours [1] or the one in cuBLAS, can also
be used for performing batched Kronecker products on GPUs. However, the
specialized implementation presented here is faster and uses less memory.
Partly this is because a simple GEMM based approach would require extra copies
to and from main memory. We focus on matrix sizes less than or equal to 16,
since these are the typical polynomial degrees in Finite Elements, but the
implementation can be easily extended for other sizes. We obtain 143 and 285
GFlop/s for single precision real when processing matrices of size 10 and 16,
respectively on NVIDIA Tesla K20c using CUDA 5.0. The corresponding speeds for
3-D array Kronecker products are 126 and 268 GFlop/s, respectively. Double
precision is easily supported using the C++ template mechanism.
|
[
{
"version": "v1",
"created": "Fri, 26 Apr 2013 02:22:25 GMT"
}
] | 2013-04-29T00:00:00 |
[
[
"Jhurani",
"Chetan",
""
]
] |
new_dataset
| 0.990256 |
1304.7123
|
EPTCS
|
Ruben Gamboa (University of Wyoming, USA), Jared Davis (Centaur
Technology, USA)
|
Proceedings International Workshop on the ACL2 Theorem Prover and its
Applications
| null |
EPTCS 114, 2013
|
10.4204/EPTCS.114
| null |
cs.LO cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the Eleventh International Workshop
on the ACL2 Theorem Prover and its Applications, held on May 30 and 31, 2013,
in Laramie, Wyoming, USA.
ACL2 is an industrial-strength automated reasoning system, the latest in the
Boyer-Moore family of theorem provers. The ACL2 workshop is the major technical
forum for users of the ACL2 theorem proving system to present research on the
prover and its applications.
This year's workshop received 15 submissions covering a wide range of
applications, libraries, prover enhancements, interfaces, and experience
reports. 11 papers were selected by the program committee for presentation at
the workshop.
|
[
{
"version": "v1",
"created": "Fri, 26 Apr 2013 10:59:21 GMT"
}
] | 2013-04-29T00:00:00 |
[
[
"Gamboa",
"Ruben",
"",
"University of Wyoming, USA"
],
[
"Davis",
"Jared",
"",
"Centaur\n Technology, USA"
]
] |
new_dataset
| 0.995377 |
1304.7124
|
Arshiya Begum
|
Arshiya Begum and Mohammed Tanveer Ali
|
Security threats in Prepaid Mobile
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
Recent communications environment significantly expand the mobile
environment. Prepaid mobile services for 3G networks enables telecommunication
to sign up new users by utilizing the latest in converged billing technologies.
The worldwide mobile communication market is exploding, and 50 percent of
subscribers are expected to use prepaid billing . Prepaid services are driving
mobile communication into emerging markets such as South America, Eastern
Europe, Asia, Africa and Gulf Countries. Prepaid phone service requires a user
to make payment before calling. It is quite common to get prepaid SIM cards on
every major Network. This paper discuss about various prepaid techniques,
challenges and countermeasures in prepaid mobile communication system .
|
[
{
"version": "v1",
"created": "Fri, 26 Apr 2013 11:04:18 GMT"
}
] | 2013-04-29T00:00:00 |
[
[
"Begum",
"Arshiya",
""
],
[
"Ali",
"Mohammed Tanveer",
""
]
] |
new_dataset
| 0.996174 |
1304.7140
|
Michael Helmberger Michael Helmberger
|
M. Helmberger, M. Urschler, M. Pienn, Z.Balint, A. Olschewski and H.
Bischof
|
Pulmonary Vascular Tree Segmentation from Contrast-Enhanced CT Images
|
Part of the OAGM/AAPR 2013 proceedings (1304.1876)
| null | null |
OAGM-AAPR/2013/09
|
cs.CV physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a pulmonary vessel segmentation algorithm, which is fast, fully
automatic and robust. It uses a coarse segmentation of the airway tree and a
left and right lung labeled volume to restrict a vessel enhancement filter,
based on an offset medialness function, to the lungs. We show the application
of our algorithm on contrast-enhanced CT images, where we derive a clinical
parameter to detect pulmonary hypertension (PH) in patients. Results on a
dataset of 24 patients show that quantitative indices derived from the
segmentation are applicable to distinguish patients with and without PH.
Further work-in-progress results are shown on the VESSEL12 challenge dataset,
which is composed of non-contrast-enhanced scans, where we range in the
midfield of participating contestants.
|
[
{
"version": "v1",
"created": "Fri, 26 Apr 2013 12:30:36 GMT"
}
] | 2013-04-29T00:00:00 |
[
[
"Helmberger",
"M.",
""
],
[
"Urschler",
"M.",
""
],
[
"Pienn",
"M.",
""
],
[
"Balint",
"Z.",
""
],
[
"Olschewski",
"A.",
""
],
[
"Bischof",
"H.",
""
]
] |
new_dataset
| 0.999787 |
1304.7209
|
Roland Kindermann
|
Roland Kindermann, Tommi Junttila, Ilkka Niemel\"a
|
Bounded Model Checking of an MITL Fragment for Timed Automata
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Timed automata (TAs) are a common formalism for modeling timed systems.
Bounded model checking (BMC) is a verification method that searches for runs
violating a property using a SAT or SMT solver. MITL is a real-time extension
of the linear time logic LTL. Originally, MITL was defined for traces of
non-overlapping time intervals rather than the "super-dense" time traces
allowing for intervals overlapping in single points that are employed by the
nowadays common semantics of timed automata. In this paper we extend the
semantics of a fragment of MITL to super-dense time traces and devise a bounded
model checking encoding for the fragment. We prove correctness and completeness
in the sense that using a sufficiently large bound a counter-example to any
given non-holding property can be found. We have implemented the proposed
bounded model checking approach and experimentally studied the efficiency and
scalability of the implementation.
|
[
{
"version": "v1",
"created": "Fri, 26 Apr 2013 15:52:38 GMT"
}
] | 2013-04-29T00:00:00 |
[
[
"Kindermann",
"Roland",
""
],
[
"Junttila",
"Tommi",
""
],
[
"Niemelä",
"Ilkka",
""
]
] |
new_dataset
| 0.979109 |
1304.6898
|
Clemens Wiltsche
|
Clemens Wiltsche
|
Automated Synthesis of Controllers for Search and Rescue from Temporal
Logic Specifications
|
Master Thesis
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this thesis, the synthesis of correct-by-construction controllers for
robots assisting in Search and Rescue (SAR) is considered. In recent years, the
development of robots assisting in disaster mitigation in urban environments
has been actively encouraged, since robots can be deployed in dangerous and
hazardous areas where human SAR operations would not be possible.
In order to meet the reliability requirements in SAR, the specifications of
the robots are stated in Linear Temporal Logic and synthesized into finite
state machines that can be executed as controllers. The resulting controllers
are purely discrete and maintain an ongoing interaction with their environment
by changing their internal state according to the inputs they receive from
sensors or other robots.
Since SAR robots have to cooperate in order to complete the required tasks,
the synthesis of controllers that together achieve a common goal is considered.
This distributed synthesis problem is provably undecidable, hence it cannot be
solved in full generality, but a set of design principles is introduced in
order to develop specialized synthesizable specifications. In particular,
communication and cooperation are resolved by introducing a verified
standardized communication protocol and preempting negotiations between robots.
The robots move on a graph on which we consider the search for stationary and
moving targets. Searching for moving targets is cast into a game of cops and
robbers, and specifications implementing a winning strategy are developed so
that the number of robots required is minimized.
The viability of the methods is demonstrated by synthesizing controllers for
robots performing search and rescue for stationary targets and searching for
moving targets. It is shown that the controllers are guaranteed to achieve the
common goal of finding and rescuing the targets.
|
[
{
"version": "v1",
"created": "Thu, 25 Apr 2013 12:49:15 GMT"
}
] | 2013-04-26T00:00:00 |
[
[
"Wiltsche",
"Clemens",
""
]
] |
new_dataset
| 0.999106 |
1304.6450
|
Ton Kloks
|
Wing-Kai Hon and Ton Kloks and Hsiang Hsuan Liu and Sheung-Hung Poon
and Yue-Li Wang
|
On independence domination
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let G be a graph. The independence-domination number is the maximum over all
independent sets I in G of the minimal number of vertices needed to dominate I.
In this paper we investigate the computational complexity of independence
domination for graphs in several graph classes related to cographs. We present
an exact exponential algorithm. We also present a PTAS for planar graphs.
|
[
{
"version": "v1",
"created": "Wed, 24 Apr 2013 00:21:35 GMT"
}
] | 2013-04-25T00:00:00 |
[
[
"Hon",
"Wing-Kai",
""
],
[
"Kloks",
"Ton",
""
],
[
"Liu",
"Hsiang Hsuan",
""
],
[
"Poon",
"Sheung-Hung",
""
],
[
"Wang",
"Yue-Li",
""
]
] |
new_dataset
| 0.997035 |
1304.6486
|
Ashutosh Lanjewar
|
Ashutosh Lanjewar and Neelesh Gupta (1) ((1) M.Tech. Student, Digital
Communication, T.I.E.I.T (TRUBA), BHOPAL (M.P.)-India, (2) Electronics and
Communication, T.I.E.I.T (TRUBA), BHOPAL (M.P.)-India)
|
Optimizing Cost, Delay, Packet Loss and Network Load in AODV Routing
Protocol
|
6 Pages, 7 Figures, Paper is registered with IJCSIS Journal Vol. 11,
No. 4, April 2013
|
International Journal of Computer Science and Information Security
(IJCSIS Journal Vol. 11, No. 4, April 2013)
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
AODV is Ad-hoc On-Demand Distance Vector.A mobile ad-hoc network is a
self-configuring network of mobile devices connected by wireless. MANET does
not have any fixed infrastructure. The device in a MANET is free to move in any
direction and will form the connection as per the requirement of the network.
Due to changing topology maintenance of factors like Packet loss, End to End
Delay, Number of hops, delivery ratio and controlling the network load is of
great challenge. This paper mainly concentrates on reducing the factors such as
cost, End-to-End Delay, Network Load and Packet loss in AODV routing protocol.
The NS-2 is used for the simulation purpose.
|
[
{
"version": "v1",
"created": "Wed, 24 Apr 2013 06:25:56 GMT"
}
] | 2013-04-25T00:00:00 |
[
[
"Lanjewar",
"Ashutosh",
""
],
[
"Gupta",
"Neelesh",
""
]
] |
new_dataset
| 0.95116 |
1304.6499
|
Frank Nielsen
|
Frank Nielsen
|
Logging safely in public spaces using color PINs
| null | null | null | null |
cs.HC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, we are increasingly logging on many different Internet sites to
access private data like emails or photos remotely stored in the clouds. This
makes us all the more concerned with digital identity theft and passwords being
stolen either by key loggers or shoulder-surfing attacks. Quite surprisingly,
the current bottleneck of computer security when logging for authentication is
the User Interface (UI): How can we enter safely secret passwords when
concealed spy cameras or key loggers may be recording the login session?
Logging safely requires to design a secure Human Computer Interface (HCI)
robust to those attacks. We describe a novel method and system based on
entering secret ID passwords by means of associative secret UI passwords that
provides zero-knowledge to observers. We demonstrate the principles using a
color Personal Identification Numbers (PINs) login system and describes its
various extensions.
|
[
{
"version": "v1",
"created": "Wed, 24 Apr 2013 07:52:22 GMT"
}
] | 2013-04-25T00:00:00 |
[
[
"Nielsen",
"Frank",
""
]
] |
new_dataset
| 0.995576 |
1304.6626
|
Makarius Wenzel
|
Makarius Wenzel
|
PIDE as front-end technology for Coq
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Isabelle/PIDE is the current Prover IDE technology for Isabelle. It has been
developed in ML and Scala in the past 4-5 years for this particular proof
assistant, but with an open mind towards other systems. PIDE is based on an
asynchronous document model, where the prover receives edits continuously and
updates its internal state accordingly. The interpretation of edits and the
policies for proof document processing are determined by the prover. The editor
front-end merely takes care of visual rendering of formal document content.
Here we report on an experiment to connect Coq to the PIDE infrastructure of
Isabelle. This requires to re-implement the core PIDE protocol layer of
Isabelle/ML in OCaml. The payload for semantic processing of proof document
content is restricted to lexical analysis in the sense of existing CoqIde
functionality. This is sufficient as proof-of-concept for PIDE connectivity.
Actual proof processing is then a matter of improving Coq towards timeless and
stateless proof processing, independently of PIDE technicalities. The
implementation worked out smoothly and required minimal changes to the refined
PIDE architecture of Isabelle2013.
This experiment substantiates PIDE as general approach to prover interaction.
It illustrates how other provers of the greater ITP family can participate by
following similar reforms of the classic TTY loop as was done for Isabelle in
the past few years.
|
[
{
"version": "v1",
"created": "Wed, 24 Apr 2013 15:21:29 GMT"
}
] | 2013-04-25T00:00:00 |
[
[
"Wenzel",
"Makarius",
""
]
] |
new_dataset
| 0.997322 |
1304.5894
|
Bruno Cornelis
|
Bruno Cornelis, Yun Yang, Joshua T. Vogelstein, Ann Dooms, Ingrid
Daubechies, David Dunson
|
Bayesian crack detection in ultra high resolution multimodal images of
paintings
|
8 pages, double column
| null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The preservation of our cultural heritage is of paramount importance. Thanks
to recent developments in digital acquisition techniques, powerful image
analysis algorithms are developed which can be useful non-invasive tools to
assist in the restoration and preservation of art. In this paper we propose a
semi-supervised crack detection method that can be used for high-dimensional
acquisitions of paintings coming from different modalities. Our dataset
consists of a recently acquired collection of images of the Ghent Altarpiece
(1432), one of Northern Europe's most important art masterpieces. Our goal is
to build a classifier that is able to discern crack pixels from the background
consisting of non-crack pixels, making optimal use of the information that is
provided by each modality. To accomplish this we employ a recently developed
non-parametric Bayesian classifier, that uses tensor factorizations to
characterize any conditional probability. A prior is placed on the parameters
of the factorization such that every possible interaction between predictors is
allowed while still identifying a sparse subset among these predictors. The
proposed Bayesian classifier, which we will refer to as conditional Bayesian
tensor factorization or CBTF, is assessed by visually comparing classification
results with the Random Forest (RF) algorithm.
|
[
{
"version": "v1",
"created": "Mon, 22 Apr 2013 09:46:47 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Apr 2013 09:00:01 GMT"
}
] | 2013-04-24T00:00:00 |
[
[
"Cornelis",
"Bruno",
""
],
[
"Yang",
"Yun",
""
],
[
"Vogelstein",
"Joshua T.",
""
],
[
"Dooms",
"Ann",
""
],
[
"Daubechies",
"Ingrid",
""
],
[
"Dunson",
"David",
""
]
] |
new_dataset
| 0.997663 |
1304.6146
|
Marc Killpack
|
Advait Jain, Marc D. Killpack, Aaron Edsinger, Charles C. Kemp
|
Manipulation in Clutter with Whole-Arm Tactile Sensing
|
This is the first version of a paper that we submitted to the
International Journal of Robotics Research on December 31, 2011 and uploaded
to our website on January 16, 2012
|
The International Journal of Robotics Research April 2013 vol. 32
no. 4 pg. 458-482
|
10.1177/0278364912471865
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We begin this paper by presenting our approach to robot manipulation, which
emphasizes the benefits of making contact with the world across the entire
manipulator. We assume that low contact forces are benign, and focus on the
development of robots that can control their contact forces during
goal-directed motion. Inspired by biology, we assume that the robot has
low-stiffness actuation at its joints, and tactile sensing across the entire
surface of its manipulator. We then describe a novel controller that exploits
these assumptions. The controller only requires haptic sensing and does not
need an explicit model of the environment prior to contact. It also handles
multiple contacts across the surface of the manipulator. The controller uses
model predictive control (MPC) with a time horizon of length one, and a linear
quasi-static mechanical model that it constructs at each time step. We show
that this controller enables both real and simulated robots to reach goal
locations in high clutter with low contact forces. Our experiments include
tests using a real robot with a novel tactile sensor array on its forearm
reaching into simulated foliage and a cinder block. In our experiments, robots
made contact across their entire arms while pushing aside movable objects,
deforming compliant objects, and perceiving the world.
|
[
{
"version": "v1",
"created": "Tue, 23 Apr 2013 01:40:46 GMT"
}
] | 2013-04-24T00:00:00 |
[
[
"Jain",
"Advait",
""
],
[
"Killpack",
"Marc D.",
""
],
[
"Edsinger",
"Aaron",
""
],
[
"Kemp",
"Charles C.",
""
]
] |
new_dataset
| 0.970431 |
1304.5545
|
Adrian Groza
|
Adrian Groza
|
Designing Electronic Markets for Defeasible-based Contractual Agents
|
LAF Workshop 2008
| null | null | null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design of punishment policies applied to specific domains linking agents
actions to material penalties is an open research issue. The proposed framework
applies principles of contract law to set penalties: expectation damages,
opportunity cost, reliance damages, and party design remedies. In order to
decide which remedy provides maximum welfare within an electronic market, a
simulation environment called DEMCA (Designing Electronic Markets for
Contractual Agents) was developed. Knowledge representation and the reasoning
capabilities of the agents are based on an extended version of temporal
defeasible logic.
|
[
{
"version": "v1",
"created": "Fri, 19 Apr 2013 21:00:37 GMT"
}
] | 2013-04-23T00:00:00 |
[
[
"Groza",
"Adrian",
""
]
] |
new_dataset
| 0.980509 |
1304.5553
|
Andreas Kl\"ockner
|
Andreas Kl\"ockner and Nicolas Pinto and Bryan Catanzaro and Yunsup
Lee and Paul Ivanov and Ahmed Fasih
|
GPU Scripting and Code Generation with PyCUDA
| null |
GPU Computing Gems, edited by Wen-mei Hwu, Elsevier (2011), ISBN
9780123859631, Chapter 27
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-level scripting languages are in many ways polar opposites to GPUs. GPUs
are highly parallel, subject to hardware subtleties, and designed for maximum
throughput, and they offer a tremendous advance in the performance achievable
for a significant number of computational problems. On the other hand,
scripting languages such as Python favor ease of use over computational speed
and do not generally emphasize parallelism. PyCUDA is a package that attempts
to join the two together. This chapter argues that in doing so, a programming
environment is created that is greater than just the sum of its two parts.
We would like to note that nearly all of this chapter applies in unmodified
form to PyOpenCL, a sister project of PyCUDA, whose goal it is to realize the
same concepts as PyCUDA for OpenCL.
|
[
{
"version": "v1",
"created": "Fri, 19 Apr 2013 21:36:25 GMT"
}
] | 2013-04-23T00:00:00 |
[
[
"Klöckner",
"Andreas",
""
],
[
"Pinto",
"Nicolas",
""
],
[
"Catanzaro",
"Bryan",
""
],
[
"Lee",
"Yunsup",
""
],
[
"Ivanov",
"Paul",
""
],
[
"Fasih",
"Ahmed",
""
]
] |
new_dataset
| 0.973164 |
1304.5568
|
Andrew Fuller
|
Andrew Fuller, Vedran Budimcic
|
DORI: Distributed Outdoor Robotic Instruments
|
36 pages, 18 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DORI (Distributed Outdoor Robotic Instruments) is a remotely controlled
vehicle that is designed to simulate a planetary exploration mission. DORI is
equipped with over 20 environmental sensors and can perform basic data
analysis, logging and remote upload. The individual components are distributed
across a fault-tolerant bus for redundancy. A partial sensor list includes
atmospheric pressure, rainfall, wind speed, GPS, gyroscopic inertia, linear
acceleration, magnetic field strength, temperature, laser and ultrasonic
distance sensing, as well as digital audio and video capture. The project uses
recycled consumer electronics devices as a low-cost source for sensor
components. This report describes the hardware design of DORI including sensor
electronics, embedded firmware, and physical construction.
|
[
{
"version": "v1",
"created": "Sat, 20 Apr 2013 00:26:41 GMT"
}
] | 2013-04-23T00:00:00 |
[
[
"Fuller",
"Andrew",
""
],
[
"Budimcic",
"Vedran",
""
]
] |
new_dataset
| 0.999752 |
1304.5849
|
Marcin Kami\'nski
|
Jaroslaw Blasiok and Marcin Kaminski
|
Chain minors are FPT
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given two finite posets P and Q, P is a chain minor of Q if there exists a
partial function f from the elements of Q to the elements of P such that for
every chain in P there is a chain C_Q in Q with the property that f restricted
to C_Q is an isomorphism of chains. We give an algorithm to decide whether a
poset P is a chain minor of o poset Q that runs in time O(|Q| log |Q|) for
every fixed poset P. This solves an open problem from the monograph by Downey
and Fellows [Parameterized Complexity, 1999] who asked whether the problem was
fixed parameter tractable.
|
[
{
"version": "v1",
"created": "Mon, 22 Apr 2013 06:22:34 GMT"
}
] | 2013-04-23T00:00:00 |
[
[
"Blasiok",
"Jaroslaw",
""
],
[
"Kaminski",
"Marcin",
""
]
] |
new_dataset
| 0.985934 |
1304.5934
|
Bugra Caskurlu
|
Bugra Caskurlu, K. Subramani
|
On Partial Vertex Cover on Bipartite Graphs and Trees
|
11 pages, 4 figures
| null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well-known that the Vertex Cover problem is in P on bipartite graphs,
however; the computational complexity of the Partial Vertex Cover problem on
bipartite graphs is open. In this paper, we first show that the Partial Vertex
Cover problem is NP-hard on bipartite graphs. We then identify an interesting
special case of bipartite graphs, for which the Partial Vertex Cover problem
can be solved in polynomial-time. We also show that the set of acyclic
bipartite graphs, i.e., forests, and the set of bipartite graph where the
degree of each vertex is at most 3 fall into that special case. Therefore, we
prove that the Partial Vertex Cover problem is in P on trees, and it is also in
P on the set of bipartite graphs where the degree of each vertex is at most 3.
|
[
{
"version": "v1",
"created": "Mon, 22 Apr 2013 12:59:20 GMT"
}
] | 2013-04-23T00:00:00 |
[
[
"Caskurlu",
"Bugra",
""
],
[
"Subramani",
"K.",
""
]
] |
new_dataset
| 0.999166 |
1304.5304
|
Matthew Valenti
|
Don Torrieri, Matthew C. Valenti
|
Exclusion and Guard Zones in DC-CDMA Ad Hoc Networks
|
to appear in IEEE Transactions on Communications. arXiv admin note:
substantial text overlap with arXiv:1207.2825
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The central issue in direct-sequence code-division multiple-access (DS-CDMA)
ad hoc networks is the prevention of a near-far problem. This paper considers
two types of guard zones that may be used to control the near-far problem: a
fundamental exclusion zone and an additional CSMA guard zone that may be
established by the carrier-sense multiple-access (CSMA) protocol. In the
exclusion zone, no mobiles are physically present, modeling the minimum
physical separation among mobiles that is always present in actual networks.
Potentially interfering mobiles beyond a transmitting mobile's exclusion zone,
but within its CSMA guard zone, are deactivated by the protocol. This paper
provides an analysis of DS-CSMA networks with either or both types of guard
zones. A network of finite extent with a finite number of mobiles and uniform
clustering as the spatial distribution is modeled. The analysis applies a
closed-form expression for the outage probability in the presence of Nakagami
fading, conditioned on the network geometry. The tradeoffs between exclusion
zones and CSMA guard zones are explored for DS-CDMA and unspread networks. The
spreading factor and the guard-zone radius provide design flexibility in
achieving specified levels of average outage probability and transmission
capacity. The advantage of an exclusion zone over a CSMA guard zone is that
since the network is not thinned, the number of active mobiles remains
constant, and higher transmission capacities can be achieved.
|
[
{
"version": "v1",
"created": "Fri, 19 Apr 2013 04:03:51 GMT"
}
] | 2013-04-22T00:00:00 |
[
[
"Torrieri",
"Don",
""
],
[
"Valenti",
"Matthew C.",
""
]
] |
new_dataset
| 0.978404 |
1304.5475
|
Moritz Schubotz
|
Moritz Schubotz
|
Making Math Searchable in Wikipedia
|
7 pages, 2 figures, Conference on Intelligent Computer Mathematics,
July 9-14 2012, Bremen, Germany. To be published in Lecture Notes, Artificial
Intelligence, Springer
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wikipedia, the world largest encyclopedia contains a lot of knowledge that is
expressed as formulae exclusively. Unfortunately, this knowledge is currently
not fully accessible by intelligent information retrieval systems. This immense
body of knowledge is hidden form value-added services, such as search. In this
paper, we present our MathSearch implementation for Wikipedia that enables
users to perform a combined text and fully unlock the potential benefits.
|
[
{
"version": "v1",
"created": "Fri, 19 Apr 2013 16:48:46 GMT"
}
] | 2013-04-22T00:00:00 |
[
[
"Schubotz",
"Moritz",
""
]
] |
new_dataset
| 0.976499 |
1304.5069
|
Stephan Rafler
|
Stephan Rafler
|
The Tap code - a code similar to Morse code for communication by tapping
|
11 pages, 3 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A code is presented for fast, easy and efficient communication over channels
that allow only two signal types: a single sound (e.g. a knock), or no sound
(i.e. silence). This is a true binary code while Morse code is a ternary code
and does not work in such situations. Thus the presented code is more universal
than Morse and can be used in much more situations. Additionally it is very
tolerant to variations in signal strength or duration. The paper contains
various ways in which the code can be derived, that all lead to the same code.
It also contains a comparison to other, similar codes, including the Morse
code, in regards to efficiency and other attributes. The replacement of Morse
code with Tap code is not proposed.
|
[
{
"version": "v1",
"created": "Thu, 18 Apr 2013 10:06:21 GMT"
}
] | 2013-04-19T00:00:00 |
[
[
"Rafler",
"Stephan",
""
]
] |
new_dataset
| 0.9997 |
1304.5109
|
Perrot K\'evin
|
Kevin Perrot and Eric R\'emila
|
Kadanoff Sand Pile Model. Avalanche Structure and Wave Shape
|
30 pages. arXiv admin note: text overlap with arXiv:1106.2670,
arXiv:1101.5940
|
Theoretical Computer Science, ISSN 0304-3975,
10.1016/j.tcs.2013.01.033
| null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sand pile models are dynamical systems describing the evolution from $N$
stacked grains to a stable configuration. It uses local rules to depict grain
moves and iterate it until reaching a fixed configuration from which no rule
can be applied. Physicists L. Kadanoff {\em et al} inspire KSPM, extending the
well known {\em Sand Pile Model} (SPM). In KSPM($D$), we start from a pile of
$N$ stacked grains and apply the rule: $D\!-\!1$ grains can fall from column
$i$ onto columns $i+1,i+2,\dots,i+D\!-\!1$ if the difference of height between
columns $i$ and $i\!+\!1$ is greater or equal to $D$. Toward the study of fixed
points (stable configurations on which no grain can move) obtained from $N$
stacked grains, we propose an iterative study of KSPM evolution consisting in
the repeated addition of one grain on a heap of sand, triggering an avalanche
at each iteration. We develop a formal background for the study of avalanches,
resumed in a finite state word transducer, and explain how this transducer may
be used to predict the form of fixed points. Further precise developments
provide a plain formula for fixed points of KSPM(3), showing the emergence of a
wavy shape.
|
[
{
"version": "v1",
"created": "Thu, 18 Apr 2013 12:43:01 GMT"
}
] | 2013-04-19T00:00:00 |
[
[
"Perrot",
"Kevin",
""
],
[
"Rémila",
"Eric",
""
]
] |
new_dataset
| 0.978775 |
1304.4648
|
Guanghui Zhang
|
Guanghui Zhang, Bocong Chen
|
Construction of Self-dual Codes over $F_p+vF_p$
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we determine all self-dual codes over $F_p+vF_p$ ($v^2=v$) in
terms of self-dual codes over the finite field $F_p$ and give an explicit
construction for self-dual codes over $F_p+vF_p$, where $p$ is a prime.
|
[
{
"version": "v1",
"created": "Wed, 17 Apr 2013 00:02:41 GMT"
}
] | 2013-04-18T00:00:00 |
[
[
"Zhang",
"Guanghui",
""
],
[
"Chen",
"Bocong",
""
]
] |
new_dataset
| 0.954751 |
1304.4657
|
Danai Koutra
|
Danai Koutra, Joshua T. Vogelstein, Christos Faloutsos
|
DELTACON: A Principled Massive-Graph Similarity Function
|
2013 SIAM International Conference in Data Mining (SDM)
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How much did a network change since yesterday? How different is the wiring
between Bob's brain (a left-handed male) and Alice's brain (a right-handed
female)? Graph similarity with known node correspondence, i.e. the detection of
changes in the connectivity of graphs, arises in numerous settings. In this
work, we formally state the axioms and desired properties of the graph
similarity functions, and evaluate when state-of-the-art methods fail to detect
crucial connectivity changes in graphs. We propose DeltaCon, a principled,
intuitive, and scalable algorithm that assesses the similarity between two
graphs on the same nodes (e.g. employees of a company, customers of a mobile
carrier). Experiments on various synthetic and real graphs showcase the
advantages of our method over existing similarity measures. Finally, we employ
DeltaCon to real applications: (a) we classify people to groups of high and low
creativity based on their brain connectivity graphs, and (b) do temporal
anomaly detection in the who-emails-whom Enron graph.
|
[
{
"version": "v1",
"created": "Wed, 17 Apr 2013 00:45:43 GMT"
}
] | 2013-04-18T00:00:00 |
[
[
"Koutra",
"Danai",
""
],
[
"Vogelstein",
"Joshua T.",
""
],
[
"Faloutsos",
"Christos",
""
]
] |
new_dataset
| 0.997914 |
1304.4662
|
Ankit Chaudhary
|
J. L. Raheja, A. Chaudhary, K Singal
|
Tracking of Fingertips and Centres of Palm using KINECT
|
4 page
|
In proceedings of the 3rd IEEE International Conference on
Computational Intelligence, Modelling and Simulation, Malaysia, 20-22 Sep,
2011, pp. 248-252
| null | null |
cs.CV
|
http://creativecommons.org/licenses/publicdomain/
|
Hand Gesture is a popular way to interact or control machines and it has been
implemented in many applications. The geometry of hand is such that it is hard
to construct in virtual environment and control the joints but the
functionality and DOF encourage researchers to make a hand like instrument.
This paper presents a novel method for fingertips detection and centres of
palms detection distinctly for both hands using MS KINECT in 3D from the input
image. KINECT facilitates us by providing the depth information of foreground
objects. The hands were segmented using the depth vector and centres of palms
were detected using distance transformation on inverse image. This result would
be used to feed the inputs to the robotic hands to emulate human hands
operation.
|
[
{
"version": "v1",
"created": "Wed, 17 Apr 2013 01:20:10 GMT"
}
] | 2013-04-18T00:00:00 |
[
[
"Raheja",
"J. L.",
""
],
[
"Chaudhary",
"A.",
""
],
[
"Singal",
"K",
""
]
] |
new_dataset
| 0.969548 |
1304.4927
|
Yun Fan
|
Yun Fan and Hongwei Liu
|
Homogeneous Weights and M\"obius Functions on Finite Rings
|
This paper has been published in a Chinese journal, see below; here
is the English version
|
Y. Fan and H. Liu, Homogeneous weights of finite rings and
M\"obius functions(Chinese), Math. Ann.(Chinese), 31A (2010), 355-364
| null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The homogeneous weights and the M\"obius functions and Euler phi-functions on
finite rings are discussed; some computational formulas for these functions on
finite principal ideal rings are characterized; for the residue rings of
integers, they are reduced to the classical number-theoretical M\"obius
functions and the classical number-theoretical Euler phi-functions.
|
[
{
"version": "v1",
"created": "Wed, 17 Apr 2013 19:38:28 GMT"
}
] | 2013-04-18T00:00:00 |
[
[
"Fan",
"Yun",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.982343 |
0810.1151
|
Alban Ponse
|
Jan A. Bergstra and Alban Ponse
|
Periodic Single-Pass Instruction Sequences
|
16 pages, 3 tables, New title
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A program is a finite piece of data that produces a (possibly infinite)
sequence of primitive instructions. From scratch we develop a linear notation
for sequential, imperative programs, using a familiar class of primitive
instructions and so-called repeat instructions, a particular type of control
instructions. The resulting mathematical structure is a semigroup. We relate
this set of programs to program algebra (PGA) and show that a particular
subsemigroup is a carrier for PGA by providing axioms for single-pass
congruence, structural congruence, and thread extraction. This subsemigroup
characterizes periodic single-pass instruction sequences and provides a direct
basis for PGA's toolset.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2008 13:55:21 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Apr 2013 12:11:12 GMT"
}
] | 2013-04-17T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
],
[
"Ponse",
"Alban",
""
]
] |
new_dataset
| 0.996864 |
1304.0872
|
David Doty
|
David Doty
|
Timing in chemical reaction networks
| null | null | null | null |
cs.CC cs.DC cs.DS q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chemical reaction networks (CRNs) formally model chemistry in a well-mixed
solution. CRNs are widely used to describe information processing occurring in
natural cellular regulatory networks, and with upcoming advances in synthetic
biology, CRNs are a promising programming language for the design of artificial
molecular control circuitry. Due to a formal equivalence between CRNs and a
model of distributed computing known as population protocols, results transfer
readily between the two models.
We show that if a CRN respects finite density (at most O(n) additional
molecules can be produced from n initial molecules), then starting from any
dense initial configuration (all molecular species initially present have
initial count Omega(n), where n is the initial molecular count and volume),
then every producible species is produced in constant time with high
probability.
This implies that no CRN obeying the stated constraints can function as a
timer, able to produce a molecule, but doing so only after a time that is an
unbounded function of the input size. This has consequences regarding an open
question of Angluin, Aspnes, and Eisenstat concerning the ability of population
protocols to perform fast, reliable leader election and to simulate arbitrary
algorithms from a uniform initial state.
|
[
{
"version": "v1",
"created": "Wed, 3 Apr 2013 08:50:30 GMT"
}
] | 2013-04-17T00:00:00 |
[
[
"Doty",
"David",
""
]
] |
new_dataset
| 0.998975 |
1304.4548
|
Hala ElAarag
|
Hala ElAarag, David Bauschlicher and Steven Bauschlicher
|
System Architecture of HatterHealthConnect: An Integration of Body
Sensor Networks and Social Networks to Improve Health Awareness
| null |
International Journal of Computer Networks and Communications
(IJCNC), Vol.5, No.2, March 2013, pp.1-22, DOI : 10.5121/ijcnc.2013.5201 1
http://airccse.org/journal/ijc2013.html
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the last decade, the demand for efficient healthcare monitoring has
increased and forced the health and wellness industry to embrace modern
technological advances. Body Sensor Networks, or BSNs, can remotely collect
users data and upload vital statistics to servers over the Internet. Advances
in wireless technologies such as cellular devices and Bluetooth increase the
mobility users experience while wearing a body sensor network. When connected
by the proper framework, BSNs can efficiently monitor and record data while
minimizing the energy expenditure of nodes in the BSN. Social networking sites
play a large role in the aggregation and sharing of data between many users.
Connecting a BSN to a social network creates the unique ability to share health
related data with other users through social interaction. In this research, we
present an integration of BSNs and social networks to establish a community
promoting well being and great social awareness. We present the system
architecture; both hardware and software, of a prototype implementation using
Zephyr HxM heart monitor, Intel-Shimmer EMG senor and a Samsung Captivate smart
phone. We provide implementation details for the design on the base station,
the database server and the Facebook application. We illustrate how the Android
application was designed with both functionality and user perspective in mind
that resulted in an easy to use system. This prototype can be used in multiple
health related applications based on the type of sensors used.
|
[
{
"version": "v1",
"created": "Tue, 16 Apr 2013 18:52:30 GMT"
}
] | 2013-04-17T00:00:00 |
[
[
"ElAarag",
"Hala",
""
],
[
"Bauschlicher",
"David",
""
],
[
"Bauschlicher",
"Steven",
""
]
] |
new_dataset
| 0.962782 |
1304.4553
|
Mohsen Ghaffari
|
Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn
|
A New Perspective on Vertex Connectivity
| null | null | null | null |
cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Edge connectivity and vertex connectivity are two fundamental concepts in
graph theory. Although by now there is a good understanding of the structure of
graphs based on their edge connectivity, our knowledge in the case of vertex
connectivity is much more limited. An essential tool in capturing edge
connectivity are edge-disjoint spanning trees. The famous results of Tutte and
Nash-Williams show that a graph with edge connectivity $\lambda$ contains
$\floor{\lambda/2}$ edge-disjoint spanning trees.
We present connected dominating set (CDS) partition and packing as tools that
are analogous to edge-disjoint spanning trees and that help us to better grasp
the structure of graphs based on their vertex connectivity. The objective of
the CDS partition problem is to partition the nodes of a graph into as many
connected dominating sets as possible. The CDS packing problem is the
corresponding fractional relaxation, where CDSs are allowed to overlap as long
as this is compensated by assigning appropriate weights. CDS partition and CDS
packing can be viewed as the counterparts of the well-studied edge-disjoint
spanning trees, focusing on vertex disjointedness rather than edge
disjointness.
We constructively show that every $k$-vertex-connected graph with $n$ nodes
has a CDS packing of size $\Omega(k/\log n)$ and a CDS partition of size
$\Omega(k/\log^5 n)$. We prove that the $\Omega(k/\log n)$ CDS packing bound is
existentially optimal.
Using CDS packing, we show that if vertices of a $k$-vertex-connected graph
are independently sampled with probability $p$, then the graph induced by the
sampled vertices has vertex connectivity $\tilde{\Omega}(kp^2)$. Moreover,
using our $\Omega(k/\log n)$ CDS packing, we get a store-and-forward broadcast
algorithm with optimal throughput in the networking model where in each round,
each node can send one bounded-size message to all its neighbors.
|
[
{
"version": "v1",
"created": "Tue, 16 Apr 2013 19:00:48 GMT"
}
] | 2013-04-17T00:00:00 |
[
[
"Censor-Hillel",
"Keren",
""
],
[
"Ghaffari",
"Mohsen",
""
],
[
"Kuhn",
"Fabian",
""
]
] |
new_dataset
| 0.969391 |
1304.3850
|
Hongbo Si
|
Hongbo Si, O.Ozan Koyluoglu, and Sriram Vishwanath
|
Polar Coding for Fading Channels
|
6 pages, 4 figures, conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A polar coding scheme for fading channels is proposed in this paper. More
specifically, the focus is Gaussian fading channel with a BPSK modulation
technique, where the equivalent channel could be modeled as a binary symmetric
channel with varying cross-over probabilities. To deal with variable channel
states, a coding scheme of hierarchically utilizing polar codes is proposed. In
particular, by observing the polarization of different binary symmetric
channels over different fading blocks, each channel use corresponding to a
different polarization is modeled as a binary erasure channel such that polar
codes could be adopted to encode over blocks. It is shown that the proposed
coding scheme, without instantaneous channel state information at the
transmitter, achieves the capacity of the corresponding fading binary symmetric
channel, which is constructed from the underlying fading AWGN channel through
the modulation scheme.
|
[
{
"version": "v1",
"created": "Sat, 13 Apr 2013 20:59:40 GMT"
}
] | 2013-04-16T00:00:00 |
[
[
"Si",
"Hongbo",
""
],
[
"Koyluoglu",
"O. Ozan",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.999112 |
1304.4002
|
Manik Lal Das
|
Harsh N Thakker, Mayank Saha, Manik Lal Das
|
Reputation Algebra for Cloud-based Anonymous Data Storage Systems
|
9 pages
| null | null | null |
cs.DC cs.CR
|
http://creativecommons.org/licenses/publicdomain/
|
Given a cloud-based anonymous data storage system, there are two ways for
managing the nodes involved in file transfers. One of them is using reputations
and the other uses a micropayment system. In reputation-based approach, each
node has a reputation associated with it, which is used as a currency or
feedback collection for file exchange operations. There have been several
attempts over the years to develop a strong and efficient reputation system
that provides credibility, fairness, and accountability. One such attempt was
the Free Haven Project that provides a strong foundation for cloud-based
anonymous data storage systems. The work proposed in this paper is motivated by
the Free Haven Project aimed at developing a reputation system that facilitates
dynamic operations such as adding servers, removing servers and changing role
of authorities. The proposed system also provides algorithm for scoring and
maintaining reputations of the servers in order to achieve credibility,
accountability and fairness.
|
[
{
"version": "v1",
"created": "Mon, 15 Apr 2013 07:04:32 GMT"
}
] | 2013-04-16T00:00:00 |
[
[
"Thakker",
"Harsh N",
""
],
[
"Saha",
"Mayank",
""
],
[
"Das",
"Manik Lal",
""
]
] |
new_dataset
| 0.963278 |
1212.2291
|
Jason Cloud
|
MinJi Kim, Jason Cloud, Ali ParandehGheibi, Leonardo Urbina, Kerim
Fouli, Douglas Leith, Muriel Medard
|
Network Coded TCP (CTCP)
|
12 pages, 12 figures, 1 table, submitted to ACM Mobicom 2013.
(Revised acknowledgements). arXiv admin note: substantial text overlap with
arXiv:1212.1929
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce CTCP, a reliable transport protocol using network coding. CTCP
is designed to incorporate TCP features such as congestion control,
reliability, and fairness while significantly improving on TCP's performance in
lossy, interference-limited and/or dynamic networks. A key advantage of
adopting a transport layer over a link layer approach is that it provides
backward compatibility with wireless equipment installed throughout existing
networks. We present a portable userspace implementation of CTCP and
extensively evaluate its performance in both testbed and production wireless
networks.
|
[
{
"version": "v1",
"created": "Tue, 11 Dec 2012 03:35:22 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Dec 2012 02:17:30 GMT"
},
{
"version": "v3",
"created": "Fri, 12 Apr 2013 17:55:03 GMT"
}
] | 2013-04-15T00:00:00 |
[
[
"Kim",
"MinJi",
""
],
[
"Cloud",
"Jason",
""
],
[
"ParandehGheibi",
"Ali",
""
],
[
"Urbina",
"Leonardo",
""
],
[
"Fouli",
"Kerim",
""
],
[
"Leith",
"Douglas",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.999664 |
1304.3513
|
Mahmudur Rahman
|
Bogdan Carbunar, Mahmudur Rahman, Jaime Ballesteros, Naphtali Rishe
|
Eat the Cake and Have It Too: Privacy Preserving Location Aggregates in
Geosocial Networks
| null | null | null | null |
cs.CR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Geosocial networks are online social networks centered on the locations of
subscribers and businesses. Providing input to targeted advertising, profiling
social network users becomes an important source of revenue. Its natural
reliance on personal information introduces a trade-off between user privacy
and incentives of participation for businesses and geosocial network providers.
In this paper we introduce location centric profiles (LCPs), aggregates built
over the profiles of users present at a given location. We introduce PROFILR, a
suite of mechanisms that construct LCPs in a private and correct manner. We
introduce iSafe, a novel, context aware public safety application built on
PROFILR . Our Android and browser plugin implementations show that PROFILR is
efficient: the end-to-end overhead is small even under strong correctness
assurances.
|
[
{
"version": "v1",
"created": "Fri, 12 Apr 2013 00:43:53 GMT"
}
] | 2013-04-15T00:00:00 |
[
[
"Carbunar",
"Bogdan",
""
],
[
"Rahman",
"Mahmudur",
""
],
[
"Ballesteros",
"Jaime",
""
],
[
"Rishe",
"Naphtali",
""
]
] |
new_dataset
| 0.965029 |
1304.3120
|
Jonathan Arthur Quaye-Ballard
|
J. A. Quaye-Ballard, R. An, A. B. Agyemang, N. Y. Oppong-Quayson, and
J. E. N. Ablade
|
GUI Database for the Equipment Store of the Department of Geomatic
Engineering, KNUST
|
6 pages, 9 figures, (IJACSA) International Journal of Advanced
Computer Science and Applications, Vol. 3, No. 7, 2012
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The geospatial analyst is required to apply art, science, and technology to
measure relative positions of natural and man-made features above or beneath
the earths surface, and to present this information either graphically or
numerically. The reference positions for these measurements need to be well
archived and managed to effectively sustain the activities in the spatial
industry. The research herein described highlights the need for an information
system for the Land Surveyors Equipment Store. Such a system is a database
management system with a user friendly graphical interface. This paper
describes one such system that has been developed for the Equipment Store of
the Department of Geomatic Engineering, Kwame Nkrumah University of Science and
Technology, Ghana. The system facilitates efficient management and location of
instruments, as well as easy location of beacons together with their attribute
information, it provides multimedia information about instruments in an
Equipment Store. Digital camera was used capture the pictorial descriptions of
the beacons. Geographic Information System software was employed to visualize
the spatial location of beacons and to publish the various layers for the
Graphical User Interface. The aesthetics of the interface was developed with
user interface design tools and coded by programming. The developed Suite,
powered by a reliable and fully scalable database, provides an efficient way of
booking and analyzing transactions in an Equipment Store.
|
[
{
"version": "v1",
"created": "Wed, 10 Apr 2013 00:25:01 GMT"
}
] | 2013-04-12T00:00:00 |
[
[
"Quaye-Ballard",
"J. A.",
""
],
[
"An",
"R.",
""
],
[
"Agyemang",
"A. B.",
""
],
[
"Oppong-Quayson",
"N. Y.",
""
],
[
"Ablade",
"J. E. N.",
""
]
] |
new_dataset
| 0.977922 |
1304.3307
|
Elena Pribavkina
|
Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina
|
Principal ideal languages and synchronizing automata
|
15 pages, 9 figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study ideal languages generated by a single word. We provide an algorithm
to construct a strongly connected synchronizing automaton for which such a
language serves as the language of synchronizing words. Also we present a
compact formula to calculate the syntactic complexity of this language.
|
[
{
"version": "v1",
"created": "Thu, 11 Apr 2013 14:12:55 GMT"
}
] | 2013-04-12T00:00:00 |
[
[
"Gusev",
"Vladimir V.",
""
],
[
"Maslennikova",
"Marina I.",
""
],
[
"Pribavkina",
"Elena V.",
""
]
] |
new_dataset
| 0.980168 |
1304.3309
|
Dragan Vidakovic Novak
|
Dragan Vidakovic, Dusko Parezanovic, Olivera Nikolic and Jelena
Kaljevic
|
RSA Signature: Behind the Scenes
|
13 pages
|
Advanced Computing: An International Journal ( ACIJ ), Vol.4,
No.2, March 2013
|
10.5121/acij.2013.4203
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a complete digital signature message stream, just
the way the RSA digital signature scheme does it. We will focus on the
operations with large numbers due to the fact that operating with large numbers
is the essence of RSA that cannot be understood by the usual illustrative
examples with small numbers.
|
[
{
"version": "v1",
"created": "Thu, 11 Apr 2013 14:16:01 GMT"
}
] | 2013-04-12T00:00:00 |
[
[
"Vidakovic",
"Dragan",
""
],
[
"Parezanovic",
"Dusko",
""
],
[
"Nikolic",
"Olivera",
""
],
[
"Kaljevic",
"Jelena",
""
]
] |
new_dataset
| 0.999394 |
1304.3402
|
Pat Morin
|
Pat Morin and Sander Verdonschot
|
On the Average Number of Edges in Theta Graphs
|
20 pages, 6 figures, 1 table
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Theta graphs are important geometric graphs that have many applications,
including wireless networking, motion planning, real-time animation, and
minimum-spanning tree construction. We give closed form expressions for the
average degree of theta graphs of a homogeneous Poisson point process over the
plane. We then show that essentially the same bounds---with vanishing error
terms---hold for theta graphs of finite sets of points that are uniformly
distributed in a square. Finally, we show that the number of edges in a theta
graph of points uniformly distributed in a square is concentrated around its
expected value.
|
[
{
"version": "v1",
"created": "Thu, 11 Apr 2013 19:21:51 GMT"
}
] | 2013-04-12T00:00:00 |
[
[
"Morin",
"Pat",
""
],
[
"Verdonschot",
"Sander",
""
]
] |
new_dataset
| 0.966482 |
1301.3457
|
Marcelo Cicconet
|
Marcelo Cicconet, Italo Lima, Davi Geiger, Kris Gunsalus
|
A Geometric Descriptor for Cell-Division Detection
|
This paper has been withdrawn by the author since the review process
for the conference to which it was applied ended
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a method for cell-division detection based on a geometric-driven
descriptor that can be represented as a 5-layers processing network, based
mainly on wavelet filtering and a test for mirror symmetry between pairs of
pixels. After the centroids of the descriptors are computed for a sequence of
frames, the two-steps piecewise constant function that best fits the sequence
of centroids determines the frame where the division occurs.
|
[
{
"version": "v1",
"created": "Tue, 15 Jan 2013 19:18:52 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Apr 2013 18:32:07 GMT"
}
] | 2013-04-11T00:00:00 |
[
[
"Cicconet",
"Marcelo",
""
],
[
"Lima",
"Italo",
""
],
[
"Geiger",
"Davi",
""
],
[
"Gunsalus",
"Kris",
""
]
] |
new_dataset
| 0.996768 |
1304.2814
|
Gilles Geeraerts
|
Thomas Brihaye and Morgane Esti\'evenart and Gilles Geeraerts
|
On MITL and alternating timed automata
|
28 pages, 3 figures, submitted
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One clock alternating timed automata OCATA have been recently introduced as
natural extension of (one clock) timed automata to express the semantics of MTL
(Ouaknine, Worrell 2005). We consider the application of OCATA to problem of
model-checking MITL formulas (a syntactic fragment of MTL) against timed
automata. We introduce a new semantics for OCATA where, intuitively, clock
valuations are intervals instead of single real values. Thanks to this new
semantics, we show that we can bound the number of clock copies that are
necessary to allow an OCATA to recognise the models of an MITL formula.
Equipped with this technique, we propose a new algorithm to translate an MITL
formula into a timed automaton, and we sketch several ideas to define new model
checking algorithms for MITL.
|
[
{
"version": "v1",
"created": "Tue, 9 Apr 2013 23:13:43 GMT"
}
] | 2013-04-11T00:00:00 |
[
[
"Brihaye",
"Thomas",
""
],
[
"Estiévenart",
"Morgane",
""
],
[
"Geeraerts",
"Gilles",
""
]
] |
new_dataset
| 0.994479 |
1304.2888
|
Nicolas Bredeche
|
Nicolas Bredeche, Jean-Marc Montanier, Berend Weel, Evert Haasdijk
|
Roborobo! a Fast Robot Simulator for Swarm and Collective Robotics
|
2 pages, 1 figure
| null | null | null |
cs.RO cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Roborobo! is a multi-platform, highly portable, robot simulator for
large-scale collective robotics experiments. Roborobo! is coded in C++, and
follows the KISS guideline ("Keep it simple"). Therefore, its external
dependency is solely limited to the widely available SDL library for fast 2D
Graphics. Roborobo! is based on a Khepera/ePuck model. It is targeted for fast
single and multi-robots simulation, and has already been used in more than a
dozen published research mainly concerned with evolutionary swarm robotics,
including environment-driven self-adaptation and distributed evolutionary
optimization, as well as online onboard embodied evolution and embodied
morphogenesis.
|
[
{
"version": "v1",
"created": "Wed, 10 Apr 2013 09:44:52 GMT"
}
] | 2013-04-11T00:00:00 |
[
[
"Bredeche",
"Nicolas",
""
],
[
"Montanier",
"Jean-Marc",
""
],
[
"Weel",
"Berend",
""
],
[
"Haasdijk",
"Evert",
""
]
] |
new_dataset
| 0.998522 |
1304.2361
|
Carl Kadie
|
Carl Kadie
|
Rational Nonmonotonic Reasoning
|
Appears in Proceedings of the Fourth Conference on Uncertainty in
Artificial Intelligence (UAI1988)
| null | null |
UAI-P-1988-PG-197-204
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make
and retract (tentative) conclusions from inconclusive evidence. This paper
gives a possible-worlds interpretation of the nonmonotonic reasoning problem
based on standard decision theory and the emerging probability logic. The
system's central principle is that a tentative conclusion is a decision to make
a bet, not an assertion of fact. The system is rational, and as sound as the
proof theory of its underlying probability log.
|
[
{
"version": "v1",
"created": "Wed, 27 Mar 2013 19:43:41 GMT"
}
] | 2013-04-10T00:00:00 |
[
[
"Kadie",
"Carl",
""
]
] |
new_dataset
| 0.9982 |
1210.3761
|
Vasilis Papavasileiou
|
Panagiotis Manolios and Vasilis Papavasileiou
|
ILP Modulo Theories
|
CAV 2013 version plus proofs
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Integer Linear Programming (ILP) Modulo Theories (IMT). An IMT
instance is an Integer Linear Programming instance, where some symbols have
interpretations in background theories. In previous work, the IMT approach has
been applied to industrial synthesis and design problems with real-time
constraints arising in the development of the Boeing 787. Many other problems
ranging from operations research to software verification routinely involve
linear constraints and optimization. Thus, a general ILP Modulo Theories
framework has the potential to be widely applicable. The logical next step in
the development of IMT and the main goal of this paper is to provide
theoretical underpinnings. This is accomplished by means of BC(T), the Branch
and Cut Modulo T abstract transition system. We show that BC(T) provides a
sound and complete optimization procedure for the ILP Modulo T problem, as long
as T is a decidable, stably-infinite theory. We compare a prototype of BC(T)
against leading SMT solvers.
|
[
{
"version": "v1",
"created": "Sun, 14 Oct 2012 05:15:20 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Apr 2013 18:58:06 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Manolios",
"Panagiotis",
""
],
[
"Papavasileiou",
"Vasilis",
""
]
] |
new_dataset
| 0.999195 |
1304.1963
|
Haibo Jiang
|
Haibo Jiang, YaoFei Ma, Dongsheng Hong, Zhen Li
|
A new metric for routing in military wireless network
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Ad-hoc network is generally employed in military and emergencies due
to its flexibility and easy-to-use. It's suitable for military wireless network
that has the characteristics of mobility and works effectively under severe
environment and electromagnetic interfering conditions. However, military
network cannot benefit from existing routing protocol directly; there exists
quite many features which are only typical for military network. This paper
presents a new metric for routing, which is employed in A* algorithm. The goal
of the metric is to choose a route of less distance and less transmission delay
between a source and a destination. Our metric is a function of the distance
between the ends and the bandwidth over the link. Moreover, we take frequency
selection into account since a node can work on multi-frequencies. This paper
proposed the new metric, and experimented it based on A* algorithm. The
simulation results show that this metric can find the optimal route which has
less transmission delay compared to the shortest path routing.
|
[
{
"version": "v1",
"created": "Sun, 7 Apr 2013 07:01:50 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Jiang",
"Haibo",
""
],
[
"Ma",
"YaoFei",
""
],
[
"Hong",
"Dongsheng",
""
],
[
"Li",
"Zhen",
""
]
] |
new_dataset
| 0.998719 |
1304.1972
|
Amelia Carolina Sparavigna
|
Amelia Carolina Sparavigna
|
Facial transformations of ancient portraits: the face of Caesar
|
Image processing, Facial transformation, Morphing, Portraits, Julius
Caesar, Arles bust, Tusculum bust
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some software solutions used to obtain the facial transformations can help
investigating the artistic metamorphosis of the ancient portraits of the same
person. An analysis with a freely available software of portraitures of Julius
Caesar is proposed, showing his several "morphs". The software helps enhancing
the mood the artist added to a portrait.
|
[
{
"version": "v1",
"created": "Sun, 7 Apr 2013 09:43:47 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Sparavigna",
"Amelia Carolina",
""
]
] |
new_dataset
| 0.984159 |
1304.1986
|
Andrew Adamatzky
|
Andrew Adamatzky
|
On growing connected beta-skeletons
| null |
Computational Geometry, 46 (2013) 6, 805--816
|
10.1016/j.comgeo.2012.11.009
| null |
cs.CG nlin.PS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $\beta$-skeleton, $\beta \geq 1$, is a planar proximity undirected graph of
an Euclidean points set, where nodes are connected by an edge if their
lune-based neighbourhood contains no other points of the given set. Parameter
$\beta$ determines the size and shape of the lune-based neighbourhood. A
$\beta$-skeleton of a random planar set is usually a disconnected graph for
$\beta>2$. With the increase of $\beta$, the number of edges in the
$\beta$-skeleton of a random graph decreases. We show how to grow stable
$\beta$-skeletons, which are connected for any given value of $\beta$ and
characterise morphological transformations of the skeletons governed by $\beta$
and a degree of approximation. We speculate how the results obtained can be
applied in biology and chemistry.
|
[
{
"version": "v1",
"created": "Sun, 7 Apr 2013 11:58:28 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.995838 |
1304.2050
|
Andrew Adamatzky
|
Andrew Adamatzky, Rachel Armstrong, Jeff Jones, Yukio-Pegio Gunji
|
On Creativity of Slime Mould
| null |
International Journal of General Systems 42 (2013) 5, 441-457
|
10.1080/03081079.2013.776206
| null |
cs.ET nlin.AO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Slime mould Physarum polycephalum is large single cell with intriguingly
smart behaviour. The slime mould shows outstanding abilities to adapt its
protoplasmic network to varying environmental conditions. The slime mould can
solve tasks of computational geometry, image processing, logics and arithmetics
when data are represented by configurations of attractants and repellents. We
attempt to map behavioural patterns of slime onto the cognitive control versus
schizotypy spectrum phase space and thus interpret slime mould's activity in
terms of creativity.
|
[
{
"version": "v1",
"created": "Sun, 7 Apr 2013 19:41:00 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
],
[
"Armstrong",
"Rachel",
""
],
[
"Jones",
"Jeff",
""
],
[
"Gunji",
"Yukio-Pegio",
""
]
] |
new_dataset
| 0.998816 |
1304.2094
|
Farzad Hessar
|
Hossein Hosseini, Behnam Bahrak, Farzad Hessar
|
A GOST-like Blind Signature Scheme Based on Elliptic Curve Discrete
Logarithm Problem
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a blind signature scheme and three practical educed
schemes based on elliptic curve discrete logarithm problem. The proposed
schemes impart the GOST signature structure and utilize the inherent advantage
of elliptic curve cryptosystems in terms of smaller key size and lower
computational overhead to its counterpart public key cryptosystems such as RSA
and ElGamal. The proposed schemes are proved to be secure and have less time
complexity in comparison with the existing schemes.
|
[
{
"version": "v1",
"created": "Mon, 8 Apr 2013 03:19:45 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Hosseini",
"Hossein",
""
],
[
"Bahrak",
"Behnam",
""
],
[
"Hessar",
"Farzad",
""
]
] |
new_dataset
| 0.997113 |
1304.2103
|
Hao Lu
|
Hao Lu, Peilin Hong and Kaiping Xue
|
High-Throughput Cooperative Communication with Interference Cancellation
for Two-Path Relay in Multi-source System
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Relay-based cooperative communication has become a research focus in recent
years because it can achieve diversity gain in wireless networks. In existing
works, network coding and two-path relay are adopted to deal with the increase
of network size and the half-duplex nature of relay, respectively. To further
improve bandwidth efficiency, we propose a novel cooperative transmission
scheme which combines network coding and two-path relay together in a
multi-source system. Due to the utilization of two-path relay, our proposed
scheme achieves full-rate transmission. Adopting complex field network coding
(CFNC) at both sources and relays ensures that symbols from different sources
are allowed to be broadcast in the same time slot. We also adopt physical-layer
network coding (PNC) at relay nodes to deal with the inter-relay interference
caused by the two-path relay. With careful process design, the ideal throughput
of our scheme achieves by 1 symbol per source per time slot (sym/S/TS).
Furthermore, the theoretical analysis provides a method to estimate the symbol
error probability (SEP) and throughput in additive complex white Gaussian noise
(AWGN) and Rayleigh fading channels. The simulation results verify the
improvement achieved by the proposed scheme.
|
[
{
"version": "v1",
"created": "Mon, 8 Apr 2013 05:03:55 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Lu",
"Hao",
""
],
[
"Hong",
"Peilin",
""
],
[
"Xue",
"Kaiping",
""
]
] |
new_dataset
| 0.956679 |
1304.2233
|
Michael Erhard
|
Michael Erhard and Hans Strauch
|
Sensors and Navigation Algorithms for Flight Control of Tethered Kites
|
6 pages, 9 figures, submitted to European Control Conference (ECC)
2013
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the sensor setup and the basic navigation algorithm used for the
flight control of the SkySails towing kite system. Starting with brief
summaries on system setup and equations of motion of the tethered kite system,
we subsequently give an overview of the sensor setup, present the navigation
task and discuss challenges which have to be mastered. In the second part we
introduce in detail the inertial navigation algorithm which has been used for
operational flights for years. The functional capability of this algorithm is
illustrated by experimental flight data. Finally we suggest a modification of
the algorithms as further development step in order to overcome certain
limitations.
|
[
{
"version": "v1",
"created": "Mon, 8 Apr 2013 15:14:56 GMT"
}
] | 2013-04-09T00:00:00 |
[
[
"Erhard",
"Michael",
""
],
[
"Strauch",
"Hans",
""
]
] |
new_dataset
| 0.963992 |
1304.1491
|
Fahiem Bacchus
|
Fahiem Bacchus
|
Lp : A Logic for Statistical Information
|
Appears in Proceedings of the Fifth Conference on Uncertainty in
Artificial Intelligence (UAI1989)
| null | null |
UAI-P-1989-PG-1-6
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This extended abstract presents a logic, called Lp, that is capable of
representing and reasoning with a wide variety of both qualitative and
quantitative statistical information. The advantage of this logical formalism
is that it offers a declarative representation of statistical knowledge;
knowledge represented in this manner can be used for a variety of reasoning
tasks. The logic differs from previous work in probability logics in that it
uses a probability distribution over the domain of discourse, whereas most
previous work (e.g., Nilsson [2], Scott et al. [3], Gaifinan [4], Fagin et al.
[5]) has investigated the attachment of probabilities to the sentences of the
logic (also, see Halpern [6] and Bacchus [7] for further discussion of the
differences). The logic Lp possesses some further important features. First, Lp
is a superset of first order logic, hence it can represent ordinary logical
assertions. This means that Lp provides a mechanism for integrating statistical
information and reasoning about uncertainty into systems based solely on logic.
Second, Lp possesses transparent semantics, based on sets and probabilities of
those sets. Hence, knowledge represented in Lp can be understood in terms of
the simple primative concepts of sets and probabilities. And finally, the there
is a sound proof theory that has wide coverage (the proof theory is complete
for certain classes of models). The proof theory captures a sufficient range of
valid inferences to subsume most previous probabilistic uncertainty reasoning
systems. For example, the linear constraints like those generated by Nilsson's
probabilistic entailment [2] can be generated by the proof theory, and the
Bayesian inference underlying belief nets [8] can be performed. In addition,
the proof theory integrates quantitative and qualitative reasoning as well as
statistical and logical reasoning. In the next section we briefly examine
previous work in probability logics, comparing it to Lp. Then we present some
of the varieties of statistical information that Lp is capable of expressing.
After this we present, briefly, the syntax, semantics, and proof theory of the
logic. We conclude with a few examples of knowledge representation and
reasoning in Lp, pointing out the advantages of the declarative representation
offered by Lp. We close with a brief discussion of probabilities as degrees of
belief, indicating how such probabilities can be generated from statistical
knowledge encoded in Lp. The reader who is interested in a more complete
treatment should consult Bacchus [7].
|
[
{
"version": "v1",
"created": "Wed, 27 Mar 2013 19:36:47 GMT"
}
] | 2013-04-08T00:00:00 |
[
[
"Bacchus",
"Fahiem",
""
]
] |
new_dataset
| 0.998474 |
1304.1718
|
Pierre Aboulker
|
Pierre Aboulker 'and' Nicolas Bousquet
|
Excluding cycles with a fixed number of chords
|
30 pages, 7 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trotignon and Vuskovic completely characterized graphs that do not contain
cycles with exactly one chord. In particular, they show that such a graph G has
chromatic number at most max(3,w(G)). We generalize this result to the class of
graphs that do not contain cycles with exactly two chords and the class of
graphs that do not contain cycles with exactly three chords. More precisely we
prove that graphs with no cycle with exactly two chords have chromatic number
at most 6. And a graph G with no cycle with exactly three chords have chromatic
number at most max(96,w(G)+1).
|
[
{
"version": "v1",
"created": "Fri, 5 Apr 2013 14:07:53 GMT"
}
] | 2013-04-08T00:00:00 |
[
[
"Bousquet",
"Pierre Aboulker 'and' Nicolas",
""
]
] |
new_dataset
| 0.997848 |
1304.1095
|
Ingo Beinlich
|
Ingo Beinlich, Edward H. Herskovits
|
Ergo: A Graphical Environment for Constructing Bayesian
|
Appears in Proceedings of the Sixth Conference on Uncertainty in
Artificial Intelligence (UAI1990)
| null | null |
UAI-P-1990-PG-114-121
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an environment that considerably simplifies the process of
generating Bayesian belief networks. The system has been implemented on readily
available, inexpensive hardware, and provides clarity and high performance. We
present an introduction to Bayesian belief networks, discuss algorithms for
inference with these networks, and delineate the classes of problems that can
be solved with this paradigm. We then describe the hardware and software that
constitute the system, and illustrate Ergo's use with several example
|
[
{
"version": "v1",
"created": "Wed, 27 Mar 2013 13:55:48 GMT"
}
] | 2013-04-05T00:00:00 |
[
[
"Beinlich",
"Ingo",
""
],
[
"Herskovits",
"Edward H.",
""
]
] |
new_dataset
| 0.951919 |
1304.1130
|
Kathryn Blackmond Laskey
|
Kathryn Blackmond Laskey
|
A Probabilistic Reasoning Environment
|
Appears in Proceedings of the Sixth Conference on Uncertainty in
Artificial Intelligence (UAI1990)
| null | null |
UAI-P-1990-PG-415-422
|
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A framework is presented for a computational theory of probabilistic
argument. The Probabilistic Reasoning Environment encodes knowledge at three
levels. At the deepest level are a set of schemata encoding the system's domain
knowledge. This knowledge is used to build a set of second-level arguments,
which are structured for efficient recapture of the knowledge used to construct
them. Finally, at the top level is a Bayesian network constructed from the
arguments. The system is designed to facilitate not just propagation of beliefs
and assimilation of evidence, but also the dynamic process of constructing a
belief network, evaluating its adequacy, and revising it when necessary.
|
[
{
"version": "v1",
"created": "Wed, 27 Mar 2013 13:59:09 GMT"
}
] | 2013-04-05T00:00:00 |
[
[
"Laskey",
"Kathryn Blackmond",
""
]
] |
new_dataset
| 0.987218 |
1304.1207
|
Heide Gluesing-Luerssen
|
Heide Gluesing-Luerssen
|
Fourier-Reflexive Partitions and MacWilliams Identities for Additive
Codes
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A partition of a finite abelian group gives rise to a dual partition on the
character group via the Fourier transform. Properties of the dual partitions
are investigated and a convenient test is given for the case that the bidual
partition coincides the primal partition. Such partitions permit MacWilliams
identities for the partition enumerators of additive codes. It is shown that
dualization commutes with taking products and symmetrized products of
partitions on cartesian powers of the given group. After translating the
results to Frobenius rings, which are identified with their character module,
the approach is applied to partitions that arise from poset structures.
|
[
{
"version": "v1",
"created": "Wed, 3 Apr 2013 23:16:52 GMT"
}
] | 2013-04-05T00:00:00 |
[
[
"Gluesing-Luerssen",
"Heide",
""
]
] |
new_dataset
| 0.985371 |
1304.1405
|
Yun Fan
|
Yun Fan, San Ling, Hongwei Liu
|
Homogeneous Weights of Matrix Product Codes over Finite Principal Ideal
Rings
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the homogeneous weights of matrix product codes over finite
principal ideal rings are studied and a lower bound for the minimum homogeneous
weights of such matrix product codes is obtained.
|
[
{
"version": "v1",
"created": "Thu, 4 Apr 2013 15:44:15 GMT"
}
] | 2013-04-05T00:00:00 |
[
[
"Fan",
"Yun",
""
],
[
"Ling",
"San",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.967078 |
1202.2684
|
Michaela Rombach
|
M. Puck Rombach, Mason A. Porter, James H. Fowler and Peter J. Mucha
|
Core-Periphery Structure in Networks
| null | null | null | null |
cs.SI cond-mat.stat-mech physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intermediate-scale (or `meso-scale') structures in networks have received
considerable attention, as the algorithmic detection of such structures makes
it possible to discover network features that are not apparent either at the
local scale of nodes and edges or at the global scale of summary statistics.
Numerous types of meso-scale structures can occur in networks, but
investigations of such features have focused predominantly on the
identification and study of community structure. In this paper, we develop a
new method to investigate the meso-scale feature known as core-periphery
structure, which entails identifying densely-connected core nodes and
sparsely-connected periphery nodes. In contrast to communities, the nodes in a
core are also reasonably well-connected to those in the periphery. Our new
method of computing core-periphery structure can identify multiple cores in a
network and takes different possible cores into account. We illustrate the
differences between our method and several existing methods for identifying
which nodes belong to a core, and we use our technique to examine
core-periphery structure in examples of friendship, collaboration,
transportation, and voting networks.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2012 10:32:51 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Apr 2013 21:47:01 GMT"
}
] | 2013-04-04T00:00:00 |
[
[
"Rombach",
"M. Puck",
""
],
[
"Porter",
"Mason A.",
""
],
[
"Fowler",
"James H.",
""
],
[
"Mucha",
"Peter J.",
""
]
] |
new_dataset
| 0.970335 |
1301.2714
|
Ahmed Rhif
|
Ahmed Rhif, Zohra Kardous, Naceur Ben Hadj Braiek
|
A Sliding Mode-Multimodel Control with Sliding Mode Observer for a
Sensorless Pumping System
|
This paper has been withdrawn by the author because it may be
reviewed
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work deals with the design of a sliding mode observer with a
multi-surfaces sliding mode multimodel control (SM-MMC) for a mechanical
sensorless pumping system. The observer is designed to estimate the speed and
the mechanical position of the DC motor operating in the process. Robustness
tests validated by simulation show the effectiveness of the sliding mode
observer associated with this control approach (SM-MMC).
|
[
{
"version": "v1",
"created": "Sat, 12 Jan 2013 19:59:55 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Jan 2013 10:44:07 GMT"
},
{
"version": "v3",
"created": "Fri, 22 Feb 2013 15:18:19 GMT"
},
{
"version": "v4",
"created": "Tue, 2 Apr 2013 23:24:07 GMT"
}
] | 2013-04-04T00:00:00 |
[
[
"Rhif",
"Ahmed",
""
],
[
"Kardous",
"Zohra",
""
],
[
"Braiek",
"Naceur Ben Hadj",
""
]
] |
new_dataset
| 0.989049 |
1302.4205
|
Walid Belkhir
|
Walid Belkhir, Yannick Chevalier, Michael Rusinowitch
|
Fresh-Variable Automata for Service Composition
|
28 pages. 4 Figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To model Web services handling data from an infinite domain, or with multiple
sessions, we introduce fresh-variable automata, a simple extension of
finite-state automata in which some transitions are labeled with variables that
can be refreshed in some specified states. We prove several closure properties
for this class of automata and study their decision problems. We then introduce
a notion of simulation that enables us to reduce the Web service composition
problem to the construction of a simulation of a target service by the
asynchronous product of existing services, and prove that this construction is
computable.
|
[
{
"version": "v1",
"created": "Mon, 18 Feb 2013 10:05:40 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Feb 2013 10:40:52 GMT"
},
{
"version": "v3",
"created": "Wed, 3 Apr 2013 09:24:25 GMT"
}
] | 2013-04-04T00:00:00 |
[
[
"Belkhir",
"Walid",
""
],
[
"Chevalier",
"Yannick",
""
],
[
"Rusinowitch",
"Michael",
""
]
] |
new_dataset
| 0.997963 |
1304.1000
|
Wil van der Aalst
|
Wil van der Aalst
|
Passages in Graphs
|
8 pages
| null | null |
BPM Center Report BPM-12-19
|
cs.DM math.CO
|
http://creativecommons.org/licenses/by/3.0/
|
Directed graphs can be partitioned in so-called passages. A passage P is a
set of edges such that any two edges sharing the same initial vertex or sharing
the same terminal vertex are both inside $P$ or are both outside of P. Passages
were first identified in the context of process mining where they are used to
successfully decompose process discovery and conformance checking problems. In
this article, we examine the properties of passages. We will show that passages
are closed under set operators such as union, intersection and difference.
Moreover, any passage is composed of so-called minimal passages. These
properties can be exploited when decomposing graph-based analysis and
computation problems.
|
[
{
"version": "v1",
"created": "Wed, 3 Apr 2013 16:07:46 GMT"
}
] | 2013-04-04T00:00:00 |
[
[
"van der Aalst",
"Wil",
""
]
] |
new_dataset
| 0.970206 |
1304.1005
|
Marius Zimand
|
N.V. Vinodchandran and Marius Zimand
|
On optimal language compression for sets in PSPACE/poly
|
submitted to Theory of Computing Systems
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that if DTIME[2^O(n)] is not included in DSPACE[2^o(n)], then, for
every set B in PSPACE/poly, all strings x in B of length n can be represented
by a string compressed(x) of length at most log(|B^{=n}|)+O(log n), such that a
polynomial-time algorithm, given compressed(x), can distinguish x from all the
other strings in B^{=n}. Modulo the O(log n) additive term, this achieves the
information-theoretic optimum for string compression. We also observe that
optimal compression is not possible for sets more complex than PSPACE/poly
because for any time-constructible superpolynomial function t, there is a set A
computable in space t(n) such that at least one string x of length n requires
compressed(x) to be of length 2 log(|A^=n|).
|
[
{
"version": "v1",
"created": "Wed, 3 Apr 2013 16:37:02 GMT"
}
] | 2013-04-04T00:00:00 |
[
[
"Vinodchandran",
"N. V.",
""
],
[
"Zimand",
"Marius",
""
]
] |
new_dataset
| 0.951572 |
1304.0538
|
Sen Ma Dr
|
Sen Ma
|
OESPA:A Theory of Programming that Support Software Engineering
|
18 pages for FOCS 2013
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new theory of programming is proposed. The theory consists of OE (Operation
Expression), SP (Semantic Predicate) and A (Axiom), abbreviated as OESPA. OE is
for programming: its syntax is given by BNF formulas and its semantics is
defined by axioms on these formulas. Similar to predicates in logic, SP is for
describing properties of OE (i.e. programs) and for program property analysis.
But SP is different from predicates, it directly relates the final values of
variables upon termination of a given OE with initial values of these variables
before the same OE. As such, it is feasible to prove or disprove whether a
given SP is a property of a given OE by computation based on A (Axioms). SP
calculus is proposed for program specification and specification analysis, that
is missing in software engineering.
|
[
{
"version": "v1",
"created": "Tue, 2 Apr 2013 05:57:44 GMT"
}
] | 2013-04-03T00:00:00 |
[
[
"Ma",
"Sen",
""
]
] |
new_dataset
| 0.999337 |
1304.0600
|
Roman Bezhencev Vadimovich
|
Bezhentcev Roman Vadimovich
|
Software for creating pictures in the LaTeX environment
|
8 pages, 1 figure, 2 formulas, sourcecode
| null | null | null |
cs.GR
|
http://creativecommons.org/licenses/by/3.0/
|
To create a text with graphic instructions for output pictures into LATEX
document, we offer software that allows us to build a picture in WIZIWIG mode
and for setting the text with these graphical instructions.
|
[
{
"version": "v1",
"created": "Tue, 2 Apr 2013 11:55:33 GMT"
}
] | 2013-04-03T00:00:00 |
[
[
"Vadimovich",
"Bezhentcev Roman",
""
]
] |
new_dataset
| 0.998684 |
1304.0620
|
A. Anonymous
|
Heng Zhang, Yan Zhang
|
Disjunctive Logic Programs versus Normal Logic Programs
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focuses on the expressive power of disjunctive and normal logic
programs under the stable model semantics over finite, infinite, or arbitrary
structures. A translation from disjunctive logic programs into normal logic
programs is proposed and then proved to be sound over infinite structures. The
equivalence of expressive power of two kinds of logic programs over arbitrary
structures is shown to coincide with that over finite structures, and coincide
with whether or not NP is closed under complement. Over finite structures, the
intranslatability from disjunctive logic programs to normal logic programs is
also proved if arities of auxiliary predicates and functions are bounded in a
certain way.
|
[
{
"version": "v1",
"created": "Tue, 2 Apr 2013 12:59:41 GMT"
}
] | 2013-04-03T00:00:00 |
[
[
"Zhang",
"Heng",
""
],
[
"Zhang",
"Yan",
""
]
] |
new_dataset
| 0.988021 |
1304.0660
|
Pranav Garg
|
Pranav Garg and P. Madhusudan and Gennaro Parlato
|
Quantified Data Automata on Skinny Trees: an Abstract Domain for Lists
| null | null | null | null |
cs.PL cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new approach to heap analysis through an abstract domain of
automata, called automatic shapes. The abstract domain uses a particular kind
of automata, called quantified data automata on skinny trees (QSDAs), that
allows to define universally quantified properties of singly-linked lists. To
ensure convergence of the abstract fixed-point computation, we introduce a
sub-class of QSDAs called elastic QSDAs, which also form an abstract domain. We
evaluate our approach on several list manipulating programs and we show that
the proposed domain is powerful enough to prove a large class of these programs
correct.
|
[
{
"version": "v1",
"created": "Tue, 2 Apr 2013 15:07:47 GMT"
}
] | 2013-04-03T00:00:00 |
[
[
"Garg",
"Pranav",
""
],
[
"Madhusudan",
"P.",
""
],
[
"Parlato",
"Gennaro",
""
]
] |
new_dataset
| 0.972178 |
1304.0713
|
Yuan Li
|
Chris Beck and Yuan Li
|
Represent MOD function by low degree polynomial with unbounded one-sided
error
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we prove tight lower bounds on the smallest degree of a
nonzero polynomial in the ideal generated by $MOD_q$ or $\neg MOD_q$ in the
polynomial ring $F_p[x_1, \ldots, x_n]/(x_1^2 = x_1, \ldots, x_n^2 = x_n)$,
$p,q$ are coprime, which is called \emph{immunity} over $F_p$. The immunity of
$MOD_q$ is lower bounded by $\lfloor (n+1)/2 \rfloor$, which is achievable when
$n$ is a multiple of $2q$; the immunity of $\neg MOD_q$ is exactly $\lfloor
(n+q-1)/q \rfloor$ for every $q$ and $n$. Our result improves the previous
bound $\lfloor \frac{n}{2(q-1)} \rfloor$ by Green.
We observe how immunity over $F_p$ is related to $\acc$ circuit lower bound.
For example, if the immunity of $f$ over $F_p$ is lower bounded by $n/2 -
o(\sqrt{n})$, and $|1_f| = \Omega(2^n)$, then $f$ requires $\acc$ circuit of
exponential size to compute.
|
[
{
"version": "v1",
"created": "Tue, 2 Apr 2013 17:50:54 GMT"
}
] | 2013-04-03T00:00:00 |
[
[
"Beck",
"Chris",
""
],
[
"Li",
"Yuan",
""
]
] |
new_dataset
| 0.99058 |
1304.0715
|
Ladislau B\"ol\"oni
|
Ladislau B\"ol\"oni
|
A cookbook of translating English to Xapi
| null | null | null |
XTR-001
|
cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Xapagy cognitive architecture had been designed to perform narrative
reasoning: to model and mimic the activities performed by humans when
witnessing, reading, recalling, narrating and talking about stories. Xapagy
communicates with the outside world using Xapi, a simplified, "pidgin" language
which is strongly tied to the internal representation model (instances, scenes
and verb instances) and reasoning techniques (shadows and headless shadows).
While not fully a semantic equivalent of natural language, Xapi can represent a
wide range of complex stories. We illustrate the representation technique used
in Xapi through examples taken from folk physics, folk psychology as well as
some more unusual literary examples. We argue that while the Xapi model
represents a conceptual shift from the English representation, the mapping is
logical and consistent, and a trained knowledge engineer can translate between
English and Xapi at near-native speed.
|
[
{
"version": "v1",
"created": "Sun, 31 Mar 2013 22:17:19 GMT"
}
] | 2013-04-03T00:00:00 |
[
[
"Bölöni",
"Ladislau",
""
]
] |
new_dataset
| 0.999257 |
1201.4856
|
Matthew Bauer
|
Matthew S. Bauer
|
A PSPACE-Complete First Order Fragment of Computability Logic
| null | null | null | null |
cs.LO cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a recently launched research program for developing logic as a formal
theory of (interactive) computability, several very interesting logics have
been introduced and axiomatized. These fragments of the larger Computability
Logic aim not only to describe "what" can be computed, but also provide a
mechanism for extracting computational algorithms from proofs. Among the most
expressive and fundamental of these is CL4, known to be (constructively) sound
and complete with respect to the underlying computational semantics.
Furthermore, the fragment of CL4 not containing blind quantifiers was shown to
be decidable in polynomial space. The present work extends this result and
proves that this fragment is, in fact, PSPACE-complete.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2012 20:59:22 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Jan 2012 20:00:30 GMT"
},
{
"version": "v3",
"created": "Sun, 31 Mar 2013 20:16:31 GMT"
}
] | 2013-04-02T00:00:00 |
[
[
"Bauer",
"Matthew S.",
""
]
] |
new_dataset
| 0.999454 |
1212.1328
|
Hiroshi Fujita
|
Hiroshi Fujita
|
A New Lower Bound for the Ramsey Number R(4, 8)
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The lower bound for the classical Ramsey number R(4, 8) is improved from 56
to 58. The author has found a new edge coloring of K_{57} that has no complete
graphs of order 4 in the first color, and no complete graphs of order 8 in the
second color. The coloring was found using a SAT solver which is based on
MiniSat and customized for solving Ramsey problems.
|
[
{
"version": "v1",
"created": "Thu, 6 Dec 2012 14:04:42 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Mar 2013 22:10:56 GMT"
},
{
"version": "v3",
"created": "Sun, 31 Mar 2013 05:41:07 GMT"
}
] | 2013-04-02T00:00:00 |
[
[
"Fujita",
"Hiroshi",
""
]
] |
new_dataset
| 0.966883 |
1304.0110
|
Shachar Shayovitz
|
Shachar Shayovitz and Dan Raphaeli
|
A Signal Constellation for Pilotless Communications Over Wiener Phase
Noise Channels
|
Submitted to Globecom 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many satellite communication systems operating today employ low cost
upconverters or downconverters which create phase noise. This noise can
severely limit the information rate of the system and pose a serious challenge
for the detection systems. Moreover, simple solutions for phase noise tracking
such as PLL either require low phase noise or otherwise require many pilot
symbols which reduce the effective data rate. In order to increase the
effective information rate, we propose a signal constellation which does not
require pilots, at all, in order to converge in the decoding process. In this
contribution, we will present a signal constellation which does not require
pilot sequences, but we require a signal that does not present rotational
symmetry. For example a simple MPSK cannot be used.Moreover, we will provide a
method to analyze the proposed constellations and provide a figure of merit for
their performance when iterative decoding algorithms are used.
|
[
{
"version": "v1",
"created": "Sat, 30 Mar 2013 14:03:32 GMT"
}
] | 2013-04-02T00:00:00 |
[
[
"Shayovitz",
"Shachar",
""
],
[
"Raphaeli",
"Dan",
""
]
] |
new_dataset
| 0.997632 |
1304.0140
|
Fotis Foukalas
|
F. Foukalas, T.Khattab, H.V. Poor
|
Packet Relaying Control in Sensing-based Spectrum Sharing Systems
| null | null | null | null |
cs.NI cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognitive relaying has been introduced for opportunistic spectrum access
systems by which a secondary node forwards primary packets whenever the primary
link faces an outage condition. For spectrum sharing systems, cognitive
relaying is parametrized by an interference power constraint level imposed on
the transmit power of the secondary user. For sensing-based spectrum sharing,
the probability of detection is also involved in packet relaying control. This
paper considers the choice of these two parameters so as to maximize the
secondary nodes' throughput under certain constraints. The analysis leads to a
Markov decision process using dynamic programming approach. The problem is
solved using value iteration. Finally, the structural properties of the
resulting optimal control are highlighted.
|
[
{
"version": "v1",
"created": "Sat, 30 Mar 2013 21:30:18 GMT"
}
] | 2013-04-02T00:00:00 |
[
[
"Foukalas",
"F.",
""
],
[
"Khattab",
"T.",
""
],
[
"Poor",
"H. V.",
""
]
] |
new_dataset
| 0.97199 |
1304.0421
|
Santosh K.C.
|
K.C. Santosh (LORIA), E. Iwata
|
Stroke-Based Cursive Character Recognition
| null |
Advances in Character Recognition INTECH (Ed.) (2012) 175-192
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human eye can see and read what is written or displayed either in natural
handwriting or in printed format. The same work in case the machine does is
called handwriting recognition. Handwriting recognition can be broken down into
two categories: off-line and on-line. ...
|
[
{
"version": "v1",
"created": "Mon, 1 Apr 2013 19:14:27 GMT"
}
] | 2013-04-02T00:00:00 |
[
[
"Santosh",
"K. C.",
"",
"LORIA"
],
[
"Iwata",
"E.",
""
]
] |
new_dataset
| 0.998923 |
1303.7330
|
EPTCS
|
Alberto Carraro (PPS, Universit\'e Paris Diderot)
|
The untyped stack calculus and Bohm's theorem
|
In Proceedings LSFA 2012, arXiv:1303.7136
|
EPTCS 113, 2013, pp. 77-92
|
10.4204/EPTCS.113.9
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The stack calculus is a functional language in which is in a Curry-Howard
correspondence with classical logic. It enjoys confluence but, as well as
Parigot's lambda-mu, does not admit the Bohm Theorem, typical of the
lambda-calculus. We present a simple extension of stack calculus which is for
the stack calculus what Saurin's Lambda-mu is for lambda-mu.
|
[
{
"version": "v1",
"created": "Fri, 29 Mar 2013 09:02:05 GMT"
}
] | 2013-04-01T00:00:00 |
[
[
"Carraro",
"Alberto",
"",
"PPS, Université Paris Diderot"
]
] |
new_dataset
| 0.990374 |
1303.7331
|
EPTCS
|
Alberto Carraro (PPS, Universit\'e Paris Diderot), Thomas Ehrhard
(PPS, Universit\'e Paris Diderot), Antonino Salibra (DAIS, Universit\`a Ca'
Foscari Venezia)
|
The stack calculus
|
In Proceedings LSFA 2012, arXiv:1303.7136
|
EPTCS 113, 2013, pp. 93-108
|
10.4204/EPTCS.113.10
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a functional calculus with simple syntax and operational
semantics in which the calculi introduced so far in the Curry-Howard
correspondence for Classical Logic can be faithfully encoded. Our calculus
enjoys confluence without any restriction. Its type system enforces strong
normalization of expressions and it is a sound and complete system for full
implicational Classical Logic. We give a very simple denotational semantics
which allows easy calculations of the interpretation of expressions.
|
[
{
"version": "v1",
"created": "Fri, 29 Mar 2013 09:02:13 GMT"
}
] | 2013-04-01T00:00:00 |
[
[
"Carraro",
"Alberto",
"",
"PPS, Université Paris Diderot"
],
[
"Ehrhard",
"Thomas",
"",
"PPS, Université Paris Diderot"
],
[
"Salibra",
"Antonino",
"",
"DAIS, Università Ca'\n Foscari Venezia"
]
] |
new_dataset
| 0.981298 |
1303.7336
|
EPTCS
|
Paulo A. S. Veloso (COPPE-UFRJ), Sheila R. M. Veloso (FEN-UERJ)
|
A Graph Calculus for Predicate Logic
|
In Proceedings LSFA 2012, arXiv:1303.7136
|
EPTCS 113, 2013, pp. 153-168
|
10.4204/EPTCS.113.15
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a refutation graph calculus for classical first-order predicate
logic, which is an extension of previous ones for binary relations. One reduces
logical consequence to establishing that a constructed graph has empty
extension, i. e. it represents bottom. Our calculus establishes that a graph
has empty extension by converting it to a normal form, which is expanded to
other graphs until we can recognize conflicting situations (equivalent to a
formula and its negation).
|
[
{
"version": "v1",
"created": "Fri, 29 Mar 2013 09:02:51 GMT"
}
] | 2013-04-01T00:00:00 |
[
[
"Veloso",
"Paulo A. S.",
"",
"COPPE-UFRJ"
],
[
"Veloso",
"Sheila R. M.",
"",
"FEN-UERJ"
]
] |
new_dataset
| 0.999136 |
1303.7115
|
Dmitry Namiot
|
Dmitry Namiot, Manfred Schneps-Schneppe
|
Smart Cities Software from the developer's point of view
|
8 pages, submitted to 6-th Conference Applied Information and
Communication Technology AICT2013
| null | null | null |
cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper discusses the current state and development proposals for Smart
Cities and Future Internet projects. Definitions of a Smart City can vary but
usually tend to suggest the use of innovative Info-Communication technologies
such as the Internet of Things and Web 2.0 to deliver more effective and
efficient public services that improve living and working conditions and create
more sustainable urban environments. Our goal is to analyze the current
proposals from the developer's point of view, highlight the really new
elements, the positions borrowed from the existing tools as well as propose
some new extensions. We would like to discuss the possible extensions for the
existing proposals and describe add-ons that, by our opinion, let keep the
future research inline with the modern approaches in the web development
domain.
|
[
{
"version": "v1",
"created": "Thu, 28 Mar 2013 12:53:22 GMT"
}
] | 2013-03-29T00:00:00 |
[
[
"Namiot",
"Dmitry",
""
],
[
"Schneps-Schneppe",
"Manfred",
""
]
] |
new_dataset
| 0.961754 |
1303.7200
|
Chrisantha Fernando Dr
|
Chrisantha Fernando
|
Design for a Darwinian Brain: Part 1. Philosophy and Neuroscience
|
Darwinian Neurodynamics. Submitted as a two part paper to Living
Machines 2013 Natural History Museum, London
| null | null | null |
cs.AI q-bio.NC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Physical symbol systems are needed for open-ended cognition. A good way to
understand physical symbol systems is by comparison of thought to chemistry.
Both have systematicity, productivity and compositionality. The state of the
art in cognitive architectures for open-ended cognition is critically assessed.
I conclude that a cognitive architecture that evolves symbol structures in the
brain is a promising candidate to explain open-ended cognition. Part 2 of the
paper presents such a cognitive architecture.
|
[
{
"version": "v1",
"created": "Thu, 28 Mar 2013 18:45:52 GMT"
}
] | 2013-03-29T00:00:00 |
[
[
"Fernando",
"Chrisantha",
""
]
] |
new_dataset
| 0.995115 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.