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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0709.0099
|
Avraham Trahtman N
|
A. N. Trahtman
|
The road coloring problem
|
9 pages, correct typos
| null | null | null |
cs.DM
| null |
The synchronizing word of deterministic automaton is a word in the alphabet
of colors (considered as letters) of its edges that maps the automaton to a
single state. A coloring of edges of a directed graph is synchronizing if the
coloring turns the graph into deterministic finite automaton possessing a
synchronizing word.
The road coloring problem is a problem of synchronizing coloring of directed
finite strongly connected graph with constant outdegree of all its vertices if
the greatest common divisor of lengths of all its cycles is one. The problem
was posed by Adler, Goodwyn and Weiss over 30 years ago and evoked a noticeable
interest among the specialists in theory of graphs, deterministic automata and
symbolic dynamics. The problem is described even in "Wikipedia" - the popular
Internet Encyclopedia. The positive solution of the road coloring problem is
presented.
|
[
{
"version": "v1",
"created": "Sun, 2 Sep 2007 10:08:46 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Sep 2007 16:15:52 GMT"
},
{
"version": "v3",
"created": "Wed, 24 Oct 2007 16:52:54 GMT"
},
{
"version": "v4",
"created": "Fri, 21 Dec 2007 08:07:18 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Trahtman",
"A. N.",
""
]
] |
new_dataset
| 0.99848 |
0911.1226
|
Gwendal Simon
|
Yaning Liu and Gwendal Simon
|
Large-Scale Time-Shifted Streaming Delivery
| null | null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An attractive new feature of connected TV systems consists in allowing users
to access past portions of the TV channel. This feature, called time-shifted
streaming, is now used by millions of TV viewers. We address in this paper the
design of a large-scale delivery system for time-shifted streaming. We
highlight the characteristics of time-shifted streaming that prevent known
video delivery systems to be used. Then, we present two proposals that meet the
demand for two radically different types of TV operator. First, the
Peer-Assisted Catch-Up Streaming system, namely PACUS, aims at reducing the
load on the server of a large TV broadcasters without losing the control of the
TV delivery. Second, the turntable structure, is an overlay of nodes that allow
an independent content delivery network or a small independent TV broadcaster
to ensure that all past TV programs are stored and as available as possible. We
show through extensive simulations that our objectives are reached, with a
reduction of up to three quarters of the traffic for PACUS and a 100\%
guaranteed availability for the turntable structure. We also compare our
proposals to the main previous works in the area.
|
[
{
"version": "v1",
"created": "Fri, 6 Nov 2009 11:10:43 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Nov 2011 19:01:04 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Liu",
"Yaning",
""
],
[
"Simon",
"Gwendal",
""
]
] |
new_dataset
| 0.997039 |
1001.4898
|
Ccsd
|
Sylvie Boldo (INRIA Saclay - Ile de France, LRI), Fran\c{c}ois
Cl\'ement (INRIA Rocquencourt), Jean-Christophe Filli\^atre (INRIA Saclay -
Ile de France, LRI), Micaela Mayero (LIPN, INRIA Rh\^one-Alpes / LIP
Laboratoire de l'Informatique du Parall\'elisme), Guillaume Melquiond (INRIA
Saclay - Ile de France, LRI), Pierre Weis (INRIA Rocquencourt)
|
Formal Proof of a Wave Equation Resolution Scheme: the Method Error
|
This paper has been withdrawn by the authors. Please refere to
arXiv:1005.0824
| null | null |
RR-7181
|
cs.LO math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Popular finite difference numerical schemes for the resolution of the
one-dimensional acoustic wave equation are well-known to be convergent. We
present a comprehensive formalization of the simplest one and formally prove
its convergence in Coq. The main difficulties lie in the proper definition of
asymptotic behaviors and the implicit way they are handled in the mathematical
pen-and-paper proofs. To our knowledge, this is the first time such kind of
mathematical proof is machine-checked.
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2010 10:33:52 GMT"
},
{
"version": "v2",
"created": "Fri, 7 May 2010 09:16:40 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Nov 2011 10:17:06 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Boldo",
"Sylvie",
"",
"INRIA Saclay - Ile de France, LRI"
],
[
"Clément",
"François",
"",
"INRIA Rocquencourt"
],
[
"Filliâtre",
"Jean-Christophe",
"",
"INRIA Saclay -\n Ile de France, LRI"
],
[
"Mayero",
"Micaela",
"",
"LIPN, INRIA Rhône-Alpes / LIP\n Laboratoire de l'Informatique du Parallélisme"
],
[
"Melquiond",
"Guillaume",
"",
"INRIA\n Saclay - Ile de France, LRI"
],
[
"Weis",
"Pierre",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.99393 |
1009.1013
|
M. Emre Celebi
|
M. Emre Celebi, Hitoshi Iyatomi, William V. Stoecker, Randy H. Moss,
Harold S. Rabinovitz, Giuseppe Argenziano, H. Peter Soyer
|
Automatic Detection of Blue-White Veil and Related Structures in
Dermoscopy Images
| null |
Computerized Medical Imaging and Graphics 32 (2008) 670-677
|
10.1016/j.compmedimag.2008.08.003
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dermoscopy is a non-invasive skin imaging technique, which permits
visualization of features of pigmented melanocytic neoplasms that are not
discernable by examination with the naked eye. One of the most important
features for the diagnosis of melanoma in dermoscopy images is the blue-white
veil (irregular, structureless areas of confluent blue pigmentation with an
overlying white "ground-glass" film). In this article, we present a machine
learning approach to the detection of blue-white veil and related structures in
dermoscopy images. The method involves contextual pixel classification using a
decision tree classifier. The percentage of blue-white areas detected in a
lesion combined with a simple shape descriptor yielded a sensitivity of 69.35%
and a specificity of 89.97% on a set of 545 dermoscopy images. The sensitivity
rises to 78.20% for detection of blue veil in those cases where it is a primary
feature for melanoma recognition.
|
[
{
"version": "v1",
"created": "Mon, 6 Sep 2010 10:29:18 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Celebi",
"M. Emre",
""
],
[
"Iyatomi",
"Hitoshi",
""
],
[
"Stoecker",
"William V.",
""
],
[
"Moss",
"Randy H.",
""
],
[
"Rabinovitz",
"Harold S.",
""
],
[
"Argenziano",
"Giuseppe",
""
],
[
"Soyer",
"H. Peter",
""
]
] |
new_dataset
| 0.961672 |
1106.1228
|
EPTCS
|
Yoad Lustig (Rice University), Moshe Vardi (Rice University)
|
Synthesis from Recursive-Components Libraries
|
In Proceedings GandALF 2011, arXiv:1106.0814
|
EPTCS 54, 2011, pp. 1-16
|
10.4204/EPTCS.54.1
| null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Synthesis is the automatic construction of a system from its specification.
In classical synthesis algorithms it is always assumed that the system is
"constructed from scratch" rather than composed from reusable components. This,
of course, rarely happens in real life. In real life, almost every non-trivial
commercial software system relies heavily on using libraries of reusable
components. Furthermore, other contexts, such as web-service orchestration, can
be modeled as synthesis of a system from a library of components.
In 2009 we introduced LTL synthesis from libraries of reusable components.
Here, we extend the work and study synthesis from component libraries with
"call and return"' control flow structure. Such control-flow structure is very
common in software systems. We define the problem of Nested-Words Temporal
Logic (NWTL) synthesis from recursive component libraries, where NWTL is a
specification formalism, richer than LTL, that is suitable for "call and
return" computations. We solve the problem, providing a synthesis algorithm,
and show the problem is 2EXPTIME-complete, as standard synthesis.
|
[
{
"version": "v1",
"created": "Tue, 7 Jun 2011 01:05:37 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Lustig",
"Yoad",
"",
"Rice University"
],
[
"Vardi",
"Moshe",
"",
"Rice University"
]
] |
new_dataset
| 0.998063 |
1109.1251
|
Xu Chu Ding
|
Yushan Chen, Xu Chu Ding, Calin Belta
|
Synthesis of Distributed Control and Communication Schemes from Global
LTL Specifications
|
Technical Report accompanying an accepted paper for CDC2011
| null | null | null |
cs.RO cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a technique for synthesis of control and communication
strategies for a team of agents from a global task specification given as a
Linear Temporal Logic (LTL) formula over a set of properties that can be
satisfied by the agents. We consider a purely discrete scenario, in which the
dynamics of each agent is modeled as a finite transition system. The proposed
computational framework consists of two main steps. First, we extend results
from concurrency theory to check whether the specification is distributable
among the agents. Second, we generate individual control and communication
strategies by using ideas from LTL model checking. We apply the method to
automatically deploy a team of miniature cars in our Robotic Urban-Like
Environment.
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2011 18:05:36 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Chen",
"Yushan",
""
],
[
"Ding",
"Xu Chu",
""
],
[
"Belta",
"Calin",
""
]
] |
new_dataset
| 0.993975 |
1111.2097
|
Preetha K G
|
Preetha K. G
|
A Novel Solution to the Short Range Bluetooth Communication
|
10 pages; IJANS-2011 October Issue
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bluetooth is developed for short range communication. Bluetooth Devices are
normally having low power and low cost. This is a wireless communication
technology designed to connect phones, laptops and PDAs. The greater
availability of portable devices with Bluetooth connectivity imposes wireless
connection between enabled devices. On an average the range of Bluetooth
devices is about 10 meters. The basic limitation of the Bluetooth communication
is this range limitation. In this paper I have studied the limitations of
Bluetooth communication and consider range constraint as the major limitation.
I propose a new expanded Blue tooth network to overcome the range constraint of
Bluetooth device. This creates a network of Bluetooth enabled devices that will
include laptops, set top devices and also mobile phones. The main purpose of
this proposal is to establish a network will enable the users to communicate
outside the range without any range constraint.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2011 04:11:57 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"G",
"Preetha K.",
""
]
] |
new_dataset
| 0.985886 |
1111.2208
|
Ruchi Tuli Dr.
|
Ruchi Tuli, Parveen Kumar
|
Minimum Process Coordinated Checkpointing Scheme for Ad Hoc Networks
| null | null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The wireless mobile ad hoc network (MANET) architecture is one consisting of
a set of mobile hosts capable of communicating with each other without the
assistance of base stations. This has made possible creating a mobile
distributed computing environment and has also brought several new challenges
in distributed protocol design. In this paper, we study a very fundamental
problem, the fault tolerance problem, in a MANET environment and propose a
minimum process coordinated checkpointing scheme. Since potential problems of
this new environment are insufficient power and limited storage capacity, the
proposed scheme tries to reduce the amount of information saved for recovery.
The MANET structure used in our algorithm is hierarchical based. The scheme is
based for Cluster Based Routing Protocol (CBRP) which belongs to a class of
Hierarchical Reactive routing protocols. The protocol proposed by us is
nonblocking coordinated checkpointing algorithm suitable for ad hoc
environments. It produces a consistent set of checkpoints; the algorithm makes
sure that only minimum number of nodes in the cluster are required to take
checkpoints; it uses very few control messages. Performance analysis shows that
our algorithm outperforms the existing related works and is a novel idea in the
field. Firstly, we describe an organization of the cluster. Then we propose a
minimum process coordinated checkpointing scheme for cluster based ad hoc
routing protocols.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2011 14:01:07 GMT"
}
] | 2011-11-10T00:00:00 |
[
[
"Tuli",
"Ruchi",
""
],
[
"Kumar",
"Parveen",
""
]
] |
new_dataset
| 0.988499 |
0710.4630
|
EDA Publishing Association
|
Trent Mcconaghy, Tom Eeckelaert, Georges Gielen
|
CAFFEINE: Template-Free Symbolic Model Generation of Analog Circuits via
Canonical Form Functions and Genetic Programming
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
This paper presents a method to automatically generate compact symbolic
performance models of analog circuits with no prior specification of an
equation template. The approach takes SPICE simulation data as input, which
enables modeling of any nonlinear circuits and circuit characteristics. Genetic
programming is applied as a means of traversing the space of possible symbolic
expressions. A grammar is specially designed to constrain the search to a
canonical form for functions. Novel evolutionary search operators are designed
to exploit the structure of the grammar. The approach generates a set of
symbolic models which collectively provide a tradeoff between error and model
complexity. Experimental results show that the symbolic models generated are
compact and easy to understand, making this an effective method for aiding
understanding in analog design. The models also demonstrate better prediction
quality than posynomials.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 08:07:11 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Mcconaghy",
"Trent",
""
],
[
"Eeckelaert",
"Tom",
""
],
[
"Gielen",
"Georges",
""
]
] |
new_dataset
| 0.972935 |
0710.4633
|
EDA Publishing Association
|
Bharat Sukhwani, Uday Padmanabhan, Janet M. Wang
|
Nano-Sim: A Step Wise Equivalent Conductance based Statistical Simulator
for Nanotechnology Circuit Design
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
|
10.1109/DATE.2005.221
| null |
cs.PF
| null |
New nanotechnology based devices are replacing CMOS devices to overcome CMOS
technology's scaling limitations. However, many such devices exhibit
non-monotonic I-V characteristics and uncertain properties which lead to the
negative differential resistance (NDR) problem and the chaotic performance.
This paper proposes a new circuit simulation approach that can effectively
simulate nanotechnology devices with uncertain input sources and negative
differential resistance (NDR) problem. The experimental results show a 20-30
times speedup comparing with existing simulators.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 08:07:46 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Sukhwani",
"Bharat",
""
],
[
"Padmanabhan",
"Uday",
""
],
[
"Wang",
"Janet M.",
""
]
] |
new_dataset
| 0.974844 |
0710.4637
|
EDA Publishing Association
|
Irith Pomeranz, Sudhakar M. Reddy
|
The Accidental Detection Index as a Fault Ordering Heuristic for
Full-Scan Circuits
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.OH
| null |
We investigate a new fault ordering heuristic for test generation in
full-scan circuits. The heuristic is referred to as the accidental detection
index. It associates a value ADI (f) with every circuit fault f. The heuristic
estimates the number of faults that will be detected by a test generated for f.
Fault ordering is done such that a fault with a higher accidental detection
index appears earlier in the ordered fault set and targeted earlier during test
generation. This order is effective for generating compact test sets, and for
obtaining a test set with a steep fault coverage curve. Such a test set has
several applications. We present experimental results to demonstrate the
effectiveness of the heuristic.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 08:09:39 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Pomeranz",
"Irith",
""
],
[
"Reddy",
"Sudhakar M.",
""
]
] |
new_dataset
| 0.999523 |
0710.4645
|
EDA Publishing Association
|
B. Cheon, E. Lee, L.-T. Wang, X. Wen, P. Hsu, J. Cho, J. Park, H.
Chao, S. Wu
|
At-Speed Logic BIST for IP Cores
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
This paper describes a flexible logic BIST scheme that features high fault
coverage achieved by fault-simulation guided test point insertion, real
at-speed test capability for multi-clock designs without clock frequency
manipulation, and easy physical implementation due to the use of a low-speed SE
signal. Application results of this scheme to two widely used IP cores are also
reported.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 08:19:34 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Cheon",
"B.",
""
],
[
"Lee",
"E.",
""
],
[
"Wang",
"L. -T.",
""
],
[
"Wen",
"X.",
""
],
[
"Hsu",
"P.",
""
],
[
"Cho",
"J.",
""
],
[
"Park",
"J.",
""
],
[
"Chao",
"H.",
""
],
[
"Wu",
"S.",
""
]
] |
new_dataset
| 0.99965 |
0710.4678
|
EDA Publishing Association
|
R. Thewes, C. Paulus, M. Schienle, F. Hofmann, A. Frey, R. Brederlow,
M. Augustyniak, M. Jenkner, B. Eversmann, P. Schindler-Bauer, M. Atzesberger,
B. Holzapfl, G. Beer, T. Haneder, H.-C. Hanke
|
CMOS-Based Biosensor Arrays
| null |
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
CMOS-based sensor array chips provide new and attractive features as compared
to today's standard tools for medical, diagnostic, and biotechnical
applications. Examples for molecule- and cell-based approaches and related
circuit design issues are discussed.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:02:53 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Thewes",
"R.",
""
],
[
"Paulus",
"C.",
""
],
[
"Schienle",
"M.",
""
],
[
"Hofmann",
"F.",
""
],
[
"Frey",
"A.",
""
],
[
"Brederlow",
"R.",
""
],
[
"Augustyniak",
"M.",
""
],
[
"Jenkner",
"M.",
""
],
[
"Eversmann",
"B.",
""
],
[
"Schindler-Bauer",
"P.",
""
],
[
"Atzesberger",
"M.",
""
],
[
"Holzapfl",
"B.",
""
],
[
"Beer",
"G.",
""
],
[
"Haneder",
"T.",
""
],
[
"Hanke",
"H. -C.",
""
]
] |
new_dataset
| 0.999334 |
0710.4684
|
EDA Publishing Association
|
S. Tosun, N. Mansouri, E. Arvas, M. Kandemir, Yuan Xie
|
Reliability-Centric High-Level Synthesis
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
Importance of addressing soft errors in both safety critical applications and
commercial consumer products is increasing, mainly due to ever shrinking
geometries, higher-density circuits, and employment of power-saving techniques
such as voltage scaling and component shut-down. As a result, it is becoming
necessary to treat reliability as a first-class citizen in system design. In
particular, reliability decisions taken early in system design can have
significant benefits in terms of design quality. Motivated by this observation,
this paper presents a reliability-centric high-level synthesis approach that
addresses the soft error problem. The proposed approach tries to maximize
reliability of the design while observing the bounds on area and performance,
and makes use of our reliability characterization of hardware components such
as adders and multipliers. We implemented the proposed approach, performed
experiments with several designs, and compared the results with those obtained
by a prior proposal.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:07:44 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Tosun",
"S.",
""
],
[
"Mansouri",
"N.",
""
],
[
"Arvas",
"E.",
""
],
[
"Kandemir",
"M.",
""
],
[
"Xie",
"Yuan",
""
]
] |
new_dataset
| 0.963519 |
0710.4691
|
EDA Publishing Association
|
Zhuo Li, Weiping Shi
|
An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer
Types
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
Buffer insertion is a popular technique to reduce the interconnect delay. The
classic buffer insertion algorithm of van Ginneken has time complexity O(n^2),
where n is the number of buffer positions. Lillis, Cheng and Lin extended van
Ginneken's algorithm to allow b buffer types in time O (b^2 n^2). For modern
design libraries that contain hundreds of buffers, it is a serious challenge to
balance the speed and performance of the buffer insertion algorithm. In this
paper, we present a new algorithm that computes the optimal buffer insertion in
O (bn^2) time. The reduction is achieved by the observation that the (Q, C)
pairs of the candidates that generate the new candidates must form a convex
hull. On industrial test cases, the new algorithm is faster than the previous
best buffer insertion algorithms by orders of magnitude.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:11:11 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Li",
"Zhuo",
""
],
[
"Shi",
"Weiping",
""
]
] |
new_dataset
| 0.998028 |
0710.4709
|
EDA Publishing Association
|
Georges Gielen, Wim Dehaene, Phillip Christie, Dieter Draxelmayr,
Edmond Janssens, Karen Maex, Ted Vucurevich
|
Analog and Digital Circuit Design in 65 nm CMOS: End of the Road?
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
This special session adresses the problems that designers face when
implementing analog and digital circuits in nanometer technologies. An
introductory embedded tutorial will give an overview of the design problems at
hand : the leakage power and process variability and their implications for
digital circuits and memories, and the reducing supply voltages, the design
productivity and signal integrity problems for embedded analog blocks. Next, a
panel of experts from both industrial semiconductor houses and design
companies, EDA vendors and research institutes will present and discuss with
the audience their opinions on whether the design road ends at marker "65nm" or
not.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:30:46 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Gielen",
"Georges",
""
],
[
"Dehaene",
"Wim",
""
],
[
"Christie",
"Phillip",
""
],
[
"Draxelmayr",
"Dieter",
""
],
[
"Janssens",
"Edmond",
""
],
[
"Maex",
"Karen",
""
],
[
"Vucurevich",
"Ted",
""
]
] |
new_dataset
| 0.999331 |
0710.4711
|
EDA Publishing Association
|
N. Huot (TIMA), H. Dubreuil (TIMA), L. Fesquet (TIMA), M. Renaudin
(TIMA)
|
FPGA Architecture for Multi-Style Asynchronous Logic
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
This paper presents a novel FPGA architecture for implementing various styles
of asynchronous logic. The main objective is to break the dependency between
the FPGA architecture dedicated to asynchronous logic and the logic style. The
innovative aspects of the architecture are described. Moreover the structure is
well suited to be rebuilt and adapted to fit with further asynchronous logic
evolutions thanks to the architecture genericity. A full-adder was implemented
in different styles of logic to show the architecture flexibility.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:32:43 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Huot",
"N.",
"",
"TIMA"
],
[
"Dubreuil",
"H.",
"",
"TIMA"
],
[
"Fesquet",
"L.",
"",
"TIMA"
],
[
"Renaudin",
"M.",
"",
"TIMA"
]
] |
new_dataset
| 0.997865 |
0710.4715
|
EDA Publishing Association
|
Jonathan R. Carter, Sule Ozev, Daniel J. Sorin
|
Circuit-Level Modeling for Concurrent Testing of Operational Defects due
to Gate Oxide Breakdown
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
As device sizes shrink and current densities increase, the probability of
device failures due to gate oxide breakdown (OBD) also increases. To provide
designs that are tolerant to such failures, we must investigate and understand
the manifestations of this physical phenomenon at the circuit and system level.
In this paper, we develop a model for operational OBD defects, and we explore
how to test for faults due to OBD. For a NAND gate, we derive the necessary
input conditions that excite and detect errors due to OBD defects at the gate
level. We show that traditional pattern generators fail to exercise all of
these defects. Finally, we show that these test patterns can be propagated and
justified for a combinational circuit in a manner similar to traditional ATPG.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:34:11 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Carter",
"Jonathan R.",
""
],
[
"Ozev",
"Sule",
""
],
[
"Sorin",
"Daniel J.",
""
]
] |
new_dataset
| 0.965705 |
0710.4720
|
EDA Publishing Association
|
Yuvraj Singh Dhillon, Abdulkadir Utku Diril, Abhijit Chatterjee
|
Soft-Error Tolerance Analysis and Optimization of Nanometer Circuits
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
Nanometer circuits are becoming increasingly susceptible to soft-errors due
to alpha-particle and atmospheric neutron strikes as device scaling reduces
node capacitances and supply/threshold voltage scaling reduces noise margins.
It is becoming crucial to add soft-error tolerance estimation and optimization
to the design flow to handle the increasing susceptibility. The first part of
this paper presents a tool for accurate soft-error tolerance analysis of
nanometer circuits (ASERTA) that can be used to estimate the soft-error
tolerance of nanometer circuits consisting of millions of gates. The tolerance
estimates generated by the tool match SPICE generated estimates closely while
taking orders of magnitude less computation time. The second part of the paper
presents a tool for soft-error tolerance optimization of nanometer circuits
(SERTOPT) using the tolerance estimates generated by ASERTA. The tool finds
optimal sizes, channel lengths, supply voltages and threshold voltages to be
assigned to gates in a combinational circuit such that the soft-error tolerance
is increased while meeting the timing constraint. Experiments on ISCAS'85
benchmark circuits showed that soft-error rate of the optimized circuit
decreased by as much as 47% with marginal increase in circuit delay.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:36:27 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Dhillon",
"Yuvraj Singh",
""
],
[
"Diril",
"Abdulkadir Utku",
""
],
[
"Chatterjee",
"Abhijit",
""
]
] |
new_dataset
| 0.980817 |
0710.4721
|
EDA Publishing Association
|
Pekka Syri, Juha Hakkinen, Markku Moilanen
|
IEEE 1149.4 Compatible ABMs for Basic RF Measurements
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
An analogue testing standard IEEE 1149.4 is mainly targeted for low-frequency
testing. The problem studied in this paper is extending the standard also for
radio frequency testing. IEEE 1149.4 compatible measurement structures (ABMs)
developed in this study extract the information one is measuring from the radio
frequency signal and represent the result as a DC voltage level. The ABMs
presented in this paper are targeted for power and frequency measurements
operating in frequencies from 1 GHz to 2 GHz. The power measurement error
caused by temperature, supply voltage and process variations is roughly 2 dB
and the frequency measurement error is 0.1 GHz, respectively.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:36:53 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Syri",
"Pekka",
""
],
[
"Hakkinen",
"Juha",
""
],
[
"Moilanen",
"Markku",
""
]
] |
new_dataset
| 0.990666 |
0710.4746
|
EDA Publishing Association
|
M. Abdelsalam Hassan, Keishi Sakanushi, Yoshinori Takeuchi, Masaharu
Imai
|
RTK-Spec TRON: A Simulation Model of an ITRON Based RTOS Kernel in
SystemC
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.OS
| null |
This paper presents the methodology and the modeling constructs we have
developed to capture the real time aspects of RTOS simulation models in a
System Level Design Language (SLDL) like SystemC. We describe these constructs
and show how they are used to build a simulation model of an RTOS kernel
targeting the $\mu$-ITRON OS specification standard.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:47:35 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Hassan",
"M. Abdelsalam",
""
],
[
"Sakanushi",
"Keishi",
""
],
[
"Takeuchi",
"Yoshinori",
""
],
[
"Imai",
"Masaharu",
""
]
] |
new_dataset
| 0.959301 |
0710.4761
|
EDA Publishing Association
|
D. C. Keezer, C. Gray, A. Majid, N. Taher
|
Low-Cost Multi-Gigahertz Test Systems Using CMOS FPGAs and PECL
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
This paper describes two research projects that develop new low-cost
techniques for testing devices with multiple high-speed (2 to 5 Gbps) signals.
Each project uses commercially available components to keep costs low, yet
achieves performance characteristics comparable to (and in some ways exceeding)
more expensive ATE. A common CMOS FPGA-based logic core provides flexibility,
adaptability, and communication with controlling computers while customized
positive emitter-coupled logic (PECL) achieves multi-gigahertz data rates with
about $\pm$25ps timing accuracy.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:55:04 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Keezer",
"D. C.",
""
],
[
"Gray",
"C.",
""
],
[
"Majid",
"A.",
""
],
[
"Taher",
"N.",
""
]
] |
new_dataset
| 0.997603 |
0710.4763
|
EDA Publishing Association
|
Matthias Beck, Olivier Barondeau, Martin Kaibel, Frank Poehl, Xijiang
Lin, Ron Press
|
Logic Design for On-Chip Test Clock Generation - Implementation Details
and Impact on Delay Test Quality
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
This paper addresses delay test for SOC devices with high frequency clock
domains. A logic design for on-chip high-speed clock generation, implemented to
avoid expensive test equipment, is described in detail. Techniques for on-chip
clock generation, meant to reduce test vector count and to increase test
quality, are discussed. ATPG results for the proposed techniques are given.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:55:27 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Beck",
"Matthias",
""
],
[
"Barondeau",
"Olivier",
""
],
[
"Kaibel",
"Martin",
""
],
[
"Poehl",
"Frank",
""
],
[
"Lin",
"Xijiang",
""
],
[
"Press",
"Ron",
""
]
] |
new_dataset
| 0.996117 |
0710.4764
|
EDA Publishing Association
|
G. M. Link, N. Vijaykrishnan
|
Hotspot Prevention Through Runtime Reconfiguration in Network-On-Chip
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005)
| null | null |
cs.AR
| null |
Many existing thermal management techniques focus on reducing the overall
power consumption of the chip, and do not address location-specific temperature
problems referred to as hotspots. We propose the use of dynamic runtime
reconfiguration to shift the hotspot-inducing computation periodically and make
the thermal profile more uniform. Our analysis shows that dynamic
reconfiguration is an effective technique in reducing hotspots for NoCs.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 09:55:48 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Link",
"G. M.",
""
],
[
"Vijaykrishnan",
"N.",
""
]
] |
new_dataset
| 0.98658 |
0710.4806
|
EDA Publishing Association
|
Kris Tiri, Ingrid Verbauwhede
|
A VLSI Design Flow for Secure Side-Channel Attack Resistant ICs
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe | Designers'Forum -
DATE'05, Munich : Allemagne (2005)
| null | null |
cs.AR
| null |
This paper presents a digital VLSI design flow to create secure, side-channel
attack (SCA) resistant integrated circuits. The design flow starts from a
normal design in a hardware description language such as VHDL or Verilog and
provides a direct path to a SCA resistant layout. Instead of a full custom
layout or an iterative design process with extensive simulations, a few key
modifications are incorporated in a regular synchronous CMOS standard cell
design flow. We discuss the basis for side-channel attack resistance and adjust
the library databases and constraints files of the synthesis and place & route
procedures accordingly. Experimental results show that a DPA attack on a
regular single ended CMOS standard cell implementation of a module of the DES
algorithm discloses the secret key after 200 measurements. The same attack on a
secure version still does not disclose the secret key after more than 2000
measurements.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 11:57:56 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Tiri",
"Kris",
""
],
[
"Verbauwhede",
"Ingrid",
""
]
] |
new_dataset
| 0.999472 |
0710.4809
|
EDA Publishing Association
|
Andres Takach, Bryan Bowyer, Thomas Bollaert
|
C Based Hardware Design for Wireless Applications
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe | Designers'Forum -
DATE'05, Munich : Allemagne (2005)
| null | null |
cs.AR
| null |
The algorithms used in wireless applications are increasingly more
sophisticated and consequently more challenging to implement in hardware.
Traditional design flows require developing the micro architecture, coding the
RTL, and verifying the generated RTL against the original functional C or
MATLAB specification. This paper describes a C-based design flow that is well
suited for the hardware implementation of DSP algorithms commonly found in
wireless applications. The C design flow relies on guided synthesis to generate
the RTL directly from the untimed C algorithm. The specifics of the C-based
design flow are described using a simple DSP filtering algorithm consisting of
a forward adaptive equalizer, a 64-QAM slicer and an adaptive decision feedback
equalizer. The example illustrates some of the capabilities and advantages
offered by this flow.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 11:59:48 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Takach",
"Andres",
""
],
[
"Bowyer",
"Bryan",
""
],
[
"Bollaert",
"Thomas",
""
]
] |
new_dataset
| 0.998905 |
0710.4815
|
EDA Publishing Association
|
Raul Blazquez, Fred Lee, David Wentzloff, Brian Ginsburg, Johnna
Powell, Anantha Chandrakasan
|
Direct Conversion Pulsed UWB Transceiver Architecture
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe | Designers'Forum -
DATE'05, Munich : Allemagne (2005)
| null | null |
cs.NI
| null |
Ultra-wideband (UWB) communication is an emerging wireless technology that
promises high data rates over short distances and precise locationing. The
large available bandwidth and the constraint of a maximum power spectral
density drives a unique set of system challenges. This paper addresses these
challenges using two UWB transceivers and a discrete prototype platform.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 12:01:54 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Blazquez",
"Raul",
""
],
[
"Lee",
"Fred",
""
],
[
"Wentzloff",
"David",
""
],
[
"Ginsburg",
"Brian",
""
],
[
"Powell",
"Johnna",
""
],
[
"Chandrakasan",
"Anantha",
""
]
] |
new_dataset
| 0.990502 |
0710.4824
|
EDA Publishing Association
|
R. Pradeep, S. Vinay, Sanjay Burman, V. Kamakoti
|
FPGA based Agile Algorithm-On-Demand Co-Processor
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe | Designers'Forum -
DATE'05, Munich : Allemagne (2005)
| null | null |
cs.AR
| null |
With growing computational needs of many real-world applications, frequently
changing specifications of standards, and the high design and NRE costs of
ASICs, an algorithm-agile FPGA based co-processor has become a viable
alternative. In this article, we report about the general design of an
algorith-agile co-processor and the proof-of-concept implementation.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 12:04:43 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Pradeep",
"R.",
""
],
[
"Vinay",
"S.",
""
],
[
"Burman",
"Sanjay",
""
],
[
"Kamakoti",
"V.",
""
]
] |
new_dataset
| 0.983698 |
0710.4835
|
EDA Publishing Association
|
K.-U. Kirstein, J. Sedivy, T. Salo, C. Hagleitner, T. Vancura, A.
Hierlemann
|
A CMOS-Based Tactile Sensor for Continuous Blood Pressure Monitoring
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe | Designers'Forum -
DATE'05, Munich : Allemagne (2005)
| null | null |
cs.OH
| null |
A monolithic integrated tactile sensor array is presented, which is used to
perform non-invasive blood pressure monitoring of a patient. The advantage of
this device compared to a hand cuff based approach is the capability of
recording continuous blood pressure data. The capacitive, membrane-based sensor
device is fabricated in an industrial CMOS-technology combined with post-CMOS
micromachining. The capacitance change is detected by a S?-modulator. The
modulator is operated at a sampling rate of 128kS/s and achieves a resolution
of 12bit with an external decimation filter and an OSR of 128.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 12:13:35 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Kirstein",
"K. -U.",
""
],
[
"Sedivy",
"J.",
""
],
[
"Salo",
"T.",
""
],
[
"Hagleitner",
"C.",
""
],
[
"Vancura",
"T.",
""
],
[
"Hierlemann",
"A.",
""
]
] |
new_dataset
| 0.999066 |
0710.4842
|
EDA Publishing Association
|
Dan Hillman
|
Using Mobilize Power Management IP for Dynamic & Static Power Reduction
in SoC at 130 nm
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe | Designers'Forum -
DATE'05, Munich : Allemagne (2005)
| null | null |
cs.AR
| null |
At 130 nm and 90 nm, power consumption (both dynamic and static) has become a
barrier in the roadmap for SoC designs targeting battery powered, mobile
applications. This paper presents the results of dynamic and static power
reduction achieved implementing Tensilica's 32-bit Xtensa microprocessor core,
using Virtual Silicon's Power Management IP. Independent voltage islands are
created using Virtual Silicon's VIP PowerSaver standard cells by using voltage
level shifting cells and voltage isolation cells to implement power islands.
The VIP PowerSaver standard cells are characterized at 1.2V, 1.0V and 0.8V, to
accommodate voltage scaling. Power islands can also be turned off completely.
Designers can significantly lower both the dynamic power and the quiescent or
leakage power of their SoC designs, with very little impact on speed or area
using Virtual Silicon's VIP Gate Bias standard cells.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 12:18:38 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Hillman",
"Dan",
""
]
] |
new_dataset
| 0.985772 |
0710.4851
|
EDA Publishing Association
|
Giuseppe Falconeri, Walid Naifer, Nizar Romdhane
|
Common Reusable Verification Environment for BCA and RTL Models
|
Submitted on behalf of EDAA (http://www.edaa.com/)
|
Dans Design, Automation and Test in Europe | Designers'Forum -
DATE'05, Munich : Allemagne (2005)
| null | null |
cs.LO
| null |
This paper deals with a common verification methodology and environment for
SystemC BCA and RTL models. The aim is to save effort by avoiding the same work
done twice by different people and to reuse the same environment for the two
design views. Applying this methodology the verification task starts as soon as
the functional specification is signed off and it runs in parallel to the
models and design development. The verification environment is modeled with the
aid of dedicated verification languages and it is applied to both the models.
The test suite is exactly the same and thus it's possible to verify the
alignment between the two models. In fact the final step is to check the
cycle-by-cycle match of the interface behavior. A regression tool and a bus
analyzer have been developed to help the verification and the alignment
process. The former is used to automate the testbench generation and to run the
two test suites. The latter is used to verify the alignment between the two
models comparing the waveforms obtained in each run. The quality metrics used
to validate the flow are full functional coverage and full alignment at each IP
port.
|
[
{
"version": "v1",
"created": "Thu, 25 Oct 2007 12:25:32 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Falconeri",
"Giuseppe",
""
],
[
"Naifer",
"Walid",
""
],
[
"Romdhane",
"Nizar",
""
]
] |
new_dataset
| 0.982841 |
1111.1842
|
Laurent George
|
Laurent George (INRIA - IRISA), Laurent Bonnet (INRIA - IRISA),
Anatole L\'ecuyer (INRIA - IRISA)
|
Freeze the BCI until the user is ready: a pilot study of a BCI inhibitor
|
5th International Brain-Computer Interface Workshop (2011)
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce the concept of Brain-Computer Interface (BCI)
inhibitor, which is meant to standby the BCI until the user is ready, in order
to improve the overall performance and usability of the system. BCI inhibitor
can be defined as a system that monitors user's state and inhibits BCI
interaction until specific requirements (e.g. brain activity pattern, user
attention level) are met. In this pilot study, a hybrid BCI is designed and
composed of a classic synchronous BCI system based on motor imagery and a BCI
inhibitor. The BCI inhibitor initiates the control period of the BCI when
requirements in terms of brain activity are reached (i.e. stability in the beta
band). Preliminary results with four participants suggest that BCI inhibitor
system can improve BCI performance.
|
[
{
"version": "v1",
"created": "Tue, 8 Nov 2011 09:47:39 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"George",
"Laurent",
"",
"INRIA - IRISA"
],
[
"Bonnet",
"Laurent",
"",
"INRIA - IRISA"
],
[
"Lécuyer",
"Anatole",
"",
"INRIA - IRISA"
]
] |
new_dataset
| 0.98918 |
1111.1854
|
Aphirak Jansang
|
Aphirak Jansang and Anan Phonphoem
|
Framework Architecture for WLAN Testbed
|
5 pages, 6 figures, 3rd Asian International Mobile Computing
Conference (AMOC 2004), May 26-28, 2004, Thailand pp. 96-100 ISBN:
974-537-487-3
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
There has been a tremendous effort in improving wireless LAN for supporting
the demanding multimedia application. Many new protocols or ideas have been
proposed and proved by using a mathematical model or running a simulation
program. That is satisfactory but these proposed designs might not work in the
real world situation. Testbed is an option to alleviate this gap and present
the opportunity to see the real problem and ensure that the design works. A
framework architecture for building a testbed to test a new concept or design
is presented in this paper. The framework is designed in the modularity style
in such a way that can be easily exchanged or modified. A testbed based on the
framework that implements the polling based mechanism has been created and the
results have shown that the QoS of the real time traffic can be maintained in
the presence of the high non-real time traffic.
|
[
{
"version": "v1",
"created": "Tue, 8 Nov 2011 10:22:23 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Jansang",
"Aphirak",
""
],
[
"Phonphoem",
"Anan",
""
]
] |
new_dataset
| 0.998578 |
1111.1930
|
Boudhir Anouar Abdelhakim
|
A. A. Boudhir, M. Bouhorma, M. Ben Ahmed and Elbrak Said
|
The UWB Solution for Multimedia Traffic in Wireless Sensor Networks
|
8 pages, 11 figures, IJWMN Journal
|
International Journal of Wireless & Mobile Networks October Issue
2011
|
10.5121/ijwmn
| null |
cs.NI cs.MM cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several researches are focused on the QoS (Quality of Service) and Energy
consumption in wireless Multimedia Sensor Networks. Those research projects
invest in theory and practice in order to extend the spectrum of use of norms,
standards and technologies which are emerged in wireless communications. The
performance of these technologies is strongly related to domains of use and
limitations of their characteristics. In this paper, we give a comparison of
ZigBee technology, most widely used in sensor networks, and UWB (Ultra Wide
Band) which presents itself as competitor that present in these work better
results for audiovisual applications with medium-range and high throughput.
|
[
{
"version": "v1",
"created": "Tue, 8 Nov 2011 15:03:26 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Boudhir",
"A. A.",
""
],
[
"Bouhorma",
"M.",
""
],
[
"Ahmed",
"M. Ben",
""
],
[
"Said",
"Elbrak",
""
]
] |
new_dataset
| 0.999286 |
cs/0407052
|
Reinhold Kainhofer
|
Reinhold Kainhofer and Reinhard V. Simonovits
|
M@th Desktop and MD Tools - Mathematics and Mathematica Made Easy for
Students
|
13 pages, 16 figures. Paper presented at the PrimMath[2003]
conference in Zagreb, Croatia, on September 26, 2003. Published in the
Proceedings of PrimMath[2003]
| null | null | null |
cs.MS
| null |
We present two add-ons for Mathematica for teaching mathematics to
undergraduate and high school students. These two applications, M@th Desktop
(MD) and M@th Desktop Tools (MDTools), include several palettes and notebooks
covering almost every field. The underlying didactic concept is so-called
"blended learning", in which these tools are meant to be used as a complement
to the professor or teacher rather than as a replacement, which other
e-learning applications do. They enable students to avoid the usual problem of
computer-based learning, namely that too large an amount of time is wasted
struggling with computer and program errors instead of actually learning the
mathematical concepts.
M@th Desktop Tools is palette-based and provides easily accessible and
user-friendly templates for the most important functions in the fields of
Analysis, Algebra, Linear Algebra and Statistics. M@th Desktop, in contrast, is
a modern, interactive teaching and learning software package for mathematics
classes. It is comprised of modules for Differentiation, Integration, and
Statistics, and each module presents its topic with a combination of
interactive notebooks and palettes.
Both packages can be obtained from Deltasoft's homepage at
http://www.deltasoft.at/ .
|
[
{
"version": "v1",
"created": "Tue, 20 Jul 2004 13:46:09 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Kainhofer",
"Reinhold",
""
],
[
"Simonovits",
"Reinhard V.",
""
]
] |
new_dataset
| 0.99681 |
cs/0511077
|
Frank McCown
|
Frank McCown, Sheffan Chan, Michael L. Nelson, Johan Bollen
|
The Availability and Persistence of Web References in D-Lib Magazine
|
11 pages, 7 figures, 3 tables
|
5th International Web Archiving Workshop (IWAW05), Vienna,
Austria, 2005
| null | null |
cs.DL
| null |
We explore the availability and persistence of URLs cited in articles
published in D-Lib Magazine. We extracted 4387 unique URLs referenced in 453
articles published from July 1995 to August 2004. The availability was checked
three times a week for 25 weeks from September 2004 to February 2005. We found
that approximately 28% of those URLs failed to resolve initially, and 30%
failed to resolve at the last check. A majority of the unresolved URLs were due
to 404 (page not found) and 500 (internal server error) errors. The content
pointed to by the URLs was relatively stable; only 16% of the content
registered more than a 1 KB change during the testing period. We explore
possible factors which may cause a URL to fail by examining its age, path
depth, top-level domain and file extension. Based on the data collected, we
found the half-life of a URL referenced in a D-Lib Magazine article is
approximately 10 years. We also found that URLs were more likely to be
unavailable if they pointed to resources in the .net, .edu or country-specific
top-level domain, used non-standard ports (i.e., not port 80), or pointed to
resources with uncommon or deprecated extensions (e.g., .shtml, .ps, .txt).
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2005 15:56:17 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"McCown",
"Frank",
""
],
[
"Chan",
"Sheffan",
""
],
[
"Nelson",
"Michael L.",
""
],
[
"Bollen",
"Johan",
""
]
] |
new_dataset
| 0.997357 |
cs/0604041
|
R.N.Mohan Professor
|
R.N.Mohan, Moon Ho Lee, and Subash Pokreal
|
On Orthogonality of Latin Squares
|
29 pages
| null | null | null |
cs.DM
| null |
An arrangement of s elements in s rows and s columns, such that no element
repeats more than once in each row and each column is called a Latin square of
order s. If two Latin squares of the same order superimposed one on the other
and in the resultant array if each ordered pair occurs once and only once then
they are called othogonal Latin Squares. A frequency square is an nxn matrix,
such that each element from the list of n elements, occurs t times in each row
and in each column. These two concepts lead to a new third concept called as t
orthogonal latin squares, where from a set of m orthogonal Latin squares, if t
orthogonal Latin squares are superimposed and each ordered t tuple in the
resultant array occurs once and only once then it is t othogonal Latin square.
In this paper it is proposed to construct such t othogonal latin squares
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2006 02:54:04 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Jun 2006 09:25:59 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Mohan",
"R. N.",
""
],
[
"Lee",
"Moon Ho",
""
],
[
"Pokreal",
"Subash",
""
]
] |
new_dataset
| 0.952292 |
cs/0604050
|
R.N.Mohan Professor
|
R.N.Mohan
|
On Hadamard Conjecture
| null | null | null | null |
cs.DM
| null |
In this note, while giving an overview of the state of art of the well known
Hadamard conjecture, which is more than a century old and now it has been
established by using the methods given in the two papers by Mohan et al [6,7].
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2006 01:34:56 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Mohan",
"R. N.",
""
]
] |
new_dataset
| 0.991194 |
cs/0701077
|
Karl Obermeyer
|
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
|
Asynchronous Distributed Searchlight Scheduling
|
Tech. report contains proofs corresponding to a paper to appear in
Conference on Decision and Control 2007. In this version, minor typos have
been fixed and some notation changed for clarity
| null | null | null |
cs.MA cs.RO
| null |
This paper develops and compares two simple asynchronous distributed
searchlight scheduling algorithms for multiple robotic agents in nonconvex
polygonal environments. A searchlight is a ray emitted by an agent which cannot
penetrate the boundary of the environment. A point is detected by a searchlight
if and only if the point is on the ray at some instant. Targets are points
which can move continuously with unbounded speed. The objective of the proposed
algorithms is for the agents to coordinate the slewing (rotation about a point)
of their searchlights in a distributed manner, i.e., using only local sensing
and limited communication, such that any target will necessarily be detected in
finite time. The first algorithm we develop, called the DOWSS (Distributed One
Way Sweep Strategy), is a distributed version of a known algorithm described
originally in 1990 by Sugihara et al \cite{KS-IS-MY:90}, but it can be very
slow in clearing the entire environment because only one searchlight may slew
at a time. In an effort to reduce the time to clear the environment, we develop
a second algorithm, called the PTSS (Parallel Tree Sweep Strategy), in which
searchlights sweep in parallel if guards are placed according to an environment
partition belonging to a class we call PTSS partitions. Finally, we discuss how
DOWSS and PTSS could be combined with with deployment, or extended to
environments with holes.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2007 20:55:17 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Jan 2007 19:18:22 GMT"
},
{
"version": "v3",
"created": "Fri, 10 Aug 2007 03:41:45 GMT"
}
] | 2011-11-09T00:00:00 |
[
[
"Obermeyer",
"Karl J.",
""
],
[
"Ganguli",
"Anurag",
""
],
[
"Bullo",
"Francesco",
""
]
] |
new_dataset
| 0.995317 |
1104.1905
|
Carsten Lemmen
|
Carsten Lemmen and Detlef Gronenborn and Kai W. Wirtz
|
A simulation of the Neolithic transition in Western Eurasia
|
Accepted Author Manuscript version accepted for publication in
Journal of Archaeological Science. A definitive version will be subsequently
published in the Journal of Archaological Science
|
Journal of Archaeological Science Vol 38 (12), pp. 3459-3470, 2011
|
10.1016/j.jas.2011.08.008
| null |
cs.MA q-bio.PE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Farming and herding were introduced to Europe from the Near East and
Anatolia; there are, however, considerable arguments about the mechanisms of
this transition. Were it people who moved and outplaced the indigenous hunter-
gatherer groups or admixed with them? Or was it just material and information
that moved-the Neolithic Package-consisting of domesticated plants and animals
and the knowledge of its use? The latter process is commonly referred to as
cultural diffusion and the former as demic diffusion. Despite continuous and
partly combined efforts by archaeologists, anthropologists, linguists,
paleontologists and geneticists a final resolution of the debate has not yet
been reached. In the present contribution we interpret results from the Global
Land Use and technological Evolution Simulator (GLUES), a mathematical model
for regional sociocultural development embedded in the western Eurasian
geoenvironmental context during the Holocene. We demonstrate that the model is
able to realistically hindcast the expansion speed and the inhomogeneous
space-time evolution of the transition to agropastoralism in Europe. GLUES, in
contrast to models that do not resolve endogenous sociocultural dynamics, also
describes and explains how and why the Neolithic advanced in stages. In the
model analysis, we uncouple the mechanisms of migration and information
exchange. We find that (1) an indigenous form of agropastoralism could well
have arisen in certain Mediterranean landscapes, but not in Northern and
Central Europe, where it depended on imported technology and material, (2) both
demic diffusion by migration or cultural diffusion by trade may explain the
western European transition equally well, (3) [...]
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2011 11:15:04 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Aug 2011 08:14:41 GMT"
}
] | 2011-11-08T00:00:00 |
[
[
"Lemmen",
"Carsten",
""
],
[
"Gronenborn",
"Detlef",
""
],
[
"Wirtz",
"Kai W.",
""
]
] |
new_dataset
| 0.997915 |
1107.2221
|
Fedor Fomin
|
Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh
|
Bidimensionality and Geometric Graphs
| null | null | null | null |
cs.DS cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we use several of the key ideas from Bidimensionality to give a
new generic approach to design EPTASs and subexponential time parameterized
algorithms for problems on classes of graphs which are not minor closed, but
instead exhibit a geometric structure. In particular we present EPTASs and
subexponential time parameterized algorithms for Feedback Vertex Set, Vertex
Cover, Connected Vertex Cover, Diamond Hitting Set, on map graphs and unit disk
graphs, and for Cycle Packing and Minimum-Vertex Feedback Edge Set on unit disk
graphs. Our results are based on the recent decomposition theorems proved by
Fomin et al [SODA 2011], and our algorithms work directly on the input graph.
Thus it is not necessary to compute the geometric representations of the input
graph. To the best of our knowledge, these results are previously unknown, with
the exception of the EPTAS and a subexponential time parameterized algorithm on
unit disk graphs for Vertex Cover, which were obtained by Marx [ESA 2005] and
Alber and Fiala [J. Algorithms 2004], respectively.
We proceed to show that our approach can not be extended in its full
generality to more general classes of geometric graphs, such as intersection
graphs of unit balls in R^d, d >= 3. Specifically we prove that Feedback Vertex
Set on unit-ball graphs in R^3 neither admits PTASs unless P=NP, nor
subexponential time algorithms unless the Exponential Time Hypothesis fails.
Additionally, we show that the decomposition theorems which our approach is
based on fail for disk graphs and that therefore any extension of our results
to disk graphs would require new algorithmic ideas. On the other hand, we prove
that our EPTASs and subexponential time algorithms for Vertex Cover and
Connected Vertex Cover carry over both to disk graphs and to unit-ball graphs
in R^d for every fixed d.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2011 09:16:54 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Nov 2011 18:03:50 GMT"
}
] | 2011-11-08T00:00:00 |
[
[
"Fomin",
"Fedor V.",
""
],
[
"Lokshtanov",
"Daniel",
""
],
[
"Saurabh",
"Saket",
""
]
] |
new_dataset
| 0.996645 |
1110.1716
|
Luis Quesada
|
Luis Quesada and Fernando Berzal and Francisco J. Cortijo
|
Treating Insomnia, Amnesia, and Acalculia in Regular Expression Matching
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Regular expressions provide a flexible means for matching strings and they
are often used in data-intensive applications. They are formally equivalent to
either deterministic finite automata (DFAs) or nondeterministic finite automata
(NFAs). Both DFAs and NFAs are affected by two problems known as amnesia and
acalculia, and DFAs are also affected by a problem known as insomnia. Existing
techniques require an automata conversion and compaction step that prevents the
use of existing automaton databases and hinders the maintenance of the
resulting compact automata. In this paper, we propose Parallel Finite State
Machines (PFSMs), which are able to run any DFA- or NFA-like state machines
without a previous conversion or compaction step. PFSMs report, online, all the
matches found within an input string and they solve the three aforementioned
problems. Parallel Finite State Machines require quadratic time and linear
memory and they are distributable. Parallel Finite State Machines make very
fast distributed regular expression matching in data-intensive applications
feasible.
|
[
{
"version": "v1",
"created": "Sat, 8 Oct 2011 09:43:59 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Nov 2011 20:12:04 GMT"
}
] | 2011-11-08T00:00:00 |
[
[
"Quesada",
"Luis",
""
],
[
"Berzal",
"Fernando",
""
],
[
"Cortijo",
"Francisco J.",
""
]
] |
new_dataset
| 0.961777 |
1111.1598
|
Ashwin Tumma Mr
|
Jagannath Aghav and Ashwin Tumma
|
Design and Validation of Safety Cruise Control System for Automobiles
| null | null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
In light of the recent humongous growth of the human population worldwide,
there has also been a voluminous and uncontrolled growth of vehicles, which has
consequently increased the number of road accidents to a large extent. In lieu
of a solution to the above mentioned issue, our system is an attempt to
mitigate the same using synchronous programming language. The aim is to develop
a safety crash warning system that will address the rear end crashes and also
take over the controlling of the vehicle when the threat is at a very high
level. Adapting according to the environmental conditions is also a prominent
feature of the system. Safety System provides warnings to drivers to assist in
avoiding rear-end crashes with other vehicles. Initially the system provides a
low level alarm and as the severity of the threat increases the level of
warnings or alerts also rises. At the highest level of threat, the system
enters in a Cruise Control Mode, wherein the system controls the speed of the
vehicle by controlling the engine throttle and if permitted, the brake system
of the vehicle. We focus on this crash area as it has a very high percentage of
the crash-related fatalities. To prove the feasibility, robustness and
reliability of the system, we have also proved some of the properties of the
system using temporal logic along with a reference implementation in ESTEREL.
To bolster the same, we have formally verified various properties of the system
along with their proofs.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2011 14:45:06 GMT"
}
] | 2011-11-08T00:00:00 |
[
[
"Aghav",
"Jagannath",
""
],
[
"Tumma",
"Ashwin",
""
]
] |
new_dataset
| 0.994849 |
1111.1644
|
Philippe Gaborit
|
Carlos Aguilar, Philippe Gaborit, Julien Schrek
|
A new zero-knowledge code based identification scheme with reduced
communication
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a new 5-pass identification scheme with asymptotic
cheating probability 1/2 based on the syndrome decoding problem. Our protocol
is related to the Stern identification scheme but has a reduced communication
cost compared to previous code-based zero-knowledge schemes, moreover our
scheme permits to obtain a very low size of public key and secret key. The
contribution of this paper is twofold, first we propose a variation on the
Stern authentication scheme which permits to decrease asymptotically the
cheating probability to 1/2 rather than 2/3 (and very close to 1/2 in practice)
but with less communication. Our solution is based on deriving new challenges
from the secret key through cyclic shifts of the initial public key syndrome; a
new proof of soundness for this case is given Secondly we propose a new way to
deal with hashed commitments in zero-knowledge schemes based on Stern's scheme,
so that in terms of communication, on the average, only one hash value is sent
rather than two or three. Overall our new scheme has the good features of
having a zero-knowledge security proof based on well known hard problem of
coding theory, a small size of secret and public key (a few hundred bits), a
small calculation complexity, for an overall communication cost of 19kb for
authentication (for a $2^{16}$ security) and a signature of size of 93kb
(11.5kB) (for security $2^{80}$), an improvement of 40% compared to previous
schemes based on coding theory.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2011 17:02:04 GMT"
}
] | 2011-11-08T00:00:00 |
[
[
"Aguilar",
"Carlos",
""
],
[
"Gaborit",
"Philippe",
""
],
[
"Schrek",
"Julien",
""
]
] |
new_dataset
| 0.995739 |
1110.6200
|
Jacob Eisenstein
|
Jacob Eisenstein, Duen Horng "Polo" Chau, Aniket Kittur, Eric P. Xing
|
TopicViz: Semantic Navigation of Document Collections
| null | null | null | null |
cs.HC cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When people explore and manage information, they think in terms of topics and
themes. However, the software that supports information exploration sees text
at only the surface level. In this paper we show how topic modeling -- a
technique for identifying latent themes across large collections of documents
-- can support semantic exploration. We present TopicViz, an interactive
environment for information exploration. TopicViz combines traditional search
and citation-graph functionality with a range of novel interactive
visualizations, centered around a force-directed layout that links documents to
the latent themes discovered by the topic model. We describe several use
scenarios in which TopicViz supports rapid sensemaking on large document
collections.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2011 21:37:24 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Nov 2011 03:47:30 GMT"
}
] | 2011-11-07T00:00:00 |
[
[
"Eisenstein",
"Jacob",
""
],
[
"Chau",
"Duen Horng \"Polo\"",
""
],
[
"Kittur",
"Aniket",
""
],
[
"Xing",
"Eric P.",
""
]
] |
new_dataset
| 0.993509 |
1111.0705
|
Chuan Zhang
|
Chuan Zhang, Bo Yuan, and Keshab K. Parhi
|
Low-Latency SC Decoder Architectures for Polar Codes
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays polar codes are becoming one of the most favorable capacity
achieving error correction codes for their low encoding and decoding
complexity. However, due to the large code length required by practical
applications, the few existing successive cancellation (SC) decoder
implementations still suffer from not only the high hardware cost but also the
long decoding latency. This paper presents novel several approaches to design
low-latency decoders for polar codes based on look-ahead techniques. Look-ahead
techniques can be employed to reschedule the decoding process of polar decoder
in numerous approaches. However, among those approaches, only well-arranged
ones can achieve good performance in terms of both latency and hardware
complexity. By revealing the recurrence property of SC decoding chart, the
authors succeed in reducing the decoding latency by 50% with look-ahead
techniques. With the help of VLSI-DSP design techniques such as pipelining,
folding, unfolding, and parallel processing, methodologies for four different
polar decoder architectures have been proposed to meet various application
demands. Sub-structure sharing scheme has been adopted to design the merged
processing element (PE) for further hardware reduction. In addition, systematic
methods for construction refined pipelining decoder (2nd design) and the input
generating circuits (ICG) block have been given. Detailed gate-level analysis
has demonstrated that the proposed designs show latency advantages over
conventional ones with similar hardware cost.
|
[
{
"version": "v1",
"created": "Thu, 3 Nov 2011 01:15:58 GMT"
}
] | 2011-11-04T00:00:00 |
[
[
"Zhang",
"Chuan",
""
],
[
"Yuan",
"Bo",
""
],
[
"Parhi",
"Keshab K.",
""
]
] |
new_dataset
| 0.951639 |
1111.0855
|
Ichrak Amdouni
|
Ichrak Amdouni (INRIA Rocquencourt), Minet Pascale (INRIA
Rocquencourt), C\'edric Adjih (INRIA Rocquencourt)
|
OSERENA, an Optimized Coloring Algorithm for Dense or Large Scale
Wireless Networks
|
No. RR-7785 (2011)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this research report is to present OSERENA "Optimized SchEduling
RoutEr Node Activity", a distributed coloring algorithm optimized for dense
wireless networks. Network density has an extremely reduced impact on the size
of the messages exchanged to color the network. Furthermore, the number of
colors used to color the network is not impacted by this optimization. We
describe in this research report the properties of the algorithm and prove its
correctness and termination. Simulation results point out the considerable
gains in bandwidth.
|
[
{
"version": "v1",
"created": "Thu, 3 Nov 2011 14:39:36 GMT"
}
] | 2011-11-04T00:00:00 |
[
[
"Amdouni",
"Ichrak",
"",
"INRIA Rocquencourt"
],
[
"Pascale",
"Minet",
"",
"INRIA\n Rocquencourt"
],
[
"Adjih",
"Cédric",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.998997 |
1110.4573
|
Francis Lazarus
|
Francis Lazarus and Julien Rivaud
|
On the homotopy test on surfaces
|
33 pages, 11 figures
| null | null | null |
cs.CG cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let G be a graph cellularly embedded in a surface S. Given two closed walks c
and d in G, we take advantage of the RAM model to describe linear time
algorithms to decide if c and d are homotopic in S, either freely or with fixed
basepoint. We restrict S to be orientable for the free homotopy test, but allow
non-orientable surfaces when the basepoint is fixed. After O(|G|) time
preprocessing independent of c and d, our algorithms answer the homotopy test
in O(|c|+|d|) time, where |G|, |c| and |d| are the respective numbers of edges
of G, c and d. As a byproduct we obtain linear time algorithms for the word
problem and the conjugacy problem in surface groups. We present a geometric
approach based on previous works by Colin de Verdi\`ere and Erickson.
|
[
{
"version": "v1",
"created": "Thu, 20 Oct 2011 16:30:22 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Nov 2011 09:22:42 GMT"
}
] | 2011-11-03T00:00:00 |
[
[
"Lazarus",
"Francis",
""
],
[
"Rivaud",
"Julien",
""
]
] |
new_dataset
| 0.998058 |
1111.0372
|
EPTCS
|
Temesghen Kahsai (The University of Iowa), Cesare Tinelli (The
University of Iowa)
|
PKind: A parallel k-induction based model checker
|
In Proceedings PDMC 2011, arXiv:1111.0064
|
EPTCS 72, 2011, pp. 55-62
|
10.4204/EPTCS.72.6
| null |
cs.LO cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PKind is a novel parallel k-induction-based model checker of invariant
properties for finite- or infinite-state Lustre programs. Its architecture,
which is strictly message-based, is designed to minimize synchronization delays
and easily accommodate the incorporation of incremental invariant generators to
enhance basic k-induction. We describe PKind's functionality and main features,
and present experimental evidence that PKind significantly speeds up the
verification of safety properties and, due to incremental invariant generation,
also considerably increases the number of provable ones.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2011 03:04:34 GMT"
}
] | 2011-11-03T00:00:00 |
[
[
"Kahsai",
"Temesghen",
"",
"The University of Iowa"
],
[
"Tinelli",
"Cesare",
"",
"The\n University of Iowa"
]
] |
new_dataset
| 0.987859 |
1111.0373
|
EPTCS
|
Nikola Bene\v{s} (FI MU), Ivana \v{C}ern\'a (FI MU), Milan
K\v{r}iv\'anek
|
CoInDiVinE: Parallel Distributed Model Checker for Component-Based
Systems
|
In Proceedings PDMC 2011, arXiv:1111.0064
|
EPTCS 72, 2011, pp. 63-67
|
10.4204/EPTCS.72.7
| null |
cs.SE cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CoInDiVinE is a tool for parallel distributed model checking of interactions
among components in hierarchical component-based systems. The tool extends the
DiVinE framework with a new input language (component-interaction automata) and
a property specification logic (CI-LTL). As the language differs from the input
language of DiVinE, our tool employs a new state space generation algorithm
that also supports partial order reduction. Experiments indicate that the tool
has good scaling properties when run in parallel setting.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2011 03:04:40 GMT"
}
] | 2011-11-03T00:00:00 |
[
[
"Beneš",
"Nikola",
"",
"FI MU"
],
[
"Černá",
"Ivana",
"",
"FI MU"
],
[
"Křivánek",
"Milan",
""
]
] |
new_dataset
| 0.997009 |
1111.0374
|
EPTCS
|
Stefan Vijzelaar (VU University Amsterdam), Kees Verstoep (VU
University Amsterdam), Wan Fokkink (VU University Amsterdam), Henri Bal (VU
University Amsterdam)
|
Distributed MAP in the SpinJa Model Checker
|
In Proceedings PDMC 2011, arXiv:1111.0064
|
EPTCS 72, 2011, pp. 84-90
|
10.4204/EPTCS.72.9
| null |
cs.SE cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spin in Java (SpinJa) is an explicit state model checker for the Promela
modelling language also used by the SPIN model checker. Designed to be
extensible and reusable, the implementation of SpinJa follows a layered
approach in which each new layer extends the functionality of the previous one.
While SpinJa has preliminary support for shared-memory model checking, it did
not yet support distributed-memory model checking. This tool paper presents a
distributed implementation of a maximal accepting predecessors (MAP) search
algorithm on top of SpinJa.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2011 03:04:55 GMT"
}
] | 2011-11-03T00:00:00 |
[
[
"Vijzelaar",
"Stefan",
"",
"VU University Amsterdam"
],
[
"Verstoep",
"Kees",
"",
"VU\n University Amsterdam"
],
[
"Fokkink",
"Wan",
"",
"VU University Amsterdam"
],
[
"Bal",
"Henri",
"",
"VU\n University Amsterdam"
]
] |
new_dataset
| 0.992706 |
1111.0385
|
Jaydip Sen
|
Jaydip Sen, M. Girish Chandra, P. Balamuralidhar, Harihara S. G.,
Harish Reddy
|
A Distributed Protocol for Detection of Packet Dropping Attack in Mobile
Ad Hoc Networks
|
7 pages, 9 figures, 1 table. In Proceedings of the International
Conference on Telecommunications and Malaysian International Conference on
Communications (ICT-MICC'07), May 14-17, Penang, Malaysia. Paper ID: 74,
Track: 3: Ad Hoc Routing and Protocols. ISBN: 1-4244-1094-0
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In multi-hop mobile ad hoc networks (MANETs),mobile nodes cooperate with each
other without using any infrastructure such as access points or base stations.
Security remains a major challenge for these networks due to their features of
open medium, dynamically changing topologies, reliance on cooperative
algorithms, absence of centralized monitoring points, and lack of clear lines
of defense. Among the various attacks to which MANETs are vulnerable, malicious
packet dropping attack is very common where a malicious node can partially
degrade or completely disrupt communication in the network by consistently
dropping packets. In this paper, a mechanism for detection of packet dropping
attack is presented based on cooperative participation of the nodes in a MANET.
The redundancy of routing information in an ad hoc network is utilized to make
the scheme robust so that it works effectively even in presence of transient
network partitioning and Byzantine failure of nodes. The proposed scheme is
fully cooperative and thus more secure as the vulnerabilities of any election
algorithm used for choosing a subset of nodes for cooperation are absent.
Simulation results show the effectiveness of the protocol.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2011 04:45:53 GMT"
}
] | 2011-11-03T00:00:00 |
[
[
"Sen",
"Jaydip",
""
],
[
"Chandra",
"M. Girish",
""
],
[
"Balamuralidhar",
"P.",
""
],
[
"G.",
"Harihara S.",
""
],
[
"Reddy",
"Harish",
""
]
] |
new_dataset
| 0.997187 |
1111.0088
|
EPTCS
|
Ranald Clouston
|
Nominal Logic with Equations Only
|
In Proceedings LFMTP 2011, arXiv:1110.6685
|
EPTCS 71, 2011, pp. 44-57
|
10.4204/EPTCS.71.4
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many formal systems, particularly in computer science, may be captured by
equations modulated by side conditions asserting the "freshness of names";
these can be reasoned about with Nominal Equational Logic (NEL). Like most
logics of this sort NEL employs this notion of freshness as a first class
logical connective. However, this can become inconvenient when attempting to
translate results from standard equational logic to the nominal setting. This
paper presents proof rules for a logic whose only connectives are equations,
which we call Nominal Equation-only Logic (NEoL). We prove that NEoL is just as
expressive as NEL. We then give a simple description of equality in the empty
NEoL-theory, then extend that result to describe freshness in the empty
NEL-theory.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2011 00:18:17 GMT"
}
] | 2011-11-02T00:00:00 |
[
[
"Clouston",
"Ranald",
""
]
] |
new_dataset
| 0.99905 |
1109.2641
|
Christian Sommer
|
Christian Sommer
|
More Compact Oracles for Approximate Distances in Planar Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distance oracles are data structures that provide fast (possibly approximate)
answers to shortest-path and distance queries in graphs. The tradeoff between
the space requirements and the query time of distance oracles is of particular
interest and the main focus of this paper.
In FOCS'01, Thorup introduced approximate distance oracles for planar graphs.
He proved that, for any eps>0 and for any planar graph on n nodes, there exists
a (1+eps)-approximate distance oracle using space O(n eps^{-1} log n) such that
approximate distance queries can be answered in time O(1/eps).
Ten years later, we give the first improvements on the space-querytime
tradeoff for planar graphs.
* We give the first oracle having a space-time product with subquadratic
dependency on 1/eps. For space ~O(n log n) we obtain query time ~O(1/eps)
(assuming polynomial edge weights). The space shows a doubly logarithmic
dependency on 1/eps only. We believe that the dependency on eps may be almost
optimal.
* For the case of moderate edge weights (average bounded by polylog(n), which
appears to be the case for many real-world road networks), we hit a "sweet
spot," improving upon Thorup's oracle both in terms of eps and n. Our oracle
uses space ~O(n log log n) and it has query time ~O(log log log n + 1/eps).
(Asymptotic notation in this abstract hides low-degree polynomials in
log(1/eps) and log*(n).)
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2011 22:17:33 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Oct 2011 22:38:46 GMT"
}
] | 2011-11-01T00:00:00 |
[
[
"Sommer",
"Christian",
""
]
] |
new_dataset
| 0.976035 |
1109.5779
|
Chinmay Vaze
|
Chinmay S. Vaze and Mahesh K. Varanasi
|
The Degrees of Freedom Region of the MIMO Interference Channel with
Shannon Feedback
|
30 pages, 3 tables, 9 figures. This paper was submitted to the IEEE
Trans. Inform. Th. Oct. 2011. It was presented in part at the 49th Annual
Allerton Conference on Communications, Control and Computing in Sept. 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The two-user multiple-input multiple-output (MIMO) fast-fading interference
channel (IC) with an arbitrary number of antennas at each of the four terminals
is studied under the settings of Shannon feedback, limited Shannon feedback,
and output feedback, wherein all or certain channel matrices and outputs, or
just the channel outputs, respectively, are available to the transmitters with
a finite delay. While for most numbers of antennas at the four terminals, it is
shown that the DoF regions with Shannon feedback and for the limited Shannon
feedback settings considered here are identical, and equal to the DoF region
with just delayed channel state information (CSIT), it is shown that this is
not always the case. For a specific class of MIMO ICs characterized by a
certain relationship between the numbers of antennas at the four nodes, the DoF
regions with Shannon and the limited Shannon feedback settings, while again
being identical, are strictly bigger than the DoF region with just delayed
CSIT. To realize these DoF gains with Shannon or limited Shannon feedback, a
new retrospective interference alignment scheme is developed wherein
transmitter cooperation made possible by output feedback in addition to delayed
CSIT is employed to effect a more efficient form of interference alignment than
is feasible with previously known schemes that use just delayed CSIT. The DoF
region for just output feedback, in which each transmitter has delayed
knowledge of only the receivers' outputs, is also obtained for all but a class
of MIMO ICs that satisfy one of two inequalities involving the numbers of
antennas.
|
[
{
"version": "v1",
"created": "Tue, 27 Sep 2011 05:58:27 GMT"
},
{
"version": "v2",
"created": "Mon, 31 Oct 2011 18:43:54 GMT"
}
] | 2011-11-01T00:00:00 |
[
[
"Vaze",
"Chinmay S.",
""
],
[
"Varanasi",
"Mahesh K.",
""
]
] |
new_dataset
| 0.986352 |
1110.6590
|
Amir Shpilka
|
Amir Shpilka
|
New constructions of WOM codes using the Wozencraft ensemble
|
19 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we give several new constructions of WOM codes. The novelty in
our constructions is the use of the so called Wozencraft ensemble of linear
codes. Specifically, we obtain the following results.
We give an explicit construction of a two-write Write-Once-Memory (WOM for
short) code that approaches capacity, over the binary alphabet. More formally,
for every \epsilon>0, 0<p<1 and n =(1/\epsilon)^{O(1/p\epsilon)} we give a
construction of a two-write WOM code of length n and capacity
H(p)+1-p-\epsilon. Since the capacity of a two-write WOM code is max_p
(H(p)+1-p), we get a code that is \epsilon-close to capacity. Furthermore,
encoding and decoding can be done in time O(n^2.poly(log n)) and time
O(n.poly(log n)), respectively, and in logarithmic space.
We obtain a new encoding scheme for 3-write WOM codes over the binary
alphabet. Our scheme achieves rate 1.809-\epsilon, when the block length is
exp(1/\epsilon). This gives a better rate than what could be achieved using
previous techniques.
We highlight a connection to linear seeded extractors for bit-fixing sources.
In particular we show that obtaining such an extractor with seed length O(log
n) can lead to improved parameters for 2-write WOM codes. We then give an
application of existing constructions of extractors to the problem of designing
encoding schemes for memory with defects.
|
[
{
"version": "v1",
"created": "Sun, 30 Oct 2011 09:40:26 GMT"
}
] | 2011-11-01T00:00:00 |
[
[
"Shpilka",
"Amir",
""
]
] |
new_dataset
| 0.98348 |
1110.6010
|
Rafayel Kamalian
|
Rafayel Kamalian, Arpine Khachatryan
|
On a property of the $n$-dimensional cube
|
2 pages, no figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that in any subset of the vertices of $n$-dimensional cube that
contains at least $2^{n-1}+1$ vertices ($n\geq 4$), there are four vertices
that induce a claw, or there are eight vertices that induce the cycle of length
eight.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2011 08:31:27 GMT"
}
] | 2011-10-28T00:00:00 |
[
[
"Kamalian",
"Rafayel",
""
],
[
"Khachatryan",
"Arpine",
""
]
] |
new_dataset
| 0.999005 |
1110.6143
|
Louis D'Alotto
|
Louis D'Alotto
|
Cellular Automata Using Infinite Computations
|
Paper Accepted for Publication in Applied Mathematics and
Computation, Elsevier
| null | null | null |
cs.DM math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an application of the Infinite Unit Axiom, introduced by
Yaroslav Sergeyev, (see [11] - [14]) to the development of one-dimensional
cellular automata. This application allows the establishment of a new and more
precise metric on the space of definition for one-dimensional cellular
automata, whereby accuracy of computations is increased. Using this new metric,
open disks are defined and the number of points in each disk is computed. The
forward dynamics of a cellular automaton map are also studied via defined
equivalence classes. Using the Infinite Unit Axiom, the number of
configurations that stay close to a given configuration under the shift
automaton map can now be computed.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2011 17:37:32 GMT"
}
] | 2011-10-28T00:00:00 |
[
[
"D'Alotto",
"Louis",
""
]
] |
new_dataset
| 0.970449 |
1107.4057
|
Nick Mehrdad Loghmani
|
Nick Mehrdad Loghmani
|
The Harmonic Theory; A mathematical framework to build intelligent
contextual and adaptive computing, cognition and sensory system
|
16 pages, 8 figures
| null | null | null |
cs.AI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Harmonic theory provides a mathematical framework to describe the structure,
behavior, evolution and emergence of harmonic systems. A harmonic system is
context aware, contains elements that manifest characteristics either
collaboratively or independently according to system's expression and can
interact with its environment. This theory provides a fresh way to analyze
emergence and collaboration of "ad-hoc" and complex systems.
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2011 18:25:55 GMT"
}
] | 2011-10-27T00:00:00 |
[
[
"Loghmani",
"Nick Mehrdad",
""
]
] |
new_dataset
| 0.997118 |
1110.5762
|
Serge Kernbach
|
Serge Kernbach
|
Swarmrobot.org - Open-hardware Microrobotic Project for Large-scale
Artificial Swarms
| null | null | null | null |
cs.RO cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The purpose of this paper is to give an overview of the open-hardware
microrobotic project swarmrobot.org and the platform Jasmine for building
large-scale artificial swarms. The project targets an open development of
cost-effective hardware and software for a quick implementation of swarm
behavior with real robots. Detailed instructions for making the robot,
open-source simulator, software libraries and multiple publications about
performed experiments are ready for download and intend to facilitate
exploration of collective and emergent phenomena, guided self-organization and
swarm robotics in experimental way.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2011 10:37:09 GMT"
}
] | 2011-10-27T00:00:00 |
[
[
"Kernbach",
"Serge",
""
]
] |
new_dataset
| 0.998891 |
1110.5832
|
Ringo Baumann
|
Ringo Baumann and Heinrich Herre
|
The Axiomatic Foundation of Space in GFO
|
36 pages, 18 figures, submitted to "Applied Ontology"
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Space and time are basic categories of any top-level ontology. They are
fundamental assumptions for the mode of existence of those individuals which
are said to be in space and time. In the present paper the ontology of space in
the General Formal Ontology (GFO) is expounded. This ontology is represented as
a theory BT (Brentano Theory), which is specified by a set of axioms formalized
in first-order logic. This theory uses four primitive relations: SReg(x) (x is
space region), spart(x, y) (x is spatial part of y), sb(x, y) (x is spatial
boundary of y), and scoinc(x, y) (x and y spatially coincide). This ontology is
inspired by ideas of Franz Brentano. The investigation and exploration of Franz
Brentano's ideas on space and time began about twenty years ago by work of R.M.
Chisholm, B. Smith and A. Varzi. The present paper takes up this line of
research and makes a further step in establishing an ontology of space which is
based on rigorous logical methods and on principles of the new philosophical
approach of integrative realism.
|
[
{
"version": "v1",
"created": "Fri, 23 Sep 2011 07:22:16 GMT"
}
] | 2011-10-27T00:00:00 |
[
[
"Baumann",
"Ringo",
""
],
[
"Herre",
"Heinrich",
""
]
] |
new_dataset
| 0.961643 |
1110.5867
|
Nachum Dershowitz
|
Nachum Dershowitz and Alexander Nadel
|
From Total Assignment Enumeration to Modern SAT Solver
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new framework for presenting and analyzing the functionality of a modern
DLL-based SAT solver is proposed. Our approach exploits the inherent relation
between backtracking and resolution. We show how to derive the algorithm of a
modern SAT solver from DLL step-by-step. We analyze the inference power of
Boolean Constraint Propagation, Non-Chronological Backtracking and 1UIP-based
Conflict-Directed Backjumping. Our work can serve as an introduction to a
modern SAT solver functionality and as a basis for future work on the inference
power of a modern SAT solver and on practical SAT solver design.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2011 18:23:56 GMT"
}
] | 2011-10-27T00:00:00 |
[
[
"Dershowitz",
"Nachum",
""
],
[
"Nadel",
"Alexander",
""
]
] |
new_dataset
| 0.989379 |
1009.5037
|
Ashwinkumar B. V.
|
B.V. Ashwinkumar
|
Buyback Problem - Approximate matroid intersection with cancellation
costs
| null |
ICALP'11 Lecture Notes in Computer Science, 2011, Volume
6755/2011, 379-390
|
10.1007/978-3-642-22006-7_32
| null |
cs.GT cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the buyback problem, an algorithm observes a sequence of bids and must
decide whether to accept each bid at the moment it arrives, subject to some
constraints on the set of accepted bids. Decisions to reject bids are
irrevocable, whereas decisions to accept bids may be canceled at a cost that is
a fixed fraction of the bid value. Previous to our work, deterministic and
randomized algorithms were known when the constraint is a matroid constraint.
We extend this and give a deterministic algorithm for the case when the
constraint is an intersection of $k$ matroid constraints. We further prove a
matching lower bound on the competitive ratio for this problem and extend our
results to arbitrary downward closed set systems. This problem has applications
to banner advertisement, semi-streaming, routing, load balancing and other
problems where preemption or cancellation of previous allocations is allowed.
|
[
{
"version": "v1",
"created": "Sat, 25 Sep 2010 22:05:09 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Sep 2010 05:59:45 GMT"
}
] | 2011-10-26T00:00:00 |
[
[
"Ashwinkumar",
"B. V.",
""
]
] |
new_dataset
| 0.999543 |
1106.2886
|
Lawrence Ong
|
Lawrence Ong, Roy Timo, Gottfried Lechner, Sarah J. Johnson, and
Christopher M. Kellett
|
The Finite Field Multi-Way Relay Channel with Correlated Sources: The
Three-User Case
|
to be presented at ISIT 2011
|
Proceedings of the 2011 IEEE International Symposium on
Information Theory (ISIT 2011), Saint Petersburg, Russia, pp. 2238-2242, July
31-Aug. 5, 2011
|
10.1109/ISIT.2011.6033958
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The three-user finite field multi-way relay channel with correlated sources
is considered. The three users generate possibly correlated messages, and each
user is to transmit its message to the two other users reliably in the Shannon
sense. As there is no direct link among the users, communication is carried out
via a relay, and the link from the users to the relay and those from the relay
to the users are finite field adder channels with additive noise of arbitrary
distribution. The problem is to determine the set of all possible achievable
rates, defined as channel uses per source symbol for reliable communication.
For two classes of source/channel combinations, the solution is obtained using
Slepian-Wolf source coding combined with functional-decode-forward channel
coding.
|
[
{
"version": "v1",
"created": "Wed, 15 Jun 2011 06:32:28 GMT"
}
] | 2011-10-26T00:00:00 |
[
[
"Ong",
"Lawrence",
""
],
[
"Timo",
"Roy",
""
],
[
"Lechner",
"Gottfried",
""
],
[
"Johnson",
"Sarah J.",
""
],
[
"Kellett",
"Christopher M.",
""
]
] |
new_dataset
| 0.993348 |
1110.5015
|
Alex Bronstein
|
Alexander M. Bronstein
|
Spectral descriptors for deformable shapes
|
Preprint
| null | null | null |
cs.CV cs.CG cs.GR math.DG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Informative and discriminative feature descriptors play a fundamental role in
deformable shape analysis. For example, they have been successfully employed in
correspondence, registration, and retrieval tasks. In the recent years,
significant attention has been devoted to descriptors obtained from the
spectral decomposition of the Laplace-Beltrami operator associated with the
shape. Notable examples in this family are the heat kernel signature (HKS) and
the wave kernel signature (WKS). Laplacian-based descriptors achieve
state-of-the-art performance in numerous shape analysis tasks; they are
computationally efficient, isometry-invariant by construction, and can
gracefully cope with a variety of transformations. In this paper, we formulate
a generic family of parametric spectral descriptors. We argue that in order to
be optimal for a specific task, the descriptor should take into account the
statistics of the corpus of shapes to which it is applied (the "signal") and
those of the class of transformations to which it is made insensitive (the
"noise"). While such statistics are hard to model axiomatically, they can be
learned from examples. Following the spirit of the Wiener filter in signal
processing, we show a learning scheme for the construction of optimal spectral
descriptors and relate it to Mahalanobis metric learning. The superiority of
the proposed approach is demonstrated on the SHREC'10 benchmark.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2011 04:26:03 GMT"
}
] | 2011-10-25T00:00:00 |
[
[
"Bronstein",
"Alexander M.",
""
]
] |
new_dataset
| 0.969888 |
1109.6442
|
Ankit Chaudhary
|
Ankit Chaudhary, Jagdish L. Raheja
|
ABHIVYAKTI: A Vision Based Intelligent System for Elder and Sick Persons
|
Proceedings of 3rd IEEE International Conference on Machine Vision,
Hong Kong, ICMV 2010
(http://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=18047),
28-30 Dec, 2010, pp. 361-364
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes an intelligent system ABHIVYAKTI, which would be
pervasive in nature and based on the Computer Vision. It would be very easy in
use and deployment. Elder and sick people who are not able to talk or walk,
they are dependent on other human beings and need continuous monitoring, while
our system provides flexibility to the sick or elder person to announce his or
her need to their caretaker by just showing a particular gesture with the
developed system, if the caretaker is not nearby. This system will use
fingertip detection techniques for acquiring gesture and Artificial Neural
Networks (ANNs) will be used for gesture recognition.
|
[
{
"version": "v1",
"created": "Thu, 29 Sep 2011 08:59:29 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Oct 2011 08:32:23 GMT"
}
] | 2011-10-24T00:00:00 |
[
[
"Chaudhary",
"Ankit",
""
],
[
"Raheja",
"Jagdish L.",
""
]
] |
new_dataset
| 0.976026 |
1110.4671
|
EPTCS
|
John R. Cowles (University of Wyoming), Ruben Gamboa (University of
Wyoming)
|
Verifying Sierpi\'nski and Riesel Numbers in ACL2
|
In Proceedings ACL2 2011, arXiv:1110.4473
|
EPTCS 70, 2011, pp. 20-27
|
10.4204/EPTCS.70.2
| null |
cs.DM cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Sierpinski number is an odd positive integer, k, such that no positive
integer of the form k * 2^n + 1 is prime. Similar to a Sierpinski number, a
Riesel number is an odd positive integer, k, such that no positive integer of
the form k * 2^n + 1 is prime. A cover for such a k is a finite list of
positive integers such that each integer j of the appropriate form has a
factor, d, in the cover, with 1 < d < j. Given a k and its cover, ACL2 is used
to systematically verify that each integer of the given form has a non-trivial
factor in the cover.
|
[
{
"version": "v1",
"created": "Fri, 21 Oct 2011 00:45:23 GMT"
}
] | 2011-10-24T00:00:00 |
[
[
"Cowles",
"John R.",
"",
"University of Wyoming"
],
[
"Gamboa",
"Ruben",
"",
"University of\n Wyoming"
]
] |
new_dataset
| 0.999672 |
1110.4473
|
EPTCS
|
David Hardin (Rockwell Collins), Julien Schmaltz (Open University of
the Netherlands)
|
Proceedings 10th International Workshop on the ACL2 Theorem Prover and
its Applications
| null |
EPTCS 70, 2011
|
10.4204/EPTCS.70
| null |
cs.LO cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of ACL2 2011, the International Workshop
on the ACL2 Theorem Prover and its Applications. The workshop was held in
Austin, Texas, USA, on November 3-4 2011. ACL2 2011 is the tenth in a series of
workshops on the ACL2 Theorem Prover and its Applications. The workshop was
co-located with the eleventh Conference on Formal Methods in Computer Aided
Design (FMCAD'11). The ACL2 Workshop series provide a major technical forum for
researchers to present and discuss improvements and extensions to the theorem
prover, comparisons of ACL2 with other systems, and applications of ACL2 in
formal verification or formalized mathematics. Workshops have been held at
approxiamately 18 month intervals since 1999. ACL2 is the most recent
incarnation of the Boyer-Moore family of theorem provers, for which, Robert
Boyer, Matt Kaufmann and J Strother Moore received the 2005 ACM Software System
Award. It is state-of-the-art automated reasoning system that has been
successfully used in academia, government and industry for specification and
verification of computing systems. More details can be found in the proceedings
and on the workshop web page (www.cs.ru.nl/~julien/acl2-11/).
|
[
{
"version": "v1",
"created": "Thu, 20 Oct 2011 08:48:32 GMT"
}
] | 2011-10-21T00:00:00 |
[
[
"Hardin",
"David",
"",
"Rockwell Collins"
],
[
"Schmaltz",
"Julien",
"",
"Open University of\n the Netherlands"
]
] |
new_dataset
| 0.989619 |
1110.4136
|
Shuo Tan M.A.
|
Shuo Tan
|
The non-abelian squares are not context-free
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Answering a recent question of Crochemore, we prove that the language of
words that are not abelian squares is not context-free.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2011 22:18:45 GMT"
}
] | 2011-10-20T00:00:00 |
[
[
"Tan",
"Shuo",
""
]
] |
new_dataset
| 0.99896 |
1110.4159
|
EPTCS
|
Marco Carbone (IT University of Copenhagen), Davide Grohmann (IT
University of Copenhagen), Thomas T. Hildebrandt (IT University of
Copenhagen), Hugo A. L\'opez (IT University of Copenhagen)
|
A Logic for Choreographies
|
In Proceedings PLACES 2010, arXiv:1110.3853
|
EPTCS 69, 2011, pp. 29-43
|
10.4204/EPTCS.69.3
| null |
cs.PL cs.DC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore logical reasoning for the global calculus, a coordination model
based on the notion of choreography, with the aim to provide a methodology for
specification and verification of structured communications. Starting with an
extension of Hennessy-Milner logic, we present the global logic (GL), a modal
logic describing possible interactions among participants in a choreography. We
illustrate its use by giving examples of properties on service specifications.
Finally, we show that, despite GL is undecidable, there is a significant
decidable fragment which we provide with a sound and complete proof system for
checking validity of formulae.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2011 02:25:48 GMT"
}
] | 2011-10-20T00:00:00 |
[
[
"Carbone",
"Marco",
"",
"IT University of Copenhagen"
],
[
"Grohmann",
"Davide",
"",
"IT\n University of Copenhagen"
],
[
"Hildebrandt",
"Thomas T.",
"",
"IT University of\n Copenhagen"
],
[
"López",
"Hugo A.",
"",
"IT University of Copenhagen"
]
] |
new_dataset
| 0.99879 |
1110.4248
|
Luojie Xiang
|
Luojie Xiang
|
Ideogram Based Chinese Sentiment Word Orientation Computation
|
4 pages, 3 figures, accepted by CET 2011
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper presents a novel algorithm to compute sentiment orientation of
Chinese sentiment word. The algorithm uses ideograms which are a distinguishing
feature of Chinese language. The proposed algorithm can be applied to any
sentiment classification scheme. To compute a word's sentiment orientation
using the proposed algorithm, only the word itself and a precomputed character
ontology is required, rather than a corpus. The influence of three parameters
over the algorithm performance is analyzed and verified by experiment.
Experiment also shows that proposed algorithm achieves an F Measure of 85.02%
outperforming existing ideogram based algorithm.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2011 11:45:16 GMT"
}
] | 2011-10-20T00:00:00 |
[
[
"Xiang",
"Luojie",
""
]
] |
new_dataset
| 0.991941 |
1110.3844
|
Wazir Zada Khan
|
Wazir Zada Khan, Mohammed Y. Aalsalem and Yang Xiang
|
A Graphical Password Based System for Small Mobile Devices
|
10 Pages, 7 figures, 1 Table
|
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 5, No 2, 2011, 145-154
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Passwords provide security mechanism for authentication and protection
services against unwanted access to resources. A graphical based password is
one promising alternatives of textual passwords. According to human psychology,
humans are able to remember pictures easily. In this paper, we have proposed a
new hybrid graphical password based system, which is a combination of
recognition and recall based techniques that offers many advantages over the
existing systems and may be more convenient for the user. Our scheme is
resistant to shoulder surfing attack and many other attacks on graphical
passwords. This scheme is proposed for smart mobile devices (like smart phones
i.e. ipod, iphone, PDAs etc) which are more handy and convenient to use than
traditional desktop computer systems.
|
[
{
"version": "v1",
"created": "Mon, 17 Oct 2011 22:56:08 GMT"
}
] | 2011-10-19T00:00:00 |
[
[
"Khan",
"Wazir Zada",
""
],
[
"Aalsalem",
"Mohammed Y.",
""
],
[
"Xiang",
"Yang",
""
]
] |
new_dataset
| 0.998304 |
1110.3197
|
Zhang Shengli
|
Shengli Zhang, Soung-Chang Liew, Qingfeng Zhou, Lu Lu, Hui Wang
|
Non-memoryless Analog Network Coding in Two-Way Relay Channel
|
ICC 2011
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical-layer Network Coding (PNC) can significantly improve the throughput
of two-way relay channels. An interesting variant of PNC is Analog Network
Coding (ANC). Almost all ANC schemes proposed to date, however, operate in a
symbol by symbol manner (memoryless) and cannot exploit the redundant
information in channel-coded packets to enhance performance. This paper
proposes a non-memoryless ANC scheme. In particular, we design a soft-input
soft-output decoder for the relay node to process the superimposed packets from
the two end nodes to yield an estimated MMSE packet for forwarding back to the
end nodes. Our decoder takes into account the correlation among different
symbols in the packets due to channel coding, and provides significantly
improved MSE performance. Our analysis shows that the SNR improvement at the
relay node is lower bounded by 1/R (R is the code rate) with the simplest LDPC
code (repeat code). The SNR improvement is also verified by numerical
simulation with LDPC code. Our results indicate that LDPC codes of different
degrees are preferred in different SNR regions. Generally speaking, smaller
degrees are preferred for lower SNRs.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2011 13:10:39 GMT"
}
] | 2011-10-17T00:00:00 |
[
[
"Zhang",
"Shengli",
""
],
[
"Liew",
"Soung-Chang",
""
],
[
"Zhou",
"Qingfeng",
""
],
[
"Lu",
"Lu",
""
],
[
"Wang",
"Hui",
""
]
] |
new_dataset
| 0.999156 |
1110.2849
|
Karthick Jayaraman
|
Karthick Jayaraman, Vijay Ganesh, Mahesh Tripunitara, Martin C Rinard,
Steve J. Chapin
|
ARBAC Policy for a Large Multi-National Bank
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Administrative role-based access control (ARBAC) is the first comprehensive
administrative model proposed for role-based access control (RBAC). ARBAC has
several features for designing highly expressive policies, but current work has
not highlighted the utility of these expressive policies. In this report, we
present a case study of designing an ARBAC policy for a bank comprising 18
branches. Using this case study we provide an assessment about the features of
ARBAC that are likely to be used in realistic policies.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2011 07:13:11 GMT"
}
] | 2011-10-14T00:00:00 |
[
[
"Jayaraman",
"Karthick",
""
],
[
"Ganesh",
"Vijay",
""
],
[
"Tripunitara",
"Mahesh",
""
],
[
"Rinard",
"Martin C",
""
],
[
"Chapin",
"Steve J.",
""
]
] |
new_dataset
| 0.991992 |
1110.2646
|
Jose Texier
|
Jose Texier
|
Notas metodol\'ogicas para cubrir la etapa de documentar una
investigaci\'on
|
Trabajo final del curso.
http://sedici.unlp.edu.ar/search/request.php?id_document=ARG-UNLP-PAC-0000000043
| null | null | null |
cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
The search process of scientific articles (papers) and review articles
(reviews) is one of the pillars of the scientific world, and is performed by
people in the research as well as for people who want to keep abreast specific
topics. Scopus (there are other databases) or Google Scholar are proposed
options to find articles, but is recommended by Scopus its extensive database
and its versatility in the search options it offers. This paper proposes is a
plan that allows a systematic search and keep the items in an orderly,
consistent and coherent within own repository for cataloging and consultation,
which will serve for many tasks to establish the state of the art of a topic,
staff training in an area and/or writing articles, among others.
|
[
{
"version": "v1",
"created": "Wed, 12 Oct 2011 13:03:44 GMT"
}
] | 2011-10-13T00:00:00 |
[
[
"Texier",
"Jose",
""
]
] |
new_dataset
| 0.984664 |
1109.3989
|
J\"org P\"uhrer
|
Johannes Oetsch and J\"org P\"uhrer and Hans Tompits
|
The SeaLion has Landed: An IDE for Answer-Set Programming---Preliminary
Report
|
Proceedings of the 19th International Conference on Applications of
Declarative Programming and Knowledge Management (INAP 2011) and 25th
Workshop on Logic Programming (WLP 2011)
| null | null | null |
cs.PL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report about the current state and designated features of the tool
SeaLion, aimed to serve as an integrated development environment (IDE) for
answer-set programming (ASP). A main goal of SeaLion is to provide a
user-friendly environment for supporting a developer to write, evaluate, debug,
and test answer-set programs. To this end, new support techniques have to be
developed that suit the requirements of the answer-set semantics and meet the
constraints of practical applicability. In this respect, SeaLion benefits from
the research results of a project on methods and methodologies for answer-set
program development in whose context SeaLion is realised. Currently, the tool
provides source-code editors for the languages of Gringo and DLV that offer
syntax highlighting, syntax checking, and a visual program outline. Further
implemented features are support for external solvers and visualisation as well
as visual editing of answer sets. SeaLion comes as a plugin of the popular
Eclipse platform and provides itself interfaces for future extensions of the
IDE.
|
[
{
"version": "v1",
"created": "Mon, 19 Sep 2011 10:24:28 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Oct 2011 10:03:44 GMT"
}
] | 2011-10-12T00:00:00 |
[
[
"Oetsch",
"Johannes",
""
],
[
"Pührer",
"Jörg",
""
],
[
"Tompits",
"Hans",
""
]
] |
new_dataset
| 0.975858 |
1110.2215
|
R. J. Evans
|
R. J. Evans, C. Orasan
|
NP Animacy Identification for Anaphora Resolution
| null |
Journal Of Artificial Intelligence Research, Volume 29, pages
79-103, 2007
|
10.1613/jair.2179
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In anaphora resolution for English, animacy identification can play an
integral role in the application of agreement restrictions between pronouns and
candidates, and as a result, can improve the accuracy of anaphora resolution
systems. In this paper, two methods for animacy identification are proposed and
evaluated using intrinsic and extrinsic measures. The first method is a
rule-based one which uses information about the unique beginners in WordNet to
classify NPs on the basis of their animacy. The second method relies on a
machine learning algorithm which exploits a WordNet enriched with animacy
information for each sense. The effect of word sense disambiguation on the two
methods is also assessed. The intrinsic evaluation reveals that the machine
learning method reaches human levels of performance. The extrinsic evaluation
demonstrates that animacy identification can be beneficial in anaphora
resolution, especially in the cases where animate entities are identified with
high precision.
|
[
{
"version": "v1",
"created": "Mon, 10 Oct 2011 22:13:24 GMT"
}
] | 2011-10-12T00:00:00 |
[
[
"Evans",
"R. J.",
""
],
[
"Orasan",
"C.",
""
]
] |
new_dataset
| 0.996814 |
1110.2317
|
Ian Pratt-Hartmann
|
Ian Pratt-Hartmann
|
The Syllogistic with Unity
| null | null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We extend the language of the classical syllogisms with the sentence-forms
"At most 1 p is a q" and "More than 1 p is a q". We show that the resulting
logic does not admit a finite set of syllogism-like rules whose associated
derivation relation is sound and complete, even when reductio ad absurdum is
allowed.
|
[
{
"version": "v1",
"created": "Tue, 11 Oct 2011 10:10:21 GMT"
}
] | 2011-10-12T00:00:00 |
[
[
"Pratt-Hartmann",
"Ian",
""
]
] |
new_dataset
| 0.995095 |
1110.1767
|
Samira Mesmoudi Mrs
|
Samira Mesmoudi and Mohammed Feham
|
BSK-WBSN: Biometric Symmetric Keys to Secure Wireless Body Sensors
Networks
|
12 pages; International Journal of Network Security & Its
Applications (IJNSA), Vol.3, No.5, Sep 2011
| null |
10.5121/ijnsa.2011.3512
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Wireless Sensors Network (WSN) is an emergent technology resulting from
progress of various fields. Many applications of networks WSN are born. One of
the applications which have an operational effectiveness relates to the field
of health and allows a medical remote support. Miniature wireless sensors,
strategically placed on the human body, create a Wireless Body Sensor Network
(WBSN) which allows supervising various essential biological signals (rate of
heartbeat, pressure, etc). The sensitivity of medical information requires
mechanisms of safety. This performance constitutes a challenge for WBSN because
of their limitation in resources energy and data-processing. In this paper we
propose a new approach to symmetric cryptographic key establishment, based on
biometrics physiology. This approach takes into account WBSN constraints and
its topology.
|
[
{
"version": "v1",
"created": "Sat, 8 Oct 2011 21:02:32 GMT"
}
] | 2011-10-11T00:00:00 |
[
[
"Mesmoudi",
"Samira",
""
],
[
"Feham",
"Mohammed",
""
]
] |
new_dataset
| 0.999239 |
1110.1488
|
A S N Chakravarthy ASN CHAKRAVARTHY
|
A. S. N. Chakravarthy, Penmetsa V. Krishna Raja, P. S. Avadhani
|
Handwritten Text Image Authentication using Back Propagation
|
10 pages pdf file
|
International Journal of Network Security & Its Applications
(IJNSA), Vol.3, No.5, Sep 2011
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Authentication is the act of confirming the truth of an attribute of a datum
or entity. This might involve confirming the identity of a person, tracing the
origins of an artefact, ensuring that a product is what it's packaging and
labelling claims to be, or assuring that a computer program is a trusted one.
The authentication of information can pose special problems (especially
man-in-the-middle attacks), and is often wrapped up with authenticating
identity. Literary can involve imitating the style of a famous author. If an
original manuscript, typewritten text, or recording is available, then the
medium itself (or its packaging - anything from a box to e-mail headers) can
help prove or disprove the authenticity of the document. The use of digital
images of handwritten historical documents has become more popular in recent
years. Volunteers around the world now read thousands of these images as part
of their indexing process. Handwritten text images of old documents are
sometimes difficult to read or noisy due to the preservation of the document
and quality of the image [1]. Handwritten text offers challenges that are
rarely encountered in machine-printed text. In addition, most problems faced in
reading machine- printed text (e.g., character recognition, word segmentation,
letter segmentation, etc.) are more severe, in handwritten text. In this paper
we Here in this paper we proposed a method for authenticating hand written text
images using back propagation algorithm..
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2011 11:40:18 GMT"
}
] | 2011-10-10T00:00:00 |
[
[
"Chakravarthy",
"A. S. N.",
""
],
[
"Raja",
"Penmetsa V. Krishna",
""
],
[
"Avadhani",
"P. S.",
""
]
] |
new_dataset
| 0.972185 |
1110.1498
|
A S N Chakravarthy ASN CHAKRAVARTHY
|
Penmetsa V. Krishna Raja, A. S. N. Chakravarthy, P. S. Avadhani
|
A Cryptosystem Based on Hilbert Matrix using Cipher Block Chaining Mode
|
six pages; International Journal of Mathematics Trends and
Technology- July to Aug Issue 2011
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptography is the science of using mathematics to encrypt and decrypt data.
Cryptography enables you to store sensitive information or transmit it across
insecure networks so that it cannot be read by anyone except the intended
recipient. While cryptography is the science of securing data, cryptanalysis is
the science of analyzing and breaking secure communication. Classical
cryptanalysis involves an interesting combination of analytical reasoning,
application of mathematical tools and pattern finding. The objectives of the
proposed work are to propose a new cryptographic method based on the special
matrix called the Hilbert matrix for authentication and confidentiality and to
propose a model for confidentiality and authentication using a combination of
symmetric and public cryptosystems. Further, it is extended to shared key
cryptosystems with the concept of digital enveloping using a session key. In
the present work an algorithm for shared key encryption is developed using
Hilbert matrix cryptosystem. In this the block chaining modes of operation have
been used to tackle the issues of confusion and diffusion.
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2011 11:59:43 GMT"
}
] | 2011-10-10T00:00:00 |
[
[
"Raja",
"Penmetsa V. Krishna",
""
],
[
"Chakravarthy",
"A. S. N.",
""
],
[
"Avadhani",
"P. S.",
""
]
] |
new_dataset
| 0.996335 |
1110.1502
|
A S N Chakravarthy ASN CHAKRAVARTHY
|
Penmetsa V. Krishna Raja, A. S. N. Chakravarthy, P. S. Avadhani
|
Hilbert Matrix Based Cryptosystem using a Session Key
|
five pages
|
International Journal of Engineering Research and Applications
(IJERA) Vol. 1, Issue 3, 2011, pp.711-715
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptography protects users by providing functionality for the encryption of
data and authentication of other users. This technology lets the receiver of an
electronic message verify the sender, ensures that a message can be read only
by the intended person, and assures the recipient that a message has not be
altered in transit. Classical cryptanalysis involves an interesting combination
of analytical reasoning, application of mathematical tools and pattern finding.
The objectives of the proposed work are to propose a new cryptographic method
based on the special matrix called the Hilbert matrix for authentication and
confidentiality and to propose a model for confidentiality and authentication
using shared key cryptosystems with the concept of digital enveloping using a
session key. In the present work various algorithms are presented for
encryption and authentication based on Hilbert matrix using a session key.
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2011 12:04:05 GMT"
}
] | 2011-10-10T00:00:00 |
[
[
"Raja",
"Penmetsa V. Krishna",
""
],
[
"Chakravarthy",
"A. S. N.",
""
],
[
"Avadhani",
"P. S.",
""
]
] |
new_dataset
| 0.999378 |
1110.1513
|
Abdul Kadir
|
Abdul Kadir, Lukito Edi Nugroho, Adhi Susanto, Paulus Insap Santosa
|
Foliage Plant Retrieval using Polar Fourier Transform, Color Moments and
Vein Features
|
13 pages; Signal & Image Processing : An International Journal
(SIPIJ) Vol.2, No.3, September 2011
| null |
10.5121/sipij.2011.2301
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposed a method that combines Polar Fourier Transform, color
moments, and vein features to retrieve leaf images based on a leaf image. The
method is very useful to help people in recognizing foliage plants. Foliage
plants are plants that have various colors and unique patterns in the leaf.
Therefore, the colors and its patterns are information that should be counted
on in the processing of plant identification. To compare the performance of
retrieving system to other result, the experiments used Flavia dataset, which
is very popular in recognizing plants. The result shows that the method gave
better performance than PNN, SVM, and Fourier Transform. The method was also
tested using foliage plants with various colors. The accuracy was 90.80% for 50
kinds of plants.
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2011 13:00:03 GMT"
}
] | 2011-10-10T00:00:00 |
[
[
"Kadir",
"Abdul",
""
],
[
"Nugroho",
"Lukito Edi",
""
],
[
"Susanto",
"Adhi",
""
],
[
"Santosa",
"Paulus Insap",
""
]
] |
new_dataset
| 0.998497 |
1110.1563
|
Khaled Day
|
Khaled Day, Abderezak Touzene, Bassel Arafeh, Nasser Alzeidi
|
Parallel routing in Mobile Ad-Hoc Networks
|
18 pages, 13 figures, 6 tables
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.3, No.5, Sep 2011
|
10.5121/ijcnc.2011.3506
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes and evaluates a new position-based Parallel Routing
Protocol (PRP) for simultaneously routing multiple data packets over disjoint
paths in a mobile ad-hoc network (MANET) for higher reliability and reduced
communication delays. PRP views the geographical region where the MANET is
located as a virtual 2-dimensional grid of cells. Cell-disjoint (parallel)
paths between grid cells are constructed and used for building pre-computed
routing tables. A single gateway node in each grid cell handles routing through
that grid cell reducing routing overheads. Each node maintains updated
information about its own location in the virtual grid using GPS. Nodes also
keep track of the location of other nodes using a new proposed cell-based
broadcasting algorithm. Nodes exchange energy level information with neighbors
allowing energy-aware selection of the gateway nodes. Performance evaluation
results have been derived showing the attractiveness of the proposed parallel
routing protocol from different respects including low communication delays,
high packet delivery ratios, high routing path stability, and low routing
overheads.
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2011 15:16:07 GMT"
}
] | 2011-10-10T00:00:00 |
[
[
"Day",
"Khaled",
""
],
[
"Touzene",
"Abderezak",
""
],
[
"Arafeh",
"Bassel",
""
],
[
"Alzeidi",
"Nasser",
""
]
] |
new_dataset
| 0.965781 |
1110.1569
|
Yang Zhao
|
Yang Zhao and Neal Patwari
|
Robust Estimators for Variance-Based Device-Free Localization and
Tracking
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human motion in the vicinity of a wireless link causes variations in the link
received signal strength (RSS). Device-free localization (DFL) systems, such as
variance-based radio tomographic imaging (VRTI), use these RSS variations in a
static wireless network to detect, locate and track people in the area of the
network, even through walls. However, intrinsic motion, such as branches moving
in the wind and rotating or vibrating machinery, also causes RSS variations
which degrade the performance of a DFL system. In this paper, we propose and
evaluate two estimators to reduce the impact of the variations caused by
intrinsic motion. One estimator uses subspace decomposition, and the other
estimator uses a least squares formulation. Experimental results show that both
estimators reduce localization root mean squared error by about 40% compared to
VRTI. In addition, the Kalman filter tracking results from both estimators have
97% of errors less than 1.3 m, more than 60% improvement compared to tracking
results from VRTI.
|
[
{
"version": "v1",
"created": "Mon, 26 Sep 2011 17:21:57 GMT"
}
] | 2011-10-10T00:00:00 |
[
[
"Zhao",
"Yang",
""
],
[
"Patwari",
"Neal",
""
]
] |
new_dataset
| 0.98969 |
1110.1590
|
Chaiyut Jandaeng Chaiyut Jandaeng
|
C. Jandaeng, W. Suntiamontut, N. Elz
|
PSA: The Packet Scheduling Algorithm for Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main cause of wasted energy consumption in wireless sensor networks is
packet collision. The packet scheduling algorithm is therefore introduced to
solve this problem. Some packet scheduling algorithms can also influence and
delay the data transmitting in the real-time wireless sensor networks. This
paper presents the packet scheduling algorithm (PSA) in order to reduce the
packet congestion in MAC layer leading to reduce the overall of packet
collision in the system The PSA is compared with the simple CSMA/CA and other
approaches using network topology benchmarks in mathematical method. The
performances of our PSA are better than the standard (CSMA/CA). The PSA
produces better throughput than other algorithms. On other hand, the average
delay of PSA is higher than previous works. However, the PSA utilizes the
channel better than all algorithms.
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2011 17:19:47 GMT"
}
] | 2011-10-10T00:00:00 |
[
[
"Jandaeng",
"C.",
""
],
[
"Suntiamontut",
"W.",
""
],
[
"Elz",
"N.",
""
]
] |
new_dataset
| 0.999537 |
1110.1161
|
Petros Petrosyan
|
Petros A. Petrosyan
|
Interval edge-colorings of cubic graphs
|
3 pages
|
Proceedings of the CSIT Conference, Yerevan, 2011, pp. 86-88
| null | null |
cs.DM math.CO
|
http://creativecommons.org/licenses/by/3.0/
|
An edge-coloring of a multigraph G with colors 1,2,...,t is called an
interval t-coloring if all colors are used, and the colors of edges incident to
any vertex of G are distinct and form an interval of integers. In this paper we
prove that if G is a connected cubic multigraph (a connected cubic graph) that
admits an interval t-coloring, then t\leq |V(G)| +1 (t\leq |V(G)|), where V(G)
is the set of vertices of G. Moreover, if G is a connected cubic graph, G\neq
K_{4}, and G has an interval t-coloring, then t\leq |V(G)| -1. We also show
that these upper bounds are sharp. Finally, we prove that if G is a bipartite
subcubic multigraph, then G has an interval edge-coloring with no more than
four colors.
|
[
{
"version": "v1",
"created": "Thu, 6 Oct 2011 07:08:00 GMT"
}
] | 2011-10-07T00:00:00 |
[
[
"Petrosyan",
"Petros A.",
""
]
] |
new_dataset
| 0.997266 |
1110.1349
|
Fergal Reid
|
Derek Greene, Fergal Reid, Gavin Sheridan, Padraig Cunningham
|
Supporting the Curation of Twitter User Lists
|
8 pages, 5 figures
| null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Twitter introduced lists in late 2009 as a means of curating tweets into
meaningful themes. Lists were quickly adopted by media companies as a means of
organising content around news stories. Thus the curation of these lists is
important, they should contain the key information gatekeepers and present a
balanced perspective on the story. Identifying members to add to a list on an
emerging topic is a delicate process. From a network analysis perspective there
are a number of views on the Twitter network that can be explored, e.g.
followers, retweets mentions etc. We present a process for integrating these
views in order to recommend authoritative commentators to include on a list.
This process is evaluated on manually curated lists about unrest in Bahrain and
the Iowa caucuses for the 2012 US election.
|
[
{
"version": "v1",
"created": "Thu, 6 Oct 2011 18:47:49 GMT"
}
] | 2011-10-07T00:00:00 |
[
[
"Greene",
"Derek",
""
],
[
"Reid",
"Fergal",
""
],
[
"Sheridan",
"Gavin",
""
],
[
"Cunningham",
"Padraig",
""
]
] |
new_dataset
| 0.987278 |
1110.1052
|
Jesse Stern A
|
Jesse Stern
|
Spider Solitaire is NP-Complete
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This project investigates the potential of computers to solve complex tasks
such as games. The paper proves that the complexity of a generalized version of
spider solitaire is NP-Complete and uses much of structure of the proof that
FreeCell is NP-Hard in the paper Helmert, M. "Complexity Results for Standard
Benchmark Domains in Planning." Artificial Intelligence 143.2 (2003): 219-62.
Print. A given decision problem falls in to the class NP-Complete if it is
proven to be both in NP and in NP-Hard. To prove that this is the case the
paper shows that, not only do the kinds of possible moves that can be reversed
prove this, but it is also shown that no spider solitaire game of size n will
take more than a polynomial number of moves to complete if such a completion is
possible. The paper reduces 3-SAT to SpiderSolitaire (the name used throughout
the proof when referring to the generalized version of popular solitaire
variant "Spider Solitaire") by showing that any 3-SAT instance can be
replicated using an appropriately arranged initial tableau. The example
provided reinforces the proof of NP-Hardness and helps to make the proof easier
to understand, but the definitive proof lies in the equations providing
instruction on how to set up any 3-SAT instance of clause size C as a instance
of SpiderSolitaire.
|
[
{
"version": "v1",
"created": "Wed, 5 Oct 2011 17:32:00 GMT"
}
] | 2011-10-06T00:00:00 |
[
[
"Stern",
"Jesse",
""
]
] |
new_dataset
| 0.988619 |
1007.3568
|
Alexander Vardy
|
Hessam Mahdavifar and Alexander Vardy
|
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
|
16 pages, 5 figures, published in the IEEE Transactions on
Information Theory, vol. 57, no. 10, October 2011. arXiv admin note:
substantial text overlap with arXiv:1001.0210
|
IEEE Transactions on Information Theory, vol. 57, no. 10, October
2011
|
10.1109/TIT.2011.2162275
| null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose Alice wishes to send messages to Bob through a communication channel
C_1, but her transmissions also reach an eavesdropper Eve through another
channel C_2. The goal is to design a coding scheme that makes it possible for
Alice to communicate both reliably and securely. Reliability is measured in
terms of Bob's probability of error in recovering the message, while security
is measured in terms of the mutual information between the message and Eve's
observations. Wyner showed that the situation is characterized by a single
constant C_s, called the secrecy capacity, which has the following meaning: for
all $\epsilon > 0$, there exist coding schemes of rate $R \ge C_s - \epsilon$
that asymptotically achieve both the reliability and the security objectives.
However, his proof of this result is based upon a nonconstructive random-coding
argument. To date, despite a considerable research effort, the only case where
we know how to construct coding schemes that achieve secrecy capacity is when
Eve's channel C_2 is an erasure channel, or a combinatorial variation thereof.
Polar codes were recently invented by Arikan; they approach the capacity of
symmetric binary-input discrete memoryless channels with low encoding and
decoding complexity. Herein, we use polar codes to construct a coding scheme
that achieves the secrecy capacity of general wiretap channels. Our
construction works for any instantiation of the wiretap channel model, as
originally defined by Wyner, as long as both C_1 and C_2 are symmetric and
binary-input. Moreover, we show how to modify our construction in order to
achieve strong security, as defined by Maurer, while still operating at a rate
that approaches the secrecy capacity. In this case, we cannot guarantee that
the reliability condition will be satisfied unless the main channel C_1 is
noiseless, although we believe it can be always satisfied in practice.
|
[
{
"version": "v1",
"created": "Wed, 21 Jul 2010 06:49:42 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Sep 2011 04:01:18 GMT"
}
] | 2011-10-05T00:00:00 |
[
[
"Mahdavifar",
"Hessam",
""
],
[
"Vardy",
"Alexander",
""
]
] |
new_dataset
| 0.958949 |
1007.4106
|
Nicholas Loulloudes
|
Nicholas Loulloudes, George Pallis, Marios D. Dikaiakos
|
The Dynamics of Vehicular Networks in Urban Environments
|
Revised our testbed with even more realistic mobility traces. Used
the location of real Wi-Fi hotspots to simulate RSUs in our study. Used a
larger, real mobility trace set, from taxis in Shanghai. Examine the
implications of our findings in the design of VANET routing protocols by
implementing in ns-3 two routing protocols (GPCR & VADD). Updated the
bibliography section with new research works
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Vehicular Ad hoc NETworks (VANETs) have emerged as a platform to support
intelligent inter-vehicle communication and improve traffic safety and
performance. The road-constrained, high mobility of vehicles, their unbounded
power source, and the emergence of roadside wireless infrastructures make
VANETs a challenging research topic. A key to the development of protocols for
inter-vehicle communication and services lies in the knowledge of the
topological characteristics of the VANET communication graph. This paper
explores the dynamics of VANETs in urban environments and investigates the
impact of these findings in the design of VANET routing protocols. Using both
real and realistic mobility traces, we study the networking shape of VANETs
under different transmission and market penetration ranges. Given that a number
of RSUs have to be deployed for disseminating information to vehicles in an
urban area, we also study their impact on vehicular connectivity. Through
extensive simulations we investigate the performance of VANET routing protocols
by exploiting the knowledge of VANET graphs analysis.
|
[
{
"version": "v1",
"created": "Fri, 23 Jul 2010 11:25:54 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Oct 2011 07:05:47 GMT"
}
] | 2011-10-05T00:00:00 |
[
[
"Loulloudes",
"Nicholas",
""
],
[
"Pallis",
"George",
""
],
[
"Dikaiakos",
"Marios D.",
""
]
] |
new_dataset
| 0.984185 |
1110.0569
|
Ronald Caplan
|
R.M. Caplan and R. Carretero-Gonz\'alez
|
A Modulus-Squared Dirichlet Boundary Condition for Time-Dependent
Complex Partial Differential Equations and its Application to the Nonlinear
Schr\"odinger Equation
|
19 pages, 7 figures
| null | null | null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An easy to implement modulus-squared Dirichlet (MSD) boundary condition is
formulated for numerical simulations of time-dependent complex partial
differential equations in multidimensional settings. The MSD boundary condition
approximates a constant modulus-square value of the solution at the boundaries.
Application of the MSD boundary condition to the nonlinear Schr\"odinger
equation is shown, and numerical simulations are performed to demonstrate its
usefulness and advantages over other simple boundary conditions.
|
[
{
"version": "v1",
"created": "Tue, 4 Oct 2011 03:17:21 GMT"
}
] | 2011-10-05T00:00:00 |
[
[
"Caplan",
"R. M.",
""
],
[
"Carretero-González",
"R.",
""
]
] |
new_dataset
| 0.995125 |
1110.0578
|
Pavel Vasev
|
Pavel Vasev
|
Open Input: A New Way for Websites to Grow
|
4 pages, 1 figure
| null | null | null |
cs.HC cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Regardless of current web 2.0 and 3.0 trends, there are still a lot of
websites made in web 1.0 style. These websites have fixed pages which are
editable only by owner and not by community. It is normal for a lot of cases,
but looks like not modern and engaging approach. Are there any ways to make
these sites closer to life? This paper is devoted to open input technique, a
way for websites of web 1.0 era to grow and evolve community. The idea of open
input, in general, means that anybody from the web can add information to any
section of the website even without registration on that website. People can
add news, billboard announcements, testimonials, questions, pictures, videos
etc - whatever site owner permitted. We have tested this idea in practice and
have positive results approving that open input is a vital approach for
collaboration on the web.
|
[
{
"version": "v1",
"created": "Tue, 4 Oct 2011 04:50:00 GMT"
}
] | 2011-10-05T00:00:00 |
[
[
"Vasev",
"Pavel",
""
]
] |
new_dataset
| 0.963536 |
1110.0624
|
Agostino Dovier
|
Agostino Dovier and Andrea Formisano and Enrico Pontelli
|
Autonomous Agents Coordination: Action Languages meet CLP(FD) and Linda
| null | null | null | null |
cs.LO cs.AI cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a knowledge representation formalism, in the form of a
high-level Action Description Language for multi-agent systems, where
autonomous agents reason and act in a shared environment. Agents are
autonomously pursuing individual goals, but are capable of interacting through
a shared knowledge repository. In their interactions through shared portions of
the world, the agents deal with problems of synchronization and concurrency;
the action language allows the description of strategies to ensure a consistent
global execution of the agents' autonomously derived plans. A distributed
planning problem is formalized by providing the declarative specifications of
the portion of the problem pertaining a single agent. Each of these
specifications is executable by a stand-alone CLP-based planner. The
coordination among agents exploits a Linda infrastructure. The proposal is
validated in a prototype implementation developed in SICStus Prolog.
To appear in Theory and Practice of Logic Programming (TPLP).
|
[
{
"version": "v1",
"created": "Tue, 4 Oct 2011 09:55:41 GMT"
}
] | 2011-10-05T00:00:00 |
[
[
"Dovier",
"Agostino",
""
],
[
"Formisano",
"Andrea",
""
],
[
"Pontelli",
"Enrico",
""
]
] |
new_dataset
| 0.999239 |
cs/0406024
|
David Wood
|
Vida Dujmovic, Pat Morin, David R. Wood
|
Layout of Graphs with Bounded Tree-Width
|
This is a revised version of a journal paper submitted in October
2002. This paper incorporates the following conference papers: (1) Dujmovic',
Morin & Wood. Path-width and three-dimensional straight-line grid drawings of
graphs (GD'02), LNCS 2528:42-53, Springer, 2002. (2) Wood. Queue layouts,
tree-width, and three-dimensional graph drawing (FSTTCS'02), LNCS
2556:348--359, Springer, 2002. (3) Dujmovic' & Wood. Tree-partitions of
$k$-trees with applications in graph layout (WG '03), LNCS 2880:205-217, 2003
|
SIAM J. Computing 34.3:553-579, 2005
|
10.1137/S0097539702416141
| null |
cs.DM cs.CG
| null |
A \emph{queue layout} of a graph consists of a total order of the vertices,
and a partition of the edges into \emph{queues}, such that no two edges in the
same queue are nested. The minimum number of queues in a queue layout of a
graph is its \emph{queue-number}. A \emph{three-dimensional (straight-line
grid) drawing} of a graph represents the vertices by points in $\mathbb{Z}^3$
and the edges by non-crossing line-segments. This paper contributes three main
results:
(1) It is proved that the minimum volume of a certain type of
three-dimensional drawing of a graph $G$ is closely related to the queue-number
of $G$. In particular, if $G$ is an $n$-vertex member of a proper minor-closed
family of graphs (such as a planar graph), then $G$ has a $O(1)\times
O(1)\times O(n)$ drawing if and only if $G$ has O(1) queue-number.
(2) It is proved that queue-number is bounded by tree-width, thus resolving
an open problem due to Ganley and Heath (2001), and disproving a conjecture of
Pemmaraju (1992). This result provides renewed hope for the positive resolution
of a number of open problems in the theory of queue layouts.
(3) It is proved that graphs of bounded tree-width have three-dimensional
drawings with O(n) volume. This is the most general family of graphs known to
admit three-dimensional drawings with O(n) volume.
The proofs depend upon our results regarding \emph{track layouts} and
\emph{tree-partitions} of graphs, which may be of independent interest.
|
[
{
"version": "v1",
"created": "Wed, 16 Jun 2004 15:29:07 GMT"
}
] | 2011-10-05T00:00:00 |
[
[
"Dujmovic",
"Vida",
""
],
[
"Morin",
"Pat",
""
],
[
"Wood",
"David R.",
""
]
] |
new_dataset
| 0.996837 |
1106.6254
|
Menelaos Karavelas
|
Menelaos I. Karavelas and Eleni Tzanaki
|
The maximum number of faces of the Minkowski sum of two convex polytopes
|
37 pages, 8 figures, conference version to appear at SODA 2012; v2:
fixed typos, made stylistic changes, added figures
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We derive tight expressions for the maximum number of $k$-faces,
$0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two
$d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number
of vertices of the polytopes.
For even dimensions $d\ge{}2$, the maximum values are attained when $P_1$ and
$P_2$ are cyclic $d$-polytopes with disjoint vertex sets. For odd dimensions
$d\ge{}3$, the maximum values are attained when $P_1$ and $P_2$ are
$\lfloor\frac{d}{2}\rfloor$-neighborly $d$-polytopes, whose vertex sets are
chosen appropriately from two distinct $d$-dimensional moment-like curves.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 14:59:45 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Oct 2011 08:33:52 GMT"
}
] | 2011-10-04T00:00:00 |
[
[
"Karavelas",
"Menelaos I.",
""
],
[
"Tzanaki",
"Eleni",
""
]
] |
new_dataset
| 0.985515 |
cs/0009023
|
Alex Brodsky
|
Alex Brodsky, Stephane Durocher, Ellen Gethner
|
The Rectilinear Crossing Number of K_10 is 62
|
17 Pages, colour figures
|
Electronic Journal of Combinatorics. 8(1):R23 1-30. 2001
| null | null |
cs.DM math.CO
| null |
A drawing of a graph G in the plane is said to be a rectilinear drawing of G
if the edges are required to be line segments (as opposed to Jordan curves). We
assume no three vertices are collinear. The rectilinear crossing number of G is
the fewest number of edge crossings attainable over all rectilinear drawings of
G. Thanks to Richard Guy, exact values of the rectilinear crossing number of
K_n, the complete graph on n vertices, for n = 3,...,9, are known (Guy 1972,
White and Beinke 1978, Finch 2000, Sloanes A014540). Since 1971, thanks to the
work of David Singer (1971, Gardiner 1986), the rectilinear crossing number of
K_10 has been known to be either 61 or 62, a deceptively innocent and
tantalizing statement. The difficulty of determining the correct value is
evidenced by the fact that Singer's result has withstood the test of time. In
this paper we use a purely combinatorial argument to show that the rectilinear
crossing number of K_10 is 62. Moreover, using this result, we improve an
asymptotic lower bound for a related problem. Finally, we close with some new
and old open questions that were provoked, in part, by the results of this
paper, and by the tangled history of the problem itself.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2000 19:16:48 GMT"
}
] | 2011-10-04T00:00:00 |
[
[
"Brodsky",
"Alex",
""
],
[
"Durocher",
"Stephane",
""
],
[
"Gethner",
"Ellen",
""
]
] |
new_dataset
| 0.96899 |
1109.6646
|
Abbas Kiani
|
Abbas Kiani, Soroush Akhlaghi
|
A Non-MDS Erasure Code Scheme For Storage Applications
|
6 pages, 2 figures
| null | null | null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the use of redundancy and self repairing against node
failures in distributed storage systems, using various strategies. In
replication method, access to one replication node is sufficient to reconstruct
a lost node, while in MDS erasure coded systems which are optimal in terms of
redundancy-reliability tradeoff, a single node failure is repaired after
recovering the entire stored data. Moreover, regenerating codes yield a
tradeoff curve between storage capacity and repair bandwidth. The current paper
aims at investigating a new storage code. Specifically, we propose a non-MDS
(2k, k) code that tolerates any three node failures and more importantly, it is
shown using our code a single node failure can be repaired through access to
only three nodes.
|
[
{
"version": "v1",
"created": "Wed, 21 Sep 2011 08:02:18 GMT"
}
] | 2011-10-03T00:00:00 |
[
[
"Kiani",
"Abbas",
""
],
[
"Akhlaghi",
"Soroush",
""
]
] |
new_dataset
| 0.962409 |
1109.6714
|
Nan Zhao
|
Nan Zhao
|
A Novel Two-stage Entropy-based Robust Cooperative Spectrum Sensing
Scheme with Two-bit Decision in Cognitive Radio
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum sensing is a key problem in cognitive radio. However, traditional
detectors become ineffective when noise uncertainty is severe. It is shown that
the entropy of Gauss white noise is constant in the frequency domain, and a
robust detector based on the entropy of spectrum amplitude was proposed. In
this paper a novel detector is proposed based on the entropy of spectrum power
density, and its performance is better than the previous scheme with less
computational complexity. Furthermore, to improve the reliability of the
detection, a two-stage entropy-based cooperative spectrum sensing scheme using
two-bit decision is proposed, and simulation results show its superior
performance with relatively low computational complexity.
|
[
{
"version": "v1",
"created": "Fri, 30 Sep 2011 04:48:37 GMT"
}
] | 2011-10-03T00:00:00 |
[
[
"Zhao",
"Nan",
""
]
] |
new_dataset
| 0.972931 |
1109.6838
|
Sarvesh Nikumbh
|
Sarvesh Nikumbh, Joeprakash Nathaman and Rahul Vartak
|
Distributed Air Traffic Control : A Human Safety Perspective
|
Extended Abstract, 3 pages, Accepted at IBM Collaborative Academia
Research Exchange (I-CARE)-2011, uses ACM-Proceeding style file
| null | null | null |
cs.MA cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The issues in air traffic control have so far been addressed with the intent
to improve resource utilization and achieve an optimized solution with respect
to fuel comsumption of aircrafts, efficient usage of the available airspace
with minimal congestion related losses under various dynamic constraints. So
the focus has almost always been more on smarter management of traffic to
increase profits while human safety, though achieved in the process, we
believe, has remained less seriously attended. This has become all the more
important given that we have overburdened and overstressed air traffic
controllers managing hundreds of airports and thousands of aircrafts per day.
We propose a multiagent system based distributed approach to handle air
traffic ensuring complete human (passenger) safety without removing any humans
(ground controllers) from the loop thereby also retaining the earlier
advantages in the new solution. The detailed design of the agent system, which
will be easily interfacable with the existing environment, is described. Based
on our initial findings from simulations, we strongly believe the system to be
capable of handling the nuances involved, to be extendable and customizable at
any later point in time.
|
[
{
"version": "v1",
"created": "Fri, 30 Sep 2011 14:42:14 GMT"
}
] | 2011-10-03T00:00:00 |
[
[
"Nikumbh",
"Sarvesh",
""
],
[
"Nathaman",
"Joeprakash",
""
],
[
"Vartak",
"Rahul",
""
]
] |
new_dataset
| 0.998654 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.