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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1310.4573
|
EPTCS
|
Julien Lange (University of Leicester, UK), Alceste Scalas (University
of Cagliari, Italy)
|
Choreography Synthesis as Contract Agreement
|
In Proceedings ICE 2013, arXiv:1310.4019
|
EPTCS 131, 2013, pp. 52-67
|
10.4204/EPTCS.131.6
| null |
cs.LO cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a formal model for distributed systems, where each participant
advertises its requirements and obligations as behavioural contracts, and where
multiparty sessions are started when a set of contracts allows to synthesise a
choreography. Our framework is based on the CO2 calculus for contract-oriented
computing, and borrows concepts and results from the session type literature.
It supports sessions where the number of participants is not determined
beforehand, and keeps CO2's ability to rule out participants that are culpable
if contracts are not fulfilled at runtime. We show that we have progress and
session fidelity in CO2, as a result of the honesty of participants - i.e.,
their ability to always adhere to their contracts.
|
[
{
"version": "v1",
"created": "Thu, 17 Oct 2013 03:48:09 GMT"
}
] | 2013-10-18T00:00:00 |
[
[
"Lange",
"Julien",
"",
"University of Leicester, UK"
],
[
"Scalas",
"Alceste",
"",
"University\n of Cagliari, Italy"
]
] |
new_dataset
| 0.999334 |
1309.3467
|
Vijayvaradharaj Muralidharan
|
Vijayvaradharaj T. Muralidharan and B. Sundar Rajan
|
Wireless Bidirectional Relaying, Latin Squares and Graph Vertex Coloring
|
18 pages, 19 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of obtaining network coding maps for the physical layer network
coded two-way relay channel is considered, using the denoise-and-forward
forward protocol. It is known that network coding maps used at the relay node
which ensure unique decodability at the end nodes form a Latin Square. Also, it
is known that minimum distance of the effective constellation at the relay node
becomes zero, when the ratio of the fade coefficients from the end node to the
relay node, belongs to a finite set of complex numbers determined by the signal
set used, called the singular fade states. Furthermore, it has been shown
recently that the problem of obtaining network coding maps which remove the
harmful effects of singular fade states, reduces to the one of obtaining Latin
Squares, which satisfy certain constraints called \textit{singularity removal
constraints}. In this paper, it is shown that the singularity removal
constraints along with the row and column exclusion conditions of a Latin
Square, can be compactly represented by a graph called the \textit{singularity
removal graph} determined by the singular fade state and the signal set used.
It is shown that a Latin Square which removes a singular fade state can be
obtained from a proper vertex coloring of the corresponding singularity removal
graph. The minimum number of symbols used to fill in a Latin Square which
removes a singular fade state is equal to the chromatic number of the
singularity removal graph. It is shown that for any square $M$-QAM signal set,
there exists singularity removal graphs whose chromatic numbers exceed $M$ and
hence require more than $M$ colors for vertex coloring. Also, it is shown that
for any $2^{\lambda}$-PSK signal set, $\lambda \geq 3,$ all the singularity
removal graphs can be colored using $2^{\lambda}$ colors.
|
[
{
"version": "v1",
"created": "Fri, 13 Sep 2013 14:36:46 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Oct 2013 16:08:39 GMT"
}
] | 2013-10-17T00:00:00 |
[
[
"Muralidharan",
"Vijayvaradharaj T.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.999401 |
1310.4231
|
Sparsh Mittal
|
Sparsh Mittal
|
Dynamic cache reconfiguration based techniques for improving cache
energy efficiency
|
PhD thesis, dynamic cache reconfiguration
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern multicore processors are employing large last-level caches, for
example Intel's E7-8800 processor uses 24MB L3 cache. Further, with each CMOS
technology generation, leakage energy has been dramatically increasing and
hence, leakage energy is expected to become a major source of energy
dissipation, especially in last-level caches (LLCs). The conventional schemes
of cache energy saving either aim at saving dynamic energy or are based on
properties specific to first-level caches, and thus these schemes have limited
utility for last-level caches. Further, several other techniques require
offline profiling or per-application tuning and hence are not suitable for
product systems. In this research, we propose novel cache leakage energy saving
schemes for single-core and multicore systems; desktop, QoS, real-time and
server systems. We propose software-controlled, hardware-assisted techniques
which use dynamic cache reconfiguration to configure the cache to the most
energy efficient configuration while keeping the performance loss bounded. To
profile and test a large number of potential configurations, we utilize
low-overhead, micro-architecture components, which can be easily integrated
into modern processor chips. We adopt a system-wide approach to save energy to
ensure that cache reconfiguration does not increase energy consumption of other
components of the processor. We have compared our techniques with the
state-of-art techniques and have found that our techniques outperform them in
their energy efficiency. This research has important applications in improving
energy-efficiency of higher-end embedded, desktop, server processors and
multitasking systems. We have also proposed performance estimation approach for
efficient design space exploration and have implemented time-sampling based
simulation acceleration approach for full-system architectural simulators.
|
[
{
"version": "v1",
"created": "Wed, 16 Oct 2013 00:41:12 GMT"
}
] | 2013-10-17T00:00:00 |
[
[
"Mittal",
"Sparsh",
""
]
] |
new_dataset
| 0.987167 |
1310.4270
|
Rajib Rana
|
Rajib Rana, Chun Tung Chou, Nirupama Bulusu, Salil Kanhere, Wen Hu
|
Ear-Phone: A Context-Aware Noise Mapping using Smart Phones
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A noise map facilitates the monitoring of environmental noise pollution in
urban areas. However, state-of-the-art techniques for rendering noise maps in
urban areas are expensive and rarely updated, as they rely on population and
traffic models rather than on real data. Smart phone based urban sensing can be
leveraged to create an open and inexpensive platform for rendering up-to- date
noise maps. In this paper, we present the design, implementation and
performance evaluation of an end-to-end, context-aware, noise mapping system
called Ear-Phone. Ear-Phone investigates the use of different interpolation and
regularization methods to address the fundamental problem of recovering the
noise map from incomplete and random samples obtained by crowdsourcing data
collection. Ear-Phone, implemented on Nokia N95, N97 and HP iPAQ, HTC One
mobile devices, also addresses the challenge of collecting accurate noise
pollution readings at a mobile device. A major challenge of using smart phones
as sensors is that even at the same location, the sensor reading may vary
depending on the phone orientation and user context (for example, whether the
user is carrying the phone in a bag or holding it in her palm). To address this
problem, Ear-Phone leverages context-aware sensing. We develop classifiers to
accurately determine the phone sensing context. Upon context discovery,
Ear-Phone automatically decides whether to sense or not. Ear-phone also
implements in-situ calibration which performs simple calibration that can be
carried out without any technical skills whatsoever required on the user's
part. Extensive simulations and outdoor experiments demonstrate that Ear-Phone
is a feasible platform to assess noise pollution, incurring reasonable system
resource consumption at mobile devices and providing high reconstruction
accuracy of the noise map.
|
[
{
"version": "v1",
"created": "Wed, 16 Oct 2013 05:04:28 GMT"
}
] | 2013-10-17T00:00:00 |
[
[
"Rana",
"Rajib",
""
],
[
"Chou",
"Chun Tung",
""
],
[
"Bulusu",
"Nirupama",
""
],
[
"Kanhere",
"Salil",
""
],
[
"Hu",
"Wen",
""
]
] |
new_dataset
| 0.999244 |
1310.4282
|
Wenyuan Tang
|
Wenyuan Tang and Rahul Jain
|
A Nash Equilibrium Need Not Exist in the Locational Marginal Pricing
Mechanism
| null | null | null | null |
cs.GT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Locational marginal pricing (LMP) is a widely employed method for pricing
electricity in the wholesale electricity market. Although it is well known that
the LMP mechanism is vulnerable to market manipulation, there is little
literature providing a systematic analysis of this phenomenon. In the first
part of this paper, we investigate the economic dispatch outcomes of the LMP
mechanism with strategic agents. We show via counterexamples, that contrary to
popular belief, a Nash equilibrium may not exist. And when it exists, the price
of anarchy may be arbitrarily large. We then provide two sufficient conditions
under either of which an efficient Nash equilibria exists. Last, we propose a
new market mechanism for electricity markets, the Power Network Second Price
(PNSP) mechanism that always induces an efficient Nash equilibrium. We briefly
address the extensions on the demand side.
|
[
{
"version": "v1",
"created": "Wed, 16 Oct 2013 06:51:14 GMT"
}
] | 2013-10-17T00:00:00 |
[
[
"Tang",
"Wenyuan",
""
],
[
"Jain",
"Rahul",
""
]
] |
new_dataset
| 0.983862 |
1310.4306
|
Tom Hirschowitz
|
Clovis Eberhart (LAMA), Tom Hirschowitz (LAMA), Thomas Seiller (LAMA,
IRISA / INRIA Rennes)
|
Fully-abstract concurrent games for pi
|
20 pages, submitted
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a semantics for Milner's pi-calculus, with three main novelties.
First, it provides a fully-abstract model for fair testing equivalence, whereas
previous semantics covered variants of bisimilarity and the may and must
testing equivalences. Second, it is based on reduction semantics, whereas
previous semantics were based on labelled transition systems. Finally, it has a
strong game semantical flavor in the sense of Hyland-Ong and Nickau. Indeed,
our model may both be viewed as an innocent presheaf semantics and as a
concurrent game semantics.
|
[
{
"version": "v1",
"created": "Wed, 16 Oct 2013 09:49:12 GMT"
}
] | 2013-10-17T00:00:00 |
[
[
"Eberhart",
"Clovis",
"",
"LAMA"
],
[
"Hirschowitz",
"Tom",
"",
"LAMA"
],
[
"Seiller",
"Thomas",
"",
"LAMA,\n IRISA / INRIA Rennes"
]
] |
new_dataset
| 0.974292 |
1310.4485
|
Baochang Zhang
|
Juan Liu, Baochang Zhang, Linlin Shen, Jianzhuang Liu, Jason Zhao
|
The BeiHang Keystroke Dynamics Authentication System
|
25 pages,17 figures,5 tables
| null | null | null |
cs.CR cs.LG
|
http://creativecommons.org/licenses/by/3.0/
|
Keystroke Dynamics is an important biometric solution for person
authentication. Based upon keystroke dynamics, this paper designs an embedded
password protection device, develops an online system, collects two public
databases for promoting the research on keystroke authentication, exploits the
Gabor filter bank to characterize keystroke dynamics, and provides benchmark
results of three popular classification algorithms, one-class support vector
machine, Gaussian classifier, and nearest neighbour classifier.
|
[
{
"version": "v1",
"created": "Tue, 15 Oct 2013 12:12:44 GMT"
}
] | 2013-10-17T00:00:00 |
[
[
"Liu",
"Juan",
""
],
[
"Zhang",
"Baochang",
""
],
[
"Shen",
"Linlin",
""
],
[
"Liu",
"Jianzhuang",
""
],
[
"Zhao",
"Jason",
""
]
] |
new_dataset
| 0.969319 |
1310.3849
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on laptop keyboards -A study based on US patents
|
Published in TRIZsite Journal, May 2005, also available at
http://papers.ssrn.com/abstract=932274. arXiv admin note: substantial text
overlap with arXiv:1307.5426, arXiv:1310.3268, arXiv:1310.3070
| null |
10.2139/ssrn.932274
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A desktop keyboard has several sections like character key section,
navigation key section, numeric key section, and function key section etc. each
consisting of several number of keys. However, a laptop computer does not have
so much of space to accommodate all these keys into the keyboard. There are
several considerations while designing a laptop keyboard.
This article illustrates 10 inventions on keyboards for laptop and portable
computers. The inventions are selected from US patent database. The inventions
try to improve various aspects of a laptop keyboard, such as reducing size,
folding and concealing, ergonomic features, improving quality and reducing
cost.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 14:49:38 GMT"
}
] | 2013-10-16T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999123 |
1310.3850
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on modular keyboards: A TRIZ based analysis
|
Published in TRIZsite Journal, March 2005, also available in
http://papers.ssrn.com/abstract=932269. arXiv admin note: substantial text
overlap with arXiv:1310.3070, arXiv:1310.3268, arXiv:1310.3849
| null |
10.2139/ssrn.932269
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a standard keyboard is quite spacious many inventions try to use the space
of keyboard to use for various activities. A modular keyboard is designed in
such a way that the components of the keyboard can be attached and detached as
per the need.
This article illustrates 10 inventions on modular keyboard from US patent
database. The objective of these inventions is to make a keyboard modular, so
that the same keyboard can be made smaller by detaching some of its components
and larger by attaching additional attachments. Some modular keyboards provide
slots for external attachments like mouse, telephone, speakers, joystick and
storage devices etc.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 12:00:16 GMT"
}
] | 2013-10-16T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.996463 |
1310.4038
|
Charith Perera
|
Charith Perera, Prem Prakash Jayaraman, Arkady Zaslavsky, Peter
Christen, Dimitrios Georgakopoulos
|
MOSDEN: An Internet of Things Middleware for Resource Constrained Mobile
Devices
| null |
Proceedings of the 47th Hawaii International Conference on System
Sciences (HICSS), Kona, Hawaii, USA, January, 2014
| null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet of Things (IoT) is part of Future Internet and will comprise
many billions of Internet Connected Objects (ICO) or `things' where things can
sense, communicate, compute and potentially actuate as well as have
intelligence, multi-modal interfaces, physical/ virtual identities and
attributes. Collecting data from these objects is an important task as it
allows software systems to understand the environment better. Many different
hardware devices may involve in the process of collecting and uploading sensor
data to the cloud where complex processing can occur. Further, we cannot expect
all these objects to be connected to the computers due to technical and
economical reasons. Therefore, we should be able to utilize resource
constrained devices to collect data from these ICOs. On the other hand, it is
critical to process the collected sensor data before sending them to the cloud
to make sure the sustainability of the infrastructure due to energy
constraints. This requires to move the sensor data processing tasks towards the
resource constrained computational devices (e.g. mobile phones). In this paper,
we propose Mobile Sensor Data Processing Engine (MOSDEN), an plug-in-based IoT
middleware for mobile devices, that allows to collect and process sensor data
without programming efforts. Our architecture also supports sensing as a
service model. We present the results of the evaluations that demonstrate its
suitability towards real world deployments. Our proposed middleware is built on
Android platform.
|
[
{
"version": "v1",
"created": "Tue, 15 Oct 2013 12:50:44 GMT"
}
] | 2013-10-16T00:00:00 |
[
[
"Perera",
"Charith",
""
],
[
"Jayaraman",
"Prem Prakash",
""
],
[
"Zaslavsky",
"Arkady",
""
],
[
"Christen",
"Peter",
""
],
[
"Georgakopoulos",
"Dimitrios",
""
]
] |
new_dataset
| 0.999699 |
1310.4168
|
Vidya Nariyambut Murali
|
Vidya N. Murali, Anthony L. Threatt, Joe Manganelli, Paul M. Yanik,
Sumod K. Mohan, Akshay A. Apte, Raghavendran Ramachandran, Linnea Smolentzov,
Johnell Brooks, Ian D. Walker, Keith E. Green
|
A Mobile Robotic Personal Nightstand with Integrated Perceptual
Processes
|
Submitted to AAAI 2010, IROS 2011
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an intelligent interactive nightstand mounted on a mobile robot,
to aid the elderly in their homes using physical, tactile and visual percepts.
We show the integration of three different sensing modalities for controlling
the navigation of a robot mounted nightstand within the constrained environment
of a general purpose living room housing a single aging individual in need of
assistance and monitoring. A camera mounted on the ceiling of the room, gives a
top-down view of the obstacles, the person and the nightstand. Pressure sensors
mounted beneath the bed-stand of the individual provide physical perception of
the person's state. A proximity IR sensor on the nightstand acts as a tactile
interface along with a Wii Nunchuck (Nintendo) to control mundane operations on
the nightstand. Intelligence from these three modalities are combined to enable
path planning for the nightstand to approach the individual. With growing
emphasis on assistive technology for the aging individuals who are increasingly
electing to stay in their homes, we show how ubiquitous intelligence can be
brought inside homes to help monitor and provide care to an individual. Our
approach goes one step towards achieving pervasive intelligence by seamlessly
integrating different sensors embedded in the fabric of the environment.
|
[
{
"version": "v1",
"created": "Sun, 13 Oct 2013 03:10:54 GMT"
}
] | 2013-10-16T00:00:00 |
[
[
"Murali",
"Vidya N.",
""
],
[
"Threatt",
"Anthony L.",
""
],
[
"Manganelli",
"Joe",
""
],
[
"Yanik",
"Paul M.",
""
],
[
"Mohan",
"Sumod K.",
""
],
[
"Apte",
"Akshay A.",
""
],
[
"Ramachandran",
"Raghavendran",
""
],
[
"Smolentzov",
"Linnea",
""
],
[
"Brooks",
"Johnell",
""
],
[
"Walker",
"Ian D.",
""
],
[
"Green",
"Keith E.",
""
]
] |
new_dataset
| 0.999503 |
1307.2964
|
Xin Li
|
Xin Li, Hua Vy Le Thanh
|
Generating Stack-based Access Control Policies
|
18 pages
| null | null | null |
cs.CR cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The stack-based access control mechanism plays a fundamental role in the
security architecture of Java and Microsoft CLR (common language runtime). It
is enforced at runtime by inspecting methods in the current call stack for
granted permissions before the program performs safety-critical operations.
Although stack inspection is well studied, there is relatively little work on
automated generation of access control policies, and most existing work on
inferring security policies assume the permissions to be checked at stack
inspection points are known beforehand. Practiced approaches to generating
access control policies are still manually done by developers based on
domain-specific knowledges and trial-and-error testing. In this paper, we
present a systematic approach to automated generation of access control
policies for Java programs that necessarily ensure the program to pass stack
inspection. The techniques are abstract interpretation based context-sensitive
static program analyses. Our analysis models the program by combining a
context-sensitive call graph with a dependency graph. We are hereby able to
precisely identify permission requirements at stack inspection points, which
are usually ignored in previous study.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 03:21:25 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Oct 2013 03:47:41 GMT"
}
] | 2013-10-15T00:00:00 |
[
[
"Li",
"Xin",
""
],
[
"Thanh",
"Hua Vy Le",
""
]
] |
new_dataset
| 0.998203 |
1310.3268
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on collapsible keyboards: A TRIZ based analysis
|
Published in TRIZsite Journal, March 2005, also available in
http://papers.ssrn.com/abstract=932268. arXiv admin note: text overlap with
arXiv:1310.3070
| null |
10.2139/ssrn.932268
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although a bigger keyboard is often comfortable to work with, they cannot be
fit into laptop and small size computer boxes. The portable and handheld
computers need small size keyboards. So there is a need to reduce the size of
the keyboard to fit into the laptop box. There are various mechanisms to reduce
the size of the keyboard; collapsible keyboard is one of them.
Although different inventions intend to achieve the same objective of
reducing the keyboard size, they all differ in their mechanism. For example,
some invention uses a compression mechanism, some invention uses a folding
mechanism, and some invention uses a collapsing mechanism and so on.
This article illustrates 10 inventions on collapsible keyboards from US
patent database. Each case is analyzed from a TRIZ perspective.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 10:05:17 GMT"
}
] | 2013-10-15T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.998604 |
1310.3356
|
Feitian Li
|
Feitian Li, Fei Qiao, Qi Wei, Huazhong Yang
|
A Novel Reconfigurable Computing Architecture for Image Signal
Processing Using Circuit-Switched NoC and Synchronous Dataflow Model
|
ISQED 2014,6 pages,7 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel reconfigurable architecture is proposed for
multifunctional image signal processing systems. A circuit-switched NoC is used
to provide interconnection because the non-TMD links ensure fixed throughput,
which is a desirable behavior for computational intensive image processing
algorithms compared with packet-switched NoC. Image processing algorithms are
modeled as synchronous dataflow graphs which provide a unified model for
general computing procedure. An image processing system is considered as
several temporally mutually exclusive algorithms. Thus, their dataflow graph
representations could be considered as a group and a merging algorithm could be
applied to generate a union graph while eliminating spatial redundancy for area
consumption optimization. After the union graph have been mapped and routed on
the NoC, the reconfigurable system could be configured to any of its target
image processing algorithms by properly setting the NoC topology. Experiments
show the demo reconfigurable system with two image processing applications cost
26.4% less hardware resource, compared with the non-reconfigurable
implementations.
|
[
{
"version": "v1",
"created": "Sat, 12 Oct 2013 10:05:07 GMT"
}
] | 2013-10-15T00:00:00 |
[
[
"Li",
"Feitian",
""
],
[
"Qiao",
"Fei",
""
],
[
"Wei",
"Qi",
""
],
[
"Yang",
"Huazhong",
""
]
] |
new_dataset
| 0.998241 |
1310.3473
|
Rohit Jha
|
Rohit Jha, Alfy Samuel, Ashmee Pawar, M. Kiruthika
|
A Domain-Specific Language for Discrete Mathematics
| null |
International Journal of Computer Applications 70(15):6-19, May
2013
|
10.5120/12036-7257
| null |
cs.PL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper discusses a Domain Specific Language (DSL) that has been developed
to enable implementation of concepts of discrete mathematics. A library of data
types and functions provides functionality which is frequently required by
users. Covering the areas of Mathematical Logic, Set Theory, Functions, Graph
Theory, Number Theory, Linear Algebra and Combinatorics, the language's syntax
is close to the actual notation used in the specific fields.
|
[
{
"version": "v1",
"created": "Sun, 13 Oct 2013 12:28:54 GMT"
}
] | 2013-10-15T00:00:00 |
[
[
"Jha",
"Rohit",
""
],
[
"Samuel",
"Alfy",
""
],
[
"Pawar",
"Ashmee",
""
],
[
"Kiruthika",
"M.",
""
]
] |
new_dataset
| 0.999592 |
1310.3723
|
Jean Quilbeuf
|
Jean Quilbeuf, Georgeta Igna, Denis Bytschkow, Harald Ruess
|
Security policies for distributed systems
|
Submitted to POST14
| null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A security policy specifies a security property as the maximal information
flow. A distributed system composed of interacting processes implicitly defines
an intransitive security policy by repudiating direct information flow between
processes that do not exchange messages directly. We show that implicitly
defined security policies in distributed systems are enforced, provided that
processes run in separation, and possible process communication on a technical
platform is restricted to specified message paths of the system. Furthermore,
we propose to further restrict the allowable information flow by adding filter
functions for controlling which messages may be transmitted between processes,
and we prove that locally checking filter functions is sufficient for ensuring
global security policies. Altogether, global intransitive security policies are
established by means of local verification conditions for the (trusted)
processes of the distributed system. Moreover, security policies may be
implemented securely on distributed integration platforms which ensure
partitioning. We illustrate our results with a smart grid case study, where we
use CTL model checking for discharging local verification conditions for each
process under consideration.
|
[
{
"version": "v1",
"created": "Mon, 14 Oct 2013 15:35:42 GMT"
}
] | 2013-10-15T00:00:00 |
[
[
"Quilbeuf",
"Jean",
""
],
[
"Igna",
"Georgeta",
""
],
[
"Bytschkow",
"Denis",
""
],
[
"Ruess",
"Harald",
""
]
] |
new_dataset
| 0.995687 |
1310.3808
|
Philipp Mayr
|
Howard D. White, Philipp Mayr
|
Pennants for Descriptors
|
3 pages, 1 figure, paper presented at the NKOS workshop at TPDL 2013
| null | null | null |
cs.DL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new technique (called pennants) for displaying the descriptors
related to a descriptor across literatures, rather in a thesaurus. It has
definite implications for online searching and browsing. Pennants, named for
the flag they resemble, are a form of algorithmic prediction. Their cognitive
base is in relevance theory (RT) from linguistic pragmatics (Sperber & Wilson
1995).
|
[
{
"version": "v1",
"created": "Mon, 14 Oct 2013 19:49:34 GMT"
}
] | 2013-10-15T00:00:00 |
[
[
"White",
"Howard D.",
""
],
[
"Mayr",
"Philipp",
""
]
] |
new_dataset
| 0.971106 |
1304.6707
|
Rastislav \v{S}r\'amek
|
Mat\'u\v{s} Mihal\'ak and Rastislav \v{S}r\'amek and Peter Widmayer
|
Counting approximately-shortest paths in directed acyclic graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a directed acyclic graph with positive edge-weights, two vertices s and
t, and a threshold-weight L, we present a fully-polynomial time
approximation-scheme for the problem of counting the s-t paths of length at
most L. We extend the algorithm for the case of two (or more) instances of the
same problem. That is, given two graphs that have the same vertices and edges
and differ only in edge-weights, and given two threshold-weights L_1 and L_2,
we show how to approximately count the s-t paths that have length at most L_1
in the first graph and length at most L_2 in the second graph. We believe that
our algorithms should find application in counting approximate solutions of
related optimization problems, where finding an (optimum) solution can be
reduced to the computation of a shortest path in a purpose-built auxiliary
graph.
|
[
{
"version": "v1",
"created": "Wed, 24 Apr 2013 19:46:23 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Oct 2013 13:41:42 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Mihalák",
"Matúš",
""
],
[
"Šrámek",
"Rastislav",
""
],
[
"Widmayer",
"Peter",
""
]
] |
new_dataset
| 0.99784 |
1310.2960
|
Wei Liu Dr
|
Wei Zhang, Wei Liu, Siliang Wu, Ju Wang
|
Joint DOA and Array Manifold Estimation for a MIMO Array Using Two
Calibrated Antennas
|
5 pages, 4 figures
| null | null | null |
cs.IT math.IT math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A simple scheme for joint direction of arrival (DOA) and array manifold
estimation for a MIMO array system is proposed, where only two transmit
antennas are calibrated initially. It first obtains a set of initial DOA
results by employing a rotational invariance property between two sets of
received data, and then more accurate DOA and array manifold estimation is
obtained through a local searching algorithm with several iterations. No strict
half wavelength spacing is required for the uncalibrated antennas to avoid the
spatial aliasing problem.
|
[
{
"version": "v1",
"created": "Thu, 10 Oct 2013 20:35:30 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Zhang",
"Wei",
""
],
[
"Liu",
"Wei",
""
],
[
"Wu",
"Siliang",
""
],
[
"Wang",
"Ju",
""
]
] |
new_dataset
| 0.994958 |
1310.3070
|
Umakant Mishra
|
Umakant Mishra
|
Inventions on reducing keyboard size: A TRIZ based analysis
|
Published in TRIZsite Journal, March 2005, also available in
http://papers.ssrn.com/abstract=931683
| null |
10.2139/ssrn.931683
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A conventional computer keyboard consists of as many as 101 keys. The
keyboard has several sections, such as text entry section, navigation section,
and numeric keypad etc. and each having several keys on the keyboard.
The size of the keyboard is a major inconvenience for portable computers, as
they cannot be carried easily. Thus there are certain circumstances which
compels to reduce the size of a keyboard.
Reducing the size of a keyboard leads to several problems. A reduced size
keyboard may not contain all the keys available on a full size keyboard; a
reduced size keyboard may not be convenient to operate, a reduced size keyboard
may have a different key layout which is difficult to learn etc.
This article illustrates 10 inventions on reducing the size of the keyboard.
Various inventions have attempted to solve the contradictions so that the user
achieves the benefits of both "reduced size" and "typing comfort".
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 09:54:57 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999217 |
1310.3107
|
Marek Zawirski
|
Marek Zawirski (INRIA Rocquencourt, LIP6), Annette Bieniusa, Valter
Balegas (CITI), S\'ergio Duarte (CITI), Carlos Baquero (Universidade do Minho
Departamento de Inform\'atica), Marc Shapiro (INRIA Rocquencourt, LIP6), Nuno
Pregui\c{c}a (CITI)
|
SwiftCloud: Fault-Tolerant Geo-Replication Integrated all the Way to the
Client Machine
| null |
N° RR-8347 (2013)
| null |
RR-8347
|
cs.DC cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Client-side logic and storage are increasingly used in web and mobile
applications to improve response time and availability. Current approaches tend
to be ad-hoc and poorly integrated with the server-side logic. We present a
principled approach to integrate client- and server-side storage. We support
mergeable and strongly consistent transactions that target either client or
server replicas and provide access to causally-consistent snapshots
efficiently. In the presence of infrastructure faults, a client-assisted
failover solution allows client execution to resume immediately and seamlessly
access consistent snapshots without waiting. We implement this approach in
SwiftCloud, the first transactional system to bring geo-replication all the way
to the client machine. Example applications show that our programming model is
useful across a range of application areas. Our experimental evaluation shows
that SwiftCloud provides better fault tolerance and at the same time can
improve both latency and throughput by up to an order of magnitude, compared to
classical geo-replication techniques.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 12:38:58 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Zawirski",
"Marek",
"",
"INRIA Rocquencourt, LIP6"
],
[
"Bieniusa",
"Annette",
"",
"CITI"
],
[
"Balegas",
"Valter",
"",
"CITI"
],
[
"Duarte",
"Sérgio",
"",
"CITI"
],
[
"Baquero",
"Carlos",
"",
"Universidade do Minho\n Departamento de Informática"
],
[
"Shapiro",
"Marc",
"",
"INRIA Rocquencourt, LIP6"
],
[
"Preguiça",
"Nuno",
"",
"CITI"
]
] |
new_dataset
| 0.999673 |
1310.3111
|
Umakant Mishra
|
Umakant Mishra
|
Keyboard for inputting Chinese language
|
Published in TRIZsite Journal, Apr 2005, also available in
http://papers.ssrn.com/abstract=932271
| null |
10.2139/ssrn.932271
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the structure of Chinese characters are very different, it is very
difficult to input Chinese characters into computer quickly and conveniently.
The conventional keyboard does not support the pictorial characters in Chinese
language. There are 3000 to 6000 commonly used pictorial Chinese characters
(Hanzi).
There are a few existing systems which include "PinYin" (phonetic) system, a
combination of the PinYin system and character form techniques, whole character
encoding, stroke input encoding, and stoke form encoding. Each of the methods
have their own advantages and disadvantages. This article describes two
inventions on inputting Chinese language through a standard keyboard.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 12:56:08 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999343 |
1310.3115
|
Umakant Mishra
|
Umakant Mishra
|
Keyboards for inputting Japanese language -A study based on US patents
|
Published in TRIZsite Journal, April 2005, also available at
http://papers.ssrn.com/abstract=932272
| null |
10.2139/ssrn.932272
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The most commonly used Japanese alphabets are Kanji, Hiragana and Katakana.
The Kanji alphabet includes pictographs or ideographic characters that were
adopted from the Chinese alphabet. Hiragana is used to spell words of Japanese
origin, while Katakana is used to spell words of western or other foreign
origin.
Two methods are commonly used to input Japanese to the computer. One, the
'kana input method' that uses a keyboard having 46 Japanese iroha (or kana)
letter keys. The other method is 'Roma-ji input method', where the Japanese
letters are composed of English input from a standard QWERTY keyboard. Both the
methods have their advantages and disadvantages.
This article analyses two inventions on inputting Japanese language through a
computer keyboard. One invention uses a standard English keyboard to input
Japanese characters, the other invention uses a standard mobile phone key board
to input the Japanese characters.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 13:15:30 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.992791 |
1310.3140
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on Keyboard Key Switch Mechanism
|
Published in TRIZsite Journal, May 2005, also available in
http://papers.ssrn.com/abstract=932273
| null |
10.2139/ssrn.932273
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The key switches of the keyboard of a computer system are generally comprised
of a key cap having a plunger, conductive rubber disposed above a membrane
circuit and compressed by the plunger to trigger the membrane circuit causing
it to produce an electric signal to the computer.
Some key switches use springs. Some other keyboards use rubber domes or a
dome sheet, which do the function of springs. When the user depresses the key
button the spring or domes collapse. The key switch depresses the key stem,
which actuates the button on the membrane circuit. When the user releases the
button the springs or rubber domes push the button up to the rest position.
This article illustrates 10 inventions on different key switch mechanism. The
inventions are selected from US patent database. The inventions try to simplify
the mechanism, reduce manufacturing cost, increase accuracy and reliability,
and increase strength and robustness of the keys.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 14:23:27 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.999616 |
1310.3145
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on special type of keyboards -A study based on US patents
|
Published in TRIZsite Journal, May 2005, also available in
http://papers.ssrn.com/abstract=932275
| null |
10.2139/ssrn.932275
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A keyboard is the most important input device for a computer. It is used with
various types and sizes of computer. But the same standard keyboard will not
work efficiently with different types of computers at different environments.
There is a need to develop special keyboards to meet special requirements.
This article illustrates 10 inventions on special types of keyboards. The
special keyboard are used in special computers or computers used for special
purposes. A special keyboard is to be understood as a keyboard having features
beyond a normal keyboard.
The example of special keyboards are, a children's keyboard which may be
colorful and attractive, a keyboard in public place need to be more robust, the
keyboard in a palmtop may have less number of keys, the keyboard for a game
station may have special attachments, a multimedia keyboard may have CD ROM and
speakers, a wireless keyboard may have remote control features, a touch
sensitive keyboard may have sensors on the keys and so on.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 14:40:49 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.997658 |
1310.3165
|
Umakant Mishra
|
Umakant Mishra
|
10 Inventions on Key Guides and Keyboard Templates
|
Published in TRIZsite Journal, June 2005, also available at
http://papers.ssrn.com/abstract=932276
| null |
10.2139/ssrn.932276
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A keyboard has many function keys and each function key can have multiple
functions when used with control, shift and alt keys, it is difficult for a
user to remember the functionality of the function keys. We need a mechanism to
indicate the operations assigned to each function key for different software
programs. A keyboard guide or template is used for this purpose.
This article illustrates 10 inventions on keyboard key guide and function key
templates selected from US patent database. Various mechanisms of keyboard
templates have been proposed, including static, dynamic, manual, mechanical,
onscreen display and others.
|
[
{
"version": "v1",
"created": "Fri, 11 Oct 2013 15:21:05 GMT"
}
] | 2013-10-14T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.99201 |
1310.2814
|
Suyash Gupta
|
Suyash Gupta, V. Krishna Nandivada
|
IMSuite: A Benchmark Suite for Simulating Distributed Algorithms
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Considering the diverse nature of real-world distributed applications that
makes it hard to identify a representative subset of distributed benchmarks, we
focus on their underlying distributed algorithms. We present and characterize a
new kernel benchmark suite (named IMSuite) that simulates some of the classical
distributed algorithms in task parallel languages. We present multiple
variations of our kernels, broadly categorized under two heads: (a) varying
synchronization primitives (with and without fine grain synchronization
primitives); and (b) varying forms of parallelization (data parallel and
recursive task parallel). Our characterization covers interesting aspects of
distributed applications such as distribution of remote communication requests,
number of synchronization, task creation, task termination and atomic
operations. We study the behavior (execution time) of our kernels by varying
the problem size, the number of compute threads, and the input configurations.
We also present an involved set of input generators and output validators.
|
[
{
"version": "v1",
"created": "Thu, 10 Oct 2013 13:40:51 GMT"
}
] | 2013-10-11T00:00:00 |
[
[
"Gupta",
"Suyash",
""
],
[
"Nandivada",
"V. Krishna",
""
]
] |
new_dataset
| 0.997856 |
1310.2342
|
Heba Aly
|
Heba Aly, Moustafa Youssef
|
Dejavu: An Accurate Energy-Efficient Outdoor Localization System
| null |
21st ACM SIGSPATIAL International Conference on Advances in
Geographic Information Systems (ACM SIGSPATIAL GIS 2013)
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Dejavu, a system that uses standard cell-phone sensors to provide
accurate and energy-efficient outdoor localization suitable for car navigation.
Our analysis shows that different road landmarks have a unique signature on
cell-phone sensors; For example, going inside tunnels, moving over bumps, going
up a bridge, and even potholes all affect the inertial sensors on the phone in
a unique pattern. Dejavu employs a dead-reckoning localization approach and
leverages these road landmarks, among other automatically discovered abundant
virtual landmarks, to reset the accumulated error and achieve accurate
localization. To maintain a low energy profile, Dejavu uses only
energy-efficient sensors or sensors that are already running for other
purposes. We present the design of Dejavu and how it leverages crowd-sourcing
to automatically learn virtual landmarks and their locations. Our evaluation
results from implementation on different android devices in both city and
highway driving show that Dejavu can localize cell phones to within 8.4m median
error in city roads and 16.6m on highways. Moreover, compared to GPS and other
state-of-the-art systems, Dejavu can extend the battery lifetime by 347%,
achieving even better localization results than GPS in the more challenging
in-city driving conditions.
|
[
{
"version": "v1",
"created": "Wed, 9 Oct 2013 04:38:58 GMT"
}
] | 2013-10-10T00:00:00 |
[
[
"Aly",
"Heba",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.999294 |
1310.2452
|
Iti Sharma
|
Iti Sharma
|
Fully Homomorphic Encryption Scheme with Symmetric Keys
|
64 pages, dissertation report
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
Homomorphic encryption has largely been studied in context of public key
cryptosystems. But there are applications which inherently would require
symmetric keys. We propose a symmetric key encryption scheme with fully
homomorphic evaluation capabilities. The operations are matrix based, that is
the scheme consists of mapping the operations on integers to operations on
matrix. We also include a protocol which uses the proposed scheme for private
data processing in clouds.
|
[
{
"version": "v1",
"created": "Wed, 9 Oct 2013 12:21:03 GMT"
}
] | 2013-10-10T00:00:00 |
[
[
"Sharma",
"Iti",
""
]
] |
new_dataset
| 0.990679 |
1310.2464
|
Elvinia Riccobene
|
Elvinia Riccobene
|
Eclipse-IT 2013: Proceedings of VIII Workshop of the Italian Eclipse
Community
|
conference eclipse it 2013 - Crema 19-20 September 2013 - ISBN:
978-88-904388-4-4
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the extended abstracts of the contributions presented at
EclipseIT 2013, the 8th workshop of the Italian Eclipse Community, hosted by
the Computer Science Department of the University of Milan (Crema Campus) on
September 19-20, 2013. Although Eclipse was initially designed as an integrated
development environment (IDE) for object-oriented application development,
today it represents an open development platform comprised of extensible
frameworks, tools and runtimes for building, deploying and managing software.
Around Eclipse, an international live community continuously works on improving
the framework and on promoting the use of Eclipse. That happens also in Italy.
This workshop is, indeed, the eighth yearly meeting of the Italian Eclipse
Community which includes universities, public institutions and industries,
researchers and practitioners, students and professionals, all joined by the
interest in experimenting, extending, and supporting the Eclipse platform. The
special topic of this edition is the Software cooperative development for
mobile applications. Two tutorials are offered on this theme: (1) Sviluppo di
applicazioni enterprise per il mobile con IBM Jazz, Eclipse e Worklight by
Ferdinando Gorga from IBM, and (2) Uso di Eclipse per lo sviluppo cooperativo
del software, by Paolo Maresca of the University of Naples, Federico II.
|
[
{
"version": "v1",
"created": "Wed, 9 Oct 2013 13:13:28 GMT"
}
] | 2013-10-10T00:00:00 |
[
[
"Riccobene",
"Elvinia",
""
]
] |
new_dataset
| 0.999179 |
0805.2855
|
Ed Summers
|
Ed Summers, Antoine Isaac, Clay Redding, Dan Krech
|
LCSH, SKOS and Linked Data
|
Submission for the Dublin Core 2008 conference in Berlin
|
Web Semantics: Science, Services and Agents on the World Wide Web,
Volume 20, May 2013, Pages 35-49, ISSN 1570-8268
|
10.1016/j.websem.2013.05.001
| null |
cs.DL cs.IR
|
http://creativecommons.org/licenses/publicdomain/
|
A technique for converting Library of Congress Subject Headings MARCXML to
Simple Knowledge Organization System (SKOS) RDF is described. Strengths of the
SKOS vocabulary are highlighted, as well as possible points for extension, and
the integration of other semantic web vocabularies such as Dublin Core. An
application for making the vocabulary available as linked-data on the Web is
also described.
|
[
{
"version": "v1",
"created": "Mon, 19 May 2008 13:11:41 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Jun 2008 18:25:51 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Jul 2008 12:57:39 GMT"
}
] | 2013-10-09T00:00:00 |
[
[
"Summers",
"Ed",
""
],
[
"Isaac",
"Antoine",
""
],
[
"Redding",
"Clay",
""
],
[
"Krech",
"Dan",
""
]
] |
new_dataset
| 0.961724 |
1310.1975
|
Brendan O'Connor
|
Brendan O'Connor and Michael Heilman
|
ARKref: a rule-based coreference resolution system
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ARKref is a tool for noun phrase coreference. It is a deterministic,
rule-based system that uses syntactic information from a constituent parser,
and semantic information from an entity recognition component. Its architecture
is based on the work of Haghighi and Klein (2009). ARKref was originally
written in 2009. At the time of writing, the last released version was in March
2011. This document describes that version, which is open-source and publicly
available at: http://www.ark.cs.cmu.edu/ARKref
|
[
{
"version": "v1",
"created": "Tue, 8 Oct 2013 00:30:51 GMT"
}
] | 2013-10-09T00:00:00 |
[
[
"O'Connor",
"Brendan",
""
],
[
"Heilman",
"Michael",
""
]
] |
new_dataset
| 0.998472 |
1310.2045
|
Oliver Johnson
|
Oliver Johnson
|
A de Bruijn identity for symmetric stable laws
| null | null | null | null |
cs.IT math.IT math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show how some attractive information--theoretic properties of Gaussians
pass over to more general families of stable densities. We define a new score
function for symmetric stable laws, and use it to give a stable version of the
heat equation. Using this, we derive a version of the de Bruijn identity,
allowing us to write the derivative of relative entropy as an inner product of
score functions. We discuss maximum entropy properties of symmetric stable
densities.
|
[
{
"version": "v1",
"created": "Tue, 8 Oct 2013 08:52:22 GMT"
}
] | 2013-10-09T00:00:00 |
[
[
"Johnson",
"Oliver",
""
]
] |
new_dataset
| 0.992219 |
1310.2051
|
Liu Yi
|
Yi Liu, Xiang-Gen Xia, and Hailin Zhang
|
Distributed Space-Time Coding for Full-Duplex Asynchronous Cooperative
Communications
|
9 pages, 7 figures
|
IEEE transactions on wireless communications, Vol. 11, No. 7, July
2012
|
10.1109/TWC.2012.060212.112214
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose two distributed linear convolutional space-time
coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative
communications. The DLC-STC Scheme 1 is for the case of the complete loop
channel cancellation, which achieves the full asynchronous cooperative
diversity. The DLC-STC Scheme 2 is for the case of the partial loop channel
cancellation and amplifying, where some loop signals are used as the
self-coding instead of treated as interference to be directly cancelled. We
show this scheme can achieve full asynchronous cooperative diversity. We then
evaluate the performance of the two schemes when loop channel information is
not accurate and present an amplifying factor control method for the DLC-STC
Scheme 2 to improve its performance with inaccurate loop channel information.
Simulation results show that the DLC-STC Scheme 1 outperforms the DLC-STC
Scheme 2 and the delay diversity scheme if perfect or high quality loop channel
information is available at the relay, while the DLC-STC Scheme 2 achieves
better performance if the loop channel information is imperfect.
|
[
{
"version": "v1",
"created": "Tue, 8 Oct 2013 09:10:09 GMT"
}
] | 2013-10-09T00:00:00 |
[
[
"Liu",
"Yi",
""
],
[
"Xia",
"Xiang-Gen",
""
],
[
"Zhang",
"Hailin",
""
]
] |
new_dataset
| 0.993757 |
1304.2333
|
Felix Effenberger
|
Felix Effenberger
|
A primer on information theory, with applications to neuroscience
|
60 pages, 19 figures
| null | null | null |
cs.IT math.IT q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given the constant rise in quantity and quality of data obtained from neural
systems on many scales ranging from molecular to systems',
information-theoretic analyses became increasingly necessary during the past
few decades in the neurosciences. Such analyses can provide deep insights into
the functionality of such systems, as well as a rigid mathematical theory and
quantitative measures of information processing in both healthy and diseased
states of neural systems. This chapter will present a short introduction to the
fundamentals of information theory, especially suited for people having a less
firm background in mathematics and probability theory. To begin, the
fundamentals of probability theory such as the notion of probability,
probability distributions, and random variables will be reviewed. Then, the
concepts of information and entropy (in the sense of Shannon), mutual
information, and transfer entropy (sometimes also referred to as conditional
mutual information) will be outlined. As these quantities cannot be computed
exactly from measured data in practice, estimation techniques for
information-theoretic quantities will be presented. The chapter will conclude
with the applications of information theory in the field of neuroscience,
including questions of possible medical applications and a short review of
software packages that can be used for information-theoretic analyses of neural
data.
|
[
{
"version": "v1",
"created": "Mon, 8 Apr 2013 19:51:38 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Oct 2013 16:24:00 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Effenberger",
"Felix",
""
]
] |
new_dataset
| 0.988731 |
1310.1390
|
Philipp Neidh\"ofer
|
Annemarie Harzl, Philipp Neidhoefer, Valentin Rock, Maximilian
Schafzahl, Wolfgang Slany
|
A Scratch-like visual programming system for Microsoft Windows Phone 8
|
2 pages, 5 figures, Published in PRoMoTo'13 [arXiv:1309.5500]
| null | null |
PrMoTo/2013/07
|
cs.CY cs.HC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pocket Code is a free and open source mobile visual programming system for
the Catrobat language. It allows users, starting from the age of eight, to
develop games and animations with their smartphones. Children can create
programs with their Android phone, iPhone, Windows Phone, or other smartphone
with an HTML5 browser. No notebook or desktop computer is needed. Pocket Code
is inspired by, but distinct from, the Scratch programming system developed by
the Lifelong Kindergarten Group at the MIT Media Lab. This tool demo describes
an in-practice experience with Pocket Code, the Windows Phone IDE for the
Catrobat language.
|
[
{
"version": "v1",
"created": "Sun, 6 Oct 2013 06:57:55 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Harzl",
"Annemarie",
""
],
[
"Neidhoefer",
"Philipp",
""
],
[
"Rock",
"Valentin",
""
],
[
"Schafzahl",
"Maximilian",
""
],
[
"Slany",
"Wolfgang",
""
]
] |
new_dataset
| 0.999714 |
1310.1442
|
Cunsheng Ding
|
Cunsheng Ding and Zhengchun Zhou
|
Binary Cyclic Codes from Explicit Polynomials over $\gf(2^m)$
|
arXiv admin note: substantial text overlap with arXiv:1206.4687,
arXiv:1206.4370
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are a subclass of linear codes and have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. In this paper, monomials and
trinomials over finite fields with even characteristic are employed to
construct a number of families of binary cyclic codes. Lower bounds on the
minimum weight of some families of the cyclic codes are developed. The minimum
weights of other families of the codes constructed in this paper are
determined. The dimensions of the codes are flexible. Some of the codes
presented in this paper are optimal or almost optimal in the sense that they
meet some bounds on linear codes. Open problems regarding binary cyclic codes
from monomials and trinomials are also presented.
|
[
{
"version": "v1",
"created": "Sat, 5 Oct 2013 05:14:07 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
],
[
"Zhou",
"Zhengchun",
""
]
] |
new_dataset
| 0.999133 |
1310.1551
|
Dr. R.V. Krishnaiah
|
T. Ravi Kumar and R. V. Krishnaiah
|
Optical Disk with Blu-Ray Technology
|
10 pages International Journal of Computer Engineering and
Applications; 2013
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blu-ray is the name of a next-generation optical disc format jointly
developed by the Blu-ray Disc Association a group of the world's leading
consumer electronics, personal computer and media manufacturers. The format was
developed to enable recording, rewriting and playback of high-definition video,
as well as storing large amounts of data. This extra capacity combined with the
use of advanced video and audio codec will offer consumers an unprecedented HD
experience. While current optical disc technologies such as DVD and DVDRAM rely
on a red laser to read and write data, the new format uses a blue-violet laser
instead, hence the name Blu-ray. Blu ray also promises some added security,
making ways for copyright protections. Blu-ray discs can have a unique ID
written on them to have copyright protection inside the recorded streams. Blu
.ray disc takes the DVD technology one step further, just by using a laser with
a nice color.
|
[
{
"version": "v1",
"created": "Sun, 6 Oct 2013 07:13:19 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Kumar",
"T. Ravi",
""
],
[
"Krishnaiah",
"R. V.",
""
]
] |
new_dataset
| 0.999716 |
1310.1590
|
Arnab Bhattacharya
|
Paheli Bhattacharya and Arnab Bhattacharya
|
Evolution of the Modern Phase of Written Bangla: A Statistical Study
|
LCC 2013
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Active languages such as Bangla (or Bengali) evolve over time due to a
variety of social, cultural, economic, and political issues. In this paper, we
analyze the change in the written form of the modern phase of Bangla
quantitatively in terms of character-level, syllable-level, morpheme-level and
word-level features. We collect three different types of corpora---classical,
newspapers and blogs---and test whether the differences in their features are
statistically significant. Results suggest that there are significant changes
in the length of a word when measured in terms of characters, but there is not
much difference in usage of different characters, syllables and morphemes in a
word or of different words in a sentence. To the best of our knowledge, this is
the first work on Bangla of this kind.
|
[
{
"version": "v1",
"created": "Sun, 6 Oct 2013 14:37:05 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Bhattacharya",
"Paheli",
""
],
[
"Bhattacharya",
"Arnab",
""
]
] |
new_dataset
| 0.998545 |
1310.1732
|
Anas Chaaban
|
Anas Chaaban and Aydin Sezgin
|
The Approximate Capacity Region of the Gaussian Y-Channel
|
submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A full-duplex wireless network with three users that want to establish full
message-exchange via a relay is considered. Thus, the network known as the
Y-channel has a total of 6 messages, 2 outgoing and 2 incoming at each user.
The users are not physically connected, and thus the relay is essential for
their communication. The linear-shift deterministic Y-channel is considered
first, its capacity region is characterized and shown not to be given by the
cut-set bounds. The capacity achieving scheme has three different components
(strategies): a bi-directional, a cyclic, and a uni-directional strategy.
Network coding is used to realize the bi-directional and the cyclic strategies,
and thus to prove the achievability of the capacity region. The result is then
extended to the Gaussian Y-channel where the capacity region is characterized
within a constant gap independent of the channel parameters.
|
[
{
"version": "v1",
"created": "Mon, 7 Oct 2013 11:06:54 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Chaaban",
"Anas",
""
],
[
"Sezgin",
"Aydin",
""
]
] |
new_dataset
| 0.998668 |
1310.1891
|
Mary Wootters
|
Atri Rudra and Mary Wootters
|
Every list-decodable code for high noise has abundant near-optimal rate
puncturings
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that any q-ary code with sufficiently good distance can be randomly
punctured to obtain, with high probability, a code that is list decodable up to
radius $1 - 1/q - \epsilon$ with near-optimal rate and list sizes. Our results
imply that "most" Reed-Solomon codes are list decodable beyond the Johnson
bound, settling the long-standing open question of whether any Reed Solomon
codes meet this criterion.
More precisely, we show that a Reed-Solomon code with random evaluation
points is, with high probability, list decodable up to radius $1 - \epsilon$
with list sizes $O(1/\epsilon)$ and rate $\Omega(\epsilon)$. As a second
corollary of our argument, we obtain improved bounds on the list decodability
of random linear codes over large fields.
Our approach exploits techniques from high dimensional probability. Previous
work used similar tools to obtain bounds on the list decodability of random
linear codes, but the bounds did not scale with the size of the alphabet. In
this paper, we use a chaining argument to deal with large alphabet sizes.
|
[
{
"version": "v1",
"created": "Mon, 7 Oct 2013 19:18:51 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Rudra",
"Atri",
""
],
[
"Wootters",
"Mary",
""
]
] |
new_dataset
| 0.973964 |
1310.1896
|
Jos\'e A. Soto
|
Jos\'e R. Correa, Omar Larr\'e, and Jos\'e A. Soto
|
TSP Tours in Cubic Graphs: Beyond 4/3
|
23 pages. A preliminary version appeared in ESA 2012
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie
proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic
2-connected graph, has a Hamiltonian tour of length at most (4/3)n,
establishing in particular that the integrality gap of the subtour LP is at
most 4/3 for cubic 2-connected graphs and matching the conjectured value of the
famous 4/3 conjecture. In this paper we improve upon this result by designing
an algorithm that finds a tour of length (4/3 - 1/61236)n, implying that cubic
2-connected graphs are among the few interesting classes of graphs for which
the integrality gap of the subtour LP is strictly less than 4/3. With the
previous result, and by considering an even smaller epsilon, we show that the
integrality gap of the TSP relaxation is at most 4/3 - epsilon, even if the
graph is not 2-connected (i.e. for cubic connected graphs), implying that the
approximability threshold of the TSP in cubic graphs is strictly below 4/3.
Finally, using similar techniques we show, as an additional result, that every
Barnette graph admits a tour of length at most (4/3 - 1/18)n.
|
[
{
"version": "v1",
"created": "Mon, 7 Oct 2013 19:35:53 GMT"
}
] | 2013-10-08T00:00:00 |
[
[
"Correa",
"José R.",
""
],
[
"Larré",
"Omar",
""
],
[
"Soto",
"José A.",
""
]
] |
new_dataset
| 0.995754 |
1212.3251
|
Tony Tan
|
Tony Tan
|
Automata for two-variable logic over trees with ordered data values
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data trees are trees in which each node, besides carrying a label from a
finite alphabet, also carries a data value from an infinite domain. They have
been used as an abstraction model for reasoning tasks on {XML} and
verification. However, most existing approaches consider the case where only
equality test can be performed on the data values.
In this paper we study data trees in which the data values come from a
linearly ordered domain, and in addition to equality test, we can test whether
the data value in a node is greater than the one in another node. We introduce
an automata model for them which we call ordered-data tree automata (ODTA),
provide its logical characterisation, and prove that its non-emptiness problem
is decidable in 3-NEXPTIME. We also show that the two-variable logic on
unranked trees, studied by Bojanczyk, Muscholl, Schwentick and Segoufin in
2009, corresponds precisely to a special subclass of this automata model.
Then we define a slightly weaker version of ODTA, which we call weak ODTA,
and provide its logical characterisation. The complexity of the non-emptiness
problem drops to NP. However, a number of existing formalisms and models
studied in the literature can be captured already by weak ODTA. We also show
that the definition of ODTA can be easily modified, to the case where the data
values come from a tree-like partially ordered domain, such as strings.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2012 18:18:54 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Oct 2013 15:54:59 GMT"
}
] | 2013-10-07T00:00:00 |
[
[
"Tan",
"Tony",
""
]
] |
new_dataset
| 0.994692 |
1310.1137
|
Jeremiah Blocki
|
Jeremiah Blocki and Manuel Blum and Anupam Datta
|
GOTCHA Password Hackers!
|
2013 ACM Workshop on Artificial Intelligence and Security (AISec)
| null |
10.1145/2517312.2517319
| null |
cs.CR cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce GOTCHAs (Generating panOptic Turing Tests to Tell Computers and
Humans Apart) as a way of preventing automated offline dictionary attacks
against user selected passwords. A GOTCHA is a randomized puzzle generation
protocol, which involves interaction between a computer and a human.
Informally, a GOTCHA should satisfy two key properties: (1) The puzzles are
easy for the human to solve. (2) The puzzles are hard for a computer to solve
even if it has the random bits used by the computer to generate the final
puzzle --- unlike a CAPTCHA. Our main theorem demonstrates that GOTCHAs can be
used to mitigate the threat of offline dictionary attacks against passwords by
ensuring that a password cracker must receive constant feedback from a human
being while mounting an attack. Finally, we provide a candidate construction of
GOTCHAs based on Inkblot images. Our construction relies on the usability
assumption that users can recognize the phrases that they originally used to
describe each Inkblot image --- a much weaker usability assumption than
previous password systems based on Inkblots which required users to recall
their phrase exactly. We conduct a user study to evaluate the usability of our
GOTCHA construction. We also generate a GOTCHA challenge where we encourage
artificial intelligence and security researchers to try to crack several
passwords protected with our scheme.
|
[
{
"version": "v1",
"created": "Fri, 4 Oct 2013 00:29:48 GMT"
}
] | 2013-10-07T00:00:00 |
[
[
"Blocki",
"Jeremiah",
""
],
[
"Blum",
"Manuel",
""
],
[
"Datta",
"Anupam",
""
]
] |
new_dataset
| 0.986859 |
1310.1249
|
Andrzej Jarynowski
|
Andrzej Jarynowski, Amir Rostami
|
Reading Stockholm Riots 2013 in social media by text-mining
|
5p
| null | null | null |
cs.SI cs.CL physics.soc-ph stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The riots in Stockholm in May 2013 were an event that reverberated in the
world media for its dimension of violence that had spread through the Swedish
capital. In this study we have investigated the role of social media in
creating media phenomena via text mining and natural language processing. We
have focused on two channels of communication for our analysis: Twitter and
Poloniainfo.se (Forum of Polish community in Sweden). Our preliminary results
show some hot topics driving discussion related mostly to Swedish Police and
Swedish Politics by counting word usage. Typical features for media
intervention are presented. We have built networks of most popular phrases,
clustered by categories (geography, media institution, etc.). Sentiment
analysis shows negative connotation with Police. The aim of this preliminary
exploratory quantitative study was to generate questions and hypotheses, which
we could carefully follow by deeper more qualitative methods.
|
[
{
"version": "v1",
"created": "Fri, 4 Oct 2013 13:04:45 GMT"
}
] | 2013-10-07T00:00:00 |
[
[
"Jarynowski",
"Andrzej",
""
],
[
"Rostami",
"Amir",
""
]
] |
new_dataset
| 0.994776 |
1310.1257
|
Fabian Pedregosa
|
Michael Eickenberg (INRIA Saclay - Ile de France, LNAO), Fabian
Pedregosa (INRIA Saclay - Ile de France, INRIA Paris - Rocquencourt),
Senoussi Mehdi (INRIA Saclay - Ile de France), Alexandre Gramfort (LTCI),
Bertrand Thirion (INRIA Saclay - Ile de France)
|
Second order scattering descriptors predict fMRI activity due to visual
textures
|
3nd International Workshop on Pattern Recognition in NeuroImaging
(2013)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Second layer scattering descriptors are known to provide good classification
performance on natural quasi-stationary processes such as visual textures due
to their sensitivity to higher order moments and continuity with respect to
small deformations. In a functional Magnetic Resonance Imaging (fMRI)
experiment we present visual textures to subjects and evaluate the predictive
power of these descriptors with respect to the predictive power of simple
contour energy - the first scattering layer. We are able to conclude not only
that invariant second layer scattering coefficients better encode voxel
activity, but also that well predicted voxels need not necessarily lie in known
retinotopic regions.
|
[
{
"version": "v1",
"created": "Sat, 10 Aug 2013 13:00:39 GMT"
}
] | 2013-10-07T00:00:00 |
[
[
"Eickenberg",
"Michael",
"",
"INRIA Saclay - Ile de France, LNAO"
],
[
"Pedregosa",
"Fabian",
"",
"INRIA Saclay - Ile de France, INRIA Paris - Rocquencourt"
],
[
"Mehdi",
"Senoussi",
"",
"INRIA Saclay - Ile de France"
],
[
"Gramfort",
"Alexandre",
"",
"LTCI"
],
[
"Thirion",
"Bertrand",
"",
"INRIA Saclay - Ile de France"
]
] |
new_dataset
| 0.995788 |
1208.5412
|
Victor Marsault
|
Victor Marsault, Jacques Sakarovitch
|
On sets of numbers rationally represented in a rational base number
system
| null |
5th International Conference, CAI 2013, Porquerolles, France,
September 3-6, 2013. Proceedings
|
10.1007/978-3-642-40663-8_10
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, it is proved that a set of numbers closed under addition and
whose representations in a rational base numeration system is a rational
language is not a finitely generated additive monoid.
A key to the proof is the definition of a strong combinatorial property on
languages : the bounded left iteration property. It is both an unnatural
property in usual formal language theory (as it contradicts any kind of pumping
lemma) and an ideal fit to the languages defined through rational base number
systems.
|
[
{
"version": "v1",
"created": "Mon, 27 Aug 2012 14:49:45 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Oct 2013 08:20:57 GMT"
}
] | 2013-10-04T00:00:00 |
[
[
"Marsault",
"Victor",
""
],
[
"Sakarovitch",
"Jacques",
""
]
] |
new_dataset
| 0.989836 |
1310.0867
|
Zheng Dong
|
Zheng Dong and Arjmand Samuel
|
Touch-enabled Programming for the Lab of Things
|
3 pages, 3 figures, PROMOTO 2013, 1309.5500
| null | null |
PrMoTo/2013/06
|
cs.PL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lab of Things (LoT, lab-of-things.com) is a research platform for
interconnection, programming, and large scale deployment of devices and
sensors. These devices and sensors can then be used for deployment of field
studies in a variety of research areas including elderly care, energy
management, and the like. LoT is built on top of HomeOS, a middle-ware
component, making interconnection of a wide range of devices possible. LoT also
provides cloud storage and remote monitoring capabilities. Traditionally
programming on the LoT platform has been done using C# in Microsoft Visual
Studio. While LoT programs developed on the .NET framework offer a rich set of
functionality, writing programs on LoT can be challenging for developers who
are not experienced with the technology involved. In this demonstration, we
introduce an innovative programming approach on the LoT platform by building a
Generic Application and creating corresponding libraries on the user-friendly
TouchDevelop (touchdevelop.com) programming environment. As an example, we
implemented the same functionality of the Lab of Things Alerts application
using the new Generic App. In addition to a touch-enabled programming
environment, the new approach also significantly saves time and effort
developers have to devote when creating a customized Lab of Things application.
|
[
{
"version": "v1",
"created": "Thu, 3 Oct 2013 00:21:53 GMT"
}
] | 2013-10-04T00:00:00 |
[
[
"Dong",
"Zheng",
""
],
[
"Samuel",
"Arjmand",
""
]
] |
new_dataset
| 0.999214 |
1309.5275
|
Dan Stowell
|
Dan Stowell and Mark D. Plumbley
|
An open dataset for research on audio field recording archives:
freefield1010
| null | null | null | null |
cs.SD cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
We introduce a free and open dataset of 7690 audio clips sampled from the
field-recording tag in the Freesound audio archive. The dataset is designed for
use in research related to data mining in audio archives of field recordings /
soundscapes. Audio is standardised, and audio and metadata are Creative Commons
licensed. We describe the data preparation process, characterise the dataset
descriptively, and illustrate its use through an auto-tagging experiment.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 14:12:04 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Oct 2013 21:29:13 GMT"
}
] | 2013-10-03T00:00:00 |
[
[
"Stowell",
"Dan",
""
],
[
"Plumbley",
"Mark D.",
""
]
] |
new_dataset
| 0.999716 |
1310.0524
|
Reshad Patuck
|
Reshad Patuck and Julio Hernandez-Castro
|
Steganography using the Extensible Messaging and Presence Protocol
(XMPP)
|
13 pages, 3 figures, 2 tables
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present here the first work to propose different mechanisms for hiding
data in the Extensible Messaging and Presence Protocol (XMPP). This is a very
popular instant messaging protocol used by many messaging platforms such as
Google Talk, Cisco, LiveJournal and many others. Our paper describes how to
send a secret message from one XMPP client to another, without raising the
suspicion of any intermediaries. The methods described primarily focus on using
the underlying protocol as a means for steganography, unlike other related
works that try to hide data in the content of instant messages. In doing so, we
provide a more robust means of data hiding and additionally offer some
preliminary analysis of its general security, in particular against
entropic-based steganalysis.
|
[
{
"version": "v1",
"created": "Fri, 27 Sep 2013 12:00:29 GMT"
}
] | 2013-10-03T00:00:00 |
[
[
"Patuck",
"Reshad",
""
],
[
"Hernandez-Castro",
"Julio",
""
]
] |
new_dataset
| 0.960029 |
1206.2038
|
Tien Tuan Anh Dinh
|
Dinh Tien Tuan Anh, Quach Vinh Thanh, Anwitaman Datta
|
CloudMine: Multi-Party Privacy-Preserving Data Analytics Service
| null | null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An increasing number of businesses are replacing their data storage and
computation infrastructure with cloud services. Likewise, there is an increased
emphasis on performing analytics based on multiple datasets obtained from
different data sources. While ensuring security of data and computation
outsourced to a third party cloud is in itself challenging, supporting
analytics using data distributed across multiple, independent clouds is even
further from trivial. In this paper we present CloudMine, a cloud-based service
which allows multiple data owners to perform privacy-preserved computation over
the joint data using their clouds as delegates. CloudMine protects data privacy
with respect to semi-honest data owners and semi-honest clouds. It furthermore
ensures the privacy of the computation outputs from the curious clouds. It
allows data owners to reliably detect if their cloud delegates have been lazy
when carrying out the delegated computation. CloudMine can run as a centralized
service on a single cloud, or as a distributed service over multiple,
independent clouds. CloudMine supports a set of basic computations that can be
used to construct a variety of highly complex, distributed privacy-preserving
data analytics. We demonstrate how a simple instance of CloudMine (secure sum
service) is used to implement three classical data mining tasks
(classification, association rule mining and clustering) in a cloud
environment. We experiment with a prototype of the service, the results of
which suggest its practicality for supporting privacy-preserving data analytics
as a (multi) cloud-based service.
|
[
{
"version": "v1",
"created": "Sun, 10 Jun 2012 16:27:48 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Oct 2013 05:14:19 GMT"
}
] | 2013-10-02T00:00:00 |
[
[
"Anh",
"Dinh Tien Tuan",
""
],
[
"Thanh",
"Quach Vinh",
""
],
[
"Datta",
"Anwitaman",
""
]
] |
new_dataset
| 0.997807 |
1306.1957
|
Christopher Thraves Caro
|
Mauricio Soto and Christopher Thraves
|
(c-)AND: A new graph model
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this document, we study the scope of the following graph model: each
vertex is assigned to a box in a metric space and to a representative element
that belongs to that box. Two vertices are connected by an edge if and only if
its respective boxes contain the opposite representative element. We focus our
study on the case where boxes (and therefore representative elements)
associated to vertices are spread in the Euclidean line. We give both, a
combinatorial and an intersection characterization of the model. Based on these
characterizations, we determine graph families that contain the model (e. g.,
boxicity 2 graphs) and others that the new model contains (e. g., rooted
directed path). We also study the particular case where each representative
element is the center of its respective box. In this particular case, we
provide constructive representations for interval, block and outerplanar
graphs. Finally, we show that the general and the particular model are not
equivalent by constructing a graph family that separates the two cases.
|
[
{
"version": "v1",
"created": "Sat, 8 Jun 2013 20:38:54 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Jun 2013 18:17:33 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Oct 2013 19:45:41 GMT"
}
] | 2013-10-02T00:00:00 |
[
[
"Soto",
"Mauricio",
""
],
[
"Thraves",
"Christopher",
""
]
] |
new_dataset
| 0.998307 |
1310.0185
|
Mary Cryan
|
Prasad Chebolu, Mary Cryan, Russell Martin
|
Exact counting of Euler Tours for Graphs of Bounded Treewidth
|
16 pages, draft
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we give a simple polynomial-time algorithm to exactly count the
number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The
problems of counting ETs are known to be #P-complete for general graphs
(Brightwell and Winkler, (Brightwell and Winkler, 2005). To date, no
polynomial-time algorithm for counting Euler tours of any class of graphs is
known except for the very special case of series-parallel graphs (which have
treewidth 2).
|
[
{
"version": "v1",
"created": "Tue, 1 Oct 2013 08:35:14 GMT"
}
] | 2013-10-02T00:00:00 |
[
[
"Chebolu",
"Prasad",
""
],
[
"Cryan",
"Mary",
""
],
[
"Martin",
"Russell",
""
]
] |
new_dataset
| 0.991903 |
1310.0250
|
Patrick O. Glauner
|
Patrick O. Glauner, Jan Iwaszkiewicz, Jean-Yves Le Meur and Tibor
Simko
|
Use of Solr and Xapian in the Invenio document repository software
| null | null | null | null |
cs.IR cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Invenio is a free comprehensive web-based document repository and digital
library software suite originally developed at CERN. It can serve a variety of
use cases from an institutional repository or digital library to a web journal.
In order to fully use full-text documents for efficient search and ranking,
Solr was integrated into Invenio through a generic bridge. Solr indexes
extracted full-texts and most relevant metadata. Consequently, Invenio takes
advantage of Solr's efficient search and word similarity ranking capabilities.
In this paper, we first give an overview of Invenio, its capabilities and
features. We then present our open source Solr integration as well as
scalability challenges that arose for an Invenio-based multi-million record
repository: the CERN Document Server. We also compare our Solr adapter to an
alternative Xapian adapter using the same generic bridge. Both integrations are
distributed with the Invenio package and ready to be used by the institutions
using or adopting Invenio.
|
[
{
"version": "v1",
"created": "Tue, 1 Oct 2013 11:37:06 GMT"
}
] | 2013-10-02T00:00:00 |
[
[
"Glauner",
"Patrick O.",
""
],
[
"Iwaszkiewicz",
"Jan",
""
],
[
"Meur",
"Jean-Yves Le",
""
],
[
"Simko",
"Tibor",
""
]
] |
new_dataset
| 0.997372 |
1310.0296
|
Hiroyuki Kawai
|
Hiroyuki Kawai, Matthew J. Bellman, Ryan J. Downey, Warren E. Dixon
|
Tracking Control for FES-Cycling based on Force Direction Efficiency
with Antagonistic Bi-Articular Muscles
|
8 pages, 4 figures, submitted to ACC2014
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A functional electrical stimulation (FES)-based tracking controller is
developed to enable cycling based on a strategy to yield force direction
efficiency by exploiting antagonistic bi-articular muscles. Given the input
redundancy naturally occurring among multiple muscle groups, the force
direction at the pedal is explicitly determined as a means to improve the
efficiency of cycling. A model of a stationary cycle and rider is developed as
a closed-chain mechanism. A strategy is then developed to switch between muscle
groups for improved efficiency based on the force direction of each muscle
group. Stability of the developed controller is analyzed through Lyapunov-based
methods.
|
[
{
"version": "v1",
"created": "Tue, 1 Oct 2013 13:54:20 GMT"
}
] | 2013-10-02T00:00:00 |
[
[
"Kawai",
"Hiroyuki",
""
],
[
"Bellman",
"Matthew J.",
""
],
[
"Downey",
"Ryan J.",
""
],
[
"Dixon",
"Warren E.",
""
]
] |
new_dataset
| 0.986999 |
1310.0310
|
Tomislav Petkovi\'c
|
Ivan Kre\v{s}o, Marko \v{S}evrovi\'c and Sini\v{s}a \v{S}egvi\'c
|
A Novel Georeferenced Dataset for Stereo Visual Odometry
|
Part of the Proceedings of the Croatian Computer Vision Workshop,
CCVW 2013, Year 1
| null | null |
UniZg-CRV-CCVW/2013/0017
|
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this work, we present a novel dataset for assessing the accuracy of stereo
visual odometry. The dataset has been acquired by a small-baseline stereo rig
mounted on the top of a moving car. The groundtruth is supplied by a consumer
grade GPS device without IMU. Synchronization and alignment between GPS
readings and stereo frames are recovered after the acquisition. We show that
the attained groundtruth accuracy allows to draw useful conclusions in
practice. The presented experiments address influence of camera calibration,
baseline distance and zero-disparity features to the achieved reconstruction
performance.
|
[
{
"version": "v1",
"created": "Tue, 1 Oct 2013 14:15:48 GMT"
}
] | 2013-10-02T00:00:00 |
[
[
"Krešo",
"Ivan",
""
],
[
"Ševrović",
"Marko",
""
],
[
"Šegvić",
"Siniša",
""
]
] |
new_dataset
| 0.9997 |
1310.0316
|
Tomislav Petkovi\'c
|
Ivan Sikiri\'c, Karla Brki\'c and Sini\v{s}a \v{S}egvi\'c
|
Classifying Traffic Scenes Using The GIST Image Descriptor
|
Part of the Proceedings of the Croatian Computer Vision Workshop,
CCVW 2013, Year 1
| null | null |
UniZg-CRV-CCVW/2013/0013
|
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper investigates classification of traffic scenes in a very low
bandwidth scenario, where an image should be coded by a small number of
features. We introduce a novel dataset, called the FM1 dataset, consisting of
5615 images of eight different traffic scenes: open highway, open road,
settlement, tunnel, tunnel exit, toll booth, heavy traffic and the overpass. We
evaluate the suitability of the GIST descriptor as a representation of these
images, first by exploring the descriptor space using PCA and k-means
clustering, and then by using an SVM classifier and recording its 10-fold
cross-validation performance on the introduced FM1 dataset. The obtained
recognition rates are very encouraging, indicating that the use of the GIST
descriptor alone could be sufficiently descriptive even when very high
performance is required.
|
[
{
"version": "v1",
"created": "Tue, 1 Oct 2013 14:19:26 GMT"
}
] | 2013-10-02T00:00:00 |
[
[
"Sikirić",
"Ivan",
""
],
[
"Brkić",
"Karla",
""
],
[
"Šegvić",
"Siniša",
""
]
] |
new_dataset
| 0.994429 |
1308.5174
|
James Pallister
|
James Pallister, Simon Hollis, Jeremy Bennett
|
BEEBS: Open Benchmarks for Energy Measurements on Embedded Platforms
| null | null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents and justifies an open benchmark suite named BEEBS,
targeted at evaluating the energy consumption of embedded processors.
We explore the possible sources of energy consumption, then select individual
benchmarks from contemporary suites to cover these areas. Version one of BEEBS
is presented here and contains 10 benchmarks that cover a wide range of typical
embedded applications. The benchmark suite is portable across diverse
architectures and is freely available.
The benchmark suite is extensively evaluated, and the properties of its
constituent programs are analysed. Using real hardware platforms we show case
examples which illustrate the difference in power dissipation between three
processor architectures and their related ISAs. We observe significant
differences in the average instruction dissipation between the architectures of
4.4x, specifically 170uW/MHz (ARM Cortex-M0), 65uW/MHz (Adapteva Epiphany) and
88uW/MHz (XMOS XS1-L1).
|
[
{
"version": "v1",
"created": "Fri, 23 Aug 2013 16:29:27 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Sep 2013 16:16:03 GMT"
}
] | 2013-10-01T00:00:00 |
[
[
"Pallister",
"James",
""
],
[
"Hollis",
"Simon",
""
],
[
"Bennett",
"Jeremy",
""
]
] |
new_dataset
| 0.999733 |
1309.7391
|
Chris Johnson
|
Chris Johnson
|
Madeup: A Mobile Development Environment for Programming 3-D Models
|
2 pages, 3 figures, PROMOTO 2013, 1309.5500
| null | null |
PrMoTo/2013/05
|
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Constructionism is a learning theory that states that we learn more when we
construct tangible objects. In the process of building and presenting our work,
we make concrete the abstract mental models we've formed, see where they
breakdown through the feedback we receive, and revise the models accordingly.
Computer programming has long been taught under a constructionist approach
using sensory-rich contexts like robots, media, and Logo-style environments.
Now, with affordable 3-D printers in the hands of consumers, we have a new
medium in which learners may realize their computational ideas. In this
demonstration, we share a mobile development environment named Madeup, which
empowers its users to navigate 3-D space using a Logo-like imperative and
functional language. Every stop in space becomes a vertex in a 3-D model. The
generated models may be exported or uploaded to a 3-D printing service.
|
[
{
"version": "v1",
"created": "Fri, 27 Sep 2013 23:50:57 GMT"
}
] | 2013-10-01T00:00:00 |
[
[
"Johnson",
"Chris",
""
]
] |
new_dataset
| 0.999145 |
1309.7429
|
Manish Gupta
|
Mit Sheth, Krishna Gopal Benerjee and Manish K. Gupta
|
Quorum Sensing for Regenerating Codes in Distributed Storage
|
8 pages, 5 figures, submitted to conference
| null | null | null |
cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems with replication are well known for storing large
amount of data. A large number of replication is done in order to provide
reliability. This makes the system expensive. Various methods have been
proposed over time to reduce the degree of replication and yet provide same
level of reliability. One recently suggested scheme is of Regenerating codes,
where a file is divided in to parts which are then processed by a coding
mechanism and network coding to provide large number of parts. These are stored
at various nodes with more than one part at each node. These codes can generate
whole file and can repair a failed node by contacting some out of total
existing nodes. This property ensures reliability in case of node failure and
uses clever replication. This also optimizes bandwidth usage. In a practical
scenario, the original file will be read and updated many times. With every
update, we will have to update the data stored at many nodes. Handling multiple
requests at the same time will bring a lot of complexity. Reading and writing
or multiple writing on the same data at the same time should also be prevented.
In this paper, we propose an algorithm that manages and executes all the
requests from the users which reduces the update complexity. We also try to
keep an adequate amount of availability at the same time. We use a voting based
mechanism and form read, write and repair quorums. We have also done
probabilistic analysis of regenerating codes.
|
[
{
"version": "v1",
"created": "Sat, 28 Sep 2013 05:30:49 GMT"
}
] | 2013-10-01T00:00:00 |
[
[
"Sheth",
"Mit",
""
],
[
"Benerjee",
"Krishna Gopal",
""
],
[
"Gupta",
"Manish K.",
""
]
] |
new_dataset
| 0.999621 |
1309.7691
|
EPTCS
|
Roberto Serra (University of Modena and Reggio Emilia), Alessandro
Filisetti (European Centre for Living Technology), Alex Graudenzi (Department
of Informatics, Systems and Communication University of Milan Bicocca),
Chiara Damiani (Department of Informatics, Systems and Communication
University of Milan Bicocca), Marco Villani (University of Modena and Reggio
Emilia)
|
A model of protocell based on the introduction of a semi-permeable
membrane in a stochastic model of catalytic reaction networks
|
In Proceedings Wivace 2013, arXiv:1309.7122
|
EPTCS 130, 2013, pp. 70-73
|
10.4204/EPTCS.130.10
| null |
cs.CE q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we introduce some preliminary analyses on the role of a
semi-permeable membrane in the dynamics of a stochastic model of catalytic
reaction sets (CRSs) of molecules. The results of the simulations performed on
ensembles of randomly generated reaction schemes highlight remarkable
differences between this very simple protocell description model and the
classical case of the continuous stirred-tank reactor (CSTR). In particular, in
the CSTR case, distinct simulations with the same reaction scheme reach the
same dynamical equilibrium, whereas, in the protocell case, simulations with
identical reaction schemes can reach very different dynamical states, despite
starting from the same initial conditions.
|
[
{
"version": "v1",
"created": "Mon, 30 Sep 2013 01:05:59 GMT"
}
] | 2013-10-01T00:00:00 |
[
[
"Serra",
"Roberto",
"",
"University of Modena and Reggio Emilia"
],
[
"Filisetti",
"Alessandro",
"",
"European Centre for Living Technology"
],
[
"Graudenzi",
"Alex",
"",
"Department\n of Informatics, Systems and Communication University of Milan Bicocca"
],
[
"Damiani",
"Chiara",
"",
"Department of Informatics, Systems and Communication\n University of Milan Bicocca"
],
[
"Villani",
"Marco",
"",
"University of Modena and Reggio\n Emilia"
]
] |
new_dataset
| 0.988356 |
1309.7912
|
Ricardo Fabbri
|
Mauro de Amorim, Ricardo Fabbri, Lucia Maria dos Santos Pinto and
Francisco Duarte Moura Neto
|
An Image-Based Fluid Surface Pattern Model
|
a reduced version in Portuguese appears in proceedings of the XVI EMC
- Computational Modeling Meeting (Encontro de Modelagem Computacional), 2013
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/3.0/
|
This work aims at generating a model of the ocean surface and its dynamics
from one or more video cameras. The idea is to model wave patterns from video
as a first step towards a larger system of photogrammetric monitoring of marine
conditions for use in offshore oil drilling platforms. The first part of the
proposed approach consists in reducing the dimensionality of sensor data made
up of the many pixels of each frame of the input video streams. This enables
finding a concise number of most relevant parameters to model the temporal
dataset, yielding an efficient data-driven model of the evolution of the
observed surface. The second part proposes stochastic modeling to better
capture the patterns embedded in the data. One can then draw samples from the
final model, which are expected to simulate the behavior of previously observed
flow, in order to determine conditions that match new observations. In this
paper we focus on proposing and discussing the overall approach and on
comparing two different techniques for dimensionality reduction in the first
stage: principal component analysis and diffusion maps. Work is underway on the
second stage of constructing better stochastic models of fluid surface dynamics
as proposed here.
|
[
{
"version": "v1",
"created": "Mon, 30 Sep 2013 16:39:21 GMT"
}
] | 2013-10-01T00:00:00 |
[
[
"de Amorim",
"Mauro",
""
],
[
"Fabbri",
"Ricardo",
""
],
[
"Pinto",
"Lucia Maria dos Santos",
""
],
[
"Neto",
"Francisco Duarte Moura",
""
]
] |
new_dataset
| 0.993926 |
1309.6820
|
Eliot Brenner
|
Eliot Brenner, David Sontag
|
SparsityBoost: A New Scoring Function for Learning Bayesian Network
Structure
|
Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty
in Artificial Intelligence (UAI2013)
| null | null |
UAI-P-2013-PG-112-121
|
cs.LG cs.AI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a new consistent scoring function for structure learning of Bayesian
networks. In contrast to traditional approaches to scorebased structure
learning, such as BDeu or MDL, the complexity penalty that we propose is
data-dependent and is given by the probability that a conditional independence
test correctly shows that an edge cannot exist. What really distinguishes this
new scoring function from earlier work is that it has the property of becoming
computationally easier to maximize as the amount of data increases. We prove a
polynomial sample complexity result, showing that maximizing this score is
guaranteed to correctly learn a structure with no false edges and a
distribution close to the generating distribution, whenever there exists a
Bayesian network which is a perfect map for the data generating distribution.
Although the new score can be used with any search algorithm, we give empirical
results showing that it is particularly effective when used together with a
linear programming relaxation approach to Bayesian network structure learning.
|
[
{
"version": "v1",
"created": "Thu, 26 Sep 2013 12:35:41 GMT"
}
] | 2013-09-27T00:00:00 |
[
[
"Brenner",
"Eliot",
""
],
[
"Sontag",
"David",
""
]
] |
new_dataset
| 0.954711 |
1309.6914
|
Marius Buliga
|
Marius Buliga
|
Chemical concrete machine
| null | null | null | null |
cs.FL math.LO q-bio.MN
|
http://creativecommons.org/licenses/by/3.0/
|
The chemical concrete machine is a graph rewriting system which uses only
local moves (rewrites), seen as chemical reactions involving molecules which
are graphs made up by 4 trivalent nodes. It is Turing complete, therefore it
might be used as a model of computation in algorithmic chemistry.
|
[
{
"version": "v1",
"created": "Thu, 26 Sep 2013 14:24:23 GMT"
}
] | 2013-09-27T00:00:00 |
[
[
"Buliga",
"Marius",
""
]
] |
new_dataset
| 0.999163 |
1307.0029
|
Pabitra Pal Choudhury
|
Ranjeet Kumar Rout, Pabitra Pal Choudhury, B. S. Daya Sagar, Sk. Sarif
Hassan
|
Fractal and Mathematical Morphology in Intricate Comparison between
Tertiary Protein Structures
| null | null | null | null |
cs.CG cs.CE
|
http://creativecommons.org/licenses/publicdomain/
|
Intricate comparison between two given tertiary structures of proteins is as
important as the comparison of their functions. Several algorithms have been
devised to compute the similarity and dissimilarity among protein structures.
But, these algorithms compare protein structures by structural alignment of the
protein backbones which are usually unable to determine precise differences. In
this paper, an attempt has been made to compute the similarities and
dissimilarities among 3D protein structures using the fundamental mathematical
morphology operations and fractal geometry which can resolve the problem of
real differences. In doing so, two techniques are being used here in
determining the superficial structural (global similarity) and local similarity
in atomic level of the protein molecules. This intricate structural difference
would provide insight to Biologists to understand the protein structures and
their functions more precisely.
|
[
{
"version": "v1",
"created": "Tue, 11 Jun 2013 15:20:03 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Sep 2013 11:54:04 GMT"
}
] | 2013-09-26T00:00:00 |
[
[
"Rout",
"Ranjeet Kumar",
""
],
[
"Choudhury",
"Pabitra Pal",
""
],
[
"Sagar",
"B. S. Daya",
""
],
[
"Hassan",
"Sk. Sarif",
""
]
] |
new_dataset
| 0.998005 |
1309.6422
|
Hong Xu
|
Hong Xu and Baochun Li
|
Spot Transit: Cheaper Internet Transit for Elastic Traffic
|
14 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We advocate to create a \emph{spot} Internet transit market, where transit is
sold using the under-utilized backbone capacity at a lower price. The providers
can improve profit by capitalizing the perishable capacity, and customers can
buy transit on-demand without a minimum commitment level for elastic traffic,
and as a result improve its surplus (i.e. utility gains). We conduct a
systematic study of the economical benefits of spot transit both theoretically
and empirically. We propose a simple analytical framework with a general demand
function, and solve the pricing problem of maximizing the expected profit,
taking into account the revenue loss of regular transit when spot transit
traffic hikes. We rigorously prove the price advantage of spot transit, as well
as profit and surplus improvements for tier-1 ISPs and customers, respectively.
Using real-world price data and traffic statistics of 6 IXPs with more than
1000 ISPs, we quantitatively evaluate spot transit and show that significant
financial benefits can be achieved in both absolute and relative terms, robust
to parameter values.
|
[
{
"version": "v1",
"created": "Wed, 25 Sep 2013 08:28:52 GMT"
}
] | 2013-09-26T00:00:00 |
[
[
"Xu",
"Hong",
""
],
[
"Li",
"Baochun",
""
]
] |
new_dataset
| 0.998795 |
1309.4767
|
Abuzer Yakaryilmaz
|
Abuzer Yakaryilmaz
|
Log-space counter is useful for unary languages by help of a
constant-size quantum register
|
The text is updated by adding a new reference. Technical report. 10
pages. arXiv admin note: text overlap with arXiv:1207.3880
| null | null | null |
cs.CC cs.FL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The minimum amount of resources to recognize a nonregular language is a
fundamental research topic in theoretical computer science which has been
examined for different kinds of resources and many different models. In this
note, we focus on unary languages and space complexity on counters. Our model
is two-way one-counter automaton with quantum and classical states (2QCCA),
which is a two-way finite automaton with one-counter (2DCA) augmented with a
fixed size quantum register or a two-way finite automaton with quantum and
classical states (2QCFA) augmented with a classical counter. It is known that
any 2DCA using a sublinear space on its counter can recognize only regular
languages \cite{DG82B}. In this note, we show that bounded-error 2QCCAs can
recognize a non-regular unary language by using logarithmic space on its
counters for the members. Note that it is still an open problem whether
bounded-error 2QCFA can recognize a non-regular unary language.
|
[
{
"version": "v1",
"created": "Wed, 18 Sep 2013 19:58:17 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Sep 2013 22:30:57 GMT"
}
] | 2013-09-25T00:00:00 |
[
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.999549 |
1309.6078
|
Dmitry Gusev
|
V. F. Romanov
|
Discordant Compact Logic-Arithmetic Structures in Discrete Optimization
Problems
|
17 pages; typeset in LaTeX. arXiv admin note: substantial text
overlap with arXiv:1011.3944
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In sphere of research of discrete optimization algorithms efficiency the
important place occupies a method of polynomial reducibility of some problems
to others with use of special purpose components. In this paper a novel method
of compact representation for sets of binary sequences in the form of "compact
triplets structures" (CTS) and "compact couples structures" (CCS) is stated,
supposing both logic and arithmetic interpretation of data. It is shown that
any non-empty CTS in dual interpretation represents some unique Boolean formula
in 3-CNF and the tabular CTS contains all satisfyig sets of the formula as
concatenations of the triplets chosen from the neighbouring tiers. In general,
any 3-CNF formula is transformed by decomposition to a system of discordant
CTS's, each being associated with an individual permutation of variables
constructed by a polynomial algorithm. As a result the problem of the formula
satisfiability is reduced to the following one: ascertain the fact of existence
(or absence) of a "joint satisfying set" (JSS) for all discordant structures,
based on the different permutations. Further transformation of each CTS to CCS
is used; correctness of preservation of the allowed sets is reached by simple
algorithmic restrictions on triplets concatenation. Then the procedure of
"inverting of the same name columns" in the various structures is entered for
the purpose of reducing the problem of JSS revealing to elementary detection of
n-tuples of zeros in the CCS system. The formula is synthesized, being on the
structure a variation of 2-CNF, associated with the calculation procedure
realizing adaptation of the polynomial algorithm of constraints distribution
(well-known in the optimization theory) to the efficient resolving Boolean
formula coded by means of discordant compact structures.
|
[
{
"version": "v1",
"created": "Tue, 24 Sep 2013 08:24:57 GMT"
}
] | 2013-09-25T00:00:00 |
[
[
"Romanov",
"V. F.",
""
]
] |
new_dataset
| 0.998994 |
1309.6162
|
Ralf Steinberger
|
Ralf Steinberger, Bruno Pouliquen, Mijail Kabadjov, Erik van der Goot
|
JRC-Names: A freely available, highly multilingual named entity resource
| null |
Proceedings of the 8th International Conference Recent Advances in
Natural Language Processing (RANLP'2011), pp. 104-110. Hissar, Bulgaria,
12-14 September 2011
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a new, freely available, highly multilingual named
entity resource for person and organisation names that has been compiled over
seven years of large-scale multilingual news analysis combined with Wikipedia
mining, resulting in 205,000 per-son and organisation names plus about the same
number of spelling variants written in over 20 different scripts and in many
more languages. This resource, produced as part of the Europe Media Monitor
activity (EMM, http://emm.newsbrief.eu/overview.html), can be used for a number
of purposes. These include improving name search in databases or on the
internet, seeding machine learning systems to learn named entity recognition
rules, improve machine translation results, and more. We describe here how this
resource was created; we give statistics on its current size; we address the
issue of morphological inflection; and we give details regarding its
functionality. Updates to this resource will be made available daily.
|
[
{
"version": "v1",
"created": "Tue, 24 Sep 2013 14:09:53 GMT"
}
] | 2013-09-25T00:00:00 |
[
[
"Steinberger",
"Ralf",
""
],
[
"Pouliquen",
"Bruno",
""
],
[
"Kabadjov",
"Mijail",
""
],
[
"van der Goot",
"Erik",
""
]
] |
new_dataset
| 0.99926 |
1309.6185
|
Ralf Steinberger
|
Maud Ehrmann, Leonida della Rocca, Ralf Steinberger, Hristo Tanev
|
Acronym recognition and processing in 22 languages
| null |
Proceedings of the 9th Conference 'Recent Advances in Natural
Language Processing' (RANLP), pp. 237-244. Hissar, Bulgaria, 7-13 September
2013
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are presenting work on recognising acronyms of the form Long-Form
(Short-Form) such as "International Monetary Fund (IMF)" in millions of news
articles in twenty-two languages, as part of our more general effort to
recognise entities and their variants in news text and to use them for the
automatic analysis of the news, including the linking of related news across
languages. We show how the acronym recognition patterns, initially developed
for medical terms, needed to be adapted to the more general news domain and we
present evaluation results. We describe our effort to automatically merge the
numerous long-form variants referring to the same short-form, while keeping
non-related long-forms separate. Finally, we provide extensive statistics on
the frequency and the distribution of short-form/long-form pairs across
languages.
|
[
{
"version": "v1",
"created": "Tue, 24 Sep 2013 14:41:33 GMT"
}
] | 2013-09-25T00:00:00 |
[
[
"Ehrmann",
"Maud",
""
],
[
"della Rocca",
"Leonida",
""
],
[
"Steinberger",
"Ralf",
""
],
[
"Tanev",
"Hristo",
""
]
] |
new_dataset
| 0.955476 |
1211.0722
|
Omer Bar-Ilan
|
Omer Bar-Ilan and Yonina C. Eldar
|
Sub-Nyquist Radar via Doppler Focusing
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the problem of a monostatic pulse-Doppler radar transceiver
trying to detect targets, sparsely populated in the radar's unambiguous
time-frequency region. Several past works employ compressed sensing (CS)
algorithms to this type of problem, but either do not address sample rate
reduction, impose constraints on the radar transmitter, propose CS recovery
methods with prohibitive dictionary size, or perform poorly in noisy
conditions. Here we describe a sub-Nyquist sampling and recovery approach
called Doppler focusing which addresses all of these problems: it performs low
rate sampling and digital processing, imposes no restrictions on the
transmitter, and uses a CS dictionary with size which does not increase with
increasing number of pulses P. Furthermore, in the presence of noise, Doppler
focusing enjoys an SNR increase which scales linearly with P, obtaining good
detection performance even at SNRs as low as -25dB. The recovery is based on
the Xampling framework, which allows reducing the number of samples needed to
accurately represent the signal, directly in the analog-to-digital conversion
process. After sampling, the entire digital recovery process is performed on
the low rate samples without having to return to the Nyquist rate. Finally, our
approach can be implemented in hardware using a previously suggested Xampling
prototype.
|
[
{
"version": "v1",
"created": "Sun, 4 Nov 2012 21:21:11 GMT"
},
{
"version": "v2",
"created": "Wed, 1 May 2013 21:54:51 GMT"
},
{
"version": "v3",
"created": "Sun, 22 Sep 2013 20:55:04 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Bar-Ilan",
"Omer",
""
],
[
"Eldar",
"Yonina C.",
""
]
] |
new_dataset
| 0.961081 |
1305.0911
|
Amir Ben-Amram
|
Amir M. Ben-Amram
|
A Comment on Budach's Mouse-in-an-Octant Problem
|
3 pages, 2 bibliographic references
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Budach's Mouse-in-an-Octant Problem (attributed to Lothar Budach in a 1980
article by van Emde Boas and Karpinski) concerns the behaviour of a very simple
finite-state machine ("the mouse") moving on the integer two-dimensional grid.
Its decidability is apparently still open. This note sketches a proof that an
extended version of the problem (a super-mouse) is undecidable.
|
[
{
"version": "v1",
"created": "Sat, 4 May 2013 11:02:03 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Sep 2013 20:35:59 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Ben-Amram",
"Amir M.",
""
]
] |
new_dataset
| 0.996537 |
1308.0267
|
Ryoma Sin'ya
|
Ryoma Sin'ya
|
Text Compression using Abstract Numeration System on a Regular Language
|
An extended abstract of the accepted paper for JSSST Journal
"Computer Software" (Japanese, available at
http://www.shudo.is.titech.ac.jp/members/sinya)
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An abstract numeration system (ANS) is a numeration system that provides a
one-to-one correspondence between the natural numbers and a regular language.
In this paper, we define an ANS-based compression as an extension of this
correspondence. In addition, we show the following results: 1) an average
compression ratio is computable from a language, 2) an ANS-based compression
runs in sublinear time with respect to the length of the input string, and 3)
an ANS-based compression can be extended to block-based compression using a
factorial language.
|
[
{
"version": "v1",
"created": "Thu, 1 Aug 2013 17:13:45 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Sep 2013 18:37:00 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Sin'ya",
"Ryoma",
""
]
] |
new_dataset
| 0.990553 |
1309.3655
|
Mohammed Karmoose
|
Mohammed Karmoose and Karim Habak and Mustafa El-Nainay and Moustafa
Youssef
|
Dead Zone Penetration Protocol for Cognitive Radio Networks
|
The paper has been withdrawn for copyright issues
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current routing protocols for cognitive radio networks are severely affected
by the frequent activity of primary users. Nodes that are in the interference
range of an appearing primary user are not allowed to transmit, and therefore
existing routes which utilize such nodes are obliged to undergo a route
maintenance phase. This naturally provides other routes to the destination that
may incur extra delay or increase packet queuing overhead. In this work, a
novel route maintenance protocol is proposed that allows existing routes to
endure the event of primary user presence by forming cooperative links between
neighboring nodes and nulling out transmission at the primary receiver using
cooperative beamforming. Our proposed protocol can be used in conjunction with
any of the existing routing protocols, thus achieving modularity. Extensive
simulations are done which prove that our proposed protocol outperforms
existing route maintenance techniques in terms of end-to-end delay and loss
ratio, with minimal incurred overhead.
|
[
{
"version": "v1",
"created": "Sat, 14 Sep 2013 12:28:36 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Sep 2013 11:16:24 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Karmoose",
"Mohammed",
""
],
[
"Habak",
"Karim",
""
],
[
"El-Nainay",
"Mustafa",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.996099 |
1309.5500
|
Vinayak Naik
|
Judith Bishop, Nikolai Tillmann, Arno Puder, Vinayak Naik
|
PRoMoTo 2013 proceedings
|
Published in PRoMoTo'13
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Programming for Mobile and Touch (PRoMoTo'13) was held at the 2013 ACM
SIGPLAN conference on Systems, Programming, Languages and Applications (SPLASH
2013), October 2013 in Indianapolis, USA. Submissions for this event were
invited in the general area of mobile and touch-oriented programming languages
and programming environments, and teaching of programming for mobile devices.
These are proceedings of the PRoMoTo'13.
|
[
{
"version": "v1",
"created": "Sat, 21 Sep 2013 16:48:22 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Bishop",
"Judith",
""
],
[
"Tillmann",
"Nikolai",
""
],
[
"Puder",
"Arno",
""
],
[
"Naik",
"Vinayak",
""
]
] |
new_dataset
| 0.999553 |
1309.5601
|
Lata Bt
|
Lata B T, Jansi P K R, Shaila K, D N Sujatha, Venugopal K R, and L M
Patnaik
|
Multiple Domain Secure Routing for Wireless Sensor Networks
|
10 pages
|
International Journal of Information Processing, 7(2), 59-68, 2013
| null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Secure Transmission of data packets in Wireless Sensor Networks is an
important area of Research. There is a possibility of an attacker creating
security holes in the network. Hence, network security and reliability can be
achieved by discovering random multiple paths using multiple domains, and
forwarding data packets from the source node to the destination node. We have
designed, Multiple Domain Routing with Overlap of Nodes (MDRON) and Multiple
Domain Routing Without Overlap of Nodes (MDRWON) algorithms, in which packets
follow multiple optimized paths simultaneously. The Special node algorithm
searches the node which has maximum power and these nodes are used for
transferring the packet from one domain to another domain. Simulation results
using MATLAB shows that performance is better than Purely Random Propagation
(PRP) and Non Repetitive Random Propagation(NRRP) Algorithms.
|
[
{
"version": "v1",
"created": "Sun, 22 Sep 2013 14:06:59 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"T",
"Lata B",
""
],
[
"R",
"Jansi P K",
""
],
[
"K",
"Shaila",
""
],
[
"Sujatha",
"D N",
""
],
[
"R",
"Venugopal K",
""
],
[
"Patnaik",
"L M",
""
]
] |
new_dataset
| 0.990862 |
1309.5652
|
Nizar Habash
|
Mona Diab, Nizar Habash, Owen Rambow and Ryan Roth
|
LDC Arabic Treebanks and Associated Corpora: Data Divisions Manual
|
14 pages; one cover
| null | null |
CLCSL-0S7--1031-02
|
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The Linguistic Data Consortium (LDC) has developed hundreds of data corpora
for natural language processing (NLP) research. Among these are a number of
annotated treebank corpora for Arabic. Typically, these corpora consist of a
single collection of annotated documents. NLP research, however, usually
requires multiple data sets for the purposes of training models, developing
techniques, and final evaluation. Therefore it becomes necessary to divide the
corpora used into the required data sets (divisions). This document details a
set of rules that have been defined to enable consistent divisions for old and
new Arabic treebanks (ATB) and related corpora.
|
[
{
"version": "v1",
"created": "Sun, 22 Sep 2013 21:09:07 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Diab",
"Mona",
""
],
[
"Habash",
"Nizar",
""
],
[
"Rambow",
"Owen",
""
],
[
"Roth",
"Ryan",
""
]
] |
new_dataset
| 0.99713 |
1309.5735
|
Pekka Abrahamsson
|
Petteri Alahuhta, Pekka Abrahamsson, Antti Nummiaho
|
On Exploring Consumers' Technology Foresight Capabilities - An Analysis
of 4000 Mobile Service Ideas
|
Published in ICE-B 2008 - Proceedings of the International Conference
on e-Business, Porto, Portugal, July 26-29, 2008. INSTICC Press 2008 ISBN
978-989-8111-58-6
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lead user driven innovation and open innovation paradigms seek to involve
consumers and common people to innovative product development projects. In
order to help developers choose ideas that meet the end users' needs, we
undertook a massive collaborative research effort and collected 40000 ideas
from 2150 common people about future mobile services that they would like to
use. We inspired each people to produce tens of mobile service ideas. In this
paper we carry out an analysis for 4000 ideas from the idea database. We had a
particular interest in whether peoples' ideas can be used in foreseeing the
technology development needs. The results show that end users produce ideas
that are conservative more than novel. Therefore, we claim that consumers'
technology foresight horizon is limited by the existing technological base. The
second finding, linked to the previous one, is that the great majority of the
ideas that consumers expressed could be realised utilizing existing
technologies. The implication of this finding is that the idea database should
be an interesting source of ideas for service developers. The third finding of
the study, related to the methodology, is that a vast number of ideas can be
collected fairly easily but analyzing them cost effectively is a challenge.
|
[
{
"version": "v1",
"created": "Mon, 23 Sep 2013 09:13:52 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Alahuhta",
"Petteri",
""
],
[
"Abrahamsson",
"Pekka",
""
],
[
"Nummiaho",
"Antti",
""
]
] |
new_dataset
| 0.990016 |
1309.5787
|
Andreas Brandstadt
|
Anne Berry, Andreas Brandst\"adt, Konrad Engel
|
The Dilworth Number of Auto-Chordal-Bipartite Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E)
has the same color classes X and Y as B, and two vertices x in X and y in Y are
adjacent in mir(B) if and only if xy is not in E. A bipartite graph is chordal
bipartite if none of its induced subgraphs is a chordless cycle with at least
six vertices. In this paper, we deal with chordal bipartite graphs whose mirror
is chordal bipartite as well; we call these graphs auto-chordal bipartite
graphs (ACB graphs for short). We describe the relationship to some known graph
classes such as interval and strongly chordal graphs and we present several
characterizations of ACB graphs. We show that ACB graphs have unbounded
Dilworth number, and we characterize ACB graphs with Dilworth number k.
|
[
{
"version": "v1",
"created": "Mon, 23 Sep 2013 12:40:52 GMT"
}
] | 2013-09-24T00:00:00 |
[
[
"Berry",
"Anne",
""
],
[
"Brandstädt",
"Andreas",
""
],
[
"Engel",
"Konrad",
""
]
] |
new_dataset
| 0.999694 |
1309.5129
|
EPTCS
|
Colin Stirling
|
A Proof System with Names for Modal Mu-calculus
|
In Proceedings Festschrift for Dave Schmidt, arXiv:1309.4557
|
EPTCS 129, 2013, pp. 18-29
|
10.4204/EPTCS.129.2
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fixpoints are an important ingredient in semantics, abstract interpretation
and program logics. Their addition to a logic can add considerable expressive
power. One general issue is how to define proof systems for such logics. Here
we examine proof systems for modal logic with fixpoints. We present a tableau
proof system for checking validity of formulas which uses names to keep track
of unfoldings of fixpoint variables as devised by Jungteerapanich.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 01:43:08 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Stirling",
"Colin",
""
]
] |
new_dataset
| 0.993181 |
1309.5133
|
EPTCS
|
Mads Rosendahl (Roskilde University)
|
Abstract Interpretation as a Programming Language
|
In Proceedings Festschrift for Dave Schmidt, arXiv:1309.4557
|
EPTCS 129, 2013, pp. 84-104
|
10.4204/EPTCS.129.7
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In David Schmidt's PhD work he explored the use of denotational semantics as
a programming language. It was part of an effort to not only treat formal
semantics as specifications but also as interpreters and input to compiler
generators. The semantics itself can be seen as a program and one may examine
different programming styles and ways to represent states.
Abstract interpretation is primarily a technique for derivation and
specification of program analysis. As with denotational semantics we may also
view abstract interpretations as programs and examine the implementation. The
main focus in this paper is to show that results from higher-order strictness
analysis may be used more generally as fixpoint operators for higher-order
functions over lattices and thus provide a technique for immediate
implementation of a large class of abstract interpretations. Furthermore, it
may be seen as a programming paradigm and be used to write programs in a
circular style.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 01:43:40 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Rosendahl",
"Mads",
"",
"Roskilde University"
]
] |
new_dataset
| 0.954759 |
1309.5134
|
EPTCS
|
Jeffrey T. Denniston, Austin Melton, Stephen E. Rodabaugh
|
Formal Contexts, Formal Concept Analysis, and Galois Connections
|
In Proceedings Festschrift for Dave Schmidt, arXiv:1309.4557
|
EPTCS 129, 2013, pp. 105-120
|
10.4204/EPTCS.129.8
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Formal concept analysis (FCA) is built on a special type of Galois
connections called polarities. We present new results in formal concept
analysis and in Galois connections by presenting new Galois connection results
and then applying these to formal concept analysis. We also approach FCA from
the perspective of collections of formal contexts. Usually, when doing FCA, a
formal context is fixed. We are interested in comparing formal contexts and
asking what criteria should be used when determining when one formal context is
better than another formal context. Interestingly, we address this issue by
studying sets of polarities.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 01:43:48 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Denniston",
"Jeffrey T.",
""
],
[
"Melton",
"Austin",
""
],
[
"Rodabaugh",
"Stephen E.",
""
]
] |
new_dataset
| 0.994249 |
1309.5144
|
EPTCS
|
Anindya Banerjee, David A. Naumann
|
A Simple Semantics and Static Analysis for Stack Inspection
|
In Proceedings Festschrift for Dave Schmidt, arXiv:1309.4557
|
EPTCS 129, 2013, pp. 284-308
|
10.4204/EPTCS.129.17
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Java virtual machine and the .NET common language runtime feature an
access control mechanism specified operationally in terms of run-time stack
inspection. We give a denotational semantics in "eager" form, and show that it
is equivalent to the "lazy" semantics using stack inspection. We give a static
analysis of safety, i.e., the absence of security errors, that is simpler than
previous proposals. We identify several program transformations that can be
used to remove run-time checks. We give complete, detailed proofs for safety of
the analysis and for the transformations, exploiting compositionality of the
eager semantics.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 01:45:17 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Banerjee",
"Anindya",
""
],
[
"Naumann",
"David A.",
""
]
] |
new_dataset
| 0.994316 |
1309.5223
|
Ralf Steinberger
|
Ralf Steinberger, Mohamed Ebrahim, Marco Turchi
|
JRC EuroVoc Indexer JEX - A freely available multi-label categorisation
tool
| null |
Proceedings of the 8th international conference on Language
Resources and Evaluation (LREC'2012), pp. 798-805, Istanbul, 21-27 May 2012
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
EuroVoc (2012) is a highly multilingual thesaurus consisting of over 6,700
hierarchically organised subject domains used by European Institutions and many
authorities in Member States of the European Union (EU) for the classification
and retrieval of official documents. JEX is JRC-developed multi-label
classification software that learns from manually labelled data to
automatically assign EuroVoc descriptors to new documents in a profile-based
category-ranking task. The JEX release consists of trained classifiers for 22
official EU languages, of parallel training data in the same languages, of an
interface that allows viewing and amending the assignment results, and of a
module that allows users to re-train the tool on their own document
collections. JEX allows advanced users to change the document representation so
as to possibly improve the categorisation result through linguistic
pre-processing. JEX can be used as a tool for interactive EuroVoc descriptor
assignment to increase speed and consistency of the human categorisation
process, or it can be used fully automatically. The output of JEX is a
language-independent EuroVoc feature vector lending itself also as input to
various other Language Technology tasks, including cross-lingual clustering and
classification, cross-lingual plagiarism detection, sentence selection and
ranking, and more.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 09:51:59 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Steinberger",
"Ralf",
""
],
[
"Ebrahim",
"Mohamed",
""
],
[
"Turchi",
"Marco",
""
]
] |
new_dataset
| 0.999649 |
1309.5226
|
Ralf Steinberger
|
Ralf Steinberger, Andreas Eisele, Szymon Klocek, Spyridon Pilos,
Patrick Schl\"uter
|
DGT-TM: A freely Available Translation Memory in 22 Languages
| null |
Proceedings of the 8th international conference on Language
Resources and Evaluation (LREC'2012), pp. 454-459, Istanbul, 21-27 May 2012
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The European Commission's (EC) Directorate General for Translation, together
with the EC's Joint Research Centre, is making available a large translation
memory (TM; i.e. sentences and their professionally produced translations)
covering twenty-two official European Union (EU) languages and their 231
language pairs. Such a resource is typically used by translation professionals
in combination with TM software to improve speed and consistency of their
translations. However, this resource has also many uses for translation studies
and for language technology applications, including Statistical Machine
Translation (SMT), terminology extraction, Named Entity Recognition (NER),
multilingual classification and clustering, and many more. In this reference
paper for DGT-TM, we introduce this new resource, provide statistics regarding
its size, and explain how it was produced and how to use it.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 10:02:58 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Steinberger",
"Ralf",
""
],
[
"Eisele",
"Andreas",
""
],
[
"Klocek",
"Szymon",
""
],
[
"Pilos",
"Spyridon",
""
],
[
"Schlüter",
"Patrick",
""
]
] |
new_dataset
| 0.999721 |
1309.5255
|
Dheerendra Mishra Mr.
|
Dheerendra Mishra and Sourav Mukhopadhyay
|
Cryptanalysis of Wu and Xu's authentication scheme for Telecare Medicine
Information Systems
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Remote user authentication is desirable for a Telecare medicine information
system (TMIS) to verify the correctness of remote users. In 2013, Jiang et al.
proposed privacy preserving authentication scheme for TMIS. Recently, Wu and Xu
analyzed Jiang's scheme and identify serious security flaws in their scheme,
namely, user impersonation attack, DoS attack and off-line password guessing
attack. In this article, we analyze Wu and Xu's scheme and show that their
scheme is also vulnerable to off-line password guessing attack and does not
protect user anonymity. Moreover, we identify the inefficiency of incorrect
input detection of the login phase in Wu and Xu's scheme, where the smart card
executes the login session in-spite of wrong input.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 12:47:44 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Mishra",
"Dheerendra",
""
],
[
"Mukhopadhyay",
"Sourav",
""
]
] |
new_dataset
| 0.990433 |
1309.5319
|
Clement Moulin-Frier
|
Cl\'ement Moulin-Frier (INRIA Bordeaux - Sud-Ouest, GIPSA-lab), M. A.
Arbib (USC)
|
Recognizing Speech in a Novel Accent: The Motor Theory of Speech
Perception Reframed
| null |
Biological Cybernetics 107, 4 (2013) 421-447
|
10.1007/s00422-013-0557-3
| null |
cs.CL cs.LG q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The motor theory of speech perception holds that we perceive the speech of
another in terms of a motor representation of that speech. However, when we
have learned to recognize a foreign accent, it seems plausible that recognition
of a word rarely involves reconstruction of the speech gestures of the speaker
rather than the listener. To better assess the motor theory and this
observation, we proceed in three stages. Part 1 places the motor theory of
speech perception in a larger framework based on our earlier models of the
adaptive formation of mirror neurons for grasping, and for viewing extensions
of that mirror system as part of a larger system for neuro-linguistic
processing, augmented by the present consideration of recognizing speech in a
novel accent. Part 2 then offers a novel computational model of how a listener
comes to understand the speech of someone speaking the listener's native
language with a foreign accent. The core tenet of the model is that the
listener uses hypotheses about the word the speaker is currently uttering to
update probabilities linking the sound produced by the speaker to phonemes in
the native language repertoire of the listener. This, on average, improves the
recognition of later words. This model is neutral regarding the nature of the
representations it uses (motor vs. auditory). It serve as a reference point for
the discussion in Part 3, which proposes a dual-stream neuro-linguistic
architecture to revisits claims for and against the motor theory of speech
perception and the relevance of mirror neurons, and extracts some implications
for the reframing of the motor theory.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 16:47:48 GMT"
}
] | 2013-09-23T00:00:00 |
[
[
"Moulin-Frier",
"Clément",
"",
"INRIA Bordeaux - Sud-Ouest, GIPSA-lab"
],
[
"Arbib",
"M. A.",
"",
"USC"
]
] |
new_dataset
| 0.995036 |
1309.4887
|
Tilo Wettig
|
Nils Meyer, Manfred Ries, Stefan Solbrig, Tilo Wettig
|
iDataCool: HPC with Hot-Water Cooling and Energy Reuse
|
12 pages, 7 figures, proceedings of ISC 2013
|
Lecture Notes in Computer Science 7905 (2013) 383
|
10.1007/978-3-642-38750-0_29
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
iDataCool is an HPC architecture jointly developed by the University of
Regensburg and the IBM Research and Development Lab B\"oblingen. It is based on
IBM's iDataPlex platform, whose air-cooling solution was replaced by a custom
water-cooling solution that allows for cooling water temperatures of 70C/158F.
The system is coupled to an adsorption chiller by InvenSor that operates
efficiently at these temperatures. Thus a significant portion of the energy
spent on HPC can be recovered in the form of chilled water, which can then be
used to cool other parts of the computing center. We describe the architecture
of iDataCool and present benchmarks of the cooling performance and the energy
(reuse) efficiency.
|
[
{
"version": "v1",
"created": "Thu, 19 Sep 2013 07:53:10 GMT"
}
] | 2013-09-20T00:00:00 |
[
[
"Meyer",
"Nils",
""
],
[
"Ries",
"Manfred",
""
],
[
"Solbrig",
"Stefan",
""
],
[
"Wettig",
"Tilo",
""
]
] |
new_dataset
| 0.998388 |
1309.4962
|
Josef Urban
|
Cezary Kaliszyk and Josef Urban
|
HOL(y)Hammer: Online ATP Service for HOL Light
| null | null | null | null |
cs.AI cs.DL cs.LG cs.LO cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
HOL(y)Hammer is an online AI/ATP service for formal (computer-understandable)
mathematics encoded in the HOL Light system. The service allows its users to
upload and automatically process an arbitrary formal development (project)
based on HOL Light, and to attack arbitrary conjectures that use the concepts
defined in some of the uploaded projects. For that, the service uses several
automated reasoning systems combined with several premise selection methods
trained on all the project proofs. The projects that are readily available on
the server for such query answering include the recent versions of the
Flyspeck, Multivariate Analysis and Complex Analysis libraries. The service
runs on a 48-CPU server, currently employing in parallel for each task 7 AI/ATP
combinations and 4 decision procedures that contribute to its overall
performance. The system is also available for local installation by interested
users, who can customize it for their own proof development. An Emacs interface
allowing parallel asynchronous queries to the service is also provided. The
overall structure of the service is outlined, problems that arise and their
solutions are discussed, and an initial account of using the system is given.
|
[
{
"version": "v1",
"created": "Thu, 19 Sep 2013 13:22:31 GMT"
}
] | 2013-09-20T00:00:00 |
[
[
"Kaliszyk",
"Cezary",
""
],
[
"Urban",
"Josef",
""
]
] |
new_dataset
| 0.999672 |
1309.4557
|
EPTCS
|
Anindya Banerjee (IMDEA Software Institute), Olivier Danvy (Aarhus
University), Kyung-Goo Doh (Hanyang University), John Hatcliff (Kansas State
University)
|
Semantics, Abstract Interpretation, and Reasoning about Programs: Essays
Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday
| null |
EPTCS 129, 2013
|
10.4204/EPTCS.129
| null |
cs.PL cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This Liber Amicorum is a collection of essays ranging from personal memories
to technical contributions. It is a tribute to Dave Schmidt and his career, and
was composed at the occasion of his sixtieth birthday.
|
[
{
"version": "v1",
"created": "Wed, 18 Sep 2013 07:26:07 GMT"
}
] | 2013-09-19T00:00:00 |
[
[
"Banerjee",
"Anindya",
"",
"IMDEA Software Institute"
],
[
"Danvy",
"Olivier",
"",
"Aarhus\n University"
],
[
"Doh",
"Kyung-Goo",
"",
"Hanyang University"
],
[
"Hatcliff",
"John",
"",
"Kansas State\n University"
]
] |
new_dataset
| 0.997036 |
1309.4713
|
Patrizio Angelini
|
Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson
|
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
|
21 pages, 10 figures, 14 references
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that every $n$-vertex planar graph admits a simultaneous embedding
with no mapping and with fixed edges with any $(n/2)$-vertex planar graph. In
order to achieve this result, we prove that every $n$-vertex plane graph has an
induced outerplane subgraph containing at least $n/2$ vertices. Also, we show
that every $n$-vertex planar graph and every $n$-vertex planar partial 3-tree
admit a simultaneous embedding with no mapping and with fixed edges.
|
[
{
"version": "v1",
"created": "Wed, 18 Sep 2013 17:22:52 GMT"
}
] | 2013-09-19T00:00:00 |
[
[
"Angelini",
"Patrizio",
""
],
[
"Evans",
"William",
""
],
[
"Frati",
"Fabrizio",
""
],
[
"Gudmundsson",
"Joachim",
""
]
] |
new_dataset
| 0.999399 |
1103.1917
|
Francisco Soulignac
|
Martiniano Egu\'ia and Francisco J. Soulignac
|
Hereditary biclique-Helly graphs: recognition and maximal biclique
enumeration
|
23 pages, 4 figures
|
Discrete Math. Theor. Comput. Sci. 15 (2013), 55--74
| null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A biclique is a set of vertices that induce a bipartite complete graph. A
graph G is biclique-Helly when its family of maximal bicliques satisfies the
Helly property. If every induced subgraph of G is also biclique-Helly, then G
is hereditary biclique-Helly. A graph is C_4-dominated when every cycle of
length 4 contains a vertex that is dominated by the vertex of the cycle that is
not adjacent to it. In this paper we show that the class of hereditary
biclique-Helly graphs is formed precisely by those C_4-dominated graphs that
contain no triangles and no induced cycles of length either 5, or 6. Using this
characterization, we develop an algorithm for recognizing hereditary
biclique-Helly graphs in O(n^2+\alpha m) time and O(m) space. (Here n, m, and
\alpha = O(m^{1/2}) are the number of vertices and edges, and the arboricity of
the graph, respectively.) As a subprocedure, we show how to recognize those
C_4-dominated graphs that contain no triangles in O(\alpha m) time and O(m)
space. Finally, we show how to enumerate all the maximal bicliques of a
C_4-dominated graph with no triangles in O(n^2 + \alpha m) time and O(\alpha m)
space, and we discuss how some biclique problems can be solved in O(\alpha m)
time and O(n+m) space.
|
[
{
"version": "v1",
"created": "Wed, 9 Mar 2011 23:28:47 GMT"
}
] | 2013-09-18T00:00:00 |
[
[
"Eguía",
"Martiniano",
""
],
[
"Soulignac",
"Francisco J.",
""
]
] |
new_dataset
| 0.999266 |
1201.1684
|
Lawrence Ong
|
Lawrence Ong, Gottfried Lechner, Sarah J. Johnson, Christopher M.
Kellett
|
The Three-User Finite-Field Multi-Way Relay Channel with Correlated
Sources
|
Author's final version (accepted and to appear in IEEE Transactions
on Communications)
|
IEEE Transactions on Communications, Vol. 61, No. 8, pp.
3125-3135, Aug. 2013
|
10.1109/TCOMM.2013.13.120987
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the three-user finite-field multi-way relay channel, where
the users exchange messages via a relay. The messages are arbitrarily
correlated, and the finite-field channel is linear and is subject to additive
noise of arbitrary distribution. The problem is to determine the minimum
achievable source-channel rate, defined as channel uses per source symbol
needed for reliable communication. We combine Slepian-Wolf source coding and
functional-decode-forward channel coding to obtain the solution for two classes
of source and channel combinations. Furthermore, for correlated sources that
have their common information equal their mutual information, we propose a new
coding scheme to achieve the minimum source-channel rate.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2012 03:26:47 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Jun 2013 00:53:01 GMT"
}
] | 2013-09-18T00:00:00 |
[
[
"Ong",
"Lawrence",
""
],
[
"Lechner",
"Gottfried",
""
],
[
"Johnson",
"Sarah J.",
""
],
[
"Kellett",
"Christopher M.",
""
]
] |
new_dataset
| 0.990034 |
1201.4715
|
Marek Trt\'ik
|
Ji\v{r}\'i Slab\'y, Jan Strej\v{c}ek, Marek Trt\'ik
|
Compact Symbolic Execution
|
This is a full version of the paper accepted to ATVA 2013
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a generalisation of King's symbolic execution technique called
compact symbolic execution. It proceeds in two steps. First, we analyse cyclic
paths in the control flow graph of a given program, independently from the rest
of the program. Our goal is to compute a so called template for each such a
cyclic path. A template is a declarative parametric description of all possible
program states, which may leave the analysed cyclic path after any number of
iterations along it. In the second step, we execute the program symbolically
with the templates in hand. The result is a compact symbolic execution tree. A
compact tree always carry the same information in all its leaves as the
corresponding classic symbolic execution tree. Nevertheless, a compact tree is
typically substantially smaller than the corresponding classic tree. There are
even programs for which compact symbolic execution trees are finite while
classic symbolic execution trees are infinite.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2012 13:50:55 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Sep 2013 15:19:48 GMT"
}
] | 2013-09-18T00:00:00 |
[
[
"Slabý",
"Jiří",
""
],
[
"Strejček",
"Jan",
""
],
[
"Trtík",
"Marek",
""
]
] |
new_dataset
| 0.994269 |
1309.4157
|
Rui Li
|
Rui Li and Kevin Chen-Chuan Chang
|
EgoNet-UIUC: A Dataset For Ego Network Research
|
DataSet Description
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this report, we introduce the version one of EgoNet-UIUC, which is a
dataset for ego network research. The dataset contains about 230 ego networks
in Linkedin, which have about 33K users (with their attributes) and 283K
relationships (with their relationship types) in total. We name this dataset as
EgoNet-UIUC, which stands for Ego Network Dataset from University of Illinois
at Urbana-Champaign.
|
[
{
"version": "v1",
"created": "Tue, 17 Sep 2013 02:28:25 GMT"
}
] | 2013-09-18T00:00:00 |
[
[
"Li",
"Rui",
""
],
[
"Chang",
"Kevin Chen-Chuan",
""
]
] |
new_dataset
| 0.999852 |
1309.4334
|
Lse Lse
|
Martin Dias (INRIA Lille - Nord Europe), Damien Cassou (INRIA Lille -
Nord Europe), St\'ephane Ducasse (INRIA Lille - Nord Europe)
|
Representing Code History with Development Environment Events
| null |
IWST-2013 - 5th International Workshop on Smalltalk Technologies
(2013)
| null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern development environments handle information about the intent of the
programmer: for example, they use abstract syntax trees for providing
high-level code manipulation such as refactorings; nevertheless, they do not
keep track of this information in a way that would simplify code sharing and
change understanding. In most Smalltalk systems, source code modifications are
immediately registered in a transaction log often called a ChangeSet. Such
mechanism has proven reliability, but it has several limitations. In this paper
we analyse such limitations and describe scenarios and requirements for
tracking fine-grained code history with a semantic representation. We present
Epicea, an early prototype implementation. We want to enrich code sharing with
extra information from the IDE, which will help understanding the intention of
the changes and let a new generation of tools act in consequence.
|
[
{
"version": "v1",
"created": "Tue, 17 Sep 2013 14:50:22 GMT"
}
] | 2013-09-18T00:00:00 |
[
[
"Dias",
"Martin",
"",
"INRIA Lille - Nord Europe"
],
[
"Cassou",
"Damien",
"",
"INRIA Lille -\n Nord Europe"
],
[
"Ducasse",
"Stéphane",
"",
"INRIA Lille - Nord Europe"
]
] |
new_dataset
| 0.96098 |
1309.4396
|
Panagiotis Bouros Panagiotis Bouros
|
Dimitris Sacharidis, Panagiotis Bouros
|
Routing Directions: Keeping it Fast and Simple
|
Full version of the SIGSPATIAL'13 paper
|
21st ACM SIGSPATIAL International Conference on Advances in
Geographic Information Systems (ACM SIGSPATIAL GIS 2013), Orlando, Florida,
USA, November 5-8, 2013
|
10.1145/2525314.2525362
| null |
cs.DS cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of providing meaningful routing directions over road networks is
of great importance. In many real-life cases, the fastest route may not be the
ideal choice for providing directions in written, spoken text, or for an
unfamiliar neighborhood, or in cases of emergency. Rather, it is often more
preferable to offer "simple" directions that are easy to memorize, explain,
understand or follow. However, there exist cases where the simplest route is
considerably longer than the fastest. This paper tries to address this issue,
by finding near-simplest routes which are as short as possible and near-fastest
routes which are as simple as possible. Particularly, we focus on efficiency,
and propose novel algorithms, which are theoretically and experimentally shown
to be significantly faster than existing approaches.
|
[
{
"version": "v1",
"created": "Tue, 17 Sep 2013 17:14:49 GMT"
}
] | 2013-09-18T00:00:00 |
[
[
"Sacharidis",
"Dimitris",
""
],
[
"Bouros",
"Panagiotis",
""
]
] |
new_dataset
| 0.999082 |
1309.4426
|
Christian Widmer
|
Christian Widmer, Philipp Drewe, Xinghua Lou, Shefali Umrania,
Stephanie Heinrich, Gunnar R\"atsch
|
GRED: Graph-Regularized 3D Shape Reconstruction from Highly Anisotropic
and Noisy Images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analysis of microscopy images can provide insight into many biological
processes. One particularly challenging problem is cell nuclear segmentation in
highly anisotropic and noisy 3D image data. Manually localizing and segmenting
each and every cell nuclei is very time consuming, which remains a bottleneck
in large scale biological experiments. In this work we present a tool for
automated segmentation of cell nuclei from 3D fluorescent microscopic data. Our
tool is based on state-of-the-art image processing and machine learning
techniques and supports a friendly graphical user interface (GUI). We show that
our tool is as accurate as manual annotation but greatly reduces the time for
the registration.
|
[
{
"version": "v1",
"created": "Tue, 17 Sep 2013 18:55:37 GMT"
}
] | 2013-09-18T00:00:00 |
[
[
"Widmer",
"Christian",
""
],
[
"Drewe",
"Philipp",
""
],
[
"Lou",
"Xinghua",
""
],
[
"Umrania",
"Shefali",
""
],
[
"Heinrich",
"Stephanie",
""
],
[
"Rätsch",
"Gunnar",
""
]
] |
new_dataset
| 0.982304 |
1206.1422
|
Gabriel Nivasch
|
Gabriel Nivasch, J\'anos Pach and G\'abor Tardos
|
The visible perimeter of an arrangement of disks
|
12 pages, 5 figures
|
Computational Geometry: Theory and Applications, 47:42-51, 2014
|
10.1016/j.comgeo.2013.08.006
| null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a collection of n opaque unit disks in the plane, we want to find a
stacking order for them that maximizes their visible perimeter---the total
length of all pieces of their boundaries visible from above. We prove that if
the centers of the disks form a dense point set, i.e., the ratio of their
maximum to their minimum distance is O(n^1/2), then there is a stacking order
for which the visible perimeter is Omega(n^2/3). We also show that this bound
cannot be improved in the case of a sufficiently small n^1/2 by n^1/2 uniform
grid. On the other hand, if the set of centers is dense and the maximum
distance between them is small, then the visible perimeter is O(n^3/4) with
respect to any stacking order. This latter bound cannot be improved either.
Finally, we address the case where no more than c disks can have a point in
common. These results partially answer some questions of Cabello, Haverkort,
van Kreveld, and Speckmann.
|
[
{
"version": "v1",
"created": "Thu, 7 Jun 2012 08:28:04 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Sep 2013 19:05:36 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Nivasch",
"Gabriel",
""
],
[
"Pach",
"János",
""
],
[
"Tardos",
"Gábor",
""
]
] |
new_dataset
| 0.994912 |
1210.8375
|
Roohallah Rastaghi
|
Roohallah Rastaghi
|
Cryptanalysis of a New Knapsack Type Public-Key Cryptosystem
|
International Conference on Applied Mathematics and Computer
Sciences, Rio de Janeiro, Brazil, March 2010
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, Hwang et al. introduced a knapsack type public-key cryptosystem.
They proposed a new algorithm called permutation combination algorithm. By
exploiting this algorithm, they attempt to increase the density of knapsack to
avoid the low-density attack.
We show that this cryptosystem is not secure, as it based on basic
Merkel-Hellman knapsack cryptosystem and because of the superincreasing
structure, we can use shamir's attack on the basic Merkel-Hellman knapsack to
break this cryptosystem.
|
[
{
"version": "v1",
"created": "Wed, 31 Oct 2012 16:05:30 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Sep 2013 18:50:12 GMT"
}
] | 2013-09-17T00:00:00 |
[
[
"Rastaghi",
"Roohallah",
""
]
] |
new_dataset
| 0.991656 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.