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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1405.3033
|
Zeeshan Bhatti
|
Zeeshan Bhatti, Ahmad Waqas, Imdad Ali Ismaili, Dil Nawaz Hakro,
Waseem Javaid Soomro
|
Phonetic based SoundEx & ShapeEx algorithm for Sindhi Spell Checker
System
|
9 pages, 6 figures, 5 Tables, Sindhi Computing, Sindhi Language
|
Adv. Environ. Biol., 8(4), 1147-1155, AENSI Publisher, 2014
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
This paper presents a novel combinational phonetic algorithm for Sindhi
Language, to be used in developing Sindhi Spell Checker which has yet not been
developed prior to this work. The compound textual forms and glyphs of Sindhi
language presents a substantial challenge for developing Sindhi spell checker
system and generating similar suggestion list for misspelled words. In order to
implement such a system, phonetic based Sindhi language rules and patterns must
be considered into account for increasing the accuracy and efficiency. The
proposed system is developed with a blend between Phonetic based SoundEx
algorithm and ShapeEx algorithm for pattern or glyph matching, generating
accurate and efficient suggestion list for incorrect or misspelled Sindhi
words. A table of phonetically similar sounding Sindhi characters for SoundEx
algorithm is also generated along with another table containing similar glyph
or shape based character groups for ShapeEx algorithm. Both these are first
ever attempt of any such type of categorization and representation for Sindhi
Language.
|
[
{
"version": "v1",
"created": "Tue, 13 May 2014 04:33:04 GMT"
}
] | 2014-05-14T00:00:00 |
[
[
"Bhatti",
"Zeeshan",
""
],
[
"Waqas",
"Ahmad",
""
],
[
"Ismaili",
"Imdad Ali",
""
],
[
"Hakro",
"Dil Nawaz",
""
],
[
"Soomro",
"Waseem Javaid",
""
]
] |
new_dataset
| 0.972611 |
1405.3094
|
Olfa Boubaker
|
Olfa Boubaker
|
The inverted Pendulum: A fundamental Benchmark in Control Theory and
Robotics
|
IEEE International Conference on Education and e-Learning Innovations
(ICEELI), 1-3 July 2012, Sousse, Tunisia
| null |
10.1109/ICEELI.2012.6360606
| null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For at least fifty years, the inverted pendulum has been the most popular
benchmark, among others, for teaching and researches in control theory and
robotics. This paper presents the key motivations for the use of that system
and explains, in details, the main reflections on how the inverted pendulum
benchmark gives an effective and efficient application. Several real
experiences, virtual models and web-based remote control laboratories will be
presented with emphasis on the practical design implementation of this system.
A bibliographical survey of different design control approaches and trendy
robotic problems will be presented through applications to the inverted
pendulum system. In total, 150 references in the open literature, dating back
to 1960, are compiled to provide an overall picture of historical, current and
challenging developments.
|
[
{
"version": "v1",
"created": "Tue, 13 May 2014 10:38:02 GMT"
}
] | 2014-05-14T00:00:00 |
[
[
"Boubaker",
"Olfa",
""
]
] |
new_dataset
| 0.997319 |
1405.3199
|
Hasnae Rahimi
|
Hasnae Rahimi and Hanan EL Bakkali
|
A New Trust Reputation System for E-Commerce Applications
|
7 pages, 12 references. International Journal of Computer Science
Issues (IJCSI) 2013
| null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robust Trust Reputation Systems (TRS) provide a most trustful reputation
score for a specific product or service so as to support relying parties taking
the right decision while interacting with an e-commerce application. Thus, TRS
must rely on an appropriate architecture and suitable algorithms that are able
to improve the selection, storage, generation and classification of textual
feedbacks. In this work, we propose a new architecture for TRS in e-commerce
applications. In fact, we propose an intelligent layer which displays to each
feedback provider, who has already given his recommendation on a product, a
collection of prefabricated feedbacks related to the same product. The proposed
reputation algorithm generates better trust degree of the user, trust degree of
the feedback and a better global reputation score of the product.
|
[
{
"version": "v1",
"created": "Tue, 13 May 2014 15:51:57 GMT"
}
] | 2014-05-14T00:00:00 |
[
[
"Rahimi",
"Hasnae",
""
],
[
"Bakkali",
"Hanan EL",
""
]
] |
new_dataset
| 0.987248 |
1307.0118
|
Yanshu Zhu
|
Yanshu Zhu, Feng Sun, Yi-King Choi, Bert J\"uttler, Wenping Wang
|
Computing a Compact Spline Representation of the Medial Axis Transform
of a 2D Shape
|
GMP14 (Geometric Modeling and Processing)
| null |
10.1016/j.gmod.2014.03.007
| null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a full pipeline for computing the medial axis transform of an
arbitrary 2D shape. The instability of the medial axis transform is overcome by
a pruning algorithm guided by a user-defined Hausdorff distance threshold. The
stable medial axis transform is then approximated by spline curves in 3D to
produce a smooth and compact representation. These spline curves are computed
by minimizing the approximation error between the input shape and the shape
represented by the medial axis transform. Our results on various 2D shapes
suggest that our method is practical and effective, and yields faithful and
compact representations of medial axis transforms of 2D shapes.
|
[
{
"version": "v1",
"created": "Sat, 29 Jun 2013 15:32:23 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Dec 2013 11:44:55 GMT"
},
{
"version": "v3",
"created": "Sat, 10 May 2014 19:56:31 GMT"
}
] | 2014-05-13T00:00:00 |
[
[
"Zhu",
"Yanshu",
""
],
[
"Sun",
"Feng",
""
],
[
"Choi",
"Yi-King",
""
],
[
"Jüttler",
"Bert",
""
],
[
"Wang",
"Wenping",
""
]
] |
new_dataset
| 0.985527 |
1401.5980
|
Dimitri Kartsaklis
|
Dimitri Kartsaklis, Mehrnoosh Sadrzadeh, Stephen Pulman, Bob Coecke
|
Reasoning about Meaning in Natural Language with Compact Closed
Categories and Frobenius Algebras
| null | null | null | null |
cs.CL cs.AI math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compact closed categories have found applications in modeling quantum
information protocols by Abramsky-Coecke. They also provide semantics for
Lambek's pregroup algebras, applied to formalizing the grammatical structure of
natural language, and are implicit in a distributional model of word meaning
based on vector spaces. Specifically, in previous work Coecke-Clark-Sadrzadeh
used the product category of pregroups with vector spaces and provided a
distributional model of meaning for sentences. We recast this theory in terms
of strongly monoidal functors and advance it via Frobenius algebras over vector
spaces. The former are used to formalize topological quantum field theories by
Atiyah and Baez-Dolan, and the latter are used to model classical data in
quantum protocols by Coecke-Pavlovic-Vicary. The Frobenius algebras enable us
to work in a single space in which meanings of words, phrases, and sentences of
any structure live. Hence we can compare meanings of different language
constructs and enhance the applicability of the theory. We report on
experimental results on a number of language tasks and verify the theoretical
predictions.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 14:20:58 GMT"
}
] | 2014-05-13T00:00:00 |
[
[
"Kartsaklis",
"Dimitri",
""
],
[
"Sadrzadeh",
"Mehrnoosh",
""
],
[
"Pulman",
"Stephen",
""
],
[
"Coecke",
"Bob",
""
]
] |
new_dataset
| 0.994535 |
1405.2602
|
Guanghui Zhang
|
Bocong Chen, San Ling, Guanghui Zhang
|
Self-dual cyclic codes over finite chain rings
|
15 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle
\gamma\rangle$, and let $n$ be a positive integer coprime with the
characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic
structure of cyclic codes of length $n$ over $R$ is investigated. Some new
necessary and sufficient conditions for the existence of nontrivial self-dual
cyclic codes are provided. An enumeration formula for the self-dual cyclic
codes is also studied.
|
[
{
"version": "v1",
"created": "Sun, 11 May 2014 23:31:19 GMT"
}
] | 2014-05-13T00:00:00 |
[
[
"Chen",
"Bocong",
""
],
[
"Ling",
"San",
""
],
[
"Zhang",
"Guanghui",
""
]
] |
new_dataset
| 0.975845 |
1405.2605
|
Hassan Ghozlan
|
Hassan Ghozlan and Gerhard Kramer
|
Phase Modulation for Discrete-time Wiener Phase Noise Channels with
Oversampling at High SNR
|
To appear in ISIT 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A discrete-time Wiener phase noise channel model is introduced in which
multiple samples are available at the output for every input symbol. A lower
bound on the capacity is developed. At high signal-to-noise ratio (SNR), if the
number of samples per symbol grows with the square root of the SNR, the
capacity pre-log is at least 3/4. This is strictly greater than the capacity
pre-log of the Wiener phase noise channel with only one sample per symbol,
which is 1/2. It is shown that amplitude modulation achieves a pre-log of 1/2
while phase modulation achieves a pre-log of at least 1/4.
|
[
{
"version": "v1",
"created": "Mon, 12 May 2014 00:25:06 GMT"
}
] | 2014-05-13T00:00:00 |
[
[
"Ghozlan",
"Hassan",
""
],
[
"Kramer",
"Gerhard",
""
]
] |
new_dataset
| 0.962132 |
cs/0401020
|
Gabriele Scheler
|
Gabriele Scheler and Johann Schumann
|
Presynaptic modulation as fast synaptic switching: state-dependent
modulation of task performance
|
6 pages, 13 figures
|
Neural Networks, 2003. Proceedings of the International Joint
Conference on (Volume:1 ) 218 - 223
|
10.1109/IJCNN.2003.1223347
| null |
cs.NE q-bio.NC
| null |
Neuromodulatory receptors in presynaptic position have the ability to
suppress synaptic transmission for seconds to minutes when fully engaged. This
effectively alters the synaptic strength of a connection. Much work on
neuromodulation has rested on the assumption that these effects are uniform at
every neuron. However, there is considerable evidence to suggest that
presynaptic regulation may be in effect synapse-specific. This would define a
second "weight modulation" matrix, which reflects presynaptic receptor efficacy
at a given site. Here we explore functional consequences of this hypothesis. By
analyzing and comparing the weight matrices of networks trained on different
aspects of a task, we identify the potential for a low complexity "modulation
matrix", which allows to switch between differently trained subtasks while
retaining general performance characteristics for the task. This means that a
given network can adapt itself to different task demands by regulating its
release of neuromodulators. Specifically, we suggest that (a) a network can
provide optimized responses for related classification tasks without the need
to train entirely separate networks and (b) a network can blend a "memory mode"
which aims at reproducing memorized patterns and a "novelty mode" which aims to
facilitate classification of new patterns. We relate this work to the known
effects of neuromodulators on brain-state dependent processing.
|
[
{
"version": "v1",
"created": "Sun, 25 Jan 2004 04:22:00 GMT"
}
] | 2014-05-13T00:00:00 |
[
[
"Scheler",
"Gabriele",
""
],
[
"Schumann",
"Johann",
""
]
] |
new_dataset
| 0.996848 |
1404.6851
|
Fabio Brochero Martinez
|
F.E. Brochero Mart\'inez, C. R. Giraldo Vergara
|
Weight enumerator of some irreducible cyclic codes
|
Submitted to Designs, Codes and Cryptography, 8 pages
| null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we show explicitly all possible weight enumerators for every
irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the
case which each prime divisor of $n$ is also a divisor of $q-1$.
|
[
{
"version": "v1",
"created": "Mon, 28 Apr 2014 01:28:30 GMT"
},
{
"version": "v2",
"created": "Thu, 8 May 2014 21:13:33 GMT"
}
] | 2014-05-12T00:00:00 |
[
[
"Martínez",
"F. E. Brochero",
""
],
[
"Vergara",
"C. R. Giraldo",
""
]
] |
new_dataset
| 0.988322 |
1405.1833
|
Bart Bogaerts
|
Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche
|
FO(C): A Knowledge Representation Language of Causality
|
To appear in Theory and Practice of Logic Programming (TPLP)
| null | null | null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cause-effect relations are an important part of human knowledge. In real
life, humans often reason about complex causes linked to complex effects. By
comparison, existing formalisms for representing knowledge about causal
relations are quite limited in the kind of specifications of causes and effects
they allow. In this paper, we present the new language C-Log, which offers a
significantly more expressive representation of effects, including such
features as the creation of new objects. We show how C-Log integrates with
first-order logic, resulting in the language FO(C). We also compare FO(C) with
several related languages and paradigms, including inductive definitions,
disjunctive logic programming, business rules and extensions of Datalog.
|
[
{
"version": "v1",
"created": "Thu, 8 May 2014 08:25:52 GMT"
},
{
"version": "v2",
"created": "Fri, 9 May 2014 08:20:22 GMT"
}
] | 2014-05-12T00:00:00 |
[
[
"Bogaerts",
"Bart",
""
],
[
"Vennekens",
"Joost",
""
],
[
"Denecker",
"Marc",
""
],
[
"Bussche",
"Jan Van den",
""
]
] |
new_dataset
| 0.996179 |
1306.3604
|
Tian-Xian Zhang
|
Tian-Xian Zhang and Xiang-Gen Xia
|
OFDM Synthetic Aperture Radar Imaging with Sufficient Cyclic Prefix
|
This version has been accepted by IEEE Transactions on Geoscience and
Remote Sensing. IEEE Transactions on Geoscience and Remote Sensing 2014
| null |
10.1109/TGRS.2014.2322813
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
The existing linear frequency modulated (LFM) (or step frequency) and random
noise synthetic aperture radar (SAR) systems may correspond to the frequency
hopping (FH) and direct sequence (DS) spread spectrum systems in the past
second and third generation wireless communications. Similar to the current and
future wireless communications generations, in this paper, we propose OFDM SAR
imaging, where a sufficient cyclic prefix (CP) is added to each OFDM pulse. The
sufficient CP insertion converts an inter-symbol interference (ISI) channel
from multipaths into multiple ISI-free subchannels as the key in a wireless
communications system, and analogously, it provides an inter-range-cell
interference (IRCI) free (high range resolution) SAR image in a SAR system. The
sufficient CP insertion along with our newly proposed SAR imaging algorithm
particularly for the OFDM signals also differentiates this paper from all the
existing studies in the literature on OFDM radar signal processing. Simulation
results are presented to illustrate the high range resolution performance of
our proposed CP based OFDM SAR imaging algorithm.
|
[
{
"version": "v1",
"created": "Sat, 15 Jun 2013 20:29:10 GMT"
},
{
"version": "v2",
"created": "Wed, 7 May 2014 20:24:11 GMT"
}
] | 2014-05-09T00:00:00 |
[
[
"Zhang",
"Tian-Xian",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] |
new_dataset
| 0.999294 |
1403.7014
|
Takeshi Takahashi
|
Keita Emura and Akira Kanaoka and Satoshi Ohta and Takeshi Takahashi
|
Building Secure and Anonymous Communication Channel: Formal Model and
its Prototype Implementation
|
This is a preprint version of our paper presented in SAC'14, March
24-28, 2014, Gyeongju, Korea. ACMSAC 2014
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various techniques need to be combined to realize anonymously authenticated
communication. Cryptographic tools enable anonymous user authentication while
anonymous communication protocols hide users' IP addresses from service
providers. One simple approach for realizing anonymously authenticated
communication is their simple combination, but this gives rise to another
issue; how to build a secure channel. The current public key infrastructure
cannot be used since the user's public key identifies the user. To cope with
this issue, we propose a protocol that uses identity-based encryption for
packet encryption without sacrificing anonymity, and group signature for
anonymous user authentication. Communications in the protocol take place
through proxy entities that conceal users' IP addresses from service providers.
The underlying group signature is customized to meet our objective and improve
its efficiency. We also introduce a proof-of-concept implementation to
demonstrate the protocol's feasibility. We compare its performance to SSL
communication and demonstrate its practicality, and conclude that the protocol
realizes secure, anonymous, and authenticated communication between users and
service providers with practical performance.
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2014 13:14:20 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Apr 2014 00:50:59 GMT"
},
{
"version": "v3",
"created": "Thu, 8 May 2014 00:49:54 GMT"
}
] | 2014-05-09T00:00:00 |
[
[
"Emura",
"Keita",
""
],
[
"Kanaoka",
"Akira",
""
],
[
"Ohta",
"Satoshi",
""
],
[
"Takahashi",
"Takeshi",
""
]
] |
new_dataset
| 0.993331 |
1403.8123
|
Jihua Lu Dr
|
Jihua Lu, Jianping An, Xiangming Li, Jie Yang and Lei Yang
|
A Percolation based M2M Networking Architecture for Data Transmission
and Routing
|
15 pages, 7 figures. We propose a percolation based routing and data
transmission method for the M2M network, which consists of routing phase and
transmission phases. In the routing phase, probes packets are transmitted and
flowed in the network, multiple paths are built to form a route. After that,
the data file will be fountain encoded and the transmitted
|
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 6, NO.
2, Feb 2012
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a percolation based M2M networking architecture and its data
transmission method. The proposed network architecture can be server-free and
router-free, which allows us to operate routing efficiently with percolations
based on six degrees of separation theory in small world network modeling. The
data transmission can be divided into two phases: routing and data transmission
phases. In the routing phase, probe packets will be transmitted and forwarded
in the network thus multiple paths are selected and performed based on the
constriction of the maximum hop number. In the second phase, the information
will be encoded, say, with the fountain codes, and transmitted using the paths
generated in the first phase. In such a way, an efficient routing and data
transmission mechanism can be built, which allow us to construct a low-cost,
flexible and ubiquitous network. Such a networking architecture and data
transmission can be used in many M2M communications, such as the stub network
of internet of things, and deep space networking, and so on.
|
[
{
"version": "v1",
"created": "Mon, 31 Mar 2014 18:47:17 GMT"
},
{
"version": "v2",
"created": "Thu, 8 May 2014 11:48:38 GMT"
}
] | 2014-05-09T00:00:00 |
[
[
"Lu",
"Jihua",
""
],
[
"An",
"Jianping",
""
],
[
"Li",
"Xiangming",
""
],
[
"Yang",
"Jie",
""
],
[
"Yang",
"Lei",
""
]
] |
new_dataset
| 0.986574 |
1405.1916
|
Tuan Phung-Duc
|
Kazuki Kajiwara and Tuan Phung-Duc
|
Asymptotic and Numerical Analysis of Multiserver Retrial Queue with
Guard Channel for Cellular Networks
| null |
Proceedings of the Eight International Conference on
Matrix-Analytic Methods in Stochastic Models (MAM8), NIT Calicut, Kerala,
India, pp. 85--102, January 06--10, 2014
| null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a retrial queueing model for a base station in cellular
networks where fresh calls and handover calls are available. Fresh calls are
initiated from the cell of the base station. On the other hand, a handover call
has been connecting to a base station and moves to another one. In order to
keep the continuation of the communication, it is desired that an available
channel in the new base station is immediately assigned to the handover call.
To this end, a channel is reserved as the guard channel for handover calls in
base stations. Blocked fresh and handover calls join a virtual orbit and repeat
their attempts in a later time. We assume that a base station can recognize
retrial calls and give them the same priority as that of handover calls. We
model a base station by a multiserver retrial queue with priority customers for
which a level-dependent QBD process is formulated. We obtain Taylor series
expansion for the nonzero elements of the rate matrices of the level-dependent
QBD. Using the expansion results, we obtain an asymptotic upper bound for the
joint stationary distribution of the number of busy channels and that of
customers in the orbit. Furthermore, we derive an efficient numerical algorithm
to calculate the joint stationary distribution.
|
[
{
"version": "v1",
"created": "Thu, 8 May 2014 13:17:09 GMT"
}
] | 2014-05-09T00:00:00 |
[
[
"Kajiwara",
"Kazuki",
""
],
[
"Phung-Duc",
"Tuan",
""
]
] |
new_dataset
| 0.999774 |
1405.1980
|
Sergio Consoli
|
Sergio Consoli, Jose Andres Moreno-Perez, Kenneth Darby-Dowman, Nenad
Mladenovic
|
Mejora de la exploracion y la explotacion de las heuristicas
constructivas para el MLSTP
|
9 pages, in Spanish. Quinto Congreso Espanol de Metaheuristicas,
Algoritmos Evolutivos y Bioinspirados (MAEB 2007), Tenerife, Spain, available
at: http://www.redheur.org/files/MAEBs/MAEB07.pdf; Proceedings of the Quinto
Congreso Espanol de Metaheuristicas, Algoritmos Evolutivos y Bioinspirados,
2007
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies constructive heuristics for the minimum labelling spanning
tree (MLST) problem. The purpose is to find a spanning tree that uses edges
that are as similar as possible. Given an undirected labeled connected graph
(i.e., with a label or color for each edge), the minimum labeling spanning tree
problem seeks a spanning tree whose edges have the smallest possible number of
distinct labels. The model can represent many real-world problems in
telecommunication networks, electric networks, and multimodal transportation
networks, among others, and the problem has been shown to be NP-complete even
for complete graphs. A primary heuristic, named the maximum vertex covering
algorithm has been proposed. Several versions of this constructive heuristic
have been proposed to improve its efficiency. Here we describe the problem,
review the literature and compare some variants of this algorithm.
|
[
{
"version": "v1",
"created": "Wed, 16 Apr 2014 11:02:02 GMT"
}
] | 2014-05-09T00:00:00 |
[
[
"Consoli",
"Sergio",
""
],
[
"Moreno-Perez",
"Jose Andres",
""
],
[
"Darby-Dowman",
"Kenneth",
""
],
[
"Mladenovic",
"Nenad",
""
]
] |
new_dataset
| 0.967576 |
1405.1993
|
Mbida Mohamed
|
Mbida Mohamed and Ezzati Abdellah
|
OSCMAC_Duty_Cycle_with_Multi_Helpers_CT_Mode_WILEM_Technology_in_Wireless_Sensor_Networks
|
7 pages , 4 figures, International Journal of wireless and Mobile
Networks IJWMN ( 2014 )
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, Wireless Sensor Networks (WSNs) grow to be one of the dominant
technology trends; new needs are continuously emerging and demanding more
complex constraints in a duty cycle, such as extend the life time communication
. The MAC layer plays a crucial role in these networks; it controls the
communication module and manages the medium sharing. In this work we use
OSC-MAC tackles combining with the performance of cooperative transmission (CT)
in multi-hop WSN and the Wi-Lem technology
|
[
{
"version": "v1",
"created": "Thu, 8 May 2014 16:07:15 GMT"
}
] | 2014-05-09T00:00:00 |
[
[
"Mohamed",
"Mbida",
""
],
[
"Abdellah",
"Ezzati",
""
]
] |
new_dataset
| 0.999233 |
1211.4775
|
Carlo Alberto Furia
|
H.-Christian Estler, Carlo A. Furia, Martin Nordio, Marco Piccioni,
and Bertrand Meyer
|
Contracts in Practice
| null |
Proceedings of the 19th International Symposium on Formal Methods
(FM). Lecture Notes in Computer Science, 8442:230--246, Springer, May 2014
|
10.1007/978-3-319-06410-9_17
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Contracts are a form of lightweight formal specification embedded in the
program text. Being executable parts of the code, they encourage programmers to
devote proper attention to specifications, and help maintain consistency
between specification and implementation as the program evolves. The present
study investigates how contracts are used in the practice of software
development. Based on an extensive empirical analysis of 21 contract-equipped
Eiffel, C#, and Java projects totaling more than 260 million lines of code over
7700 revisions, it explores, among other questions: 1) which kinds of contract
elements (preconditions, postconditions, class invariants) are used more often;
2) how contracts evolve over time; 3) the relationship between implementation
changes and contract changes; and 4) the role of inheritance in the process. It
has found, among other results, that: the percentage of program elements that
include contracts is above 33% for most projects and tends to be stable over
time; there is no strong preference for a certain type of contract element;
contracts are quite stable compared to implementations; and inheritance does
not significantly affect qualitative trends of contract usage.
|
[
{
"version": "v1",
"created": "Tue, 20 Nov 2012 15:26:17 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Jan 2013 21:59:09 GMT"
},
{
"version": "v3",
"created": "Sun, 19 May 2013 09:11:07 GMT"
},
{
"version": "v4",
"created": "Tue, 28 May 2013 08:13:57 GMT"
},
{
"version": "v5",
"created": "Fri, 15 Nov 2013 20:31:44 GMT"
},
{
"version": "v6",
"created": "Wed, 26 Feb 2014 09:35:22 GMT"
}
] | 2014-05-08T00:00:00 |
[
[
"Estler",
"H. -Christian",
""
],
[
"Furia",
"Carlo A.",
""
],
[
"Nordio",
"Martin",
""
],
[
"Piccioni",
"Marco",
""
],
[
"Meyer",
"Bertrand",
""
]
] |
new_dataset
| 0.99275 |
1405.1605
|
Marco Guerini
|
Jacopo Staiano and Marco Guerini
|
DepecheMood: a Lexicon for Emotion Analysis from Crowd-Annotated News
|
To appear at ACL 2014. 7 pages
| null | null | null |
cs.CL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While many lexica annotated with words polarity are available for sentiment
analysis, very few tackle the harder task of emotion analysis and are usually
quite limited in coverage. In this paper, we present a novel approach for
extracting - in a totally automated way - a high-coverage and high-precision
lexicon of roughly 37 thousand terms annotated with emotion scores, called
DepecheMood. Our approach exploits in an original way 'crowd-sourced' affective
annotation implicitly provided by readers of news articles from rappler.com. By
providing new state-of-the-art performances in unsupervised settings for
regression and classification tasks, even using a na\"{\i}ve approach, our
experiments show the beneficial impact of harvesting social media data for
affective lexicon building.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2014 13:40:47 GMT"
}
] | 2014-05-08T00:00:00 |
[
[
"Staiano",
"Jacopo",
""
],
[
"Guerini",
"Marco",
""
]
] |
new_dataset
| 0.997803 |
1211.5933
|
Yixin Cao
|
Yixin Cao and D\'aniel Marx
|
Interval Deletion is Fixed-Parameter Tractable
|
Final version, to appear in ACM Transactions on Algorithms
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the minimum \emph{interval deletion} problem, which asks for the
removal of a set of at most $k$ vertices to make a graph of $n$ vertices into
an interval graph. We present a parameterized algorithm of runtime $10^k \cdot
n^{O(1)}$ for this problem, that is, we show the problem is fixed-parameter
tractable.
|
[
{
"version": "v1",
"created": "Mon, 26 Nov 2012 12:42:52 GMT"
},
{
"version": "v2",
"created": "Tue, 14 May 2013 14:53:58 GMT"
},
{
"version": "v3",
"created": "Tue, 6 May 2014 19:33:50 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Cao",
"Yixin",
""
],
[
"Marx",
"Dániel",
""
]
] |
new_dataset
| 0.996173 |
1405.1063
|
Hien Ngo Quoc
|
Hien Quoc Ngo, Himal A. Suraweera, Michail Matthaiou, Erik G. Larsson
|
Multipair Full-Duplex Relaying with Massive Arrays and Linear Processing
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a multipair decode-and-forward relay channel, where multiple
sources transmit simultaneously their signals to multiple destinations with the
help of a full-duplex relay station. We assume that the relay station is
equipped with massive arrays, while all sources and destinations have a single
antenna. The relay station uses channel estimates obtained from received pilots
and zero-forcing (ZF) or maximum-ratio combining/maximum-ratio transmission
(MRC/MRT) to process the signals. To reduce significantly the loop interference
effect, we propose two techniques: i) using a massive receive antenna array; or
ii) using a massive transmit antenna array together with very low transmit
power at the relay station. We derive an exact achievable rate in closed-form
for MRC/MRT processing and an analytical approximation of the achievable rate
for ZF processing. This approximation is very tight, especially for large
number of relay station antennas. These closed-form expressions enable us to
determine the regions where the full-duplex mode outperforms the half-duplex
mode, as well as, to design an optimal power allocation scheme. This optimal
power allocation scheme aims to maximize the energy efficiency for a given sum
spectral efficiency and under peak power constraints at the relay station and
sources. Numerical results verify the effectiveness of the optimal power
allocation scheme. Furthermore, we show that, by doubling the number of
transmit/receive antennas at the relay station, the transmit power of each
source and of the relay station can be reduced by 1.5dB if the pilot power is
equal to the signal power, and by 3dB if the pilot power is kept fixed, while
maintaining a given quality-of-service.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2014 20:19:35 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Ngo",
"Hien Quoc",
""
],
[
"Suraweera",
"Himal A.",
""
],
[
"Matthaiou",
"Michail",
""
],
[
"Larsson",
"Erik G.",
""
]
] |
new_dataset
| 0.982698 |
1405.1114
|
EPTCS
|
Cornelius Diekmann (Technische Universit\"at M\"unchen), Lars Hupel
(Technische Universit\"at M\"unchen), Georg Carle (Technische Universit\"at
M\"unchen)
|
Directed Security Policies: A Stateful Network Implementation
|
In Proceedings ESSS 2014, arXiv:1405.0554
|
EPTCS 150, 2014, pp. 20-34
|
10.4204/EPTCS.150.3
| null |
cs.CR cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large systems are commonly internetworked. A security policy describes the
communication relationship between the networked entities. The security policy
defines rules, for example that A can connect to B, which results in a directed
graph. However, this policy is often implemented in the network, for example by
firewalls, such that A can establish a connection to B and all packets
belonging to established connections are allowed. This stateful implementation
is usually required for the network's functionality, but it introduces the
backflow from B to A, which might contradict the security policy. We derive
compliance criteria for a policy and its stateful implementation. In
particular, we provide a criterion to verify the lack of side effects in linear
time. Algorithms to automatically construct a stateful implementation of
security policy rules are presented, which narrows the gap between
formalization and real-world implementation. The solution scales to large
networks, which is confirmed by a large real-world case study. Its correctness
is guaranteed by the Isabelle/HOL theorem prover.
|
[
{
"version": "v1",
"created": "Tue, 6 May 2014 00:53:42 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Diekmann",
"Cornelius",
"",
"Technische Universität München"
],
[
"Hupel",
"Lars",
"",
"Technische Universität München"
],
[
"Carle",
"Georg",
"",
"Technische Universität\n München"
]
] |
new_dataset
| 0.957093 |
1405.1124
|
Marcello Balduccini
|
Marcello Balduccini, William C. Regli, Duc N. Nguyen
|
An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments:
Progress Report
|
Proceedings of the 15th International Workshop on Non-Monotonic
Reasoning (NMR 2014)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional AI reasoning techniques have been used successfully in many
domains, including logistics, scheduling and game playing. This paper is part
of a project aimed at investigating how such techniques can be extended to
coordinate teams of unmanned aerial vehicles (UAVs) in dynamic environments.
Specifically challenging are real-world environments where UAVs and other
network-enabled devices must communicate to coordinate---and communication
actions are neither reliable nor free. Such network-centric environments are
common in military, public safety and commercial applications, yet most
research (even multi-agent planning) usually takes communications among
distributed agents as a given. We address this challenge by developing an agent
architecture and reasoning algorithms based on Answer Set Programming (ASP).
ASP has been chosen for this task because it enables high flexibility of
representation, both of knowledge and of reasoning tasks. Although ASP has been
used successfully in a number of applications, and ASP-based architectures have
been studied for about a decade, to the best of our knowledge this is the first
practical application of a complete ASP-based agent architecture. It is also
the first practical application of ASP involving a combination of centralized
reasoning, decentralized reasoning, execution monitoring, and reasoning about
network communications. This work has been empirically validated using a
distributed network-centric software evaluation testbed and the results provide
guidance to designers in how to understand and control intelligent systems that
operate in these environments.
|
[
{
"version": "v1",
"created": "Tue, 6 May 2014 02:05:04 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Balduccini",
"Marcello",
""
],
[
"Regli",
"William C.",
""
],
[
"Nguyen",
"Duc N.",
""
]
] |
new_dataset
| 0.995164 |
1405.1127
|
Wanchun Jiang
|
Wanchun Jiang, Fengyuan Ren, Xin Yue, Chuang Lin
|
Scale Congestion Control to Ultra-High Speed Ethernet
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently, Ethernet is broadly used in LAN, datacenter and enterprise
networks, storage networks, high performance computing networks and so on.
Along with the popularity of Ethernet comes the requirement of enhancing
Ethernet with congestion control. On the other hand, Ethernet speed extends to
40Gbps and 100Gbps recently, and even 400Gbps in the near future. The
ultra-high speed requires congestion control algorithms to adapt to the broad
changes of bandwidth, and highlights the impacts of small delay by enlarging
the bandwidth delay product. The state-of-art standard QCN is heuristically
designed for the 1Gbps and 10Gbps Ethernet, and unaware of the challenges
accompanying the ultra-high speed.
To scale congestion control to ultra-high speed Ethernet, we propose the
Adaptive Sliding Mode (ASM) congestion control algorithm, which is simple,
stable, has fast and smooth convergence process, can tolerate the impacts of
delay and adapt to the wide changes of bandwidth. Real experiments and
simulations confirm these good properties and show that ASM outperforms QCN.
Designing ASM, we find that the derivative of queue length is helpful to rate
adjustment because it reflects the difference between bandwidth and aggregated
sending rate. We also argue for enforcing congestion control system staying at
the congestion boundary line, along which it automatically slides to stable
point. These insights are also valuable to develop other congestion control
algorithms in ultra-high speed networks.
|
[
{
"version": "v1",
"created": "Tue, 6 May 2014 02:15:44 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Jiang",
"Wanchun",
""
],
[
"Ren",
"Fengyuan",
""
],
[
"Yue",
"Xin",
""
],
[
"Lin",
"Chuang",
""
]
] |
new_dataset
| 0.99592 |
1405.1155
|
Hatem Abou-zeid
|
Hatem Abou-zeid, Hossam S. Hassanein, Stefan Valentin, Mohamed Feteiha
|
A Lookback Scheduling Framework for Long-Term Quality-of-Service Over
Multiple Cells
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In current cellular networks, schedulers allocate wireless channel resources
to users based on instantaneous channel gains and short-term moving averages of
user rates and queue lengths. By using only such short-term information,
schedulers ignore the users' service history in previous cells and, thus,
cannot guarantee long-term Quality of Service (QoS) when users traverse
multiple cells with varying load and capacity. In this paper, we propose a new
Long-term Lookback Scheduling (LLS) framework, which extends conventional
short-term scheduling with long-term QoS information from previously traversed
cells. We demonstrate the application of LLS for common channel-aware, as well
as channel and queue-aware schedulers. The developed long-term schedulers also
provide a controllable trade-off between emphasizing the immediate user QoS or
the long-term measures. Our simulation results show high gains in long-term QoS
without sacrificing short-term user requirements. Therefore, the proposed
scheduling approach improves subscriber satisfaction and increases operational
efficiency.
|
[
{
"version": "v1",
"created": "Tue, 6 May 2014 05:34:54 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Abou-zeid",
"Hatem",
""
],
[
"Hassanein",
"Hossam S.",
""
],
[
"Valentin",
"Stefan",
""
],
[
"Feteiha",
"Mohamed",
""
]
] |
new_dataset
| 0.98602 |
1405.1183
|
Daniel Le Berre
|
Daniel Le Berre
|
Some thoughts about benchmarks for NMR
|
Proceedings of the 15th International Workshop on Non-Monotonic
Reasoning (NMR 2014)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The NMR community would like to build a repository of benchmarks to push
forward the design of systems implementing NMR as it has been the case for many
other areas in AI. There are a number of lessons which can be learned from the
experience of other communi- ties. Here are a few thoughts about the
requirements and choices to make before building such a repository.
|
[
{
"version": "v1",
"created": "Tue, 6 May 2014 08:09:13 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Berre",
"Daniel Le",
""
]
] |
new_dataset
| 0.98371 |
1405.1374
|
Naman Agarwal
|
Naman Agarwal and Guy Kindler and Alexandra Kolla and Luca Trevisan
|
Unique Games on the Hypercube
| null | null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate the validity of the Unique Games Conjecture
when the constraint graph is the boolean hypercube. We construct an almost
optimal integrality gap instance on the Hypercube for the Goemans-Williamson
semidefinite program (SDP) for Max-2-LIN$(\mathbb{Z}_2)$. We conjecture that
adding triangle inequalities to the SDP provides a polynomial time algorithm to
solve Unique Games on the hypercube.
|
[
{
"version": "v1",
"created": "Sat, 3 May 2014 22:18:05 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Agarwal",
"Naman",
""
],
[
"Kindler",
"Guy",
""
],
[
"Kolla",
"Alexandra",
""
],
[
"Trevisan",
"Luca",
""
]
] |
new_dataset
| 0.985045 |
1405.1403
|
Hyunsuk Ko
|
Rui Song, Hyunsuk Ko and C.C. Jay Kuo
|
MCL-3D: a database for stereoscopic image quality assessment using
2D-image-plus-depth source
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new stereoscopic image quality assessment database rendered using the
2D-image-plus-depth source, called MCL-3D, is described and the performance
benchmarking of several known 2D and 3D image quality metrics using the MCL-3D
database is presented in this work. Nine image-plus-depth sources are first
selected, and a depth image-based rendering (DIBR) technique is used to render
stereoscopic image pairs. Distortions applied to either the texture image or
the depth image before stereoscopic image rendering include: Gaussian blur,
additive white noise, down-sampling blur, JPEG and JPEG-2000 (JP2K) compression
and transmission error. Furthermore, the distortion caused by imperfect
rendering is also examined. The MCL-3D database contains 693 stereoscopic image
pairs, where one third of them are of resolution 1024x728 and two thirds are of
resolution 1920x1080. The pair-wise comparison was adopted in the subjective
test for user friendliness, and the Mean Opinion Score (MOS) can be computed
accordingly. Finally, we evaluate the performance of several 2D and 3D image
quality metrics applied to MCL-3D. All texture images, depth images, rendered
image pairs in MCL-3D and their MOS values obtained in the subjective test are
available to the public (http://mcl.usc.edu/mcl-3d-database/) for future
research and development.
|
[
{
"version": "v1",
"created": "Sun, 23 Mar 2014 23:31:49 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Song",
"Rui",
""
],
[
"Ko",
"Hyunsuk",
""
],
[
"Kuo",
"C. C. Jay",
""
]
] |
new_dataset
| 0.999634 |
1405.1406
|
Sallam Abualhaija
|
Sallam Abualhaija, Karl-Heinz Zimmermann
|
D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving
Word Sense Disambiguation
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Word sense disambiguation (WSD) is a problem in the field of computational
linguistics given as finding the intended sense of a word (or a set of words)
when it is activated within a certain context. WSD was recently addressed as a
combinatorial optimization problem in which the goal is to find a sequence of
senses that maximize the semantic relatedness among the target words. In this
article, a novel algorithm for solving the WSD problem called D-Bees is
proposed which is inspired by bee colony optimization (BCO)where artificial bee
agents collaborate to solve the problem. The D-Bees algorithm is evaluated on a
standard dataset (SemEval 2007 coarse-grained English all-words task corpus)and
is compared to simulated annealing, genetic algorithms, and two ant colony
optimization techniques (ACO). It will be observed that the BCO and ACO
approaches are on par.
|
[
{
"version": "v1",
"created": "Tue, 6 May 2014 19:26:35 GMT"
}
] | 2014-05-07T00:00:00 |
[
[
"Abualhaija",
"Sallam",
""
],
[
"Zimmermann",
"Karl-Heinz",
""
]
] |
new_dataset
| 0.995783 |
1203.2834
|
Bin Li
|
Bin Li and Atilla Eryilmaz
|
A Fast-CSMA Algorithm for Deadline-Constrained Scheduling over Wireless
Fading Channels
|
This work appears in workshop on Resource Allocation and Cooperation
in Wireless Networks (RAWNET), Princeton, NJ, May, 2011
|
The journal version of this paper is published in IEEE
Transactions on Wireless Communications, 12(7): 3278-3288, 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, low-complexity and distributed Carrier Sense Multiple Access
(CSMA)-based scheduling algorithms have attracted extensive interest due to
their throughput-optimal characteristics in general network topologies.
However, these algorithms are not well-suited for serving real-time traffic
under time-varying channel conditions for two reasons: (1) the mixing time of
the underlying CSMA Markov Chain grows with the size of the network, which, for
large networks, generates unacceptable delay for deadline-constrained traffic;
(2) since the dynamic CSMA parameters are influenced by the arrival and channel
state processes, the underlying CSMA Markov Chain may not converge to a
steady-state under strict deadline constraints and fading channel conditions.
In this paper, we attack the problem of distributed scheduling for serving
real-time traffic over time-varying channels. Specifically, we consider
fully-connected topologies with independently fading channels (which can model
cellular networks) in which flows with short-term deadline constraints and
long-term drop rate requirements are served. To that end, we first characterize
the maximal set of satisfiable arrival processes for this system and, then,
propose a Fast-CSMA (FCSMA) policy that is shown to be optimal in supporting
any real-time traffic that is within the maximal satisfiable set. These
theoretical results are further validated through simulations to demonstrate
the relative efficiency of the FCSMA policy compared to some of the existing
CSMA-based algorithms.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2012 15:29:40 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Li",
"Bin",
""
],
[
"Eryilmaz",
"Atilla",
""
]
] |
new_dataset
| 0.990791 |
1206.3804
|
Dimitris S. Papailiopoulos
|
Dimitris S. Papailiopoulos and Alexandros G. Dimakis
|
Locally Repairable Codes
|
presented at ISIT 2012, accepted for publication in IEEE Trans. IT,
2014
| null | null | null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems for large-scale applications typically use
replication for reliability. Recently, erasure codes were used to reduce the
large storage overhead, while increasing data reliability. A main limitation of
off-the-shelf erasure codes is their high-repair cost during single node
failure events. A major open problem in this area has been the design of codes
that {\it i)} are repair efficient and {\it ii)} achieve arbitrarily high data
rates.
In this paper, we explore the repair metric of {\it locality}, which
corresponds to the number of disk accesses required during a
{\color{black}single} node repair. Under this metric we characterize an
information theoretic trade-off that binds together locality, code distance,
and the storage capacity of each node. We show the existence of optimal {\it
locally repairable codes} (LRCs) that achieve this trade-off. The achievability
proof uses a locality aware flow-graph gadget which leads to a randomized code
construction. Finally, we present an optimal and explicit LRC that achieves
arbitrarily high data-rates. Our locality optimal construction is based on
simple combinations of Reed-Solomon blocks.
|
[
{
"version": "v1",
"created": "Sun, 17 Jun 2012 22:47:08 GMT"
},
{
"version": "v2",
"created": "Sat, 3 May 2014 16:22:02 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Papailiopoulos",
"Dimitris S.",
""
],
[
"Dimakis",
"Alexandros G.",
""
]
] |
new_dataset
| 0.999206 |
1312.3665
|
David Wolinsky
|
David Isaac Wolinsky and Bryan Ford
|
Managing NymBoxes for Identity and Tracking Protection
|
16 pages, 7 figure, 1 table
| null | null | null |
cs.OS cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite the attempts of well-designed anonymous communication tools to
protect users from tracking or identification, flaws in surrounding software
(such as web browsers) and mistakes in configuration may leak the user's
identity. We introduce Nymix, an anonymity-centric operating system
architecture designed "top-to-bottom" to strengthen identity- and
tracking-protection. Nymix's core contribution is OS support for nym-browsing:
independent, parallel, and ephemeral web sessions. Each web session, or
pseudonym, runs in a unique virtual machine (VM) instance evolving from a
common base state with support for long-lived sessions which can be anonymously
stored to the cloud, avoiding de-anonymization despite potential confiscation
or theft. Nymix allows a user to safely browse the Web using various different
transports simultaneously through a pluggable communication model that supports
Tor, Dissent, and a private browsing mode. In evaluations, Nymix consumes 600
MB per nymbox and loads within 15 to 25 seconds.
|
[
{
"version": "v1",
"created": "Thu, 12 Dec 2013 22:38:08 GMT"
},
{
"version": "v2",
"created": "Mon, 5 May 2014 16:05:35 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Wolinsky",
"David Isaac",
""
],
[
"Ford",
"Bryan",
""
]
] |
new_dataset
| 0.998026 |
1405.0650
|
Djamal Ziani
|
Djamal Ziani
|
Configuration in ERP SaaS Multi-Tenancy
|
17 pages, 9 figures
|
D. Ziani, "Configuration in ERP SaaS Multi-Tenancy",International
Journal of Computer Science, Engineering and Information Technology
(IJCSEIT), April 2014,Volume 4, Number 2
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software as a Service (SaaS) becomes in this decade the focus of many
enterprises and research. SaaS provides software application as Web based
delivery to server many customers. This sharing of infrastructure and
application provided by Saas has a great benefit to customers, since it reduces
costs, minimizes risks, improves their competitive positioning, as well as
seeks out innovative. SaaS application is generally developed with standardized
software functionalities to serve as many customers as possible. However many
customers ask to change the standardized provided functions according to their
specific business needs, and this can be achieve through the configuration and
customization provided by the SaaS vendor. Allowing many customers to change
software configurations without impacting others customers and with preserving
security and efficiency of the provided services, becomes a big challenge to
SaaS vendors, who are oblige to design new strategies and architectures.
Multi-tenancy (MT) architectures allow multiple customers to be consolidated
into the same operational system without changing anything in the vendor source
code. In this paper, we will present how the configuration can be done on an
ERP web application in a Multi-Tenancy SaaS environment.
|
[
{
"version": "v1",
"created": "Sun, 4 May 2014 05:45:59 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Ziani",
"Djamal",
""
]
] |
new_dataset
| 0.993513 |
1405.0660
|
He Jin
|
Jin He, Mianxiong Dong, Kaoru Ota, Minyu Fan, Guangwei Wang
|
NetSecCC: A Scalable and Fault-tolerant Architecture without Outsourcing
Cloud Network Security
|
10pages, 10figures
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern cloud computing platforms based on virtual machine monitors carry a
variety of complex business that present many network security vulnerabilities.
At present, the traditional architecture employs a number of security devices
at front-end of cloud computing to protect its network security. Under the new
environment, however, this approach can not meet the needs of cloud security.
New cloud security vendors and academia also made great efforts to solve
network security of cloud computing, unfortunately, they also cannot provide a
perfect and effective method to solve this problem. We introduce a novel
network security architecture for cloud computing (NetSecCC) that addresses
this problem. NetSecCC not only provides an effective solution for network
security issues of cloud computing, but also greatly improves in scalability,
fault-tolerant, resource utilization, etc. We have implemented a
proof-of-concept prototype about NetSecCC and proved by experiments that
NetSecCC is an effective architecture with minimal performance overhead that
can be applied to the extensive practical promotion in cloud computing.
|
[
{
"version": "v1",
"created": "Sun, 4 May 2014 07:31:42 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"He",
"Jin",
""
],
[
"Dong",
"Mianxiong",
""
],
[
"Ota",
"Kaoru",
""
],
[
"Fan",
"Minyu",
""
],
[
"Wang",
"Guangwei",
""
]
] |
new_dataset
| 0.999163 |
1405.0712
|
Ling Cheng
|
Bo Cheng (Guangdong University of Foreign Studies) and Ling Cheng
(University of the Witwatersrand)
|
Single machine slack due-window assignment and scheduling of linear
time-dependent deteriorating jobs and a deteriorating maintenance activity
|
Submitted - Under Review
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the slack due-window assignment model and study a
single machine scheduling problem of linear time-dependent deteriorating jobs
and a deteriorating maintenance activity. The cost for each job consists of
four components: earliness, tardiness, window location and window size. The
objective is to schedule the jobs and to assign the maintenance activity and
due-windows such that the total cost among all the jobs is minimized. A
polynomial-time algorithm with the running time not exceeding $O(n^2logn)$ to
give a solution to this problem is introduced, where $n$ is the number of jobs.
|
[
{
"version": "v1",
"created": "Sun, 4 May 2014 16:24:38 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Cheng",
"Bo",
"",
"Guangdong University of Foreign Studies"
],
[
"Cheng",
"Ling",
"",
"University of the Witwatersrand"
]
] |
new_dataset
| 0.954854 |
1405.0749
|
Salman Hooshmand
|
Seyed M. Mirtaheri, Mustafa Emre Din\c{c}kt\"urk, Salman Hooshmand,
Gregor V. Bochmann, Guy-Vincent Jourdan, Iosif Viorel Onut
|
A Brief History of Web Crawlers
| null |
Proc. of CASCON 2013, Toronto, Nov. 2013
| null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web crawlers visit internet applications, collect data, and learn about new
web pages from visited pages. Web crawlers have a long and interesting history.
Early web crawlers collected statistics about the web. In addition to
collecting statistics about the web and indexing the applications for search
engines, modern crawlers can be used to perform accessibility and vulnerability
checks on the application. Quick expansion of the web, and the complexity added
to web applications have made the process of crawling a very challenging one.
Throughout the history of web crawling many researchers and industrial groups
addressed different issues and challenges that web crawlers face. Different
solutions have been proposed to reduce the time and cost of crawling.
Performing an exhaustive crawl is a challenging question. Additionally
capturing the model of a modern web application and extracting data from it
automatically is another open question. What follows is a brief history of
different technique and algorithms used from the early days of crawling up to
the recent days. We introduce criteria to evaluate the relative performance of
web crawlers. Based on these criteria we plot the evolution of web crawlers and
compare their performance
|
[
{
"version": "v1",
"created": "Mon, 5 May 2014 00:06:25 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Mirtaheri",
"Seyed M.",
""
],
[
"Dinçktürk",
"Mustafa Emre",
""
],
[
"Hooshmand",
"Salman",
""
],
[
"Bochmann",
"Gregor V.",
""
],
[
"Jourdan",
"Guy-Vincent",
""
],
[
"Onut",
"Iosif Viorel",
""
]
] |
new_dataset
| 0.998278 |
1405.0806
|
Pei Dongbin
|
X. R. Li, D.B. Pei, Q. Liu and R.Shen
|
Design of a capacitor-less low-dropout voltage regulator
|
6pages,7figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A solution to the stability of capacitor-less low-dropout regulators with a
4pF Miller capacitor in Multi-level current amplifier is proposed. With the
Miller compensation, a more than 50{\deg}phase margin is guaranteed in full
load. An extra fast transient circuit is adopted to reduce stable time and peak
voltage. When the load changes from light to heavy, the peak voltage is 40mV
and chip quiescent current is only 45uA.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2014 07:40:42 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Li",
"X. R.",
""
],
[
"Pei",
"D. B.",
""
],
[
"Liu",
"Q.",
""
],
[
"Shen",
"R.",
""
]
] |
new_dataset
| 0.998587 |
1405.0822
|
Sakthivel P
|
P. Sakthivel, P. Krishna Sankar
|
Multi-Path Routing and Wavelength Assignment (RWA) Algorithm for WDM
Based Optical Networks
|
6 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In optical WDM networks, transmission of information along optical lines is
advantageous since it has high transmission capacity, scalability, feasibility
and also high reliability. But large amount of information is being carried;
any problem during transmission can lead to severe damage to the data being
carried. Hence it is essential to consider the routing as well as the
wavelength assignment problems and then develop a combined solution for both
the problems. In this paper, we propose to develop a routing and wavelength
assignment algorithm for selecting the suitable alternate path for the data
packets transmission. Two stages are based on the available bandwidth and the
number of wavelength used in the link as construction of alternate paths, route
and wavelength selection. In proposed work, Adaptive Routing and First-Fit
Wavelength Assignment (AR-FFWA) algorithm to be used. For each pair of source
and destination, the path with the minimum granularity values are selected as
the primary path for data transmission, allocating the sufficient wavelength
and the performances will be evaluated by using ns-2 simulation models. When we
compared to existing system the overall blocking probability will be reduced to
too low.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2014 08:34:25 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Sakthivel",
"P.",
""
],
[
"Sankar",
"P. Krishna",
""
]
] |
new_dataset
| 0.985366 |
1405.0877
|
Simon Kramer
|
Simon Kramer
|
A Galois-Connection between Cattell's and Szondi's Personality Profiles
|
closely related to arXiv:1403.2000 as explained in the first
paragraph
| null | null | null |
cs.CE cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We propose a computable Galois-connection between, on the one hand, Cattell's
16-Personality-Factor (16PF) Profiles, one of the most comprehensive and
widely-used personality measures for non-psychiatric populations and their
containing PsychEval Personality Profiles (PPPs) for psychiatric populations,
and, on the other hand, Szondi's personality profiles (SPPs), a less well-known
but, as we show, finer personality measure for psychiatric as well as
non-psychiatric populations (conceived as a unification of the depth psychology
of S. Freud, C.G. Jung, and A. Adler). The practical significance of our result
is that our Galois-connection provides a pair of computable, interpreting
translations between the two personality spaces of PPPs (containing the 16PFs)
and SPPs: one concrete from PPP-space to SPP-space (because SPPs are finer than
PPPs) and one abstract from SPP-space to PPP-space (because PPPs are coarser
than SPPs). Thus Cattell's and Szondi's personality-test results are mutually
interpretable and inter-translatable, even automatically by computers.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2014 12:45:11 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Kramer",
"Simon",
""
]
] |
new_dataset
| 0.994045 |
1405.0910
|
Michelle Silv\'eria
|
Michelle Kr\"uger Silv\'eria
|
Virtual Windshields: Merging Reality and Digital Content to Improve the
Driving Experience
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, the use of the automobile as the primary mode of
transportation has been increasing and driving has become an important part of
daily life. Driving is a multi-sensory experience as drivers rely on their
senses to provide them with important information. In a vehicular context human
senses are all too often limited and obstructed. Today, road accidents
constitute the eighth leading cause of death. The escalation of technology has
propelled new ways in which driver's senses may be augmented. The enclosed
aspect of a car, allied with the configuration of the controls and displays
directed towards the driver, offer significant advantages for augmented reality
(AR) systems when considering the amount of immersion it can provide to the
user. In addition, the inherent mobility and virtually unlimited power autonomy
transform cars into perfect mobile computing platforms. However, automobiles
currently present limited network connectivity and thus the created augmented
objects are merely providing information captured by in-vehicle sensors,
cameras and other databases. By combining the new paradigm of Vehicular Ad Hoc
Networking (VANET) with AR human machine interfaces, we show that it is
possible to design novel cooperative Advanced Driver Assistance Systems (ADAS),
that base the creation of AR content on the information collected from
neighbouring vehicles or roadside infrastructures. As such we implement
prototypes of both visual and acoustic AR systems, which can significantly
improve the driving experience. We believe our results contribute to the
formulation of a vision where the vehicle is perceived as an extension of the
body which permeates the human senses to the world outside the vessel, where
the car is used as a better, multi-sensory immersive version of a mobile phone
that integrates touch, vision and sound enhancements, leveraging unique
properties of VANET.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2014 14:28:13 GMT"
}
] | 2014-05-06T00:00:00 |
[
[
"Silvéria",
"Michelle Krüger",
""
]
] |
new_dataset
| 0.971306 |
1405.0329
|
Yixin Cao
|
Yixin Cao, Luciano N. Grippo, Mart\'in D. Safe
|
Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs:
Characterization and Detection
|
Preliminary results of this paper appeared in the proceedings of SBPO
2012 and FAW 2014
| null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A normal Helly circular-arc graph is the intersection graph of arcs on a
circle of which no three or less arcs cover the whole circle. Lin, Soulignac,
and Szwarcfiter [Discrete Appl. Math. 2013] characterized circular-arc graphs
that are not normal Helly circular-arc graphs, and used it to develop the first
recognition algorithm for this graph class. As open problems, they ask for the
forbidden induced subgraph characterization and a direct recognition algorithm
for normal Helly circular-arc graphs, both of which are resolved by the current
paper. Moreover, when the input is not a normal Helly circular-arc graph, our
recognition algorithm finds in linear time a minimal forbidden induced subgraph
as certificate.
|
[
{
"version": "v1",
"created": "Fri, 2 May 2014 01:03:56 GMT"
}
] | 2014-05-05T00:00:00 |
[
[
"Cao",
"Yixin",
""
],
[
"Grippo",
"Luciano N.",
""
],
[
"Safe",
"Martín D.",
""
]
] |
new_dataset
| 0.994785 |
1405.0413
|
Renato J Cintra
|
F. M. Bayer, R. J. Cintra, A. Madanayake, U. S. Potluri
|
Multiplierless Approximate 4-point DCT VLSI Architectures for Transform
Block Coding
|
5 pages, 1 figure, corrected Figure 1 (published paper in EL is
incorrect)
|
Electronics Letters, vol. 49, no. 24, pp. 1532-1534, 2013
|
10.1049/el.2013.1352
| null |
cs.AR cs.MM cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two multiplierless algorithms are proposed for 4x4 approximate-DCT for
transform coding in digital video. Computational architectures for 1-D/2-D
realisations are implemented using Xilinx FPGA devices. CMOS synthesis at the
45 nm node indicate real-time operation at 1 GHz yielding 4x4 block rates of
125 MHz at less than 120 mW of dynamic power consumption.
|
[
{
"version": "v1",
"created": "Fri, 2 May 2014 14:29:02 GMT"
}
] | 2014-05-05T00:00:00 |
[
[
"Bayer",
"F. M.",
""
],
[
"Cintra",
"R. J.",
""
],
[
"Madanayake",
"A.",
""
],
[
"Potluri",
"U. S.",
""
]
] |
new_dataset
| 0.974094 |
1405.0006
|
William Patera
|
Moritz Kassner, William Patera, Andreas Bulling
|
Pupil: An Open Source Platform for Pervasive Eye Tracking and Mobile
Gaze-based Interaction
|
10 pages, 9 figures
| null | null | null |
cs.CV cs.HC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Commercial head-mounted eye trackers provide useful features to customers in
industry and research but are expensive and rely on closed source hardware and
software. This limits the application areas and use of mobile eye tracking to
expert users and inhibits user-driven development, customisation, and
extension. In this paper we present Pupil -- an accessible, affordable, and
extensible open source platform for mobile eye tracking and gaze-based
interaction. Pupil comprises 1) a light-weight headset with high-resolution
cameras, 2) an open source software framework for mobile eye tracking, as well
as 3) a graphical user interface (GUI) to playback and visualize video and gaze
data. Pupil features high-resolution scene and eye cameras for monocular and
binocular gaze estimation. The software and GUI are platform-independent and
include state-of-the-art algorithms for real-time pupil detection and tracking,
calibration, and accurate gaze estimation. Results of a performance evaluation
show that Pupil can provide an average gaze estimation accuracy of 0.6 degree
of visual angle (0.08 degree precision) with a latency of the processing
pipeline of only 0.045 seconds.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 16:21:56 GMT"
}
] | 2014-05-02T00:00:00 |
[
[
"Kassner",
"Moritz",
""
],
[
"Patera",
"William",
""
],
[
"Bulling",
"Andreas",
""
]
] |
new_dataset
| 0.99295 |
1405.0054
|
Marco Montali
|
Giuseppe De Giacomo and Riccardo De Masellis and Marco Grasso and
Fabrizio Maggi and Marco Montali
|
LTLf and LDLf Monitoring: A Technical Report
| null | null | null | null |
cs.AI cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Runtime monitoring is one of the central tasks to provide operational
decision support to running business processes, and check on-the-fly whether
they comply with constraints and rules. We study runtime monitoring of
properties expressed in LTL on finite traces (LTLf) and in its extension LDLf.
LDLf is a powerful logic that captures all monadic second order logic on finite
traces, which is obtained by combining regular expressions and LTLf, adopting
the syntax of propositional dynamic logic (PDL). Interestingly, in spite of its
greater expressivity, LDLf has exactly the same computational complexity of
LTLf. We show that LDLf is able to capture, in the logic itself, not only the
constraints to be monitored, but also the de-facto standard RV-LTL monitors.
This makes it possible to declaratively capture monitoring metaconstraints, and
check them by relying on usual logical services instead of ad-hoc algorithms.
This, in turn, enables to flexibly monitor constraints depending on the
monitoring state of other constraints, e.g., "compensation" constraints that
are only checked when others are detected to be violated. In addition, we
devise a direct translation of LDLf formulas into nondeterministic automata,
avoiding to detour to Buechi automata or alternating automata, and we use it to
implement a monitoring plug-in for the PROM suite.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 23:16:16 GMT"
}
] | 2014-05-02T00:00:00 |
[
[
"De Giacomo",
"Giuseppe",
""
],
[
"De Masellis",
"Riccardo",
""
],
[
"Grasso",
"Marco",
""
],
[
"Maggi",
"Fabrizio",
""
],
[
"Montali",
"Marco",
""
]
] |
new_dataset
| 0.998524 |
1405.0060
|
Haoyu Song Haoyu Song
|
Haoyu Song, Jun Gong, Hongfei Chen, Justin Dustzadeh
|
Unified POF Programming for Diversified SDN Data Plane
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many real-world OpenFlow-based SDN deployments, the ability to program
heterogeneous forwarding elements built with different forwarding architectures
is a desirable capability. In this paper, we discuss a data plane programming
framework suitable for a flexible and protocol-oblivious data plane and show
how OpenFlow can evolve to provide a generic interface for platform-independent
programming and platform-specific compiling. We also show how an abstract
instruction set can play a pivotal role to support different programming styles
mapping to different forwarding chip architectures. As an example, we compare
the compiler-mode and interpreter-mode implementations for an NPU-based
forwarding element and conclude that the compiler-mode implementation can
achieve a performance similar to that of a conventional non-SDN implementation.
Built upon our protocol-oblivious forwarding (POF) vision, this work presents
our continuous efforts to complete the ecosystem and pave the SDN evolving
path. The programming framework could be considered as a proposal for the
OpenFlow 2.0 standard.
|
[
{
"version": "v1",
"created": "Thu, 1 May 2014 00:15:00 GMT"
}
] | 2014-05-02T00:00:00 |
[
[
"Song",
"Haoyu",
""
],
[
"Gong",
"Jun",
""
],
[
"Chen",
"Hongfei",
""
],
[
"Dustzadeh",
"Justin",
""
]
] |
new_dataset
| 0.970663 |
1405.0087
|
Hovhannes Tananyan
|
Hovhannes G. Tananyan
|
Domination games played on line graphs of complete multipartite graphs
|
7 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The domination game on a graph $G$ (introduced by B. Bre\v{s}ar, S.
Klav\v{z}ar, D.F. Rall \cite{BKR2010}) consists of two players, Dominator and
Staller, who take turns choosing a vertex from $G$ such that whenever a vertex
is chosen by either player, at least one additional vertex is dominated.
Dominator wishes to dominate the graph in as few steps as possible, and Staller
wishes to delay this process as much as possible. The game domination number
$\gamma _{{\small g}}(G)$ is the number of vertices chosen when Dominator
starts the game; when Staller starts, it is denoted by $\gamma _{{\small
g}}^{\prime }(G).$
In this paper, the domination game on line graph $L\left(
K_{\overline{m}}\right) $ of complete multipartite graph $K_{\overline{m}}$
$(\overline{m}\equiv (m_{1},...,m_{n})\in \mathbb{N} ^{n})$ is considered, the
exact values for game domination numbers are obtained and optimal strategy for
both players is described. Particularly, it is proved that for $m_{1}\leq
m_{2}\leq ...\leq m_{n}$ both $\gamma _{{\small g}}\left( L\left(
K_{\overline{m}}\right) \right) =\min \left\{ \left\lceil \frac{2}{3}\left\vert
V\left( K_{\overline{m}}\right) \right\vert \right\rceil ,\right.$ $\left.
2\max \left\{ \left\lceil \frac{1}{2}\left( m_{1}+...+m_{n-1}\right)
\right\rceil ,\text{ }m_{n-1}\right\} \right\} -1$ when $n\geq 2$ and $\gamma
_{g}^{\prime }(L\left( K_{\overline{m}}\right) )=\min \left\{ \left\lceil
\frac{2}{3}\left( \left\vert V(K_{_{\overline{m}}})\right\vert -2\right)
\right\rceil ,\right.$ $\left. 2\max \left\{ \left\lceil \frac{1}{2}\left(
m_{1}+...+m_{n-1}-1\right) \right\rceil ,\text{ }m_{n-1}\right\} \right\} $
when $n\geq 4$.
|
[
{
"version": "v1",
"created": "Thu, 1 May 2014 04:05:03 GMT"
}
] | 2014-05-02T00:00:00 |
[
[
"Tananyan",
"Hovhannes G.",
""
]
] |
new_dataset
| 0.998333 |
1405.0088
|
Nagaraju Dasari
|
C. Venkatesh, D.Nagaraju, T.Sunil Kumar Reddy
|
Binary Protector: Intrusion Detection in Multitier Web Applications
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The services of internet place a key role in the daily life by enabling the
in sequence from anywhere. To provide somewhere to stay the communication and
management in applications the web services has stimulated to multitier design.
In this multitier the web servers contain front end logic and data with
database servers. In this paper, we present binary protector intrusion
detection systems which designs the network behavior of user sessions across
both the front-end web server and the back-end database. By examining both web
and subsequent database requests, we are able to rummage out attacks that
independent IDS would not be able to distinguish.
|
[
{
"version": "v1",
"created": "Thu, 1 May 2014 04:10:46 GMT"
}
] | 2014-05-02T00:00:00 |
[
[
"Venkatesh",
"C.",
""
],
[
"Nagaraju",
"D.",
""
],
[
"Reddy",
"T. Sunil Kumar",
""
]
] |
new_dataset
| 0.999089 |
1404.7509
|
Ana Mihut
|
Sami Alajrami
|
On Cloud-Based Engineering of Dependable Systems
|
EDCC-2014, Student-Forum, Cloud Computing, Cloud Workflow Systems,
Dependable, Systems, Software Engineering
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cloud computing paradigm is being adopted by many organizations in
different application domains as it is cost effective and offers a virtually
unlimited pool of resources. Engineering critical systems can benefit from
clouds in attaining all dependability means: fault tolerance, fault prevention,
fault removal and fault forecasting. Our research aims to investigate the
potential of supporting engineering of dependable software systems with cloud
computing and proposes an open, extensible, and elastic cloud-based software
engineering workflow system which represents and executes software processes to
improve collaboration, reliability and quality assurance, and automation in
software projects.
|
[
{
"version": "v1",
"created": "Tue, 29 Apr 2014 20:01:55 GMT"
}
] | 2014-05-01T00:00:00 |
[
[
"Alajrami",
"Sami",
""
]
] |
new_dataset
| 0.996456 |
1404.7736
|
Chiara Risi
|
Chiara Risi, Daniel Persson, and Erik G. Larsson
|
Massive MIMO with 1-bit ADC
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate massive multiple-input-multiple output (MIMO) uplink systems
with 1-bit analog-to-digital converters (ADCs) on each receiver antenna.
Receivers that rely on 1-bit ADC do not need energy-consuming interfaces such
as automatic gain control (AGC). This decreases both ADC building and
operational costs. Our design is based on maximal ratio combining (MRC),
zero-forcing (ZF), and least squares (LS) detection, taking into account the
effects of the 1-bit ADC on channel estimation. Through numerical results, we
show good performance of the system in terms of mutual information and symbol
error rate (SER). Furthermore, we provide an analytical approach to calculate
the mutual information and SER of the MRC receiver. The analytical approach
reduces complexity in the sense that a symbol and channel noise vectors Monte
Carlo simulation is avoided.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 14:27:23 GMT"
}
] | 2014-05-01T00:00:00 |
[
[
"Risi",
"Chiara",
""
],
[
"Persson",
"Daniel",
""
],
[
"Larsson",
"Erik G.",
""
]
] |
new_dataset
| 0.978124 |
1404.7758
|
Sigve Hortemo S{\ae}ther
|
Sigve Hortemo S{\ae}ther, Jan Arne Telle
|
Between Treewidth and Clique-width
| null | null | null | null |
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many hard graph problems can be solved efficiently when restricted to graphs
of bounded treewidth, and more generally to graphs of bounded clique-width. But
there is a price to be paid for this generality, exemplified by the four
problems MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set that
are all FPT parameterized by treewidth but none of which can be FPT
parameterized by clique-width unless FPT = W[1], as shown by Fomin et al [7,
8]. We therefore seek a structural graph parameter that shares some of the
generality of clique-width without paying this price. Based on splits, branch
decompositions and the work of Vatshelle [18] on Maximum Matching-width, we
consider the graph parameter sm-width which lies between treewidth and
clique-width. Some graph classes of unbounded treewidth, like
distance-hereditary graphs, have bounded sm-width. We show that MaxCut, Graph
Coloring, Hamiltonian Cycle and Edge Dominating Set are all FPT parameterized
by sm-width.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 15:13:45 GMT"
}
] | 2014-05-01T00:00:00 |
[
[
"Sæther",
"Sigve Hortemo",
""
],
[
"Telle",
"Jan Arne",
""
]
] |
new_dataset
| 0.996099 |
1404.4502
|
Arnaud Lallouet
|
Thi-Van-Anh Nguyen and Arnaud Lallouet
|
A Complete Solver for Constraint Games
|
17 pages
| null | null | null |
cs.GT cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Game Theory studies situations in which multiple agents having conflicting
objectives have to reach a collective decision. The question of a compact
representation language for agents utility function is of crucial importance
since the classical representation of a $n$-players game is given by a
$n$-dimensional matrix of exponential size for each player. In this paper we
use the framework of Constraint Games in which CSP are used to represent
utilities. Constraint Programming --including global constraints-- allows to
easily give a compact and elegant model to many useful games. Constraint Games
come in two flavors: Constraint Satisfaction Games and Constraint Optimization
Games, the first one using satisfaction to define boolean utilities. In
addition to multimatrix games, it is also possible to model more complex games
where hard constraints forbid certain situations. In this paper we study
complete search techniques and show that our solver using the compact
representation of Constraint Games is faster than the classical game solver
Gambit by one to two orders of magnitude.
|
[
{
"version": "v1",
"created": "Thu, 17 Apr 2014 12:09:51 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Apr 2014 09:14:33 GMT"
}
] | 2014-04-30T00:00:00 |
[
[
"Nguyen",
"Thi-Van-Anh",
""
],
[
"Lallouet",
"Arnaud",
""
]
] |
new_dataset
| 0.987023 |
1404.6383
|
Pierre de Buyl
|
Valentin Haenel
|
Bloscpack: a compressed lightweight serialization format for numerical
data
|
Part of the Proceedings of the 6th European Conference on Python in
Science (EuroSciPy 2013), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2013-02
|
cs.MS cs.PL
|
http://creativecommons.org/licenses/by/3.0/
|
This paper introduces the Bloscpack file format and the accompanying Python
reference implementation. Bloscpack is a lightweight, compressed binary
file-format based on the Blosc codec and is designed for lightweight, fast
serialization of numerical data. This article presents the features of the
file-format and some some API aspects of the reference implementation, in
particular the ability to handle Numpy ndarrays. Furthermore, in order to
demonstrate its utility, the format is compared both feature- and
performance-wise to a few alternative lightweight serialization solutions for
Numpy ndarrays. The performance comparisons take the form of some comprehensive
benchmarks over a range of different artificial datasets with varying size and
complexity, the results of which are presented as the last section of this
article.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 10:53:23 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Apr 2014 14:16:55 GMT"
}
] | 2014-04-30T00:00:00 |
[
[
"Haenel",
"Valentin",
""
]
] |
new_dataset
| 0.974951 |
1404.6390
|
Pierre de Buyl
|
Stefan Richthofer
|
JyNI - Using native CPython-Extensions in Jython
|
Part of the Proceedings of the 6th European Conference on Python in
Science (EuroSciPy 2013), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2013-09
|
cs.PL
|
http://creativecommons.org/licenses/by/3.0/
|
Jython is a Java based Python implementation and the most seamless way to
integrate Python and Java. However, it does not support native extensions
written for CPython like NumPy or SciPy. Since most scientific Python code
fundamentally depends on exactly such native extensions directly or indirectly,
it usually cannot be run with Jython. JyNI (Jython Native Interface) aims to
close this gap. It is a layer that enables Jython users to load native CPython
extensions and access them from Jython the same way as they would do in
CPython. In order to leverage the JyNI functionality, you just have to put it
on the Java classpath when Jython is launched. It neither requires you to
recompile the extension code, nor to build a customized Jython fork. That
means, it is binary compatible with existing extension builds. At the time of
writing, JyNI does not fully implement the Python C-API and it is only capable
of loading simple examples that only involve most basic built-in types. The
concept is rather complete though and our goal is to provide the C-API needed
to load NumPy as soon as possible. After that we will focus on SciPy and
others. We expect that our work will also enable Java developers to use CPython
extensions like NumPy in their Java code.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 10:56:33 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Apr 2014 14:23:37 GMT"
}
] | 2014-04-30T00:00:00 |
[
[
"Richthofer",
"Stefan",
""
]
] |
new_dataset
| 0.998089 |
1404.6391
|
Pierre de Buyl
|
Robert Cimrman
|
SfePy - Write Your Own FE Application
|
Part of the Proceedings of the 6th European Conference on Python in
Science (EuroSciPy 2013), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2013-10
|
cs.CE cs.PL
|
http://creativecommons.org/licenses/by/3.0/
|
SfePy (Simple Finite Elements in Python) is a framework for solving various
kinds of problems (mechanics, physics, biology, ...) described by partial
differential equations in two or three space dimensions by the finite element
method. The paper illustrates its use in an interactive environment or as a
framework for building custom finite-element based solvers.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 10:56:35 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Apr 2014 14:28:34 GMT"
}
] | 2014-04-30T00:00:00 |
[
[
"Cimrman",
"Robert",
""
]
] |
new_dataset
| 0.99861 |
1404.7121
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on Drag and Drop in GUI
|
7 pages, 3 figures. arXiv admin note: text overlap with
arXiv:1404.6752
|
Umakant Mishra, Inventions on Drag and Drop in GUI (September 7,
2007). Available at SSRN:http://ssrn.com/abstract=1264691 or
http://dx.doi.org/10.2139/ssrn.1264691
|
10.2139/ssrn.1264691
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Drag and drop operation is one of the key capabilities of any Graphical User
Interface. The user can do quite complex operations simply by visually dragging
and dropping objects from one location to another. It saves user from
remembering and typing a lot of commands.
The result of a drag and drop operation may vary depending the type of source
object and type of destination object. For example dragging a file and dropping
on a folder may copy or move the file to the destination folder, dropping that
file to a remote FTP location may upload that file using internet, dropping
that file on a printer icon may print that file, dropping that file on the
trash can may delete that file, and dropping that file on an executable may
play or open or compute or manipulate that file.
Although a drag and drop operation prima facie seems to be a simple
operation, it can become extremely complicated depending on the type of source
objects dragged and the type of destination objects selected for dropping.
There are many limitations of a conventional drag and drop operation. This
article points out the difficulties of a drag and drop operation and
illustrates the solutions disclosed by various inventions to overcome those
difficulties.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 16:00:55 GMT"
}
] | 2014-04-30T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.996839 |
1211.6024
|
Santhosh Kumar
|
Santhosh Kumar, Jean-Francois Chamberland, Gregory H. Huff
|
Reconfigurable Antennas, Preemptive Switching and Virtual Channel
Management
|
To appear in IEEE Transactions on Communications
|
IEEE Transactions on Communications, ISSN 0090-6778, Vol. 62, No.
4, pp. 1272-1282, April 2014
|
10.1109/TCOMM.2014.020514.130592
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article considers the performance of wireless communication systems that
utilize reconfigurable or pattern-dynamic antennas. The focus is on
finite-state channels with memory and performance is assessed in terms of
real-time behavior. In a wireless setting, when a slow fading channel enters a
deep fade, the corresponding communication system faces the threat of
successive decoding failures at the destination. Under such circumstances,
rapidly getting out of deep fades becomes a priority. Recent advances in fast
reconfigurable antennas provide new means to alter the statistical profile of
fading channels and thereby reduce the probability of prolonged fades. Fast
reconfigurable antennas are therefore poised to improve overall performance,
especially for delay-sensitive traffic in slow-fading environments. This
potential for enhanced performance motivates this study of the temporal
behavior of point-to-point communication systems with reconfigurable antennas.
Specifically, agile wireless communication schemes over erasure channels are
analyzed; situations where using reconfigurable antennas yield substantial
performance gains in terms of throughput and average delay are identified.
Scenarios where only partial state information is available at the receiver are
also examined, naturally leading to partially observable decision processes.
|
[
{
"version": "v1",
"created": "Mon, 26 Nov 2012 16:57:46 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jan 2014 17:35:56 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Kumar",
"Santhosh",
""
],
[
"Chamberland",
"Jean-Francois",
""
],
[
"Huff",
"Gregory H.",
""
]
] |
new_dataset
| 0.96281 |
1310.0046
|
Mark Newman
|
Xiao Zhang, Raj Rao Nadakuditi, and M. E. J. Newman
|
Spectra of random graphs with community structure and arbitrary degrees
|
9 pages, 3 figures
|
Phys. Rev. E 89, 042816 (2014)
|
10.1103/PhysRevE.89.042816
| null |
cs.SI cond-mat.stat-mech physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using methods from random matrix theory researchers have recently calculated
the full spectra of random networks with arbitrary degrees and with community
structure. Both reveal interesting spectral features, including deviations from
the Wigner semicircle distribution and phase transitions in the spectra of
community structured networks. In this paper we generalize both calculations,
giving a prescription for calculating the spectrum of a network with both
community structure and an arbitrary degree distribution. In general the
spectrum has two parts, a continuous spectral band, which can depart strongly
from the classic semicircle form, and a set of outlying eigenvalues that
indicate the presence of communities.
|
[
{
"version": "v1",
"created": "Mon, 30 Sep 2013 20:40:16 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Zhang",
"Xiao",
""
],
[
"Nadakuditi",
"Raj Rao",
""
],
[
"Newman",
"M. E. J.",
""
]
] |
new_dataset
| 0.975379 |
1312.4921
|
Sundeep Rangan
|
Mustafa Riza Akdeniz, Yuanpeng Liu, Mathew K. Samimi, Shu Sun, Sundeep
Rangan, Theodore S. Rappaport, Elza Erkip
|
Millimeter Wave Channel Modeling and Cellular Capacity Evaluation
|
15 pages, 13 figures. arXiv admin note: substantial text overlap with
arXiv:1304.3963
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the severe spectrum shortage in conventional cellular bands, millimeter
wave (mmW) frequencies between 30 and 300 GHz have been attracting growing
attention as a possible candidate for next-generation micro- and picocellular
wireless networks. The mmW bands offer orders of magnitude greater spectrum
than current cellular allocations and enable very high-dimensional antenna
arrays for further gains via beamforming and spatial multiplexing. This paper
uses recent real-world measurements at 28 and 73 GHz in New York City to derive
detailed spatial statistical models of the channels and uses these models to
provide a realistic assessment of mmW micro- and picocellular networks in a
dense urban deployment. Statistical models are derived for key channel
parameters including the path loss, number of spatial clusters, angular
dispersion and outage. It is found that, even in highly non-line-of-sight
environments, strong signals can be detected 100 m to 200 m from potential cell
sites, potentially with multiple clusters to support spatial multiplexing.
Moreover, a system simulation based on the models predicts that mmW systems can
offer an order of magnitude increase in capacity over current state-of-the-art
4G cellular networks with no increase in cell density from current urban
deployments.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 19:58:25 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Jan 2014 20:34:28 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Apr 2014 20:49:14 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Akdeniz",
"Mustafa Riza",
""
],
[
"Liu",
"Yuanpeng",
""
],
[
"Samimi",
"Mathew K.",
""
],
[
"Sun",
"Shu",
""
],
[
"Rangan",
"Sundeep",
""
],
[
"Rappaport",
"Theodore S.",
""
],
[
"Erkip",
"Elza",
""
]
] |
new_dataset
| 0.962064 |
1401.2398
|
Marco Dalai
|
Marco Dalai
|
An Elias Bound on the Bhattacharyya Distance of Codes for Channels with
a Zero-Error Capacity
|
ISIT 2014
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an upper bound on the minimum Bhattacharyya
distance of codes for channels with a zero-error capacity. The bound is
obtained by combining an extension of the Elias bound introduced by Blahut,
with an extension of a bound previously introduced by the author, which builds
upon ideas of Gallager, Lov\'asz and Marton.
|
[
{
"version": "v1",
"created": "Fri, 10 Jan 2014 16:41:16 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Apr 2014 14:14:05 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Dalai",
"Marco",
""
]
] |
new_dataset
| 0.991677 |
1401.2560
|
Sundeep Rangan
|
Sundeep Rangan, Theodore S. Rappaport and Elza Erkip
|
Millimeter Wave Cellular Wireless Networks: Potentials and Challenges
|
17 pages, 15 figures. arXiv admin note: text overlap with
arXiv:1312.4921
|
Proceedings of the IEEE , vol.102, no.3, pp.366,385, March 2014
|
10.1109/JPROC.2014.2299397
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave (mmW) frequencies between 30 and 300 GHz are a new frontier
for cellular communication that offers the promise of orders of magnitude
greater bandwidths combined with further gains via beamforming and spatial
multiplexing from multi-element antenna arrays. This paper surveys measurements
and capacity studies to assess this technology with a focus on small cell
deployments in urban environments. The conclusions are extremely encouraging;
measurements in New York City at 28 and 73 GHz demonstrate that, even in an
urban canyon environment, significant non-line-of-sight (NLOS) outdoor,
street-level coverage is possible up to approximately 200 m from a potential
low power micro- or picocell base station. In addition, based on statistical
channel models from these measurements, it is shown that mmW systems can offer
more than an order of magnitude increase in capacity over current
state-of-the-art 4G cellular networks at current cell densities. Cellular
systems, however, will need to be significantly redesigned to fully achieve
these gains. Specifically, the requirement of highly directional and adaptive
transmissions, directional isolation between links and significant
possibilities of outage have strong implications on multiple access, channel
structure, synchronization and receiver design. To address these challenges,
the paper discusses how various technologies including adaptive beamforming,
multihop relaying, heterogeneous network architectures and carrier aggregation
can be leveraged in the mmW context.
|
[
{
"version": "v1",
"created": "Sat, 11 Jan 2014 20:16:02 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Rangan",
"Sundeep",
""
],
[
"Rappaport",
"Theodore S.",
""
],
[
"Erkip",
"Elza",
""
]
] |
new_dataset
| 0.999723 |
1401.7006
|
Aria Ghasemian Sahebi
|
Aria G. Sahebi and S. Sandeep Pradhan
|
Polar Codes for Some Multi-terminal Communications Problems
|
arXiv admin note: substantial text overlap with arXiv:1401.6482
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that polar coding schemes achieve the known achievable rate
regions for several multi-terminal communications problems including lossy
distributed source coding, multiple access channels and multiple descriptions
coding. The results are valid for arbitrary alphabet sizes (binary or
nonbinary) and arbitrary distributions (symmetric or asymmetric).
|
[
{
"version": "v1",
"created": "Sat, 25 Jan 2014 05:13:23 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Apr 2014 02:12:00 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.999709 |
1404.6583
|
Andreas Beyer
|
Andreas Beyer, Hubert Mara, Susanne Kr\"omker
|
ILATO Project: Fusion of Optical Surface Models and Volumetric CT Data
|
Part of the OAGM 2014 proceedings (arXiv:1404.3538)
| null | null |
OAGM/2014/17
|
cs.CG
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Project ILATO focuses on Improving Limited Angle computed Tomography by
Optical data integration in order to enhance image quality and shorten
acquisition times in X-ray based industrial quality inspection. Limited angle
computed tomography is indicated whenever specimen dimensions exceed cone beam
limits or the object is impenetrable from certain angles. Thus, acquiring only
a subset of a full circle CT scan poses problems for reconstruction algorithms
due to incomplete data which introduces blurred edges and other artifacts. To
support volumetric data reconstruction algorithm a surface mesh of the object
obtained via structured light optical scan acts as a mask defining boundaries
of the reconstructed image. The registration of optically acquired surfaces
with data acquired from computed tomography is our current challenge. This
article presents our setup, the methods applied and discusses the problems
arising from registration of data sets created with considerably different
imaging techniques.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 23:08:04 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Beyer",
"Andreas",
""
],
[
"Mara",
"Hubert",
""
],
[
"Krömker",
"Susanne",
""
]
] |
new_dataset
| 0.999241 |
1404.6605
|
EPTCS
|
David R. Cok, Scott C. Johnson
|
SPEEDY: An Eclipse-based IDE for invariant inference
|
In Proceedings F-IDE 2014, arXiv:1404.5785
|
EPTCS 149, 2014, pp. 44-57
|
10.4204/EPTCS.149.5
| null |
cs.LO cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SPEEDY is an Eclipse-based IDE for exploring techniques that assist users in
generating correct specifications, particularly including invariant inference
algorithms and tools. It integrates with several back-end tools that propose
invariants and will incorporate published algorithms for inferring object and
loop invariants. Though the architecture is language-neutral, current SPEEDY
targets C programs. Building and using SPEEDY has confirmed earlier experience
demonstrating the importance of showing and editing specifications in the IDEs
that developers customarily use, automating as much of the production and
checking of specifications as possible, and showing counterexample information
directly in the source code editing environment. As in previous work,
automation of specification checking is provided by back-end SMT solvers.
However, reducing the effort demanded of software developers using formal
methods also requires a GUI design that guides users in writing, reviewing, and
correcting specifications and automates specification inference.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2014 05:32:34 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Cok",
"David R.",
""
],
[
"Johnson",
"Scott C.",
""
]
] |
new_dataset
| 0.999223 |
1404.6607
|
EPTCS
|
Fran\c{c}ois Pessaux (ENSTA ParisTech)
|
FoCaLiZe: Inside an F-IDE
|
In Proceedings F-IDE 2014, arXiv:1404.5785
|
EPTCS 149, 2014, pp. 64-78
|
10.4204/EPTCS.149.7
| null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For years, Integrated Development Environments have demonstrated their
usefulness in order to ease the development of software. High-level security or
safety systems require proofs of compliance to standards, based on analyses
such as code review and, increasingly nowadays, formal proofs of conformance to
specifications. This implies mixing computational and logical aspects all along
the development, which naturally raises the need for a notion of Formal IDE.
This paper examines the FoCaLiZe environment and explores the implementation
issues raised by the decision to provide a single language to express
specification properties, source code and machine-checked proofs while allowing
incremental development and code reusability. Such features create strong
dependencies between functions, properties and proofs, and impose an particular
compilation scheme, which is described here. The compilation results are
runnable OCaml code and a checkable Coq term. All these points are illustrated
through a running example.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2014 05:32:57 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Pessaux",
"François",
"",
"ENSTA ParisTech"
]
] |
new_dataset
| 0.983978 |
1404.6608
|
EPTCS
|
David R. Cok (GrammaTech, Inc.)
|
OpenJML: Software verification for Java 7 using JML, OpenJDK, and
Eclipse
|
In Proceedings F-IDE 2014, arXiv:1404.5785
|
EPTCS 149, 2014, pp. 79-92
|
10.4204/EPTCS.149.8
| null |
cs.SE cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
OpenJML is a tool for checking code and specifications of Java programs. We
describe our experience building the tool on the foundation of JML, OpenJDK and
Eclipse, as well as on many advances in specification-based software
verification. The implementation demonstrates the value of integrating
specification tools directly in the software development IDE and in automating
as many tasks as possible. The tool, though still in progress, has now been
used for several college-level courses on software specification and
verification and for small-scale studies on existing Java programs.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2014 05:33:03 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Cok",
"David R.",
"",
"GrammaTech, Inc."
]
] |
new_dataset
| 0.999821 |
1404.6645
|
Camilla Hollanti
|
Camilla Hollanti, David Karpuk, Amaro Barreal, and Hsiao-feng Francis
Lu
|
Space-Time Storage Codes for Wireless Distributed Storage Systems
|
6 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems (DSSs) have gained a lot of interest recently,
thanks to their robustness and scalability compared to single-device storage.
Majority of the related research has exclusively concerned the network layer.
At the same time, the number of users of, e.g., peer-to-peer (p2p) and
device-to-device (d2d) networks as well as proximity based services is growing
rapidly, and the mobility of users is considered more and more important. This
motivates, in contrast to the existing literature, the study of the physical
layer functionality of wireless distributed storage systems.
In this paper, we take the first step towards protecting the storage repair
transmissions from physical layer errors when the transmission takes place over
a fading channel. To this end, we introduce the notion of a space-time storage
code, drawing together the aspects of network layer and physical layer
functionality and resulting in cross-layer robustness. It is also pointed out
that existing space-time codes are too complex to be utilized in storage
networks when the number of helpers involved is larger than the number of
receive antennas at the newcomer or data collector, hence creating a call for
less complex transmission protocols.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2014 14:13:17 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Hollanti",
"Camilla",
""
],
[
"Karpuk",
"David",
""
],
[
"Barreal",
"Amaro",
""
],
[
"Lu",
"Hsiao-feng Francis",
""
]
] |
new_dataset
| 0.995492 |
1404.6662
|
Vamsi Sashank Kotagiri
|
Vamsi Sashank Kotagiri
|
A Wireless System Using Random Residue Sequences
|
3 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the architecture of wireless communication system using
random residue sequences. The basic scheme is that of spread spectrum but
instead of using PN sequences for coding, we use random residue sequences. Such
a system can provide cryptographic security whose strength would depend on the
number of code sequences being used.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2014 16:54:25 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Kotagiri",
"Vamsi Sashank",
""
]
] |
new_dataset
| 0.994405 |
1404.6719
|
Parisa Jalili Marandi
|
Parisa Jalili Marandi, Samuel Benz, Fernando Pedone, Ken Birman
|
Practical Experience Report: The Performance of Paxos in the Cloud
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This experience report presents the results of an extensive performance
evaluation conducted using four open-source implementations of Paxos deployed
in Amazon's EC2. Paxos is a fundamental algorithm for building fault-tolerant
services, at the core of state-machine replication. Implementations of Paxos
are currently used in many prototypes and production systems in both academia
and industry. Although all protocols surveyed in the paper implement Paxos,
they are optimized in a number of different ways, resulting in very different
behavior, as we show in the paper. We have considered a variety of
configurations and failure-free and faulty executions. In addition to reporting
our findings, we propose and assess additional optimizations to existing
implementations.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 07:14:47 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Marandi",
"Parisa Jalili",
""
],
[
"Benz",
"Samuel",
""
],
[
"Pedone",
"Fernando",
""
],
[
"Birman",
"Ken",
""
]
] |
new_dataset
| 0.982752 |
1404.6745
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on Adaptable Menu: A TRIZ based analysis
|
10 pages, 6 figures
|
Mishra, Umakant, Inventions on Adaptable Menu: A TRIZ Based
Analysis. December 6, 2006, Available at SSRN:
http://ssrn.com/abstract=949236
|
10.2139/ssrn.949236
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The menu is one of the most widely used elements of a graphical user
interface. The objective of a menu system is to provide various commands and
functions to the user in an easy way so that the user can just select the
desired operation from a given list instead of typing a complex command in the
command prompt.
In a conventional menu system the menu items or options are hard-coded in the
computer program. The programmer or developer composes menu items at the time
of development. The developer tries to include all options that he feels may be
required by the user in future. Although the items are decided from
"requirement analysis" and other studies, it is difficult to know the exact
need of a user at a future period of time. This leads to inclusion of a lot of
items in the menu, which leads to user confusion and frustration.
Thus there is a need for adaptable menu that can be changed according to user
requirement. The items of the adaptable menu should change from user to user
and from time to time depending on the program context and likelihood of user
selection.
This article defines the Ideal Final Result of a dropdown menu system,
defines the desirable functions of an adaptable menu, finds and solves the
contradictions faced in achieving the desirable functions, and illustrates six
selected cases on adaptable menu from US patent database.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 13:36:52 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999621 |
1404.6750
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on Command Buttons in a Graphical User Interface
|
12 pages
|
Mishra, Umakant, 10 Inventions on Command Buttons in a Graphical
User Interface, (December 6, 2006) Available at SSRN:
http://ssrn.com/abstract=949240
|
10.2139/ssrn.949240
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A command button may contain a textual label or a graphic image or both. It
may be static or animated. There can be many different features to make a
command button attractive and effective. As command button is a typical GUI
element, most improvement on GUI in general will also be applicable to command
buttons. Besides, there are also inventions to improve various aspects of
command buttons in specific. This article illustrates 10 selected inventions
from US patent database. Each invention is followed by a TRIZ based analysis in
brief.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 13:57:05 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999665 |
1404.6754
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on dialog boxes used in GUI
|
Available at SSRN: http://ssrn.com/abstract=949247. Mishra, Umakant,
Inventions on Dialog Boxes Used in GUI, (December 6, 2006)
| null |
10.2139/ssrn.949247
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The dialog boxes are useful in case of displaying warnings, errors,
confirmations etc. in special situations. A typical dialog box is displayed in
a small window with some text message along with a few options for the user to
select. However, there are certain difficulties associated in programming and
implementing a conventional dialog box, such as, severe programming effort,
rigidity of the hard coded message, obscuring screen space and so on. There is
a need to overcome these difficulties of the dialog box to make them more
efficient and useful.
The modality of the dialog boxes also creates some limitations. While modal
dialog boxes needs to be closed explicitly by the user, modeless dialog boxes
can grow in number and become difficult to control. Thus, an ideal dialog box
should be deprived of all the above-mentioned drawbacks. The dialog box should
not obscure the screen. The user should be able open multiple dialog boxes but
without obscuring the screen.
This article analyses 5 interesting inventions on dialog boxes selected from
US Patent database. Each invention tries to overcome some limitations of a
conventional dialog box and provides some innovative features. Each solution is
also analyzed from a TRIZ perspective.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 14:12:20 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.986087 |
1404.6757
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on expressing emotions In Graphical User Interface
|
7 pages, 4 figures. Umakant Mishra, Inventions on Expressing Emotions
in Graphical User Interface, (December 6, 2006), Available at SSRN:
http://ssrn.com/abstract=949250
| null |
10.2139/ssrn.949250
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conventional GUI is more mechanical and does not recognize or communicate
emotions. The modern GUIs are trying to infer the likely emotional state and
personality of the user and communicate through a corresponding emotional
state.
Emotions are expressed in graphical icons, sounds, pictures and other means.
The emotions are found to be useful in especially in communication software,
interactive learning systems, robotics and other adaptive environments. Various
mechanisms have been developed to express emotions through graphical user
interfaces. This article illustrates some interesting inventions selected from
US patent database.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 14:29:01 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.983239 |
1404.6761
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on GUI for Touch Sensitive Screens
|
6 pages, 4 figures
|
Umakant Mishra, Inventions on GUI for Touch Sensitive Screens
(September 7, 2007). Available at SSRN: http://ssrn.com/abstract=1264684 or
http://dx.doi.org/10.2139/ssrn.1264684
|
10.2139/ssrn.1264684
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A touch sensitive screen displays the information on the screen and also
receives the input by sensing a user's touch on the same screen. This mechanism
facilitates system interaction directly through the screen without needing a
mouse or keyboard. This method has the advantage to make the system compact by
removing keyboard, mouse and similar interactive device.
However there are certain difficulties to implement a touch screen interface.
The display screens of portable devices are becoming smaller thereby leaving
lesser space for display of data, menu or touch screen interaction. Besides
some screens need to display so much of information that they hardly can afford
any space to display touch screen buttons. This article illustrates various
inventions which have successfully eliminated these difficulties by applying
appropriate Inventive principles.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 15:05:44 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.998449 |
1404.6765
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on GUI for Eye Cursor Controls Systems
|
6 pages, 4 figures
|
Mishra, Umakant, Inventions on GUI for Eye Cursor Control Systems
(September 7, 2007), Available at SSRN: http://ssrn.com/abstract=1264687 or
http://dx.doi.org/10.2139/ssrn.1264687
|
10.2139/ssrn.1264687
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Operating a GUI through eyeball is a complex mechanism and not used as often
as mouse or trackball. But there are situations where eye-mouse devices can
play a tremendous role especially where the hands of the user are not available
or busy to perform other activities. The difficulties of implementing an
eye-cursor control system are many. The article illustrates some inventions on
eye-cursor control system, which attempt to eliminate the difficulties of the
prior art mechanisms.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 15:18:54 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999513 |
1404.6776
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on GUI Aesthetics
|
9 pages, 7 figures
|
Umakant Mishra, Inventions on GUI Aesthetics (September 7, 2007).
Available at SSRN: http://ssrn.com/abstract=1264690 or
http://dx.doi.org/10.2139/ssrn.1264690
|
10.2139/ssrn.1264690
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Aesthetics or "look and feel" is one of the most important features of any
graphical user interface. Better aesthetics makes the interface user-friendlier
and more popular. Better aesthetics helps the user to understand the meaning of
various components and memorize the navigation paths. A better look and feel
ultimately makes a GUI more efficient and effective. Various methods are
adopted to improve the aesthetics of a GUI, such as, by using colors, using 3D
graphics, using pictorial icons, using sound etc.
It is important to provide links to all the important features on a desktop
or on a quick access panel. But too many icons or buttons sometimes creates
confusion. Hence it is important to restrict the temptation of putting
everything on the first screen or load the rarely used buttons on the toolbar.
One should ensure that the aesthetics of a GUI is not compromising with its
accessibility and other important features. This article illustrates some
inventions made on GUI aesthetics.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 15:51:51 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.992774 |
1404.6883
|
Jozef Frtus
|
Jozef Frt\'us
|
Credulous and Skeptical Argument Games for Complete Semantics in
Conflict Resolution based Argumentation
|
appears in the Proceedings of the 15th International Workshop on
Non-Monotonic Reasoning (NMR 2014)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Argumentation is one of the most popular approaches of defining
a~non-monotonic formalism and several argumentation based semantics were
proposed for defeasible logic programs. Recently, a new approach based on
notions of conflict resolutions was proposed, however with declarative
semantics only. This paper gives a more procedural counterpart by developing
skeptical and credulous argument games for complete semantics and soundness and
completeness theorems for both games are provided. After that, distribution of
defeasible logic program into several contexts is investigated and both
argument games are adapted for multi-context system.
|
[
{
"version": "v1",
"created": "Mon, 28 Apr 2014 07:24:57 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Frtús",
"Jozef",
""
]
] |
new_dataset
| 0.966985 |
1404.7053
|
Sergey Yakhontov V
|
Sergey V. Yakhontov
|
Computable real function F such that F is not polynomial time computable
on [0,1]
|
5 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A computable real function F on [0,1] is constructed such that there exists
an exponential time algorithm for the evaluation of the function on [0,1] on
Turing machine but there does not exist any polynomial time algorithm for the
evaluation of the function on [0,1] on Turing machine (moreover, it holds for
any rational point on (0,1))
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 02:31:06 GMT"
}
] | 2014-04-29T00:00:00 |
[
[
"Yakhontov",
"Sergey V.",
""
]
] |
new_dataset
| 0.9956 |
1305.3376
|
Thomas Zemen
|
Laura Bernad\'o, Thomas Zemen, Fredrik Tufvesson, Andreas F. Molisch,
Christoph F. Mecklenbr\"auker
|
Delay and Doppler Spreads of Non-Stationary Vehicular Channels for
Safety Relevant Scenarios
|
18 pages, 5 figures, submitted to IEEE Transactions on Vehicular
Communications for possible publication
|
IEEE Transactions on Vehicular Technology, vol. 63, no. 1, pp.
82-93, January 2014
|
10.1109/TVT.2013.2271956
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular communication channels are characterized by a non-stationary time-
and frequency-selective fading process due to rapid changes in the environment.
The non-stationary fading process can be characterized by assuming local
stationarity for a region with finite extent in time and frequency. For this
finite region the wide-sense stationarity and uncorrelated-scattering (WSSUS)
assumption holds approximately and we are able to calculate a time and
frequency dependent local scattering function (LSF). In this paper, we estimate
the LSF from a large set of measurements collected in the DRIVEWAY'09
measurement campaign, which focuses on scenarios for intelligent transportation
systems. We then obtain the time-frequency-varying power delay profile (PDP)
and the time-frequency-varying Doppler power spectral density (DSD) from the
LSF. Based on the PDP and the DSD, we analyze the time-frequency-varying root
mean square (RMS) delay spread and the RMS Doppler spread. We show that the
distribution of these channel parameters follows a bi-modal Gaussian mixture
distribution. High RMS delay spread values are observed in situations with rich
scattering, while high RMS Doppler spreads are obtained in drive-by scenarios.
|
[
{
"version": "v1",
"created": "Wed, 15 May 2013 07:22:46 GMT"
}
] | 2014-04-28T00:00:00 |
[
[
"Bernadó",
"Laura",
""
],
[
"Zemen",
"Thomas",
""
],
[
"Tufvesson",
"Fredrik",
""
],
[
"Molisch",
"Andreas F.",
""
],
[
"Mecklenbräuker",
"Christoph F.",
""
]
] |
new_dataset
| 0.999492 |
1404.6387
|
Pierre de Buyl
|
Kelsey D'Souza
|
PySTEMM: Executable Concept Modeling for K-12 STEM Learning
|
Part of the Proceedings of the 6th European Conference on Python in
Science (EuroSciPy 2013), Pierre de Buyl and Nelle Varoquaux editors, (2014)
| null | null |
euroscipy-proceedings2013-06
|
cs.CY cs.PL
|
http://creativecommons.org/licenses/by/3.0/
|
Modeling should play a central role in K-12 STEM education, where it could
make classes much more engaging. A model underlies every scientific theory, and
models are central to all the STEM disciplines (Science, Technology,
Engineering, Math). This paper describes executable concept modeling of STEM
concepts using immutable objects and pure functions in Python. I present
examples in math, physics, chemistry, and engineering, built using a
proof-of-concept tool called PySTEMM . The approach applies to all STEM areas
and supports learning with pictures, narrative, animation, and graph plots.
Models can extend each other, simplifying getting started. The
functional-programming style reduces incidental complexity and code debugging.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 10:55:44 GMT"
}
] | 2014-04-28T00:00:00 |
[
[
"D'Souza",
"Kelsey",
""
]
] |
new_dataset
| 0.984941 |
1404.6413
|
Georg Waltner
|
Georg Waltner and Thomas Mauthner and Horst Bischof
|
Indoor Activity Detection and Recognition for Sport Games Analysis
|
Part of the OAGM 2014 proceedings (arXiv:1404.3538)
| null | null |
OAGM/2014/03
|
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Activity recognition in sport is an attractive field for computer vision
research. Game, player and team analysis are of great interest and research
topics within this field emerge with the goal of automated analysis. The very
specific underlying rules of sports can be used as prior knowledge for the
recognition task and present a constrained environment for evaluation. This
paper describes recognition of single player activities in sport with special
emphasis on volleyball. Starting from a per-frame player-centered activity
recognition, we incorporate geometry and contextual information via an activity
context descriptor that collects information about all player's activities over
a certain timespan relative to the investigated player. The benefit of this
context information on single player activity recognition is evaluated on our
new real-life dataset presenting a total amount of almost 36k annotated frames
containing 7 activity classes within 6 videos of professional volleyball games.
Our incorporation of the contextual information improves the average
player-centered classification performance of 77.56% by up to 18.35% on
specific classes, proving that spatio-temporal context is an important clue for
activity recognition.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 13:25:09 GMT"
}
] | 2014-04-28T00:00:00 |
[
[
"Waltner",
"Georg",
""
],
[
"Mauthner",
"Thomas",
""
],
[
"Bischof",
"Horst",
""
]
] |
new_dataset
| 0.988304 |
1404.6503
|
Fabian Reiter
|
Fabian Reiter
|
Distributed Graph Automata
|
Master's Thesis, 64 pages
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by distributed algorithms, we introduce a new class of finite graph
automata that recognize precisely the graph languages definable in monadic
second-order logic. For the cases of words and trees, it has been long known
that the regular languages are precisely those definable in monadic
second-order logic. In this regard, the automata proposed in the present work
can be seen, to some extent, as a generalization of finite automata to graphs.
Furthermore, we show that, unlike for finite automata on words and trees, the
deterministic, nondeterministic and alternating variants of our automata form a
strict hierarchy with respect to their expressive power. For the weaker
variants, the emptiness problem is decidable.
|
[
{
"version": "v1",
"created": "Fri, 25 Apr 2014 18:58:40 GMT"
}
] | 2014-04-28T00:00:00 |
[
[
"Reiter",
"Fabian",
""
]
] |
new_dataset
| 0.96715 |
1312.5424
|
Chandranath Adak
|
Chandranath Adak
|
Dual Layer Textual Message Cryptosystem with Randomized Sequence of
Symmetric Key
|
Ethical Hacking-Issues & Challenges (EHIC)-2012
|
The Bulletin of Engineering and Science, ISSN: 0974-7176, Vol. 4
No. 2, 2012
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new concept of textual message encryption and
decryption through a pool of randomized symmetric key and the dual layer
cryptosystem with the concept of visual cryptography and steganography. A
textual message is converted into two image slides, and the images are
encrypted through two different randomized sequences of symmetric key. The
decryption is done in the reverse way. The encrypted images are decrypted by
those two symmetric keys. The decrypted image slides are merged together and
converted into textual message. Here the image sharing is done through the
concept of visual cryptography and the textual message to image conversion is
done through the concept of steganography.
|
[
{
"version": "v1",
"created": "Thu, 19 Dec 2013 07:18:18 GMT"
}
] | 2014-04-25T00:00:00 |
[
[
"Adak",
"Chandranath",
""
]
] |
new_dataset
| 0.952739 |
1404.5870
|
Apostolos Syropoulos
|
Apostolos Syropoulos and Athanasios Stavrianos
|
Using Scripting Languages to Teach Programming
|
13 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, scripting programming languages like Python, Perl and Ruby are
widely used in system programming, scientific computing, etc. Although solving
a particular problem in these languages requires less time, less programming
effort, and less concepts to be taught to achieve the desired goal, still they
are not used as teaching tools. Therefore, the use of scripting languages as a
teaching vehicle for programming course is very promising. On the other hand,
GUI programming, when performed with such languages, is easy and rewarding,
since one sees the result of her work immediately. Thus, we are sure that
scripting languages combined with GUI toolkits will be the next big thing in
computer education.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 18:48:29 GMT"
}
] | 2014-04-24T00:00:00 |
[
[
"Syropoulos",
"Apostolos",
""
],
[
"Stavrianos",
"Athanasios",
""
]
] |
new_dataset
| 0.988637 |
1404.5929
|
Fabio G. Guerrero-Moreno
|
Maribell Sacanamboy Franco and Fabio G. Guerrero
|
FPGA design of a cdma2000 turbo decoder
|
In Spanish, 14 pages, 13 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the FPGA hardware design of a turbo decoder for the
cdma2000 standard. The work includes a study and mathematical analysis of the
turbo decoding process, based on the MAX-Log-MAP algorithm. Results of decoding
for a packet size of two hundred fifty bits are presented, as well as an
analysis of area versus performance, and the key variables for hardware design
in turbo decoding.
|
[
{
"version": "v1",
"created": "Wed, 23 Apr 2014 19:09:19 GMT"
}
] | 2014-04-24T00:00:00 |
[
[
"Franco",
"Maribell Sacanamboy",
""
],
[
"Guerrero",
"Fabio G.",
""
]
] |
new_dataset
| 0.999389 |
1404.5385
|
Badr Benmammar
|
Mohammed Zakarya Baba-Ahmed (LTT), Badr Benmammar (LTT), Fethi Tarik
Bendimerad (LTT)
|
Vers l'auto-gestion d'un r\'eseau de radio cognitive
|
in French. International Congress on Telecommunication and
Application'14 (2014)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognitive Radio (CR) operates in different fields as varied, one of these is
cognitive radio networks. In this paper, we propose a new approach used CR,
which aims to manage potential failures of computer systems and applications
through the introduction of two aspects of autonomous networks to make systems
capable of managing themselves with minimum human intervention.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 06:26:18 GMT"
}
] | 2014-04-23T00:00:00 |
[
[
"Baba-Ahmed",
"Mohammed Zakarya",
"",
"LTT"
],
[
"Benmammar",
"Badr",
"",
"LTT"
],
[
"Bendimerad",
"Fethi Tarik",
"",
"LTT"
]
] |
new_dataset
| 0.991911 |
1404.5393
|
Sujathakumari K
|
Sujathakumari K, Dersanambika K.S
|
Cooperating distributed context-free hexagonal array grammar systems
with permitting contexts
|
16 pages, 6 figures, Published with International Journal of
Mathematics Trends and Technology (IJMTT)
|
International Journal of Mathematical Trends and Technology
(IJMTT). V7:156-171 March 2014
|
10.14445/22315373/IJMTT-V7P520
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we associate permitting symbols with rules of Grammars in the
components of cooperating distributed context free hexagonal array grammar
systems as a control mechanism and investigating the generative power of the
resulting systems in the terminal mode. This feature of associating permitting
symbols with rules when extended to patterns in the form of connected arrays
also requires checking of symbols, but this is simpler than usual pattern
matching. The benefit of allowing permitting symbols is that it enables us to
reduce the number of components required in a cooperating distributed hexagonal
array grammar system for generating a set of picture arrays.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 06:53:20 GMT"
}
] | 2014-04-23T00:00:00 |
[
[
"K",
"Sujathakumari",
""
],
[
"S",
"Dersanambika K.",
""
]
] |
new_dataset
| 0.997392 |
1404.5454
|
Adish Singla
|
Adish Singla, Eric Horvitz, Ece Kamar, Ryen White
|
Stochastic Privacy
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online services such as web search and e-commerce applications typically rely
on the collection of data about users, including details of their activities on
the web. Such personal data is used to enhance the quality of service via
personalization of content and to maximize revenues via better targeting of
advertisements and deeper engagement of users on sites. To date, service
providers have largely followed the approach of either requiring or requesting
consent for opting-in to share their data. Users may be willing to share
private information in return for better quality of service or for incentives,
or in return for assurances about the nature and extend of the logging of data.
We introduce \emph{stochastic privacy}, a new approach to privacy centering on
a simple concept: A guarantee is provided to users about the upper-bound on the
probability that their personal data will be used. Such a probability, which we
refer to as \emph{privacy risk}, can be assessed by users as a preference or
communicated as a policy by a service provider. Service providers can work to
personalize and to optimize revenues in accordance with preferences about
privacy risk. We present procedures, proofs, and an overall system for
maximizing the quality of services, while respecting bounds on allowable or
communicated privacy risk. We demonstrate the methodology with a case study and
evaluation of the procedures applied to web search personalization. We show how
we can achieve near-optimal utility of accessing information with provable
guarantees on the probability of sharing data.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 10:55:19 GMT"
}
] | 2014-04-23T00:00:00 |
[
[
"Singla",
"Adish",
""
],
[
"Horvitz",
"Eric",
""
],
[
"Kamar",
"Ece",
""
],
[
"White",
"Ryen",
""
]
] |
new_dataset
| 0.956549 |
1404.5468
|
Madhumangal Pal Dr.
|
Madhumangal Pal
|
Intersection Graphs: An Introduction
|
49 pages
|
Annals of Pure and Applied Mathematics, vol. 4, No. 1, 2013, 43-91
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intersection graphs are very important in both theoretical as well as
application point of view. Depending on the geometrical representation,
different type of intersection graphs are defined. Among them interval,
circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more
important. In this article, a brief introduction of each of these intersection
graphs is given. Some basic properties and algorithmic status of few problems
on these graphs are cited. This article will help to the beginners to start
work in this direction. Since the article contains a lot of information in a
compact form it is also useful for the expert researchers too.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 12:22:31 GMT"
}
] | 2014-04-23T00:00:00 |
[
[
"Pal",
"Madhumangal",
""
]
] |
new_dataset
| 0.99905 |
1012.5494
|
Serguei Mokhov
|
Serguei A. Mokhov
|
Contents of COMP6411 Summer 2010 Final Reports on Comparative Studies of
Programming Languages
|
an index
| null | null | null |
cs.PL
|
http://creativecommons.org/licenses/by/3.0/
|
This index covers the lecture notes and the final course project reports for
COMP6411 Summer 2010 at Concordia University, Montreal, Canada, Comparative
Study of Programming Languages by 4 teams trying compare a set of common
criteria and their applicability to about 10 distinct programming languages,
where 5 language choices were provided by the instructor and five were picked
by each team and each student individually compared two of the 10 and then the
team did a summary synthesis across all 10 languages. Their findings are posted
here for further reference, comparative studies, and analysis.
|
[
{
"version": "v1",
"created": "Sun, 26 Dec 2010 03:33:09 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Apr 2014 20:28:54 GMT"
}
] | 2014-04-22T00:00:00 |
[
[
"Mokhov",
"Serguei A.",
""
]
] |
new_dataset
| 0.997468 |
1311.7113
|
Tuvi Etzion
|
Sarit Buzaglo, Eitan Yaakobi, Tuvi Etzion, Jehoshua Bruck
|
Systematic Codes for Rank Modulation
|
to be presented ISIT2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this paper is to construct systematic error-correcting codes for
permutations and multi-permutations in the Kendall's $\tau$-metric. These codes
are important in new applications such as rank modulation for flash memories.
The construction is based on error-correcting codes for multi-permutations and
a partition of the set of permutations into error-correcting codes. For a given
large enough number of information symbols $k$, and for any integer $t$, we
present a construction for ${(k+r,k)}$ systematic $t$-error-correcting codes,
for permutations from $S_{k+r}$, with less redundancy symbols than the number
of redundancy symbols in the codes of the known constructions. In particular,
for a given $t$ and for sufficiently large $k$ we can obtain $r=t+1$. The same
construction is also applied to obtain related systematic error-correcting
codes for multi-permutations.
|
[
{
"version": "v1",
"created": "Wed, 27 Nov 2013 20:28:20 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jan 2014 12:53:30 GMT"
},
{
"version": "v3",
"created": "Sun, 20 Apr 2014 07:06:04 GMT"
}
] | 2014-04-22T00:00:00 |
[
[
"Buzaglo",
"Sarit",
""
],
[
"Yaakobi",
"Eitan",
""
],
[
"Etzion",
"Tuvi",
""
],
[
"Bruck",
"Jehoshua",
""
]
] |
new_dataset
| 0.975921 |
1303.6422
|
Frank H. Lutz
|
Bruno Benedetti and Frank H. Lutz
|
Random Discrete Morse Theory and a New Library of Triangulations
|
35 pages, 5 figures, 7 tables
|
Experimental Mathematics, Vol. 23, Issue 1 (2014), 66-94
| null |
CPH-SYM-DNRF92
|
cs.CG math.AT math.CO math.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
1) We introduce random discrete Morse theory as a computational scheme to
measure the complicatedness of a triangulation. The idea is to try to quantify
the frequence of discrete Morse matchings with a certain number of critical
cells. Our measure will depend on the topology of the space, but also on how
nicely the space is triangulated.
(2) The scheme we propose looks for optimal discrete Morse functions with an
elementary random heuristic. Despite its na\"ivet\'e, this approach turns out
to be very successful even in the case of huge inputs.
(3) In our view the existing libraries of examples in computational topology
are `too easy' for testing algorithms based on discrete Morse theory. We
propose a new library containing more complicated (and thus more meaningful)
test examples.
|
[
{
"version": "v1",
"created": "Tue, 26 Mar 2013 10:11:26 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Nov 2013 19:23:38 GMT"
}
] | 2014-04-21T00:00:00 |
[
[
"Benedetti",
"Bruno",
""
],
[
"Lutz",
"Frank H.",
""
]
] |
new_dataset
| 0.97535 |
1310.6719
|
Sujeet Patole
|
Sujeet Patole and Murat Torlak
|
Two Dimensional Array Imaging with Beam Steered Data
| null |
IEEE Transactions on Image Processing Dec. 2013 (Volume:22, Issue:
12, Page(s):5181 - 5189 )
|
10.1109/TIP.2013.2282115
|
ISSN: 1057-7149
|
cs.CV cs.IT math.IT stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper discusses different approaches used for millimeter wave imaging of
two-dimensional objects. Imaging of a two dimensional object requires reflected
wave data to be collected across two distinct dimensions. In this paper, we
propose a reconstruction method that uses narrowband waveforms along with two
dimensional beam steering. The beam is steered in azimuthal and elevation
direction, which forms the two distinct dimensions required for the
reconstruction. The Reconstruction technique uses inverse Fourier transform
along with amplitude and phase correction factors. In addition, this
reconstruction technique does not require interpolation of the data in either
wavenumber or spatial domain. Use of the two dimensional beam steering offers
better performance in the presence of noise compared with the existing methods,
such as switched array imaging system. Effects of RF impairments such as
quantization of the phase of beam steering weights and timing jitter which add
to phase noise, are analyzed.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 19:33:50 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Apr 2014 23:01:54 GMT"
}
] | 2014-04-21T00:00:00 |
[
[
"Patole",
"Sujeet",
""
],
[
"Torlak",
"Murat",
""
]
] |
new_dataset
| 0.954255 |
1403.5012
|
Yong Wang
|
Kai Li, Yong Wang, Meilin Liu
|
A Non-Cooperative Game Model for Reliability-Based Task Scheduling in
Cloud Computing
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing is a newly emerging distributed system which is evolved from
Grid computing. Task scheduling is the core research of cloud computing which
studies how to allocate the tasks among the physical nodes, so that the tasks
can get a balanced allocation or each task's execution cost decreases to the
minimum, or the overall system performance is optimal. Unlike task scheduling
based on time or cost before, aiming at the special reliability requirements in
cloud computing, we propose a non-cooperative game model for reliability-based
task scheduling approach. This model takes the steady-state availability that
computing nodes provide as the target, takes the task slicing strategy of the
schedulers as the game strategy, then finds the Nash equilibrium solution. And
also, we design a task scheduling algorithm based on this model. The
experiments can be seen that our task scheduling algorithm is better than the
so-called balanced scheduling algorithm.
|
[
{
"version": "v1",
"created": "Thu, 20 Mar 2014 00:48:42 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Apr 2014 03:36:23 GMT"
}
] | 2014-04-21T00:00:00 |
[
[
"Li",
"Kai",
""
],
[
"Wang",
"Yong",
""
],
[
"Liu",
"Meilin",
""
]
] |
new_dataset
| 0.986723 |
1404.4744
|
Ghassan Karame
|
Jens Mathias Bohli, Dan Dobre, Ghassan O. Karame, Wenting Li
|
PrivLoc: Preventing Location Tracking in Geofencing Services
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Location-based services are increasingly used in our daily activities. In
current services, users however have to give up their location privacy in order
to acquire the service. The literature features a large number of contributions
which aim at enhancing user privacy in location-based services. Most of these
contributions obfuscate the locations of users using spatial and/or temporal
cloaking in order to provide k-anonymity. Although such schemes can indeed
strengthen the location privacy of users, they often decrease the service
quality and do not necessarily prevent the possible tracking of user movements
(i.e., direction, trajectory, velocity). With the rise of Geofencing
applications, tracking of movements becomes more evident since, in these
settings, the service provider is not only requesting a single location of the
user, but requires the movement vectors of users to determine whether the user
has entered/exited a Geofence of interest. In this paper, we propose a novel
solution, PrivLoc, which enables the privacy-preserving outsourcing of
Geofencing and location-based services to the cloud without leaking any
meaningful information about the location, trajectory, and velocity of the
users. Notably, PrivLoc enables an efficient and privacy-preserving
intersection of movement vectors with any polygon of interest, leveraging
functionality from existing Geofencing services or spatial databases. We
analyze the security and privacy provisions of PrivLoc and we evaluate the
performance of our scheme by means of implementation. Our results show that the
performance overhead introduced by PrivLoc can be largely tolerated in
realistic deployment settings.
|
[
{
"version": "v1",
"created": "Fri, 18 Apr 2014 10:51:23 GMT"
}
] | 2014-04-21T00:00:00 |
[
[
"Bohli",
"Jens Mathias",
""
],
[
"Dobre",
"Dan",
""
],
[
"Karame",
"Ghassan O.",
""
],
[
"Li",
"Wenting",
""
]
] |
new_dataset
| 0.998781 |
1301.0313
|
Subhash Kak
|
Subhash Kak
|
The Piggy Bank Cryptographic Trope
|
7 pages, 6 figures
|
Infocommunications Journal 6: 22-25 (2014)
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents applications of the trope of the locked and sealed
piggy-bank into which the secret can be easily inserted but from which it
cannot be withdrawn without opening the box. We present a basic two-pass
cryptographic scheme that can serve as template for a variety of
implementations. Together with the sealed piggy-bank is sent a coded letter
that lists and certifies the contents of the box. We show how this idea can
help increase the security of cryptographic protocols for classical systems as
well as those based on "single-state" systems. More specifically, we propose
the use of a hashing digest (instead of the coded letter) to detect loss of key
bits to the eavesdropper and use in communication systems where error
correction is an important issue.
|
[
{
"version": "v1",
"created": "Tue, 1 Jan 2013 18:17:21 GMT"
}
] | 2014-04-18T00:00:00 |
[
[
"Kak",
"Subhash",
""
]
] |
new_dataset
| 0.990258 |
1404.4391
|
Rick Zhang
|
Rick Zhang and Marco Pavone
|
Control of Robotic Mobility-On-Demand Systems: a Queueing-Theoretical
Perspective
|
10 pages, To appear at RSS 2014
| null | null | null |
cs.RO cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present and analyze a queueing-theoretical model for
autonomous mobility-on-demand (MOD) systems where robotic, self-driving
vehicles transport customers within an urban environment and rebalance
themselves to ensure acceptable quality of service throughout the entire
network. We cast an autonomous MOD system within a closed Jackson network model
with passenger loss. It is shown that an optimal rebalancing algorithm
minimizing the number of (autonomously) rebalancing vehicles and keeping
vehicles availabilities balanced throughout the network can be found by solving
a linear program. The theoretical insights are used to design a robust,
real-time rebalancing algorithm, which is applied to a case study of New York
City. The case study shows that the current taxi demand in Manhattan can be met
with about 8,000 robotic vehicles (roughly 60% of the size of the current taxi
fleet). Finally, we extend our queueing-theoretical setup to include congestion
effects, and we study the impact of autonomously rebalancing vehicles on
overall congestion. Collectively, this paper provides a rigorous approach to
the problem of system-wide coordination of autonomously driving vehicles, and
provides one of the first characterizations of the sustainability benefits of
robotic transportation networks.
|
[
{
"version": "v1",
"created": "Wed, 16 Apr 2014 21:35:03 GMT"
}
] | 2014-04-18T00:00:00 |
[
[
"Zhang",
"Rick",
""
],
[
"Pavone",
"Marco",
""
]
] |
new_dataset
| 0.99135 |
1404.4448
|
Zohair Abu Shaban
|
Zohair Abu-Shaban, Hani Mehrpouyan, Joel Grotz, Bjorn Ottersten
|
Overloaded Satellite Receiver Using SIC with Hybrid Beamforming and ML
Detection
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new receiver structure that is intended to detect the
signals from multiple adjacent satellites in the presence of other interfering
satellites is proposed. We tackle the worst case interference conditions, i.e.,
it is assumed that uncoded signals that fully overlap in frequency arrive at a
multiple-element small-size parabolic antenna in a spatially correlated noise
environment. The proposed successive interference cancellation (SIC) receiver,
denoted by SIC Hy/ML, employs hybrid beamforming and disjoint maximum
likelihood (ML) detection. Depending on the individual signals spatial
position, the proposed SIC Hy/ML scheme takes advantage of two types of
beamformers: a maximum ratio combining (MRC) beamformer and a compromised array
response (CAR) beamformer. The performance of the proposed receiver is compared
to an SIC receiver that uses only MRC beamforming scheme with ML detection for
all signals, a joint ML detector, and a minimum mean square error detector. It
is found that SIC Hy/ML outperforms the other schemes by a large margin.
|
[
{
"version": "v1",
"created": "Thu, 17 Apr 2014 08:29:09 GMT"
}
] | 2014-04-18T00:00:00 |
[
[
"Abu-Shaban",
"Zohair",
""
],
[
"Mehrpouyan",
"Hani",
""
],
[
"Grotz",
"Joel",
""
],
[
"Ottersten",
"Bjorn",
""
]
] |
new_dataset
| 0.994224 |
1404.4478
|
Deepak Rajendraprasad
|
L. Sunil Chandran, Deepak Rajendraprasad and Marek Tesa\v{r}
|
Rainbow Colouring of Split Graphs
|
This is the full version of a paper to be presented at ICGT 2014.
This complements the results in arXiv:1205.1670 (which were presented in
COCOON 2013), and both will be merged into a single journal submission
| null | null | null |
cs.DM cs.CC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A rainbow path in an edge coloured graph is a path in which no two edges are
coloured the same. A rainbow colouring of a connected graph G is a colouring of
the edges of G such that every pair of vertices in G is connected by at least
one rainbow path. The minimum number of colours required to rainbow colour G is
called its rainbow connection number. Between them, Chakraborty et al. [J.
Comb. Optim., 2011] and Ananth et al. [FSTTCS, 2012] have shown that for every
integer k, k \geq 2, it is NP-complete to decide whether a given graph can be
rainbow coloured using k colours.
A split graph is a graph whose vertex set can be partitioned into a clique
and an independent set. Chandran and Rajendraprasad have shown that the problem
of deciding whether a given split graph G can be rainbow coloured using 3
colours is NP-complete and further have described a linear time algorithm to
rainbow colour any split graph using at most one colour more than the optimum
[COCOON, 2012]. In this article, we settle the computational complexity of the
problem on split graphs and thereby discover an interesting dichotomy.
Specifically, we show that the problem of deciding whether a given split graph
can be rainbow coloured using k colours is NP-complete for k \in {2,3}, but can
be solved in polynomial time for all other values of k.
|
[
{
"version": "v1",
"created": "Thu, 17 Apr 2014 10:41:32 GMT"
}
] | 2014-04-18T00:00:00 |
[
[
"Chandran",
"L. Sunil",
""
],
[
"Rajendraprasad",
"Deepak",
""
],
[
"Tesař",
"Marek",
""
]
] |
new_dataset
| 0.993075 |
1404.4572
|
Behrang Qasemizadeh
|
Behrang Qasemizadeh, Saeed Rahimi, Behrooz Mahmoodi Bakhtiari
|
The First Parallel Multilingual Corpus of Persian: Toward a Persian
BLARK
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we have introduced the first parallel corpus of Persian with
more than 10 other European languages. This article describes primary steps
toward preparing a Basic Language Resources Kit (BLARK) for Persian. Up to now,
we have proposed morphosyntactic specification of Persian based on
EAGLE/MULTEXT guidelines and specific resources of MULTEXT-East. The article
introduces Persian Language, with emphasis on its orthography and
morphosyntactic features, then a new Part-of-Speech categorization and
orthography for Persian in digital environments is proposed. Finally, the
corpus and related statistic will be analyzed.
|
[
{
"version": "v1",
"created": "Thu, 17 Apr 2014 16:22:40 GMT"
}
] | 2014-04-18T00:00:00 |
[
[
"Qasemizadeh",
"Behrang",
""
],
[
"Rahimi",
"Saeed",
""
],
[
"Bakhtiari",
"Behrooz Mahmoodi",
""
]
] |
new_dataset
| 0.988258 |
1402.0087
|
Reza Ebrahimi Atani
|
Mehran Alidoost Nia, Reza Ebrahimi Atani
|
A novel datatype architecture support for programming languages
|
This paper is accepted and published in International journal of
Programming Languages and applications
|
International journal of Programming Languages and applications
Vol. 4 No.1 2014
|
10.5121/ijpla
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In programmers point of view, Datatypes in programming language level have a
simple description but inside hardware, huge machine codes are responsible to
describe type features. Datatype architecture design is a novel approach to
match programming features along with hardware design. In this paper a novel
Data type-Based Code Reducer (TYPELINE) architecture is proposed and
implemented according to significant data types (SDT) of programming languages.
TYPELINE uses TEUs for processing various SDT operations. This architecture
design leads to reducing the number of machine codes, and increases execution
speed, and also improves some parallelism level. This is because this
architecture supports some operation for the execution of Abstract Data Types
in parallel. Also it ensures to maintain data type features and entire
application level specifications using the proposed type conversion unit. This
framework includes compiler level identifying execution modes and memory
management unit for decreasing object read/write in heap memory by ISA support.
This energy-efficient architecture is completely compatible with object
oriented programming languages and in combination mode it can process complex
C++ data structures with respect to parallel TYPELINE architecture support.
|
[
{
"version": "v1",
"created": "Sat, 1 Feb 2014 14:07:59 GMT"
}
] | 2014-04-17T00:00:00 |
[
[
"Nia",
"Mehran Alidoost",
""
],
[
"Atani",
"Reza Ebrahimi",
""
]
] |
new_dataset
| 0.999202 |
1403.4640
|
Nabeel Gillani
|
Nabeel Gillani, Rebecca Eynon, Michael Osborne, Isis Hjorth, Stephen
Roberts
|
Communication Communities in MOOCs
|
10 pages, 3 figures, 1 table. Submitted for review to UAI 2014
| null | null | null |
cs.CY cs.SI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Massive Open Online Courses (MOOCs) bring together thousands of people from
different geographies and demographic backgrounds -- but to date, little is
known about how they learn or communicate. We introduce a new content-analysed
MOOC dataset and use Bayesian Non-negative Matrix Factorization (BNMF) to
extract communities of learners based on the nature of their online forum
posts. We see that BNMF yields a superior probabilistic generative model for
online discussions when compared to other models, and that the communities it
learns are differentiated by their composite students' demographic and course
performance indicators. These findings suggest that computationally efficient
probabilistic generative modelling of MOOCs can reveal important insights for
educational researchers and practitioners and help to develop more intelligent
and responsive online learning environments.
|
[
{
"version": "v1",
"created": "Tue, 18 Mar 2014 22:57:24 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Apr 2014 15:50:48 GMT"
}
] | 2014-04-17T00:00:00 |
[
[
"Gillani",
"Nabeel",
""
],
[
"Eynon",
"Rebecca",
""
],
[
"Osborne",
"Michael",
""
],
[
"Hjorth",
"Isis",
""
],
[
"Roberts",
"Stephen",
""
]
] |
new_dataset
| 0.991025 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.