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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1210.5879
|
Bruno Grenet
|
Bruno Grenet, Thierry Monteil, St\'ephan Thomass\'e
|
Symmetric Determinantal Representations in Characteristic 2
|
24 pages, 3 figures
|
Linear Algebra and Its Applications 439(5), pp. 1364-1381, 2013
|
10.1016/j.laa.2013.04.022
| null |
cs.CC math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies Symmetric Determinantal Representations (SDR) in
characteristic 2, that is the representation of a multivariate polynomial P by
a symmetric matrix M such that P=det(M), and where each entry of M is either a
constant or a variable.
We first give some sufficient conditions for a polynomial to have an SDR. We
then give a non-trivial necessary condition, which implies that some
polynomials have no SDR, answering a question of Grenet et al.
A large part of the paper is then devoted to the case of multilinear
polynomials. We prove that the existence of an SDR for a multilinear polynomial
is equivalent to the existence of a factorization of the polynomial in certain
quotient rings. We develop some algorithms to test the factorizability in these
rings and use them to find SDRs when they exist. Altogether, this gives us
polynomial-time algorithms to factorize the polynomials in the quotient rings
and to build SDRs. We conclude by describing the case of Alternating
Determinantal Representations in any characteristic.
|
[
{
"version": "v1",
"created": "Mon, 22 Oct 2012 12:04:05 GMT"
},
{
"version": "v2",
"created": "Wed, 15 May 2013 16:47:32 GMT"
}
] | 2013-06-06T00:00:00 |
[
[
"Grenet",
"Bruno",
""
],
[
"Monteil",
"Thierry",
""
],
[
"Thomassé",
"Stéphan",
""
]
] |
new_dataset
| 0.998592 |
1306.0947
|
Ismael Rafols
|
Ismael Rafols, Michael M. Hopkins, Jarno Hoekman, Josh Siepel, Alice
O'Hare, Antonio Perianes-Rodriguez and Paul Nightingale
|
Big Pharma, little science? A bibliometric perspective on big pharma's
R&D decline
| null | null |
10.1016/j.techfore.2012.06.007
| null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a widespread perception that pharmaceutical R&D is facing a
productivity crisis characterised by stagnation in the numbers of new drug
approvals in the face of increasing R&D costs. This study explores
pharmaceutical R&D dynamics by examining the publication activities of all R&D
laboratories of the major European and US pharmaceutical firms during the
period 1995-2009. The empirical findings present an industry in
transformation.In the first place, we observe a decline of the total number of
publications by large firms. Second, we show a relative increase of their
external collaborations suggesting a tendency to outsource, and a
diversification of the disciplinary base, in particular towards computation,
health services and more clinical approaches. Also evident is a more pronounced
decline in publications by both R&D laboratories located in Europe and by firms
with European headquarters. Finally, while publications by Big Pharma in
emerging economies sharply increase, they remain extremely low compared with
those in developed countries. In summary, the trend in this transformation is
one of a gradual decrease in internal research efforts and increasing reliance
on external research. These empirical insights support the view that large
pharmaceutical firms are increasingly becoming networks integrators rather than
the prime locus of drug discovery.
|
[
{
"version": "v1",
"created": "Wed, 5 Jun 2013 00:02:40 GMT"
}
] | 2013-06-06T00:00:00 |
[
[
"Rafols",
"Ismael",
""
],
[
"Hopkins",
"Michael M.",
""
],
[
"Hoekman",
"Jarno",
""
],
[
"Siepel",
"Josh",
""
],
[
"O'Hare",
"Alice",
""
],
[
"Perianes-Rodriguez",
"Antonio",
""
],
[
"Nightingale",
"Paul",
""
]
] |
new_dataset
| 0.990776 |
1306.1034
|
Mehul Bhatt
|
Mehul Bhatt and Jakob Suchan and Christian Freksa
|
ROTUNDE - A Smart Meeting Cinematography Initiative: Tools, Datasets,
and Benchmarks for Cognitive Interpretation and Control
|
Appears in AAAI-2013 Workshop on: Space, Time, and Ambient
Intelligence (STAMI 2013)
| null | null | null |
cs.AI cs.CV cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construe smart meeting cinematography with a focus on professional
situations such as meetings and seminars, possibly conducted in a distributed
manner across socio-spatially separated groups. The basic objective in smart
meeting cinematography is to interpret professional interactions involving
people, and automatically produce dynamic recordings of discussions, debates,
presentations etc in the presence of multiple communication modalities. Typical
modalities include gestures (e.g., raising one's hand for a question,
applause), voice and interruption, electronic apparatus (e.g., pressing a
button), movement (e.g., standing-up, moving around) etc. ROTUNDE, an instance
of smart meeting cinematography concept, aims to: (a) develop
functionality-driven benchmarks with respect to the interpretation and control
capabilities of human-cinematographers, real-time video editors, surveillance
personnel, and typical human performance in everyday situations; (b) Develop
general tools for the commonsense cognitive interpretation of dynamic scenes
from the viewpoint of visuo-spatial cognition centred perceptual
narrativisation. Particular emphasis is placed on declarative representations
and interfacing mechanisms that seamlessly integrate within large-scale
cognitive (interaction) systems and companion technologies consisting of
diverse AI sub-components. For instance, the envisaged tools would provide
general capabilities for high-level commonsense reasoning about space, events,
actions, change, and interaction.
|
[
{
"version": "v1",
"created": "Wed, 5 Jun 2013 09:40:24 GMT"
}
] | 2013-06-06T00:00:00 |
[
[
"Bhatt",
"Mehul",
""
],
[
"Suchan",
"Jakob",
""
],
[
"Freksa",
"Christian",
""
]
] |
new_dataset
| 0.990474 |
1305.4731
|
Danilo De Donno
|
D. De Donno, L. Catarinucci, and L. Tarricone
|
An UHF RFID Energy-Harvesting System Enhanced by a DC-DC Charge Pump in
Silicon-on-Insulator Technology
| null |
IEEE Microwave and Wireless Components Letters, vol. 23, no. 6,
pp. 315-317, June 2013
|
10.1109/LMWC.2013.2258002
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An RF-DC converter enhanced by a DC-DC voltage booster in
silicon-on-insulator technology for UHF radio frequency identification (RFID)
energy harvesting is presented in this letter. When the received RF power level
is -14 dBm or higher, the system, fabricated on an FR4 substrate using
off-the-shelf low-cost discrete components and connected to a flexible dipole
antenna, is able to produce 2.4-V DC voltage to power general-purpose
electronic devices. As a simple proof of concept,a device comprising
microcontroller, temperature sensor, and EEPROM is considered in this work. The
experimental results demonstrate the capability of the system to autonomously
perform temperature data logging up to a distance of 5 m from a conventional
UHF RFID reader used as an RF energy source.
|
[
{
"version": "v1",
"created": "Tue, 21 May 2013 06:41:31 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jun 2013 07:15:01 GMT"
}
] | 2013-06-05T00:00:00 |
[
[
"De Donno",
"D.",
""
],
[
"Catarinucci",
"L.",
""
],
[
"Tarricone",
"L.",
""
]
] |
new_dataset
| 0.999314 |
1306.0587
|
Tiffany Jing Li
|
Jing Li, Kai Xie
|
Analog Turbo Codes: Turning Chaos to Reliability
|
46th Annual Conference on Computer Sciences and Information Systems
(CISS 2012), 2012, 5 pages, 5 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analog error correction codes, by relaxing the source space and the codeword
space from discrete fields to continuous fields, present a generalization of
digital codes. While linear codes are sufficient for digital codes, they are
not for analog codes, and hence nonlinear mappings must be employed to fully
harness the power of analog codes. This paper demonstrates new ways of building
effective (nonlinear) analog codes from a special class of nonlinear,
fast-diverging functions known as the chaotic functions. It is shown that the
"butterfly effect" of the chaotic functions matches elegantly with the distance
expansion condition required for error correction, and that the useful idea in
digital turbo codes can be exploited to construct efficient turbo-like chaotic
analog codes. Simulations show that the new analog codes can perform on par
with, or better than, their digital counter-parts when transmitting analog
sources.
|
[
{
"version": "v1",
"created": "Mon, 3 Jun 2013 20:42:23 GMT"
}
] | 2013-06-05T00:00:00 |
[
[
"Li",
"Jing",
""
],
[
"Xie",
"Kai",
""
]
] |
new_dataset
| 0.999671 |
1306.0741
|
Jan K\v{r}et\'insk\'y
|
Nikola Bene\v{s}, Beno\^it Delahaye, Uli Fahrenberg, Jan
K\v{r}et\'insk\'y, Axel Legay
|
Hennessy-Milner Logic with Greatest Fixed Points as a Complete
Behavioural Specification Theory
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are two fundamentally different approaches to specifying and verifying
properties of systems. The logical approach makes use of specifications given
as formulae of temporal or modal logics and relies on efficient model checking
algorithms; the behavioural approach exploits various equivalence or refinement
checking methods, provided the specifications are given in the same formalism
as implementations.
In this paper we provide translations between the logical formalism of
Hennessy-Milner logic with greatest fixed points and the behavioural formalism
of disjunctive modal transition systems. We also introduce a new operation of
quotient for the above equivalent formalisms, which is adjoint to structural
composition and allows synthesis of missing specifications from partial
implementations. This is a substantial generalisation of the quotient for
deterministic modal transition systems defined in earlier papers.
|
[
{
"version": "v1",
"created": "Tue, 4 Jun 2013 12:22:34 GMT"
}
] | 2013-06-05T00:00:00 |
[
[
"Beneš",
"Nikola",
""
],
[
"Delahaye",
"Benoît",
""
],
[
"Fahrenberg",
"Uli",
""
],
[
"Křetínský",
"Jan",
""
],
[
"Legay",
"Axel",
""
]
] |
new_dataset
| 0.998625 |
1201.4089
|
Markus Kr\"otzsch
|
Markus Kr\"otzsch, Frantisek Simancik, Ian Horrocks
|
A Description Logic Primer
| null | null | null | null |
cs.AI cs.LO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper provides a self-contained first introduction to description logics
(DLs). The main concepts and features are explained with examples before syntax
and semantics of the DL SROIQ are defined in detail. Additional sections review
light-weight DL languages, discuss the relationship to the Web Ontology
Language OWL and give pointers to further reading.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2012 15:51:01 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Mar 2013 07:17:05 GMT"
},
{
"version": "v3",
"created": "Mon, 3 Jun 2013 13:09:48 GMT"
}
] | 2013-06-04T00:00:00 |
[
[
"Krötzsch",
"Markus",
""
],
[
"Simancik",
"Frantisek",
""
],
[
"Horrocks",
"Ian",
""
]
] |
new_dataset
| 0.99984 |
1212.6036
|
Gang Mei
|
Gang Mei, John C.Tipper and Nengxiong Xu
|
T-Base: A Triangle-Based Iterative Algorithm for Smoothing Quadrilateral
Meshes
|
Proceedings of the 2012 International Conference on Information
Technology and Software Engineering Lecture Notes in Electrical Engineering
Volume 212, 2013, pp 305-315
|
Lecture Notes in Electrical EngineeringVolume 212, 2013, pp
305-315
|
10.1007/978-3-642-34531-9_32
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel approach named TBase for smoothing planar and surface
quadrilateral meshes. Our motivation is that the best shape of quadrilateral
element (square) can be virtually divided into a pair of equilateral right
triangles by any of its diagonals. When move a node to smooth a quadrilateral,
it is optimal to make a pair of triangles divided by a diagonal be equilateral
right triangles separately. The finally smoothed position is obtained by
weighting all individual optimal positions. Three variants are produced
according to the determination of weights. Tests by the TBase are given and
compared with Laplacian smoothing: The Vari.1 of TBase is effectively identical
to Laplacian smoothing for planar quad meshes, while Vari.2 is the best. For
the quad mesh on underlying parametric surface and interpolation surface,
Vari.2 and Vari.1 are best, respectively.
|
[
{
"version": "v1",
"created": "Tue, 25 Dec 2012 12:34:34 GMT"
}
] | 2013-06-04T00:00:00 |
[
[
"Mei",
"Gang",
""
],
[
"Tipper",
"John C.",
""
],
[
"Xu",
"Nengxiong",
""
]
] |
new_dataset
| 0.982211 |
1305.3251
|
Suranjan Chakraborty
|
Amitabha Sinha, Soumojit Acharyya, Suranjan Chakraborty and Mitrava
Sarkar
|
Field Programmable DSP Arrays - A Novel Reconfigurable Architecture for
Efficient Realization of Digital Signal Processing Functions
|
18 pages, 17 figures. This paper has been published into Signal &
Image Processing : An International Journal (SIPIJ - AIRCC) Vol.4, No.2,
April 2013. http://airccse.org/journal/sipij/current2013.html
|
Signal & Image Processing : An International Journal (SIPIJ -
AIRCC) Vol.4, No.2, April 2013
|
10.5121/sipij.2013.4204
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digital Signal Processing functions are widely used in real time high speed
applications. Those functions are generally implemented either on ASICs with
inflexibility, or on FPGAs with bottlenecks of relatively smaller utilization
factor or lower speed compared to ASIC. The proposed reconfigurable DSP
processor is redolent to FPGA, but with basic fixed Common Modules (CMs) (like
adders, subtractors, multipliers, scaling units, shifters) instead of CLBs.
This paper introduces the development of a reconfigurable DSP processor that
integrates different filter and transform functions. The switching between DSP
functions is occurred by reconfiguring the interconnection between CMs.
Validation of the proposed reconfigurable architecture has been achieved on
Virtex5 FPGA. The architecture provides sufficient amount of flexibility,
parallelism and scalability.
|
[
{
"version": "v1",
"created": "Mon, 13 May 2013 16:37:14 GMT"
}
] | 2013-06-04T00:00:00 |
[
[
"Sinha",
"Amitabha",
""
],
[
"Acharyya",
"Soumojit",
""
],
[
"Chakraborty",
"Suranjan",
""
],
[
"Sarkar",
"Mitrava",
""
]
] |
new_dataset
| 0.975711 |
1306.0089
|
Suranjan Chakraborty
|
Amitabha Sinha, Mitrava Sarkar, Soumojit Acharyya, Suranjan
Chakraborty
|
A Novel Reconfigurable Architecture of a DSP Processor for Efficient
Mapping of DSP Functions using Field Programmable DSP Arrays
|
8 Pages, 12 Figures, ACM SIGARCH Computer Architecture News. arXiv
admin note: substantial text overlap with arXiv:1305.3251
|
ACM SIGARCH Computer Architecture News, Volume 41 Issue 2, May
2013, Pages 1-8
|
10.1145/2490302.2490304
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Development of modern integrated circuit technologies makes it feasible to
develop cheaper, faster and smaller special purpose signal processing function
circuits. Digital Signal processing functions are generally implemented either
on ASICs with inflexibility, or on FPGAs with bottlenecks of relatively smaller
utilization factor or lower speed compared to ASIC. Field Programmable DSP
Array (FPDA) is the proposed DSP dedicated device, redolent to FPGA, but with
basic fixed common modules (CMs) (like adders, subtractors, multipliers,
scaling units, shifters) instead of CLBs. This paper introduces the development
of reconfigurable system architecture with a focus on FPDA that integrates
different DSP functions like DFT, FFT, DCT, FIR, IIR, and DWT etc. The
switching between DSP functions is occurred by reconfiguring the
interconnection between CMs. Validation of the proposed architecture has been
achieved on Virtex5 FPGA. The architecture provides sufficient amount of
flexibility, parallelism and scalability.
|
[
{
"version": "v1",
"created": "Sat, 1 Jun 2013 09:04:40 GMT"
}
] | 2013-06-04T00:00:00 |
[
[
"Sinha",
"Amitabha",
""
],
[
"Sarkar",
"Mitrava",
""
],
[
"Acharyya",
"Soumojit",
""
],
[
"Chakraborty",
"Suranjan",
""
]
] |
new_dataset
| 0.999137 |
1306.0125
|
Jacob Whitehill
|
Jacob Whitehill
|
Understanding ACT-R - an Outsider's Perspective
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ACT-R theory of cognition developed by John Anderson and colleagues
endeavors to explain how humans recall chunks of information and how they solve
problems. ACT-R also serves as a theoretical basis for "cognitive tutors",
i.e., automatic tutoring systems that help students learn mathematics, computer
programming, and other subjects. The official ACT-R definition is distributed
across a large body of literature spanning many articles and monographs, and
hence it is difficult for an "outsider" to learn the most important aspects of
the theory. This paper aims to provide a tutorial to the core components of the
ACT-R theory.
|
[
{
"version": "v1",
"created": "Sat, 1 Jun 2013 15:48:58 GMT"
}
] | 2013-06-04T00:00:00 |
[
[
"Whitehill",
"Jacob",
""
]
] |
new_dataset
| 0.988507 |
1306.0258
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Slime mould tactile sensor
| null | null | null | null |
cs.ET nlin.AO physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Slime mould P. polycephalum is a single cells visible by unaided eye. The
cells shows a wide spectrum of intelligent behaviour. By interpreting the
behaviour in terms of computation one can make a slime mould based computing
device. The Physarum computers are capable to solve a range of tasks of
computational geometry, optimisation and logic. Physarum computers designed so
far lack of localised inputs. Commonly used inputs --- illumination and
chemo-attractants and -repellents --- usually act on extended domains of the
slime mould's body. Aiming to design massive-parallel tactile inputs for slime
mould computers we analyse a temporal dynamic of P. polycephalum's electrical
response to tactile stimulation. In experimental laboratory studies we discover
how the Physarum responds to application and removal of a local mechanical
pressure with electrical potential impulses and changes in its electrical
potential oscillation patterns.
|
[
{
"version": "v1",
"created": "Sun, 2 Jun 2013 22:38:48 GMT"
}
] | 2013-06-04T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999573 |
1306.0369
|
Manish Gupta
|
Arnav Goyal and Dixita Limbachiya and Shikhar Kumar Gupta and Foram
Joshi and Sushant Pritmani and Akshita Sahai and Manish K Gupta
|
DNA Pen: A Tool for Drawing on a Molecular Canvas
|
Submitted to DNA19. The software is available at
http://www.guptalab.org/dnapen
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DNA origami is an interdisciplinary area where DNA can be used as a building
block for making useful stuff at nanoscale. This work presents an open source
software DNA pen (based on the recent work of Peng Yin and his group) which can
be used (using free hand and digital molecular canvas) to draw an object at
nanoscale. Software generates error free DNA sequences which can be used in the
wet lab to create the object at the nanoscale. Using DNA pen we have drawn
several objects including the map of India and sanskrit letter "Om" from free
hand molecular canvas and digital letter DNA using digitized molecular canvas.
|
[
{
"version": "v1",
"created": "Mon, 3 Jun 2013 11:51:40 GMT"
}
] | 2013-06-04T00:00:00 |
[
[
"Goyal",
"Arnav",
""
],
[
"Limbachiya",
"Dixita",
""
],
[
"Gupta",
"Shikhar Kumar",
""
],
[
"Joshi",
"Foram",
""
],
[
"Pritmani",
"Sushant",
""
],
[
"Sahai",
"Akshita",
""
],
[
"Gupta",
"Manish K",
""
]
] |
new_dataset
| 0.9997 |
1305.7294
|
Chunming Tang
|
Chunming Tang, Yanfeng Qi, Maozhi Xu
|
A Note on Cyclic Codes from APN Functions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes, as linear block error-correcting codes in coding theory, play a
vital role and have wide applications. Ding in \cite{D} constructed a number of
classes of cyclic codes from almost perfect nonlinear (APN) functions and
planar functions over finite fields and presented ten open problems on cyclic
codes from highly nonlinear functions. In this paper, we consider two open
problems involving the inverse APN functions $f(x)=x^{q^m-2}$ and the Dobbertin
APN function $f(x)=x^{2^{4i}+2^{3i}+2^{2i}+2^{i}-1}$. From the calculation of
linear spans and the minimal polynomials of two sequences generated by these
two classes of APN functions, the dimensions of the corresponding cyclic codes
are determined and lower bounds on the minimum weight of these cyclic codes are
presented. Actually, we present a framework for the minimal polynomial and
linear span of the sequence $s^{\infty}$ defined by $s_t=Tr((1+\alpha^t)^e)$,
where $\alpha$ is a primitive element in $GF(q)$. These techniques can also be
applied into other open problems in \cite{D}.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 03:15:32 GMT"
}
] | 2013-06-03T00:00:00 |
[
[
"Tang",
"Chunming",
""
],
[
"Qi",
"Yanfeng",
""
],
[
"Xu",
"Maozhi",
""
]
] |
new_dataset
| 0.991056 |
1305.7416
|
Uwe Aickelin
|
Feng Gu, Julie Greensmith, Uwe Aickelin
|
The Dendritic Cell Algorithm for Intrusion Detection
|
Bio-Inspired Communications and Networking, IGI Global, 84-102, 2011
| null | null | null |
cs.CR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As one of the solutions to intrusion detection problems, Artificial Immune
Systems (AIS) have shown their advantages. Unlike genetic algorithms, there is
no one archetypal AIS, instead there are four major paradigms. Among them, the
Dendritic Cell Algorithm (DCA) has produced promising results in various
applications. The aim of this chapter is to demonstrate the potential for the
DCA as a suitable candidate for intrusion detection problems. We review some of
the commonly used AIS paradigms for intrusion detection problems and
demonstrate the advantages of one particular algorithm, the DCA. In order to
clearly describe the algorithm, the background to its development and a formal
definition are given. In addition, improvements to the original DCA are
presented and their implications are discussed, including previous work done on
an online analysis component with segmentation and ongoing work on automated
data preprocessing. Based on preliminary results, both improvements appear to
be promising for online anomaly-based intrusion detection.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 14:33:12 GMT"
}
] | 2013-06-03T00:00:00 |
[
[
"Gu",
"Feng",
""
],
[
"Greensmith",
"Julie",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.984143 |
1305.7434
|
Uwe Aickelin
|
William Wilson, Phil Birkin, Uwe Aickelin
|
Motif Detection Inspired by Immune Memory (JORS)
|
Journal of the Operational Research Society 62 (2), 253-265, 2011.
arXiv admin note: text overlap with arXiv:1004.3887, arXiv:1002.0432,
arXiv:1006.1526
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The search for patterns or motifs in data represents an area of key interest
to many researchers. In this paper we present the Motif Tracking Algorithm, a
novel immune inspired pattern identification tool that is able to identify
variable length unknown motifs which repeat within time series data. The
algorithm searches from a neutral perspective that is independent of the data
being analysed and the underlying motifs. In this paper we test the flexibility
of the motif tracking algorithm by applying it to the search for patterns in
two industrial data sets. The algorithm is able to identify a population of
meaningful motifs in both cases, and the value of these motifs is discussed.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 14:55:45 GMT"
}
] | 2013-06-03T00:00:00 |
[
[
"Wilson",
"William",
""
],
[
"Birkin",
"Phil",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.965863 |
1305.7466
|
Daqiang Zhang
|
Feng Xia, Linqiang Wang, Daqiang Zhang, Xue Zhang, Ruixia Gao
|
Ada-MAC: An Adaptive MAC Protocol for Real-time and Reliable Health
Monitoring,
|
IEEE International Conference on Cyber Technology in Automation,
Control and Intelligent Systems (IEEE CYBER 2012), Bangkok, Thailand, May
27-31, pp. 203 - 208, 2012
| null |
10.1109/CYBER.2012.6392554
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IEEE 802.15.4 is regarded as one of the most suitable communication protocols
for cyber-physical applications of wireless sensor and actuator networks. This
is because this protocol is able to achieve low-power and low-cost transmission
in wireless personal area networks. But most cyber-physical systems (CPSs)
require a degree of real-time and reliability from the underlying communication
protocol. Some of them are stricter than the others. However, IEEE 802.15.4
protocol cannot provide reliability and real-time transmission for
time-critical and delay-sensitive data in cyber-physical applications. To solve
this problem, we propose a new MAC protocol, i.e. the Ada-MAC protocol, which
is based on IEEE 802.15.4 beacon-enabled mode. It can support cyber-physical
applications such as health monitoring, which require stringent real- time and
reliability guarantees. We implement the proposed protocol on the OMNET++
platform and conduct a performance evaluation of the proposed protocol with
comparison against the traditional IEEE 802.15.4 protocol. The results are
presented and analyzed.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 15:59:02 GMT"
}
] | 2013-06-03T00:00:00 |
[
[
"Xia",
"Feng",
""
],
[
"Wang",
"Linqiang",
""
],
[
"Zhang",
"Daqiang",
""
],
[
"Zhang",
"Xue",
""
],
[
"Gao",
"Ruixia",
""
]
] |
new_dataset
| 0.99765 |
1305.7482
|
Uwe Aickelin
|
Xiyang Liu, Zhongjie Ren, Xiuling Chang, Haichang Gao, Uwe Aickelin
|
Draw a line on your PDA to authenticate
|
The sixth Symposium on Usable Privacy and Security, SOUPS2010, July
14-16, Redmond, WA, 7, 2010
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The trend toward a highly mobile workforce and the ubiquity of graphical
interfaces (such as the stylus and touch-screen) has enabled the emergence of
graphical authentications in Personal Digital Assistants (PDAs) [1]. However,
most of the current graphical password schemes are vulnerable to
shoulder-surfing [2,3], a known risk where an attacker can capture a password
by direct observation or by recording the authentication session. Several
approaches have been developed to deal with this problem, but they have
significant usability drawbacks, usually in the time and effort to log in,
making them less suitable for authentication [4, 8]. For example, it is
time-consuming for users to log in CHC [4] and there are complex text memory
requirements in scheme proposed by Hong [5]. With respect to the scheme
proposed by Weinshall [6], not only is it intricate to log in, but also the
main claim of resisting shoulder-surfing is proven false [7]. In this paper, we
introduce a new graphical password scheme which provides a good resistance to
shouldersurfing and preserves a desirable usability.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 16:41:47 GMT"
}
] | 2013-06-03T00:00:00 |
[
[
"Liu",
"Xiyang",
""
],
[
"Ren",
"Zhongjie",
""
],
[
"Chang",
"Xiuling",
""
],
[
"Gao",
"Haichang",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.998343 |
1009.3006
|
Jean-Lou De Carufel
|
Prosenjit Bose and Jean-Lou De Carufel
|
Minimum-Area Enclosing Triangle with a Fixed Angle
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a set S of n points in the plane and a fixed angle 0 < omega < pi, we
show how to find in O(n log n) time all triangles of minimum area with one
angle omega that enclose S. We prove that in general, the solution cannot be
written without cubic roots. We also prove an Omega(n log n) lower bound for
this problem in the algebraic computation tree model. If the input is a convex
n-gon, our algorithm takes Theta(n) time.
|
[
{
"version": "v1",
"created": "Wed, 15 Sep 2010 19:45:35 GMT"
},
{
"version": "v2",
"created": "Thu, 30 May 2013 15:41:10 GMT"
}
] | 2013-05-31T00:00:00 |
[
[
"Bose",
"Prosenjit",
""
],
[
"De Carufel",
"Jean-Lou",
""
]
] |
new_dataset
| 0.988785 |
1305.7014
|
Bohdan Pavlyshenko
|
Bohdan Pavlyshenko
|
Tweets Miner for Stock Market Analysis
| null | null | null | null |
cs.IR cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a software package for the data mining of Twitter
microblogs for the purpose of using them for the stock market analysis. The
package is written in R langauge using apropriate R packages. The model of
tweets has been considered. We have also compared stock market charts with
frequent sets of keywords in Twitter microblogs messages.
|
[
{
"version": "v1",
"created": "Thu, 30 May 2013 06:35:52 GMT"
}
] | 2013-05-31T00:00:00 |
[
[
"Pavlyshenko",
"Bohdan",
""
]
] |
new_dataset
| 0.982256 |
1305.7103
|
Prasenjit Chanak
|
Prasenjit Chanak, Tuhina Samanta, Indrajit Banerjee
|
Fault-tolerant multipath routing scheme for energy efficient wireless
sensor networks
| null |
International Journal of Wireless & Mobile Networks (IJWMN) Vol.
5, No. 2, April 2013
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The main challenge in wireless sensor network is to improve the fault
tolerance of each node and also provide an energy efficient fast data routing
service. In this paper we propose an energy efficient node fault diagnosis and
recovery for wireless sensor networks referred as fault tolerant multipath
routing scheme for energy efficient wireless sensor network (FTMRS).The FTMRS
is based on multipath data routing scheme. One shortest path is use for main
data routing in FTMRS technique and other two backup paths are used as
alternative path for faulty network and to handle the overloaded traffic on
main channel. Shortest path data routing ensures energy efficient data routing.
The performance analysis of FTMRS shows better results compared to other
popular fault tolerant techniques in wireless sensor networks.
|
[
{
"version": "v1",
"created": "Thu, 30 May 2013 13:34:53 GMT"
}
] | 2013-05-31T00:00:00 |
[
[
"Chanak",
"Prasenjit",
""
],
[
"Samanta",
"Tuhina",
""
],
[
"Banerjee",
"Indrajit",
""
]
] |
new_dataset
| 0.999602 |
1305.6669
|
Alejandro Erickson
|
Alejandro Erickson and Frank Ruskey
|
Domino Tatami Covering is NP-complete
|
10 pages, accepted at The International Workshop on Combinatorial
Algorithms (IWOCA) 2013
| null | null | null |
cs.CC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A covering with dominoes of a rectilinear region is called \emph{tatami} if
no four dominoes meet at any point. We describe a reduction from planar 3SAT to
Domino Tatami Covering. As a consequence it is NP-complete to decide whether
there is a perfect matching of a graph that meets every 4-cycle, even if the
graph is restricted to be an induced subgraph of the grid-graph. The gadgets
used in the reduction were discovered with the help of a SAT-solver.
|
[
{
"version": "v1",
"created": "Wed, 29 May 2013 01:00:33 GMT"
}
] | 2013-05-30T00:00:00 |
[
[
"Erickson",
"Alejandro",
""
],
[
"Ruskey",
"Frank",
""
]
] |
new_dataset
| 0.999436 |
1305.6693
|
Pablo P\'erez-Lantero
|
Sergey Bereg, Ruy Fabila-Monroy, David Flores-Pe\~naloza, Mario Lopez,
Pablo P\'erez-Lantero
|
Drawing the double circle on a grid of minimum size
| null | null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1926, Jarn\'ik introduced the problem of drawing a convex $n$-gon with
vertices having integer coordinates. He constructed such a drawing in the grid
$[1,c\cdot n^{3/2}]^2$ for some constant $c>0$, and showed that this grid size
is optimal up to a constant factor. We consider the analogous problem for
drawing the double circle, and prove that it can be done within the same grid
size. Moreover, we give an O(n)-time algorithm to construct such a point set.
|
[
{
"version": "v1",
"created": "Wed, 29 May 2013 04:56:57 GMT"
}
] | 2013-05-30T00:00:00 |
[
[
"Bereg",
"Sergey",
""
],
[
"Fabila-Monroy",
"Ruy",
""
],
[
"Flores-Peñaloza",
"David",
""
],
[
"Lopez",
"Mario",
""
],
[
"Pérez-Lantero",
"Pablo",
""
]
] |
new_dataset
| 0.981454 |
1305.6827
|
Frederic Le Mouel
|
Marie-Ange L\`ebre (CITI), Fr\'ed\'eric Le Mou\"el (CITI), Eric
M\'enard
|
Mod\`ele multi-\'echelles pour les services dans les VANET
|
in French
|
Journ\'ees Nationales des Communications dans les Transports
(JNCT) (2013)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Service deployment, integration and interactions in VANET are fast expanding.
They are now focusing only on driver security. In the future, with in-car
application deployments, the car will be considered as a user extension - in
the same way as smartphones actually. We propose a multi-level graph model to
challenge this VANET / Application / User integration.
|
[
{
"version": "v1",
"created": "Wed, 29 May 2013 15:06:40 GMT"
}
] | 2013-05-30T00:00:00 |
[
[
"Lèbre",
"Marie-Ange",
"",
"CITI"
],
[
"Mouël",
"Frédéric Le",
"",
"CITI"
],
[
"Ménard",
"Eric",
""
]
] |
new_dataset
| 0.993062 |
1302.5153
|
Arash Ghayoori
|
Arash Ghayoori and T. Aaron Gulliver
|
Constructing Polar Codes Using Iterative Bit-Channel Upgrading
|
arXiv admin note: text overlap with arXiv:1105.6164 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The definition of polar codes given by Arikan is explicit, but the
construction complexity is an issue. This is due to the exponential growth in
the size of the output alphabet of the bit-channels as the codeword length
increases. Tal and Vardy recently presented a method for constructing polar
codes which controls this growth. They approximated each bit-channel with a
better channel and a worse channel while reducing the alphabet size. They
constructed a polar code based on the worse channel and used the better channel
to measure the distance from the optimal channel. This paper considers the
knowledge gained from the perspective of the better channel. A method is
presented using iterative upgrading of the bit-channels which successively
results in a channel closer to the original one. It is shown that this approach
can be used to obtain a channel arbitrarily close to the original channel, and
therefore to the optimal construction of a polar code.
|
[
{
"version": "v1",
"created": "Thu, 21 Feb 2013 00:53:25 GMT"
},
{
"version": "v2",
"created": "Tue, 28 May 2013 03:27:01 GMT"
}
] | 2013-05-29T00:00:00 |
[
[
"Ghayoori",
"Arash",
""
],
[
"Gulliver",
"T. Aaron",
""
]
] |
new_dataset
| 0.99815 |
1305.6376
|
Frank Vanderzwet
|
Frank Vanderzwet
|
Fractional Pebbling Game Lower Bounds
|
Graduate Research Paper for University of Toronto. Completion of
paper assisted by Professor Stephen Cook and Professor Toniann Pitassi
| null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractional pebbling is a generalization of black-white pebbling introduced
recently. In this reasearch paper we solve an open problem by proving a tight
lower bound on the pebble weight required to fractionally pebble a balanced
d-ary tree of height h. This bound has close ties with branching programs and
the separation of P from NL.
|
[
{
"version": "v1",
"created": "Tue, 28 May 2013 06:06:53 GMT"
}
] | 2013-05-29T00:00:00 |
[
[
"Vanderzwet",
"Frank",
""
]
] |
new_dataset
| 0.963625 |
1305.6543
|
Gregory Malecha
|
Gregory Malecha, Adam Chlipala, Thomas Braibant, Patrick Hulin, Edward
Z. Yang
|
MirrorShard: Proof by Computational Reflection with Verified Hints
| null | null | null | null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a method for building composable and extensible verification
procedures within the Coq proof assistant. Unlike traditional methods that rely
on run-time generation and checking of proofs, we use verified-correct
procedures with Coq soundness proofs. Though they are internalized in Coq's
logic, our provers support sound extension by users with hints over new
domains, enabling automated reasoning about user-defined abstract predicates.
We maintain soundness by developing an architecture for modular packaging,
construction, and composition of hint databases, which had previously only been
implemented in Coq at the level of its dynamically typed, proof-generating
tactic language. Our provers also include rich handling of unification
variables, enabling integration with other tactic-based deduction steps within
Coq. We have implemented our techniques in MirrorShard, an open-source
framework for reflective verification. We demonstrate its applicability by
instantiating it to separation logic in order to reason about imperative
program verification.
|
[
{
"version": "v1",
"created": "Tue, 28 May 2013 15:50:10 GMT"
}
] | 2013-05-29T00:00:00 |
[
[
"Malecha",
"Gregory",
""
],
[
"Chlipala",
"Adam",
""
],
[
"Braibant",
"Thomas",
""
],
[
"Hulin",
"Patrick",
""
],
[
"Yang",
"Edward Z.",
""
]
] |
new_dataset
| 0.971548 |
1305.6555
|
Sandor P. Fekete
|
Michael A. Bender and Martin Farach-Colton and S\'andor P. Fekete and
Jeremy T. Fineman and Seth Gilbert
|
Reallocation Problems in Scheduling
|
9 oages, 1 table; extended abstract version to appear in SPAA 2013
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In traditional on-line problems, such as scheduling, requests arrive over
time, demanding available resources. As each request arrives, some resources
may have to be irrevocably committed to servicing that request. In many
situations, however, it may be possible or even necessary to reallocate
previously allocated resources in order to satisfy a new request. This
reallocation has a cost. This paper shows how to service the requests while
minimizing the reallocation cost. We focus on the classic problem of scheduling
jobs on a multiprocessor system. Each unit-size job has a time window in which
it can be executed. Jobs are dynamically added and removed from the system. We
provide an algorithm that maintains a valid schedule, as long as a sufficiently
feasible schedule exists. The algorithm reschedules only a total number of
O(min{log^* n, log^* Delta}) jobs for each job that is inserted or deleted from
the system, where n is the number of active jobs and Delta is the size of the
largest window.
|
[
{
"version": "v1",
"created": "Tue, 28 May 2013 16:34:44 GMT"
}
] | 2013-05-29T00:00:00 |
[
[
"Bender",
"Michael A.",
""
],
[
"Farach-Colton",
"Martin",
""
],
[
"Fekete",
"Sándor P.",
""
],
[
"Fineman",
"Jeremy T.",
""
],
[
"Gilbert",
"Seth",
""
]
] |
new_dataset
| 0.984586 |
1301.4786
|
Yeow-Khiang Chia
|
Yeow-Khiang Chia and Sumei Sun and Rui Zhang
|
Energy Cooperation in Cellular Networks with Renewable Powered Base
Stations
|
V1: Presented at IEEE WCNC 2013. V2: Extended version. Submitted to
IEEE Trans. Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a model for energy cooperation between cellular
base stations (BSs) with individual hybrid power supplies (including both the
conventional grid and renewable energy sources), limited energy storages, and
connected by resistive power lines for energy sharing. When the renewable
energy profile and energy demand profile at all BSs are deterministic or known
ahead of time, we show that the optimal energy cooperation policy for the BSs
can be found by solving a linear program. We show the benefits of energy
cooperation in this regime. When the renewable energy and demand profiles are
stochastic and only causally known at the BSs, we propose an online energy
cooperation algorithm and show the optimality properties of this algorithm
under certain conditions. Furthermore, the energy-saving performances of the
developed offline and online algorithms are compared by simulations, and the
effect of the availability of energy state information (ESI) on the performance
gains of the BSs' energy cooperation is investigated. Finally, we propose a
hybrid algorithm that can incorporate offline information about the energy
profiles, but operates in an online manner.
|
[
{
"version": "v1",
"created": "Mon, 21 Jan 2013 08:21:24 GMT"
},
{
"version": "v2",
"created": "Mon, 27 May 2013 14:12:26 GMT"
}
] | 2013-05-28T00:00:00 |
[
[
"Chia",
"Yeow-Khiang",
""
],
[
"Sun",
"Sumei",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.997254 |
1302.0744
|
V Lalitha
|
Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit S. Rawat, V.
Lalitha, O. Ozan Koyluoglu, P. Vijay Kumar, and Sriram Vishwanath
|
Explicit MBR All-Symbol Locality Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Node failures are inevitable in distributed storage systems (DSS). To enable
efficient repair when faced with such failures, two main techniques are known:
Regenerating codes, i.e., codes that minimize the total repair bandwidth; and
codes with locality, which minimize the number of nodes participating in the
repair process. This paper focuses on regenerating codes with locality, using
pre-coding based on Gabidulin codes, and presents constructions that utilize
minimum bandwidth regenerating (MBR) local codes. The constructions achieve
maximum resilience (i.e., optimal minimum distance) and have maximum capacity
(i.e., maximum rate). Finally, the same pre-coding mechanism can be combined
with a subclass of fractional-repetition codes to enable maximum resilience and
repair-by-transfer simultaneously.
|
[
{
"version": "v1",
"created": "Mon, 4 Feb 2013 16:15:15 GMT"
},
{
"version": "v2",
"created": "Mon, 27 May 2013 10:19:43 GMT"
}
] | 2013-05-28T00:00:00 |
[
[
"Kamath",
"Govinda M.",
""
],
[
"Silberstein",
"Natalia",
""
],
[
"Prakash",
"N.",
""
],
[
"Rawat",
"Ankit S.",
""
],
[
"Lalitha",
"V.",
""
],
[
"Koyluoglu",
"O. Ozan",
""
],
[
"Kumar",
"P. Vijay",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.999113 |
1305.5913
|
Fahd Ahmed Khan
|
Fahd Ahmed Khan, Kamel Tourki, Mohamed-Slim Alouini, and Khalid A.
Qaraqe
|
Performance of Opportunistic Fixed Gain Bidirectional Relaying With
Outdated CSI
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the impact of using outdated channel state information for
relay selection on the performance of a network where two sources communicate
with each other via fixed-gain amplifyand- forward relays. For a Rayleigh faded
channel, closed-form expressions for the outage probability, moment generating
function and symbol error rate are derived. Simulations results are also
presented to corroborate the derived analytical results. It is shown that
adding relays does not improve the performance if the channel is substantially
outdated. Furthermore, relay location is also taken into consideration and it
is shown that the performance can be improved by placing the relay closer to
the source whose channel is more outdated.
|
[
{
"version": "v1",
"created": "Sat, 25 May 2013 12:14:19 GMT"
}
] | 2013-05-28T00:00:00 |
[
[
"Khan",
"Fahd Ahmed",
""
],
[
"Tourki",
"Kamel",
""
],
[
"Alouini",
"Mohamed-Slim",
""
],
[
"Qaraqe",
"Khalid A.",
""
]
] |
new_dataset
| 0.986124 |
1305.6074
|
Andreas Holzer
|
Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith
|
On the Structure and Complexity of Rational Sets of Regular Languages
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a recent thread of papers, we have introduced FQL, a precise specification
language for test coverage, and developed the test case generation engine
FShell for ANSI C. In essence, an FQL test specification amounts to a set of
regular languages, each of which has to be matched by at least one test
execution. To describe such sets of regular languages, the FQL semantics uses
an automata-theoretic concept known as rational sets of regular languages
(RSRLs). RSRLs are automata whose alphabet consists of regular expressions.
Thus, the language accepted by the automaton is a set of regular expressions.
In this paper, we study RSRLs from a theoretic point of view. More
specifically, we analyze RSRL closure properties under common set theoretic
operations, and the complexity of membership checking, i.e., whether a regular
language is an element of a RSRL. For all questions we investigate both the
general case and the case of finite sets of regular languages. Although a few
properties are left as open problems, the paper provides a systematic semantic
foundation for the test specification language FQL.
|
[
{
"version": "v1",
"created": "Sun, 26 May 2013 22:05:23 GMT"
}
] | 2013-05-28T00:00:00 |
[
[
"Holzer",
"Andreas",
""
],
[
"Schallhart",
"Christian",
""
],
[
"Tautschnig",
"Michael",
""
],
[
"Veith",
"Helmut",
""
]
] |
new_dataset
| 0.995809 |
1305.6238
|
Richard Moot
|
Richard Moot (LaBRI)
|
Extended Lambek calculi and first-order linear logic
|
Logic and Language, Allemagne (2013)
| null | null | null |
cs.CL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First-order multiplicative intuitionistic linear logic (MILL1) can be seen as
an extension of the Lambek calculus. In addition to the fragment of MILL1 which
corresponds to the Lambek calculus (of Moot & Piazza 2001), I will show
fragments of MILL1 which generate the multiple context-free languages and which
correspond to the Displacement calculus of Morrilll e.a.
|
[
{
"version": "v1",
"created": "Mon, 27 May 2013 14:36:53 GMT"
}
] | 2013-05-28T00:00:00 |
[
[
"Moot",
"Richard",
"",
"LaBRI"
]
] |
new_dataset
| 0.997024 |
1006.1587
|
Rani Hod
|
Rani Hod, Marcin Krzywkowski
|
A construction for the hat problem on a directed graph
|
9 pages. v2: updated title and abstract to match journal version
|
Electronic J. Combinatorics 19 (2012) P30
| null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A team of players plays the following game. After a strategy session, each
player is randomly fitted with a blue or red hat. Then, without further
communication, everybody can try to guess simultaneously his or her own hat
color by looking at the hat colors of other players. Visibility is defined by a
directed graph; that is, vertices correspond to players, and a player can see
each player to whom she or he is connected by an arc. The team wins if at least
one player guesses his hat color correctly, and no one guesses his hat color
wrong; otherwise the team loses. The team aims to maximize the probability of a
win, and this maximum is called the hat number of the graph.
Previous works focused on the problem on complete graphs and on undirected
graphs. Some cases were solved, e.g., complete graphs of certain orders, trees,
cycles, bipartite graphs. These led Uriel Feige to conjecture that the hat
number of any graph is equal to the hat number of its maximum clique.
We show that the conjecture does not hold for directed graphs.Moreover, for
every value of the maximum clique size, we provide a tight characterization of
the range of possible values of the hat number. We construct families of
directed graphs with a fixed clique number the hat number of which is
asymptotically optimal. We also determine the hat number of tournaments to be
one half.
|
[
{
"version": "v1",
"created": "Tue, 8 Jun 2010 15:28:22 GMT"
},
{
"version": "v2",
"created": "Fri, 24 May 2013 19:03:35 GMT"
}
] | 2013-05-27T00:00:00 |
[
[
"Hod",
"Rani",
""
],
[
"Krzywkowski",
"Marcin",
""
]
] |
new_dataset
| 0.985343 |
1302.6421
|
Jonathan Heras
|
J\'onathan Heras and Ekaterina Komendantskaya
|
ML4PG in Computer Algebra verification
| null | null | null | null |
cs.LO cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ML4PG is a machine-learning extension that provides statistical proof hints
during the process of Coq/SSReflect proof development. In this paper, we use
ML4PG to find proof patterns in the CoqEAL library -- a library that was
devised to verify the correctness of Computer Algebra algorithms. In
particular, we use ML4PG to help us in the formalisation of an efficient
algorithm to compute the inverse of triangular matrices.
|
[
{
"version": "v1",
"created": "Tue, 26 Feb 2013 13:02:36 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Apr 2013 15:25:05 GMT"
},
{
"version": "v3",
"created": "Fri, 24 May 2013 08:01:20 GMT"
}
] | 2013-05-27T00:00:00 |
[
[
"Heras",
"Jónathan",
""
],
[
"Komendantskaya",
"Ekaterina",
""
]
] |
new_dataset
| 0.997212 |
1305.5653
|
George Garbis
|
George Garbis, Kostis Kyzirakos, and Manolis Koubarakis
|
Geographica: A Benchmark for Geospatial RDF Stores
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Geospatial extensions of SPARQL like GeoSPARQL and stSPARQL have recently
been defined and corresponding geospatial RDF stores have been implemented.
However, there is no widely used benchmark for evaluating geospatial RDF stores
which takes into account recent advances to the state of the art in this area.
In this paper, we develop a benchmark, called Geographica, which uses both
real-world and synthetic data to test the offered functionality and the
performance of some prominent geospatial RDF stores.
|
[
{
"version": "v1",
"created": "Fri, 24 May 2013 08:54:46 GMT"
}
] | 2013-05-27T00:00:00 |
[
[
"Garbis",
"George",
""
],
[
"Kyzirakos",
"Kostis",
""
],
[
"Koubarakis",
"Manolis",
""
]
] |
new_dataset
| 0.999419 |
1305.5703
|
Pedro Quaresma
|
Pedro Quaresma and Vanda Santos and Seifeddine Bouallegue
|
The Web Geometry Laboratory Project
|
5 pages; 2 figures; Conferences on Intelligent Computer Mathematics
(CICM2013), July 8-12, 2013, University of Bath, Bath, England
|
CICM 2013, LNAI (7961), 364-368, Springer, 2013
| null | null |
cs.CY cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The "Web Geometry Laboratory" (WGL) project's goal is to build an adaptive
and collaborative blended-learning Web-environment for geometry. In its current
version (1.0) the WGL is already a collaborative blended-learning
Web-environment integrating a dynamic geometry system (DGS) and having some
adaptive features. All the base features needed to implement the adaptive
module and to allow the integration of a geometry automated theorem prover
(GATP) are also already implemented. The actual testing of the WGL platform by
high-school teachers is underway and a field-test with high-school students is
being prepared. The adaptive module and the GATP integration will be the next
steps of this project.
|
[
{
"version": "v1",
"created": "Fri, 24 May 2013 12:01:21 GMT"
}
] | 2013-05-27T00:00:00 |
[
[
"Quaresma",
"Pedro",
""
],
[
"Santos",
"Vanda",
""
],
[
"Bouallegue",
"Seifeddine",
""
]
] |
new_dataset
| 0.985488 |
1305.5710
|
Carst Tankink
|
Carst Tankink, Cezary Kaliszyk, Josef Urban, Herman Geuvers
|
Formal Mathematics on Display: A Wiki for Flyspeck
|
16 pages, published as part of the CICM 2013 conference proceedings
| null | null | null |
cs.MS cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Agora system is a prototype "Wiki for Formal Mathematics", with an aim to
support developing and documenting large formalizations of mathematics in a
proof assistant. The functions implemented in Agora include in-browser editing,
strong AI/ATP proof advice, verification, and HTML rendering. The HTML
rendering contains hyperlinks and provides on-demand explanation of the proof
state for each proof step. In the present paper we show the prototype Flyspeck
Wiki as an instance of Agora for HOL Light formalizations. The wiki can be used
for formalizations of mathematics and for writing informal wiki pages about
mathematics. Such informal pages may contain islands of formal text, which is
used here for providing an initial cross-linking between Hales's informal
Flyspeck book, and the formal Flyspeck development.
The Agora platform intends to address distributed wiki-style collaboration on
large formalization projects, in particular both the aspect of immediate
editing, verification and rendering of formal code, and the aspect of gradual
and mutual refactoring and correspondence of the initial informal text and its
formalization. Here, we highlight these features within the Flyspeck Wiki.
|
[
{
"version": "v1",
"created": "Fri, 24 May 2013 12:26:45 GMT"
}
] | 2013-05-27T00:00:00 |
[
[
"Tankink",
"Carst",
""
],
[
"Kaliszyk",
"Cezary",
""
],
[
"Urban",
"Josef",
""
],
[
"Geuvers",
"Herman",
""
]
] |
new_dataset
| 0.999469 |
1305.5728
|
Wafaa Al-jibory
|
Ali El-Zaart and Wafaa Kamel Al-Jibory
|
Edge Detection in Radar Images Using Weibull Distribution
|
9 pages,6 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radar images can reveal information about the shape of the surface terrain as
well as its physical and biophysical properties. Radar images have long been
used in geological studies to map structural features that are revealed by the
shape of the landscape. Radar imagery also has applications in vegetation and
crop type mapping, landscape ecology, hydrology, and volcanology. Image
processing is using for detecting for objects in radar images. Edge detection;
which is a method of determining the discontinuities in gray level images; is a
very important initial step in Image processing. Many classical edge detectors
have been developed over time. Some of the well-known edge detection operators
based on the first derivative of the image are Roberts, Prewitt, Sobel which is
traditionally implemented by convolving the image with masks. Also Gaussian
distribution has been used to build masks for the first and second derivative.
However, this distribution has limit to only symmetric shape. This paper will
use to construct the masks, the Weibull distribution which was more general
than Gaussian because it has symmetric and asymmetric shape. The constructed
masks are applied to images and we obtained good results.
|
[
{
"version": "v1",
"created": "Fri, 24 May 2013 13:39:18 GMT"
}
] | 2013-05-27T00:00:00 |
[
[
"El-Zaart",
"Ali",
""
],
[
"Al-Jibory",
"Wafaa Kamel",
""
]
] |
new_dataset
| 0.99842 |
0909.3221
|
Gwena\"el Joret
|
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwena\"el Joret, Ilan
Newman, Oren Weimann
|
The Stackelberg Minimum Spanning Tree Game on Planar and
Bounded-Treewidth Graphs
|
v2: Referees' comments incorporated, section on bounded-treewidth
graphs expanded
|
Journal of Combinatorial Optimization, 25/1:19--46, 2013
|
10.1007/s10878-011-9414-2
| null |
cs.GT cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial
pricing problem played on a graph representing a network. Its edges are colored
either red or blue, and the red edges have a given fixed cost, representing the
competitor's prices. The first player chooses an assignment of prices to the
blue edges, and the second player then buys the cheapest spanning tree, using
any combination of red and blue edges. The goal of the first player is to
maximize the total price of purchased blue edges.
We study this problem in the cases of planar and bounded-treewidth graphs. We
show that the problem is NP-hard on planar graphs but can be solved in
polynomial time on graphs of bounded treewidth.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2009 13:52:46 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Sep 2011 04:25:08 GMT"
}
] | 2013-05-24T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Fiorini",
"Samuel",
""
],
[
"Joret",
"Gwenaël",
""
],
[
"Newman",
"Ilan",
""
],
[
"Weimann",
"Oren",
""
]
] |
new_dataset
| 0.998919 |
1305.4993
|
Yin Sun
|
Shengbo Chen, Tarun Bansal, Yin Sun, Prasun Sinha and Ness B. Shroff
|
Life-Add: Lifetime Adjustable Design for WiFi Networks with
Heterogeneous Energy Supplies
|
This is the technical report of our WiOpt paper. The paper received
the best student paper award at IEEE WiOpt 2013. The first three authors are
co-primary authors
| null | null | null |
cs.IT cs.NI cs.SY math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WiFi usage significantly reduces the battery lifetime of handheld devices
such as smartphones and tablets, due to its high energy consumption. In this
paper, we propose "Life-Add": a Lifetime Adjustable design for WiFi networks,
where the devices are powered by battery, electric power, and/or renewable
energy. In Life-Add, a device turns off its radio to save energy when the
channel is sensed to be busy, and sleeps for a random time period before
sensing the channel again. Life-Add carefully controls the devices' average
sleep periods to improve their throughput while satisfying their operation time
requirement. It is proven that Life-Add achieves near-optimal proportional-fair
utility performance for single access point (AP) scenarios. Moreover, Life-Add
alleviates the near-far effect and hidden terminal problem in general multiple
AP scenarios. Our ns-3 simulations show that Life-Add simultaneously improves
the lifetime, throughput, and fairness performance of WiFi networks, and
coexists harmoniously with IEEE 802.11.
|
[
{
"version": "v1",
"created": "Wed, 22 May 2013 00:33:43 GMT"
}
] | 2013-05-24T00:00:00 |
[
[
"Chen",
"Shengbo",
""
],
[
"Bansal",
"Tarun",
""
],
[
"Sun",
"Yin",
""
],
[
"Sinha",
"Prasun",
""
],
[
"Shroff",
"Ness B.",
""
]
] |
new_dataset
| 0.993216 |
1305.5267
|
Bluma Gelley
|
Bluma S. Gelley
|
Investigating Deletion in Wikipedia
| null | null | null | null |
cs.CY cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several hundred Wikipedia articles are deleted every day because they lack
sufficient significance to be included in the encyclopedia. We collect a
dataset of deleted articles and analyze them to determine whether or not the
deletions were justified. We find evidence to support the hypothesis that many
deletions are carried out correctly, but also find that a large number were
done very quickly. Based on our conclusions, we make some recommendations to
reduce the number of non-significant pages and simultaneously improve retention
of new editors.
|
[
{
"version": "v1",
"created": "Wed, 22 May 2013 20:54:18 GMT"
}
] | 2013-05-24T00:00:00 |
[
[
"Gelley",
"Bluma S.",
""
]
] |
new_dataset
| 0.960073 |
1305.5404
|
Tao Qin Dr.
|
Wenkui Ding, Tao Wu, Tao Qin, Tie-Yan Liu
|
Pure Price of Anarchy for Generalized Second Price Auction
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Generalized Second Price auction (GSP) has been widely used by search
engines to sell ad slots. Previous studies have shown that the pure Price Of
Anarchy (POA) of GSP is 1.25 when there are two ad slots and 1.259 when three
ad slots. For the cases with more than three ad slots, however, only some
untight upper bounds of the pure POA were obtained. In this work, we improve
previous results in two aspects: (1) We prove that the pure POA for GSP is
1.259 when there are four ad slots, and (2) We show that the pure POA for GSP
with more than four ad slots is also 1.259 given the bidders are ranked
according to a particular permutation.
|
[
{
"version": "v1",
"created": "Thu, 23 May 2013 12:57:26 GMT"
}
] | 2013-05-24T00:00:00 |
[
[
"Ding",
"Wenkui",
""
],
[
"Wu",
"Tao",
""
],
[
"Qin",
"Tao",
""
],
[
"Liu",
"Tie-Yan",
""
]
] |
new_dataset
| 0.956367 |
1305.5506
|
Robert R. Tucci
|
Robert R. Tucci
|
Introduction to Judea Pearl's Do-Calculus
|
16 pages (11 files: 1 .tex, 1 .sty, 9 .jpg)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is a purely pedagogical paper with no new results. The goal of the paper
is to give a fairly self-contained introduction to Judea Pearl's do-calculus,
including proofs of his 3 rules.
|
[
{
"version": "v1",
"created": "Fri, 26 Apr 2013 02:36:43 GMT"
}
] | 2013-05-24T00:00:00 |
[
[
"Tucci",
"Robert R.",
""
]
] |
new_dataset
| 0.989449 |
1207.2083
|
Johan P. Hansen
|
Johan P. Hansen
|
Equidistant Linear Network Codes with maximal Error-protection from
Veronese Varieties
|
Certain conditions are not explicitely stated
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear network coding transmits information in terms of a basis of a vector
space and the information is received as a basis of a possible altered
vectorspace. Ralf Koetter and Frank R. Kschischang in Coding for errors and
erasures in random network coding (IEEE Transactions on Information Theory,
vol.54, no.8, pp. 3579-3591,2008) introduced a metric on the set af
vector-spaces and showed that a minimal distance decoder for this metric
achieves correct decoding if the dimension of the intersection of the
transmitted and received vector-space is sufficiently large. From the Veronese
varieties we construct explicit families of vector-spaces of constant dimension
where any pair of distinct vector-spaces are equidistant in the above metric.
The parameters of the resulting linear network codes which have maximal
error-protection are determined.
|
[
{
"version": "v1",
"created": "Mon, 9 Jul 2012 15:48:34 GMT"
},
{
"version": "v2",
"created": "Wed, 22 May 2013 14:08:20 GMT"
}
] | 2013-05-23T00:00:00 |
[
[
"Hansen",
"Johan P.",
""
]
] |
new_dataset
| 0.999074 |
1305.5240
|
Robert Kent
|
Robert E. Kent
|
FOLE: The First-order Logical Environment
|
Conceptual Structures for STEM Research and Education, 20th
International Conference on Conceptual Structures, ICCS 2013, Mumbai, India,
January 10-12, 2013. Proceedings. Can be found online at:
http://link.springer.com/chapter/10.1007%2F978-3-642-35786-2_15
|
Lecture Notes in Computer Science, Volume 7735, 2013, pp 210-230.
Springer Berlin Heidelberg
|
10.1007/978-3-642-35786-2_15
| null |
cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the first-order logical environment FOLE. Institutions
in general, and logical environments in particular, give equivalent
heterogeneous and homogeneous representations for logical systems. As such,
they offer a rigorous and principled approach to distributed interoperable
information systems via system consequence. Since FOLE is a particular logical
environment, this provides a rigorous and principled approach to distributed
interoperable first-order information systems. The FOLE represents the
formalism and semantics of first-order logic in a classification form. By using
an interpretation form, a companion approach defines the formalism and
semantics of first-order logical/relational database systems. In a strict
sense, the two forms have transformational passages (generalized inverses)
between one another. The classification form of first-order logic in the FOLE
corresponds to ideas discussed in the Information Flow Framework (IFF). The
FOLE representation follows a conceptual structures approach, that is
completely compatible with formal concept analysis and information flow.
|
[
{
"version": "v1",
"created": "Wed, 22 May 2013 19:29:37 GMT"
}
] | 2013-05-23T00:00:00 |
[
[
"Kent",
"Robert E.",
""
]
] |
new_dataset
| 0.995978 |
1305.2432
|
Yakov Babichenko
|
Yakov Babichenko
|
Small Support Equilibria in Large Games
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note we provide a new proof for the results of Lipton et al. on the
existence of an approximate Nash equilibrium with logarithmic support size.
Besides its simplicity, the new proof leads to the following contributions:
1. For n-player games, we improve the bound on the size of the support of an
approximate Nash equilibrium.
2. We generalize the result of Daskalakis and Papadimitriou on small
probability games from the two-player case to the general n-player case.
3. We provide a logarithmic bound on the size of the support of an
approximate Nash equilibrium in the case of graphical games.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 20:31:55 GMT"
},
{
"version": "v2",
"created": "Tue, 21 May 2013 18:49:43 GMT"
}
] | 2013-05-22T00:00:00 |
[
[
"Babichenko",
"Yakov",
""
]
] |
new_dataset
| 0.972083 |
1305.4786
|
Rasmus Jacobsen
|
Rasmus Melchior Jacobsen and Petar Popovski
|
Reliable Reception of Wireless Metering Data with Protocol Coding
|
Conference submission
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stationary collectors reading wireless, battery powered smart meters, often
operate in harsh channel conditions to cut network installation cost to a
minimum, challenging the individual link to each meter. The desired performance
measure is reliable reception of at least some data from as many as possible
meters, rather than increasing the fraction of received packets from one meter.
As a first step for improving reliable reception, and motivated by the recent
revision of Wireless M-Bus, we propose the use of a deterministic packet
transmission interval to group packets from the same meter. We derive the
probability of falsely pairing packets from different senders in the simple
case of no channel errors, and show through simulation and data from an
experimental deployment the probability of false pairing with channel errors.
The pairing is an essential step towards recovery of metering data from as many
as possible meters under harsh channel conditions. From the experiment we find
that more than 15% of all conducted pairings are between two erroneous packets,
which sets an upper bound on the number of additional meters that can be
reliably recovered.
|
[
{
"version": "v1",
"created": "Tue, 21 May 2013 11:22:40 GMT"
}
] | 2013-05-22T00:00:00 |
[
[
"Jacobsen",
"Rasmus Melchior",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.985661 |
1305.4820
|
Nader Jelassi
|
Mohamed Nader Jelassi and Sadok Ben Yahia and Engelbert Mephu Nguifo
|
Nouvelle approche de recommandation personnalisee dans les folksonomies
basee sur le profil des utilisateurs
|
7 pages
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In folksonomies, users use to share objects (movies, books, bookmarks, etc.)
by annotating them with a set of tags of their own choice. With the rise of the
Web 2.0 age, users become the core of the system since they are both the
contributors and the creators of the information. Yet, each user has its own
profile and its own ideas making thereby the strength as well as the weakness
of folksonomies. Indeed, it would be helpful to take account of users' profile
when suggesting a list of tags and resources or even a list of friends, in
order to make a personal recommandation, instead of suggesting the more used
tags and resources in the folksonomy. In this paper, we consider users' profile
as a new dimension of a folksonomy classically composed of three dimensions
<users, tags, ressources> and we propose an approach to group users with
equivalent profiles and equivalent interests as quadratic concepts. Then, we
use such structures to propose our personalized recommendation system of users,
tags and resources according to each user's profile. Carried out experiments on
two real-world datasets, i.e., MovieLens and BookCrossing highlight encouraging
results in terms of precision as well as a good social evaluation.
|
[
{
"version": "v1",
"created": "Tue, 21 May 2013 13:59:51 GMT"
}
] | 2013-05-22T00:00:00 |
[
[
"Jelassi",
"Mohamed Nader",
""
],
[
"Yahia",
"Sadok Ben",
""
],
[
"Nguifo",
"Engelbert Mephu",
""
]
] |
new_dataset
| 0.999683 |
1204.1086
|
Seth Pettie
|
Seth Pettie
|
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
|
A 10-page extended abstract will appear in the Proceedings of the
Symposium on Computational Geometry, 2013
| null | null | null |
cs.DM cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the longest-standing open problems in computational geometry is to
bound the lower envelope of $n$ univariate functions, each pair of which
crosses at most $s$ times, for some fixed $s$. This problem is known to be
equivalent to bounding the length of an order-$s$ Davenport-Schinzel sequence,
namely a sequence over an $n$-letter alphabet that avoids alternating
subsequences of the form $a \cdots b \cdots a \cdots b \cdots$ with length
$s+2$. These sequences were introduced by Davenport and Schinzel in 1965 to
model a certain problem in differential equations and have since been applied
to bounding the running times of geometric algorithms, data structures, and the
combinatorial complexity of geometric arrangements.
Let $\lambda_s(n)$ be the maximum length of an order-$s$ DS sequence over $n$
letters. What is $\lambda_s$ asymptotically? This question has been answered
satisfactorily (by Hart and Sharir, Agarwal, Sharir, and Shor, Klazar, and
Nivasch) when $s$ is even or $s\le 3$. However, since the work of Agarwal,
Sharir, and Shor in the mid-1980s there has been a persistent gap in our
understanding of the odd orders.
In this work we effectively close the problem by establishing sharp bounds on
Davenport-Schinzel sequences of every order $s$. Our results reveal that,
contrary to one's intuition, $\lambda_s(n)$ behaves essentially like
$\lambda_{s-1}(n)$ when $s$ is odd. This refutes conjectures due to Alon et al.
(2008) and Nivasch (2010).
|
[
{
"version": "v1",
"created": "Wed, 4 Apr 2012 22:24:14 GMT"
},
{
"version": "v2",
"created": "Sat, 18 May 2013 18:05:53 GMT"
}
] | 2013-05-21T00:00:00 |
[
[
"Pettie",
"Seth",
""
]
] |
new_dataset
| 0.991493 |
1303.4194
|
Christoph Lange
|
Christoph Lange and Colin Rowat and Manfred Kerber
|
The ForMaRE Project - Formal Mathematical Reasoning in Economics
|
Conference on Intelligent Computer Mathematics, 8--12 July, Bath, UK.
Published as number 7961 in Lecture Notes in Artificial Intelligence,
Springer
| null | null | null |
cs.CE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ForMaRE project applies formal mathematical reasoning to economics. We
seek to increase confidence in economics' theoretical results, to aid in
discovering new results, and to foster interest in formal methods, i.e.
computer-aided reasoning, within economics. To formal methods, we seek to
contribute user experience feedback from new audiences, as well as new
challenge problems. In the first project year, we continued earlier game theory
studies but then focused on auctions, where we are building a toolbox of
formalisations, and have started to study matching and financial risk.
In parallel to conducting research that connects economics and formal
methods, we organise events and provide infrastructure to connect both
communities, from fostering mutual awareness to targeted matchmaking. These
efforts extend beyond economics, towards generally enabling domain experts to
use mechanised reasoning.
|
[
{
"version": "v1",
"created": "Mon, 18 Mar 2013 09:34:10 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Apr 2013 23:56:57 GMT"
},
{
"version": "v3",
"created": "Sat, 18 May 2013 23:07:37 GMT"
}
] | 2013-05-21T00:00:00 |
[
[
"Lange",
"Christoph",
""
],
[
"Rowat",
"Colin",
""
],
[
"Kerber",
"Manfred",
""
]
] |
new_dataset
| 0.999203 |
1305.4199
|
Di Li
|
Di Li, Lifeng Lai, and Shuguang Cui
|
Quickest Change Point Detection and Identification Across a Generic
Sensor Array
|
Quickest change detection, identification, sensor network,
decentralized detection
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of quickest change point detection and
identification over a linear array of $N$ sensors, where the change pattern
could first reach any of these sensors, and then propagate to the other
sensors. Our goal is not only to detect the presence of such a change as
quickly as possible, but also to identify which sensor that the change pattern
first reaches. We jointly design two decision rules: a stopping rule, which
determines when we should stop sampling and claim a change occurred, and a
terminal decision rule, which decides which sensor that the change pattern
reaches first, with the objective to strike a balance among the detection
delay, the false alarm probability, and the false identification probability.
We show that this problem can be converted to a Markov optimal stopping time
problem, from which some technical tools could be borrowed. Furthermore, to
avoid the high implementation complexity issue of the optimal rules, we develop
a scheme with a much simpler structure and certain performance guarantee.
|
[
{
"version": "v1",
"created": "Fri, 17 May 2013 22:15:55 GMT"
}
] | 2013-05-21T00:00:00 |
[
[
"Li",
"Di",
""
],
[
"Lai",
"Lifeng",
""
],
[
"Cui",
"Shuguang",
""
]
] |
new_dataset
| 0.968317 |
1305.4237
|
Ton Kloks
|
W. Hon, T. Kloks, S. Liu, S. Poon and Y. Wang
|
Independent set in categorical products of cographs and splitgraphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that there are polynomial-time algorithms to compute maximum
independent sets in the categorical products of two cographs and two
splitgraphs. We show that the ultimate categorical independence ratio is
computable in polynomial time for cographs.
|
[
{
"version": "v1",
"created": "Sat, 18 May 2013 07:07:08 GMT"
}
] | 2013-05-21T00:00:00 |
[
[
"Hon",
"W.",
""
],
[
"Kloks",
"T.",
""
],
[
"Liu",
"S.",
""
],
[
"Poon",
"S.",
""
],
[
"Wang",
"Y.",
""
]
] |
new_dataset
| 0.98133 |
1305.4314
|
Sanket Satpathy
|
Sanket Satpathy and Paul Cuff
|
Secure Cascade Channel Synthesis
|
ISIT 2013, 5 pages, uses IEEEtran.cls
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate channel synthesis in a cascade setting where nature provides
an iid sequence $X^n$ at node 1. Node 1 can send a message at rate $R_1$ to
node 2 and node 2 can send a message at rate $R_2$ to node 3. Additionally, all
3 nodes share bits of common randomness at rate $R_0$. We want to generate
sequences $Y^n$ and $Z^n$ along nodes in the cascade such that $(X^n,Y^n,Z^n)$
appears to be appropriately correlated and iid even to an eavesdropper who is
cognizant of the messages being sent. We characterize the optimal tradeoff
between the amount of common randomness used and the required rates of
communication. We also solve the problem for arbitrarily long cascades and
provide an inner bound for cascade channel synthesis without an eavesdropper.
|
[
{
"version": "v1",
"created": "Sun, 19 May 2013 01:27:39 GMT"
}
] | 2013-05-21T00:00:00 |
[
[
"Satpathy",
"Sanket",
""
],
[
"Cuff",
"Paul",
""
]
] |
new_dataset
| 0.999003 |
1305.4359
|
Michael Adrir Scott
|
Michael James Scott and Gheorghita Ghinea
|
Promoting Game Accessibility: Experiencing an Induction on Inclusive
Design Practice at the Global Games Jam
|
Presented at the Conference on the Foundations of Digital Games
(Inaugural Workshop on the Global Games Jam), May 14-17, 2013, Chania, Greece
|
Proceedings of the Inaugural Workshop on the Global Games Jam
(2013) SASDG: Santa Cruz, California. 17--20
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Global Games Jam (GGJ) attracts many people who are passionate about
games development, coming from a range of educational backgrounds. Therefore,
the event can be experienced by novices and student developers as an
opportunity for learning. This provides an opening to promote themes and ideas
that could help form future thinking about games design, emerging as a form of
induction on key design issues for new practitioners. Such an approach aims to
raise awareness about issues which learners could help develop and take with
them into industry. However, the experience itself affords a deep experiential
rhetoric and dialogue with experts that could be an effective pedagogical tool
for issues seldom addressed deeply in formal educational settings. This paper
describes an account by one such individual, being introduced to game
accessibility through participation in the GGJ. As such, it is not intended as
a rigorous empirical analysis, but rather a perspective on one way a game jam
can be experienced, inviting further research on the topic.
|
[
{
"version": "v1",
"created": "Sun, 19 May 2013 13:02:17 GMT"
}
] | 2013-05-21T00:00:00 |
[
[
"Scott",
"Michael James",
""
],
[
"Ghinea",
"Gheorghita",
""
]
] |
new_dataset
| 0.999008 |
1305.4584
|
Ludovic Courtes
|
Ludovic Court\`es
|
Functional Package Management with Guix
|
European Lisp Symposium (2013)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the design and implementation of GNU Guix, a purely functional
package manager designed to support a complete GNU/Linux distribution. Guix
supports transactional upgrades and roll-backs, unprivileged package
management, per-user profiles, and garbage collection. It builds upon the
low-level build and deployment layer of the Nix package manager. Guix uses
Scheme as its programming interface. In particular, we devise an embedded
domain-specific language (EDSL) to describe and compose packages. We
demonstrate how it allows us to benefit from the host general-purpose
programming language while not compromising on expressiveness. Second, we show
the use of Scheme to write build programs, leading to "two-tier" programming
system.
|
[
{
"version": "v1",
"created": "Mon, 20 May 2013 17:38:19 GMT"
}
] | 2013-05-21T00:00:00 |
[
[
"Courtès",
"Ludovic",
""
]
] |
new_dataset
| 0.999375 |
1305.3931
|
Emrah Akyol
|
Emrah Akyol, Kenneth Rose, Tamer Basar
|
Gaussian Sensor Networks with Adversarial Nodes
|
5 pages, will be presented at ISIT 2013, Istanbul, Turkey
| null | null | null |
cs.IT cs.SY math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies a particular sensor network model which involves one
single Gaussian source observed by many sensors, subject to additive
independent Gaussian observation noise. Sensors communicate with the receiver
over an additive Gaussian multiple access channel. The aim of the receiver is
to reconstruct the underlying source with minimum mean squared error. The
scenario of interest here is one where some of the sensors act as adversary
(jammer): they strive to maximize distortion. We show that the ability of
transmitter sensors to secretly agree on a random event, that is
"coordination", plays a key role in the analysis. Depending on the coordination
capability of sensors and the receiver, we consider two problem settings. The
first setting involves transmitters with coordination capabilities in the sense
that all transmitters can use identical realization of randomized encoding for
each transmission. In this case, the optimal strategy for the adversary sensors
also requires coordination, where they all generate the same realization of
independent and identically distributed Gaussian noise. In the second setting,
the transmitter sensors are restricted to use fixed, deterministic encoders and
this setting, which corresponds to a Stackelberg game, does not admit a
saddle-point solution. We show that the the optimal strategy for all sensors is
uncoded communications where encoding functions of adversaries and transmitters
are in opposite directions. For both settings, digital compression and
communication is strictly suboptimal.
|
[
{
"version": "v1",
"created": "Thu, 16 May 2013 20:30:08 GMT"
}
] | 2013-05-20T00:00:00 |
[
[
"Akyol",
"Emrah",
""
],
[
"Rose",
"Kenneth",
""
],
[
"Basar",
"Tamer",
""
]
] |
new_dataset
| 0.966031 |
1301.5142
|
Mohsen Bahrami
|
Mohsen Bahrami, Ali Bereyhi, Sadaf Salehkalaibar and Mohammad Reza
Aref
|
Key agreement over a 3-receiver broadcast channel
|
Accepted in IWCIT 2013
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of secret key agreement in
state-dependent 3-receiver broadcast channels. In the proposed model, there are
two legitimate receivers, an eavesdropper and a transmitter where the channel
state information is non-causally available at the transmitter. We consider two
setups. In the first setup, the transmitter tries to agree on a common key with
the legitimate receivers while keeping it concealed from the eavesdropper.
Simultaneously, the transmitter agrees on a private key with each of the
legitimate receivers that needs to be kept secret from the other legitimate
receiver and the eavesdropper. For this setup, we derive inner and outer bounds
on the secret key capacity region. In the second setup, we assume that a
backward public channel is available among the receivers and the transmitter.
Each legitimate receiver wishes to share a private key with the transmitter.
For this setup, an inner bound on the private key capacity region is found.
Furthermore, the capacity region of the secret key in the state-dependent
wiretap channel can be deduced from our inner and outer bounds.
|
[
{
"version": "v1",
"created": "Tue, 22 Jan 2013 11:07:03 GMT"
},
{
"version": "v2",
"created": "Thu, 16 May 2013 12:37:42 GMT"
}
] | 2013-05-17T00:00:00 |
[
[
"Bahrami",
"Mohsen",
""
],
[
"Bereyhi",
"Ali",
""
],
[
"Salehkalaibar",
"Sadaf",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.96385 |
1305.2777
|
S{\o}ren Vind
|
Philip Bille, Patrick Hagge Cording, Inge Li G{\o}rtz, Benjamin Sach,
Hjalte Wedel Vildh{\o}j, S{\o}ren Vind
|
Fingerprints in Compressed Strings
|
An extended abstract of this paper will appear at WADS 2013
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Karp-Rabin fingerprint of a string is a type of hash value that due to
its strong properties has been used in many string algorithms. In this paper we
show how to construct a data structure for a string $S$ of size $N$ compressed
by a context-free grammar of size $n$ that answers fingerprint queries. That
is, given indices $i$ and $j$, the answer to a query is the fingerprint of the
substring $S[i,j]$. We present the first O(n) space data structures that answer
fingerprint queries without decompressing any characters. For Straight Line
Programs (SLP) we get $O(\log N)$ query time, and for Linear SLPs (an SLP
derivative that captures LZ78 compression and its variations) we get $O(\log
\log N)$ query time. Hence, our data structures has the same time and space
complexity as for random access in SLPs. We utilize the fingerprint data
structures to solve the longest common extension problem in query time $O(\log
N \log \lce)$ and $O(\log \lce \log\log \lce + \log\log N)$ for SLPs and Linear
SLPs, respectively. Here, $\lce$ denotes the length of the LCE.
|
[
{
"version": "v1",
"created": "Mon, 13 May 2013 13:50:11 GMT"
},
{
"version": "v2",
"created": "Thu, 16 May 2013 12:32:19 GMT"
}
] | 2013-05-17T00:00:00 |
[
[
"Bille",
"Philip",
""
],
[
"Cording",
"Patrick Hagge",
""
],
[
"Gørtz",
"Inge Li",
""
],
[
"Sach",
"Benjamin",
""
],
[
"Vildhøj",
"Hjalte Wedel",
""
],
[
"Vind",
"Søren",
""
]
] |
new_dataset
| 0.99836 |
1305.3827
|
Zahra Jafargholi
|
Zahra Jafargholi and Emanuele Viola
|
3SUM, 3XOR, Triangles
| null | null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that if one can solve 3SUM on a set of size n in time n^{1+\e} then
one can list t triangles in a graph with m edges in time
O(m^{1+\e}t^{1/3-\e/3}). This is a reversal of Patrascu's reduction from 3SUM
to listing triangles (STOC '10). Our result builds on and extends works by the
Paghs (PODS '06) and by Vassilevska and Williams (FOCS '10). We make our
reductions deterministic using tools from pseudorandomness.
We then re-execute both Patrascu's reduction and our reversal for the variant
3XOR of 3SUM where integer summation is replaced by bit-wise xor. As a
corollary we obtain that if 3XOR is solvable in linear time but 3SUM requires
quadratic randomized time, or vice versa, then the randomized time complexity
of listing m triangles in a graph with $m$ edges is m^{4/3} up to a factor
m^\alpha for any \alpha > 0.
|
[
{
"version": "v1",
"created": "Thu, 16 May 2013 14:50:07 GMT"
}
] | 2013-05-17T00:00:00 |
[
[
"Jafargholi",
"Zahra",
""
],
[
"Viola",
"Emanuele",
""
]
] |
new_dataset
| 0.994573 |
1305.3314
|
Shiri Chechik
|
Shiri Chechik
|
Approximate Distance Oracle with Constant Query Time
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An approximate distance oracle is a succinct data structure that provides
fast answers to distance queries between any two nodes. In this paper we
consider approximate distance oracles for general undirected graphs with
non-negative edge weights with constant query time. We present a distance
oracle of size O(k n^{1+1/k}), with 2k-1 stretch and O(1) query time. This
improves the O(log{k}) query time of Wulff-Nilsen's distance oracle [SODA '13],
which in turn improved the O(k) query time of Thorup and Zwick's distance
oracle [J. ACM '05].
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 22:09:01 GMT"
}
] | 2013-05-16T00:00:00 |
[
[
"Chechik",
"Shiri",
""
]
] |
new_dataset
| 0.994006 |
1305.3358
|
Satyajit Thakor
|
Satyajit Thakor, Terence Chan, Kenneth W. Shum
|
Symmetry in Distributed Storage Systems
|
Accepted, ISIT 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The max-flow outer bound is achievable by regenerating codes for functional
repair distributed storage system. However, the capacity of exact repair
distributed storage system is an open problem. In this paper, the linear
programming bound for exact repair distributed storage systems is formulated. A
notion of symmetrical sets for a set of random variables is given and
equalities of joint entropies for certain subsets of random variables in a
symmetrical set is established. Concatenation coding scheme for exact repair
distributed storage systems is proposed and it is shown that concatenation
coding scheme is sufficient to achieve any admissible rate for any exact repair
distributed storage system. Equalities of certain joint entropies of random
variables induced by concatenation scheme is shown. These equalities of joint
entropies are new tools to simplify the linear programming bound and to obtain
stronger converse results for exact repair distributed storage systems.
|
[
{
"version": "v1",
"created": "Wed, 15 May 2013 05:41:02 GMT"
}
] | 2013-05-16T00:00:00 |
[
[
"Thakor",
"Satyajit",
""
],
[
"Chan",
"Terence",
""
],
[
"Shum",
"Kenneth W.",
""
]
] |
new_dataset
| 0.97266 |
1305.3568
|
Xin Jin
|
Xin Jin, Li Erran Li, Laurent Vanbever, Jennifer Rexford
|
SoftCell: Taking Control of Cellular Core Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing cellular networks suffer from inflexible and expensive equipment,
and complex control-plane protocols. To address these challenges, we present
SoftCell, a scalable architecture for supporting fine-grained policies for
mobile devices in cellular core networks. The SoftCell controller realizes
high-level service polices by directing traffic over paths that traverse a
sequence of middleboxes, optimized to the network conditions and user
locations. To ensure scalability, the core switches forward traffic on
hierarchical addresses (grouped by base station) and policy tags (identifying
paths through middleboxes). This minimizes data-plane state in the core
switches, and pushes all fine-grained state to software switches at the base
stations. These access switches apply fine-grained rules, specified by the
controller, to map all traffic to the appropriate addresses and tags. SoftCell
guarantees that packets in the same connection traverse the same sequence of
middleboxes in both directions, even in the presence of mobility. Our
characterization of real LTE workloads, micro-benchmarks on our prototype
controller, and large-scale simulations demonstrate that SoftCell improves the
flexibility of cellular core networks, while enabling the use of inexpensive
commodity switches and middleboxes.
|
[
{
"version": "v1",
"created": "Wed, 15 May 2013 18:00:02 GMT"
}
] | 2013-05-16T00:00:00 |
[
[
"Jin",
"Xin",
""
],
[
"Li",
"Li Erran",
""
],
[
"Vanbever",
"Laurent",
""
],
[
"Rexford",
"Jennifer",
""
]
] |
new_dataset
| 0.999669 |
1108.6132
|
Shiqiang Wang Mr.
|
Shiqiang Wang, Qingyang Song, Xingwei Wang, and Abbas Jamalipour
|
Distributed MAC Protocol Supporting Physical-Layer Network Coding
|
Final version
|
IEEE Transactions on Mobile Computing, vol. 12, no. 5, pp.
1023-1036, May 2013
|
10.1109/TMC.2012.69
| null |
cs.NI cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical-layer network coding (PNC) is a promising approach for wireless
networks. It allows nodes to transmit simultaneously. Due to the difficulties
of scheduling simultaneous transmissions, existing works on PNC are based on
simplified medium access control (MAC) protocols, which are not applicable to
general multi-hop wireless networks, to the best of our knowledge. In this
paper, we propose a distributed MAC protocol that supports PNC in multi-hop
wireless networks. The proposed MAC protocol is based on the carrier sense
multiple access (CSMA) strategy and can be regarded as an extension to the IEEE
802.11 MAC protocol. In the proposed protocol, each node collects information
on the queue status of its neighboring nodes. When a node finds that there is
an opportunity for some of its neighbors to perform PNC, it notifies its
corresponding neighboring nodes and initiates the process of packet exchange
using PNC, with the node itself as a relay. During the packet exchange process,
the relay also works as a coordinator which coordinates the transmission of
source nodes. Meanwhile, the proposed protocol is compatible with conventional
network coding and conventional transmission schemes. Simulation results show
that the proposed protocol is advantageous in various scenarios of wireless
applications.
|
[
{
"version": "v1",
"created": "Wed, 31 Aug 2011 06:32:57 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Nov 2011 18:04:44 GMT"
},
{
"version": "v3",
"created": "Sat, 11 May 2013 19:13:39 GMT"
}
] | 2013-05-15T00:00:00 |
[
[
"Wang",
"Shiqiang",
""
],
[
"Song",
"Qingyang",
""
],
[
"Wang",
"Xingwei",
""
],
[
"Jamalipour",
"Abbas",
""
]
] |
new_dataset
| 0.998514 |
1305.2999
|
Xingqin Lin
|
Xingqin Lin, Harish Viswanathan
|
Dynamic Spectrum Refarming of GSM Spectrum for LTE Small Cells
|
8 pages, 7 figures, submitted to IEEE Globecom 2013 Intl. Workshop on
Heterogeneous and Small Cell Networks
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a novel solution called dynamic spectrum refarming
(DSR) for deploying LTE small cells using the same spectrum as existing GSM
networks. The basic idea of DSR is that LTE small cells are deployed in the GSM
spectrum but suppress transmission of all signals including the reference
signals in some specific physical resource blocks corresponding to a portion of
the GSM carriers to ensure full GSM coverage. Our study shows that the proposed
solution can provide LTE mobile terminals with high speed data services when
they are in the coverage of the LTE small cells while minimally affecting the
service provided to GSM terminals located within the LTE small cell coverage
area. Thus, the proposal allows the normal operation of the existing GSM
networks even with LTE small cells deployed in that spectrum. Though the focus
of this paper is about GSM spectrum refarming, an analogous approach can be
applied to reuse code division multiple access (CDMA) spectrum for LTE small
cells.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 02:08:16 GMT"
}
] | 2013-05-15T00:00:00 |
[
[
"Lin",
"Xingqin",
""
],
[
"Viswanathan",
"Harish",
""
]
] |
new_dataset
| 0.962394 |
1305.3011
|
Ali Jalali
|
Kuang-Chih Lee, Ali Jalali and Ali Dasdan
|
Real Time Bid Optimization with Smooth Budget Delivery in Online
Advertising
| null | null | null | null |
cs.GT cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, billions of display ad impressions are purchased on a daily basis
through a public auction hosted by real time bidding (RTB) exchanges. A
decision has to be made for advertisers to submit a bid for each selected RTB
ad request in milliseconds. Restricted by the budget, the goal is to buy a set
of ad impressions to reach as many targeted users as possible. A desired action
(conversion), advertiser specific, includes purchasing a product, filling out a
form, signing up for emails, etc. In addition, advertisers typically prefer to
spend their budget smoothly over the time in order to reach a wider range of
audience accessible throughout a day and have a sustainable impact. However,
since the conversions occur rarely and the occurrence feedback is normally
delayed, it is very challenging to achieve both budget and performance goals at
the same time. In this paper, we present an online approach to the smooth
budget delivery while optimizing for the conversion performance. Our algorithm
tries to select high quality impressions and adjust the bid price based on the
prior performance distribution in an adaptive manner by distributing the budget
optimally across time. Our experimental results from real advertising campaigns
demonstrate the effectiveness of our proposed approach.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 03:39:45 GMT"
}
] | 2013-05-15T00:00:00 |
[
[
"Lee",
"Kuang-Chih",
""
],
[
"Jalali",
"Ali",
""
],
[
"Dasdan",
"Ali",
""
]
] |
new_dataset
| 0.987824 |
1305.3105
|
Daqiang Zhang
|
Daqiang Zhang, Qin Zou, Zhiren Sun
|
SECA: Snapshot-based Event Detection for Checking Asynchronous Context
Consistency in Ubiquitous Computing
|
This paper is not presented in WCNC'2012 as I missed the time owing
to the traffic jam. So the paper is not included in IEEE Explorer, although
it is in the Proceedings of the WCNC'2012. in Proceedings of the 2012 IEEE
Wireless Communications and Networking Conference (WCNC 2012), pp. 3339--3344
| null | null | null |
cs.DC cs.ET cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Context-consistency checking is challenging in the dynamic and uncertain
ubiquitous computing environments. This is because contexts are often noisy
owing to unreliable sensing data streams, inaccurate data measurement, fragile
connectivity and resource constraints. One of the state-of-the-art efforts is
CEDA, which concurrently detects context consistency by exploring the
\emph{happened-before} relation among events. However, CEDA is seriously
limited by several side effects --- centralized detection manner that easily
gets down the checker process, heavy computing complexity and false negative.
In this paper, we propose SECA: Snapshot-based Event Detection for Checking
Asynchronous Context Consistency in ubiquitous computing. SECA introduces
snapshot-based timestamp to check event relations, which can detect scenarios
where CEDA fails. Moreover, it simplifies the logical clock instead of adopting
the vector clock, and thus significantly reduces both time and space
complexity. Empirical studies show that SECA outperforms CEDA in terms of
detection accuracy, scalability, and computing complexity.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 10:48:54 GMT"
}
] | 2013-05-15T00:00:00 |
[
[
"Zhang",
"Daqiang",
""
],
[
"Zou",
"Qin",
""
],
[
"Sun",
"Zhiren",
""
]
] |
new_dataset
| 0.998019 |
1305.3199
|
Philipp Winter
|
Philipp Winter, Tobias Pulls, Juergen Fuss
|
ScrambleSuit: A Polymorph Network Protocol to Circumvent Censorship
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deep packet inspection technology became a cornerstone of Internet censorship
by facilitating cheap and effective filtering of what censors consider
undesired information. Moreover, filtering is not limited to simple pattern
matching but makes use of sophisticated techniques such as active probing and
protocol classification to block access to popular circumvention tools such as
Tor.
In this paper, we propose ScrambleSuit; a thin protocol layer above TCP whose
purpose is to obfuscate the transported application data. By using morphing
techniques and a secret exchanged out-of-band, we show that ScrambleSuit can
defend against active probing and other fingerprinting techniques such as
protocol classification and regular expressions.
We finally demonstrate that our prototype exhibits little overhead and
enables effective and lightweight obfuscation for application layer protocols.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 16:19:53 GMT"
}
] | 2013-05-15T00:00:00 |
[
[
"Winter",
"Philipp",
""
],
[
"Pulls",
"Tobias",
""
],
[
"Fuss",
"Juergen",
""
]
] |
new_dataset
| 0.978217 |
1305.3203
|
Gurpreet Saini
|
Gurpreet Singh Saini, Ashish Kots, Manoj Kumar
|
DREAM_OLSR PROTOCOL (Distance Routing Effective Algorithm for Mobility -
Optimized Link State Routing)
|
Published at IJCTT, 2013 Volume4 Issue5
http://www.ijcttjournal.org/volume-4/issue-5/IJCTT-V4I5P25.pdf
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
This paper lays down a proposal of protocol named DREAM_OLSR. The protocol
has been developed so as to effect current OLSR (RFC 3626) [4] protocol. The
protocol establishes an optimized solution hence the name has been manipulated
from Open Link State Routing to DREAM Optimized Link State Routing. DREAM
specifies Distance Routing Effective Algorithm for Mobility wherein it
implements the Distance routing effective algorithm for the optimized solution.
This optimization includes higher efficiency and fewer overheads for the MANET.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 16:33:40 GMT"
}
] | 2013-05-15T00:00:00 |
[
[
"Saini",
"Gurpreet Singh",
""
],
[
"Kots",
"Ashish",
""
],
[
"Kumar",
"Manoj",
""
]
] |
new_dataset
| 0.96176 |
1305.3213
|
Sowmyan Jegatheesan
|
Senthur Balan S, Sowmyan Jegatheesan and Sakthi Ganesh M
|
The Product Promotion and Consumer Retention Gap in Online Shopping
|
4 Pages,1 Table, 2012 4th International Conference on Electronics
Computer Technology (ICECT 2012) 978-1-4673-1850-1/12 2012 IEEE Page 158-161
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the number of online shopping websites increases day by day, so are the
online advertisement strategies and promotional techniques. The number of
people who uses internet keeps on increasing daily and it has become a vast
marketplace to promote products, surely it will be a prime reason to drive any
companies growth in the future.This paper primarily focuses on the areas on
which online shopping lags product promotion and customer retention. Sellers
must concentrate on the areas in which online marketing lags product promotion
techniques; also they should introduce new strategies to increase their market
share to gain customers attention towards their products.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 17:14:57 GMT"
}
] | 2013-05-15T00:00:00 |
[
[
"S",
"Senthur Balan",
""
],
[
"Jegatheesan",
"Sowmyan",
""
],
[
"M",
"Sakthi Ganesh",
""
]
] |
new_dataset
| 0.9972 |
1202.6174
|
Kiril Solovey
|
Kiril Solovey and Dan Halperin
|
k-Color Multi-Robot Motion Planning
|
23
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a simple and natural extension of the multi-robot motion planning
problem where the robots are partitioned into groups (colors), such that in
each group the robots are interchangeable. Every robot is no longer required to
move to a specific target, but rather to some target placement that is assigned
to its group. We call this problem k-color multi-robot motion planning and
provide a sampling-based algorithm specifically designed for solving it. At the
heart of the algorithm is a novel technique where the k-color problem is
reduced to several discrete multi-robot motion planning problems. These
reductions amplify basic samples into massive collections of free placements
and paths for the robots. We demonstrate the performance of the algorithm by an
implementation for the case of disc robots and polygonal robots translating in
the plane. We show that the algorithm successfully and efficiently copes with a
variety of challenging scenarios, involving many robots, while a simplified
version of this algorithm, that can be viewed as an extension of a prevalent
sampling-based algorithm for the k-color case, fails even on simple scenarios.
Interestingly, our algorithm outperforms a well established implementation of
PRM for the standard multi-robot problem, in which each robot has a distinct
color.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2012 10:37:05 GMT"
},
{
"version": "v2",
"created": "Sat, 13 Oct 2012 09:48:38 GMT"
},
{
"version": "v3",
"created": "Mon, 13 May 2013 19:24:27 GMT"
}
] | 2013-05-14T00:00:00 |
[
[
"Solovey",
"Kiril",
""
],
[
"Halperin",
"Dan",
""
]
] |
new_dataset
| 0.96662 |
1303.6034
|
Akira SaiToh
|
Akira SaiToh
|
ZKCM: a C++ library for multiprecision matrix computation with
applications in quantum information
|
19 pages, 5 figures, to appear in Comput. Phys. Comm.; this is an
extended version of arXiv:1111.3124, v2: typographical corrections only
|
Comput. Phys. Comm. 184, 2005-2020 (2013)
|
10.1016/j.cpc.2013.03.022
| null |
cs.MS physics.comp-ph quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ZKCM is a C++ library developed for the purpose of multiprecision matrix
computation, on the basis of the GNU MP and MPFR libraries. It provides an
easy-to-use syntax and convenient functions for matrix manipulations including
those often used in numerical simulations in quantum physics. Its extension
library, ZKCM_QC, is developed for simulating quantum computing using the
time-dependent matrix-product-state simulation method. This paper gives an
introduction about the libraries with practical sample programs.
|
[
{
"version": "v1",
"created": "Mon, 25 Mar 2013 06:18:35 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Apr 2013 10:46:46 GMT"
}
] | 2013-05-14T00:00:00 |
[
[
"SaiToh",
"Akira",
""
]
] |
new_dataset
| 0.999619 |
1305.2548
|
Ilan Shomorony
|
Ra\'ul Etkin, Farzad Parvaresh, Ilan Shomorony, A. Salman Avestimehr
|
On Min-Cut Algorithms for Half-Duplex Relay Networks
|
Submitted to IEEE Transactions on Information Theory. Part of this
work will be presented at ISIT 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computing the cut-set bound in half-duplex relay networks is a challenging
optimization problem, since it requires finding the cut-set optimal half-duplex
schedule. This subproblem in general involves an exponential number of
variables, since the number of ways to assign each node to either transmitter
or receiver mode is exponential in the number of nodes. We present a general
technique that takes advantage of specific structures in the topology of a
given network and allows us to reduce the complexity of computing the
half-duplex schedule that maximizes the cut-set bound (with i.i.d. input
distribution). In certain classes of network topologies, our approach yields
polynomial time algorithms. We use simulations to show running time
improvements over alternative methods and compare the performance of various
half-duplex scheduling approaches in different SNR regimes.
|
[
{
"version": "v1",
"created": "Sun, 12 May 2013 00:31:55 GMT"
}
] | 2013-05-14T00:00:00 |
[
[
"Etkin",
"Raúl",
""
],
[
"Parvaresh",
"Farzad",
""
],
[
"Shomorony",
"Ilan",
""
],
[
"Avestimehr",
"A. Salman",
""
]
] |
new_dataset
| 0.97144 |
1305.2636
|
Mark Korenblit
|
Mark Korenblit
|
Full Square Rhomboids and Their Algebraic Expressions
|
13 pages, 10 figures. arXiv admin note: substantial text overlap with
arXiv:1211.1661
| null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper investigates relationship between algebraic expressions and graphs.
We consider a digraph called a full square rhomboid that is an example of
non-series-parallel graphs. Our intention is to simplify the expressions of
full square rhomboids and eventually find their shortest representations. With
that end in view, we describe two decomposition methods for generating
expressions of full square rhomboids and carry out their comparative analysis.
|
[
{
"version": "v1",
"created": "Sun, 12 May 2013 21:30:50 GMT"
}
] | 2013-05-14T00:00:00 |
[
[
"Korenblit",
"Mark",
""
]
] |
new_dataset
| 0.997415 |
1305.2724
|
Said Broumi
|
Said Broumi
|
Generalized Neutrosophic Soft Set
|
14 pages, 11 figures
|
International Journal of Computer Science, Engineering and
Information Technology (IJCSEIT), Vol.3, No.2,April2013
|
10.5121/ijcseit.2013.3202
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a new concept called generalized neutrosophic soft
set. This concept incorporates the beneficial properties of both generalized
neutrosophic set introduced by A.A. Salama [7]and soft set techniques proposed
by Molodtsov [4]. We also study some properties of this concept. Some
definitions and operations have been introduced on generalized neutrosophic
soft set. Finally we present an application of generalized neuutrosophic soft
set in decision making problem.
|
[
{
"version": "v1",
"created": "Mon, 13 May 2013 09:42:50 GMT"
}
] | 2013-05-14T00:00:00 |
[
[
"Broumi",
"Said",
""
]
] |
new_dataset
| 0.983151 |
1305.2837
|
Urmila Shrawankar Ms
|
Sumedha Chokhandre and Urmila Shrawankar
|
An Algorithm to Improve Performance over Multihop Wireless Mesh Network
|
Pages: 05 Figures: 07
|
Journal of Computing, Volume 3, Issue 5, May 2011, ISSN 2151-9617,
pp 155,159
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transmission Control Protocol (TCP) is the dominant reliable transport
protocol utilized in the Internet. Improving the performance of TCP associated
with the presence of multi-hop is one of the research challenges in wireless
mesh networks. Wireless mesh networks have large round trip time variations and
these variations are dependent on the number of hops. In wireless mesh network,
when congestion loss and wireless loss are co-existed the number of packets
dropped increases and will have adverse effects on TCP and its congestion
control mechanism which leads to low throughput. Here we have designed a new
TCP scheme for multi-hop wireless mesh networks, by modifying the sender side
congestion control functionality of TCP NewReno, which is tuned towards
improving the performance of TCP. The simulation results show that TCP SAC has
higher performance than TCP NewReno, Reno, Sack and Vegas in multi-hop wireless
mesh networks.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 07:32:53 GMT"
}
] | 2013-05-14T00:00:00 |
[
[
"Chokhandre",
"Sumedha",
""
],
[
"Shrawankar",
"Urmila",
""
]
] |
new_dataset
| 0.990086 |
1305.2865
|
Sultan Ullah
|
Sultan Ullah and Zheng Xuefeng and Zhou Feng
|
TCloud: A Dynamic Framework and Policies for Access Control across
Multiple Domains in Cloud Computing
| null |
International Journal of Computer Applications, Volume 62, No.2,
January 2013, 01-07
|
10.5120/10049-4636
| null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a cloud computing environment, access control policy is an effective means
of fortification cloud users and cloud resources services against security
infringements. Based on analysis of current cloud computing security
characteristics, the preamble of the concept of trust, role-based access
control policy, combined with the characteristics of the cloud computing
environment, there are multiple security management domains, so a new cross
domain framework is for access control is proposed which is based on trust. It
will establish and calculate the degree of trust in the single as well as
multiple domains. Role Based Access Control is used for the implementation of
the access control policies in a single domain environment with the
introduction of the trust concept. In multiple domains the access control will
be based on the conversion of roles. On the basis of trust, and role based
access control model, a new novel framework of flexible cross domain access
control framework is presented. The role assignment and conversion will take
place dynamically.
|
[
{
"version": "v1",
"created": "Wed, 10 Apr 2013 09:16:17 GMT"
}
] | 2013-05-14T00:00:00 |
[
[
"Ullah",
"Sultan",
""
],
[
"Xuefeng",
"Zheng",
""
],
[
"Feng",
"Zhou",
""
]
] |
new_dataset
| 0.999598 |
1304.4682
|
Yuan Li
|
Yuan Li, Haoyu Gao, Mingmin Yang, Wanqiu Guan, Haixin Ma, Weining
Qian, Zhigang Cao, Xiaoguang Yang
|
What are Chinese Talking about in Hot Weibos?
| null | null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SinaWeibo is a Twitter-like social network service emerging in China in
recent years. People can post weibos (microblogs) and communicate with others
on it. Based on a dataset of 650 million weibos from August 2009 to January
2012 crawled from APIs of SinaWeibo, we study the hot ones that have been
reposted for at least 1000 times. We find that hot weibos can be roughly
classified into eight categories, i.e. Entertainment & Fashion, Hot Social
Events, Leisure & Mood, Life & Health, Seeking for Help, Sales Promotion,
Fengshui & Fortune and Deleted Weibos. In particular, Leisure & Mood and Hot
Social Events account for almost 65% of all the hot weibos. This reflects very
well the fundamental dual-structure of the current society of China: On the one
hand, economy has made a great progress and quite a part of people are now
living a relatively prosperous and fairly easy life. On the other hand, there
still exist quite a lot of serious social problems, such as government
corruptions and environmental pollutions. It is also shown that users' posting
and reposting behaviors are greatly affected by their identity factors (gender,
verification status, and regional location). For instance, (1) Two thirds of
the hot weibos are created by male users. (2) Although verified users account
for only 0.1% in SinaWeibo, 46.5% of the hot weibos are contributed by them.
Very interestingly, 39.2% are written by SPA users. A more or less pathetic
fact is that only 14.4% of the hot weibos are created by grassroots (individual
users that are neither SPA nor verified). (3) Users from different areas of
China have distinct posting and reposting behaviors which usually reflect very
their local cultures. Homophily is also examined for people's reposting
behaviors.
|
[
{
"version": "v1",
"created": "Wed, 17 Apr 2013 04:25:33 GMT"
},
{
"version": "v2",
"created": "Fri, 10 May 2013 09:52:35 GMT"
}
] | 2013-05-13T00:00:00 |
[
[
"Li",
"Yuan",
""
],
[
"Gao",
"Haoyu",
""
],
[
"Yang",
"Mingmin",
""
],
[
"Guan",
"Wanqiu",
""
],
[
"Ma",
"Haixin",
""
],
[
"Qian",
"Weining",
""
],
[
"Cao",
"Zhigang",
""
],
[
"Yang",
"Xiaoguang",
""
]
] |
new_dataset
| 0.999299 |
1305.2233
|
Tianyang Bai
|
Tianyang Bai and Robert W. Heath, Jr
|
Asymptotic Coverage Probability and Rate in Massive MIMO Networks
|
Submitted to IEEE Wireless Communications Letters, May 2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Massive multiple-input multiple-output (MIMO) is a transmission technique for
cellular systems that uses many antennas to support not-as-many users. Thus
far, the performance of massive MIMO has only been examined in finite cellular
networks. In this letter, we analyze its performance in random cellular
networks with Poisson distributed base station locations. Specifically, we
provide analytical expressions for the asymptotic coverage probability and rate
in both downlink and uplink when each base station has a large number of
antennas. The results show that, though limited by pilot contamination, massive
MIMO can provide significantly higher asymptotic data rate per user than the
single-antenna network.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 00:53:46 GMT"
}
] | 2013-05-13T00:00:00 |
[
[
"Bai",
"Tianyang",
""
],
[
"Heath,",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.980768 |
1305.2322
|
Harry Boyer
|
Harimalala Razanamanampisoa, Zely Arivelo Randriamanantany, Hery Tiana
Rakotondramiarana, Fran\c{c}ois Garde (PIMENT), Harry Boyer (PIMENT)
|
Simulation of a typical house in the region of Antananarivo, Madagascar.
Determination of passive solutions using local materials
| null |
3rd International Madagascar Conference in High-Energy Physics
(HEP-MAD 07), Antanarivo : Madagascar (2007)
| null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with new proposals for the design of passive solutions
adapted to the climate of the highlands of Madagascar. While the strongest
population density is located in the central highlands, the problem of thermal
comfort in buildings occurs mainly during winter time. Currently, people use
raw wood to warm the poorly designed houses. This leads to a large scale
deforestation of the areas and causes erosion and environmental problems. The
methodology used consisted of the identification of a typical building and of a
typical meteorological year. Simulations were carried out using a thermal and
airflow software (CODYRUN) to improve each building component (roof, walls,
windows, and soil) in such a way as to estimate the influence of some technical
solutions on each component in terms of thermal comfort. The proposed solutions
also took into account the use of local materials and the standard of living of
the country.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 12:16:41 GMT"
}
] | 2013-05-13T00:00:00 |
[
[
"Razanamanampisoa",
"Harimalala",
"",
"PIMENT"
],
[
"Randriamanantany",
"Zely Arivelo",
"",
"PIMENT"
],
[
"Rakotondramiarana",
"Hery Tiana",
"",
"PIMENT"
],
[
"Garde",
"François",
"",
"PIMENT"
],
[
"Boyer",
"Harry",
"",
"PIMENT"
]
] |
new_dataset
| 0.98197 |
1305.2387
|
Zhang Lei
|
Jianxin Liao, Lei Zhang, Xiaomin Zhu, Jingyu Wang, Minyan Liao
|
Loss Rate Based Fountain Codes for Data Transfer
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fountain codes are becoming increasingly important for data transferring over
dedicated high-speed long-distance network. However, the encoding and decoding
complexity of traditional fountain codes such as LT and Raptor codes are still
high. In this paper, a new fountain codes named LRF (Loss Rate Based Fountain)
codes for data transfer is proposed. In order to improve the performance of
encoding and decoding efficiency and decrease the number of redundant encoding
symbols, an innovative degree distribution instead of robust soliton degree
distribution in LT (Luby Transfer) codes is proposed. In LRF codes, the degree
of encoding symbol is decided by loss rate property, and the window size is
extended dynamic. Simulations result using LRF codes show that the proposed
method has better performance in term of encoding ratio, degree ratio, encoding
and decoding efficiency with respect to LT and Raptor codes.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 17:05:17 GMT"
}
] | 2013-05-13T00:00:00 |
[
[
"Liao",
"Jianxin",
""
],
[
"Zhang",
"Lei",
""
],
[
"Zhu",
"Xiaomin",
""
],
[
"Wang",
"Jingyu",
""
],
[
"Liao",
"Minyan",
""
]
] |
new_dataset
| 0.998891 |
1305.2395
|
Toshiro Kubota
|
Toshiro Kubota, Jessica Ranck, Briley Acker, and Herman De Haan
|
Shape Reconstruction and Recognition with Isolated Non-directional Cues
|
28 pages, 14 figures, 4 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper investigates a hypothesis that our visual system groups visual cues
based on how they form a surface, or more specifically triangulation derived
from the visual cues. To test our hypothesis, we compare shape recognition with
three different representations of visual cues: a set of isolated dots
delineating the outline of the shape, a set of triangles obtained from Delaunay
triangulation of the set of dots, and a subset of Delaunay triangles excluding
those outside of the shape. Each participant was assigned to one particular
representation type and increased the number of dots (and consequentially
triangles) until the underlying shape could be identified. We compare the
average number of dots needed for identification among three types of
representations. Our hypothesis predicts that the results from the three
representations will be similar. However, they show statistically significant
differences. The paper also presents triangulation based algorithms for
reconstruction and recognition of a shape from a set of isolated dots.
Experiments showed that the algorithms were more effective and perceptually
agreeable than similar contour based ones. From these experiments, we conclude
that triangulation does affect our shape recognition. However, the surface
based approach presents a number of computational advantages over the contour
based one and should be studied further.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 17:35:02 GMT"
}
] | 2013-05-13T00:00:00 |
[
[
"Kubota",
"Toshiro",
""
],
[
"Ranck",
"Jessica",
""
],
[
"Acker",
"Briley",
""
],
[
"De Haan",
"Herman",
""
]
] |
new_dataset
| 0.981033 |
1208.4721
|
Willi-Hans Steeb WHS
|
Willi-Hans Steeb and Yorick Hardy
|
Hamilton Operators, Discrete Symmetries, Brute Force and SymbolicC++
| null |
Int. J. Mod. Phys. C 24, 1250095 (2013)
|
10.1142/S0129183112500957
| null |
cs.MS math-ph math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To find the discrete symmetries of a Hamilton operator $\hat H$ is of central
importance in quantum theory. Here we describe and implement a brute force
method to determine the discrete symmetries given by permutation matrices for
Hamilton operators acting in a finite-dimensional Hilbert space. Spin and Fermi
systems are considered as examples. A computer algebra implementation in
SymbolicC++ is provided.
|
[
{
"version": "v1",
"created": "Thu, 23 Aug 2012 11:09:57 GMT"
}
] | 2013-05-10T00:00:00 |
[
[
"Steeb",
"Willi-Hans",
""
],
[
"Hardy",
"Yorick",
""
]
] |
new_dataset
| 0.980657 |
1305.1375
|
Rob Gysel
|
Rob Gysel
|
Unique Perfect Phylogeny Characterizations via Uniquely Representable
Chordal Graphs
| null | null | null | null |
cs.DM cs.CE math.CO q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The perfect phylogeny problem is a classic problem in computational biology,
where we seek an unrooted phylogeny that is compatible with a set of
qualitative characters. Such a tree exists precisely when an intersection graph
associated with the character set, called the partition intersection graph, can
be triangulated using a restricted set of fill edges. Semple and Steel used the
partition intersection graph to characterize when a character set has a unique
perfect phylogeny. Bordewich, Huber, and Semple showed how to use the partition
intersection graph to find a maximum compatible set of characters. In this
paper, we build on these results, characterizing when a unique perfect
phylogeny exists for a subset of partial characters. Our characterization is
stated in terms of minimal triangulations of the partition intersection graph
that are uniquely representable, also known as ur-chordal graphs. Our
characterization is motivated by the structure of ur-chordal graphs, and the
fact that the block structure of minimal triangulations is mirrored in the
graph that has been triangulated.
|
[
{
"version": "v1",
"created": "Tue, 7 May 2013 01:20:15 GMT"
},
{
"version": "v2",
"created": "Wed, 8 May 2013 08:15:31 GMT"
}
] | 2013-05-09T00:00:00 |
[
[
"Gysel",
"Rob",
""
]
] |
new_dataset
| 0.984748 |
1305.1737
|
Rushan Ziatdinov
|
Rushan Ziatdinov, Rifkat I. Nabiyev, Kenjiro T. Miura
|
MC-curves and aesthetic measurements for pseudospiral curve segments
| null |
Mathematical Design & Technical Aesthetics 1(1), 6-17, 2013
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article studies families of curves with monotonic curvature function
(MC-curves) and their applications in geometric modelling and aesthetic design.
Aesthetic analysis and assessment of the structure and plastic qualities of
pseudospirals, which are curves with monotonic curvature function, are
conducted for the first time in the field of geometric modelling from the
position of technical aesthetics laws. The example of car body surface
modelling with the use of aesthetics splines is given.
|
[
{
"version": "v1",
"created": "Wed, 8 May 2013 07:59:52 GMT"
}
] | 2013-05-09T00:00:00 |
[
[
"Ziatdinov",
"Rushan",
""
],
[
"Nabiyev",
"Rifkat I.",
""
],
[
"Miura",
"Kenjiro T.",
""
]
] |
new_dataset
| 0.989255 |
1202.1387
|
Somayeh Salimi
|
Somayeh Salimi, Mikael Skoglund, Mahmoud Salmasizadeh, Mohammad Reza
Aref
|
Successive Secret Key Agreement over Generalized Multiple Access and
Broadcast Channels
|
This paper has been withdrawn by the author due to the fact that an
extended version is accepted in IEEE J-SAC
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A secret key agreement framework between three users is considered in which
each of the users 1 and 2 intends to share a secret key with user 3 and users 1
and 2 are eavesdroppers with respect to each other. There is a generalized
discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user
3 where the three users receive outputs from the channel. Furthermore, there is
a broadcast channel (BC) from user 3 to users 1 and 2. Secret key sharing is
intended where GDMMAC and BC can be successively used. In this framework, an
inner bound of the secret key capacity region is derived. Moreover, for a
special case where the channel inputs and outputs of the GDMAC and the BC form
Markov chains in some order, the secret key capacity region is derived. Also
the results are discussed through a binary example.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2012 10:04:48 GMT"
},
{
"version": "v2",
"created": "Mon, 7 May 2012 10:46:04 GMT"
},
{
"version": "v3",
"created": "Tue, 7 May 2013 11:38:42 GMT"
}
] | 2013-05-08T00:00:00 |
[
[
"Salimi",
"Somayeh",
""
],
[
"Skoglund",
"Mikael",
""
],
[
"Salmasizadeh",
"Mahmoud",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.998568 |
1305.1293
|
Xiang Ying Xiang Ying
|
Xiang Ying, Shi-Qing Xin, Ying He
|
Parallel Chen-Han (PCH) Algorithm for Discrete Geodesics
|
10 pages, accepted to ACM Transactions on Graphics with major
revision
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many graphics applications, the computation of exact geodesic distance is
very important. However, the high computational cost of the existing geodesic
algorithms means that they are not practical for large-scale models or
time-critical applications. To tackle this challenge, we propose the parallel
Chen-Han (or PCH) algorithm, which extends the classic Chen-Han (CH) discrete
geodesic algorithm to the parallel setting. The original CH algorithm and its
variant both lack a parallel solution because the windows (a key data structure
that carries the shortest distance in the wavefront propagation) are maintained
in a strict order or a tightly coupled manner, which means that only one window
is processed at a time. We propose dividing the CH's sequential algorithm into
four phases, window selection, window propagation, data organization, and
events processing so that there is no data dependence or conflicts in each
phase and the operations within each phase can be carried out in parallel. The
proposed PCH algorithm is able to propagate a large number of windows
simultaneously and independently. We also adopt a simple yet effective strategy
to control the total number of windows. We implement the PCH algorithm on
modern GPUs (such as Nvidia GTX 580) and analyze the performance in detail. The
performance improvement (compared to the sequential algorithms) is highly
consistent with GPU double-precision performance (GFLOPS). Extensive
experiments on real-world models demonstrate an order of magnitude improvement
in execution time compared to the state-of-the-art.
|
[
{
"version": "v1",
"created": "Tue, 7 May 2013 14:09:16 GMT"
}
] | 2013-05-08T00:00:00 |
[
[
"Ying",
"Xiang",
""
],
[
"Xin",
"Shi-Qing",
""
],
[
"He",
"Ying",
""
]
] |
new_dataset
| 0.984496 |
1305.1473
|
Rushan Ziatdinov
|
Rushan Ziatdinov, Kenjiro T. Miura
|
On the variety of planar spirals and their applications in computer
aided design
| null |
European Researcher 27(8-2), 1227-1232, 2012
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we discuss the variety of planar spiral segments and their
applications in objects in both the real and artificial world. The discussed
curves with monotonic curvature function are well-known in geometric modelling
and computer aided geometric design as fair curves, and they are very
significant in aesthetic shape modelling. Fair curve segments are used for
two-point G1 and G2 Hermite interpolation, as well as for generating aesthetic
splines.
|
[
{
"version": "v1",
"created": "Tue, 7 May 2013 11:35:49 GMT"
}
] | 2013-05-08T00:00:00 |
[
[
"Ziatdinov",
"Rushan",
""
],
[
"Miura",
"Kenjiro T.",
""
]
] |
new_dataset
| 0.978242 |
1305.1598
|
Aria Ghasemian Sahebi
|
Aria G. Sahebi and S. Sandeep Pradhan
|
Abelian Group Codes for Source Coding and Channel Coding
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the asymptotic performance of Abelian group codes for
the lossy source coding problem for arbitrary discrete (finite alphabet)
memoryless sources as well as the channel coding problem for arbitrary discrete
(finite alphabet) memoryless channels. For the source coding problem, we derive
an achievable rate-distortion function that is characterized in a single-letter
information-theoretic form using the ensemble of Abelian group codes. When the
underlying group is a field, it simplifies to the symmetric rate-distortion
function. Similarly, for the channel coding problem, we find an achievable rate
characterized in a single-letter information-theoretic form using group codes.
This simplifies to the symmetric capacity of the channel when the underlying
group is a field. We compute the rate-distortion function and the achievable
rate for several examples of sources and channels. Due to the non-symmetric
nature of the sources and channels considered, our analysis uses a synergy of
information theoretic and group-theoretic tools.
|
[
{
"version": "v1",
"created": "Tue, 7 May 2013 18:13:41 GMT"
}
] | 2013-05-08T00:00:00 |
[
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.978325 |
1304.7346
|
Imran Sarwar Bajwa Dr.
|
Imran Sarwar Bajwa, Behzad Bordbar, Mark Lee
|
SBVR vs OCL: A Comparative Analysis of Standards
|
14th IEEE International Multitopic Conference (INMIC 2011),
pp.261-266, Karachi, Pakistan
| null |
10.1109/INMIC.2011.6151485
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In software modelling, the designers have to produce UML visual models with
software constraints. Similarly, in business modelling, designers have to model
business processes using business constraints (business rules). Constraints are
the key components in the skeleton of business or software models. A designer
has to write constraints to semantically compliment business models or UML
models and finally implementing the constraints into business processes or
source code. Business constraints/rules can be written using SBVR (Semantics of
Business Vocabulary and Rules) while OCL (Object Constraint Language) is the
well-known medium for writing software constraints. SBVR and OCL are two
significant standards from OMG. Both standards are principally different as
SBVR is typically used in business domains and OCL is employed to compliment
software models. However, we have identified a few similarities in both
standards that are interesting to study. In this paper, we have performed a
comparative analysis of both standards as we are looking for a mechanism for
automatic transformation of SBVR to OCL. The major emphasis of the study is to
highlight principal features of SBVR and OCL such as similarities, differences
and key parameters on which these both standards can work together.
|
[
{
"version": "v1",
"created": "Sat, 27 Apr 2013 08:17:53 GMT"
}
] | 2013-05-07T00:00:00 |
[
[
"Bajwa",
"Imran Sarwar",
""
],
[
"Bordbar",
"Behzad",
""
],
[
"Lee",
"Mark",
""
]
] |
new_dataset
| 0.998103 |
1305.0918
|
Jalaluddin Qureshi
|
Jalaluddin Qureshi and Chuan Heng Fohy and Jianfei Cai
|
Primer and Recent Developments on Fountain Codes
|
This paper appears in BSP Recent Patents on Telecommunications
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we survey the various erasure codes which had been proposed and
patented recently, and along the survey we provide introductory tutorial on
many of the essential concepts and readings in erasure and Fountain codes.
Packet erasure is a fundamental characteristic inherent in data storage and
data transmission system. Traditionally replication/ retransmission based
techniques had been employed to deal with packet erasures in such systems.
While the Reed-Solomon (RS) erasure codes had been known for quite some time to
improve system reliability and reduce data redundancy, the high decoding
computation cost of RS codes has offset wider implementation of RS codes.
However recent exponential growth in data traffic and demand for larger data
storage capacity has simmered interest in erasure codes. Recent results have
shown promising results to address the decoding computation complexity and
redundancy tradeoff inherent in erasure codes.
|
[
{
"version": "v1",
"created": "Sat, 4 May 2013 13:10:02 GMT"
}
] | 2013-05-07T00:00:00 |
[
[
"Qureshi",
"Jalaluddin",
""
],
[
"Fohy",
"Chuan Heng",
""
],
[
"Cai",
"Jianfei",
""
]
] |
new_dataset
| 0.980768 |
1305.0958
|
Sundeep Rangan
|
Russell Ford, Changkyu Kim, Sundeep Rangan
|
Opportunistic Third-Party Backhaul for Cellular Wireless Networks
|
9 pages, 6 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With high capacity air interfaces and large numbers of small cells, backhaul
-- the wired connectivity to base stations -- is increasingly becoming the cost
driver in cellular wireless networks. One reason for the high cost of backhaul
is that capacity is often purchased on leased lines with guaranteed rates
provisioned to peak loads. In this paper, we present an alternate
\emph{opportunistic backhaul} model where third parties provide base stations
and backhaul connections and lease out excess capacity in their networks to the
cellular provider when available, presumably at significantly lower costs than
guaranteed connections. We describe a scalable architecture for such
deployments using open access femtocells, which are small plug-and-play base
stations that operate in the carrier's spectrum but can connect directly into
the third party provider's wired network. Within the proposed architecture, we
present a general user association optimization algorithm that enables the
cellular provider to dynamically determine which mobiles should be assigned to
the third-party femtocells based on the traffic demands, interference and
channel conditions and third-party access pricing. Although the optimization is
non-convex, the algorithm uses a computationally efficient method for finding
approximate solutions via dual decomposition. Simulations of the deployment
model based on actual base station locations are presented that show that large
capacity gains are achievable if adoption of third-party, open access
femtocells can reach even a small fraction of the current market penetration of
WiFi access points.
|
[
{
"version": "v1",
"created": "Sat, 4 May 2013 20:51:56 GMT"
}
] | 2013-05-07T00:00:00 |
[
[
"Ford",
"Russell",
""
],
[
"Kim",
"Changkyu",
""
],
[
"Rangan",
"Sundeep",
""
]
] |
new_dataset
| 0.993026 |
1305.1112
|
Tommaso Urli
|
Tommaso Urli
|
json2run: a tool for experiment design & analysis
| null | null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
json2run is a tool to automate the running, storage and analysis of
experiments. The main advantage of json2run is that it allows to describe a set
of experiments concisely as a JSON-formatted parameter tree. It also supports
parallel execution of experiments, automatic parameter tuning through the
F-Race framework and storage and analysis of experiments with MongoDB and R.
|
[
{
"version": "v1",
"created": "Mon, 6 May 2013 08:31:48 GMT"
}
] | 2013-05-07T00:00:00 |
[
[
"Urli",
"Tommaso",
""
]
] |
new_dataset
| 0.996053 |
1305.1221
|
Mario Blaum
|
Mario Blaum and James S. Plank
|
Construction of two SD Codes
|
8 pages. arXiv admin note: text overlap with arXiv:1305.0032
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SD codes are erasure codes that address the mixed failure mode of current
RAID systems. Rather than dedicate entire disks to erasure coding, as done in
RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus
individual sectors to erasure coding. The code then tolerates combinations of
disk and sector errors, rather than solely disk errors. It is been an open
problem to construct general codes that have the SD property, and previous work
has relied on Monte Carlo searches. In this paper, we present two general
constructions that address the cases with one disk and two sectors, and two
disks and two sectors. Additionally, we make an observation about shortening SD
codes that allows us to prune Monte Carlo searches.
|
[
{
"version": "v1",
"created": "Mon, 6 May 2013 15:30:31 GMT"
}
] | 2013-05-07T00:00:00 |
[
[
"Blaum",
"Mario",
""
],
[
"Plank",
"James S.",
""
]
] |
new_dataset
| 0.999662 |
1305.1270
|
Grasha Jacob Mrs
|
Grasha Jacob, A. Murugan
|
An Encryption Scheme with DNA Technology and JPEG Zigzag Coding for
Secure Transmission of Images
|
5 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet is a ubiquitous and affordable communications network suited for
e-commerce and medical image communications. Security has become a major issue
as data communication channels can be intruded by intruders during
transmission. Though, different methods have been proposed and used to protect
the transmission of data from illegal and unauthorized access, code breakers
have come up with various methods to crack them. DNA based Cryptography brings
forward a new hope for unbreakable algorithms. This paper outlines an
encryption scheme with DNA technology and JPEG Zigzag Coding for Secure
Transmission of Images.
|
[
{
"version": "v1",
"created": "Mon, 6 May 2013 18:37:12 GMT"
}
] | 2013-05-07T00:00:00 |
[
[
"Jacob",
"Grasha",
""
],
[
"Murugan",
"A.",
""
]
] |
new_dataset
| 0.992144 |
1305.0668
|
Ayad Ghany Ismaeel
|
Ayad Ghany Ismaeel, Raghad Zuhair Yousif and Essa F. Abdallh
|
GUI Based Automatic Remote Control of Gas Reduction System using PIC
Microcontroller
|
11 pages, 25 figures, Tables 4, and this research obtained
certificate from Erbil Power Station, which is the beneficiary company of it.
Available at http://www.estij.org/papers/vol3no22013/1vol3no2.pdf, 2013
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The GRS is a one of the important units in Erbil Power Station EPS, which is
responsible on controlling gas pressure and gas temperature this unit
previously works manually. The local control panel for GRS system contains two
types of digital signals the first one indicated by Light Emitting Diodes LED
to point normal operations, fault and alarm, and event of operations while the
second indicated by ON-OFF switches, which consists of two types the push
buttons switch and mode selector switch. To overcome human in manual control
faults in controlling GRS systems, automation system becomes the best solution.
The purpose of this research is to design and implement embedded automation
system that can be used to control a GRS automatically through a GUI and from
remote location by using programmable interface controller (PIC16F877A). In
this research the (PIC) software which is based on (C language), developed by
Microchip (MPLAB) is used in programming a PIC microcontroller, then Visual
Basic is used in the construction of GUI, the RS-232 serial cable is used as a
connector between PIC and PC. Implement the proposed design and test it as a
first system shows all operations of GRS successful were converted into full
computerize controlling (with the ability of full automatic control) from
remote location through proposed GUI. Keywords-Peripheral Interface Controller
(PIC); Microcontroller; Graphical User Interface (GUI); Remote; Control.
|
[
{
"version": "v1",
"created": "Fri, 3 May 2013 10:51:38 GMT"
}
] | 2013-05-06T00:00:00 |
[
[
"Ismaeel",
"Ayad Ghany",
""
],
[
"Yousif",
"Raghad Zuhair",
""
],
[
"Abdallh",
"Essa F.",
""
]
] |
new_dataset
| 0.9677 |
0912.3016
|
Akitoshi Kawamura
|
Akitoshi Kawamura, Ji\v{r}\'i Matou\v{s}ek, Takeshi Tokuyama
|
Zone Diagrams in Euclidean Spaces and in Other Normed Spaces
|
Title page + 16 pages, 20 figures
|
Mathematische Annalen 354(4):1201-1221, 2012
|
10.1007/s00208-011-0761-1
| null |
cs.CG math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Zone diagram is a variation on the classical concept of a Voronoi diagram.
Given n sites in a metric space that compete for territory, the zone diagram is
an equilibrium state in the competition. Formally it is defined as a fixed
point of a certain "dominance" map.
Asano, Matousek, and Tokuyama proved the existence and uniqueness of a zone
diagram for point sites in Euclidean plane, and Reem and Reich showed existence
for two arbitrary sites in an arbitrary metric space. We establish existence
and uniqueness for n disjoint compact sites in a Euclidean space of arbitrary
(finite) dimension, and more generally, in a finite-dimensional normed space
with a smooth and rotund norm. The proof is considerably simpler than that of
Asano et al. We also provide an example of non-uniqueness for a norm that is
rotund but not smooth. Finally, we prove existence and uniqueness for two point
sites in the plane with a smooth (but not necessarily rotund) norm.
|
[
{
"version": "v1",
"created": "Tue, 15 Dec 2009 22:01:11 GMT"
}
] | 2013-05-03T00:00:00 |
[
[
"Kawamura",
"Akitoshi",
""
],
[
"Matoušek",
"Jiří",
""
],
[
"Tokuyama",
"Takeshi",
""
]
] |
new_dataset
| 0.998674 |
1305.0300
|
Andrew Adamatzky
|
Andrew Adamatzky and Genaro J. Martinez
|
Bio-imitaiton of Mexican migration routes to the USA with slime mould on
3D terrains
| null |
Adamatzky A. and Martinez G. J. Bio-Imitation of Mexican Migration
Routes to the USA with Slime Mould on 3D Terrains. J Bionic Engineering 10
(2013) 242--250
|
10.1016/S1672-6529(13)60220-6
| null |
cs.ET nlin.AO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Plasmodium of Physarum polycephalum is a large single cell visible by unaided
eye. It shows sophisticated behavioural traits in foraging for nutrients and
developing an optimal transport network of protoplasmic tubes spanning sources
of nutrients. When placed in an environment with distributed sources of
nutrients the cell 'computes' an optimal graph spanning the nutrients by
growing a network of protoplasmic tubes. P. polycephalum imitates development
of man-made transport networks of a country when configuration of nutrients
represents major urban areas. We employ this feature of the slime mould to
imitate mexican migration to USA. The Mexican migration to USA is the World's
largest migration system. We bio-physically imitate the migration using slime
mould P. polycephalum. In laboratory experiments with 3D Nylon terrains of USA
we imitated development of migratory routes from Mexico-USA border to ten urban
areas with high concentration of Mexican migrants. From results of laboratory
experiments we extracted topologies of migratory routes, and highlighted a role
of elevations in shaping the human movement networks.
|
[
{
"version": "v1",
"created": "Wed, 1 May 2013 21:52:02 GMT"
}
] | 2013-05-03T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
],
[
"Martinez",
"Genaro J.",
""
]
] |
new_dataset
| 0.999274 |
1305.0433
|
Ioan Todinca
|
Mathieu Chapelle (1), Mathieu Liedloff (2), Ioan Todinca (2), and
Yngve Villanger (3) ((1) University Paris Est, France, (2) University of
Orleans, France, (3) University of Bergen, Norway)
|
TREEWIDTH and PATHWIDTH parameterized by vertex cover
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
After the number of vertices, Vertex Cover is the largest of the classical
graph parameters and has more and more frequently been used as a separate
parameter in parameterized problems, including problems that are not directly
related to the Vertex Cover. Here we consider the TREEWIDTH and PATHWIDTH
problems parameterized by k, the size of a minimum vertex cover of the input
graph. We show that the PATHWIDTH and TREEWIDTH can be computed in O*(3^k)
time. This complements recent polynomial kernel results for TREEWIDTH and
PATHWIDTH parameterized by the Vertex Cover.
|
[
{
"version": "v1",
"created": "Thu, 2 May 2013 13:49:35 GMT"
}
] | 2013-05-03T00:00:00 |
[
[
"Chapelle",
"Mathieu",
""
],
[
"Liedloff",
"Mathieu",
""
],
[
"Todinca",
"Ioan",
""
],
[
"Villanger",
"Yngve",
""
]
] |
new_dataset
| 0.999667 |
1305.0032
|
Mario Blaum
|
Mario Blaum
|
Construction of PMDS and SD Codes extending RAID 5
|
7 pages
| null | null |
IBM Research Report, IBM Research Report, RJ10504, March 2013
|
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk
(SD) codes extending RAID 5 with two extra parities is given, solving an open
problem. Previous constructions relied on computer searches, while our
constructions provide a theoretical solution to the problem.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 21:45:17 GMT"
}
] | 2013-05-02T00:00:00 |
[
[
"Blaum",
"Mario",
""
]
] |
new_dataset
| 0.996449 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.