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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1404.4100
|
Liang Gong
|
Liang Gong, Hongyu Zhang, Hyunmin Seo and Sunghun Kim
|
Locating Crashing Faults based on Crash Stack Traces
|
11 pages, this works is done in 2011 when the first author(Liang
Gong) was a master student in Tsinghua University
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software crashes due to its increasing complexity. Once a crash happens, a
crash report could be sent to software developers for investigation upon user
permission. Because of the large number of crash reports and limited
information, debugging for crashes is often a tedious and labor-intensive task.
In this paper, we propose a statistical fault localization framework to help
developers locate functions that contain crashing faults. We generate the
execution traces for the failing traces based on the crash stack, and the
passing traces from normal executions. We form program spectra by combining
generated passing and failing trace, and then apply statistical fault
localization techniques such as Ochiai to locate the crashing faults. We also
propose two heuristics to improve the fault localization performance. We
evaluate our approach using the real-world Firefox crash report data. The
results show that the performance of our method is promising. Our approach
permits developers to locate 63.9% crashing faults by examining only 5% Firefox
3.6 functions in the spectra.
|
[
{
"version": "v1",
"created": "Tue, 15 Apr 2014 22:32:21 GMT"
}
] | 2014-04-17T00:00:00 |
[
[
"Gong",
"Liang",
""
],
[
"Zhang",
"Hongyu",
""
],
[
"Seo",
"Hyunmin",
""
],
[
"Kim",
"Sunghun",
""
]
] |
new_dataset
| 0.999745 |
1312.1450
|
Liang Liu
|
Liang Liu, Rui Zhang, and Kee-Chaing Chua
|
Multi-Antenna Wireless Powered Communication with Energy Beamforming
|
submitted for possible publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The newly emerging wireless powered communication networks (WPCNs) have
recently drawn significant attention, where radio signals are used to power
wireless terminals for information transmission. In this paper, we study a WPCN
where one multi-antenna access point (AP) coordinates energy transfer and
information transfer to/from a set of single-antenna users. A
harvest-then-transmit protocol is assumed where the AP first broadcasts
wireless power to all users via energy beamforming in the downlink (DL), and
then the users send their independent information to the AP simultaneously in
the uplink (UL) using their harvested energy. To optimize the users' throughput
and yet guarantee their rate fairness, we maximize the minimum throughput among
all users by a joint design of the DL-UL time allocation, the DL energy
beamforming, and the UL transmit power allocation plus receive beamforming. We
solve this non-convex problem optimally by two steps. First, we fix the DL-UL
time allocation and obtain the optimal DL energy beamforming, UL power
allocation and receive beamforming to maximize the minimum
signal-to-interference-plus-noise ratio (SINR) of all users. This problem is
shown to be in general non-convex; however, we convert it equivalently to a
spectral radius minimization problem, which can be solved efficiently by
applying the alternating optimization based on the non-negative matrix theory.
Then, the optimal time allocation is found by a one-dimension search to
maximize the minimum rate of all users. Furthermore, two suboptimal designs of
lower complexity are proposed, and their throughput performance is compared
against that of the optimal solution.
|
[
{
"version": "v1",
"created": "Thu, 5 Dec 2013 07:01:06 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Dec 2013 14:04:42 GMT"
},
{
"version": "v3",
"created": "Tue, 15 Apr 2014 08:24:52 GMT"
}
] | 2014-04-16T00:00:00 |
[
[
"Liu",
"Liang",
""
],
[
"Zhang",
"Rui",
""
],
[
"Chua",
"Kee-Chaing",
""
]
] |
new_dataset
| 0.998833 |
1404.3820
|
Joshua Grochow
|
Joshua A. Grochow and Toniann Pitassi
|
Circuit complexity, proof complexity, and polynomial identity testing
| null | null | null | null |
cs.CC cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new algebraic proof system, which has tight connections to
(algebraic) circuit complexity. In particular, we show that any
super-polynomial lower bound on any Boolean tautology in our proof system
implies that the permanent does not have polynomial-size algebraic circuits
(VNP is not equal to VP). As a corollary to the proof, we also show that
super-polynomial lower bounds on the number of lines in Polynomial Calculus
proofs (as opposed to the usual measure of number of monomials) imply the
Permanent versus Determinant Conjecture. Note that, prior to our work, there
was no proof system for which lower bounds on an arbitrary tautology implied
any computational lower bound.
Our proof system helps clarify the relationships between previous algebraic
proof systems, and begins to shed light on why proof complexity lower bounds
for various proof systems have been so much harder than lower bounds on the
corresponding circuit classes. In doing so, we highlight the importance of
polynomial identity testing (PIT) for understanding proof complexity.
More specifically, we introduce certain propositional axioms satisfied by any
Boolean circuit computing PIT. We use these PIT axioms to shed light on
AC^0[p]-Frege lower bounds, which have been open for nearly 30 years, with no
satisfactory explanation as to their apparent difficulty. We show that either:
a) Proving super-polynomial lower bounds on AC^0[p]-Frege implies VNP does not
have polynomial-size circuits of depth d - a notoriously open question for d at
least 4 - thus explaining the difficulty of lower bounds on AC^0[p]-Frege, or
b) AC^0[p]-Frege cannot efficiently prove the depth d PIT axioms, and hence we
have a lower bound on AC^0[p]-Frege.
Using the algebraic structure of our proof system, we propose a novel way to
extend techniques from algebraic circuit complexity to prove lower bounds in
proof complexity.
|
[
{
"version": "v1",
"created": "Tue, 15 Apr 2014 05:54:46 GMT"
}
] | 2014-04-16T00:00:00 |
[
[
"Grochow",
"Joshua A.",
""
],
[
"Pitassi",
"Toniann",
""
]
] |
new_dataset
| 0.970028 |
1404.3920
|
Aske Plaat
|
Catholijn Jonker, Joost Broekens, Aske Plaat
|
Virtual Reflexes
| null | null | null | null |
cs.CY cs.HC
|
http://creativecommons.org/licenses/by/3.0/
|
Virtual Reality is used successfully to treat people for regular phobias. A
new challenge is to develop Virtual Reality Exposure Training for social
skills. Virtual actors in such systems have to show appropriate social behavior
including emotions, gaze, and keeping distance. The behavior must be realistic
and real-time. Current approaches consist of four steps: 1) trainee social
signal detection, 2) cognitive-affective interpretation, 3) determination of
the appropriate bodily responses, and 4) actuation. The "cognitive" detour of
such approaches does not match the directness of human bodily reflexes and
causes unrealistic responses and delay. Instead, we propose virtual reflexes as
concurrent sensory-motor processes to control virtual actors. Here we present a
virtual reflexes architecture, explain how emotion and cognitive modulation are
embedded, detail its workings, and give an example description of an aggression
training application.
|
[
{
"version": "v1",
"created": "Mon, 14 Apr 2014 14:07:09 GMT"
}
] | 2014-04-16T00:00:00 |
[
[
"Jonker",
"Catholijn",
""
],
[
"Broekens",
"Joost",
""
],
[
"Plaat",
"Aske",
""
]
] |
new_dataset
| 0.987286 |
1310.6422
|
Dheerendra Mishra Mr.
|
Dheerendra Mishra
|
Cryptanalysis of Sun and Cao's Remote Authentication Scheme with User
Anonymity
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic ID-based remote user authentication schemes ensure efficient and
anonymous mutual authentication between entities. In 2013, Khan et al. proposed
an improved dynamic ID-based authentication scheme to overcome the security
flaws of Wang et al.'s authentication scheme. Recently, Sun and Cao showed that
Khan et al. does not satisfies the claim of the user's privacy and proposed an
efficient authentication scheme with user anonymity. The Sun and Cao's scheme
achieve improvement over Khan et al.'s scheme in both privacy and performance
point of view. Unfortunately, we identify that Sun and Cao's scheme does not
resist password guessing attack. Additionally, Sun and Cao's scheme does not
achieve forward secrecy.
|
[
{
"version": "v1",
"created": "Wed, 23 Oct 2013 22:43:48 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Apr 2014 06:20:34 GMT"
}
] | 2014-04-15T00:00:00 |
[
[
"Mishra",
"Dheerendra",
""
]
] |
new_dataset
| 0.968484 |
1402.1377
|
Edward Haeusler
|
Davi Romero de Vasconcelos and Edward Hermann Haeusler
|
Reasoning about Games via a First-order Modal Model Checking Approach
|
Extended version of article published in the SBMF 2007. Accepted to
ENTCS. Withdrawn from ENTCS in 2014 in virtue to submission to other venue
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we present a logic based on first-order CTL, namely Game
Analysis Logic (GAL), in order to reason about games. We relate models and
solution concepts of Game Theory as models and formulas of GAL, respectively.
Precisely, we express extensive games with perfect in- formation as models of
GAL, and Nash equilibrium and subgame perfect equilibrium by means of formulas
of GAL. From a practical point of view, we provide a GAL model checker in order
to analyze games automatically. We use our model checker in at least two
directions: to find solution con- cepts of Game Theory; and, to analyze players
that are based on standard algorithms of the AI community, such as the minimax
procedure.
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 15:29:21 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Apr 2014 15:54:46 GMT"
}
] | 2014-04-15T00:00:00 |
[
[
"de Vasconcelos",
"Davi Romero",
""
],
[
"Haeusler",
"Edward Hermann",
""
]
] |
new_dataset
| 0.972064 |
1404.3316
|
Luiz Cortinhas
|
Luiz Cortinhas, Patrick Monteiro, Amir Zahlan, Gabriel Vianna and
Marcio Moscoso
|
Embed System for Robotic Arm with 3 Degree of Freedom Controller using
Computational Vision on Real-Time
|
8 pages,9 figures, published on AIFL 2014 conference (AIFL-2014
Submission 20)
| null | null | null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This Paper deals with robotic arm embed controller system, with distributed
system based on protocol communication between one server supporting multiple
points and mobile applications trough sockets .The proposed system utilizes
hand with glove gesture in three-dimensional recognition using fuzzy
implementation to set x,y,z coordinates. This approach present all
implementation over: two raspberry PI arm based computer running client
program, x64 PC running server program, and one robot arm controlled by
ATmega328p based board.
|
[
{
"version": "v1",
"created": "Sat, 12 Apr 2014 19:30:32 GMT"
}
] | 2014-04-15T00:00:00 |
[
[
"Cortinhas",
"Luiz",
""
],
[
"Monteiro",
"Patrick",
""
],
[
"Zahlan",
"Amir",
""
],
[
"Vianna",
"Gabriel",
""
],
[
"Moscoso",
"Marcio",
""
]
] |
new_dataset
| 0.99748 |
1404.3341
|
Andrea Ballatore
|
Andrea Ballatore
|
Defacing the map: Cartographic vandalism in the digital commons
|
24 pages, 4 figures, 1 table.The Cartographic Journal, 2014
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article addresses the emergent phenomenon of carto-vandalism, the
intentional defacement of collaborative cartographic digital artefacts in the
context of volunteered geographic information. Through a qualitative analysis
of reported incidents in WikiMapia and OpenStreetMap, a typology of this kind
of vandalism is outlined, including play, ideological, fantasy, artistic, and
industrial carto-vandalism, as well as carto-spam. Two families of
counter-strategies deployed in amateur mapping communities are discussed.
First, the contributors organise forms of policing, based on volunteered
community involvement, patrolling the maps and reporting incidents. Second, the
detection of carto-vandalism can be supported by automated tools, based either
on explicit rules or on machine learning.
|
[
{
"version": "v1",
"created": "Sun, 13 Apr 2014 02:57:51 GMT"
}
] | 2014-04-15T00:00:00 |
[
[
"Ballatore",
"Andrea",
""
]
] |
new_dataset
| 0.992954 |
1404.3707
|
Samir Lemes
|
Samir Lemes
|
Information Security Management of Web Portals Based on Joomla CMS
|
Proceedings of the 15th International Research/Expert Conference
"Trends in the Development of Machinery and Associated Technology" TMT 2011,
(S. Ekinovic, J. Vivancos, E. Tacer, editors), pp 509-512, ISSN 1840-4944,
Prague, Czech Republic, 12-18 September 2011
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information is the key asset of all organizations and can exist in many
forms. It can be printed or written on paper, stored electronically,
transmitted by mail or by electronic means, shown in films, or spoken in
conversation. In today's competitive business environment, such information is
constantly under threat from many sources, which can be internal, external,
accidental, or malicious. Joomla is a very popular Content Management System
(CMS) used for web page maintenance. This highly versatile software has found
itself in both large corporate web portals, and simple web pages such as blogs.
Such popularity increases its vulnerability to potential attacks and therefore
needs an appropriate security management. ISO (the International Organization
for Standardization) and IEC (the International Electrotechnical Commission)
created the series of standards aimed at providing a model for establishing,
implementing, operating, monitoring, reviewing, maintaining and improving an
Information Security Management System (ISMS). This paper shows how principles
set in ISO/IEC 27000 series of standards can be used to improve security of
Joomla based web portals.
|
[
{
"version": "v1",
"created": "Mon, 14 Apr 2014 19:31:53 GMT"
}
] | 2014-04-15T00:00:00 |
[
[
"Lemes",
"Samir",
""
]
] |
new_dataset
| 0.976229 |
cs/0606103
|
Chengpu Wang
|
Chengpu Wang
|
Precision Arithmetic: A New Floating-Point Arithmetic
|
54 Pages, 32 Figures
| null | null | null |
cs.DM cs.DS cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new deterministic floating-point arithmetic called precision arithmetic is
developed to track precision for arithmetic calculations. It uses a novel
rounding scheme to avoid excessive rounding error propagation of conventional
floating-point arithmetic. Unlike interval arithmetic, its uncertainty tracking
is based on statistics and the central limit theorem, with a much tighter
bounding range. Its stable rounding error distribution is approximated by a
truncated normal distribution. Generic standards and systematic methods for
validating uncertainty-bearing arithmetics are discussed. The precision
arithmetic is found to be better than interval arithmetic in both
uncertainty-tracking and uncertainty-bounding for normal usages.
The precision arithmetic is available publicly at
http://precisionarithm.sourceforge.net.
|
[
{
"version": "v1",
"created": "Sun, 25 Jun 2006 18:56:28 GMT"
},
{
"version": "v10",
"created": "Wed, 13 Oct 2010 02:39:44 GMT"
},
{
"version": "v11",
"created": "Sat, 30 Oct 2010 03:49:06 GMT"
},
{
"version": "v12",
"created": "Thu, 11 Nov 2010 20:25:56 GMT"
},
{
"version": "v13",
"created": "Mon, 6 Dec 2010 21:56:48 GMT"
},
{
"version": "v14",
"created": "Wed, 5 Jan 2011 04:43:49 GMT"
},
{
"version": "v15",
"created": "Mon, 21 Feb 2011 02:07:43 GMT"
},
{
"version": "v16",
"created": "Mon, 14 Mar 2011 20:40:47 GMT"
},
{
"version": "v17",
"created": "Tue, 26 Jul 2011 02:22:36 GMT"
},
{
"version": "v18",
"created": "Sat, 10 Dec 2011 19:13:43 GMT"
},
{
"version": "v19",
"created": "Wed, 12 Sep 2012 01:57:05 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Aug 2006 01:33:34 GMT"
},
{
"version": "v20",
"created": "Tue, 18 Mar 2014 04:17:22 GMT"
},
{
"version": "v21",
"created": "Thu, 3 Apr 2014 11:40:24 GMT"
},
{
"version": "v22",
"created": "Sat, 12 Apr 2014 02:02:06 GMT"
},
{
"version": "v3",
"created": "Wed, 19 May 2010 03:16:25 GMT"
},
{
"version": "v4",
"created": "Thu, 20 May 2010 21:42:30 GMT"
},
{
"version": "v5",
"created": "Fri, 9 Jul 2010 18:50:07 GMT"
},
{
"version": "v6",
"created": "Wed, 21 Jul 2010 02:26:26 GMT"
},
{
"version": "v7",
"created": "Sun, 25 Jul 2010 22:54:13 GMT"
},
{
"version": "v8",
"created": "Mon, 27 Sep 2010 15:35:14 GMT"
},
{
"version": "v9",
"created": "Wed, 6 Oct 2010 01:21:06 GMT"
}
] | 2014-04-15T00:00:00 |
[
[
"Wang",
"Chengpu",
""
]
] |
new_dataset
| 0.994166 |
1202.3625
|
Thomas B\"achler
|
Wilhelm Plesken, Thomas B\"achler
|
From Linear Codes to Hyperplane Arrangements via Thomas Decomposition
|
This has been rejected since it contains some mistakes. A similar
work has been publish in Documenta Math. vol. 19
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish a connection between linear codes and hyperplane arrangements
using the Thomas decomposition of polynomial systems and the resulting counting
polynomial. This yields both a generalization and a refinement of the weight
enumerator of a linear code. In particular, one can deal with infinitely many
finite fields simultaneously by defining a weight enumerator for codes over
infinite fields.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2012 15:38:00 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Apr 2014 15:20:18 GMT"
}
] | 2014-04-14T00:00:00 |
[
[
"Plesken",
"Wilhelm",
""
],
[
"Bächler",
"Thomas",
""
]
] |
new_dataset
| 0.998739 |
1404.2946
|
Timotheos Aslanidis
|
Timotheos Aslanidis and Marios-Evangelos Kogias
|
Algorithms for Packet Routing in Switching Networks with Reconfiguration
Overhead
|
7 pages, 2 figures, CCNET 2014 Conference
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Given a set of messages to be transmitted in packages from a set of sending
stations to a set of receiving stations, we are required to schedule the
packages so as to achieve the minimum possible time from the moment the 1st
transmission initiates to the concluding of the last. Preempting packets in
order to reroute message remains, as part of some other packet to be
transmitted at a later time would be a great means to achieve our goal, if not
for the fact that each preemption will come with a reconfiguration cost that
will delay our entire effort. The problem has been extensively studied in the
past and various algorithms have been proposed to handle many variations of the
problem. In this paper we propose an improved algorithm that we call the
Split-Graph Algorithm (SGA). To establish its efficiency we compare it, to two
of the algorithms developed in the past. These two are the best presented in
bibliography so far, one in terms of approximation ratio and one in terms of
experimental results.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 20:41:18 GMT"
}
] | 2014-04-14T00:00:00 |
[
[
"Aslanidis",
"Timotheos",
""
],
[
"Kogias",
"Marios-Evangelos",
""
]
] |
new_dataset
| 0.980159 |
1404.3001
|
Runxin Wang
|
Runxin Wang, Rongke Liu, Yi Hou
|
Joint Successive Cancellation Decoding of Polar Codes over Intersymbol
Interference Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are a class of capacity-achieving codes for the binary-input
discrete memoryless channels (B-DMCs). However, when applied in channels with
intersymbol interference (ISI), the codes may perform poorly with BCJR
equalization and conventional decoding methods. To deal with the ISI problem,
in this paper a new joint successive cancellation (SC) decoding algorithm is
proposed for polar codes in ISI channels, which combines the equalization and
conventional decoding. The initialization information of the decoding method is
the likelihood functions of ISI codeword symbols rather than the codeword
symbols. The decoding adopts recursion formulas like conventional SC decoding
and is without iterations. This is in contrast to the conventional iterative
algorithm which performs iterations between the equalizer and decoder. In
addition, the proposed SC trellis decoding can be easily extended to list
decoding which can further improve the performance. Simulation shows that the
proposed scheme significantly outperforms the conventional decoding schemes in
ISI channels.
|
[
{
"version": "v1",
"created": "Fri, 11 Apr 2014 04:53:16 GMT"
}
] | 2014-04-14T00:00:00 |
[
[
"Wang",
"Runxin",
""
],
[
"Liu",
"Rongke",
""
],
[
"Hou",
"Yi",
""
]
] |
new_dataset
| 0.996207 |
1404.3162
|
Harald Kr\"oll
|
Harald Kr\"oll, Stefan Zwicky, Reto Odermatt, Lukas Bruderer, Andreas
Burg, Qiuting Huang
|
A Signal Processor for Gaussian Message Passing
|
accepted to the IEEE IEEE International Symposium on Circuits and
Systems (ISCAS) 2014
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel signal processing unit built upon the
theory of factor graphs, which is able to address a wide range of signal
processing algorithms. More specifically, the demonstrated factor graph
processor (FGP) is tailored to Gaussian message passing algorithms. We show how
to use a highly configurable systolic array to solve the message update
equations of nodes in a factor graph efficiently. A proper instruction set and
compilation procedure is presented. In a recursive least squares channel
estimation example we show that the FGP can compute a message update faster
than a state-ofthe- art DSP. The results demonstrate the usabilty of the FGP
architecture as a flexible HW accelerator for signal-processing and
communication systems.
|
[
{
"version": "v1",
"created": "Fri, 11 Apr 2014 17:28:54 GMT"
}
] | 2014-04-14T00:00:00 |
[
[
"Kröll",
"Harald",
""
],
[
"Zwicky",
"Stefan",
""
],
[
"Odermatt",
"Reto",
""
],
[
"Bruderer",
"Lukas",
""
],
[
"Burg",
"Andreas",
""
],
[
"Huang",
"Qiuting",
""
]
] |
new_dataset
| 0.960588 |
1205.2548
|
Bartosz Walczak
|
Kolja Knauer, Piotr Micek, Bartosz Walczak
|
Outerplanar graph drawings with few slopes
|
Major revision of the whole paper
|
Comput.Geom. 47 (2014) 614-624
|
10.1016/j.comgeo.2014.01.003
| null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider straight-line outerplanar drawings of outerplanar graphs in which
a small number of distinct edge slopes are used, that is, the segments
representing edges are parallel to a small number of directions. We prove that
$\Delta-1$ edge slopes suffice for every outerplanar graph with maximum degree
$\Delta\ge 4$. This improves on the previous bound of $O(\Delta^5)$, which was
shown for planar partial 3-trees, a superclass of outerplanar graphs. The bound
is tight: for every $\Delta\ge 4$ there is an outerplanar graph with maximum
degree $\Delta$ that requires at least $\Delta-1$ distinct edge slopes in an
outerplanar straight-line drawing.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2012 15:07:51 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Apr 2014 07:35:04 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Knauer",
"Kolja",
""
],
[
"Micek",
"Piotr",
""
],
[
"Walczak",
"Bartosz",
""
]
] |
new_dataset
| 0.999769 |
1403.0017
|
Zoran Majkic
|
Zoran Majkic
|
Intensional RDB Manifesto: a Unifying NewSQL Model for Flexible Big Data
|
29 pages. arXiv admin note: text overlap with arXiv:1103.0967,
arXiv:1103.0680
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a new family of Intensional RDBs (IRDBs) which
extends the traditional RDBs with the Big Data and flexible and 'Open schema'
features, able to preserve the user-defined relational database schemas and all
preexisting user's applications containing the SQL statements for a deployment
of such a relational data. The standard RDB data is parsed into an internal
vector key/value relation, so that we obtain a column representation of data
used in Big Data applications, covering the key/value and column-based Big Data
applications as well, into a unifying RDB framework. We define a query
rewriting algorithm, based on the GAV Data Integration methods, so that each
user-defined SQL query is rewritten into a SQL query over this vector relation,
and hence the user-defined standard RDB schema is maintained as an empty global
schema for the RDB schema modeling of data and as the SQL interface to stored
vector relation. Such an IRDB architecture is adequate for the massive
migrations from the existing slow RDBMSs into this new family of fast IRDBMSs
by offering a Big Data and new flexible schema features as well.
|
[
{
"version": "v1",
"created": "Fri, 28 Feb 2014 21:48:30 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Apr 2014 18:52:29 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Majkic",
"Zoran",
""
]
] |
new_dataset
| 0.991983 |
1403.6089
|
Zoran Majkic
|
Zoran Majkic
|
Intensional RDB for Big Data Interoperability
|
30 pages, 3 figures. arXiv admin note: substantial text overlap with
arXiv:1103.0967, arXiv:1403.0017
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new family of Intensional RDBs (IRDBs), introduced in [1], extends the
traditional RDBs with the Big Data and flexible and 'Open schema' features,
able to preserve the user-defined relational database schemas and all
preexisting user's applications containing the SQL statements for a deployment
of such a relational data. The standard RDB data is parsed into an internal
vector key/value relation, so that we obtain a column representation of data
used in Big Data applications, covering the key/value and column-based Big Data
applications as well, into a unifying RDB framework. Such an IRDB architecture
is adequate for the massive migrations from the existing slow RDBMSs into this
new family of fast IRDBMSs by offering a Big Data and new flexible schema
features as well. Here we present the interoperability features of the IRDBs by
permitting the queries also over the internal vector relations created by
parsing of each federated database in a given Multidatabase system. We show
that the SchemaLog with the second-order syntax and ad hoc Logic Programming
and its querying fragment can be embedded into the standard SQL IRDBMSs, so
that we obtain a full interoperabilty features of IRDBs by using only the
standard relational SQL for querying both data and meta-data.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 19:15:37 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Apr 2014 19:00:09 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Majkic",
"Zoran",
""
]
] |
new_dataset
| 0.980649 |
1404.2656
|
Muhammad Nazmul Islam
|
Muhammad Nazmul Islam, Ashwin Sampath, Atul Maharshi, Ozge Koymen,
Narayan B. Mandayam
|
Wireless Backhaul Node Placement for Small Cell Networks
|
Invited paper at Conference on Information Science & Systems (CISS)
2014
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Small cells have been proposed as a vehicle for wireless networks to keep up
with surging demand. Small cells come with a significant challenge of providing
backhaul to transport data to(from) a gateway node in the core network. Fiber
based backhaul offers the high rates needed to meet this requirement, but is
costly and time-consuming to deploy, when not readily available. Wireless
backhaul is an attractive option for small cells as it provides a less
expensive and easy-to-deploy alternative to fiber. However, there are multitude
of bands and features (e.g. LOS/NLOS, spatial multiplexing etc.) associated
with wireless backhaul that need to be used intelligently for small cells.
Candidate bands include: sub-6 GHz band that is useful in non-line-of-sight
(NLOS) scenarios, microwave band (6-42 GHz) that is useful in point-to-point
line-of-sight (LOS) scenarios, and millimeter wave bands (e.g. 60, 70 and 80
GHz) that are recently being commercially used in LOS scenarios. In many
deployment topologies, it is advantageous to use aggregator nodes, located at
the roof tops of tall buildings near small cells. These nodes can provide high
data rate to multiple small cells in NLOS paths, sustain the same data rate to
gateway nodes using LOS paths and take advantage of all available bands. This
work performs the joint cost optimal aggregator node placement, power
allocation, channel scheduling and routing to optimize the wireless backhaul
network. We formulate mixed integer nonlinear programs (MINLP) to capture the
different interference and multiplexing patterns at sub-6 GHz and microwave
band. We solve the MINLP through linear relaxation and branch-and-bound
algorithm and apply our algorithm in an example wireless backhaul network of
downtown Manhattan.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 00:31:44 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Islam",
"Muhammad Nazmul",
""
],
[
"Sampath",
"Ashwin",
""
],
[
"Maharshi",
"Atul",
""
],
[
"Koymen",
"Ozge",
""
],
[
"Mandayam",
"Narayan B.",
""
]
] |
new_dataset
| 0.98954 |
1404.2796
|
Vitaly Skachek
|
Helger Lipmaa and Vitaly Skachek
|
Linear Batch Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an application, where a client wants to obtain many elements from a large
database, it is often desirable to have some load balancing. Batch codes
(introduced by Ishai et al. in STOC 2004) make it possible to do exactly that:
the large database is divided between many servers, so that the client has to
only make a small number of queries to every server to obtain sufficient
information to reconstruct all desired elements. Other important parameters of
the batch codes are total storage and the number of servers. Batch codes also
have applications in cryptography (namely, in the construction of multi-query
computationally-private information retrieval protocols).
In this work, we initiate the study of linear batch codes. These codes, in
particular, are of potential use in distributed storage systems. We show that a
generator matrix of a binary linear batch code is also a generator matrix of
classical binary linear error-correcting code. This immediately yields that a
variety of upper bounds, which were developed for error-correcting codes, are
applicable also to binary linear batch codes. We also propose new methods to
construct large linear batch codes from the smaller ones.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 13:28:09 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Lipmaa",
"Helger",
""
],
[
"Skachek",
"Vitaly",
""
]
] |
new_dataset
| 0.999523 |
1404.2816
|
Marina Maslennikova
|
Marina Maslennikova
|
Reset Complexity of Ideal Languages
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new characteristic of a regular ideal language called reset
complexity. We find some bounds on the reset complexity in terms of the state
complexity of a given language. We also compare the reset complexity and the
state complexity for languages related to slowly synchronizing automata and
study uniqueness question for automata yielding the minimum of reset
complexity.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 14:08:18 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Maslennikova",
"Marina",
""
]
] |
new_dataset
| 0.983984 |
1404.2863
|
Daniel Moskovich
|
Avishy Y. Carmi and Daniel Moskovich
|
Tangle Machines II: Invariants
|
26 pages, 30 figures
| null | null | null |
cs.IT cs.SY math.GT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The preceding paper constructed tangle machines as diagrammatic models, and
illustrated their utility with a number of examples. The information content of
a tangle machine is contained in characteristic quantities associated to
equivalence classes of tangle machines, which are called invariants. This paper
constructs invariants of tangle machines. Chief among these are the prime
factorizations of a machine, which are essentially unique. This is proven using
low dimensional topology, through representing a colour-suppressed machine as a
diagram for a network of jointly embedded spheres and intervals in 4-space. The
complexity of a tangle machine is defined as its number of prime factors.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 16:07:57 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Carmi",
"Avishy Y.",
""
],
[
"Moskovich",
"Daniel",
""
]
] |
new_dataset
| 0.996998 |
1404.2889
|
Fekri Abduljalil Dr.
|
Fekri M. Abduljalil
|
A Novel Real-Time Video and Data Capture of Vehicular Accident in
Intelligent Transportation Systems
| null | null |
10.5121/ijcnc.2014.6205
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel real-time video and data capture of vehicle accident
is proposed in Intelligent Transportation System (ITS). The proposed scheme
solves the problem of huge storage needed for recording vehicle accident in the
smart vehicle and in the remote ITS server. It works efficiently with small
amount of storage size and guarantee saving accident video in secondary
storage. It enables user to capture real-time video and data of running
vehicle. It enables user to get vehicle accident video and data anytime
anywhere. The scheme is implemented using testbed and its performance is
evaluated. The results show that the proposed scheme guarantees record the
vehicle accident in the ITS server. The proposed scheme has better results in
comparison with full time video recording scheme.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 17:49:51 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Abduljalil",
"Fekri M.",
""
]
] |
new_dataset
| 0.999 |
1404.2921
|
Martin Reisslein
|
Xing Wei, Frank Aurzada, Michael P. McGarry, and Martin Reisslein
|
DyCaPPON: Dynamic Circuit and Packet Passive Optical Network (Extended
Version)
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic circuits are well suited for applications that require predictable
service with a constant bit rate for a prescribed period of time, such as cloud
computing and e-science applications. Past research on upstream transmission in
passive optical networks (PONs) has mainly considered packet-switched traffic
and has focused on optimizing packet-level performance metrics, such as
reducing mean delay. This study proposes and evaluates a dynamic circuit and
packet PON (DyCaPPON) that provides dynamic circuits along with packet-switched
service. DyCaPPON provides $(i)$ flexible packet-switched service through
dynamic bandwidth allocation in periodic polling cycles, and $(ii)$ consistent
circuit service by allocating each active circuit a fixed-duration upstream
transmission window during each fixed-duration polling cycle. We analyze
circuit-level performance metrics, including the blocking probability of
dynamic circuit requests in DyCaPPON through a stochastic knapsack-based
analysis. Through this analysis we also determine the bandwidth occupied by
admitted circuits. The remaining bandwidth is available for packet traffic and
we conduct an approximate analysis of the resulting mean delay of packet
traffic. Through extensive numerical evaluations and verifying simulations we
demonstrate the circuit blocking and packet delay trade-offs in DyCaPPON.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 19:52:57 GMT"
}
] | 2014-04-11T00:00:00 |
[
[
"Wei",
"Xing",
""
],
[
"Aurzada",
"Frank",
""
],
[
"McGarry",
"Michael P.",
""
],
[
"Reisslein",
"Martin",
""
]
] |
new_dataset
| 0.998605 |
1403.4060
|
Fernando Hernando
|
Carlos Galindo and Fernando Hernando
|
Quantum codes from affine variety codes and their subfield-subcodes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use affine variety codes and their subfield-subcodes for obtaining quantum
stabilizer codes via the CSS code construction. With this procedure, we get
codes with good parameters and a code whose parameters exceed the CSS quantum
Gilbert-Varshamov bound given by Feng and Ma.
|
[
{
"version": "v1",
"created": "Mon, 17 Mar 2014 10:50:29 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Apr 2014 08:37:54 GMT"
}
] | 2014-04-10T00:00:00 |
[
[
"Galindo",
"Carlos",
""
],
[
"Hernando",
"Fernando",
""
]
] |
new_dataset
| 0.99974 |
1404.2347
|
Timur Mirzoev
|
Dr. Timur Mirzoev
|
Automation Security
| null |
Proceedings of the Second International Seminar, Saint Petersburg
State University of Aerospace Instrumentation. January 2007
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web-based Automated Process Control systems are a new type of applications
that use the Internet to control industrial processes with the access to the
real-time data. Supervisory control and data acquisition (SCADA) networks
contain computers and applications that perform key functions in providing
essential services and commodities (e.g., electricity, natural gas, gasoline,
water, waste treatment, transportation) to all Americans. As such, they are
part of the nation s critical infrastructure and require protection from a
variety of threats that exist in cyber space today.
|
[
{
"version": "v1",
"created": "Wed, 9 Apr 2014 01:41:35 GMT"
}
] | 2014-04-10T00:00:00 |
[
[
"Mirzoev",
"Dr. Timur",
""
]
] |
new_dataset
| 0.992145 |
1404.2348
|
Xiaojun Feng
|
Xiaojun Feng, Peng Lin, Qian Zhang
|
FlexAuc: Serving Dynamic Demands in a Spectrum Trading Market with
Flexible Auction
|
11 pages, 7 figures, Preliminary version accepted in INFOCOM 2014
| null | null | null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In secondary spectrum trading markets, auctions are widely used by spectrum
holders (SHs) to redistribute their unused channels to secondary wireless
service providers (WSPs). As sellers, the SHs design proper auction schemes to
stimulate more participants and maximize the revenue from the auction. As
buyers, the WSPs determine the bidding strategies in the auction to better
serve their end users.
In this paper, we consider a three-layered spectrum trading market consisting
of the SH, the WSPs and the end users. We jointly study the strategies of the
three parties. The SH determines the auction scheme and spectrum supplies to
optimize its revenue. The WSPs have flexible bidding strategies in terms of
both demands and valuations considering the strategies of the end users. We
design FlexAuc, a novel auction mechanism for this market to enable dynamic
supplies and demands in the auction. We prove theoretically that FlexAuc not
only maximizes the social welfare but also preserves other nice properties such
as truthfulness and computational tractability.
|
[
{
"version": "v1",
"created": "Wed, 9 Apr 2014 01:44:58 GMT"
}
] | 2014-04-10T00:00:00 |
[
[
"Feng",
"Xiaojun",
""
],
[
"Lin",
"Peng",
""
],
[
"Zhang",
"Qian",
""
]
] |
new_dataset
| 0.99938 |
1404.2364
|
Rashmi Jain
|
Dr Manju Kaushik and Rashmi Jain
|
Gesture Based Interaction NUI: An Overview
|
4 pages."Published with International Journal of Engineering Trends
and Technology (IJETT)"
|
International Journal of Engineering Trends and Technology (IJETT)
9(12), March 2014. Published by Seventh Sense Research Group
|
10.14445/22315381/IJETT-V9P319
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Touch,face,voice recognition and movement sensors all are part of an emerging
field of computing often called natural user interface, or NUI. Interacting
with technology in these humanistic ways is no longer limited to high tech
secret agents. Gesture Touch, face, voice recognition and movement sensors all
are part of an emerging field of computing often called natural user interface,
or NUI. Interacting with technology in these humanistic ways is no longer
limited to high tech secret agents. Gesture recognition is the process by which
gestures formed by a user are made known to the system. In completely immersive
VR environments, the keyboard is generally not included, Technology
incorporates face, voice, gesture, and object recognition to give users a
variety of ways to interact with the console, all without needing a controller.
This paper focuses on the emerging way of human computer interaction, Gesture
recognition concept and gesture types.
|
[
{
"version": "v1",
"created": "Wed, 9 Apr 2014 04:43:27 GMT"
}
] | 2014-04-10T00:00:00 |
[
[
"Kaushik",
"Dr Manju",
""
],
[
"Jain",
"Rashmi",
""
]
] |
new_dataset
| 0.998537 |
1404.2584
|
Selma Belhadj Amor
|
Selma Belhadj Amor, Yossef Steinberg, and Mich\`ele Wigger
|
MIMO MAC-BC Duality with Linear-Feedback Coding Schemes
|
submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that for the multi-antenna Gaussian multi-access channel (MAC) and
broadcast channel (BC) with perfect feedback, the rate regions achieved by
linear-feedback coding schemes (called linear-feedback capacity regions)
coincide when the same total input-power constraint is imposed on both channels
and when the MAC channel matrices are the transposes of the BC channel
matrices. Such a pair of MAC and BC is called dual. We also identify
sub-classes of linear-feedback coding schemes that achieve the linear-feedback
capacity regions of these two channels and present multi-letter expressions for
the linear-feedback capacity regions. Moreover, within the two sub-classes of
coding schemes that achieve the linear-feedback capacity regions for a given
MAC and its dual BC, we identify for each MAC scheme a BC scheme and for each
BC scheme a MAC scheme so that the two schemes have same total input power and
achieve the same rate regions.
|
[
{
"version": "v1",
"created": "Wed, 9 Apr 2014 19:28:24 GMT"
}
] | 2014-04-10T00:00:00 |
[
[
"Amor",
"Selma Belhadj",
""
],
[
"Steinberg",
"Yossef",
""
],
[
"Wigger",
"Michèle",
""
]
] |
new_dataset
| 0.999529 |
1404.1911
|
Bahador Saket
|
Bahador Saket, Paolo Simonetto, Stephen Kobourov and Katy Borner
|
Node, Node-Link, and Node-Link-Group Diagrams: An Evaluation
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Effectively showing the relationships between objects in a dataset is one of
the main tasks in information visualization. Typically there is a well-defined
notion of distance between pairs of objects, and traditional approaches such as
principal component analysis or multi-dimensional scaling are used to place the
objects as points in 2D space, so that similar objects are close to each other.
In another typical setting, the dataset is visualized as a network graph, where
related nodes are connected by links. More recently, datasets are also
visualized as maps, where in addition to nodes and links, there is an explicit
representation of groups and clusters. We consider these three Techniques,
characterized by a progressive increase of the amount of encoded information:
node diagrams, node-link diagrams and node-link-group diagrams. We assess these
three types of diagrams with a controlled experiment that covers nine different
tasks falling broadly in three categories: node-based tasks, network-based
tasks and group-based tasks. Our findings indicate that adding links, or links
and group representations, does not negatively impact performance (time and
accuracy) of node-based tasks. Similarly, adding group representations does not
negatively impact the performance of network-based tasks. Node-link-group
diagrams outperform the others on group-based tasks. These conclusions
contradict results in other studies, in similar but subtly different settings.
Taken together, however, such results can have significant implications for the
design of standard and domain specific visualizations tools.
|
[
{
"version": "v1",
"created": "Mon, 7 Apr 2014 20:01:40 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Saket",
"Bahador",
""
],
[
"Simonetto",
"Paolo",
""
],
[
"Kobourov",
"Stephen",
""
],
[
"Borner",
"Katy",
""
]
] |
new_dataset
| 0.99503 |
1404.1981
|
Rodrigo de Lamare
|
A. G. D. Uchoa, C. T. Healy, R. C. de Lamare, and P. Li
|
Iterative Detection and LDPC Decoding Algorithms for MIMO Systems in
Block-Fading Channels
|
10 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an Iterative Detection and Decoding (IDD) scheme with Low Density
Parity Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems for
block-fading $F = 2$ and fast fading Rayleigh channels. An IDD receiver with
soft information processing that exploits the code structure and the behaviour
of the log likelihood ratios (LLR)'s is developed. Minimum Mean Square Error
(MMSE) with Successive Interference Cancellation (SIC) and with Parallel
Interference Cancellation (PIC) schemes are considered. The soft \textit{a
posteriori} output of the decoder in a block-fading channel with Root-Check
LDPC codes has allowed us to create a new strategy to improve the Bit Error
Rate (BER) of a MIMO IDD scheme. Our proposed strategy in some scenarios has
resulted in up to 3dB of gain in terms of BER for block-fading channels and up
to 1dB in fast fading channels.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 01:19:00 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Uchoa",
"A. G. D.",
""
],
[
"Healy",
"C. T.",
""
],
[
"de Lamare",
"R. C.",
""
],
[
"Li",
"P.",
""
]
] |
new_dataset
| 0.974562 |
1404.2116
|
Tshilidzi Marwala
|
Tshilidzi Marwala
|
Rational Counterfactuals
|
To appear in Artificial Intelligence for Rational Decision Making
(Springer-Verlag)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the concept of rational countefactuals which is an idea
of identifying a counterfactual from the factual (whether perceived or real)
that maximizes the attainment of the desired consequent. In counterfactual
thinking if we have a factual statement like: Saddam Hussein invaded Kuwait and
consequently George Bush declared war on Iraq then its counterfactuals is: If
Saddam Hussein did not invade Kuwait then George Bush would not have declared
war on Iraq. The theory of rational counterfactuals is applied to identify the
antecedent that gives the desired consequent necessary for rational decision
making. The rational countefactual theory is applied to identify the values of
variables Allies, Contingency, Distance, Major Power, Capability, Democracy, as
well as Economic Interdependency that gives the desired consequent Peace.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 13:15:06 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Marwala",
"Tshilidzi",
""
]
] |
new_dataset
| 0.998129 |
1404.2153
|
Timur Mirzoev
|
Timur Mirzoev, Gerard Gingo, Mike Stawchansky, Tracy White
|
Apple IOS Devices for Network Administrators
| null |
World of Computer Science and Information Technology Journal
(WCSIT)ISSN: 2221-0741 Vol. 3, No. 6, 114-119, 2013
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As tablet devices continue to gain market share at the expense of the
traditional PC, they become a more integral part of the corporate landscape.
Tablets are no longer being utilized only by sales executives for presentation
purposes, or as addition to the traditional laptop. Users are attempting to
perform significant amounts of their daily work on tablet devices, some even
abandoning the ubiquitous laptop or desktop entirely. Operating exclusively
from a tablet device, specifically Apple IOS tablet devices creates unique
challenges in a corporate environment traditionally dominated by Microsoft
Windows operating systems. Interactions with file shares, presentation media,
VPN, and remote access present barriers that users and helpdesk support are
unfamiliar with in a relation to an iPad or iPhone. Many solutions are being
offered to these challenges some of which are analyzed by this manuscript.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 14:35:06 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Mirzoev",
"Timur",
""
],
[
"Gingo",
"Gerard",
""
],
[
"Stawchansky",
"Mike",
""
],
[
"White",
"Tracy",
""
]
] |
new_dataset
| 0.999807 |
1404.2187
|
Ernie Cohen
|
Ernie Cohen
|
Coherent Causal Memory
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coherent causal memory (CCM) is causal memory in which prefixes of an
execution can be mapped to global memory states in a consistent way. While CCM
requires conflicting pairs of writes to be globally ordered, it allows writes
to remain unordered with respect to both reads and nonconflicting writes.
Nevertheless, it supports assertional, state-based program reasoning using
generalized Owicki-Gries proof outlines (where assertions can be attached to
any causal program edge). Indeed, we show that from a reasoning standpoint, CCM
differs from sequentially consistent (SC) memory only in that ghost code added
by the user is not allowed to introduce new write-write races.
While CCM provides most of the formal reasoning leverage of SC memory, it is
much more efficiently implemented. As an illustration, we describe a simple
programming discipline that provides CCM on top of x86-TSO. The discipline is
considerably more relaxed than the one needed to ensure SC; for example, it
introduces no burden whatsoever for programs in which at most one thread writes
to any variable.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2014 22:58:50 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Cohen",
"Ernie",
""
]
] |
new_dataset
| 0.969811 |
1404.2237
|
Lukasz Swierczewski
|
Monika Kwiatkowska, Lukasz Swierczewski
|
Steganography - coding and intercepting the information from encoded
pictures in the absence of any initial information
|
10 pages, 5 figures, 5 tables, LVEE 2014 Conference Proceedings
| null | null | null |
cs.MM cs.CR cs.DC
|
http://creativecommons.org/licenses/by/3.0/
|
The work includes implementation and extraction algorithms capabilities test,
without any additional data (starting position, the number of bits used, gap
between the amount of data encoded) information from encoded files (mostly
images). The software is written using OpenMP standard [1], which allowed them
to run on parallel computers. Performance tests were carried out on computers,
Blue Gene/P [2], Blue Gene/Q [3] and the system consisting of four AMD Opteron
6272 [4]. Source code is available under GNU GPL v3 license and are available
in a repository OLib [5].
|
[
{
"version": "v1",
"created": "Sun, 2 Feb 2014 17:09:56 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Kwiatkowska",
"Monika",
""
],
[
"Swierczewski",
"Lukasz",
""
]
] |
new_dataset
| 0.982111 |
1404.2259
|
Taylor T Johnson
|
Luan Viet Nguyen and Taylor T. Johnson
|
Virtual Prototyping and Distributed Control for Solar Array with
Distributed Multilevel Inverter
|
Preprint draft under review, submitted on March 18, 2014 to IEEE
Transactions on Energy Conversion, Special Issue: Advanced Distributed
Control of Energy Conversion Devices and Systems
| null | null | null |
cs.DC cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present the virtual prototyping of a solar array with a
grid-tie implemented as a distributed inverter and controlled using distributed
algorithms. Due to the distributed control and inherent redundancy in the array
composed of many panels and inverter modules, the virtual prototype exhibits
fault-tolerance capabilities. The distributed identifier algorithm allows the
system to keep track of the number of operating panels to appropriately
regulate the DC voltage output of the panels using buck-boost converters, and
determine appropriate switching times for H-bridges in the grid-tie. We
evaluate the distributed inverter, its control strategy, and fault-tolerance
through simulation in Simulink/Stateflow. Our virtual prototyping framework
allows for generating arrays and grid-ties consisting of many panels, and we
evaluate arrays of five to dozens of panels. Our analysis suggests the
achievable total harmonic distortion (THD) of the system may allow for
operating the array in spite of failures of the power electronics, control
software, and other subcomponents.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 19:40:47 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Nguyen",
"Luan Viet",
""
],
[
"Johnson",
"Taylor T.",
""
]
] |
new_dataset
| 0.996198 |
1404.2261
|
Mehran Alidoost Nia
|
Mehran Alidoost Nia, Aida Ghorbani and Reza Ebrahimi Atani
|
A Novel Anonymous Cloud Architecture Design; Providing Secure Online
Services and Electronic Payments
|
in proceeding of the first international conference on Electronic
Commerce and Economy, Tehran, April 2013
| null | null | null |
cs.CR cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anonymous cloud architecture provides secure environment for business and
also e-commerce approaches. By using this type of architecture, we can propose
anonymous online applications. Customers who need secure and reliable online
services should pay for provided services. A big problem is electronic payment
that is needed for billing customers. But customer identity should be remained
anonymous during and also after payment procedure. In this paper we propose a
novel and modified anonymous architecture that ensures customers that hide
their identity from others. This architecture is used from common network
protocols and we eliminate Tor anonymous service from architecture design space
because of independency. The here is introduced scalability parameter in
anonymous cloud architecture design space. After all we compare proposed
architecture with other popular cloud architectures in this range and we obtain
its advantages according to efficiency, security and anonymity.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 19:49:02 GMT"
}
] | 2014-04-09T00:00:00 |
[
[
"Nia",
"Mehran Alidoost",
""
],
[
"Ghorbani",
"Aida",
""
],
[
"Atani",
"Reza Ebrahimi",
""
]
] |
new_dataset
| 0.999463 |
1112.2993
|
Steven Heilman
|
Steven Heilman, Aukosh Jagannath, Assaf Naor
|
Solution of the propeller conjecture in $\mathbb{R}^3$
| null |
Discrete & Computational Geometry. 50 (2013), no. 2, 263-305
| null | null |
cs.CC math.FA math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that every measurable partition ${A_1,..., A_k}$ of
$\mathbb{R}^3$ satisfies $$\sum_{i=1}^k||\int_{A_i}
xe^{-\frac12||x||_2^2}dx||_2^2\le 9\pi^2.\qquad(*)$$ Let ${P_1,P_2,P_3}$ be the
partition of $\mathbb{R}^2$ into $120^\circ$ sectors centered at the origin.
The bound is sharp, with equality holding if $A_i=P_i\times \mathbb{R}$ for
$i\in {1,2,3}$ and $A_i=\emptyset$ for $i\in \{4,...,k\}$ (up to measure zero
corrections, orthogonal transformations and renumbering of the sets
$\{A_1,...,A_k\}$). This settles positively the 3-dimensional Propeller
Conjecture of Khot and Naor (FOCS 2008). The proof of reduces the problem to a
finite set of numerical inequalities which are then verified with full rigor in
a computer-assisted fashion. The main consequence (and motivation) of $(*)$ is
complexity-theoretic: the Unique Games hardness threshold of the Kernel
Clustering problem with $4 \times 4$ centered and spherical hypothesis matrix
equals $\frac{2\pi}{3}$.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2011 18:27:03 GMT"
},
{
"version": "v2",
"created": "Sun, 6 Apr 2014 02:38:44 GMT"
}
] | 2014-04-08T00:00:00 |
[
[
"Heilman",
"Steven",
""
],
[
"Jagannath",
"Aukosh",
""
],
[
"Naor",
"Assaf",
""
]
] |
new_dataset
| 0.988701 |
1312.1812
|
Kees Middelburg
|
J. A. Bergstra, C. A. Middelburg
|
Long multiplication by instruction sequences with backward jump
instructions
|
17 pages, the preliminaries are about the same as the preliminaries
in arXiv:1308.0219 [cs.PL] and arXiv:1312.1529 [cs.PL]; minor errors
corrected, references added; section on indirect addressing added
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For each function on bit strings, its restriction to bit strings of any given
length can be computed by a finite instruction sequence that contains only
instructions to set and get the content of Boolean registers, forward jump
instructions, and a termination instruction. Backward jump instructions are not
necessary for this, but instruction sequences can be significantly shorter with
them. We take the function on bit strings that models the multiplication of
natural numbers on their representation in the binary number system to
demonstrate this by means of a concrete example. The example is reason to
discuss points concerning the halting problem and the concept of an algorithm.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 09:41:06 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Dec 2013 12:47:24 GMT"
},
{
"version": "v3",
"created": "Sun, 6 Apr 2014 14:56:30 GMT"
}
] | 2014-04-08T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] |
new_dataset
| 0.981382 |
1404.1395
|
Sven Bugiel
|
Michael Backes, Sven Bugiel, Sebastian Gerling, Philipp von
Styp-Rekowsky
|
Android Security Framework: Enabling Generic and Extensible Access
Control on Android
| null | null | null |
A/01/2014
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Android Security Framework (ASF), a generic, extensible
security framework for Android that enables the development and integration of
a wide spectrum of security models in form of code-based security modules. The
design of ASF reflects lessons learned from the literature on established
security frameworks (such as Linux Security Modules or the BSD MAC Framework)
and intertwines them with the particular requirements and challenges from the
design of Android's software stack. ASF provides a novel security API that
supports authors of Android security extensions in developing their modules.
This overcomes the current unsatisfactory situation to provide security
solutions as separate patches to the Android software stack or to embed them
into Android's mainline codebase. As a result, ASF provides different practical
benefits such as a higher degree of acceptance, adaptation, and maintenance of
security solutions than previously possible on Android. We present a
prototypical implementation of ASF and demonstrate its effectiveness and
efficiency by modularizing different security models from related work, such as
context-aware access control, inlined reference monitoring, and type
enforcement.
|
[
{
"version": "v1",
"created": "Fri, 4 Apr 2014 21:11:18 GMT"
}
] | 2014-04-08T00:00:00 |
[
[
"Backes",
"Michael",
""
],
[
"Bugiel",
"Sven",
""
],
[
"Gerling",
"Sebastian",
""
],
[
"von Styp-Rekowsky",
"Philipp",
""
]
] |
new_dataset
| 0.986904 |
1404.1449
|
Hamidou Tembine
|
Hamidou Tembine
|
Non-Asymptotic Mean-Field Games
|
36 pages, 2 figures. Accepted and to appear in IEEE Transactions on
Systems, Man, and Cybernetics, Part B 2014
| null | null | null |
cs.GT cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mean-field games have been studied under the assumption of very large number
of players. For such large systems, the basic idea consists to approximate
large games by a stylized game model with a continuum of players. The approach
has been shown to be useful in some applications. However, the stylized game
model with continuum of decision-makers is rarely observed in practice and the
approximation proposed in the asymptotic regime is meaningless for networks
with few entities. In this paper we propose a mean-field framework that is
suitable not only for large systems but also for a small world with few number
of entities. The applicability of the proposed framework is illustrated through
various examples including dynamic auction with asymmetric valuation
distributions, and spiteful bidders.
|
[
{
"version": "v1",
"created": "Sat, 5 Apr 2014 09:11:05 GMT"
}
] | 2014-04-08T00:00:00 |
[
[
"Tembine",
"Hamidou",
""
]
] |
new_dataset
| 0.988819 |
1404.1511
|
Aske Plaat
|
Aske Plaat
|
MTD(f), A Minimax Algorithm Faster Than NegaScout
| null | null | null | null |
cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
MTD(f) is a new minimax search algorithm, simpler and more efficient than
previous algorithms. In tests with a number of tournament game playing programs
for chess, checkers and Othello it performed better, on average, than
NegaScout/PVS (the AlphaBeta variant used in practically all good chess,
checkers, and Othello programs). One of the strongest chess programs of the
moment, MIT's parallel chess program Cilkchess uses MTD(f) as its search
algorithm, replacing NegaScout, which was used in StarSocrates, the previous
version of the program.
|
[
{
"version": "v1",
"created": "Sat, 5 Apr 2014 19:51:05 GMT"
}
] | 2014-04-08T00:00:00 |
[
[
"Plaat",
"Aske",
""
]
] |
new_dataset
| 0.999124 |
1404.0743
|
Geoffrey Irving
|
Geoffrey Irving
|
Pentago is a First Player Win: Strongly Solving a Game Using Parallel
In-Core Retrograde Analysis
| null | null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by/3.0/
|
We present a strong solution of the board game pentago, computed using
exhaustive parallel retrograde analysis in 4 hours on 98304 ($3 \times 2^{15}$)
threads of NERSC's Cray Edison. At $3.0 \times 10^{15}$ states, pentago is the
largest divergent game solved to date by two orders of magnitude, and the only
example of a nontrivial divergent game solved using retrograde analysis. Unlike
previous retrograde analyses, our computation was performed entirely in-core,
writing only a small portion of the results to disk; an out-of-core
implementation would have been much slower. Symmetry was used to reduce
branching factor and exploit instruction level parallelism. Despite a
theoretically embarrassingly parallel structure, asynchronous message passing
was required to fit the computation into available RAM, causing latency
problems on an older Cray machine. All code and data for the project are open
source, together with a website which combines database lookup and on-the-fly
computation to interactively explore the strong solution.
|
[
{
"version": "v1",
"created": "Thu, 3 Apr 2014 01:01:21 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Apr 2014 00:47:00 GMT"
}
] | 2014-04-07T00:00:00 |
[
[
"Irving",
"Geoffrey",
""
]
] |
new_dataset
| 0.996346 |
1404.1286
|
Ardavan Rahimian
|
Ardavan Rahimian
|
Steerable Antennas for Automotive Communication Systems
|
MEng Dissertation, School of EECE, University of Birmingham [Rohde &
Schwarz Technology Prize Winner]
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research project undertakes a comprehensive analysis of RF beamforming
techniques for design, simulation, fabrication, and measurement of Butler
Matrix and Rotman Lens beamforming networks. It is aimed to develop novel and
well-established designs for steerable antenna systems that can be used in
vehicular telematics and automotive communication systems based on microwave
and millimeter-wave techniques.
|
[
{
"version": "v1",
"created": "Thu, 3 Apr 2014 11:15:38 GMT"
}
] | 2014-04-07T00:00:00 |
[
[
"Rahimian",
"Ardavan",
""
]
] |
new_dataset
| 0.996808 |
1404.1338
|
Siarhei Charapitsa V.
|
Siarhei V. Charapitsa, Irina Ya. Dubovskaya, Alexander S. Lobko,
Tatiana A. Savitskaya, Svetlana N. Sytova
|
Structure of Belarusian educational and research web portal of nuclear
knowledge
|
11 pages, 1 figure, submitted to Nuclear Physics and Atomic Energy
| null | null | null |
cs.CY cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main objectives and instruments to develop Belarusian educational and
research web portal of nuclear knowledge are discussed. Draft structure of
portal is presented.
|
[
{
"version": "v1",
"created": "Fri, 4 Apr 2014 18:47:10 GMT"
}
] | 2014-04-07T00:00:00 |
[
[
"Charapitsa",
"Siarhei V.",
""
],
[
"Dubovskaya",
"Irina Ya.",
""
],
[
"Lobko",
"Alexander S.",
""
],
[
"Savitskaya",
"Tatiana A.",
""
],
[
"Sytova",
"Svetlana N.",
""
]
] |
new_dataset
| 0.963217 |
1105.2432
|
Krzysztof R. Apt
|
Krzysztof R. Apt, Guido Schaefer
|
Selfishness Level of Strategic Games
|
34 pages
|
Journal of AI Research (JAIR) 49 (2014), pp. 207-240,
doi:10.1613/jair.4164
| null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new measure of the discrepancy in strategic games between the
social welfare in a Nash equilibrium and in a social optimum, that we call
selfishness level. It is the smallest fraction of the social welfare that needs
to be offered to each player to achieve that a social optimum is realized in a
pure Nash equilibrium. The selfishness level is unrelated to the price of
stability and the price of anarchy and is invariant under positive linear
transformations of the payoff functions. Also, it naturally applies to other
solution concepts and other forms of games.
We study the selfishness level of several well-known strategic games. This
allows us to quantify the implicit tension within a game between players'
individual interests and the impact of their decisions on the society as a
whole. Our analyses reveal that the selfishness level often provides a deeper
understanding of the characteristics of the underlying game that influence the
players' willingness to cooperate.
In particular, the selfishness level of finite ordinal potential games is
finite, while that of weakly acyclic games can be infinite. We derive explicit
bounds on the selfishness level of fair cost sharing games and linear
congestion games, which depend on specific parameters of the underlying game
but are independent of the number of players. Further, we show that the
selfishness level of the $n$-players Prisoner's Dilemma is $c/(b(n-1)-c)$,
where $b$ and $c$ are the benefit and cost for cooperation, respectively, that
of the $n$-players public goods game is $(1-\frac{c}{n})/(c-1)$, where $c$ is
the public good multiplier, and that of the Traveler's Dilemma game is
$\frac{1}{2}(b-1)$, where $b$ is the bonus. Finally, the selfishness level of
Cournot competition (an example of an infinite ordinal potential game, Tragedy
of the Commons, and Bertrand competition is infinite.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2011 11:38:21 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Feb 2012 13:41:19 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Jun 2012 09:51:43 GMT"
},
{
"version": "v4",
"created": "Thu, 29 Nov 2012 13:17:41 GMT"
},
{
"version": "v5",
"created": "Mon, 8 Apr 2013 14:34:21 GMT"
},
{
"version": "v6",
"created": "Thu, 5 Dec 2013 12:51:17 GMT"
},
{
"version": "v7",
"created": "Thu, 3 Apr 2014 14:28:03 GMT"
}
] | 2014-04-04T00:00:00 |
[
[
"Apt",
"Krzysztof R.",
""
],
[
"Schaefer",
"Guido",
""
]
] |
new_dataset
| 0.997504 |
1308.2747
|
Andrew Duly
|
Andrew J. Duly, Taejoon Kim, David J. Love, James V. Krogmeier
|
Closed-Loop Beam Alignment for Massive MIMO Channel Estimation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Training sequences are designed to probe wireless channels in order to obtain
channel state information for block-fading channels. Optimal training sounds
the channel using orthogonal beamforming vectors to find an estimate that
optimizes some cost function, such as mean square error. As the number of
transmit antennas increases, however, the training overhead becomes
significant. This creates a need for alternative channel estimation schemes for
increasingly large transmit arrays. In this work, we relax the orthogonal
restriction on sounding vectors. The use of a feedback channel after each
forward channel use during training enables closed-loop sounding vector design.
A misalignment cost function is introduced, which provides a metric to
sequentially design sounding vectors. In turn, the structure of the sounding
vectors aligns the transmit beamformer with the true channel direction, thereby
increasing beamforming gain. This beam alignment scheme for massive MIMO is
shown to improve beamforming gain over conventional orthogonal training for a
MISO channel.
|
[
{
"version": "v1",
"created": "Tue, 13 Aug 2013 04:03:04 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Apr 2014 22:01:33 GMT"
}
] | 2014-04-04T00:00:00 |
[
[
"Duly",
"Andrew J.",
""
],
[
"Kim",
"Taejoon",
""
],
[
"Love",
"David J.",
""
],
[
"Krogmeier",
"James V.",
""
]
] |
new_dataset
| 0.97521 |
1404.0696
|
Spyros Sioutas SS
|
S. Sioutas, E. Sakkopoulos, A. Panaretos, D. Tsoumakos, P.
Gerolymatos, G. Tzimas and Y. Manolopoulos
|
D-P2P-Sim+:A Novel Distributed Framework for P2P Protocols Performance
Testing
|
51 pages, 37 figures, submitted to JSS (Elsevier)
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent IoT (Internet of Things) and Web 2.0 technologies, a critical
problem arises with respect to storing and processing the large amount of
collected data. In this paper we develop and evaluate distributed
infrastructures for storing and processing large amount of such data. We
present a distributed framework that supports customized deployment of a
variety of indexing engines over million-node overlays. The proposed framework
provides the appropriate integrated set of tools that allows applications
processing large amount of data, to evaluate and test the performance of
various application protocols for very large scale deployments (multi million
nodes - billions of keys). The key aim is to provide the appropriate
environment that contributes in taking decisions regarding the choice of the
protocol in storage P2P systems for a variety of big data applications. Using
lightweight and efficient collection mechanisms, our system enables real-time
registration of multiple measures, integrating support for real-life parameters
such as node failure models and recovery strategies. Experiments have been
performed at the PlanetLab network and at a typical research laboratory in
order to verify scalability and show maximum re-usability of our setup.
D-P2P-Sim+ framework is publicly available at
http://code.google.com/p/d-p2p-sim/downloads/list.
|
[
{
"version": "v1",
"created": "Wed, 2 Apr 2014 20:31:12 GMT"
}
] | 2014-04-04T00:00:00 |
[
[
"Sioutas",
"S.",
""
],
[
"Sakkopoulos",
"E.",
""
],
[
"Panaretos",
"A.",
""
],
[
"Tsoumakos",
"D.",
""
],
[
"Gerolymatos",
"P.",
""
],
[
"Tzimas",
"G.",
""
],
[
"Manolopoulos",
"Y.",
""
]
] |
new_dataset
| 0.993825 |
1404.0841
|
EPTCS
|
Cl\'audia Nalon (Department of Computer Science, University of
Bras\'ilia, Brazil), Lan Zhang (Information School Capital University of
Economics and Business, China), Clare Dixon (Department of Computer Science,
University of Liverpool, UK), Ullrich Hustadt (Department of Computer
Science, University of Liverpool, UK)
|
A Resolution Prover for Coalition Logic
|
In Proceedings SR 2014, arXiv:1404.0414
|
EPTCS 146, 2014, pp. 65-73
|
10.4204/EPTCS.146.9
| null |
cs.LO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a prototype tool for automated reasoning for Coalition Logic, a
non-normal modal logic that can be used for reasoning about cooperative agency.
The theorem prover CLProver is based on recent work on a resolution-based
calculus for Coalition Logic that operates on coalition problems, a normal form
for Coalition Logic. We provide an overview of coalition problems and of the
resolution-based calculus for Coalition Logic. We then give details of the
implementation of CLProver and present the results for a comparison with an
existing tableau-based solver.
|
[
{
"version": "v1",
"created": "Thu, 3 Apr 2014 10:38:34 GMT"
}
] | 2014-04-04T00:00:00 |
[
[
"Nalon",
"Cláudia",
"",
"Department of Computer Science, University of\n Brasília, Brazil"
],
[
"Zhang",
"Lan",
"",
"Information School Capital University of\n Economics and Business, China"
],
[
"Dixon",
"Clare",
"",
"Department of Computer Science,\n University of Liverpool, UK"
],
[
"Hustadt",
"Ullrich",
"",
"Department of Computer\n Science, University of Liverpool, UK"
]
] |
new_dataset
| 0.999698 |
1404.0843
|
EPTCS
|
Benjamin Aminof (IST Austria), Sasha Rubin (IST Austria and TU Wien)
|
First Cycle Games
|
In Proceedings SR 2014, arXiv:1404.0414
|
EPTCS 146, 2014, pp. 83-90
|
10.4204/EPTCS.146.11
| null |
cs.LO cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First cycle games (FCG) are played on a finite graph by two players who push
a token along the edges until a vertex is repeated, and a simple cycle is
formed. The winner is determined by some fixed property Y of the sequence of
labels of the edges (or nodes) forming this cycle. These games are
traditionally of interest because of their connection with infinite-duration
games such as parity and mean-payoff games.
We study the memory requirements for winning strategies of FCGs and certain
associated infinite duration games. We exhibit a simple FCG that is not
memoryless determined (this corrects a mistake in \it Memoryless determinacy of
parity and mean payoff games: a simple proof by Bj\"orklund, Sandberg, Vorobyov
(2004) that claims that FCGs for which Y is closed under cyclic permutations
are memoryless determined). We show that /Theta(n)! memory (where n is the
number of nodes in the graph), which is always sufficient, may be necessary to
win some FCGs. On the other hand, we identify easy to check conditions on Y
(i.e., Y is closed under cyclic permutations, and both Y and its complement are
closed under concatenation) that are sufficient to ensure that the
corresponding FCGs and their associated infinite duration games are memoryless
determined. We demonstrate that many games considered in the literature, such
as mean-payoff, parity, energy, etc., satisfy these conditions. On the
complexity side, we show (for efficiently computable Y) that while solving FCGs
is in PSPACE, solving some families of FCGs is PSPACE-hard.
|
[
{
"version": "v1",
"created": "Thu, 3 Apr 2014 10:38:54 GMT"
}
] | 2014-04-04T00:00:00 |
[
[
"Aminof",
"Benjamin",
"",
"IST Austria"
],
[
"Rubin",
"Sasha",
"",
"IST Austria and TU Wien"
]
] |
new_dataset
| 0.991675 |
1404.0967
|
Steffen Kopecki
|
Lila Kari, Steffen Kopecki, Pierre-\'Etienne Meunier, Matthew J.
Patitz, Shinnosuke Seki
|
Binary pattern tile set synthesis is NP-hard
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the field of algorithmic self-assembly, a long-standing unproven
conjecture has been that of the NP-hardness of binary pattern tile set
synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly
system with the smallest number of tile types which will self-assemble an input
pattern of $k$ colors. Of both theoretical and practical significance, $k$-PATS
has been studied in a series of papers which have shown $k$-PATS to be NP-hard
for $k = 60$, $k = 29$, and then $k = 11$. In this paper, we close the
fundamental conjecture that 2-PATS is NP-hard, concluding this line of study.
While most of our proof relies on standard mathematical proof techniques, one
crucial lemma makes use of a computer-assisted proof, which is a relatively
novel but increasingly utilized paradigm for deriving proofs for complex
mathematical problems. This tool is especially powerful for attacking
combinatorial problems, as exemplified by the proof of the four color theorem
by Appel and Haken (simplified later by Robertson, Sanders, Seymour, and
Thomas) or the recent important advance on the Erd\H{o}s discrepancy problem by
Konev and Lisitsa using computer programs. We utilize a massively parallel
algorithm and thus turn an otherwise intractable portion of our proof into a
program which requires approximately a year of computation time, bringing the
use of computer-assisted proofs to a new scale. We fully detail the algorithm
employed by our code, and make the code freely available online.
|
[
{
"version": "v1",
"created": "Thu, 3 Apr 2014 15:26:13 GMT"
}
] | 2014-04-04T00:00:00 |
[
[
"Kari",
"Lila",
""
],
[
"Kopecki",
"Steffen",
""
],
[
"Meunier",
"Pierre-Étienne",
""
],
[
"Patitz",
"Matthew J.",
""
],
[
"Seki",
"Shinnosuke",
""
]
] |
new_dataset
| 0.97663 |
1205.4977
|
Alan Mink
|
Alan Mink and Anastase Nakassis
|
LDPC for QKD Reconciliation
|
9 pages with Pseudo code and matrix correction performance
| null | null | null |
cs.CR quant-ph
|
http://creativecommons.org/licenses/publicdomain/
|
We present the Low Density Parity Check (LDPC) forward error correction
algorithm adapted for the Quantum Key Distribution (QKD) protocol in a form
readily applied by developers. A sparse parity check matrix is required for the
LDPC algorithm and we suggest using some that have been defined by the IEEE and
ETSI standards organizations for use in various communication protocols. We
evaluate the QKD performance of these various parity check matrices as a
function of the quantum bit error rate. We also discuss the computational
precision required for this LPDC algorithm. As QKD evolves towards deployment,
complete algorithm descriptions and performance analysis, as we present, will
be required.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 16:50:40 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Apr 2014 19:26:47 GMT"
}
] | 2014-04-03T00:00:00 |
[
[
"Mink",
"Alan",
""
],
[
"Nakassis",
"Anastase",
""
]
] |
new_dataset
| 0.991788 |
1311.3728
|
Jingcheng Liu
|
Jingcheng Liu and Pinyan Lu
|
FPTAS for Counting Monotone CNF
|
24 pages, 2 figures. version 1=>2: minor edits, highlighted the
picture of set cover/packing, and an implication of our previous result in 3D
matching
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A monotone CNF formula is a Boolean formula in conjunctive normal form where
each variable appears positively. We design a deterministic fully
polynomial-time approximation scheme (FPTAS) for counting the number of
satisfying assignments for a given monotone CNF formula when each variable
appears in at most $5$ clauses. Equivalently, this is also an FPTAS for
counting set covers where each set contains at most $5$ elements. If we allow
variables to appear in a maximum of $6$ clauses (or sets to contain $6$
elements), it is NP-hard to approximate it. Thus, this gives a complete
understanding of the approximability of counting for monotone CNF formulas. It
is also an important step towards a complete characterization of the
approximability for all bounded degree Boolean #CSP problems. In addition, we
study the hypergraph matching problem, which arises naturally towards a
complete classification of bounded degree Boolean #CSP problems, and show an
FPTAS for counting 3D matchings of hypergraphs with maximum degree $4$.
Our main technique is correlation decay, a powerful tool to design
deterministic FPTAS for counting problems defined by local constraints among a
number of variables. All previous uses of this design technique fall into two
categories: each constraint involves at most two variables, such as independent
set, coloring, and spin systems in general; or each variable appears in at most
two constraints, such as matching, edge cover, and holant problem in general.
The CNF problems studied here have more complicated structures than these
problems and require new design and proof techniques. As it turns out, the
technique we developed for the CNF problem also works for the hypergraph
matching problem. We believe that it may also find applications in other CSP or
more general counting problems.
|
[
{
"version": "v1",
"created": "Fri, 15 Nov 2013 05:06:27 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Apr 2014 11:45:10 GMT"
}
] | 2014-04-03T00:00:00 |
[
[
"Liu",
"Jingcheng",
""
],
[
"Lu",
"Pinyan",
""
]
] |
new_dataset
| 0.988243 |
1404.0607
|
Mostafizur Rahman
|
Mostafizur Rahman, Santosh Khasanvis, Jiajun Shi, Mingyu Li, and Csaba
Andras Moritz
|
Skybridge: 3-D Integrated Circuit Technology Alternative to CMOS
|
53 Pages
| null | null | null |
cs.ET cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Continuous scaling of CMOS has been the major catalyst in miniaturization of
integrated circuits (ICs) and crucial for global socio-economic progress.
However, scaling to sub-20nm technologies is proving to be challenging as
MOSFETs are reaching their fundamental limits and interconnection bottleneck is
dominating IC operational power and performance. Migrating to 3-D, as a way to
advance scaling, has eluded us due to inherent customization and manufacturing
requirements in CMOS that are incompatible with 3-D organization. Partial
attempts with die-die and layer-layer stacking have their own limitations. We
propose a 3-D IC fabric technology, Skybridge[TM], which offers paradigm shift
in technology scaling as well as design. We co-architect Skybridge's core
aspects, from device to circuit style, connectivity, thermal management, and
manufacturing pathway in a 3-D fabric-centric manner, building on a uniform 3-D
template. Our extensive bottom-up simulations, accounting for detailed material
system structures, manufacturing process, device, and circuit parasitics,
carried through for several designs including a designed microprocessor, reveal
a 30-60x density, 3.5x performance per watt benefits, and 10X reduction in
interconnect lengths vs. scaled 16-nm CMOS. Fabric-level heat extraction
features are shown to successfully manage IC thermal profiles in 3-D. Skybridge
can provide continuous scaling of integrated circuits beyond CMOS in the 21st
century.
|
[
{
"version": "v1",
"created": "Wed, 2 Apr 2014 16:41:11 GMT"
}
] | 2014-04-03T00:00:00 |
[
[
"Rahman",
"Mostafizur",
""
],
[
"Khasanvis",
"Santosh",
""
],
[
"Shi",
"Jiajun",
""
],
[
"Li",
"Mingyu",
""
],
[
"Moritz",
"Csaba Andras",
""
]
] |
new_dataset
| 0.962402 |
1404.0615
|
Mostafizur Rahman
|
Mostafizur Rahman, Santosh Khasanvis, and Csaba Andras Moritz
|
Nanowire Volatile RAM as an Alternative to SRAM
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Maintaining benefits of CMOS technology scaling is becoming challenging due
to increased manufacturing complexities and unwanted passive power
dissipations. This is particularly challenging in SRAM, where manufacturing
precision and leakage power control are critical issues. To alleviate some of
these challenges a novel non-volatile memory alternative to SRAM was proposed
called nanowire volatile RAM (NWRAM). Due to NWRAMs regular grid based layout
and innovative circuit style, manufacturing complexity is reduced and at the
same time considerable benefits are attained in terms of performance and
leakage power reduction. In this paper, we elaborate more on NWRAM circuit
aspects and manufacturability, and quantify benefits at 16nm technology node
through simulation against state-of-the-art 6T-SRAM and gridded 8T-SRAM
designs. Our results show the 10T-NWRAM to be 2x faster and 35x better in terms
of leakage when compared to high performance gridded 8T-SRAM design.
|
[
{
"version": "v1",
"created": "Wed, 2 Apr 2014 17:00:30 GMT"
}
] | 2014-04-03T00:00:00 |
[
[
"Rahman",
"Mostafizur",
""
],
[
"Khasanvis",
"Santosh",
""
],
[
"Moritz",
"Csaba Andras",
""
]
] |
new_dataset
| 0.995106 |
1309.1542
|
Oluwagbenga Ogunduyile O
|
O. O. Ogunduyile, K. Zuva, O. A. Randle, T. Zuva
|
Ubiquitous healthcare monitoring system using integrated triaxial
accelerometer,spo2 and location sensors
|
13 pages, 6 figures, International Journal of UbiComp (IJU), Vol.4,
No.2
|
International Journal of UbiComp (IJU), Vol.4, No.2,April 2013
|
10.5121/iju.2013.4201
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ubiquitous healthcare has become one of the prominent areas of research
inorder to address the challenges encountered in healthcare environment. In
contribution to this area, this study developed a system prototype that
recommends diagonostic services based on physiological data collected in real
time from a distant patient. The prototype uses WBAN body sensors to be worn by
the individual and an android smart phone as a personal server. Physiological
data is collected and uploaded to a Medical Health Server (MHS) via
GPRS/internet to be analysed. Our implemented prototype monitors the activity,
location and physiological data such as SpO2 and Heart Rate (HR) of the elderly
and patients in rehabilitation. The uploaded information can be accessed in
real time by medical practitioners through a web application.
|
[
{
"version": "v1",
"created": "Fri, 6 Sep 2013 06:03:12 GMT"
}
] | 2014-04-02T00:00:00 |
[
[
"Ogunduyile",
"O. O.",
""
],
[
"Zuva",
"K.",
""
],
[
"Randle",
"O. A.",
""
],
[
"Zuva",
"T.",
""
]
] |
new_dataset
| 0.996114 |
1404.0084
|
EPTCS
|
Adriana Compagnoni (Stevens Institute of Technology), Paola Giannini
(Universit\`a del Piemonte Orientale), Catherine Kim (Stevens Institute of
Technology), Matthew Milideo (Stevens Institute of Technology), Vishakha
Sharma (Stevens Institute of Technology)
|
A Calculus of Located Entities
|
In Proceedings DCM 2013, arXiv:1403.7685
|
EPTCS 144, 2014, pp. 41-56
|
10.4204/EPTCS.144.4
| null |
cs.PL cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define BioScapeL, a stochastic pi-calculus in 3D-space. A novel aspect of
BioScapeL is that entities have programmable locations. The programmer can
specify a particular location where to place an entity, or a location relative
to the current location of the entity. The motivation for the extension comes
from the need to describe the evolution of populations of biochemical species
in space, while keeping a sufficiently high level description, so that
phenomena like diffusion, collision, and confinement can remain part of the
semantics of the calculus. Combined with the random diffusion movement
inherited from BioScape, programmable locations allow us to capture the
assemblies of configurations of polymers, oligomers, and complexes such as
microtubules or actin filaments.
Further new aspects of BioScapeL include random translation and scaling.
Random translation is instrumental in describing the location of new entities
relative to the old ones. For example, when a cell secretes a hydronium ion,
the ion should be placed at a given distance from the originating cell, but in
a random direction. Additionally, scaling allows us to capture at a high level
events such as division and growth; for example, daughter cells after mitosis
have half the size of the mother cell.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 00:39:01 GMT"
}
] | 2014-04-02T00:00:00 |
[
[
"Compagnoni",
"Adriana",
"",
"Stevens Institute of Technology"
],
[
"Giannini",
"Paola",
"",
"Università del Piemonte Orientale"
],
[
"Kim",
"Catherine",
"",
"Stevens Institute of\n Technology"
],
[
"Milideo",
"Matthew",
"",
"Stevens Institute of Technology"
],
[
"Sharma",
"Vishakha",
"",
"Stevens Institute of Technology"
]
] |
new_dataset
| 0.968826 |
1404.0087
|
EPTCS
|
Karin Quaas (University of Leipzig)
|
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
|
In Proceedings SynCoP 2014, arXiv:1403.7841
|
EPTCS 145, 2014, pp. 5-17
|
10.4204/EPTCS.145.3
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Parametric timed automata extend timed automata (Alur and Dill, 1991) in that
they allow the specification of parametric bounds on the clock values. Since
their introduction in 1993 by Alur, Henzinger, and Vardi, it is known that the
emptiness problem for parametric timed automata with one clock is decidable,
whereas it is undecidable if the automaton uses three or more parametric
clocks. The problem is open for parametric timed automata with two parametric
clocks. Metric temporal logic, MTL for short, is a widely used specification
language for real-time systems. MTL-model checking of timed automata is
decidable, no matter how many clocks are used in the timed automaton. In this
paper, we prove that MTL-model checking for parametric timed automata is
undecidable, even if the automaton uses only one clock and one parameter and is
deterministic.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 00:39:33 GMT"
}
] | 2014-04-02T00:00:00 |
[
[
"Quaas",
"Karin",
"",
"University of Leipzig"
]
] |
new_dataset
| 0.997842 |
1404.0106
|
Shiu Kumar
|
Shiu Kumar, Eun Sik Ham and Seong Ro Lee
|
Traffic Monitoring Using M2M Communication
|
2 pages, 2 figures, presented in local conference in Korea South
|
General Fall Conference of Korea Information and Communications
Society (KICS) 2012, Seoul, South Korea, 2012, pp. 233-234
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an intelligent traffic monitoring system using wireless
vision sensor network that captures and processes the real-time video image to
obtain the traffic flow rate and vehicle speeds along different urban roadways.
This system will display the traffic states on the front roadways that can
guide the drivers to select the right way and avoid potential traffic
congestions. On the other hand, it will also monitor the vehicle speeds and
store the vehicle details, for those breaking the roadway speed limits, in its
database. The real-time traffic data is processed by the Personal Computer (PC)
at the sub roadway station and the traffic flow rate data is transmitted to the
main roadway station Arduino 3G via email, where the data is extracted and
traffic flow rate displayed.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 02:05:55 GMT"
}
] | 2014-04-02T00:00:00 |
[
[
"Kumar",
"Shiu",
""
],
[
"Ham",
"Eun Sik",
""
],
[
"Lee",
"Seong Ro",
""
]
] |
new_dataset
| 0.960907 |
1404.0144
|
Julian-Steffen M\"uller
|
Juha Kontinen and Julian-Steffen M\"uller and Henning Schnoor and
Heribert Vollmer
|
Modal Independence Logic
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces modal independence logic MIL, a modal logic that can
explicitly talk about independence among propositional variables. Formulas of
MIL are not evaluated in worlds but in sets of worlds, so called teams. In this
vein, MIL can be seen as a variant of V\"a\"an\"anen's modal dependence logic
MDL. We show that MIL embeds MDL and is strictly more expressive. However, on
singleton teams, MIL is shown to be not more expressive than usual modal logic,
but MIL is exponentially more succinct. Making use of a new form of
bisimulation, we extend these expressivity results to modal logics extended by
various generalized dependence atoms. We demonstrate the expressive power of
MIL by giving a specification of the anonymity requirement of the dining
cryptographers protocol in MIL. We also study complexity issues of MIL and show
that, though it is more expressive, its satisfiability and model checking
problem have the same complexity as for MDL.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 06:57:00 GMT"
}
] | 2014-04-02T00:00:00 |
[
[
"Kontinen",
"Juha",
""
],
[
"Müller",
"Julian-Steffen",
""
],
[
"Schnoor",
"Henning",
""
],
[
"Vollmer",
"Heribert",
""
]
] |
new_dataset
| 0.999736 |
1404.0296
|
Mostafizur Rahman
|
Mostafizur Rahman, Pritish Narayanan and Csaba Andras Moritz
|
Metal-Gated Junctionless Nanowire Transistors
| null | null | null | null |
cs.ET cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Junctionless Nanowire Field-Effect Transistors (JNFETs), where the channel
region is uniformly doped without the need for source-channel and drain-channel
junctions or lateral doping abruptness, are considered an attractive
alternative to conventional CMOS FETs. Previous theoretical and experimental
works [1][2] on JNFETs have considered polysilicon gates and silicon-dioxide
dielectric. However, with further scaling, JNFETs will suffer from deleterious
effects of doped polysilicon such as high resistance, additional capacitance
due to gate-oxide interface depletion, and incompatibility with high-k
dielectrics[3][4]. In this paper, novel metal- gated high-k JNFETs are
investigated through detailed process and device simulations. These MJNFETs are
also ideally suited for new types of nano-architectures such as N3ASICs [5]
which utilize regular nanowire arrays with limited customization. In such nano-
systems, the simplified device geometry in conjunction with a single-type FET
circuit style [6] would imply that logic arrays could be patterned out of
pre-doped SOI wafers without the need for any additional ion implantation.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 16:12:12 GMT"
}
] | 2014-04-02T00:00:00 |
[
[
"Rahman",
"Mostafizur",
""
],
[
"Narayanan",
"Pritish",
""
],
[
"Moritz",
"Csaba Andras",
""
]
] |
new_dataset
| 0.999709 |
1107.3441
|
Thijs Laarhoven
|
Thijs Laarhoven and Benne de Weger
|
Optimal symmetric Tardos traitor tracing schemes
|
16 pages, 1 figure
|
Designs, Codes and Cryptography, vol. 71, no. 1, pp. 83-103, 2014
|
10.1007/s10623-012-9718-y
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the Tardos traitor tracing scheme, we show that by combining the
symbol-symmetric accusation function of Skoric et al. with the improved
analysis of Blayer and Tassa we get further improvements. Our construction
gives codes that are up to 4 times shorter than Blayer and Tassa's, and up to 2
times shorter than the codes from Skoric et al. Asymptotically, we achieve the
theoretical optimal codelength for Tardos' distribution function and the
symmetric score function. For large coalitions, our codelengths are
asymptotically about 4.93% of Tardos' original codelengths, which also improves
upon results from Nuida et al.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2011 14:07:06 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Nov 2011 19:43:27 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Laarhoven",
"Thijs",
""
],
[
"de Weger",
"Benne",
""
]
] |
new_dataset
| 0.968467 |
1308.2002
|
Peng Qin
|
Peng Qin and Bin Dai and Kui Wu and Benxiong Huang and Guan Xu
|
Taking A Free Ride for Routing Topology Inference in Peer-to-Peer
Networks
|
11 pages
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
A Peer-to-Peer (P2P) network can boost its performance if peers are provided
with underlying network-layer routing topology. The task of inferring the
network-layer routing topology and link performance from an end host to a set
of other hosts is termed as network tomography, and it normally requires host
computers to send probing messages. We design a passive network tomography
method that does not requires any probing messages and takes a free ride over
data flows in P2P networks. It infers routing topology based on end-to-end
delay correlation estimation (DCE) without requiring any synchronization or
cooperation from the intermediate routers. We implement and test our method in
the real world Internet environment and achieved the accuracy of 92% in
topology recovery. We also perform extensive simulation in OMNet++ to evaluate
its performance over large scale networks, showing that its topology recovery
accuracy is about 95% for large networks.
|
[
{
"version": "v1",
"created": "Fri, 9 Aug 2013 00:16:37 GMT"
},
{
"version": "v2",
"created": "Sat, 29 Mar 2014 05:32:05 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Qin",
"Peng",
""
],
[
"Dai",
"Bin",
""
],
[
"Wu",
"Kui",
""
],
[
"Huang",
"Benxiong",
""
],
[
"Xu",
"Guan",
""
]
] |
new_dataset
| 0.952645 |
1403.6237
|
Thi Minh Tam Nguyen
|
Thi-Minh-Tam Nguyen, Viet-Trung Vu, The-Vinh Doan and Duc-Khanh Tran
|
Resolution in Linguistic First Order Logic based on Linear Symmetrical
Hedge Algebra
|
IPMU 2014 Full paper (14 pages)
| null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by/3.0/
|
This paper focuses on resolution in linguistic first order logic with truth
value taken from linear symmetrical hedge algebra. We build the basic
components of linguistic first order logic, including syntax and semantics. We
present a resolution principle for our logic to resolve on two clauses having
contradictory linguistic truth values. Since linguistic information is
uncertain, inference in our linguistic logic is approximate. Therefore, we
introduce the concept of reliability in order to capture the natural
approximation of the resolution inference rule.
|
[
{
"version": "v1",
"created": "Tue, 25 Mar 2014 05:38:32 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Mar 2014 08:58:34 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Nguyen",
"Thi-Minh-Tam",
""
],
[
"Vu",
"Viet-Trung",
""
],
[
"Doan",
"The-Vinh",
""
],
[
"Tran",
"Duc-Khanh",
""
]
] |
new_dataset
| 0.999131 |
1403.7697
|
Keang-Po Ho
|
Keang-Po Ho and Shi Cheng and Jianhan Liu
|
MIMO Beamforming in Millimeter-Wave Directional Wi-Fi
|
10 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Beamforming is indispensable in the operation of 60-GHz millimeter-wave
directional multi-gigabit Wi-Fi. Simple power method and its extensions enable
the transmitting and receiving antenna arrays to form a beam for single spatial
stream. To further improve the spectral efficiency in future 60-GHz directional
Wi-Fi, alternating least square (ALS) algorithm can form multiple beams between
the transmitter and receiver for multi-input-multi-output (MIMO) operations.
For both shared and split MIMO architecture, the ALS beamforming algorithm can
be operated in both frequency-flat and frequency-selective channels. In the
split architecture, MIMO beamforming approximately maximizes the capacity of
the beam-formed MIMO channel.
|
[
{
"version": "v1",
"created": "Sun, 30 Mar 2014 03:14:56 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Ho",
"Keang-Po",
""
],
[
"Cheng",
"Shi",
""
],
[
"Liu",
"Jianhan",
""
]
] |
new_dataset
| 0.996846 |
1403.7755
|
Liqi Wang
|
Liqi Wang, Shixin Zhu
|
On the Construction of Optimal Asymmetric Quantum Codes
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Constacyclic codes are important classes of linear codes that have been
applied to the construction of quantum codes. Six new families of asymmetric
quantum codes derived from constacyclic codes are constructed in this paper.
Moreover, the constructed asymmetric quantum codes are optimal and different
from the codes available in the literature.
|
[
{
"version": "v1",
"created": "Sun, 30 Mar 2014 13:25:02 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Wang",
"Liqi",
""
],
[
"Zhu",
"Shixin",
""
]
] |
new_dataset
| 0.999458 |
1403.7791
|
Camille Coti
|
Camille Coti
|
POSH: Paris OpenSHMEM: A High-Performance OpenSHMEM Implementation for
Shared Memory Systems
|
This is an extended version (featuring the full proofs) of a paper
accepted at ICCS'14
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the design and implementation of POSH, an
Open-Source implementation of the OpenSHMEM standard. We present a model for
its communications, and prove some properties on the memory model defined in
the OpenSHMEM specification. We present some performance measurements of the
communication library featured by POSH and compare them with an existing
one-sided communication library. POSH can be downloaded from
\url{http://www.lipn.fr/~coti/POSH}. % 9 - 67
|
[
{
"version": "v1",
"created": "Sun, 30 Mar 2014 17:43:21 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Coti",
"Camille",
""
]
] |
new_dataset
| 0.998124 |
1403.7828
|
Alexander Merry
|
Alexander Merry
|
Reasoning with !-Graphs
|
DPhil (PhD) thesis; University of Oxford; 172 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this thesis is to present an extension to the string graphs of
Dixon, Duncan and Kissinger that allows the finite representation of certain
infinite families of graphs and graph rewrite rules, and to demonstrate that a
logic can be built on this to allow the formalisation of inductive proofs in
the string diagrams of compact closed and traced symmetric monoidal categories.
String diagrams provide an intuitive method for reasoning about monoidal
categories. However, this does not negate the ability for those using them to
make mistakes in proofs. To this end, there is a project (Quantomatic) to build
a proof assistant for string diagrams, at least for those based on categories
with a notion of trace. The development of string graphs has provided a
combinatorial formalisation of string diagrams, laying the foundations for this
project.
The prevalence of commutative Frobenius algebras (CFAs) in quantum
information theory, a major application area of these diagrams, has led to the
use of variable-arity nodes as a shorthand for normalised networks of Frobenius
algebra morphisms, so-called "spider notation". This notation greatly eases
reasoning with CFAs, but string graphs are inadequate to properly encode this
reasoning.
This dissertation extends string graphs to allow for variable-arity nodes to
be represented at all, and then introduces !-box notation (and structures to
encode it) to represent string graph equations containing repeated subgraphs,
where the number of repetitions is abitrary. It then demonstrates how we can
reason directly about !-graphs, viewed as (typically infinite) families of
string graphs. Of particular note is the presentation of a form of graph-based
induction, allowing the formal encoding of proofs that previously could only be
represented as a mix of string diagrams and explanatory text.
|
[
{
"version": "v1",
"created": "Sun, 30 Mar 2014 22:55:57 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Merry",
"Alexander",
""
]
] |
new_dataset
| 0.994444 |
1403.7928
|
Jakub Urban
|
J. Urban, J. Pipek, M. Hron, F. Janky, R. Pap\v{r}ok, M. Peterka, A.
S. Duarte
|
Integrated Data Acquisition, Storage, Retrieval and Processing Using the
COMPASS DataBase (CDB)
| null | null |
10.1016/j.fusengdes.2014.03.032
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a complex data handling system for the COMPASS tokamak, operated
by IPP ASCR Prague, Czech Republic [1]. The system, called CDB (Compass
DataBase), integrates different data sources as an assortment of data
acquisition hardware and software from different vendors is used. Based on
widely available open source technologies wherever possible, CDB is vendor and
platform independent and it can be easily scaled and distributed. The data is
directly stored and retrieved using a standard NAS (Network Attached Storage),
hence independent of the particular technology; the description of the data
(the metadata) is recorded in a relational database. Database structure is
general and enables the inclusion of multi-dimensional data signals in multiple
revisions (no data is overwritten). This design is inherently distributed as
the work is off-loaded to the clients. Both NAS and database can be implemented
and optimized for fast local access as well as secure remote access. CDB is
implemented in Python language; bindings for Java, C/C++, IDL and Matlab are
provided. Independent data acquisitions systems as well as nodes managed by
FireSignal [2] are all integrated using CDB. An automated data post-processing
server is a part of CDB. Based on dependency rules, the server executes, in
parallel if possible, prescribed post-processing tasks.
|
[
{
"version": "v1",
"created": "Mon, 31 Mar 2014 09:38:37 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Urban",
"J.",
""
],
[
"Pipek",
"J.",
""
],
[
"Hron",
"M.",
""
],
[
"Janky",
"F.",
""
],
[
"Papřok",
"R.",
""
],
[
"Peterka",
"M.",
""
],
[
"Duarte",
"A. S.",
""
]
] |
new_dataset
| 0.986787 |
1403.8028
|
Mohamed El-Zawawy Dr.
|
Mohamed A. El-Zawawy, Adel I. AlSalem
|
ImNet: An Imperative Network Programming Language
|
8 pages, 8 figures, Mohamed A. El-Zawawy and Adel I. AlSalem. ImNet:
An Imperative Network Programming Language. Proceedings of The 14th
International Conference on Applied Computer Science, ACS 2014, Constantin
Buzatu (Ed): Modern Computer Applications in Science and Education, pp.
149--156
| null | null | null |
cs.PL cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the most recent architectures of networks is Software-Defined Networks
(SDNs) using a con- troller appliance to control the set of switches on the
network. The controlling process includes installing or uninstalling
packet-processing rules on flow tables of switches. This paper presents a
high-level imperative network programming language, called ImNet, to facilitate
writing efficient, yet simple, programs executed by controller to manage
switches. ImNet is simply-structured, expressive, compositional, and
imperative. This paper also introduces an operational semantics to ImNet.
Detailed examples of programs (with their operational semantics) constructed in
ImNet are illustrated in the paper as well.
|
[
{
"version": "v1",
"created": "Sun, 23 Feb 2014 19:20:18 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"El-Zawawy",
"Mohamed A.",
""
],
[
"AlSalem",
"Adel I.",
""
]
] |
new_dataset
| 0.997939 |
1403.8086
|
Glencora Borradaile
|
Glencora Borradaile, Erin Wolf Chambers
|
Covering nearly surface-embedded graphs with a fixed number of balls
|
To appear in DCG
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any
planar graph of diameter at most 2R can be covered by a constant number of
balls of size R; put another way, there are a constant-sized subset of vertices
within which every other vertex is distance half the diameter. We generalize
this result to graphs embedded on surfaces of fixed genus with a fixed number
of apices, making progress toward the conjecture that graphs excluding a fixed
minor can also be covered by a constant number of balls. To do so, we develop
two tools which may be of independent interest. The first gives a bound on the
density of graphs drawn on a surface of genus $g$ having a limit on the number
of pairwise-crossing edges. The second bounds the size of a non-contractible
cycle in terms of the Euclidean norm of the degree sequence of a graph embedded
on surface.
|
[
{
"version": "v1",
"created": "Mon, 31 Mar 2014 16:57:36 GMT"
}
] | 2014-04-01T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Chambers",
"Erin Wolf",
""
]
] |
new_dataset
| 0.999432 |
1307.6458
|
Ayoub Otmani
|
Alain Couvreur and Philippe Gaborit and Val\'erie Gauthier-Uma\~na and
Ayoub Otmani and Jean-Pierre Tillich
|
Distinguisher-Based Attacks on Public-Key Cryptosystems Using
Reed-Solomon Codes
|
A short version appeared in the proceedings of the workshop on Coding
and Cryptography 2013 (WCC' 2013). This paper supersedes arXiv:1203.6686
[cs.CR] and arXiv:1204.6459 [cs.CR]
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Because of their interesting algebraic properties, several authors promote
the use of generalized Reed-Solomon codes in cryptography. Niederreiter was the
first to suggest an instantiation of his cryptosystem with them but Sidelnikov
and Shestakov showed that this choice is insecure. Wieschebrink proposed a
variant of the McEliece cryptosystem which consists in concatenating a few
random columns to a generator matrix of a secretly chosen generalized
Reed-Solomon code. More recently, new schemes appeared which are the
homomorphic encryption scheme proposed by Bogdanov and Lee, and a variation of
the McEliece cryptosystem proposed by Baldi et \textit{al.} which hides the
generalized Reed-Solomon code by means of matrices of very low rank.
In this work, we show how to mount key-recovery attacks against these
public-key encryption schemes. We use the concept of distinguisher which aims
at detecting a behavior different from the one that one would expect from a
random code. All the distinguishers we have built are based on the notion of
component-wise product of codes. It results in a powerful tool that is able to
recover the secret structure of codes when they are derived from generalized
Reed-Solomon codes. Lastly, we give an alternative to Sidelnikov and Shestakov
attack by building a filtration which enables to completely recover the support
and the non-zero scalars defining the secret generalized Reed-Solomon code.
|
[
{
"version": "v1",
"created": "Wed, 24 Jul 2013 15:28:56 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Mar 2014 09:54:32 GMT"
}
] | 2014-03-31T00:00:00 |
[
[
"Couvreur",
"Alain",
""
],
[
"Gaborit",
"Philippe",
""
],
[
"Gauthier-Umaña",
"Valérie",
""
],
[
"Otmani",
"Ayoub",
""
],
[
"Tillich",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.963363 |
1403.1631
|
Adrian Tang
|
Adrian Tang, Simha Sethumadhavan, Salvatore Stolfo
|
Unsupervised Anomaly-based Malware Detection using Hardware Features
|
1 page, Latex; added description for feature selection in Section 4,
results unchanged
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent works have shown promise in using microarchitectural execution
patterns to detect malware programs. These detectors belong to a class of
detectors known as signature-based detectors as they catch malware by comparing
a program's execution pattern (signature) to execution patterns of known
malware programs. In this work, we propose a new class of detectors -
anomaly-based hardware malware detectors - that do not require signatures for
malware detection, and thus can catch a wider range of malware including
potentially novel ones. We use unsupervised machine learning to build profiles
of normal program execution based on data from performance counters, and use
these profiles to detect significant deviations in program behavior that occur
as a result of malware exploitation. We show that real-world exploitation of
popular programs such as IE and Adobe PDF Reader on a Windows/x86 platform can
be detected with nearly perfect certainty. We also examine the limits and
challenges in implementing this approach in face of a sophisticated adversary
attempting to evade anomaly-based detection. The proposed detector is
complementary to previously proposed signature-based detectors and can be used
together to improve security.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2014 01:44:58 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Mar 2014 14:49:44 GMT"
}
] | 2014-03-31T00:00:00 |
[
[
"Tang",
"Adrian",
""
],
[
"Sethumadhavan",
"Simha",
""
],
[
"Stolfo",
"Salvatore",
""
]
] |
new_dataset
| 0.976894 |
1403.7248
|
Axel Polleres
|
Albin Ahmeti and Diego Calvanese and Axel Polleres
|
Updating RDFS ABoxes and TBoxes in SPARQL
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Updates in RDF stores have recently been standardised in the SPARQL 1.1
Update specification. However, computing answers entailed by ontologies in
triple stores is usually treated orthogonal to updates. Even the W3C's recent
SPARQL 1.1 Update language and SPARQL 1.1 Entailment Regimes specifications
explicitly exclude a standard behaviour how SPARQL endpoints should treat
entailment regimes other than simple entailment in the context of updates. In
this paper, we take a first step to close this gap. We define a fragment of
SPARQL basic graph patterns corresponding to (the RDFS fragment of) DL-Lite and
the corresponding SPARQL update language, dealing with updates both of ABox and
of TBox statements. We discuss possible semantics along with potential
strategies for implementing them. We treat both, (i) materialised RDF stores,
which store all entailed triples explicitly, and (ii) reduced RDF Stores, that
is, redundancy-free RDF stores that do not store any RDF triples (corresponding
to DL-Lite ABox statements) entailed by others already.
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2014 23:43:38 GMT"
}
] | 2014-03-31T00:00:00 |
[
[
"Ahmeti",
"Albin",
""
],
[
"Calvanese",
"Diego",
""
],
[
"Polleres",
"Axel",
""
]
] |
new_dataset
| 0.975127 |
1403.7260
|
EPTCS
|
Harsh Beohar (Center for Research on Embedded Systems Halmstad
University, Sweden), Mohammad Reza Mousavi (Center for Research on Embedded
Systems Halmstad University, Sweden)
|
Spinal Test Suites for Software Product Lines
|
In Proceedings MBT 2014, arXiv:1403.7044
|
EPTCS 141, 2014, pp. 44-55
|
10.4204/EPTCS.141.4
| null |
cs.SE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A major challenge in testing software product lines is efficiency. In
particular, testing a product line should take less effort than testing each
and every product individually. We address this issue in the context of
input-output conformance testing, which is a formal theory of model-based
testing. We extend the notion of conformance testing on input-output featured
transition systems with the novel concept of spinal test suites. We show how
this concept dispenses with retesting the common behavior among different, but
similar, products of a software product line.
|
[
{
"version": "v1",
"created": "Fri, 28 Mar 2014 01:04:50 GMT"
}
] | 2014-03-31T00:00:00 |
[
[
"Beohar",
"Harsh",
"",
"Center for Research on Embedded Systems Halmstad\n University, Sweden"
],
[
"Mousavi",
"Mohammad Reza",
"",
"Center for Research on Embedded\n Systems Halmstad University, Sweden"
]
] |
new_dataset
| 0.966455 |
1403.7293
|
Roshan Ragel
|
D. Jayasinghe, R. G. Ragel, D. Elkaduwe
|
Constant time encryption as a countermeasure against remote cache timing
attacks
| null |
Information and Automation for Sustainability (ICIAfS), 2012 IEEE
6th International Conference on, 27-29 Sept 2012, pp 129-134, Beijing
|
10.1109/ICIAFS.2012.6419893
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rijndael was standardized in 2001 by National Institute of Standard and
Technology as the Advanced Encryption Standard (AES). AES is still being used
to encrypt financial, military and even government confidential data. In 2005,
Bernstein illustrated a remote cache timing attack on AES using the
client-server architecture and therefore proved a side channel in its software
implementation. Over the years, a number of countermeasures have been proposed
against cache timing attacks both using hardware and software. Although the
software based countermeasures are flexible and easy to deploy, most of such
countermeasures are vulnerable to statistical analysis. In this paper, we
propose a novel software based countermeasure against cache timing attacks,
known as constant time encryption, which we believe is secure against
statistical analysis. The countermeasure we proposed performs rescheduling of
instructions such that the encryption rounds will consume constant time
independent of the cache hits and misses. Through experiments, we prove that
our countermeasure is secure against Bernstein's cache timing attack.
|
[
{
"version": "v1",
"created": "Fri, 28 Mar 2014 07:37:26 GMT"
}
] | 2014-03-31T00:00:00 |
[
[
"Jayasinghe",
"D.",
""
],
[
"Ragel",
"R. G.",
""
],
[
"Elkaduwe",
"D.",
""
]
] |
new_dataset
| 0.994677 |
1403.7350
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Slime mould electronic oscillators
| null | null | null | null |
cs.ET physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct electronic oscillator from acellular slime mould Physarum
polycephalum. The slime mould oscillator is made of two electrodes connected by
a protoplasmic tube of the living slime mould. A protoplasmic tube has an
average resistance of 3~MOhm. The tube's resistance is changing over time due
to peristaltic contractile activity of the tube. The resistance of the
protoplasmic tube oscillates with average period of 73~sec and average
amplitude of 0.6~MOhm. We present experimental laboratory results on dynamics
of Physarum oscillator under direct current voltage up to 15~V and speculate
that slime mould P. polycephalum can be employed as a living electrical
oscillator in biological and hybrid circuits.
|
[
{
"version": "v1",
"created": "Fri, 28 Mar 2014 12:01:12 GMT"
}
] | 2014-03-31T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999149 |
1403.6823
|
Theresa Schubert
|
Theresa Schubert
|
ChromaPhy - A Living Wearable Connecting Humans and Their Environment
|
Extended abstracts (3 pages)
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research presents an artistic project aiming to make cyberfiction become
reality and exemplifying a current trend in art and science collaborations.
Chroma+Phy is a speculative design for a living wearable that combines the
protoplasmic structure of the amoeboid acellular organism Physarum polycephalum
and the chromatophores of the reptile Chameleon. The underpin-ning idea is that
in a future far away or close, on planet earth or in outer space, humans will
need some tools to help them in their social life and day-to-day routine.
Chroma+Phy enhances the body aiming at humans in extreme habitats for an
aggression-free and healthy life. Our approach will address actual issues of
scientific discovery for society and catalyse idea translation through art and
design experiments at frontiers of science.
|
[
{
"version": "v1",
"created": "Wed, 26 Mar 2014 18:49:41 GMT"
}
] | 2014-03-28T00:00:00 |
[
[
"Schubert",
"Theresa",
""
]
] |
new_dataset
| 0.999646 |
1403.6919
|
Malini P
|
Harikrishnan.R, Shajna S. Hammed, P.Malini
|
Marine Buoy Location Finding and Tracking System for Linux Supporting
Mobiles
|
3pages, 5figures
|
International Journal of Engineering Trends and Technology Volume
9 Number 8 - Mar 2014
| null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Marine buoy is an important part of underwater acoustic communication system.
It is of great significance to track and locate it. It is widely used in ocean
environment three - dimensional monitoring, underwater multimedia
communication, underwater mobile carrier navigation and positioning, marine
resources detection, remote control of submarine topography mapping and
offshore oil industry, data acquisition, etc. This paper describes the
application of the monitoring service of GPRS / GPS module at Marine buoy. It
can achieve real - time location of underwater acoustic communication devices
and route tracking to avoid the loss of the device, as well as assist to
retrieve the lost device.
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2014 05:57:10 GMT"
}
] | 2014-03-28T00:00:00 |
[
[
"R",
"Harikrishnan.",
""
],
[
"Hammed",
"Shajna S.",
""
],
[
"Malini",
"P.",
""
]
] |
new_dataset
| 0.982352 |
1403.6946
|
David Budden
|
Josiah Walker, Trent Houliston, Brendan Annable, Alex Biddulph, Andrew
Dabson, Jake Fountain, Taylor Johnson, Jordan Johnson, Mitchell Metcalfe,
Anita Sugo, Stephan K. Chalup, Robert A.R. King, Alexandre Mendes, and Peter
Turner
|
The NUbots Team Description Paper 2014
|
RoboCup 2014 humanoid league team description paper
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The NUbots team, from The University of Newcastle, Australia, has had a
strong record of success in the RoboCup Standard Platform League since first
entering in 2002. The team has also competed within the RoboCup Humanoid
Kid-Size League since 2012. The 2014 team brings a renewed focus on software
architecture, modularity, and the ability to easily share code. This paper
summarizes the history of the NUbots team, describes the roles and research of
the team members, gives an overview of the NUbots' robots and software system,
and addresses relevant research projects within the the Newcastle Robotics
Laboratory.
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2014 08:22:09 GMT"
}
] | 2014-03-28T00:00:00 |
[
[
"Walker",
"Josiah",
""
],
[
"Houliston",
"Trent",
""
],
[
"Annable",
"Brendan",
""
],
[
"Biddulph",
"Alex",
""
],
[
"Dabson",
"Andrew",
""
],
[
"Fountain",
"Jake",
""
],
[
"Johnson",
"Taylor",
""
],
[
"Johnson",
"Jordan",
""
],
[
"Metcalfe",
"Mitchell",
""
],
[
"Sugo",
"Anita",
""
],
[
"Chalup",
"Stephan K.",
""
],
[
"King",
"Robert A. R.",
""
],
[
"Mendes",
"Alexandre",
""
],
[
"Turner",
"Peter",
""
]
] |
new_dataset
| 0.999638 |
1403.6950
|
Manuel Marin-Jimenez
|
F.M. Castro and M.J. Marin-Jimenez and R. Medina-Carnicer
|
Pyramidal Fisher Motion for Multiview Gait Recognition
|
Submitted to International Conference on Pattern Recognition, ICPR,
2014
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this paper is to identify individuals by analyzing their gait.
Instead of using binary silhouettes as input data (as done in many previous
works) we propose and evaluate the use of motion descriptors based on densely
sampled short-term trajectories. We take advantage of state-of-the-art people
detectors to define custom spatial configurations of the descriptors around the
target person. Thus, obtaining a pyramidal representation of the gait motion.
The local motion features (described by the Divergence-Curl-Shear descriptor)
extracted on the different spatial areas of the person are combined into a
single high-level gait descriptor by using the Fisher Vector encoding. The
proposed approach, coined Pyramidal Fisher Motion, is experimentally validated
on the recent `AVA Multiview Gait' dataset. The results show that this new
approach achieves promising results in the problem of gait recognition.
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2014 08:39:31 GMT"
}
] | 2014-03-28T00:00:00 |
[
[
"Castro",
"F. M.",
""
],
[
"Marin-Jimenez",
"M. J.",
""
],
[
"Medina-Carnicer",
"R.",
""
]
] |
new_dataset
| 0.981461 |
1403.5824
|
Terence H. Chan
|
Guanghua Zhu and Linda M. Davis and Terence Chan
|
Energy-Throughput Trade-offs in a Wireless Sensor Network with Mobile
Relay
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we analyze the trade-offs between energy and throughput for
links in a wireless sensor network. Our application of interest is one in which
a number of low-powered sensors need to wirelessly communicate their
measurements to a communications sink, or destination node, for communication
to a central processor. We focus on one particular sensor source, and consider
the case where the distance to the destination is beyond the peak power of the
source. A relay node is required. Transmission energy of the sensor and the
relay can be adjusted to minimize the total energy for a given throughput of
the connection from sensor source to destination. We introduce a bounded random
walk model for movement of the relay between the sensor and destination nodes,
and characterize the total transmission energy and throughput performance using
Markov steady state analysis. Based on the trade-offs between total energy and
throughput we propose a new time-sharing protocol to exploit the movement of
the relay to reduce the total energy. We demonstrate the effectiveness of
time-sharing for minimizing the total energy consumption while achieving the
throughput requirement. We then show that the time-sharing scheme is more
energy efficient than the popular sleep mode scheme.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 01:05:49 GMT"
}
] | 2014-03-27T00:00:00 |
[
[
"Zhu",
"Guanghua",
""
],
[
"Davis",
"Linda M.",
""
],
[
"Chan",
"Terence",
""
]
] |
new_dataset
| 0.990187 |
1403.6487
|
Christopher Brown
|
Christopher W. Brown
|
Model-based construction of Open Non-uniform Cylindrical Algebraic
Decompositions
| null | null | null | null |
cs.SC
|
http://creativecommons.org/licenses/publicdomain/
|
In this paper we introduce the notion of an Open Non-uniform Cylindrical
Algebraic Decomposition (NuCAD), and present an efficient model-based algorithm
for constructing an Open NuCAD from an input formula. A NuCAD is a
generalization of Cylindrical Algebraic Decomposition (CAD) as defined by
Collins in his seminal work from the early 1970s, and as extended in concepts
like Hong's partial CAD. A NuCAD, like a CAD, is a decomposition of
n-dimensional real space into cylindrical cells. But unlike a CAD, the cells in
a NuCAD need not be arranged cylindrically. It is in this sense that NuCADs are
not uniformly cylindrical. However, NuCADs--- like CADs --- carry a tree-like
structure that relates different cells. It is a very different tree but, as
with the CAD tree structure, it allows some operations to be performed
efficiently, for example locating the containing cell for an arbitrary input
point.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 02:10:31 GMT"
}
] | 2014-03-27T00:00:00 |
[
[
"Brown",
"Christopher W.",
""
]
] |
new_dataset
| 0.965495 |
1403.6518
|
Edouard Bonnet
|
Edouard Bonnet, Florian Jamain and Abdallah Saffidine
|
Havannah and TwixT are PSPACE-complete
|
13 pages, 7 figures. Accepted in CG'13
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Numerous popular abstract strategy games ranging from Hex and Havannah to
Lines of Action belong to the class of connection games. Still, very few
complexity results on such games have been obtained since Hex was proved
PSPACE-complete in the early eighties. We study the complexity of two
connection games among the most widely played. Namely, we prove that Havannah
and TwixT are PSPACE-complete. The proof for Havannah involves a reduction from
Generalized Geography and is based solely on ring-threats to represent the
input graph. On the other hand, the reduction for TwixT builds up on previous
work as it is a straightforward encoding of Hex.
|
[
{
"version": "v1",
"created": "Tue, 25 Mar 2014 21:55:25 GMT"
}
] | 2014-03-27T00:00:00 |
[
[
"Bonnet",
"Edouard",
""
],
[
"Jamain",
"Florian",
""
],
[
"Saffidine",
"Abdallah",
""
]
] |
new_dataset
| 0.999742 |
1403.6636
|
Arturo Tlaca\'elel Curiel D\'iaz
|
Arturo Curiel, Christophe Collet
|
Sign Language Lexical Recognition With Propositional Dynamic Logic
|
6 pages, Proceedings of the 51st Annual Meeting of the Association
for Computational Linguistics (Volume 2: Short Papers), August, 2013
|
In Proceedings of the 51st Annual Meeting of the Association for
Computational Linguistics, vol. 2, pp. 328-333. 2013
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper explores the use of Propositional Dynamic Logic (PDL) as a
suitable formal framework for describing Sign Language (SL), the language of
deaf people, in the context of natural language processing. SLs are visual,
complete, standalone languages which are just as expressive as oral languages.
Signs in SL usually correspond to sequences of highly specific body postures
interleaved with movements, which make reference to real world objects,
characters or situations. Here we propose a formal representation of SL signs,
that will help us with the analysis of automatically-collected hand tracking
data from French Sign Language (FSL) video corpora. We further show how such a
representation could help us with the design of computer aided SL verification
tools, which in turn would bring us closer to the development of an automatic
recognition system for these languages.
|
[
{
"version": "v1",
"created": "Wed, 26 Mar 2014 11:47:37 GMT"
}
] | 2014-03-27T00:00:00 |
[
[
"Curiel",
"Arturo",
""
],
[
"Collet",
"Christophe",
""
]
] |
new_dataset
| 0.998659 |
1403.6644
|
Christopher Casey
|
C. Jasson Casey, Andrew Sutton, Alex Sprintson
|
tinyNBI: Distilling an API from essential OpenFlow abstractions
| null | null | null | null |
cs.NI cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If simplicity is a key strategy for success as a network protocol OpenFlow is
not winning. At its core OpenFlow presents a simple idea, which is a network
switch data plane abstraction along with a control protocol for manipulating
that abstraction. The result of this idea has been far from simple: a new
version released each year, five active versions, com- plex feature
dependencies, unstable version negotiation, lack of state machine definition,
etc. This complexity represents roadblocks for network, software, and hardware
engineers.
We have distilled the core abstractions present in 5 existing versions of
OpenFlow and refactored them into a simple API called tinyNBI. Our work does
not provide high-level network abstractions (address pools, VPN maps, etc.),
instead it focuses on providing a clean low level interface that supports the
development of these higher layer abstractions. The goal of tinyNBI is to allow
configuration of all existing OpenFlow abstractions without having to deal with
the unique personalities of each version of OpenFlow or their level of support
in target switches.
|
[
{
"version": "v1",
"created": "Wed, 26 Mar 2014 12:15:11 GMT"
}
] | 2014-03-27T00:00:00 |
[
[
"Casey",
"C. Jasson",
""
],
[
"Sutton",
"Andrew",
""
],
[
"Sprintson",
"Alex",
""
]
] |
new_dataset
| 0.998731 |
1402.6500
|
Changtao Zhong
|
Changtao Zhong and Mostafa Salehi and Sunil Shah and Marius Cobzarenco
and Nishanth Sastry and Meeyoung Cha
|
Social Bootstrapping: How Pinterest and Last.fm Social Communities
Benefit by Borrowing Links from Facebook
|
Proc. 23rd International World Wide Web Conference (WWW), 2014
| null |
10.1145/2566486.2568031
| null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How does one develop a new online community that is highly engaging to each
user and promotes social interaction? A number of websites offer friend-finding
features that help users bootstrap social networks on the website by copying
links from an established network like Facebook or Twitter. This paper
quantifies the extent to which such social bootstrapping is effective in
enhancing a social experience of the website. First, we develop a stylised
analytical model that suggests that copying tends to produce a giant connected
component (i.e., a connected community) quickly and preserves properties such
as reciprocity and clustering, up to a linear multiplicative factor. Second, we
use data from two websites, Pinterest and Last.fm, to empirically compare the
subgraph of links copied from Facebook to links created natively. We find that
the copied subgraph has a giant component, higher reciprocity and clustering,
and confirm that the copied connections see higher social interactions.
However, the need for copying diminishes as users become more active and
influential. Such users tend to create links natively on the website, to users
who are more similar to them than their Facebook friends. Our findings give new
insights into understanding how bootstrapping from established social networks
can help engage new users by enhancing social interactivity.
|
[
{
"version": "v1",
"created": "Wed, 26 Feb 2014 11:40:40 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Mar 2014 14:13:19 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Zhong",
"Changtao",
""
],
[
"Salehi",
"Mostafa",
""
],
[
"Shah",
"Sunil",
""
],
[
"Cobzarenco",
"Marius",
""
],
[
"Sastry",
"Nishanth",
""
],
[
"Cha",
"Meeyoung",
""
]
] |
new_dataset
| 0.976978 |
1403.5641
|
Valery Ugrinovskii
|
V. Ugrinovskii and C. Langbort
|
Control over adversarial packet-dropping communication networks
revisited
|
This paper has been accepted for presentation at the 2014 American
Control Conference, Portland, Oregon
| null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We revisit a one-step control problem over an adversarial packet-dropping
link. The link is modeled as a set of binary channels controlled by a strategic
jammer whose intention is to wage a `denial of service' attack on the plant by
choosing a most damaging channel-switching strategy. The paper introduces a
class of zero-sum games between the jammer and controller as a scenario for
such attack, and derives necessary and sufficient conditions for these games to
have a nontrivial saddle-point equilibrium. At this equilibrium, the jammer's
optimal policy is to randomize in a region of the plant's state space, thus
requiring the controller to undertake a nontrivial response which is different
from what one would expect in a standard stochastic control problem over a
packet dropping channel.
|
[
{
"version": "v1",
"created": "Sat, 22 Mar 2014 10:43:43 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Ugrinovskii",
"V.",
""
],
[
"Langbort",
"C.",
""
]
] |
new_dataset
| 0.988346 |
1403.5830
|
Emanuele Natale
|
Luciano Gual\`a and Stefano Leucci and Emanuele Natale
|
Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard
|
21 pages, 12 figures
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The twentieth century has seen the rise of a new type of video games targeted
at a mass audience of "casual" gamers. Many of these games require the player
to swap items in order to form matches of three and are collectively known as
\emph{tile-matching match-three games}. Among these, the most influential one
is arguably \emph{Bejeweled} in which the matched items (gems) pop and the
above gems fall in their place. Bejeweled has been ported to many different
platforms and influenced an incredible number of similar games. Very recently
one of them, named \emph{Candy Crush Saga} enjoyed a huge popularity and
quickly went viral on social networks. We generalize this kind of games by only
parameterizing the size of the board, while all the other elements (such as the
rules or the number of gems) remain unchanged. Then, we prove that answering
many natural questions regarding such games is actually \NP-Hard. These
questions include determining if the player can reach a certain score, play for
a certain number of turns, and others. We also
\href{http://candycrush.isnphard.com}{provide} a playable web-based
implementation of our reduction.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 01:51:19 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Gualà",
"Luciano",
""
],
[
"Leucci",
"Stefano",
""
],
[
"Natale",
"Emanuele",
""
]
] |
new_dataset
| 0.999651 |
1403.5871
|
David Bild
|
Yue Liu, David R. Bild, Robert P. Dick, Z. Morley Mao, and Dan S.
Wallach
|
The Mason Test: A Defense Against Sybil Attacks in Wireless Networks
Without Trusted Authorities
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless networks are vulnerable to Sybil attacks, in which a malicious node
poses as many identities in order to gain disproportionate influence. Many
defenses based on spatial variability of wireless channels exist, but depend
either on detailed, multi-tap channel estimation - something not exposed on
commodity 802.11 devices - or valid RSSI observations from multiple trusted
sources, e.g., corporate access points - something not directly available in ad
hoc and delay-tolerant networks with potentially malicious neighbors. We extend
these techniques to be practical for wireless ad hoc networks of commodity
802.11 devices. Specifically, we propose two efficient methods for separating
the valid RSSI observations of behaving nodes from those falsified by malicious
participants. Further, we note that prior signalprint methods are easily
defeated by mobile attackers and develop an appropriate challenge-response
defense. Finally, we present the Mason test, the first implementation of these
techniques for ad hoc and delay-tolerant networks of commodity 802.11 devices.
We illustrate its performance in several real-world scenarios.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 07:21:43 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Liu",
"Yue",
""
],
[
"Bild",
"David R.",
""
],
[
"Dick",
"Robert P.",
""
],
[
"Mao",
"Z. Morley",
""
],
[
"Wallach",
"Dan S.",
""
]
] |
new_dataset
| 0.997267 |
1403.5919
|
Daniel Freedman
|
Daniel Freedman, Eyal Krupka, Yoni Smolin, Ido Leichter, Mirko Schmidt
|
SRA: Fast Removal of General Multipath for ToF Sensors
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A major issue with Time of Flight sensors is the presence of multipath
interference. We present Sparse Reflections Analysis (SRA), an algorithm for
removing this interference which has two main advantages. First, it allows for
very general forms of multipath, including interference with three or more
paths, diffuse multipath resulting from Lambertian surfaces, and combinations
thereof. SRA removes this general multipath with robust techniques based on
$L_1$ optimization. Second, due to a novel dimension reduction, we are able to
produce a very fast version of SRA, which is able to run at frame rate.
Experimental results on both synthetic data with ground truth, as well as real
images of challenging scenes, validate the approach.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 11:28:52 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Freedman",
"Daniel",
""
],
[
"Krupka",
"Eyal",
""
],
[
"Smolin",
"Yoni",
""
],
[
"Leichter",
"Ido",
""
],
[
"Schmidt",
"Mirko",
""
]
] |
new_dataset
| 0.978797 |
1403.6006
|
Hong Cao Dr
|
Hong Cao
|
A Tablet Based Learning Environment
|
34 pages, 14 figures
| null | null | null |
cs.CY cs.HC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Pen computing tools such as Tablet PC, Tablet Monitors and its various
supporting software tool offer another dimension to enhance our today's
digitally integrated and connected classroom learning environment. This paper
first reviews the various state-of-the-art pen-computing hardware and software
that have been applied in the classroom setting to introduce student-centric
learning, collaboration and making annotations and designing classroom
activities easier. We then propose a new classroom environment which is fully
equipped with Tablet devices and the supporting software tools for the goals of
1) easy electronic ink annotations with least constraints; 2) enhanced active
learning with timely feedback; 3) enhanced student collaborations and 4)
lecture recording. The classroom has been put into practical teaching and
learning environment as a pilot project in our higher learning environment.
After overcoming the initial learning curves, the environment received positive
feedbacks from the teaching faculties as well as from the students.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 15:39:43 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Cao",
"Hong",
""
]
] |
new_dataset
| 0.99856 |
1403.6060
|
Alexey Sorokin
|
Alexey Sorokin
|
Monoid automata for displacement context-free languages
|
Revised version for ESSLLI Student Session 2013 selected papers
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 2007 Kambites presented an algebraic interpretation of
Chomsky-Schutzenberger theorem for context-free languages. We give an
interpretation of the corresponding theorem for the class of displacement
context-free languages which are equivalent to well-nested multiple
context-free languages. We also obtain a characterization of k-displacement
context-free languages in terms of monoid automata and show how such automata
can be simulated on two stacks. We introduce the simultaneous two-stack
automata and compare different variants of its definition. All the definitions
considered are shown to be equivalent basing on the geometric interpretation of
memory operations of these automata.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 17:51:32 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Sorokin",
"Alexey",
""
]
] |
new_dataset
| 0.99955 |
1403.6090
|
Mohammad Gholami
|
Mohammad Gholami, Ghaffar Raeisi
|
Column Weight Two and Three LDPC Codes with High Rates and Large Girths
|
6 pages, 6 figures, 1 table
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the concept of the {\it broken diagonal pair} in the
chess-like square board is used to define some well-structured block designs
whose incidence matrices can be considered as the parity-check matrices of some
high rate cycle codes with girth 12. The structure of the proposed parity-check
matrices significantly reduces the complexity of encoding and decoding.
Interestingly, the constructed regular cycle codes with row-weights $t$, $3\leq
t \leq 20$, $t\neq 7, 15, 16$, have the best lengths among the known regular
girth-12 cycle codes. In addition, the proposed cycle codes can be easily
extended to some high rate column weight-3 LDPC codes with girth 6. Simulation
results show that the constructed codes achieve excellent performances,
specially the constructed column weight 3 LDPC codes outperform LDPC codes
based on Steiner triple systems (STS).
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 19:15:45 GMT"
}
] | 2014-03-25T00:00:00 |
[
[
"Gholami",
"Mohammad",
""
],
[
"Raeisi",
"Ghaffar",
""
]
] |
new_dataset
| 0.981744 |
1402.4843
|
Aleksandar Perisic
|
Aleksandar Perisic
|
Exercise: +-1 bug and center of an array problem
|
18 pages
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A problem that is constantly cropping up in designing even the simplest
algorithm or a program is dealing with +-1 bug when we calculate positions
within an array, very noticeably while splitting it in half. This bug is often
found in buffer overflow type of bugs. While designing one complicated
algorithm, we needed various ways of splitting an array, and we found lack of
general guidance for this apparently minor problem. We present an exercise that
tracks the cause of the problem and leads to the solution. This problem looks
trivial because it seems obvious or insignificant, however treating it without
outmost precision can lead to subtle bugs, unbalanced solution, not transparent
expressions for various languages. Basically, the exercise is about dealing
with <= < as well as n/2, n/2-1, (n+1)/2, n-1 and similar expressions when they
are rounded down to the nearest integer and used to define a range.
|
[
{
"version": "v1",
"created": "Wed, 19 Feb 2014 22:50:29 GMT"
},
{
"version": "v2",
"created": "Sun, 2 Mar 2014 12:51:39 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Mar 2014 12:33:13 GMT"
},
{
"version": "v4",
"created": "Wed, 12 Mar 2014 07:59:05 GMT"
},
{
"version": "v5",
"created": "Fri, 21 Mar 2014 08:44:07 GMT"
}
] | 2014-03-24T00:00:00 |
[
[
"Perisic",
"Aleksandar",
""
]
] |
new_dataset
| 0.994785 |
1403.3431
|
Marzio De Biasi
|
Marzio De Biasi
|
Minimal TSP Tour is coNP-Complete
|
5 pages, 1 figure
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of deciding if a Traveling Salesman Problem (TSP) tour is minimal
was proved to be coNP-complete by Papadimitriou and Steiglitz. We give an
alternative proof based on a polynomial time reduction from 3SAT. Like the
original proof, our reduction also shows that given a graph $G$ and an
Hamiltonian path of $G$, it is NP-complete to check if $G$ contains an
Hamiltonian cycle (Restricted Hamiltonian Cycle problem).
|
[
{
"version": "v1",
"created": "Thu, 13 Mar 2014 21:00:36 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Mar 2014 07:54:49 GMT"
}
] | 2014-03-24T00:00:00 |
[
[
"De Biasi",
"Marzio",
""
]
] |
new_dataset
| 0.996211 |
1403.5345
|
Xinyang Deng
|
Xiaoge Zhang, Andrew Adamatzky, Xin-She Yang, Hai Yang, Sankaran
Mahadevan, Yong Deng
|
A Physarum-Inspired Approach to Optimal Supply Chain Network Design at
Minimum Total Cost with Demand Satisfaction
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A supply chain is a system which moves products from a supplier to customers.
The supply chains are ubiquitous. They play a key role in all economic
activities. Inspired by biological principles of nutrients' distribution in
protoplasmic networks of slime mould Physarum polycephalum we propose a novel
algorithm for a supply chain design. The algorithm handles the supply networks
where capacity investments and product flows are variables. The networks are
constrained by a need to satisfy product demands. Two features of the slime
mould are adopted in our algorithm. The first is the continuity of a flux
during the iterative process, which is used in real-time update of the costs
associated with the supply links. The second feature is adaptivity. The supply
chain can converge to an equilibrium state when costs are changed. Practicality
and flexibility of our algorithm is illustrated on numerical examples.
|
[
{
"version": "v1",
"created": "Fri, 21 Mar 2014 02:32:20 GMT"
}
] | 2014-03-24T00:00:00 |
[
[
"Zhang",
"Xiaoge",
""
],
[
"Adamatzky",
"Andrew",
""
],
[
"Yang",
"Xin-She",
""
],
[
"Yang",
"Hai",
""
],
[
"Mahadevan",
"Sankaran",
""
],
[
"Deng",
"Yong",
""
]
] |
new_dataset
| 0.988945 |
1403.5401
|
Reza Chandra
|
Renny Renny and Reza Chandra and Syamsi Ruhama and Mochammad Wisuda
Sarjono
|
Exploring Indonesian Web Based Career Center Discrepancy of Web
Popularity and Type of Services
|
Journal of Advances in Computer Science and its Applications
|
UACEE International Journal of Advances in Computer Science and
its Applications IJCSIA Volume 3 Issue 2 Publication Date 5 June 2013
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Utilization of the Internet in higher education focus on the learning process
or the provision of academic information for students. The subject of this
research is in the form of web-based management alumnus Career Center with
specific sub domain. Colleges that already have a Career Center only 34 of the
264 colleges as sample. Type the service the most are information jobs, while
others are still rarely available as a forum of alumni and career consultation.
Ownership Career Center contributed to the popularity of college website.
Providing services such as communication and consultation career impact on the
popularity of the Career Center website.
|
[
{
"version": "v1",
"created": "Fri, 21 Mar 2014 09:28:22 GMT"
}
] | 2014-03-24T00:00:00 |
[
[
"Renny",
"Renny",
""
],
[
"Chandra",
"Reza",
""
],
[
"Ruhama",
"Syamsi",
""
],
[
"Sarjono",
"Mochammad Wisuda",
""
]
] |
new_dataset
| 0.997999 |
1312.6173
|
Karl Moritz Hermann
|
Karl Moritz Hermann and Phil Blunsom
|
Multilingual Distributed Representations without Word Alignment
|
To appear at ICLR 2014
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed representations of meaning are a natural way to encode covariance
relationships between words and phrases in NLP. By overcoming data sparsity
problems, as well as providing information about semantic relatedness which is
not available in discrete representations, distributed representations have
proven useful in many NLP tasks. Recent work has shown how compositional
semantic representations can successfully be applied to a number of monolingual
applications such as sentiment analysis. At the same time, there has been some
initial success in work on learning shared word-level representations across
languages. We combine these two approaches by proposing a method for learning
distributed representations in a multilingual setup. Our model learns to assign
similar embeddings to aligned sentences and dissimilar ones to sentence which
are not aligned while not requiring word alignments. We show that our
representations are semantically informative and apply them to a cross-lingual
document classification task where we outperform the previous state of the art.
Further, by employing parallel corpora of multiple language pairs we find that
our model learns representations that capture semantic relationships across
languages for which no parallel data was used.
|
[
{
"version": "v1",
"created": "Fri, 20 Dec 2013 23:13:38 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Feb 2014 20:24:06 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Mar 2014 17:52:13 GMT"
},
{
"version": "v4",
"created": "Thu, 20 Mar 2014 13:55:02 GMT"
}
] | 2014-03-21T00:00:00 |
[
[
"Hermann",
"Karl Moritz",
""
],
[
"Blunsom",
"Phil",
""
]
] |
new_dataset
| 0.982382 |
1403.5128
|
Parul Pandey ms
|
Parul Pandey, Mahshwari Tripathi
|
A Novel Quorum Protocol
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the traditional mechanisms used in distributed systems for maintaining
the consistency of replicated data is voting.
A problem involved in voting mechanisms is the size of the Quorums needed on
each access to the data. In this paper, we present a novel and efficient
distributed algorithm for managing replicated data. We impose a logical wheel
structure on the set of copies of an object. The protocol ensures minimum read
quorum size of one, by reading one copy of an object while guaranteeing
fault-tolerance of write operations.Wheel structure has a wider application
area as it can be imposed in a network with any number of nodes.
|
[
{
"version": "v1",
"created": "Thu, 20 Mar 2014 13:20:07 GMT"
}
] | 2014-03-21T00:00:00 |
[
[
"Pandey",
"Parul",
""
],
[
"Tripathi",
"Mahshwari",
""
]
] |
new_dataset
| 0.986849 |
1403.4795
|
James Whiting
|
James Gerald Holland Whiting, Ben de Lacy Costello, Andrew Adamatzky
|
Sensory fusion in Physarum polycephalum and implementing multi-sensory
functional computation
|
18 pages, 2 figures, 4 tables
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Surface electrical potential and observational growth recordings were made of
a protoplasmic tube of the slime mould Physarum polycephalum in response to a
multitude of stimuli with regards to sensory fusion or multisensory
integration. Each stimulus was tested alone and in combination in order to
evaluate for the first time the effect that multiple stimuli have on the
frequency of streaming oscillation. White light caused a decrease in frequency
whilst increasing the temperature and applying a food source in the form of oat
flakes both increased the frequency. Simultaneously stimulating P. polycephalum
with light and oat flake produced no net change in frequency, while combined
light and heat stimuli showed an increase in frequency smaller than that
observed for heat alone. When the two positive stimuli, oat flakes and heat,
were combined, there was a net increase in frequency similar to the cumulative
increases caused by the individual stimuli. Boolean logic gates were derived
from the measured frequency change.
|
[
{
"version": "v1",
"created": "Wed, 19 Mar 2014 13:24:54 GMT"
}
] | 2014-03-20T00:00:00 |
[
[
"Whiting",
"James Gerald Holland",
""
],
[
"Costello",
"Ben de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.997464 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.